| blob | e57a5bd680281800c2e920e87723fd66641c37f8 |
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
2133 static enum tree_code cp_parser_ptr_operator
2135 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2137 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2139 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2141 static tree cp_parser_late_return_type_opt
2143 static tree cp_parser_declarator_id
2145 static tree cp_parser_type_id
2147 static tree cp_parser_template_type_arg
2150 static tree cp_parser_type_id_1
2152 static void cp_parser_type_specifier_seq
2154 static tree cp_parser_parameter_declaration_clause
2156 static tree cp_parser_parameter_declaration_list
2160 static tree cp_parser_default_argument
2162 static void cp_parser_function_body
2164 static tree cp_parser_initializer
2166 static tree cp_parser_initializer_clause
2168 static tree cp_parser_braced_list
2173 static bool cp_parser_ctor_initializer_opt_and_function_body
2176 static tree cp_parser_late_parsing_omp_declare_simd
2179 static tree cp_parser_late_parsing_cilk_simd_fn_info
2182 static tree synthesize_implicit_template_parm
2184 static tree finish_fully_implicit_template
2187 /* Classes [gram.class] */
2189 static tree cp_parser_class_name
2191 static tree cp_parser_class_specifier
2193 static tree cp_parser_class_head
2195 static enum tag_types cp_parser_class_key
2197 static void cp_parser_type_parameter_key
2199 static void cp_parser_member_specification_opt
2201 static void cp_parser_member_declaration
2203 static tree cp_parser_pure_specifier
2205 static tree cp_parser_constant_initializer
2208 /* Derived classes [gram.class.derived] */
2210 static tree cp_parser_base_clause
2212 static tree cp_parser_base_specifier
2215 /* Special member functions [gram.special] */
2217 static tree cp_parser_conversion_function_id
2219 static tree cp_parser_conversion_type_id
2223 static bool cp_parser_ctor_initializer_opt
2225 static void cp_parser_mem_initializer_list
2227 static tree cp_parser_mem_initializer
2229 static tree cp_parser_mem_initializer_id
2232 /* Overloading [gram.over] */
2234 static tree cp_parser_operator_function_id
2236 static tree cp_parser_operator
2239 /* Templates [gram.temp] */
2241 static void cp_parser_template_declaration
2243 static tree cp_parser_template_parameter_list
2245 static tree cp_parser_template_parameter
2247 static tree cp_parser_type_parameter
2249 static tree cp_parser_template_id
2251 static tree cp_parser_template_name
2253 static tree cp_parser_template_argument_list
2255 static tree cp_parser_template_argument
2257 static void cp_parser_explicit_instantiation
2259 static void cp_parser_explicit_specialization
2262 /* Exception handling [gram.exception] */
2264 static tree cp_parser_try_block
2266 static bool cp_parser_function_try_block
2268 static void cp_parser_handler_seq
2270 static void cp_parser_handler
2272 static tree cp_parser_exception_declaration
2274 static tree cp_parser_throw_expression
2276 static tree cp_parser_exception_specification_opt
2278 static tree cp_parser_type_id_list
2281 /* GNU Extensions */
2283 static tree cp_parser_asm_specification_opt
2285 static tree cp_parser_asm_operand_list
2287 static tree cp_parser_asm_clobber_list
2289 static tree cp_parser_asm_label_list
2291 static bool cp_next_tokens_can_be_attribute_p
2293 static bool cp_next_tokens_can_be_gnu_attribute_p
2295 static bool cp_next_tokens_can_be_std_attribute_p
2297 static bool cp_nth_tokens_can_be_std_attribute_p
2299 static bool cp_nth_tokens_can_be_gnu_attribute_p
2301 static bool cp_nth_tokens_can_be_attribute_p
2303 static tree cp_parser_attributes_opt
2305 static tree cp_parser_gnu_attributes_opt
2307 static tree cp_parser_gnu_attribute_list
2309 static tree cp_parser_std_attribute
2311 static tree cp_parser_std_attribute_spec
2313 static tree cp_parser_std_attribute_spec_seq
2315 static bool cp_parser_extension_opt
2317 static void cp_parser_label_declaration
2320 /* Transactional Memory Extensions */
2322 static tree cp_parser_transaction
2324 static tree cp_parser_transaction_expression
2326 static bool cp_parser_function_transaction
2328 static tree cp_parser_transaction_cancel
2332 pragma_external,
2333 pragma_member,
2334 pragma_objc_icode,
2335 pragma_stmt,
2336 pragma_compound
2337 };
2338 static bool cp_parser_pragma
2341 /* Objective-C++ Productions */
2343 static tree cp_parser_objc_message_receiver
2345 static tree cp_parser_objc_message_args
2347 static tree cp_parser_objc_message_expression
2349 static tree cp_parser_objc_encode_expression
2351 static tree cp_parser_objc_defs_expression
2353 static tree cp_parser_objc_protocol_expression
2355 static tree cp_parser_objc_selector_expression
2357 static tree cp_parser_objc_expression
2359 static bool cp_parser_objc_selector_p
2361 static tree cp_parser_objc_selector
2363 static tree cp_parser_objc_protocol_refs_opt
2365 static void cp_parser_objc_declaration
2367 static tree cp_parser_objc_statement
2369 static bool cp_parser_objc_valid_prefix_attributes
2371 static void cp_parser_objc_at_property_declaration
2373 static void cp_parser_objc_at_synthesize_declaration
2375 static void cp_parser_objc_at_dynamic_declaration
2377 static tree cp_parser_objc_struct_declaration
2380 /* Utility Routines */
2382 static tree cp_parser_lookup_name
2384 static tree cp_parser_lookup_name_simple
2386 static tree cp_parser_maybe_treat_template_as_class
2388 static bool cp_parser_check_declarator_template_parameters
2390 static bool cp_parser_check_template_parameters
2392 static tree cp_parser_simple_cast_expression
2394 static tree cp_parser_global_scope_opt
2396 static bool cp_parser_constructor_declarator_p
2398 static tree cp_parser_function_definition_from_specifiers_and_declarator
2400 static tree cp_parser_function_definition_after_declarator
2402 static void cp_parser_template_declaration_after_export
2404 static void cp_parser_perform_template_parameter_access_checks
2406 static tree cp_parser_single_declaration
2408 static tree cp_parser_functional_cast
2410 static tree cp_parser_save_member_function_body
2412 static tree cp_parser_save_nsdmi
2414 static tree cp_parser_enclosed_template_argument_list
2416 static void cp_parser_save_default_args
2418 static void cp_parser_late_parsing_for_member
2420 static tree cp_parser_late_parse_one_default_arg
2422 static void cp_parser_late_parsing_nsdmi
2424 static void cp_parser_late_parsing_default_args
2426 static tree cp_parser_sizeof_operand
2428 static tree cp_parser_trait_expr
2430 static bool cp_parser_declares_only_class_p
2432 static void cp_parser_set_storage_class
2434 static void cp_parser_set_decl_spec_type
2436 static void set_and_check_decl_spec_loc
2439 static bool cp_parser_friend_p
2441 static void cp_parser_required_error
2447 static bool cp_parser_token_starts_function_definition_p
2449 static bool cp_parser_next_token_starts_class_definition_p
2451 static bool cp_parser_next_token_ends_template_argument_p
2453 static bool cp_parser_nth_token_starts_template_argument_list_p
2455 static enum tag_types cp_parser_token_is_class_key
2457 static enum tag_types cp_parser_token_is_type_parameter_key
2459 static void cp_parser_check_class_key
2461 static void cp_parser_check_access_in_redeclaration
2463 static bool cp_parser_optional_template_keyword
2465 static void cp_parser_pre_parsed_nested_name_specifier
2467 static bool cp_parser_cache_group
2469 static tree cp_parser_cache_defarg
2471 static void cp_parser_parse_tentatively
2473 static void cp_parser_commit_to_tentative_parse
2475 static void cp_parser_commit_to_topmost_tentative_parse
2477 static void cp_parser_abort_tentative_parse
2479 static bool cp_parser_parse_definitely
2483 static bool cp_parser_uncommitted_to_tentative_parse_p
2485 static void cp_parser_error
2487 static void cp_parser_name_lookup_error
2489 static bool cp_parser_simulate_error
2491 static bool cp_parser_check_type_definition
2493 static void cp_parser_check_for_definition_in_return_type
2495 static void cp_parser_check_for_invalid_template_id
2497 static bool cp_parser_non_integral_constant_expression
2499 static void cp_parser_diagnose_invalid_type_name
2501 static bool cp_parser_parse_and_diagnose_invalid_type_name
2503 static int cp_parser_skip_to_closing_parenthesis
2505 static void cp_parser_skip_to_end_of_statement
2507 static void cp_parser_consume_semicolon_at_end_of_statement
2509 static void cp_parser_skip_to_end_of_block_or_statement
2511 static bool cp_parser_skip_to_closing_brace
2513 static void cp_parser_skip_to_end_of_template_parameter_list
2515 static void cp_parser_skip_to_pragma_eol
2517 static bool cp_parser_error_occurred
2519 static bool cp_parser_allow_gnu_extensions_p
2521 static bool cp_parser_is_pure_string_literal
2523 static bool cp_parser_is_string_literal
2525 static bool cp_parser_is_keyword
2527 static tree cp_parser_make_typename_type
2531 static bool cp_parser_compound_literal_p
2533 static bool cp_parser_array_designator_p
2535 static bool cp_parser_skip_to_closing_square_bracket
2538 /* Returns nonzero if we are parsing tentatively. */
2542 {
2544 }
2546 /* Returns nonzero if TOKEN is a string literal. */
2548 static bool
2550 {
2556 }
2558 /* Returns nonzero if TOKEN is a string literal
2559 of a user-defined string literal. */
2561 static bool
2563 {
2570 }
2572 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2574 static bool
2576 {
2578 }
2580 /* If not parsing tentatively, issue a diagnostic of the form
2581 FILE:LINE: MESSAGE before TOKEN
2582 where TOKEN is the next token in the input stream. MESSAGE
2583 (specified by the caller) is usually of the form "expected
2584 OTHER-TOKEN". */
2586 static void
2588 {
2590 {
2592 /* This diagnostic makes more sense if it is tagged to the line
2593 of the token we just peeked at. */
2597 {
2602 }
2605 /* Because c_parser_error does not understand
2606 CPP_KEYWORD, keywords are treated like
2607 identifiers. */
2610 }
2611 }
2613 /* Issue an error about name-lookup failing. NAME is the
2614 IDENTIFIER_NODE DECL is the result of
2615 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2616 the thing that we hoped to find. */
2618 static void
2620 tree name,
2621 tree decl,
2622 name_lookup_error desired,
2623 location_t location)
2624 {
2625 /* If name lookup completely failed, tell the user that NAME was not
2626 declared. */
2628 {
2641 else
2643 }
2645 {
2647 {
2664 }
2665 }
2667 {
2669 {
2679 name);
2683 }
2684 }
2685 else
2686 {
2688 {
2701 }
2702 }
2703 }
2705 /* If we are parsing tentatively, remember that an error has occurred
2706 during this tentative parse. Returns true if the error was
2707 simulated; false if a message should be issued by the caller. */
2709 static bool
2711 {
2713 {
2716 }
2718 }
2720 /* This function is called when a type is defined. If type
2721 definitions are forbidden at this point, an error message is
2722 issued. */
2724 static bool
2726 {
2727 /* If types are forbidden here, issue a message. */
2729 {
2730 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2731 in the message need to be interpreted. */
2734 }
2736 }
2738 /* This function is called when the DECLARATOR is processed. The TYPE
2739 was a type defined in the decl-specifiers. If it is invalid to
2740 define a type in the decl-specifiers for DECLARATOR, an error is
2741 issued. TYPE_LOCATION is the location of TYPE and is used
2742 for error reporting. */
2744 static void
2747 {
2748 /* [dcl.fct] forbids type definitions in return types.
2749 Unfortunately, it's not easy to know whether or not we are
2750 processing a return type until after the fact. */
2758 {
2763 type);
2764 }
2765 }
2767 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2768 "<" in any valid C++ program. If the next token is indeed "<",
2769 issue a message warning the user about what appears to be an
2770 invalid attempt to form a template-id. LOCATION is the location
2771 of the type-specifier (TYPE) */
2773 static void
2775 tree type,
2777 location_t location)
2778 {
2782 {
2786 {
2789 else
2791 }
2792 else
2794 /* Remember the location of the invalid "<". */
2797 /* Consume the "<". */
2799 /* Parse the template arguments. */
2801 /* Permanently remove the invalid template arguments so that
2802 this error message is not issued again. */
2805 }
2806 }
2808 /* If parsing an integral constant-expression, issue an error message
2809 about the fact that THING appeared and return true. Otherwise,
2810 return false. In either case, set
2811 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2813 static bool
2815 non_integral_constant thing)
2816 {
2819 {
2821 {
2824 {
2831 "enumeration type cannot appear in a "
2922 }
2926 }
2927 }
2929 }
2931 /* Emit a diagnostic for an invalid type name. This function commits
2932 to the current active tentative parse, if any. (Otherwise, the
2933 problematic construct might be encountered again later, resulting
2934 in duplicate error messages.) LOCATION is the location of ID. */
2936 static void
2938 location_t location)
2939 {
2942 /* Try to lookup the identifier. */
2949 /* If the lookup was ambiguous, an error will already have
2950 been issued. */
2952 /* If the lookup found a template-name, it means that the user forgot
2953 to specify an argument list. Emit a useful error message. */
2957 decl);
2961 /* Something like 'unsigned A a;' */
2964 {
2965 /* Issue an error message. */
2967 /* If we're in a template class, it's possible that the user was
2968 referring to a type from a base class. For example:
2970 template <typename T> struct A { typedef T X; };
2971 template <typename T> struct B : public A<T> { X x; };
2973 The user should have said "typename A<T>::X". */
2987 {
2988 tree b;
2991 b;
2993 {
2997 {
2998 tree field;
2999 /* Go from a particular instantiation of the
3000 template (which will have an empty TYPE_FIELDs),
3001 to the main version. */
3004 field;
3008 {
3013 }
3016 }
3017 }
3018 }
3019 }
3020 /* Here we diagnose qualified-ids where the scope is actually correct,
3021 but the identifier does not resolve to a valid type name. */
3023 {
3025 {
3030 else
3034 }
3037 {
3038 /* A<T>::A<T>() */
3044 }
3051 {
3056 else
3060 }
3061 else
3063 }
3064 }
3066 /* Check for a common situation where a type-name should be present,
3067 but is not, and issue a sensible error message. Returns true if an
3068 invalid type-name was detected.
3070 The situation handled by this function are variable declarations of the
3071 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3072 Usually, `ID' should name a type, but if we got here it means that it
3073 does not. We try to emit the best possible error message depending on
3074 how exactly the id-expression looks like. */
3076 static bool
3078 {
3079 tree id;
3082 /* Avoid duplicate error about ambiguous lookup. */
3084 {
3088 }
3097 /* If the next token is a (, this is a function with no explicit return
3098 type, i.e. constructor, destructor or conversion op. */
3101 {
3104 }
3108 /* Emit a diagnostic for the invalid type. */
3110 out:
3111 /* If we aren't in the middle of a declarator (i.e. in a
3112 parameter-declaration-clause), skip to the end of the declaration;
3113 there's no point in trying to process it. */
3117 }
3119 /* Consume tokens up to, and including, the next non-nested closing `)'.
3120 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3121 are doing error recovery. Returns -1 if OR_COMMA is true and we
3122 found an unnested comma. */
3124 static int
3129 {
3139 {
3143 {
3146 /* If we've run out of tokens, then there is no closing `)'. */
3149 /* This is good for lambda expression capture-lists. */
3159 /* This matches the processing in skip_to_end_of_statement. */
3185 {
3189 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* Consume tokens until we reach the end of the current statement.
3202 Normally, that will be just before consuming a `;'. However, if a
3203 non-nested `}' comes first, then we stop before consuming that. */
3205 static void
3207 {
3210 /* Unwind generic function template scope if necessary. */
3215 {
3219 {
3222 /* If we've run out of tokens, stop. */
3226 /* If the next token is a `;', we have reached the end of the
3227 statement. */
3233 /* If this is a non-nested '}', stop before consuming it.
3234 That way, when confronted with something like:
3236 { 3 + }
3238 we stop before consuming the closing '}', even though we
3239 have not yet reached a `;'. */
3243 /* If it is the closing '}' for a block that we have
3244 scanned, stop -- but only after consuming the token.
3245 That way given:
3247 void f g () { ... }
3248 typedef int I;
3250 we will stop after the body of the erroneously declared
3251 function, but before consuming the following `typedef'
3252 declaration. */
3254 {
3257 }
3265 }
3267 /* Consume the token. */
3269 }
3270 }
3272 /* This function is called at the end of a statement or declaration.
3273 If the next token is a semicolon, it is consumed; otherwise, error
3274 recovery is attempted. */
3276 static void
3278 {
3279 /* Look for the trailing `;'. */
3281 {
3282 /* If there is additional (erroneous) input, skip to the end of
3283 the statement. */
3285 /* If the next token is now a `;', consume it. */
3288 }
3289 }
3291 /* Skip tokens until we have consumed an entire block, or until we
3292 have consumed a non-nested `;'. */
3294 static void
3296 {
3299 /* Unwind generic function template scope if necessary. */
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* Stop if this is an unnested ';'. */
3321 /* Stop if this is an unnested '}', or closes the outermost
3322 nesting level. */
3323 nesting_depth--;
3331 /* Nest. */
3332 nesting_depth++;
3337 }
3339 /* Consume the token. */
3341 }
3342 }
3344 /* Skip tokens until a non-nested closing curly brace is the next
3345 token, or there are no more tokens. Return true in the first case,
3346 false otherwise. */
3348 static bool
3350 {
3354 {
3358 {
3361 /* If we've run out of tokens, stop. */
3365 /* If the next token is a non-nested `}', then we have reached
3366 the end of the current block. */
3372 /* If it the next token is a `{', then we are entering a new
3373 block. Consume the entire block. */
3379 }
3381 /* Consume the token. */
3383 }
3384 }
3386 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3387 parameter is the PRAGMA token, allowing us to purge the entire pragma
3388 sequence. */
3390 static void
3392 {
3397 do
3401 /* Ensure that the pragma is not parsed again. */
3403 }
3405 /* Require pragma end of line, resyncing with it as necessary. The
3406 arguments are as for cp_parser_skip_to_pragma_eol. */
3408 static void
3410 {
3414 }
3416 /* This is a simple wrapper around make_typename_type. When the id is
3417 an unresolved identifier node, we can provide a superior diagnostic
3418 using cp_parser_diagnose_invalid_type_name. */
3420 static tree
3422 location_t id_location)
3423 {
3424 tree result;
3426 {
3432 }
3434 }
3436 /* This is a wrapper around the
3437 make_{pointer,ptrmem,reference}_declarator functions that decides
3438 which one to call based on the CODE and CLASS_TYPE arguments. The
3439 CODE argument should be one of the values returned by
3440 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3441 appertain to the pointer or reference. */
3445 cp_cv_quals cv_qualifiers,
3447 tree attributes)
3448 {
3455 else
3465 }
3467 /* Create a new C++ parser. */
3471 {
3476 /* cp_lexer_new_main is called before doing GC allocation because
3477 cp_lexer_new_main might load a PCH file. */
3480 /* Initialize the binops_by_token so that we can get the tree
3481 directly from the token. */
3489 /* For now, we always accept GNU extensions. */
3492 /* The `>' token is a greater-than operator, not the end of a
3493 template-id. */
3498 /* We are not parsing a constant-expression. */
3503 /* Local variable names are not forbidden. */
3506 /* We are not processing an `extern "C"' declaration. */
3509 /* We are not processing a declarator. */
3512 /* We are not processing a template-argument-list. */
3515 /* We are not in an iteration statement. */
3518 /* We are not in a switch statement. */
3521 /* We are not parsing a type-id inside an expression. */
3524 /* Declarations aren't implicitly extern "C". */
3527 /* String literals should be translated to the execution character set. */
3530 /* We are not parsing a function body. */
3533 /* We can correct until told otherwise. */
3536 /* The unparsed function queue is empty. */
3539 /* There are no classes being defined. */
3542 /* No template parameters apply. */
3545 /* Not declaring an implicit function template. */
3552 }
3554 /* Create a cp_lexer structure which will emit the tokens in CACHE
3555 and push it onto the parser's lexer stack. This is used for delayed
3556 parsing of in-class method bodies and default arguments, and should
3557 not be confused with tentative parsing. */
3558 static void
3560 {
3565 /* Move the current source position to that of the first token in the
3566 new lexer. */
3568 }
3570 /* Pop the top lexer off the parser stack. This is never used for the
3571 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3572 static void
3574 {
3579 /* Put the current source position back where it was before this
3580 lexer was pushed. */
3582 }
3584 /* Lexical conventions [gram.lex] */
3586 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3587 identifier. */
3589 static tree
3591 {
3594 /* Look for the identifier. */
3596 /* Return the value. */
3598 }
3600 /* Parse a sequence of adjacent string constants. Returns a
3601 TREE_STRING representing the combined, nul-terminated string
3602 constant. If TRANSLATE is true, translate the string to the
3603 execution character set. If WIDE_OK is true, a wide string is
3604 invalid here.
3606 C++98 [lex.string] says that if a narrow string literal token is
3607 adjacent to a wide string literal token, the behavior is undefined.
3608 However, C99 6.4.5p4 says that this results in a wide string literal.
3609 We follow C99 here, for consistency with the C front end.
3611 This code is largely lifted from lex_string() in c-lex.c.
3613 FUTURE: ObjC++ will need to handle @-strings here. */
3614 static tree
3617 {
3618 tree value;
3625 tree string_tree;
3631 {
3634 }
3637 {
3641 }
3642 else
3643 {
3646 }
3649 /* Try to avoid the overhead of creating and destroying an obstack
3650 for the common case of just one string. */
3653 {
3661 {
3665 }
3666 else
3670 }
3671 else
3672 {
3676 do
3677 {
3679 count++;
3684 {
3687 {
3690 }
3693 {
3698 }
3700 }
3701 else
3705 {
3710 "unsupported non-standard concatenation "
3712 }
3718 {
3722 }
3723 else
3724 {
3728 }
3729 }
3733 }
3736 {
3739 }
3743 {
3748 {
3763 }
3768 {
3773 else
3775 }
3776 }
3777 else
3778 /* cpp_interpret_string has issued an error. */
3785 }
3787 /* Look up a literal operator with the name and the exact arguments. */
3789 static tree
3791 {
3798 {
3804 {
3807 {
3817 }
3820 /* May be this should be sufficient_parms_p instead,
3821 depending on how exactly should user-defined literals
3822 work in presence of default arguments on the literal
3823 operator parameters. */
3826 }
3827 }
3830 }
3832 /* Parse a user-defined char constant. Returns a call to a user-defined
3833 literal operator taking the character as an argument. */
3835 static tree
3837 {
3845 /* Build up a call to the user-defined operator */
3846 /* Lookup the name we got back from the id-expression. */
3851 {
3856 }
3865 }
3867 /* A subroutine of cp_parser_userdef_numeric_literal to
3868 create a char... template parameter pack from a string node. */
3870 static tree
3872 {
3873 tree charvec;
3879 /* Fill in CHARVEC with all of the parameters. */
3884 /* Build the argument packs. */
3891 }
3893 /* A subroutine of cp_parser_userdef_numeric_literal to
3894 create a char... template parameter pack from a string node. */
3896 static tree
3898 {
3899 tree charvec;
3910 /* First template parm is character type. */
3913 /* Fill in CHARVEC with all of the parameters. */
3920 /* Build the argument packs. */
3927 }
3929 /* Parse a user-defined numeric constant. returns a call to a user-defined
3930 literal operator. */
3932 static tree
3934 {
3945 /* Look for a literal operator taking the exact type of numeric argument
3946 as the literal value. */
3951 {
3954 {
3958 long_long_unsigned_type_node);
3959 else
3960 {
3964 long_double_type_node);
3968 }
3971 }
3972 }
3975 /* If the numeric argument didn't work, look for a raw literal
3976 operator taking a const char* argument consisting of the number
3977 in string format. */
3982 {
3985 {
3988 }
3989 }
3992 /* If the raw literal didn't work, look for a non-type template
3993 function with parameter pack char.... Call the function with
3994 template parameter characters representing the number. */
3998 {
4003 {
4006 }
4007 }
4015 }
4017 /* Parse a user-defined string constant. Returns a call to a user-defined
4018 literal operator taking a character pointer and the length of the string
4019 as arguments. */
4021 static tree
4023 {
4032 /* Look for a template function with typename parameter CharT
4033 and parameter pack CharT... Call the function with
4034 template parameter characters representing the string. */
4038 {
4043 {
4046 }
4047 }
4050 /* Build up a call to the user-defined operator */
4051 /* Lookup the name we got back from the id-expression. */
4057 {
4061 }
4070 }
4073 /* Basic concepts [gram.basic] */
4075 /* Parse a translation-unit.
4077 translation-unit:
4078 declaration-seq [opt]
4080 Returns TRUE if all went well. */
4082 static bool
4084 {
4085 /* The address of the first non-permanent object on the declarator
4086 obstack. */
4091 /* Create the declarator obstack, if necessary. */
4093 {
4095 /* Create the error declarator. */
4097 /* Create the empty parameter list. */
4099 /* Remember where the base of the declarator obstack lies. */
4101 }
4105 /* If there are no tokens left then all went well. */
4107 {
4108 /* Get rid of the token array; we don't need it any more. */
4112 /* This file might have been a context that's implicitly extern
4113 "C". If so, pop the lang context. (Only relevant for PCH.) */
4115 {
4118 }
4120 /* Finish up. */
4124 }
4125 else
4126 {
4129 }
4131 /* Make sure the declarator obstack was fully cleaned up. */
4135 /* All went well. */
4137 }
4139 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4140 decltype context. */
4144 {
4149 }
4151 /* We're about to parse a collection of statements. If we're currently
4152 parsing tentatively, set up a firewall so that any nested
4153 cp_parser_commit_to_tentative_parse won't affect the current context. */
4155 static cp_token_position
4157 {
4164 }
4166 /* We've finished parsing the collection of statements. Wrap up the
4167 firewall and replace the relevant tokens with the parsed form. */
4169 static void
4171 tree expr)
4172 {
4176 /* Finish the firewall level. */
4178 /* And remember the result of the parse for when we try again. */
4184 }
4186 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4187 enclosing parentheses. */
4189 static tree
4191 {
4194 /* Consume the '('. */
4196 /* Start the statement-expression. */
4198 /* Parse the compound-statement. */
4200 /* Finish up. */
4202 /* Consume the ')'. */
4208 }
4210 /* Expressions [gram.expr] */
4212 /* Parse a primary-expression.
4214 primary-expression:
4215 literal
4216 this
4217 ( expression )
4218 id-expression
4219 lambda-expression (C++11)
4221 GNU Extensions:
4223 primary-expression:
4224 ( compound-statement )
4225 __builtin_va_arg ( assignment-expression , type-id )
4226 __builtin_offsetof ( type-id , offsetof-expression )
4228 C++ Extensions:
4229 __has_nothrow_assign ( type-id )
4230 __has_nothrow_constructor ( type-id )
4231 __has_nothrow_copy ( type-id )
4232 __has_trivial_assign ( type-id )
4233 __has_trivial_constructor ( type-id )
4234 __has_trivial_copy ( type-id )
4235 __has_trivial_destructor ( type-id )
4236 __has_virtual_destructor ( type-id )
4237 __is_abstract ( type-id )
4238 __is_base_of ( type-id , type-id )
4239 __is_class ( type-id )
4240 __is_empty ( type-id )
4241 __is_enum ( type-id )
4242 __is_final ( type-id )
4243 __is_literal_type ( type-id )
4244 __is_pod ( type-id )
4245 __is_polymorphic ( type-id )
4246 __is_std_layout ( type-id )
4247 __is_trivial ( type-id )
4248 __is_union ( type-id )
4250 Objective-C++ Extension:
4252 primary-expression:
4253 objc-expression
4255 literal:
4256 __null
4258 ADDRESS_P is true iff this expression was immediately preceded by
4259 "&" and therefore might denote a pointer-to-member. CAST_P is true
4260 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4261 true iff this expression is a template argument.
4263 Returns a representation of the expression. Upon return, *IDK
4264 indicates what kind of id-expression (if any) was present. */
4266 static tree
4273 {
4276 /* Assume the primary expression is not an id-expression. */
4279 /* Peek at the next token. */
4282 {
4283 /* literal:
4284 integer-literal
4285 character-literal
4286 floating-literal
4287 string-literal
4288 boolean-literal
4289 pointer-literal
4290 user-defined-literal */
4301 {
4305 }
4306 /* Floating-point literals are only allowed in an integral
4307 constant expression if they are cast to an integral or
4308 enumeration type. */
4312 {
4313 /* CAST_P will be set even in invalid code like "int(2.7 +
4314 ...)". Therefore, we have to check that the next token
4315 is sure to end the cast. */
4317 {
4322 enumerator-definition. */
4324 /* The curly brace at the end of an enum-specifier. */
4326 /* The end of a statement. */
4328 /* The end of the cast-expression. */
4330 /* The end of an array bound. */
4332 /* The closing ">" in a template-argument-list. */
4335 /* C++0x only: A ">>" treated like two ">" tokens,
4336 in a template-argument-list. */
4341 }
4343 /* If we are within a cast, then the constraint that the
4344 cast is to an integral or enumeration type will be
4345 checked at that point. If we are not within a cast, then
4346 this code is invalid. */
4349 }
4368 /* ??? Should wide strings be allowed when parser->translate_strings_p
4369 is false (i.e. in attributes)? If not, we can kill the third
4370 argument to cp_parser_string_literal. */
4376 /* If we see `( { ' then we are looking at the beginning of
4377 a GNU statement-expression. */
4380 {
4381 /* Statement-expressions are not allowed by the standard. */
4385 /* And they're not allowed outside of a function-body; you
4386 cannot, for example, write:
4388 int i = ({ int j = 3; j + 1; });
4390 at class or namespace scope. */
4393 {
4395 "statement-expressions are not allowed outside "
4401 }
4402 else
4404 }
4405 /* Otherwise it's a normal parenthesized expression. */
4406 {
4407 tree expr;
4410 /* Consume the `('. */
4412 /* Within a parenthesized expression, a `>' token is always
4413 the greater-than operator. */
4414 saved_greater_than_is_operator_p
4418 /* Parse the parenthesized expression. */
4420 /* Let the front end know that this expression was
4421 enclosed in parentheses. This matters in case, for
4422 example, the expression is of the form `A::B', since
4423 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4424 not. */
4426 /* DR 705: Wrapping an unqualified name in parentheses
4427 suppresses arg-dependent lookup. We want to pass back
4428 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4429 (c++/37862), but none of the others. */
4433 /* The `>' token might be the end of a template-id or
4434 template-parameter-list now. */
4435 parser->greater_than_is_operator_p
4437 /* Consume the `)'. */
4442 }
4446 /* We have an Objective-C++ message. */
4448 {
4450 /* Don't warn about a failed tentative parse. */
4455 }
4459 /* We have an Objective-C++ string literal. */
4466 {
4467 /* These two are the boolean literals. */
4475 /* The `__null' literal. */
4480 /* The `nullptr' literal. */
4485 /* Recognize the `this' keyword. */
4489 {
4493 }
4494 /* Pointers cannot appear in constant-expressions. */
4499 /* The `operator' keyword can be the beginning of an
4500 id-expression. */
4507 {
4508 non_integral_constant name;
4510 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4511 __func__ are the names of variables -- but they are
4512 treated specially. Therefore, they are handled here,
4513 rather than relying on the generic id-expression logic
4514 below. Grammatically, these names are id-expressions.
4516 Consume the token. */
4520 {
4532 }
4537 /* Look up the name. */
4539 }
4542 {
4543 tree expression;
4544 tree type;
4545 source_location type_location;
4547 /* The `__builtin_va_arg' construct is used to handle
4548 `va_arg'. Consume the `__builtin_va_arg' token. */
4550 /* Look for the opening `('. */
4552 /* Now, parse the assignment-expression. */
4554 /* Look for the `,'. */
4557 /* Parse the type-id. */
4559 /* Look for the closing `)'. */
4561 /* Using `va_arg' in a constant-expression is not
4562 allowed. */
4564 NIC_VA_ARG))
4567 }
4597 /* Objective-C++ expressions. */
4607 {
4612 }
4616 }
4618 /* An id-expression can start with either an identifier, a
4619 `::' as the beginning of a qualified-id, or the "operator"
4620 keyword. */
4625 {
4626 tree id_expression;
4627 tree decl;
4633 id_expression:
4634 /* Parse the id-expression. */
4635 id_expression
4652 /* If we have a template-id, then no further lookup is
4653 required. If the template-id was for a template-class, we
4654 will sometimes have a TYPE_DECL at this point. */
4658 /* Look up the name. */
4659 else
4660 {
4661 tree ambiguous_decls;
4663 /* If we already know that this lookup is ambiguous, then
4664 we've already issued an error message; there's no reason
4665 to check again. */
4668 {
4671 }
4674 none_type,
4675 template_p,
4680 /* If the lookup was ambiguous, an error will already have
4681 been issued. */
4685 /* In Objective-C++, we may have an Objective-C 2.0
4686 dot-syntax for classes here. */
4691 {
4692 tree component;
4699 }
4701 /* In Objective-C++, an instance variable (ivar) may be preferred
4702 to whatever cp_parser_lookup_name() found. */
4705 /* If name lookup gives us a SCOPE_REF, then the
4706 qualifying scope was dependent. */
4708 {
4709 /* At this point, we do not know if DECL is a valid
4710 integral constant expression. We assume that it is
4711 in fact such an expression, so that code like:
4713 template <int N> struct A {
4714 int a[B<N>::i];
4715 };
4717 is accepted. At template-instantiation time, we
4718 will check that B<N>::i is actually a constant. */
4720 }
4721 /* Check to see if DECL is a local variable in a context
4722 where that is forbidden. */
4725 {
4726 /* It might be that we only found DECL because we are
4727 trying to be generous with pre-ISO scoping rules.
4728 For example, consider:
4730 int i;
4731 void g() {
4732 for (int i = 0; i < 10; ++i) {}
4733 extern void f(int j = i);
4734 }
4736 Here, name look up will originally find the out
4737 of scope `i'. We need to issue a warning message,
4738 but then use the global `i'. */
4741 {
4744 decl);
4746 }
4747 }
4748 }
4750 decl = (finish_id_expression
4752 idk,
4757 template_arg_p,
4763 }
4765 /* Anything else is an error. */
4769 }
4770 }
4778 {
4781 }
4783 /* Parse an id-expression.
4785 id-expression:
4786 unqualified-id
4787 qualified-id
4789 qualified-id:
4790 :: [opt] nested-name-specifier template [opt] unqualified-id
4791 :: identifier
4792 :: operator-function-id
4793 :: template-id
4795 Return a representation of the unqualified portion of the
4796 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4797 a `::' or nested-name-specifier.
4799 Often, if the id-expression was a qualified-id, the caller will
4800 want to make a SCOPE_REF to represent the qualified-id. This
4801 function does not do this in order to avoid wastefully creating
4802 SCOPE_REFs when they are not required.
4804 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4805 `template' keyword.
4807 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4808 uninstantiated templates.
4810 If *TEMPLATE_P is non-NULL, it is set to true iff the
4811 `template' keyword is used to explicitly indicate that the entity
4812 named is a template.
4814 If DECLARATOR_P is true, the id-expression is appearing as part of
4815 a declarator, rather than as part of an expression. */
4817 static tree
4824 {
4828 /* Assume the `template' keyword was not used. */
4832 /* Look for the optional `::' operator. */
4833 global_scope_p
4836 /* Look for the optional nested-name-specifier. */
4837 nested_name_specifier_p
4840 check_dependency_p,
4842 declarator_p)
4844 /* If there is a nested-name-specifier, then we are looking at
4845 the first qualified-id production. */
4847 {
4848 tree saved_scope;
4849 tree saved_object_scope;
4850 tree saved_qualifying_scope;
4851 tree unqualified_id;
4854 /* See if the next token is the `template' keyword. */
4858 /* Name lookup we do during the processing of the
4859 unqualified-id might obliterate SCOPE. */
4863 /* Process the final unqualified-id. */
4865 check_dependency_p,
4866 declarator_p,
4868 /* Restore the SAVED_SCOPE for our caller. */
4874 }
4875 /* Otherwise, if we are in global scope, then we are looking at one
4876 of the other qualified-id productions. */
4878 {
4880 tree id;
4882 /* Peek at the next token. */
4885 /* If it's an identifier, and the next token is not a "<", then
4886 we can avoid the template-id case. This is an optimization
4887 for this common case. */
4889 && !cp_parser_nth_token_starts_template_argument_list_p
4894 /* Try a template-id. */
4898 none_type,
4899 declarator_p);
4900 /* If that worked, we're done. */
4904 /* Peek at the next token. (Changes in the token buffer may
4905 have invalidated the pointer obtained above.) */
4909 {
4916 /* Fall through. */
4921 }
4922 }
4923 else
4926 declarator_p,
4927 optional_p);
4928 }
4930 /* Parse an unqualified-id.
4932 unqualified-id:
4933 identifier
4934 operator-function-id
4935 conversion-function-id
4936 ~ class-name
4937 template-id
4939 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4940 keyword, in a construct like `A::template ...'.
4942 Returns a representation of unqualified-id. For the `identifier'
4943 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4944 production a BIT_NOT_EXPR is returned; the operand of the
4945 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4946 other productions, see the documentation accompanying the
4947 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4948 names are looked up in uninstantiated templates. If DECLARATOR_P
4949 is true, the unqualified-id is appearing as part of a declarator,
4950 rather than as part of an expression. */
4952 static tree
4958 {
4961 /* Peek at the next token. */
4965 {
4967 {
4968 tree id;
4970 /* We don't know yet whether or not this will be a
4971 template-id. */
4973 /* Try a template-id. */
4975 check_dependency_p,
4976 none_type,
4977 declarator_p);
4978 /* If it worked, we're done. */
4981 /* Otherwise, it's an ordinary identifier. */
4983 }
4987 check_dependency_p,
4988 none_type,
4989 declarator_p);
4992 {
4993 tree type_decl;
4994 tree qualifying_scope;
4995 tree object_scope;
4996 tree scope;
4999 /* Consume the `~' token. */
5001 /* Parse the class-name. The standard, as written, seems to
5002 say that:
5004 template <typename T> struct S { ~S (); };
5005 template <typename T> S<T>::~S() {}
5007 is invalid, since `~' must be followed by a class-name, but
5008 `S<T>' is dependent, and so not known to be a class.
5009 That's not right; we need to look in uninstantiated
5010 templates. A further complication arises from:
5012 template <typename T> void f(T t) {
5013 t.T::~T();
5014 }
5016 Here, it is not possible to look up `T' in the scope of `T'
5017 itself. We must look in both the current scope, and the
5018 scope of the containing complete expression.
5020 Yet another issue is:
5022 struct S {
5023 int S;
5024 ~S();
5025 };
5027 S::~S() {}
5029 The standard does not seem to say that the `S' in `~S'
5030 should refer to the type `S' and not the data member
5031 `S::S'. */
5033 /* DR 244 says that we look up the name after the "~" in the
5034 same scope as we looked up the qualifying name. That idea
5035 isn't fully worked out; it's more complicated than that. */
5040 /* Check for invalid scopes. */
5042 {
5046 }
5048 {
5052 scope);
5057 }
5060 /* If the name is of the form "X::~X" it's OK even if X is a
5061 typedef. */
5070 {
5073 }
5075 /* ~auto means the destructor of whatever the object is. */
5077 {
5080 "%<~auto%> only available with "
5084 }
5086 /* If there was an explicit qualification (S::~T), first look
5087 in the scope given by the qualification (i.e., S).
5089 Note: in the calls to cp_parser_class_name below we pass
5090 typename_type so that lookup finds the injected-class-name
5091 rather than the constructor. */
5095 {
5100 typename_type,
5103 declarator_p);
5106 }
5107 /* In "N::S::~S", look in "N" as well. */
5109 {
5114 type_decl
5118 typename_type,
5121 declarator_p);
5124 }
5125 /* In "p->S::~T", look in the scope given by "*p" as well. */
5127 {
5132 type_decl
5136 typename_type,
5139 declarator_p);
5142 }
5143 /* Look in the surrounding context. */
5145 {
5151 type_decl
5155 typename_type,
5158 declarator_p);
5161 {
5162 /* We couldn't find a type with this name, so just accept
5163 it and check for a match at instantiation time. */
5168 }
5169 }
5170 /* If an error occurred, assume that the name of the
5171 destructor is the same as the name of the qualifying
5172 class. That allows us to keep parsing after running
5173 into ill-formed destructor names. */
5179 /* Check that destructor name and scope match. */
5181 {
5188 }
5190 /* [class.dtor]
5192 A typedef-name that names a class shall not be used as the
5193 identifier in the declarator for a destructor declaration. */
5200 type_decl);
5203 }
5207 {
5208 tree id;
5210 /* This could be a template-id, so we try that first. */
5212 /* Try a template-id. */
5215 none_type,
5216 declarator_p);
5217 /* If that worked, we're done. */
5220 /* We still don't know whether we're looking at an
5221 operator-function-id or a conversion-function-id. */
5223 /* Try an operator-function-id. */
5225 /* If that didn't work, try a conversion-function-id. */
5229 {
5230 /* 17.6.3.3.5 */
5236 }
5239 }
5240 /* Fall through. */
5247 }
5248 }
5250 /* Parse an (optional) nested-name-specifier.
5252 nested-name-specifier: [C++98]
5253 class-or-namespace-name :: nested-name-specifier [opt]
5254 class-or-namespace-name :: template nested-name-specifier [opt]
5256 nested-name-specifier: [C++0x]
5257 type-name ::
5258 namespace-name ::
5259 nested-name-specifier identifier ::
5260 nested-name-specifier template [opt] simple-template-id ::
5262 PARSER->SCOPE should be set appropriately before this function is
5263 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5264 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5265 in name lookups.
5267 Sets PARSER->SCOPE to the class (TYPE) or namespace
5268 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5269 it unchanged if there is no nested-name-specifier. Returns the new
5270 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5272 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5273 part of a declaration and/or decl-specifier. */
5275 static tree
5281 {
5286 /* Remember where the nested-name-specifier starts. */
5288 {
5291 }
5294 {
5295 tree new_scope;
5296 tree old_scope;
5297 tree saved_qualifying_scope;
5300 /* Spot cases that cannot be the beginning of a
5301 nested-name-specifier. */
5304 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5305 the already parsed nested-name-specifier. */
5307 {
5308 /* Grab the nested-name-specifier and continue the loop. */
5310 /* If we originally encountered this nested-name-specifier
5311 with IS_DECLARATION set to false, we will not have
5312 resolved TYPENAME_TYPEs, so we must do so here. */
5315 {
5320 }
5323 }
5325 /* Spot cases that cannot be the beginning of a
5326 nested-name-specifier. On the second and subsequent times
5327 through the loop, we look for the `template' keyword. */
5329 ;
5330 /* A template-id can start a nested-name-specifier. */
5332 ;
5333 /* DR 743: decltype can be used in a nested-name-specifier. */
5335 ;
5336 else
5337 {
5338 /* If the next token is not an identifier, then it is
5339 definitely not a type-name or namespace-name. */
5342 /* If the following token is neither a `<' (to begin a
5343 template-id), nor a `::', then we are not looking at a
5344 nested-name-specifier. */
5350 {
5354 }
5357 && !cp_parser_nth_token_starts_template_argument_list_p
5360 }
5362 /* The nested-name-specifier is optional, so we parse
5363 tentatively. */
5366 /* Look for the optional `template' keyword, if this isn't the
5367 first time through the loop. */
5370 else
5373 /* Save the old scope since the name lookup we are about to do
5374 might destroy it. */
5377 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5378 look up names in "X<T>::I" in order to determine that "Y" is
5379 a template. So, if we have a typename at this point, we make
5380 an effort to look through it. */
5382 && !typename_keyword_p
5387 /* Parse the qualifying entity. */
5388 new_scope
5390 typename_keyword_p,
5391 template_keyword_p,
5392 check_dependency_p,
5393 type_p,
5394 is_declaration);
5395 /* Look for the `::' token. */
5398 /* If we found what we wanted, we keep going; otherwise, we're
5399 done. */
5401 {
5404 /* Restore the OLD_SCOPE since it was valid before the
5405 failed attempt at finding the last
5406 class-or-namespace-name. */
5410 /* If the next token is a decltype, and the one after that is a
5411 `::', then the decltype has failed to resolve to a class or
5412 enumeration type. Give this error even when parsing
5413 tentatively since it can't possibly be valid--and we're going
5414 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5415 won't get another chance.*/
5419 {
5426 /* As below. */
5429 }
5433 /* If the next token is an identifier, and the one after
5434 that is a `::', then any valid interpretation would have
5435 found a class-or-namespace-name. */
5441 {
5444 {
5446 {
5447 tree decl;
5448 tree ambiguous_decls;
5451 none_type,
5460 decl);
5462 {
5463 // cp_parser_lookup_name has the same diagnostic,
5464 // thus make sure to emit it at most once.
5467 {
5472 }
5474 }
5475 else
5476 {
5478 cp_parser_name_lookup_error
5481 else
5482 cp_parser_name_lookup_error
5485 }
5486 }
5489 /* Treat this as a successful nested-name-specifier
5490 due to:
5492 [basic.lookup.qual]
5494 If the name found is not a class-name (clause
5495 _class_) or namespace-name (_namespace.def_), the
5496 program is ill-formed. */
5498 }
5500 }
5502 }
5503 /* We've found one valid nested-name-specifier. */
5505 /* Name lookup always gives us a DECL. */
5508 /* Uses of "template" must be followed by actual templates. */
5520 new_scope);
5521 /* If it is a class scope, try to complete it; we are about to
5522 be looking up names inside the class. */
5524 /* Since checking types for dependency can be expensive,
5525 avoid doing it if the type is already complete. */
5527 /* Do not try to complete dependent types. */
5529 {
5531 /* If it is a typedef to current class, use the current
5532 class instead, as the typedef won't have any names inside
5533 it yet. */
5537 }
5538 /* Make sure we look in the right scope the next time through
5539 the loop. */
5541 }
5543 /* If parsing tentatively, replace the sequence of tokens that makes
5544 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5545 token. That way, should we re-parse the token stream, we will
5546 not have to repeat the effort required to do the parse, nor will
5547 we issue duplicate error messages. */
5549 {
5553 /* Reset the contents of the START token. */
5555 /* Retrieve any deferred checks. Do not pop this access checks yet
5556 so the memory will not be reclaimed during token replacing below. */
5564 /* Purge all subsequent tokens. */
5566 }
5572 }
5574 /* Parse a nested-name-specifier. See
5575 cp_parser_nested_name_specifier_opt for details. This function
5576 behaves identically, except that it will an issue an error if no
5577 nested-name-specifier is present. */
5579 static tree
5585 {
5586 tree scope;
5588 /* Look for the nested-name-specifier. */
5590 typename_keyword_p,
5591 check_dependency_p,
5592 type_p,
5593 is_declaration);
5594 /* If it was not present, issue an error message. */
5596 {
5599 }
5602 }
5604 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5605 this is either a class-name or a namespace-name (which corresponds
5606 to the class-or-namespace-name production in the grammar). For
5607 C++0x, it can also be a type-name that refers to an enumeration
5608 type or a simple-template-id.
5610 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5611 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5612 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5613 TYPE_P is TRUE iff the next name should be taken as a class-name,
5614 even the same name is declared to be another entity in the same
5615 scope.
5617 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5618 specified by the class-or-namespace-name. If neither is found the
5619 ERROR_MARK_NODE is returned. */
5621 static tree
5628 {
5629 tree saved_scope;
5630 tree saved_qualifying_scope;
5631 tree saved_object_scope;
5632 tree scope;
5636 /* DR 743: decltype can appear in a nested-name-specifier. */
5638 {
5642 {
5645 }
5649 }
5651 /* Before we try to parse the class-name, we must save away the
5652 current PARSER->SCOPE since cp_parser_class_name will destroy
5653 it. */
5657 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5658 there is no need to look for a namespace-name. */
5659 only_class_p = template_keyword_p
5664 typename_keyword_p,
5665 template_keyword_p,
5667 check_dependency_p,
5669 is_declaration);
5671 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5675 {
5676 /* Restore the saved scope. */
5681 /* Parse tentatively. */
5684 /* Parse a type-name */
5687 /* "If the name found does not designate a namespace or a class,
5688 enumeration, or dependent type, the program is ill-formed."
5690 We cover classes and dependent types above and namespaces below,
5691 so this code is only looking for enums. */
5697 }
5698 /* If that didn't work, try for a namespace-name. */
5700 {
5701 /* Restore the saved scope. */
5705 /* If we are not looking at an identifier followed by the scope
5706 resolution operator, then this is not part of a
5707 nested-name-specifier. (Note that this function is only used
5708 to parse the components of a nested-name-specifier.) */
5713 }
5716 }
5718 /* Return true if we are looking at a compound-literal, false otherwise. */
5720 static bool
5722 {
5723 /* Consume the `('. */
5728 /* Skip tokens until the next token is a closing parenthesis.
5729 If we find the closing `)', and the next token is a `{', then
5730 we are looking at a compound-literal. */
5731 bool compound_literal_p
5736 /* Roll back the tokens we skipped. */
5740 }
5742 /* Parse a postfix-expression.
5744 postfix-expression:
5745 primary-expression
5746 postfix-expression [ expression ]
5747 postfix-expression ( expression-list [opt] )
5748 simple-type-specifier ( expression-list [opt] )
5749 typename :: [opt] nested-name-specifier identifier
5750 ( expression-list [opt] )
5751 typename :: [opt] nested-name-specifier template [opt] template-id
5752 ( expression-list [opt] )
5753 postfix-expression . template [opt] id-expression
5754 postfix-expression -> template [opt] id-expression
5755 postfix-expression . pseudo-destructor-name
5756 postfix-expression -> pseudo-destructor-name
5757 postfix-expression ++
5758 postfix-expression --
5759 dynamic_cast < type-id > ( expression )
5760 static_cast < type-id > ( expression )
5761 reinterpret_cast < type-id > ( expression )
5762 const_cast < type-id > ( expression )
5763 typeid ( expression )
5764 typeid ( type-id )
5766 GNU Extension:
5768 postfix-expression:
5769 ( type-id ) { initializer-list , [opt] }
5771 This extension is a GNU version of the C99 compound-literal
5772 construct. (The C99 grammar uses `type-name' instead of `type-id',
5773 but they are essentially the same concept.)
5775 If ADDRESS_P is true, the postfix expression is the operand of the
5776 `&' operator. CAST_P is true if this expression is the target of a
5777 cast.
5779 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5780 class member access expressions [expr.ref].
5782 Returns a representation of the expression. */
5784 static tree
5788 {
5790 location_t loc;
5797 /* Peek at the next token. */
5800 /* Some of the productions are determined by keywords. */
5803 {
5808 {
5809 tree type;
5810 tree expression;
5814 /* All of these can be handled in the same way from the point
5815 of view of parsing. Begin by consuming the token
5816 identifying the cast. */
5819 /* New types cannot be defined in the cast. */
5821 parser->type_definition_forbidden_message
5824 /* Look for the opening `<'. */
5826 /* Parse the type to which we are casting. */
5831 /* Look for the closing `>'. */
5833 /* Restore the old message. */
5836 bool saved_greater_than_is_operator_p
5840 /* And the expression which is being cast. */
5845 parser->greater_than_is_operator_p
5848 /* Only type conversions to integral or enumeration types
5849 can be used in constant-expressions. */
5855 {
5857 postfix_expression
5861 postfix_expression
5865 postfix_expression
5867 tf_warning_or_error);
5870 postfix_expression
5875 }
5876 }
5880 {
5881 tree type;
5885 /* Consume the `typeid' token. */
5887 /* Look for the `(' token. */
5889 /* Types cannot be defined in a `typeid' expression. */
5891 parser->type_definition_forbidden_message
5893 /* We can't be sure yet whether we're looking at a type-id or an
5894 expression. */
5896 /* Try a type-id first. */
5901 /* Look for the `)' token. Otherwise, we can't be sure that
5902 we're not looking at an expression: consider `typeid (int
5903 (3))', for example. */
5905 /* If all went well, simply lookup the type-id. */
5908 /* Otherwise, fall back to the expression variant. */
5909 else
5910 {
5911 tree expression;
5913 /* Look for an expression. */
5915 /* Compute its typeid. */
5917 /* Look for the `)' token. */
5919 }
5920 /* Restore the saved message. */
5922 /* `typeid' may not appear in an integral constant expression. */
5925 }
5929 {
5930 tree type;
5931 /* The syntax permitted here is the same permitted for an
5932 elaborated-type-specifier. */
5937 }
5941 {
5945 {
5950 }
5952 {
5957 }
5958 else
5959 {
5960 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5963 }
5965 postfix_expression =
5969 {
5973 }
5975 {
5980 }
5981 else
5982 {
5984 postfix_expression);
5988 }
5990 }
5993 {
5996 tree p;
6010 tf_warning_or_error);
6013 tf_warning_or_error);
6014 else
6015 {
6019 }
6021 }
6024 {
6025 tree type;
6027 /* If the next thing is a simple-type-specifier, we may be
6028 looking at a functional cast. We could also be looking at
6029 an id-expression. So, we try the functional cast, and if
6030 that doesn't work we fall back to the primary-expression. */
6032 /* Look for the simple-type-specifier. */
6035 CP_PARSER_FLAGS_NONE);
6036 /* Parse the cast itself. */
6038 postfix_expression
6040 /* If that worked, we're done. */
6044 /* If the functional-cast didn't work out, try a
6045 compound-literal. */
6048 {
6053 /* Avoid calling cp_parser_type_id pointlessly, see comment
6054 in cp_parser_cast_expression about c++/29234. */
6057 else
6058 {
6059 /* Parse the type. */
6064 /* Look for the `)'. */
6066 }
6068 /* If things aren't going well, there's no need to
6069 keep going. */
6071 {
6073 /* Parse the brace-enclosed initializer list. */
6076 }
6077 /* If that worked, we're definitely looking at a
6078 compound-literal expression. */
6080 {
6081 /* Warn the user that a compound literal is not
6082 allowed in standard C++. */
6085 /* For simplicity, we disallow compound literals in
6086 constant-expressions. We could
6087 allow compound literals of integer type, whose
6088 initializer was a constant, in constant
6089 expressions. Permitting that usage, as a further
6090 extension, would not change the meaning of any
6091 currently accepted programs. (Of course, as
6092 compound literals are not part of ISO C++, the
6093 standard has nothing to say.) */
6095 NIC_NCC))
6096 {
6099 }
6100 /* Form the representation of the compound-literal. */
6101 postfix_expression
6103 tf_warning_or_error);
6105 }
6106 }
6108 /* It must be a primary-expression. */
6109 postfix_expression
6112 decltype_p,
6114 }
6116 }
6118 /* Note that we don't need to worry about calling build_cplus_new on a
6119 class-valued CALL_EXPR in decltype when it isn't the end of the
6120 postfix-expression; unary_complex_lvalue will take care of that for
6121 all these cases. */
6123 /* Keep looping until the postfix-expression is complete. */
6125 {
6129 /* It is not a Koenig lookup function call. */
6130 postfix_expression
6133 /* Peek at the next token. */
6137 {
6140 {
6142 "two consecutive %<[%> shall "
6145 }
6146 postfix_expression
6148 postfix_expression,
6150 decltype_p);
6156 /* postfix-expression ( expression-list [opt] ) */
6157 {
6167 is_builtin_constant_p
6170 {
6171 /* The whole point of __builtin_constant_p is to allow
6172 non-constant expressions to appear as arguments. */
6173 saved_integral_constant_expression_p
6175 saved_non_integral_constant_expression_p
6178 }
6179 args = (cp_parser_parenthesized_expression_list
6185 {
6186 parser->integral_constant_expression_p
6188 parser->non_integral_constant_expression_p
6190 }
6193 {
6196 }
6198 /* Function calls are not permitted in
6199 constant-expressions. */
6202 NIC_FUNC_CALL))
6203 {
6207 }
6212 {
6214 {
6216 {
6219 postfix_expression
6221 complain);
6222 }
6223 else
6224 postfix_expression
6226 }
6227 /* We do not perform argument-dependent lookup if
6228 normal lookup finds a non-function, in accordance
6229 with the expected resolution of DR 218. */
6232 {
6236 /* Do not do argument dependent lookup if regular
6237 lookup finds a member function or a block-scope
6238 function declaration. [basic.lookup.argdep]/3 */
6241 {
6244 postfix_expression
6246 complain);
6247 }
6248 }
6249 }
6252 {
6262 "%<memset%> used with constant zero length "
6263 "parameter; this could be due to transposed "
6266 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6267 to avoid leaking those into folder and middle-end. */
6269 tree arg;
6273 }
6276 {
6286 {
6287 postfix_expression
6291 }
6294 {
6295 postfix_expression
6296 = (build_new_method_call
6302 complain));
6303 }
6304 else
6305 postfix_expression
6309 complain);
6310 }
6314 postfix_expression = (build_offset_ref_call_from_tree
6316 complain));
6318 /* A call to a static class member, or a namespace-scope
6319 function. */
6320 postfix_expression
6323 koenig_p,
6324 complain);
6325 else
6326 /* All other function calls. */
6327 postfix_expression
6330 koenig_p,
6331 complain);
6335 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6339 }
6344 /* postfix-expression . template [opt] id-expression
6345 postfix-expression . pseudo-destructor-name
6346 postfix-expression -> template [opt] id-expression
6347 postfix-expression -> pseudo-destructor-name */
6349 /* Consume the `.' or `->' operator. */
6352 postfix_expression
6354 postfix_expression,
6361 /* postfix-expression ++ */
6362 /* Consume the `++' token. */
6364 /* Generate a representation for the complete expression. */
6365 postfix_expression
6367 POSTINCREMENT_EXPR);
6368 /* Increments may not appear in constant-expressions. */
6376 /* postfix-expression -- */
6377 /* Consume the `--' token. */
6379 /* Generate a representation for the complete expression. */
6380 postfix_expression
6382 POSTDECREMENT_EXPR);
6383 /* Decrements may not appear in constant-expressions. */
6395 else
6397 }
6398 }
6400 /* We should never get here. */
6403 }
6405 /* This function parses Cilk Plus array notations. If a normal array expr. is
6406 parsed then the array index is passed back to the caller through *INIT_INDEX
6407 and the function returns a NULL_TREE. If array notation expr. is parsed,
6408 then *INIT_INDEX is ignored by the caller and the function returns
6409 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6410 error_mark_node. */
6412 static tree
6414 tree array_value)
6415 {
6419 {
6422 }
6431 {
6434 }
6436 {
6437 /* Consume the ':'. */
6440 /* If we are here, then we have a case like this A[:]. */
6442 {
6446 }
6450 }
6451 else
6452 {
6453 /* If we are here, then there are three valid possibilities:
6454 1. ARRAY [ EXP ]
6455 2. ARRAY [ EXP : EXP ]
6456 3. ARRAY [ EXP : EXP : EXP ] */
6460 {
6461 /* This indicates that we have a normal array expression. */
6464 }
6466 /* Consume the ':'. */
6470 {
6473 }
6474 }
6479 {
6483 }
6489 }
6491 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6492 by cp_parser_builtin_offsetof. We're looking for
6494 postfix-expression [ expression ]
6495 postfix-expression [ braced-init-list ] (C++11)
6497 FOR_OFFSETOF is set if we're being called in that context, which
6498 changes how we deal with integer constant expressions. */
6500 static tree
6502 tree postfix_expression,
6505 {
6510 /* Consume the `[' token. */
6516 /* Parse the index expression. */
6517 /* ??? For offsetof, there is a question of what to allow here. If
6518 offsetof is not being used in an integral constant expression context,
6519 then we *could* get the right answer by computing the value at runtime.
6520 If we are in an integral constant expression context, then we might
6521 could accept any constant expression; hard to say without analysis.
6522 Rather than open the barn door too wide right away, allow only integer
6523 constant expressions here. */
6526 else
6527 {
6529 {
6536 {
6538 "braced list index is not allowed with array "
6542 }
6543 }
6545 {
6546 /* Here are have these two options:
6547 ARRAY[EXP : EXP] - Array notation expr with default
6548 stride of 1.
6549 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6550 stride. */
6552 postfix_expression);
6555 }
6556 else
6558 }
6562 /* Look for the closing `]'. */
6565 /* Build the ARRAY_REF. */
6569 /* When not doing offsetof, array references are not permitted in
6570 constant-expressions. */
6576 }
6578 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6579 by cp_parser_builtin_offsetof. We're looking for
6581 postfix-expression . template [opt] id-expression
6582 postfix-expression . pseudo-destructor-name
6583 postfix-expression -> template [opt] id-expression
6584 postfix-expression -> pseudo-destructor-name
6586 FOR_OFFSETOF is set if we're being called in that context. That sorta
6587 limits what of the above we'll actually accept, but nevermind.
6588 TOKEN_TYPE is the "." or "->" token, which will already have been
6589 removed from the stream. */
6591 static tree
6594 tree postfix_expression,
6596 location_t location)
6597 {
6598 tree name;
6603 /* If this is a `->' operator, dereference the pointer. */
6606 tf_warning_or_error);
6607 /* Check to see whether or not the expression is type-dependent. */
6609 /* The identifier following the `->' or `.' is not qualified. */
6615 /* Enter the scope corresponding to the type of the object
6616 given by the POSTFIX_EXPRESSION. */
6618 {
6620 /* According to the standard, no expression should ever have
6621 reference type. Unfortunately, we do not currently match
6622 the standard in this respect in that our internal representation
6623 of an expression may have reference type even when the standard
6624 says it does not. Therefore, we have to manually obtain the
6625 underlying type here. */
6627 /* The type of the POSTFIX_EXPRESSION must be complete. */
6629 {
6631 postfix_expression);
6633 }
6634 /* Unlike the object expression in other contexts, *this is not
6635 required to be of complete type for purposes of class member
6636 access (5.2.5) outside the member function body. */
6640 /* Let the name lookup machinery know that we are processing a
6641 class member access expression. */
6643 /* If something went wrong, we want to be able to discern that case,
6644 as opposed to the case where there was no SCOPE due to the type
6645 of expression being dependent. */
6648 /* If the SCOPE was erroneous, make the various semantic analysis
6649 functions exit quickly -- and without issuing additional error
6650 messages. */
6653 }
6655 /* Assume this expression is not a pseudo-destructor access. */
6658 /* If the SCOPE is a scalar type, then, if this is a valid program,
6659 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6660 is type dependent, it can be pseudo-destructor-name or something else.
6661 Try to parse it as pseudo-destructor-name first. */
6663 {
6664 tree s;
6665 tree type;
6668 /* Parse the pseudo-destructor-name. */
6677 {
6679 postfix_expression
6682 }
6683 }
6686 {
6687 /* If the SCOPE is not a scalar type, we are looking at an
6688 ordinary class member access expression, rather than a
6689 pseudo-destructor-name. */
6692 /* Parse the id-expression. */
6693 name = (cp_parser_id_expression
6700 /* In general, build a SCOPE_REF if the member name is qualified.
6701 However, if the name was not dependent and has already been
6702 resolved; there is no need to build the SCOPE_REF. For example;
6704 struct X { void f(); };
6705 template <typename T> void f(T* t) { t->X::f(); }
6707 Even though "t" is dependent, "X::f" is not and has been resolved
6708 to a BASELINK; there is no need to include scope information. */
6710 /* But we do need to remember that there was an explicit scope for
6711 virtual function calls. */
6715 /* If the name is a template-id that names a type, we will get a
6716 TYPE_DECL here. That is invalid code. */
6718 {
6721 }
6722 else
6723 {
6725 {
6727 {
6731 }
6732 else
6735 name,
6736 template_p);
6740 }
6742 adjust_result_of_qualified_name_lookup
6744 postfix_expression
6746 template_p,
6747 tf_warning_or_error);
6748 }
6749 }
6751 /* We no longer need to look up names in the scope of the object on
6752 the left-hand side of the `.' or `->' operator. */
6755 /* Outside of offsetof, these operators may not appear in
6756 constant-expressions. */
6758 && (cp_parser_non_integral_constant_expression
6763 }
6765 /* Cache of LITERAL_ZERO_P constants. */
6769 /* Parse a parenthesized expression-list.
6771 expression-list:
6772 assignment-expression
6773 expression-list, assignment-expression
6775 attribute-list:
6776 expression-list
6777 identifier
6778 identifier, expression-list
6780 CAST_P is true if this expression is the target of a cast.
6782 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6783 argument pack.
6785 Returns a vector of trees. Each element is a representation of an
6786 assignment-expression. NULL is returned if the ( and or ) are
6787 missing. An empty, but allocated, vector is returned on no
6788 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6789 if we are parsing an attribute list for an attribute that wants a
6790 plain identifier argument, normal_attr for an attribute that wants
6791 an expression, or non_attr if we aren't parsing an attribute list. If
6792 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6793 not all of the expressions in the list were constant.
6794 WANT_LITERAL_ZERO_P is true if the caller is interested in
6795 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6796 immediately, this can be removed. */
6805 {
6811 /* Assume all the expressions will be constant. */
6820 /* Within a parenthesized expression, a `>' token is always
6821 the greater-than operator. */
6822 saved_greater_than_is_operator_p
6826 /* Consume expressions until there are no more. */
6829 {
6830 tree expr;
6832 /* At the beginning of attribute lists, check to see if the
6833 next token is an identifier. */
6836 {
6839 /* Consume the identifier. */
6841 /* Save the identifier. */
6843 }
6844 else
6845 {
6848 /* Parse the next assignment-expression. */
6850 {
6851 /* A braced-init-list. */
6857 }
6859 {
6860 expr = (cp_parser_constant_expression
6865 }
6866 else
6867 {
6871 {
6877 /* If a parameter is literal zero alone, remember it
6878 for -Wmemset-transposed-args warning. */
6881 && want_literal_zero_p
6883 == CPP_COMMA
6886 {
6893 else
6894 {
6899 }
6900 /* Consume the 0 token (or '\0', 0LL etc.). */
6902 }
6906 }
6909 cast_p);
6910 }
6915 /* If we have an ellipsis, then this is an expression
6916 expansion. */
6919 {
6920 /* Consume the `...'. */
6923 /* Build the argument pack. */
6925 }
6927 /* Add it to the list. We add error_mark_node
6928 expressions to the list, so that we can still tell if
6929 the correct form for a parenthesized expression-list
6930 is found. That gives better errors. */
6935 }
6937 /* After the first item, attribute lists look the same as
6938 expression lists. */
6941 get_comma:;
6942 /* If the next token isn't a `,', then we are done. */
6946 /* Otherwise, consume the `,' and keep going. */
6948 }
6951 {
6954 skip_comma:;
6955 /* We try and resync to an unnested comma, as that will give the
6956 user better diagnostics. */
6964 {
6965 parser->greater_than_is_operator_p
6968 }
6969 }
6971 parser->greater_than_is_operator_p
6978 }
6980 /* Parse a pseudo-destructor-name.
6982 pseudo-destructor-name:
6983 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6984 :: [opt] nested-name-specifier template template-id :: ~ type-name
6985 :: [opt] nested-name-specifier [opt] ~ type-name
6987 If either of the first two productions is used, sets *SCOPE to the
6988 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6989 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6990 or ERROR_MARK_NODE if the parse fails. */
6992 static void
6994 tree object,
6997 {
7000 /* Handle ~auto. */
7004 {
7007 "%<~auto%> only available with "
7014 }
7016 /* Assume that things will not work out. */
7019 /* Look for the optional `::' operator. */
7021 /* Look for the optional nested-name-specifier. */
7022 nested_name_specifier_p
7029 /* Now, if we saw a nested-name-specifier, we might be doing the
7030 second production. */
7033 {
7034 /* Consume the `template' keyword. */
7036 /* Parse the template-id. */
7040 class_type,
7042 /* Look for the `::' token. */
7044 }
7045 /* If the next token is not a `~', then there might be some
7046 additional qualification. */
7048 {
7049 /* At this point, we're looking for "type-name :: ~". The type-name
7050 must not be a class-name, since this is a pseudo-destructor. So,
7051 it must be either an enum-name, or a typedef-name -- both of which
7052 are just identifiers. So, we peek ahead to check that the "::"
7053 and "~" tokens are present; if they are not, then we can avoid
7054 calling type_name. */
7058 {
7061 }
7063 /* Look for the type-name. */
7068 /* Look for the `::' token. */
7070 }
7071 else
7074 /* Look for the `~'. */
7077 /* Once we see the ~, this has to be a pseudo-destructor. */
7081 /* Look for the type-name again. We are not responsible for
7082 checking that it matches the first type-name. */
7084 }
7086 /* Parse a unary-expression.
7088 unary-expression:
7089 postfix-expression
7090 ++ cast-expression
7091 -- cast-expression
7092 unary-operator cast-expression
7093 sizeof unary-expression
7094 sizeof ( type-id )
7095 alignof ( type-id ) [C++0x]
7096 new-expression
7097 delete-expression
7099 GNU Extensions:
7101 unary-expression:
7102 __extension__ cast-expression
7103 __alignof__ unary-expression
7104 __alignof__ ( type-id )
7105 alignof unary-expression [C++0x]
7106 __real__ cast-expression
7107 __imag__ cast-expression
7108 && identifier
7109 sizeof ( type-id ) { initializer-list , [opt] }
7110 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7111 __alignof__ ( type-id ) { initializer-list , [opt] }
7113 ADDRESS_P is true iff the unary-expression is appearing as the
7114 operand of the `&' operator. CAST_P is true if this expression is
7115 the target of a cast.
7117 Returns a representation of the expression. */
7119 static tree
7122 {
7126 /* Peek at the next token. */
7128 /* Some keywords give away the kind of expression. */
7130 {
7134 {
7137 {
7140 location_t first_loc;
7143 /* Consume the token. */
7146 /* Parse the operand. */
7151 else
7152 {
7153 /* ISO C++ defines alignof only with types, not with
7154 expressions. So pedwarn if alignof is used with a non-
7155 type expression. However, __alignof__ is ok. */
7158 "ISO C++ does not allow %<alignof%> "
7162 }
7163 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7164 SIZEOF_EXPR with the original operand. */
7166 {
7168 {
7170 {
7173 error_mark_node));
7175 }
7176 else
7180 }
7182 }
7184 }
7193 {
7194 /* The saved value of the PEDANTIC flag. */
7196 tree expr;
7198 /* Save away the PEDANTIC flag. */
7200 /* Parse the cast-expression. */
7202 /* Restore the PEDANTIC flag. */
7206 }
7210 {
7211 tree expression;
7213 /* Consume the `__real__' or `__imag__' token. */
7215 /* Parse the cast-expression. */
7217 /* Create the complete representation. */
7221 expression,
7222 tf_warning_or_error);
7223 }
7231 {
7232 tree expr;
7242 parser->type_definition_forbidden_message
7245 saved_integral_constant_expression_p
7247 saved_non_integral_constant_expression_p
7251 saved_greater_than_is_operator_p
7263 parser->greater_than_is_operator_p
7266 parser->integral_constant_expression_p
7268 parser->non_integral_constant_expression_p
7275 }
7279 }
7280 }
7282 /* Look for the `:: new' and `:: delete', which also signal the
7283 beginning of a new-expression, or delete-expression,
7284 respectively. If the next token is `::', then it might be one of
7285 these. */
7287 {
7290 /* See if the token after the `::' is one of the keywords in
7291 which we're interested. */
7293 /* If it's `new', we have a new-expression. */
7296 /* Similarly, for `delete'. */
7299 }
7301 /* Look for a unary operator. */
7303 /* The `++' and `--' operators can be handled similarly, even though
7304 they are not technically unary-operators in the grammar. */
7306 {
7311 /* Handle the GNU address-of-label extension. */
7314 {
7315 tree identifier;
7316 tree expression;
7319 /* Consume the '&&' token. */
7321 /* Look for the identifier. */
7323 /* Create an expression representing the address. */
7326 NIC_ADDR_LABEL))
7329 }
7330 }
7332 {
7333 tree cast_expression;
7339 /* Consume the operator token. */
7341 /* Parse the cast-expression. */
7342 cast_expression
7347 pidk);
7348 /* Now, build an appropriate representation. */
7350 {
7354 RO_UNARY_STAR,
7355 complain);
7360 /* Fall through. */
7363 cast_expression,
7364 complain);
7371 /* Fall through. */
7381 }
7385 non_constant_p))
7389 }
7393 decltype_p,
7394 pidk);
7395 }
7397 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7398 unary-operator, the corresponding tree code is returned. */
7400 static enum tree_code
7402 {
7404 {
7425 }
7426 }
7428 /* Parse a new-expression.
7430 new-expression:
7431 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7432 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7434 Returns a representation of the expression. */
7436 static tree
7438 {
7441 tree type;
7444 tree ret;
7446 /* Look for the optional `::' operator. */
7447 global_scope_p
7451 /* Look for the `new' operator. */
7453 /* There's no easy way to tell a new-placement from the
7454 `( type-id )' construct. */
7456 /* Look for a new-placement. */
7458 /* If that didn't work out, there's no new-placement. */
7460 {
7464 }
7466 /* If the next token is a `(', then we have a parenthesized
7467 type-id. */
7469 {
7473 /* Consume the `('. */
7476 /* Parse the type-id. */
7477 parser->type_definition_forbidden_message
7482 /* Look for the closing `)'. */
7485 /* There should not be a direct-new-declarator in this production,
7486 but GCC used to allowed this, so we check and emit a sensible error
7487 message for this case. */
7489 {
7495 }
7496 }
7497 /* Otherwise, there must be a new-type-id. */
7498 else
7501 /* If the next token is a `(' or '{', then we have a new-initializer. */
7505 else
7508 /* A new-expression may not appear in an integral constant
7509 expression. */
7512 else
7513 {
7514 /* Create a representation of the new-expression. */
7516 tf_warning_or_error);
7517 }
7525 }
7527 /* Parse a new-placement.
7529 new-placement:
7530 ( expression-list )
7532 Returns the same representation as for an expression-list. */
7536 {
7539 /* Parse the expression-list. */
7540 expression_list = (cp_parser_parenthesized_expression_list
7546 }
7548 /* Parse a new-type-id.
7550 new-type-id:
7551 type-specifier-seq new-declarator [opt]
7553 Returns the TYPE allocated. If the new-type-id indicates an array
7554 type, *NELTS is set to the number of elements in the last array
7555 bound; the TYPE will not include the last array bound. */
7557 static tree
7559 {
7560 cp_decl_specifier_seq type_specifier_seq;
7566 /* The type-specifier sequence must not contain type definitions.
7567 (It cannot contain declarations of new types either, but if they
7568 are not definitions we will catch that because they are not
7569 complete.) */
7571 parser->type_definition_forbidden_message
7573 /* Parse the type-specifier-seq. */
7577 /* Restore the old message. */
7583 /* Parse the new-declarator. */
7586 /* Determine the number of elements in the last array dimension, if
7587 any. */
7589 /* Skip down to the last array dimension. */
7594 {
7597 }
7602 {
7605 }
7608 {
7615 else
7617 }
7620 }
7622 /* Parse an (optional) new-declarator.
7624 new-declarator:
7625 ptr-operator new-declarator [opt]
7626 direct-new-declarator
7628 Returns the declarator. */
7632 {
7635 cp_cv_quals cv_quals;
7637 /* We don't know if there's a ptr-operator next, or not. */
7639 /* Look for a ptr-operator. */
7641 /* If that worked, look for more new-declarators. */
7643 {
7646 /* Parse another optional declarator. */
7649 declarator = cp_parser_make_indirect_declarator
7653 }
7655 /* If the next token is a `[', there is a direct-new-declarator. */
7660 }
7662 /* Parse a direct-new-declarator.
7664 direct-new-declarator:
7665 [ expression ]
7666 direct-new-declarator [constant-expression]
7668 */
7672 {
7676 {
7677 tree expression;
7680 /* Look for the opening `['. */
7685 /* The standard requires that the expression have integral
7686 type. DR 74 adds enumeration types. We believe that the
7687 real intent is that these expressions be handled like the
7688 expression in a `switch' condition, which also allows
7689 classes with a single conversion to integral or
7690 enumeration type. */
7692 {
7693 expression
7695 expression,
7698 {
7700 "expression in new-declarator must have integral "
7703 }
7704 }
7706 /* Look for the closing `]'. */
7709 /* Add this bound to the declarator. */
7712 /* If the next token is not a `[', then there are no more
7713 bounds. */
7716 }
7719 }
7721 /* Parse a new-initializer.
7723 new-initializer:
7724 ( expression-list [opt] )
7725 braced-init-list
7727 Returns a representation of the expression-list. */
7731 {
7735 {
7736 tree t;
7743 }
7744 else
7745 expression_list = (cp_parser_parenthesized_expression_list
7751 }
7753 /* Parse a delete-expression.
7755 delete-expression:
7756 :: [opt] delete cast-expression
7757 :: [opt] delete [ ] cast-expression
7759 Returns a representation of the expression. */
7761 static tree
7763 {
7766 tree expression;
7768 /* Look for the optional `::' operator. */
7769 global_scope_p
7773 /* Look for the `delete' keyword. */
7775 /* See if the array syntax is in use. */
7777 {
7778 /* Consume the `[' token. */
7780 /* Look for the `]' token. */
7782 /* Remember that this is the `[]' construct. */
7784 }
7785 else
7788 /* Parse the cast-expression. */
7791 /* A delete-expression may not appear in an integral constant
7792 expression. */
7797 tf_warning_or_error);
7798 }
7800 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7801 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7802 0 otherwise. */
7804 static int
7806 {
7809 {
7851 /* In ((type ()) () the last () isn't a valid cast-expression,
7852 so the whole must be parsed as postfix-expression. */
7857 /* '[' may start a primary-expression in obj-c++ and in C++11,
7858 as a lambda-expression, eg, '(void)[]{}'. */
7865 /* '++' and '--' may or may not start a cast-expression:
7867 struct T { void operator++(int); };
7868 void f() { (T())++; }
7870 vs
7872 int a;
7873 (int)++a; */
7878 }
7879 }
7881 /* Parse a cast-expression.
7883 cast-expression:
7884 unary-expression
7885 ( type-id ) cast-expression
7887 ADDRESS_P is true iff the unary-expression is appearing as the
7888 operand of the `&' operator. CAST_P is true if this expression is
7889 the target of a cast.
7891 Returns a representation of the expression. */
7893 static tree
7896 {
7897 /* If it's a `(', then we might be looking at a cast. */
7899 {
7905 /* There's no way to know yet whether or not this is a cast.
7906 For example, `(int (3))' is a unary-expression, while `(int)
7907 3' is a cast. So, we resort to parsing tentatively. */
7909 /* Types may not be defined in a cast. */
7911 parser->type_definition_forbidden_message
7913 /* Consume the `('. */
7915 /* A very tricky bit is that `(struct S) { 3 }' is a
7916 compound-literal (which we permit in C++ as an extension).
7917 But, that construct is not a cast-expression -- it is a
7918 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7919 is legal; if the compound-literal were a cast-expression,
7920 you'd need an extra set of parentheses.) But, if we parse
7921 the type-id, and it happens to be a class-specifier, then we
7922 will commit to the parse at that point, because we cannot
7923 undo the action that is done when creating a new class. So,
7924 then we cannot back up and do a postfix-expression.
7926 Another tricky case is the following (c++/29234):
7928 struct S { void operator () (); };
7930 void foo ()
7931 {
7932 ( S()() );
7933 }
7935 As a type-id we parse the parenthesized S()() as a function
7936 returning a function, groktypename complains and we cannot
7937 back up in this case either.
7939 Therefore, we scan ahead to the closing `)', and check to see
7940 if the tokens after the `)' can start a cast-expression. Otherwise
7941 we are dealing with an unary-expression, a postfix-expression
7942 or something else.
7944 Yet another tricky case, in C++11, is the following (c++/54891):
7946 (void)[]{};
7948 The issue is that usually, besides the case of lambda-expressions,
7949 the parenthesized type-id cannot be followed by '[', and, eg, we
7950 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7951 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7952 we don't commit, we try a cast-expression, then an unary-expression.
7954 Save tokens so that we can put them back. */
7957 /* We may be looking at a cast-expression. */
7960 cast_expression
7963 /* Roll back the tokens we skipped. */
7965 /* If we aren't looking at a cast-expression, simulate an error so
7966 that the call to cp_parser_error_occurred below returns true. */
7969 else
7970 {
7973 /* Look for the type-id. */
7975 /* Look for the closing `)'. */
7978 }
7980 /* Restore the saved message. */
7983 /* At this point this can only be either a cast or a
7984 parenthesized ctor such as `(T ())' that looks like a cast to
7985 function returning T. */
7987 {
7988 /* Only commit if the cast-expression doesn't start with
7989 '++', '--', or '[' in C++11. */
7997 pidk);
8000 {
8001 /* Warn about old-style casts, if so requested. */
8008 /* Only type conversions to integral or enumeration types
8009 can be used in constant-expressions. */
8012 NIC_CAST))
8015 /* Perform the cast. */
8018 }
8019 }
8020 else
8022 }
8024 /* If we get here, then it's not a cast, so it must be a
8025 unary-expression. */
8028 }
8030 /* Parse a binary expression of the general form:
8032 pm-expression:
8033 cast-expression
8034 pm-expression .* cast-expression
8035 pm-expression ->* cast-expression
8037 multiplicative-expression:
8038 pm-expression
8039 multiplicative-expression * pm-expression
8040 multiplicative-expression / pm-expression
8041 multiplicative-expression % pm-expression
8043 additive-expression:
8044 multiplicative-expression
8045 additive-expression + multiplicative-expression
8046 additive-expression - multiplicative-expression
8048 shift-expression:
8049 additive-expression
8050 shift-expression << additive-expression
8051 shift-expression >> additive-expression
8053 relational-expression:
8054 shift-expression
8055 relational-expression < shift-expression
8056 relational-expression > shift-expression
8057 relational-expression <= shift-expression
8058 relational-expression >= shift-expression
8060 GNU Extension:
8062 relational-expression:
8063 relational-expression <? shift-expression
8064 relational-expression >? shift-expression
8066 equality-expression:
8067 relational-expression
8068 equality-expression == relational-expression
8069 equality-expression != relational-expression
8071 and-expression:
8072 equality-expression
8073 and-expression & equality-expression
8075 exclusive-or-expression:
8076 and-expression
8077 exclusive-or-expression ^ and-expression
8079 inclusive-or-expression:
8080 exclusive-or-expression
8081 inclusive-or-expression | exclusive-or-expression
8083 logical-and-expression:
8084 inclusive-or-expression
8085 logical-and-expression && inclusive-or-expression
8087 logical-or-expression:
8088 logical-and-expression
8089 logical-or-expression || logical-and-expression
8091 All these are implemented with a single function like:
8093 binary-expression:
8094 simple-cast-expression
8095 binary-expression <token> binary-expression
8097 CAST_P is true if this expression is the target of a cast.
8099 The binops_by_token map is used to get the tree codes for each <token> type.
8100 binary-expressions are associated according to a precedence table. */
8102 #define TOKEN_PRECEDENCE(token) \
8103 (((token->type == CPP_GREATER \
8104 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8105 && !parser->greater_than_is_operator_p) \
8106 ? PREC_NOT_OPERATOR \
8107 : binops_by_token[token->type].prec)
8109 static tree
8115 {
8116 cp_parser_expression_stack stack;
8118 cp_parser_expression_stack_entry current;
8119 tree rhs;
8123 tree overload;
8125 /* Parse the first expression. */
8136 {
8137 /* Get an operator token. */
8143 {
8145 "%<>>%> operator is treated"
8149 }
8153 /* Popping an entry off the stack means we completed a subexpression:
8154 - either we found a token which is not an operator (`>' where it is not
8155 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8156 will happen repeatedly;
8157 - or, we found an operator which has lower priority. This is the case
8158 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8159 parsing `3 * 4'. */
8161 {
8164 else
8166 }
8168 get_rhs:
8172 /* We used the operator token. */
8175 /* For "false && x" or "true || x", x will never be executed;
8176 disable warnings while evaluating it. */
8182 /* Extract another operand. It may be the RHS of this expression
8183 or the LHS of a new, higher priority expression. */
8188 /* Get another operator token. Look up its precedence to avoid
8189 building a useless (immediately popped) stack entry for common
8190 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8194 {
8195 /* ... and prepare to parse the RHS of the new, higher priority
8196 expression. Since precedence levels on the stack are
8197 monotonically increasing, we do not have to care about
8198 stack overflows. */
8207 pop:
8209 /* If the stack is not empty, we have parsed into LHS the right side
8210 (`4' in the example above) of an expression we had suspended.
8211 We can use the information on the stack to recover the LHS (`3')
8212 from the stack together with the tree code (`MULT_EXPR'), and
8213 the precedence of the higher level subexpression
8214 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8215 which will be used to actually build the additive expression. */
8220 }
8222 /* Undo the disabling of warnings done above. */
8233 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8234 ERROR_MARK for everything that is not a binary expression.
8235 This makes warn_about_parentheses miss some warnings that
8236 involve unary operators. For unary expressions we should
8237 pass the correct tree_code unless the unary expression was
8238 surrounded by parentheses.
8239 */
8245 == tcc_comparison
8248 else
8257 /* If the binary operator required the use of an overloaded operator,
8258 then this expression cannot be an integral constant-expression.
8259 An overloaded operator can be used even if both operands are
8260 otherwise permissible in an integral constant-expression if at
8261 least one of the operands is of enumeration type. */
8265 NIC_OVERLOADED))
8267 }
8270 }
8272 static tree
8277 {
8280 }
8282 /* Parse the `? expression : assignment-expression' part of a
8283 conditional-expression. The LOGICAL_OR_EXPR is the
8284 logical-or-expression that started the conditional-expression.
8285 Returns a representation of the entire conditional-expression.
8287 This routine is used by cp_parser_assignment_expression.
8289 ? expression : assignment-expression
8291 GNU Extensions:
8293 ? : assignment-expression */
8295 static tree
8297 {
8298 tree expr;
8299 tree assignment_expr;
8303 /* Consume the `?' token. */
8308 {
8311 /* Implicit true clause. */
8315 }
8316 else
8317 {
8320 /* Parse the expression. */
8323 c_inhibit_evaluation_warnings +=
8327 }
8329 /* The next token should be a `:'. */
8331 /* Parse the assignment-expression. */
8335 /* Build the conditional-expression. */
8337 expr,
8338 assignment_expr,
8339 tf_warning_or_error);
8340 }
8342 /* Parse an assignment-expression.
8344 assignment-expression:
8345 conditional-expression
8346 logical-or-expression assignment-operator assignment_expression
8347 throw-expression
8349 CAST_P is true if this expression is the target of a cast.
8350 DECLTYPE_P is true if this expression is the operand of decltype.
8352 Returns a representation for the expression. */
8354 static tree
8357 {
8358 tree expr;
8360 /* If the next token is the `throw' keyword, then we're looking at
8361 a throw-expression. */
8364 /* Otherwise, it must be that we are looking at a
8365 logical-or-expression. */
8366 else
8367 {
8368 /* Parse the binary expressions (logical-or-expression). */
8370 decltype_p,
8372 /* If the next token is a `?' then we're actually looking at a
8373 conditional-expression. */
8376 else
8377 {
8380 /* If it's an assignment-operator, we're using the second
8381 production. */
8382 enum tree_code assignment_operator
8385 {
8387 location_t saved_input_location;
8389 /* Parse the right-hand side of the assignment. */
8395 /* An assignment may not appear in a
8396 constant-expression. */
8398 NIC_ASSIGNMENT))
8400 /* Build the assignment expression. Its default
8401 location is the location of the '=' token. */
8405 assignment_operator,
8406 rhs,
8409 }
8410 }
8411 }
8414 }
8416 /* Parse an (optional) assignment-operator.
8418 assignment-operator: one of
8419 = *= /= %= += -= >>= <<= &= ^= |=
8421 GNU Extension:
8423 assignment-operator: one of
8424 <?= >?=
8426 If the next token is an assignment operator, the corresponding tree
8427 code is returned, and the token is consumed. For example, for
8428 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8429 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8430 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8431 operator, ERROR_MARK is returned. */
8433 static enum tree_code
8435 {
8439 /* Peek at the next token. */
8443 {
8489 /* Nothing else is an assignment operator. */
8491 }
8493 /* If it was an assignment operator, consume it. */
8498 }
8500 /* Parse an expression.
8502 expression:
8503 assignment-expression
8504 expression , assignment-expression
8506 CAST_P is true if this expression is the target of a cast.
8507 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8508 except possibly parenthesized or on the RHS of a comma (N3276).
8510 Returns a representation of the expression. */
8512 static tree
8515 {
8520 {
8521 tree assignment_expression;
8523 /* Parse the next assignment-expression. */
8524 assignment_expression
8527 /* We don't create a temporary for a call that is the immediate operand
8528 of decltype or on the RHS of a comma. But when we see a comma, we
8529 need to create a temporary for a call on the LHS. */
8534 assignment_expression
8538 /* If this is the first assignment-expression, we can just
8539 save it away. */
8542 else
8544 assignment_expression,
8546 /* If the next token is not a comma, then we are done with the
8547 expression. */
8550 /* Consume the `,'. */
8553 /* A comma operator cannot appear in a constant-expression. */
8556 }
8559 }
8561 /* Parse a constant-expression.
8563 constant-expression:
8564 conditional-expression
8566 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8567 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8568 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8569 is false, NON_CONSTANT_P should be NULL. */
8571 static tree
8575 {
8579 tree expression;
8581 /* It might seem that we could simply parse the
8582 conditional-expression, and then check to see if it were
8583 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8584 one that the compiler can figure out is constant, possibly after
8585 doing some simplifications or optimizations. The standard has a
8586 precise definition of constant-expression, and we must honor
8587 that, even though it is somewhat more restrictive.
8589 For example:
8591 int i[(2, 3)];
8593 is not a legal declaration, because `(2, 3)' is not a
8594 constant-expression. The `,' operator is forbidden in a
8595 constant-expression. However, GCC's constant-folding machinery
8596 will fold this operation to an INTEGER_CST for `3'. */
8598 /* Save the old settings. */
8600 saved_allow_non_integral_constant_expression_p
8603 /* We are now parsing a constant-expression. */
8605 parser->allow_non_integral_constant_expression_p
8608 /* Although the grammar says "conditional-expression", we parse an
8609 "assignment-expression", which also permits "throw-expression"
8610 and the use of assignment operators. In the case that
8611 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8612 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8613 actually essential that we look for an assignment-expression.
8614 For example, cp_parser_initializer_clauses uses this function to
8615 determine whether a particular assignment-expression is in fact
8616 constant. */
8618 /* Restore the old settings. */
8619 parser->integral_constant_expression_p
8621 parser->allow_non_integral_constant_expression_p
8624 {
8625 /* Require an rvalue constant expression here; that's what our
8626 callers expect. Reference constant expressions are handled
8627 separately in e.g. cp_parser_template_argument. */
8632 }
8635 parser->non_integral_constant_expression_p
8639 }
8641 /* Parse __builtin_offsetof.
8643 offsetof-expression:
8644 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8646 offsetof-member-designator:
8647 id-expression
8648 | offsetof-member-designator "." id-expression
8649 | offsetof-member-designator "[" expression "]"
8650 | offsetof-member-designator "->" id-expression */
8652 static tree
8654 {
8657 cp_id_kind dummy;
8660 /* We're about to accept non-integral-constant things, but will
8661 definitely yield an integral constant expression. Save and
8662 restore these values around our local parsing. */
8666 /* Consume the "__builtin_offsetof" token. */
8668 /* Consume the opening `('. */
8670 /* Parse the type-id. */
8673 /* Look for the `,'. */
8677 /* Build the (type *)null that begins the traditional offsetof macro. */
8679 tf_warning_or_error);
8681 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8685 {
8688 {
8690 /* offsetof-member-designator "[" expression "]" */
8696 /* offsetof-member-designator "->" identifier */
8699 /* FALLTHRU */
8702 /* offsetof-member-designator "." identifier */
8710 /* Consume the ")" token. */
8715 /* Error. We know the following require will fail, but
8716 that gives the proper error message. */
8721 }
8722 }
8724 success:
8725 /* If we're processing a template, we can't finish the semantics yet.
8726 Otherwise we can fold the entire expression now. */
8728 {
8731 }
8732 else
8735 failure:
8740 }
8742 /* Parse a trait expression.
8744 Returns a representation of the expression, the underlying type
8745 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8747 static tree
8749 {
8750 cp_trait_kind kind;
8756 {
8840 }
8842 /* Consume the token. */
8853 {
8860 }
8862 {
8864 {
8868 {
8871 }
8875 }
8876 }
8880 /* Complete the trait expression, which may mean either processing
8881 the trait expr now or saving it for template instantiation. */
8883 {
8892 }
8893 }
8895 /* Lambdas that appear in variable initializer or default argument scope
8896 get that in their mangling, so we need to record it. We might as well
8897 use the count for function and namespace scopes as well. */
8901 {
8902 tree t;
8907 static void
8909 {
8910 tree_int ti;
8912 /* Once we're inside a function, we ignore other scopes and just push
8913 the function again so that popping works properly. */
8920 {
8921 /* Don't reset the count if we're still in the same function. */
8924 }
8925 }
8927 static void
8929 {
8932 }
8934 static void
8936 {
8939 {
8942 }
8944 }
8946 /* Parse a lambda expression.
8948 lambda-expression:
8949 lambda-introducer lambda-declarator [opt] compound-statement
8951 Returns a representation of the expression. */
8953 static tree
8955 {
8957 tree type;
8965 {
8967 {
8971 }
8973 }
8975 {
8977 {
8980 }
8982 }
8984 /* We may be in the middle of deferred access check. Disable
8985 it now. */
8996 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8999 /* Now that we've started the type, add the capture fields for any
9000 explicit captures. */
9003 {
9004 /* Inside the class, surrounding template-parameter-lists do not apply. */
9005 unsigned int saved_num_template_parameter_lists
9009 bool fully_implicit_function_template_p
9013 bool auto_is_implicit_function_template_parm_p
9024 /* By virtue of defining a local class, a lambda expression has access to
9025 the private variables of enclosing classes. */
9030 {
9036 }
9038 {
9041 }
9043 /* The capture list was built up in reverse order; fix that now. */
9055 parser->fully_implicit_function_template_p
9059 parser->auto_is_implicit_function_template_parm_p
9061 }
9065 /* This field is only used during parsing of the lambda. */
9068 /* This lambda shouldn't have any proxies left at this point. */
9070 /* And now that we're done, push proxies for an enclosing lambda. */
9075 else
9081 }
9083 /* Parse the beginning of a lambda expression.
9085 lambda-introducer:
9086 [ lambda-capture [opt] ]
9088 LAMBDA_EXPR is the current representation of the lambda expression. */
9090 static void
9092 {
9093 /* Need commas after the first capture. */
9096 /* Eat the leading `['. */
9099 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9107 {
9110 }
9113 {
9115 tree capture_id;
9116 tree capture_init_expr;
9120 enum capture_kind_type
9121 {
9122 BY_COPY,
9123 BY_REFERENCE
9124 };
9128 {
9131 }
9135 else
9138 /* Possibly capture `this'. */
9140 {
9150 explicit_init_p);
9152 }
9154 /* Remember whether we want to capture as a reference or not. */
9156 {
9159 }
9161 /* Get the identifier. */
9166 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9167 delimiters, but I modified this to stop on unnested ']' as well. It
9168 was already changed to stop on unnested '}', so the
9169 "closing_parenthesis" name is no more misleading with my change. */
9170 {
9176 }
9178 /* Find the initializer for this capture. */
9182 {
9184 /* An explicit initializer exists. */
9187 "lambda capture initializers "
9193 {
9196 }
9197 }
9198 else
9199 {
9202 /* Turn the identifier into an id-expression. */
9203 capture_init_expr
9208 {
9211 }
9215 {
9218 capture_init_expr);
9221 }
9224 {
9227 capture_init_expr))
9230 }
9232 capture_init_expr
9233 = finish_id_expression
9235 capture_init_expr,
9249 {
9252 }
9253 else
9255 }
9259 {
9264 capture_id);
9268 "capture of %qD redundant with by-reference capture "
9270 }
9273 capture_id,
9274 capture_init_expr,
9276 explicit_init_p);
9277 }
9280 }
9282 /* Parse the (optional) middle of a lambda expression.
9284 lambda-declarator:
9285 < template-parameter-list [opt] >
9286 ( parameter-declaration-clause [opt] )
9287 attribute-specifier [opt]
9288 mutable [opt]
9289 exception-specification [opt]
9290 lambda-return-type-clause [opt]
9292 LAMBDA_EXPR is the current representation of the lambda expression. */
9294 static bool
9296 {
9297 /* 5.1.1.4 of the standard says:
9298 If a lambda-expression does not include a lambda-declarator, it is as if
9299 the lambda-declarator were ().
9300 This means an empty parameter list, no attributes, and no exception
9301 specification. */
9307 /* The template-parameter-list is optional, but must begin with
9308 an opening angle if present. */
9310 {
9313 "lambda templates are only available with "
9322 /* We just processed one more parameter list. */
9324 }
9326 /* The parameter-declaration-clause is optional (unless
9327 template-parameter-list was given), but must begin with an
9328 opening parenthesis if present. */
9330 {
9335 /* Parse parameters. */
9338 /* Default arguments shall not be specified in the
9339 parameter-declaration-clause of a lambda-declarator. */
9349 /* Parse optional `mutable' keyword. */
9351 {
9354 }
9356 /* Parse optional exception specification. */
9359 /* Parse optional trailing return type. */
9361 {
9365 }
9367 /* The function parameters must be in scope all the way until after the
9368 trailing-return-type in case of decltype. */
9370 }
9374 /* Create the function call operator.
9376 Messing with declarators like this is no uglier than building up the
9377 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9378 other code. */
9379 {
9380 cp_decl_specifier_seq return_type_specs;
9382 tree fco;
9389 else
9390 /* Maybe we will deduce the return type later. */
9396 sfk_none);
9401 VIRT_SPEC_UNSPECIFIED,
9402 REF_QUAL_NONE,
9403 exception_spec,
9408 declarator,
9409 attributes);
9411 {
9414 /* Give the object parameter a different name. */
9418 }
9420 {
9424 }
9433 }
9434 }
9436 /* Parse the body of a lambda expression, which is simply
9438 compound-statement
9440 but which requires special handling.
9441 LAMBDA_EXPR is the current representation of the lambda expression. */
9443 static void
9445 {
9450 else
9451 /* Still increment function_depth so that we don't GC in the
9452 middle of an expression. */
9454 /* Clear this in case we're in the middle of a default argument. */
9457 /* Finish the function call operator
9458 - class_specifier
9459 + late_parsing_for_member
9460 + function_definition_after_declarator
9461 + ctor_initializer_opt_and_function_body */
9462 {
9464 tree body;
9466 tree compound_stmt;
9467 tree cap;
9469 /* Let the front end know that we are going to be defining this
9470 function. */
9472 NULL_TREE,
9481 /* Push the proxies for any explicit captures. */
9488 /* 5.1.1.4 of the standard says:
9489 If a lambda-expression does not include a trailing-return-type, it
9490 is as if the trailing-return-type denotes the following type:
9491 * if the compound-statement is of the form
9492 { return attribute-specifier [opt] expression ; }
9493 the type of the returned expression after lvalue-to-rvalue
9494 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9495 (_conv.array_ 4.2), and function-to-pointer conversion
9496 (_conv.func_ 4.3);
9497 * otherwise, void. */
9499 /* In a lambda that has neither a lambda-return-type-clause
9500 nor a deducible form, errors should be reported for return statements
9501 in the body. Since we used void as the placeholder return type, parsing
9502 the body as usual will give such desired behavior. */
9506 {
9510 /* Parse tentatively in case there's more after the initial return
9511 statement. */
9522 {
9526 /* Will get error here if type not deduced yet. */
9530 }
9531 }
9534 {
9539 }
9543 out:
9547 /* Finish the function and generate code for it if necessary. */
9550 /* Only expand if the call op is not a template. */
9553 }
9558 else
9560 }
9562 /* Statements [gram.stmt.stmt] */
9564 /* Parse a statement.
9566 statement:
9567 labeled-statement
9568 expression-statement
9569 compound-statement
9570 selection-statement
9571 iteration-statement
9572 jump-statement
9573 declaration-statement
9574 try-block
9576 C++11:
9578 statement:
9579 labeled-statement
9580 attribute-specifier-seq (opt) expression-statement
9581 attribute-specifier-seq (opt) compound-statement
9582 attribute-specifier-seq (opt) selection-statement
9583 attribute-specifier-seq (opt) iteration-statement
9584 attribute-specifier-seq (opt) jump-statement
9585 declaration-statement
9586 attribute-specifier-seq (opt) try-block
9588 TM Extension:
9590 statement:
9591 atomic-statement
9593 IN_COMPOUND is true when the statement is nested inside a
9594 cp_parser_compound_statement; this matters for certain pragmas.
9596 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9597 is a (possibly labeled) if statement which is not enclosed in braces
9598 and has an else clause. This is used to implement -Wparentheses. */
9600 static void
9603 {
9608 restart:
9611 /* There is no statement yet. */
9617 /* In obj-c++, seeing '[[' might be the either the beginning of
9618 c++11 attributes, or a nested objc-message-expression. So
9619 let's parse the c++11 attributes tentatively. */
9623 {
9626 }
9628 /* Peek at the next token. */
9630 /* Remember the location of the first token in the statement. */
9632 /* If this is a keyword, then that will often determine what kind of
9633 statement we have. */
9635 {
9639 {
9642 /* Looks like a labeled-statement with a case label.
9643 Parse the label, and then use tail recursion to parse
9644 the statement. */
9661 {
9666 }
9667 else
9681 {
9686 }
9687 else
9688 {
9692 }
9696 /* Objective-C++ exception-handling constructs. */
9710 /* This must be a namespace alias definition. */
9723 /* It might be a keyword like `int' that can start a
9724 declaration-statement. */
9726 }
9727 }
9729 {
9730 /* If the next token is a `:', then we are looking at a
9731 labeled-statement. */
9734 {
9735 /* Looks like a labeled-statement with an ordinary label.
9736 Parse the label, and then use tail recursion to parse
9737 the statement. */
9741 }
9742 }
9743 /* Anything that starts with a `{' must be a compound-statement. */
9746 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9747 a statement all its own. */
9749 {
9750 /* Only certain OpenMP pragmas are attached to statements, and thus
9751 are considered statements themselves. All others are not. In
9752 the context of a compound, accept the pragma as a "statement" and
9753 return so that we can check for a close brace. Otherwise we
9754 require a real statement and must go back and read one. */
9760 }
9762 {
9765 }
9767 /* Everything else must be a declaration-statement or an
9768 expression-statement. Try for the declaration-statement
9769 first, unless we are looking at a `;', in which case we know that
9770 we have an expression-statement. */
9772 {
9774 {
9776 {
9777 /* Attributes should be parsed as part of the the
9778 declaration, so let's un-parse them. */
9781 }
9784 /* Try to parse the declaration-statement. */
9786 /* If that worked, we're done. */
9789 }
9790 /* Look for an expression-statement instead. */
9792 }
9794 /* Set the line number for the statement. */
9798 /* Note that for now, we don't do anything with c++11 statements
9799 parsed at this level. */
9802 OPT_Wattributes,
9804 }
9806 /* Parse the label for a labeled-statement, i.e.
9808 identifier :
9809 case constant-expression :
9810 default :
9812 GNU Extension:
9813 case constant-expression ... constant-expression : statement
9815 When a label is parsed without errors, the label is added to the
9816 parse tree by the finish_* functions, so this function doesn't
9817 have to return the label. */
9819 static void
9821 {
9826 /* The next token should be an identifier. */
9830 {
9833 }
9837 {
9839 {
9843 /* Consume the `case' token. */
9845 /* Parse the constant-expression. */
9852 {
9853 /* Consume the `...' token. */
9859 /* We don't need to emit warnings here, as the common code
9860 will do this for us. */
9861 }
9862 else
9867 else
9870 expr);
9871 }
9875 /* Consume the `default' token. */
9880 else
9885 /* Anything else must be an ordinary label. */
9888 }
9890 /* Require the `:' token. */
9893 /* An ordinary label may optionally be followed by attributes.
9894 However, this is only permitted if the attributes are then
9895 followed by a semicolon. This is because, for backward
9896 compatibility, when parsing
9897 lab: __attribute__ ((unused)) int i;
9898 we want the attribute to attach to "i", not "lab". */
9901 {
9902 tree attrs;
9909 ;
9910 else
9912 }
9918 }
9920 /* Parse an expression-statement.
9922 expression-statement:
9923 expression [opt] ;
9925 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9926 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9927 indicates whether this expression-statement is part of an
9928 expression statement. */
9930 static tree
9932 {
9936 /* If the next token is a ';', then there is no expression
9937 statement. */
9939 {
9943 {
9946 }
9947 }
9949 /* Give a helpful message for "A<T>::type t;" and the like. */
9952 {
9959 {
9960 /* A::A a; */
9965 }
9966 }
9968 /* Consume the final `;'. */
9973 /* This is the final expression statement of a statement
9974 expression. */
9980 }
9982 /* Parse a compound-statement.
9984 compound-statement:
9985 { statement-seq [opt] }
9987 GNU extension:
9989 compound-statement:
9990 { label-declaration-seq [opt] statement-seq [opt] }
9992 label-declaration-seq:
9993 label-declaration
9994 label-declaration-seq label-declaration
9996 Returns a tree representing the statement. */
9998 static tree
10001 {
10002 tree compound_stmt;
10004 /* Consume the `{'. */
10011 /* Begin the compound-statement. */
10013 /* If the next keyword is `__label__' we have a label declaration. */
10016 /* Parse an (optional) statement-seq. */
10018 /* Finish the compound-statement. */
10020 /* Consume the `}'. */
10024 }
10026 /* Parse an (optional) statement-seq.
10028 statement-seq:
10029 statement
10030 statement-seq [opt] statement */
10032 static void
10034 {
10035 /* Scan statements until there aren't any more. */
10037 {
10040 /* If we are looking at a `}', then we have run out of
10041 statements; the same is true if we have reached the end
10042 of file, or have stumbled upon a stray '@end'. */
10049 /* If we are in a compound statement and find 'else' then
10050 something went wrong. */
10052 {
10055 else
10056 {
10059 }
10060 }
10062 /* Parse the statement. */
10064 }
10065 }
10067 /* Parse a selection-statement.
10069 selection-statement:
10070 if ( condition ) statement
10071 if ( condition ) statement else statement
10072 switch ( condition ) statement
10074 Returns the new IF_STMT or SWITCH_STMT.
10076 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10077 is a (possibly labeled) if statement which is not enclosed in
10078 braces and has an else clause. This is used to implement
10079 -Wparentheses. */
10081 static tree
10083 {
10090 /* Peek at the next token. */
10093 /* See what kind of keyword it is. */
10096 {
10099 {
10100 tree statement;
10101 tree condition;
10103 /* Look for the `('. */
10105 {
10108 }
10110 /* Begin the selection-statement. */
10113 else
10116 /* Parse the condition. */
10118 /* Look for the `)'. */
10124 {
10128 /* Add the condition. */
10131 /* Parse the then-clause. */
10135 {
10143 }
10144 else
10150 /* If the next token is `else', parse the else-clause. */
10152 RID_ELSE))
10153 {
10154 /* Consume the `else' keyword. */
10157 /* Parse the else-clause. */
10159 {
10160 location_t loc;
10167 }
10168 else
10173 /* If we are currently parsing a then-clause, then
10174 IF_P will not be NULL. We set it to true to
10175 indicate that this if statement has an else clause.
10176 This may trigger the Wparentheses warning below
10177 when we get back up to the parent if statement. */
10180 }
10181 else
10182 {
10183 /* This if statement does not have an else clause. If
10184 NESTED_IF is true, then the then-clause is an if
10185 statement which does have an else clause. We warn
10186 about the potential ambiguity. */
10189 "suggest explicit braces to avoid ambiguous"
10191 }
10193 /* Now we're all done with the if-statement. */
10195 }
10196 else
10197 {
10201 /* Add the condition. */
10204 /* Parse the body of the switch-statement. */
10213 /* Now we're all done with the switch-statement. */
10215 }
10218 }
10224 }
10225 }
10227 /* Parse a condition.
10229 condition:
10230 expression
10231 type-specifier-seq declarator = initializer-clause
10232 type-specifier-seq declarator braced-init-list
10234 GNU Extension:
10236 condition:
10237 type-specifier-seq declarator asm-specification [opt]
10238 attributes [opt] = assignment-expression
10240 Returns the expression that should be tested. */
10242 static tree
10244 {
10245 cp_decl_specifier_seq type_specifiers;
10249 /* Try the declaration first. */
10251 /* New types are not allowed in the type-specifier-seq for a
10252 condition. */
10254 parser->type_definition_forbidden_message
10256 /* Parse the type-specifier-seq. */
10258 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10261 /* Restore the saved message. */
10263 /* If all is well, we might be looking at a declaration. */
10265 {
10266 tree decl;
10267 tree asm_specification;
10268 tree attributes;
10272 /* Parse the declarator. */
10278 /* Parse the attributes. */
10280 /* Parse the asm-specification. */
10282 /* If the next token is not an `=' or '{', then we might still be
10283 looking at an expression. For example:
10285 if (A(a).x)
10287 looks like a decl-specifier-seq and a declarator -- but then
10288 there is no `=', so this is an expression. */
10293 /* If we did see an `=' or '{', then we are looking at a declaration
10294 for sure. */
10296 {
10297 tree pushed_scope;
10301 /* Create the declaration. */
10307 /* Parse the initializer. */
10309 {
10313 }
10314 else
10315 {
10316 /* Consume the `='. */
10319 }
10323 /* Process the initializer. */
10326 asm_specification,
10327 flags);
10333 }
10334 }
10335 /* If we didn't even get past the declarator successfully, we are
10336 definitely not looking at a declaration. */
10337 else
10340 /* Otherwise, we are looking at an expression. */
10342 }
10344 /* Parses a for-statement or range-for-statement until the closing ')',
10345 not included. */
10347 static tree
10349 {
10353 /* Begin the for-statement. */
10356 /* Parse the initialization. */
10361 else
10363 }
10365 static tree
10367 {
10368 /* Normal for loop */
10371 tree stmt;
10374 /* The for-init-statement has already been parsed in
10375 cp_parser_for_init_statement, so no work is needed here. */
10378 /* If there's a condition, process it. */
10382 {
10386 }
10388 /* Look for the `;'. */
10391 /* If there's an expression, process it. */
10397 }
10399 /* Tries to parse a range-based for-statement:
10401 range-based-for:
10402 decl-specifier-seq declarator : expression
10404 The decl-specifier-seq declarator and the `:' are already parsed by
10405 cp_parser_for_init_statement. If processing_template_decl it returns a
10406 newly created RANGE_FOR_STMT; if not, it is converted to a
10407 regular FOR_STMT. */
10409 static tree
10412 {
10416 {
10419 }
10420 else
10423 /* If in template, STMT is converted to a normal for-statement
10424 at instantiation. If not, it is done just ahead. */
10426 {
10434 /* do_auto_deduction doesn't mess with template init-lists. */
10437 }
10438 else
10439 {
10442 }
10444 }
10446 /* Subroutine of cp_convert_range_for: given the initializer expression,
10447 builds up the range temporary. */
10449 static tree
10451 {
10454 /* Find out the type deduced by the declaration
10455 `auto &&__range = range_expr'. */
10460 /* Create the __range variable. */
10467 }
10469 /* Used by cp_parser_range_for in template context: we aren't going to
10470 do a full conversion yet, but we still need to resolve auto in the
10471 type of the for-range-declaration if present. This is basically
10472 a shortcut version of cp_convert_range_for. */
10474 static void
10476 {
10479 {
10482 iter_type = (cp_parser_perform_range_for_lookup
10485 {
10487 iter_type);
10489 tf_warning_or_error);
10492 }
10493 }
10494 }
10496 /* Converts a range-based for-statement into a normal
10497 for-statement, as per the definition.
10499 for (RANGE_DECL : RANGE_EXPR)
10500 BLOCK
10502 should be equivalent to:
10504 {
10505 auto &&__range = RANGE_EXPR;
10506 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10507 __begin != __end;
10508 ++__begin)
10509 {
10510 RANGE_DECL = *__begin;
10511 BLOCK
10512 }
10513 }
10515 If RANGE_EXPR is an array:
10516 BEGIN_EXPR = __range
10517 END_EXPR = __range + ARRAY_SIZE(__range)
10518 Else if RANGE_EXPR has a member 'begin' or 'end':
10519 BEGIN_EXPR = __range.begin()
10520 END_EXPR = __range.end()
10521 Else:
10522 BEGIN_EXPR = begin(__range)
10523 END_EXPR = end(__range);
10525 If __range has a member 'begin' but not 'end', or vice versa, we must
10526 still use the second alternative (it will surely fail, however).
10527 When calling begin()/end() in the third alternative we must use
10528 argument dependent lookup, but always considering 'std' as an associated
10529 namespace. */
10531 tree
10534 {
10540 /* If an error happened previously do nothing or else a lot of
10541 unhelpful errors would be issued. */
10543 else
10544 {
10545 tree range_temp;
10549 /* Can't bind a reference to an array of runtime bound. */
10551 else
10552 {
10557 LOOKUP_ONLYCONVERTING);
10559 }
10562 }
10564 /* The new for initialization statement. */
10572 LOOKUP_ONLYCONVERTING);
10581 LOOKUP_ONLYCONVERTING);
10585 /* The new for condition. */
10592 /* The new increment expression. */
10595 tf_warning_or_error);
10598 /* The declaration is initialized with *__begin inside the loop body. */
10601 tf_warning_or_error),
10603 LOOKUP_ONLYCONVERTING);
10606 }
10608 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10609 We need to solve both at the same time because the method used
10610 depends on the existence of members begin or end.
10611 Returns the type deduced for the iterator expression. */
10613 static tree
10615 {
10617 {
10620 }
10623 {
10628 }
10630 {
10631 /* If RANGE is an array, we will use pointer arithmetic. */
10634 range,
10638 }
10639 else
10640 {
10641 /* If it is not an array, we must do a bit of magic. */
10651 tf_warning_or_error);
10654 tf_warning_or_error);
10657 {
10658 /* Use the member functions. */
10661 else
10667 else
10670 }
10671 else
10672 {
10673 /* Use global functions with ADL. */
10680 tf_warning_or_error);
10682 tf_warning_or_error);
10684 tf_warning_or_error);
10686 tf_warning_or_error);
10689 }
10691 /* Last common checks. */
10693 {
10694 /* If one of the expressions is an error do no more checks. */
10697 }
10700 /* Can happen, when, eg, in a template context, Koenig lookup
10701 can't resolve begin/end (c++/58503). */
10703 else
10704 {
10706 /* The unqualified type of the __begin and __end temporaries should
10707 be the same, as required by the multiple auto declaration. */
10713 }
10714 }
10715 }
10717 /* Helper function for cp_parser_perform_range_for_lookup.
10718 Builds a tree for RANGE.IDENTIFIER(). */
10720 static tree
10722 {
10735 tf_warning_or_error);
10738 }
10740 /* Parse an iteration-statement.
10742 iteration-statement:
10743 while ( condition ) statement
10744 do statement while ( expression ) ;
10745 for ( for-init-statement condition [opt] ; expression [opt] )
10746 statement
10748 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10750 static tree
10752 {
10755 tree statement;
10758 /* Peek at the next token. */
10763 /* Remember whether or not we are already within an iteration
10764 statement. */
10767 /* See what kind of keyword it is. */
10770 {
10772 {
10773 tree condition;
10775 /* Begin the while-statement. */
10777 /* Look for the `('. */
10779 /* Parse the condition. */
10782 /* Look for the `)'. */
10784 /* Parse the dependent statement. */
10788 /* We're done with the while-statement. */
10790 }
10794 {
10795 tree expression;
10797 /* Begin the do-statement. */
10799 /* Parse the body of the do-statement. */
10804 /* Look for the `while' keyword. */
10806 /* Look for the `('. */
10808 /* Parse the expression. */
10810 /* We're done with the do-statement. */
10812 /* Look for the `)'. */
10814 /* Look for the `;'. */
10816 }
10820 {
10821 /* Look for the `('. */
10826 /* Look for the `)'. */
10829 /* Parse the body of the for-statement. */
10834 /* We're done with the for-statement. */
10836 }
10843 }
10846 }
10848 /* Parse a for-init-statement or the declarator of a range-based-for.
10849 Returns true if a range-based-for declaration is seen.
10851 for-init-statement:
10852 expression-statement
10853 simple-declaration */
10855 static bool
10857 {
10858 /* If the next token is a `;', then we have an empty
10859 expression-statement. Grammatically, this is also a
10860 simple-declaration, but an invalid one, because it does not
10861 declare anything. Therefore, if we did not handle this case
10862 specially, we would issue an error message about an invalid
10863 declaration. */
10865 {
10871 {
10872 /* N3994 -- for (id : init) ... */
10875 "type-specifier only available with "
10883 }
10885 /* A colon is used in range-based for. */
10888 /* We're going to speculatively look for a declaration, falling back
10889 to an expression, if necessary. */
10891 /* Parse the declaration. */
10894 decl);
10897 {
10898 /* It is a range-for, consume the ':' */
10902 {
10904 "range-based %<for%> loops only available with "
10907 }
10908 }
10909 else
10910 /* The ';' is not consumed yet because we told
10911 cp_parser_simple_declaration not to. */
10916 /* If the tentative parse failed, then we shall need to look for an
10917 expression-statement. */
10918 }
10919 /* If we are here, it is an expression-statement. */
10922 }
10924 /* Parse a jump-statement.
10926 jump-statement:
10927 break ;
10928 continue ;
10929 return expression [opt] ;
10930 return braced-init-list ;
10931 goto identifier ;
10933 GNU extension:
10935 jump-statement:
10936 goto * expression ;
10938 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10940 static tree
10942 {
10948 /* Peek at the next token. */
10953 /* See what kind of keyword it is. */
10956 {
10960 {
10980 }
10986 {
10993 /* Fall through. */
11003 }
11008 {
11009 tree expr;
11013 {
11017 }
11020 else
11021 /* If the next token is a `;', then there is no
11022 expression. */
11024 /* Build the return-statement. */
11026 /* Look for the final `;'. */
11028 }
11034 {
11037 }
11039 /* Create the goto-statement. */
11041 {
11042 /* Issue a warning about this use of a GNU extension. */
11044 /* Consume the '*' token. */
11046 /* Parse the dependent expression. */
11048 }
11049 else
11051 /* Look for the final `;'. */
11058 }
11061 }
11063 /* Parse a declaration-statement.
11065 declaration-statement:
11066 block-declaration */
11068 static void
11070 {
11073 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11076 /* Parse the block-declaration. */
11079 /* Free any declarators allocated. */
11081 }
11083 /* Some dependent statements (like `if (cond) statement'), are
11084 implicitly in their own scope. In other words, if the statement is
11085 a single statement (as opposed to a compound-statement), it is
11086 none-the-less treated as if it were enclosed in braces. Any
11087 declarations appearing in the dependent statement are out of scope
11088 after control passes that point. This function parses a statement,
11089 but ensures that is in its own scope, even if it is not a
11090 compound-statement.
11092 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11093 is a (possibly labeled) if statement which is not enclosed in
11094 braces and has an else clause. This is used to implement
11095 -Wparentheses.
11097 Returns the new statement. */
11099 static tree
11101 {
11102 tree statement;
11107 /* Mark if () ; with a special NOP_EXPR. */
11109 {
11113 }
11114 /* if a compound is opened, we simply parse the statement directly. */
11117 /* If the token is not a `{', then we must take special action. */
11118 else
11119 {
11120 /* Create a compound-statement. */
11122 /* Parse the dependent-statement. */
11124 /* Finish the dummy compound-statement. */
11126 }
11128 /* Return the statement. */
11130 }
11132 /* For some dependent statements (like `while (cond) statement'), we
11133 have already created a scope. Therefore, even if the dependent
11134 statement is a compound-statement, we do not want to create another
11135 scope. */
11137 static void
11139 {
11140 /* If the token is a `{', then we must take special action. */
11143 else
11144 {
11145 /* Avoid calling cp_parser_compound_statement, so that we
11146 don't create a new scope. Do everything else by hand. */
11148 /* If the next keyword is `__label__' we have a label declaration. */
11151 /* Parse an (optional) statement-seq. */
11154 }
11155 }
11157 /* Declarations [gram.dcl.dcl] */
11159 /* Parse an optional declaration-sequence.
11161 declaration-seq:
11162 declaration
11163 declaration-seq declaration */
11165 static void
11167 {
11169 {
11180 {
11181 /* A declaration consisting of a single semicolon is
11182 invalid. Allow it unless we're being pedantic. */
11187 }
11189 /* If we're entering or exiting a region that's implicitly
11190 extern "C", modify the lang context appropriately. */
11192 {
11195 }
11197 {
11200 }
11203 {
11204 /* A top-level declaration can consist solely of a #pragma.
11205 A nested declaration cannot, so this is done here and not
11206 in cp_parser_declaration. (A #pragma at block scope is
11207 handled in cp_parser_statement.) */
11210 }
11212 /* Parse the declaration itself. */
11214 }
11215 }
11217 /* Parse a declaration.
11219 declaration:
11220 block-declaration
11221 function-definition
11222 template-declaration
11223 explicit-instantiation
11224 explicit-specialization
11225 linkage-specification
11226 namespace-definition
11228 GNU extension:
11230 declaration:
11231 __extension__ declaration */
11233 static void
11235 {
11236 cp_token token1;
11237 cp_token token2;
11242 /* Check for the `__extension__' keyword. */
11244 {
11245 /* Parse the qualified declaration. */
11247 /* Restore the PEDANTIC flag. */
11251 }
11253 /* Try to figure out what kind of declaration is present. */
11258 else
11259 {
11262 }
11264 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11267 /* If the next token is `extern' and the following token is a string
11268 literal, then we have a linkage specification. */
11272 /* If the next token is `template', then we have either a template
11273 declaration, an explicit instantiation, or an explicit
11274 specialization. */
11276 {
11277 /* `template <>' indicates a template specialization. */
11281 /* `template <' indicates a template declaration. */
11284 /* Anything else must be an explicit instantiation. */
11285 else
11287 }
11288 /* If the next token is `export', then we have a template
11289 declaration. */
11292 /* If the next token is `extern', 'static' or 'inline' and the one
11293 after that is `template', we have a GNU extended explicit
11294 instantiation directive. */
11301 /* If the next token is `namespace', check for a named or unnamed
11302 namespace definition. */
11308 /* An unnamed namespace definition. */
11312 /* An inline (associated) namespace definition. */
11316 /* Objective-C++ declaration/definition. */
11323 /* We must have either a block declaration or a function
11324 definition. */
11325 else
11326 /* Try to parse a block-declaration, or a function-definition. */
11329 /* Free any declarators allocated. */
11331 }
11333 /* Parse a block-declaration.
11335 block-declaration:
11336 simple-declaration
11337 asm-definition
11338 namespace-alias-definition
11339 using-declaration
11340 using-directive
11342 GNU Extension:
11344 block-declaration:
11345 __extension__ block-declaration
11347 C++0x Extension:
11349 block-declaration:
11350 static_assert-declaration
11352 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11353 part of a declaration-statement. */
11355 static void
11358 {
11362 /* Check for the `__extension__' keyword. */
11364 {
11365 /* Parse the qualified declaration. */
11367 /* Restore the PEDANTIC flag. */
11371 }
11373 /* Peek at the next token to figure out which kind of declaration is
11374 present. */
11377 /* If the next keyword is `asm', we have an asm-definition. */
11379 {
11383 }
11384 /* If the next keyword is `namespace', we have a
11385 namespace-alias-definition. */
11388 /* If the next keyword is `using', we have a
11389 using-declaration, a using-directive, or an alias-declaration. */
11391 {
11396 /* If the token after `using' is `namespace', then we have a
11397 using-directive. */
11401 /* If the second token after 'using' is '=', then we have an
11402 alias-declaration. */
11408 /* Otherwise, it's a using-declaration. */
11409 else
11412 }
11413 /* If the next keyword is `__label__' we have a misplaced label
11414 declaration. */
11416 {
11420 /* If the next token is now a `;', consume it. */
11423 }
11424 /* If the next token is `static_assert' we have a static assertion. */
11427 /* Anything else must be a simple-declaration. */
11428 else
11431 }
11433 /* Parse a simple-declaration.
11435 simple-declaration:
11436 decl-specifier-seq [opt] init-declarator-list [opt] ;
11438 init-declarator-list:
11439 init-declarator
11440 init-declarator-list , init-declarator
11442 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11443 function-definition as a simple-declaration.
11445 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11446 parsed declaration if it is an uninitialized single declarator not followed
11447 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11448 if present, will not be consumed. */
11450 static void
11454 {
11455 cp_decl_specifier_seq decl_specifiers;
11464 /* Defer access checks until we know what is being declared; the
11465 checks for names appearing in the decl-specifier-seq should be
11466 done as if we were in the scope of the thing being declared. */
11469 /* Parse the decl-specifier-seq. We have to keep track of whether
11470 or not the decl-specifier-seq declares a named class or
11471 enumeration type, since that is the only case in which the
11472 init-declarator-list is allowed to be empty.
11474 [dcl.dcl]
11476 In a simple-declaration, the optional init-declarator-list can be
11477 omitted only when declaring a class or enumeration, that is when
11478 the decl-specifier-seq contains either a class-specifier, an
11479 elaborated-type-specifier, or an enum-specifier. */
11481 CP_PARSER_FLAGS_OPTIONAL,
11484 /* We no longer need to defer access checks. */
11487 /* In a block scope, a valid declaration must always have a
11488 decl-specifier-seq. By not trying to parse declarators, we can
11489 resolve the declaration/expression ambiguity more quickly. */
11492 {
11495 }
11497 /* If the next two tokens are both identifiers, the code is
11498 erroneous. The usual cause of this situation is code like:
11500 T t;
11502 where "T" should name a type -- but does not. */
11505 {
11506 /* If parsing tentatively, we should commit; we really are
11507 looking at a declaration. */
11509 /* Give up. */
11511 }
11513 /* If we have seen at least one decl-specifier, and the next token
11514 is not a parenthesis, then we must be looking at a declaration.
11515 (After "int (" we might be looking at a functional cast.) */
11522 /* Keep going until we hit the `;' at the end of the simple
11523 declaration. */
11526 CPP_SEMICOLON))
11527 {
11530 tree decl;
11533 {
11534 /* If we are processing next declarator, comma is expected */
11539 {
11543 }
11544 }
11545 else
11548 /* Parse the init-declarator. */
11551 function_definition_allowed_p,
11553 declares_class_or_enum,
11555 maybe_range_for_decl,
11557 /* If an error occurred while parsing tentatively, exit quickly.
11558 (That usually happens when in the body of a function; each
11559 statement is treated as a declaration-statement until proven
11560 otherwise.) */
11563 /* Handle function definitions specially. */
11565 {
11566 /* If the next token is a `,', then we are probably
11567 processing something like:
11569 void f() {}, *p;
11571 which is erroneous. */
11573 {
11576 "mixing"
11578 }
11579 /* Otherwise, we're done with the list of declarators. */
11580 else
11581 {
11584 }
11585 }
11588 /* The next token should be either a `,' or a `;'. */
11590 /* If it's a `,', there are more declarators to come. */
11593 /* If it's a `;', we are done. */
11596 /* Anything else is an error. */
11597 else
11598 {
11599 /* If we have already issued an error message we don't need
11600 to issue another one. */
11604 /* Skip tokens until we reach the end of the statement. */
11606 /* If the next token is now a `;', consume it. */
11610 }
11611 /* After the first time around, a function-definition is not
11612 allowed -- even if it was OK at first. For example:
11614 int i, f() {}
11616 is not valid. */
11618 }
11620 /* Issue an error message if no declarators are present, and the
11621 decl-specifier-seq does not itself declare a class or
11622 enumeration: [dcl.dcl]/3. */
11624 {
11626 {
11630 /* Ensure an error is issued anyway when finish_decltype_type,
11631 called via cp_parser_decl_specifier_seq, returns a class or
11632 an enumeration (c++/51786). */
11635 }
11636 /* Perform any deferred access checks. */
11638 }
11640 /* Consume the `;'. */
11644 {
11650 }
11652 done:
11654 }
11656 /* Parse a decl-specifier-seq.
11658 decl-specifier-seq:
11659 decl-specifier-seq [opt] decl-specifier
11660 decl-specifier attribute-specifier-seq [opt] (C++11)
11662 decl-specifier:
11663 storage-class-specifier
11664 type-specifier
11665 function-specifier
11666 friend
11667 typedef
11669 GNU Extension:
11671 decl-specifier:
11672 attributes
11674 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11676 The parser flags FLAGS is used to control type-specifier parsing.
11678 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11679 flags:
11681 1: one of the decl-specifiers is an elaborated-type-specifier
11682 (i.e., a type declaration)
11683 2: one of the decl-specifiers is an enum-specifier or a
11684 class-specifier (i.e., a type definition)
11686 */
11688 static void
11690 cp_parser_flags flags,
11693 {
11697 cp_decl_spec ds;
11699 /* Clear DECL_SPECS. */
11702 /* Assume no class or enumeration type is declared. */
11705 /* Keep reading specifiers until there are no more to read. */
11707 {
11712 /* Peek at the next token. */
11715 /* Save the first token of the decl spec list for error
11716 reporting. */
11719 /* Handle attributes. */
11721 {
11722 /* Parse the attributes. */
11725 /* In a sequence of declaration specifiers, c++11 attributes
11726 appertain to the type that precede them. In that case
11727 [dcl.spec]/1 says:
11729 The attribute-specifier-seq affects the type only for
11730 the declaration it appears in, not other declarations
11731 involving the same type.
11733 But for now let's force the user to position the
11734 attribute either at the beginning of the declaration or
11735 after the declarator-id, which would clearly mean that it
11736 applies to the declarator. */
11738 {
11740 /* The c++11 attribute is at the beginning of the
11741 declaration. It appertains to the entity being
11743 else
11744 {
11746 {
11747 /* This is an attribute following a
11748 class-specifier. */
11753 }
11754 else
11755 {
11756 decl_specs->std_attributes
11758 attrs);
11761 }
11763 }
11764 }
11766 decl_specs->attributes
11768 attrs);
11772 }
11773 /* Assume we will find a decl-specifier keyword. */
11775 /* If the next token is an appropriate keyword, we can simply
11776 add it to the list. */
11778 {
11779 /* decl-specifier:
11780 friend
11781 constexpr */
11784 {
11787 }
11788 else
11789 {
11791 /* Consume the token. */
11793 }
11801 /* function-specifier:
11802 inline
11803 virtual
11804 explicit */
11811 /* decl-specifier:
11812 typedef */
11815 /* Consume the token. */
11817 /* A constructor declarator cannot appear in a typedef. */
11819 /* The "typedef" keyword can only occur in a declaration; we
11820 may as well commit at this point. */
11827 /* storage-class-specifier:
11828 auto
11829 register
11830 static
11831 extern
11832 mutable
11834 GNU Extension:
11835 thread */
11838 {
11839 /* Consume the token. */
11842 /* Complain about `auto' as a storage specifier, if
11843 we're complaining about C++0x compatibility. */
11847 /* Set the storage class anyway. */
11849 token);
11850 }
11851 else
11852 /* C++0x auto type-specifier. */
11860 /* Consume the token. */
11863 token);
11866 /* Consume the token. */
11872 /* We did not yet find a decl-specifier yet. */
11875 }
11885 /* Constructors are a special case. The `S' in `S()' is not a
11886 decl-specifier; it is the beginning of the declarator. */
11887 constructor_p
11888 = (!found_decl_spec
11889 && constructor_possible_p
11890 && (cp_parser_constructor_declarator_p
11893 /* If we don't have a DECL_SPEC yet, then we must be looking at
11894 a type-specifier. */
11896 {
11899 tree type_spec;
11901 type_spec
11903 decl_specs,
11909 /* If this type-specifier referenced a user-defined type
11910 (a typedef, class-name, etc.), then we can't allow any
11911 more such type-specifiers henceforth.
11913 [dcl.spec]
11915 The longest sequence of decl-specifiers that could
11916 possibly be a type name is taken as the
11917 decl-specifier-seq of a declaration. The sequence shall
11918 be self-consistent as described below.
11920 [dcl.type]
11922 As a general rule, at most one type-specifier is allowed
11923 in the complete decl-specifier-seq of a declaration. The
11924 only exceptions are the following:
11926 -- const or volatile can be combined with any other
11927 type-specifier.
11929 -- signed or unsigned can be combined with char, long,
11930 short, or int.
11932 -- ..
11934 Example:
11936 typedef char* Pc;
11937 void g (const int Pc);
11939 Here, Pc is *not* part of the decl-specifier seq; it's
11940 the declarator. Therefore, once we see a type-specifier
11941 (other than a cv-qualifier), we forbid any additional
11942 user-defined types. We *do* still allow things like `int
11943 int' to be considered a decl-specifier-seq, and issue the
11944 error message later. */
11947 /* A constructor declarator cannot follow a type-specifier. */
11949 {
11954 }
11955 }
11957 /* If we still do not have a DECL_SPEC, then there are no more
11958 decl-specifiers. */
11963 /* After we see one decl-specifier, further decl-specifiers are
11964 always optional. */
11966 }
11968 /* Don't allow a friend specifier with a class definition. */
11973 }
11975 /* Parse an (optional) storage-class-specifier.
11977 storage-class-specifier:
11978 auto
11979 register
11980 static
11981 extern
11982 mutable
11984 GNU Extension:
11986 storage-class-specifier:
11987 thread
11989 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11991 static tree
11993 {
11995 {
11999 /* Fall through for C++98. */
12006 /* Consume the token. */
12011 }
12012 }
12014 /* Parse an (optional) function-specifier.
12016 function-specifier:
12017 inline
12018 virtual
12019 explicit
12021 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12022 Updates DECL_SPECS, if it is non-NULL. */
12024 static tree
12027 {
12030 {
12036 /* 14.5.2.3 [temp.mem]
12038 A member function template shall not be virtual. */
12041 else
12051 }
12053 /* Consume the token. */
12055 }
12057 /* Parse a linkage-specification.
12059 linkage-specification:
12060 extern string-literal { declaration-seq [opt] }
12061 extern string-literal declaration */
12063 static void
12065 {
12066 tree linkage;
12068 /* Look for the `extern' keyword. */
12071 /* Look for the string-literal. */
12074 /* Transform the literal into an identifier. If the literal is a
12075 wide-character string, or contains embedded NULs, then we can't
12076 handle it as the user wants. */
12079 {
12081 /* Assume C++ linkage. */
12083 }
12084 else
12087 /* We're now using the new linkage. */
12090 /* If the next token is a `{', then we're using the first
12091 production. */
12093 {
12096 /* Consume the `{' token. */
12098 /* Parse the declarations. */
12100 /* Look for the closing `}'. */
12102 }
12103 /* Otherwise, there's just one declaration. */
12104 else
12105 {
12108 saved_in_unbraced_linkage_specification_p
12112 parser->in_unbraced_linkage_specification_p
12114 }
12116 /* We're done with the linkage-specification. */
12118 }
12120 /* Parse a static_assert-declaration.
12122 static_assert-declaration:
12123 static_assert ( constant-expression , string-literal ) ;
12125 If MEMBER_P, this static_assert is a class member. */
12127 static void
12129 {
12130 tree condition;
12131 tree message;
12133 location_t saved_loc;
12136 /* Peek at the `static_assert' token so we can keep track of exactly
12137 where the static assertion started. */
12141 /* Look for the `static_assert' keyword. */
12143 RT_STATIC_ASSERT))
12146 /* We know we are in a static assertion; commit to any tentative
12147 parse. */
12151 /* Parse the `(' starting the static assertion condition. */
12154 /* Parse the constant-expression. Allow a non-constant expression
12155 here in order to give better diagnostics in finish_static_assert. */
12156 condition =
12161 /* Parse the separating `,'. */
12164 /* Parse the string-literal message. */
12169 /* A `)' completes the static assertion. */
12176 /* A semicolon terminates the declaration. */
12179 /* Complete the static assertion, which may mean either processing
12180 the static assert now or saving it for template instantiation. */
12182 }
12184 /* Parse the expression in decltype ( expression ). */
12186 static tree
12189 {
12191 tree expr;
12193 /* First, try parsing an id-expression. */
12204 {
12207 cp_id_kind idk;
12211 /* Lookup the name we got back from the id-expression. */
12221 {
12222 /* Complete lookup of the id-expression. */
12223 expr = (finish_id_expression
12236 /* We found an id-expression, but it was something that we
12237 should not have found. This is an error, not something
12238 we can recover from, so note that we found an
12239 id-expression and we'll recover as gracefully as
12240 possible. */
12242 }
12247 /* We have an id-expression. */
12249 }
12252 {
12253 /* Abort the id-expression parse. */
12256 /* Parsing tentatively, again. */
12259 /* Parse a class member access. */
12267 /* We have an id-expression. */
12269 }
12272 /* We have parsed the complete id-expression or member access. */
12274 else
12275 {
12276 /* Abort our attempt to parse an id-expression or member access
12277 expression. */
12280 /* Parse a full expression. */
12283 }
12286 }
12288 /* Parse a `decltype' type. Returns the type.
12290 simple-type-specifier:
12291 decltype ( expression )
12292 C++14 proposal:
12293 decltype ( auto ) */
12295 static tree
12297 {
12298 tree expr;
12307 {
12308 /* Already parsed. */
12311 }
12313 /* Look for the `decltype' token. */
12317 /* Parse the opening `('. */
12321 /* decltype (auto) */
12324 {
12331 }
12333 /* Types cannot be defined in a `decltype' expression. Save away the
12334 old message. */
12337 /* And create the new one. */
12338 parser->type_definition_forbidden_message
12341 /* The restrictions on constant-expressions do not apply inside
12342 decltype expressions. */
12343 saved_integral_constant_expression_p
12345 saved_non_integral_constant_expression_p
12349 /* Within a parenthesized expression, a `>' token is always
12350 the greater-than operator. */
12351 saved_greater_than_is_operator_p
12355 /* Do not actually evaluate the expression. */
12358 /* Do not warn about problems with the expression. */
12363 /* Go back to evaluating expressions. */
12367 /* The `>' token might be the end of a template-id or
12368 template-parameter-list now. */
12369 parser->greater_than_is_operator_p
12372 /* Restore the old message and the integral constant expression
12373 flags. */
12375 parser->integral_constant_expression_p
12377 parser->non_integral_constant_expression_p
12380 /* Parse to the closing `)'. */
12382 {
12386 }
12389 tf_warning_or_error);
12391 rewrite:
12392 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12393 it again. */
12400 }
12402 /* Special member functions [gram.special] */
12404 /* Parse a conversion-function-id.
12406 conversion-function-id:
12407 operator conversion-type-id
12409 Returns an IDENTIFIER_NODE representing the operator. */
12411 static tree
12413 {
12414 tree type;
12415 tree saved_scope;
12416 tree saved_qualifying_scope;
12417 tree saved_object_scope;
12420 /* Look for the `operator' token. */
12423 /* When we parse the conversion-type-id, the current scope will be
12424 reset. However, we need that information in able to look up the
12425 conversion function later, so we save it here. */
12429 /* We must enter the scope of the class so that the names of
12430 entities declared within the class are available in the
12431 conversion-type-id. For example, consider:
12433 struct S {
12434 typedef int I;
12435 operator I();
12436 };
12438 S::operator I() { ... }
12440 In order to see that `I' is a type-name in the definition, we
12441 must be in the scope of `S'. */
12444 /* Parse the conversion-type-id. */
12446 /* Leave the scope of the class, if any. */
12449 /* Restore the saved scope. */
12453 /* If the TYPE is invalid, indicate failure. */
12457 }
12459 /* Parse a conversion-type-id:
12461 conversion-type-id:
12462 type-specifier-seq conversion-declarator [opt]
12464 Returns the TYPE specified. */
12466 static tree
12468 {
12469 tree attributes;
12470 cp_decl_specifier_seq type_specifiers;
12472 tree type_specified;
12475 /* Parse the attributes. */
12479 parser->type_definition_forbidden_message
12482 /* Parse the type-specifiers. */
12489 /* If that didn't work, stop. */
12492 /* Parse the conversion-declarator. */
12500 /* Don't give this error when parsing tentatively. This happens to
12501 work because we always parse this definitively once. */
12504 {
12506 {
12509 }
12513 }
12516 }
12518 /* Parse an (optional) conversion-declarator.
12520 conversion-declarator:
12521 ptr-operator conversion-declarator [opt]
12523 */
12527 {
12530 cp_cv_quals cv_quals;
12532 /* We don't know if there's a ptr-operator next, or not. */
12534 /* Try the ptr-operator. */
12537 /* If it worked, look for more conversion-declarators. */
12539 {
12542 /* Parse another optional declarator. */
12545 declarator = cp_parser_make_indirect_declarator
12549 }
12552 }
12554 /* Parse an (optional) ctor-initializer.
12556 ctor-initializer:
12557 : mem-initializer-list
12559 Returns TRUE iff the ctor-initializer was actually present. */
12561 static bool
12563 {
12564 /* If the next token is not a `:', then there is no
12565 ctor-initializer. */
12567 {
12568 /* Do default initialization of any bases and members. */
12573 }
12575 /* Consume the `:' token. */
12577 /* And the mem-initializer-list. */
12581 }
12583 /* Parse a mem-initializer-list.
12585 mem-initializer-list:
12586 mem-initializer ... [opt]
12587 mem-initializer ... [opt] , mem-initializer-list */
12589 static void
12591 {
12596 /* Let the semantic analysis code know that we are starting the
12597 mem-initializer-list. */
12602 /* Loop through the list. */
12604 {
12605 tree mem_initializer;
12608 /* Parse the mem-initializer. */
12610 /* If the next token is a `...', we're expanding member initializers. */
12612 {
12613 /* Consume the `...'. */
12616 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12617 can be expanded but members cannot. */
12620 {
12625 }
12627 /* Construct the pack expansion type. */
12630 }
12633 {
12637 }
12638 /* Look for a target constructor. */
12642 {
12645 {
12649 }
12651 }
12652 /* Add it to the list, unless it was erroneous. */
12654 {
12657 }
12658 /* If the next token is not a `,', we're done. */
12661 /* Consume the `,' token. */
12663 }
12665 /* Perform semantic analysis. */
12668 }
12670 /* Parse a mem-initializer.
12672 mem-initializer:
12673 mem-initializer-id ( expression-list [opt] )
12674 mem-initializer-id braced-init-list
12676 GNU extension:
12678 mem-initializer:
12679 ( expression-list [opt] )
12681 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12682 class) or FIELD_DECL (for a non-static data member) to initialize;
12683 the TREE_VALUE is the expression-list. An empty initialization
12684 list is represented by void_list_node. */
12686 static tree
12688 {
12689 tree mem_initializer_id;
12690 tree expression_list;
12691 tree member;
12694 /* Find out what is being initialized. */
12696 {
12700 }
12701 else
12702 {
12706 }
12712 {
12719 }
12720 else
12721 {
12731 }
12741 }
12743 /* Parse a mem-initializer-id.
12745 mem-initializer-id:
12746 :: [opt] nested-name-specifier [opt] class-name
12747 identifier
12749 Returns a TYPE indicating the class to be initializer for the first
12750 production. Returns an IDENTIFIER_NODE indicating the data member
12751 to be initialized for the second production. */
12753 static tree
12755 {
12759 tree id;
12763 /* `typename' is not allowed in this context ([temp.res]). */
12765 {
12767 "keyword %<typename%> not allowed in this context (a qualified "
12770 }
12771 /* Look for the optional `::' operator. */
12772 global_scope_p
12776 /* Look for the optional nested-name-specifier. The simplest way to
12777 implement:
12779 [temp.res]
12781 The keyword `typename' is not permitted in a base-specifier or
12782 mem-initializer; in these contexts a qualified name that
12783 depends on a template-parameter is implicitly assumed to be a
12784 type name.
12786 is to assume that we have seen the `typename' keyword at this
12787 point. */
12788 nested_name_specifier_p
12797 /* If there is a `::' operator or a nested-name-specifier, then we
12798 are definitely looking for a class-name. */
12803 typename_type,
12807 /* Otherwise, we could also be looking for an ordinary identifier. */
12809 /* Try a class-name. */
12813 none_type,
12817 /* If we found one, we're done. */
12820 /* Otherwise, look for an ordinary identifier. */
12822 }
12824 /* Overloading [gram.over] */
12826 /* Parse an operator-function-id.
12828 operator-function-id:
12829 operator operator
12831 Returns an IDENTIFIER_NODE for the operator which is a
12832 human-readable spelling of the identifier, e.g., `operator +'. */
12834 static tree
12836 {
12837 /* Look for the `operator' keyword. */
12840 /* And then the name of the operator itself. */
12842 }
12844 /* Return an identifier node for a user-defined literal operator.
12845 The suffix identifier is chained to the operator name identifier. */
12847 static tree
12849 {
12850 tree identifier;
12857 }
12859 /* Parse an operator.
12861 operator:
12862 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12863 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12864 || ++ -- , ->* -> () []
12866 GNU Extensions:
12868 operator:
12869 <? >? <?= >?=
12871 Returns an IDENTIFIER_NODE for the operator which is a
12872 human-readable spelling of the identifier, e.g., `operator +'. */
12874 static tree
12876 {
12881 /* Peek at the next token. */
12883 /* Figure out which operator we have. */
12885 {
12887 {
12890 /* The keyword should be either `new' or `delete'. */
12895 else
12898 /* Consume the `new' or `delete' token. */
12901 /* Peek at the next token. */
12903 /* If it's a `[' token then this is the array variant of the
12904 operator. */
12906 {
12907 /* Consume the `[' token. */
12909 /* Look for the `]' token. */
12913 }
12914 /* Otherwise, we have the non-array variant. */
12915 else
12919 }
13066 /* Consume the `('. */
13068 /* Look for the matching `)'. */
13073 /* Consume the `['. */
13075 /* Look for the matching `]'. */
13090 {
13097 /* Consume the string. */
13103 {
13106 }
13107 else
13108 {
13110 /* Look for the suffix identifier. */
13115 {
13119 }
13120 else
13121 {
13124 }
13125 }
13130 {
13133 }
13136 {
13139 }
13141 {
13144 }
13146 }
13149 /* Anything else is an error. */
13151 }
13153 /* If we have selected an identifier, we need to consume the
13154 operator token. */
13157 /* Otherwise, no valid operator name was present. */
13158 else
13159 {
13162 }
13165 }
13167 /* Parse a template-declaration.
13169 template-declaration:
13170 export [opt] template < template-parameter-list > declaration
13172 If MEMBER_P is TRUE, this template-declaration occurs within a
13173 class-specifier.
13175 The grammar rule given by the standard isn't correct. What
13176 is really meant is:
13178 template-declaration:
13179 export [opt] template-parameter-list-seq
13180 decl-specifier-seq [opt] init-declarator [opt] ;
13181 export [opt] template-parameter-list-seq
13182 function-definition
13184 template-parameter-list-seq:
13185 template-parameter-list-seq [opt]
13186 template < template-parameter-list > */
13188 static void
13190 {
13191 /* Check for `export'. */
13193 {
13194 /* Consume the `export' token. */
13196 /* Warn that we do not support `export'. */
13198 }
13201 }
13203 /* Parse a template-parameter-list.
13205 template-parameter-list:
13206 template-parameter
13207 template-parameter-list , template-parameter
13209 Returns a TREE_LIST. Each node represents a template parameter.
13210 The nodes are connected via their TREE_CHAINs. */
13212 static tree
13214 {
13219 /* The loop below parses the template parms. We first need to know
13220 the total number of template parms to be able to compute proper
13221 canonical types of each dependent type. So after the loop, when
13222 we know the total number of template parms,
13223 end_template_parm_list computes the proper canonical types and
13224 fixes up the dependent types accordingly. */
13226 {
13227 tree parameter;
13230 location_t parm_loc;
13232 /* Parse the template-parameter. */
13237 /* Add it to the list. */
13240 parm_loc,
13241 parameter,
13242 is_non_type,
13243 is_parameter_pack);
13244 else
13245 {
13248 }
13250 /* If the next token is not a `,', we're done. */
13253 /* Otherwise, consume the `,' token. */
13255 }
13258 }
13260 /* Parse a template-parameter.
13262 template-parameter:
13263 type-parameter
13264 parameter-declaration
13266 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13267 the parameter. The TREE_PURPOSE is the default value, if any.
13268 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13269 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13270 set to true iff this parameter is a parameter pack. */
13272 static tree
13275 {
13279 tree parm;
13281 /* Assume it is a type parameter or a template parameter. */
13283 /* Assume it not a parameter pack. */
13285 /* Peek at the next token. */
13287 /* If it is `class' or `template', we have a type-parameter. */
13290 /* If it is `class' or `typename' we do not know yet whether it is a
13291 type parameter or a non-type parameter. Consider:
13293 template <typename T, typename T::X X> ...
13295 or:
13297 template <class C, class D*> ...
13299 Here, the first parameter is a type parameter, and the second is
13300 a non-type parameter. We can tell by looking at the token after
13301 the identifier -- if it is a `,', `=', or `>' then we have a type
13302 parameter. */
13304 {
13305 /* Peek at the token after `class' or `typename'. */
13307 /* If it's an ellipsis, we have a template type parameter
13308 pack. */
13311 /* If it's an identifier, skip it. */
13314 /* Now, see if the token looks like the end of a template
13315 parameter. */
13320 }
13322 /* Otherwise, it is a non-type parameter.
13324 [temp.param]
13326 When parsing a default template-argument for a non-type
13327 template-parameter, the first non-nested `>' is taken as the end
13328 of the template parameter-list rather than a greater-than
13329 operator. */
13331 parameter_declarator
13338 /* If the parameter declaration is marked as a parameter pack, set
13339 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13340 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13341 grokdeclarator. */
13344 {
13347 }
13350 {
13351 /* Can happen in some cases of erroneous input (c++/34892). */
13353 /* Consume the `...' for better error recovery. */
13355 }
13356 /* If the next token is an ellipsis, and we don't already have it
13357 marked as a parameter pack, then we have a parameter pack (that
13358 has no declarator). */
13361 && (declarator_can_be_parameter_pack
13363 {
13364 /* Consume the `...'. */
13369 }
13370 /* We might end up with a pack expansion as the type of the non-type
13371 template parameter, in which case this is a non-type template
13372 parameter pack. */
13375 {
13379 }
13382 {
13383 /* Parameter packs cannot have default arguments. However, a
13384 user may try to do so, so we'll parse them and give an
13385 appropriate diagnostic here. */
13389 /* Find the name of the parameter pack. */
13398 else
13402 /* Parse the default argument, but throw away the result. */
13404 }
13414 }
13416 /* Parse a type-parameter.
13418 type-parameter:
13419 class identifier [opt]
13420 class identifier [opt] = type-id
13421 typename identifier [opt]
13422 typename identifier [opt] = type-id
13423 template < template-parameter-list > class identifier [opt]
13424 template < template-parameter-list > class identifier [opt]
13425 = id-expression
13427 GNU Extension (variadic templates):
13429 type-parameter:
13430 class ... identifier [opt]
13431 typename ... identifier [opt]
13433 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13434 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13435 the declaration of the parameter.
13437 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13439 static tree
13441 {
13443 tree parameter;
13445 /* Look for a keyword to tell us what kind of parameter this is. */
13451 {
13454 {
13455 tree identifier;
13456 tree default_argument;
13458 /* If the next token is an ellipsis, we have a template
13459 argument pack. */
13461 {
13462 /* Consume the `...' token. */
13467 }
13469 /* If the next token is an identifier, then it names the
13470 parameter. */
13473 else
13476 /* Create the parameter. */
13479 /* If the next token is an `=', we have a default argument. */
13481 {
13482 /* Consume the `=' token. */
13484 /* Parse the default-argument. */
13488 /* Template parameter packs cannot have default
13489 arguments. */
13491 {
13494 "template parameter pack %qD cannot have a "
13496 else
13498 "template parameter packs cannot have "
13501 }
13503 }
13504 else
13507 /* Create the combined representation of the parameter and the
13508 default argument. */
13510 }
13514 {
13515 tree identifier;
13516 tree default_argument;
13518 /* Look for the `<'. */
13520 /* Parse the template-parameter-list. */
13522 /* Look for the `>'. */
13524 /* Look for the `class' or 'typename' keywords. */
13526 /* If the next token is an ellipsis, we have a template
13527 argument pack. */
13529 {
13530 /* Consume the `...' token. */
13535 }
13536 /* If the next token is an `=', then there is a
13537 default-argument. If the next token is a `>', we are at
13538 the end of the parameter-list. If the next token is a `,',
13539 then we are at the end of this parameter. */
13543 {
13545 /* Treat invalid names as if the parameter were nameless. */
13548 }
13549 else
13552 /* Create the template parameter. */
13554 identifier);
13556 /* If the next token is an `=', then there is a
13557 default-argument. */
13559 {
13562 /* Consume the `='. */
13564 /* Parse the id-expression. */
13566 /* save token before parsing the id-expression, for error
13567 reporting */
13569 default_argument
13577 /* If the id-expression was a template-id that refers to
13578 a template-class, we already have the declaration here,
13579 so no further lookup is needed. */
13580 ;
13581 else
13582 /* Look up the name. */
13583 default_argument
13585 none_type,
13591 /* See if the default argument is valid. */
13592 default_argument
13595 /* Template parameter packs cannot have default
13596 arguments. */
13598 {
13601 "template parameter pack %qD cannot "
13603 identifier);
13604 else
13608 }
13610 }
13611 else
13614 /* Create the combined representation of the parameter and the
13615 default argument. */
13617 }
13623 }
13626 }
13628 /* Parse a template-id.
13630 template-id:
13631 template-name < template-argument-list [opt] >
13633 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13634 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13635 returned. Otherwise, if the template-name names a function, or set
13636 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13637 names a class, returns a TYPE_DECL for the specialization.
13639 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13640 uninstantiated templates. */
13642 static tree
13648 {
13650 tree templ;
13651 tree arguments;
13652 tree template_id;
13659 /* If the next token corresponds to a template-id, there is no need
13660 to reparse it. */
13663 {
13666 /* Get the stored value. */
13668 /* Perform any access checks that were deferred. */
13671 {
13676 tf_warning_or_error);
13677 }
13678 /* Return the stored value. */
13680 }
13682 /* Avoid performing name lookup if there is no possibility of
13683 finding a template-id. */
13686 && !cp_parser_nth_token_starts_template_argument_list_p
13688 {
13691 }
13693 /* Remember where the template-id starts. */
13699 /* Parse the template-name. */
13702 check_dependency_p,
13703 is_declaration,
13704 tag_type,
13707 {
13710 }
13712 /* If we find the sequence `[:' after a template-name, it's probably
13713 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13714 parse correctly the argument list. */
13721 {
13723 /* Change `:' into `::'. */
13725 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13726 CPP_LESS. */
13729 /* Parse the arguments. */
13732 {
13733 /* If we couldn't parse an argument list, then we revert our changes
13734 and return simply an error. Maybe this is not a template-id
13735 after all. */
13740 }
13741 /* Otherwise, emit an error about the invalid digraph, but continue
13742 parsing because we got our argument list. */
13745 {
13748 "%<<:%> is an alternate spelling for %<[%>."
13751 {
13753 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13756 }
13757 }
13758 }
13759 else
13760 {
13761 /* Look for the `<' that starts the template-argument-list. */
13763 {
13766 }
13767 /* Parse the arguments. */
13769 }
13771 /* Build a representation of the specialization. */
13774 TEMPLATE_ID_EXPR,
13778 {
13780 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13781 template (rather than some instantiation thereof) only if
13782 is not nested within some other construct. For example, in
13783 "template <typename T> void f(T) { A<T>::", A<T> is just an
13784 instantiation of A. */
13787 CPP_SCOPE));
13788 template_id
13790 }
13792 {
13794 }
13795 else
13796 {
13797 /* If it's not a class-template or a template-template, it should be
13798 a function-template. */
13804 }
13806 /* If parsing tentatively, replace the sequence of tokens that makes
13807 up the template-id with a CPP_TEMPLATE_ID token. That way,
13808 should we re-parse the token stream, we will not have to repeat
13809 the effort required to do the parse, nor will we issue duplicate
13810 error messages about problems during instantiation of the
13811 template. */
13813 /* Don't do this if we had a parse error in a declarator; re-parsing
13814 might succeed if a name changes meaning (60361). */
13818 {
13821 /* Reset the contents of the START_OF_ID token. */
13823 /* Retrieve any deferred checks. Do not pop this access checks yet
13824 so the memory will not be reclaimed during token replacing below. */
13830 /* Purge all subsequent tokens. */
13833 /* ??? Can we actually assume that, if template_id ==
13834 error_mark_node, we will have issued a diagnostic to the
13835 user, as opposed to simply marking the tentative parse as
13836 failed? */
13839 }
13843 }
13845 /* Parse a template-name.
13847 template-name:
13848 identifier
13850 The standard should actually say:
13852 template-name:
13853 identifier
13854 operator-function-id
13856 A defect report has been filed about this issue.
13858 A conversion-function-id cannot be a template name because they cannot
13859 be part of a template-id. In fact, looking at this code:
13861 a.operator K<int>()
13863 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13864 It is impossible to call a templated conversion-function-id with an
13865 explicit argument list, since the only allowed template parameter is
13866 the type to which it is converting.
13868 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13869 `template' keyword, in a construction like:
13871 T::template f<3>()
13873 In that case `f' is taken to be a template-name, even though there
13874 is no way of knowing for sure.
13876 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13877 name refers to a set of overloaded functions, at least one of which
13878 is a template, or an IDENTIFIER_NODE with the name of the template,
13879 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13880 names are looked up inside uninstantiated templates. */
13882 static tree
13889 {
13890 tree identifier;
13891 tree decl;
13892 tree fns;
13895 /* If the next token is `operator', then we have either an
13896 operator-function-id or a conversion-function-id. */
13898 {
13899 /* We don't know whether we're looking at an
13900 operator-function-id or a conversion-function-id. */
13902 /* Try an operator-function-id. */
13904 /* If that didn't work, try a conversion-function-id. */
13906 {
13909 }
13910 }
13911 /* Look for the identifier. */
13912 else
13915 /* If we didn't find an identifier, we don't have a template-id. */
13919 /* If the name immediately followed the `template' keyword, then it
13920 is a template-name. However, if the next token is not `<', then
13921 we do not treat it as a template-name, since it is not being used
13922 as part of a template-id. This enables us to handle constructs
13923 like:
13925 template <typename T> struct S { S(); };
13926 template <typename T> S<T>::S();
13928 correctly. We would treat `S' as a template -- if it were `S<T>'
13929 -- but we do not if there is no `<'. */
13933 {
13934 /* In a declaration, in a dependent context, we pretend that the
13935 "template" keyword was present in order to improve error
13936 recovery. For example, given:
13938 template <typename T> void f(T::X<int>);
13940 we want to treat "X<int>" as a template-id. */
13942 && !template_keyword_p
13944 && check_dependency_p
13946 /* Do not do this for dtors (or ctors), since they never
13947 need the template keyword before their name. */
13949 {
13952 /* Explain what went wrong. */
13954 identifier);
13957 /* If parsing tentatively, find the location of the "<" token. */
13960 /* Parse the template arguments so that we can issue error
13961 messages about them. */
13964 /* Skip tokens until we find a good place from which to
13965 continue parsing. */
13970 /* If parsing tentatively, permanently remove the
13971 template argument list. That will prevent duplicate
13972 error messages from being issued about the missing
13973 "template" keyword. */
13979 }
13981 /* If the "template" keyword is present, then there is generally
13982 no point in doing name-lookup, so we just return IDENTIFIER.
13983 But, if the qualifying scope is non-dependent then we can
13984 (and must) do name-lookup normally. */
13990 }
13992 /* Look up the name. */
13994 tag_type,
13997 check_dependency_p,
14001 /* If DECL is a template, then the name was a template-name. */
14003 {
14007 }
14008 else
14009 {
14012 /* The standard does not explicitly indicate whether a name that
14013 names a set of overloaded declarations, some of which are
14014 templates, is a template-name. However, such a name should
14015 be a template-name; otherwise, there is no way to form a
14016 template-id for the overloaded templates. */
14024 {
14025 /* The name does not name a template. */
14028 }
14029 }
14031 /* If DECL is dependent, and refers to a function, then just return
14032 its name; we will look it up again during template instantiation. */
14034 {
14038 }
14041 }
14043 /* Parse a template-argument-list.
14045 template-argument-list:
14046 template-argument ... [opt]
14047 template-argument-list , template-argument ... [opt]
14049 Returns a TREE_VEC containing the arguments. */
14051 static tree
14053 {
14058 tree vec;
14065 /* Even if the template-id appears in an integral
14066 constant-expression, the contents of the argument list do
14067 not. */
14073 /* Parse the arguments. */
14074 do
14075 {
14076 tree argument;
14079 /* Consume the comma. */
14082 /* Parse the template-argument. */
14085 /* If the next token is an ellipsis, we're expanding a template
14086 argument pack. */
14088 {
14090 {
14094 }
14095 /* Consume the `...' token. */
14098 /* Make the argument into a TYPE_PACK_EXPANSION or
14099 EXPR_PACK_EXPANSION. */
14101 }
14104 {
14108 {
14111 }
14112 else
14114 }
14116 }
14129 #ifdef ENABLE_CHECKING
14131 #endif
14133 }
14135 /* Parse a template-argument.
14137 template-argument:
14138 assignment-expression
14139 type-id
14140 id-expression
14142 The representation is that of an assignment-expression, type-id, or
14143 id-expression -- except that the qualified id-expression is
14144 evaluated, so that the value returned is either a DECL or an
14145 OVERLOAD.
14147 Although the standard says "assignment-expression", it forbids
14148 throw-expressions or assignments in the template argument.
14149 Therefore, we use "conditional-expression" instead. */
14151 static tree
14153 {
14154 tree argument;
14160 cp_id_kind idk;
14162 /* There's really no way to know what we're looking at, so we just
14163 try each alternative in order.
14165 [temp.arg]
14167 In a template-argument, an ambiguity between a type-id and an
14168 expression is resolved to a type-id, regardless of the form of
14169 the corresponding template-parameter.
14171 Therefore, we try a type-id first. */
14174 /* If there was no error parsing the type-id but the next token is a
14175 '>>', our behavior depends on which dialect of C++ we're
14176 parsing. In C++98, we probably found a typo for '> >'. But there
14177 are type-id which are also valid expressions. For instance:
14179 struct X { int operator >> (int); };
14180 template <int V> struct Foo {};
14181 Foo<X () >> 5> r;
14183 Here 'X()' is a valid type-id of a function type, but the user just
14184 wanted to write the expression "X() >> 5". Thus, we remember that we
14185 found a valid type-id, but we still try to parse the argument as an
14186 expression to see what happens.
14188 In C++0x, the '>>' will be considered two separate '>'
14189 tokens. */
14193 {
14196 }
14197 else
14198 {
14199 /* If the next token isn't a `,' or a `>', then this argument wasn't
14200 really finished. This means that the argument is not a valid
14201 type-id. */
14204 /* If that worked, we're done. */
14207 }
14208 /* We're still not sure what the argument will be. */
14210 /* Try a template. */
14218 /* If the next token isn't a `,' or a `>', then this argument wasn't
14219 really finished. */
14223 {
14224 /* Figure out what is being referred to. If the id-expression
14225 was for a class template specialization, then we will have a
14226 TYPE_DECL at this point. There is no need to do name lookup
14227 at this point in that case. */
14230 none_type,
14239 }
14241 {
14245 }
14246 /* It must be a non-type argument. There permitted cases are given
14247 in [temp.arg.nontype]:
14249 -- an integral constant-expression of integral or enumeration
14250 type; or
14252 -- the name of a non-type template-parameter; or
14254 -- the name of an object or function with external linkage...
14256 -- the address of an object or function with external linkage...
14258 -- a pointer to member... */
14259 /* Look for a non-type template parameter. */
14261 {
14273 }
14275 /* If the next token is "&", the argument must be the address of an
14276 object or function with external linkage. */
14279 {
14282 }
14283 /* See if we might have an id-expression. */
14290 {
14293 address_p,
14300 else
14301 {
14302 tree probe;
14305 {
14306 /* Strip the dereference temporarily. */
14309 }
14311 /* If we're in a template, we represent a qualified-id referring
14312 to a static data member as a SCOPE_REF even if the scope isn't
14313 dependent so that we can check access control later. */
14318 {
14319 /* A variable without external linkage might still be a
14320 valid constant-expression, so no error is issued here
14321 if the external-linkage check fails. */
14324 }
14326 /* All overloaded functions are allowed; if the external
14327 linkage test does not pass, an error will be issued
14328 later. */
14329 ;
14333 /* A pointer-to-member. */
14334 ;
14336 ;
14337 else
14341 {
14344 tf_warning_or_error);
14345 else
14348 }
14349 }
14350 }
14351 /* If the argument started with "&", there are no other valid
14352 alternatives at this point. */
14354 {
14357 }
14359 /* If the argument wasn't successfully parsed as a type-id followed
14360 by '>>', the argument can only be a constant expression now.
14361 Otherwise, we try parsing the constant-expression tentatively,
14362 because the argument could really be a type-id. */
14373 /* We did our best to parse the argument as a non type-id, but that
14374 was the only alternative that matched (albeit with a '>' after
14375 it). We can assume it's just a typo from the user, and a
14376 diagnostic will then be issued. */
14378 }
14380 /* Parse an explicit-instantiation.
14382 explicit-instantiation:
14383 template declaration
14385 Although the standard says `declaration', what it really means is:
14387 explicit-instantiation:
14388 template decl-specifier-seq [opt] declarator [opt] ;
14390 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14391 supposed to be allowed. A defect report has been filed about this
14392 issue.
14394 GNU Extension:
14396 explicit-instantiation:
14397 storage-class-specifier template
14398 decl-specifier-seq [opt] declarator [opt] ;
14399 function-specifier template
14400 decl-specifier-seq [opt] declarator [opt] ; */
14402 static void
14404 {
14406 cp_decl_specifier_seq decl_specifiers;
14411 /* Look for an (optional) storage-class-specifier or
14412 function-specifier. */
14414 {
14415 extension_specifier
14418 extension_specifier
14421 }
14423 /* Look for the `template' keyword. */
14425 /* Let the front end know that we are processing an explicit
14426 instantiation. */
14428 /* [temp.explicit] says that we are supposed to ignore access
14429 control while processing explicit instantiation directives. */
14431 /* Parse a decl-specifier-seq. */
14433 CP_PARSER_FLAGS_OPTIONAL,
14436 /* If there was exactly one decl-specifier, and it declared a class,
14437 and there's no declarator, then we have an explicit type
14438 instantiation. */
14440 {
14441 tree type;
14445 /* Turn access control back on for names used during
14446 template instantiation. */
14451 }
14452 else
14453 {
14455 tree decl;
14457 /* Parse the declarator. */
14458 declarator
14469 {
14472 "explicit instantiation shall not use"
14476 "explicit instantiation shall not use"
14481 /* Turn access control back on for names used during
14482 template instantiation. */
14484 /* Do the explicit instantiation. */
14486 }
14487 else
14488 {
14490 /* Skip the body of the explicit instantiation. */
14492 }
14493 }
14494 /* We're done with the instantiation. */
14500 }
14502 /* Parse an explicit-specialization.
14504 explicit-specialization:
14505 template < > declaration
14507 Although the standard says `declaration', what it really means is:
14509 explicit-specialization:
14510 template <> decl-specifier [opt] init-declarator [opt] ;
14511 template <> function-definition
14512 template <> explicit-specialization
14513 template <> template-declaration */
14515 static void
14517 {
14521 /* Look for the `template' keyword. */
14523 /* Look for the `<'. */
14525 /* Look for the `>'. */
14527 /* We have processed another parameter list. */
14529 /* [temp]
14531 A template ... explicit specialization ... shall not have C
14532 linkage. */
14534 {
14536 /* Give it C++ linkage to avoid confusing other parts of the
14537 front end. */
14540 }
14541 else
14543 /* Let the front end know that we are beginning a specialization. */
14545 {
14548 }
14550 /* If the next keyword is `template', we need to figure out whether
14551 or not we're looking a template-declaration. */
14553 {
14558 else
14560 }
14561 else
14562 /* Parse the dependent declaration. */
14568 /* We're done with the specialization. */
14570 /* For the erroneous case of a template with C linkage, we pushed an
14571 implicit C++ linkage scope; exit that scope now. */
14574 /* We're done with this parameter list. */
14576 }
14578 /* Parse a type-specifier.
14580 type-specifier:
14581 simple-type-specifier
14582 class-specifier
14583 enum-specifier
14584 elaborated-type-specifier
14585 cv-qualifier
14587 GNU Extension:
14589 type-specifier:
14590 __complex__
14592 Returns a representation of the type-specifier. For a
14593 class-specifier, enum-specifier, or elaborated-type-specifier, a
14594 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14596 The parser flags FLAGS is used to control type-specifier parsing.
14598 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14599 in a decl-specifier-seq.
14601 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14602 class-specifier, enum-specifier, or elaborated-type-specifier, then
14603 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14604 if a type is declared; 2 if it is defined. Otherwise, it is set to
14605 zero.
14607 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14608 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14609 is set to FALSE. */
14611 static tree
14613 cp_parser_flags flags,
14618 {
14624 /* Assume this type-specifier does not declare a new type. */
14627 /* And that it does not specify a cv-qualifier. */
14630 /* Peek at the next token. */
14633 /* If we're looking at a keyword, we can use that to guide the
14634 production we choose. */
14637 {
14642 /* Look for the enum-specifier. */
14644 /* If that worked, we're done. */
14646 {
14651 type_spec,
14652 token,
14655 }
14656 else
14659 /* Any of these indicate either a class-specifier, or an
14660 elaborated-type-specifier. */
14667 /* Parse tentatively so that we can back up if we don't find a
14668 class-specifier. */
14670 /* Look for the class-specifier. */
14673 /* If that worked, we're done. */
14675 {
14680 type_spec,
14681 token,
14684 }
14686 /* Fall through. */
14687 elaborated_type_specifier:
14688 /* We're declaring (not defining) a class or enum. */
14692 /* Fall through. */
14694 /* Look for an elaborated-type-specifier. */
14695 type_spec
14696 = (cp_parser_elaborated_type_specifier
14699 is_declaration));
14702 type_spec,
14703 token,
14726 /* The `__complex__' keyword is a GNU extension. */
14732 }
14734 /* Handle simple keywords. */
14736 {
14738 {
14741 }
14743 }
14745 /* If we do not already have a type-specifier, assume we are looking
14746 at a simple-type-specifier. */
14748 decl_specs,
14749 flags);
14751 /* If we didn't find a type-specifier, and a type-specifier was not
14752 optional in this context, issue an error message. */
14754 {
14757 }
14760 }
14762 /* Parse a simple-type-specifier.
14764 simple-type-specifier:
14765 :: [opt] nested-name-specifier [opt] type-name
14766 :: [opt] nested-name-specifier template template-id
14767 char
14768 wchar_t
14769 bool
14770 short
14771 int
14772 long
14773 signed
14774 unsigned
14775 float
14776 double
14777 void
14779 C++0x Extension:
14781 simple-type-specifier:
14782 auto
14783 decltype ( expression )
14784 char16_t
14785 char32_t
14786 __underlying_type ( type-id )
14788 GNU Extension:
14790 simple-type-specifier:
14791 __int128
14792 __typeof__ unary-expression
14793 __typeof__ ( type-id )
14794 __typeof__ ( type-id ) { initializer-list , [opt] }
14796 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14797 appropriately updated. */
14799 static tree
14802 cp_parser_flags flags)
14803 {
14808 /* Peek at the next token. */
14811 /* If we're looking at a keyword, things are easy. */
14813 {
14848 {
14851 }
14880 {
14883 else
14887 {
14890 "use of %<auto%> in lambda parameter declaration "
14891 "only available with "
14893 }
14896 "use of %<auto%> in parameter declaration "
14897 "only available with "
14899 else
14901 "ISO C++ forbids use of %<auto%> in parameter "
14903 }
14904 else
14909 /* Since DR 743, decltype can either be a simple-type-specifier by
14910 itself or begin a nested-name-specifier. Parsing it will replace
14911 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14912 handling below decide what to do. */
14918 /* Consume the `typeof' token. */
14920 /* Parse the operand to `typeof'. */
14922 /* If it is not already a TYPE, take its type. */
14928 token,
14937 token,
14947 token,
14952 }
14954 /* If token is an already-parsed decltype not followed by ::,
14955 it's a simple-type-specifier. */
14958 {
14961 {
14963 token,
14965 /* Remember that we are handling a decltype in order to
14966 implement the resolution of DR 1510 when the argument
14967 isn't instantiation dependent. */
14969 }
14972 }
14974 /* If the type-specifier was for a built-in type, we're done. */
14976 {
14977 /* Record the type. */
14984 type,
14985 token,
14990 /* Consume the token. */
14996 /* There is no valid C++ program where a non-template type is
14997 followed by a "<". That usually indicates that the user thought
14998 that the type was a template. */
15003 }
15005 /* The type-specifier must be a user-defined type. */
15007 {
15011 /* Don't gobble tokens or issue error messages if this is an
15012 optional type-specifier. */
15016 /* Look for the optional `::' operator. */
15017 global_p
15021 /* Look for the nested-name specifier. */
15022 qualified_p
15030 /* If we have seen a nested-name-specifier, and the next token
15031 is `template', then we are using the template-id production. */
15034 {
15035 /* Look for the template-id. */
15039 none_type,
15041 /* If the template-id did not name a type, we are out of
15042 luck. */
15044 {
15047 }
15048 }
15049 /* Otherwise, look for a type-name. */
15050 else
15052 /* Keep track of all name-lookups performed in class scopes. */
15054 && !global_p
15055 && !qualified_p
15059 /* If it didn't work out, we don't have a TYPE. */
15065 token,
15067 }
15069 /* If we didn't get a type-name, issue an error message. */
15071 {
15074 }
15077 {
15078 /* See if TYPE is an Objective-C type, and if so, parse and
15079 accept any protocol references following it. Do this before
15080 the cp_parser_check_for_invalid_template_id() call, because
15081 Objective-C types can be followed by '<...>' which would
15082 enclose protocol names rather than template arguments, and so
15083 everything is fine. */
15086 {
15090 /* Clobber the "unqualified" type previously entered into
15091 DECL_SPECS with the new, improved protocol-qualified version. */
15096 }
15098 /* There is no valid C++ program where a non-template type is
15099 followed by a "<". That usually indicates that the user
15100 thought that the type was a template. */
15102 none_type,
15104 }
15107 }
15109 /* Parse a type-name.
15111 type-name:
15112 class-name
15113 enum-name
15114 typedef-name
15115 simple-template-id [in c++0x]
15117 enum-name:
15118 identifier
15120 typedef-name:
15121 identifier
15123 Returns a TYPE_DECL for the type. */
15125 static tree
15127 {
15128 tree type_decl;
15130 /* We can't know yet whether it is a class-name or not. */
15132 /* Try a class-name. */
15136 none_type,
15140 /* If it's not a class-name, keep looking. */
15142 {
15144 /* It must be a typedef-name or an enum-name. */
15148 /* It is either a simple-template-id representing an
15149 instantiation of an alias template... */
15153 none_type,
15155 /* Note that this must be an instantiation of an alias template
15156 because [temp.names]/6 says:
15158 A template-id that names an alias template specialization
15159 is a type-name.
15161 Whereas [temp.names]/7 says:
15163 A simple-template-id that names a class template
15164 specialization is a class-name. */
15169 else
15173 /* ... Or a typedef-name or an enum-name. */
15175 }
15178 }
15180 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15182 enum-name:
15183 identifier
15185 typedef-name:
15186 identifier
15188 Returns a TYPE_DECL for the type. */
15190 static tree
15192 {
15193 tree type_decl;
15194 tree identifier;
15201 /* Look up the type-name. */
15208 {
15209 /* See if this is an Objective-C type. */
15214 }
15216 /* Issue an error if we did not find a type-name. */
15218 /* In Objective-C, we have the complication that class names are
15219 normally type names and start declarations (eg, the
15220 "NSObject" in "NSObject *object;"), but can be used in an
15221 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15222 is an expression. So, a classname followed by a dot is not a
15223 valid type-name. */
15226 {
15231 }
15232 /* Remember that the name was used in the definition of the
15233 current class so that we can check later to see if the
15234 meaning would have been different after the class was
15235 entirely defined. */
15241 }
15243 /* Parse an elaborated-type-specifier. Note that the grammar given
15244 here incorporates the resolution to DR68.
15246 elaborated-type-specifier:
15247 class-key :: [opt] nested-name-specifier [opt] identifier
15248 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15249 enum-key :: [opt] nested-name-specifier [opt] identifier
15250 typename :: [opt] nested-name-specifier identifier
15251 typename :: [opt] nested-name-specifier template [opt]
15252 template-id
15254 GNU extension:
15256 elaborated-type-specifier:
15257 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15258 class-key attributes :: [opt] nested-name-specifier [opt]
15259 template [opt] template-id
15260 enum attributes :: [opt] nested-name-specifier [opt] identifier
15262 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15263 declared `friend'. If IS_DECLARATION is TRUE, then this
15264 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15265 something is being declared.
15267 Returns the TYPE specified. */
15269 static tree
15273 {
15275 tree identifier;
15278 tree globalscope;
15281 /* See if we're looking at the `enum' keyword. */
15283 {
15284 /* Consume the `enum' token. */
15286 /* Remember that it's an enumeration type. */
15288 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15289 enums) is used here. */
15292 {
15296 /* Consume the `struct' or `class' and parse it anyway. */
15298 }
15299 /* Parse the attributes. */
15301 }
15302 /* Or, it might be `typename'. */
15304 RID_TYPENAME))
15305 {
15306 /* Consume the `typename' token. */
15308 /* Remember that it's a `typename' type. */
15310 }
15311 /* Otherwise it must be a class-key. */
15312 else
15313 {
15317 /* Parse the attributes. */
15319 }
15321 /* Look for the `::' operator. */
15324 /* Look for the nested-name-specifier. */
15326 {
15331 is_declaration))
15333 }
15334 else
15335 /* Even though `typename' is not present, the proposed resolution
15336 to Core Issue 180 says that in `class A<T>::B', `B' should be
15337 considered a type-name, even if `A<T>' is dependent. */
15342 is_declaration);
15343 /* For everything but enumeration types, consider a template-id.
15344 For an enumeration type, consider only a plain identifier. */
15346 {
15348 tree decl;
15350 /* Allow the `template' keyword. */
15352 /* If we didn't see `template', we don't know if there's a
15353 template-id or not. */
15356 /* Parse the template-id. */
15360 tag_type,
15361 is_declaration);
15362 /* If we didn't find a template-id, look for an ordinary
15363 identifier. */
15365 ;
15366 /* We can get here when cp_parser_template_id, called by
15367 cp_parser_class_name with tag_type == none_type, succeeds
15368 and caches a BASELINK. Then, when called again here,
15369 instead of failing and returning an error_mark_node
15370 returns it (see template/typename17.C in C++11).
15371 ??? Could we diagnose this earlier? */
15373 {
15376 }
15377 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15378 in effect, then we must assume that, upon instantiation, the
15379 template will correspond to a class. */
15383 typename_type,
15385 /* If the `typename' keyword is in effect and DECL is not a type
15386 decl, then type is non existent. */
15388 ;
15394 }
15397 {
15402 {
15405 }
15407 /* For a `typename', we needn't call xref_tag. */
15413 /* Template parameter lists apply only if we are not within a
15414 function parameter list. */
15415 bool template_parm_lists_apply
15424 /* Look up a qualified name in the usual way. */
15426 {
15427 tree decl;
15428 tree ambiguous_decls;
15431 tag_type,
15438 /* If the lookup was ambiguous, an error will already have been
15439 issued. */
15443 /* If we are parsing friend declaration, DECL may be a
15444 TEMPLATE_DECL tree node here. However, we need to check
15445 whether this TEMPLATE_DECL results in valid code. Consider
15446 the following example:
15448 namespace N {
15449 template <class T> class C {};
15450 }
15451 class X {
15452 template <class T> friend class N::C; // #1, valid code
15453 };
15454 template <class T> class Y {
15455 friend class N::C; // #2, invalid code
15456 };
15458 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15459 name lookup of `N::C'. We see that friend declaration must
15460 be template for the code to be valid. Note that
15461 processing_template_decl does not work here since it is
15462 always 1 for the above two cases. */
15464 decl = (cp_parser_maybe_treat_template_as_class
15469 {
15471 identifier,
15474 }
15477 {
15481 allow_template);
15485 }
15487 /* Forward declarations of nested types, such as
15489 class C1::C2;
15490 class C1::C2::C3;
15492 are invalid unless all components preceding the final '::'
15493 are complete. If all enclosing types are complete, these
15494 declarations become merely pointless.
15496 Invalid forward declarations of nested types are errors
15497 caught elsewhere in parsing. Those that are pointless arrive
15498 here. */
15505 }
15506 else
15507 {
15508 /* An elaborated-type-specifier sometimes introduces a new type and
15509 sometimes names an existing type. Normally, the rule is that it
15510 introduces a new type only if there is not an existing type of
15511 the same name already in scope. For example, given:
15513 struct S {};
15514 void f() { struct S s; }
15516 the `struct S' in the body of `f' is the same `struct S' as in
15517 the global scope; the existing definition is used. However, if
15518 there were no global declaration, this would introduce a new
15519 local class named `S'.
15521 An exception to this rule applies to the following code:
15523 namespace N { struct S; }
15525 Here, the elaborated-type-specifier names a new type
15526 unconditionally; even if there is already an `S' in the
15527 containing scope this declaration names a new type.
15528 This exception only applies if the elaborated-type-specifier
15529 forms the complete declaration:
15531 [class.name]
15533 A declaration consisting solely of `class-key identifier ;' is
15534 either a redeclaration of the name in the current scope or a
15535 forward declaration of the identifier as a class name. It
15536 introduces the name into the current scope.
15538 We are in this situation precisely when the next token is a `;'.
15540 An exception to the exception is that a `friend' declaration does
15541 *not* name a new type; i.e., given:
15543 struct S { friend struct T; };
15545 `T' is not a new type in the scope of `S'.
15547 Also, `new struct S' or `sizeof (struct S)' never results in the
15548 definition of a new type; a new type can only be declared in a
15549 declaration context. */
15551 tag_scope ts;
15555 /* Friends have special name lookup rules. */
15559 CPP_SEMICOLON))
15560 /* This is a `class-key identifier ;' */
15562 else
15565 template_p =
15566 (template_parm_lists_apply
15569 /* An unqualified name was used to reference this type, so
15570 there were no qualifying templates. */
15578 }
15579 }
15584 /* Allow attributes on forward declarations of classes. */
15586 {
15596 else
15599 }
15602 {
15603 /* Indicate whether this class was declared as a `class' or as a
15604 `struct'. */
15608 }
15610 /* A "<" cannot follow an elaborated type specifier. If that
15611 happens, the user was probably trying to form a template-id. */
15616 }
15618 /* Parse an enum-specifier.
15620 enum-specifier:
15621 enum-head { enumerator-list [opt] }
15622 enum-head { enumerator-list , } [C++0x]
15624 enum-head:
15625 enum-key identifier [opt] enum-base [opt]
15626 enum-key nested-name-specifier identifier enum-base [opt]
15628 enum-key:
15629 enum
15630 enum class [C++0x]
15631 enum struct [C++0x]
15633 enum-base: [C++0x]
15634 : type-specifier-seq
15636 opaque-enum-specifier:
15637 enum-key identifier enum-base [opt] ;
15639 GNU Extensions:
15640 enum-key attributes[opt] identifier [opt] enum-base [opt]
15641 { enumerator-list [opt] }attributes[opt]
15642 enum-key attributes[opt] identifier [opt] enum-base [opt]
15643 { enumerator-list, }attributes[opt] [C++0x]
15645 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15646 if the token stream isn't an enum-specifier after all. */
15648 static tree
15650 {
15651 tree identifier;
15653 tree prev_scope;
15655 tree attributes;
15668 /* Parse tentatively so that we can back up if we don't find a
15669 enum-specifier. */
15672 /* Caller guarantees that the current token is 'enum', an identifier
15673 possibly follows, and the token after that is an opening brace.
15674 If we don't have an identifier, fabricate an anonymous name for
15675 the enumeration being defined. */
15678 /* Parse the "class" or "struct", which indicates a scoped
15679 enumeration type in C++0x. */
15682 {
15686 /* Consume the `struct' or `class' token. */
15690 }
15694 /* Clear the qualification. */
15699 /* Figure out in what scope the declaration is being placed. */
15705 nested_name_specifier
15713 {
15714 tree name;
15718 enum_type,
15723 input_location);
15725 {
15728 {
15729 /* Are template enums allowed in ISO? */
15733 /* ignore a typename reference, for it will be solved by name
15734 in start_enum. */
15736 }
15737 }
15740 else
15743 }
15744 else
15745 {
15748 else
15749 {
15755 }
15756 }
15759 /* Check for the `:' that denotes a specified underlying type in C++0x.
15760 Note that a ':' could also indicate a bitfield width, however. */
15762 {
15763 cp_decl_specifier_seq type_specifiers;
15765 /* Consume the `:'. */
15768 /* Parse the type-specifier-seq. */
15773 /* At this point this is surely not elaborated type specifier. */
15782 /* If that didn't work, stop. */
15784 {
15790 }
15791 }
15793 /* Look for the `{' but don't consume it yet. */
15795 {
15797 {
15800 {
15803 }
15804 }
15805 /* An opaque-enum-specifier must have a ';' here. */
15808 {
15811 {
15814 }
15815 }
15816 }
15822 {
15824 {
15828 }
15830 {
15832 }
15833 }
15835 /* Issue an error message if type-definitions are forbidden here. */
15838 else
15839 /* Create the new type. We do this before consuming the opening
15840 brace so the enum will be recorded as being on the line of its
15841 tag (or the 'enum' keyword, if there is no tag). */
15845 /* If the next token is not '{' it is an opaque-enum-specifier or an
15846 elaborated-type-specifier. */
15848 {
15852 {
15853 /* The following catches invalid code such as:
15854 enum class S<int>::E { A, B, C }; */
15862 {
15866 nested_name_specifier);
15868 }
15869 /* If that scope does not contain the scope in which the
15870 class was originally declared, the program is invalid. */
15872 nested_name_specifier))
15873 {
15876 "declaration of %qD in namespace %qD which does not "
15879 else
15881 "declaration of %qD in %qD which does not "
15885 }
15886 }
15891 /* Consume the opening brace. */
15898 {
15902 }
15903 else
15904 {
15910 }
15914 /* If the next token is not '}', then there are some enumerators. */
15916 {
15920 }
15921 else
15924 /* Consume the final '}'. */
15930 }
15931 else
15932 {
15933 /* If a ';' follows, then it is an opaque-enum-specifier
15934 and additional restrictions apply. */
15936 {
15943 }
15944 }
15946 /* Look for trailing attributes to apply to this enumeration, and
15947 apply them if appropriate. */
15949 {
15953 trailing_attr,
15955 }
15957 /* Finish up the enumeration. */
15959 {
15964 }
15967 {
15969 {
15972 }
15974 {
15976 }
15977 }
15978 out:
15981 }
15983 /* Parse an enumerator-list. The enumerators all have the indicated
15984 TYPE.
15986 enumerator-list:
15987 enumerator-definition
15988 enumerator-list , enumerator-definition */
15990 static void
15992 {
15994 {
15995 /* Parse an enumerator-definition. */
15998 /* If the next token is not a ',', we've reached the end of
15999 the list. */
16002 /* Otherwise, consume the `,' and keep going. */
16004 /* If the next token is a `}', there is a trailing comma. */
16006 {
16011 }
16012 }
16013 }
16015 /* Parse an enumerator-definition. The enumerator has the indicated
16016 TYPE.
16018 enumerator-definition:
16019 enumerator
16020 enumerator = constant-expression
16022 enumerator:
16023 identifier */
16025 static void
16027 {
16028 tree identifier;
16029 tree value;
16030 location_t loc;
16032 /* Save the input location because we are interested in the location
16033 of the identifier and not the location of the explicit value. */
16036 /* Look for the identifier. */
16041 /* If the next token is an '=', then there is an explicit value. */
16043 {
16044 /* Consume the `=' token. */
16046 /* Parse the value. */
16048 }
16049 else
16052 /* If we are processing a template, make sure the initializer of the
16053 enumerator doesn't contain any bare template parameter pack. */
16057 /* Create the enumerator. */
16059 }
16061 /* Parse a namespace-name.
16063 namespace-name:
16064 original-namespace-name
16065 namespace-alias
16067 Returns the NAMESPACE_DECL for the namespace. */
16069 static tree
16071 {
16072 tree identifier;
16073 tree namespace_decl;
16077 /* Get the name of the namespace. */
16082 /* Look up the identifier in the currently active scope. Look only
16083 for namespaces, due to:
16085 [basic.lookup.udir]
16087 When looking up a namespace-name in a using-directive or alias
16088 definition, only namespace names are considered.
16090 And:
16092 [basic.lookup.qual]
16094 During the lookup of a name preceding the :: scope resolution
16095 operator, object, function, and enumerator names are ignored.
16097 (Note that cp_parser_qualifying_entity only calls this
16098 function if the token after the name is the scope resolution
16099 operator.) */
16101 none_type,
16107 /* If it's not a namespace, issue an error. */
16110 {
16115 }
16118 }
16120 /* Parse a namespace-definition.
16122 namespace-definition:
16123 named-namespace-definition
16124 unnamed-namespace-definition
16126 named-namespace-definition:
16127 original-namespace-definition
16128 extension-namespace-definition
16130 original-namespace-definition:
16131 namespace identifier { namespace-body }
16133 extension-namespace-definition:
16134 namespace original-namespace-name { namespace-body }
16136 unnamed-namespace-definition:
16137 namespace { namespace-body } */
16139 static void
16141 {
16148 {
16152 }
16153 else
16156 /* Look for the `namespace' keyword. */
16159 /* Get the name of the namespace. We do not attempt to distinguish
16160 between an original-namespace-definition and an
16161 extension-namespace-definition at this point. The semantic
16162 analysis routines are responsible for that. */
16165 else
16168 /* Parse any specified attributes. */
16171 /* Look for the `{' to start the namespace. */
16173 /* Start the namespace. */
16176 /* "inline namespace" is equivalent to a stub namespace definition
16177 followed by a strong using directive. */
16179 {
16181 /* Set up namespace association. */
16185 /* Import the contents of the inline namespace. */
16189 }
16193 /* Parse the body of the namespace. */
16199 /* Finish the namespace. */
16201 /* Look for the final `}'. */
16203 }
16205 /* Parse a namespace-body.
16207 namespace-body:
16208 declaration-seq [opt] */
16210 static void
16212 {
16214 }
16216 /* Parse a namespace-alias-definition.
16218 namespace-alias-definition:
16219 namespace identifier = qualified-namespace-specifier ; */
16221 static void
16223 {
16224 tree identifier;
16225 tree namespace_specifier;
16229 /* Look for the `namespace' keyword. */
16231 /* Look for the identifier. */
16235 /* Look for the `=' token. */
16238 {
16240 /* Skip the definition. */
16245 }
16247 /* Look for the qualified-namespace-specifier. */
16248 namespace_specifier
16250 /* Look for the `;' token. */
16253 /* Register the alias in the symbol table. */
16255 }
16257 /* Parse a qualified-namespace-specifier.
16259 qualified-namespace-specifier:
16260 :: [opt] nested-name-specifier [opt] namespace-name
16262 Returns a NAMESPACE_DECL corresponding to the specified
16263 namespace. */
16265 static tree
16267 {
16268 /* Look for the optional `::'. */
16272 /* Look for the optional nested-name-specifier. */
16280 }
16282 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16283 access declaration.
16285 using-declaration:
16286 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16287 using :: unqualified-id ;
16289 access-declaration:
16290 qualified-id ;
16292 */
16294 static bool
16297 {
16301 tree decl;
16302 tree identifier;
16303 tree qscope;
16308 {
16311 }
16312 else
16313 {
16314 /* Look for the `using' keyword. */
16317 /* Peek at the next token. */
16319 /* See if it's `typename'. */
16321 {
16322 /* Remember that we've seen it. */
16324 /* Consume the `typename' token. */
16326 }
16327 }
16329 /* Look for the optional global scope qualification. */
16330 global_scope_p
16335 /* If we saw `typename', or didn't see `::', then there must be a
16336 nested-name-specifier present. */
16338 {
16344 {
16347 }
16348 }
16349 /* Otherwise, we could be in either of the two productions. In that
16350 case, treat the nested-name-specifier as optional. */
16351 else
16363 /* Something has already gone wrong; there's no need to parse
16364 further. Since an error has occurred, the return value of
16365 cp_parser_parse_definitely will be false, as required. */
16369 /* Parse the unqualified-id. */
16377 {
16382 }
16384 /* The function we call to handle a using-declaration is different
16385 depending on what scope we are in. */
16387 ;
16390 /* [namespace.udecl]
16392 A using declaration shall not name a template-id. */
16395 else
16396 {
16398 {
16399 /* Create the USING_DECL. */
16406 {
16409 }
16410 else
16411 /* Add it to the list of members in this class. */
16413 }
16414 else
16415 {
16417 identifier,
16424 {
16427 }
16430 else
16432 }
16433 }
16435 /* Look for the final `;'. */
16440 "access declarations are deprecated "
16441 "in favour of using-declarations; "
16445 }
16447 /* Parse an alias-declaration.
16449 alias-declaration:
16450 using identifier attribute-specifier-seq [opt] = type-id */
16452 static tree
16454 {
16456 location_t id_location;
16458 cp_decl_specifier_seq decl_specs;
16462 /* Look for the `using' keyword. */
16463 cp_token *using_token
16485 /* Now we are going to parse the type-id of the declaration. */
16487 /*
16488 [dcl.type]/3 says:
16490 "A type-specifier-seq shall not define a class or enumeration
16491 unless it appears in the type-id of an alias-declaration (7.1.3) that
16492 is not the declaration of a template-declaration."
16494 In other words, if we currently are in an alias template, the
16495 type-id should not define a type.
16497 So let's set parser->type_definition_forbidden_message in that
16498 case; cp_parser_check_type_definition (called by
16499 cp_parser_class_specifier) will then emit an error if a type is
16500 defined in the type-id. */
16502 {
16506 }
16510 /* Restore the error message if need be. */
16516 {
16519 }
16521 /* A typedef-name can also be introduced by an alias-declaration. The
16522 identifier following the using keyword becomes a typedef-name. It has
16523 the same semantics as if it were introduced by the typedef
16524 specifier. In particular, it does not define a new type and it shall
16525 not appear in the type-id. */
16530 {
16533 ds_attribute,
16534 attrs_token);
16535 }
16537 ds_typedef,
16538 using_token);
16540 ds_alias,
16541 using_token);
16550 else
16561 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16562 added into the symbol table; otherwise, return the TYPE_DECL. */
16566 {
16570 }
16573 }
16575 /* Parse a using-directive.
16577 using-directive:
16578 using namespace :: [opt] nested-name-specifier [opt]
16579 namespace-name ; */
16581 static void
16583 {
16584 tree namespace_decl;
16585 tree attribs;
16587 /* Look for the `using' keyword. */
16589 /* And the `namespace' keyword. */
16591 /* Look for the optional `::' operator. */
16593 /* And the optional nested-name-specifier. */
16599 /* Get the namespace being used. */
16601 /* And any specified attributes. */
16603 /* Update the symbol table. */
16605 /* Look for the final `;'. */
16607 }
16609 /* Parse an asm-definition.
16611 asm-definition:
16612 asm ( string-literal ) ;
16614 GNU Extension:
16616 asm-definition:
16617 asm volatile [opt] ( string-literal ) ;
16618 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16619 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16620 : asm-operand-list [opt] ) ;
16621 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16622 : asm-operand-list [opt]
16623 : asm-clobber-list [opt] ) ;
16624 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16625 : asm-clobber-list [opt]
16626 : asm-goto-list ) ; */
16628 static void
16630 {
16631 tree string;
16636 tree asm_stmt;
16644 /* Look for the `asm' keyword. */
16649 {
16652 }
16654 /* See if the next token is `volatile'. */
16657 {
16658 /* Remember that we saw the `volatile' keyword. */
16660 /* Consume the token. */
16662 }
16666 {
16667 /* Remember that we saw the `goto' keyword. */
16669 /* Consume the token. */
16671 }
16672 /* Look for the opening `('. */
16675 /* Look for the string. */
16678 {
16682 }
16684 /* If we're allowing GNU extensions, check for the extended assembly
16685 syntax. Unfortunately, the `:' tokens need not be separated by
16686 a space in C, and so, for compatibility, we tolerate that here
16687 too. Doing that means that we have to treat the `::' operator as
16688 two `:' tokens. */
16693 {
16698 /* The extended syntax was used. */
16701 /* Look for outputs. */
16703 {
16704 /* Consume the `:'. */
16706 /* Parse the output-operands. */
16708 CPP_COLON)
16710 CPP_SCOPE)
16712 CPP_CLOSE_PAREN)
16718 }
16719 /* If the next token is `::', there are no outputs, and the
16720 next token is the beginning of the inputs. */
16722 /* The inputs are coming next. */
16725 /* Look for inputs. */
16728 {
16729 /* Consume the `:' or `::'. */
16731 /* Parse the output-operands. */
16733 CPP_COLON)
16735 CPP_SCOPE)
16737 CPP_CLOSE_PAREN))
16742 }
16744 /* The clobbers are coming next. */
16747 /* Look for clobbers. */
16750 {
16752 /* Consume the `:' or `::'. */
16754 /* Parse the clobbers. */
16756 CPP_COLON)
16758 CPP_CLOSE_PAREN))
16760 }
16763 /* The labels are coming next. */
16766 /* Look for labels. */
16769 {
16771 /* Consume the `:' or `::'. */
16773 /* Parse the labels. */
16775 }
16779 }
16783 /* Look for the closing `)'. */
16791 {
16792 /* Create the ASM_EXPR. */
16794 {
16797 /* If the extended syntax was not used, mark the ASM_EXPR. */
16799 {
16805 }
16806 }
16807 else
16809 }
16810 }
16812 /* Declarators [gram.dcl.decl] */
16814 /* Parse an init-declarator.
16816 init-declarator:
16817 declarator initializer [opt]
16819 GNU Extension:
16821 init-declarator:
16822 declarator asm-specification [opt] attributes [opt] initializer [opt]
16824 function-definition:
16825 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16826 function-body
16827 decl-specifier-seq [opt] declarator function-try-block
16829 GNU Extension:
16831 function-definition:
16832 __extension__ function-definition
16834 TM Extension:
16836 function-definition:
16837 decl-specifier-seq [opt] declarator function-transaction-block
16839 The DECL_SPECIFIERS apply to this declarator. Returns a
16840 representation of the entity declared. If MEMBER_P is TRUE, then
16841 this declarator appears in a class scope. The new DECL created by
16842 this declarator is returned.
16844 The CHECKS are access checks that should be performed once we know
16845 what entity is being declared (and, therefore, what classes have
16846 befriended it).
16848 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16849 for a function-definition here as well. If the declarator is a
16850 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16851 be TRUE upon return. By that point, the function-definition will
16852 have been completely parsed.
16854 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16855 is FALSE.
16857 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16858 parsed declaration if it is an uninitialized single declarator not followed
16859 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16860 if present, will not be consumed. If returned, this declarator will be
16861 created with SD_INITIALIZED but will not call cp_finish_decl.
16863 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16864 and there is an initializer, the pointed location_t is set to the
16865 location of the '=' or `(', or '{' in C++11 token introducing the
16866 initializer. */
16868 static tree
16878 {
16882 tree prefix_attributes;
16884 tree asm_specification;
16885 tree initializer;
16887 tree scope;
16889 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16890 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16891 "(...)". */
16902 /* Gather the attributes that were provided with the
16903 decl-specifiers. */
16906 /* Assume that this is not the declarator for a function
16907 definition. */
16911 /* Default arguments are only permitted for function parameters. */
16915 /* Defer access checks while parsing the declarator; we cannot know
16916 what names are accessible until we know what is being
16917 declared. */
16920 /* Parse the declarator. */
16922 declarator
16927 /* Gather up the deferred checks. */
16932 /* If the DECLARATOR was erroneous, there's no need to go
16933 further. */
16937 /* Check that the number of template-parameter-lists is OK. */
16947 /* Figure out what scope the entity declared by the DECLARATOR is
16948 located in. `grokdeclarator' sometimes changes the scope, so
16949 we compute it now. */
16952 /* Perform any lookups in the declared type which were thought to be
16953 dependent, but are not in the scope of the declarator. */
16954 decl_specifiers->type
16957 /* If we're allowing GNU extensions, look for an
16958 asm-specification. */
16960 {
16961 /* Look for an asm-specification. */
16964 }
16965 else
16968 /* Look for attributes. */
16972 /* Peek at the next token. */
16978 {
16979 /* Check to see if the token indicates the start of a
16980 function-definition. */
16982 {
16984 {
16985 /* If a function-definition should not appear here, issue an
16986 error message. */
16990 }
16992 location_t func_brace_location
16995 /* Neither attributes nor an asm-specification are allowed
16996 on a function-definition. */
16999 "an asm-specification is not allowed "
17003 "attributes are not allowed "
17005 /* This is a function-definition. */
17008 /* Parse the function definition. */
17011 decl_specifiers,
17012 declarator,
17013 prefix_attributes);
17014 else
17015 decl =
17016 (cp_parser_function_definition_from_specifiers_and_declarator
17020 {
17021 /* This is where the prologue starts... */
17024 }
17027 }
17028 }
17030 {
17031 /* A non-template declaration involving a function parameter list
17032 containing an implicit template parameter will be made into a
17033 template. If the resulting declaration is not going to be an
17034 actual function then finish the template scope here to prevent it.
17035 An error message will be issued once we have a decl to talk about.
17037 FIXME probably we should do type deduction rather than create an
17038 implicit template, but the standard currently doesn't allow it. */
17041 }
17043 /* [dcl.dcl]
17045 Only in function declarations for constructors, destructors, and
17046 type conversions can the decl-specifier-seq be omitted.
17048 We explicitly postpone this check past the point where we handle
17049 function-definitions because we tolerate function-definitions
17050 that are missing their return types in some modes. */
17052 {
17056 }
17058 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17062 {
17073 {
17079 }
17080 }
17081 else
17082 {
17083 /* If the init-declarator isn't initialized and isn't followed by a
17084 `,' or `;', it's not a valid init-declarator. */
17087 {
17090 else
17091 {
17095 }
17096 }
17099 }
17101 /* Because start_decl has side-effects, we should only call it if we
17102 know we're going ahead. By this point, we know that we cannot
17103 possibly be looking at any other construct. */
17106 /* Enter the newly declared entry in the symbol table. If we're
17107 processing a declaration in a class-specifier, we wait until
17108 after processing the initializer. */
17110 {
17117 /* Adjust location of decl if declarator->id_loc is more appropriate:
17118 set, and decl wasn't merged with another decl, in which case its
17119 location would be different from input_location, and more accurate. */
17124 }
17126 /* Enter the SCOPE. That way unqualified names appearing in the
17127 initializer will be looked up in SCOPE. */
17130 /* Perform deferred access control checks, now that we know in which
17131 SCOPE the declared entity resides. */
17133 {
17136 /* If the entity being declared is a function, pretend that we
17137 are in its scope. If it is a `friend', it may have access to
17138 things that would not otherwise be accessible. */
17140 {
17143 }
17145 /* Perform access checks for template parameters. */
17148 /* Perform the access control checks for the declarator and the
17149 decl-specifiers. */
17152 /* Restore the saved value. */
17155 }
17157 /* Parse the initializer. */
17162 {
17164 {
17167 else
17168 {
17169 /* If the declaration was erroneous, we don't really
17170 know what the user intended, so just silently
17171 consume the initializer. */
17178 }
17179 }
17180 else
17181 {
17182 /* We want to record the extra mangling scope for in-class
17183 initializers of class members and initializers of static data
17184 member templates. The former involves deferring
17185 parsing of the initializer until end of class as with default
17186 arguments. So right here we only handle the latter. */
17196 }
17197 }
17199 /* The old parser allows attributes to appear after a parenthesized
17200 initializer. Mark Mitchell proposed removing this functionality
17201 on the GCC mailing lists on 2002-08-13. This parser accepts the
17202 attributes -- but ignores them. */
17209 /* And now complain about a non-function implicit template. */
17214 /* For an in-class declaration, use `grokfield' to create the
17215 declaration. */
17217 {
17219 {
17222 }
17230 }
17232 /* Finish processing the declaration. But, skip member
17233 declarations. */
17235 {
17238 asm_specification,
17239 /* If the initializer is in parentheses, then this is
17240 a direct-initialization, which means that an
17241 `explicit' constructor is OK. Otherwise, an
17242 `explicit' constructor cannot be used. */
17245 }
17248 /* Core issue #226 (C++0x only): A default template-argument
17249 shall not be specified in a friend class template
17250 declaration. */
17259 {
17262 else
17264 }
17267 }
17269 /* Parse a declarator.
17271 declarator:
17272 direct-declarator
17273 ptr-operator declarator
17275 abstract-declarator:
17276 ptr-operator abstract-declarator [opt]
17277 direct-abstract-declarator
17279 GNU Extensions:
17281 declarator:
17282 attributes [opt] direct-declarator
17283 attributes [opt] ptr-operator declarator
17285 abstract-declarator:
17286 attributes [opt] ptr-operator abstract-declarator [opt]
17287 attributes [opt] direct-abstract-declarator
17289 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17290 detect constructor, destructor or conversion operators. It is set
17291 to -1 if the declarator is a name, and +1 if it is a
17292 function. Otherwise it is set to zero. Usually you just want to
17293 test for >0, but internally the negative value is used.
17295 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17296 a decl-specifier-seq unless it declares a constructor, destructor,
17297 or conversion. It might seem that we could check this condition in
17298 semantic analysis, rather than parsing, but that makes it difficult
17299 to handle something like `f()'. We want to notice that there are
17300 no decl-specifiers, and therefore realize that this is an
17301 expression, not a declaration.)
17303 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17304 the declarator is a direct-declarator of the form "(...)".
17306 MEMBER_P is true iff this declarator is a member-declarator.
17308 FRIEND_P is true iff this declarator is a friend. */
17312 cp_parser_declarator_kind dcl_kind,
17316 {
17319 cp_cv_quals cv_quals;
17320 tree class_type;
17323 /* Assume this is not a constructor, destructor, or type-conversion
17324 operator. */
17331 /* Check for the ptr-operator production. */
17333 /* Parse the ptr-operator. */
17339 /* If that worked, then we have a ptr-operator. */
17341 {
17342 /* If a ptr-operator was found, then this declarator was not
17343 parenthesized. */
17346 /* The dependent declarator is optional if we are parsing an
17347 abstract-declarator. */
17351 /* Parse the dependent declarator. */
17356 friend_p);
17358 /* If we are parsing an abstract-declarator, we must handle the
17359 case where the dependent declarator is absent. */
17364 declarator = cp_parser_make_indirect_declarator
17366 }
17367 /* Everything else is a direct-declarator. */
17368 else
17369 {
17372 CPP_OPEN_PAREN);
17374 ctor_dtor_or_conv_p,
17376 }
17381 }
17383 /* Parse a direct-declarator or direct-abstract-declarator.
17385 direct-declarator:
17386 declarator-id
17387 direct-declarator ( parameter-declaration-clause )
17388 cv-qualifier-seq [opt]
17389 ref-qualifier [opt]
17390 exception-specification [opt]
17391 direct-declarator [ constant-expression [opt] ]
17392 ( declarator )
17394 direct-abstract-declarator:
17395 direct-abstract-declarator [opt]
17396 ( parameter-declaration-clause )
17397 cv-qualifier-seq [opt]
17398 ref-qualifier [opt]
17399 exception-specification [opt]
17400 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17401 ( abstract-declarator )
17403 Returns a representation of the declarator. DCL_KIND is
17404 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17405 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17406 we are parsing a direct-declarator. It is
17407 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17408 of ambiguity we prefer an abstract declarator, as per
17409 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17410 as for cp_parser_declarator. */
17414 cp_parser_declarator_kind dcl_kind,
17417 {
17427 {
17428 /* Peek at the next token. */
17431 {
17432 /* This is either a parameter-declaration-clause, or a
17433 parenthesized declarator. When we know we are parsing a
17434 named declarator, it must be a parenthesized declarator
17435 if FIRST is true. For instance, `(int)' is a
17436 parameter-declaration-clause, with an omitted
17437 direct-abstract-declarator. But `((*))', is a
17438 parenthesized abstract declarator. Finally, when T is a
17439 template parameter `(T)' is a
17440 parameter-declaration-clause, and not a parenthesized
17441 named declarator.
17443 We first try and parse a parameter-declaration-clause,
17444 and then try a nested declarator (if FIRST is true).
17446 It is not an error for it not to be a
17447 parameter-declaration-clause, even when FIRST is
17448 false. Consider,
17450 int i (int);
17451 int i (3);
17453 The first is the declaration of a function while the
17454 second is the definition of a variable, including its
17455 initializer.
17457 Having seen only the parenthesis, we cannot know which of
17458 these two alternatives should be selected. Even more
17459 complex are examples like:
17461 int i (int (a));
17462 int i (int (3));
17464 The former is a function-declaration; the latter is a
17465 variable initialization.
17467 Thus again, we try a parameter-declaration-clause, and if
17468 that fails, we back out and return. */
17471 {
17472 tree params;
17475 /* In a member-declarator, the only valid interpretation
17476 of a parenthesis is the start of a
17477 parameter-declaration-clause. (It is invalid to
17478 initialize a static data member with a parenthesized
17479 initializer; only the "=" form of initialization is
17480 permitted.) */
17484 /* Consume the `('. */
17487 {
17488 /* If this is going to be an abstract declarator, we're
17489 in a declarator and we can't have default args. */
17492 }
17496 /* Parse the parameter-declaration-clause. */
17499 /* Consume the `)'. */
17502 /* If all went well, parse the cv-qualifier-seq,
17503 ref-qualifier and the exception-specification. */
17505 {
17506 cp_cv_quals cv_quals;
17507 cp_virt_specifiers virt_specifiers;
17508 cp_ref_qualifier ref_qual;
17509 tree exception_specification;
17510 tree late_return;
17511 tree attrs;
17521 /* Parse the cv-qualifier-seq. */
17523 /* Parse the ref-qualifier. */
17525 /* And the exception-specification. */
17526 exception_specification
17531 /* In here, we handle cases where attribute is used after
17532 the function declaration. For example:
17533 void func (int x) __attribute__((vector(..))); */
17536 {
17540 CPP_SEMICOLON)
17542 CPP_OPEN_BRACE))
17545 ;
17546 else
17548 }
17549 late_return = (cp_parser_late_return_type_opt
17554 /* Parse the virt-specifier-seq. */
17557 /* Create the function-declarator. */
17559 params,
17560 cv_quals,
17561 virt_specifiers,
17562 ref_qual,
17563 exception_specification,
17564 late_return);
17566 /* Any subsequent parameter lists are to do with
17567 return type, so are not those of the declared
17568 function. */
17570 }
17572 /* Remove the function parms from scope. */
17576 /* Repeat the main loop. */
17578 }
17580 /* If this is the first, we can try a parenthesized
17581 declarator. */
17583 {
17589 /* Consume the `('. */
17591 /* Parse the nested declarator. */
17594 declarator
17600 /* Expect a `)'. */
17607 }
17608 /* Otherwise, we must be done. */
17609 else
17611 }
17615 {
17616 /* Parse an array-declarator. */
17625 /* Consume the `['. */
17627 /* Peek at the next token. */
17629 /* If the next token is `]', then there is no
17630 constant-expression. */
17632 {
17634 bounds
17644 {
17645 /* Normally, the array bound must be an integral constant
17646 expression. However, as an extension, we allow VLAs
17647 in function scopes as long as they aren't part of a
17648 parameter declaration. */
17652 }
17655 {
17656 /* Remember this wasn't a constant-expression. */
17659 }
17660 }
17661 else
17663 /* Look for the closing `]'. */
17665 {
17668 }
17673 }
17675 {
17676 {
17677 tree qualifying_scope;
17678 tree unqualified_name;
17679 tree attrs;
17680 special_function_kind sfk;
17685 /* Parse a declarator-id */
17688 {
17691 /* If we see an ellipsis, we should be looking at a
17692 parameter pack. */
17694 {
17695 /* Consume the `...' */
17699 }
17700 }
17703 unqualified_name
17707 {
17711 {
17712 /* Check whether an error occurred. */
17715 /* We already consumed the ellipsis to mark a
17716 parameter pack, but we have no way to report it,
17717 so abort the tentative parse. We will be exiting
17718 immediately anyway. */
17720 }
17721 else
17727 && (qualifying_scope
17729 {
17732 }
17733 }
17738 {
17743 }
17749 {
17750 /* In the declaration of a member of a template class
17751 outside of the class itself, the SCOPE will sometimes
17752 be a TYPENAME_TYPE. For example, given:
17754 template <typename T>
17755 int S<T>::R::i = 3;
17757 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17758 this context, we must resolve S<T>::R to an ordinary
17759 type, rather than a typename type.
17761 The reason we normally avoid resolving TYPENAME_TYPEs
17762 is that a specialization of `S' might render
17763 `S<T>::R' not a type. However, if `S' is
17764 specialized, then this `i' will not be used, so there
17765 is no harm in resolving the types here. */
17766 tree type;
17768 /* Resolve the TYPENAME_TYPE. */
17771 /* If that failed, the declarator is invalid. */
17773 {
17776 "cannot define member of dependent typedef "
17778 else
17783 }
17785 }
17790 {
17791 tree class_type;
17796 else
17800 {
17803 {
17806 {
17810 "use %<%T::%D%> instead of %<%T::%D%> to "
17812 class_type,
17817 }
17818 else
17820 }
17821 else
17822 {
17823 /* We do not attempt to print the declarator
17824 here because we do not have enough
17825 information about its original syntactic
17826 form. */
17830 }
17831 }
17834 {
17840 for an anonymous type, even if the type
17841 got a name for linkage purposes. */
17843 /* Handle correctly (c++/19200):
17845 struct S {
17846 struct T{};
17847 friend void S(T);
17848 };
17850 and also:
17852 namespace N {
17853 void S();
17854 }
17856 struct S {
17857 friend void N::S();
17858 }; */
17859 && !(friend_p
17862 class_type))
17863 {
17866 }
17874 }
17875 }
17877 unqualified_name,
17878 sfk);
17885 }
17887 handle_declarator:;
17890 {
17891 /* Any names that appear after the declarator-id for a
17892 member are looked up in the containing scope. */
17894 {
17895 /* But declarations with qualified-ids can't appear in a
17896 function. */
17900 }
17902 }
17906 /* Default args are only allowed on function
17907 declarations. */
17909 else
17913 }
17914 /* We're done. */
17915 else
17917 }
17919 /* For an abstract declarator, we might wind up with nothing at this
17920 point. That's an error; the declarator is not optional. */
17924 /* If we entered a scope, we must exit it now. */
17932 }
17934 /* Parse a ptr-operator.
17936 ptr-operator:
17937 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17938 * cv-qualifier-seq [opt]
17939 &
17940 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17941 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17943 GNU Extension:
17945 ptr-operator:
17946 & cv-qualifier-seq [opt]
17948 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17949 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17950 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17951 filled in with the TYPE containing the member. *CV_QUALS is
17952 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17953 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17954 Note that the tree codes returned by this function have nothing
17955 to do with the types of trees that will be eventually be created
17956 to represent the pointer or reference type being parsed. They are
17957 just constants with suggestive names. */
17958 static enum tree_code
17963 {
17968 /* Assume that it's not a pointer-to-member. */
17970 /* And that there are no cv-qualifiers. */
17973 /* Peek at the next token. */
17976 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17986 {
17987 /* Consume the `*', `&' or `&&'. */
17990 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17991 `&', if we are allowing GNU extensions. (The only qualifier
17992 that can legally appear after `&' is `restrict', but that is
17993 enforced during semantic analysis. */
18001 }
18002 else
18003 {
18004 /* Try the pointer-to-member case. */
18006 /* Look for the optional `::' operator. */
18009 /* Look for the nested-name specifier. */
18016 /* If we found it, and the next token is a `*', then we are
18017 indeed looking at a pointer-to-member operator. */
18020 {
18021 /* Indicate that the `*' operator was used. */
18029 else
18030 {
18031 /* The type of which the member is a member is given by the
18032 current SCOPE. */
18034 /* The next name will not be qualified. */
18038 /* Look for optional c++11 attributes. */
18042 /* Look for the optional cv-qualifier-seq. */
18044 }
18045 }
18046 /* If that didn't work we don't have a ptr-operator. */
18049 }
18052 }
18054 /* Parse an (optional) cv-qualifier-seq.
18056 cv-qualifier-seq:
18057 cv-qualifier cv-qualifier-seq [opt]
18059 cv-qualifier:
18060 const
18061 volatile
18063 GNU Extension:
18065 cv-qualifier:
18066 __restrict__
18068 Returns a bitmask representing the cv-qualifiers. */
18070 static cp_cv_quals
18072 {
18076 {
18078 cp_cv_quals cv_qualifier;
18080 /* Peek at the next token. */
18082 /* See if it's a cv-qualifier. */
18084 {
18100 }
18106 {
18109 }
18110 else
18111 {
18114 }
18115 }
18118 }
18120 /* Parse an (optional) ref-qualifier
18122 ref-qualifier:
18123 &
18124 &&
18126 Returns cp_ref_qualifier representing ref-qualifier. */
18128 static cp_ref_qualifier
18130 {
18133 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18138 {
18143 {
18155 }
18160 {
18163 }
18164 else
18165 {
18168 }
18169 }
18172 }
18174 /* Parse an (optional) virt-specifier-seq.
18176 virt-specifier-seq:
18177 virt-specifier virt-specifier-seq [opt]
18179 virt-specifier:
18180 override
18181 final
18183 Returns a bitmask representing the virt-specifiers. */
18185 static cp_virt_specifiers
18187 {
18191 {
18193 cp_virt_specifiers virt_specifier;
18195 /* Peek at the next token. */
18197 /* See if it's a virt-specifier-qualifier. */
18201 {
18204 }
18206 {
18209 }
18211 {
18213 }
18214 else
18218 {
18221 }
18222 else
18223 {
18226 }
18227 }
18229 }
18231 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18232 is in scope even though it isn't real. */
18234 void
18236 {
18237 tree this_parm;
18240 {
18241 /* We don't clear this between NSDMIs. Is it already what we want? */
18246 }
18249 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18251 current_class_ref
18254 }
18256 /* Return true iff our current scope is a non-static data member
18257 initializer. */
18259 bool
18261 {
18262 /* We recognize NSDMI context by the context-less 'this' pointer set up
18263 by the function above. */
18267 }
18269 /* Parse a late-specified return type, if any. This is not a separate
18270 non-terminal, but part of a function declarator, which looks like
18272 -> trailing-type-specifier-seq abstract-declarator(opt)
18274 Returns the type indicated by the type-id.
18276 In addition to this this parses any queued up omp declare simd
18277 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18279 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18280 function. */
18282 static tree
18284 cp_cv_quals quals)
18285 {
18289 && declarator
18295 /* Peek at the next token. */
18297 /* A late-specified return type is indicated by an initial '->'. */
18304 {
18305 /* DR 1207: 'this' is in scope in the trailing return type. */
18307 }
18310 {
18311 /* Consume the ->. */
18315 }
18318 declarator->std_attributes
18322 declarator->std_attributes
18327 {
18330 }
18333 }
18335 /* Parse a declarator-id.
18337 declarator-id:
18338 id-expression
18339 :: [opt] nested-name-specifier [opt] type-name
18341 In the `id-expression' case, the value returned is as for
18342 cp_parser_id_expression if the id-expression was an unqualified-id.
18343 If the id-expression was a qualified-id, then a SCOPE_REF is
18344 returned. The first operand is the scope (either a NAMESPACE_DECL
18345 or TREE_TYPE), but the second is still just a representation of an
18346 unqualified-id. */
18348 static tree
18350 {
18351 tree id;
18352 /* The expression must be an id-expression. Assume that qualified
18353 names are the names of types so that:
18355 template <class T>
18356 int S<T>::R::i = 3;
18358 will work; we must treat `S<T>::R' as the name of a type.
18359 Similarly, assume that qualified names are templates, where
18360 required, so that:
18362 template <class T>
18363 int S<T>::R<T>::i = 3;
18365 will work, too. */
18371 optional_p);
18375 }
18377 /* Parse a type-id.
18379 type-id:
18380 type-specifier-seq abstract-declarator [opt]
18382 Returns the TYPE specified. */
18384 static tree
18387 {
18388 cp_decl_specifier_seq type_specifier_seq;
18391 /* Parse the type-specifier-seq. */
18393 is_trailing_return,
18398 /* There might or might not be an abstract declarator. */
18400 /* Look for the declarator. */
18401 abstract_declarator
18406 /* Check to see if there really was a declarator. */
18411 /* None of the valid uses of 'auto' in C++14 involve the type-id
18412 nonterminal, but it is valid in a trailing-return-type. */
18415 {
18416 /* A type-id with type 'auto' is only ok if the abstract declarator
18417 is a function declarator with a late-specified return type. */
18422 else
18423 {
18426 }
18427 }
18430 is_template_arg);
18431 }
18434 {
18436 }
18439 {
18440 tree r;
18442 parser->type_definition_forbidden_message
18447 {
18450 }
18452 }
18455 {
18457 }
18459 /* Parse a type-specifier-seq.
18461 type-specifier-seq:
18462 type-specifier type-specifier-seq [opt]
18464 GNU extension:
18466 type-specifier-seq:
18467 attributes type-specifier-seq [opt]
18469 If IS_DECLARATION is true, we are at the start of a "condition" or
18470 exception-declaration, so we might be followed by a declarator-id.
18472 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18473 i.e. we've just seen "->".
18475 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18477 static void
18482 {
18487 /* Clear the TYPE_SPECIFIER_SEQ. */
18490 /* In the context of a trailing return type, enum E { } is an
18491 elaborated-type-specifier followed by a function-body, not an
18492 enum-specifier. */
18496 /* Parse the type-specifiers and attributes. */
18498 {
18499 tree type_specifier;
18502 /* Check for attributes first. */
18504 {
18509 }
18511 /* record the token of the beginning of the type specifier seq,
18512 for error reporting purposes*/
18516 /* Look for the type-specifier. */
18518 flags,
18519 type_specifier_seq,
18521 NULL,
18524 {
18525 /* If the first type-specifier could not be found, this is not a
18526 type-specifier-seq at all. */
18528 {
18529 /* Set in_declarator_p to avoid skipping to the semicolon. */
18541 }
18542 /* If subsequent type-specifiers could not be found, the
18543 type-specifier-seq is complete. */
18545 }
18548 /* The standard says that a condition can be:
18550 type-specifier-seq declarator = assignment-expression
18552 However, given:
18554 struct S {};
18555 if (int S = ...)
18557 we should treat the "S" as a declarator, not as a
18558 type-specifier. The standard doesn't say that explicitly for
18559 type-specifier-seq, but it does say that for
18560 decl-specifier-seq in an ordinary declaration. Perhaps it
18561 would be clearer just to allow a decl-specifier-seq here, and
18562 then add a semantic restriction that if any decl-specifiers
18563 that are not type-specifiers appear, the program is invalid. */
18566 }
18567 }
18569 /* Return whether the function currently being declared has an associated
18570 template parameter list. */
18572 static bool
18574 {
18587 }
18589 /* Parse a parameter-declaration-clause.
18591 parameter-declaration-clause:
18592 parameter-declaration-list [opt] ... [opt]
18593 parameter-declaration-list , ...
18595 Returns a representation for the parameter declarations. A return
18596 value of NULL indicates a parameter-declaration-clause consisting
18597 only of an ellipsis. */
18599 static tree
18601 {
18602 tree parameters;
18611 parser->auto_is_implicit_function_template_parm_p
18613 }
18619 && !processing_template_parmlist
18625 /* Peek at the next token. */
18627 /* Check for trivial parameter-declaration-clauses. */
18629 {
18630 /* Consume the `...' token. */
18633 }
18635 /* There are no parameters. */
18636 {
18637 #ifndef NO_IMPLICIT_EXTERN_C
18642 else
18643 #endif
18645 }
18646 /* Check for `(void)', too, which is a special case. */
18650 {
18651 /* Consume the `void' token. */
18653 /* There are no parameters. */
18655 }
18657 /* Parse the parameter-declaration-list. */
18659 /* If a parse error occurred while parsing the
18660 parameter-declaration-list, then the entire
18661 parameter-declaration-clause is erroneous. */
18665 /* Peek at the next token. */
18667 /* If it's a `,', the clause should terminate with an ellipsis. */
18669 {
18670 /* Consume the `,'. */
18672 /* Expect an ellipsis. */
18673 ellipsis_p
18675 }
18676 /* It might also be `...' if the optional trailing `,' was
18677 omitted. */
18679 {
18680 /* Consume the `...' token. */
18682 /* And remember that we saw it. */
18684 }
18685 else
18688 /* Finish the parameter list. */
18693 }
18695 /* Parse a parameter-declaration-list.
18697 parameter-declaration-list:
18698 parameter-declaration
18699 parameter-declaration-list , parameter-declaration
18701 Returns a representation of the parameter-declaration-list, as for
18702 cp_parser_parameter_declaration_clause. However, the
18703 `void_list_node' is never appended to the list. Upon return,
18704 *IS_ERROR will be true iff an error occurred. */
18706 static tree
18708 {
18714 /* Assume all will go well. */
18716 /* The special considerations that apply to a function within an
18717 unbraced linkage specifications do not apply to the parameters
18718 to the function. */
18719 saved_in_unbraced_linkage_specification_p
18723 /* Look for more parameters. */
18725 {
18733 /* Parse the parameter. */
18734 parameter
18739 /* We don't know yet if the enclosing context is deprecated, so wait
18740 and warn in grokparms if appropriate. */
18744 {
18745 /* If a function parameter pack was specified and an implicit template
18746 parameter was introduced during cp_parser_parameter_declaration,
18747 change any implicit parameters introduced into packs. */
18751 {
18759 }
18763 PARM,
18766 }
18770 /* If a parse error occurred parsing the parameter declaration,
18771 then the entire parameter-declaration-list is erroneous. */
18773 {
18777 }
18787 {
18791 }
18793 /* Add the new parameter to the list. */
18797 /* Peek at the next token. */
18800 /* These are for Objective-C++ */
18803 /* The parameter-declaration-list is complete. */
18806 {
18809 /* Peek at the next token. */
18811 /* If it's an ellipsis, then the list is complete. */
18814 /* Otherwise, there must be more parameters. Consume the
18815 `,'. */
18817 /* When parsing something like:
18819 int i(float f, double d)
18821 we can tell after seeing the declaration for "f" that we
18822 are not looking at an initialization of a variable "i",
18823 but rather at the declaration of a function "i".
18825 Due to the fact that the parsing of template arguments
18826 (as specified to a template-id) requires backtracking we
18827 cannot use this technique when inside a template argument
18828 list. */
18832 /* However, a parameter-declaration of the form
18833 "float(f)" (which is a valid declaration of a
18834 parameter "f") can also be interpreted as an
18835 expression (the conversion of "f" to "float"). */
18838 }
18839 else
18840 {
18848 }
18849 }
18851 parser->in_unbraced_linkage_specification_p
18854 /* Reset implicit_template_scope if we are about to leave the function
18855 parameter list that introduced it. Note that for out-of-line member
18856 definitions, there will be one or more class scopes before we get to
18857 the template parameter scope. */
18861 {
18865 {
18868 }
18869 }
18872 }
18874 /* Parse a parameter declaration.
18876 parameter-declaration:
18877 decl-specifier-seq ... [opt] declarator
18878 decl-specifier-seq declarator = assignment-expression
18879 decl-specifier-seq ... [opt] abstract-declarator [opt]
18880 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18882 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18883 declares a template parameter. (In that case, a non-nested `>'
18884 token encountered during the parsing of the assignment-expression
18885 is not interpreted as a greater-than operator.)
18887 Returns a representation of the parameter, or NULL if an error
18888 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18889 true iff the declarator is of the form "(p)". */
18895 {
18897 cp_decl_specifier_seq decl_specifiers;
18899 tree default_argument;
18903 /* In a template parameter, `>' is not an operator.
18905 [temp.param]
18907 When parsing a default template-argument for a non-type
18908 template-parameter, the first non-nested `>' is taken as the end
18909 of the template parameter-list rather than a greater-than
18910 operator. */
18912 /* Type definitions may not appear in parameter types. */
18914 parser->type_definition_forbidden_message
18917 /* Parse the declaration-specifiers. */
18919 CP_PARSER_FLAGS_NONE,
18923 /* Complain about missing 'typename' or other invalid type names. */
18928 /* If an error occurred, there's no reason to attempt to parse the
18929 rest of the declaration. */
18931 {
18934 }
18936 /* Peek at the next token. */
18939 /* If the next token is a `)', `,', `=', `>', or `...', then there
18940 is no declarator. However, when variadic templates are enabled,
18941 there may be a declarator following `...'. */
18946 {
18950 }
18951 /* Otherwise, there should be a declarator. */
18952 else
18953 {
18957 /* After seeing a decl-specifier-seq, if the next token is not a
18958 "(", there is no possibility that the code is a valid
18959 expression. Therefore, if parsing tentatively, we commit at
18960 this point. */
18962 /* In an expression context, having seen:
18964 (int((char ...
18966 we cannot be sure whether we are looking at a
18967 function-type (taking a "char" as a parameter) or a cast
18968 of some object of type "char" to "int". */
18974 /* Parse the declarator. */
18977 CP_PARSER_DECLARATOR_EITHER,
18979 parenthesized_p,
18983 /* After the declarator, allow more attributes. */
18984 decl_specifiers.attributes
18987 }
18989 /* If the next token is an ellipsis, and we have not seen a
18990 declarator name, and the type of the declarator contains parameter
18991 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18992 a parameter pack expansion expression. Otherwise, leave the
18993 ellipsis for a C-style variadic function. */
18996 {
19007 {
19008 /* Consume the `...'. */
19012 /* Build a pack expansion type */
19015 else
19017 }
19018 }
19020 /* The restriction on defining new types applies only to the type
19021 of the parameter, not to the default argument. */
19024 /* If the next token is `=', then process a default argument. */
19026 {
19028 /* If we are defining a class, then the tokens that make up the
19029 default argument must be saved and processed later. */
19034 /* Outside of a class definition, we can just parse the
19035 assignment-expression. */
19036 else
19037 default_argument
19041 {
19044 else
19045 {
19047 "default arguments are only "
19050 }
19051 }
19055 {
19056 /* Find the name of the parameter pack. */
19063 template_parm_p
19069 else
19071 template_parm_p
19078 }
19079 }
19080 else
19084 declarator,
19085 default_argument);
19086 }
19088 /* Parse a default argument and return it.
19090 TEMPLATE_PARM_P is true if this is a default argument for a
19091 non-type template parameter. */
19092 static tree
19094 {
19100 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19101 set correctly. */
19104 /* Local variable names (and the `this' keyword) may not
19105 appear in a default argument. */
19108 /* Parse the assignment-expression. */
19113 /* The "this" pointer is not valid in a default argument. */
19115 {
19120 }
19121 default_argument
19123 /* Restore the "this" pointer. */
19125 {
19128 }
19137 }
19139 /* Parse a function-body.
19141 function-body:
19142 compound_statement */
19144 static void
19146 {
19148 }
19150 /* Parse a ctor-initializer-opt followed by a function-body. Return
19151 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19152 is true we are parsing a function-try-block. */
19154 static bool
19157 {
19165 /* Begin the function body. */
19167 /* Parse the optional ctor-initializer. */
19170 /* If we're parsing a constexpr constructor definition, we need
19171 to check that the constructor body is indeed empty. However,
19172 before we get to cp_parser_function_body lot of junk has been
19173 generated, so we can't just check that we have an empty block.
19174 Rather we take a snapshot of the outermost block, and check whether
19175 cp_parser_function_body changed its state. */
19177 {
19181 }
19182 /* Parse the function-body. */
19186 /* Finish the function body. */
19190 }
19192 /* Parse an initializer.
19194 initializer:
19195 = initializer-clause
19196 ( expression-list )
19198 Returns an expression representing the initializer. If no
19199 initializer is present, NULL_TREE is returned.
19201 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19202 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19203 set to TRUE if there is no initializer present. If there is an
19204 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19205 is set to true; otherwise it is set to false. */
19207 static tree
19210 {
19212 tree init;
19214 /* Peek at the next token. */
19217 /* Let our caller know whether or not this initializer was
19218 parenthesized. */
19220 /* Assume that the initializer is constant. */
19224 {
19225 /* Consume the `='. */
19227 /* Parse the initializer-clause. */
19229 }
19231 {
19236 non_constant_p);
19241 }
19243 {
19248 }
19249 else
19250 {
19251 /* Anything else is an error. */
19254 }
19257 }
19259 /* Parse an initializer-clause.
19261 initializer-clause:
19262 assignment-expression
19263 braced-init-list
19265 Returns an expression representing the initializer.
19267 If the `assignment-expression' production is used the value
19268 returned is simply a representation for the expression.
19270 Otherwise, calls cp_parser_braced_list. */
19272 static tree
19274 {
19275 tree initializer;
19277 /* Assume the expression is constant. */
19280 /* If it is not a `{', then we are looking at an
19281 assignment-expression. */
19283 {
19284 initializer
19287 non_constant_p);
19288 }
19289 else
19293 }
19295 /* Parse a brace-enclosed initializer list.
19297 braced-init-list:
19298 { initializer-list , [opt] }
19299 { }
19301 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19302 the elements of the initializer-list (or NULL, if the last
19303 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19304 NULL_TREE. There is no way to detect whether or not the optional
19305 trailing `,' was provided. NON_CONSTANT_P is as for
19306 cp_parser_initializer. */
19308 static tree
19310 {
19311 tree initializer;
19313 /* Consume the `{' token. */
19315 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19317 /* If it's not a `}', then there is a non-trivial initializer. */
19319 {
19320 /* Parse the initializer list. */
19323 /* A trailing `,' token is allowed. */
19326 }
19327 else
19329 /* Now, there should be a trailing `}'. */
19333 }
19335 /* Consume tokens up to, and including, the next non-nested closing `]'.
19336 Returns true iff we found a closing `]'. */
19338 static bool
19340 {
19344 {
19348 {
19351 /* If we've run out of tokens, then there is no closing `]'. */
19360 {
19363 }
19368 }
19370 /* Consume the token. */
19372 }
19373 }
19375 /* Return true if we are looking at an array-designator, false otherwise. */
19377 static bool
19379 {
19380 /* Consume the `['. */
19385 /* Skip tokens until the next token is a closing square bracket.
19386 If we find the closing `]', and the next token is a `=', then
19387 we are looking at an array designator. */
19388 bool array_designator_p
19392 /* Roll back the tokens we skipped. */
19396 }
19398 /* Parse an initializer-list.
19400 initializer-list:
19401 initializer-clause ... [opt]
19402 initializer-list , initializer-clause ... [opt]
19404 GNU Extension:
19406 initializer-list:
19407 designation initializer-clause ...[opt]
19408 initializer-list , designation initializer-clause ...[opt]
19410 designation:
19411 . identifier =
19412 identifier :
19413 [ constant-expression ] =
19415 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19416 for the initializer. If the INDEX of the elt is non-NULL, it is the
19417 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19418 as for cp_parser_initializer. */
19422 {
19425 /* Assume all of the expressions are constant. */
19428 /* Parse the rest of the list. */
19430 {
19432 tree designator;
19433 tree initializer;
19436 /* If the next token is an identifier and the following one is a
19437 colon, we are looking at the GNU designated-initializer
19438 syntax. */
19442 {
19443 /* Warn the user that they are using an extension. */
19446 /* Consume the identifier. */
19448 /* Consume the `:'. */
19450 }
19451 /* Also handle the C99 syntax, '. id ='. */
19456 {
19457 /* Warn the user that they are using an extension. */
19460 /* Consume the `.'. */
19462 /* Consume the identifier. */
19464 /* Consume the `='. */
19466 }
19467 /* Also handle C99 array designators, '[ const ] ='. */
19471 {
19472 /* In C++11, [ could start a lambda-introducer. */
19478 {
19481 }
19482 else
19483 {
19488 }
19494 }
19495 else
19498 /* Parse the initializer. */
19501 /* If any clause is non-constant, so is the entire initializer. */
19505 /* If we have an ellipsis, this is an initializer pack
19506 expansion. */
19508 {
19509 /* Consume the `...'. */
19512 /* Turn the initializer into an initializer expansion. */
19514 }
19516 /* Add it to the vector. */
19519 /* If the next token is not a comma, we have reached the end of
19520 the list. */
19524 /* Peek at the next token. */
19526 /* If the next token is a `}', then we're still done. An
19527 initializer-clause can have a trailing `,' after the
19528 initializer-list and before the closing `}'. */
19532 /* Consume the `,' token. */
19534 }
19537 }
19539 /* Classes [gram.class] */
19541 /* Parse a class-name.
19543 class-name:
19544 identifier
19545 template-id
19547 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19548 to indicate that names looked up in dependent types should be
19549 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19550 keyword has been used to indicate that the name that appears next
19551 is a template. TAG_TYPE indicates the explicit tag given before
19552 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19553 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19554 is the class being defined in a class-head.
19556 Returns the TYPE_DECL representing the class. */
19558 static tree
19566 {
19567 tree decl;
19568 tree scope;
19573 /* All class-names start with an identifier. */
19576 {
19579 }
19581 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19582 to a template-id, so we save it here. */
19587 /* Any name names a type if we're following the `typename' keyword
19588 in a qualified name where the enclosing scope is type-dependent. */
19591 /* Handle the common case (an identifier, but not a template-id)
19592 efficiently. */
19595 {
19599 /* Look for the identifier. */
19603 /* If the next token isn't an identifier, we are certainly not
19604 looking at a class-name. */
19607 /* If we know this is a type-name, there's no need to look it
19608 up. */
19611 else
19612 {
19613 tree ambiguous_decls;
19614 /* If we already know that this lookup is ambiguous, then
19615 we've already issued an error message; there's no reason
19616 to check again. */
19618 {
19621 }
19622 /* If the next token is a `::', then the name must be a type
19623 name.
19625 [basic.lookup.qual]
19627 During the lookup for a name preceding the :: scope
19628 resolution operator, object, function, and enumerator
19629 names are ignored. */
19632 /* Look up the name. */
19634 tag_type,
19637 check_dependency_p,
19641 {
19645 }
19646 }
19647 }
19648 else
19649 {
19650 /* Try a template-id. */
19652 check_dependency_p,
19653 tag_type,
19654 is_declaration);
19657 }
19661 /* If this is a typename, create a TYPENAME_TYPE. */
19663 {
19668 }
19672 /* Check to see that it is really the name of a class. */
19676 /* Situations like this:
19678 template <typename T> struct A {
19679 typename T::template X<int>::I i;
19680 };
19682 are problematic. Is `T::template X<int>' a class-name? The
19683 standard does not seem to be definitive, but there is no other
19684 valid interpretation of the following `::'. Therefore, those
19685 names are considered class-names. */
19686 {
19690 }
19694 /* In Objective-C 2.0, a classname followed by '.' starts a
19695 dot-syntax expression, and it's not a type-name. */
19707 }
19709 /* Parse a class-specifier.
19711 class-specifier:
19712 class-head { member-specification [opt] }
19714 Returns the TREE_TYPE representing the class. */
19716 static tree
19718 {
19719 tree type;
19733 /* Parse the class-head. */
19736 /* If the class-head was a semantic disaster, skip the entire body
19737 of the class. */
19739 {
19743 }
19745 /* Look for the `{'. */
19747 {
19750 }
19754 /* Issue an error message if type-definitions are forbidden here. */
19756 /* Remember that we are defining one more class. */
19758 /* Inside the class, surrounding template-parameter-lists do not
19759 apply. */
19760 saved_num_template_parameter_lists
19763 /* We are not in a function body. */
19766 /* Or in a loop. */
19769 /* Or in a switch. */
19772 /* We are not immediately inside an extern "lang" block. */
19773 saved_in_unbraced_linkage_specification_p
19777 /* Start the class. */
19779 {
19782 }
19786 /* If the type is erroneous, skip the entire body of the class. */
19788 else
19789 /* Parse the member-specification. */
19792 /* Look for the trailing `}'. */
19794 /* Look for trailing attributes to apply to this class. */
19802 /* We've finished a type definition. Check for the common syntax
19803 error of forgetting a semicolon after the definition. We need to
19804 be careful, as we can't just check for not-a-semicolon and be done
19805 with it; the user might have typed:
19807 class X { } c = ...;
19808 class X { } *p = ...;
19810 and so forth. Instead, enumerate all the possible tokens that
19811 might follow this production; if we don't see one of them, then
19812 complain and silently insert the semicolon. */
19813 {
19818 /* Don't try to parse c++11 attributes here. As per the
19819 grammar, that should be a task for
19820 cp_parser_decl_specifier_seq. */
19824 {
19835 /* While it's legal for type qualifiers and storage class
19836 specifiers to follow type definitions in the grammar, only
19837 compiler testsuites contain code like that. Assume that if
19838 we see such code, then what we're really seeing is a case
19839 like:
19841 class X { }
19842 const <type> var = ...;
19844 or
19846 class Y { }
19847 static <type> func (...) ...
19849 i.e. the qualifier or specifier applies to the next
19850 declaration. To do so, however, we need to look ahead one
19851 more token to see if *that* token is a type specifier.
19853 This code could be improved to handle:
19855 class Z { }
19856 static const <type> var = ...; */
19859 {
19862 /* Handling user-defined types here would be nice, but very
19863 tricky. */
19864 want_semicolon
19867 }
19871 }
19873 /* If we don't have a type, then something is very wrong and we
19874 shouldn't try to do anything clever. Likewise for not seeing the
19875 closing brace. */
19877 {
19878 cp_token_position prev
19889 else
19892 /* Unget one token and smash it to look as though we encountered
19893 a semicolon in the input stream. */
19898 }
19899 }
19901 /* If this class is not itself within the scope of another class,
19902 then we need to parse the bodies of all of the queued function
19903 definitions. Note that the queued functions defined in a class
19904 are not always processed immediately following the
19905 class-specifier for that class. Consider:
19907 struct A {
19908 struct B { void f() { sizeof (A); } };
19909 };
19911 If `f' were processed before the processing of `A' were
19912 completed, there would be no way to compute the size of `A'.
19913 Note that the nesting we are interested in here is lexical --
19914 not the semantic nesting given by TYPE_CONTEXT. In particular,
19915 for:
19917 struct A { struct B; };
19918 struct A::B { void f() { } };
19920 there is no need to delay the parsing of `A::B::f'. */
19922 {
19923 tree decl;
19930 /* In a first pass, parse default arguments to the functions.
19931 Then, in a second pass, parse the bodies of the functions.
19932 This two-phased approach handles cases like:
19934 struct S {
19935 void f() { g(); }
19936 void g(int i = 3);
19937 };
19939 */
19941 {
19943 /* If there are default arguments that have not yet been processed,
19944 take care of them now. */
19946 {
19951 }
19952 /* Make sure that any template parameters are in scope. */
19954 /* Parse the default argument expressions. */
19956 /* Remove any template parameters from the symbol table. */
19958 }
19960 /* Now parse any NSDMIs. */
19964 {
19966 {
19971 }
19974 }
19981 /* Now do some post-NSDMI bookkeeping. */
19987 /* Now parse the body of the functions. */
19989 {
19990 /* OpenMP UDRs need to be parsed before all other functions. */
19997 }
19998 else
20002 }
20003 else
20006 /* Put back any saved access checks. */
20009 /* Restore saved state. */
20013 parser->num_template_parameter_lists
20015 parser->in_unbraced_linkage_specification_p
20019 }
20021 static tree
20023 {
20024 tree ret;
20029 }
20031 /* Parse a class-head.
20033 class-head:
20034 class-key identifier [opt] base-clause [opt]
20035 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20036 class-key nested-name-specifier [opt] template-id
20037 base-clause [opt]
20039 class-virt-specifier:
20040 final
20042 GNU Extensions:
20043 class-key attributes identifier [opt] base-clause [opt]
20044 class-key attributes nested-name-specifier identifier base-clause [opt]
20045 class-key attributes nested-name-specifier [opt] template-id
20046 base-clause [opt]
20048 Upon return BASES is initialized to the list of base classes (or
20049 NULL, if there are none) in the same form returned by
20050 cp_parser_base_clause.
20052 Returns the TYPE of the indicated class. Sets
20053 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20054 involving a nested-name-specifier was used, and FALSE otherwise.
20056 Returns error_mark_node if this is not a class-head.
20058 Returns NULL_TREE if the class-head is syntactically valid, but
20059 semantically invalid in a way that means we should skip the entire
20060 body of the class. */
20062 static tree
20065 {
20066 tree nested_name_specifier;
20070 tree attributes;
20071 tree bases;
20081 /* Assume no nested-name-specifier will be present. */
20083 /* Assume no template parameter lists will be used in defining the
20084 type. */
20088 /* Look for the class-key. */
20093 /* Parse the attributes. */
20096 /* If the next token is `::', that is invalid -- but sometimes
20097 people do try to write:
20099 struct ::S {};
20101 Handle this gracefully by accepting the extra qualifier, and then
20102 issuing an error about it later if this really is a
20103 class-head. If it turns out just to be an elaborated type
20104 specifier, remain silent. */
20110 /* Determine the name of the class. Begin by looking for an
20111 optional nested-name-specifier. */
20113 nested_name_specifier
20119 /* If there was a nested-name-specifier, then there *must* be an
20120 identifier. */
20122 {
20124 /* Although the grammar says `identifier', it really means
20125 `class-name' or `template-name'. You are only allowed to
20126 define a class that has already been declared with this
20127 syntax.
20129 The proposed resolution for Core Issue 180 says that wherever
20130 you see `class T::X' you should treat `X' as a type-name.
20132 It is OK to define an inaccessible class; for example:
20134 class A { class B; };
20135 class A::B {};
20137 We do not know if we will see a class-name, or a
20138 template-name. We look for a class-name first, in case the
20139 class-name is a template-id; if we looked for the
20140 template-name first we would stop after the template-name. */
20145 class_type,
20149 /* If that didn't work, ignore the nested-name-specifier. */
20151 {
20157 }
20158 /* If we could not find a corresponding TYPE, treat this
20159 declaration like an unqualified declaration. */
20162 /* Otherwise, count the number of templates used in TYPE and its
20163 containing scopes. */
20164 else
20165 {
20166 tree scope;
20178 }
20179 }
20180 /* Otherwise, the identifier is optional. */
20181 else
20182 {
20183 /* We don't know whether what comes next is a template-id,
20184 an identifier, or nothing at all. */
20186 /* Check for a template-id. */
20191 class_key,
20193 /* If that didn't work, it could still be an identifier. */
20195 {
20197 {
20200 }
20201 else
20203 }
20204 else
20205 {
20208 }
20209 }
20214 {
20216 class_key,
20218 }
20221 /* If it's not a `:' or a `{' then we can't really be looking at a
20222 class-head, since a class-head only appears as part of a
20223 class-specifier. We have to detect this situation before calling
20224 xref_tag, since that has irreversible side-effects. */
20226 {
20230 }
20232 /* At this point, we're going ahead with the class-specifier, even
20233 if some other problem occurs. */
20236 {
20241 }
20242 /* Issue the error about the overly-qualified name now. */
20244 {
20249 }
20251 {
20256 }
20258 {
20259 tree scope;
20261 /* Reject typedef-names in class heads. */
20263 {
20266 type);
20269 }
20271 /* Figure out in what scope the declaration is being placed. */
20273 /* If that scope does not contain the scope in which the
20274 class was originally declared, the program is invalid. */
20276 {
20279 "declaration of %qD in namespace %qD which does not "
20282 else
20288 }
20289 /* [dcl.meaning]
20291 A declarator-id shall not be qualified except for the
20292 definition of a ... nested class outside of its class
20293 ... [or] the definition or explicit instantiation of a
20294 class member of a namespace outside of its namespace. */
20296 {
20301 }
20302 }
20303 /* An explicit-specialization must be preceded by "template <>". If
20304 it is not, try to recover gracefully. */
20308 {
20312 /* Take the same action that would have been taken by
20313 cp_parser_explicit_specialization. */
20316 }
20317 /* There must be no "return" statements between this point and the
20318 end of this function; set "type "to the correct return value and
20319 use "goto done;" to return. */
20320 /* Make sure that the right number of template parameters were
20321 present. */
20325 {
20326 /* If something went wrong, there is no point in even trying to
20327 process the class-definition. */
20330 }
20332 /* Look up the type. */
20334 {
20338 {
20342 }
20343 else
20344 {
20347 }
20350 }
20352 {
20353 tree class_type;
20355 /* Given:
20357 template <typename T> struct S { struct T };
20358 template <typename T> struct S<T>::T { };
20360 we will get a TYPENAME_TYPE when processing the definition of
20361 `S::T'. We need to resolve it to the actual type before we
20362 try to define it. */
20364 {
20369 else
20370 {
20373 }
20374 }
20378 {
20381 }
20384 /* Enter the scope indicated by the nested-name-specifier. */
20386 /* Get the canonical version of this type. */
20388 /* Call push_template_decl if it seems like we should be defining a
20389 template either from the template headers or the type we're
20390 defining, so that we diagnose both extra and missing headers. */
20394 {
20397 {
20400 }
20401 }
20405 }
20407 {
20408 /* If the class was unnamed, create a dummy name. */
20413 }
20415 /* Indicate whether this class was declared as a `class' or as a
20416 `struct'. */
20421 /* If this type was already complete, and we see another definition,
20422 that's an error. */
20424 {
20426 type);
20428 type);
20431 }
20436 {
20437 /* Apply attributes now, before any use of the class as a template
20438 argument in its base list. */
20441 }
20443 /* We will have entered the scope containing the class; the names of
20444 base classes should be looked up in that context. For example:
20446 struct A { struct B {}; struct C; };
20447 struct A::C : B {};
20449 is valid. */
20451 /* Get the list of base-classes, if there is one. */
20453 {
20454 /* PR59482: enter the class scope so that base-specifiers are looked
20455 up correctly. */
20459 /* PR59482: get out of the previously pushed class scope so that the
20460 subsequent pops pop the right thing. */
20463 }
20464 else
20467 /* If we're really defining a class, process the base classes.
20468 If they're invalid, fail. */
20473 done:
20474 /* Leave the scope given by the nested-name-specifier. We will
20475 enter the class scope itself while processing the members. */
20480 {
20483 }
20489 out:
20492 }
20494 /* Parse a class-key.
20496 class-key:
20497 class
20498 struct
20499 union
20501 Returns the kind of class-key specified, or none_type to indicate
20502 error. */
20504 static enum tag_types
20506 {
20510 /* Look for the class-key. */
20515 /* Check to see if the TOKEN is a class-key. */
20520 }
20522 /* Parse a type-parameter-key.
20524 type-parameter-key:
20525 class
20526 typename
20527 */
20529 static void
20531 {
20532 /* Look for the type-parameter-key. */
20536 {
20539 /* typename is not allowed in a template template parameter
20540 by the standard until C++1Z. */
20542 "ISO C++ forbids typename key in template template parameter;"
20544 }
20545 else
20549 }
20551 /* Parse an (optional) member-specification.
20553 member-specification:
20554 member-declaration member-specification [opt]
20555 access-specifier : member-specification [opt] */
20557 static void
20559 {
20561 {
20565 /* Peek at the next token. */
20567 /* If it's a `}', or EOF then we've seen all the members. */
20573 /* See if this token is a keyword. */
20576 {
20580 /* Consume the access-specifier. */
20582 /* Remember which access-specifier is active. */
20584 /* Look for the `:'. */
20589 /* Accept #pragmas at class scope. */
20591 {
20594 }
20596 /* Otherwise, the next construction must be a
20597 member-declaration. */
20599 }
20600 }
20601 }
20603 /* Parse a member-declaration.
20605 member-declaration:
20606 decl-specifier-seq [opt] member-declarator-list [opt] ;
20607 function-definition ; [opt]
20608 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20609 using-declaration
20610 template-declaration
20611 alias-declaration
20613 member-declarator-list:
20614 member-declarator
20615 member-declarator-list , member-declarator
20617 member-declarator:
20618 declarator pure-specifier [opt]
20619 declarator constant-initializer [opt]
20620 identifier [opt] : constant-expression
20622 GNU Extensions:
20624 member-declaration:
20625 __extension__ member-declaration
20627 member-declarator:
20628 declarator attributes [opt] pure-specifier [opt]
20629 declarator attributes [opt] constant-initializer [opt]
20630 identifier [opt] attributes [opt] : constant-expression
20632 C++0x Extensions:
20634 member-declaration:
20635 static_assert-declaration */
20637 static void
20639 {
20640 cp_decl_specifier_seq decl_specifiers;
20641 tree prefix_attributes;
20642 tree decl;
20651 /* Check for the `__extension__' keyword. */
20653 {
20654 /* Recurse. */
20656 /* Restore the old value of the PEDANTIC flag. */
20660 }
20662 /* Check for a template-declaration. */
20664 {
20665 /* An explicit specialization here is an error condition, and we
20666 expect the specialization handler to detect and report this. */
20670 else
20674 }
20676 /* Check for a using-declaration. */
20678 {
20680 {
20681 /* Parse the using-declaration. */
20685 }
20686 else
20687 {
20688 tree decl;
20692 /* Note that if we actually see the '=' token after the
20693 identifier, cp_parser_alias_declaration commits the
20694 tentative parse. In that case, we really expects an
20695 alias-declaration. Otherwise, we expect a using
20696 declaration. */
20697 alias_decl_expected =
20703 else
20707 }
20708 }
20710 /* Check for @defs. */
20712 {
20717 {
20722 }
20724 }
20726 /* If the next token is `static_assert' we have a static assertion. */
20728 {
20731 }
20738 /* Parse the decl-specifier-seq. */
20741 CP_PARSER_FLAGS_OPTIONAL,
20744 /* Check for an invalid type-name. */
20748 /* If there is no declarator, then the decl-specifier-seq should
20749 specify a type. */
20751 {
20752 /* If there was no decl-specifier-seq, and the next token is a
20753 `;', then we have something like:
20755 struct S { ; };
20757 [class.mem]
20759 Each member-declaration shall declare at least one member
20760 name of the class. */
20762 {
20766 }
20767 else
20768 {
20769 tree type;
20771 /* See if this declaration is a friend. */
20773 /* If there were decl-specifiers, check to see if there was
20774 a class-declaration. */
20777 /* Nested classes have already been added to the class, but
20778 a `friend' needs to be explicitly registered. */
20780 {
20781 /* If the `friend' keyword was present, the friend must
20782 be introduced with a class-key. */
20785 "in C++03 a class-key must be used "
20787 /* In this case:
20789 template <typename T> struct A {
20790 friend struct A<T>::B;
20791 };
20793 A<T>::B will be represented by a TYPENAME_TYPE, and
20794 therefore not recognized by check_tag_decl. */
20796 {
20800 }
20803 "friend declaration does not name a class or "
20805 else
20808 }
20809 /* If there is no TYPE, an error message will already have
20810 been issued. */
20812 ;
20813 /* An anonymous aggregate has to be handled specially; such
20814 a declaration really declares a data member (with a
20815 particular type), as opposed to a nested class. */
20817 {
20818 /* C++11 9.5/6. */
20821 "a storage class on an anonymous aggregate "
20824 /* Remove constructors and such from TYPE, now that we
20825 know it is an anonymous aggregate. */
20827 /* And make the corresponding data member. */
20830 /* Add it to the class. */
20832 }
20833 else
20834 cp_parser_check_access_in_redeclaration
20837 }
20838 }
20839 else
20840 {
20843 /* Clear attributes from the decl_specifiers but keep them
20844 around as prefix attributes that apply them to the entity
20845 being declared. */
20849 /* See if these declarations will be friends. */
20852 /* Keep going until we hit the `;' at the end of the
20853 declaration. */
20855 {
20857 tree first_attribute;
20859 /* Peek at the next token. */
20862 /* Check for a bitfield declaration. */
20867 {
20868 tree identifier;
20869 tree width;
20871 /* Get the name of the bitfield. Note that we cannot just
20872 check TOKEN here because it may have been invalidated by
20873 the call to cp_lexer_peek_nth_token above. */
20876 else
20879 /* Consume the `:' token. */
20881 /* Get the width of the bitfield. */
20882 width
20885 /* Look for attributes that apply to the bitfield. */
20887 /* Remember which attributes are prefix attributes and
20888 which are not. */
20890 /* Combine the attributes. */
20893 /* Create the bitfield declaration. */
20896 identifier,
20897 sfk_none)
20900 width,
20901 attributes);
20902 }
20903 else
20904 {
20906 tree initializer;
20907 tree asm_specification;
20910 /* Parse the declarator. */
20911 declarator
20916 friend_p);
20918 /* If something went wrong parsing the declarator, make sure
20919 that we at least consume some tokens. */
20921 {
20922 /* Skip to the end of the statement. */
20924 /* If the next token is not a semicolon, that is
20925 probably because we just skipped over the body of
20926 a function. So, we consume a semicolon if
20927 present, but do not issue an error message if it
20928 is not present. */
20930 CPP_SEMICOLON))
20933 }
20936 cp_parser_check_for_definition_in_return_type
20940 /* Look for an asm-specification. */
20942 /* Look for attributes that apply to the declaration. */
20944 /* Remember which attributes are prefix attributes and
20945 which are not. */
20947 /* Combine the attributes. */
20950 /* If it's an `=', then we have a constant-initializer or a
20951 pure-specifier. It is not correct to parse the
20952 initializer before registering the member declaration
20953 since the member declaration should be in scope while
20954 its initializer is processed. However, the rest of the
20955 front end does not yet provide an interface that allows
20956 us to handle this correctly. */
20958 {
20959 /* In [class.mem]:
20961 A pure-specifier shall be used only in the declaration of
20962 a virtual function.
20964 A member-declarator can contain a constant-initializer
20965 only if it declares a static member of integral or
20966 enumeration type.
20968 Therefore, if the DECLARATOR is for a function, we look
20969 for a pure-specifier; otherwise, we look for a
20970 constant-initializer. When we call `grokfield', it will
20971 perform more stringent semantics checks. */
20983 {
20985 /* Don't require a constant rvalue in C++11, since we
20986 might want a reference constant. We'll enforce
20987 constancy later. */
20989 /* Parse the initializer. */
20992 }
20993 else
20994 /* Parse the initializer. */
20996 }
20999 {
21003 else
21005 }
21006 /* Otherwise, there is no initializer. */
21007 else
21010 /* See if we are probably looking at a function
21011 definition. We are certainly not looking at a
21012 member-declarator. Calling `grokfield' has
21013 side-effects, so we must not do it unless we are sure
21014 that we are looking at a member-declarator. */
21017 {
21018 /* The grammar does not allow a pure-specifier to be
21019 used when a member function is defined. (It is
21020 possible that this fact is an oversight in the
21021 standard, since a pure function may be defined
21022 outside of the class-specifier. */
21028 declarator,
21029 attributes);
21032 /* If the member was not a friend, declare it here. */
21035 /* Peek at the next token. */
21037 /* If the next token is a semicolon, consume it. */
21041 }
21042 else
21045 /* Create the declaration. */
21050 {
21053 else
21055 }
21056 }
21060 /* Reset PREFIX_ATTRIBUTES. */
21066 /* If there is any qualification still in effect, clear it
21067 now; we will be starting fresh with the next declarator. */
21071 /* If it's a `,', then there are more declarators. */
21073 {
21076 {
21080 }
21081 }
21082 /* If the next token isn't a `;', then we have a parse error. */
21084 CPP_SEMICOLON))
21085 {
21086 /* The next token might be a ways away from where the
21087 actual semicolon is missing. Find the previous token
21088 and use that for our error position. */
21093 /* Assume that the user meant to provide a semicolon. If
21094 we were to cp_parser_skip_to_end_of_statement, we might
21095 skip to a semicolon inside a member function definition
21096 and issue nonsensical error messages. */
21098 }
21101 {
21102 /* Add DECL to the list of members. */
21104 /* Explicitly include, eg, NSDMIs, for better error
21105 recovery (c++/58650). */
21114 /* Add DECL to the queue of NSDMI to be parsed later. */
21116 }
21120 }
21121 }
21124 out:
21126 }
21128 /* Parse a pure-specifier.
21130 pure-specifier:
21131 = 0
21133 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21134 Otherwise, ERROR_MARK_NODE is returned. */
21136 static tree
21138 {
21141 /* Look for the `=' token. */
21144 /* Look for the `0' token. */
21153 /* Accept = default or = delete in c++0x mode. */
21156 {
21159 }
21161 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21163 {
21168 }
21170 {
21173 }
21176 }
21178 /* Parse a constant-initializer.
21180 constant-initializer:
21181 = constant-expression
21183 Returns a representation of the constant-expression. */
21185 static tree
21187 {
21188 /* Look for the `=' token. */
21192 /* It is invalid to write:
21194 struct S { static const int i = { 7 }; };
21196 */
21198 {
21201 /* Consume the opening brace. */
21203 /* Skip the initializer. */
21205 /* Look for the trailing `}'. */
21209 }
21212 }
21214 /* Derived classes [gram.class.derived] */
21216 /* Parse a base-clause.
21218 base-clause:
21219 : base-specifier-list
21221 base-specifier-list:
21222 base-specifier ... [opt]
21223 base-specifier-list , base-specifier ... [opt]
21225 Returns a TREE_LIST representing the base-classes, in the order in
21226 which they were declared. The representation of each node is as
21227 described by cp_parser_base_specifier.
21229 In the case that no bases are specified, this function will return
21230 NULL_TREE, not ERROR_MARK_NODE. */
21232 static tree
21234 {
21237 /* Look for the `:' that begins the list. */
21240 /* Scan the base-specifier-list. */
21242 {
21244 tree base;
21247 /* Look for the base-specifier. */
21249 /* Look for the (optional) ellipsis. */
21251 {
21252 /* Consume the `...'. */
21256 }
21258 /* Add BASE to the front of the list. */
21260 {
21262 /* Make this a pack expansion type. */
21266 {
21269 }
21270 }
21271 /* Peek at the next token. */
21273 /* If it's not a comma, then the list is complete. */
21276 /* Consume the `,'. */
21278 }
21280 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21281 base class had a qualified name. However, the next name that
21282 appears is certainly not qualified. */
21288 }
21290 /* Parse a base-specifier.
21292 base-specifier:
21293 :: [opt] nested-name-specifier [opt] class-name
21294 virtual access-specifier [opt] :: [opt] nested-name-specifier
21295 [opt] class-name
21296 access-specifier virtual [opt] :: [opt] nested-name-specifier
21297 [opt] class-name
21299 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21300 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21301 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21302 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21304 static tree
21306 {
21314 tree type;
21316 /* Process the optional `virtual' and `access-specifier'. */
21318 {
21319 /* Peek at the next token. */
21321 /* Process `virtual'. */
21323 {
21325 /* If `virtual' appears more than once, issue an error. */
21327 {
21331 }
21335 /* Consume the `virtual' token. */
21343 /* If more than one access specifier appears, issue an
21344 error. */
21347 {
21351 }
21355 /* Consume the access-specifier. */
21363 }
21364 }
21365 /* It is not uncommon to see programs mechanically, erroneously, use
21366 the 'typename' keyword to denote (dependent) qualified types
21367 as base classes. */
21369 {
21374 else
21376 "keyword %<typename%> not allowed in this context "
21379 }
21381 /* Look for the optional `::' operator. */
21383 /* Look for the nested-name-specifier. The simplest way to
21384 implement:
21386 [temp.res]
21388 The keyword `typename' is not permitted in a base-specifier or
21389 mem-initializer; in these contexts a qualified name that
21390 depends on a template-parameter is implicitly assumed to be a
21391 type name.
21393 is to pretend that we have seen the `typename' keyword at this
21394 point. */
21398 typename_type,
21400 /* If the base class is given by a qualified name, assume that names
21401 we see are type names or templates, as appropriate. */
21407 /* DR 950 allows decltype as a base-specifier. */
21409 else
21410 {
21411 /* Otherwise, look for the class-name. */
21413 class_scope_p,
21414 template_p,
21415 typename_type,
21420 }
21426 }
21428 /* Exception handling [gram.exception] */
21430 /* Parse an (optional) noexcept-specification.
21432 noexcept-specification:
21433 noexcept ( constant-expression ) [opt]
21435 If no noexcept-specification is present, returns NULL_TREE.
21436 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21437 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21438 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21439 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21440 in which case a boolean condition is returned instead. */
21442 static tree
21447 {
21451 /* Peek at the next token. */
21454 /* Is it a noexcept-specification? */
21456 {
21457 tree expr;
21461 {
21465 {
21466 /* Types may not be defined in an exception-specification. */
21468 parser->type_definition_forbidden_message
21473 /* Restore the saved message. */
21475 }
21476 else
21477 {
21480 }
21483 }
21484 else
21485 {
21489 }
21491 /* We cannot build a noexcept-spec right away because this will check
21492 that expr is a constexpr. */
21495 else
21497 }
21498 else
21500 }
21502 /* Parse an (optional) exception-specification.
21504 exception-specification:
21505 throw ( type-id-list [opt] )
21507 Returns a TREE_LIST representing the exception-specification. The
21508 TREE_VALUE of each node is a type. */
21510 static tree
21512 {
21514 tree type_id_list;
21517 /* Peek at the next token. */
21520 /* Is it a noexcept-specification? */
21526 /* If it's not `throw', then there's no exception-specification. */
21530 #if 0
21531 /* Enable this once a lot of code has transitioned to noexcept? */
21535 #endif
21537 /* Consume the `throw'. */
21540 /* Look for the `('. */
21543 /* Peek at the next token. */
21545 /* If it's not a `)', then there is a type-id-list. */
21547 {
21548 /* Types may not be defined in an exception-specification. */
21550 parser->type_definition_forbidden_message
21552 /* Parse the type-id-list. */
21554 /* Restore the saved message. */
21556 }
21557 else
21560 /* Look for the `)'. */
21564 }
21566 /* Parse an (optional) type-id-list.
21568 type-id-list:
21569 type-id ... [opt]
21570 type-id-list , type-id ... [opt]
21572 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21573 in the order that the types were presented. */
21575 static tree
21577 {
21581 {
21583 tree type;
21585 /* Get the next type-id. */
21587 /* Parse the optional ellipsis. */
21589 {
21590 /* Consume the `...'. */
21593 /* Turn the type into a pack expansion expression. */
21595 }
21596 /* Add it to the list. */
21598 /* Peek at the next token. */
21600 /* If it is not a `,', we are done. */
21603 /* Consume the `,'. */
21605 }
21608 }
21610 /* Parse a try-block.
21612 try-block:
21613 try compound-statement handler-seq */
21615 static tree
21617 {
21618 tree try_block;
21632 }
21634 /* Parse a function-try-block.
21636 function-try-block:
21637 try ctor-initializer [opt] function-body handler-seq */
21639 static bool
21641 {
21642 tree compound_stmt;
21643 tree try_block;
21646 /* Look for the `try' keyword. */
21649 /* Let the rest of the front end know where we are. */
21651 /* Parse the function-body. */
21652 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21654 /* We're done with the `try' part. */
21656 /* Parse the handlers. */
21658 /* We're done with the handlers. */
21662 }
21664 /* Parse a handler-seq.
21666 handler-seq:
21667 handler handler-seq [opt] */
21669 static void
21671 {
21673 {
21676 /* Parse the handler. */
21678 /* Peek at the next token. */
21680 /* If it's not `catch' then there are no more handlers. */
21683 }
21684 }
21686 /* Parse a handler.
21688 handler:
21689 catch ( exception-declaration ) compound-statement */
21691 static void
21693 {
21694 tree handler;
21695 tree declaration;
21705 }
21707 /* Parse an exception-declaration.
21709 exception-declaration:
21710 type-specifier-seq declarator
21711 type-specifier-seq abstract-declarator
21712 type-specifier-seq
21713 ...
21715 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21716 ellipsis variant is used. */
21718 static tree
21720 {
21721 cp_decl_specifier_seq type_specifiers;
21725 /* If it's an ellipsis, it's easy to handle. */
21727 {
21728 /* Consume the `...' token. */
21731 }
21733 /* Types may not be defined in exception-declarations. */
21735 parser->type_definition_forbidden_message
21738 /* Parse the type-specifier-seq. */
21742 /* If it's a `)', then there is no declarator. */
21745 else
21752 /* Restore the saved message. */
21759 }
21761 /* Parse a throw-expression.
21763 throw-expression:
21764 throw assignment-expression [opt]
21766 Returns a THROW_EXPR representing the throw-expression. */
21768 static tree
21770 {
21771 tree expression;
21776 /* Figure out whether or not there is an assignment-expression
21777 following the "throw" keyword. */
21785 else
21789 }
21791 /* GNU Extensions */
21793 /* Parse an (optional) asm-specification.
21795 asm-specification:
21796 asm ( string-literal )
21798 If the asm-specification is present, returns a STRING_CST
21799 corresponding to the string-literal. Otherwise, returns
21800 NULL_TREE. */
21802 static tree
21804 {
21806 tree asm_specification;
21808 /* Peek at the next token. */
21810 /* If the next token isn't the `asm' keyword, then there's no
21811 asm-specification. */
21815 /* Consume the `asm' token. */
21817 /* Look for the `('. */
21820 /* Look for the string-literal. */
21823 /* Look for the `)'. */
21827 }
21829 /* Parse an asm-operand-list.
21831 asm-operand-list:
21832 asm-operand
21833 asm-operand-list , asm-operand
21835 asm-operand:
21836 string-literal ( expression )
21837 [ string-literal ] string-literal ( expression )
21839 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21840 each node is the expression. The TREE_PURPOSE is itself a
21841 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21842 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21843 is a STRING_CST for the string literal before the parenthesis. Returns
21844 ERROR_MARK_NODE if any of the operands are invalid. */
21846 static tree
21848 {
21853 {
21854 tree string_literal;
21855 tree expression;
21856 tree name;
21859 {
21860 /* Consume the `[' token. */
21862 /* Read the operand name. */
21867 /* Look for the closing `]'. */
21869 }
21870 else
21872 /* Look for the string-literal. */
21875 /* Look for the `('. */
21877 /* Parse the expression. */
21879 /* Look for the `)'. */
21887 /* Add this operand to the list. */
21889 expression,
21890 asm_operands);
21891 /* If the next token is not a `,', there are no more
21892 operands. */
21895 /* Consume the `,'. */
21897 }
21900 }
21902 /* Parse an asm-clobber-list.
21904 asm-clobber-list:
21905 string-literal
21906 asm-clobber-list , string-literal
21908 Returns a TREE_LIST, indicating the clobbers in the order that they
21909 appeared. The TREE_VALUE of each node is a STRING_CST. */
21911 static tree
21913 {
21917 {
21918 tree string_literal;
21920 /* Look for the string literal. */
21922 /* Add it to the list. */
21924 /* If the next token is not a `,', then the list is
21925 complete. */
21928 /* Consume the `,' token. */
21930 }
21933 }
21935 /* Parse an asm-label-list.
21937 asm-label-list:
21938 identifier
21939 asm-label-list , identifier
21941 Returns a TREE_LIST, indicating the labels in the order that they
21942 appeared. The TREE_VALUE of each node is a label. */
21944 static tree
21946 {
21950 {
21953 /* Look for the identifier. */
21956 {
21959 {
21965 }
21966 }
21967 /* If the next token is not a `,', then the list is
21968 complete. */
21971 /* Consume the `,' token. */
21973 }
21976 }
21978 /* Return TRUE iff the next tokens in the stream are possibly the
21979 beginning of a GNU extension attribute. */
21981 static bool
21983 {
21985 }
21987 /* Return TRUE iff the next tokens in the stream are possibly the
21988 beginning of a standard C++-11 attribute specifier. */
21990 static bool
21992 {
21994 }
21996 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21997 beginning of a standard C++-11 attribute specifier. */
21999 static bool
22001 {
22009 }
22011 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22012 beginning of a GNU extension attribute. */
22014 static bool
22016 {
22020 }
22022 /* Return true iff the next tokens can be the beginning of either a
22023 GNU attribute list, or a standard C++11 attribute sequence. */
22025 static bool
22027 {
22030 }
22032 /* Return true iff the next Nth tokens can be the beginning of either
22033 a GNU attribute list, or a standard C++11 attribute sequence. */
22035 static bool
22037 {
22040 }
22042 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22043 of GNU attributes, or return NULL. */
22045 static tree
22047 {
22051 }
22053 #define CILK_SIMD_FN_CLAUSE_MASK \
22054 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22055 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22056 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22057 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22058 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22060 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22061 vector [(<clauses>)] */
22063 static void
22065 {
22069 {
22074 }
22077 {
22080 paren_scope++;
22081 }
22083 {
22086 paren_scope++;
22088 paren_scope--;
22089 /* Do not push the last ')' */
22092 }
22101 }
22103 /* Parse an (optional) series of attributes.
22105 attributes:
22106 attributes attribute
22108 attribute:
22109 __attribute__ (( attribute-list [opt] ))
22111 The return value is as for cp_parser_gnu_attribute_list. */
22113 static tree
22115 {
22119 {
22121 tree attribute_list;
22124 /* Peek at the next token. */
22126 /* If it's not `__attribute__', then we're done. */
22130 /* Consume the `__attribute__' keyword. */
22132 /* Look for the two `(' tokens. */
22136 /* Peek at the next token. */
22139 /* Parse the attribute-list. */
22141 else
22142 /* If the next token is a `)', then there is no attribute
22143 list. */
22146 /* Look for the two `)' tokens. */
22154 /* Add these new attributes to the list. */
22156 }
22159 }
22161 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22162 "__vector" or "__vector__." */
22166 {
22170 }
22172 /* Parse a GNU attribute-list.
22174 attribute-list:
22175 attribute
22176 attribute-list , attribute
22178 attribute:
22179 identifier
22180 identifier ( identifier )
22181 identifier ( identifier , expression-list )
22182 identifier ( expression-list )
22184 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22185 to an attribute. The TREE_PURPOSE of each node is the identifier
22186 indicating which attribute is in use. The TREE_VALUE represents
22187 the arguments, if any. */
22189 static tree
22191 {
22197 {
22199 tree identifier;
22200 tree attribute;
22202 /* Look for the identifier. We also allow keywords here; for
22203 example `__attribute__ ((const))' is legal. */
22207 {
22210 /* Consume the token, but save it since we need it for the
22211 SIMD enabled function parsing. */
22214 /* Save away the identifier that indicates which attribute
22215 this is. */
22217 /* For keywords, use the canonical spelling, not the
22218 parsed identifier. */
22224 /* Peek at the next token. */
22226 /* If it's an `(', then parse the attribute arguments. */
22228 {
22233 {
22236 }
22237 else
22238 vec = cp_parser_parenthesized_expression_list
22244 else
22245 {
22248 }
22249 /* Save the arguments away. */
22251 }
22253 {
22256 }
22259 {
22260 /* Add this attribute to the list. */
22263 }
22266 }
22267 /* Now, look for more attributes. If the next token isn't a
22268 `,', we're done. */
22272 /* Consume the comma and keep going. */
22274 }
22277 /* We built up the list in reverse order. */
22279 }
22281 /* Parse a standard C++11 attribute.
22283 The returned representation is a TREE_LIST which TREE_PURPOSE is
22284 the scoped name of the attribute, and the TREE_VALUE is its
22285 arguments list.
22287 Note that the scoped name of the attribute is itself a TREE_LIST
22288 which TREE_PURPOSE is the namespace of the attribute, and
22289 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22290 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22291 and which TREE_PURPOSE is directly the attribute name.
22293 Clients of the attribute code should use get_attribute_namespace
22294 and get_attribute_name to get the actual namespace and name of
22295 attributes, regardless of their being GNU or C++11 attributes.
22297 attribute:
22298 attribute-token attribute-argument-clause [opt]
22300 attribute-token:
22301 identifier
22302 attribute-scoped-token
22304 attribute-scoped-token:
22305 attribute-namespace :: identifier
22307 attribute-namespace:
22308 identifier
22310 attribute-argument-clause:
22311 ( balanced-token-seq )
22313 balanced-token-seq:
22314 balanced-token [opt]
22315 balanced-token-seq balanced-token
22317 balanced-token:
22318 ( balanced-token-seq )
22319 [ balanced-token-seq ]
22320 { balanced-token-seq }. */
22322 static tree
22324 {
22328 /* First, parse name of the the attribute, a.k.a
22329 attribute-token. */
22346 {
22347 /* We are seeing a scoped attribute token. */
22357 else
22358 {
22362 }
22364 NULL_TREE);
22366 }
22367 else
22368 {
22370 NULL_TREE);
22371 /* C++11 noreturn attribute is equivalent to GNU's. */
22374 /* C++14 deprecated attribute is equivalent to GNU's. */
22376 {
22379 "%<deprecated%> is a C++14 feature;"
22382 }
22383 }
22385 /* Now parse the optional argument clause of the attribute. */
22390 {
22396 /* A GNU attribute that takes an identifier in parameter. */
22399 vec = cp_parser_parenthesized_expression_list
22405 else
22406 {
22409 }
22413 else
22415 }
22418 }
22420 /* Parse a list of standard C++-11 attributes.
22422 attribute-list:
22423 attribute [opt]
22424 attribute-list , attribute[opt]
22425 attribute ...
22426 attribute-list , attribute ...
22427 */
22429 static tree
22431 {
22436 {
22441 {
22444 }
22449 }
22452 }
22454 /* Parse a standard C++-11 attribute specifier.
22456 attribute-specifier:
22457 [ [ attribute-list ] ]
22458 alignment-specifier
22460 alignment-specifier:
22461 alignas ( type-id ... [opt] )
22462 alignas ( alignment-expression ... [opt] ). */
22464 static tree
22466 {
22472 {
22481 else
22482 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22483 when we are sure that we have actually parsed them. */
22485 }
22486 else
22487 {
22488 tree alignas_expr;
22490 /* Look for an alignment-specifier. */
22502 {
22505 }
22511 {
22515 alignas_expr =
22522 }
22525 {
22528 }
22532 /* Build the C++-11 representation of an 'aligned'
22533 attribute. */
22534 attributes =
22538 }
22541 }
22543 /* Parse a standard C++-11 attribute-specifier-seq.
22545 attribute-specifier-seq:
22546 attribute-specifier-seq [opt] attribute-specifier
22547 */
22549 static tree
22551 {
22555 {
22564 }
22568 }
22570 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22571 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22572 current value of the PEDANTIC flag, regardless of whether or not
22573 the `__extension__' keyword is present. The caller is responsible
22574 for restoring the value of the PEDANTIC flag. */
22576 static bool
22578 {
22579 /* Save the old value of the PEDANTIC flag. */
22583 {
22584 /* Consume the `__extension__' token. */
22586 /* We're not being pedantic while the `__extension__' keyword is
22587 in effect. */
22591 }
22594 }
22596 /* Parse a label declaration.
22598 label-declaration:
22599 __label__ label-declarator-seq ;
22601 label-declarator-seq:
22602 identifier , label-declarator-seq
22603 identifier */
22605 static void
22607 {
22608 /* Look for the `__label__' keyword. */
22612 {
22613 tree identifier;
22615 /* Look for an identifier. */
22617 /* If we failed, stop. */
22620 /* Declare it as a label. */
22622 /* If the next token is a `;', stop. */
22625 /* Look for the `,' separating the label declarations. */
22627 }
22629 /* Look for the final `;'. */
22631 }
22633 /* Support Functions */
22635 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22636 NAME should have one of the representations used for an
22637 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22638 is returned. If PARSER->SCOPE is a dependent type, then a
22639 SCOPE_REF is returned.
22641 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22642 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22643 was formed. Abstractly, such entities should not be passed to this
22644 function, because they do not need to be looked up, but it is
22645 simpler to check for this special case here, rather than at the
22646 call-sites.
22648 In cases not explicitly covered above, this function returns a
22649 DECL, OVERLOAD, or baselink representing the result of the lookup.
22650 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22651 is returned.
22653 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22654 (e.g., "struct") that was used. In that case bindings that do not
22655 refer to types are ignored.
22657 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22658 ignored.
22660 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22661 are ignored.
22663 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22664 types.
22666 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22667 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22668 NULL_TREE otherwise. */
22670 static tree
22677 location_t name_location)
22678 {
22679 tree decl;
22682 /* Assume that the lookup will be unambiguous. */
22686 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22687 no longer valid. Note that if we are parsing tentatively, and
22688 the parse fails, OBJECT_TYPE will be automatically restored. */
22694 /* A template-id has already been resolved; there is no lookup to
22695 do. */
22699 {
22703 }
22705 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22706 it should already have been checked to make sure that the name
22707 used matches the type being destroyed. */
22709 {
22710 tree type;
22712 /* Figure out to which type this destructor applies. */
22717 else
22719 /* If that's not a class type, there is no destructor. */
22726 /* If it was a class type, return the destructor. */
22728 }
22730 /* By this point, the NAME should be an ordinary identifier. If
22731 the id-expression was a qualified name, the qualifying scope is
22732 stored in PARSER->SCOPE at this point. */
22735 /* Perform the lookup. */
22737 {
22743 /* If the SCOPE is dependent, the lookup must be deferred until
22744 the template is instantiated -- unless we are explicitly
22745 looking up names in uninstantiated templates. Even then, we
22746 cannot look up the name if the scope is not a class type; it
22747 might, for example, be a template type parameter. */
22752 /* Defer lookup. */
22754 else
22755 {
22758 /* If PARSER->SCOPE is a dependent type, then it must be a
22759 class type, and we must not be checking dependencies;
22760 otherwise, we would have processed this lookup above. So
22761 that PARSER->SCOPE is not considered a dependent base by
22762 lookup_member, we must enter the scope here. */
22766 /* If the PARSER->SCOPE is a template specialization, it
22767 may be instantiated during name lookup. In that case,
22768 errors may be issued. Even if we rollback the current
22769 tentative parse, those errors are valid. */
22774 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22775 lookup result and the nested-name-specifier nominates a class C:
22776 * if the name specified after the nested-name-specifier, when
22777 looked up in C, is the injected-class-name of C (Clause 9), or
22778 * if the name specified after the nested-name-specifier is the
22779 same as the identifier or the simple-template-id's template-
22780 name in the last component of the nested-name-specifier,
22781 the name is instead considered to name the constructor of
22782 class C. [ Note: for example, the constructor is not an
22783 acceptable lookup result in an elaborated-type-specifier so
22784 the constructor would not be used in place of the
22785 injected-class-name. --end note ] Such a constructor name
22786 shall be used only in the declarator-id of a declaration that
22787 names a constructor or in a using-declaration. */
22795 /* If we have a single function from a using decl, pull it out. */
22802 }
22804 /* If the scope is a dependent type and either we deferred lookup or
22805 we did lookup but didn't find the name, rememeber the name. */
22808 {
22810 {
22811 tree type;
22813 /* The resolution to Core Issue 180 says that `struct
22814 A::B' should be considered a type-name, even if `A'
22815 is dependent. */
22820 }
22824 CPP_CLOSE_PAREN)))
22828 else
22831 is_template);
22832 }
22835 }
22837 {
22838 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22839 OBJECT_TYPE is not a class. */
22841 /* If the OBJECT_TYPE is a template specialization, it may
22842 be instantiated during name lookup. In that case, errors
22843 may be issued. Even if we rollback the current tentative
22844 parse, those errors are valid. */
22846 name,
22849 tf_warning_or_error);
22850 else
22854 /* Look it up in the enclosing context. */
22860 }
22861 else
22862 {
22868 }
22870 /* If the lookup failed, let our caller know. */
22874 /* Pull out the template from an injected-class-name (or multiple). */
22878 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22880 {
22883 /* The error message we have to print is too complicated for
22884 cp_parser_error, so we incorporate its actions directly. */
22886 {
22888 name);
22890 }
22892 }
22900 /* If we have resolved the name of a member declaration, check to
22901 see if the declaration is accessible. When the name resolves to
22902 set of overloaded functions, accessibility is checked when
22903 overload resolution is done.
22905 During an explicit instantiation, access is not checked at all,
22906 as per [temp.explicit]. */
22913 }
22915 /* Like cp_parser_lookup_name, but for use in the typical case where
22916 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22917 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22919 static tree
22921 {
22923 none_type,
22928 location);
22929 }
22931 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22932 the current context, return the TYPE_DECL. If TAG_NAME_P is
22933 true, the DECL indicates the class being defined in a class-head,
22934 or declared in an elaborated-type-specifier.
22936 Otherwise, return DECL. */
22938 static tree
22940 {
22941 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22942 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22944 struct A {
22945 template <typename T> struct B;
22946 };
22948 template <typename T> struct A::B {};
22950 Similarly, in an elaborated-type-specifier:
22952 namespace N { struct X{}; }
22954 struct A {
22955 template <typename T> friend struct N::X;
22956 };
22958 However, if the DECL refers to a class type, and we are in
22959 the scope of the class, then the name lookup automatically
22960 finds the TYPE_DECL created by build_self_reference rather
22961 than a TEMPLATE_DECL. For example, in:
22963 template <class T> struct S {
22964 S s;
22965 };
22967 there is no need to handle such case. */
22973 }
22975 /* If too many, or too few, template-parameter lists apply to the
22976 declarator, issue an error message. Returns TRUE if all went well,
22977 and FALSE otherwise. */
22979 static bool
22982 location_t declarator_location)
22983 {
22985 {
22987 {
22995 /* If the DECLARATOR has the form `X<y>' then it uses one
22996 additional level of template parameters. */
22999 return cp_parser_check_template_parameters
23001 }
23016 }
23018 }
23020 /* NUM_TEMPLATES were used in the current declaration. If that is
23021 invalid, return FALSE and issue an error messages. Otherwise,
23022 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23023 declarator and we can print more accurate diagnostics. */
23025 static bool
23028 location_t location,
23030 {
23031 /* If there are the same number of template classes and parameter
23032 lists, that's OK. */
23035 /* If there are more, but only one more, then we are referring to a
23036 member template. That's OK too. */
23039 /* If there are more template classes than parameter lists, we have
23040 something like:
23042 template <class T> void S<T>::R<T>::f (); */
23044 {
23054 else
23057 }
23058 /* Otherwise, there are too many template parameter lists. We have
23059 something like:
23061 template <class T> template <class U> void S::f(); */
23064 }
23066 /* Parse an optional `::' token indicating that the following name is
23067 from the global namespace. If so, PARSER->SCOPE is set to the
23068 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23069 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23070 Returns the new value of PARSER->SCOPE, if the `::' token is
23071 present, and NULL_TREE otherwise. */
23073 static tree
23075 {
23078 /* Peek at the next token. */
23080 /* If we're looking at a `::' token then we're starting from the
23081 global namespace, not our current location. */
23083 {
23084 /* Consume the `::' token. */
23086 /* Set the SCOPE so that we know where to start the lookup. */
23092 }
23094 {
23098 }
23101 }
23103 /* Returns TRUE if the upcoming token sequence is the start of a
23104 constructor declarator. If FRIEND_P is true, the declarator is
23105 preceded by the `friend' specifier. */
23107 static bool
23109 {
23112 tree nested_name_specifier;
23115 /* The common case is that this is not a constructor declarator, so
23116 try to avoid doing lots of work if at all possible. It's not
23117 valid declare a constructor at function scope. */
23120 /* And only certain tokens can begin a constructor declarator. */
23128 /* Parse tentatively; we are going to roll back all of the tokens
23129 consumed here. */
23131 /* Assume that we are looking at a constructor declarator. */
23134 /* Look for the optional `::' operator. */
23137 /* Look for the nested-name-specifier. */
23138 nested_name_specifier
23149 /* Outside of a class-specifier, there must be a
23150 nested-name-specifier. */
23156 /* If we have a class scope, this is easy; DR 147 says that S::S always
23157 names the constructor, and no other qualified name could. */
23160 {
23170 }
23171 /* If we still think that this might be a constructor-declarator,
23172 look for a class-name. */
23174 {
23175 /* If we have:
23177 template <typename T> struct S {
23178 S();
23179 };
23181 we must recognize that the nested `S' names a class. */
23182 tree type_decl;
23186 none_type,
23190 /* If there was no class-name, then this is not a constructor.
23191 Otherwise, if we are in a class-specifier and we aren't
23192 handling a friend declaration, check that its type matches
23193 current_class_type (c++/38313). Note: error_mark_node
23194 is left alone for error recovery purposes. */
23196 && (outside_class_specifier_p
23201 /* If we're still considering a constructor, we have to see a `(',
23202 to begin the parameter-declaration-clause, followed by either a
23203 `)', an `...', or a decl-specifier. We need to check for a
23204 type-specifier to avoid being fooled into thinking that:
23206 S (f) (int);
23208 is a constructor. (It is actually a function named `f' that
23209 takes one parameter (of type `int') and returns a value of type
23210 `S'. */
23218 /* A parameter declaration begins with a decl-specifier,
23219 which is either the "attribute" keyword, a storage class
23220 specifier, or (usually) a type-specifier. */
23222 {
23223 tree type;
23227 /* Names appearing in the type-specifier should be looked up
23228 in the scope of the class. */
23231 else
23232 {
23235 {
23239 {
23242 }
23243 }
23245 }
23247 /* Inside the constructor parameter list, surrounding
23248 template-parameter-lists do not apply. */
23249 saved_num_template_parameter_lists
23253 /* Look for the type-specifier. */
23255 CP_PARSER_FLAGS_NONE,
23261 parser->num_template_parameter_lists
23264 /* Leave the scope of the class. */
23269 }
23270 }
23272 /* We did not really want to consume any tokens. */
23276 }
23278 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23279 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23280 they must be performed once we are in the scope of the function.
23282 Returns the function defined. */
23284 static tree
23285 cp_parser_function_definition_from_specifiers_and_declarator
23288 tree attributes,
23290 {
23291 tree fn;
23294 /* Begin the function-definition. */
23297 /* The things we're about to see are not directly qualified by any
23298 template headers we've seen thus far. */
23301 /* If there were names looked up in the decl-specifier-seq that we
23302 did not check, check them now. We must wait until we are in the
23303 scope of the function to perform the checks, since the function
23304 might be a friend. */
23308 {
23311 }
23314 {
23315 /* Skip the entire function. */
23318 }
23320 {
23321 /* Seen already, skip it. An error message has already been output. */
23325 /* If this is a function from a class, pop the nested class. */
23328 }
23329 else
23330 {
23331 timevar_id_t tv;
23334 else
23340 }
23343 }
23345 /* Parse the part of a function-definition that follows the
23346 declarator. INLINE_P is TRUE iff this function is an inline
23347 function defined within a class-specifier.
23349 Returns the function defined. */
23351 static tree
23354 {
23355 tree fn;
23361 bool fully_implicit_function_template_p
23364 tree implicit_template_parms
23367 cp_binding_level* implicit_template_scope
23373 /* If the next token is `return', then the code may be trying to
23374 make use of the "named return value" extension that G++ used to
23375 support. */
23378 {
23379 /* Consume the `return' keyword. */
23381 /* Look for the identifier that indicates what value is to be
23382 returned. */
23384 /* Issue an error message. */
23387 /* Skip tokens until we reach the start of the function body. */
23389 {
23396 }
23397 }
23398 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23399 anything declared inside `f'. */
23400 saved_in_unbraced_linkage_specification_p
23403 /* Inside the function, surrounding template-parameter-lists do not
23404 apply. */
23405 saved_num_template_parameter_lists
23411 /* If the next token is `try', `__transaction_atomic', or
23412 `__transaction_relaxed`, then we are looking at either function-try-block
23413 or function-transaction-block. Note that all of these include the
23414 function-body. */
23417 RID_TRANSACTION_ATOMIC);
23419 RID_TRANSACTION_RELAXED))
23421 RID_TRANSACTION_RELAXED);
23424 else
23425 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23430 /* Finish the function. */
23433 /* Generate code for it, if necessary. */
23435 /* Restore the saved values. */
23436 parser->in_unbraced_linkage_specification_p
23438 parser->num_template_parameter_lists
23442 parser->fully_implicit_function_template_p
23444 parser->implicit_template_parms
23446 parser->implicit_template_scope
23453 }
23455 /* Parse a template-declaration, assuming that the `export' (and
23456 `extern') keywords, if present, has already been scanned. MEMBER_P
23457 is as for cp_parser_template_declaration. */
23459 static void
23461 {
23464 tree parameter_list;
23469 /* Look for the `template' keyword. */
23474 /* And the `<'. */
23478 {
23479 /* 14.5.2.2 [temp.mem]
23481 A local class shall not have member templates. */
23486 }
23487 /* [temp]
23489 A template ... shall not have C linkage. */
23491 {
23493 /* Give it C++ linkage to avoid confusing other parts of the
23494 front end. */
23497 }
23498 else
23501 /* We cannot perform access checks on the template parameter
23502 declarations until we know what is being declared, just as we
23503 cannot check the decl-specifier list. */
23506 /* If the next token is `>', then we have an invalid
23507 specialization. Rather than complain about an invalid template
23508 parameter, issue an error message here. */
23510 {
23514 }
23515 else
23516 {
23517 /* Parse the template parameters. */
23519 }
23521 /* Get the deferred access checks from the parameter list. These
23522 will be checked once we know what is being declared, as for a
23523 member template the checks must be performed in the scope of the
23524 class containing the member. */
23527 /* Look for the `>'. */
23529 /* We just processed one more parameter list. */
23531 /* If the next token is `template', there are more template
23532 parameters. */
23534 RID_TEMPLATE))
23539 else
23540 {
23541 /* There are no access checks when parsing a template, as we do not
23542 know if a specialization will be a friend. */
23546 checks,
23547 member_p,
23552 /* If this is a member template declaration, let the front
23553 end know. */
23555 {
23560 }
23565 }
23566 /* We are done with the current parameter list. */
23571 /* Finish up. */
23574 /* Check the template arguments for a literal operator template. */
23578 {
23582 else
23583 {
23586 {
23592 }
23594 {
23602 }
23603 else
23605 }
23607 {
23610 " Expected non-type template argument pack <char...>"
23612 decl);
23613 else
23616 decl);
23617 }
23618 }
23619 /* Register member declarations. */
23622 /* For the erroneous case of a template with C linkage, we pushed an
23623 implicit C++ linkage scope; exit that scope now. */
23626 /* If DECL is a function template, we must return to parse it later.
23627 (Even though there is no definition, there might be default
23628 arguments that need handling.) */
23632 }
23634 /* Perform the deferred access checks from a template-parameter-list.
23635 CHECKS is a TREE_LIST of access checks, as returned by
23636 get_deferred_access_checks. */
23638 static void
23639 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23640 {
23644 }
23646 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23647 `function-definition' sequence that follows a template header.
23648 If MEMBER_P is true, this declaration appears in a class scope.
23650 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23651 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23653 static tree
23659 {
23662 cp_decl_specifier_seq decl_specifiers;
23666 /* This function is only used when processing a template
23667 declaration. */
23671 /* Defer access checks until we know what is being declared. */
23674 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23675 alternative. */
23678 CP_PARSER_FLAGS_OPTIONAL,
23684 /* There are no template typedefs. */
23686 {
23690 }
23692 /* Gather up the access checks that occurred the
23693 decl-specifier-seq. */
23696 /* Check for the declaration of a template class. */
23698 {
23700 {
23703 /* In this case:
23705 struct C {
23706 friend template <typename T> struct A<T>::B;
23707 };
23709 A<T>::B will be represented by a TYPENAME_TYPE, and
23710 therefore not recognized by shadow_tag. */
23712 && !decl
23719 else
23722 /* Perform access checks for template parameters. */
23724 }
23725 }
23727 /* Complain about missing 'typename' or other invalid type names. */
23730 {
23731 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23732 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23733 the rest of this declaration. */
23736 }
23738 /* If it's not a template class, try for a template function. If
23739 the next token is a `;', then this declaration does not declare
23740 anything. But, if there were errors in the decl-specifiers, then
23741 the error might well have come from an attempted class-specifier.
23742 In that case, there's no need to warn about a missing declarator. */
23746 {
23749 checks,
23751 member_p,
23752 declares_class_or_enum,
23756 /* 7.1.1-1 [dcl.stc]
23758 A storage-class-specifier shall not be specified in an explicit
23759 specialization... */
23761 && explicit_specialization_p
23763 {
23767 }
23771 }
23773 /* Look for a trailing `;' after the declaration. */
23779 out:
23782 /* Clear any current qualification; whatever comes next is the start
23783 of something new. */
23789 }
23791 /* Parse a cast-expression that is not the operand of a unary "&". */
23793 static tree
23795 {
23798 }
23800 /* Parse a functional cast to TYPE. Returns an expression
23801 representing the cast. */
23803 static tree
23805 {
23807 tree expression_list;
23808 tree cast;
23815 {
23823 tf_warning_or_error);
23824 }
23833 else
23834 {
23837 }
23840 tf_warning_or_error);
23841 /* [expr.const]/1: In an integral constant expression "only type
23842 conversions to integral or enumeration type can be used". */
23848 NIC_CONSTRUCTOR))
23851 }
23853 /* Save the tokens that make up the body of a member function defined
23854 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23855 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23856 specifiers applied to the declaration. Returns the FUNCTION_DECL
23857 for the member function. */
23859 static tree
23863 tree attributes)
23864 {
23867 tree fn;
23869 /* Create the FUNCTION_DECL. */
23872 /* If something went badly wrong, bail out now. */
23874 {
23875 /* If there's a function-body, skip it. */
23880 }
23882 /* Remember it, if there default args to post process. */
23885 /* Save away the tokens that make up the body of the
23886 function. */
23888 /* Handle function try blocks. */
23891 /* We can have braced-init-list mem-initializers before the fn body. */
23893 {
23896 {
23897 /* cache_group will stop after an un-nested { } pair, too. */
23901 /* variadic mem-inits have ... after the ')'. */
23904 }
23905 }
23907 /* Handle function try blocks. */
23912 /* Save away the inline definition; we will process it when the
23913 class is complete. */
23917 /* We need to know that this was defined in the class, so that
23918 friend templates are handled correctly. */
23921 /* Add FN to the queue of functions to be parsed later. */
23925 }
23927 /* Save the tokens that make up the in-class initializer for a non-static
23928 data member. Returns a DEFAULT_ARG. */
23930 static tree
23932 {
23934 }
23936 /* Parse a template-argument-list, as well as the trailing ">" (but
23937 not the opening "<"). See cp_parser_template_argument_list for the
23938 return value. */
23940 static tree
23942 {
23943 tree arguments;
23944 tree saved_scope;
23945 tree saved_qualifying_scope;
23946 tree saved_object_scope;
23951 /* [temp.names]
23953 When parsing a template-id, the first non-nested `>' is taken as
23954 the end of the template-argument-list rather than a greater-than
23955 operator. */
23956 saved_greater_than_is_operator_p
23959 /* Parsing the argument list may modify SCOPE, so we save it
23960 here. */
23964 /* We need to evaluate the template arguments, even though this
23965 template-id may be nested within a "sizeof". */
23970 /* Parse the template-argument-list itself. */
23974 else
23976 /* Look for the `>' that ends the template-argument-list. If we find
23977 a '>>' instead, it's probably just a typo. */
23979 {
23981 {
23982 /* In C++0x, a `>>' in a template argument list or cast
23983 expression is considered to be two separate `>'
23984 tokens. So, change the current token to a `>', but don't
23985 consume it: it will be consumed later when the outer
23986 template argument list (or cast expression) is parsed.
23987 Note that this replacement of `>' for `>>' is necessary
23988 even if we are parsing tentatively: in the tentative
23989 case, after calling
23990 cp_parser_enclosed_template_argument_list we will always
23991 throw away all of the template arguments and the first
23992 closing `>', either because the template argument list
23993 was erroneous or because we are replacing those tokens
23994 with a CPP_TEMPLATE_ID token. The second `>' (which will
23995 not have been thrown away) is needed either to close an
23996 outer template argument list or to complete a new-style
23997 cast. */
24000 }
24002 {
24003 /* If we're in a nested template argument list, the '>>' has
24004 to be a typo for '> >'. We emit the error message, but we
24005 continue parsing and we push a '>' as next token, so that
24006 the argument list will be parsed correctly. Note that the
24007 global source location is still on the token before the
24008 '>>', so we need to say explicitly where we want it. */
24014 }
24015 else
24016 {
24017 /* If this is not a nested template argument list, the '>>'
24018 is a typo for '>'. Emit an error message and continue.
24019 Same deal about the token location, but here we can get it
24020 right by consuming the '>>' before issuing the diagnostic. */
24023 "spurious %<>>%>, use %<>%> to terminate "
24025 }
24026 }
24027 else
24029 /* The `>' token might be a greater-than operator again now. */
24030 parser->greater_than_is_operator_p
24032 /* Restore the SAVED_SCOPE. */
24040 }
24042 /* MEMBER_FUNCTION is a member function, or a friend. If default
24043 arguments, or the body of the function have not yet been parsed,
24044 parse them now. */
24046 static void
24048 {
24050 /* If this member is a template, get the underlying
24051 FUNCTION_DECL. */
24055 /* There should not be any class definitions in progress at this
24056 point; the bodies of members are only parsed outside of all class
24057 definitions. */
24059 /* While we're parsing the member functions we might encounter more
24060 classes. We want to handle them right away, but we don't want
24061 them getting mixed up with functions that are currently in the
24062 queue. */
24065 /* Make sure that any template parameters are in scope. */
24068 /* If the body of the function has not yet been parsed, parse it
24069 now. */
24071 {
24072 tree function_scope;
24075 /* The function is no longer pending; we are processing it. */
24080 /* If this is a local class, enter the scope of the containing
24081 function. */
24086 /* Push the body of the function onto the lexer stack. */
24089 /* Let the front end know that we going to be defining this
24090 function. */
24094 /* Don't do access checking if it is a templated function. */
24098 /* #pragma omp declare reduction needs special parsing. */
24100 {
24105 }
24106 else
24107 /* Now, parse the body of the function. */
24114 /* Leave the scope of the containing function. */
24118 }
24120 /* Remove any template parameters from the symbol table. */
24123 /* Restore the queue. */
24126 }
24128 /* If DECL contains any default args, remember it on the unparsed
24129 functions queue. */
24131 static void
24133 {
24134 tree probe;
24137 probe;
24140 {
24144 }
24145 }
24147 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24148 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24149 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24150 from the parameter-type-list. */
24152 static tree
24155 {
24157 tree parsed_arg;
24163 /* Push the saved tokens for the default argument onto the parser's
24164 lexer stack. */
24170 /* Parse the default argument. */
24181 {
24182 /* In a non-template class, check conversions now. In a template,
24183 we'll wait and instantiate these as needed. */
24186 tf_warning_or_error);
24187 else
24189 }
24191 /* If the token stream has not been completely used up, then
24192 there was extra junk after the end of the default
24193 argument. */
24195 {
24198 else
24200 }
24202 /* Revert to the main lexer. */
24206 }
24208 /* FIELD is a non-static data member with an initializer which we saved for
24209 later; parse it now. */
24211 static void
24213 {
24214 tree def;
24221 NULL_TREE);
24227 }
24229 /* FN is a FUNCTION_DECL which may contains a parameter with an
24230 unparsed DEFAULT_ARG. Parse the default args now. This function
24231 assumes that the current scope is the scope in which the default
24232 argument should be processed. */
24234 static void
24236 {
24240 /* While we're parsing the default args, we might (due to the
24241 statement expression extension) encounter more classes. We want
24242 to handle them right away, but we don't want them getting mixed
24243 up with default args that are currently in the queue. */
24246 /* Local variable names (and the `this' keyword) may not appear
24247 in a default argument. */
24258 {
24260 tree parsed_arg;
24262 tree copy;
24269 /* This can happen for a friend declaration for a function
24270 already declared with default arguments. */
24273 parsed_arg
24275 default_arg,
24278 {
24280 }
24284 /* Update any instantiations we've already created. */
24288 }
24292 /* Make sure no default arg is missing. */
24295 /* Restore the state of local_variables_forbidden_p. */
24298 /* Restore the queue. */
24300 }
24302 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24304 sizeof ... ( identifier )
24306 where the 'sizeof' token has already been consumed. */
24308 static tree
24310 {
24311 /* Consume the `...'. */
24318 else
24326 /* The name is not qualified. */
24344 }
24346 /* Parse the operand of `sizeof' (or a similar operator). Returns
24347 either a TYPE or an expression, depending on the form of the
24348 input. The KEYWORD indicates which kind of expression we have
24349 encountered. */
24351 static tree
24353 {
24360 /* If it's a `...', then we are computing the length of a parameter
24361 pack. */
24366 /* Types cannot be defined in a `sizeof' expression. Save away the
24367 old message. */
24369 /* And create the new one. */
24375 /* The restrictions on constant-expressions do not apply inside
24376 sizeof expressions. */
24377 saved_integral_constant_expression_p
24379 saved_non_integral_constant_expression_p
24383 /* Do not actually evaluate the expression. */
24386 /* If it's a `(', then we might be looking at the type-id
24387 construction. */
24389 {
24392 /* We can't be sure yet whether we're looking at a type-id or an
24393 expression. */
24395 /* Note: as a GNU Extension, compound literals are considered
24396 postfix-expressions as they are in C99, so they are valid
24397 arguments to sizeof. See comment in cp_parser_cast_expression
24398 for details. */
24401 else
24402 {
24405 /* Look for the type-id. */
24407 /* Look for the closing `)'. */
24410 }
24412 /* If all went well, then we're done. */
24414 {
24415 cp_decl_specifier_seq decl_specs;
24417 /* Build a trivial decl-specifier-seq. */
24421 /* Call grokdeclarator to figure out what type this is. */
24424 TYPENAME,
24427 }
24428 }
24430 /* If the type-id production did not work out, then we must be
24431 looking at the unary-expression production. */
24435 /* Go back to evaluating expressions. */
24439 /* Free the message we created. */
24441 /* And restore the old one. */
24443 parser->integral_constant_expression_p
24445 parser->non_integral_constant_expression_p
24449 }
24451 /* If the current declaration has no declarator, return true. */
24453 static bool
24455 {
24456 /* If the next token is a `;' or a `,' then there is no
24457 declarator. */
24460 }
24462 /* Update the DECL_SPECS to reflect the storage class indicated by
24463 KEYWORD. */
24465 static void
24470 {
24471 cp_storage_class storage_class;
24474 {
24478 }
24480 {
24483 }
24488 {
24491 }
24494 {
24512 }
24516 /* A storage class specifier cannot be applied alongside a typedef
24517 specifier. If there is a typedef specifier present then set
24518 conflicting_specifiers_p which will trigger an error later
24519 on in grokdeclarator. */
24522 }
24524 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24525 is true, the type is a class or enum definition. */
24527 static void
24529 tree type_spec,
24532 {
24535 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24536 (with, for example, in "typedef int wchar_t;") we remember that
24537 this is what happened. In system headers, we ignore these
24538 declarations so that G++ can work with system headers that are not
24539 C++-safe. */
24541 && !type_definition_p
24551 {
24554 ds_redefined_builtin_type_spec,
24555 token);
24557 {
24561 }
24562 }
24565 else
24566 {
24571 }
24572 }
24574 /* True iff TOKEN is the GNU keyword __thread. */
24576 static bool
24578 {
24581 }
24583 /* Set the location for a declarator specifier and check if it is
24584 duplicated.
24586 DECL_SPECS is the sequence of declarator specifiers onto which to
24587 set the location.
24589 DS is the single declarator specifier to set which location is to
24590 be set onto the existing sequence of declarators.
24592 LOCATION is the location for the declarator specifier to
24593 consider. */
24595 static void
24598 {
24607 {
24611 }
24612 else
24613 {
24615 {
24619 else
24620 {
24623 OPT_Wlong_long,
24625 }
24626 }
24628 {
24633 else
24635 }
24636 else
24637 {
24653 "__complex"
24654 };
24657 }
24658 }
24659 }
24661 /* Return true iff the declarator specifier DS is present in the
24662 sequence of declarator specifiers DECL_SPECS. */
24664 bool
24666 cp_decl_spec ds)
24667 {
24674 }
24676 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24677 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24679 static bool
24681 {
24683 }
24685 /* Issue an error message indicating that TOKEN_DESC was expected.
24686 If KEYWORD is true, it indicated this function is called by
24687 cp_parser_require_keword and the required token can only be
24688 a indicated keyword. */
24690 static void
24692 required_token token_desc,
24694 {
24696 {
24765 }
24767 {
24769 {
24848 }
24849 }
24850 else
24852 }
24856 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24857 issue an error message indicating that TOKEN_DESC was expected.
24859 Returns the token consumed, if the token had the appropriate type.
24860 Otherwise, returns NULL. */
24865 required_token token_desc)
24866 {
24869 else
24870 {
24871 /* Output the MESSAGE -- unless we're parsing tentatively. */
24875 }
24876 }
24878 /* An error message is produced if the next token is not '>'.
24879 All further tokens are skipped until the desired token is
24880 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24882 static void
24884 {
24885 /* Current level of '< ... >'. */
24887 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24890 /* Are we ready, yet? If not, issue error message. */
24894 /* Skip tokens until the desired token is found. */
24896 {
24897 /* Peek at the next token. */
24899 {
24907 /* C++0x views the `>>' operator as two `>' tokens, but
24908 C++98 does not. */
24911 {
24912 /* We've hit a `>>' where the first `>' closes the
24913 template argument list, and the second `>' is
24914 spurious. Just consume the `>>' and stop; we've
24915 already produced at least one error. */
24918 }
24919 /* Fall through for C++0x, so we handle the second `>' in
24920 the `>>'. */
24924 {
24925 /* We've reached the token we want, consume it and stop. */
24928 }
24947 /* The '>' was probably forgotten, don't look further. */
24952 }
24954 /* Consume this token. */
24956 }
24957 }
24959 /* If the next token is the indicated keyword, consume it. Otherwise,
24960 issue an error message indicating that TOKEN_DESC was expected.
24962 Returns the token consumed, if the token had the appropriate type.
24963 Otherwise, returns NULL. */
24968 required_token token_desc)
24969 {
24973 {
24976 }
24979 }
24981 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24982 function-definition. */
24984 static bool
24986 {
24989 /* A ctor-initializer begins with a `:'. */
24991 /* A function-try-block begins with `try'. */
24993 /* A function-transaction-block begins with `__transaction_atomic'
24994 or `__transaction_relaxed'. */
24997 /* The named return value extension begins with `return'. */
24999 }
25001 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25002 definition. */
25004 static bool
25006 {
25013 }
25015 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25016 C++0x) ending a template-argument. */
25018 static bool
25020 {
25028 }
25030 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25031 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25033 static bool
25036 {
25042 /* Check for the sequence `<::' in the original code. It would be lexed as
25043 `[:', where `[' is a digraph, and there is no whitespace before
25044 `:'. */
25046 {
25051 }
25053 }
25055 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25056 or none_type otherwise. */
25058 static enum tag_types
25060 {
25062 {
25072 }
25073 }
25075 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25076 or none_type otherwise or if the token is null. */
25078 static enum tag_types
25080 {
25085 {
25093 }
25094 }
25096 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25098 static void
25100 {
25104 {
25108 type))
25111 }
25112 }
25114 /* Issue an error message if DECL is redeclared with different
25115 access than its original declaration [class.access.spec/3].
25116 This applies to nested classes and nested class templates.
25117 [class.mem/1]. */
25119 static void
25121 {
25130 }
25132 /* Look for the `template' keyword, as a syntactic disambiguator.
25133 Return TRUE iff it is present, in which case it will be
25134 consumed. */
25136 static bool
25138 {
25140 {
25141 /* In C++98 the `template' keyword can only be used within templates;
25142 outside templates the parser can always figure out what is a
25143 template and what is not. In C++11, per the resolution of DR 468,
25144 `template' is allowed in cases where it is not strictly necessary. */
25147 {
25150 "in C++98 %<template%> (as a disambiguator) is only "
25152 /* If this part of the token stream is rescanned, the same
25153 error message would be generated. So, we purge the token
25154 from the stream. */
25157 }
25158 else
25159 {
25160 /* Consume the `template' keyword. */
25163 }
25164 }
25166 }
25168 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25169 set PARSER->SCOPE, and perform other related actions. */
25171 static void
25173 {
25179 /* Get the stored value. */
25181 /* Perform any access checks that were deferred. */
25184 {
25189 }
25190 /* Set the scope from the stored value. */
25194 }
25196 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25197 encounter the end of a block before what we were looking for. */
25199 static bool
25203 {
25205 {
25208 /* Abort a parenthesized expression if we encounter a semicolon. */
25212 /* If we've reached the end of the file, stop. */
25218 /* We've hit the end of an enclosing block, so there's been some
25219 kind of syntax error. */
25222 /* Consume the token. */
25224 /* See if it starts a new group. */
25226 {
25228 /* In theory this should probably check end == '}', but
25229 cp_parser_save_member_function_body needs it to exit
25230 after either '}' or ')' when called with ')'. */
25233 }
25235 {
25239 }
25244 }
25245 }
25247 /* Like above, for caching a default argument or NSDMI. Both of these are
25248 terminated by a non-nested comma, but it can be unclear whether or not a
25249 comma is nested in a template argument list unless we do more parsing.
25250 In order to handle this ambiguity, when we encounter a ',' after a '<'
25251 we try to parse what follows as a parameter-declaration-list (in the
25252 case of a default argument) or a member-declarator (in the case of an
25253 NSDMI). If that succeeds, then we stop caching. */
25255 static tree
25257 {
25262 tree default_argument;
25264 /* Add tokens until we have processed the entire default
25265 argument. We add the range [first_token, token). */
25268 {
25269 /* For list-initialization, this is straightforward. */
25272 }
25274 {
25277 /* Peek at the next token. */
25279 /* What we do depends on what token we have. */
25281 {
25282 /* In valid code, a default argument must be
25283 immediately followed by a `,' `)', or `...'. */
25286 {
25287 /* If we've seen a '<', we might be in a
25288 template-argument-list. Until Core issue 325 is
25289 resolved, we don't know how this situation ought
25290 to be handled, so try to DTRT. We check whether
25291 what comes after the comma is a valid parameter
25292 declaration list. If it is, then the comma ends
25293 the default argument; otherwise the default
25294 argument continues. */
25297 /* Set ITALP so cp_parser_parameter_declaration_list
25298 doesn't decide to commit to this parse. */
25306 {
25313 }
25314 else
25315 {
25319 }
25326 }
25329 /* If we run into a non-nested `;', `}', or `]',
25330 then the code is invalid -- but the default
25331 argument is certainly over. */
25336 /* Handle correctly int n = sizeof ... ( p ); */
25339 /* Update DEPTH, if necessary. */
25354 /* This might be the comparison operator, or it might
25355 start a template argument list. */
25362 /* Fall through for C++0x, which treats the `>>'
25363 operator like two `>' tokens in certain
25364 cases. */
25368 {
25369 /* This might be an operator, or it might close a
25370 template argument list. But if a previous '<'
25371 started a template argument list, this will have
25372 closed it, so we can't be in one anymore. */
25376 }
25379 /* If we run out of tokens, issue an error message. */
25388 /* In these cases, we should look for template-ids.
25389 For example, if the default argument is
25390 `X<int, double>()', we need to do name lookup to
25391 figure out whether or not `X' is a template; if
25392 so, the `,' does not end the default argument.
25394 That is not yet done. */
25399 }
25401 /* If we've reached the end, stop. */
25405 /* Add the token to the token block. */
25407 }
25409 /* Create a DEFAULT_ARG to represent the unparsed default
25410 argument. */
25417 }
25419 /* Begin parsing tentatively. We always save tokens while parsing
25420 tentatively so that if the tentative parsing fails we can restore the
25421 tokens. */
25423 static void
25425 {
25426 /* Enter a new parsing context. */
25428 /* Begin saving tokens. */
25430 /* In order to avoid repetitive access control error messages,
25431 access checks are queued up until we are no longer parsing
25432 tentatively. */
25434 }
25436 /* Commit to the currently active tentative parse. */
25438 static void
25440 {
25444 /* Mark all of the levels as committed. */
25447 {
25454 }
25455 }
25457 /* Commit to the topmost currently active tentative parse.
25459 Note that this function shouldn't be called when there are
25460 irreversible side-effects while in a tentative state. For
25461 example, we shouldn't create a permanent entry in the symbol
25462 table, or issue an error message that might not apply if the
25463 tentative parse is aborted. */
25465 static void
25467 {
25472 {
25480 }
25481 }
25483 /* Abort the currently active tentative parse. All consumed tokens
25484 will be rolled back, and no diagnostics will be issued. */
25486 static void
25488 {
25492 /* Now, pretend that we want to see if the construct was
25493 successfully parsed. */
25495 }
25497 /* Stop parsing tentatively. If a parse error has occurred, restore the
25498 token stream. Otherwise, commit to the tokens we have consumed.
25499 Returns true if no error occurred; false otherwise. */
25501 static bool
25503 {
25507 /* Remember whether or not an error occurred, since we are about to
25508 destroy that information. */
25510 /* Remove the topmost context from the stack. */
25513 /* If no parse errors occurred, commit to the tentative parse. */
25515 {
25516 /* Commit to the tokens read tentatively, unless that was
25517 already done. */
25522 }
25523 /* Otherwise, if errors occurred, roll back our state so that things
25524 are just as they were before we began the tentative parse. */
25525 else
25526 {
25529 }
25530 /* Add the context to the front of the free list. */
25535 }
25537 /* Returns true if we are parsing tentatively and are not committed to
25538 this tentative parse. */
25540 static bool
25542 {
25545 }
25547 /* Returns nonzero iff an error has occurred during the most recent
25548 tentative parse. */
25550 static bool
25552 {
25555 }
25557 /* Returns nonzero if GNU extensions are allowed. */
25559 static bool
25561 {
25563 }
25564 \f
25565 /* Objective-C++ Productions */
25568 /* Parse an Objective-C expression, which feeds into a primary-expression
25569 above.
25571 objc-expression:
25572 objc-message-expression
25573 objc-string-literal
25574 objc-encode-expression
25575 objc-protocol-expression
25576 objc-selector-expression
25578 Returns a tree representation of the expression. */
25580 static tree
25582 {
25583 /* Try to figure out what kind of declaration is present. */
25587 {
25597 {
25609 }
25615 }
25618 }
25620 /* Parse an Objective-C message expression.
25622 objc-message-expression:
25623 [ objc-message-receiver objc-message-args ]
25625 Returns a representation of an Objective-C message. */
25627 static tree
25629 {
25638 }
25640 /* Parse an objc-message-receiver.
25642 objc-message-receiver:
25643 expression
25644 simple-type-specifier
25646 Returns a representation of the type or expression. */
25648 static tree
25650 {
25651 tree rcv;
25653 /* An Objective-C message receiver may be either (1) a type
25654 or (2) an expression. */
25663 CP_PARSER_FLAGS_NONE);
25666 }
25668 /* Parse the arguments and selectors comprising an Objective-C message.
25670 objc-message-args:
25671 objc-selector
25672 objc-selector-args
25673 objc-selector-args , objc-comma-args
25675 objc-selector-args:
25676 objc-selector [opt] : assignment-expression
25677 objc-selector-args objc-selector [opt] : assignment-expression
25679 objc-comma-args:
25680 assignment-expression
25681 objc-comma-args , assignment-expression
25683 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25684 selector arguments and TREE_VALUE containing a list of comma
25685 arguments. */
25687 static tree
25689 {
25695 {
25701 /* Detect if we have a unary selector. */
25710 sel_args
25715 }
25717 /* Handle non-selector arguments, if any. */
25719 {
25720 tree arg;
25725 addl_args
25730 }
25733 {
25736 }
25739 }
25741 /* Parse an Objective-C encode expression.
25743 objc-encode-expression:
25744 @encode objc-typename
25746 Returns an encoded representation of the type argument. */
25748 static tree
25750 {
25751 tree type;
25761 {
25765 }
25767 /* This happens if we find @encode(T) (where T is a template
25768 typename or something dependent on a template typename) when
25769 parsing a template. In that case, we can't compile it
25770 immediately, but we rather create an AT_ENCODE_EXPR which will
25771 need to be instantiated when the template is used.
25772 */
25774 {
25778 }
25781 }
25783 /* Parse an Objective-C @defs expression. */
25785 static tree
25787 {
25788 tree name;
25796 }
25798 /* Parse an Objective-C protocol expression.
25800 objc-protocol-expression:
25801 @protocol ( identifier )
25803 Returns a representation of the protocol expression. */
25805 static tree
25807 {
25808 tree proto;
25816 }
25818 /* Parse an Objective-C selector expression.
25820 objc-selector-expression:
25821 @selector ( objc-method-signature )
25823 objc-method-signature:
25824 objc-selector
25825 objc-selector-seq
25827 objc-selector-seq:
25828 objc-selector :
25829 objc-selector-seq objc-selector :
25831 Returns a representation of the method selector. */
25833 static tree
25835 {
25847 {
25856 {
25857 /* Detect if we have a unary selector. */
25859 {
25862 }
25863 else
25864 {
25866 }
25867 }
25872 {
25873 sel_seq
25876 sel_seq
25879 }
25880 else
25881 sel_seq
25886 }
25888 finish_selector:
25892 }
25894 /* Parse a list of identifiers.
25896 objc-identifier-list:
25897 identifier
25898 objc-identifier-list , identifier
25900 Returns a TREE_LIST of identifier nodes. */
25902 static tree
25904 {
25905 tree identifier;
25906 tree list;
25917 {
25924 identifier));
25926 }
25929 }
25931 /* Parse an Objective-C alias declaration.
25933 objc-alias-declaration:
25934 @compatibility_alias identifier identifier ;
25936 This function registers the alias mapping with the Objective-C front end.
25937 It returns nothing. */
25939 static void
25941 {
25949 }
25951 /* Parse an Objective-C class forward-declaration.
25953 objc-class-declaration:
25954 @class objc-identifier-list ;
25956 The function registers the forward declarations with the Objective-C
25957 front end. It returns nothing. */
25959 static void
25961 {
25964 {
25965 tree id;
25975 else
25977 }
25979 }
25981 /* Parse a list of Objective-C protocol references.
25983 objc-protocol-refs-opt:
25984 objc-protocol-refs [opt]
25986 objc-protocol-refs:
25987 < objc-identifier-list >
25989 Returns a TREE_LIST of identifiers, if any. */
25991 static tree
25993 {
25997 {
26001 }
26004 }
26006 /* Parse a Objective-C visibility specification. */
26008 static void
26010 {
26014 {
26029 }
26031 /* Eat '@private'/'@protected'/'@public'. */
26033 }
26035 /* Parse an Objective-C method type. Return 'true' if it is a class
26036 (+) method, and 'false' if it is an instance (-) method. */
26040 {
26043 else
26045 }
26047 /* Parse an Objective-C protocol qualifier. */
26049 static tree
26051 {
26064 {
26069 }
26072 }
26074 /* Parse an Objective-C typename. */
26076 static tree
26078 {
26082 {
26088 /* An ObjC type name may consist of just protocol qualifiers, in which
26089 case the type shall default to 'id'. */
26091 {
26094 /* If the type could not be parsed, an error has already
26095 been produced. For error recovery, behave as if it had
26096 not been specified, which will use the default type
26097 'id'. */
26099 {
26101 /* We need to skip to the closing parenthesis as
26102 cp_parser_type_id() does not seem to do it for
26103 us. */
26108 }
26109 }
26113 }
26116 }
26118 /* Check to see if TYPE refers to an Objective-C selector name. */
26120 static bool
26122 {
26128 }
26130 /* Parse an Objective-C selector. */
26132 static tree
26134 {
26138 {
26141 }
26143 /* C++ operator names are allowed to appear in ObjC selectors. */
26145 {
26158 }
26159 }
26161 /* Parse an Objective-C params list. */
26163 static tree
26165 {
26171 {
26181 /* Detect if we have a unary selector. */
26184 {
26187 }
26191 {
26192 /* Something went quite wrong. There should be a colon
26193 here, but there is not. Stop parsing parameters. */
26195 }
26197 /* New ObjC allows attributes on parameters too. */
26202 params
26205 type_name,
26206 identifier,
26207 parm_attr));
26210 }
26213 {
26216 }
26218 /* We allow tail attributes for the method. */
26220 {
26228 }
26231 {
26234 }
26236 }
26238 /* Parse the non-keyword Objective-C params. */
26240 static tree
26243 {
26249 {
26251 tree parm;
26257 {
26262 }
26264 /* TODO: parse attributes for tail parameters. */
26273 }
26275 /* We allow tail attributes for the method. */
26277 {
26279 {
26284 }
26285 else
26286 /* We have an error, but parse the attributes, so that we can
26287 carry on. */
26293 }
26296 }
26298 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26300 static void
26302 {
26305 /* If the next token is `extern' and the following token is a string
26306 literal, then we have a linkage specification. */
26308 && cp_parser_is_pure_string_literal
26311 /* Handle #pragma, if any. */
26314 /* Allow stray semicolons. */
26317 /* Mark methods as optional or required, when building protocols. */
26319 {
26322 }
26324 {
26327 }
26330 /* Other stray characters must generate errors. */
26332 {
26336 }
26337 /* Finally, try to parse a block-declaration, or a function-definition. */
26338 else
26340 }
26342 /* Parse a method signature. */
26344 static tree
26346 {
26362 }
26364 static bool
26366 {
26367 tree tattr;
26372 /* If the attributes are followed by a method introducer, this is not allowed.
26373 Dump the attributes and flag the situation. */
26378 /* Otherwise, the attributes introduce some interstitial code, possibly so
26379 rewind to allow that check. */
26382 }
26384 /* Parse an Objective-C method prototype list. */
26386 static void
26388 {
26392 {
26394 {
26399 else
26403 {
26407 }
26410 }
26416 OPT_Wattributes,
26418 else
26419 /* Allow for interspersed non-ObjC++ code. */
26423 }
26427 else
26431 }
26433 /* Parse an Objective-C method definition list. */
26435 static void
26437 {
26441 {
26442 tree meth;
26445 {
26451 else
26456 {
26460 }
26462 NULL_TREE);
26464 /* For historical reasons, we accept an optional semicolon. */
26471 {
26478 }
26479 }
26480 /* The following case will be removed once @synthesize is
26481 completely implemented. */
26492 else
26493 /* Allow for interspersed non-ObjC++ code. */
26497 }
26501 else
26505 }
26507 /* Parse Objective-C ivars. */
26509 static void
26511 {
26522 {
26523 cp_decl_specifier_seq declspecs;
26525 tree prefix_attributes;
26533 CP_PARSER_FLAGS_OPTIONAL,
26537 /* auto, register, static, extern, mutable. */
26539 {
26542 }
26544 /* thread_local. */
26546 {
26549 }
26551 /* typedef. */
26553 {
26556 }
26561 /* Keep going until we hit the `;' at the end of the
26562 declaration. */
26564 {
26569 /* Check for a (possibly unnamed) bitfield declaration. */
26577 {
26578 /* Get the name of the bitfield. */
26581 sfk_none);
26583 eat_colon:
26585 /* Get the width of the bitfield. */
26586 width
26588 }
26589 else
26590 {
26591 /* Parse the declarator. */
26592 declarator
26598 }
26600 /* Look for attributes that apply to the ivar. */
26602 /* Remember which attributes are prefix attributes and
26603 which are not. */
26605 /* Combine the attributes. */
26609 /* Create the bitfield declaration. */
26611 width,
26612 attributes);
26613 else
26618 /* Add the instance variable. */
26622 /* Reset PREFIX_ATTRIBUTES. */
26631 {
26634 }
26636 }
26640 }
26645 /* Do not consume the RID_AT_END, so it will be read again as terminating
26646 the @interface of @implementation. */
26650 /* For historical reasons, we accept an optional semicolon. */
26653 }
26655 /* Parse an Objective-C protocol declaration. */
26657 static void
26659 {
26665 {
26670 }
26672 /* See if we have a forward declaration or a definition. */
26675 /* Try a forward declaration first. */
26677 {
26679 {
26680 tree id;
26690 else
26692 }
26694 }
26696 /* Ok, we got a full-fledged definition (or at least should). */
26697 else
26698 {
26703 }
26704 }
26706 /* Parse an Objective-C superclass or category. */
26708 static void
26713 {
26719 {
26722 }
26724 {
26727 /* If there is no category name, and this is an @interface, we
26728 have a class extension. */
26730 {
26733 }
26734 else
26738 }
26739 }
26741 /* Parse an Objective-C class interface. */
26743 static void
26745 {
26752 {
26753 /* It's hard to recover because even if valid @interface stuff
26754 is to follow, we can't compile it (or validate it) if we
26755 don't even know which class it refers to. Let's assume this
26756 was a stray '@interface' token in the stream and skip it.
26757 */
26759 }
26764 /* We have either a class or a category on our hands. */
26767 else
26768 {
26770 /* Handle instance variable declarations, if any. */
26773 }
26776 }
26778 /* Parse an Objective-C class implementation. */
26780 static void
26782 {
26789 {
26790 /* It's hard to recover because even if valid @implementation
26791 stuff is to follow, we can't compile it (or validate it) if
26792 we don't even know which class it refers to. Let's assume
26793 this was a stray '@implementation' token in the stream and
26794 skip it.
26795 */
26797 }
26801 /* We have either a class or a category on our hands. */
26804 else
26805 {
26807 /* Handle instance variable declarations, if any. */
26810 }
26813 }
26815 /* Consume the @end token and finish off the implementation. */
26817 static void
26819 {
26822 }
26824 /* Parse an Objective-C declaration. */
26826 static void
26828 {
26829 /* Try to figure out what kind of declaration is present. */
26834 {
26850 }
26853 {
26876 }
26877 }
26879 /* Parse an Objective-C try-catch-finally statement.
26881 objc-try-catch-finally-stmt:
26882 @try compound-statement objc-catch-clause-seq [opt]
26883 objc-finally-clause [opt]
26885 objc-catch-clause-seq:
26886 objc-catch-clause objc-catch-clause-seq [opt]
26888 objc-catch-clause:
26889 @catch ( objc-exception-declaration ) compound-statement
26891 objc-finally-clause:
26892 @finally compound-statement
26894 objc-exception-declaration:
26895 parameter-declaration
26896 '...'
26898 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26900 Returns NULL_TREE.
26902 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26903 for C. Keep them in sync. */
26905 static tree
26907 {
26908 location_t location;
26909 tree stmt;
26914 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26915 node, lest it get absorbed into the surrounding block. */
26921 {
26930 {
26931 /* We have "@catch (...)" (where the '...' are literally
26932 what is in the code). Skip the '...'.
26933 parameter_declaration is set to NULL_TREE, and
26934 objc_being_catch_clauses() knows that that means
26935 '...'. */
26938 }
26939 else
26940 {
26941 /* We have "@catch (NSException *exception)" or something
26942 like that. Parse the parameter declaration. */
26946 else
26951 }
26954 else
26955 {
26956 /* If there was no open parenthesis, we are recovering from
26957 an error, and we are trying to figure out what mistake
26958 the user has made. */
26960 /* If there is an immediate closing parenthesis, the user
26961 probably forgot the opening one (ie, they typed "@catch
26962 NSException *e)". Parse the closing parenthesis and keep
26963 going. */
26967 /* If these is no immediate closing parenthesis, the user
26968 probably doesn't know that parenthesis are required at
26969 all (ie, they typed "@catch NSException *e"). So, just
26970 forget about the closing parenthesis and keep going. */
26971 }
26975 }
26977 {
26980 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26981 node, lest it get absorbed into the surrounding block. */
26985 }
26988 }
26990 /* Parse an Objective-C synchronized statement.
26992 objc-synchronized-stmt:
26993 @synchronized ( expression ) compound-statement
26995 Returns NULL_TREE. */
26997 static tree
26999 {
27000 location_t location;
27011 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27012 node, lest it get absorbed into the surrounding block. */
27017 }
27019 /* Parse an Objective-C throw statement.
27021 objc-throw-stmt:
27022 @throw assignment-expression [opt] ;
27024 Returns a constructed '@throw' statement. */
27026 static tree
27028 {
27040 }
27042 /* Parse an Objective-C statement. */
27044 static tree
27046 {
27047 /* Try to figure out what kind of declaration is present. */
27051 {
27062 }
27065 }
27067 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27068 look ahead to see if an objc keyword follows the attributes. This
27069 is to detect the use of prefix attributes on ObjC @interface and
27070 @protocol. */
27072 static bool
27074 {
27079 {
27082 }
27085 }
27087 /* This routine is a minimal replacement for
27088 c_parser_struct_declaration () used when parsing the list of
27089 types/names or ObjC++ properties. For example, when parsing the
27090 code
27092 @property (readonly) int a, b, c;
27094 this function is responsible for parsing "int a, int b, int c" and
27095 returning the declarations as CHAIN of DECLs.
27097 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27098 similar parsing. */
27099 static tree
27101 {
27103 cp_decl_specifier_seq declspecs;
27105 tree prefix_attributes;
27108 CP_PARSER_FLAGS_NONE,
27115 /* auto, register, static, extern, mutable. */
27117 {
27120 }
27122 /* thread_local. */
27124 {
27127 }
27129 /* typedef. */
27131 {
27134 }
27139 /* Keep going until we hit the `;' at the end of the declaration. */
27141 {
27146 /* Parse the declarator. */
27150 /* Look for attributes that apply to the ivar. */
27152 /* Remember which attributes are prefix attributes and
27153 which are not. */
27155 /* Combine the attributes. */
27165 /* Reset PREFIX_ATTRIBUTES. */
27176 {
27179 }
27180 else
27182 }
27184 }
27186 /* Parse an Objective-C @property declaration. The syntax is:
27188 objc-property-declaration:
27189 '@property' objc-property-attributes[opt] struct-declaration ;
27191 objc-property-attributes:
27192 '(' objc-property-attribute-list ')'
27194 objc-property-attribute-list:
27195 objc-property-attribute
27196 objc-property-attribute-list, objc-property-attribute
27198 objc-property-attribute
27199 'getter' = identifier
27200 'setter' = identifier
27201 'readonly'
27202 'readwrite'
27203 'assign'
27204 'retain'
27205 'copy'
27206 'nonatomic'
27208 For example:
27209 @property NSString *name;
27210 @property (readonly) id object;
27211 @property (retain, nonatomic, getter=getTheName) id name;
27212 @property int a, b, c;
27214 PS: This function is identical to
27215 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27216 static void
27218 {
27219 /* The following variables hold the attributes of the properties as
27220 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27221 seen. When we see an attribute, we set them to 'true' (if they
27222 are boolean properties) or to the identifier (if they have an
27223 argument, ie, for getter and setter). Note that here we only
27224 parse the list of attributes, check the syntax and accumulate the
27225 attributes that we find. objc_add_property_declaration() will
27226 then process the information. */
27236 /* 'properties' is the list of properties that we read. Usually a
27237 single one, but maybe more (eg, in "@property int a, b, c;" there
27238 are three). */
27239 tree properties;
27240 location_t loc;
27246 /* Parse the optional attribute list... */
27248 {
27249 /* Eat the '('. */
27253 {
27259 {
27262 }
27266 {
27277 {
27281 else
27286 }
27289 {
27293 }
27295 {
27297 {
27300 }
27301 else
27305 else
27307 }
27308 else
27309 {
27311 {
27314 }
27315 else
27317 }
27323 }
27330 else
27332 }
27334 /* FIXME: "@property (setter, assign);" will generate a spurious
27335 "error: expected ‘)’ before ‘,’ token". This is because
27336 cp_parser_require, unlike the C counterpart, will produce an
27337 error even if we are in error recovery. */
27339 {
27344 }
27345 }
27347 /* ... and the property declaration(s). */
27351 {
27353 /* If the next token is now a `;', consume it. */
27357 }
27361 else
27362 {
27363 /* Comma-separated properties are chained together in
27364 reverse order; add them one by one. */
27373 }
27376 }
27378 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27380 objc-synthesize-declaration:
27381 @synthesize objc-synthesize-identifier-list ;
27383 objc-synthesize-identifier-list:
27384 objc-synthesize-identifier
27385 objc-synthesize-identifier-list, objc-synthesize-identifier
27387 objc-synthesize-identifier
27388 identifier
27389 identifier = identifier
27391 For example:
27392 @synthesize MyProperty;
27393 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27395 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27396 for C. Keep them in sync.
27397 */
27398 static void
27400 {
27402 location_t loc;
27407 {
27411 {
27414 }
27416 {
27420 {
27423 }
27424 }
27425 else
27430 else
27432 }
27435 }
27437 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27439 objc-dynamic-declaration:
27440 @dynamic identifier-list ;
27442 For example:
27443 @dynamic MyProperty;
27444 @dynamic MyProperty, AnotherProperty;
27446 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27447 for C. Keep them in sync.
27448 */
27449 static void
27451 {
27453 location_t loc;
27458 {
27459 tree property;
27462 {
27465 }
27469 else
27471 }
27474 }
27476 \f
27477 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27479 /* Returns name of the next clause.
27480 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27481 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27482 returned and the token is consumed. */
27484 static pragma_omp_clause
27486 {
27498 {
27503 {
27606 }
27607 }
27613 }
27615 /* Validate that a clause of the given type does not already exist. */
27617 static void
27620 {
27621 tree c;
27625 {
27628 }
27629 }
27631 /* OpenMP 2.5:
27632 variable-list:
27633 identifier
27634 variable-list , identifier
27636 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27637 colon). An opening parenthesis will have been consumed by the caller.
27639 If KIND is nonzero, create the appropriate node and install the decl
27640 in OMP_CLAUSE_DECL and add the node to the head of the list.
27642 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27643 return the list created.
27645 COLON can be NULL if only closing parenthesis should end the list,
27646 or pointer to bool which will receive false if the list is terminated
27647 by closing parenthesis or true if the list is terminated by colon. */
27649 static tree
27652 {
27656 {
27659 }
27661 {
27678 {
27680 {
27686 {
27694 parser->colon_corrects_to_scope_p
27698 else
27699 {
27700 /* Look for `:'. */
27704 CPP_CLOSE_SQUARE))
27706 }
27707 /* Look for the closing `]'. */
27709 RT_CLOSE_SQUARE))
27712 }
27716 }
27722 }
27723 else
27726 get_comma:
27730 }
27736 {
27740 }
27743 {
27746 /* Try to resync to an unnested comma. Copied from
27747 cp_parser_parenthesized_expression_list. */
27748 skip_comma:
27757 }
27760 }
27762 /* Similarly, but expect leading and trailing parenthesis. This is a very
27763 common case for omp clauses. */
27765 static tree
27767 {
27771 }
27773 /* OpenMP 3.0:
27774 collapse ( constant-expression ) */
27776 static tree
27778 {
27780 location_t loc;
27781 HOST_WIDE_INT n;
27801 {
27804 }
27812 }
27814 /* OpenMP 2.5:
27815 default ( shared | none ) */
27817 static tree
27819 {
27821 tree c;
27826 {
27831 {
27846 }
27849 }
27850 else
27851 {
27852 invalid_kind:
27854 }
27870 }
27872 /* OpenMP 3.1:
27873 final ( expression ) */
27875 static tree
27877 {
27898 }
27900 /* OpenMP 2.5:
27901 if ( expression ) */
27903 static tree
27905 {
27926 }
27928 /* OpenMP 3.1:
27929 mergeable */
27931 static tree
27934 {
27935 tree c;
27938 location);
27943 }
27945 /* OpenMP 2.5:
27946 nowait */
27948 static tree
27951 {
27952 tree c;
27959 }
27961 /* OpenMP 2.5:
27962 num_threads ( expression ) */
27964 static tree
27966 location_t location)
27967 {
27989 }
27991 /* OpenMP 2.5:
27992 ordered */
27994 static tree
27997 {
27998 tree c;
28006 }
28008 /* OpenMP 2.5:
28009 reduction ( reduction-operator : variable-list )
28011 reduction-operator:
28012 One of: + * - & ^ | && ||
28014 OpenMP 3.1:
28016 reduction-operator:
28017 One of: + * - & ^ | && || min max
28019 OpenMP 4.0:
28021 reduction-operator:
28022 One of: + * - & ^ | && ||
28023 id-expression */
28025 static tree
28027 {
28035 {
28045 }
28049 else
28050 {
28061 {
28091 }
28092 else
28093 {
28095 resync_fail:
28100 }
28101 }
28107 NULL);
28109 {
28112 }
28115 }
28117 /* OpenMP 2.5:
28118 schedule ( schedule-kind )
28119 schedule ( schedule-kind , expression )
28121 schedule-kind:
28122 static | dynamic | guided | runtime | auto */
28124 static tree
28126 {
28135 {
28140 {
28161 }
28162 }
28167 else
28172 {
28187 else
28192 }
28200 invalid_kind:
28202 resync_fail:
28207 }
28209 /* OpenMP 3.0:
28210 untied */
28212 static tree
28215 {
28216 tree c;
28223 }
28225 /* OpenMP 4.0:
28226 inbranch
28227 notinbranch */
28229 static tree
28232 {
28237 }
28239 /* OpenMP 4.0:
28240 parallel
28241 for
28242 sections
28243 taskgroup */
28245 static tree
28249 {
28253 }
28255 /* OpenMP 4.0:
28256 num_teams ( expression ) */
28258 static tree
28260 location_t location)
28261 {
28283 }
28285 /* OpenMP 4.0:
28286 thread_limit ( expression ) */
28288 static tree
28290 location_t location)
28291 {
28313 }
28315 /* OpenMP 4.0:
28316 aligned ( variable-list )
28317 aligned ( variable-list : constant-expression ) */
28319 static tree
28321 {
28332 {
28342 }
28348 }
28350 /* OpenMP 4.0:
28351 linear ( variable-list )
28352 linear ( variable-list : expression ) */
28354 static tree
28357 {
28368 {
28372 {
28375 }
28383 }
28389 }
28391 /* OpenMP 4.0:
28392 safelen ( constant-expression ) */
28394 static tree
28396 location_t location)
28397 {
28418 }
28420 /* OpenMP 4.0:
28421 simdlen ( constant-expression ) */
28423 static tree
28425 location_t location)
28426 {
28447 }
28449 /* OpenMP 4.0:
28450 depend ( depend-kind : variable-list )
28452 depend-kind:
28453 in | out | inout */
28455 static tree
28457 {
28465 {
28475 else
28477 }
28478 else
28486 NULL);
28493 invalid_kind:
28495 resync_fail:
28500 }
28502 /* OpenMP 4.0:
28503 map ( map-kind : variable-list )
28504 map ( variable-list )
28506 map-kind:
28507 alloc | to | from | tofrom */
28509 static tree
28511 {
28520 {
28532 else
28533 {
28539 }
28542 }
28545 NULL);
28551 }
28553 /* OpenMP 4.0:
28554 device ( expression ) */
28556 static tree
28558 location_t location)
28559 {
28581 }
28583 /* OpenMP 4.0:
28584 dist_schedule ( static )
28585 dist_schedule ( static , expression ) */
28587 static tree
28589 location_t location)
28590 {
28603 {
28614 }
28619 location);
28623 invalid_kind:
28625 resync_fail:
28630 }
28632 /* OpenMP 4.0:
28633 proc_bind ( proc-bind-kind )
28635 proc-bind-kind:
28636 master | close | spread */
28638 static tree
28640 location_t location)
28641 {
28642 tree c;
28649 {
28659 else
28661 }
28662 else
28671 location);
28676 invalid_kind:
28678 resync_fail:
28683 }
28685 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28686 is a bitmask in MASK. Return the list of clauses found; the result
28687 of clause default goes in *pdefault. */
28689 static tree
28693 {
28700 {
28701 pragma_omp_clause c_kind;
28712 {
28724 clauses);
28738 clauses);
28747 clauses);
28771 clauses);
28785 clauses);
28802 OMP_CLAUSE_NOTINBRANCH,
28811 {
28812 clause_not_first:
28816 }
28841 clauses);
28846 clauses);
28851 clauses);
28914 }
28919 {
28920 /* Remove the invalid clause(s) from the list to avoid
28921 confusing the rest of the compiler. */
28924 }
28925 }
28926 saw_error:
28927 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28928 no reason to skip to the end. */
28934 }
28936 /* OpenMP 2.5:
28937 structured-block:
28938 statement
28940 In practice, we're also interested in adding the statement to an
28941 outer node. So it is convenient if we work around the fact that
28942 cp_parser_statement calls add_stmt. */
28944 static unsigned
28946 {
28949 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28950 This preserves the "not within loop or switch" style error messages
28951 for nonsense cases like
28952 void foo() {
28953 #pragma omp single
28954 break;
28955 }
28956 */
28961 }
28963 static void
28965 {
28967 }
28969 static tree
28971 {
28979 }
28981 /* OpenMP 2.5:
28982 # pragma omp atomic new-line
28983 expression-stmt
28985 expression-stmt:
28986 x binop= expr | x++ | ++x | x-- | --x
28987 binop:
28988 +, *, -, /, &, ^, |, <<, >>
28990 where x is an lvalue expression with scalar type.
28992 OpenMP 3.1:
28993 # pragma omp atomic new-line
28994 update-stmt
28996 # pragma omp atomic read new-line
28997 read-stmt
28999 # pragma omp atomic write new-line
29000 write-stmt
29002 # pragma omp atomic update new-line
29003 update-stmt
29005 # pragma omp atomic capture new-line
29006 capture-stmt
29008 # pragma omp atomic capture new-line
29009 capture-block
29011 read-stmt:
29012 v = x
29013 write-stmt:
29014 x = expr
29015 update-stmt:
29016 expression-stmt | x = x binop expr
29017 capture-stmt:
29018 v = expression-stmt
29019 capture-block:
29020 { v = x; update-stmt; } | { update-stmt; v = x; }
29022 OpenMP 4.0:
29023 update-stmt:
29024 expression-stmt | x = x binop expr | x = expr binop x
29025 capture-stmt:
29026 v = update-stmt
29027 capture-block:
29028 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29030 where x and v are lvalue expressions with scalar type. */
29032 static void
29034 {
29042 {
29047 {
29053 }
29054 }
29056 {
29068 else
29072 }
29074 {
29080 {
29085 {
29088 }
29089 }
29090 }
29094 {
29104 else
29109 {
29110 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29111 opcode. */
29116 }
29120 {
29123 }
29124 else
29125 {
29131 }
29134 }
29136 restart:
29140 {
29147 /* FALLTHROUGH */
29157 /* FALLTHROUGH */
29172 /* Undo effects of boolean_increment for post {in,de}crement. */
29174 /* FALLTHRU */
29178 {
29179 /* Undo effects of boolean_increment. */
29181 {
29182 /* This is pre or post increment. */
29187 && !structured_block
29191 }
29192 }
29193 /* FALLTHRU */
29196 {
29231 {
29235 }
29238 {
29244 {
29249 }
29251 {
29262 {
29264 {
29269 }
29270 else
29272 }
29276 }
29279 {
29286 }
29290 }
29294 {
29297 {
29305 }
29307 {
29312 }
29347 }
29358 /* FALLTHROUGH */
29363 }
29370 }
29371 stmt_done:
29373 {
29384 }
29386 {
29389 }
29390 done:
29396 saw_error:
29399 {
29403 {
29407 }
29408 }
29409 }
29412 /* OpenMP 2.5:
29413 # pragma omp barrier new-line */
29415 static void
29417 {
29420 }
29422 /* OpenMP 2.5:
29423 # pragma omp critical [(name)] new-line
29424 structured-block */
29426 static tree
29428 {
29432 {
29444 }
29449 }
29451 /* OpenMP 2.5:
29452 # pragma omp flush flush-vars[opt] new-line
29454 flush-vars:
29455 ( variable-list ) */
29457 static void
29459 {
29465 }
29467 /* Helper function, to parse omp for increment expression. */
29469 static tree
29471 {
29476 {
29479 }
29482 {
29491 /* Fall through: OpenMP disallows NE_EXPR. */
29494 }
29496 /* If decl is an iterator, preserve LHS and RHS of the relational
29497 expr until finish_omp_for. */
29507 }
29509 /* Helper function, to parse omp for increment expression. */
29511 static tree
29513 {
29517 cp_id_kind idk;
29521 {
29529 }
29537 {
29542 }
29549 {
29553 }
29565 do
29566 {
29573 {
29575 {
29578 else
29580 tf_warning_or_error);
29581 }
29582 else
29585 }
29586 }
29590 {
29594 }
29595 else
29599 }
29601 /* Parse the initialization statement of either an OpenMP for loop or
29602 a Cilk Plus for loop.
29604 Return true if the resulting construct should have an
29605 OMP_CLAUSE_PRIVATE added to it. */
29607 static bool
29615 {
29621 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29623 init-expr:
29624 var = lb
29625 integer-type var = lb
29626 random-access-iterator-type var = lb
29627 pointer-type var = lb
29628 */
29629 cp_decl_specifier_seq type_specifiers;
29631 /* First, try to parse as an initialized declaration. See
29632 cp_parser_condition, from whence the bulk of this is copied. */
29639 {
29640 /* If parsing a type specifier seq succeeded, then this
29641 MUST be a initialized declaration. */
29646 CP_PARSER_DECLARATOR_NAMED,
29657 else
29658 {
29668 {
29670 CPP_OPEN_PAREN))
29671 {
29675 else
29678 }
29679 else
29680 /* Trigger an error. */
29685 }
29689 {
29697 {
29700 auto_node);
29705 }
29708 asm_specification,
29709 LOOKUP_ONLYCONVERTING);
29711 {
29714 }
29715 else
29718 }
29719 else
29720 {
29721 /* Consume '='. */
29725 non_class:
29728 else
29731 asm_specification,
29732 LOOKUP_ONLYCONVERTING);
29733 }
29737 }
29738 }
29739 else
29740 {
29741 cp_id_kind idk;
29742 /* If parsing a type specifier sequence failed, then
29743 this MUST be a simple expression. */
29751 && decl
29754 {
29755 tree rhs;
29762 rhs,
29763 tf_warning_or_error));
29765 }
29766 else
29767 {
29772 {
29776 }
29777 }
29778 }
29780 }
29782 /* Parse the restricted form of the for statement allowed by OpenMP. */
29784 static tree
29787 {
29791 location_t loc_first;
29810 {
29813 location_t loc;
29817 {
29820 }
29823 {
29826 }
29835 add_private_clause
29842 {
29845 {
29851 }
29852 else
29854 }
29861 {
29866 {
29870 }
29873 {
29874 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29875 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29880 {
29883 }
29884 else
29885 {
29888 }
29892 }
29893 else
29894 {
29899 }
29900 }
29903 {
29904 tree c;
29906 {
29915 decl);
29919 decl);
29920 }
29922 {
29927 {
29930 }
29931 }
29932 }
29941 {
29942 /* If decl is an iterator, preserve the operator on decl
29943 until finish_omp_for. */
29945 && ((processing_template_decl
29949 else
29953 }
29968 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29969 in between the collapsed for loops to be still considered perfectly
29970 nested. Hopefully the final version clarifies this.
29971 For now handle (multiple) {'s and empty statements. */
29973 do
29974 {
29978 {
29980 bracecount++;
29981 }
29985 else
29986 {
29993 }
29994 }
29998 {
30001 }
30002 }
30004 /* Note that we saved the original contents of this flag when we entered
30005 the structured block, and so we don't need to re-save it here. */
30008 else
30011 /* Note that the grammar doesn't call for a structured block here,
30012 though the loop as a whole is a structured block. */
30019 else
30024 {
30026 {
30028 nbraces--;
30029 }
30032 else
30033 {
30035 {
30038 }
30043 }
30044 }
30051 }
30053 /* Helper function for OpenMP parsing, split clauses and call
30054 finish_omp_clauses on each of the set of clauses afterwards. */
30056 static void
30059 {
30065 }
30067 /* OpenMP 4.0:
30068 #pragma omp simd simd-clause[optseq] new-line
30069 for-loop */
30071 #define OMP_SIMD_CLAUSE_MASK \
30072 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30080 static tree
30083 {
30095 {
30098 }
30109 }
30111 /* OpenMP 2.5:
30112 #pragma omp for for-clause[optseq] new-line
30113 for-loop
30115 OpenMP 4.0:
30116 #pragma omp for simd for-simd-clause[optseq] new-line
30117 for-loop */
30119 #define OMP_FOR_CLAUSE_MASK \
30120 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30129 static tree
30132 {
30143 {
30148 {
30156 cclauses);
30160 cclauses);
30172 }
30173 }
30175 {
30178 }
30183 {
30186 }
30197 }
30199 /* OpenMP 2.5:
30200 # pragma omp master new-line
30201 structured-block */
30203 static tree
30205 {
30209 }
30211 /* OpenMP 2.5:
30212 # pragma omp ordered new-line
30213 structured-block */
30215 static tree
30217 {
30221 }
30223 /* OpenMP 2.5:
30225 section-scope:
30226 { section-sequence }
30228 section-sequence:
30229 section-directive[opt] structured-block
30230 section-sequence section-directive structured-block */
30232 static tree
30234 {
30245 {
30249 }
30252 {
30260 {
30264 }
30266 {
30269 }
30274 }
30285 }
30287 /* OpenMP 2.5:
30288 # pragma omp sections sections-clause[optseq] newline
30289 sections-scope */
30291 #define OMP_SECTIONS_CLAUSE_MASK \
30292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30298 static tree
30301 {
30313 {
30316 }
30323 }
30325 /* OpenMP 2.5:
30326 # pragma omp parallel parallel-clause[optseq] new-line
30327 structured-block
30328 # pragma omp parallel for parallel-for-clause[optseq] new-line
30329 structured-block
30330 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30331 structured-block
30333 OpenMP 4.0:
30334 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30335 structured-block */
30337 #define OMP_PARALLEL_CLAUSE_MASK \
30338 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30348 static tree
30351 {
30360 {
30373 block);
30378 }
30380 {
30384 }
30386 {
30389 }
30391 {
30395 {
30405 block);
30408 }
30409 }
30419 }
30421 /* OpenMP 2.5:
30422 # pragma omp single single-clause[optseq] new-line
30423 structured-block */
30425 #define OMP_SINGLE_CLAUSE_MASK \
30426 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30431 static tree
30433 {
30443 }
30445 /* OpenMP 3.0:
30446 # pragma omp task task-clause[optseq] new-line
30447 structured-block */
30449 #define OMP_TASK_CLAUSE_MASK \
30450 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30460 static tree
30462 {
30473 }
30475 /* OpenMP 3.0:
30476 # pragma omp taskwait new-line */
30478 static void
30480 {
30483 }
30485 /* OpenMP 3.1:
30486 # pragma omp taskyield new-line */
30488 static void
30490 {
30493 }
30495 /* OpenMP 4.0:
30496 # pragma omp taskgroup new-line
30497 structured-block */
30499 static tree
30501 {
30505 }
30508 /* OpenMP 2.5:
30509 # pragma omp threadprivate (variable-list) */
30511 static void
30513 {
30514 tree vars;
30520 }
30522 /* OpenMP 4.0:
30523 # pragma omp cancel cancel-clause[optseq] new-line */
30525 #define OMP_CANCEL_CLAUSE_MASK \
30526 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30532 static void
30534 {
30538 }
30540 /* OpenMP 4.0:
30541 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30543 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30544 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30549 static void
30551 {
30552 tree clauses;
30556 {
30561 {
30564 }
30565 }
30567 {
30571 }
30574 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30576 pragma_tok);
30578 }
30580 /* OpenMP 4.0:
30581 #pragma omp distribute distribute-clause[optseq] new-line
30582 for-loop */
30584 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30590 static tree
30593 {
30602 {
30610 else
30613 {
30619 {
30622 cclauses);
30623 else
30625 cclauses);
30626 }
30631 cclauses);
30632 else
30634 cclauses);
30646 }
30647 }
30649 {
30652 }
30657 {
30660 }
30671 }
30673 /* OpenMP 4.0:
30674 # pragma omp teams teams-clause[optseq] new-line
30675 structured-block */
30677 #define OMP_TEAMS_CLAUSE_MASK \
30678 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30686 static tree
30689 {
30698 {
30702 {
30710 cclauses);
30714 cclauses);
30725 }
30726 }
30728 {
30731 }
30736 {
30739 }
30747 }
30749 /* OpenMP 4.0:
30750 # pragma omp target data target-data-clause[optseq] new-line
30751 structured-block */
30753 #define OMP_TARGET_DATA_CLAUSE_MASK \
30754 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30758 static tree
30760 {
30772 }
30774 /* OpenMP 4.0:
30775 # pragma omp target update target-update-clause[optseq] new-line */
30777 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30778 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30783 static bool
30786 {
30788 {
30790 "%<#pragma omp target update%> may only be "
30794 }
30796 tree clauses
30801 {
30803 "%<#pragma omp target update must contain at least one "
30806 }
30814 }
30816 /* OpenMP 4.0:
30817 # pragma omp target target-clause[optseq] new-line
30818 structured-block */
30820 #define OMP_TARGET_CLAUSE_MASK \
30821 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30825 static bool
30828 {
30830 {
30834 }
30837 {
30842 {
30850 {
30852 OMP_TARGET_CLAUSE_MASK,
30853 cclauses);
30855 }
30871 }
30873 {
30876 }
30878 {
30882 }
30884 {
30887 }
30888 }
30902 }
30904 /* OpenMP 4.0:
30905 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30907 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30908 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30915 static void
30918 {
30920 cp_omp_declare_simd_data data;
30922 {
30927 }
30938 {
30942 {
30955 }
30960 "%<#pragma omp declare simd%> not immediately followed by "
30964 }
30965 }
30967 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30968 This function is modelled similar to the late parsing of omp declare
30969 simd. */
30971 static tree
30973 {
30979 {
30985 }
30987 {
30991 }
30996 {
31003 NULL);
31017 }
31022 }
31024 /* Finalize #pragma omp declare simd clauses after direct declarator has
31025 been parsed, and put that into "omp declare simd" attribute. */
31027 static tree
31029 {
31035 {
31040 }
31045 {
31063 }
31067 }
31070 /* OpenMP 4.0:
31071 # pragma omp declare target new-line
31072 declarations and definitions
31073 # pragma omp end declare target new-line */
31075 static void
31077 {
31080 }
31082 static void
31084 {
31087 {
31090 }
31092 {
31096 {
31099 }
31102 else
31103 {
31107 }
31108 }
31109 else
31110 {
31114 }
31118 "%<#pragma omp end declare target%> without corresponding "
31120 else
31122 }
31124 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31125 expression and optional initializer clause of
31126 #pragma omp declare reduction. We store the expression(s) as
31127 either 3, 6 or 7 special statements inside of the artificial function's
31128 body. The first two statements are DECL_EXPRs for the artificial
31129 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31130 expression that uses those variables.
31131 If there was any INITIALIZER clause, this is followed by further statements,
31132 the fourth and fifth statements are DECL_EXPRs for the artificial
31133 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31134 constructor variant (first token after open paren is not omp_priv),
31135 then the sixth statement is a statement with the function call expression
31136 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31137 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31138 to initialize the OMP_PRIV artificial variable and there is seventh
31139 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31141 static bool
31143 {
31155 tree combiner;
31170 {
31173 }
31176 {
31183 {
31186 }
31202 {
31206 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31210 == CPP_CLOSE_PAREN
31213 {
31217 }
31222 }
31223 else
31224 {
31240 {
31245 }
31247 tree arg;
31260 }
31271 }
31277 }
31279 /* OpenMP 4.0
31280 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31281 initializer-clause[opt] new-line
31283 initializer-clause:
31284 initializer (omp_priv initializer)
31285 initializer (function-name (argument-list)) */
31287 static void
31290 {
31300 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31307 {
31339 }
31351 /* Types may not be defined in declare reduction type list. */
31354 parser->type_definition_forbidden_message
31360 saved_colon_doesnt_start_class_def_p
31365 {
31369 ;
31390 else
31395 else
31397 }
31399 /* Restore the saved message. */
31402 parser->colon_doesnt_start_class_def_p
31407 {
31408 fail:
31411 }
31417 {
31418 tree fntype
31421 NULL_TREE);
31440 {
31445 }
31447 {
31449 {
31458 }
31465 }
31466 else
31467 {
31470 }
31473 else
31476 {
31479 }
31481 {
31484 else
31489 }
31494 else
31495 {
31504 }
31511 }
31515 done:
31516 /* Free any declarators allocated. */
31518 }
31520 /* OpenMP 4.0
31521 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31522 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31523 initializer-clause[opt] new-line
31524 #pragma omp declare target new-line */
31526 static void
31529 {
31531 {
31536 {
31539 context);
31541 }
31544 {
31547 context);
31549 }
31551 {
31554 }
31556 {
31560 }
31561 }
31565 }
31567 /* Main entry point to OpenMP statement pragmas. */
31569 static void
31571 {
31572 tree stmt;
31577 {
31625 }
31629 }
31630 \f
31631 /* Transactional Memory parsing routines. */
31633 /* Parse a transaction attribute.
31635 txn-attribute:
31636 attribute
31637 [ [ identifier ] ]
31639 ??? Simplify this when C++0x bracket attributes are
31640 implemented properly. */
31642 static tree
31644 {
31659 {
31663 /* For keywords, use the canonical spelling,
31664 not the parsed identifier. */
31668 }
31669 else
31673 error1:
31676 }
31678 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31680 transaction-statement:
31681 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31682 compound-statement
31683 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31684 */
31686 static tree
31688 {
31703 else
31704 {
31708 }
31710 /* Parse a noexcept specification. */
31713 /* Keep track if we're in the lexical scope of an outer transaction. */
31725 }
31727 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31729 transaction-expression:
31730 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31731 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31732 */
31734 static tree
31736 {
31761 /* Set this early. This might mean that we allow transaction_cancel in
31762 an expression that we find out later actually has to be a constexpr.
31763 However, we expect that cxx_constant_value will be able to deal with
31764 this; also, if the noexcept has no constexpr, then what we parse next
31765 really is a transaction's body. */
31768 /* Parse a noexcept specification. */
31774 {
31781 }
31782 else
31783 {
31784 /* The only expression that is available got parsed for the noexcept
31785 already. noexcept is true then. */
31788 }
31797 }
31799 /* Parse a function-transaction-block.
31801 function-transaction-block:
31802 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31803 function-body
31804 __transaction_atomic txn-attribute[opt] function-try-block
31805 __transaction_relaxed ctor-initializer[opt] function-body
31806 __transaction_relaxed function-try-block
31807 */
31809 static bool
31811 {
31827 else
31828 {
31832 }
31840 else
31841 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31849 }
31851 /* Parse a __transaction_cancel statement.
31853 cancel-statement:
31854 __transaction_cancel txn-attribute[opt] ;
31855 __transaction_cancel txn-attribute[opt] throw-expression ;
31857 ??? Cancel and throw is not yet implemented. */
31859 static tree
31861 {
31867 RT_TRANSACTION_CANCEL);
31874 /* ??? Parse cancel-and-throw here. */
31879 {
31883 }
31885 {
31889 }
31891 {
31894 {
31900 }
31901 }
31903 {
31907 }
31913 }
31914 \f
31915 /* The parser. */
31919 \f
31920 /* Special handling for the first token or line in the file. The first
31921 thing in the file might be #pragma GCC pch_preprocess, which loads a
31922 PCH file, which is a GC collection point. So we need to handle this
31923 first pragma without benefit of an existing lexer structure.
31925 Always returns one token to the caller in *FIRST_TOKEN. This is
31926 either the true first token of the file, or the first token after
31927 the initial pragma. */
31929 static void
31931 {
31940 {
31947 }
31948 else
31951 /* Skip to the end of the pragma. */
31955 /* Now actually load the PCH file. */
31959 /* Read one more token to return to our caller. We have to do this
31960 after reading the PCH file in, since its pointers have to be
31961 live. */
31963 }
31965 /* Parses the grainsize pragma for the _Cilk_for statement.
31966 Syntax:
31967 #pragma cilk grainsize = <VALUE>. */
31969 static void
31971 {
31973 {
31978 {
31981 }
31983 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31986 else
31988 "%<#pragma cilk grainsize%> is not followed by "
31991 }
31993 }
31995 /* Normal parsing of a pragma token. Here we can (and must) use the
31996 regular lexer. */
31998 static bool
32000 {
32012 {
32020 {
32030 }
32035 {
32045 }
32050 {
32056 "%<#pragma omp taskwait%> may only be "
32061 }
32066 {
32072 "%<#pragma omp taskyield%> may only be "
32077 }
32082 {
32088 "%<#pragma omp cancel%> may only be "
32093 }
32098 {
32104 "%<#pragma omp cancellation point%> may only be "
32109 }
32147 "%<#pragma omp section%> may only be used in "
32152 {
32159 {
32162 }
32165 }
32169 {
32173 }
32179 {
32183 }
32185 /* Ignore the pragma if Cilk Plus is not enabled. */
32187 {
32190 }
32191 else
32192 {
32196 }
32203 bad_stmt:
32206 }
32210 }
32212 /* The interface the pragma parsers have to the lexer. */
32214 enum cpp_ttype
32216 {
32229 else
32230 {
32234 }
32237 }
32239 \f
32240 /* External interface. */
32242 /* Parse one entire translation unit. */
32244 void
32246 {
32258 }
32260 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32261 vectorlength clause:
32262 Syntax:
32263 vectorlength ( constant-expression ) */
32265 static tree
32268 {
32270 tree expr;
32271 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32272 safelen clause. Thus, vectorlength is represented as OMP 4.0
32273 safelen. For SIMD-enabled function it is represented by OMP 4.0
32274 simdlen. */
32277 loc);
32278 else
32280 loc);
32288 /* If expr == error_mark_node, then don't emit any errors nor
32289 create a clause. if any of the above functions returns
32290 error mark node then they would have emitted an error message. */
32292 ;
32300 else
32301 {
32302 tree c;
32304 {
32309 }
32310 else
32311 {
32316 }
32317 }
32322 }
32324 /* Handles the Cilk Plus #pragma simd linear clause.
32325 Syntax:
32326 linear ( simd-linear-variable-list )
32328 simd-linear-variable-list:
32329 simd-linear-variable
32330 simd-linear-variable-list , simd-linear-variable
32332 simd-linear-variable:
32333 id-expression
32334 id-expression : simd-linear-step
32336 simd-linear-step:
32337 conditional-expression */
32339 static tree
32341 {
32347 {
32351 }
32356 {
32359 {
32363 }
32370 {
32374 }
32375 else
32376 {
32380 /* If present, parse the linear step. Otherwise, assume the default
32381 value of 1. */
32383 {
32390 {
32391 /* If an error has occurred, then the whole pragma is
32392 considered ill-formed. Thus, no reason to keep
32393 parsing. */
32396 }
32404 else
32406 "step size must be an integer constant "
32408 }
32410 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32416 }
32421 else
32422 {
32427 }
32428 }
32432 }
32434 /* Returns the name of the next clause. If the clause is not
32435 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32436 token is not consumed. Otherwise, the appropriate enum from the
32437 pragma_simd_clause is returned and the token is consumed. */
32439 static pragma_omp_clause
32441 {
32442 pragma_omp_clause clause_type;
32459 else
32464 }
32466 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32468 static tree
32470 {
32475 {
32476 pragma_omp_clause c_kind;
32483 /* Use the OpenMP 4.0 equivalent function. */
32486 /* Use the OpenMP 4.0 equivalent function. */
32488 clauses);
32490 /* Use the OMP 4.0 equivalent function. */
32492 clauses);
32494 /* Use the OMP 4.0 equivalent function. */
32496 else
32497 {
32501 }
32502 }
32508 else
32510 }
32512 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32514 static void
32516 {
32523 {
32527 }
32536 }
32538 /* Main entry-point for parsing Cilk Plus _Cilk_for
32539 loops. The return value is error_mark_node
32540 when errors happen and CILK_FOR tree on success. */
32542 static tree
32544 {
32559 else
32565 }
32567 /* Create an identifier for a generic parameter type (a synthesized
32568 template parameter implied by `auto' or a concept identifier). */
32571 static tree
32573 {
32577 }
32579 /* Predicate that behaves as is_auto_or_concept but matches the parent
32580 node of the generic type rather than the generic type itself. This
32581 allows for type transformation in add_implicit_template_parms. */
32585 {
32587 }
32589 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32590 (creating a new template parameter list if necessary). Returns the newly
32591 created template type parm. */
32593 tree
32595 {
32598 /* We are either continuing a function template that already contains implicit
32599 template parameters, creating a new fully-implicit function template, or
32600 extending an existing explicit function template with implicit template
32601 parameters. */
32609 {
32613 }
32614 else
32615 {
32616 /* Roll back to the existing template parameter scope (in the case of
32617 extending an explicit function template) or introduce a new template
32618 parameter scope ahead of the function parameter scope (or class scope
32619 in the case of out-of-line member definitions). The function scope is
32620 added back after template parameter synthesis below. */
32625 {
32628 }
32630 {
32631 /* If not defining a class, then any class scope is a scope level in
32632 an out-of-line member definition. In this case simply wind back
32633 beyond the first such scope to inject the template parameter list.
32634 Otherwise wind back to the class being defined. The latter can
32635 occur in class member friend declarations such as:
32637 class A {
32638 void foo (auto);
32639 };
32640 class B {
32641 friend void A::foo (auto);
32642 };
32644 The template parameter list synthesized for the friend declaration
32645 must be injected in the scope of 'B'. This can also occur in
32646 erroneous cases such as:
32648 struct A {
32649 struct B {
32650 void foo (auto);
32651 };
32652 void B::foo (auto) {}
32653 };
32655 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32656 but, nevertheless, the template parameter list synthesized for the
32657 declarator should be injected into the scope of 'A' as if the
32658 ill-formed template was specified explicitly. */
32661 {
32664 }
32665 }
32671 {
32672 /* Introduce a new template parameter list for implicit template
32673 parameters. */
32677 parser->implicit_template_scope
32684 }
32685 else
32686 {
32687 /* Synthesize implicit template parameters at the end of the explicit
32688 template parameter list. */
32695 parser->implicit_template_parms
32697 }
32698 }
32700 /* Synthesize a new template parameter and track the current template
32701 parameter chain with implicit_template_parms. */
32705 synth_id);
32706 tree new_parm
32708 input_location,
32715 parser->implicit_template_parms
32717 else
32722 /* If creating a fully implicit function template, start the new implicit
32723 template parameter list with this synthesized type, otherwise grow the
32724 current template parameter list. */
32727 {
32734 }
32735 else
32736 {
32741 }
32746 }
32748 /* Finish the declaration of a fully implicit function template. Such a
32749 template has no explicit template parameter list so has not been through the
32750 normal template head and tail processing. synthesize_implicit_template_parm
32751 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32752 provided if the declaration is a class member such that its template
32753 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32754 form is returned. Otherwise NULL_TREE is returned. */
32756 tree
32758 {
32763 {
32767 }
32777 }