| blob | 68940aab1c9e173223fc7bdd0f6ff2da181bd874 |
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 }
4445 {
4447 {
4448 /* We might have an Objective-C++ message. */
4451 /* If that works out, we're done ... */
4454 /* ... else, fall though to see if it's a lambda. */
4455 }
4457 /* Don't warn about a failed tentative parse. */
4462 }
4466 /* We have an Objective-C++ string literal. */
4473 {
4474 /* These two are the boolean literals. */
4482 /* The `__null' literal. */
4487 /* The `nullptr' literal. */
4492 /* Recognize the `this' keyword. */
4496 {
4500 }
4501 /* Pointers cannot appear in constant-expressions. */
4506 /* The `operator' keyword can be the beginning of an
4507 id-expression. */
4514 {
4515 non_integral_constant name;
4517 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4518 __func__ are the names of variables -- but they are
4519 treated specially. Therefore, they are handled here,
4520 rather than relying on the generic id-expression logic
4521 below. Grammatically, these names are id-expressions.
4523 Consume the token. */
4527 {
4539 }
4544 /* Look up the name. */
4546 }
4549 {
4550 tree expression;
4551 tree type;
4552 source_location type_location;
4554 /* The `__builtin_va_arg' construct is used to handle
4555 `va_arg'. Consume the `__builtin_va_arg' token. */
4557 /* Look for the opening `('. */
4559 /* Now, parse the assignment-expression. */
4561 /* Look for the `,'. */
4564 /* Parse the type-id. */
4566 /* Look for the closing `)'. */
4568 /* Using `va_arg' in a constant-expression is not
4569 allowed. */
4571 NIC_VA_ARG))
4574 }
4604 /* Objective-C++ expressions. */
4614 {
4619 }
4623 }
4625 /* An id-expression can start with either an identifier, a
4626 `::' as the beginning of a qualified-id, or the "operator"
4627 keyword. */
4632 {
4633 tree id_expression;
4634 tree decl;
4640 id_expression:
4641 /* Parse the id-expression. */
4642 id_expression
4659 /* If we have a template-id, then no further lookup is
4660 required. If the template-id was for a template-class, we
4661 will sometimes have a TYPE_DECL at this point. */
4665 /* Look up the name. */
4666 else
4667 {
4668 tree ambiguous_decls;
4670 /* If we already know that this lookup is ambiguous, then
4671 we've already issued an error message; there's no reason
4672 to check again. */
4675 {
4678 }
4681 none_type,
4682 template_p,
4687 /* If the lookup was ambiguous, an error will already have
4688 been issued. */
4692 /* In Objective-C++, we may have an Objective-C 2.0
4693 dot-syntax for classes here. */
4698 {
4699 tree component;
4706 }
4708 /* In Objective-C++, an instance variable (ivar) may be preferred
4709 to whatever cp_parser_lookup_name() found. */
4712 /* If name lookup gives us a SCOPE_REF, then the
4713 qualifying scope was dependent. */
4715 {
4716 /* At this point, we do not know if DECL is a valid
4717 integral constant expression. We assume that it is
4718 in fact such an expression, so that code like:
4720 template <int N> struct A {
4721 int a[B<N>::i];
4722 };
4724 is accepted. At template-instantiation time, we
4725 will check that B<N>::i is actually a constant. */
4727 }
4728 /* Check to see if DECL is a local variable in a context
4729 where that is forbidden. */
4732 {
4733 /* It might be that we only found DECL because we are
4734 trying to be generous with pre-ISO scoping rules.
4735 For example, consider:
4737 int i;
4738 void g() {
4739 for (int i = 0; i < 10; ++i) {}
4740 extern void f(int j = i);
4741 }
4743 Here, name look up will originally find the out
4744 of scope `i'. We need to issue a warning message,
4745 but then use the global `i'. */
4748 {
4751 decl);
4753 }
4754 }
4755 }
4757 decl = (finish_id_expression
4759 idk,
4764 template_arg_p,
4770 }
4772 /* Anything else is an error. */
4776 }
4777 }
4785 {
4788 }
4790 /* Parse an id-expression.
4792 id-expression:
4793 unqualified-id
4794 qualified-id
4796 qualified-id:
4797 :: [opt] nested-name-specifier template [opt] unqualified-id
4798 :: identifier
4799 :: operator-function-id
4800 :: template-id
4802 Return a representation of the unqualified portion of the
4803 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4804 a `::' or nested-name-specifier.
4806 Often, if the id-expression was a qualified-id, the caller will
4807 want to make a SCOPE_REF to represent the qualified-id. This
4808 function does not do this in order to avoid wastefully creating
4809 SCOPE_REFs when they are not required.
4811 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4812 `template' keyword.
4814 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4815 uninstantiated templates.
4817 If *TEMPLATE_P is non-NULL, it is set to true iff the
4818 `template' keyword is used to explicitly indicate that the entity
4819 named is a template.
4821 If DECLARATOR_P is true, the id-expression is appearing as part of
4822 a declarator, rather than as part of an expression. */
4824 static tree
4831 {
4835 /* Assume the `template' keyword was not used. */
4839 /* Look for the optional `::' operator. */
4840 global_scope_p
4843 /* Look for the optional nested-name-specifier. */
4844 nested_name_specifier_p
4847 check_dependency_p,
4849 declarator_p)
4851 /* If there is a nested-name-specifier, then we are looking at
4852 the first qualified-id production. */
4854 {
4855 tree saved_scope;
4856 tree saved_object_scope;
4857 tree saved_qualifying_scope;
4858 tree unqualified_id;
4861 /* See if the next token is the `template' keyword. */
4865 /* Name lookup we do during the processing of the
4866 unqualified-id might obliterate SCOPE. */
4870 /* Process the final unqualified-id. */
4872 check_dependency_p,
4873 declarator_p,
4875 /* Restore the SAVED_SCOPE for our caller. */
4881 }
4882 /* Otherwise, if we are in global scope, then we are looking at one
4883 of the other qualified-id productions. */
4885 {
4887 tree id;
4889 /* Peek at the next token. */
4892 /* If it's an identifier, and the next token is not a "<", then
4893 we can avoid the template-id case. This is an optimization
4894 for this common case. */
4896 && !cp_parser_nth_token_starts_template_argument_list_p
4901 /* Try a template-id. */
4905 none_type,
4906 declarator_p);
4907 /* If that worked, we're done. */
4911 /* Peek at the next token. (Changes in the token buffer may
4912 have invalidated the pointer obtained above.) */
4916 {
4923 /* Fall through. */
4928 }
4929 }
4930 else
4933 declarator_p,
4934 optional_p);
4935 }
4937 /* Parse an unqualified-id.
4939 unqualified-id:
4940 identifier
4941 operator-function-id
4942 conversion-function-id
4943 ~ class-name
4944 template-id
4946 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4947 keyword, in a construct like `A::template ...'.
4949 Returns a representation of unqualified-id. For the `identifier'
4950 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4951 production a BIT_NOT_EXPR is returned; the operand of the
4952 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4953 other productions, see the documentation accompanying the
4954 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4955 names are looked up in uninstantiated templates. If DECLARATOR_P
4956 is true, the unqualified-id is appearing as part of a declarator,
4957 rather than as part of an expression. */
4959 static tree
4965 {
4968 /* Peek at the next token. */
4972 {
4974 {
4975 tree id;
4977 /* We don't know yet whether or not this will be a
4978 template-id. */
4980 /* Try a template-id. */
4982 check_dependency_p,
4983 none_type,
4984 declarator_p);
4985 /* If it worked, we're done. */
4988 /* Otherwise, it's an ordinary identifier. */
4990 }
4994 check_dependency_p,
4995 none_type,
4996 declarator_p);
4999 {
5000 tree type_decl;
5001 tree qualifying_scope;
5002 tree object_scope;
5003 tree scope;
5006 /* Consume the `~' token. */
5008 /* Parse the class-name. The standard, as written, seems to
5009 say that:
5011 template <typename T> struct S { ~S (); };
5012 template <typename T> S<T>::~S() {}
5014 is invalid, since `~' must be followed by a class-name, but
5015 `S<T>' is dependent, and so not known to be a class.
5016 That's not right; we need to look in uninstantiated
5017 templates. A further complication arises from:
5019 template <typename T> void f(T t) {
5020 t.T::~T();
5021 }
5023 Here, it is not possible to look up `T' in the scope of `T'
5024 itself. We must look in both the current scope, and the
5025 scope of the containing complete expression.
5027 Yet another issue is:
5029 struct S {
5030 int S;
5031 ~S();
5032 };
5034 S::~S() {}
5036 The standard does not seem to say that the `S' in `~S'
5037 should refer to the type `S' and not the data member
5038 `S::S'. */
5040 /* DR 244 says that we look up the name after the "~" in the
5041 same scope as we looked up the qualifying name. That idea
5042 isn't fully worked out; it's more complicated than that. */
5047 /* Check for invalid scopes. */
5049 {
5053 }
5055 {
5059 scope);
5064 }
5067 /* If the name is of the form "X::~X" it's OK even if X is a
5068 typedef. */
5077 {
5080 }
5082 /* ~auto means the destructor of whatever the object is. */
5084 {
5087 "%<~auto%> only available with "
5091 }
5093 /* If there was an explicit qualification (S::~T), first look
5094 in the scope given by the qualification (i.e., S).
5096 Note: in the calls to cp_parser_class_name below we pass
5097 typename_type so that lookup finds the injected-class-name
5098 rather than the constructor. */
5102 {
5107 typename_type,
5110 declarator_p);
5113 }
5114 /* In "N::S::~S", look in "N" as well. */
5116 {
5121 type_decl
5125 typename_type,
5128 declarator_p);
5131 }
5132 /* In "p->S::~T", look in the scope given by "*p" as well. */
5134 {
5139 type_decl
5143 typename_type,
5146 declarator_p);
5149 }
5150 /* Look in the surrounding context. */
5152 {
5158 type_decl
5162 typename_type,
5165 declarator_p);
5168 {
5169 /* We couldn't find a type with this name, so just accept
5170 it and check for a match at instantiation time. */
5175 }
5176 }
5177 /* If an error occurred, assume that the name of the
5178 destructor is the same as the name of the qualifying
5179 class. That allows us to keep parsing after running
5180 into ill-formed destructor names. */
5186 /* Check that destructor name and scope match. */
5188 {
5195 }
5197 /* [class.dtor]
5199 A typedef-name that names a class shall not be used as the
5200 identifier in the declarator for a destructor declaration. */
5207 type_decl);
5210 }
5214 {
5215 tree id;
5217 /* This could be a template-id, so we try that first. */
5219 /* Try a template-id. */
5222 none_type,
5223 declarator_p);
5224 /* If that worked, we're done. */
5227 /* We still don't know whether we're looking at an
5228 operator-function-id or a conversion-function-id. */
5230 /* Try an operator-function-id. */
5232 /* If that didn't work, try a conversion-function-id. */
5236 {
5237 /* 17.6.3.3.5 */
5243 }
5246 }
5247 /* Fall through. */
5254 }
5255 }
5257 /* Parse an (optional) nested-name-specifier.
5259 nested-name-specifier: [C++98]
5260 class-or-namespace-name :: nested-name-specifier [opt]
5261 class-or-namespace-name :: template nested-name-specifier [opt]
5263 nested-name-specifier: [C++0x]
5264 type-name ::
5265 namespace-name ::
5266 nested-name-specifier identifier ::
5267 nested-name-specifier template [opt] simple-template-id ::
5269 PARSER->SCOPE should be set appropriately before this function is
5270 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5271 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5272 in name lookups.
5274 Sets PARSER->SCOPE to the class (TYPE) or namespace
5275 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5276 it unchanged if there is no nested-name-specifier. Returns the new
5277 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5279 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5280 part of a declaration and/or decl-specifier. */
5282 static tree
5288 {
5293 /* Remember where the nested-name-specifier starts. */
5295 {
5298 }
5301 {
5302 tree new_scope;
5303 tree old_scope;
5304 tree saved_qualifying_scope;
5307 /* Spot cases that cannot be the beginning of a
5308 nested-name-specifier. */
5311 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5312 the already parsed nested-name-specifier. */
5314 {
5315 /* Grab the nested-name-specifier and continue the loop. */
5317 /* If we originally encountered this nested-name-specifier
5318 with IS_DECLARATION set to false, we will not have
5319 resolved TYPENAME_TYPEs, so we must do so here. */
5322 {
5327 }
5330 }
5332 /* Spot cases that cannot be the beginning of a
5333 nested-name-specifier. On the second and subsequent times
5334 through the loop, we look for the `template' keyword. */
5336 ;
5337 /* A template-id can start a nested-name-specifier. */
5339 ;
5340 /* DR 743: decltype can be used in a nested-name-specifier. */
5342 ;
5343 else
5344 {
5345 /* If the next token is not an identifier, then it is
5346 definitely not a type-name or namespace-name. */
5349 /* If the following token is neither a `<' (to begin a
5350 template-id), nor a `::', then we are not looking at a
5351 nested-name-specifier. */
5357 {
5361 }
5364 && !cp_parser_nth_token_starts_template_argument_list_p
5367 }
5369 /* The nested-name-specifier is optional, so we parse
5370 tentatively. */
5373 /* Look for the optional `template' keyword, if this isn't the
5374 first time through the loop. */
5377 else
5380 /* Save the old scope since the name lookup we are about to do
5381 might destroy it. */
5384 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5385 look up names in "X<T>::I" in order to determine that "Y" is
5386 a template. So, if we have a typename at this point, we make
5387 an effort to look through it. */
5389 && !typename_keyword_p
5394 /* Parse the qualifying entity. */
5395 new_scope
5397 typename_keyword_p,
5398 template_keyword_p,
5399 check_dependency_p,
5400 type_p,
5401 is_declaration);
5402 /* Look for the `::' token. */
5405 /* If we found what we wanted, we keep going; otherwise, we're
5406 done. */
5408 {
5411 /* Restore the OLD_SCOPE since it was valid before the
5412 failed attempt at finding the last
5413 class-or-namespace-name. */
5417 /* If the next token is a decltype, and the one after that is a
5418 `::', then the decltype has failed to resolve to a class or
5419 enumeration type. Give this error even when parsing
5420 tentatively since it can't possibly be valid--and we're going
5421 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5422 won't get another chance.*/
5426 {
5433 /* As below. */
5436 }
5440 /* If the next token is an identifier, and the one after
5441 that is a `::', then any valid interpretation would have
5442 found a class-or-namespace-name. */
5448 {
5451 {
5453 {
5454 tree decl;
5455 tree ambiguous_decls;
5458 none_type,
5467 decl);
5469 {
5470 // cp_parser_lookup_name has the same diagnostic,
5471 // thus make sure to emit it at most once.
5474 {
5479 }
5481 }
5482 else
5483 {
5485 cp_parser_name_lookup_error
5488 else
5489 cp_parser_name_lookup_error
5492 }
5493 }
5496 /* Treat this as a successful nested-name-specifier
5497 due to:
5499 [basic.lookup.qual]
5501 If the name found is not a class-name (clause
5502 _class_) or namespace-name (_namespace.def_), the
5503 program is ill-formed. */
5505 }
5507 }
5509 }
5510 /* We've found one valid nested-name-specifier. */
5512 /* Name lookup always gives us a DECL. */
5515 /* Uses of "template" must be followed by actual templates. */
5527 new_scope);
5528 /* If it is a class scope, try to complete it; we are about to
5529 be looking up names inside the class. */
5531 /* Since checking types for dependency can be expensive,
5532 avoid doing it if the type is already complete. */
5534 /* Do not try to complete dependent types. */
5536 {
5538 /* If it is a typedef to current class, use the current
5539 class instead, as the typedef won't have any names inside
5540 it yet. */
5544 }
5545 /* Make sure we look in the right scope the next time through
5546 the loop. */
5548 }
5550 /* If parsing tentatively, replace the sequence of tokens that makes
5551 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5552 token. That way, should we re-parse the token stream, we will
5553 not have to repeat the effort required to do the parse, nor will
5554 we issue duplicate error messages. */
5556 {
5560 /* Reset the contents of the START token. */
5562 /* Retrieve any deferred checks. Do not pop this access checks yet
5563 so the memory will not be reclaimed during token replacing below. */
5571 /* Purge all subsequent tokens. */
5573 }
5579 }
5581 /* Parse a nested-name-specifier. See
5582 cp_parser_nested_name_specifier_opt for details. This function
5583 behaves identically, except that it will an issue an error if no
5584 nested-name-specifier is present. */
5586 static tree
5592 {
5593 tree scope;
5595 /* Look for the nested-name-specifier. */
5597 typename_keyword_p,
5598 check_dependency_p,
5599 type_p,
5600 is_declaration);
5601 /* If it was not present, issue an error message. */
5603 {
5606 }
5609 }
5611 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5612 this is either a class-name or a namespace-name (which corresponds
5613 to the class-or-namespace-name production in the grammar). For
5614 C++0x, it can also be a type-name that refers to an enumeration
5615 type or a simple-template-id.
5617 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5618 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5619 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5620 TYPE_P is TRUE iff the next name should be taken as a class-name,
5621 even the same name is declared to be another entity in the same
5622 scope.
5624 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5625 specified by the class-or-namespace-name. If neither is found the
5626 ERROR_MARK_NODE is returned. */
5628 static tree
5635 {
5636 tree saved_scope;
5637 tree saved_qualifying_scope;
5638 tree saved_object_scope;
5639 tree scope;
5643 /* DR 743: decltype can appear in a nested-name-specifier. */
5645 {
5649 {
5652 }
5656 }
5658 /* Before we try to parse the class-name, we must save away the
5659 current PARSER->SCOPE since cp_parser_class_name will destroy
5660 it. */
5664 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5665 there is no need to look for a namespace-name. */
5666 only_class_p = template_keyword_p
5671 typename_keyword_p,
5672 template_keyword_p,
5674 check_dependency_p,
5676 is_declaration);
5678 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5682 {
5683 /* Restore the saved scope. */
5688 /* Parse tentatively. */
5691 /* Parse a type-name */
5694 /* "If the name found does not designate a namespace or a class,
5695 enumeration, or dependent type, the program is ill-formed."
5697 We cover classes and dependent types above and namespaces below,
5698 so this code is only looking for enums. */
5704 }
5705 /* If that didn't work, try for a namespace-name. */
5707 {
5708 /* Restore the saved scope. */
5712 /* If we are not looking at an identifier followed by the scope
5713 resolution operator, then this is not part of a
5714 nested-name-specifier. (Note that this function is only used
5715 to parse the components of a nested-name-specifier.) */
5720 }
5723 }
5725 /* Return true if we are looking at a compound-literal, false otherwise. */
5727 static bool
5729 {
5730 /* Consume the `('. */
5735 /* Skip tokens until the next token is a closing parenthesis.
5736 If we find the closing `)', and the next token is a `{', then
5737 we are looking at a compound-literal. */
5738 bool compound_literal_p
5743 /* Roll back the tokens we skipped. */
5747 }
5749 /* Parse a postfix-expression.
5751 postfix-expression:
5752 primary-expression
5753 postfix-expression [ expression ]
5754 postfix-expression ( expression-list [opt] )
5755 simple-type-specifier ( expression-list [opt] )
5756 typename :: [opt] nested-name-specifier identifier
5757 ( expression-list [opt] )
5758 typename :: [opt] nested-name-specifier template [opt] template-id
5759 ( expression-list [opt] )
5760 postfix-expression . template [opt] id-expression
5761 postfix-expression -> template [opt] id-expression
5762 postfix-expression . pseudo-destructor-name
5763 postfix-expression -> pseudo-destructor-name
5764 postfix-expression ++
5765 postfix-expression --
5766 dynamic_cast < type-id > ( expression )
5767 static_cast < type-id > ( expression )
5768 reinterpret_cast < type-id > ( expression )
5769 const_cast < type-id > ( expression )
5770 typeid ( expression )
5771 typeid ( type-id )
5773 GNU Extension:
5775 postfix-expression:
5776 ( type-id ) { initializer-list , [opt] }
5778 This extension is a GNU version of the C99 compound-literal
5779 construct. (The C99 grammar uses `type-name' instead of `type-id',
5780 but they are essentially the same concept.)
5782 If ADDRESS_P is true, the postfix expression is the operand of the
5783 `&' operator. CAST_P is true if this expression is the target of a
5784 cast.
5786 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5787 class member access expressions [expr.ref].
5789 Returns a representation of the expression. */
5791 static tree
5795 {
5797 location_t loc;
5804 /* Peek at the next token. */
5807 /* Some of the productions are determined by keywords. */
5810 {
5815 {
5816 tree type;
5817 tree expression;
5821 /* All of these can be handled in the same way from the point
5822 of view of parsing. Begin by consuming the token
5823 identifying the cast. */
5826 /* New types cannot be defined in the cast. */
5828 parser->type_definition_forbidden_message
5831 /* Look for the opening `<'. */
5833 /* Parse the type to which we are casting. */
5838 /* Look for the closing `>'. */
5840 /* Restore the old message. */
5843 bool saved_greater_than_is_operator_p
5847 /* And the expression which is being cast. */
5852 parser->greater_than_is_operator_p
5855 /* Only type conversions to integral or enumeration types
5856 can be used in constant-expressions. */
5862 {
5864 postfix_expression
5868 postfix_expression
5872 postfix_expression
5874 tf_warning_or_error);
5877 postfix_expression
5882 }
5883 }
5887 {
5888 tree type;
5892 /* Consume the `typeid' token. */
5894 /* Look for the `(' token. */
5896 /* Types cannot be defined in a `typeid' expression. */
5898 parser->type_definition_forbidden_message
5900 /* We can't be sure yet whether we're looking at a type-id or an
5901 expression. */
5903 /* Try a type-id first. */
5908 /* Look for the `)' token. Otherwise, we can't be sure that
5909 we're not looking at an expression: consider `typeid (int
5910 (3))', for example. */
5912 /* If all went well, simply lookup the type-id. */
5915 /* Otherwise, fall back to the expression variant. */
5916 else
5917 {
5918 tree expression;
5920 /* Look for an expression. */
5922 /* Compute its typeid. */
5924 /* Look for the `)' token. */
5926 }
5927 /* Restore the saved message. */
5929 /* `typeid' may not appear in an integral constant expression. */
5932 }
5936 {
5937 tree type;
5938 /* The syntax permitted here is the same permitted for an
5939 elaborated-type-specifier. */
5944 }
5948 {
5952 {
5957 }
5959 {
5964 }
5965 else
5966 {
5967 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5970 }
5972 postfix_expression =
5976 {
5980 }
5982 {
5987 }
5988 else
5989 {
5991 postfix_expression);
5995 }
5997 }
6000 {
6003 tree p;
6017 tf_warning_or_error);
6020 tf_warning_or_error);
6021 else
6022 {
6026 }
6028 }
6031 {
6032 tree type;
6034 /* If the next thing is a simple-type-specifier, we may be
6035 looking at a functional cast. We could also be looking at
6036 an id-expression. So, we try the functional cast, and if
6037 that doesn't work we fall back to the primary-expression. */
6039 /* Look for the simple-type-specifier. */
6042 CP_PARSER_FLAGS_NONE);
6043 /* Parse the cast itself. */
6045 postfix_expression
6047 /* If that worked, we're done. */
6051 /* If the functional-cast didn't work out, try a
6052 compound-literal. */
6055 {
6060 /* Avoid calling cp_parser_type_id pointlessly, see comment
6061 in cp_parser_cast_expression about c++/29234. */
6064 else
6065 {
6066 /* Parse the type. */
6071 /* Look for the `)'. */
6073 }
6075 /* If things aren't going well, there's no need to
6076 keep going. */
6078 {
6080 /* Parse the brace-enclosed initializer list. */
6083 }
6084 /* If that worked, we're definitely looking at a
6085 compound-literal expression. */
6087 {
6088 /* Warn the user that a compound literal is not
6089 allowed in standard C++. */
6092 /* For simplicity, we disallow compound literals in
6093 constant-expressions. We could
6094 allow compound literals of integer type, whose
6095 initializer was a constant, in constant
6096 expressions. Permitting that usage, as a further
6097 extension, would not change the meaning of any
6098 currently accepted programs. (Of course, as
6099 compound literals are not part of ISO C++, the
6100 standard has nothing to say.) */
6102 NIC_NCC))
6103 {
6106 }
6107 /* Form the representation of the compound-literal. */
6108 postfix_expression
6110 tf_warning_or_error);
6112 }
6113 }
6115 /* It must be a primary-expression. */
6116 postfix_expression
6119 decltype_p,
6121 }
6123 }
6125 /* Note that we don't need to worry about calling build_cplus_new on a
6126 class-valued CALL_EXPR in decltype when it isn't the end of the
6127 postfix-expression; unary_complex_lvalue will take care of that for
6128 all these cases. */
6130 /* Keep looping until the postfix-expression is complete. */
6132 {
6136 /* It is not a Koenig lookup function call. */
6137 postfix_expression
6140 /* Peek at the next token. */
6144 {
6147 {
6149 "two consecutive %<[%> shall "
6152 }
6153 postfix_expression
6155 postfix_expression,
6157 decltype_p);
6163 /* postfix-expression ( expression-list [opt] ) */
6164 {
6174 is_builtin_constant_p
6177 {
6178 /* The whole point of __builtin_constant_p is to allow
6179 non-constant expressions to appear as arguments. */
6180 saved_integral_constant_expression_p
6182 saved_non_integral_constant_expression_p
6185 }
6186 args = (cp_parser_parenthesized_expression_list
6192 {
6193 parser->integral_constant_expression_p
6195 parser->non_integral_constant_expression_p
6197 }
6200 {
6203 }
6205 /* Function calls are not permitted in
6206 constant-expressions. */
6209 NIC_FUNC_CALL))
6210 {
6214 }
6219 {
6221 {
6223 {
6226 postfix_expression
6228 complain);
6229 }
6230 else
6231 postfix_expression
6233 }
6234 /* We do not perform argument-dependent lookup if
6235 normal lookup finds a non-function, in accordance
6236 with the expected resolution of DR 218. */
6239 {
6243 /* Do not do argument dependent lookup if regular
6244 lookup finds a member function or a block-scope
6245 function declaration. [basic.lookup.argdep]/3 */
6248 {
6251 postfix_expression
6253 complain);
6254 }
6255 }
6256 }
6259 {
6269 "%<memset%> used with constant zero length "
6270 "parameter; this could be due to transposed "
6273 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6274 to avoid leaking those into folder and middle-end. */
6276 tree arg;
6280 }
6283 {
6293 {
6294 postfix_expression
6298 }
6301 {
6302 postfix_expression
6303 = (build_new_method_call
6309 complain));
6310 }
6311 else
6312 postfix_expression
6316 complain);
6317 }
6321 postfix_expression = (build_offset_ref_call_from_tree
6323 complain));
6325 /* A call to a static class member, or a namespace-scope
6326 function. */
6327 postfix_expression
6330 koenig_p,
6331 complain);
6332 else
6333 /* All other function calls. */
6334 postfix_expression
6337 koenig_p,
6338 complain);
6342 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6346 }
6351 /* postfix-expression . template [opt] id-expression
6352 postfix-expression . pseudo-destructor-name
6353 postfix-expression -> template [opt] id-expression
6354 postfix-expression -> pseudo-destructor-name */
6356 /* Consume the `.' or `->' operator. */
6359 postfix_expression
6361 postfix_expression,
6368 /* postfix-expression ++ */
6369 /* Consume the `++' token. */
6371 /* Generate a representation for the complete expression. */
6372 postfix_expression
6374 POSTINCREMENT_EXPR);
6375 /* Increments may not appear in constant-expressions. */
6383 /* postfix-expression -- */
6384 /* Consume the `--' token. */
6386 /* Generate a representation for the complete expression. */
6387 postfix_expression
6389 POSTDECREMENT_EXPR);
6390 /* Decrements may not appear in constant-expressions. */
6402 else
6404 }
6405 }
6407 /* We should never get here. */
6410 }
6412 /* This function parses Cilk Plus array notations. If a normal array expr. is
6413 parsed then the array index is passed back to the caller through *INIT_INDEX
6414 and the function returns a NULL_TREE. If array notation expr. is parsed,
6415 then *INIT_INDEX is ignored by the caller and the function returns
6416 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6417 error_mark_node. */
6419 static tree
6421 tree array_value)
6422 {
6426 {
6429 }
6438 {
6441 }
6443 {
6444 /* Consume the ':'. */
6447 /* If we are here, then we have a case like this A[:]. */
6449 {
6453 }
6457 }
6458 else
6459 {
6460 /* If we are here, then there are three valid possibilities:
6461 1. ARRAY [ EXP ]
6462 2. ARRAY [ EXP : EXP ]
6463 3. ARRAY [ EXP : EXP : EXP ] */
6467 {
6468 /* This indicates that we have a normal array expression. */
6471 }
6473 /* Consume the ':'. */
6477 {
6480 }
6481 }
6486 {
6490 }
6496 }
6498 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6499 by cp_parser_builtin_offsetof. We're looking for
6501 postfix-expression [ expression ]
6502 postfix-expression [ braced-init-list ] (C++11)
6504 FOR_OFFSETOF is set if we're being called in that context, which
6505 changes how we deal with integer constant expressions. */
6507 static tree
6509 tree postfix_expression,
6512 {
6517 /* Consume the `[' token. */
6523 /* Parse the index expression. */
6524 /* ??? For offsetof, there is a question of what to allow here. If
6525 offsetof is not being used in an integral constant expression context,
6526 then we *could* get the right answer by computing the value at runtime.
6527 If we are in an integral constant expression context, then we might
6528 could accept any constant expression; hard to say without analysis.
6529 Rather than open the barn door too wide right away, allow only integer
6530 constant expressions here. */
6533 else
6534 {
6536 {
6543 {
6545 "braced list index is not allowed with array "
6549 }
6550 }
6552 {
6553 /* Here are have these two options:
6554 ARRAY[EXP : EXP] - Array notation expr with default
6555 stride of 1.
6556 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6557 stride. */
6559 postfix_expression);
6562 }
6563 else
6565 }
6569 /* Look for the closing `]'. */
6572 /* Build the ARRAY_REF. */
6576 /* When not doing offsetof, array references are not permitted in
6577 constant-expressions. */
6583 }
6585 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6586 by cp_parser_builtin_offsetof. We're looking for
6588 postfix-expression . template [opt] id-expression
6589 postfix-expression . pseudo-destructor-name
6590 postfix-expression -> template [opt] id-expression
6591 postfix-expression -> pseudo-destructor-name
6593 FOR_OFFSETOF is set if we're being called in that context. That sorta
6594 limits what of the above we'll actually accept, but nevermind.
6595 TOKEN_TYPE is the "." or "->" token, which will already have been
6596 removed from the stream. */
6598 static tree
6601 tree postfix_expression,
6603 location_t location)
6604 {
6605 tree name;
6610 /* If this is a `->' operator, dereference the pointer. */
6613 tf_warning_or_error);
6614 /* Check to see whether or not the expression is type-dependent. */
6616 /* The identifier following the `->' or `.' is not qualified. */
6622 /* Enter the scope corresponding to the type of the object
6623 given by the POSTFIX_EXPRESSION. */
6625 {
6627 /* According to the standard, no expression should ever have
6628 reference type. Unfortunately, we do not currently match
6629 the standard in this respect in that our internal representation
6630 of an expression may have reference type even when the standard
6631 says it does not. Therefore, we have to manually obtain the
6632 underlying type here. */
6634 /* The type of the POSTFIX_EXPRESSION must be complete. */
6636 {
6638 postfix_expression);
6640 }
6641 /* Unlike the object expression in other contexts, *this is not
6642 required to be of complete type for purposes of class member
6643 access (5.2.5) outside the member function body. */
6647 /* Let the name lookup machinery know that we are processing a
6648 class member access expression. */
6650 /* If something went wrong, we want to be able to discern that case,
6651 as opposed to the case where there was no SCOPE due to the type
6652 of expression being dependent. */
6655 /* If the SCOPE was erroneous, make the various semantic analysis
6656 functions exit quickly -- and without issuing additional error
6657 messages. */
6660 }
6662 /* Assume this expression is not a pseudo-destructor access. */
6665 /* If the SCOPE is a scalar type, then, if this is a valid program,
6666 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6667 is type dependent, it can be pseudo-destructor-name or something else.
6668 Try to parse it as pseudo-destructor-name first. */
6670 {
6671 tree s;
6672 tree type;
6675 /* Parse the pseudo-destructor-name. */
6684 {
6686 postfix_expression
6689 }
6690 }
6693 {
6694 /* If the SCOPE is not a scalar type, we are looking at an
6695 ordinary class member access expression, rather than a
6696 pseudo-destructor-name. */
6699 /* Parse the id-expression. */
6700 name = (cp_parser_id_expression
6707 /* In general, build a SCOPE_REF if the member name is qualified.
6708 However, if the name was not dependent and has already been
6709 resolved; there is no need to build the SCOPE_REF. For example;
6711 struct X { void f(); };
6712 template <typename T> void f(T* t) { t->X::f(); }
6714 Even though "t" is dependent, "X::f" is not and has been resolved
6715 to a BASELINK; there is no need to include scope information. */
6717 /* But we do need to remember that there was an explicit scope for
6718 virtual function calls. */
6722 /* If the name is a template-id that names a type, we will get a
6723 TYPE_DECL here. That is invalid code. */
6725 {
6728 }
6729 else
6730 {
6732 {
6734 {
6738 }
6739 else
6742 name,
6743 template_p);
6747 }
6749 adjust_result_of_qualified_name_lookup
6751 postfix_expression
6753 template_p,
6754 tf_warning_or_error);
6755 }
6756 }
6758 /* We no longer need to look up names in the scope of the object on
6759 the left-hand side of the `.' or `->' operator. */
6762 /* Outside of offsetof, these operators may not appear in
6763 constant-expressions. */
6765 && (cp_parser_non_integral_constant_expression
6770 }
6772 /* Cache of LITERAL_ZERO_P constants. */
6776 /* Parse a parenthesized expression-list.
6778 expression-list:
6779 assignment-expression
6780 expression-list, assignment-expression
6782 attribute-list:
6783 expression-list
6784 identifier
6785 identifier, expression-list
6787 CAST_P is true if this expression is the target of a cast.
6789 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6790 argument pack.
6792 Returns a vector of trees. Each element is a representation of an
6793 assignment-expression. NULL is returned if the ( and or ) are
6794 missing. An empty, but allocated, vector is returned on no
6795 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6796 if we are parsing an attribute list for an attribute that wants a
6797 plain identifier argument, normal_attr for an attribute that wants
6798 an expression, or non_attr if we aren't parsing an attribute list. If
6799 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6800 not all of the expressions in the list were constant.
6801 WANT_LITERAL_ZERO_P is true if the caller is interested in
6802 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6803 immediately, this can be removed. */
6812 {
6818 /* Assume all the expressions will be constant. */
6827 /* Within a parenthesized expression, a `>' token is always
6828 the greater-than operator. */
6829 saved_greater_than_is_operator_p
6833 /* Consume expressions until there are no more. */
6836 {
6837 tree expr;
6839 /* At the beginning of attribute lists, check to see if the
6840 next token is an identifier. */
6843 {
6846 /* Consume the identifier. */
6848 /* Save the identifier. */
6850 }
6851 else
6852 {
6855 /* Parse the next assignment-expression. */
6857 {
6858 /* A braced-init-list. */
6864 }
6866 {
6867 expr = (cp_parser_constant_expression
6872 }
6873 else
6874 {
6878 {
6884 /* If a parameter is literal zero alone, remember it
6885 for -Wmemset-transposed-args warning. */
6888 && want_literal_zero_p
6890 == CPP_COMMA
6893 {
6900 else
6901 {
6906 }
6907 /* Consume the 0 token (or '\0', 0LL etc.). */
6909 }
6913 }
6916 cast_p);
6917 }
6922 /* If we have an ellipsis, then this is an expression
6923 expansion. */
6926 {
6927 /* Consume the `...'. */
6930 /* Build the argument pack. */
6932 }
6934 /* Add it to the list. We add error_mark_node
6935 expressions to the list, so that we can still tell if
6936 the correct form for a parenthesized expression-list
6937 is found. That gives better errors. */
6942 }
6944 /* After the first item, attribute lists look the same as
6945 expression lists. */
6948 get_comma:;
6949 /* If the next token isn't a `,', then we are done. */
6953 /* Otherwise, consume the `,' and keep going. */
6955 }
6958 {
6961 skip_comma:;
6962 /* We try and resync to an unnested comma, as that will give the
6963 user better diagnostics. */
6971 {
6972 parser->greater_than_is_operator_p
6975 }
6976 }
6978 parser->greater_than_is_operator_p
6985 }
6987 /* Parse a pseudo-destructor-name.
6989 pseudo-destructor-name:
6990 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6991 :: [opt] nested-name-specifier template template-id :: ~ type-name
6992 :: [opt] nested-name-specifier [opt] ~ type-name
6994 If either of the first two productions is used, sets *SCOPE to the
6995 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6996 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6997 or ERROR_MARK_NODE if the parse fails. */
6999 static void
7001 tree object,
7004 {
7007 /* Handle ~auto. */
7011 {
7014 "%<~auto%> only available with "
7021 }
7023 /* Assume that things will not work out. */
7026 /* Look for the optional `::' operator. */
7028 /* Look for the optional nested-name-specifier. */
7029 nested_name_specifier_p
7036 /* Now, if we saw a nested-name-specifier, we might be doing the
7037 second production. */
7040 {
7041 /* Consume the `template' keyword. */
7043 /* Parse the template-id. */
7047 class_type,
7049 /* Look for the `::' token. */
7051 }
7052 /* If the next token is not a `~', then there might be some
7053 additional qualification. */
7055 {
7056 /* At this point, we're looking for "type-name :: ~". The type-name
7057 must not be a class-name, since this is a pseudo-destructor. So,
7058 it must be either an enum-name, or a typedef-name -- both of which
7059 are just identifiers. So, we peek ahead to check that the "::"
7060 and "~" tokens are present; if they are not, then we can avoid
7061 calling type_name. */
7065 {
7068 }
7070 /* Look for the type-name. */
7075 /* Look for the `::' token. */
7077 }
7078 else
7081 /* Look for the `~'. */
7084 /* Once we see the ~, this has to be a pseudo-destructor. */
7088 /* Look for the type-name again. We are not responsible for
7089 checking that it matches the first type-name. */
7091 }
7093 /* Parse a unary-expression.
7095 unary-expression:
7096 postfix-expression
7097 ++ cast-expression
7098 -- cast-expression
7099 unary-operator cast-expression
7100 sizeof unary-expression
7101 sizeof ( type-id )
7102 alignof ( type-id ) [C++0x]
7103 new-expression
7104 delete-expression
7106 GNU Extensions:
7108 unary-expression:
7109 __extension__ cast-expression
7110 __alignof__ unary-expression
7111 __alignof__ ( type-id )
7112 alignof unary-expression [C++0x]
7113 __real__ cast-expression
7114 __imag__ cast-expression
7115 && identifier
7116 sizeof ( type-id ) { initializer-list , [opt] }
7117 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7118 __alignof__ ( type-id ) { initializer-list , [opt] }
7120 ADDRESS_P is true iff the unary-expression is appearing as the
7121 operand of the `&' operator. CAST_P is true if this expression is
7122 the target of a cast.
7124 Returns a representation of the expression. */
7126 static tree
7129 {
7133 /* Peek at the next token. */
7135 /* Some keywords give away the kind of expression. */
7137 {
7141 {
7144 {
7147 location_t first_loc;
7150 /* Consume the token. */
7153 /* Parse the operand. */
7158 else
7159 {
7160 /* ISO C++ defines alignof only with types, not with
7161 expressions. So pedwarn if alignof is used with a non-
7162 type expression. However, __alignof__ is ok. */
7165 "ISO C++ does not allow %<alignof%> "
7169 }
7170 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7171 SIZEOF_EXPR with the original operand. */
7173 {
7175 {
7177 {
7180 error_mark_node));
7182 }
7183 else
7187 }
7189 }
7191 }
7200 {
7201 /* The saved value of the PEDANTIC flag. */
7203 tree expr;
7205 /* Save away the PEDANTIC flag. */
7207 /* Parse the cast-expression. */
7209 /* Restore the PEDANTIC flag. */
7213 }
7217 {
7218 tree expression;
7220 /* Consume the `__real__' or `__imag__' token. */
7222 /* Parse the cast-expression. */
7224 /* Create the complete representation. */
7228 expression,
7229 tf_warning_or_error);
7230 }
7238 {
7239 tree expr;
7249 parser->type_definition_forbidden_message
7252 saved_integral_constant_expression_p
7254 saved_non_integral_constant_expression_p
7258 saved_greater_than_is_operator_p
7270 parser->greater_than_is_operator_p
7273 parser->integral_constant_expression_p
7275 parser->non_integral_constant_expression_p
7282 }
7286 }
7287 }
7289 /* Look for the `:: new' and `:: delete', which also signal the
7290 beginning of a new-expression, or delete-expression,
7291 respectively. If the next token is `::', then it might be one of
7292 these. */
7294 {
7297 /* See if the token after the `::' is one of the keywords in
7298 which we're interested. */
7300 /* If it's `new', we have a new-expression. */
7303 /* Similarly, for `delete'. */
7306 }
7308 /* Look for a unary operator. */
7310 /* The `++' and `--' operators can be handled similarly, even though
7311 they are not technically unary-operators in the grammar. */
7313 {
7318 /* Handle the GNU address-of-label extension. */
7321 {
7322 tree identifier;
7323 tree expression;
7326 /* Consume the '&&' token. */
7328 /* Look for the identifier. */
7330 /* Create an expression representing the address. */
7333 NIC_ADDR_LABEL))
7336 }
7337 }
7339 {
7340 tree cast_expression;
7346 /* Consume the operator token. */
7348 /* Parse the cast-expression. */
7349 cast_expression
7354 pidk);
7355 /* Now, build an appropriate representation. */
7357 {
7361 RO_UNARY_STAR,
7362 complain);
7367 /* Fall through. */
7370 cast_expression,
7371 complain);
7378 /* Fall through. */
7388 }
7392 non_constant_p))
7396 }
7400 decltype_p,
7401 pidk);
7402 }
7404 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7405 unary-operator, the corresponding tree code is returned. */
7407 static enum tree_code
7409 {
7411 {
7432 }
7433 }
7435 /* Parse a new-expression.
7437 new-expression:
7438 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7439 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7441 Returns a representation of the expression. */
7443 static tree
7445 {
7448 tree type;
7451 tree ret;
7453 /* Look for the optional `::' operator. */
7454 global_scope_p
7458 /* Look for the `new' operator. */
7460 /* There's no easy way to tell a new-placement from the
7461 `( type-id )' construct. */
7463 /* Look for a new-placement. */
7465 /* If that didn't work out, there's no new-placement. */
7467 {
7471 }
7473 /* If the next token is a `(', then we have a parenthesized
7474 type-id. */
7476 {
7480 /* Consume the `('. */
7483 /* Parse the type-id. */
7484 parser->type_definition_forbidden_message
7489 /* Look for the closing `)'. */
7492 /* There should not be a direct-new-declarator in this production,
7493 but GCC used to allowed this, so we check and emit a sensible error
7494 message for this case. */
7496 {
7502 }
7503 }
7504 /* Otherwise, there must be a new-type-id. */
7505 else
7508 /* If the next token is a `(' or '{', then we have a new-initializer. */
7512 else
7515 /* A new-expression may not appear in an integral constant
7516 expression. */
7519 else
7520 {
7521 /* Create a representation of the new-expression. */
7523 tf_warning_or_error);
7524 }
7532 }
7534 /* Parse a new-placement.
7536 new-placement:
7537 ( expression-list )
7539 Returns the same representation as for an expression-list. */
7543 {
7546 /* Parse the expression-list. */
7547 expression_list = (cp_parser_parenthesized_expression_list
7553 }
7555 /* Parse a new-type-id.
7557 new-type-id:
7558 type-specifier-seq new-declarator [opt]
7560 Returns the TYPE allocated. If the new-type-id indicates an array
7561 type, *NELTS is set to the number of elements in the last array
7562 bound; the TYPE will not include the last array bound. */
7564 static tree
7566 {
7567 cp_decl_specifier_seq type_specifier_seq;
7573 /* The type-specifier sequence must not contain type definitions.
7574 (It cannot contain declarations of new types either, but if they
7575 are not definitions we will catch that because they are not
7576 complete.) */
7578 parser->type_definition_forbidden_message
7580 /* Parse the type-specifier-seq. */
7584 /* Restore the old message. */
7590 /* Parse the new-declarator. */
7593 /* Determine the number of elements in the last array dimension, if
7594 any. */
7596 /* Skip down to the last array dimension. */
7601 {
7604 }
7609 {
7612 }
7615 {
7622 else
7624 }
7627 }
7629 /* Parse an (optional) new-declarator.
7631 new-declarator:
7632 ptr-operator new-declarator [opt]
7633 direct-new-declarator
7635 Returns the declarator. */
7639 {
7642 cp_cv_quals cv_quals;
7644 /* We don't know if there's a ptr-operator next, or not. */
7646 /* Look for a ptr-operator. */
7648 /* If that worked, look for more new-declarators. */
7650 {
7653 /* Parse another optional declarator. */
7656 declarator = cp_parser_make_indirect_declarator
7660 }
7662 /* If the next token is a `[', there is a direct-new-declarator. */
7667 }
7669 /* Parse a direct-new-declarator.
7671 direct-new-declarator:
7672 [ expression ]
7673 direct-new-declarator [constant-expression]
7675 */
7679 {
7683 {
7684 tree expression;
7687 /* Look for the opening `['. */
7692 /* The standard requires that the expression have integral
7693 type. DR 74 adds enumeration types. We believe that the
7694 real intent is that these expressions be handled like the
7695 expression in a `switch' condition, which also allows
7696 classes with a single conversion to integral or
7697 enumeration type. */
7699 {
7700 expression
7702 expression,
7705 {
7707 "expression in new-declarator must have integral "
7710 }
7711 }
7713 /* Look for the closing `]'. */
7716 /* Add this bound to the declarator. */
7719 /* If the next token is not a `[', then there are no more
7720 bounds. */
7723 }
7726 }
7728 /* Parse a new-initializer.
7730 new-initializer:
7731 ( expression-list [opt] )
7732 braced-init-list
7734 Returns a representation of the expression-list. */
7738 {
7742 {
7743 tree t;
7750 }
7751 else
7752 expression_list = (cp_parser_parenthesized_expression_list
7758 }
7760 /* Parse a delete-expression.
7762 delete-expression:
7763 :: [opt] delete cast-expression
7764 :: [opt] delete [ ] cast-expression
7766 Returns a representation of the expression. */
7768 static tree
7770 {
7773 tree expression;
7775 /* Look for the optional `::' operator. */
7776 global_scope_p
7780 /* Look for the `delete' keyword. */
7782 /* See if the array syntax is in use. */
7784 {
7785 /* Consume the `[' token. */
7787 /* Look for the `]' token. */
7789 /* Remember that this is the `[]' construct. */
7791 }
7792 else
7795 /* Parse the cast-expression. */
7798 /* A delete-expression may not appear in an integral constant
7799 expression. */
7804 tf_warning_or_error);
7805 }
7807 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7808 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7809 0 otherwise. */
7811 static int
7813 {
7816 {
7858 /* In ((type ()) () the last () isn't a valid cast-expression,
7859 so the whole must be parsed as postfix-expression. */
7864 /* '[' may start a primary-expression in obj-c++ and in C++11,
7865 as a lambda-expression, eg, '(void)[]{}'. */
7872 /* '++' and '--' may or may not start a cast-expression:
7874 struct T { void operator++(int); };
7875 void f() { (T())++; }
7877 vs
7879 int a;
7880 (int)++a; */
7885 }
7886 }
7888 /* Parse a cast-expression.
7890 cast-expression:
7891 unary-expression
7892 ( type-id ) cast-expression
7894 ADDRESS_P is true iff the unary-expression is appearing as the
7895 operand of the `&' operator. CAST_P is true if this expression is
7896 the target of a cast.
7898 Returns a representation of the expression. */
7900 static tree
7903 {
7904 /* If it's a `(', then we might be looking at a cast. */
7906 {
7912 /* There's no way to know yet whether or not this is a cast.
7913 For example, `(int (3))' is a unary-expression, while `(int)
7914 3' is a cast. So, we resort to parsing tentatively. */
7916 /* Types may not be defined in a cast. */
7918 parser->type_definition_forbidden_message
7920 /* Consume the `('. */
7922 /* A very tricky bit is that `(struct S) { 3 }' is a
7923 compound-literal (which we permit in C++ as an extension).
7924 But, that construct is not a cast-expression -- it is a
7925 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7926 is legal; if the compound-literal were a cast-expression,
7927 you'd need an extra set of parentheses.) But, if we parse
7928 the type-id, and it happens to be a class-specifier, then we
7929 will commit to the parse at that point, because we cannot
7930 undo the action that is done when creating a new class. So,
7931 then we cannot back up and do a postfix-expression.
7933 Another tricky case is the following (c++/29234):
7935 struct S { void operator () (); };
7937 void foo ()
7938 {
7939 ( S()() );
7940 }
7942 As a type-id we parse the parenthesized S()() as a function
7943 returning a function, groktypename complains and we cannot
7944 back up in this case either.
7946 Therefore, we scan ahead to the closing `)', and check to see
7947 if the tokens after the `)' can start a cast-expression. Otherwise
7948 we are dealing with an unary-expression, a postfix-expression
7949 or something else.
7951 Yet another tricky case, in C++11, is the following (c++/54891):
7953 (void)[]{};
7955 The issue is that usually, besides the case of lambda-expressions,
7956 the parenthesized type-id cannot be followed by '[', and, eg, we
7957 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7958 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7959 we don't commit, we try a cast-expression, then an unary-expression.
7961 Save tokens so that we can put them back. */
7964 /* We may be looking at a cast-expression. */
7967 cast_expression
7970 /* Roll back the tokens we skipped. */
7972 /* If we aren't looking at a cast-expression, simulate an error so
7973 that the call to cp_parser_error_occurred below returns true. */
7976 else
7977 {
7980 /* Look for the type-id. */
7982 /* Look for the closing `)'. */
7985 }
7987 /* Restore the saved message. */
7990 /* At this point this can only be either a cast or a
7991 parenthesized ctor such as `(T ())' that looks like a cast to
7992 function returning T. */
7994 {
7995 /* Only commit if the cast-expression doesn't start with
7996 '++', '--', or '[' in C++11. */
8004 pidk);
8007 {
8008 /* Warn about old-style casts, if so requested. */
8015 /* Only type conversions to integral or enumeration types
8016 can be used in constant-expressions. */
8019 NIC_CAST))
8022 /* Perform the cast. */
8025 }
8026 }
8027 else
8029 }
8031 /* If we get here, then it's not a cast, so it must be a
8032 unary-expression. */
8035 }
8037 /* Parse a binary expression of the general form:
8039 pm-expression:
8040 cast-expression
8041 pm-expression .* cast-expression
8042 pm-expression ->* cast-expression
8044 multiplicative-expression:
8045 pm-expression
8046 multiplicative-expression * pm-expression
8047 multiplicative-expression / pm-expression
8048 multiplicative-expression % pm-expression
8050 additive-expression:
8051 multiplicative-expression
8052 additive-expression + multiplicative-expression
8053 additive-expression - multiplicative-expression
8055 shift-expression:
8056 additive-expression
8057 shift-expression << additive-expression
8058 shift-expression >> additive-expression
8060 relational-expression:
8061 shift-expression
8062 relational-expression < shift-expression
8063 relational-expression > shift-expression
8064 relational-expression <= shift-expression
8065 relational-expression >= shift-expression
8067 GNU Extension:
8069 relational-expression:
8070 relational-expression <? shift-expression
8071 relational-expression >? shift-expression
8073 equality-expression:
8074 relational-expression
8075 equality-expression == relational-expression
8076 equality-expression != relational-expression
8078 and-expression:
8079 equality-expression
8080 and-expression & equality-expression
8082 exclusive-or-expression:
8083 and-expression
8084 exclusive-or-expression ^ and-expression
8086 inclusive-or-expression:
8087 exclusive-or-expression
8088 inclusive-or-expression | exclusive-or-expression
8090 logical-and-expression:
8091 inclusive-or-expression
8092 logical-and-expression && inclusive-or-expression
8094 logical-or-expression:
8095 logical-and-expression
8096 logical-or-expression || logical-and-expression
8098 All these are implemented with a single function like:
8100 binary-expression:
8101 simple-cast-expression
8102 binary-expression <token> binary-expression
8104 CAST_P is true if this expression is the target of a cast.
8106 The binops_by_token map is used to get the tree codes for each <token> type.
8107 binary-expressions are associated according to a precedence table. */
8109 #define TOKEN_PRECEDENCE(token) \
8110 (((token->type == CPP_GREATER \
8111 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8112 && !parser->greater_than_is_operator_p) \
8113 ? PREC_NOT_OPERATOR \
8114 : binops_by_token[token->type].prec)
8116 static tree
8122 {
8123 cp_parser_expression_stack stack;
8125 cp_parser_expression_stack_entry current;
8126 tree rhs;
8130 tree overload;
8132 /* Parse the first expression. */
8143 {
8144 /* Get an operator token. */
8150 {
8152 "%<>>%> operator is treated"
8156 }
8160 /* Popping an entry off the stack means we completed a subexpression:
8161 - either we found a token which is not an operator (`>' where it is not
8162 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8163 will happen repeatedly;
8164 - or, we found an operator which has lower priority. This is the case
8165 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8166 parsing `3 * 4'. */
8168 {
8171 else
8173 }
8175 get_rhs:
8179 /* We used the operator token. */
8182 /* For "false && x" or "true || x", x will never be executed;
8183 disable warnings while evaluating it. */
8189 /* Extract another operand. It may be the RHS of this expression
8190 or the LHS of a new, higher priority expression. */
8195 /* Get another operator token. Look up its precedence to avoid
8196 building a useless (immediately popped) stack entry for common
8197 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8201 {
8202 /* ... and prepare to parse the RHS of the new, higher priority
8203 expression. Since precedence levels on the stack are
8204 monotonically increasing, we do not have to care about
8205 stack overflows. */
8214 pop:
8216 /* If the stack is not empty, we have parsed into LHS the right side
8217 (`4' in the example above) of an expression we had suspended.
8218 We can use the information on the stack to recover the LHS (`3')
8219 from the stack together with the tree code (`MULT_EXPR'), and
8220 the precedence of the higher level subexpression
8221 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8222 which will be used to actually build the additive expression. */
8227 }
8229 /* Undo the disabling of warnings done above. */
8240 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8241 ERROR_MARK for everything that is not a binary expression.
8242 This makes warn_about_parentheses miss some warnings that
8243 involve unary operators. For unary expressions we should
8244 pass the correct tree_code unless the unary expression was
8245 surrounded by parentheses.
8246 */
8252 == tcc_comparison
8255 else
8264 /* If the binary operator required the use of an overloaded operator,
8265 then this expression cannot be an integral constant-expression.
8266 An overloaded operator can be used even if both operands are
8267 otherwise permissible in an integral constant-expression if at
8268 least one of the operands is of enumeration type. */
8272 NIC_OVERLOADED))
8274 }
8277 }
8279 static tree
8284 {
8287 }
8289 /* Parse the `? expression : assignment-expression' part of a
8290 conditional-expression. The LOGICAL_OR_EXPR is the
8291 logical-or-expression that started the conditional-expression.
8292 Returns a representation of the entire conditional-expression.
8294 This routine is used by cp_parser_assignment_expression.
8296 ? expression : assignment-expression
8298 GNU Extensions:
8300 ? : assignment-expression */
8302 static tree
8304 {
8305 tree expr;
8306 tree assignment_expr;
8310 /* Consume the `?' token. */
8315 {
8318 /* Implicit true clause. */
8322 }
8323 else
8324 {
8327 /* Parse the expression. */
8330 c_inhibit_evaluation_warnings +=
8334 }
8336 /* The next token should be a `:'. */
8338 /* Parse the assignment-expression. */
8342 /* Build the conditional-expression. */
8344 expr,
8345 assignment_expr,
8346 tf_warning_or_error);
8347 }
8349 /* Parse an assignment-expression.
8351 assignment-expression:
8352 conditional-expression
8353 logical-or-expression assignment-operator assignment_expression
8354 throw-expression
8356 CAST_P is true if this expression is the target of a cast.
8357 DECLTYPE_P is true if this expression is the operand of decltype.
8359 Returns a representation for the expression. */
8361 static tree
8364 {
8365 tree expr;
8367 /* If the next token is the `throw' keyword, then we're looking at
8368 a throw-expression. */
8371 /* Otherwise, it must be that we are looking at a
8372 logical-or-expression. */
8373 else
8374 {
8375 /* Parse the binary expressions (logical-or-expression). */
8377 decltype_p,
8379 /* If the next token is a `?' then we're actually looking at a
8380 conditional-expression. */
8383 else
8384 {
8387 /* If it's an assignment-operator, we're using the second
8388 production. */
8389 enum tree_code assignment_operator
8392 {
8394 location_t saved_input_location;
8396 /* Parse the right-hand side of the assignment. */
8402 /* An assignment may not appear in a
8403 constant-expression. */
8405 NIC_ASSIGNMENT))
8407 /* Build the assignment expression. Its default
8408 location is the location of the '=' token. */
8412 assignment_operator,
8413 rhs,
8416 }
8417 }
8418 }
8421 }
8423 /* Parse an (optional) assignment-operator.
8425 assignment-operator: one of
8426 = *= /= %= += -= >>= <<= &= ^= |=
8428 GNU Extension:
8430 assignment-operator: one of
8431 <?= >?=
8433 If the next token is an assignment operator, the corresponding tree
8434 code is returned, and the token is consumed. For example, for
8435 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8436 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8437 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8438 operator, ERROR_MARK is returned. */
8440 static enum tree_code
8442 {
8446 /* Peek at the next token. */
8450 {
8496 /* Nothing else is an assignment operator. */
8498 }
8500 /* If it was an assignment operator, consume it. */
8505 }
8507 /* Parse an expression.
8509 expression:
8510 assignment-expression
8511 expression , assignment-expression
8513 CAST_P is true if this expression is the target of a cast.
8514 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8515 except possibly parenthesized or on the RHS of a comma (N3276).
8517 Returns a representation of the expression. */
8519 static tree
8522 {
8527 {
8528 tree assignment_expression;
8530 /* Parse the next assignment-expression. */
8531 assignment_expression
8534 /* We don't create a temporary for a call that is the immediate operand
8535 of decltype or on the RHS of a comma. But when we see a comma, we
8536 need to create a temporary for a call on the LHS. */
8541 assignment_expression
8545 /* If this is the first assignment-expression, we can just
8546 save it away. */
8549 else
8551 assignment_expression,
8553 /* If the next token is not a comma, then we are done with the
8554 expression. */
8557 /* Consume the `,'. */
8560 /* A comma operator cannot appear in a constant-expression. */
8563 }
8566 }
8568 /* Parse a constant-expression.
8570 constant-expression:
8571 conditional-expression
8573 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8574 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8575 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8576 is false, NON_CONSTANT_P should be NULL. */
8578 static tree
8582 {
8586 tree expression;
8588 /* It might seem that we could simply parse the
8589 conditional-expression, and then check to see if it were
8590 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8591 one that the compiler can figure out is constant, possibly after
8592 doing some simplifications or optimizations. The standard has a
8593 precise definition of constant-expression, and we must honor
8594 that, even though it is somewhat more restrictive.
8596 For example:
8598 int i[(2, 3)];
8600 is not a legal declaration, because `(2, 3)' is not a
8601 constant-expression. The `,' operator is forbidden in a
8602 constant-expression. However, GCC's constant-folding machinery
8603 will fold this operation to an INTEGER_CST for `3'. */
8605 /* Save the old settings. */
8607 saved_allow_non_integral_constant_expression_p
8610 /* We are now parsing a constant-expression. */
8612 parser->allow_non_integral_constant_expression_p
8615 /* Although the grammar says "conditional-expression", we parse an
8616 "assignment-expression", which also permits "throw-expression"
8617 and the use of assignment operators. In the case that
8618 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8619 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8620 actually essential that we look for an assignment-expression.
8621 For example, cp_parser_initializer_clauses uses this function to
8622 determine whether a particular assignment-expression is in fact
8623 constant. */
8625 /* Restore the old settings. */
8626 parser->integral_constant_expression_p
8628 parser->allow_non_integral_constant_expression_p
8631 {
8632 /* Require an rvalue constant expression here; that's what our
8633 callers expect. Reference constant expressions are handled
8634 separately in e.g. cp_parser_template_argument. */
8639 }
8642 parser->non_integral_constant_expression_p
8646 }
8648 /* Parse __builtin_offsetof.
8650 offsetof-expression:
8651 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8653 offsetof-member-designator:
8654 id-expression
8655 | offsetof-member-designator "." id-expression
8656 | offsetof-member-designator "[" expression "]"
8657 | offsetof-member-designator "->" id-expression */
8659 static tree
8661 {
8664 cp_id_kind dummy;
8667 /* We're about to accept non-integral-constant things, but will
8668 definitely yield an integral constant expression. Save and
8669 restore these values around our local parsing. */
8673 /* Consume the "__builtin_offsetof" token. */
8675 /* Consume the opening `('. */
8677 /* Parse the type-id. */
8680 /* Look for the `,'. */
8684 /* Build the (type *)null that begins the traditional offsetof macro. */
8686 tf_warning_or_error);
8688 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8692 {
8695 {
8697 /* offsetof-member-designator "[" expression "]" */
8703 /* offsetof-member-designator "->" identifier */
8706 /* FALLTHRU */
8709 /* offsetof-member-designator "." identifier */
8717 /* Consume the ")" token. */
8722 /* Error. We know the following require will fail, but
8723 that gives the proper error message. */
8728 }
8729 }
8731 success:
8732 /* If we're processing a template, we can't finish the semantics yet.
8733 Otherwise we can fold the entire expression now. */
8735 {
8738 }
8739 else
8742 failure:
8747 }
8749 /* Parse a trait expression.
8751 Returns a representation of the expression, the underlying type
8752 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8754 static tree
8756 {
8757 cp_trait_kind kind;
8763 {
8847 }
8849 /* Consume the token. */
8860 {
8867 }
8869 {
8871 {
8875 {
8878 }
8882 }
8883 }
8887 /* Complete the trait expression, which may mean either processing
8888 the trait expr now or saving it for template instantiation. */
8890 {
8899 }
8900 }
8902 /* Lambdas that appear in variable initializer or default argument scope
8903 get that in their mangling, so we need to record it. We might as well
8904 use the count for function and namespace scopes as well. */
8908 {
8909 tree t;
8914 static void
8916 {
8917 tree_int ti;
8919 /* Once we're inside a function, we ignore other scopes and just push
8920 the function again so that popping works properly. */
8927 {
8928 /* Don't reset the count if we're still in the same function. */
8931 }
8932 }
8934 static void
8936 {
8939 }
8941 static void
8943 {
8946 {
8949 }
8951 }
8953 /* Parse a lambda expression.
8955 lambda-expression:
8956 lambda-introducer lambda-declarator [opt] compound-statement
8958 Returns a representation of the expression. */
8960 static tree
8962 {
8964 tree type;
8972 {
8974 {
8978 }
8980 }
8982 {
8984 {
8987 }
8989 }
8991 /* We may be in the middle of deferred access check. Disable
8992 it now. */
9003 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9006 /* Now that we've started the type, add the capture fields for any
9007 explicit captures. */
9010 {
9011 /* Inside the class, surrounding template-parameter-lists do not apply. */
9012 unsigned int saved_num_template_parameter_lists
9016 bool fully_implicit_function_template_p
9020 bool auto_is_implicit_function_template_parm_p
9031 /* By virtue of defining a local class, a lambda expression has access to
9032 the private variables of enclosing classes. */
9037 {
9043 }
9045 {
9048 }
9050 /* The capture list was built up in reverse order; fix that now. */
9062 parser->fully_implicit_function_template_p
9066 parser->auto_is_implicit_function_template_parm_p
9068 }
9072 /* This field is only used during parsing of the lambda. */
9075 /* This lambda shouldn't have any proxies left at this point. */
9077 /* And now that we're done, push proxies for an enclosing lambda. */
9082 else
9088 }
9090 /* Parse the beginning of a lambda expression.
9092 lambda-introducer:
9093 [ lambda-capture [opt] ]
9095 LAMBDA_EXPR is the current representation of the lambda expression. */
9097 static void
9099 {
9100 /* Need commas after the first capture. */
9103 /* Eat the leading `['. */
9106 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9114 {
9117 }
9120 {
9122 tree capture_id;
9123 tree capture_init_expr;
9127 enum capture_kind_type
9128 {
9129 BY_COPY,
9130 BY_REFERENCE
9131 };
9135 {
9138 }
9142 else
9145 /* Possibly capture `this'. */
9147 {
9157 explicit_init_p);
9159 }
9161 /* Remember whether we want to capture as a reference or not. */
9163 {
9166 }
9168 /* Get the identifier. */
9173 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9174 delimiters, but I modified this to stop on unnested ']' as well. It
9175 was already changed to stop on unnested '}', so the
9176 "closing_parenthesis" name is no more misleading with my change. */
9177 {
9183 }
9185 /* Find the initializer for this capture. */
9189 {
9191 /* An explicit initializer exists. */
9194 "lambda capture initializers "
9200 {
9203 }
9204 }
9205 else
9206 {
9209 /* Turn the identifier into an id-expression. */
9210 capture_init_expr
9215 {
9218 }
9222 {
9225 capture_init_expr);
9228 }
9231 {
9234 capture_init_expr))
9237 }
9239 capture_init_expr
9240 = finish_id_expression
9242 capture_init_expr,
9256 {
9259 }
9260 else
9262 }
9266 {
9271 capture_id);
9275 "capture of %qD redundant with by-reference capture "
9277 }
9280 capture_id,
9281 capture_init_expr,
9283 explicit_init_p);
9284 }
9287 }
9289 /* Parse the (optional) middle of a lambda expression.
9291 lambda-declarator:
9292 < template-parameter-list [opt] >
9293 ( parameter-declaration-clause [opt] )
9294 attribute-specifier [opt]
9295 mutable [opt]
9296 exception-specification [opt]
9297 lambda-return-type-clause [opt]
9299 LAMBDA_EXPR is the current representation of the lambda expression. */
9301 static bool
9303 {
9304 /* 5.1.1.4 of the standard says:
9305 If a lambda-expression does not include a lambda-declarator, it is as if
9306 the lambda-declarator were ().
9307 This means an empty parameter list, no attributes, and no exception
9308 specification. */
9314 /* The template-parameter-list is optional, but must begin with
9315 an opening angle if present. */
9317 {
9320 "lambda templates are only available with "
9329 /* We just processed one more parameter list. */
9331 }
9333 /* The parameter-declaration-clause is optional (unless
9334 template-parameter-list was given), but must begin with an
9335 opening parenthesis if present. */
9337 {
9342 /* Parse parameters. */
9345 /* Default arguments shall not be specified in the
9346 parameter-declaration-clause of a lambda-declarator. */
9356 /* Parse optional `mutable' keyword. */
9358 {
9361 }
9363 /* Parse optional exception specification. */
9366 /* Parse optional trailing return type. */
9368 {
9372 }
9374 /* The function parameters must be in scope all the way until after the
9375 trailing-return-type in case of decltype. */
9377 }
9381 /* Create the function call operator.
9383 Messing with declarators like this is no uglier than building up the
9384 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9385 other code. */
9386 {
9387 cp_decl_specifier_seq return_type_specs;
9389 tree fco;
9396 else
9397 /* Maybe we will deduce the return type later. */
9403 sfk_none);
9408 VIRT_SPEC_UNSPECIFIED,
9409 REF_QUAL_NONE,
9410 exception_spec,
9415 declarator,
9416 attributes);
9418 {
9421 /* Give the object parameter a different name. */
9425 }
9427 {
9431 }
9440 }
9441 }
9443 /* Parse the body of a lambda expression, which is simply
9445 compound-statement
9447 but which requires special handling.
9448 LAMBDA_EXPR is the current representation of the lambda expression. */
9450 static void
9452 {
9457 else
9458 /* Still increment function_depth so that we don't GC in the
9459 middle of an expression. */
9461 /* Clear this in case we're in the middle of a default argument. */
9464 /* Finish the function call operator
9465 - class_specifier
9466 + late_parsing_for_member
9467 + function_definition_after_declarator
9468 + ctor_initializer_opt_and_function_body */
9469 {
9471 tree body;
9473 tree compound_stmt;
9474 tree cap;
9476 /* Let the front end know that we are going to be defining this
9477 function. */
9479 NULL_TREE,
9488 /* Push the proxies for any explicit captures. */
9495 /* 5.1.1.4 of the standard says:
9496 If a lambda-expression does not include a trailing-return-type, it
9497 is as if the trailing-return-type denotes the following type:
9498 * if the compound-statement is of the form
9499 { return attribute-specifier [opt] expression ; }
9500 the type of the returned expression after lvalue-to-rvalue
9501 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9502 (_conv.array_ 4.2), and function-to-pointer conversion
9503 (_conv.func_ 4.3);
9504 * otherwise, void. */
9506 /* In a lambda that has neither a lambda-return-type-clause
9507 nor a deducible form, errors should be reported for return statements
9508 in the body. Since we used void as the placeholder return type, parsing
9509 the body as usual will give such desired behavior. */
9513 {
9517 /* Parse tentatively in case there's more after the initial return
9518 statement. */
9529 {
9533 /* Will get error here if type not deduced yet. */
9537 }
9538 }
9541 {
9546 }
9550 out:
9554 /* Finish the function and generate code for it if necessary. */
9557 /* Only expand if the call op is not a template. */
9560 }
9565 else
9567 }
9569 /* Statements [gram.stmt.stmt] */
9571 /* Parse a statement.
9573 statement:
9574 labeled-statement
9575 expression-statement
9576 compound-statement
9577 selection-statement
9578 iteration-statement
9579 jump-statement
9580 declaration-statement
9581 try-block
9583 C++11:
9585 statement:
9586 labeled-statement
9587 attribute-specifier-seq (opt) expression-statement
9588 attribute-specifier-seq (opt) compound-statement
9589 attribute-specifier-seq (opt) selection-statement
9590 attribute-specifier-seq (opt) iteration-statement
9591 attribute-specifier-seq (opt) jump-statement
9592 declaration-statement
9593 attribute-specifier-seq (opt) try-block
9595 TM Extension:
9597 statement:
9598 atomic-statement
9600 IN_COMPOUND is true when the statement is nested inside a
9601 cp_parser_compound_statement; this matters for certain pragmas.
9603 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9604 is a (possibly labeled) if statement which is not enclosed in braces
9605 and has an else clause. This is used to implement -Wparentheses. */
9607 static void
9610 {
9615 restart:
9618 /* There is no statement yet. */
9624 /* In obj-c++, seeing '[[' might be the either the beginning of
9625 c++11 attributes, or a nested objc-message-expression. So
9626 let's parse the c++11 attributes tentatively. */
9630 {
9633 }
9635 /* Peek at the next token. */
9637 /* Remember the location of the first token in the statement. */
9639 /* If this is a keyword, then that will often determine what kind of
9640 statement we have. */
9642 {
9646 {
9649 /* Looks like a labeled-statement with a case label.
9650 Parse the label, and then use tail recursion to parse
9651 the statement. */
9668 {
9673 }
9674 else
9688 {
9693 }
9694 else
9695 {
9699 }
9703 /* Objective-C++ exception-handling constructs. */
9717 /* This must be a namespace alias definition. */
9730 /* It might be a keyword like `int' that can start a
9731 declaration-statement. */
9733 }
9734 }
9736 {
9737 /* If the next token is a `:', then we are looking at a
9738 labeled-statement. */
9741 {
9742 /* Looks like a labeled-statement with an ordinary label.
9743 Parse the label, and then use tail recursion to parse
9744 the statement. */
9748 }
9749 }
9750 /* Anything that starts with a `{' must be a compound-statement. */
9753 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9754 a statement all its own. */
9756 {
9757 /* Only certain OpenMP pragmas are attached to statements, and thus
9758 are considered statements themselves. All others are not. In
9759 the context of a compound, accept the pragma as a "statement" and
9760 return so that we can check for a close brace. Otherwise we
9761 require a real statement and must go back and read one. */
9767 }
9769 {
9772 }
9774 /* Everything else must be a declaration-statement or an
9775 expression-statement. Try for the declaration-statement
9776 first, unless we are looking at a `;', in which case we know that
9777 we have an expression-statement. */
9779 {
9781 {
9783 {
9784 /* Attributes should be parsed as part of the the
9785 declaration, so let's un-parse them. */
9788 }
9791 /* Try to parse the declaration-statement. */
9793 /* If that worked, we're done. */
9796 }
9797 /* Look for an expression-statement instead. */
9799 }
9801 /* Set the line number for the statement. */
9805 /* Note that for now, we don't do anything with c++11 statements
9806 parsed at this level. */
9809 OPT_Wattributes,
9811 }
9813 /* Parse the label for a labeled-statement, i.e.
9815 identifier :
9816 case constant-expression :
9817 default :
9819 GNU Extension:
9820 case constant-expression ... constant-expression : statement
9822 When a label is parsed without errors, the label is added to the
9823 parse tree by the finish_* functions, so this function doesn't
9824 have to return the label. */
9826 static void
9828 {
9833 /* The next token should be an identifier. */
9837 {
9840 }
9844 {
9846 {
9850 /* Consume the `case' token. */
9852 /* Parse the constant-expression. */
9859 {
9860 /* Consume the `...' token. */
9866 /* We don't need to emit warnings here, as the common code
9867 will do this for us. */
9868 }
9869 else
9874 else
9877 expr);
9878 }
9882 /* Consume the `default' token. */
9887 else
9892 /* Anything else must be an ordinary label. */
9895 }
9897 /* Require the `:' token. */
9900 /* An ordinary label may optionally be followed by attributes.
9901 However, this is only permitted if the attributes are then
9902 followed by a semicolon. This is because, for backward
9903 compatibility, when parsing
9904 lab: __attribute__ ((unused)) int i;
9905 we want the attribute to attach to "i", not "lab". */
9908 {
9909 tree attrs;
9916 ;
9917 else
9919 }
9925 }
9927 /* Parse an expression-statement.
9929 expression-statement:
9930 expression [opt] ;
9932 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9933 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9934 indicates whether this expression-statement is part of an
9935 expression statement. */
9937 static tree
9939 {
9943 /* If the next token is a ';', then there is no expression
9944 statement. */
9946 {
9950 {
9953 }
9954 }
9956 /* Give a helpful message for "A<T>::type t;" and the like. */
9959 {
9966 {
9967 /* A::A a; */
9972 }
9973 }
9975 /* Consume the final `;'. */
9980 /* This is the final expression statement of a statement
9981 expression. */
9987 }
9989 /* Parse a compound-statement.
9991 compound-statement:
9992 { statement-seq [opt] }
9994 GNU extension:
9996 compound-statement:
9997 { label-declaration-seq [opt] statement-seq [opt] }
9999 label-declaration-seq:
10000 label-declaration
10001 label-declaration-seq label-declaration
10003 Returns a tree representing the statement. */
10005 static tree
10008 {
10009 tree compound_stmt;
10011 /* Consume the `{'. */
10018 /* Begin the compound-statement. */
10020 /* If the next keyword is `__label__' we have a label declaration. */
10023 /* Parse an (optional) statement-seq. */
10025 /* Finish the compound-statement. */
10027 /* Consume the `}'. */
10031 }
10033 /* Parse an (optional) statement-seq.
10035 statement-seq:
10036 statement
10037 statement-seq [opt] statement */
10039 static void
10041 {
10042 /* Scan statements until there aren't any more. */
10044 {
10047 /* If we are looking at a `}', then we have run out of
10048 statements; the same is true if we have reached the end
10049 of file, or have stumbled upon a stray '@end'. */
10056 /* If we are in a compound statement and find 'else' then
10057 something went wrong. */
10059 {
10062 else
10063 {
10066 }
10067 }
10069 /* Parse the statement. */
10071 }
10072 }
10074 /* Parse a selection-statement.
10076 selection-statement:
10077 if ( condition ) statement
10078 if ( condition ) statement else statement
10079 switch ( condition ) statement
10081 Returns the new IF_STMT or SWITCH_STMT.
10083 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10084 is a (possibly labeled) if statement which is not enclosed in
10085 braces and has an else clause. This is used to implement
10086 -Wparentheses. */
10088 static tree
10090 {
10097 /* Peek at the next token. */
10100 /* See what kind of keyword it is. */
10103 {
10106 {
10107 tree statement;
10108 tree condition;
10110 /* Look for the `('. */
10112 {
10115 }
10117 /* Begin the selection-statement. */
10120 else
10123 /* Parse the condition. */
10125 /* Look for the `)'. */
10131 {
10135 /* Add the condition. */
10138 /* Parse the then-clause. */
10142 {
10150 }
10151 else
10157 /* If the next token is `else', parse the else-clause. */
10159 RID_ELSE))
10160 {
10161 /* Consume the `else' keyword. */
10164 /* Parse the else-clause. */
10166 {
10167 location_t loc;
10174 }
10175 else
10180 /* If we are currently parsing a then-clause, then
10181 IF_P will not be NULL. We set it to true to
10182 indicate that this if statement has an else clause.
10183 This may trigger the Wparentheses warning below
10184 when we get back up to the parent if statement. */
10187 }
10188 else
10189 {
10190 /* This if statement does not have an else clause. If
10191 NESTED_IF is true, then the then-clause is an if
10192 statement which does have an else clause. We warn
10193 about the potential ambiguity. */
10196 "suggest explicit braces to avoid ambiguous"
10198 }
10200 /* Now we're all done with the if-statement. */
10202 }
10203 else
10204 {
10208 /* Add the condition. */
10211 /* Parse the body of the switch-statement. */
10220 /* Now we're all done with the switch-statement. */
10222 }
10225 }
10231 }
10232 }
10234 /* Parse a condition.
10236 condition:
10237 expression
10238 type-specifier-seq declarator = initializer-clause
10239 type-specifier-seq declarator braced-init-list
10241 GNU Extension:
10243 condition:
10244 type-specifier-seq declarator asm-specification [opt]
10245 attributes [opt] = assignment-expression
10247 Returns the expression that should be tested. */
10249 static tree
10251 {
10252 cp_decl_specifier_seq type_specifiers;
10256 /* Try the declaration first. */
10258 /* New types are not allowed in the type-specifier-seq for a
10259 condition. */
10261 parser->type_definition_forbidden_message
10263 /* Parse the type-specifier-seq. */
10265 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10268 /* Restore the saved message. */
10270 /* If all is well, we might be looking at a declaration. */
10272 {
10273 tree decl;
10274 tree asm_specification;
10275 tree attributes;
10279 /* Parse the declarator. */
10285 /* Parse the attributes. */
10287 /* Parse the asm-specification. */
10289 /* If the next token is not an `=' or '{', then we might still be
10290 looking at an expression. For example:
10292 if (A(a).x)
10294 looks like a decl-specifier-seq and a declarator -- but then
10295 there is no `=', so this is an expression. */
10300 /* If we did see an `=' or '{', then we are looking at a declaration
10301 for sure. */
10303 {
10304 tree pushed_scope;
10308 /* Create the declaration. */
10314 /* Parse the initializer. */
10316 {
10320 }
10321 else
10322 {
10323 /* Consume the `='. */
10326 }
10330 /* Process the initializer. */
10333 asm_specification,
10334 flags);
10340 }
10341 }
10342 /* If we didn't even get past the declarator successfully, we are
10343 definitely not looking at a declaration. */
10344 else
10347 /* Otherwise, we are looking at an expression. */
10349 }
10351 /* Parses a for-statement or range-for-statement until the closing ')',
10352 not included. */
10354 static tree
10356 {
10360 /* Begin the for-statement. */
10363 /* Parse the initialization. */
10368 else
10370 }
10372 static tree
10374 {
10375 /* Normal for loop */
10378 tree stmt;
10381 /* The for-init-statement has already been parsed in
10382 cp_parser_for_init_statement, so no work is needed here. */
10385 /* If there's a condition, process it. */
10389 {
10393 }
10395 /* Look for the `;'. */
10398 /* If there's an expression, process it. */
10404 }
10406 /* Tries to parse a range-based for-statement:
10408 range-based-for:
10409 decl-specifier-seq declarator : expression
10411 The decl-specifier-seq declarator and the `:' are already parsed by
10412 cp_parser_for_init_statement. If processing_template_decl it returns a
10413 newly created RANGE_FOR_STMT; if not, it is converted to a
10414 regular FOR_STMT. */
10416 static tree
10419 {
10423 {
10426 }
10427 else
10430 /* If in template, STMT is converted to a normal for-statement
10431 at instantiation. If not, it is done just ahead. */
10433 {
10441 /* do_auto_deduction doesn't mess with template init-lists. */
10444 }
10445 else
10446 {
10449 }
10451 }
10453 /* Subroutine of cp_convert_range_for: given the initializer expression,
10454 builds up the range temporary. */
10456 static tree
10458 {
10461 /* Find out the type deduced by the declaration
10462 `auto &&__range = range_expr'. */
10467 /* Create the __range variable. */
10474 }
10476 /* Used by cp_parser_range_for in template context: we aren't going to
10477 do a full conversion yet, but we still need to resolve auto in the
10478 type of the for-range-declaration if present. This is basically
10479 a shortcut version of cp_convert_range_for. */
10481 static void
10483 {
10486 {
10489 iter_type = (cp_parser_perform_range_for_lookup
10492 {
10494 iter_type);
10496 tf_warning_or_error);
10499 }
10500 }
10501 }
10503 /* Converts a range-based for-statement into a normal
10504 for-statement, as per the definition.
10506 for (RANGE_DECL : RANGE_EXPR)
10507 BLOCK
10509 should be equivalent to:
10511 {
10512 auto &&__range = RANGE_EXPR;
10513 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10514 __begin != __end;
10515 ++__begin)
10516 {
10517 RANGE_DECL = *__begin;
10518 BLOCK
10519 }
10520 }
10522 If RANGE_EXPR is an array:
10523 BEGIN_EXPR = __range
10524 END_EXPR = __range + ARRAY_SIZE(__range)
10525 Else if RANGE_EXPR has a member 'begin' or 'end':
10526 BEGIN_EXPR = __range.begin()
10527 END_EXPR = __range.end()
10528 Else:
10529 BEGIN_EXPR = begin(__range)
10530 END_EXPR = end(__range);
10532 If __range has a member 'begin' but not 'end', or vice versa, we must
10533 still use the second alternative (it will surely fail, however).
10534 When calling begin()/end() in the third alternative we must use
10535 argument dependent lookup, but always considering 'std' as an associated
10536 namespace. */
10538 tree
10541 {
10547 /* If an error happened previously do nothing or else a lot of
10548 unhelpful errors would be issued. */
10550 else
10551 {
10552 tree range_temp;
10556 /* Can't bind a reference to an array of runtime bound. */
10558 else
10559 {
10564 LOOKUP_ONLYCONVERTING);
10566 }
10569 }
10571 /* The new for initialization statement. */
10579 LOOKUP_ONLYCONVERTING);
10588 LOOKUP_ONLYCONVERTING);
10592 /* The new for condition. */
10599 /* The new increment expression. */
10602 tf_warning_or_error);
10605 /* The declaration is initialized with *__begin inside the loop body. */
10608 tf_warning_or_error),
10610 LOOKUP_ONLYCONVERTING);
10613 }
10615 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10616 We need to solve both at the same time because the method used
10617 depends on the existence of members begin or end.
10618 Returns the type deduced for the iterator expression. */
10620 static tree
10622 {
10624 {
10627 }
10630 {
10635 }
10637 {
10638 /* If RANGE is an array, we will use pointer arithmetic. */
10641 range,
10645 }
10646 else
10647 {
10648 /* If it is not an array, we must do a bit of magic. */
10658 tf_warning_or_error);
10661 tf_warning_or_error);
10664 {
10665 /* Use the member functions. */
10668 else
10674 else
10677 }
10678 else
10679 {
10680 /* Use global functions with ADL. */
10687 tf_warning_or_error);
10689 tf_warning_or_error);
10691 tf_warning_or_error);
10693 tf_warning_or_error);
10696 }
10698 /* Last common checks. */
10700 {
10701 /* If one of the expressions is an error do no more checks. */
10704 }
10707 /* Can happen, when, eg, in a template context, Koenig lookup
10708 can't resolve begin/end (c++/58503). */
10710 else
10711 {
10713 /* The unqualified type of the __begin and __end temporaries should
10714 be the same, as required by the multiple auto declaration. */
10720 }
10721 }
10722 }
10724 /* Helper function for cp_parser_perform_range_for_lookup.
10725 Builds a tree for RANGE.IDENTIFIER(). */
10727 static tree
10729 {
10742 tf_warning_or_error);
10745 }
10747 /* Parse an iteration-statement.
10749 iteration-statement:
10750 while ( condition ) statement
10751 do statement while ( expression ) ;
10752 for ( for-init-statement condition [opt] ; expression [opt] )
10753 statement
10755 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10757 static tree
10759 {
10762 tree statement;
10765 /* Peek at the next token. */
10770 /* Remember whether or not we are already within an iteration
10771 statement. */
10774 /* See what kind of keyword it is. */
10777 {
10779 {
10780 tree condition;
10782 /* Begin the while-statement. */
10784 /* Look for the `('. */
10786 /* Parse the condition. */
10789 /* Look for the `)'. */
10791 /* Parse the dependent statement. */
10795 /* We're done with the while-statement. */
10797 }
10801 {
10802 tree expression;
10804 /* Begin the do-statement. */
10806 /* Parse the body of the do-statement. */
10811 /* Look for the `while' keyword. */
10813 /* Look for the `('. */
10815 /* Parse the expression. */
10817 /* We're done with the do-statement. */
10819 /* Look for the `)'. */
10821 /* Look for the `;'. */
10823 }
10827 {
10828 /* Look for the `('. */
10833 /* Look for the `)'. */
10836 /* Parse the body of the for-statement. */
10841 /* We're done with the for-statement. */
10843 }
10850 }
10853 }
10855 /* Parse a for-init-statement or the declarator of a range-based-for.
10856 Returns true if a range-based-for declaration is seen.
10858 for-init-statement:
10859 expression-statement
10860 simple-declaration */
10862 static bool
10864 {
10865 /* If the next token is a `;', then we have an empty
10866 expression-statement. Grammatically, this is also a
10867 simple-declaration, but an invalid one, because it does not
10868 declare anything. Therefore, if we did not handle this case
10869 specially, we would issue an error message about an invalid
10870 declaration. */
10872 {
10878 {
10879 /* N3994 -- for (id : init) ... */
10882 "type-specifier only available with "
10890 }
10892 /* A colon is used in range-based for. */
10895 /* We're going to speculatively look for a declaration, falling back
10896 to an expression, if necessary. */
10898 /* Parse the declaration. */
10901 decl);
10904 {
10905 /* It is a range-for, consume the ':' */
10909 {
10911 "range-based %<for%> loops only available with "
10914 }
10915 }
10916 else
10917 /* The ';' is not consumed yet because we told
10918 cp_parser_simple_declaration not to. */
10923 /* If the tentative parse failed, then we shall need to look for an
10924 expression-statement. */
10925 }
10926 /* If we are here, it is an expression-statement. */
10929 }
10931 /* Parse a jump-statement.
10933 jump-statement:
10934 break ;
10935 continue ;
10936 return expression [opt] ;
10937 return braced-init-list ;
10938 goto identifier ;
10940 GNU extension:
10942 jump-statement:
10943 goto * expression ;
10945 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10947 static tree
10949 {
10955 /* Peek at the next token. */
10960 /* See what kind of keyword it is. */
10963 {
10967 {
10987 }
10993 {
11000 /* Fall through. */
11010 }
11015 {
11016 tree expr;
11020 {
11024 }
11027 else
11028 /* If the next token is a `;', then there is no
11029 expression. */
11031 /* Build the return-statement. */
11033 /* Look for the final `;'. */
11035 }
11041 {
11044 }
11046 /* Create the goto-statement. */
11048 {
11049 /* Issue a warning about this use of a GNU extension. */
11051 /* Consume the '*' token. */
11053 /* Parse the dependent expression. */
11055 }
11056 else
11058 /* Look for the final `;'. */
11065 }
11068 }
11070 /* Parse a declaration-statement.
11072 declaration-statement:
11073 block-declaration */
11075 static void
11077 {
11080 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11083 /* Parse the block-declaration. */
11086 /* Free any declarators allocated. */
11088 }
11090 /* Some dependent statements (like `if (cond) statement'), are
11091 implicitly in their own scope. In other words, if the statement is
11092 a single statement (as opposed to a compound-statement), it is
11093 none-the-less treated as if it were enclosed in braces. Any
11094 declarations appearing in the dependent statement are out of scope
11095 after control passes that point. This function parses a statement,
11096 but ensures that is in its own scope, even if it is not a
11097 compound-statement.
11099 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11100 is a (possibly labeled) if statement which is not enclosed in
11101 braces and has an else clause. This is used to implement
11102 -Wparentheses.
11104 Returns the new statement. */
11106 static tree
11108 {
11109 tree statement;
11114 /* Mark if () ; with a special NOP_EXPR. */
11116 {
11120 }
11121 /* if a compound is opened, we simply parse the statement directly. */
11124 /* If the token is not a `{', then we must take special action. */
11125 else
11126 {
11127 /* Create a compound-statement. */
11129 /* Parse the dependent-statement. */
11131 /* Finish the dummy compound-statement. */
11133 }
11135 /* Return the statement. */
11137 }
11139 /* For some dependent statements (like `while (cond) statement'), we
11140 have already created a scope. Therefore, even if the dependent
11141 statement is a compound-statement, we do not want to create another
11142 scope. */
11144 static void
11146 {
11147 /* If the token is a `{', then we must take special action. */
11150 else
11151 {
11152 /* Avoid calling cp_parser_compound_statement, so that we
11153 don't create a new scope. Do everything else by hand. */
11155 /* If the next keyword is `__label__' we have a label declaration. */
11158 /* Parse an (optional) statement-seq. */
11161 }
11162 }
11164 /* Declarations [gram.dcl.dcl] */
11166 /* Parse an optional declaration-sequence.
11168 declaration-seq:
11169 declaration
11170 declaration-seq declaration */
11172 static void
11174 {
11176 {
11187 {
11188 /* A declaration consisting of a single semicolon is
11189 invalid. Allow it unless we're being pedantic. */
11194 }
11196 /* If we're entering or exiting a region that's implicitly
11197 extern "C", modify the lang context appropriately. */
11199 {
11202 }
11204 {
11207 }
11210 {
11211 /* A top-level declaration can consist solely of a #pragma.
11212 A nested declaration cannot, so this is done here and not
11213 in cp_parser_declaration. (A #pragma at block scope is
11214 handled in cp_parser_statement.) */
11217 }
11219 /* Parse the declaration itself. */
11221 }
11222 }
11224 /* Parse a declaration.
11226 declaration:
11227 block-declaration
11228 function-definition
11229 template-declaration
11230 explicit-instantiation
11231 explicit-specialization
11232 linkage-specification
11233 namespace-definition
11235 GNU extension:
11237 declaration:
11238 __extension__ declaration */
11240 static void
11242 {
11243 cp_token token1;
11244 cp_token token2;
11249 /* Check for the `__extension__' keyword. */
11251 {
11252 /* Parse the qualified declaration. */
11254 /* Restore the PEDANTIC flag. */
11258 }
11260 /* Try to figure out what kind of declaration is present. */
11265 else
11266 {
11269 }
11271 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11274 /* If the next token is `extern' and the following token is a string
11275 literal, then we have a linkage specification. */
11279 /* If the next token is `template', then we have either a template
11280 declaration, an explicit instantiation, or an explicit
11281 specialization. */
11283 {
11284 /* `template <>' indicates a template specialization. */
11288 /* `template <' indicates a template declaration. */
11291 /* Anything else must be an explicit instantiation. */
11292 else
11294 }
11295 /* If the next token is `export', then we have a template
11296 declaration. */
11299 /* If the next token is `extern', 'static' or 'inline' and the one
11300 after that is `template', we have a GNU extended explicit
11301 instantiation directive. */
11308 /* If the next token is `namespace', check for a named or unnamed
11309 namespace definition. */
11315 /* An unnamed namespace definition. */
11319 /* An inline (associated) namespace definition. */
11323 /* Objective-C++ declaration/definition. */
11330 /* We must have either a block declaration or a function
11331 definition. */
11332 else
11333 /* Try to parse a block-declaration, or a function-definition. */
11336 /* Free any declarators allocated. */
11338 }
11340 /* Parse a block-declaration.
11342 block-declaration:
11343 simple-declaration
11344 asm-definition
11345 namespace-alias-definition
11346 using-declaration
11347 using-directive
11349 GNU Extension:
11351 block-declaration:
11352 __extension__ block-declaration
11354 C++0x Extension:
11356 block-declaration:
11357 static_assert-declaration
11359 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11360 part of a declaration-statement. */
11362 static void
11365 {
11369 /* Check for the `__extension__' keyword. */
11371 {
11372 /* Parse the qualified declaration. */
11374 /* Restore the PEDANTIC flag. */
11378 }
11380 /* Peek at the next token to figure out which kind of declaration is
11381 present. */
11384 /* If the next keyword is `asm', we have an asm-definition. */
11386 {
11390 }
11391 /* If the next keyword is `namespace', we have a
11392 namespace-alias-definition. */
11395 /* If the next keyword is `using', we have a
11396 using-declaration, a using-directive, or an alias-declaration. */
11398 {
11403 /* If the token after `using' is `namespace', then we have a
11404 using-directive. */
11408 /* If the second token after 'using' is '=', then we have an
11409 alias-declaration. */
11415 /* Otherwise, it's a using-declaration. */
11416 else
11419 }
11420 /* If the next keyword is `__label__' we have a misplaced label
11421 declaration. */
11423 {
11427 /* If the next token is now a `;', consume it. */
11430 }
11431 /* If the next token is `static_assert' we have a static assertion. */
11434 /* Anything else must be a simple-declaration. */
11435 else
11438 }
11440 /* Parse a simple-declaration.
11442 simple-declaration:
11443 decl-specifier-seq [opt] init-declarator-list [opt] ;
11445 init-declarator-list:
11446 init-declarator
11447 init-declarator-list , init-declarator
11449 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11450 function-definition as a simple-declaration.
11452 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11453 parsed declaration if it is an uninitialized single declarator not followed
11454 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11455 if present, will not be consumed. */
11457 static void
11461 {
11462 cp_decl_specifier_seq decl_specifiers;
11471 /* Defer access checks until we know what is being declared; the
11472 checks for names appearing in the decl-specifier-seq should be
11473 done as if we were in the scope of the thing being declared. */
11476 /* Parse the decl-specifier-seq. We have to keep track of whether
11477 or not the decl-specifier-seq declares a named class or
11478 enumeration type, since that is the only case in which the
11479 init-declarator-list is allowed to be empty.
11481 [dcl.dcl]
11483 In a simple-declaration, the optional init-declarator-list can be
11484 omitted only when declaring a class or enumeration, that is when
11485 the decl-specifier-seq contains either a class-specifier, an
11486 elaborated-type-specifier, or an enum-specifier. */
11488 CP_PARSER_FLAGS_OPTIONAL,
11491 /* We no longer need to defer access checks. */
11494 /* In a block scope, a valid declaration must always have a
11495 decl-specifier-seq. By not trying to parse declarators, we can
11496 resolve the declaration/expression ambiguity more quickly. */
11499 {
11502 }
11504 /* If the next two tokens are both identifiers, the code is
11505 erroneous. The usual cause of this situation is code like:
11507 T t;
11509 where "T" should name a type -- but does not. */
11512 {
11513 /* If parsing tentatively, we should commit; we really are
11514 looking at a declaration. */
11516 /* Give up. */
11518 }
11520 /* If we have seen at least one decl-specifier, and the next token
11521 is not a parenthesis, then we must be looking at a declaration.
11522 (After "int (" we might be looking at a functional cast.) */
11529 /* Keep going until we hit the `;' at the end of the simple
11530 declaration. */
11533 CPP_SEMICOLON))
11534 {
11537 tree decl;
11540 {
11541 /* If we are processing next declarator, comma is expected */
11546 {
11550 }
11551 }
11552 else
11555 /* Parse the init-declarator. */
11558 function_definition_allowed_p,
11560 declares_class_or_enum,
11562 maybe_range_for_decl,
11564 /* If an error occurred while parsing tentatively, exit quickly.
11565 (That usually happens when in the body of a function; each
11566 statement is treated as a declaration-statement until proven
11567 otherwise.) */
11570 /* Handle function definitions specially. */
11572 {
11573 /* If the next token is a `,', then we are probably
11574 processing something like:
11576 void f() {}, *p;
11578 which is erroneous. */
11580 {
11583 "mixing"
11585 }
11586 /* Otherwise, we're done with the list of declarators. */
11587 else
11588 {
11591 }
11592 }
11595 /* The next token should be either a `,' or a `;'. */
11597 /* If it's a `,', there are more declarators to come. */
11600 /* If it's a `;', we are done. */
11603 /* Anything else is an error. */
11604 else
11605 {
11606 /* If we have already issued an error message we don't need
11607 to issue another one. */
11611 /* Skip tokens until we reach the end of the statement. */
11613 /* If the next token is now a `;', consume it. */
11617 }
11618 /* After the first time around, a function-definition is not
11619 allowed -- even if it was OK at first. For example:
11621 int i, f() {}
11623 is not valid. */
11625 }
11627 /* Issue an error message if no declarators are present, and the
11628 decl-specifier-seq does not itself declare a class or
11629 enumeration: [dcl.dcl]/3. */
11631 {
11633 {
11637 /* Ensure an error is issued anyway when finish_decltype_type,
11638 called via cp_parser_decl_specifier_seq, returns a class or
11639 an enumeration (c++/51786). */
11642 }
11643 /* Perform any deferred access checks. */
11645 }
11647 /* Consume the `;'. */
11651 {
11657 }
11659 done:
11661 }
11663 /* Parse a decl-specifier-seq.
11665 decl-specifier-seq:
11666 decl-specifier-seq [opt] decl-specifier
11667 decl-specifier attribute-specifier-seq [opt] (C++11)
11669 decl-specifier:
11670 storage-class-specifier
11671 type-specifier
11672 function-specifier
11673 friend
11674 typedef
11676 GNU Extension:
11678 decl-specifier:
11679 attributes
11681 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11683 The parser flags FLAGS is used to control type-specifier parsing.
11685 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11686 flags:
11688 1: one of the decl-specifiers is an elaborated-type-specifier
11689 (i.e., a type declaration)
11690 2: one of the decl-specifiers is an enum-specifier or a
11691 class-specifier (i.e., a type definition)
11693 */
11695 static void
11697 cp_parser_flags flags,
11700 {
11704 cp_decl_spec ds;
11706 /* Clear DECL_SPECS. */
11709 /* Assume no class or enumeration type is declared. */
11712 /* Keep reading specifiers until there are no more to read. */
11714 {
11719 /* Peek at the next token. */
11722 /* Save the first token of the decl spec list for error
11723 reporting. */
11726 /* Handle attributes. */
11728 {
11729 /* Parse the attributes. */
11732 /* In a sequence of declaration specifiers, c++11 attributes
11733 appertain to the type that precede them. In that case
11734 [dcl.spec]/1 says:
11736 The attribute-specifier-seq affects the type only for
11737 the declaration it appears in, not other declarations
11738 involving the same type.
11740 But for now let's force the user to position the
11741 attribute either at the beginning of the declaration or
11742 after the declarator-id, which would clearly mean that it
11743 applies to the declarator. */
11745 {
11747 /* The c++11 attribute is at the beginning of the
11748 declaration. It appertains to the entity being
11750 else
11751 {
11753 {
11754 /* This is an attribute following a
11755 class-specifier. */
11760 }
11761 else
11762 {
11763 decl_specs->std_attributes
11765 attrs);
11768 }
11770 }
11771 }
11773 decl_specs->attributes
11775 attrs);
11779 }
11780 /* Assume we will find a decl-specifier keyword. */
11782 /* If the next token is an appropriate keyword, we can simply
11783 add it to the list. */
11785 {
11786 /* decl-specifier:
11787 friend
11788 constexpr */
11791 {
11794 }
11795 else
11796 {
11798 /* Consume the token. */
11800 }
11808 /* function-specifier:
11809 inline
11810 virtual
11811 explicit */
11818 /* decl-specifier:
11819 typedef */
11822 /* Consume the token. */
11824 /* A constructor declarator cannot appear in a typedef. */
11826 /* The "typedef" keyword can only occur in a declaration; we
11827 may as well commit at this point. */
11834 /* storage-class-specifier:
11835 auto
11836 register
11837 static
11838 extern
11839 mutable
11841 GNU Extension:
11842 thread */
11845 {
11846 /* Consume the token. */
11849 /* Complain about `auto' as a storage specifier, if
11850 we're complaining about C++0x compatibility. */
11854 /* Set the storage class anyway. */
11856 token);
11857 }
11858 else
11859 /* C++0x auto type-specifier. */
11867 /* Consume the token. */
11870 token);
11873 /* Consume the token. */
11879 /* We did not yet find a decl-specifier yet. */
11882 }
11892 /* Constructors are a special case. The `S' in `S()' is not a
11893 decl-specifier; it is the beginning of the declarator. */
11894 constructor_p
11895 = (!found_decl_spec
11896 && constructor_possible_p
11897 && (cp_parser_constructor_declarator_p
11900 /* If we don't have a DECL_SPEC yet, then we must be looking at
11901 a type-specifier. */
11903 {
11906 tree type_spec;
11908 type_spec
11910 decl_specs,
11916 /* If this type-specifier referenced a user-defined type
11917 (a typedef, class-name, etc.), then we can't allow any
11918 more such type-specifiers henceforth.
11920 [dcl.spec]
11922 The longest sequence of decl-specifiers that could
11923 possibly be a type name is taken as the
11924 decl-specifier-seq of a declaration. The sequence shall
11925 be self-consistent as described below.
11927 [dcl.type]
11929 As a general rule, at most one type-specifier is allowed
11930 in the complete decl-specifier-seq of a declaration. The
11931 only exceptions are the following:
11933 -- const or volatile can be combined with any other
11934 type-specifier.
11936 -- signed or unsigned can be combined with char, long,
11937 short, or int.
11939 -- ..
11941 Example:
11943 typedef char* Pc;
11944 void g (const int Pc);
11946 Here, Pc is *not* part of the decl-specifier seq; it's
11947 the declarator. Therefore, once we see a type-specifier
11948 (other than a cv-qualifier), we forbid any additional
11949 user-defined types. We *do* still allow things like `int
11950 int' to be considered a decl-specifier-seq, and issue the
11951 error message later. */
11954 /* A constructor declarator cannot follow a type-specifier. */
11956 {
11961 }
11962 }
11964 /* If we still do not have a DECL_SPEC, then there are no more
11965 decl-specifiers. */
11970 /* After we see one decl-specifier, further decl-specifiers are
11971 always optional. */
11973 }
11975 /* Don't allow a friend specifier with a class definition. */
11980 }
11982 /* Parse an (optional) storage-class-specifier.
11984 storage-class-specifier:
11985 auto
11986 register
11987 static
11988 extern
11989 mutable
11991 GNU Extension:
11993 storage-class-specifier:
11994 thread
11996 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11998 static tree
12000 {
12002 {
12006 /* Fall through for C++98. */
12013 /* Consume the token. */
12018 }
12019 }
12021 /* Parse an (optional) function-specifier.
12023 function-specifier:
12024 inline
12025 virtual
12026 explicit
12028 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12029 Updates DECL_SPECS, if it is non-NULL. */
12031 static tree
12034 {
12037 {
12043 /* 14.5.2.3 [temp.mem]
12045 A member function template shall not be virtual. */
12048 else
12058 }
12060 /* Consume the token. */
12062 }
12064 /* Parse a linkage-specification.
12066 linkage-specification:
12067 extern string-literal { declaration-seq [opt] }
12068 extern string-literal declaration */
12070 static void
12072 {
12073 tree linkage;
12075 /* Look for the `extern' keyword. */
12078 /* Look for the string-literal. */
12081 /* Transform the literal into an identifier. If the literal is a
12082 wide-character string, or contains embedded NULs, then we can't
12083 handle it as the user wants. */
12086 {
12088 /* Assume C++ linkage. */
12090 }
12091 else
12094 /* We're now using the new linkage. */
12097 /* If the next token is a `{', then we're using the first
12098 production. */
12100 {
12103 /* Consume the `{' token. */
12105 /* Parse the declarations. */
12107 /* Look for the closing `}'. */
12109 }
12110 /* Otherwise, there's just one declaration. */
12111 else
12112 {
12115 saved_in_unbraced_linkage_specification_p
12119 parser->in_unbraced_linkage_specification_p
12121 }
12123 /* We're done with the linkage-specification. */
12125 }
12127 /* Parse a static_assert-declaration.
12129 static_assert-declaration:
12130 static_assert ( constant-expression , string-literal ) ;
12132 If MEMBER_P, this static_assert is a class member. */
12134 static void
12136 {
12137 tree condition;
12138 tree message;
12140 location_t saved_loc;
12143 /* Peek at the `static_assert' token so we can keep track of exactly
12144 where the static assertion started. */
12148 /* Look for the `static_assert' keyword. */
12150 RT_STATIC_ASSERT))
12153 /* We know we are in a static assertion; commit to any tentative
12154 parse. */
12158 /* Parse the `(' starting the static assertion condition. */
12161 /* Parse the constant-expression. Allow a non-constant expression
12162 here in order to give better diagnostics in finish_static_assert. */
12163 condition =
12168 /* Parse the separating `,'. */
12171 /* Parse the string-literal message. */
12176 /* A `)' completes the static assertion. */
12183 /* A semicolon terminates the declaration. */
12186 /* Complete the static assertion, which may mean either processing
12187 the static assert now or saving it for template instantiation. */
12189 }
12191 /* Parse the expression in decltype ( expression ). */
12193 static tree
12196 {
12198 tree expr;
12200 /* First, try parsing an id-expression. */
12211 {
12214 cp_id_kind idk;
12218 /* Lookup the name we got back from the id-expression. */
12228 {
12229 /* Complete lookup of the id-expression. */
12230 expr = (finish_id_expression
12243 /* We found an id-expression, but it was something that we
12244 should not have found. This is an error, not something
12245 we can recover from, so note that we found an
12246 id-expression and we'll recover as gracefully as
12247 possible. */
12249 }
12254 /* We have an id-expression. */
12256 }
12259 {
12260 /* Abort the id-expression parse. */
12263 /* Parsing tentatively, again. */
12266 /* Parse a class member access. */
12274 /* We have an id-expression. */
12276 }
12279 /* We have parsed the complete id-expression or member access. */
12281 else
12282 {
12283 /* Abort our attempt to parse an id-expression or member access
12284 expression. */
12287 /* Parse a full expression. */
12290 }
12293 }
12295 /* Parse a `decltype' type. Returns the type.
12297 simple-type-specifier:
12298 decltype ( expression )
12299 C++14 proposal:
12300 decltype ( auto ) */
12302 static tree
12304 {
12305 tree expr;
12314 {
12315 /* Already parsed. */
12318 }
12320 /* Look for the `decltype' token. */
12324 /* Parse the opening `('. */
12328 /* decltype (auto) */
12331 {
12338 }
12340 /* Types cannot be defined in a `decltype' expression. Save away the
12341 old message. */
12344 /* And create the new one. */
12345 parser->type_definition_forbidden_message
12348 /* The restrictions on constant-expressions do not apply inside
12349 decltype expressions. */
12350 saved_integral_constant_expression_p
12352 saved_non_integral_constant_expression_p
12356 /* Within a parenthesized expression, a `>' token is always
12357 the greater-than operator. */
12358 saved_greater_than_is_operator_p
12362 /* Do not actually evaluate the expression. */
12365 /* Do not warn about problems with the expression. */
12370 /* Go back to evaluating expressions. */
12374 /* The `>' token might be the end of a template-id or
12375 template-parameter-list now. */
12376 parser->greater_than_is_operator_p
12379 /* Restore the old message and the integral constant expression
12380 flags. */
12382 parser->integral_constant_expression_p
12384 parser->non_integral_constant_expression_p
12387 /* Parse to the closing `)'. */
12389 {
12393 }
12396 tf_warning_or_error);
12398 rewrite:
12399 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12400 it again. */
12407 }
12409 /* Special member functions [gram.special] */
12411 /* Parse a conversion-function-id.
12413 conversion-function-id:
12414 operator conversion-type-id
12416 Returns an IDENTIFIER_NODE representing the operator. */
12418 static tree
12420 {
12421 tree type;
12422 tree saved_scope;
12423 tree saved_qualifying_scope;
12424 tree saved_object_scope;
12427 /* Look for the `operator' token. */
12430 /* When we parse the conversion-type-id, the current scope will be
12431 reset. However, we need that information in able to look up the
12432 conversion function later, so we save it here. */
12436 /* We must enter the scope of the class so that the names of
12437 entities declared within the class are available in the
12438 conversion-type-id. For example, consider:
12440 struct S {
12441 typedef int I;
12442 operator I();
12443 };
12445 S::operator I() { ... }
12447 In order to see that `I' is a type-name in the definition, we
12448 must be in the scope of `S'. */
12451 /* Parse the conversion-type-id. */
12453 /* Leave the scope of the class, if any. */
12456 /* Restore the saved scope. */
12460 /* If the TYPE is invalid, indicate failure. */
12464 }
12466 /* Parse a conversion-type-id:
12468 conversion-type-id:
12469 type-specifier-seq conversion-declarator [opt]
12471 Returns the TYPE specified. */
12473 static tree
12475 {
12476 tree attributes;
12477 cp_decl_specifier_seq type_specifiers;
12479 tree type_specified;
12482 /* Parse the attributes. */
12486 parser->type_definition_forbidden_message
12489 /* Parse the type-specifiers. */
12496 /* If that didn't work, stop. */
12499 /* Parse the conversion-declarator. */
12507 /* Don't give this error when parsing tentatively. This happens to
12508 work because we always parse this definitively once. */
12511 {
12513 {
12516 }
12520 }
12523 }
12525 /* Parse an (optional) conversion-declarator.
12527 conversion-declarator:
12528 ptr-operator conversion-declarator [opt]
12530 */
12534 {
12537 cp_cv_quals cv_quals;
12539 /* We don't know if there's a ptr-operator next, or not. */
12541 /* Try the ptr-operator. */
12544 /* If it worked, look for more conversion-declarators. */
12546 {
12549 /* Parse another optional declarator. */
12552 declarator = cp_parser_make_indirect_declarator
12556 }
12559 }
12561 /* Parse an (optional) ctor-initializer.
12563 ctor-initializer:
12564 : mem-initializer-list
12566 Returns TRUE iff the ctor-initializer was actually present. */
12568 static bool
12570 {
12571 /* If the next token is not a `:', then there is no
12572 ctor-initializer. */
12574 {
12575 /* Do default initialization of any bases and members. */
12580 }
12582 /* Consume the `:' token. */
12584 /* And the mem-initializer-list. */
12588 }
12590 /* Parse a mem-initializer-list.
12592 mem-initializer-list:
12593 mem-initializer ... [opt]
12594 mem-initializer ... [opt] , mem-initializer-list */
12596 static void
12598 {
12603 /* Let the semantic analysis code know that we are starting the
12604 mem-initializer-list. */
12609 /* Loop through the list. */
12611 {
12612 tree mem_initializer;
12615 /* Parse the mem-initializer. */
12617 /* If the next token is a `...', we're expanding member initializers. */
12619 {
12620 /* Consume the `...'. */
12623 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12624 can be expanded but members cannot. */
12627 {
12632 }
12634 /* Construct the pack expansion type. */
12637 }
12640 {
12644 }
12645 /* Look for a target constructor. */
12649 {
12652 {
12656 }
12658 }
12659 /* Add it to the list, unless it was erroneous. */
12661 {
12664 }
12665 /* If the next token is not a `,', we're done. */
12668 /* Consume the `,' token. */
12670 }
12672 /* Perform semantic analysis. */
12675 }
12677 /* Parse a mem-initializer.
12679 mem-initializer:
12680 mem-initializer-id ( expression-list [opt] )
12681 mem-initializer-id braced-init-list
12683 GNU extension:
12685 mem-initializer:
12686 ( expression-list [opt] )
12688 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12689 class) or FIELD_DECL (for a non-static data member) to initialize;
12690 the TREE_VALUE is the expression-list. An empty initialization
12691 list is represented by void_list_node. */
12693 static tree
12695 {
12696 tree mem_initializer_id;
12697 tree expression_list;
12698 tree member;
12701 /* Find out what is being initialized. */
12703 {
12707 }
12708 else
12709 {
12713 }
12719 {
12726 }
12727 else
12728 {
12738 }
12748 }
12750 /* Parse a mem-initializer-id.
12752 mem-initializer-id:
12753 :: [opt] nested-name-specifier [opt] class-name
12754 identifier
12756 Returns a TYPE indicating the class to be initializer for the first
12757 production. Returns an IDENTIFIER_NODE indicating the data member
12758 to be initialized for the second production. */
12760 static tree
12762 {
12766 tree id;
12770 /* `typename' is not allowed in this context ([temp.res]). */
12772 {
12774 "keyword %<typename%> not allowed in this context (a qualified "
12777 }
12778 /* Look for the optional `::' operator. */
12779 global_scope_p
12783 /* Look for the optional nested-name-specifier. The simplest way to
12784 implement:
12786 [temp.res]
12788 The keyword `typename' is not permitted in a base-specifier or
12789 mem-initializer; in these contexts a qualified name that
12790 depends on a template-parameter is implicitly assumed to be a
12791 type name.
12793 is to assume that we have seen the `typename' keyword at this
12794 point. */
12795 nested_name_specifier_p
12804 /* If there is a `::' operator or a nested-name-specifier, then we
12805 are definitely looking for a class-name. */
12810 typename_type,
12814 /* Otherwise, we could also be looking for an ordinary identifier. */
12816 /* Try a class-name. */
12820 none_type,
12824 /* If we found one, we're done. */
12827 /* Otherwise, look for an ordinary identifier. */
12829 }
12831 /* Overloading [gram.over] */
12833 /* Parse an operator-function-id.
12835 operator-function-id:
12836 operator operator
12838 Returns an IDENTIFIER_NODE for the operator which is a
12839 human-readable spelling of the identifier, e.g., `operator +'. */
12841 static tree
12843 {
12844 /* Look for the `operator' keyword. */
12847 /* And then the name of the operator itself. */
12849 }
12851 /* Return an identifier node for a user-defined literal operator.
12852 The suffix identifier is chained to the operator name identifier. */
12854 static tree
12856 {
12857 tree identifier;
12864 }
12866 /* Parse an operator.
12868 operator:
12869 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12870 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12871 || ++ -- , ->* -> () []
12873 GNU Extensions:
12875 operator:
12876 <? >? <?= >?=
12878 Returns an IDENTIFIER_NODE for the operator which is a
12879 human-readable spelling of the identifier, e.g., `operator +'. */
12881 static tree
12883 {
12888 /* Peek at the next token. */
12890 /* Figure out which operator we have. */
12892 {
12894 {
12897 /* The keyword should be either `new' or `delete'. */
12902 else
12905 /* Consume the `new' or `delete' token. */
12908 /* Peek at the next token. */
12910 /* If it's a `[' token then this is the array variant of the
12911 operator. */
12913 {
12914 /* Consume the `[' token. */
12916 /* Look for the `]' token. */
12920 }
12921 /* Otherwise, we have the non-array variant. */
12922 else
12926 }
13073 /* Consume the `('. */
13075 /* Look for the matching `)'. */
13080 /* Consume the `['. */
13082 /* Look for the matching `]'. */
13097 {
13104 /* Consume the string. */
13110 {
13113 }
13114 else
13115 {
13117 /* Look for the suffix identifier. */
13122 {
13126 }
13127 else
13128 {
13131 }
13132 }
13137 {
13140 }
13143 {
13146 }
13148 {
13151 }
13153 }
13156 /* Anything else is an error. */
13158 }
13160 /* If we have selected an identifier, we need to consume the
13161 operator token. */
13164 /* Otherwise, no valid operator name was present. */
13165 else
13166 {
13169 }
13172 }
13174 /* Parse a template-declaration.
13176 template-declaration:
13177 export [opt] template < template-parameter-list > declaration
13179 If MEMBER_P is TRUE, this template-declaration occurs within a
13180 class-specifier.
13182 The grammar rule given by the standard isn't correct. What
13183 is really meant is:
13185 template-declaration:
13186 export [opt] template-parameter-list-seq
13187 decl-specifier-seq [opt] init-declarator [opt] ;
13188 export [opt] template-parameter-list-seq
13189 function-definition
13191 template-parameter-list-seq:
13192 template-parameter-list-seq [opt]
13193 template < template-parameter-list > */
13195 static void
13197 {
13198 /* Check for `export'. */
13200 {
13201 /* Consume the `export' token. */
13203 /* Warn that we do not support `export'. */
13205 }
13208 }
13210 /* Parse a template-parameter-list.
13212 template-parameter-list:
13213 template-parameter
13214 template-parameter-list , template-parameter
13216 Returns a TREE_LIST. Each node represents a template parameter.
13217 The nodes are connected via their TREE_CHAINs. */
13219 static tree
13221 {
13226 /* The loop below parses the template parms. We first need to know
13227 the total number of template parms to be able to compute proper
13228 canonical types of each dependent type. So after the loop, when
13229 we know the total number of template parms,
13230 end_template_parm_list computes the proper canonical types and
13231 fixes up the dependent types accordingly. */
13233 {
13234 tree parameter;
13237 location_t parm_loc;
13239 /* Parse the template-parameter. */
13244 /* Add it to the list. */
13247 parm_loc,
13248 parameter,
13249 is_non_type,
13250 is_parameter_pack);
13251 else
13252 {
13255 }
13257 /* If the next token is not a `,', we're done. */
13260 /* Otherwise, consume the `,' token. */
13262 }
13265 }
13267 /* Parse a template-parameter.
13269 template-parameter:
13270 type-parameter
13271 parameter-declaration
13273 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13274 the parameter. The TREE_PURPOSE is the default value, if any.
13275 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13276 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13277 set to true iff this parameter is a parameter pack. */
13279 static tree
13282 {
13286 tree parm;
13288 /* Assume it is a type parameter or a template parameter. */
13290 /* Assume it not a parameter pack. */
13292 /* Peek at the next token. */
13294 /* If it is `class' or `template', we have a type-parameter. */
13297 /* If it is `class' or `typename' we do not know yet whether it is a
13298 type parameter or a non-type parameter. Consider:
13300 template <typename T, typename T::X X> ...
13302 or:
13304 template <class C, class D*> ...
13306 Here, the first parameter is a type parameter, and the second is
13307 a non-type parameter. We can tell by looking at the token after
13308 the identifier -- if it is a `,', `=', or `>' then we have a type
13309 parameter. */
13311 {
13312 /* Peek at the token after `class' or `typename'. */
13314 /* If it's an ellipsis, we have a template type parameter
13315 pack. */
13318 /* If it's an identifier, skip it. */
13321 /* Now, see if the token looks like the end of a template
13322 parameter. */
13327 }
13329 /* Otherwise, it is a non-type parameter.
13331 [temp.param]
13333 When parsing a default template-argument for a non-type
13334 template-parameter, the first non-nested `>' is taken as the end
13335 of the template parameter-list rather than a greater-than
13336 operator. */
13338 parameter_declarator
13345 /* If the parameter declaration is marked as a parameter pack, set
13346 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13347 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13348 grokdeclarator. */
13351 {
13354 }
13357 {
13358 /* Can happen in some cases of erroneous input (c++/34892). */
13360 /* Consume the `...' for better error recovery. */
13362 }
13363 /* If the next token is an ellipsis, and we don't already have it
13364 marked as a parameter pack, then we have a parameter pack (that
13365 has no declarator). */
13368 && (declarator_can_be_parameter_pack
13370 {
13371 /* Consume the `...'. */
13376 }
13377 /* We might end up with a pack expansion as the type of the non-type
13378 template parameter, in which case this is a non-type template
13379 parameter pack. */
13382 {
13386 }
13389 {
13390 /* Parameter packs cannot have default arguments. However, a
13391 user may try to do so, so we'll parse them and give an
13392 appropriate diagnostic here. */
13396 /* Find the name of the parameter pack. */
13405 else
13409 /* Parse the default argument, but throw away the result. */
13411 }
13421 }
13423 /* Parse a type-parameter.
13425 type-parameter:
13426 class identifier [opt]
13427 class identifier [opt] = type-id
13428 typename identifier [opt]
13429 typename identifier [opt] = type-id
13430 template < template-parameter-list > class identifier [opt]
13431 template < template-parameter-list > class identifier [opt]
13432 = id-expression
13434 GNU Extension (variadic templates):
13436 type-parameter:
13437 class ... identifier [opt]
13438 typename ... identifier [opt]
13440 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13441 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13442 the declaration of the parameter.
13444 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13446 static tree
13448 {
13450 tree parameter;
13452 /* Look for a keyword to tell us what kind of parameter this is. */
13458 {
13461 {
13462 tree identifier;
13463 tree default_argument;
13465 /* If the next token is an ellipsis, we have a template
13466 argument pack. */
13468 {
13469 /* Consume the `...' token. */
13474 }
13476 /* If the next token is an identifier, then it names the
13477 parameter. */
13480 else
13483 /* Create the parameter. */
13486 /* If the next token is an `=', we have a default argument. */
13488 {
13489 /* Consume the `=' token. */
13491 /* Parse the default-argument. */
13495 /* Template parameter packs cannot have default
13496 arguments. */
13498 {
13501 "template parameter pack %qD cannot have a "
13503 else
13505 "template parameter packs cannot have "
13508 }
13512 }
13513 else
13516 /* Create the combined representation of the parameter and the
13517 default argument. */
13519 }
13523 {
13524 tree identifier;
13525 tree default_argument;
13527 /* Look for the `<'. */
13529 /* Parse the template-parameter-list. */
13531 /* Look for the `>'. */
13533 /* Look for the `class' or 'typename' keywords. */
13535 /* If the next token is an ellipsis, we have a template
13536 argument pack. */
13538 {
13539 /* Consume the `...' token. */
13544 }
13545 /* If the next token is an `=', then there is a
13546 default-argument. If the next token is a `>', we are at
13547 the end of the parameter-list. If the next token is a `,',
13548 then we are at the end of this parameter. */
13552 {
13554 /* Treat invalid names as if the parameter were nameless. */
13557 }
13558 else
13561 /* Create the template parameter. */
13563 identifier);
13565 /* If the next token is an `=', then there is a
13566 default-argument. */
13568 {
13571 /* Consume the `='. */
13573 /* Parse the id-expression. */
13575 /* save token before parsing the id-expression, for error
13576 reporting */
13578 default_argument
13586 /* If the id-expression was a template-id that refers to
13587 a template-class, we already have the declaration here,
13588 so no further lookup is needed. */
13589 ;
13590 else
13591 /* Look up the name. */
13592 default_argument
13594 none_type,
13600 /* See if the default argument is valid. */
13601 default_argument
13604 /* Template parameter packs cannot have default
13605 arguments. */
13607 {
13610 "template parameter pack %qD cannot "
13612 identifier);
13613 else
13617 }
13619 }
13620 else
13623 /* Create the combined representation of the parameter and the
13624 default argument. */
13626 }
13632 }
13635 }
13637 /* Parse a template-id.
13639 template-id:
13640 template-name < template-argument-list [opt] >
13642 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13643 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13644 returned. Otherwise, if the template-name names a function, or set
13645 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13646 names a class, returns a TYPE_DECL for the specialization.
13648 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13649 uninstantiated templates. */
13651 static tree
13657 {
13659 tree templ;
13660 tree arguments;
13661 tree template_id;
13668 /* If the next token corresponds to a template-id, there is no need
13669 to reparse it. */
13672 {
13675 /* Get the stored value. */
13677 /* Perform any access checks that were deferred. */
13680 {
13685 tf_warning_or_error);
13686 }
13687 /* Return the stored value. */
13689 }
13691 /* Avoid performing name lookup if there is no possibility of
13692 finding a template-id. */
13695 && !cp_parser_nth_token_starts_template_argument_list_p
13697 {
13700 }
13702 /* Remember where the template-id starts. */
13708 /* Parse the template-name. */
13711 check_dependency_p,
13712 is_declaration,
13713 tag_type,
13716 {
13719 }
13721 /* If we find the sequence `[:' after a template-name, it's probably
13722 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13723 parse correctly the argument list. */
13730 {
13732 /* Change `:' into `::'. */
13734 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13735 CPP_LESS. */
13738 /* Parse the arguments. */
13741 {
13742 /* If we couldn't parse an argument list, then we revert our changes
13743 and return simply an error. Maybe this is not a template-id
13744 after all. */
13749 }
13750 /* Otherwise, emit an error about the invalid digraph, but continue
13751 parsing because we got our argument list. */
13754 {
13757 "%<<:%> is an alternate spelling for %<[%>."
13760 {
13762 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13765 }
13766 }
13767 }
13768 else
13769 {
13770 /* Look for the `<' that starts the template-argument-list. */
13772 {
13775 }
13776 /* Parse the arguments. */
13778 }
13780 /* Build a representation of the specialization. */
13783 TEMPLATE_ID_EXPR,
13787 {
13789 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13790 template (rather than some instantiation thereof) only if
13791 is not nested within some other construct. For example, in
13792 "template <typename T> void f(T) { A<T>::", A<T> is just an
13793 instantiation of A. */
13796 CPP_SCOPE));
13797 template_id
13799 }
13801 {
13803 }
13804 else
13805 {
13806 /* If it's not a class-template or a template-template, it should be
13807 a function-template. */
13813 }
13815 /* If parsing tentatively, replace the sequence of tokens that makes
13816 up the template-id with a CPP_TEMPLATE_ID token. That way,
13817 should we re-parse the token stream, we will not have to repeat
13818 the effort required to do the parse, nor will we issue duplicate
13819 error messages about problems during instantiation of the
13820 template. */
13822 /* Don't do this if we had a parse error in a declarator; re-parsing
13823 might succeed if a name changes meaning (60361). */
13827 {
13830 /* Reset the contents of the START_OF_ID token. */
13832 /* Retrieve any deferred checks. Do not pop this access checks yet
13833 so the memory will not be reclaimed during token replacing below. */
13839 /* Purge all subsequent tokens. */
13842 /* ??? Can we actually assume that, if template_id ==
13843 error_mark_node, we will have issued a diagnostic to the
13844 user, as opposed to simply marking the tentative parse as
13845 failed? */
13848 }
13852 }
13854 /* Parse a template-name.
13856 template-name:
13857 identifier
13859 The standard should actually say:
13861 template-name:
13862 identifier
13863 operator-function-id
13865 A defect report has been filed about this issue.
13867 A conversion-function-id cannot be a template name because they cannot
13868 be part of a template-id. In fact, looking at this code:
13870 a.operator K<int>()
13872 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13873 It is impossible to call a templated conversion-function-id with an
13874 explicit argument list, since the only allowed template parameter is
13875 the type to which it is converting.
13877 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13878 `template' keyword, in a construction like:
13880 T::template f<3>()
13882 In that case `f' is taken to be a template-name, even though there
13883 is no way of knowing for sure.
13885 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13886 name refers to a set of overloaded functions, at least one of which
13887 is a template, or an IDENTIFIER_NODE with the name of the template,
13888 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13889 names are looked up inside uninstantiated templates. */
13891 static tree
13898 {
13899 tree identifier;
13900 tree decl;
13901 tree fns;
13904 /* If the next token is `operator', then we have either an
13905 operator-function-id or a conversion-function-id. */
13907 {
13908 /* We don't know whether we're looking at an
13909 operator-function-id or a conversion-function-id. */
13911 /* Try an operator-function-id. */
13913 /* If that didn't work, try a conversion-function-id. */
13915 {
13918 }
13919 }
13920 /* Look for the identifier. */
13921 else
13924 /* If we didn't find an identifier, we don't have a template-id. */
13928 /* If the name immediately followed the `template' keyword, then it
13929 is a template-name. However, if the next token is not `<', then
13930 we do not treat it as a template-name, since it is not being used
13931 as part of a template-id. This enables us to handle constructs
13932 like:
13934 template <typename T> struct S { S(); };
13935 template <typename T> S<T>::S();
13937 correctly. We would treat `S' as a template -- if it were `S<T>'
13938 -- but we do not if there is no `<'. */
13942 {
13943 /* In a declaration, in a dependent context, we pretend that the
13944 "template" keyword was present in order to improve error
13945 recovery. For example, given:
13947 template <typename T> void f(T::X<int>);
13949 we want to treat "X<int>" as a template-id. */
13951 && !template_keyword_p
13953 && check_dependency_p
13955 /* Do not do this for dtors (or ctors), since they never
13956 need the template keyword before their name. */
13958 {
13961 /* Explain what went wrong. */
13963 identifier);
13966 /* If parsing tentatively, find the location of the "<" token. */
13969 /* Parse the template arguments so that we can issue error
13970 messages about them. */
13973 /* Skip tokens until we find a good place from which to
13974 continue parsing. */
13979 /* If parsing tentatively, permanently remove the
13980 template argument list. That will prevent duplicate
13981 error messages from being issued about the missing
13982 "template" keyword. */
13988 }
13990 /* If the "template" keyword is present, then there is generally
13991 no point in doing name-lookup, so we just return IDENTIFIER.
13992 But, if the qualifying scope is non-dependent then we can
13993 (and must) do name-lookup normally. */
13999 }
14001 /* Look up the name. */
14003 tag_type,
14006 check_dependency_p,
14010 /* If DECL is a template, then the name was a template-name. */
14012 {
14016 }
14017 else
14018 {
14021 /* The standard does not explicitly indicate whether a name that
14022 names a set of overloaded declarations, some of which are
14023 templates, is a template-name. However, such a name should
14024 be a template-name; otherwise, there is no way to form a
14025 template-id for the overloaded templates. */
14033 {
14034 /* The name does not name a template. */
14037 }
14038 }
14040 /* If DECL is dependent, and refers to a function, then just return
14041 its name; we will look it up again during template instantiation. */
14043 {
14047 }
14050 }
14052 /* Parse a template-argument-list.
14054 template-argument-list:
14055 template-argument ... [opt]
14056 template-argument-list , template-argument ... [opt]
14058 Returns a TREE_VEC containing the arguments. */
14060 static tree
14062 {
14067 tree vec;
14074 /* Even if the template-id appears in an integral
14075 constant-expression, the contents of the argument list do
14076 not. */
14082 /* Parse the arguments. */
14083 do
14084 {
14085 tree argument;
14088 /* Consume the comma. */
14091 /* Parse the template-argument. */
14094 /* If the next token is an ellipsis, we're expanding a template
14095 argument pack. */
14097 {
14099 {
14103 }
14104 /* Consume the `...' token. */
14107 /* Make the argument into a TYPE_PACK_EXPANSION or
14108 EXPR_PACK_EXPANSION. */
14110 }
14113 {
14117 {
14120 }
14121 else
14123 }
14125 }
14138 #ifdef ENABLE_CHECKING
14140 #endif
14142 }
14144 /* Parse a template-argument.
14146 template-argument:
14147 assignment-expression
14148 type-id
14149 id-expression
14151 The representation is that of an assignment-expression, type-id, or
14152 id-expression -- except that the qualified id-expression is
14153 evaluated, so that the value returned is either a DECL or an
14154 OVERLOAD.
14156 Although the standard says "assignment-expression", it forbids
14157 throw-expressions or assignments in the template argument.
14158 Therefore, we use "conditional-expression" instead. */
14160 static tree
14162 {
14163 tree argument;
14169 cp_id_kind idk;
14171 /* There's really no way to know what we're looking at, so we just
14172 try each alternative in order.
14174 [temp.arg]
14176 In a template-argument, an ambiguity between a type-id and an
14177 expression is resolved to a type-id, regardless of the form of
14178 the corresponding template-parameter.
14180 Therefore, we try a type-id first. */
14183 /* If there was no error parsing the type-id but the next token is a
14184 '>>', our behavior depends on which dialect of C++ we're
14185 parsing. In C++98, we probably found a typo for '> >'. But there
14186 are type-id which are also valid expressions. For instance:
14188 struct X { int operator >> (int); };
14189 template <int V> struct Foo {};
14190 Foo<X () >> 5> r;
14192 Here 'X()' is a valid type-id of a function type, but the user just
14193 wanted to write the expression "X() >> 5". Thus, we remember that we
14194 found a valid type-id, but we still try to parse the argument as an
14195 expression to see what happens.
14197 In C++0x, the '>>' will be considered two separate '>'
14198 tokens. */
14202 {
14205 }
14206 else
14207 {
14208 /* If the next token isn't a `,' or a `>', then this argument wasn't
14209 really finished. This means that the argument is not a valid
14210 type-id. */
14213 /* If that worked, we're done. */
14216 }
14217 /* We're still not sure what the argument will be. */
14219 /* Try a template. */
14227 /* If the next token isn't a `,' or a `>', then this argument wasn't
14228 really finished. */
14232 {
14233 /* Figure out what is being referred to. If the id-expression
14234 was for a class template specialization, then we will have a
14235 TYPE_DECL at this point. There is no need to do name lookup
14236 at this point in that case. */
14239 none_type,
14248 }
14250 {
14254 }
14255 /* It must be a non-type argument. There permitted cases are given
14256 in [temp.arg.nontype]:
14258 -- an integral constant-expression of integral or enumeration
14259 type; or
14261 -- the name of a non-type template-parameter; or
14263 -- the name of an object or function with external linkage...
14265 -- the address of an object or function with external linkage...
14267 -- a pointer to member... */
14268 /* Look for a non-type template parameter. */
14270 {
14282 }
14284 /* If the next token is "&", the argument must be the address of an
14285 object or function with external linkage. */
14288 {
14291 }
14292 /* See if we might have an id-expression. */
14299 {
14302 address_p,
14309 else
14310 {
14311 tree probe;
14314 {
14315 /* Strip the dereference temporarily. */
14318 }
14320 /* If we're in a template, we represent a qualified-id referring
14321 to a static data member as a SCOPE_REF even if the scope isn't
14322 dependent so that we can check access control later. */
14327 {
14328 /* A variable without external linkage might still be a
14329 valid constant-expression, so no error is issued here
14330 if the external-linkage check fails. */
14333 }
14335 /* All overloaded functions are allowed; if the external
14336 linkage test does not pass, an error will be issued
14337 later. */
14338 ;
14342 /* A pointer-to-member. */
14343 ;
14345 ;
14346 else
14350 {
14353 tf_warning_or_error);
14354 else
14357 }
14358 }
14359 }
14360 /* If the argument started with "&", there are no other valid
14361 alternatives at this point. */
14363 {
14366 }
14368 /* If the argument wasn't successfully parsed as a type-id followed
14369 by '>>', the argument can only be a constant expression now.
14370 Otherwise, we try parsing the constant-expression tentatively,
14371 because the argument could really be a type-id. */
14382 /* We did our best to parse the argument as a non type-id, but that
14383 was the only alternative that matched (albeit with a '>' after
14384 it). We can assume it's just a typo from the user, and a
14385 diagnostic will then be issued. */
14387 }
14389 /* Parse an explicit-instantiation.
14391 explicit-instantiation:
14392 template declaration
14394 Although the standard says `declaration', what it really means is:
14396 explicit-instantiation:
14397 template decl-specifier-seq [opt] declarator [opt] ;
14399 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14400 supposed to be allowed. A defect report has been filed about this
14401 issue.
14403 GNU Extension:
14405 explicit-instantiation:
14406 storage-class-specifier template
14407 decl-specifier-seq [opt] declarator [opt] ;
14408 function-specifier template
14409 decl-specifier-seq [opt] declarator [opt] ; */
14411 static void
14413 {
14415 cp_decl_specifier_seq decl_specifiers;
14420 /* Look for an (optional) storage-class-specifier or
14421 function-specifier. */
14423 {
14424 extension_specifier
14427 extension_specifier
14430 }
14432 /* Look for the `template' keyword. */
14434 /* Let the front end know that we are processing an explicit
14435 instantiation. */
14437 /* [temp.explicit] says that we are supposed to ignore access
14438 control while processing explicit instantiation directives. */
14440 /* Parse a decl-specifier-seq. */
14442 CP_PARSER_FLAGS_OPTIONAL,
14445 /* If there was exactly one decl-specifier, and it declared a class,
14446 and there's no declarator, then we have an explicit type
14447 instantiation. */
14449 {
14450 tree type;
14454 /* Turn access control back on for names used during
14455 template instantiation. */
14460 }
14461 else
14462 {
14464 tree decl;
14466 /* Parse the declarator. */
14467 declarator
14478 {
14481 "explicit instantiation shall not use"
14485 "explicit instantiation shall not use"
14490 /* Turn access control back on for names used during
14491 template instantiation. */
14493 /* Do the explicit instantiation. */
14495 }
14496 else
14497 {
14499 /* Skip the body of the explicit instantiation. */
14501 }
14502 }
14503 /* We're done with the instantiation. */
14509 }
14511 /* Parse an explicit-specialization.
14513 explicit-specialization:
14514 template < > declaration
14516 Although the standard says `declaration', what it really means is:
14518 explicit-specialization:
14519 template <> decl-specifier [opt] init-declarator [opt] ;
14520 template <> function-definition
14521 template <> explicit-specialization
14522 template <> template-declaration */
14524 static void
14526 {
14530 /* Look for the `template' keyword. */
14532 /* Look for the `<'. */
14534 /* Look for the `>'. */
14536 /* We have processed another parameter list. */
14538 /* [temp]
14540 A template ... explicit specialization ... shall not have C
14541 linkage. */
14543 {
14545 /* Give it C++ linkage to avoid confusing other parts of the
14546 front end. */
14549 }
14550 else
14552 /* Let the front end know that we are beginning a specialization. */
14554 {
14557 }
14559 /* If the next keyword is `template', we need to figure out whether
14560 or not we're looking a template-declaration. */
14562 {
14567 else
14569 }
14570 else
14571 /* Parse the dependent declaration. */
14577 /* We're done with the specialization. */
14579 /* For the erroneous case of a template with C linkage, we pushed an
14580 implicit C++ linkage scope; exit that scope now. */
14583 /* We're done with this parameter list. */
14585 }
14587 /* Parse a type-specifier.
14589 type-specifier:
14590 simple-type-specifier
14591 class-specifier
14592 enum-specifier
14593 elaborated-type-specifier
14594 cv-qualifier
14596 GNU Extension:
14598 type-specifier:
14599 __complex__
14601 Returns a representation of the type-specifier. For a
14602 class-specifier, enum-specifier, or elaborated-type-specifier, a
14603 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14605 The parser flags FLAGS is used to control type-specifier parsing.
14607 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14608 in a decl-specifier-seq.
14610 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14611 class-specifier, enum-specifier, or elaborated-type-specifier, then
14612 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14613 if a type is declared; 2 if it is defined. Otherwise, it is set to
14614 zero.
14616 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14617 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14618 is set to FALSE. */
14620 static tree
14622 cp_parser_flags flags,
14627 {
14633 /* Assume this type-specifier does not declare a new type. */
14636 /* And that it does not specify a cv-qualifier. */
14639 /* Peek at the next token. */
14642 /* If we're looking at a keyword, we can use that to guide the
14643 production we choose. */
14646 {
14651 /* Look for the enum-specifier. */
14653 /* If that worked, we're done. */
14655 {
14660 type_spec,
14661 token,
14664 }
14665 else
14668 /* Any of these indicate either a class-specifier, or an
14669 elaborated-type-specifier. */
14676 /* Parse tentatively so that we can back up if we don't find a
14677 class-specifier. */
14679 /* Look for the class-specifier. */
14682 /* If that worked, we're done. */
14684 {
14689 type_spec,
14690 token,
14693 }
14695 /* Fall through. */
14696 elaborated_type_specifier:
14697 /* We're declaring (not defining) a class or enum. */
14701 /* Fall through. */
14703 /* Look for an elaborated-type-specifier. */
14704 type_spec
14705 = (cp_parser_elaborated_type_specifier
14708 is_declaration));
14711 type_spec,
14712 token,
14735 /* The `__complex__' keyword is a GNU extension. */
14741 }
14743 /* Handle simple keywords. */
14745 {
14747 {
14750 }
14752 }
14754 /* If we do not already have a type-specifier, assume we are looking
14755 at a simple-type-specifier. */
14757 decl_specs,
14758 flags);
14760 /* If we didn't find a type-specifier, and a type-specifier was not
14761 optional in this context, issue an error message. */
14763 {
14766 }
14769 }
14771 /* Parse a simple-type-specifier.
14773 simple-type-specifier:
14774 :: [opt] nested-name-specifier [opt] type-name
14775 :: [opt] nested-name-specifier template template-id
14776 char
14777 wchar_t
14778 bool
14779 short
14780 int
14781 long
14782 signed
14783 unsigned
14784 float
14785 double
14786 void
14788 C++0x Extension:
14790 simple-type-specifier:
14791 auto
14792 decltype ( expression )
14793 char16_t
14794 char32_t
14795 __underlying_type ( type-id )
14797 GNU Extension:
14799 simple-type-specifier:
14800 __int128
14801 __typeof__ unary-expression
14802 __typeof__ ( type-id )
14803 __typeof__ ( type-id ) { initializer-list , [opt] }
14805 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14806 appropriately updated. */
14808 static tree
14811 cp_parser_flags flags)
14812 {
14817 /* Peek at the next token. */
14820 /* If we're looking at a keyword, things are easy. */
14822 {
14857 {
14860 }
14889 {
14892 else
14896 {
14899 "use of %<auto%> in lambda parameter declaration "
14900 "only available with "
14902 }
14905 "use of %<auto%> in parameter declaration "
14906 "only available with "
14908 else
14910 "ISO C++ forbids use of %<auto%> in parameter "
14912 }
14913 else
14918 /* Since DR 743, decltype can either be a simple-type-specifier by
14919 itself or begin a nested-name-specifier. Parsing it will replace
14920 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14921 handling below decide what to do. */
14927 /* Consume the `typeof' token. */
14929 /* Parse the operand to `typeof'. */
14931 /* If it is not already a TYPE, take its type. */
14937 token,
14946 token,
14956 token,
14961 }
14963 /* If token is an already-parsed decltype not followed by ::,
14964 it's a simple-type-specifier. */
14967 {
14970 {
14972 token,
14974 /* Remember that we are handling a decltype in order to
14975 implement the resolution of DR 1510 when the argument
14976 isn't instantiation dependent. */
14978 }
14981 }
14983 /* If the type-specifier was for a built-in type, we're done. */
14985 {
14986 /* Record the type. */
14993 type,
14994 token,
14999 /* Consume the token. */
15005 /* There is no valid C++ program where a non-template type is
15006 followed by a "<". That usually indicates that the user thought
15007 that the type was a template. */
15012 }
15014 /* The type-specifier must be a user-defined type. */
15016 {
15020 /* Don't gobble tokens or issue error messages if this is an
15021 optional type-specifier. */
15025 /* Look for the optional `::' operator. */
15026 global_p
15030 /* Look for the nested-name specifier. */
15031 qualified_p
15039 /* If we have seen a nested-name-specifier, and the next token
15040 is `template', then we are using the template-id production. */
15043 {
15044 /* Look for the template-id. */
15048 none_type,
15050 /* If the template-id did not name a type, we are out of
15051 luck. */
15053 {
15056 }
15057 }
15058 /* Otherwise, look for a type-name. */
15059 else
15061 /* Keep track of all name-lookups performed in class scopes. */
15063 && !global_p
15064 && !qualified_p
15068 /* If it didn't work out, we don't have a TYPE. */
15074 token,
15076 }
15078 /* If we didn't get a type-name, issue an error message. */
15080 {
15083 }
15086 {
15087 /* See if TYPE is an Objective-C type, and if so, parse and
15088 accept any protocol references following it. Do this before
15089 the cp_parser_check_for_invalid_template_id() call, because
15090 Objective-C types can be followed by '<...>' which would
15091 enclose protocol names rather than template arguments, and so
15092 everything is fine. */
15095 {
15099 /* Clobber the "unqualified" type previously entered into
15100 DECL_SPECS with the new, improved protocol-qualified version. */
15105 }
15107 /* There is no valid C++ program where a non-template type is
15108 followed by a "<". That usually indicates that the user
15109 thought that the type was a template. */
15111 none_type,
15113 }
15116 }
15118 /* Parse a type-name.
15120 type-name:
15121 class-name
15122 enum-name
15123 typedef-name
15124 simple-template-id [in c++0x]
15126 enum-name:
15127 identifier
15129 typedef-name:
15130 identifier
15132 Returns a TYPE_DECL for the type. */
15134 static tree
15136 {
15137 tree type_decl;
15139 /* We can't know yet whether it is a class-name or not. */
15141 /* Try a class-name. */
15145 none_type,
15149 /* If it's not a class-name, keep looking. */
15151 {
15153 /* It must be a typedef-name or an enum-name. */
15157 /* It is either a simple-template-id representing an
15158 instantiation of an alias template... */
15162 none_type,
15164 /* Note that this must be an instantiation of an alias template
15165 because [temp.names]/6 says:
15167 A template-id that names an alias template specialization
15168 is a type-name.
15170 Whereas [temp.names]/7 says:
15172 A simple-template-id that names a class template
15173 specialization is a class-name. */
15178 else
15182 /* ... Or a typedef-name or an enum-name. */
15184 }
15187 }
15189 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15191 enum-name:
15192 identifier
15194 typedef-name:
15195 identifier
15197 Returns a TYPE_DECL for the type. */
15199 static tree
15201 {
15202 tree type_decl;
15203 tree identifier;
15210 /* Look up the type-name. */
15217 {
15218 /* See if this is an Objective-C type. */
15223 }
15225 /* Issue an error if we did not find a type-name. */
15227 /* In Objective-C, we have the complication that class names are
15228 normally type names and start declarations (eg, the
15229 "NSObject" in "NSObject *object;"), but can be used in an
15230 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15231 is an expression. So, a classname followed by a dot is not a
15232 valid type-name. */
15235 {
15240 }
15241 /* Remember that the name was used in the definition of the
15242 current class so that we can check later to see if the
15243 meaning would have been different after the class was
15244 entirely defined. */
15250 }
15252 /* Parse an elaborated-type-specifier. Note that the grammar given
15253 here incorporates the resolution to DR68.
15255 elaborated-type-specifier:
15256 class-key :: [opt] nested-name-specifier [opt] identifier
15257 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15258 enum-key :: [opt] nested-name-specifier [opt] identifier
15259 typename :: [opt] nested-name-specifier identifier
15260 typename :: [opt] nested-name-specifier template [opt]
15261 template-id
15263 GNU extension:
15265 elaborated-type-specifier:
15266 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15267 class-key attributes :: [opt] nested-name-specifier [opt]
15268 template [opt] template-id
15269 enum attributes :: [opt] nested-name-specifier [opt] identifier
15271 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15272 declared `friend'. If IS_DECLARATION is TRUE, then this
15273 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15274 something is being declared.
15276 Returns the TYPE specified. */
15278 static tree
15282 {
15284 tree identifier;
15287 tree globalscope;
15290 /* See if we're looking at the `enum' keyword. */
15292 {
15293 /* Consume the `enum' token. */
15295 /* Remember that it's an enumeration type. */
15297 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15298 enums) is used here. */
15301 {
15305 /* Consume the `struct' or `class' and parse it anyway. */
15307 }
15308 /* Parse the attributes. */
15310 }
15311 /* Or, it might be `typename'. */
15313 RID_TYPENAME))
15314 {
15315 /* Consume the `typename' token. */
15317 /* Remember that it's a `typename' type. */
15319 }
15320 /* Otherwise it must be a class-key. */
15321 else
15322 {
15326 /* Parse the attributes. */
15328 }
15330 /* Look for the `::' operator. */
15333 /* Look for the nested-name-specifier. */
15335 {
15340 is_declaration))
15342 }
15343 else
15344 /* Even though `typename' is not present, the proposed resolution
15345 to Core Issue 180 says that in `class A<T>::B', `B' should be
15346 considered a type-name, even if `A<T>' is dependent. */
15351 is_declaration);
15352 /* For everything but enumeration types, consider a template-id.
15353 For an enumeration type, consider only a plain identifier. */
15355 {
15357 tree decl;
15359 /* Allow the `template' keyword. */
15361 /* If we didn't see `template', we don't know if there's a
15362 template-id or not. */
15365 /* Parse the template-id. */
15369 tag_type,
15370 is_declaration);
15371 /* If we didn't find a template-id, look for an ordinary
15372 identifier. */
15374 ;
15375 /* We can get here when cp_parser_template_id, called by
15376 cp_parser_class_name with tag_type == none_type, succeeds
15377 and caches a BASELINK. Then, when called again here,
15378 instead of failing and returning an error_mark_node
15379 returns it (see template/typename17.C in C++11).
15380 ??? Could we diagnose this earlier? */
15382 {
15385 }
15386 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15387 in effect, then we must assume that, upon instantiation, the
15388 template will correspond to a class. */
15392 typename_type,
15394 /* If the `typename' keyword is in effect and DECL is not a type
15395 decl, then type is non existent. */
15397 ;
15403 }
15406 {
15411 {
15414 }
15416 /* For a `typename', we needn't call xref_tag. */
15422 /* Template parameter lists apply only if we are not within a
15423 function parameter list. */
15424 bool template_parm_lists_apply
15433 /* Look up a qualified name in the usual way. */
15435 {
15436 tree decl;
15437 tree ambiguous_decls;
15440 tag_type,
15447 /* If the lookup was ambiguous, an error will already have been
15448 issued. */
15452 /* If we are parsing friend declaration, DECL may be a
15453 TEMPLATE_DECL tree node here. However, we need to check
15454 whether this TEMPLATE_DECL results in valid code. Consider
15455 the following example:
15457 namespace N {
15458 template <class T> class C {};
15459 }
15460 class X {
15461 template <class T> friend class N::C; // #1, valid code
15462 };
15463 template <class T> class Y {
15464 friend class N::C; // #2, invalid code
15465 };
15467 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15468 name lookup of `N::C'. We see that friend declaration must
15469 be template for the code to be valid. Note that
15470 processing_template_decl does not work here since it is
15471 always 1 for the above two cases. */
15473 decl = (cp_parser_maybe_treat_template_as_class
15478 {
15480 identifier,
15483 }
15486 {
15490 allow_template);
15494 }
15496 /* Forward declarations of nested types, such as
15498 class C1::C2;
15499 class C1::C2::C3;
15501 are invalid unless all components preceding the final '::'
15502 are complete. If all enclosing types are complete, these
15503 declarations become merely pointless.
15505 Invalid forward declarations of nested types are errors
15506 caught elsewhere in parsing. Those that are pointless arrive
15507 here. */
15514 }
15515 else
15516 {
15517 /* An elaborated-type-specifier sometimes introduces a new type and
15518 sometimes names an existing type. Normally, the rule is that it
15519 introduces a new type only if there is not an existing type of
15520 the same name already in scope. For example, given:
15522 struct S {};
15523 void f() { struct S s; }
15525 the `struct S' in the body of `f' is the same `struct S' as in
15526 the global scope; the existing definition is used. However, if
15527 there were no global declaration, this would introduce a new
15528 local class named `S'.
15530 An exception to this rule applies to the following code:
15532 namespace N { struct S; }
15534 Here, the elaborated-type-specifier names a new type
15535 unconditionally; even if there is already an `S' in the
15536 containing scope this declaration names a new type.
15537 This exception only applies if the elaborated-type-specifier
15538 forms the complete declaration:
15540 [class.name]
15542 A declaration consisting solely of `class-key identifier ;' is
15543 either a redeclaration of the name in the current scope or a
15544 forward declaration of the identifier as a class name. It
15545 introduces the name into the current scope.
15547 We are in this situation precisely when the next token is a `;'.
15549 An exception to the exception is that a `friend' declaration does
15550 *not* name a new type; i.e., given:
15552 struct S { friend struct T; };
15554 `T' is not a new type in the scope of `S'.
15556 Also, `new struct S' or `sizeof (struct S)' never results in the
15557 definition of a new type; a new type can only be declared in a
15558 declaration context. */
15560 tag_scope ts;
15564 /* Friends have special name lookup rules. */
15568 CPP_SEMICOLON))
15569 /* This is a `class-key identifier ;' */
15571 else
15574 template_p =
15575 (template_parm_lists_apply
15578 /* An unqualified name was used to reference this type, so
15579 there were no qualifying templates. */
15587 }
15588 }
15593 /* Allow attributes on forward declarations of classes. */
15595 {
15605 else
15608 }
15611 {
15612 /* Indicate whether this class was declared as a `class' or as a
15613 `struct'. */
15617 }
15619 /* A "<" cannot follow an elaborated type specifier. If that
15620 happens, the user was probably trying to form a template-id. */
15625 }
15627 /* Parse an enum-specifier.
15629 enum-specifier:
15630 enum-head { enumerator-list [opt] }
15631 enum-head { enumerator-list , } [C++0x]
15633 enum-head:
15634 enum-key identifier [opt] enum-base [opt]
15635 enum-key nested-name-specifier identifier enum-base [opt]
15637 enum-key:
15638 enum
15639 enum class [C++0x]
15640 enum struct [C++0x]
15642 enum-base: [C++0x]
15643 : type-specifier-seq
15645 opaque-enum-specifier:
15646 enum-key identifier enum-base [opt] ;
15648 GNU Extensions:
15649 enum-key attributes[opt] identifier [opt] enum-base [opt]
15650 { enumerator-list [opt] }attributes[opt]
15651 enum-key attributes[opt] identifier [opt] enum-base [opt]
15652 { enumerator-list, }attributes[opt] [C++0x]
15654 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15655 if the token stream isn't an enum-specifier after all. */
15657 static tree
15659 {
15660 tree identifier;
15662 tree prev_scope;
15664 tree attributes;
15677 /* Parse tentatively so that we can back up if we don't find a
15678 enum-specifier. */
15681 /* Caller guarantees that the current token is 'enum', an identifier
15682 possibly follows, and the token after that is an opening brace.
15683 If we don't have an identifier, fabricate an anonymous name for
15684 the enumeration being defined. */
15687 /* Parse the "class" or "struct", which indicates a scoped
15688 enumeration type in C++0x. */
15691 {
15695 /* Consume the `struct' or `class' token. */
15699 }
15703 /* Clear the qualification. */
15708 /* Figure out in what scope the declaration is being placed. */
15714 nested_name_specifier
15722 {
15723 tree name;
15727 enum_type,
15732 input_location);
15734 {
15737 {
15738 /* Are template enums allowed in ISO? */
15742 /* ignore a typename reference, for it will be solved by name
15743 in start_enum. */
15745 }
15746 }
15749 else
15752 }
15753 else
15754 {
15757 else
15758 {
15764 }
15765 }
15768 /* Check for the `:' that denotes a specified underlying type in C++0x.
15769 Note that a ':' could also indicate a bitfield width, however. */
15771 {
15772 cp_decl_specifier_seq type_specifiers;
15774 /* Consume the `:'. */
15777 /* Parse the type-specifier-seq. */
15782 /* At this point this is surely not elaborated type specifier. */
15791 /* If that didn't work, stop. */
15793 {
15799 }
15800 }
15802 /* Look for the `{' but don't consume it yet. */
15804 {
15806 {
15809 {
15812 }
15813 }
15814 /* An opaque-enum-specifier must have a ';' here. */
15817 {
15820 {
15823 }
15824 }
15825 }
15831 {
15833 {
15837 }
15839 {
15841 }
15842 }
15844 /* Issue an error message if type-definitions are forbidden here. */
15847 else
15848 /* Create the new type. We do this before consuming the opening
15849 brace so the enum will be recorded as being on the line of its
15850 tag (or the 'enum' keyword, if there is no tag). */
15854 /* If the next token is not '{' it is an opaque-enum-specifier or an
15855 elaborated-type-specifier. */
15857 {
15861 {
15862 /* The following catches invalid code such as:
15863 enum class S<int>::E { A, B, C }; */
15871 {
15875 nested_name_specifier);
15877 }
15878 /* If that scope does not contain the scope in which the
15879 class was originally declared, the program is invalid. */
15881 nested_name_specifier))
15882 {
15885 "declaration of %qD in namespace %qD which does not "
15888 else
15890 "declaration of %qD in %qD which does not "
15894 }
15895 }
15900 /* Consume the opening brace. */
15907 {
15911 }
15912 else
15913 {
15919 }
15923 /* If the next token is not '}', then there are some enumerators. */
15925 {
15929 }
15930 else
15933 /* Consume the final '}'. */
15939 }
15940 else
15941 {
15942 /* If a ';' follows, then it is an opaque-enum-specifier
15943 and additional restrictions apply. */
15945 {
15952 }
15953 }
15955 /* Look for trailing attributes to apply to this enumeration, and
15956 apply them if appropriate. */
15958 {
15962 trailing_attr,
15964 }
15966 /* Finish up the enumeration. */
15968 {
15973 }
15976 {
15978 {
15981 }
15983 {
15985 }
15986 }
15987 out:
15990 }
15992 /* Parse an enumerator-list. The enumerators all have the indicated
15993 TYPE.
15995 enumerator-list:
15996 enumerator-definition
15997 enumerator-list , enumerator-definition */
15999 static void
16001 {
16003 {
16004 /* Parse an enumerator-definition. */
16007 /* If the next token is not a ',', we've reached the end of
16008 the list. */
16011 /* Otherwise, consume the `,' and keep going. */
16013 /* If the next token is a `}', there is a trailing comma. */
16015 {
16020 }
16021 }
16022 }
16024 /* Parse an enumerator-definition. The enumerator has the indicated
16025 TYPE.
16027 enumerator-definition:
16028 enumerator
16029 enumerator = constant-expression
16031 enumerator:
16032 identifier */
16034 static void
16036 {
16037 tree identifier;
16038 tree value;
16039 location_t loc;
16041 /* Save the input location because we are interested in the location
16042 of the identifier and not the location of the explicit value. */
16045 /* Look for the identifier. */
16050 /* If the next token is an '=', then there is an explicit value. */
16052 {
16053 /* Consume the `=' token. */
16055 /* Parse the value. */
16057 }
16058 else
16061 /* If we are processing a template, make sure the initializer of the
16062 enumerator doesn't contain any bare template parameter pack. */
16066 /* Create the enumerator. */
16068 }
16070 /* Parse a namespace-name.
16072 namespace-name:
16073 original-namespace-name
16074 namespace-alias
16076 Returns the NAMESPACE_DECL for the namespace. */
16078 static tree
16080 {
16081 tree identifier;
16082 tree namespace_decl;
16086 /* Get the name of the namespace. */
16091 /* Look up the identifier in the currently active scope. Look only
16092 for namespaces, due to:
16094 [basic.lookup.udir]
16096 When looking up a namespace-name in a using-directive or alias
16097 definition, only namespace names are considered.
16099 And:
16101 [basic.lookup.qual]
16103 During the lookup of a name preceding the :: scope resolution
16104 operator, object, function, and enumerator names are ignored.
16106 (Note that cp_parser_qualifying_entity only calls this
16107 function if the token after the name is the scope resolution
16108 operator.) */
16110 none_type,
16116 /* If it's not a namespace, issue an error. */
16119 {
16124 }
16127 }
16129 /* Parse a namespace-definition.
16131 namespace-definition:
16132 named-namespace-definition
16133 unnamed-namespace-definition
16135 named-namespace-definition:
16136 original-namespace-definition
16137 extension-namespace-definition
16139 original-namespace-definition:
16140 namespace identifier { namespace-body }
16142 extension-namespace-definition:
16143 namespace original-namespace-name { namespace-body }
16145 unnamed-namespace-definition:
16146 namespace { namespace-body } */
16148 static void
16150 {
16157 {
16161 }
16162 else
16165 /* Look for the `namespace' keyword. */
16168 /* Get the name of the namespace. We do not attempt to distinguish
16169 between an original-namespace-definition and an
16170 extension-namespace-definition at this point. The semantic
16171 analysis routines are responsible for that. */
16174 else
16177 /* Parse any specified attributes. */
16180 /* Look for the `{' to start the namespace. */
16182 /* Start the namespace. */
16185 /* "inline namespace" is equivalent to a stub namespace definition
16186 followed by a strong using directive. */
16188 {
16190 /* Set up namespace association. */
16194 /* Import the contents of the inline namespace. */
16198 }
16202 /* Parse the body of the namespace. */
16208 /* Finish the namespace. */
16210 /* Look for the final `}'. */
16212 }
16214 /* Parse a namespace-body.
16216 namespace-body:
16217 declaration-seq [opt] */
16219 static void
16221 {
16223 }
16225 /* Parse a namespace-alias-definition.
16227 namespace-alias-definition:
16228 namespace identifier = qualified-namespace-specifier ; */
16230 static void
16232 {
16233 tree identifier;
16234 tree namespace_specifier;
16238 /* Look for the `namespace' keyword. */
16240 /* Look for the identifier. */
16244 /* Look for the `=' token. */
16247 {
16249 /* Skip the definition. */
16254 }
16256 /* Look for the qualified-namespace-specifier. */
16257 namespace_specifier
16259 /* Look for the `;' token. */
16262 /* Register the alias in the symbol table. */
16264 }
16266 /* Parse a qualified-namespace-specifier.
16268 qualified-namespace-specifier:
16269 :: [opt] nested-name-specifier [opt] namespace-name
16271 Returns a NAMESPACE_DECL corresponding to the specified
16272 namespace. */
16274 static tree
16276 {
16277 /* Look for the optional `::'. */
16281 /* Look for the optional nested-name-specifier. */
16289 }
16291 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16292 access declaration.
16294 using-declaration:
16295 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16296 using :: unqualified-id ;
16298 access-declaration:
16299 qualified-id ;
16301 */
16303 static bool
16306 {
16310 tree decl;
16311 tree identifier;
16312 tree qscope;
16317 {
16320 }
16321 else
16322 {
16323 /* Look for the `using' keyword. */
16326 /* Peek at the next token. */
16328 /* See if it's `typename'. */
16330 {
16331 /* Remember that we've seen it. */
16333 /* Consume the `typename' token. */
16335 }
16336 }
16338 /* Look for the optional global scope qualification. */
16339 global_scope_p
16344 /* If we saw `typename', or didn't see `::', then there must be a
16345 nested-name-specifier present. */
16347 {
16353 {
16356 }
16357 }
16358 /* Otherwise, we could be in either of the two productions. In that
16359 case, treat the nested-name-specifier as optional. */
16360 else
16372 /* Something has already gone wrong; there's no need to parse
16373 further. Since an error has occurred, the return value of
16374 cp_parser_parse_definitely will be false, as required. */
16378 /* Parse the unqualified-id. */
16386 {
16391 }
16393 /* The function we call to handle a using-declaration is different
16394 depending on what scope we are in. */
16396 ;
16399 /* [namespace.udecl]
16401 A using declaration shall not name a template-id. */
16404 else
16405 {
16407 {
16408 /* Create the USING_DECL. */
16415 {
16418 }
16419 else
16420 /* Add it to the list of members in this class. */
16422 }
16423 else
16424 {
16426 identifier,
16433 {
16436 }
16439 else
16441 }
16442 }
16444 /* Look for the final `;'. */
16449 "access declarations are deprecated "
16450 "in favour of using-declarations; "
16454 }
16456 /* Parse an alias-declaration.
16458 alias-declaration:
16459 using identifier attribute-specifier-seq [opt] = type-id */
16461 static tree
16463 {
16465 location_t id_location;
16467 cp_decl_specifier_seq decl_specs;
16471 /* Look for the `using' keyword. */
16472 cp_token *using_token
16494 /* Now we are going to parse the type-id of the declaration. */
16496 /*
16497 [dcl.type]/3 says:
16499 "A type-specifier-seq shall not define a class or enumeration
16500 unless it appears in the type-id of an alias-declaration (7.1.3) that
16501 is not the declaration of a template-declaration."
16503 In other words, if we currently are in an alias template, the
16504 type-id should not define a type.
16506 So let's set parser->type_definition_forbidden_message in that
16507 case; cp_parser_check_type_definition (called by
16508 cp_parser_class_specifier) will then emit an error if a type is
16509 defined in the type-id. */
16511 {
16515 }
16519 /* Restore the error message if need be. */
16525 {
16528 }
16530 /* A typedef-name can also be introduced by an alias-declaration. The
16531 identifier following the using keyword becomes a typedef-name. It has
16532 the same semantics as if it were introduced by the typedef
16533 specifier. In particular, it does not define a new type and it shall
16534 not appear in the type-id. */
16539 {
16542 ds_attribute,
16543 attrs_token);
16544 }
16546 ds_typedef,
16547 using_token);
16549 ds_alias,
16550 using_token);
16559 else
16570 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16571 added into the symbol table; otherwise, return the TYPE_DECL. */
16575 {
16579 }
16582 }
16584 /* Parse a using-directive.
16586 using-directive:
16587 using namespace :: [opt] nested-name-specifier [opt]
16588 namespace-name ; */
16590 static void
16592 {
16593 tree namespace_decl;
16594 tree attribs;
16596 /* Look for the `using' keyword. */
16598 /* And the `namespace' keyword. */
16600 /* Look for the optional `::' operator. */
16602 /* And the optional nested-name-specifier. */
16608 /* Get the namespace being used. */
16610 /* And any specified attributes. */
16612 /* Update the symbol table. */
16614 /* Look for the final `;'. */
16616 }
16618 /* Parse an asm-definition.
16620 asm-definition:
16621 asm ( string-literal ) ;
16623 GNU Extension:
16625 asm-definition:
16626 asm volatile [opt] ( string-literal ) ;
16627 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16628 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16629 : asm-operand-list [opt] ) ;
16630 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16631 : asm-operand-list [opt]
16632 : asm-clobber-list [opt] ) ;
16633 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16634 : asm-clobber-list [opt]
16635 : asm-goto-list ) ; */
16637 static void
16639 {
16640 tree string;
16645 tree asm_stmt;
16653 /* Look for the `asm' keyword. */
16658 {
16661 }
16663 /* See if the next token is `volatile'. */
16666 {
16667 /* Remember that we saw the `volatile' keyword. */
16669 /* Consume the token. */
16671 }
16675 {
16676 /* Remember that we saw the `goto' keyword. */
16678 /* Consume the token. */
16680 }
16681 /* Look for the opening `('. */
16684 /* Look for the string. */
16687 {
16691 }
16693 /* If we're allowing GNU extensions, check for the extended assembly
16694 syntax. Unfortunately, the `:' tokens need not be separated by
16695 a space in C, and so, for compatibility, we tolerate that here
16696 too. Doing that means that we have to treat the `::' operator as
16697 two `:' tokens. */
16702 {
16707 /* The extended syntax was used. */
16710 /* Look for outputs. */
16712 {
16713 /* Consume the `:'. */
16715 /* Parse the output-operands. */
16717 CPP_COLON)
16719 CPP_SCOPE)
16721 CPP_CLOSE_PAREN)
16727 }
16728 /* If the next token is `::', there are no outputs, and the
16729 next token is the beginning of the inputs. */
16731 /* The inputs are coming next. */
16734 /* Look for inputs. */
16737 {
16738 /* Consume the `:' or `::'. */
16740 /* Parse the output-operands. */
16742 CPP_COLON)
16744 CPP_SCOPE)
16746 CPP_CLOSE_PAREN))
16751 }
16753 /* The clobbers are coming next. */
16756 /* Look for clobbers. */
16759 {
16761 /* Consume the `:' or `::'. */
16763 /* Parse the clobbers. */
16765 CPP_COLON)
16767 CPP_CLOSE_PAREN))
16769 }
16772 /* The labels are coming next. */
16775 /* Look for labels. */
16778 {
16780 /* Consume the `:' or `::'. */
16782 /* Parse the labels. */
16784 }
16788 }
16792 /* Look for the closing `)'. */
16800 {
16801 /* Create the ASM_EXPR. */
16803 {
16806 /* If the extended syntax was not used, mark the ASM_EXPR. */
16808 {
16814 }
16815 }
16816 else
16818 }
16819 }
16821 /* Declarators [gram.dcl.decl] */
16823 /* Parse an init-declarator.
16825 init-declarator:
16826 declarator initializer [opt]
16828 GNU Extension:
16830 init-declarator:
16831 declarator asm-specification [opt] attributes [opt] initializer [opt]
16833 function-definition:
16834 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16835 function-body
16836 decl-specifier-seq [opt] declarator function-try-block
16838 GNU Extension:
16840 function-definition:
16841 __extension__ function-definition
16843 TM Extension:
16845 function-definition:
16846 decl-specifier-seq [opt] declarator function-transaction-block
16848 The DECL_SPECIFIERS apply to this declarator. Returns a
16849 representation of the entity declared. If MEMBER_P is TRUE, then
16850 this declarator appears in a class scope. The new DECL created by
16851 this declarator is returned.
16853 The CHECKS are access checks that should be performed once we know
16854 what entity is being declared (and, therefore, what classes have
16855 befriended it).
16857 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16858 for a function-definition here as well. If the declarator is a
16859 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16860 be TRUE upon return. By that point, the function-definition will
16861 have been completely parsed.
16863 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16864 is FALSE.
16866 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16867 parsed declaration if it is an uninitialized single declarator not followed
16868 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16869 if present, will not be consumed. If returned, this declarator will be
16870 created with SD_INITIALIZED but will not call cp_finish_decl.
16872 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16873 and there is an initializer, the pointed location_t is set to the
16874 location of the '=' or `(', or '{' in C++11 token introducing the
16875 initializer. */
16877 static tree
16887 {
16891 tree prefix_attributes;
16893 tree asm_specification;
16894 tree initializer;
16896 tree scope;
16898 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16899 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16900 "(...)". */
16911 /* Gather the attributes that were provided with the
16912 decl-specifiers. */
16915 /* Assume that this is not the declarator for a function
16916 definition. */
16920 /* Default arguments are only permitted for function parameters. */
16924 /* Defer access checks while parsing the declarator; we cannot know
16925 what names are accessible until we know what is being
16926 declared. */
16929 /* Parse the declarator. */
16931 declarator
16936 /* Gather up the deferred checks. */
16941 /* If the DECLARATOR was erroneous, there's no need to go
16942 further. */
16946 /* Check that the number of template-parameter-lists is OK. */
16956 /* Figure out what scope the entity declared by the DECLARATOR is
16957 located in. `grokdeclarator' sometimes changes the scope, so
16958 we compute it now. */
16961 /* Perform any lookups in the declared type which were thought to be
16962 dependent, but are not in the scope of the declarator. */
16963 decl_specifiers->type
16966 /* If we're allowing GNU extensions, look for an
16967 asm-specification. */
16969 {
16970 /* Look for an asm-specification. */
16973 }
16974 else
16977 /* Look for attributes. */
16981 /* Peek at the next token. */
16987 {
16988 /* Check to see if the token indicates the start of a
16989 function-definition. */
16991 {
16993 {
16994 /* If a function-definition should not appear here, issue an
16995 error message. */
16999 }
17001 location_t func_brace_location
17004 /* Neither attributes nor an asm-specification are allowed
17005 on a function-definition. */
17008 "an asm-specification is not allowed "
17012 "attributes are not allowed "
17014 /* This is a function-definition. */
17017 /* Parse the function definition. */
17020 decl_specifiers,
17021 declarator,
17022 prefix_attributes);
17023 else
17024 decl =
17025 (cp_parser_function_definition_from_specifiers_and_declarator
17029 {
17030 /* This is where the prologue starts... */
17033 }
17036 }
17037 }
17039 {
17040 /* A non-template declaration involving a function parameter list
17041 containing an implicit template parameter will be made into a
17042 template. If the resulting declaration is not going to be an
17043 actual function then finish the template scope here to prevent it.
17044 An error message will be issued once we have a decl to talk about.
17046 FIXME probably we should do type deduction rather than create an
17047 implicit template, but the standard currently doesn't allow it. */
17050 }
17052 /* [dcl.dcl]
17054 Only in function declarations for constructors, destructors, and
17055 type conversions can the decl-specifier-seq be omitted.
17057 We explicitly postpone this check past the point where we handle
17058 function-definitions because we tolerate function-definitions
17059 that are missing their return types in some modes. */
17061 {
17065 }
17067 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17071 {
17082 {
17088 }
17089 }
17090 else
17091 {
17092 /* If the init-declarator isn't initialized and isn't followed by a
17093 `,' or `;', it's not a valid init-declarator. */
17096 {
17099 else
17100 {
17104 }
17105 }
17108 }
17110 /* Because start_decl has side-effects, we should only call it if we
17111 know we're going ahead. By this point, we know that we cannot
17112 possibly be looking at any other construct. */
17115 /* Enter the newly declared entry in the symbol table. If we're
17116 processing a declaration in a class-specifier, we wait until
17117 after processing the initializer. */
17119 {
17126 /* Adjust location of decl if declarator->id_loc is more appropriate:
17127 set, and decl wasn't merged with another decl, in which case its
17128 location would be different from input_location, and more accurate. */
17133 }
17135 /* Enter the SCOPE. That way unqualified names appearing in the
17136 initializer will be looked up in SCOPE. */
17139 /* Perform deferred access control checks, now that we know in which
17140 SCOPE the declared entity resides. */
17142 {
17145 /* If the entity being declared is a function, pretend that we
17146 are in its scope. If it is a `friend', it may have access to
17147 things that would not otherwise be accessible. */
17149 {
17152 }
17154 /* Perform access checks for template parameters. */
17157 /* Perform the access control checks for the declarator and the
17158 decl-specifiers. */
17161 /* Restore the saved value. */
17164 }
17166 /* Parse the initializer. */
17171 {
17173 {
17176 else
17177 {
17178 /* If the declaration was erroneous, we don't really
17179 know what the user intended, so just silently
17180 consume the initializer. */
17187 }
17188 }
17189 else
17190 {
17191 /* We want to record the extra mangling scope for in-class
17192 initializers of class members and initializers of static data
17193 member templates. The former involves deferring
17194 parsing of the initializer until end of class as with default
17195 arguments. So right here we only handle the latter. */
17205 }
17206 }
17208 /* The old parser allows attributes to appear after a parenthesized
17209 initializer. Mark Mitchell proposed removing this functionality
17210 on the GCC mailing lists on 2002-08-13. This parser accepts the
17211 attributes -- but ignores them. */
17218 /* And now complain about a non-function implicit template. */
17223 /* For an in-class declaration, use `grokfield' to create the
17224 declaration. */
17226 {
17228 {
17231 }
17239 }
17241 /* Finish processing the declaration. But, skip member
17242 declarations. */
17244 {
17247 asm_specification,
17248 /* If the initializer is in parentheses, then this is
17249 a direct-initialization, which means that an
17250 `explicit' constructor is OK. Otherwise, an
17251 `explicit' constructor cannot be used. */
17254 }
17257 /* Core issue #226 (C++0x only): A default template-argument
17258 shall not be specified in a friend class template
17259 declaration. */
17268 {
17271 else
17273 }
17276 }
17278 /* Parse a declarator.
17280 declarator:
17281 direct-declarator
17282 ptr-operator declarator
17284 abstract-declarator:
17285 ptr-operator abstract-declarator [opt]
17286 direct-abstract-declarator
17288 GNU Extensions:
17290 declarator:
17291 attributes [opt] direct-declarator
17292 attributes [opt] ptr-operator declarator
17294 abstract-declarator:
17295 attributes [opt] ptr-operator abstract-declarator [opt]
17296 attributes [opt] direct-abstract-declarator
17298 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17299 detect constructor, destructor or conversion operators. It is set
17300 to -1 if the declarator is a name, and +1 if it is a
17301 function. Otherwise it is set to zero. Usually you just want to
17302 test for >0, but internally the negative value is used.
17304 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17305 a decl-specifier-seq unless it declares a constructor, destructor,
17306 or conversion. It might seem that we could check this condition in
17307 semantic analysis, rather than parsing, but that makes it difficult
17308 to handle something like `f()'. We want to notice that there are
17309 no decl-specifiers, and therefore realize that this is an
17310 expression, not a declaration.)
17312 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17313 the declarator is a direct-declarator of the form "(...)".
17315 MEMBER_P is true iff this declarator is a member-declarator.
17317 FRIEND_P is true iff this declarator is a friend. */
17321 cp_parser_declarator_kind dcl_kind,
17325 {
17328 cp_cv_quals cv_quals;
17329 tree class_type;
17332 /* Assume this is not a constructor, destructor, or type-conversion
17333 operator. */
17340 /* Check for the ptr-operator production. */
17342 /* Parse the ptr-operator. */
17348 /* If that worked, then we have a ptr-operator. */
17350 {
17351 /* If a ptr-operator was found, then this declarator was not
17352 parenthesized. */
17355 /* The dependent declarator is optional if we are parsing an
17356 abstract-declarator. */
17360 /* Parse the dependent declarator. */
17365 friend_p);
17367 /* If we are parsing an abstract-declarator, we must handle the
17368 case where the dependent declarator is absent. */
17373 declarator = cp_parser_make_indirect_declarator
17375 }
17376 /* Everything else is a direct-declarator. */
17377 else
17378 {
17381 CPP_OPEN_PAREN);
17383 ctor_dtor_or_conv_p,
17385 }
17390 }
17392 /* Parse a direct-declarator or direct-abstract-declarator.
17394 direct-declarator:
17395 declarator-id
17396 direct-declarator ( parameter-declaration-clause )
17397 cv-qualifier-seq [opt]
17398 ref-qualifier [opt]
17399 exception-specification [opt]
17400 direct-declarator [ constant-expression [opt] ]
17401 ( declarator )
17403 direct-abstract-declarator:
17404 direct-abstract-declarator [opt]
17405 ( parameter-declaration-clause )
17406 cv-qualifier-seq [opt]
17407 ref-qualifier [opt]
17408 exception-specification [opt]
17409 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17410 ( abstract-declarator )
17412 Returns a representation of the declarator. DCL_KIND is
17413 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17414 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17415 we are parsing a direct-declarator. It is
17416 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17417 of ambiguity we prefer an abstract declarator, as per
17418 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17419 as for cp_parser_declarator. */
17423 cp_parser_declarator_kind dcl_kind,
17426 {
17436 {
17437 /* Peek at the next token. */
17440 {
17441 /* This is either a parameter-declaration-clause, or a
17442 parenthesized declarator. When we know we are parsing a
17443 named declarator, it must be a parenthesized declarator
17444 if FIRST is true. For instance, `(int)' is a
17445 parameter-declaration-clause, with an omitted
17446 direct-abstract-declarator. But `((*))', is a
17447 parenthesized abstract declarator. Finally, when T is a
17448 template parameter `(T)' is a
17449 parameter-declaration-clause, and not a parenthesized
17450 named declarator.
17452 We first try and parse a parameter-declaration-clause,
17453 and then try a nested declarator (if FIRST is true).
17455 It is not an error for it not to be a
17456 parameter-declaration-clause, even when FIRST is
17457 false. Consider,
17459 int i (int);
17460 int i (3);
17462 The first is the declaration of a function while the
17463 second is the definition of a variable, including its
17464 initializer.
17466 Having seen only the parenthesis, we cannot know which of
17467 these two alternatives should be selected. Even more
17468 complex are examples like:
17470 int i (int (a));
17471 int i (int (3));
17473 The former is a function-declaration; the latter is a
17474 variable initialization.
17476 Thus again, we try a parameter-declaration-clause, and if
17477 that fails, we back out and return. */
17480 {
17481 tree params;
17484 /* In a member-declarator, the only valid interpretation
17485 of a parenthesis is the start of a
17486 parameter-declaration-clause. (It is invalid to
17487 initialize a static data member with a parenthesized
17488 initializer; only the "=" form of initialization is
17489 permitted.) */
17493 /* Consume the `('. */
17496 {
17497 /* If this is going to be an abstract declarator, we're
17498 in a declarator and we can't have default args. */
17501 }
17505 /* Parse the parameter-declaration-clause. */
17508 /* Consume the `)'. */
17511 /* If all went well, parse the cv-qualifier-seq,
17512 ref-qualifier and the exception-specification. */
17514 {
17515 cp_cv_quals cv_quals;
17516 cp_virt_specifiers virt_specifiers;
17517 cp_ref_qualifier ref_qual;
17518 tree exception_specification;
17519 tree late_return;
17520 tree attrs;
17530 /* Parse the cv-qualifier-seq. */
17532 /* Parse the ref-qualifier. */
17534 /* And the exception-specification. */
17535 exception_specification
17540 /* In here, we handle cases where attribute is used after
17541 the function declaration. For example:
17542 void func (int x) __attribute__((vector(..))); */
17545 {
17549 CPP_SEMICOLON)
17551 CPP_OPEN_BRACE))
17554 ;
17555 else
17557 }
17558 late_return = (cp_parser_late_return_type_opt
17563 /* Parse the virt-specifier-seq. */
17566 /* Create the function-declarator. */
17568 params,
17569 cv_quals,
17570 virt_specifiers,
17571 ref_qual,
17572 exception_specification,
17573 late_return);
17575 /* Any subsequent parameter lists are to do with
17576 return type, so are not those of the declared
17577 function. */
17579 }
17581 /* Remove the function parms from scope. */
17585 /* Repeat the main loop. */
17587 }
17589 /* If this is the first, we can try a parenthesized
17590 declarator. */
17592 {
17598 /* Consume the `('. */
17600 /* Parse the nested declarator. */
17603 declarator
17609 /* Expect a `)'. */
17616 }
17617 /* Otherwise, we must be done. */
17618 else
17620 }
17624 {
17625 /* Parse an array-declarator. */
17634 /* Consume the `['. */
17636 /* Peek at the next token. */
17638 /* If the next token is `]', then there is no
17639 constant-expression. */
17641 {
17643 bounds
17653 {
17654 /* Normally, the array bound must be an integral constant
17655 expression. However, as an extension, we allow VLAs
17656 in function scopes as long as they aren't part of a
17657 parameter declaration. */
17661 }
17664 {
17665 /* Remember this wasn't a constant-expression. */
17668 }
17669 }
17670 else
17672 /* Look for the closing `]'. */
17674 {
17677 }
17682 }
17684 {
17685 {
17686 tree qualifying_scope;
17687 tree unqualified_name;
17688 tree attrs;
17689 special_function_kind sfk;
17694 /* Parse a declarator-id */
17697 {
17700 /* If we see an ellipsis, we should be looking at a
17701 parameter pack. */
17703 {
17704 /* Consume the `...' */
17708 }
17709 }
17712 unqualified_name
17716 {
17720 {
17721 /* Check whether an error occurred. */
17724 /* We already consumed the ellipsis to mark a
17725 parameter pack, but we have no way to report it,
17726 so abort the tentative parse. We will be exiting
17727 immediately anyway. */
17729 }
17730 else
17736 && (qualifying_scope
17738 {
17741 }
17742 }
17747 {
17752 }
17758 {
17759 /* In the declaration of a member of a template class
17760 outside of the class itself, the SCOPE will sometimes
17761 be a TYPENAME_TYPE. For example, given:
17763 template <typename T>
17764 int S<T>::R::i = 3;
17766 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17767 this context, we must resolve S<T>::R to an ordinary
17768 type, rather than a typename type.
17770 The reason we normally avoid resolving TYPENAME_TYPEs
17771 is that a specialization of `S' might render
17772 `S<T>::R' not a type. However, if `S' is
17773 specialized, then this `i' will not be used, so there
17774 is no harm in resolving the types here. */
17775 tree type;
17777 /* Resolve the TYPENAME_TYPE. */
17780 /* If that failed, the declarator is invalid. */
17782 {
17785 "cannot define member of dependent typedef "
17787 else
17792 }
17794 }
17799 {
17800 tree class_type;
17805 else
17809 {
17812 {
17815 {
17819 "use %<%T::%D%> instead of %<%T::%D%> to "
17821 class_type,
17826 }
17827 else
17829 }
17830 else
17831 {
17832 /* We do not attempt to print the declarator
17833 here because we do not have enough
17834 information about its original syntactic
17835 form. */
17839 }
17840 }
17843 {
17849 for an anonymous type, even if the type
17850 got a name for linkage purposes. */
17852 /* Handle correctly (c++/19200):
17854 struct S {
17855 struct T{};
17856 friend void S(T);
17857 };
17859 and also:
17861 namespace N {
17862 void S();
17863 }
17865 struct S {
17866 friend void N::S();
17867 }; */
17868 && !(friend_p
17871 class_type))
17872 {
17875 }
17883 }
17884 }
17886 unqualified_name,
17887 sfk);
17894 }
17896 handle_declarator:;
17899 {
17900 /* Any names that appear after the declarator-id for a
17901 member are looked up in the containing scope. */
17903 {
17904 /* But declarations with qualified-ids can't appear in a
17905 function. */
17909 }
17911 }
17915 /* Default args are only allowed on function
17916 declarations. */
17918 else
17922 }
17923 /* We're done. */
17924 else
17926 }
17928 /* For an abstract declarator, we might wind up with nothing at this
17929 point. That's an error; the declarator is not optional. */
17933 /* If we entered a scope, we must exit it now. */
17941 }
17943 /* Parse a ptr-operator.
17945 ptr-operator:
17946 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17947 * cv-qualifier-seq [opt]
17948 &
17949 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17950 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17952 GNU Extension:
17954 ptr-operator:
17955 & cv-qualifier-seq [opt]
17957 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17958 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17959 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17960 filled in with the TYPE containing the member. *CV_QUALS is
17961 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17962 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17963 Note that the tree codes returned by this function have nothing
17964 to do with the types of trees that will be eventually be created
17965 to represent the pointer or reference type being parsed. They are
17966 just constants with suggestive names. */
17967 static enum tree_code
17972 {
17977 /* Assume that it's not a pointer-to-member. */
17979 /* And that there are no cv-qualifiers. */
17982 /* Peek at the next token. */
17985 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17995 {
17996 /* Consume the `*', `&' or `&&'. */
17999 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18000 `&', if we are allowing GNU extensions. (The only qualifier
18001 that can legally appear after `&' is `restrict', but that is
18002 enforced during semantic analysis. */
18010 }
18011 else
18012 {
18013 /* Try the pointer-to-member case. */
18015 /* Look for the optional `::' operator. */
18018 /* Look for the nested-name specifier. */
18025 /* If we found it, and the next token is a `*', then we are
18026 indeed looking at a pointer-to-member operator. */
18029 {
18030 /* Indicate that the `*' operator was used. */
18038 else
18039 {
18040 /* The type of which the member is a member is given by the
18041 current SCOPE. */
18043 /* The next name will not be qualified. */
18047 /* Look for optional c++11 attributes. */
18051 /* Look for the optional cv-qualifier-seq. */
18053 }
18054 }
18055 /* If that didn't work we don't have a ptr-operator. */
18058 }
18061 }
18063 /* Parse an (optional) cv-qualifier-seq.
18065 cv-qualifier-seq:
18066 cv-qualifier cv-qualifier-seq [opt]
18068 cv-qualifier:
18069 const
18070 volatile
18072 GNU Extension:
18074 cv-qualifier:
18075 __restrict__
18077 Returns a bitmask representing the cv-qualifiers. */
18079 static cp_cv_quals
18081 {
18085 {
18087 cp_cv_quals cv_qualifier;
18089 /* Peek at the next token. */
18091 /* See if it's a cv-qualifier. */
18093 {
18109 }
18115 {
18118 }
18119 else
18120 {
18123 }
18124 }
18127 }
18129 /* Parse an (optional) ref-qualifier
18131 ref-qualifier:
18132 &
18133 &&
18135 Returns cp_ref_qualifier representing ref-qualifier. */
18137 static cp_ref_qualifier
18139 {
18142 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18147 {
18152 {
18164 }
18169 {
18172 }
18173 else
18174 {
18177 }
18178 }
18181 }
18183 /* Parse an (optional) virt-specifier-seq.
18185 virt-specifier-seq:
18186 virt-specifier virt-specifier-seq [opt]
18188 virt-specifier:
18189 override
18190 final
18192 Returns a bitmask representing the virt-specifiers. */
18194 static cp_virt_specifiers
18196 {
18200 {
18202 cp_virt_specifiers virt_specifier;
18204 /* Peek at the next token. */
18206 /* See if it's a virt-specifier-qualifier. */
18210 {
18213 }
18215 {
18218 }
18220 {
18222 }
18223 else
18227 {
18230 }
18231 else
18232 {
18235 }
18236 }
18238 }
18240 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18241 is in scope even though it isn't real. */
18243 void
18245 {
18246 tree this_parm;
18249 {
18250 /* We don't clear this between NSDMIs. Is it already what we want? */
18255 }
18258 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18260 current_class_ref
18263 }
18265 /* Return true iff our current scope is a non-static data member
18266 initializer. */
18268 bool
18270 {
18271 /* We recognize NSDMI context by the context-less 'this' pointer set up
18272 by the function above. */
18276 }
18278 /* Parse a late-specified return type, if any. This is not a separate
18279 non-terminal, but part of a function declarator, which looks like
18281 -> trailing-type-specifier-seq abstract-declarator(opt)
18283 Returns the type indicated by the type-id.
18285 In addition to this this parses any queued up omp declare simd
18286 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18288 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18289 function. */
18291 static tree
18293 cp_cv_quals quals)
18294 {
18298 && declarator
18304 /* Peek at the next token. */
18306 /* A late-specified return type is indicated by an initial '->'. */
18313 {
18314 /* DR 1207: 'this' is in scope in the trailing return type. */
18316 }
18319 {
18320 /* Consume the ->. */
18324 }
18327 declarator->std_attributes
18331 declarator->std_attributes
18336 {
18339 }
18342 }
18344 /* Parse a declarator-id.
18346 declarator-id:
18347 id-expression
18348 :: [opt] nested-name-specifier [opt] type-name
18350 In the `id-expression' case, the value returned is as for
18351 cp_parser_id_expression if the id-expression was an unqualified-id.
18352 If the id-expression was a qualified-id, then a SCOPE_REF is
18353 returned. The first operand is the scope (either a NAMESPACE_DECL
18354 or TREE_TYPE), but the second is still just a representation of an
18355 unqualified-id. */
18357 static tree
18359 {
18360 tree id;
18361 /* The expression must be an id-expression. Assume that qualified
18362 names are the names of types so that:
18364 template <class T>
18365 int S<T>::R::i = 3;
18367 will work; we must treat `S<T>::R' as the name of a type.
18368 Similarly, assume that qualified names are templates, where
18369 required, so that:
18371 template <class T>
18372 int S<T>::R<T>::i = 3;
18374 will work, too. */
18380 optional_p);
18384 }
18386 /* Parse a type-id.
18388 type-id:
18389 type-specifier-seq abstract-declarator [opt]
18391 Returns the TYPE specified. */
18393 static tree
18396 {
18397 cp_decl_specifier_seq type_specifier_seq;
18400 /* Parse the type-specifier-seq. */
18402 is_trailing_return,
18407 /* There might or might not be an abstract declarator. */
18409 /* Look for the declarator. */
18410 abstract_declarator
18415 /* Check to see if there really was a declarator. */
18420 /* None of the valid uses of 'auto' in C++14 involve the type-id
18421 nonterminal, but it is valid in a trailing-return-type. */
18424 {
18425 /* A type-id with type 'auto' is only ok if the abstract declarator
18426 is a function declarator with a late-specified return type. */
18431 else
18432 {
18435 }
18436 }
18439 is_template_arg);
18440 }
18443 {
18445 }
18448 {
18449 tree r;
18451 parser->type_definition_forbidden_message
18456 {
18459 }
18461 }
18464 {
18466 }
18468 /* Parse a type-specifier-seq.
18470 type-specifier-seq:
18471 type-specifier type-specifier-seq [opt]
18473 GNU extension:
18475 type-specifier-seq:
18476 attributes type-specifier-seq [opt]
18478 If IS_DECLARATION is true, we are at the start of a "condition" or
18479 exception-declaration, so we might be followed by a declarator-id.
18481 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18482 i.e. we've just seen "->".
18484 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18486 static void
18491 {
18496 /* Clear the TYPE_SPECIFIER_SEQ. */
18499 /* In the context of a trailing return type, enum E { } is an
18500 elaborated-type-specifier followed by a function-body, not an
18501 enum-specifier. */
18505 /* Parse the type-specifiers and attributes. */
18507 {
18508 tree type_specifier;
18511 /* Check for attributes first. */
18513 {
18518 }
18520 /* record the token of the beginning of the type specifier seq,
18521 for error reporting purposes*/
18525 /* Look for the type-specifier. */
18527 flags,
18528 type_specifier_seq,
18530 NULL,
18533 {
18534 /* If the first type-specifier could not be found, this is not a
18535 type-specifier-seq at all. */
18537 {
18538 /* Set in_declarator_p to avoid skipping to the semicolon. */
18550 }
18551 /* If subsequent type-specifiers could not be found, the
18552 type-specifier-seq is complete. */
18554 }
18557 /* The standard says that a condition can be:
18559 type-specifier-seq declarator = assignment-expression
18561 However, given:
18563 struct S {};
18564 if (int S = ...)
18566 we should treat the "S" as a declarator, not as a
18567 type-specifier. The standard doesn't say that explicitly for
18568 type-specifier-seq, but it does say that for
18569 decl-specifier-seq in an ordinary declaration. Perhaps it
18570 would be clearer just to allow a decl-specifier-seq here, and
18571 then add a semantic restriction that if any decl-specifiers
18572 that are not type-specifiers appear, the program is invalid. */
18575 }
18576 }
18578 /* Return whether the function currently being declared has an associated
18579 template parameter list. */
18581 static bool
18583 {
18596 }
18598 /* Parse a parameter-declaration-clause.
18600 parameter-declaration-clause:
18601 parameter-declaration-list [opt] ... [opt]
18602 parameter-declaration-list , ...
18604 Returns a representation for the parameter declarations. A return
18605 value of NULL indicates a parameter-declaration-clause consisting
18606 only of an ellipsis. */
18608 static tree
18610 {
18611 tree parameters;
18620 parser->auto_is_implicit_function_template_parm_p
18622 }
18628 && !processing_template_parmlist
18634 /* Peek at the next token. */
18636 /* Check for trivial parameter-declaration-clauses. */
18638 {
18639 /* Consume the `...' token. */
18642 }
18644 /* There are no parameters. */
18645 {
18646 #ifndef NO_IMPLICIT_EXTERN_C
18651 else
18652 #endif
18654 }
18655 /* Check for `(void)', too, which is a special case. */
18659 {
18660 /* Consume the `void' token. */
18662 /* There are no parameters. */
18664 }
18666 /* Parse the parameter-declaration-list. */
18668 /* If a parse error occurred while parsing the
18669 parameter-declaration-list, then the entire
18670 parameter-declaration-clause is erroneous. */
18674 /* Peek at the next token. */
18676 /* If it's a `,', the clause should terminate with an ellipsis. */
18678 {
18679 /* Consume the `,'. */
18681 /* Expect an ellipsis. */
18682 ellipsis_p
18684 }
18685 /* It might also be `...' if the optional trailing `,' was
18686 omitted. */
18688 {
18689 /* Consume the `...' token. */
18691 /* And remember that we saw it. */
18693 }
18694 else
18697 /* Finish the parameter list. */
18702 }
18704 /* Parse a parameter-declaration-list.
18706 parameter-declaration-list:
18707 parameter-declaration
18708 parameter-declaration-list , parameter-declaration
18710 Returns a representation of the parameter-declaration-list, as for
18711 cp_parser_parameter_declaration_clause. However, the
18712 `void_list_node' is never appended to the list. Upon return,
18713 *IS_ERROR will be true iff an error occurred. */
18715 static tree
18717 {
18723 /* Assume all will go well. */
18725 /* The special considerations that apply to a function within an
18726 unbraced linkage specifications do not apply to the parameters
18727 to the function. */
18728 saved_in_unbraced_linkage_specification_p
18732 /* Look for more parameters. */
18734 {
18742 /* Parse the parameter. */
18743 parameter
18748 /* We don't know yet if the enclosing context is deprecated, so wait
18749 and warn in grokparms if appropriate. */
18753 {
18754 /* If a function parameter pack was specified and an implicit template
18755 parameter was introduced during cp_parser_parameter_declaration,
18756 change any implicit parameters introduced into packs. */
18760 {
18768 }
18772 PARM,
18775 }
18779 /* If a parse error occurred parsing the parameter declaration,
18780 then the entire parameter-declaration-list is erroneous. */
18782 {
18786 }
18796 {
18800 }
18802 /* Add the new parameter to the list. */
18806 /* Peek at the next token. */
18809 /* These are for Objective-C++ */
18812 /* The parameter-declaration-list is complete. */
18815 {
18818 /* Peek at the next token. */
18820 /* If it's an ellipsis, then the list is complete. */
18823 /* Otherwise, there must be more parameters. Consume the
18824 `,'. */
18826 /* When parsing something like:
18828 int i(float f, double d)
18830 we can tell after seeing the declaration for "f" that we
18831 are not looking at an initialization of a variable "i",
18832 but rather at the declaration of a function "i".
18834 Due to the fact that the parsing of template arguments
18835 (as specified to a template-id) requires backtracking we
18836 cannot use this technique when inside a template argument
18837 list. */
18841 /* However, a parameter-declaration of the form
18842 "float(f)" (which is a valid declaration of a
18843 parameter "f") can also be interpreted as an
18844 expression (the conversion of "f" to "float"). */
18847 }
18848 else
18849 {
18857 }
18858 }
18860 parser->in_unbraced_linkage_specification_p
18863 /* Reset implicit_template_scope if we are about to leave the function
18864 parameter list that introduced it. Note that for out-of-line member
18865 definitions, there will be one or more class scopes before we get to
18866 the template parameter scope. */
18870 {
18874 {
18877 }
18878 }
18881 }
18883 /* Parse a parameter declaration.
18885 parameter-declaration:
18886 decl-specifier-seq ... [opt] declarator
18887 decl-specifier-seq declarator = assignment-expression
18888 decl-specifier-seq ... [opt] abstract-declarator [opt]
18889 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18891 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18892 declares a template parameter. (In that case, a non-nested `>'
18893 token encountered during the parsing of the assignment-expression
18894 is not interpreted as a greater-than operator.)
18896 Returns a representation of the parameter, or NULL if an error
18897 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18898 true iff the declarator is of the form "(p)". */
18904 {
18906 cp_decl_specifier_seq decl_specifiers;
18908 tree default_argument;
18912 /* In a template parameter, `>' is not an operator.
18914 [temp.param]
18916 When parsing a default template-argument for a non-type
18917 template-parameter, the first non-nested `>' is taken as the end
18918 of the template parameter-list rather than a greater-than
18919 operator. */
18921 /* Type definitions may not appear in parameter types. */
18923 parser->type_definition_forbidden_message
18926 /* Parse the declaration-specifiers. */
18928 CP_PARSER_FLAGS_NONE,
18932 /* Complain about missing 'typename' or other invalid type names. */
18937 /* If an error occurred, there's no reason to attempt to parse the
18938 rest of the declaration. */
18940 {
18943 }
18945 /* Peek at the next token. */
18948 /* If the next token is a `)', `,', `=', `>', or `...', then there
18949 is no declarator. However, when variadic templates are enabled,
18950 there may be a declarator following `...'. */
18955 {
18959 }
18960 /* Otherwise, there should be a declarator. */
18961 else
18962 {
18966 /* After seeing a decl-specifier-seq, if the next token is not a
18967 "(", there is no possibility that the code is a valid
18968 expression. Therefore, if parsing tentatively, we commit at
18969 this point. */
18971 /* In an expression context, having seen:
18973 (int((char ...
18975 we cannot be sure whether we are looking at a
18976 function-type (taking a "char" as a parameter) or a cast
18977 of some object of type "char" to "int". */
18983 /* Parse the declarator. */
18986 CP_PARSER_DECLARATOR_EITHER,
18988 parenthesized_p,
18992 /* After the declarator, allow more attributes. */
18993 decl_specifiers.attributes
18996 }
18998 /* If the next token is an ellipsis, and we have not seen a
18999 declarator name, and the type of the declarator contains parameter
19000 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19001 a parameter pack expansion expression. Otherwise, leave the
19002 ellipsis for a C-style variadic function. */
19005 {
19016 {
19017 /* Consume the `...'. */
19021 /* Build a pack expansion type */
19024 else
19026 }
19027 }
19029 /* The restriction on defining new types applies only to the type
19030 of the parameter, not to the default argument. */
19033 /* If the next token is `=', then process a default argument. */
19035 {
19037 /* If we are defining a class, then the tokens that make up the
19038 default argument must be saved and processed later. */
19043 /* Outside of a class definition, we can just parse the
19044 assignment-expression. */
19045 else
19046 default_argument
19050 {
19053 else
19054 {
19056 "default arguments are only "
19059 }
19060 }
19064 {
19065 /* Find the name of the parameter pack. */
19072 template_parm_p
19078 else
19080 template_parm_p
19087 }
19088 }
19089 else
19093 declarator,
19094 default_argument);
19095 }
19097 /* Parse a default argument and return it.
19099 TEMPLATE_PARM_P is true if this is a default argument for a
19100 non-type template parameter. */
19101 static tree
19103 {
19109 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19110 set correctly. */
19113 /* Local variable names (and the `this' keyword) may not
19114 appear in a default argument. */
19117 /* Parse the assignment-expression. */
19122 /* The "this" pointer is not valid in a default argument. */
19124 {
19129 }
19130 default_argument
19132 /* Restore the "this" pointer. */
19134 {
19137 }
19146 }
19148 /* Parse a function-body.
19150 function-body:
19151 compound_statement */
19153 static void
19155 {
19157 }
19159 /* Parse a ctor-initializer-opt followed by a function-body. Return
19160 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19161 is true we are parsing a function-try-block. */
19163 static bool
19166 {
19174 /* Begin the function body. */
19176 /* Parse the optional ctor-initializer. */
19179 /* If we're parsing a constexpr constructor definition, we need
19180 to check that the constructor body is indeed empty. However,
19181 before we get to cp_parser_function_body lot of junk has been
19182 generated, so we can't just check that we have an empty block.
19183 Rather we take a snapshot of the outermost block, and check whether
19184 cp_parser_function_body changed its state. */
19186 {
19190 }
19191 /* Parse the function-body. */
19195 /* Finish the function body. */
19199 }
19201 /* Parse an initializer.
19203 initializer:
19204 = initializer-clause
19205 ( expression-list )
19207 Returns an expression representing the initializer. If no
19208 initializer is present, NULL_TREE is returned.
19210 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19211 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19212 set to TRUE if there is no initializer present. If there is an
19213 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19214 is set to true; otherwise it is set to false. */
19216 static tree
19219 {
19221 tree init;
19223 /* Peek at the next token. */
19226 /* Let our caller know whether or not this initializer was
19227 parenthesized. */
19229 /* Assume that the initializer is constant. */
19233 {
19234 /* Consume the `='. */
19236 /* Parse the initializer-clause. */
19238 }
19240 {
19245 non_constant_p);
19250 }
19252 {
19257 }
19258 else
19259 {
19260 /* Anything else is an error. */
19263 }
19266 }
19268 /* Parse an initializer-clause.
19270 initializer-clause:
19271 assignment-expression
19272 braced-init-list
19274 Returns an expression representing the initializer.
19276 If the `assignment-expression' production is used the value
19277 returned is simply a representation for the expression.
19279 Otherwise, calls cp_parser_braced_list. */
19281 static tree
19283 {
19284 tree initializer;
19286 /* Assume the expression is constant. */
19289 /* If it is not a `{', then we are looking at an
19290 assignment-expression. */
19292 {
19293 initializer
19296 non_constant_p);
19297 }
19298 else
19302 }
19304 /* Parse a brace-enclosed initializer list.
19306 braced-init-list:
19307 { initializer-list , [opt] }
19308 { }
19310 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19311 the elements of the initializer-list (or NULL, if the last
19312 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19313 NULL_TREE. There is no way to detect whether or not the optional
19314 trailing `,' was provided. NON_CONSTANT_P is as for
19315 cp_parser_initializer. */
19317 static tree
19319 {
19320 tree initializer;
19322 /* Consume the `{' token. */
19324 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19326 /* If it's not a `}', then there is a non-trivial initializer. */
19328 {
19329 /* Parse the initializer list. */
19332 /* A trailing `,' token is allowed. */
19335 }
19336 else
19338 /* Now, there should be a trailing `}'. */
19342 }
19344 /* Consume tokens up to, and including, the next non-nested closing `]'.
19345 Returns true iff we found a closing `]'. */
19347 static bool
19349 {
19353 {
19357 {
19360 /* If we've run out of tokens, then there is no closing `]'. */
19369 {
19372 }
19377 }
19379 /* Consume the token. */
19381 }
19382 }
19384 /* Return true if we are looking at an array-designator, false otherwise. */
19386 static bool
19388 {
19389 /* Consume the `['. */
19394 /* Skip tokens until the next token is a closing square bracket.
19395 If we find the closing `]', and the next token is a `=', then
19396 we are looking at an array designator. */
19397 bool array_designator_p
19401 /* Roll back the tokens we skipped. */
19405 }
19407 /* Parse an initializer-list.
19409 initializer-list:
19410 initializer-clause ... [opt]
19411 initializer-list , initializer-clause ... [opt]
19413 GNU Extension:
19415 initializer-list:
19416 designation initializer-clause ...[opt]
19417 initializer-list , designation initializer-clause ...[opt]
19419 designation:
19420 . identifier =
19421 identifier :
19422 [ constant-expression ] =
19424 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19425 for the initializer. If the INDEX of the elt is non-NULL, it is the
19426 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19427 as for cp_parser_initializer. */
19431 {
19434 /* Assume all of the expressions are constant. */
19437 /* Parse the rest of the list. */
19439 {
19441 tree designator;
19442 tree initializer;
19445 /* If the next token is an identifier and the following one is a
19446 colon, we are looking at the GNU designated-initializer
19447 syntax. */
19451 {
19452 /* Warn the user that they are using an extension. */
19455 /* Consume the identifier. */
19457 /* Consume the `:'. */
19459 }
19460 /* Also handle the C99 syntax, '. id ='. */
19465 {
19466 /* Warn the user that they are using an extension. */
19469 /* Consume the `.'. */
19471 /* Consume the identifier. */
19473 /* Consume the `='. */
19475 }
19476 /* Also handle C99 array designators, '[ const ] ='. */
19480 {
19481 /* In C++11, [ could start a lambda-introducer. */
19487 {
19490 }
19491 else
19492 {
19497 }
19503 }
19504 else
19507 /* Parse the initializer. */
19510 /* If any clause is non-constant, so is the entire initializer. */
19514 /* If we have an ellipsis, this is an initializer pack
19515 expansion. */
19517 {
19518 /* Consume the `...'. */
19521 /* Turn the initializer into an initializer expansion. */
19523 }
19525 /* Add it to the vector. */
19528 /* If the next token is not a comma, we have reached the end of
19529 the list. */
19533 /* Peek at the next token. */
19535 /* If the next token is a `}', then we're still done. An
19536 initializer-clause can have a trailing `,' after the
19537 initializer-list and before the closing `}'. */
19541 /* Consume the `,' token. */
19543 }
19546 }
19548 /* Classes [gram.class] */
19550 /* Parse a class-name.
19552 class-name:
19553 identifier
19554 template-id
19556 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19557 to indicate that names looked up in dependent types should be
19558 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19559 keyword has been used to indicate that the name that appears next
19560 is a template. TAG_TYPE indicates the explicit tag given before
19561 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19562 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19563 is the class being defined in a class-head.
19565 Returns the TYPE_DECL representing the class. */
19567 static tree
19575 {
19576 tree decl;
19577 tree scope;
19582 /* All class-names start with an identifier. */
19585 {
19588 }
19590 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19591 to a template-id, so we save it here. */
19596 /* Any name names a type if we're following the `typename' keyword
19597 in a qualified name where the enclosing scope is type-dependent. */
19600 /* Handle the common case (an identifier, but not a template-id)
19601 efficiently. */
19604 {
19608 /* Look for the identifier. */
19612 /* If the next token isn't an identifier, we are certainly not
19613 looking at a class-name. */
19616 /* If we know this is a type-name, there's no need to look it
19617 up. */
19620 else
19621 {
19622 tree ambiguous_decls;
19623 /* If we already know that this lookup is ambiguous, then
19624 we've already issued an error message; there's no reason
19625 to check again. */
19627 {
19630 }
19631 /* If the next token is a `::', then the name must be a type
19632 name.
19634 [basic.lookup.qual]
19636 During the lookup for a name preceding the :: scope
19637 resolution operator, object, function, and enumerator
19638 names are ignored. */
19641 /* Look up the name. */
19643 tag_type,
19646 check_dependency_p,
19650 {
19654 }
19655 }
19656 }
19657 else
19658 {
19659 /* Try a template-id. */
19661 check_dependency_p,
19662 tag_type,
19663 is_declaration);
19666 }
19670 /* If this is a typename, create a TYPENAME_TYPE. */
19672 {
19677 }
19681 /* Check to see that it is really the name of a class. */
19685 /* Situations like this:
19687 template <typename T> struct A {
19688 typename T::template X<int>::I i;
19689 };
19691 are problematic. Is `T::template X<int>' a class-name? The
19692 standard does not seem to be definitive, but there is no other
19693 valid interpretation of the following `::'. Therefore, those
19694 names are considered class-names. */
19695 {
19699 }
19703 /* In Objective-C 2.0, a classname followed by '.' starts a
19704 dot-syntax expression, and it's not a type-name. */
19716 }
19718 /* Parse a class-specifier.
19720 class-specifier:
19721 class-head { member-specification [opt] }
19723 Returns the TREE_TYPE representing the class. */
19725 static tree
19727 {
19728 tree type;
19742 /* Parse the class-head. */
19745 /* If the class-head was a semantic disaster, skip the entire body
19746 of the class. */
19748 {
19752 }
19754 /* Look for the `{'. */
19756 {
19759 }
19763 /* Issue an error message if type-definitions are forbidden here. */
19765 /* Remember that we are defining one more class. */
19767 /* Inside the class, surrounding template-parameter-lists do not
19768 apply. */
19769 saved_num_template_parameter_lists
19772 /* We are not in a function body. */
19775 /* Or in a loop. */
19778 /* Or in a switch. */
19781 /* We are not immediately inside an extern "lang" block. */
19782 saved_in_unbraced_linkage_specification_p
19786 /* Start the class. */
19788 {
19791 }
19795 /* If the type is erroneous, skip the entire body of the class. */
19797 else
19798 /* Parse the member-specification. */
19801 /* Look for the trailing `}'. */
19803 /* Look for trailing attributes to apply to this class. */
19811 /* We've finished a type definition. Check for the common syntax
19812 error of forgetting a semicolon after the definition. We need to
19813 be careful, as we can't just check for not-a-semicolon and be done
19814 with it; the user might have typed:
19816 class X { } c = ...;
19817 class X { } *p = ...;
19819 and so forth. Instead, enumerate all the possible tokens that
19820 might follow this production; if we don't see one of them, then
19821 complain and silently insert the semicolon. */
19822 {
19827 /* Don't try to parse c++11 attributes here. As per the
19828 grammar, that should be a task for
19829 cp_parser_decl_specifier_seq. */
19833 {
19844 /* While it's legal for type qualifiers and storage class
19845 specifiers to follow type definitions in the grammar, only
19846 compiler testsuites contain code like that. Assume that if
19847 we see such code, then what we're really seeing is a case
19848 like:
19850 class X { }
19851 const <type> var = ...;
19853 or
19855 class Y { }
19856 static <type> func (...) ...
19858 i.e. the qualifier or specifier applies to the next
19859 declaration. To do so, however, we need to look ahead one
19860 more token to see if *that* token is a type specifier.
19862 This code could be improved to handle:
19864 class Z { }
19865 static const <type> var = ...; */
19868 {
19871 /* Handling user-defined types here would be nice, but very
19872 tricky. */
19873 want_semicolon
19876 }
19880 }
19882 /* If we don't have a type, then something is very wrong and we
19883 shouldn't try to do anything clever. Likewise for not seeing the
19884 closing brace. */
19886 {
19887 cp_token_position prev
19898 else
19901 /* Unget one token and smash it to look as though we encountered
19902 a semicolon in the input stream. */
19907 }
19908 }
19910 /* If this class is not itself within the scope of another class,
19911 then we need to parse the bodies of all of the queued function
19912 definitions. Note that the queued functions defined in a class
19913 are not always processed immediately following the
19914 class-specifier for that class. Consider:
19916 struct A {
19917 struct B { void f() { sizeof (A); } };
19918 };
19920 If `f' were processed before the processing of `A' were
19921 completed, there would be no way to compute the size of `A'.
19922 Note that the nesting we are interested in here is lexical --
19923 not the semantic nesting given by TYPE_CONTEXT. In particular,
19924 for:
19926 struct A { struct B; };
19927 struct A::B { void f() { } };
19929 there is no need to delay the parsing of `A::B::f'. */
19931 {
19932 tree decl;
19939 /* In a first pass, parse default arguments to the functions.
19940 Then, in a second pass, parse the bodies of the functions.
19941 This two-phased approach handles cases like:
19943 struct S {
19944 void f() { g(); }
19945 void g(int i = 3);
19946 };
19948 */
19950 {
19952 /* If there are default arguments that have not yet been processed,
19953 take care of them now. */
19955 {
19960 }
19961 /* Make sure that any template parameters are in scope. */
19963 /* Parse the default argument expressions. */
19965 /* Remove any template parameters from the symbol table. */
19967 }
19969 /* Now parse any NSDMIs. */
19973 {
19975 {
19980 }
19983 }
19990 /* Now do some post-NSDMI bookkeeping. */
19996 /* Now parse the body of the functions. */
19998 {
19999 /* OpenMP UDRs need to be parsed before all other functions. */
20006 }
20007 else
20011 }
20012 else
20015 /* Put back any saved access checks. */
20018 /* Restore saved state. */
20022 parser->num_template_parameter_lists
20024 parser->in_unbraced_linkage_specification_p
20028 }
20030 static tree
20032 {
20033 tree ret;
20038 }
20040 /* Parse a class-head.
20042 class-head:
20043 class-key identifier [opt] base-clause [opt]
20044 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20045 class-key nested-name-specifier [opt] template-id
20046 base-clause [opt]
20048 class-virt-specifier:
20049 final
20051 GNU Extensions:
20052 class-key attributes identifier [opt] base-clause [opt]
20053 class-key attributes nested-name-specifier identifier base-clause [opt]
20054 class-key attributes nested-name-specifier [opt] template-id
20055 base-clause [opt]
20057 Upon return BASES is initialized to the list of base classes (or
20058 NULL, if there are none) in the same form returned by
20059 cp_parser_base_clause.
20061 Returns the TYPE of the indicated class. Sets
20062 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20063 involving a nested-name-specifier was used, and FALSE otherwise.
20065 Returns error_mark_node if this is not a class-head.
20067 Returns NULL_TREE if the class-head is syntactically valid, but
20068 semantically invalid in a way that means we should skip the entire
20069 body of the class. */
20071 static tree
20074 {
20075 tree nested_name_specifier;
20079 tree attributes;
20080 tree bases;
20090 /* Assume no nested-name-specifier will be present. */
20092 /* Assume no template parameter lists will be used in defining the
20093 type. */
20097 /* Look for the class-key. */
20102 /* Parse the attributes. */
20105 /* If the next token is `::', that is invalid -- but sometimes
20106 people do try to write:
20108 struct ::S {};
20110 Handle this gracefully by accepting the extra qualifier, and then
20111 issuing an error about it later if this really is a
20112 class-head. If it turns out just to be an elaborated type
20113 specifier, remain silent. */
20119 /* Determine the name of the class. Begin by looking for an
20120 optional nested-name-specifier. */
20122 nested_name_specifier
20128 /* If there was a nested-name-specifier, then there *must* be an
20129 identifier. */
20131 {
20133 /* Although the grammar says `identifier', it really means
20134 `class-name' or `template-name'. You are only allowed to
20135 define a class that has already been declared with this
20136 syntax.
20138 The proposed resolution for Core Issue 180 says that wherever
20139 you see `class T::X' you should treat `X' as a type-name.
20141 It is OK to define an inaccessible class; for example:
20143 class A { class B; };
20144 class A::B {};
20146 We do not know if we will see a class-name, or a
20147 template-name. We look for a class-name first, in case the
20148 class-name is a template-id; if we looked for the
20149 template-name first we would stop after the template-name. */
20154 class_type,
20158 /* If that didn't work, ignore the nested-name-specifier. */
20160 {
20166 }
20167 /* If we could not find a corresponding TYPE, treat this
20168 declaration like an unqualified declaration. */
20171 /* Otherwise, count the number of templates used in TYPE and its
20172 containing scopes. */
20173 else
20174 {
20175 tree scope;
20187 }
20188 }
20189 /* Otherwise, the identifier is optional. */
20190 else
20191 {
20192 /* We don't know whether what comes next is a template-id,
20193 an identifier, or nothing at all. */
20195 /* Check for a template-id. */
20200 class_key,
20202 /* If that didn't work, it could still be an identifier. */
20204 {
20206 {
20209 }
20210 else
20212 }
20213 else
20214 {
20217 }
20218 }
20223 {
20225 class_key,
20227 }
20230 /* If it's not a `:' or a `{' then we can't really be looking at a
20231 class-head, since a class-head only appears as part of a
20232 class-specifier. We have to detect this situation before calling
20233 xref_tag, since that has irreversible side-effects. */
20235 {
20239 }
20241 /* At this point, we're going ahead with the class-specifier, even
20242 if some other problem occurs. */
20245 {
20250 }
20251 /* Issue the error about the overly-qualified name now. */
20253 {
20258 }
20260 {
20265 }
20267 {
20268 tree scope;
20270 /* Reject typedef-names in class heads. */
20272 {
20275 type);
20278 }
20280 /* Figure out in what scope the declaration is being placed. */
20282 /* If that scope does not contain the scope in which the
20283 class was originally declared, the program is invalid. */
20285 {
20288 "declaration of %qD in namespace %qD which does not "
20291 else
20297 }
20298 /* [dcl.meaning]
20300 A declarator-id shall not be qualified except for the
20301 definition of a ... nested class outside of its class
20302 ... [or] the definition or explicit instantiation of a
20303 class member of a namespace outside of its namespace. */
20305 {
20310 }
20311 }
20312 /* An explicit-specialization must be preceded by "template <>". If
20313 it is not, try to recover gracefully. */
20317 {
20321 /* Take the same action that would have been taken by
20322 cp_parser_explicit_specialization. */
20325 }
20326 /* There must be no "return" statements between this point and the
20327 end of this function; set "type "to the correct return value and
20328 use "goto done;" to return. */
20329 /* Make sure that the right number of template parameters were
20330 present. */
20334 {
20335 /* If something went wrong, there is no point in even trying to
20336 process the class-definition. */
20339 }
20341 /* Look up the type. */
20343 {
20347 {
20351 }
20352 else
20353 {
20356 }
20359 }
20361 {
20362 tree class_type;
20364 /* Given:
20366 template <typename T> struct S { struct T };
20367 template <typename T> struct S<T>::T { };
20369 we will get a TYPENAME_TYPE when processing the definition of
20370 `S::T'. We need to resolve it to the actual type before we
20371 try to define it. */
20373 {
20378 else
20379 {
20382 }
20383 }
20387 {
20390 }
20393 /* Enter the scope indicated by the nested-name-specifier. */
20395 /* Get the canonical version of this type. */
20397 /* Call push_template_decl if it seems like we should be defining a
20398 template either from the template headers or the type we're
20399 defining, so that we diagnose both extra and missing headers. */
20403 {
20406 {
20409 }
20410 }
20414 }
20416 {
20417 /* If the class was unnamed, create a dummy name. */
20422 }
20424 /* Indicate whether this class was declared as a `class' or as a
20425 `struct'. */
20430 /* If this type was already complete, and we see another definition,
20431 that's an error. */
20433 {
20435 type);
20437 type);
20440 }
20445 {
20446 /* Apply attributes now, before any use of the class as a template
20447 argument in its base list. */
20450 }
20452 /* We will have entered the scope containing the class; the names of
20453 base classes should be looked up in that context. For example:
20455 struct A { struct B {}; struct C; };
20456 struct A::C : B {};
20458 is valid. */
20460 /* Get the list of base-classes, if there is one. */
20462 {
20463 /* PR59482: enter the class scope so that base-specifiers are looked
20464 up correctly. */
20468 /* PR59482: get out of the previously pushed class scope so that the
20469 subsequent pops pop the right thing. */
20472 }
20473 else
20476 /* If we're really defining a class, process the base classes.
20477 If they're invalid, fail. */
20482 done:
20483 /* Leave the scope given by the nested-name-specifier. We will
20484 enter the class scope itself while processing the members. */
20489 {
20492 }
20498 out:
20501 }
20503 /* Parse a class-key.
20505 class-key:
20506 class
20507 struct
20508 union
20510 Returns the kind of class-key specified, or none_type to indicate
20511 error. */
20513 static enum tag_types
20515 {
20519 /* Look for the class-key. */
20524 /* Check to see if the TOKEN is a class-key. */
20529 }
20531 /* Parse a type-parameter-key.
20533 type-parameter-key:
20534 class
20535 typename
20536 */
20538 static void
20540 {
20541 /* Look for the type-parameter-key. */
20545 {
20548 /* typename is not allowed in a template template parameter
20549 by the standard until C++1Z. */
20551 "ISO C++ forbids typename key in template template parameter;"
20553 }
20554 else
20558 }
20560 /* Parse an (optional) member-specification.
20562 member-specification:
20563 member-declaration member-specification [opt]
20564 access-specifier : member-specification [opt] */
20566 static void
20568 {
20570 {
20574 /* Peek at the next token. */
20576 /* If it's a `}', or EOF then we've seen all the members. */
20582 /* See if this token is a keyword. */
20585 {
20589 /* Consume the access-specifier. */
20591 /* Remember which access-specifier is active. */
20593 /* Look for the `:'. */
20598 /* Accept #pragmas at class scope. */
20600 {
20603 }
20605 /* Otherwise, the next construction must be a
20606 member-declaration. */
20608 }
20609 }
20610 }
20612 /* Parse a member-declaration.
20614 member-declaration:
20615 decl-specifier-seq [opt] member-declarator-list [opt] ;
20616 function-definition ; [opt]
20617 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20618 using-declaration
20619 template-declaration
20620 alias-declaration
20622 member-declarator-list:
20623 member-declarator
20624 member-declarator-list , member-declarator
20626 member-declarator:
20627 declarator pure-specifier [opt]
20628 declarator constant-initializer [opt]
20629 identifier [opt] : constant-expression
20631 GNU Extensions:
20633 member-declaration:
20634 __extension__ member-declaration
20636 member-declarator:
20637 declarator attributes [opt] pure-specifier [opt]
20638 declarator attributes [opt] constant-initializer [opt]
20639 identifier [opt] attributes [opt] : constant-expression
20641 C++0x Extensions:
20643 member-declaration:
20644 static_assert-declaration */
20646 static void
20648 {
20649 cp_decl_specifier_seq decl_specifiers;
20650 tree prefix_attributes;
20651 tree decl;
20660 /* Check for the `__extension__' keyword. */
20662 {
20663 /* Recurse. */
20665 /* Restore the old value of the PEDANTIC flag. */
20669 }
20671 /* Check for a template-declaration. */
20673 {
20674 /* An explicit specialization here is an error condition, and we
20675 expect the specialization handler to detect and report this. */
20679 else
20683 }
20685 /* Check for a using-declaration. */
20687 {
20689 {
20690 /* Parse the using-declaration. */
20694 }
20695 else
20696 {
20697 tree decl;
20701 /* Note that if we actually see the '=' token after the
20702 identifier, cp_parser_alias_declaration commits the
20703 tentative parse. In that case, we really expects an
20704 alias-declaration. Otherwise, we expect a using
20705 declaration. */
20706 alias_decl_expected =
20712 else
20716 }
20717 }
20719 /* Check for @defs. */
20721 {
20726 {
20731 }
20733 }
20735 /* If the next token is `static_assert' we have a static assertion. */
20737 {
20740 }
20747 /* Parse the decl-specifier-seq. */
20750 CP_PARSER_FLAGS_OPTIONAL,
20753 /* Check for an invalid type-name. */
20757 /* If there is no declarator, then the decl-specifier-seq should
20758 specify a type. */
20760 {
20761 /* If there was no decl-specifier-seq, and the next token is a
20762 `;', then we have something like:
20764 struct S { ; };
20766 [class.mem]
20768 Each member-declaration shall declare at least one member
20769 name of the class. */
20771 {
20775 }
20776 else
20777 {
20778 tree type;
20780 /* See if this declaration is a friend. */
20782 /* If there were decl-specifiers, check to see if there was
20783 a class-declaration. */
20786 /* Nested classes have already been added to the class, but
20787 a `friend' needs to be explicitly registered. */
20789 {
20790 /* If the `friend' keyword was present, the friend must
20791 be introduced with a class-key. */
20794 "in C++03 a class-key must be used "
20796 /* In this case:
20798 template <typename T> struct A {
20799 friend struct A<T>::B;
20800 };
20802 A<T>::B will be represented by a TYPENAME_TYPE, and
20803 therefore not recognized by check_tag_decl. */
20805 {
20809 }
20812 "friend declaration does not name a class or "
20814 else
20817 }
20818 /* If there is no TYPE, an error message will already have
20819 been issued. */
20821 ;
20822 /* An anonymous aggregate has to be handled specially; such
20823 a declaration really declares a data member (with a
20824 particular type), as opposed to a nested class. */
20826 {
20827 /* C++11 9.5/6. */
20830 "a storage class on an anonymous aggregate "
20833 /* Remove constructors and such from TYPE, now that we
20834 know it is an anonymous aggregate. */
20836 /* And make the corresponding data member. */
20839 /* Add it to the class. */
20841 }
20842 else
20843 cp_parser_check_access_in_redeclaration
20846 }
20847 }
20848 else
20849 {
20852 /* Clear attributes from the decl_specifiers but keep them
20853 around as prefix attributes that apply them to the entity
20854 being declared. */
20858 /* See if these declarations will be friends. */
20861 /* Keep going until we hit the `;' at the end of the
20862 declaration. */
20864 {
20866 tree first_attribute;
20868 /* Peek at the next token. */
20871 /* Check for a bitfield declaration. */
20876 {
20877 tree identifier;
20878 tree width;
20880 /* Get the name of the bitfield. Note that we cannot just
20881 check TOKEN here because it may have been invalidated by
20882 the call to cp_lexer_peek_nth_token above. */
20885 else
20888 /* Consume the `:' token. */
20890 /* Get the width of the bitfield. */
20891 width
20894 /* Look for attributes that apply to the bitfield. */
20896 /* Remember which attributes are prefix attributes and
20897 which are not. */
20899 /* Combine the attributes. */
20902 /* Create the bitfield declaration. */
20905 identifier,
20906 sfk_none)
20909 width,
20910 attributes);
20911 }
20912 else
20913 {
20915 tree initializer;
20916 tree asm_specification;
20919 /* Parse the declarator. */
20920 declarator
20925 friend_p);
20927 /* If something went wrong parsing the declarator, make sure
20928 that we at least consume some tokens. */
20930 {
20931 /* Skip to the end of the statement. */
20933 /* If the next token is not a semicolon, that is
20934 probably because we just skipped over the body of
20935 a function. So, we consume a semicolon if
20936 present, but do not issue an error message if it
20937 is not present. */
20939 CPP_SEMICOLON))
20942 }
20945 cp_parser_check_for_definition_in_return_type
20949 /* Look for an asm-specification. */
20951 /* Look for attributes that apply to the declaration. */
20953 /* Remember which attributes are prefix attributes and
20954 which are not. */
20956 /* Combine the attributes. */
20959 /* If it's an `=', then we have a constant-initializer or a
20960 pure-specifier. It is not correct to parse the
20961 initializer before registering the member declaration
20962 since the member declaration should be in scope while
20963 its initializer is processed. However, the rest of the
20964 front end does not yet provide an interface that allows
20965 us to handle this correctly. */
20967 {
20968 /* In [class.mem]:
20970 A pure-specifier shall be used only in the declaration of
20971 a virtual function.
20973 A member-declarator can contain a constant-initializer
20974 only if it declares a static member of integral or
20975 enumeration type.
20977 Therefore, if the DECLARATOR is for a function, we look
20978 for a pure-specifier; otherwise, we look for a
20979 constant-initializer. When we call `grokfield', it will
20980 perform more stringent semantics checks. */
20992 {
20994 /* Don't require a constant rvalue in C++11, since we
20995 might want a reference constant. We'll enforce
20996 constancy later. */
20998 /* Parse the initializer. */
21001 }
21002 else
21003 /* Parse the initializer. */
21005 }
21008 {
21012 else
21014 }
21015 /* Otherwise, there is no initializer. */
21016 else
21019 /* See if we are probably looking at a function
21020 definition. We are certainly not looking at a
21021 member-declarator. Calling `grokfield' has
21022 side-effects, so we must not do it unless we are sure
21023 that we are looking at a member-declarator. */
21026 {
21027 /* The grammar does not allow a pure-specifier to be
21028 used when a member function is defined. (It is
21029 possible that this fact is an oversight in the
21030 standard, since a pure function may be defined
21031 outside of the class-specifier. */
21037 declarator,
21038 attributes);
21041 /* If the member was not a friend, declare it here. */
21044 /* Peek at the next token. */
21046 /* If the next token is a semicolon, consume it. */
21050 }
21051 else
21054 /* Create the declaration. */
21059 {
21062 else
21064 }
21065 }
21069 /* Reset PREFIX_ATTRIBUTES. */
21075 /* If there is any qualification still in effect, clear it
21076 now; we will be starting fresh with the next declarator. */
21080 /* If it's a `,', then there are more declarators. */
21082 {
21085 {
21089 }
21090 }
21091 /* If the next token isn't a `;', then we have a parse error. */
21093 CPP_SEMICOLON))
21094 {
21095 /* The next token might be a ways away from where the
21096 actual semicolon is missing. Find the previous token
21097 and use that for our error position. */
21102 /* Assume that the user meant to provide a semicolon. If
21103 we were to cp_parser_skip_to_end_of_statement, we might
21104 skip to a semicolon inside a member function definition
21105 and issue nonsensical error messages. */
21107 }
21110 {
21111 /* Add DECL to the list of members. */
21113 /* Explicitly include, eg, NSDMIs, for better error
21114 recovery (c++/58650). */
21123 /* Add DECL to the queue of NSDMI to be parsed later. */
21125 }
21129 }
21130 }
21133 out:
21135 }
21137 /* Parse a pure-specifier.
21139 pure-specifier:
21140 = 0
21142 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21143 Otherwise, ERROR_MARK_NODE is returned. */
21145 static tree
21147 {
21150 /* Look for the `=' token. */
21153 /* Look for the `0' token. */
21162 /* Accept = default or = delete in c++0x mode. */
21165 {
21168 }
21170 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21172 {
21177 }
21179 {
21182 }
21185 }
21187 /* Parse a constant-initializer.
21189 constant-initializer:
21190 = constant-expression
21192 Returns a representation of the constant-expression. */
21194 static tree
21196 {
21197 /* Look for the `=' token. */
21201 /* It is invalid to write:
21203 struct S { static const int i = { 7 }; };
21205 */
21207 {
21210 /* Consume the opening brace. */
21212 /* Skip the initializer. */
21214 /* Look for the trailing `}'. */
21218 }
21221 }
21223 /* Derived classes [gram.class.derived] */
21225 /* Parse a base-clause.
21227 base-clause:
21228 : base-specifier-list
21230 base-specifier-list:
21231 base-specifier ... [opt]
21232 base-specifier-list , base-specifier ... [opt]
21234 Returns a TREE_LIST representing the base-classes, in the order in
21235 which they were declared. The representation of each node is as
21236 described by cp_parser_base_specifier.
21238 In the case that no bases are specified, this function will return
21239 NULL_TREE, not ERROR_MARK_NODE. */
21241 static tree
21243 {
21246 /* Look for the `:' that begins the list. */
21249 /* Scan the base-specifier-list. */
21251 {
21253 tree base;
21256 /* Look for the base-specifier. */
21258 /* Look for the (optional) ellipsis. */
21260 {
21261 /* Consume the `...'. */
21265 }
21267 /* Add BASE to the front of the list. */
21269 {
21271 /* Make this a pack expansion type. */
21275 {
21278 }
21279 }
21280 /* Peek at the next token. */
21282 /* If it's not a comma, then the list is complete. */
21285 /* Consume the `,'. */
21287 }
21289 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21290 base class had a qualified name. However, the next name that
21291 appears is certainly not qualified. */
21297 }
21299 /* Parse a base-specifier.
21301 base-specifier:
21302 :: [opt] nested-name-specifier [opt] class-name
21303 virtual access-specifier [opt] :: [opt] nested-name-specifier
21304 [opt] class-name
21305 access-specifier virtual [opt] :: [opt] nested-name-specifier
21306 [opt] class-name
21308 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21309 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21310 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21311 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21313 static tree
21315 {
21323 tree type;
21325 /* Process the optional `virtual' and `access-specifier'. */
21327 {
21328 /* Peek at the next token. */
21330 /* Process `virtual'. */
21332 {
21334 /* If `virtual' appears more than once, issue an error. */
21336 {
21340 }
21344 /* Consume the `virtual' token. */
21352 /* If more than one access specifier appears, issue an
21353 error. */
21356 {
21360 }
21364 /* Consume the access-specifier. */
21372 }
21373 }
21374 /* It is not uncommon to see programs mechanically, erroneously, use
21375 the 'typename' keyword to denote (dependent) qualified types
21376 as base classes. */
21378 {
21383 else
21385 "keyword %<typename%> not allowed in this context "
21388 }
21390 /* Look for the optional `::' operator. */
21392 /* Look for the nested-name-specifier. The simplest way to
21393 implement:
21395 [temp.res]
21397 The keyword `typename' is not permitted in a base-specifier or
21398 mem-initializer; in these contexts a qualified name that
21399 depends on a template-parameter is implicitly assumed to be a
21400 type name.
21402 is to pretend that we have seen the `typename' keyword at this
21403 point. */
21407 typename_type,
21409 /* If the base class is given by a qualified name, assume that names
21410 we see are type names or templates, as appropriate. */
21416 /* DR 950 allows decltype as a base-specifier. */
21418 else
21419 {
21420 /* Otherwise, look for the class-name. */
21422 class_scope_p,
21423 template_p,
21424 typename_type,
21429 }
21435 }
21437 /* Exception handling [gram.exception] */
21439 /* Parse an (optional) noexcept-specification.
21441 noexcept-specification:
21442 noexcept ( constant-expression ) [opt]
21444 If no noexcept-specification is present, returns NULL_TREE.
21445 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21446 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21447 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21448 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21449 in which case a boolean condition is returned instead. */
21451 static tree
21456 {
21460 /* Peek at the next token. */
21463 /* Is it a noexcept-specification? */
21465 {
21466 tree expr;
21470 {
21474 {
21475 /* Types may not be defined in an exception-specification. */
21477 parser->type_definition_forbidden_message
21482 /* Restore the saved message. */
21484 }
21485 else
21486 {
21489 }
21492 }
21493 else
21494 {
21498 }
21500 /* We cannot build a noexcept-spec right away because this will check
21501 that expr is a constexpr. */
21504 else
21506 }
21507 else
21509 }
21511 /* Parse an (optional) exception-specification.
21513 exception-specification:
21514 throw ( type-id-list [opt] )
21516 Returns a TREE_LIST representing the exception-specification. The
21517 TREE_VALUE of each node is a type. */
21519 static tree
21521 {
21523 tree type_id_list;
21526 /* Peek at the next token. */
21529 /* Is it a noexcept-specification? */
21535 /* If it's not `throw', then there's no exception-specification. */
21539 #if 0
21540 /* Enable this once a lot of code has transitioned to noexcept? */
21544 #endif
21546 /* Consume the `throw'. */
21549 /* Look for the `('. */
21552 /* Peek at the next token. */
21554 /* If it's not a `)', then there is a type-id-list. */
21556 {
21557 /* Types may not be defined in an exception-specification. */
21559 parser->type_definition_forbidden_message
21561 /* Parse the type-id-list. */
21563 /* Restore the saved message. */
21565 }
21566 else
21569 /* Look for the `)'. */
21573 }
21575 /* Parse an (optional) type-id-list.
21577 type-id-list:
21578 type-id ... [opt]
21579 type-id-list , type-id ... [opt]
21581 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21582 in the order that the types were presented. */
21584 static tree
21586 {
21590 {
21592 tree type;
21594 /* Get the next type-id. */
21596 /* Parse the optional ellipsis. */
21598 {
21599 /* Consume the `...'. */
21602 /* Turn the type into a pack expansion expression. */
21604 }
21605 /* Add it to the list. */
21607 /* Peek at the next token. */
21609 /* If it is not a `,', we are done. */
21612 /* Consume the `,'. */
21614 }
21617 }
21619 /* Parse a try-block.
21621 try-block:
21622 try compound-statement handler-seq */
21624 static tree
21626 {
21627 tree try_block;
21641 }
21643 /* Parse a function-try-block.
21645 function-try-block:
21646 try ctor-initializer [opt] function-body handler-seq */
21648 static bool
21650 {
21651 tree compound_stmt;
21652 tree try_block;
21655 /* Look for the `try' keyword. */
21658 /* Let the rest of the front end know where we are. */
21660 /* Parse the function-body. */
21661 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21663 /* We're done with the `try' part. */
21665 /* Parse the handlers. */
21667 /* We're done with the handlers. */
21671 }
21673 /* Parse a handler-seq.
21675 handler-seq:
21676 handler handler-seq [opt] */
21678 static void
21680 {
21682 {
21685 /* Parse the handler. */
21687 /* Peek at the next token. */
21689 /* If it's not `catch' then there are no more handlers. */
21692 }
21693 }
21695 /* Parse a handler.
21697 handler:
21698 catch ( exception-declaration ) compound-statement */
21700 static void
21702 {
21703 tree handler;
21704 tree declaration;
21714 }
21716 /* Parse an exception-declaration.
21718 exception-declaration:
21719 type-specifier-seq declarator
21720 type-specifier-seq abstract-declarator
21721 type-specifier-seq
21722 ...
21724 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21725 ellipsis variant is used. */
21727 static tree
21729 {
21730 cp_decl_specifier_seq type_specifiers;
21734 /* If it's an ellipsis, it's easy to handle. */
21736 {
21737 /* Consume the `...' token. */
21740 }
21742 /* Types may not be defined in exception-declarations. */
21744 parser->type_definition_forbidden_message
21747 /* Parse the type-specifier-seq. */
21751 /* If it's a `)', then there is no declarator. */
21754 else
21761 /* Restore the saved message. */
21768 }
21770 /* Parse a throw-expression.
21772 throw-expression:
21773 throw assignment-expression [opt]
21775 Returns a THROW_EXPR representing the throw-expression. */
21777 static tree
21779 {
21780 tree expression;
21785 /* Figure out whether or not there is an assignment-expression
21786 following the "throw" keyword. */
21794 else
21798 }
21800 /* GNU Extensions */
21802 /* Parse an (optional) asm-specification.
21804 asm-specification:
21805 asm ( string-literal )
21807 If the asm-specification is present, returns a STRING_CST
21808 corresponding to the string-literal. Otherwise, returns
21809 NULL_TREE. */
21811 static tree
21813 {
21815 tree asm_specification;
21817 /* Peek at the next token. */
21819 /* If the next token isn't the `asm' keyword, then there's no
21820 asm-specification. */
21824 /* Consume the `asm' token. */
21826 /* Look for the `('. */
21829 /* Look for the string-literal. */
21832 /* Look for the `)'. */
21836 }
21838 /* Parse an asm-operand-list.
21840 asm-operand-list:
21841 asm-operand
21842 asm-operand-list , asm-operand
21844 asm-operand:
21845 string-literal ( expression )
21846 [ string-literal ] string-literal ( expression )
21848 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21849 each node is the expression. The TREE_PURPOSE is itself a
21850 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21851 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21852 is a STRING_CST for the string literal before the parenthesis. Returns
21853 ERROR_MARK_NODE if any of the operands are invalid. */
21855 static tree
21857 {
21862 {
21863 tree string_literal;
21864 tree expression;
21865 tree name;
21868 {
21869 /* Consume the `[' token. */
21871 /* Read the operand name. */
21876 /* Look for the closing `]'. */
21878 }
21879 else
21881 /* Look for the string-literal. */
21884 /* Look for the `('. */
21886 /* Parse the expression. */
21888 /* Look for the `)'. */
21896 /* Add this operand to the list. */
21898 expression,
21899 asm_operands);
21900 /* If the next token is not a `,', there are no more
21901 operands. */
21904 /* Consume the `,'. */
21906 }
21909 }
21911 /* Parse an asm-clobber-list.
21913 asm-clobber-list:
21914 string-literal
21915 asm-clobber-list , string-literal
21917 Returns a TREE_LIST, indicating the clobbers in the order that they
21918 appeared. The TREE_VALUE of each node is a STRING_CST. */
21920 static tree
21922 {
21926 {
21927 tree string_literal;
21929 /* Look for the string literal. */
21931 /* Add it to the list. */
21933 /* If the next token is not a `,', then the list is
21934 complete. */
21937 /* Consume the `,' token. */
21939 }
21942 }
21944 /* Parse an asm-label-list.
21946 asm-label-list:
21947 identifier
21948 asm-label-list , identifier
21950 Returns a TREE_LIST, indicating the labels in the order that they
21951 appeared. The TREE_VALUE of each node is a label. */
21953 static tree
21955 {
21959 {
21962 /* Look for the identifier. */
21965 {
21968 {
21974 }
21975 }
21976 /* If the next token is not a `,', then the list is
21977 complete. */
21980 /* Consume the `,' token. */
21982 }
21985 }
21987 /* Return TRUE iff the next tokens in the stream are possibly the
21988 beginning of a GNU extension attribute. */
21990 static bool
21992 {
21994 }
21996 /* Return TRUE iff the next tokens in the stream are possibly the
21997 beginning of a standard C++-11 attribute specifier. */
21999 static bool
22001 {
22003 }
22005 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22006 beginning of a standard C++-11 attribute specifier. */
22008 static bool
22010 {
22018 }
22020 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22021 beginning of a GNU extension attribute. */
22023 static bool
22025 {
22029 }
22031 /* Return true iff the next tokens can be the beginning of either a
22032 GNU attribute list, or a standard C++11 attribute sequence. */
22034 static bool
22036 {
22039 }
22041 /* Return true iff the next Nth tokens can be the beginning of either
22042 a GNU attribute list, or a standard C++11 attribute sequence. */
22044 static bool
22046 {
22049 }
22051 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22052 of GNU attributes, or return NULL. */
22054 static tree
22056 {
22060 }
22062 #define CILK_SIMD_FN_CLAUSE_MASK \
22063 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22064 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22065 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22066 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22067 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22069 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22070 vector [(<clauses>)] */
22072 static void
22074 {
22078 {
22083 }
22086 {
22089 paren_scope++;
22090 }
22092 {
22095 paren_scope++;
22097 paren_scope--;
22098 /* Do not push the last ')' */
22101 }
22110 }
22112 /* Parse an (optional) series of attributes.
22114 attributes:
22115 attributes attribute
22117 attribute:
22118 __attribute__ (( attribute-list [opt] ))
22120 The return value is as for cp_parser_gnu_attribute_list. */
22122 static tree
22124 {
22128 {
22130 tree attribute_list;
22133 /* Peek at the next token. */
22135 /* If it's not `__attribute__', then we're done. */
22139 /* Consume the `__attribute__' keyword. */
22141 /* Look for the two `(' tokens. */
22145 /* Peek at the next token. */
22148 /* Parse the attribute-list. */
22150 else
22151 /* If the next token is a `)', then there is no attribute
22152 list. */
22155 /* Look for the two `)' tokens. */
22163 /* Add these new attributes to the list. */
22165 }
22168 }
22170 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22171 "__vector" or "__vector__." */
22175 {
22179 }
22181 /* Parse a GNU attribute-list.
22183 attribute-list:
22184 attribute
22185 attribute-list , attribute
22187 attribute:
22188 identifier
22189 identifier ( identifier )
22190 identifier ( identifier , expression-list )
22191 identifier ( expression-list )
22193 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22194 to an attribute. The TREE_PURPOSE of each node is the identifier
22195 indicating which attribute is in use. The TREE_VALUE represents
22196 the arguments, if any. */
22198 static tree
22200 {
22206 {
22208 tree identifier;
22209 tree attribute;
22211 /* Look for the identifier. We also allow keywords here; for
22212 example `__attribute__ ((const))' is legal. */
22216 {
22219 /* Consume the token, but save it since we need it for the
22220 SIMD enabled function parsing. */
22223 /* Save away the identifier that indicates which attribute
22224 this is. */
22226 /* For keywords, use the canonical spelling, not the
22227 parsed identifier. */
22233 /* Peek at the next token. */
22235 /* If it's an `(', then parse the attribute arguments. */
22237 {
22242 {
22245 }
22246 else
22247 vec = cp_parser_parenthesized_expression_list
22253 else
22254 {
22257 }
22258 /* Save the arguments away. */
22260 }
22262 {
22265 }
22268 {
22269 /* Add this attribute to the list. */
22272 }
22275 }
22276 /* Now, look for more attributes. If the next token isn't a
22277 `,', we're done. */
22281 /* Consume the comma and keep going. */
22283 }
22286 /* We built up the list in reverse order. */
22288 }
22290 /* Parse a standard C++11 attribute.
22292 The returned representation is a TREE_LIST which TREE_PURPOSE is
22293 the scoped name of the attribute, and the TREE_VALUE is its
22294 arguments list.
22296 Note that the scoped name of the attribute is itself a TREE_LIST
22297 which TREE_PURPOSE is the namespace of the attribute, and
22298 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22299 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22300 and which TREE_PURPOSE is directly the attribute name.
22302 Clients of the attribute code should use get_attribute_namespace
22303 and get_attribute_name to get the actual namespace and name of
22304 attributes, regardless of their being GNU or C++11 attributes.
22306 attribute:
22307 attribute-token attribute-argument-clause [opt]
22309 attribute-token:
22310 identifier
22311 attribute-scoped-token
22313 attribute-scoped-token:
22314 attribute-namespace :: identifier
22316 attribute-namespace:
22317 identifier
22319 attribute-argument-clause:
22320 ( balanced-token-seq )
22322 balanced-token-seq:
22323 balanced-token [opt]
22324 balanced-token-seq balanced-token
22326 balanced-token:
22327 ( balanced-token-seq )
22328 [ balanced-token-seq ]
22329 { balanced-token-seq }. */
22331 static tree
22333 {
22337 /* First, parse name of the the attribute, a.k.a
22338 attribute-token. */
22355 {
22356 /* We are seeing a scoped attribute token. */
22366 else
22367 {
22371 }
22373 NULL_TREE);
22375 }
22376 else
22377 {
22379 NULL_TREE);
22380 /* C++11 noreturn attribute is equivalent to GNU's. */
22383 /* C++14 deprecated attribute is equivalent to GNU's. */
22385 {
22388 "%<deprecated%> is a C++14 feature;"
22391 }
22392 }
22394 /* Now parse the optional argument clause of the attribute. */
22399 {
22405 /* A GNU attribute that takes an identifier in parameter. */
22408 vec = cp_parser_parenthesized_expression_list
22414 else
22415 {
22418 }
22422 else
22424 }
22427 }
22429 /* Parse a list of standard C++-11 attributes.
22431 attribute-list:
22432 attribute [opt]
22433 attribute-list , attribute[opt]
22434 attribute ...
22435 attribute-list , attribute ...
22436 */
22438 static tree
22440 {
22445 {
22450 {
22453 }
22458 }
22461 }
22463 /* Parse a standard C++-11 attribute specifier.
22465 attribute-specifier:
22466 [ [ attribute-list ] ]
22467 alignment-specifier
22469 alignment-specifier:
22470 alignas ( type-id ... [opt] )
22471 alignas ( alignment-expression ... [opt] ). */
22473 static tree
22475 {
22481 {
22490 else
22491 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22492 when we are sure that we have actually parsed them. */
22494 }
22495 else
22496 {
22497 tree alignas_expr;
22499 /* Look for an alignment-specifier. */
22511 {
22514 }
22520 {
22524 alignas_expr =
22531 }
22534 {
22537 }
22541 /* Build the C++-11 representation of an 'aligned'
22542 attribute. */
22543 attributes =
22547 }
22550 }
22552 /* Parse a standard C++-11 attribute-specifier-seq.
22554 attribute-specifier-seq:
22555 attribute-specifier-seq [opt] attribute-specifier
22556 */
22558 static tree
22560 {
22564 {
22573 }
22577 }
22579 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22580 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22581 current value of the PEDANTIC flag, regardless of whether or not
22582 the `__extension__' keyword is present. The caller is responsible
22583 for restoring the value of the PEDANTIC flag. */
22585 static bool
22587 {
22588 /* Save the old value of the PEDANTIC flag. */
22592 {
22593 /* Consume the `__extension__' token. */
22595 /* We're not being pedantic while the `__extension__' keyword is
22596 in effect. */
22600 }
22603 }
22605 /* Parse a label declaration.
22607 label-declaration:
22608 __label__ label-declarator-seq ;
22610 label-declarator-seq:
22611 identifier , label-declarator-seq
22612 identifier */
22614 static void
22616 {
22617 /* Look for the `__label__' keyword. */
22621 {
22622 tree identifier;
22624 /* Look for an identifier. */
22626 /* If we failed, stop. */
22629 /* Declare it as a label. */
22631 /* If the next token is a `;', stop. */
22634 /* Look for the `,' separating the label declarations. */
22636 }
22638 /* Look for the final `;'. */
22640 }
22642 /* Support Functions */
22644 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22645 NAME should have one of the representations used for an
22646 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22647 is returned. If PARSER->SCOPE is a dependent type, then a
22648 SCOPE_REF is returned.
22650 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22651 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22652 was formed. Abstractly, such entities should not be passed to this
22653 function, because they do not need to be looked up, but it is
22654 simpler to check for this special case here, rather than at the
22655 call-sites.
22657 In cases not explicitly covered above, this function returns a
22658 DECL, OVERLOAD, or baselink representing the result of the lookup.
22659 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22660 is returned.
22662 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22663 (e.g., "struct") that was used. In that case bindings that do not
22664 refer to types are ignored.
22666 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22667 ignored.
22669 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22670 are ignored.
22672 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22673 types.
22675 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22676 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22677 NULL_TREE otherwise. */
22679 static tree
22686 location_t name_location)
22687 {
22688 tree decl;
22691 /* Assume that the lookup will be unambiguous. */
22695 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22696 no longer valid. Note that if we are parsing tentatively, and
22697 the parse fails, OBJECT_TYPE will be automatically restored. */
22703 /* A template-id has already been resolved; there is no lookup to
22704 do. */
22708 {
22712 }
22714 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22715 it should already have been checked to make sure that the name
22716 used matches the type being destroyed. */
22718 {
22719 tree type;
22721 /* Figure out to which type this destructor applies. */
22726 else
22728 /* If that's not a class type, there is no destructor. */
22735 /* If it was a class type, return the destructor. */
22737 }
22739 /* By this point, the NAME should be an ordinary identifier. If
22740 the id-expression was a qualified name, the qualifying scope is
22741 stored in PARSER->SCOPE at this point. */
22744 /* Perform the lookup. */
22746 {
22752 /* If the SCOPE is dependent, the lookup must be deferred until
22753 the template is instantiated -- unless we are explicitly
22754 looking up names in uninstantiated templates. Even then, we
22755 cannot look up the name if the scope is not a class type; it
22756 might, for example, be a template type parameter. */
22761 /* Defer lookup. */
22763 else
22764 {
22767 /* If PARSER->SCOPE is a dependent type, then it must be a
22768 class type, and we must not be checking dependencies;
22769 otherwise, we would have processed this lookup above. So
22770 that PARSER->SCOPE is not considered a dependent base by
22771 lookup_member, we must enter the scope here. */
22775 /* If the PARSER->SCOPE is a template specialization, it
22776 may be instantiated during name lookup. In that case,
22777 errors may be issued. Even if we rollback the current
22778 tentative parse, those errors are valid. */
22783 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22784 lookup result and the nested-name-specifier nominates a class C:
22785 * if the name specified after the nested-name-specifier, when
22786 looked up in C, is the injected-class-name of C (Clause 9), or
22787 * if the name specified after the nested-name-specifier is the
22788 same as the identifier or the simple-template-id's template-
22789 name in the last component of the nested-name-specifier,
22790 the name is instead considered to name the constructor of
22791 class C. [ Note: for example, the constructor is not an
22792 acceptable lookup result in an elaborated-type-specifier so
22793 the constructor would not be used in place of the
22794 injected-class-name. --end note ] Such a constructor name
22795 shall be used only in the declarator-id of a declaration that
22796 names a constructor or in a using-declaration. */
22804 /* If we have a single function from a using decl, pull it out. */
22811 }
22813 /* If the scope is a dependent type and either we deferred lookup or
22814 we did lookup but didn't find the name, rememeber the name. */
22817 {
22819 {
22820 tree type;
22822 /* The resolution to Core Issue 180 says that `struct
22823 A::B' should be considered a type-name, even if `A'
22824 is dependent. */
22829 }
22833 CPP_CLOSE_PAREN)))
22837 else
22840 is_template);
22841 }
22844 }
22846 {
22847 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22848 OBJECT_TYPE is not a class. */
22850 /* If the OBJECT_TYPE is a template specialization, it may
22851 be instantiated during name lookup. In that case, errors
22852 may be issued. Even if we rollback the current tentative
22853 parse, those errors are valid. */
22855 name,
22858 tf_warning_or_error);
22859 else
22863 /* Look it up in the enclosing context. */
22869 }
22870 else
22871 {
22877 }
22879 /* If the lookup failed, let our caller know. */
22883 /* Pull out the template from an injected-class-name (or multiple). */
22887 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22889 {
22892 /* The error message we have to print is too complicated for
22893 cp_parser_error, so we incorporate its actions directly. */
22895 {
22897 name);
22899 }
22901 }
22909 /* If we have resolved the name of a member declaration, check to
22910 see if the declaration is accessible. When the name resolves to
22911 set of overloaded functions, accessibility is checked when
22912 overload resolution is done.
22914 During an explicit instantiation, access is not checked at all,
22915 as per [temp.explicit]. */
22922 }
22924 /* Like cp_parser_lookup_name, but for use in the typical case where
22925 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22926 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22928 static tree
22930 {
22932 none_type,
22937 location);
22938 }
22940 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22941 the current context, return the TYPE_DECL. If TAG_NAME_P is
22942 true, the DECL indicates the class being defined in a class-head,
22943 or declared in an elaborated-type-specifier.
22945 Otherwise, return DECL. */
22947 static tree
22949 {
22950 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22951 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22953 struct A {
22954 template <typename T> struct B;
22955 };
22957 template <typename T> struct A::B {};
22959 Similarly, in an elaborated-type-specifier:
22961 namespace N { struct X{}; }
22963 struct A {
22964 template <typename T> friend struct N::X;
22965 };
22967 However, if the DECL refers to a class type, and we are in
22968 the scope of the class, then the name lookup automatically
22969 finds the TYPE_DECL created by build_self_reference rather
22970 than a TEMPLATE_DECL. For example, in:
22972 template <class T> struct S {
22973 S s;
22974 };
22976 there is no need to handle such case. */
22982 }
22984 /* If too many, or too few, template-parameter lists apply to the
22985 declarator, issue an error message. Returns TRUE if all went well,
22986 and FALSE otherwise. */
22988 static bool
22991 location_t declarator_location)
22992 {
22994 {
22996 {
23004 /* If the DECLARATOR has the form `X<y>' then it uses one
23005 additional level of template parameters. */
23008 return cp_parser_check_template_parameters
23010 }
23025 }
23027 }
23029 /* NUM_TEMPLATES were used in the current declaration. If that is
23030 invalid, return FALSE and issue an error messages. Otherwise,
23031 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23032 declarator and we can print more accurate diagnostics. */
23034 static bool
23037 location_t location,
23039 {
23040 /* If there are the same number of template classes and parameter
23041 lists, that's OK. */
23044 /* If there are more, but only one more, then we are referring to a
23045 member template. That's OK too. */
23048 /* If there are more template classes than parameter lists, we have
23049 something like:
23051 template <class T> void S<T>::R<T>::f (); */
23053 {
23063 else
23066 }
23067 /* Otherwise, there are too many template parameter lists. We have
23068 something like:
23070 template <class T> template <class U> void S::f(); */
23073 }
23075 /* Parse an optional `::' token indicating that the following name is
23076 from the global namespace. If so, PARSER->SCOPE is set to the
23077 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23078 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23079 Returns the new value of PARSER->SCOPE, if the `::' token is
23080 present, and NULL_TREE otherwise. */
23082 static tree
23084 {
23087 /* Peek at the next token. */
23089 /* If we're looking at a `::' token then we're starting from the
23090 global namespace, not our current location. */
23092 {
23093 /* Consume the `::' token. */
23095 /* Set the SCOPE so that we know where to start the lookup. */
23101 }
23103 {
23107 }
23110 }
23112 /* Returns TRUE if the upcoming token sequence is the start of a
23113 constructor declarator. If FRIEND_P is true, the declarator is
23114 preceded by the `friend' specifier. */
23116 static bool
23118 {
23121 tree nested_name_specifier;
23124 /* The common case is that this is not a constructor declarator, so
23125 try to avoid doing lots of work if at all possible. It's not
23126 valid declare a constructor at function scope. */
23129 /* And only certain tokens can begin a constructor declarator. */
23137 /* Parse tentatively; we are going to roll back all of the tokens
23138 consumed here. */
23140 /* Assume that we are looking at a constructor declarator. */
23143 /* Look for the optional `::' operator. */
23146 /* Look for the nested-name-specifier. */
23147 nested_name_specifier
23158 /* Outside of a class-specifier, there must be a
23159 nested-name-specifier. */
23165 /* If we have a class scope, this is easy; DR 147 says that S::S always
23166 names the constructor, and no other qualified name could. */
23169 {
23179 }
23180 /* If we still think that this might be a constructor-declarator,
23181 look for a class-name. */
23183 {
23184 /* If we have:
23186 template <typename T> struct S {
23187 S();
23188 };
23190 we must recognize that the nested `S' names a class. */
23191 tree type_decl;
23195 none_type,
23199 /* If there was no class-name, then this is not a constructor.
23200 Otherwise, if we are in a class-specifier and we aren't
23201 handling a friend declaration, check that its type matches
23202 current_class_type (c++/38313). Note: error_mark_node
23203 is left alone for error recovery purposes. */
23205 && (outside_class_specifier_p
23210 /* If we're still considering a constructor, we have to see a `(',
23211 to begin the parameter-declaration-clause, followed by either a
23212 `)', an `...', or a decl-specifier. We need to check for a
23213 type-specifier to avoid being fooled into thinking that:
23215 S (f) (int);
23217 is a constructor. (It is actually a function named `f' that
23218 takes one parameter (of type `int') and returns a value of type
23219 `S'. */
23227 /* A parameter declaration begins with a decl-specifier,
23228 which is either the "attribute" keyword, a storage class
23229 specifier, or (usually) a type-specifier. */
23231 {
23232 tree type;
23236 /* Names appearing in the type-specifier should be looked up
23237 in the scope of the class. */
23240 else
23241 {
23244 {
23248 {
23251 }
23252 }
23254 }
23256 /* Inside the constructor parameter list, surrounding
23257 template-parameter-lists do not apply. */
23258 saved_num_template_parameter_lists
23262 /* Look for the type-specifier. */
23264 CP_PARSER_FLAGS_NONE,
23270 parser->num_template_parameter_lists
23273 /* Leave the scope of the class. */
23278 }
23279 }
23281 /* We did not really want to consume any tokens. */
23285 }
23287 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23288 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23289 they must be performed once we are in the scope of the function.
23291 Returns the function defined. */
23293 static tree
23294 cp_parser_function_definition_from_specifiers_and_declarator
23297 tree attributes,
23299 {
23300 tree fn;
23303 /* Begin the function-definition. */
23306 /* The things we're about to see are not directly qualified by any
23307 template headers we've seen thus far. */
23310 /* If there were names looked up in the decl-specifier-seq that we
23311 did not check, check them now. We must wait until we are in the
23312 scope of the function to perform the checks, since the function
23313 might be a friend. */
23317 {
23320 }
23323 {
23324 /* Skip the entire function. */
23327 }
23329 {
23330 /* Seen already, skip it. An error message has already been output. */
23334 /* If this is a function from a class, pop the nested class. */
23337 }
23338 else
23339 {
23340 timevar_id_t tv;
23343 else
23349 }
23352 }
23354 /* Parse the part of a function-definition that follows the
23355 declarator. INLINE_P is TRUE iff this function is an inline
23356 function defined within a class-specifier.
23358 Returns the function defined. */
23360 static tree
23363 {
23364 tree fn;
23370 bool fully_implicit_function_template_p
23373 tree implicit_template_parms
23376 cp_binding_level* implicit_template_scope
23382 /* If the next token is `return', then the code may be trying to
23383 make use of the "named return value" extension that G++ used to
23384 support. */
23387 {
23388 /* Consume the `return' keyword. */
23390 /* Look for the identifier that indicates what value is to be
23391 returned. */
23393 /* Issue an error message. */
23396 /* Skip tokens until we reach the start of the function body. */
23398 {
23405 }
23406 }
23407 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23408 anything declared inside `f'. */
23409 saved_in_unbraced_linkage_specification_p
23412 /* Inside the function, surrounding template-parameter-lists do not
23413 apply. */
23414 saved_num_template_parameter_lists
23420 /* If the next token is `try', `__transaction_atomic', or
23421 `__transaction_relaxed`, then we are looking at either function-try-block
23422 or function-transaction-block. Note that all of these include the
23423 function-body. */
23426 RID_TRANSACTION_ATOMIC);
23428 RID_TRANSACTION_RELAXED))
23430 RID_TRANSACTION_RELAXED);
23433 else
23434 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23439 /* Finish the function. */
23442 /* Generate code for it, if necessary. */
23444 /* Restore the saved values. */
23445 parser->in_unbraced_linkage_specification_p
23447 parser->num_template_parameter_lists
23451 parser->fully_implicit_function_template_p
23453 parser->implicit_template_parms
23455 parser->implicit_template_scope
23462 }
23464 /* Parse a template-declaration, assuming that the `export' (and
23465 `extern') keywords, if present, has already been scanned. MEMBER_P
23466 is as for cp_parser_template_declaration. */
23468 static void
23470 {
23473 tree parameter_list;
23478 /* Look for the `template' keyword. */
23483 /* And the `<'. */
23487 {
23488 /* 14.5.2.2 [temp.mem]
23490 A local class shall not have member templates. */
23495 }
23496 /* [temp]
23498 A template ... shall not have C linkage. */
23500 {
23502 /* Give it C++ linkage to avoid confusing other parts of the
23503 front end. */
23506 }
23507 else
23510 /* We cannot perform access checks on the template parameter
23511 declarations until we know what is being declared, just as we
23512 cannot check the decl-specifier list. */
23515 /* If the next token is `>', then we have an invalid
23516 specialization. Rather than complain about an invalid template
23517 parameter, issue an error message here. */
23519 {
23523 }
23524 else
23525 {
23526 /* Parse the template parameters. */
23528 }
23530 /* Get the deferred access checks from the parameter list. These
23531 will be checked once we know what is being declared, as for a
23532 member template the checks must be performed in the scope of the
23533 class containing the member. */
23536 /* Look for the `>'. */
23538 /* We just processed one more parameter list. */
23540 /* If the next token is `template', there are more template
23541 parameters. */
23543 RID_TEMPLATE))
23548 else
23549 {
23550 /* There are no access checks when parsing a template, as we do not
23551 know if a specialization will be a friend. */
23555 checks,
23556 member_p,
23561 /* If this is a member template declaration, let the front
23562 end know. */
23564 {
23569 }
23574 }
23575 /* We are done with the current parameter list. */
23580 /* Finish up. */
23583 /* Check the template arguments for a literal operator template. */
23587 {
23591 else
23592 {
23595 {
23601 }
23603 {
23611 }
23612 else
23614 }
23616 {
23619 " Expected non-type template argument pack <char...>"
23621 decl);
23622 else
23625 decl);
23626 }
23627 }
23628 /* Register member declarations. */
23631 /* For the erroneous case of a template with C linkage, we pushed an
23632 implicit C++ linkage scope; exit that scope now. */
23635 /* If DECL is a function template, we must return to parse it later.
23636 (Even though there is no definition, there might be default
23637 arguments that need handling.) */
23641 }
23643 /* Perform the deferred access checks from a template-parameter-list.
23644 CHECKS is a TREE_LIST of access checks, as returned by
23645 get_deferred_access_checks. */
23647 static void
23648 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23649 {
23653 }
23655 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23656 `function-definition' sequence that follows a template header.
23657 If MEMBER_P is true, this declaration appears in a class scope.
23659 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23660 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23662 static tree
23668 {
23671 cp_decl_specifier_seq decl_specifiers;
23675 /* This function is only used when processing a template
23676 declaration. */
23680 /* Defer access checks until we know what is being declared. */
23683 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23684 alternative. */
23687 CP_PARSER_FLAGS_OPTIONAL,
23693 /* There are no template typedefs. */
23695 {
23699 }
23701 /* Gather up the access checks that occurred the
23702 decl-specifier-seq. */
23705 /* Check for the declaration of a template class. */
23707 {
23709 {
23712 /* In this case:
23714 struct C {
23715 friend template <typename T> struct A<T>::B;
23716 };
23718 A<T>::B will be represented by a TYPENAME_TYPE, and
23719 therefore not recognized by shadow_tag. */
23721 && !decl
23728 else
23731 /* Perform access checks for template parameters. */
23733 }
23734 }
23736 /* Complain about missing 'typename' or other invalid type names. */
23739 {
23740 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23741 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23742 the rest of this declaration. */
23745 }
23747 /* If it's not a template class, try for a template function. If
23748 the next token is a `;', then this declaration does not declare
23749 anything. But, if there were errors in the decl-specifiers, then
23750 the error might well have come from an attempted class-specifier.
23751 In that case, there's no need to warn about a missing declarator. */
23755 {
23758 checks,
23760 member_p,
23761 declares_class_or_enum,
23765 /* 7.1.1-1 [dcl.stc]
23767 A storage-class-specifier shall not be specified in an explicit
23768 specialization... */
23770 && explicit_specialization_p
23772 {
23776 }
23780 }
23782 /* Look for a trailing `;' after the declaration. */
23788 out:
23791 /* Clear any current qualification; whatever comes next is the start
23792 of something new. */
23798 }
23800 /* Parse a cast-expression that is not the operand of a unary "&". */
23802 static tree
23804 {
23807 }
23809 /* Parse a functional cast to TYPE. Returns an expression
23810 representing the cast. */
23812 static tree
23814 {
23816 tree expression_list;
23817 tree cast;
23824 {
23832 tf_warning_or_error);
23833 }
23842 else
23843 {
23846 }
23849 tf_warning_or_error);
23850 /* [expr.const]/1: In an integral constant expression "only type
23851 conversions to integral or enumeration type can be used". */
23857 NIC_CONSTRUCTOR))
23860 }
23862 /* Save the tokens that make up the body of a member function defined
23863 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23864 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23865 specifiers applied to the declaration. Returns the FUNCTION_DECL
23866 for the member function. */
23868 static tree
23872 tree attributes)
23873 {
23876 tree fn;
23878 /* Create the FUNCTION_DECL. */
23881 /* If something went badly wrong, bail out now. */
23883 {
23884 /* If there's a function-body, skip it. */
23889 }
23891 /* Remember it, if there default args to post process. */
23894 /* Save away the tokens that make up the body of the
23895 function. */
23897 /* Handle function try blocks. */
23900 /* We can have braced-init-list mem-initializers before the fn body. */
23902 {
23905 {
23906 /* cache_group will stop after an un-nested { } pair, too. */
23910 /* variadic mem-inits have ... after the ')'. */
23913 }
23914 }
23916 /* Handle function try blocks. */
23921 /* Save away the inline definition; we will process it when the
23922 class is complete. */
23926 /* We need to know that this was defined in the class, so that
23927 friend templates are handled correctly. */
23930 /* Add FN to the queue of functions to be parsed later. */
23934 }
23936 /* Save the tokens that make up the in-class initializer for a non-static
23937 data member. Returns a DEFAULT_ARG. */
23939 static tree
23941 {
23943 }
23945 /* Parse a template-argument-list, as well as the trailing ">" (but
23946 not the opening "<"). See cp_parser_template_argument_list for the
23947 return value. */
23949 static tree
23951 {
23952 tree arguments;
23953 tree saved_scope;
23954 tree saved_qualifying_scope;
23955 tree saved_object_scope;
23960 /* [temp.names]
23962 When parsing a template-id, the first non-nested `>' is taken as
23963 the end of the template-argument-list rather than a greater-than
23964 operator. */
23965 saved_greater_than_is_operator_p
23968 /* Parsing the argument list may modify SCOPE, so we save it
23969 here. */
23973 /* We need to evaluate the template arguments, even though this
23974 template-id may be nested within a "sizeof". */
23979 /* Parse the template-argument-list itself. */
23983 else
23985 /* Look for the `>' that ends the template-argument-list. If we find
23986 a '>>' instead, it's probably just a typo. */
23988 {
23990 {
23991 /* In C++0x, a `>>' in a template argument list or cast
23992 expression is considered to be two separate `>'
23993 tokens. So, change the current token to a `>', but don't
23994 consume it: it will be consumed later when the outer
23995 template argument list (or cast expression) is parsed.
23996 Note that this replacement of `>' for `>>' is necessary
23997 even if we are parsing tentatively: in the tentative
23998 case, after calling
23999 cp_parser_enclosed_template_argument_list we will always
24000 throw away all of the template arguments and the first
24001 closing `>', either because the template argument list
24002 was erroneous or because we are replacing those tokens
24003 with a CPP_TEMPLATE_ID token. The second `>' (which will
24004 not have been thrown away) is needed either to close an
24005 outer template argument list or to complete a new-style
24006 cast. */
24009 }
24011 {
24012 /* If we're in a nested template argument list, the '>>' has
24013 to be a typo for '> >'. We emit the error message, but we
24014 continue parsing and we push a '>' as next token, so that
24015 the argument list will be parsed correctly. Note that the
24016 global source location is still on the token before the
24017 '>>', so we need to say explicitly where we want it. */
24023 }
24024 else
24025 {
24026 /* If this is not a nested template argument list, the '>>'
24027 is a typo for '>'. Emit an error message and continue.
24028 Same deal about the token location, but here we can get it
24029 right by consuming the '>>' before issuing the diagnostic. */
24032 "spurious %<>>%>, use %<>%> to terminate "
24034 }
24035 }
24036 else
24038 /* The `>' token might be a greater-than operator again now. */
24039 parser->greater_than_is_operator_p
24041 /* Restore the SAVED_SCOPE. */
24049 }
24051 /* MEMBER_FUNCTION is a member function, or a friend. If default
24052 arguments, or the body of the function have not yet been parsed,
24053 parse them now. */
24055 static void
24057 {
24059 /* If this member is a template, get the underlying
24060 FUNCTION_DECL. */
24064 /* There should not be any class definitions in progress at this
24065 point; the bodies of members are only parsed outside of all class
24066 definitions. */
24068 /* While we're parsing the member functions we might encounter more
24069 classes. We want to handle them right away, but we don't want
24070 them getting mixed up with functions that are currently in the
24071 queue. */
24074 /* Make sure that any template parameters are in scope. */
24077 /* If the body of the function has not yet been parsed, parse it
24078 now. */
24080 {
24081 tree function_scope;
24084 /* The function is no longer pending; we are processing it. */
24089 /* If this is a local class, enter the scope of the containing
24090 function. */
24095 /* Push the body of the function onto the lexer stack. */
24098 /* Let the front end know that we going to be defining this
24099 function. */
24103 /* Don't do access checking if it is a templated function. */
24107 /* #pragma omp declare reduction needs special parsing. */
24109 {
24114 }
24115 else
24116 /* Now, parse the body of the function. */
24123 /* Leave the scope of the containing function. */
24127 }
24129 /* Remove any template parameters from the symbol table. */
24132 /* Restore the queue. */
24135 }
24137 /* If DECL contains any default args, remember it on the unparsed
24138 functions queue. */
24140 static void
24142 {
24143 tree probe;
24146 probe;
24149 {
24153 }
24154 }
24156 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24157 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24158 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24159 from the parameter-type-list. */
24161 static tree
24164 {
24166 tree parsed_arg;
24172 /* Push the saved tokens for the default argument onto the parser's
24173 lexer stack. */
24179 /* Parse the default argument. */
24190 {
24191 /* In a non-template class, check conversions now. In a template,
24192 we'll wait and instantiate these as needed. */
24195 tf_warning_or_error);
24196 else
24198 }
24200 /* If the token stream has not been completely used up, then
24201 there was extra junk after the end of the default
24202 argument. */
24204 {
24207 else
24209 }
24211 /* Revert to the main lexer. */
24215 }
24217 /* FIELD is a non-static data member with an initializer which we saved for
24218 later; parse it now. */
24220 static void
24222 {
24223 tree def;
24230 NULL_TREE);
24236 }
24238 /* FN is a FUNCTION_DECL which may contains a parameter with an
24239 unparsed DEFAULT_ARG. Parse the default args now. This function
24240 assumes that the current scope is the scope in which the default
24241 argument should be processed. */
24243 static void
24245 {
24249 /* While we're parsing the default args, we might (due to the
24250 statement expression extension) encounter more classes. We want
24251 to handle them right away, but we don't want them getting mixed
24252 up with default args that are currently in the queue. */
24255 /* Local variable names (and the `this' keyword) may not appear
24256 in a default argument. */
24267 {
24269 tree parsed_arg;
24271 tree copy;
24278 /* This can happen for a friend declaration for a function
24279 already declared with default arguments. */
24282 parsed_arg
24284 default_arg,
24287 {
24289 }
24293 /* Update any instantiations we've already created. */
24297 }
24301 /* Make sure no default arg is missing. */
24304 /* Restore the state of local_variables_forbidden_p. */
24307 /* Restore the queue. */
24309 }
24311 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24313 sizeof ... ( identifier )
24315 where the 'sizeof' token has already been consumed. */
24317 static tree
24319 {
24320 /* Consume the `...'. */
24327 else
24335 /* The name is not qualified. */
24353 }
24355 /* Parse the operand of `sizeof' (or a similar operator). Returns
24356 either a TYPE or an expression, depending on the form of the
24357 input. The KEYWORD indicates which kind of expression we have
24358 encountered. */
24360 static tree
24362 {
24369 /* If it's a `...', then we are computing the length of a parameter
24370 pack. */
24375 /* Types cannot be defined in a `sizeof' expression. Save away the
24376 old message. */
24378 /* And create the new one. */
24384 /* The restrictions on constant-expressions do not apply inside
24385 sizeof expressions. */
24386 saved_integral_constant_expression_p
24388 saved_non_integral_constant_expression_p
24392 /* Do not actually evaluate the expression. */
24395 /* If it's a `(', then we might be looking at the type-id
24396 construction. */
24398 {
24401 /* We can't be sure yet whether we're looking at a type-id or an
24402 expression. */
24404 /* Note: as a GNU Extension, compound literals are considered
24405 postfix-expressions as they are in C99, so they are valid
24406 arguments to sizeof. See comment in cp_parser_cast_expression
24407 for details. */
24410 else
24411 {
24414 /* Look for the type-id. */
24416 /* Look for the closing `)'. */
24419 }
24421 /* If all went well, then we're done. */
24423 {
24424 cp_decl_specifier_seq decl_specs;
24426 /* Build a trivial decl-specifier-seq. */
24430 /* Call grokdeclarator to figure out what type this is. */
24433 TYPENAME,
24436 }
24437 }
24439 /* If the type-id production did not work out, then we must be
24440 looking at the unary-expression production. */
24444 /* Go back to evaluating expressions. */
24448 /* Free the message we created. */
24450 /* And restore the old one. */
24452 parser->integral_constant_expression_p
24454 parser->non_integral_constant_expression_p
24458 }
24460 /* If the current declaration has no declarator, return true. */
24462 static bool
24464 {
24465 /* If the next token is a `;' or a `,' then there is no
24466 declarator. */
24469 }
24471 /* Update the DECL_SPECS to reflect the storage class indicated by
24472 KEYWORD. */
24474 static void
24479 {
24480 cp_storage_class storage_class;
24483 {
24487 }
24489 {
24492 }
24497 {
24500 }
24503 {
24521 }
24525 /* A storage class specifier cannot be applied alongside a typedef
24526 specifier. If there is a typedef specifier present then set
24527 conflicting_specifiers_p which will trigger an error later
24528 on in grokdeclarator. */
24531 }
24533 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24534 is true, the type is a class or enum definition. */
24536 static void
24538 tree type_spec,
24541 {
24544 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24545 (with, for example, in "typedef int wchar_t;") we remember that
24546 this is what happened. In system headers, we ignore these
24547 declarations so that G++ can work with system headers that are not
24548 C++-safe. */
24550 && !type_definition_p
24560 {
24563 ds_redefined_builtin_type_spec,
24564 token);
24566 {
24570 }
24571 }
24574 else
24575 {
24580 }
24581 }
24583 /* True iff TOKEN is the GNU keyword __thread. */
24585 static bool
24587 {
24590 }
24592 /* Set the location for a declarator specifier and check if it is
24593 duplicated.
24595 DECL_SPECS is the sequence of declarator specifiers onto which to
24596 set the location.
24598 DS is the single declarator specifier to set which location is to
24599 be set onto the existing sequence of declarators.
24601 LOCATION is the location for the declarator specifier to
24602 consider. */
24604 static void
24607 {
24616 {
24620 }
24621 else
24622 {
24624 {
24628 else
24629 {
24632 OPT_Wlong_long,
24634 }
24635 }
24637 {
24642 else
24644 }
24645 else
24646 {
24662 "__complex"
24663 };
24666 }
24667 }
24668 }
24670 /* Return true iff the declarator specifier DS is present in the
24671 sequence of declarator specifiers DECL_SPECS. */
24673 bool
24675 cp_decl_spec ds)
24676 {
24683 }
24685 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24686 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24688 static bool
24690 {
24692 }
24694 /* Issue an error message indicating that TOKEN_DESC was expected.
24695 If KEYWORD is true, it indicated this function is called by
24696 cp_parser_require_keword and the required token can only be
24697 a indicated keyword. */
24699 static void
24701 required_token token_desc,
24703 {
24705 {
24774 }
24776 {
24778 {
24857 }
24858 }
24859 else
24861 }
24865 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24866 issue an error message indicating that TOKEN_DESC was expected.
24868 Returns the token consumed, if the token had the appropriate type.
24869 Otherwise, returns NULL. */
24874 required_token token_desc)
24875 {
24878 else
24879 {
24880 /* Output the MESSAGE -- unless we're parsing tentatively. */
24884 }
24885 }
24887 /* An error message is produced if the next token is not '>'.
24888 All further tokens are skipped until the desired token is
24889 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24891 static void
24893 {
24894 /* Current level of '< ... >'. */
24896 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24899 /* Are we ready, yet? If not, issue error message. */
24903 /* Skip tokens until the desired token is found. */
24905 {
24906 /* Peek at the next token. */
24908 {
24916 /* C++0x views the `>>' operator as two `>' tokens, but
24917 C++98 does not. */
24920 {
24921 /* We've hit a `>>' where the first `>' closes the
24922 template argument list, and the second `>' is
24923 spurious. Just consume the `>>' and stop; we've
24924 already produced at least one error. */
24927 }
24928 /* Fall through for C++0x, so we handle the second `>' in
24929 the `>>'. */
24933 {
24934 /* We've reached the token we want, consume it and stop. */
24937 }
24956 /* The '>' was probably forgotten, don't look further. */
24961 }
24963 /* Consume this token. */
24965 }
24966 }
24968 /* If the next token is the indicated keyword, consume it. Otherwise,
24969 issue an error message indicating that TOKEN_DESC was expected.
24971 Returns the token consumed, if the token had the appropriate type.
24972 Otherwise, returns NULL. */
24977 required_token token_desc)
24978 {
24982 {
24985 }
24988 }
24990 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24991 function-definition. */
24993 static bool
24995 {
24998 /* A ctor-initializer begins with a `:'. */
25000 /* A function-try-block begins with `try'. */
25002 /* A function-transaction-block begins with `__transaction_atomic'
25003 or `__transaction_relaxed'. */
25006 /* The named return value extension begins with `return'. */
25008 }
25010 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25011 definition. */
25013 static bool
25015 {
25022 }
25024 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25025 C++0x) ending a template-argument. */
25027 static bool
25029 {
25037 }
25039 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25040 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25042 static bool
25045 {
25051 /* Check for the sequence `<::' in the original code. It would be lexed as
25052 `[:', where `[' is a digraph, and there is no whitespace before
25053 `:'. */
25055 {
25060 }
25062 }
25064 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25065 or none_type otherwise. */
25067 static enum tag_types
25069 {
25071 {
25081 }
25082 }
25084 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25085 or none_type otherwise or if the token is null. */
25087 static enum tag_types
25089 {
25094 {
25102 }
25103 }
25105 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25107 static void
25109 {
25113 {
25117 type))
25120 }
25121 }
25123 /* Issue an error message if DECL is redeclared with different
25124 access than its original declaration [class.access.spec/3].
25125 This applies to nested classes and nested class templates.
25126 [class.mem/1]. */
25128 static void
25130 {
25139 }
25141 /* Look for the `template' keyword, as a syntactic disambiguator.
25142 Return TRUE iff it is present, in which case it will be
25143 consumed. */
25145 static bool
25147 {
25149 {
25150 /* In C++98 the `template' keyword can only be used within templates;
25151 outside templates the parser can always figure out what is a
25152 template and what is not. In C++11, per the resolution of DR 468,
25153 `template' is allowed in cases where it is not strictly necessary. */
25156 {
25159 "in C++98 %<template%> (as a disambiguator) is only "
25161 /* If this part of the token stream is rescanned, the same
25162 error message would be generated. So, we purge the token
25163 from the stream. */
25166 }
25167 else
25168 {
25169 /* Consume the `template' keyword. */
25172 }
25173 }
25175 }
25177 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25178 set PARSER->SCOPE, and perform other related actions. */
25180 static void
25182 {
25188 /* Get the stored value. */
25190 /* Perform any access checks that were deferred. */
25193 {
25198 }
25199 /* Set the scope from the stored value. */
25203 }
25205 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25206 encounter the end of a block before what we were looking for. */
25208 static bool
25212 {
25214 {
25217 /* Abort a parenthesized expression if we encounter a semicolon. */
25221 /* If we've reached the end of the file, stop. */
25227 /* We've hit the end of an enclosing block, so there's been some
25228 kind of syntax error. */
25231 /* Consume the token. */
25233 /* See if it starts a new group. */
25235 {
25237 /* In theory this should probably check end == '}', but
25238 cp_parser_save_member_function_body needs it to exit
25239 after either '}' or ')' when called with ')'. */
25242 }
25244 {
25248 }
25253 }
25254 }
25256 /* Like above, for caching a default argument or NSDMI. Both of these are
25257 terminated by a non-nested comma, but it can be unclear whether or not a
25258 comma is nested in a template argument list unless we do more parsing.
25259 In order to handle this ambiguity, when we encounter a ',' after a '<'
25260 we try to parse what follows as a parameter-declaration-list (in the
25261 case of a default argument) or a member-declarator (in the case of an
25262 NSDMI). If that succeeds, then we stop caching. */
25264 static tree
25266 {
25271 tree default_argument;
25273 /* Add tokens until we have processed the entire default
25274 argument. We add the range [first_token, token). */
25277 {
25278 /* For list-initialization, this is straightforward. */
25281 }
25283 {
25286 /* Peek at the next token. */
25288 /* What we do depends on what token we have. */
25290 {
25291 /* In valid code, a default argument must be
25292 immediately followed by a `,' `)', or `...'. */
25295 {
25296 /* If we've seen a '<', we might be in a
25297 template-argument-list. Until Core issue 325 is
25298 resolved, we don't know how this situation ought
25299 to be handled, so try to DTRT. We check whether
25300 what comes after the comma is a valid parameter
25301 declaration list. If it is, then the comma ends
25302 the default argument; otherwise the default
25303 argument continues. */
25306 /* Set ITALP so cp_parser_parameter_declaration_list
25307 doesn't decide to commit to this parse. */
25315 {
25322 }
25323 else
25324 {
25328 }
25335 }
25338 /* If we run into a non-nested `;', `}', or `]',
25339 then the code is invalid -- but the default
25340 argument is certainly over. */
25345 /* Handle correctly int n = sizeof ... ( p ); */
25348 /* Update DEPTH, if necessary. */
25363 /* This might be the comparison operator, or it might
25364 start a template argument list. */
25371 /* Fall through for C++0x, which treats the `>>'
25372 operator like two `>' tokens in certain
25373 cases. */
25377 {
25378 /* This might be an operator, or it might close a
25379 template argument list. But if a previous '<'
25380 started a template argument list, this will have
25381 closed it, so we can't be in one anymore. */
25385 }
25388 /* If we run out of tokens, issue an error message. */
25397 /* In these cases, we should look for template-ids.
25398 For example, if the default argument is
25399 `X<int, double>()', we need to do name lookup to
25400 figure out whether or not `X' is a template; if
25401 so, the `,' does not end the default argument.
25403 That is not yet done. */
25408 }
25410 /* If we've reached the end, stop. */
25414 /* Add the token to the token block. */
25416 }
25418 /* Create a DEFAULT_ARG to represent the unparsed default
25419 argument. */
25426 }
25428 /* Begin parsing tentatively. We always save tokens while parsing
25429 tentatively so that if the tentative parsing fails we can restore the
25430 tokens. */
25432 static void
25434 {
25435 /* Enter a new parsing context. */
25437 /* Begin saving tokens. */
25439 /* In order to avoid repetitive access control error messages,
25440 access checks are queued up until we are no longer parsing
25441 tentatively. */
25443 }
25445 /* Commit to the currently active tentative parse. */
25447 static void
25449 {
25453 /* Mark all of the levels as committed. */
25456 {
25463 }
25464 }
25466 /* Commit to the topmost currently active tentative parse.
25468 Note that this function shouldn't be called when there are
25469 irreversible side-effects while in a tentative state. For
25470 example, we shouldn't create a permanent entry in the symbol
25471 table, or issue an error message that might not apply if the
25472 tentative parse is aborted. */
25474 static void
25476 {
25481 {
25489 }
25490 }
25492 /* Abort the currently active tentative parse. All consumed tokens
25493 will be rolled back, and no diagnostics will be issued. */
25495 static void
25497 {
25501 /* Now, pretend that we want to see if the construct was
25502 successfully parsed. */
25504 }
25506 /* Stop parsing tentatively. If a parse error has occurred, restore the
25507 token stream. Otherwise, commit to the tokens we have consumed.
25508 Returns true if no error occurred; false otherwise. */
25510 static bool
25512 {
25516 /* Remember whether or not an error occurred, since we are about to
25517 destroy that information. */
25519 /* Remove the topmost context from the stack. */
25522 /* If no parse errors occurred, commit to the tentative parse. */
25524 {
25525 /* Commit to the tokens read tentatively, unless that was
25526 already done. */
25531 }
25532 /* Otherwise, if errors occurred, roll back our state so that things
25533 are just as they were before we began the tentative parse. */
25534 else
25535 {
25538 }
25539 /* Add the context to the front of the free list. */
25544 }
25546 /* Returns true if we are parsing tentatively and are not committed to
25547 this tentative parse. */
25549 static bool
25551 {
25554 }
25556 /* Returns nonzero iff an error has occurred during the most recent
25557 tentative parse. */
25559 static bool
25561 {
25564 }
25566 /* Returns nonzero if GNU extensions are allowed. */
25568 static bool
25570 {
25572 }
25573 \f
25574 /* Objective-C++ Productions */
25577 /* Parse an Objective-C expression, which feeds into a primary-expression
25578 above.
25580 objc-expression:
25581 objc-message-expression
25582 objc-string-literal
25583 objc-encode-expression
25584 objc-protocol-expression
25585 objc-selector-expression
25587 Returns a tree representation of the expression. */
25589 static tree
25591 {
25592 /* Try to figure out what kind of declaration is present. */
25596 {
25606 {
25618 }
25624 }
25627 }
25629 /* Parse an Objective-C message expression.
25631 objc-message-expression:
25632 [ objc-message-receiver objc-message-args ]
25634 Returns a representation of an Objective-C message. */
25636 static tree
25638 {
25647 }
25649 /* Parse an objc-message-receiver.
25651 objc-message-receiver:
25652 expression
25653 simple-type-specifier
25655 Returns a representation of the type or expression. */
25657 static tree
25659 {
25660 tree rcv;
25662 /* An Objective-C message receiver may be either (1) a type
25663 or (2) an expression. */
25667 /* If that worked out, fine. */
25674 CP_PARSER_FLAGS_NONE);
25681 }
25683 /* Parse the arguments and selectors comprising an Objective-C message.
25685 objc-message-args:
25686 objc-selector
25687 objc-selector-args
25688 objc-selector-args , objc-comma-args
25690 objc-selector-args:
25691 objc-selector [opt] : assignment-expression
25692 objc-selector-args objc-selector [opt] : assignment-expression
25694 objc-comma-args:
25695 assignment-expression
25696 objc-comma-args , assignment-expression
25698 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25699 selector arguments and TREE_VALUE containing a list of comma
25700 arguments. */
25702 static tree
25704 {
25710 {
25716 /* Detect if we have a unary selector. */
25725 sel_args
25730 }
25732 /* Handle non-selector arguments, if any. */
25734 {
25735 tree arg;
25740 addl_args
25745 }
25748 {
25751 }
25754 }
25756 /* Parse an Objective-C encode expression.
25758 objc-encode-expression:
25759 @encode objc-typename
25761 Returns an encoded representation of the type argument. */
25763 static tree
25765 {
25766 tree type;
25776 {
25780 }
25782 /* This happens if we find @encode(T) (where T is a template
25783 typename or something dependent on a template typename) when
25784 parsing a template. In that case, we can't compile it
25785 immediately, but we rather create an AT_ENCODE_EXPR which will
25786 need to be instantiated when the template is used.
25787 */
25789 {
25793 }
25796 }
25798 /* Parse an Objective-C @defs expression. */
25800 static tree
25802 {
25803 tree name;
25811 }
25813 /* Parse an Objective-C protocol expression.
25815 objc-protocol-expression:
25816 @protocol ( identifier )
25818 Returns a representation of the protocol expression. */
25820 static tree
25822 {
25823 tree proto;
25831 }
25833 /* Parse an Objective-C selector expression.
25835 objc-selector-expression:
25836 @selector ( objc-method-signature )
25838 objc-method-signature:
25839 objc-selector
25840 objc-selector-seq
25842 objc-selector-seq:
25843 objc-selector :
25844 objc-selector-seq objc-selector :
25846 Returns a representation of the method selector. */
25848 static tree
25850 {
25862 {
25871 {
25872 /* Detect if we have a unary selector. */
25874 {
25877 }
25878 else
25879 {
25881 }
25882 }
25887 {
25888 sel_seq
25891 sel_seq
25894 }
25895 else
25896 sel_seq
25901 }
25903 finish_selector:
25907 }
25909 /* Parse a list of identifiers.
25911 objc-identifier-list:
25912 identifier
25913 objc-identifier-list , identifier
25915 Returns a TREE_LIST of identifier nodes. */
25917 static tree
25919 {
25920 tree identifier;
25921 tree list;
25932 {
25939 identifier));
25941 }
25944 }
25946 /* Parse an Objective-C alias declaration.
25948 objc-alias-declaration:
25949 @compatibility_alias identifier identifier ;
25951 This function registers the alias mapping with the Objective-C front end.
25952 It returns nothing. */
25954 static void
25956 {
25964 }
25966 /* Parse an Objective-C class forward-declaration.
25968 objc-class-declaration:
25969 @class objc-identifier-list ;
25971 The function registers the forward declarations with the Objective-C
25972 front end. It returns nothing. */
25974 static void
25976 {
25979 {
25980 tree id;
25990 else
25992 }
25994 }
25996 /* Parse a list of Objective-C protocol references.
25998 objc-protocol-refs-opt:
25999 objc-protocol-refs [opt]
26001 objc-protocol-refs:
26002 < objc-identifier-list >
26004 Returns a TREE_LIST of identifiers, if any. */
26006 static tree
26008 {
26012 {
26016 }
26019 }
26021 /* Parse a Objective-C visibility specification. */
26023 static void
26025 {
26029 {
26044 }
26046 /* Eat '@private'/'@protected'/'@public'. */
26048 }
26050 /* Parse an Objective-C method type. Return 'true' if it is a class
26051 (+) method, and 'false' if it is an instance (-) method. */
26055 {
26058 else
26060 }
26062 /* Parse an Objective-C protocol qualifier. */
26064 static tree
26066 {
26079 {
26084 }
26087 }
26089 /* Parse an Objective-C typename. */
26091 static tree
26093 {
26097 {
26103 /* An ObjC type name may consist of just protocol qualifiers, in which
26104 case the type shall default to 'id'. */
26106 {
26109 /* If the type could not be parsed, an error has already
26110 been produced. For error recovery, behave as if it had
26111 not been specified, which will use the default type
26112 'id'. */
26114 {
26116 /* We need to skip to the closing parenthesis as
26117 cp_parser_type_id() does not seem to do it for
26118 us. */
26123 }
26124 }
26128 }
26131 }
26133 /* Check to see if TYPE refers to an Objective-C selector name. */
26135 static bool
26137 {
26143 }
26145 /* Parse an Objective-C selector. */
26147 static tree
26149 {
26153 {
26156 }
26158 /* C++ operator names are allowed to appear in ObjC selectors. */
26160 {
26173 }
26174 }
26176 /* Parse an Objective-C params list. */
26178 static tree
26180 {
26186 {
26196 /* Detect if we have a unary selector. */
26199 {
26202 }
26206 {
26207 /* Something went quite wrong. There should be a colon
26208 here, but there is not. Stop parsing parameters. */
26210 }
26212 /* New ObjC allows attributes on parameters too. */
26217 params
26220 type_name,
26221 identifier,
26222 parm_attr));
26225 }
26228 {
26231 }
26233 /* We allow tail attributes for the method. */
26235 {
26243 }
26246 {
26249 }
26251 }
26253 /* Parse the non-keyword Objective-C params. */
26255 static tree
26258 {
26264 {
26266 tree parm;
26272 {
26277 }
26279 /* TODO: parse attributes for tail parameters. */
26288 }
26290 /* We allow tail attributes for the method. */
26292 {
26294 {
26299 }
26300 else
26301 /* We have an error, but parse the attributes, so that we can
26302 carry on. */
26308 }
26311 }
26313 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26315 static void
26317 {
26320 /* If the next token is `extern' and the following token is a string
26321 literal, then we have a linkage specification. */
26323 && cp_parser_is_pure_string_literal
26326 /* Handle #pragma, if any. */
26329 /* Allow stray semicolons. */
26332 /* Mark methods as optional or required, when building protocols. */
26334 {
26337 }
26339 {
26342 }
26345 /* Other stray characters must generate errors. */
26347 {
26351 }
26352 /* Finally, try to parse a block-declaration, or a function-definition. */
26353 else
26355 }
26357 /* Parse a method signature. */
26359 static tree
26361 {
26377 }
26379 static bool
26381 {
26382 tree tattr;
26387 /* If the attributes are followed by a method introducer, this is not allowed.
26388 Dump the attributes and flag the situation. */
26393 /* Otherwise, the attributes introduce some interstitial code, possibly so
26394 rewind to allow that check. */
26397 }
26399 /* Parse an Objective-C method prototype list. */
26401 static void
26403 {
26407 {
26409 {
26414 else
26418 {
26422 }
26425 }
26431 OPT_Wattributes,
26433 else
26434 /* Allow for interspersed non-ObjC++ code. */
26438 }
26442 else
26446 }
26448 /* Parse an Objective-C method definition list. */
26450 static void
26452 {
26456 {
26457 tree meth;
26460 {
26466 else
26471 {
26475 }
26477 NULL_TREE);
26479 /* For historical reasons, we accept an optional semicolon. */
26486 {
26493 }
26494 }
26495 /* The following case will be removed once @synthesize is
26496 completely implemented. */
26507 else
26508 /* Allow for interspersed non-ObjC++ code. */
26512 }
26516 else
26520 }
26522 /* Parse Objective-C ivars. */
26524 static void
26526 {
26537 {
26538 cp_decl_specifier_seq declspecs;
26540 tree prefix_attributes;
26548 CP_PARSER_FLAGS_OPTIONAL,
26552 /* auto, register, static, extern, mutable. */
26554 {
26557 }
26559 /* thread_local. */
26561 {
26564 }
26566 /* typedef. */
26568 {
26571 }
26576 /* Keep going until we hit the `;' at the end of the
26577 declaration. */
26579 {
26584 /* Check for a (possibly unnamed) bitfield declaration. */
26592 {
26593 /* Get the name of the bitfield. */
26596 sfk_none);
26598 eat_colon:
26600 /* Get the width of the bitfield. */
26601 width
26603 }
26604 else
26605 {
26606 /* Parse the declarator. */
26607 declarator
26613 }
26615 /* Look for attributes that apply to the ivar. */
26617 /* Remember which attributes are prefix attributes and
26618 which are not. */
26620 /* Combine the attributes. */
26624 /* Create the bitfield declaration. */
26626 width,
26627 attributes);
26628 else
26633 /* Add the instance variable. */
26637 /* Reset PREFIX_ATTRIBUTES. */
26646 {
26649 }
26651 }
26655 }
26660 /* Do not consume the RID_AT_END, so it will be read again as terminating
26661 the @interface of @implementation. */
26665 /* For historical reasons, we accept an optional semicolon. */
26668 }
26670 /* Parse an Objective-C protocol declaration. */
26672 static void
26674 {
26680 {
26685 }
26687 /* See if we have a forward declaration or a definition. */
26690 /* Try a forward declaration first. */
26692 {
26694 {
26695 tree id;
26705 else
26707 }
26709 }
26711 /* Ok, we got a full-fledged definition (or at least should). */
26712 else
26713 {
26718 }
26719 }
26721 /* Parse an Objective-C superclass or category. */
26723 static void
26728 {
26734 {
26737 }
26739 {
26742 /* If there is no category name, and this is an @interface, we
26743 have a class extension. */
26745 {
26748 }
26749 else
26753 }
26754 }
26756 /* Parse an Objective-C class interface. */
26758 static void
26760 {
26767 {
26768 /* It's hard to recover because even if valid @interface stuff
26769 is to follow, we can't compile it (or validate it) if we
26770 don't even know which class it refers to. Let's assume this
26771 was a stray '@interface' token in the stream and skip it.
26772 */
26774 }
26779 /* We have either a class or a category on our hands. */
26782 else
26783 {
26785 /* Handle instance variable declarations, if any. */
26788 }
26791 }
26793 /* Parse an Objective-C class implementation. */
26795 static void
26797 {
26804 {
26805 /* It's hard to recover because even if valid @implementation
26806 stuff is to follow, we can't compile it (or validate it) if
26807 we don't even know which class it refers to. Let's assume
26808 this was a stray '@implementation' token in the stream and
26809 skip it.
26810 */
26812 }
26816 /* We have either a class or a category on our hands. */
26819 else
26820 {
26822 /* Handle instance variable declarations, if any. */
26825 }
26828 }
26830 /* Consume the @end token and finish off the implementation. */
26832 static void
26834 {
26837 }
26839 /* Parse an Objective-C declaration. */
26841 static void
26843 {
26844 /* Try to figure out what kind of declaration is present. */
26849 {
26865 }
26868 {
26891 }
26892 }
26894 /* Parse an Objective-C try-catch-finally statement.
26896 objc-try-catch-finally-stmt:
26897 @try compound-statement objc-catch-clause-seq [opt]
26898 objc-finally-clause [opt]
26900 objc-catch-clause-seq:
26901 objc-catch-clause objc-catch-clause-seq [opt]
26903 objc-catch-clause:
26904 @catch ( objc-exception-declaration ) compound-statement
26906 objc-finally-clause:
26907 @finally compound-statement
26909 objc-exception-declaration:
26910 parameter-declaration
26911 '...'
26913 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26915 Returns NULL_TREE.
26917 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26918 for C. Keep them in sync. */
26920 static tree
26922 {
26923 location_t location;
26924 tree stmt;
26929 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26930 node, lest it get absorbed into the surrounding block. */
26936 {
26945 {
26946 /* We have "@catch (...)" (where the '...' are literally
26947 what is in the code). Skip the '...'.
26948 parameter_declaration is set to NULL_TREE, and
26949 objc_being_catch_clauses() knows that that means
26950 '...'. */
26953 }
26954 else
26955 {
26956 /* We have "@catch (NSException *exception)" or something
26957 like that. Parse the parameter declaration. */
26961 else
26966 }
26969 else
26970 {
26971 /* If there was no open parenthesis, we are recovering from
26972 an error, and we are trying to figure out what mistake
26973 the user has made. */
26975 /* If there is an immediate closing parenthesis, the user
26976 probably forgot the opening one (ie, they typed "@catch
26977 NSException *e)". Parse the closing parenthesis and keep
26978 going. */
26982 /* If these is no immediate closing parenthesis, the user
26983 probably doesn't know that parenthesis are required at
26984 all (ie, they typed "@catch NSException *e"). So, just
26985 forget about the closing parenthesis and keep going. */
26986 }
26990 }
26992 {
26995 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26996 node, lest it get absorbed into the surrounding block. */
27000 }
27003 }
27005 /* Parse an Objective-C synchronized statement.
27007 objc-synchronized-stmt:
27008 @synchronized ( expression ) compound-statement
27010 Returns NULL_TREE. */
27012 static tree
27014 {
27015 location_t location;
27026 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27027 node, lest it get absorbed into the surrounding block. */
27032 }
27034 /* Parse an Objective-C throw statement.
27036 objc-throw-stmt:
27037 @throw assignment-expression [opt] ;
27039 Returns a constructed '@throw' statement. */
27041 static tree
27043 {
27055 }
27057 /* Parse an Objective-C statement. */
27059 static tree
27061 {
27062 /* Try to figure out what kind of declaration is present. */
27066 {
27077 }
27080 }
27082 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27083 look ahead to see if an objc keyword follows the attributes. This
27084 is to detect the use of prefix attributes on ObjC @interface and
27085 @protocol. */
27087 static bool
27089 {
27094 {
27097 }
27100 }
27102 /* This routine is a minimal replacement for
27103 c_parser_struct_declaration () used when parsing the list of
27104 types/names or ObjC++ properties. For example, when parsing the
27105 code
27107 @property (readonly) int a, b, c;
27109 this function is responsible for parsing "int a, int b, int c" and
27110 returning the declarations as CHAIN of DECLs.
27112 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27113 similar parsing. */
27114 static tree
27116 {
27118 cp_decl_specifier_seq declspecs;
27120 tree prefix_attributes;
27123 CP_PARSER_FLAGS_NONE,
27130 /* auto, register, static, extern, mutable. */
27132 {
27135 }
27137 /* thread_local. */
27139 {
27142 }
27144 /* typedef. */
27146 {
27149 }
27154 /* Keep going until we hit the `;' at the end of the declaration. */
27156 {
27161 /* Parse the declarator. */
27165 /* Look for attributes that apply to the ivar. */
27167 /* Remember which attributes are prefix attributes and
27168 which are not. */
27170 /* Combine the attributes. */
27180 /* Reset PREFIX_ATTRIBUTES. */
27191 {
27194 }
27195 else
27197 }
27199 }
27201 /* Parse an Objective-C @property declaration. The syntax is:
27203 objc-property-declaration:
27204 '@property' objc-property-attributes[opt] struct-declaration ;
27206 objc-property-attributes:
27207 '(' objc-property-attribute-list ')'
27209 objc-property-attribute-list:
27210 objc-property-attribute
27211 objc-property-attribute-list, objc-property-attribute
27213 objc-property-attribute
27214 'getter' = identifier
27215 'setter' = identifier
27216 'readonly'
27217 'readwrite'
27218 'assign'
27219 'retain'
27220 'copy'
27221 'nonatomic'
27223 For example:
27224 @property NSString *name;
27225 @property (readonly) id object;
27226 @property (retain, nonatomic, getter=getTheName) id name;
27227 @property int a, b, c;
27229 PS: This function is identical to
27230 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27231 static void
27233 {
27234 /* The following variables hold the attributes of the properties as
27235 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27236 seen. When we see an attribute, we set them to 'true' (if they
27237 are boolean properties) or to the identifier (if they have an
27238 argument, ie, for getter and setter). Note that here we only
27239 parse the list of attributes, check the syntax and accumulate the
27240 attributes that we find. objc_add_property_declaration() will
27241 then process the information. */
27251 /* 'properties' is the list of properties that we read. Usually a
27252 single one, but maybe more (eg, in "@property int a, b, c;" there
27253 are three). */
27254 tree properties;
27255 location_t loc;
27261 /* Parse the optional attribute list... */
27263 {
27264 /* Eat the '('. */
27268 {
27274 {
27277 }
27281 {
27292 {
27296 else
27301 }
27304 {
27308 }
27310 {
27312 {
27315 }
27316 else
27320 else
27322 }
27323 else
27324 {
27326 {
27329 }
27330 else
27332 }
27338 }
27345 else
27347 }
27349 /* FIXME: "@property (setter, assign);" will generate a spurious
27350 "error: expected ‘)’ before ‘,’ token". This is because
27351 cp_parser_require, unlike the C counterpart, will produce an
27352 error even if we are in error recovery. */
27354 {
27359 }
27360 }
27362 /* ... and the property declaration(s). */
27366 {
27368 /* If the next token is now a `;', consume it. */
27372 }
27376 else
27377 {
27378 /* Comma-separated properties are chained together in
27379 reverse order; add them one by one. */
27388 }
27391 }
27393 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27395 objc-synthesize-declaration:
27396 @synthesize objc-synthesize-identifier-list ;
27398 objc-synthesize-identifier-list:
27399 objc-synthesize-identifier
27400 objc-synthesize-identifier-list, objc-synthesize-identifier
27402 objc-synthesize-identifier
27403 identifier
27404 identifier = identifier
27406 For example:
27407 @synthesize MyProperty;
27408 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27410 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27411 for C. Keep them in sync.
27412 */
27413 static void
27415 {
27417 location_t loc;
27422 {
27426 {
27429 }
27431 {
27435 {
27438 }
27439 }
27440 else
27445 else
27447 }
27450 }
27452 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27454 objc-dynamic-declaration:
27455 @dynamic identifier-list ;
27457 For example:
27458 @dynamic MyProperty;
27459 @dynamic MyProperty, AnotherProperty;
27461 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27462 for C. Keep them in sync.
27463 */
27464 static void
27466 {
27468 location_t loc;
27473 {
27474 tree property;
27477 {
27480 }
27484 else
27486 }
27489 }
27491 \f
27492 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27494 /* Returns name of the next clause.
27495 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27496 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27497 returned and the token is consumed. */
27499 static pragma_omp_clause
27501 {
27513 {
27518 {
27621 }
27622 }
27628 }
27630 /* Validate that a clause of the given type does not already exist. */
27632 static void
27635 {
27636 tree c;
27640 {
27643 }
27644 }
27646 /* OpenMP 2.5:
27647 variable-list:
27648 identifier
27649 variable-list , identifier
27651 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27652 colon). An opening parenthesis will have been consumed by the caller.
27654 If KIND is nonzero, create the appropriate node and install the decl
27655 in OMP_CLAUSE_DECL and add the node to the head of the list.
27657 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27658 return the list created.
27660 COLON can be NULL if only closing parenthesis should end the list,
27661 or pointer to bool which will receive false if the list is terminated
27662 by closing parenthesis or true if the list is terminated by colon. */
27664 static tree
27667 {
27671 {
27674 }
27676 {
27693 {
27695 {
27701 {
27709 parser->colon_corrects_to_scope_p
27713 else
27714 {
27715 /* Look for `:'. */
27719 CPP_CLOSE_SQUARE))
27721 }
27722 /* Look for the closing `]'. */
27724 RT_CLOSE_SQUARE))
27727 }
27731 }
27737 }
27738 else
27741 get_comma:
27745 }
27751 {
27755 }
27758 {
27761 /* Try to resync to an unnested comma. Copied from
27762 cp_parser_parenthesized_expression_list. */
27763 skip_comma:
27772 }
27775 }
27777 /* Similarly, but expect leading and trailing parenthesis. This is a very
27778 common case for omp clauses. */
27780 static tree
27782 {
27786 }
27788 /* OpenMP 3.0:
27789 collapse ( constant-expression ) */
27791 static tree
27793 {
27795 location_t loc;
27796 HOST_WIDE_INT n;
27816 {
27819 }
27827 }
27829 /* OpenMP 2.5:
27830 default ( shared | none ) */
27832 static tree
27834 {
27836 tree c;
27841 {
27846 {
27861 }
27864 }
27865 else
27866 {
27867 invalid_kind:
27869 }
27885 }
27887 /* OpenMP 3.1:
27888 final ( expression ) */
27890 static tree
27892 {
27913 }
27915 /* OpenMP 2.5:
27916 if ( expression ) */
27918 static tree
27920 {
27941 }
27943 /* OpenMP 3.1:
27944 mergeable */
27946 static tree
27949 {
27950 tree c;
27953 location);
27958 }
27960 /* OpenMP 2.5:
27961 nowait */
27963 static tree
27966 {
27967 tree c;
27974 }
27976 /* OpenMP 2.5:
27977 num_threads ( expression ) */
27979 static tree
27981 location_t location)
27982 {
28004 }
28006 /* OpenMP 2.5:
28007 ordered */
28009 static tree
28012 {
28013 tree c;
28021 }
28023 /* OpenMP 2.5:
28024 reduction ( reduction-operator : variable-list )
28026 reduction-operator:
28027 One of: + * - & ^ | && ||
28029 OpenMP 3.1:
28031 reduction-operator:
28032 One of: + * - & ^ | && || min max
28034 OpenMP 4.0:
28036 reduction-operator:
28037 One of: + * - & ^ | && ||
28038 id-expression */
28040 static tree
28042 {
28050 {
28060 }
28064 else
28065 {
28076 {
28106 }
28107 else
28108 {
28110 resync_fail:
28115 }
28116 }
28122 NULL);
28124 {
28127 }
28130 }
28132 /* OpenMP 2.5:
28133 schedule ( schedule-kind )
28134 schedule ( schedule-kind , expression )
28136 schedule-kind:
28137 static | dynamic | guided | runtime | auto */
28139 static tree
28141 {
28150 {
28155 {
28176 }
28177 }
28182 else
28187 {
28202 else
28207 }
28215 invalid_kind:
28217 resync_fail:
28222 }
28224 /* OpenMP 3.0:
28225 untied */
28227 static tree
28230 {
28231 tree c;
28238 }
28240 /* OpenMP 4.0:
28241 inbranch
28242 notinbranch */
28244 static tree
28247 {
28252 }
28254 /* OpenMP 4.0:
28255 parallel
28256 for
28257 sections
28258 taskgroup */
28260 static tree
28264 {
28268 }
28270 /* OpenMP 4.0:
28271 num_teams ( expression ) */
28273 static tree
28275 location_t location)
28276 {
28298 }
28300 /* OpenMP 4.0:
28301 thread_limit ( expression ) */
28303 static tree
28305 location_t location)
28306 {
28328 }
28330 /* OpenMP 4.0:
28331 aligned ( variable-list )
28332 aligned ( variable-list : constant-expression ) */
28334 static tree
28336 {
28347 {
28357 }
28363 }
28365 /* OpenMP 4.0:
28366 linear ( variable-list )
28367 linear ( variable-list : expression ) */
28369 static tree
28372 {
28383 {
28387 {
28390 }
28398 }
28404 }
28406 /* OpenMP 4.0:
28407 safelen ( constant-expression ) */
28409 static tree
28411 location_t location)
28412 {
28433 }
28435 /* OpenMP 4.0:
28436 simdlen ( constant-expression ) */
28438 static tree
28440 location_t location)
28441 {
28462 }
28464 /* OpenMP 4.0:
28465 depend ( depend-kind : variable-list )
28467 depend-kind:
28468 in | out | inout */
28470 static tree
28472 {
28480 {
28490 else
28492 }
28493 else
28501 NULL);
28508 invalid_kind:
28510 resync_fail:
28515 }
28517 /* OpenMP 4.0:
28518 map ( map-kind : variable-list )
28519 map ( variable-list )
28521 map-kind:
28522 alloc | to | from | tofrom */
28524 static tree
28526 {
28535 {
28547 else
28548 {
28554 }
28557 }
28560 NULL);
28566 }
28568 /* OpenMP 4.0:
28569 device ( expression ) */
28571 static tree
28573 location_t location)
28574 {
28596 }
28598 /* OpenMP 4.0:
28599 dist_schedule ( static )
28600 dist_schedule ( static , expression ) */
28602 static tree
28604 location_t location)
28605 {
28618 {
28629 }
28634 location);
28638 invalid_kind:
28640 resync_fail:
28645 }
28647 /* OpenMP 4.0:
28648 proc_bind ( proc-bind-kind )
28650 proc-bind-kind:
28651 master | close | spread */
28653 static tree
28655 location_t location)
28656 {
28657 tree c;
28664 {
28674 else
28676 }
28677 else
28686 location);
28691 invalid_kind:
28693 resync_fail:
28698 }
28700 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28701 is a bitmask in MASK. Return the list of clauses found; the result
28702 of clause default goes in *pdefault. */
28704 static tree
28708 {
28715 {
28716 pragma_omp_clause c_kind;
28727 {
28739 clauses);
28753 clauses);
28762 clauses);
28786 clauses);
28800 clauses);
28817 OMP_CLAUSE_NOTINBRANCH,
28826 {
28827 clause_not_first:
28831 }
28856 clauses);
28861 clauses);
28866 clauses);
28929 }
28934 {
28935 /* Remove the invalid clause(s) from the list to avoid
28936 confusing the rest of the compiler. */
28939 }
28940 }
28941 saw_error:
28942 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28943 no reason to skip to the end. */
28949 }
28951 /* OpenMP 2.5:
28952 structured-block:
28953 statement
28955 In practice, we're also interested in adding the statement to an
28956 outer node. So it is convenient if we work around the fact that
28957 cp_parser_statement calls add_stmt. */
28959 static unsigned
28961 {
28964 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28965 This preserves the "not within loop or switch" style error messages
28966 for nonsense cases like
28967 void foo() {
28968 #pragma omp single
28969 break;
28970 }
28971 */
28976 }
28978 static void
28980 {
28982 }
28984 static tree
28986 {
28994 }
28996 /* OpenMP 2.5:
28997 # pragma omp atomic new-line
28998 expression-stmt
29000 expression-stmt:
29001 x binop= expr | x++ | ++x | x-- | --x
29002 binop:
29003 +, *, -, /, &, ^, |, <<, >>
29005 where x is an lvalue expression with scalar type.
29007 OpenMP 3.1:
29008 # pragma omp atomic new-line
29009 update-stmt
29011 # pragma omp atomic read new-line
29012 read-stmt
29014 # pragma omp atomic write new-line
29015 write-stmt
29017 # pragma omp atomic update new-line
29018 update-stmt
29020 # pragma omp atomic capture new-line
29021 capture-stmt
29023 # pragma omp atomic capture new-line
29024 capture-block
29026 read-stmt:
29027 v = x
29028 write-stmt:
29029 x = expr
29030 update-stmt:
29031 expression-stmt | x = x binop expr
29032 capture-stmt:
29033 v = expression-stmt
29034 capture-block:
29035 { v = x; update-stmt; } | { update-stmt; v = x; }
29037 OpenMP 4.0:
29038 update-stmt:
29039 expression-stmt | x = x binop expr | x = expr binop x
29040 capture-stmt:
29041 v = update-stmt
29042 capture-block:
29043 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29045 where x and v are lvalue expressions with scalar type. */
29047 static void
29049 {
29057 {
29062 {
29068 }
29069 }
29071 {
29083 else
29087 }
29089 {
29095 {
29100 {
29103 }
29104 }
29105 }
29109 {
29119 else
29124 {
29125 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29126 opcode. */
29131 }
29135 {
29138 }
29139 else
29140 {
29146 }
29149 }
29151 restart:
29155 {
29162 /* FALLTHROUGH */
29172 /* FALLTHROUGH */
29187 /* Undo effects of boolean_increment for post {in,de}crement. */
29189 /* FALLTHRU */
29193 {
29194 /* Undo effects of boolean_increment. */
29196 {
29197 /* This is pre or post increment. */
29202 && !structured_block
29206 }
29207 }
29208 /* FALLTHRU */
29211 {
29246 {
29250 }
29253 {
29259 {
29264 }
29266 {
29277 {
29279 {
29284 }
29285 else
29287 }
29291 }
29294 {
29301 }
29305 }
29309 {
29312 {
29320 }
29322 {
29327 }
29362 }
29373 /* FALLTHROUGH */
29378 }
29385 }
29386 stmt_done:
29388 {
29399 }
29401 {
29404 }
29405 done:
29411 saw_error:
29414 {
29418 {
29422 }
29423 }
29424 }
29427 /* OpenMP 2.5:
29428 # pragma omp barrier new-line */
29430 static void
29432 {
29435 }
29437 /* OpenMP 2.5:
29438 # pragma omp critical [(name)] new-line
29439 structured-block */
29441 static tree
29443 {
29447 {
29459 }
29464 }
29466 /* OpenMP 2.5:
29467 # pragma omp flush flush-vars[opt] new-line
29469 flush-vars:
29470 ( variable-list ) */
29472 static void
29474 {
29480 }
29482 /* Helper function, to parse omp for increment expression. */
29484 static tree
29486 {
29491 {
29494 }
29497 {
29506 /* Fall through: OpenMP disallows NE_EXPR. */
29509 }
29511 /* If decl is an iterator, preserve LHS and RHS of the relational
29512 expr until finish_omp_for. */
29522 }
29524 /* Helper function, to parse omp for increment expression. */
29526 static tree
29528 {
29532 cp_id_kind idk;
29536 {
29544 }
29552 {
29557 }
29564 {
29568 }
29580 do
29581 {
29588 {
29590 {
29593 else
29595 tf_warning_or_error);
29596 }
29597 else
29600 }
29601 }
29605 {
29609 }
29610 else
29614 }
29616 /* Parse the initialization statement of either an OpenMP for loop or
29617 a Cilk Plus for loop.
29619 Return true if the resulting construct should have an
29620 OMP_CLAUSE_PRIVATE added to it. */
29622 static bool
29630 {
29636 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29638 init-expr:
29639 var = lb
29640 integer-type var = lb
29641 random-access-iterator-type var = lb
29642 pointer-type var = lb
29643 */
29644 cp_decl_specifier_seq type_specifiers;
29646 /* First, try to parse as an initialized declaration. See
29647 cp_parser_condition, from whence the bulk of this is copied. */
29654 {
29655 /* If parsing a type specifier seq succeeded, then this
29656 MUST be a initialized declaration. */
29661 CP_PARSER_DECLARATOR_NAMED,
29672 else
29673 {
29683 {
29685 CPP_OPEN_PAREN))
29686 {
29690 else
29693 }
29694 else
29695 /* Trigger an error. */
29700 }
29704 {
29712 {
29715 auto_node);
29720 }
29723 asm_specification,
29724 LOOKUP_ONLYCONVERTING);
29726 {
29729 }
29730 else
29733 }
29734 else
29735 {
29736 /* Consume '='. */
29740 non_class:
29743 else
29746 asm_specification,
29747 LOOKUP_ONLYCONVERTING);
29748 }
29752 }
29753 }
29754 else
29755 {
29756 cp_id_kind idk;
29757 /* If parsing a type specifier sequence failed, then
29758 this MUST be a simple expression. */
29766 && decl
29769 {
29770 tree rhs;
29777 rhs,
29778 tf_warning_or_error));
29780 }
29781 else
29782 {
29787 {
29791 }
29792 }
29793 }
29795 }
29797 /* Parse the restricted form of the for statement allowed by OpenMP. */
29799 static tree
29802 {
29806 location_t loc_first;
29825 {
29828 location_t loc;
29832 {
29835 }
29838 {
29841 }
29850 add_private_clause
29857 {
29860 {
29866 }
29867 else
29869 }
29876 {
29881 {
29885 }
29888 {
29889 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29890 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29895 {
29898 }
29899 else
29900 {
29903 }
29907 }
29908 else
29909 {
29914 }
29915 }
29918 {
29919 tree c;
29921 {
29930 decl);
29934 decl);
29935 }
29937 {
29942 {
29945 }
29946 }
29947 }
29956 {
29957 /* If decl is an iterator, preserve the operator on decl
29958 until finish_omp_for. */
29960 && ((processing_template_decl
29964 else
29968 }
29983 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29984 in between the collapsed for loops to be still considered perfectly
29985 nested. Hopefully the final version clarifies this.
29986 For now handle (multiple) {'s and empty statements. */
29988 do
29989 {
29993 {
29995 bracecount++;
29996 }
30000 else
30001 {
30008 }
30009 }
30013 {
30016 }
30017 }
30019 /* Note that we saved the original contents of this flag when we entered
30020 the structured block, and so we don't need to re-save it here. */
30023 else
30026 /* Note that the grammar doesn't call for a structured block here,
30027 though the loop as a whole is a structured block. */
30034 else
30039 {
30041 {
30043 nbraces--;
30044 }
30047 else
30048 {
30050 {
30053 }
30058 }
30059 }
30066 }
30068 /* Helper function for OpenMP parsing, split clauses and call
30069 finish_omp_clauses on each of the set of clauses afterwards. */
30071 static void
30074 {
30080 }
30082 /* OpenMP 4.0:
30083 #pragma omp simd simd-clause[optseq] new-line
30084 for-loop */
30086 #define OMP_SIMD_CLAUSE_MASK \
30087 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30095 static tree
30098 {
30110 {
30113 }
30124 }
30126 /* OpenMP 2.5:
30127 #pragma omp for for-clause[optseq] new-line
30128 for-loop
30130 OpenMP 4.0:
30131 #pragma omp for simd for-simd-clause[optseq] new-line
30132 for-loop */
30134 #define OMP_FOR_CLAUSE_MASK \
30135 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30144 static tree
30147 {
30158 {
30163 {
30171 cclauses);
30175 cclauses);
30187 }
30188 }
30190 {
30193 }
30198 {
30201 }
30212 }
30214 /* OpenMP 2.5:
30215 # pragma omp master new-line
30216 structured-block */
30218 static tree
30220 {
30224 }
30226 /* OpenMP 2.5:
30227 # pragma omp ordered new-line
30228 structured-block */
30230 static tree
30232 {
30236 }
30238 /* OpenMP 2.5:
30240 section-scope:
30241 { section-sequence }
30243 section-sequence:
30244 section-directive[opt] structured-block
30245 section-sequence section-directive structured-block */
30247 static tree
30249 {
30260 {
30264 }
30267 {
30275 {
30279 }
30281 {
30284 }
30289 }
30300 }
30302 /* OpenMP 2.5:
30303 # pragma omp sections sections-clause[optseq] newline
30304 sections-scope */
30306 #define OMP_SECTIONS_CLAUSE_MASK \
30307 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30313 static tree
30316 {
30328 {
30331 }
30338 }
30340 /* OpenMP 2.5:
30341 # pragma omp parallel parallel-clause[optseq] new-line
30342 structured-block
30343 # pragma omp parallel for parallel-for-clause[optseq] new-line
30344 structured-block
30345 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30346 structured-block
30348 OpenMP 4.0:
30349 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30350 structured-block */
30352 #define OMP_PARALLEL_CLAUSE_MASK \
30353 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30363 static tree
30366 {
30375 {
30388 block);
30393 }
30395 {
30399 }
30401 {
30404 }
30406 {
30410 {
30420 block);
30423 }
30424 }
30434 }
30436 /* OpenMP 2.5:
30437 # pragma omp single single-clause[optseq] new-line
30438 structured-block */
30440 #define OMP_SINGLE_CLAUSE_MASK \
30441 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30446 static tree
30448 {
30458 }
30460 /* OpenMP 3.0:
30461 # pragma omp task task-clause[optseq] new-line
30462 structured-block */
30464 #define OMP_TASK_CLAUSE_MASK \
30465 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30475 static tree
30477 {
30488 }
30490 /* OpenMP 3.0:
30491 # pragma omp taskwait new-line */
30493 static void
30495 {
30498 }
30500 /* OpenMP 3.1:
30501 # pragma omp taskyield new-line */
30503 static void
30505 {
30508 }
30510 /* OpenMP 4.0:
30511 # pragma omp taskgroup new-line
30512 structured-block */
30514 static tree
30516 {
30520 }
30523 /* OpenMP 2.5:
30524 # pragma omp threadprivate (variable-list) */
30526 static void
30528 {
30529 tree vars;
30535 }
30537 /* OpenMP 4.0:
30538 # pragma omp cancel cancel-clause[optseq] new-line */
30540 #define OMP_CANCEL_CLAUSE_MASK \
30541 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30547 static void
30549 {
30553 }
30555 /* OpenMP 4.0:
30556 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30558 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30559 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30564 static void
30566 {
30567 tree clauses;
30571 {
30576 {
30579 }
30580 }
30582 {
30586 }
30589 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30591 pragma_tok);
30593 }
30595 /* OpenMP 4.0:
30596 #pragma omp distribute distribute-clause[optseq] new-line
30597 for-loop */
30599 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30600 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30605 static tree
30608 {
30617 {
30625 else
30628 {
30634 {
30637 cclauses);
30638 else
30640 cclauses);
30641 }
30646 cclauses);
30647 else
30649 cclauses);
30661 }
30662 }
30664 {
30667 }
30672 {
30675 }
30686 }
30688 /* OpenMP 4.0:
30689 # pragma omp teams teams-clause[optseq] new-line
30690 structured-block */
30692 #define OMP_TEAMS_CLAUSE_MASK \
30693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30701 static tree
30704 {
30713 {
30717 {
30725 cclauses);
30729 cclauses);
30740 }
30741 }
30743 {
30746 }
30751 {
30754 }
30762 }
30764 /* OpenMP 4.0:
30765 # pragma omp target data target-data-clause[optseq] new-line
30766 structured-block */
30768 #define OMP_TARGET_DATA_CLAUSE_MASK \
30769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30773 static tree
30775 {
30787 }
30789 /* OpenMP 4.0:
30790 # pragma omp target update target-update-clause[optseq] new-line */
30792 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30798 static bool
30801 {
30803 {
30805 "%<#pragma omp target update%> may only be "
30809 }
30811 tree clauses
30816 {
30818 "%<#pragma omp target update must contain at least one "
30821 }
30829 }
30831 /* OpenMP 4.0:
30832 # pragma omp target target-clause[optseq] new-line
30833 structured-block */
30835 #define OMP_TARGET_CLAUSE_MASK \
30836 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30840 static bool
30843 {
30845 {
30849 }
30852 {
30857 {
30865 {
30867 OMP_TARGET_CLAUSE_MASK,
30868 cclauses);
30870 }
30886 }
30888 {
30891 }
30893 {
30897 }
30899 {
30902 }
30903 }
30917 }
30919 /* OpenMP 4.0:
30920 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30922 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30923 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30930 static void
30933 {
30935 cp_omp_declare_simd_data data;
30937 {
30942 }
30953 {
30957 {
30970 }
30975 "%<#pragma omp declare simd%> not immediately followed by "
30979 }
30980 }
30982 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30983 This function is modelled similar to the late parsing of omp declare
30984 simd. */
30986 static tree
30988 {
30994 {
31000 }
31002 {
31006 }
31011 {
31018 NULL);
31032 }
31037 }
31039 /* Finalize #pragma omp declare simd clauses after direct declarator has
31040 been parsed, and put that into "omp declare simd" attribute. */
31042 static tree
31044 {
31050 {
31055 }
31060 {
31078 }
31082 }
31085 /* OpenMP 4.0:
31086 # pragma omp declare target new-line
31087 declarations and definitions
31088 # pragma omp end declare target new-line */
31090 static void
31092 {
31095 }
31097 static void
31099 {
31102 {
31105 }
31107 {
31111 {
31114 }
31117 else
31118 {
31122 }
31123 }
31124 else
31125 {
31129 }
31133 "%<#pragma omp end declare target%> without corresponding "
31135 else
31137 }
31139 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31140 expression and optional initializer clause of
31141 #pragma omp declare reduction. We store the expression(s) as
31142 either 3, 6 or 7 special statements inside of the artificial function's
31143 body. The first two statements are DECL_EXPRs for the artificial
31144 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31145 expression that uses those variables.
31146 If there was any INITIALIZER clause, this is followed by further statements,
31147 the fourth and fifth statements are DECL_EXPRs for the artificial
31148 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31149 constructor variant (first token after open paren is not omp_priv),
31150 then the sixth statement is a statement with the function call expression
31151 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31152 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31153 to initialize the OMP_PRIV artificial variable and there is seventh
31154 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31156 static bool
31158 {
31170 tree combiner;
31185 {
31188 }
31191 {
31198 {
31201 }
31217 {
31221 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31225 == CPP_CLOSE_PAREN
31228 {
31232 }
31237 }
31238 else
31239 {
31255 {
31260 }
31262 tree arg;
31275 }
31286 }
31292 }
31294 /* OpenMP 4.0
31295 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31296 initializer-clause[opt] new-line
31298 initializer-clause:
31299 initializer (omp_priv initializer)
31300 initializer (function-name (argument-list)) */
31302 static void
31305 {
31315 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31322 {
31354 }
31366 /* Types may not be defined in declare reduction type list. */
31369 parser->type_definition_forbidden_message
31375 saved_colon_doesnt_start_class_def_p
31380 {
31384 ;
31405 else
31410 else
31412 }
31414 /* Restore the saved message. */
31417 parser->colon_doesnt_start_class_def_p
31422 {
31423 fail:
31426 }
31432 {
31433 tree fntype
31436 NULL_TREE);
31455 {
31460 }
31462 {
31464 {
31473 }
31480 }
31481 else
31482 {
31485 }
31488 else
31491 {
31494 }
31496 {
31499 else
31504 }
31509 else
31510 {
31519 }
31526 }
31530 done:
31531 /* Free any declarators allocated. */
31533 }
31535 /* OpenMP 4.0
31536 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31537 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31538 initializer-clause[opt] new-line
31539 #pragma omp declare target new-line */
31541 static void
31544 {
31546 {
31551 {
31554 context);
31556 }
31559 {
31562 context);
31564 }
31566 {
31569 }
31571 {
31575 }
31576 }
31580 }
31582 /* Main entry point to OpenMP statement pragmas. */
31584 static void
31586 {
31587 tree stmt;
31592 {
31640 }
31644 }
31645 \f
31646 /* Transactional Memory parsing routines. */
31648 /* Parse a transaction attribute.
31650 txn-attribute:
31651 attribute
31652 [ [ identifier ] ]
31654 ??? Simplify this when C++0x bracket attributes are
31655 implemented properly. */
31657 static tree
31659 {
31674 {
31678 /* For keywords, use the canonical spelling,
31679 not the parsed identifier. */
31683 }
31684 else
31688 error1:
31691 }
31693 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31695 transaction-statement:
31696 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31697 compound-statement
31698 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31699 */
31701 static tree
31703 {
31718 else
31719 {
31723 }
31725 /* Parse a noexcept specification. */
31728 /* Keep track if we're in the lexical scope of an outer transaction. */
31740 }
31742 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31744 transaction-expression:
31745 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31746 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31747 */
31749 static tree
31751 {
31776 /* Set this early. This might mean that we allow transaction_cancel in
31777 an expression that we find out later actually has to be a constexpr.
31778 However, we expect that cxx_constant_value will be able to deal with
31779 this; also, if the noexcept has no constexpr, then what we parse next
31780 really is a transaction's body. */
31783 /* Parse a noexcept specification. */
31789 {
31796 }
31797 else
31798 {
31799 /* The only expression that is available got parsed for the noexcept
31800 already. noexcept is true then. */
31803 }
31812 }
31814 /* Parse a function-transaction-block.
31816 function-transaction-block:
31817 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31818 function-body
31819 __transaction_atomic txn-attribute[opt] function-try-block
31820 __transaction_relaxed ctor-initializer[opt] function-body
31821 __transaction_relaxed function-try-block
31822 */
31824 static bool
31826 {
31842 else
31843 {
31847 }
31855 else
31856 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31864 }
31866 /* Parse a __transaction_cancel statement.
31868 cancel-statement:
31869 __transaction_cancel txn-attribute[opt] ;
31870 __transaction_cancel txn-attribute[opt] throw-expression ;
31872 ??? Cancel and throw is not yet implemented. */
31874 static tree
31876 {
31882 RT_TRANSACTION_CANCEL);
31889 /* ??? Parse cancel-and-throw here. */
31894 {
31898 }
31900 {
31904 }
31906 {
31909 {
31915 }
31916 }
31918 {
31922 }
31928 }
31929 \f
31930 /* The parser. */
31934 \f
31935 /* Special handling for the first token or line in the file. The first
31936 thing in the file might be #pragma GCC pch_preprocess, which loads a
31937 PCH file, which is a GC collection point. So we need to handle this
31938 first pragma without benefit of an existing lexer structure.
31940 Always returns one token to the caller in *FIRST_TOKEN. This is
31941 either the true first token of the file, or the first token after
31942 the initial pragma. */
31944 static void
31946 {
31955 {
31962 }
31963 else
31966 /* Skip to the end of the pragma. */
31970 /* Now actually load the PCH file. */
31974 /* Read one more token to return to our caller. We have to do this
31975 after reading the PCH file in, since its pointers have to be
31976 live. */
31978 }
31980 /* Parses the grainsize pragma for the _Cilk_for statement.
31981 Syntax:
31982 #pragma cilk grainsize = <VALUE>. */
31984 static void
31986 {
31988 {
31993 {
31996 }
31998 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32001 else
32003 "%<#pragma cilk grainsize%> is not followed by "
32006 }
32008 }
32010 /* Normal parsing of a pragma token. Here we can (and must) use the
32011 regular lexer. */
32013 static bool
32015 {
32027 {
32035 {
32045 }
32050 {
32060 }
32065 {
32071 "%<#pragma omp taskwait%> may only be "
32076 }
32081 {
32087 "%<#pragma omp taskyield%> may only be "
32092 }
32097 {
32103 "%<#pragma omp cancel%> may only be "
32108 }
32113 {
32119 "%<#pragma omp cancellation point%> may only be "
32124 }
32162 "%<#pragma omp section%> may only be used in "
32167 {
32174 {
32177 }
32180 }
32184 {
32188 }
32194 {
32198 }
32200 /* Ignore the pragma if Cilk Plus is not enabled. */
32202 {
32205 }
32206 else
32207 {
32211 }
32218 bad_stmt:
32221 }
32225 }
32227 /* The interface the pragma parsers have to the lexer. */
32229 enum cpp_ttype
32231 {
32244 else
32245 {
32249 }
32252 }
32254 \f
32255 /* External interface. */
32257 /* Parse one entire translation unit. */
32259 void
32261 {
32273 }
32275 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32276 vectorlength clause:
32277 Syntax:
32278 vectorlength ( constant-expression ) */
32280 static tree
32283 {
32285 tree expr;
32286 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32287 safelen clause. Thus, vectorlength is represented as OMP 4.0
32288 safelen. For SIMD-enabled function it is represented by OMP 4.0
32289 simdlen. */
32292 loc);
32293 else
32295 loc);
32303 /* If expr == error_mark_node, then don't emit any errors nor
32304 create a clause. if any of the above functions returns
32305 error mark node then they would have emitted an error message. */
32307 ;
32315 else
32316 {
32317 tree c;
32319 {
32324 }
32325 else
32326 {
32331 }
32332 }
32337 }
32339 /* Handles the Cilk Plus #pragma simd linear clause.
32340 Syntax:
32341 linear ( simd-linear-variable-list )
32343 simd-linear-variable-list:
32344 simd-linear-variable
32345 simd-linear-variable-list , simd-linear-variable
32347 simd-linear-variable:
32348 id-expression
32349 id-expression : simd-linear-step
32351 simd-linear-step:
32352 conditional-expression */
32354 static tree
32356 {
32362 {
32366 }
32371 {
32374 {
32378 }
32385 {
32389 }
32390 else
32391 {
32395 /* If present, parse the linear step. Otherwise, assume the default
32396 value of 1. */
32398 {
32405 {
32406 /* If an error has occurred, then the whole pragma is
32407 considered ill-formed. Thus, no reason to keep
32408 parsing. */
32411 }
32419 else
32421 "step size must be an integer constant "
32423 }
32425 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32431 }
32436 else
32437 {
32442 }
32443 }
32447 }
32449 /* Returns the name of the next clause. If the clause is not
32450 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32451 token is not consumed. Otherwise, the appropriate enum from the
32452 pragma_simd_clause is returned and the token is consumed. */
32454 static pragma_omp_clause
32456 {
32457 pragma_omp_clause clause_type;
32474 else
32479 }
32481 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32483 static tree
32485 {
32490 {
32491 pragma_omp_clause c_kind;
32498 /* Use the OpenMP 4.0 equivalent function. */
32501 /* Use the OpenMP 4.0 equivalent function. */
32503 clauses);
32505 /* Use the OMP 4.0 equivalent function. */
32507 clauses);
32509 /* Use the OMP 4.0 equivalent function. */
32511 else
32512 {
32516 }
32517 }
32523 else
32525 }
32527 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32529 static void
32531 {
32538 {
32542 }
32551 }
32553 /* Main entry-point for parsing Cilk Plus _Cilk_for
32554 loops. The return value is error_mark_node
32555 when errors happen and CILK_FOR tree on success. */
32557 static tree
32559 {
32574 else
32580 }
32582 /* Create an identifier for a generic parameter type (a synthesized
32583 template parameter implied by `auto' or a concept identifier). */
32586 static tree
32588 {
32592 }
32594 /* Predicate that behaves as is_auto_or_concept but matches the parent
32595 node of the generic type rather than the generic type itself. This
32596 allows for type transformation in add_implicit_template_parms. */
32600 {
32602 }
32604 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32605 (creating a new template parameter list if necessary). Returns the newly
32606 created template type parm. */
32608 tree
32610 {
32613 /* We are either continuing a function template that already contains implicit
32614 template parameters, creating a new fully-implicit function template, or
32615 extending an existing explicit function template with implicit template
32616 parameters. */
32624 {
32628 }
32629 else
32630 {
32631 /* Roll back to the existing template parameter scope (in the case of
32632 extending an explicit function template) or introduce a new template
32633 parameter scope ahead of the function parameter scope (or class scope
32634 in the case of out-of-line member definitions). The function scope is
32635 added back after template parameter synthesis below. */
32640 {
32643 }
32645 {
32646 /* If not defining a class, then any class scope is a scope level in
32647 an out-of-line member definition. In this case simply wind back
32648 beyond the first such scope to inject the template parameter list.
32649 Otherwise wind back to the class being defined. The latter can
32650 occur in class member friend declarations such as:
32652 class A {
32653 void foo (auto);
32654 };
32655 class B {
32656 friend void A::foo (auto);
32657 };
32659 The template parameter list synthesized for the friend declaration
32660 must be injected in the scope of 'B'. This can also occur in
32661 erroneous cases such as:
32663 struct A {
32664 struct B {
32665 void foo (auto);
32666 };
32667 void B::foo (auto) {}
32668 };
32670 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32671 but, nevertheless, the template parameter list synthesized for the
32672 declarator should be injected into the scope of 'A' as if the
32673 ill-formed template was specified explicitly. */
32676 {
32679 }
32680 }
32686 {
32687 /* Introduce a new template parameter list for implicit template
32688 parameters. */
32692 parser->implicit_template_scope
32699 }
32700 else
32701 {
32702 /* Synthesize implicit template parameters at the end of the explicit
32703 template parameter list. */
32710 parser->implicit_template_parms
32712 }
32713 }
32715 /* Synthesize a new template parameter and track the current template
32716 parameter chain with implicit_template_parms. */
32720 synth_id);
32721 tree new_parm
32723 input_location,
32730 parser->implicit_template_parms
32732 else
32737 /* If creating a fully implicit function template, start the new implicit
32738 template parameter list with this synthesized type, otherwise grow the
32739 current template parameter list. */
32742 {
32749 }
32750 else
32751 {
32756 }
32761 }
32763 /* Finish the declaration of a fully implicit function template. Such a
32764 template has no explicit template parameter list so has not been through the
32765 normal template head and tail processing. synthesize_implicit_template_parm
32766 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32767 provided if the declaration is a class member such that its template
32768 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32769 form is returned. Otherwise NULL_TREE is returned. */
32771 tree
32773 {
32778 {
32782 }
32792 }