| blob | 176eec72dbe0c468e1346e5be1938d0361f803da |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2014 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
59 \f
60 /* The lexer. */
62 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
63 and c-lex.c) and the C++ parser. */
66 {
68 };
70 /* The various kinds of non integral constant we encounter. */
72 NIC_NONE,
73 /* floating-point literal */
74 NIC_FLOAT,
75 /* %<this%> */
76 NIC_THIS,
77 /* %<__FUNCTION__%> */
78 NIC_FUNC_NAME,
79 /* %<__PRETTY_FUNCTION__%> */
80 NIC_PRETTY_FUNC,
81 /* %<__func__%> */
82 NIC_C99_FUNC,
83 /* "%<va_arg%> */
84 NIC_VA_ARG,
85 /* a cast */
86 NIC_CAST,
87 /* %<typeid%> operator */
88 NIC_TYPEID,
89 /* non-constant compound literals */
90 NIC_NCC,
91 /* a function call */
92 NIC_FUNC_CALL,
93 /* an increment */
94 NIC_INC,
95 /* an decrement */
96 NIC_DEC,
97 /* an array reference */
98 NIC_ARRAY_REF,
99 /* %<->%> */
100 NIC_ARROW,
101 /* %<.%> */
102 NIC_POINT,
103 /* the address of a label */
104 NIC_ADDR_LABEL,
105 /* %<*%> */
106 NIC_STAR,
107 /* %<&%> */
108 NIC_ADDR,
109 /* %<++%> */
110 NIC_PREINCREMENT,
111 /* %<--%> */
112 NIC_PREDECREMENT,
113 /* %<new%> */
114 NIC_NEW,
115 /* %<delete%> */
116 NIC_DEL,
117 /* calls to overloaded operators */
118 NIC_OVERLOADED,
119 /* an assignment */
120 NIC_ASSIGNMENT,
121 /* a comma operator */
122 NIC_COMMA,
123 /* a call to a constructor */
124 NIC_CONSTRUCTOR,
125 /* a transaction expression */
126 NIC_TRANSACTION
129 /* The various kinds of errors about name-lookup failing. */
131 /* NULL */
132 NLE_NULL,
133 /* is not a type */
134 NLE_TYPE,
135 /* is not a class or namespace */
136 NLE_CXX98,
137 /* is not a class, namespace, or enumeration */
138 NLE_NOT_CXX98
141 /* The various kinds of required token */
143 RT_NONE,
165 /* The type is CPP_KEYWORD */
194 RT_TRANSACTION_CANCEL /* __transaction_cancel */
197 /* Prototypes. */
203 static void cp_lexer_destroy
205 static int cp_lexer_saving_tokens
209 static void cp_lexer_get_preprocessor_token
217 static bool cp_lexer_next_token_is_not
219 static bool cp_lexer_next_token_is_keyword
223 static void cp_lexer_purge_token
225 static void cp_lexer_purge_tokens_after
227 static void cp_lexer_save_tokens
229 static void cp_lexer_commit_tokens
231 static void cp_lexer_rollback_tokens
233 static void cp_lexer_print_token
237 static void cp_lexer_start_debugging
239 static void cp_lexer_stop_debugging
245 static void cp_parser_initial_pragma
248 static tree cp_literal_operator_id
251 static void cp_parser_cilk_simd
253 static tree cp_parser_cilk_for
255 static bool cp_parser_omp_declare_reduction_exprs
257 static tree cp_parser_cilk_simd_vectorlength
260 /* Manifest constants. */
261 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
262 #define CP_SAVED_TOKEN_STACK 5
264 /* Variables. */
266 /* The stream to which debugging output should be written. */
269 /* Nonzero if we are parsing an unevaluated operand: an operand to
270 sizeof, typeof, or alignof. */
273 /* Dump up to NUM tokens in BUFFER to FILE starting with token
274 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
275 first token in BUFFER. If NUM is 0, dump all the tokens. If
276 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
277 highlighted by surrounding it in [[ ]]. */
279 static void
283 {
300 {
303 }
308 {
315 nprinted++;
325 {
335 }
336 }
339 {
342 }
345 }
348 /* Dump all tokens in BUFFER to stderr. */
350 void
352 {
354 }
356 DEBUG_FUNCTION void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
367 else
369 }
372 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
373 description for T. */
375 static void
377 {
379 {
382 }
383 }
386 /* Dump parser context C to FILE. */
388 static void
390 {
395 }
398 /* Print the stack of parsing contexts to FILE starting with FIRST. */
400 static void
402 {
408 {
411 }
412 }
415 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
417 static void
419 {
422 }
425 /* Print an unparsed function entry UF to FILE. */
427 static void
429 {
432 tree fn;
437 i++)
438 {
444 }
449 {
452 }
458 {
461 }
463 }
466 /* Print the stack of unparsed member functions S to FILE. */
468 static void
471 {
477 {
480 }
481 }
484 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
485 the given PARSER. If FILE is NULL, the output is printed on stderr. */
487 static void
489 {
501 next_token);
502 }
505 /* Dump debugging information for the given PARSER. If FILE is NULL,
506 the output is printed on stderr. */
508 void
510 {
513 expanded_location eloc;
591 }
593 DEBUG_FUNCTION void
595 {
597 }
599 DEBUG_FUNCTION void
601 {
604 else
606 }
608 /* Allocate memory for a new lexer object and return it. */
612 {
617 /* Allocate the memory. */
620 /* Initially we are not debugging. */
625 /* Create the buffer. */
629 }
632 /* Create a new main C++ lexer, the lexer that gets tokens from the
633 preprocessor. */
637 {
639 cp_token token;
641 /* It's possible that parsing the first pragma will load a PCH file,
642 which is a GC collection point. So we have to do that before
643 allocating any memory. */
648 /* Put the first token in the buffer. */
651 /* Get the remaining tokens from the preprocessor. */
653 {
656 }
665 /* Subsequent preprocessor diagnostics should use compiler
666 diagnostic functions to get the compiler source location. */
671 }
673 /* Create a new lexer whose token stream is primed with the tokens in
674 CACHE. When these tokens are exhausted, no new tokens will be read. */
678 {
683 /* We do not own the buffer. */
690 /* Initially we are not debugging. */
695 }
697 /* Frees all resources associated with LEXER. */
699 static void
701 {
705 }
707 /* Returns nonzero if debugging information should be output. */
711 {
713 }
718 {
722 }
726 {
728 }
732 {
734 }
738 {
741 else
743 }
747 {
751 }
753 /* nonzero if we are presently saving tokens. */
757 {
759 }
761 /* Store the next token from the preprocessor in *TOKEN. Return true
762 if we reach EOF. If LEXER is NULL, assume we are handling an
763 initial #pragma pch_preprocess, and thus want the lexer to return
764 processed strings. */
766 static void
768 {
771 /* Get a new token from the preprocessor. */
772 token->type
780 /* On some systems, some header files are surrounded by an
781 implicit extern "C" block. Set a flag in the token if it
782 comes from such a header. */
787 /* Check to see if this token is a keyword. */
789 {
791 {
792 /* Mark this token as a keyword. */
794 /* Record which keyword. */
796 }
797 else
798 {
802 {
803 /* Warn about the C++0x keyword (but still treat it as
804 an identifier). */
809 /* Clear out the C_RID_CODE so we don't warn about this
810 particular identifier-turned-keyword again. */
812 }
815 }
816 }
818 {
819 /* This only happens in Objective-C++; it must be a keyword. */
822 {
823 /* Replace 'class' with '@class', 'private' with '@private',
824 etc. This prevents confusion with the C++ keyword
825 'class', and makes the tokens consistent with other
826 Objective-C 'AT' keywords. For example '@class' is
827 reported as RID_AT_CLASS which is consistent with
828 '@synchronized', which is reported as
829 RID_AT_SYNCHRONIZED.
830 */
839 }
840 }
842 {
843 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
847 }
848 }
850 /* Update the globals input_location and the input file stack from TOKEN. */
853 {
855 {
857 }
858 }
860 /* Update the globals input_location and the input file stack from LEXER. */
863 {
866 }
868 /* Return a pointer to the next token in the token stream, but do not
869 consume it. */
873 {
875 {
879 }
881 }
883 /* Return true if the next token has the indicated TYPE. */
887 {
889 }
891 /* Return true if the next token does not have the indicated TYPE. */
895 {
897 }
899 /* Return true if the next token is the indicated KEYWORD. */
903 {
905 }
909 {
911 }
915 {
917 }
919 /* Return true if the next token is not the indicated KEYWORD. */
923 {
925 }
927 /* Return true if the next token is a keyword for a decl-specifier. */
929 static bool
931 {
936 {
937 /* auto specifier: storage-class-specifier in C++,
938 simple-type-specifier in C++0x. */
940 /* Storage classes. */
946 /* Elaborated type specifiers. */
952 /* Simple type specifiers. */
966 /* GNU extensions. */
969 /* C++0x extensions. */
980 }
981 }
983 /* Returns TRUE iff the token T begins a decltype type. */
985 static bool
987 {
990 }
992 /* Returns TRUE iff the next token begins a decltype type. */
994 static bool
996 {
999 }
1001 /* Return a pointer to the Nth token in the token stream. If N is 1,
1002 then this is precisely equivalent to cp_lexer_peek_token (except
1003 that it is not inline). One would like to disallow that case, but
1004 there is one case (cp_parser_nth_token_starts_template_id) where
1005 the caller passes a variable for N and it might be 1. */
1009 {
1012 /* N is 1-based, not zero-based. */
1023 {
1026 {
1029 }
1033 }
1036 {
1039 }
1042 }
1044 /* Return the next token, and advance the lexer's next_token pointer
1045 to point to the next non-purged token. */
1049 {
1055 do
1056 {
1059 {
1062 }
1064 }
1069 /* Provide debugging output. */
1071 {
1075 }
1078 }
1080 /* Permanently remove the next token from the token stream, and
1081 advance the next_token pointer to refer to the next non-purged
1082 token. */
1084 static void
1086 {
1095 do
1096 {
1097 tok++;
1099 {
1102 }
1103 }
1106 }
1108 /* Permanently remove all tokens after TOK, up to, but not
1109 including, the token that will be returned next by
1110 cp_lexer_peek_token. */
1112 static void
1114 {
1123 {
1128 }
1129 }
1131 /* Begin saving tokens. All tokens consumed after this point will be
1132 preserved. */
1134 static void
1136 {
1137 /* Provide debugging output. */
1142 }
1144 /* Commit to the portion of the token stream most recently saved. */
1146 static void
1148 {
1149 /* Provide debugging output. */
1154 }
1156 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1157 to the token stream. Stop saving tokens. */
1159 static void
1161 {
1162 /* Provide debugging output. */
1167 }
1169 /* RAII wrapper around the above functions, with sanity checking. Creating
1170 a variable saves tokens, which are committed when the variable is
1171 destroyed unless they are explicitly rolled back by calling the rollback
1172 member function. */
1174 struct saved_token_sentinel
1175 {
1180 {
1183 }
1185 {
1188 }
1190 {
1194 }
1195 };
1197 /* Print a representation of the TOKEN on the STREAM. */
1199 static void
1201 {
1202 /* We don't use cpp_type2name here because the parser defines
1203 a few tokens of its own. */
1205 /* cpplib-defined token types */
1206 #define OP(e, s) #e,
1207 #define TK(e, s) #e,
1208 TTYPE_TABLE
1209 #undef OP
1210 #undef TK
1211 /* C++ parser token types - see "Manifest constants", above. */
1215 };
1217 /* For some tokens, print the associated data. */
1219 {
1221 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1222 For example, `struct' is mapped to an INTEGER_CST. */
1225 /* else fall through */
1243 /* If we have a name for the token, print it out. Otherwise, we
1244 simply give the numeric code. */
1247 else
1250 }
1251 }
1253 DEBUG_FUNCTION void
1255 {
1258 }
1260 DEBUG_FUNCTION void
1262 {
1265 else
1267 }
1270 /* Start emitting debugging information. */
1272 static void
1274 {
1277 }
1279 /* Stop emitting debugging information. */
1281 static void
1283 {
1286 }
1288 /* Create a new cp_token_cache, representing a range of tokens. */
1292 {
1297 }
1299 /* Diagnose if #pragma omp declare simd isn't followed immediately
1300 by function declaration or definition. */
1304 {
1306 {
1310 }
1311 }
1313 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1314 and put that into "omp declare simd" attribute. */
1318 {
1320 {
1322 {
1325 }
1327 {
1330 }
1331 }
1332 }
1333 \f
1334 /* Decl-specifiers. */
1336 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1338 static void
1340 {
1342 }
1344 /* Declarators. */
1346 /* Nothing other than the parser should be creating declarators;
1347 declarators are a semi-syntactic representation of C++ entities.
1348 Other parts of the front end that need to create entities (like
1349 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1364 /* An erroneous declarator. */
1367 /* The obstack on which declarators and related data structures are
1368 allocated. */
1371 /* Alloc BYTES from the declarator memory pool. */
1375 {
1377 }
1379 /* Allocate a declarator of the indicated KIND. Clear fields that are
1380 common to all declarators. */
1384 {
1396 }
1398 /* Make a declarator for a generalized identifier. If
1399 QUALIFYING_SCOPE is non-NULL, the identifier is
1400 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1401 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1402 is, if any. */
1406 special_function_kind sfk)
1407 {
1410 /* It is valid to write:
1412 class C { void f(); };
1413 typedef C D;
1414 void D::f();
1416 The standard is not clear about whether `typedef const C D' is
1417 legal; as of 2002-09-15 the committee is considering that
1418 question. EDG 3.0 allows that syntax. Therefore, we do as
1419 well. */
1433 }
1435 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1436 of modifiers such as const or volatile to apply to the pointer
1437 type, represented as identifiers. ATTRIBUTES represent the attributes that
1438 appertain to the pointer or reference. */
1440 cp_declarator *
1442 tree attributes)
1443 {
1451 {
1455 }
1456 else
1462 }
1464 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1465 represent the attributes that appertain to the pointer or
1466 reference. */
1468 cp_declarator *
1471 {
1479 {
1483 }
1484 else
1490 }
1492 /* Like make_pointer_declarator -- but for a pointer to a non-static
1493 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1494 appertain to the pointer or reference. */
1496 cp_declarator *
1499 tree attributes)
1500 {
1509 {
1512 }
1513 else
1519 }
1521 /* Make a declarator for the function given by TARGET, with the
1522 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1523 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1524 indicates what exceptions can be thrown. */
1526 cp_declarator *
1528 tree parms,
1529 cp_cv_quals cv_qualifiers,
1530 cp_virt_specifiers virt_specifiers,
1531 cp_ref_qualifier ref_qualifier,
1532 tree exception_specification,
1533 tree late_return_type)
1534 {
1546 {
1550 }
1551 else
1555 }
1557 /* Make a declarator for an array of BOUNDS elements, each of which is
1558 defined by ELEMENT. */
1560 cp_declarator *
1562 {
1569 {
1573 }
1574 else
1578 }
1580 /* Determine whether the declarator we've seen so far can be a
1581 parameter pack, when followed by an ellipsis. */
1582 static bool
1584 {
1585 /* Search for a declarator name, or any other declarator that goes
1586 after the point where the ellipsis could appear in a parameter
1587 pack. If we find any of these, then this declarator can not be
1588 made into a parameter pack. */
1591 {
1593 {
1605 }
1606 }
1609 }
1613 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1614 DECLARATOR and DEFAULT_ARGUMENT. */
1616 cp_parameter_declarator *
1619 tree default_argument)
1620 {
1628 else
1635 }
1637 /* Returns true iff DECLARATOR is a declaration for a function. */
1639 static bool
1641 {
1643 {
1651 }
1653 }
1655 /* The parser. */
1657 /* Overview
1658 --------
1660 A cp_parser parses the token stream as specified by the C++
1661 grammar. Its job is purely parsing, not semantic analysis. For
1662 example, the parser breaks the token stream into declarators,
1663 expressions, statements, and other similar syntactic constructs.
1664 It does not check that the types of the expressions on either side
1665 of an assignment-statement are compatible, or that a function is
1666 not declared with a parameter of type `void'.
1668 The parser invokes routines elsewhere in the compiler to perform
1669 semantic analysis and to build up the abstract syntax tree for the
1670 code processed.
1672 The parser (and the template instantiation code, which is, in a
1673 way, a close relative of parsing) are the only parts of the
1674 compiler that should be calling push_scope and pop_scope, or
1675 related functions. The parser (and template instantiation code)
1676 keeps track of what scope is presently active; everything else
1677 should simply honor that. (The code that generates static
1678 initializers may also need to set the scope, in order to check
1679 access control correctly when emitting the initializers.)
1681 Methodology
1682 -----------
1684 The parser is of the standard recursive-descent variety. Upcoming
1685 tokens in the token stream are examined in order to determine which
1686 production to use when parsing a non-terminal. Some C++ constructs
1687 require arbitrary look ahead to disambiguate. For example, it is
1688 impossible, in the general case, to tell whether a statement is an
1689 expression or declaration without scanning the entire statement.
1690 Therefore, the parser is capable of "parsing tentatively." When the
1691 parser is not sure what construct comes next, it enters this mode.
1692 Then, while we attempt to parse the construct, the parser queues up
1693 error messages, rather than issuing them immediately, and saves the
1694 tokens it consumes. If the construct is parsed successfully, the
1695 parser "commits", i.e., it issues any queued error messages and
1696 the tokens that were being preserved are permanently discarded.
1697 If, however, the construct is not parsed successfully, the parser
1698 rolls back its state completely so that it can resume parsing using
1699 a different alternative.
1701 Future Improvements
1702 -------------------
1704 The performance of the parser could probably be improved substantially.
1705 We could often eliminate the need to parse tentatively by looking ahead
1706 a little bit. In some places, this approach might not entirely eliminate
1707 the need to parse tentatively, but it might still speed up the average
1708 case. */
1710 /* Flags that are passed to some parsing functions. These values can
1711 be bitwise-ored together. */
1713 enum
1714 {
1715 /* No flags. */
1717 /* The construct is optional. If it is not present, then no error
1718 should be issued. */
1720 /* When parsing a type-specifier, treat user-defined type-names
1721 as non-type identifiers. */
1723 /* When parsing a type-specifier, do not try to parse a class-specifier
1724 or enum-specifier. */
1726 /* When parsing a decl-specifier-seq, only allow type-specifier or
1727 constexpr. */
1729 };
1731 /* This type is used for parameters and variables which hold
1732 combinations of the above flags. */
1735 /* The different kinds of declarators we want to parse. */
1738 {
1739 /* We want an abstract declarator. */
1740 CP_PARSER_DECLARATOR_ABSTRACT,
1741 /* We want a named declarator. */
1742 CP_PARSER_DECLARATOR_NAMED,
1743 /* We don't mind, but the name must be an unqualified-id. */
1744 CP_PARSER_DECLARATOR_EITHER
1747 /* The precedence values used to parse binary expressions. The minimum value
1748 of PREC must be 1, because zero is reserved to quickly discriminate
1749 binary operators from other tokens. */
1751 enum cp_parser_prec
1752 {
1753 PREC_NOT_OPERATOR,
1754 PREC_LOGICAL_OR_EXPRESSION,
1755 PREC_LOGICAL_AND_EXPRESSION,
1756 PREC_INCLUSIVE_OR_EXPRESSION,
1757 PREC_EXCLUSIVE_OR_EXPRESSION,
1758 PREC_AND_EXPRESSION,
1759 PREC_EQUALITY_EXPRESSION,
1760 PREC_RELATIONAL_EXPRESSION,
1761 PREC_SHIFT_EXPRESSION,
1762 PREC_ADDITIVE_EXPRESSION,
1763 PREC_MULTIPLICATIVE_EXPRESSION,
1764 PREC_PM_EXPRESSION,
1765 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1766 };
1768 /* A mapping from a token type to a corresponding tree node type, with a
1769 precedence value. */
1772 {
1773 /* The token type. */
1775 /* The corresponding tree code. */
1777 /* The precedence of this operator. */
1782 {
1783 /* Left hand side of the binary operation we are currently
1784 parsing. */
1785 tree lhs;
1786 /* Original tree code for left hand side, if it was a binary
1787 expression itself (used for -Wparentheses). */
1789 /* Tree code for the binary operation we are parsing. */
1791 /* Precedence of the binary operation we are parsing. */
1793 /* Location of the binary operation we are parsing. */
1794 location_t loc;
1797 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1798 entries because precedence levels on the stack are monotonically
1799 increasing. */
1803 /* Prototypes. */
1805 /* Constructors and destructors. */
1810 /* Class variables. */
1814 /* The operator-precedence table used by cp_parser_binary_expression.
1815 Transformed into an associative array (binops_by_token) by
1816 cp_parser_new. */
1849 };
1851 /* The same as binops, but initialized by cp_parser_new so that
1852 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1853 for speed. */
1856 /* Constructors and destructors. */
1858 /* Construct a new context. The context below this one on the stack
1859 is given by NEXT. */
1863 {
1866 /* Allocate the storage. */
1868 {
1869 /* Pull the first entry from the free list. */
1873 }
1874 else
1877 /* No errors have occurred yet in this context. */
1879 /* If this is not the bottommost context, copy information that we
1880 need from the previous context. */
1882 {
1883 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1884 expression, then we are parsing one in this context, too. */
1886 /* Thread the stack. */
1888 }
1891 }
1893 /* Managing the unparsed function queues. */
1895 #define unparsed_funs_with_default_args \
1896 parser->unparsed_queues->last ().funs_with_default_args
1897 #define unparsed_funs_with_definitions \
1898 parser->unparsed_queues->last ().funs_with_definitions
1899 #define unparsed_nsdmis \
1900 parser->unparsed_queues->last ().nsdmis
1901 #define unparsed_classes \
1902 parser->unparsed_queues->last ().classes
1904 static void
1906 {
1909 }
1911 static void
1913 {
1916 }
1918 /* Prototypes. */
1920 /* Constructors and destructors. */
1925 /* Routines to parse various constructs.
1927 Those that return `tree' will return the error_mark_node (rather
1928 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1929 Sometimes, they will return an ordinary node if error-recovery was
1930 attempted, even though a parse error occurred. So, to check
1931 whether or not a parse error occurred, you should always use
1932 cp_parser_error_occurred. If the construct is optional (indicated
1933 either by an `_opt' in the name of the function that does the
1934 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1935 the construct is not present. */
1937 /* Lexical conventions [gram.lex] */
1939 static tree cp_parser_identifier
1941 static tree cp_parser_string_literal
1943 static tree cp_parser_userdef_char_literal
1945 static tree cp_parser_userdef_string_literal
1947 static tree cp_parser_userdef_numeric_literal
1950 /* Basic concepts [gram.basic] */
1952 static bool cp_parser_translation_unit
1955 /* Expressions [gram.expr] */
1957 static tree cp_parser_primary_expression
1959 static tree cp_parser_id_expression
1961 static tree cp_parser_unqualified_id
1963 static tree cp_parser_nested_name_specifier_opt
1965 static tree cp_parser_nested_name_specifier
1967 static tree cp_parser_qualifying_entity
1969 static tree cp_parser_postfix_expression
1971 static tree cp_parser_postfix_open_square_expression
1973 static tree cp_parser_postfix_dot_deref_expression
1977 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1979 static void cp_parser_pseudo_destructor_name
1981 static tree cp_parser_unary_expression
1983 static enum tree_code cp_parser_unary_operator
1985 static tree cp_parser_new_expression
1989 static tree cp_parser_new_type_id
1997 static tree cp_parser_delete_expression
1999 static tree cp_parser_cast_expression
2001 static tree cp_parser_binary_expression
2003 static tree cp_parser_question_colon_clause
2005 static tree cp_parser_assignment_expression
2007 static enum tree_code cp_parser_assignment_operator_opt
2009 static tree cp_parser_expression
2011 static tree cp_parser_constant_expression
2013 static tree cp_parser_builtin_offsetof
2015 static tree cp_parser_lambda_expression
2017 static void cp_parser_lambda_introducer
2019 static bool cp_parser_lambda_declarator_opt
2021 static void cp_parser_lambda_body
2024 /* Statements [gram.stmt.stmt] */
2026 static void cp_parser_statement
2028 static void cp_parser_label_for_labeled_statement
2030 static tree cp_parser_expression_statement
2032 static tree cp_parser_compound_statement
2034 static void cp_parser_statement_seq_opt
2036 static tree cp_parser_selection_statement
2038 static tree cp_parser_condition
2040 static tree cp_parser_iteration_statement
2042 static bool cp_parser_for_init_statement
2044 static tree cp_parser_for
2046 static tree cp_parser_c_for
2048 static tree cp_parser_range_for
2050 static void do_range_for_auto_deduction
2052 static tree cp_parser_perform_range_for_lookup
2054 static tree cp_parser_range_for_member_function
2056 static tree cp_parser_jump_statement
2058 static void cp_parser_declaration_statement
2061 static tree cp_parser_implicitly_scoped_statement
2063 static void cp_parser_already_scoped_statement
2066 /* Declarations [gram.dcl.dcl] */
2068 static void cp_parser_declaration_seq_opt
2070 static void cp_parser_declaration
2072 static void cp_parser_block_declaration
2074 static void cp_parser_simple_declaration
2076 static void cp_parser_decl_specifier_seq
2078 static tree cp_parser_storage_class_specifier_opt
2080 static tree cp_parser_function_specifier_opt
2082 static tree cp_parser_type_specifier
2085 static tree cp_parser_simple_type_specifier
2087 static tree cp_parser_type_name
2089 static tree cp_parser_nonclass_name
2091 static tree cp_parser_elaborated_type_specifier
2093 static tree cp_parser_enum_specifier
2095 static void cp_parser_enumerator_list
2097 static void cp_parser_enumerator_definition
2099 static tree cp_parser_namespace_name
2101 static void cp_parser_namespace_definition
2103 static void cp_parser_namespace_body
2105 static tree cp_parser_qualified_namespace_specifier
2107 static void cp_parser_namespace_alias_definition
2109 static bool cp_parser_using_declaration
2111 static void cp_parser_using_directive
2113 static tree cp_parser_alias_declaration
2115 static void cp_parser_asm_definition
2117 static void cp_parser_linkage_specification
2119 static void cp_parser_static_assert
2121 static tree cp_parser_decltype
2124 /* Declarators [gram.dcl.decl] */
2126 static tree cp_parser_init_declarator
2127 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2132 static enum tree_code cp_parser_ptr_operator
2134 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2136 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2138 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2140 static tree cp_parser_late_return_type_opt
2142 static tree cp_parser_declarator_id
2144 static tree cp_parser_type_id
2146 static tree cp_parser_template_type_arg
2149 static tree cp_parser_type_id_1
2151 static void cp_parser_type_specifier_seq
2153 static tree cp_parser_parameter_declaration_clause
2155 static tree cp_parser_parameter_declaration_list
2159 static tree cp_parser_default_argument
2161 static void cp_parser_function_body
2163 static tree cp_parser_initializer
2165 static tree cp_parser_initializer_clause
2167 static tree cp_parser_braced_list
2172 static bool cp_parser_ctor_initializer_opt_and_function_body
2175 static tree cp_parser_late_parsing_omp_declare_simd
2178 static tree cp_parser_late_parsing_cilk_simd_fn_info
2181 static tree synthesize_implicit_template_parm
2183 static tree finish_fully_implicit_template
2186 /* Classes [gram.class] */
2188 static tree cp_parser_class_name
2190 static tree cp_parser_class_specifier
2192 static tree cp_parser_class_head
2194 static enum tag_types cp_parser_class_key
2196 static void cp_parser_type_parameter_key
2198 static void cp_parser_member_specification_opt
2200 static void cp_parser_member_declaration
2202 static tree cp_parser_pure_specifier
2204 static tree cp_parser_constant_initializer
2207 /* Derived classes [gram.class.derived] */
2209 static tree cp_parser_base_clause
2211 static tree cp_parser_base_specifier
2214 /* Special member functions [gram.special] */
2216 static tree cp_parser_conversion_function_id
2218 static tree cp_parser_conversion_type_id
2222 static bool cp_parser_ctor_initializer_opt
2224 static void cp_parser_mem_initializer_list
2226 static tree cp_parser_mem_initializer
2228 static tree cp_parser_mem_initializer_id
2231 /* Overloading [gram.over] */
2233 static tree cp_parser_operator_function_id
2235 static tree cp_parser_operator
2238 /* Templates [gram.temp] */
2240 static void cp_parser_template_declaration
2242 static tree cp_parser_template_parameter_list
2244 static tree cp_parser_template_parameter
2246 static tree cp_parser_type_parameter
2248 static tree cp_parser_template_id
2250 static tree cp_parser_template_name
2252 static tree cp_parser_template_argument_list
2254 static tree cp_parser_template_argument
2256 static void cp_parser_explicit_instantiation
2258 static void cp_parser_explicit_specialization
2261 /* Exception handling [gram.exception] */
2263 static tree cp_parser_try_block
2265 static bool cp_parser_function_try_block
2267 static void cp_parser_handler_seq
2269 static void cp_parser_handler
2271 static tree cp_parser_exception_declaration
2273 static tree cp_parser_throw_expression
2275 static tree cp_parser_exception_specification_opt
2277 static tree cp_parser_type_id_list
2280 /* GNU Extensions */
2282 static tree cp_parser_asm_specification_opt
2284 static tree cp_parser_asm_operand_list
2286 static tree cp_parser_asm_clobber_list
2288 static tree cp_parser_asm_label_list
2290 static bool cp_next_tokens_can_be_attribute_p
2292 static bool cp_next_tokens_can_be_gnu_attribute_p
2294 static bool cp_next_tokens_can_be_std_attribute_p
2296 static bool cp_nth_tokens_can_be_std_attribute_p
2298 static bool cp_nth_tokens_can_be_gnu_attribute_p
2300 static bool cp_nth_tokens_can_be_attribute_p
2302 static tree cp_parser_attributes_opt
2304 static tree cp_parser_gnu_attributes_opt
2306 static tree cp_parser_gnu_attribute_list
2308 static tree cp_parser_std_attribute
2310 static tree cp_parser_std_attribute_spec
2312 static tree cp_parser_std_attribute_spec_seq
2314 static bool cp_parser_extension_opt
2316 static void cp_parser_label_declaration
2319 /* Transactional Memory Extensions */
2321 static tree cp_parser_transaction
2323 static tree cp_parser_transaction_expression
2325 static bool cp_parser_function_transaction
2327 static tree cp_parser_transaction_cancel
2331 pragma_external,
2332 pragma_member,
2333 pragma_objc_icode,
2334 pragma_stmt,
2335 pragma_compound
2336 };
2337 static bool cp_parser_pragma
2340 /* Objective-C++ Productions */
2342 static tree cp_parser_objc_message_receiver
2344 static tree cp_parser_objc_message_args
2346 static tree cp_parser_objc_message_expression
2348 static tree cp_parser_objc_encode_expression
2350 static tree cp_parser_objc_defs_expression
2352 static tree cp_parser_objc_protocol_expression
2354 static tree cp_parser_objc_selector_expression
2356 static tree cp_parser_objc_expression
2358 static bool cp_parser_objc_selector_p
2360 static tree cp_parser_objc_selector
2362 static tree cp_parser_objc_protocol_refs_opt
2364 static void cp_parser_objc_declaration
2366 static tree cp_parser_objc_statement
2368 static bool cp_parser_objc_valid_prefix_attributes
2370 static void cp_parser_objc_at_property_declaration
2372 static void cp_parser_objc_at_synthesize_declaration
2374 static void cp_parser_objc_at_dynamic_declaration
2376 static tree cp_parser_objc_struct_declaration
2379 /* Utility Routines */
2381 static tree cp_parser_lookup_name
2383 static tree cp_parser_lookup_name_simple
2385 static tree cp_parser_maybe_treat_template_as_class
2387 static bool cp_parser_check_declarator_template_parameters
2389 static bool cp_parser_check_template_parameters
2391 static tree cp_parser_simple_cast_expression
2393 static tree cp_parser_global_scope_opt
2395 static bool cp_parser_constructor_declarator_p
2397 static tree cp_parser_function_definition_from_specifiers_and_declarator
2399 static tree cp_parser_function_definition_after_declarator
2401 static void cp_parser_template_declaration_after_export
2403 static void cp_parser_perform_template_parameter_access_checks
2405 static tree cp_parser_single_declaration
2407 static tree cp_parser_functional_cast
2409 static tree cp_parser_save_member_function_body
2411 static tree cp_parser_save_nsdmi
2413 static tree cp_parser_enclosed_template_argument_list
2415 static void cp_parser_save_default_args
2417 static void cp_parser_late_parsing_for_member
2419 static tree cp_parser_late_parse_one_default_arg
2421 static void cp_parser_late_parsing_nsdmi
2423 static void cp_parser_late_parsing_default_args
2425 static tree cp_parser_sizeof_operand
2427 static tree cp_parser_trait_expr
2429 static bool cp_parser_declares_only_class_p
2431 static void cp_parser_set_storage_class
2433 static void cp_parser_set_decl_spec_type
2435 static void set_and_check_decl_spec_loc
2438 static bool cp_parser_friend_p
2440 static void cp_parser_required_error
2446 static bool cp_parser_token_starts_function_definition_p
2448 static bool cp_parser_next_token_starts_class_definition_p
2450 static bool cp_parser_next_token_ends_template_argument_p
2452 static bool cp_parser_nth_token_starts_template_argument_list_p
2454 static enum tag_types cp_parser_token_is_class_key
2456 static enum tag_types cp_parser_token_is_type_parameter_key
2458 static void cp_parser_check_class_key
2460 static void cp_parser_check_access_in_redeclaration
2462 static bool cp_parser_optional_template_keyword
2464 static void cp_parser_pre_parsed_nested_name_specifier
2466 static bool cp_parser_cache_group
2468 static tree cp_parser_cache_defarg
2470 static void cp_parser_parse_tentatively
2472 static void cp_parser_commit_to_tentative_parse
2474 static void cp_parser_commit_to_topmost_tentative_parse
2476 static void cp_parser_abort_tentative_parse
2478 static bool cp_parser_parse_definitely
2482 static bool cp_parser_uncommitted_to_tentative_parse_p
2484 static void cp_parser_error
2486 static void cp_parser_name_lookup_error
2488 static bool cp_parser_simulate_error
2490 static bool cp_parser_check_type_definition
2492 static void cp_parser_check_for_definition_in_return_type
2494 static void cp_parser_check_for_invalid_template_id
2496 static bool cp_parser_non_integral_constant_expression
2498 static void cp_parser_diagnose_invalid_type_name
2500 static bool cp_parser_parse_and_diagnose_invalid_type_name
2502 static int cp_parser_skip_to_closing_parenthesis
2504 static void cp_parser_skip_to_end_of_statement
2506 static void cp_parser_consume_semicolon_at_end_of_statement
2508 static void cp_parser_skip_to_end_of_block_or_statement
2510 static bool cp_parser_skip_to_closing_brace
2512 static void cp_parser_skip_to_end_of_template_parameter_list
2514 static void cp_parser_skip_to_pragma_eol
2516 static bool cp_parser_error_occurred
2518 static bool cp_parser_allow_gnu_extensions_p
2520 static bool cp_parser_is_pure_string_literal
2522 static bool cp_parser_is_string_literal
2524 static bool cp_parser_is_keyword
2526 static tree cp_parser_make_typename_type
2530 static bool cp_parser_compound_literal_p
2532 static bool cp_parser_array_designator_p
2534 static bool cp_parser_skip_to_closing_square_bracket
2537 /* Returns nonzero if we are parsing tentatively. */
2541 {
2543 }
2545 /* Returns nonzero if TOKEN is a string literal. */
2547 static bool
2549 {
2555 }
2557 /* Returns nonzero if TOKEN is a string literal
2558 of a user-defined string literal. */
2560 static bool
2562 {
2569 }
2571 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2573 static bool
2575 {
2577 }
2579 /* If not parsing tentatively, issue a diagnostic of the form
2580 FILE:LINE: MESSAGE before TOKEN
2581 where TOKEN is the next token in the input stream. MESSAGE
2582 (specified by the caller) is usually of the form "expected
2583 OTHER-TOKEN". */
2585 static void
2587 {
2589 {
2591 /* This diagnostic makes more sense if it is tagged to the line
2592 of the token we just peeked at. */
2596 {
2601 }
2604 /* Because c_parser_error does not understand
2605 CPP_KEYWORD, keywords are treated like
2606 identifiers. */
2609 }
2610 }
2612 /* Issue an error about name-lookup failing. NAME is the
2613 IDENTIFIER_NODE DECL is the result of
2614 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2615 the thing that we hoped to find. */
2617 static void
2619 tree name,
2620 tree decl,
2621 name_lookup_error desired,
2622 location_t location)
2623 {
2624 /* If name lookup completely failed, tell the user that NAME was not
2625 declared. */
2627 {
2640 else
2642 }
2644 {
2646 {
2663 }
2664 }
2666 {
2668 {
2678 name);
2682 }
2683 }
2684 else
2685 {
2687 {
2700 }
2701 }
2702 }
2704 /* If we are parsing tentatively, remember that an error has occurred
2705 during this tentative parse. Returns true if the error was
2706 simulated; false if a message should be issued by the caller. */
2708 static bool
2710 {
2712 {
2715 }
2717 }
2719 /* This function is called when a type is defined. If type
2720 definitions are forbidden at this point, an error message is
2721 issued. */
2723 static bool
2725 {
2726 /* If types are forbidden here, issue a message. */
2728 {
2729 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2730 in the message need to be interpreted. */
2733 }
2735 }
2737 /* This function is called when the DECLARATOR is processed. The TYPE
2738 was a type defined in the decl-specifiers. If it is invalid to
2739 define a type in the decl-specifiers for DECLARATOR, an error is
2740 issued. TYPE_LOCATION is the location of TYPE and is used
2741 for error reporting. */
2743 static void
2746 {
2747 /* [dcl.fct] forbids type definitions in return types.
2748 Unfortunately, it's not easy to know whether or not we are
2749 processing a return type until after the fact. */
2757 {
2762 type);
2763 }
2764 }
2766 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2767 "<" in any valid C++ program. If the next token is indeed "<",
2768 issue a message warning the user about what appears to be an
2769 invalid attempt to form a template-id. LOCATION is the location
2770 of the type-specifier (TYPE) */
2772 static void
2774 tree type,
2776 location_t location)
2777 {
2781 {
2785 {
2788 else
2790 }
2791 else
2793 /* Remember the location of the invalid "<". */
2796 /* Consume the "<". */
2798 /* Parse the template arguments. */
2800 /* Permanently remove the invalid template arguments so that
2801 this error message is not issued again. */
2804 }
2805 }
2807 /* If parsing an integral constant-expression, issue an error message
2808 about the fact that THING appeared and return true. Otherwise,
2809 return false. In either case, set
2810 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2812 static bool
2814 non_integral_constant thing)
2815 {
2818 {
2820 {
2823 {
2830 "enumeration type cannot appear in a "
2921 }
2925 }
2926 }
2928 }
2930 /* Emit a diagnostic for an invalid type name. This function commits
2931 to the current active tentative parse, if any. (Otherwise, the
2932 problematic construct might be encountered again later, resulting
2933 in duplicate error messages.) LOCATION is the location of ID. */
2935 static void
2937 location_t location)
2938 {
2941 /* Try to lookup the identifier. */
2948 /* If the lookup was ambiguous, an error will already have
2949 been issued. */
2951 /* If the lookup found a template-name, it means that the user forgot
2952 to specify an argument list. Emit a useful error message. */
2956 decl);
2960 /* Something like 'unsigned A a;' */
2963 {
2964 /* Issue an error message. */
2966 /* If we're in a template class, it's possible that the user was
2967 referring to a type from a base class. For example:
2969 template <typename T> struct A { typedef T X; };
2970 template <typename T> struct B : public A<T> { X x; };
2972 The user should have said "typename A<T>::X". */
2986 {
2987 tree b;
2990 b;
2992 {
2996 {
2997 tree field;
2998 /* Go from a particular instantiation of the
2999 template (which will have an empty TYPE_FIELDs),
3000 to the main version. */
3003 field;
3007 {
3012 }
3015 }
3016 }
3017 }
3018 }
3019 /* Here we diagnose qualified-ids where the scope is actually correct,
3020 but the identifier does not resolve to a valid type name. */
3022 {
3024 {
3029 else
3033 }
3036 {
3037 /* A<T>::A<T>() */
3043 }
3050 {
3055 else
3059 }
3060 else
3062 }
3063 }
3065 /* Check for a common situation where a type-name should be present,
3066 but is not, and issue a sensible error message. Returns true if an
3067 invalid type-name was detected.
3069 The situation handled by this function are variable declarations of the
3070 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3071 Usually, `ID' should name a type, but if we got here it means that it
3072 does not. We try to emit the best possible error message depending on
3073 how exactly the id-expression looks like. */
3075 static bool
3077 {
3078 tree id;
3081 /* Avoid duplicate error about ambiguous lookup. */
3083 {
3087 }
3096 /* If the next token is a (, this is a function with no explicit return
3097 type, i.e. constructor, destructor or conversion op. */
3100 {
3103 }
3107 /* Emit a diagnostic for the invalid type. */
3109 out:
3110 /* If we aren't in the middle of a declarator (i.e. in a
3111 parameter-declaration-clause), skip to the end of the declaration;
3112 there's no point in trying to process it. */
3116 }
3118 /* Consume tokens up to, and including, the next non-nested closing `)'.
3119 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3120 are doing error recovery. Returns -1 if OR_COMMA is true and we
3121 found an unnested comma. */
3123 static int
3128 {
3138 {
3142 {
3145 /* If we've run out of tokens, then there is no closing `)'. */
3148 /* This is good for lambda expression capture-lists. */
3158 /* This matches the processing in skip_to_end_of_statement. */
3184 {
3188 }
3193 }
3195 /* Consume the token. */
3197 }
3198 }
3200 /* Consume tokens until we reach the end of the current statement.
3201 Normally, that will be just before consuming a `;'. However, if a
3202 non-nested `}' comes first, then we stop before consuming that. */
3204 static void
3206 {
3209 /* Unwind generic function template scope if necessary. */
3214 {
3218 {
3221 /* If we've run out of tokens, stop. */
3225 /* If the next token is a `;', we have reached the end of the
3226 statement. */
3232 /* If this is a non-nested '}', stop before consuming it.
3233 That way, when confronted with something like:
3235 { 3 + }
3237 we stop before consuming the closing '}', even though we
3238 have not yet reached a `;'. */
3242 /* If it is the closing '}' for a block that we have
3243 scanned, stop -- but only after consuming the token.
3244 That way given:
3246 void f g () { ... }
3247 typedef int I;
3249 we will stop after the body of the erroneously declared
3250 function, but before consuming the following `typedef'
3251 declaration. */
3253 {
3256 }
3264 }
3266 /* Consume the token. */
3268 }
3269 }
3271 /* This function is called at the end of a statement or declaration.
3272 If the next token is a semicolon, it is consumed; otherwise, error
3273 recovery is attempted. */
3275 static void
3277 {
3278 /* Look for the trailing `;'. */
3280 {
3281 /* If there is additional (erroneous) input, skip to the end of
3282 the statement. */
3284 /* If the next token is now a `;', consume it. */
3287 }
3288 }
3290 /* Skip tokens until we have consumed an entire block, or until we
3291 have consumed a non-nested `;'. */
3293 static void
3295 {
3298 /* Unwind generic function template scope if necessary. */
3303 {
3307 {
3310 /* If we've run out of tokens, stop. */
3314 /* Stop if this is an unnested ';'. */
3320 /* Stop if this is an unnested '}', or closes the outermost
3321 nesting level. */
3322 nesting_depth--;
3330 /* Nest. */
3331 nesting_depth++;
3336 }
3338 /* Consume the token. */
3340 }
3341 }
3343 /* Skip tokens until a non-nested closing curly brace is the next
3344 token, or there are no more tokens. Return true in the first case,
3345 false otherwise. */
3347 static bool
3349 {
3353 {
3357 {
3360 /* If we've run out of tokens, stop. */
3364 /* If the next token is a non-nested `}', then we have reached
3365 the end of the current block. */
3371 /* If it the next token is a `{', then we are entering a new
3372 block. Consume the entire block. */
3378 }
3380 /* Consume the token. */
3382 }
3383 }
3385 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3386 parameter is the PRAGMA token, allowing us to purge the entire pragma
3387 sequence. */
3389 static void
3391 {
3396 do
3400 /* Ensure that the pragma is not parsed again. */
3402 }
3404 /* Require pragma end of line, resyncing with it as necessary. The
3405 arguments are as for cp_parser_skip_to_pragma_eol. */
3407 static void
3409 {
3413 }
3415 /* This is a simple wrapper around make_typename_type. When the id is
3416 an unresolved identifier node, we can provide a superior diagnostic
3417 using cp_parser_diagnose_invalid_type_name. */
3419 static tree
3421 location_t id_location)
3422 {
3423 tree result;
3425 {
3431 }
3433 }
3435 /* This is a wrapper around the
3436 make_{pointer,ptrmem,reference}_declarator functions that decides
3437 which one to call based on the CODE and CLASS_TYPE arguments. The
3438 CODE argument should be one of the values returned by
3439 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3440 appertain to the pointer or reference. */
3444 cp_cv_quals cv_qualifiers,
3446 tree attributes)
3447 {
3454 else
3464 }
3466 /* Create a new C++ parser. */
3470 {
3475 /* cp_lexer_new_main is called before doing GC allocation because
3476 cp_lexer_new_main might load a PCH file. */
3479 /* Initialize the binops_by_token so that we can get the tree
3480 directly from the token. */
3488 /* For now, we always accept GNU extensions. */
3491 /* The `>' token is a greater-than operator, not the end of a
3492 template-id. */
3497 /* We are not parsing a constant-expression. */
3502 /* Local variable names are not forbidden. */
3505 /* We are not processing an `extern "C"' declaration. */
3508 /* We are not processing a declarator. */
3511 /* We are not processing a template-argument-list. */
3514 /* We are not in an iteration statement. */
3517 /* We are not in a switch statement. */
3520 /* We are not parsing a type-id inside an expression. */
3523 /* Declarations aren't implicitly extern "C". */
3526 /* String literals should be translated to the execution character set. */
3529 /* We are not parsing a function body. */
3532 /* We can correct until told otherwise. */
3535 /* The unparsed function queue is empty. */
3538 /* There are no classes being defined. */
3541 /* No template parameters apply. */
3544 /* Not declaring an implicit function template. */
3551 }
3553 /* Create a cp_lexer structure which will emit the tokens in CACHE
3554 and push it onto the parser's lexer stack. This is used for delayed
3555 parsing of in-class method bodies and default arguments, and should
3556 not be confused with tentative parsing. */
3557 static void
3559 {
3564 /* Move the current source position to that of the first token in the
3565 new lexer. */
3567 }
3569 /* Pop the top lexer off the parser stack. This is never used for the
3570 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3571 static void
3573 {
3578 /* Put the current source position back where it was before this
3579 lexer was pushed. */
3581 }
3583 /* Lexical conventions [gram.lex] */
3585 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3586 identifier. */
3588 static tree
3590 {
3593 /* Look for the identifier. */
3595 /* Return the value. */
3597 }
3599 /* Parse a sequence of adjacent string constants. Returns a
3600 TREE_STRING representing the combined, nul-terminated string
3601 constant. If TRANSLATE is true, translate the string to the
3602 execution character set. If WIDE_OK is true, a wide string is
3603 invalid here.
3605 C++98 [lex.string] says that if a narrow string literal token is
3606 adjacent to a wide string literal token, the behavior is undefined.
3607 However, C99 6.4.5p4 says that this results in a wide string literal.
3608 We follow C99 here, for consistency with the C front end.
3610 This code is largely lifted from lex_string() in c-lex.c.
3612 FUTURE: ObjC++ will need to handle @-strings here. */
3613 static tree
3616 {
3617 tree value;
3624 tree string_tree;
3630 {
3633 }
3636 {
3640 }
3641 else
3642 {
3645 }
3648 /* Try to avoid the overhead of creating and destroying an obstack
3649 for the common case of just one string. */
3652 {
3660 {
3664 }
3665 else
3669 }
3670 else
3671 {
3675 do
3676 {
3678 count++;
3683 {
3686 {
3689 }
3692 {
3697 }
3699 }
3700 else
3704 {
3709 "unsupported non-standard concatenation "
3711 }
3717 {
3721 }
3722 else
3723 {
3727 }
3728 }
3732 }
3735 {
3738 }
3742 {
3747 {
3762 }
3767 {
3772 else
3774 }
3775 }
3776 else
3777 /* cpp_interpret_string has issued an error. */
3784 }
3786 /* Look up a literal operator with the name and the exact arguments. */
3788 static tree
3790 {
3797 {
3803 {
3806 {
3816 }
3819 /* May be this should be sufficient_parms_p instead,
3820 depending on how exactly should user-defined literals
3821 work in presence of default arguments on the literal
3822 operator parameters. */
3825 }
3826 }
3829 }
3831 /* Parse a user-defined char constant. Returns a call to a user-defined
3832 literal operator taking the character as an argument. */
3834 static tree
3836 {
3844 /* Build up a call to the user-defined operator */
3845 /* Lookup the name we got back from the id-expression. */
3850 {
3855 }
3864 }
3866 /* A subroutine of cp_parser_userdef_numeric_literal to
3867 create a char... template parameter pack from a string node. */
3869 static tree
3871 {
3872 tree charvec;
3878 /* Fill in CHARVEC with all of the parameters. */
3883 /* Build the argument packs. */
3890 }
3892 /* A subroutine of cp_parser_userdef_numeric_literal to
3893 create a char... template parameter pack from a string node. */
3895 static tree
3897 {
3898 tree charvec;
3909 /* First template parm is character type. */
3912 /* Fill in CHARVEC with all of the parameters. */
3919 /* Build the argument packs. */
3926 }
3928 /* Parse a user-defined numeric constant. returns a call to a user-defined
3929 literal operator. */
3931 static tree
3933 {
3944 /* Look for a literal operator taking the exact type of numeric argument
3945 as the literal value. */
3950 {
3953 {
3957 long_long_unsigned_type_node);
3958 else
3959 {
3963 long_double_type_node);
3967 }
3970 }
3971 }
3974 /* If the numeric argument didn't work, look for a raw literal
3975 operator taking a const char* argument consisting of the number
3976 in string format. */
3981 {
3984 {
3987 }
3988 }
3991 /* If the raw literal didn't work, look for a non-type template
3992 function with parameter pack char.... Call the function with
3993 template parameter characters representing the number. */
3997 {
4002 {
4005 }
4006 }
4014 }
4016 /* Parse a user-defined string constant. Returns a call to a user-defined
4017 literal operator taking a character pointer and the length of the string
4018 as arguments. */
4020 static tree
4022 {
4031 /* Look for a template function with typename parameter CharT
4032 and parameter pack CharT... Call the function with
4033 template parameter characters representing the string. */
4037 {
4042 {
4045 }
4046 }
4049 /* Build up a call to the user-defined operator */
4050 /* Lookup the name we got back from the id-expression. */
4056 {
4060 }
4069 }
4072 /* Basic concepts [gram.basic] */
4074 /* Parse a translation-unit.
4076 translation-unit:
4077 declaration-seq [opt]
4079 Returns TRUE if all went well. */
4081 static bool
4083 {
4084 /* The address of the first non-permanent object on the declarator
4085 obstack. */
4090 /* Create the declarator obstack, if necessary. */
4092 {
4094 /* Create the error declarator. */
4096 /* Create the empty parameter list. */
4098 /* Remember where the base of the declarator obstack lies. */
4100 }
4104 /* If there are no tokens left then all went well. */
4106 {
4107 /* Get rid of the token array; we don't need it any more. */
4111 /* This file might have been a context that's implicitly extern
4112 "C". If so, pop the lang context. (Only relevant for PCH.) */
4114 {
4117 }
4119 /* Finish up. */
4123 }
4124 else
4125 {
4128 }
4130 /* Make sure the declarator obstack was fully cleaned up. */
4134 /* All went well. */
4136 }
4138 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4139 decltype context. */
4143 {
4148 }
4150 /* We're about to parse a collection of statements. If we're currently
4151 parsing tentatively, set up a firewall so that any nested
4152 cp_parser_commit_to_tentative_parse won't affect the current context. */
4154 static cp_token_position
4156 {
4163 }
4165 /* We've finished parsing the collection of statements. Wrap up the
4166 firewall and replace the relevant tokens with the parsed form. */
4168 static void
4170 tree expr)
4171 {
4175 /* Finish the firewall level. */
4177 /* And remember the result of the parse for when we try again. */
4183 }
4185 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4186 enclosing parentheses. */
4188 static tree
4190 {
4193 /* Consume the '('. */
4195 /* Start the statement-expression. */
4197 /* Parse the compound-statement. */
4199 /* Finish up. */
4201 /* Consume the ')'. */
4207 }
4209 /* Expressions [gram.expr] */
4211 /* Parse a primary-expression.
4213 primary-expression:
4214 literal
4215 this
4216 ( expression )
4217 id-expression
4218 lambda-expression (C++11)
4220 GNU Extensions:
4222 primary-expression:
4223 ( compound-statement )
4224 __builtin_va_arg ( assignment-expression , type-id )
4225 __builtin_offsetof ( type-id , offsetof-expression )
4227 C++ Extensions:
4228 __has_nothrow_assign ( type-id )
4229 __has_nothrow_constructor ( type-id )
4230 __has_nothrow_copy ( type-id )
4231 __has_trivial_assign ( type-id )
4232 __has_trivial_constructor ( type-id )
4233 __has_trivial_copy ( type-id )
4234 __has_trivial_destructor ( type-id )
4235 __has_virtual_destructor ( type-id )
4236 __is_abstract ( type-id )
4237 __is_base_of ( type-id , type-id )
4238 __is_class ( type-id )
4239 __is_empty ( type-id )
4240 __is_enum ( type-id )
4241 __is_final ( type-id )
4242 __is_literal_type ( type-id )
4243 __is_pod ( type-id )
4244 __is_polymorphic ( type-id )
4245 __is_std_layout ( type-id )
4246 __is_trivial ( type-id )
4247 __is_union ( type-id )
4249 Objective-C++ Extension:
4251 primary-expression:
4252 objc-expression
4254 literal:
4255 __null
4257 ADDRESS_P is true iff this expression was immediately preceded by
4258 "&" and therefore might denote a pointer-to-member. CAST_P is true
4259 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4260 true iff this expression is a template argument.
4262 Returns a representation of the expression. Upon return, *IDK
4263 indicates what kind of id-expression (if any) was present. */
4265 static tree
4272 {
4275 /* Assume the primary expression is not an id-expression. */
4278 /* Peek at the next token. */
4281 {
4282 /* literal:
4283 integer-literal
4284 character-literal
4285 floating-literal
4286 string-literal
4287 boolean-literal
4288 pointer-literal
4289 user-defined-literal */
4300 {
4304 }
4305 /* Floating-point literals are only allowed in an integral
4306 constant expression if they are cast to an integral or
4307 enumeration type. */
4311 {
4312 /* CAST_P will be set even in invalid code like "int(2.7 +
4313 ...)". Therefore, we have to check that the next token
4314 is sure to end the cast. */
4316 {
4321 enumerator-definition. */
4323 /* The curly brace at the end of an enum-specifier. */
4325 /* The end of a statement. */
4327 /* The end of the cast-expression. */
4329 /* The end of an array bound. */
4331 /* The closing ">" in a template-argument-list. */
4334 /* C++0x only: A ">>" treated like two ">" tokens,
4335 in a template-argument-list. */
4340 }
4342 /* If we are within a cast, then the constraint that the
4343 cast is to an integral or enumeration type will be
4344 checked at that point. If we are not within a cast, then
4345 this code is invalid. */
4348 }
4367 /* ??? Should wide strings be allowed when parser->translate_strings_p
4368 is false (i.e. in attributes)? If not, we can kill the third
4369 argument to cp_parser_string_literal. */
4375 /* If we see `( { ' then we are looking at the beginning of
4376 a GNU statement-expression. */
4379 {
4380 /* Statement-expressions are not allowed by the standard. */
4384 /* And they're not allowed outside of a function-body; you
4385 cannot, for example, write:
4387 int i = ({ int j = 3; j + 1; });
4389 at class or namespace scope. */
4392 {
4394 "statement-expressions are not allowed outside "
4400 }
4401 else
4403 }
4404 /* Otherwise it's a normal parenthesized expression. */
4405 {
4406 tree expr;
4409 /* Consume the `('. */
4411 /* Within a parenthesized expression, a `>' token is always
4412 the greater-than operator. */
4413 saved_greater_than_is_operator_p
4417 /* Parse the parenthesized expression. */
4419 /* Let the front end know that this expression was
4420 enclosed in parentheses. This matters in case, for
4421 example, the expression is of the form `A::B', since
4422 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4423 not. */
4425 /* DR 705: Wrapping an unqualified name in parentheses
4426 suppresses arg-dependent lookup. We want to pass back
4427 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4428 (c++/37862), but none of the others. */
4432 /* The `>' token might be the end of a template-id or
4433 template-parameter-list now. */
4434 parser->greater_than_is_operator_p
4436 /* Consume the `)'. */
4441 }
4445 /* We have an Objective-C++ message. */
4447 {
4449 /* Don't warn about a failed tentative parse. */
4454 }
4458 /* We have an Objective-C++ string literal. */
4465 {
4466 /* These two are the boolean literals. */
4474 /* The `__null' literal. */
4479 /* The `nullptr' literal. */
4484 /* Recognize the `this' keyword. */
4488 {
4492 }
4493 /* Pointers cannot appear in constant-expressions. */
4498 /* The `operator' keyword can be the beginning of an
4499 id-expression. */
4506 {
4507 non_integral_constant name;
4509 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4510 __func__ are the names of variables -- but they are
4511 treated specially. Therefore, they are handled here,
4512 rather than relying on the generic id-expression logic
4513 below. Grammatically, these names are id-expressions.
4515 Consume the token. */
4519 {
4531 }
4536 /* Look up the name. */
4538 }
4541 {
4542 tree expression;
4543 tree type;
4544 source_location type_location;
4546 /* The `__builtin_va_arg' construct is used to handle
4547 `va_arg'. Consume the `__builtin_va_arg' token. */
4549 /* Look for the opening `('. */
4551 /* Now, parse the assignment-expression. */
4553 /* Look for the `,'. */
4556 /* Parse the type-id. */
4558 /* Look for the closing `)'. */
4560 /* Using `va_arg' in a constant-expression is not
4561 allowed. */
4563 NIC_VA_ARG))
4566 }
4596 /* Objective-C++ expressions. */
4606 {
4611 }
4615 }
4617 /* An id-expression can start with either an identifier, a
4618 `::' as the beginning of a qualified-id, or the "operator"
4619 keyword. */
4624 {
4625 tree id_expression;
4626 tree decl;
4632 id_expression:
4633 /* Parse the id-expression. */
4634 id_expression
4651 /* If we have a template-id, then no further lookup is
4652 required. If the template-id was for a template-class, we
4653 will sometimes have a TYPE_DECL at this point. */
4657 /* Look up the name. */
4658 else
4659 {
4660 tree ambiguous_decls;
4662 /* If we already know that this lookup is ambiguous, then
4663 we've already issued an error message; there's no reason
4664 to check again. */
4667 {
4670 }
4673 none_type,
4674 template_p,
4679 /* If the lookup was ambiguous, an error will already have
4680 been issued. */
4684 /* In Objective-C++, we may have an Objective-C 2.0
4685 dot-syntax for classes here. */
4690 {
4691 tree component;
4698 }
4700 /* In Objective-C++, an instance variable (ivar) may be preferred
4701 to whatever cp_parser_lookup_name() found. */
4704 /* If name lookup gives us a SCOPE_REF, then the
4705 qualifying scope was dependent. */
4707 {
4708 /* At this point, we do not know if DECL is a valid
4709 integral constant expression. We assume that it is
4710 in fact such an expression, so that code like:
4712 template <int N> struct A {
4713 int a[B<N>::i];
4714 };
4716 is accepted. At template-instantiation time, we
4717 will check that B<N>::i is actually a constant. */
4719 }
4720 /* Check to see if DECL is a local variable in a context
4721 where that is forbidden. */
4724 {
4725 /* It might be that we only found DECL because we are
4726 trying to be generous with pre-ISO scoping rules.
4727 For example, consider:
4729 int i;
4730 void g() {
4731 for (int i = 0; i < 10; ++i) {}
4732 extern void f(int j = i);
4733 }
4735 Here, name look up will originally find the out
4736 of scope `i'. We need to issue a warning message,
4737 but then use the global `i'. */
4740 {
4743 decl);
4745 }
4746 }
4747 }
4749 decl = (finish_id_expression
4751 idk,
4756 template_arg_p,
4762 }
4764 /* Anything else is an error. */
4768 }
4769 }
4777 {
4780 }
4782 /* Parse an id-expression.
4784 id-expression:
4785 unqualified-id
4786 qualified-id
4788 qualified-id:
4789 :: [opt] nested-name-specifier template [opt] unqualified-id
4790 :: identifier
4791 :: operator-function-id
4792 :: template-id
4794 Return a representation of the unqualified portion of the
4795 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4796 a `::' or nested-name-specifier.
4798 Often, if the id-expression was a qualified-id, the caller will
4799 want to make a SCOPE_REF to represent the qualified-id. This
4800 function does not do this in order to avoid wastefully creating
4801 SCOPE_REFs when they are not required.
4803 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4804 `template' keyword.
4806 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4807 uninstantiated templates.
4809 If *TEMPLATE_P is non-NULL, it is set to true iff the
4810 `template' keyword is used to explicitly indicate that the entity
4811 named is a template.
4813 If DECLARATOR_P is true, the id-expression is appearing as part of
4814 a declarator, rather than as part of an expression. */
4816 static tree
4823 {
4827 /* Assume the `template' keyword was not used. */
4831 /* Look for the optional `::' operator. */
4832 global_scope_p
4835 /* Look for the optional nested-name-specifier. */
4836 nested_name_specifier_p
4839 check_dependency_p,
4841 declarator_p)
4843 /* If there is a nested-name-specifier, then we are looking at
4844 the first qualified-id production. */
4846 {
4847 tree saved_scope;
4848 tree saved_object_scope;
4849 tree saved_qualifying_scope;
4850 tree unqualified_id;
4853 /* See if the next token is the `template' keyword. */
4857 /* Name lookup we do during the processing of the
4858 unqualified-id might obliterate SCOPE. */
4862 /* Process the final unqualified-id. */
4864 check_dependency_p,
4865 declarator_p,
4867 /* Restore the SAVED_SCOPE for our caller. */
4873 }
4874 /* Otherwise, if we are in global scope, then we are looking at one
4875 of the other qualified-id productions. */
4877 {
4879 tree id;
4881 /* Peek at the next token. */
4884 /* If it's an identifier, and the next token is not a "<", then
4885 we can avoid the template-id case. This is an optimization
4886 for this common case. */
4888 && !cp_parser_nth_token_starts_template_argument_list_p
4893 /* Try a template-id. */
4897 none_type,
4898 declarator_p);
4899 /* If that worked, we're done. */
4903 /* Peek at the next token. (Changes in the token buffer may
4904 have invalidated the pointer obtained above.) */
4908 {
4915 /* Fall through. */
4920 }
4921 }
4922 else
4925 declarator_p,
4926 optional_p);
4927 }
4929 /* Parse an unqualified-id.
4931 unqualified-id:
4932 identifier
4933 operator-function-id
4934 conversion-function-id
4935 ~ class-name
4936 template-id
4938 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4939 keyword, in a construct like `A::template ...'.
4941 Returns a representation of unqualified-id. For the `identifier'
4942 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4943 production a BIT_NOT_EXPR is returned; the operand of the
4944 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4945 other productions, see the documentation accompanying the
4946 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4947 names are looked up in uninstantiated templates. If DECLARATOR_P
4948 is true, the unqualified-id is appearing as part of a declarator,
4949 rather than as part of an expression. */
4951 static tree
4957 {
4960 /* Peek at the next token. */
4964 {
4966 {
4967 tree id;
4969 /* We don't know yet whether or not this will be a
4970 template-id. */
4972 /* Try a template-id. */
4974 check_dependency_p,
4975 none_type,
4976 declarator_p);
4977 /* If it worked, we're done. */
4980 /* Otherwise, it's an ordinary identifier. */
4982 }
4986 check_dependency_p,
4987 none_type,
4988 declarator_p);
4991 {
4992 tree type_decl;
4993 tree qualifying_scope;
4994 tree object_scope;
4995 tree scope;
4998 /* Consume the `~' token. */
5000 /* Parse the class-name. The standard, as written, seems to
5001 say that:
5003 template <typename T> struct S { ~S (); };
5004 template <typename T> S<T>::~S() {}
5006 is invalid, since `~' must be followed by a class-name, but
5007 `S<T>' is dependent, and so not known to be a class.
5008 That's not right; we need to look in uninstantiated
5009 templates. A further complication arises from:
5011 template <typename T> void f(T t) {
5012 t.T::~T();
5013 }
5015 Here, it is not possible to look up `T' in the scope of `T'
5016 itself. We must look in both the current scope, and the
5017 scope of the containing complete expression.
5019 Yet another issue is:
5021 struct S {
5022 int S;
5023 ~S();
5024 };
5026 S::~S() {}
5028 The standard does not seem to say that the `S' in `~S'
5029 should refer to the type `S' and not the data member
5030 `S::S'. */
5032 /* DR 244 says that we look up the name after the "~" in the
5033 same scope as we looked up the qualifying name. That idea
5034 isn't fully worked out; it's more complicated than that. */
5039 /* Check for invalid scopes. */
5041 {
5045 }
5047 {
5051 scope);
5056 }
5059 /* If the name is of the form "X::~X" it's OK even if X is a
5060 typedef. */
5069 {
5072 }
5074 /* ~auto means the destructor of whatever the object is. */
5076 {
5079 "%<~auto%> only available with "
5083 }
5085 /* If there was an explicit qualification (S::~T), first look
5086 in the scope given by the qualification (i.e., S).
5088 Note: in the calls to cp_parser_class_name below we pass
5089 typename_type so that lookup finds the injected-class-name
5090 rather than the constructor. */
5094 {
5099 typename_type,
5102 declarator_p);
5105 }
5106 /* In "N::S::~S", look in "N" as well. */
5108 {
5113 type_decl
5117 typename_type,
5120 declarator_p);
5123 }
5124 /* In "p->S::~T", look in the scope given by "*p" as well. */
5126 {
5131 type_decl
5135 typename_type,
5138 declarator_p);
5141 }
5142 /* Look in the surrounding context. */
5144 {
5150 type_decl
5154 typename_type,
5157 declarator_p);
5160 {
5161 /* We couldn't find a type with this name, so just accept
5162 it and check for a match at instantiation time. */
5167 }
5168 }
5169 /* If an error occurred, assume that the name of the
5170 destructor is the same as the name of the qualifying
5171 class. That allows us to keep parsing after running
5172 into ill-formed destructor names. */
5178 /* Check that destructor name and scope match. */
5180 {
5187 }
5189 /* [class.dtor]
5191 A typedef-name that names a class shall not be used as the
5192 identifier in the declarator for a destructor declaration. */
5199 type_decl);
5202 }
5206 {
5207 tree id;
5209 /* This could be a template-id, so we try that first. */
5211 /* Try a template-id. */
5214 none_type,
5215 declarator_p);
5216 /* If that worked, we're done. */
5219 /* We still don't know whether we're looking at an
5220 operator-function-id or a conversion-function-id. */
5222 /* Try an operator-function-id. */
5224 /* If that didn't work, try a conversion-function-id. */
5228 {
5229 /* 17.6.3.3.5 */
5235 }
5238 }
5239 /* Fall through. */
5246 }
5247 }
5249 /* Parse an (optional) nested-name-specifier.
5251 nested-name-specifier: [C++98]
5252 class-or-namespace-name :: nested-name-specifier [opt]
5253 class-or-namespace-name :: template nested-name-specifier [opt]
5255 nested-name-specifier: [C++0x]
5256 type-name ::
5257 namespace-name ::
5258 nested-name-specifier identifier ::
5259 nested-name-specifier template [opt] simple-template-id ::
5261 PARSER->SCOPE should be set appropriately before this function is
5262 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5263 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5264 in name lookups.
5266 Sets PARSER->SCOPE to the class (TYPE) or namespace
5267 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5268 it unchanged if there is no nested-name-specifier. Returns the new
5269 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5271 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5272 part of a declaration and/or decl-specifier. */
5274 static tree
5280 {
5285 /* Remember where the nested-name-specifier starts. */
5287 {
5290 }
5293 {
5294 tree new_scope;
5295 tree old_scope;
5296 tree saved_qualifying_scope;
5299 /* Spot cases that cannot be the beginning of a
5300 nested-name-specifier. */
5303 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5304 the already parsed nested-name-specifier. */
5306 {
5307 /* Grab the nested-name-specifier and continue the loop. */
5309 /* If we originally encountered this nested-name-specifier
5310 with IS_DECLARATION set to false, we will not have
5311 resolved TYPENAME_TYPEs, so we must do so here. */
5314 {
5319 }
5322 }
5324 /* Spot cases that cannot be the beginning of a
5325 nested-name-specifier. On the second and subsequent times
5326 through the loop, we look for the `template' keyword. */
5328 ;
5329 /* A template-id can start a nested-name-specifier. */
5331 ;
5332 /* DR 743: decltype can be used in a nested-name-specifier. */
5334 ;
5335 else
5336 {
5337 /* If the next token is not an identifier, then it is
5338 definitely not a type-name or namespace-name. */
5341 /* If the following token is neither a `<' (to begin a
5342 template-id), nor a `::', then we are not looking at a
5343 nested-name-specifier. */
5349 {
5353 }
5356 && !cp_parser_nth_token_starts_template_argument_list_p
5359 }
5361 /* The nested-name-specifier is optional, so we parse
5362 tentatively. */
5365 /* Look for the optional `template' keyword, if this isn't the
5366 first time through the loop. */
5369 else
5372 /* Save the old scope since the name lookup we are about to do
5373 might destroy it. */
5376 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5377 look up names in "X<T>::I" in order to determine that "Y" is
5378 a template. So, if we have a typename at this point, we make
5379 an effort to look through it. */
5381 && !typename_keyword_p
5386 /* Parse the qualifying entity. */
5387 new_scope
5389 typename_keyword_p,
5390 template_keyword_p,
5391 check_dependency_p,
5392 type_p,
5393 is_declaration);
5394 /* Look for the `::' token. */
5397 /* If we found what we wanted, we keep going; otherwise, we're
5398 done. */
5400 {
5403 /* Restore the OLD_SCOPE since it was valid before the
5404 failed attempt at finding the last
5405 class-or-namespace-name. */
5409 /* If the next token is a decltype, and the one after that is a
5410 `::', then the decltype has failed to resolve to a class or
5411 enumeration type. Give this error even when parsing
5412 tentatively since it can't possibly be valid--and we're going
5413 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5414 won't get another chance.*/
5418 {
5425 /* As below. */
5428 }
5432 /* If the next token is an identifier, and the one after
5433 that is a `::', then any valid interpretation would have
5434 found a class-or-namespace-name. */
5440 {
5443 {
5445 {
5446 tree decl;
5447 tree ambiguous_decls;
5450 none_type,
5459 decl);
5461 {
5462 // cp_parser_lookup_name has the same diagnostic,
5463 // thus make sure to emit it at most once.
5466 {
5471 }
5473 }
5474 else
5475 {
5477 cp_parser_name_lookup_error
5480 else
5481 cp_parser_name_lookup_error
5484 }
5485 }
5488 /* Treat this as a successful nested-name-specifier
5489 due to:
5491 [basic.lookup.qual]
5493 If the name found is not a class-name (clause
5494 _class_) or namespace-name (_namespace.def_), the
5495 program is ill-formed. */
5497 }
5499 }
5501 }
5502 /* We've found one valid nested-name-specifier. */
5504 /* Name lookup always gives us a DECL. */
5507 /* Uses of "template" must be followed by actual templates. */
5519 new_scope);
5520 /* If it is a class scope, try to complete it; we are about to
5521 be looking up names inside the class. */
5523 /* Since checking types for dependency can be expensive,
5524 avoid doing it if the type is already complete. */
5526 /* Do not try to complete dependent types. */
5528 {
5530 /* If it is a typedef to current class, use the current
5531 class instead, as the typedef won't have any names inside
5532 it yet. */
5536 }
5537 /* Make sure we look in the right scope the next time through
5538 the loop. */
5540 }
5542 /* If parsing tentatively, replace the sequence of tokens that makes
5543 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5544 token. That way, should we re-parse the token stream, we will
5545 not have to repeat the effort required to do the parse, nor will
5546 we issue duplicate error messages. */
5548 {
5552 /* Reset the contents of the START token. */
5554 /* Retrieve any deferred checks. Do not pop this access checks yet
5555 so the memory will not be reclaimed during token replacing below. */
5563 /* Purge all subsequent tokens. */
5565 }
5571 }
5573 /* Parse a nested-name-specifier. See
5574 cp_parser_nested_name_specifier_opt for details. This function
5575 behaves identically, except that it will an issue an error if no
5576 nested-name-specifier is present. */
5578 static tree
5584 {
5585 tree scope;
5587 /* Look for the nested-name-specifier. */
5589 typename_keyword_p,
5590 check_dependency_p,
5591 type_p,
5592 is_declaration);
5593 /* If it was not present, issue an error message. */
5595 {
5598 }
5601 }
5603 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5604 this is either a class-name or a namespace-name (which corresponds
5605 to the class-or-namespace-name production in the grammar). For
5606 C++0x, it can also be a type-name that refers to an enumeration
5607 type or a simple-template-id.
5609 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5610 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5611 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5612 TYPE_P is TRUE iff the next name should be taken as a class-name,
5613 even the same name is declared to be another entity in the same
5614 scope.
5616 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5617 specified by the class-or-namespace-name. If neither is found the
5618 ERROR_MARK_NODE is returned. */
5620 static tree
5627 {
5628 tree saved_scope;
5629 tree saved_qualifying_scope;
5630 tree saved_object_scope;
5631 tree scope;
5635 /* DR 743: decltype can appear in a nested-name-specifier. */
5637 {
5641 {
5644 }
5648 }
5650 /* Before we try to parse the class-name, we must save away the
5651 current PARSER->SCOPE since cp_parser_class_name will destroy
5652 it. */
5656 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5657 there is no need to look for a namespace-name. */
5658 only_class_p = template_keyword_p
5663 typename_keyword_p,
5664 template_keyword_p,
5666 check_dependency_p,
5668 is_declaration);
5670 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5674 {
5675 /* Restore the saved scope. */
5680 /* Parse tentatively. */
5683 /* Parse a type-name */
5686 /* "If the name found does not designate a namespace or a class,
5687 enumeration, or dependent type, the program is ill-formed."
5689 We cover classes and dependent types above and namespaces below,
5690 so this code is only looking for enums. */
5696 }
5697 /* If that didn't work, try for a namespace-name. */
5699 {
5700 /* Restore the saved scope. */
5704 /* If we are not looking at an identifier followed by the scope
5705 resolution operator, then this is not part of a
5706 nested-name-specifier. (Note that this function is only used
5707 to parse the components of a nested-name-specifier.) */
5712 }
5715 }
5717 /* Return true if we are looking at a compound-literal, false otherwise. */
5719 static bool
5721 {
5722 /* Consume the `('. */
5727 /* Skip tokens until the next token is a closing parenthesis.
5728 If we find the closing `)', and the next token is a `{', then
5729 we are looking at a compound-literal. */
5730 bool compound_literal_p
5735 /* Roll back the tokens we skipped. */
5739 }
5741 /* Parse a postfix-expression.
5743 postfix-expression:
5744 primary-expression
5745 postfix-expression [ expression ]
5746 postfix-expression ( expression-list [opt] )
5747 simple-type-specifier ( expression-list [opt] )
5748 typename :: [opt] nested-name-specifier identifier
5749 ( expression-list [opt] )
5750 typename :: [opt] nested-name-specifier template [opt] template-id
5751 ( expression-list [opt] )
5752 postfix-expression . template [opt] id-expression
5753 postfix-expression -> template [opt] id-expression
5754 postfix-expression . pseudo-destructor-name
5755 postfix-expression -> pseudo-destructor-name
5756 postfix-expression ++
5757 postfix-expression --
5758 dynamic_cast < type-id > ( expression )
5759 static_cast < type-id > ( expression )
5760 reinterpret_cast < type-id > ( expression )
5761 const_cast < type-id > ( expression )
5762 typeid ( expression )
5763 typeid ( type-id )
5765 GNU Extension:
5767 postfix-expression:
5768 ( type-id ) { initializer-list , [opt] }
5770 This extension is a GNU version of the C99 compound-literal
5771 construct. (The C99 grammar uses `type-name' instead of `type-id',
5772 but they are essentially the same concept.)
5774 If ADDRESS_P is true, the postfix expression is the operand of the
5775 `&' operator. CAST_P is true if this expression is the target of a
5776 cast.
5778 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5779 class member access expressions [expr.ref].
5781 Returns a representation of the expression. */
5783 static tree
5787 {
5789 location_t loc;
5796 /* Peek at the next token. */
5799 /* Some of the productions are determined by keywords. */
5802 {
5807 {
5808 tree type;
5809 tree expression;
5813 /* All of these can be handled in the same way from the point
5814 of view of parsing. Begin by consuming the token
5815 identifying the cast. */
5818 /* New types cannot be defined in the cast. */
5820 parser->type_definition_forbidden_message
5823 /* Look for the opening `<'. */
5825 /* Parse the type to which we are casting. */
5830 /* Look for the closing `>'. */
5832 /* Restore the old message. */
5835 bool saved_greater_than_is_operator_p
5839 /* And the expression which is being cast. */
5844 parser->greater_than_is_operator_p
5847 /* Only type conversions to integral or enumeration types
5848 can be used in constant-expressions. */
5854 {
5856 postfix_expression
5860 postfix_expression
5864 postfix_expression
5866 tf_warning_or_error);
5869 postfix_expression
5874 }
5875 }
5879 {
5880 tree type;
5884 /* Consume the `typeid' token. */
5886 /* Look for the `(' token. */
5888 /* Types cannot be defined in a `typeid' expression. */
5890 parser->type_definition_forbidden_message
5892 /* We can't be sure yet whether we're looking at a type-id or an
5893 expression. */
5895 /* Try a type-id first. */
5900 /* Look for the `)' token. Otherwise, we can't be sure that
5901 we're not looking at an expression: consider `typeid (int
5902 (3))', for example. */
5904 /* If all went well, simply lookup the type-id. */
5907 /* Otherwise, fall back to the expression variant. */
5908 else
5909 {
5910 tree expression;
5912 /* Look for an expression. */
5914 /* Compute its typeid. */
5916 /* Look for the `)' token. */
5918 }
5919 /* Restore the saved message. */
5921 /* `typeid' may not appear in an integral constant expression. */
5924 }
5928 {
5929 tree type;
5930 /* The syntax permitted here is the same permitted for an
5931 elaborated-type-specifier. */
5936 }
5940 {
5944 {
5949 }
5951 {
5956 }
5957 else
5958 {
5959 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5962 }
5964 postfix_expression =
5968 {
5972 }
5974 {
5979 }
5980 else
5981 {
5983 postfix_expression);
5987 }
5989 }
5992 {
5995 tree p;
6009 tf_warning_or_error);
6012 tf_warning_or_error);
6013 else
6014 {
6018 }
6020 }
6023 {
6024 tree type;
6026 /* If the next thing is a simple-type-specifier, we may be
6027 looking at a functional cast. We could also be looking at
6028 an id-expression. So, we try the functional cast, and if
6029 that doesn't work we fall back to the primary-expression. */
6031 /* Look for the simple-type-specifier. */
6034 CP_PARSER_FLAGS_NONE);
6035 /* Parse the cast itself. */
6037 postfix_expression
6039 /* If that worked, we're done. */
6043 /* If the functional-cast didn't work out, try a
6044 compound-literal. */
6047 {
6052 /* Avoid calling cp_parser_type_id pointlessly, see comment
6053 in cp_parser_cast_expression about c++/29234. */
6056 else
6057 {
6058 /* Parse the type. */
6063 /* Look for the `)'. */
6065 }
6067 /* If things aren't going well, there's no need to
6068 keep going. */
6070 {
6072 /* Parse the brace-enclosed initializer list. */
6075 }
6076 /* If that worked, we're definitely looking at a
6077 compound-literal expression. */
6079 {
6080 /* Warn the user that a compound literal is not
6081 allowed in standard C++. */
6084 /* For simplicity, we disallow compound literals in
6085 constant-expressions. We could
6086 allow compound literals of integer type, whose
6087 initializer was a constant, in constant
6088 expressions. Permitting that usage, as a further
6089 extension, would not change the meaning of any
6090 currently accepted programs. (Of course, as
6091 compound literals are not part of ISO C++, the
6092 standard has nothing to say.) */
6094 NIC_NCC))
6095 {
6098 }
6099 /* Form the representation of the compound-literal. */
6100 postfix_expression
6102 tf_warning_or_error);
6104 }
6105 }
6107 /* It must be a primary-expression. */
6108 postfix_expression
6111 decltype_p,
6113 }
6115 }
6117 /* Note that we don't need to worry about calling build_cplus_new on a
6118 class-valued CALL_EXPR in decltype when it isn't the end of the
6119 postfix-expression; unary_complex_lvalue will take care of that for
6120 all these cases. */
6122 /* Keep looping until the postfix-expression is complete. */
6124 {
6128 /* It is not a Koenig lookup function call. */
6129 postfix_expression
6132 /* Peek at the next token. */
6136 {
6139 {
6141 "two consecutive %<[%> shall "
6144 }
6145 postfix_expression
6147 postfix_expression,
6149 decltype_p);
6155 /* postfix-expression ( expression-list [opt] ) */
6156 {
6166 is_builtin_constant_p
6169 {
6170 /* The whole point of __builtin_constant_p is to allow
6171 non-constant expressions to appear as arguments. */
6172 saved_integral_constant_expression_p
6174 saved_non_integral_constant_expression_p
6177 }
6178 args = (cp_parser_parenthesized_expression_list
6184 {
6185 parser->integral_constant_expression_p
6187 parser->non_integral_constant_expression_p
6189 }
6192 {
6195 }
6197 /* Function calls are not permitted in
6198 constant-expressions. */
6201 NIC_FUNC_CALL))
6202 {
6206 }
6211 {
6213 {
6215 {
6218 postfix_expression
6220 complain);
6221 }
6222 else
6223 postfix_expression
6225 }
6226 /* We do not perform argument-dependent lookup if
6227 normal lookup finds a non-function, in accordance
6228 with the expected resolution of DR 218. */
6231 {
6235 /* Do not do argument dependent lookup if regular
6236 lookup finds a member function or a block-scope
6237 function declaration. [basic.lookup.argdep]/3 */
6240 {
6243 postfix_expression
6245 complain);
6246 }
6247 }
6248 }
6251 {
6261 "%<memset%> used with constant zero length "
6262 "parameter; this could be due to transposed "
6265 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6266 to avoid leaking those into folder and middle-end. */
6268 tree arg;
6272 }
6275 {
6285 {
6286 postfix_expression
6290 }
6293 {
6294 postfix_expression
6295 = (build_new_method_call
6301 complain));
6302 }
6303 else
6304 postfix_expression
6308 complain);
6309 }
6313 postfix_expression = (build_offset_ref_call_from_tree
6315 complain));
6317 /* A call to a static class member, or a namespace-scope
6318 function. */
6319 postfix_expression
6322 koenig_p,
6323 complain);
6324 else
6325 /* All other function calls. */
6326 postfix_expression
6329 koenig_p,
6330 complain);
6334 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6338 }
6343 /* postfix-expression . template [opt] id-expression
6344 postfix-expression . pseudo-destructor-name
6345 postfix-expression -> template [opt] id-expression
6346 postfix-expression -> pseudo-destructor-name */
6348 /* Consume the `.' or `->' operator. */
6351 postfix_expression
6353 postfix_expression,
6360 /* postfix-expression ++ */
6361 /* Consume the `++' token. */
6363 /* Generate a representation for the complete expression. */
6364 postfix_expression
6366 POSTINCREMENT_EXPR);
6367 /* Increments may not appear in constant-expressions. */
6375 /* postfix-expression -- */
6376 /* Consume the `--' token. */
6378 /* Generate a representation for the complete expression. */
6379 postfix_expression
6381 POSTDECREMENT_EXPR);
6382 /* Decrements may not appear in constant-expressions. */
6394 else
6396 }
6397 }
6399 /* We should never get here. */
6402 }
6404 /* This function parses Cilk Plus array notations. If a normal array expr. is
6405 parsed then the array index is passed back to the caller through *INIT_INDEX
6406 and the function returns a NULL_TREE. If array notation expr. is parsed,
6407 then *INIT_INDEX is ignored by the caller and the function returns
6408 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6409 error_mark_node. */
6411 static tree
6413 tree array_value)
6414 {
6418 {
6421 }
6430 {
6433 }
6435 {
6436 /* Consume the ':'. */
6439 /* If we are here, then we have a case like this A[:]. */
6441 {
6445 }
6449 }
6450 else
6451 {
6452 /* If we are here, then there are three valid possibilities:
6453 1. ARRAY [ EXP ]
6454 2. ARRAY [ EXP : EXP ]
6455 3. ARRAY [ EXP : EXP : EXP ] */
6459 {
6460 /* This indicates that we have a normal array expression. */
6463 }
6465 /* Consume the ':'. */
6469 {
6472 }
6473 }
6478 {
6482 }
6488 }
6490 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6491 by cp_parser_builtin_offsetof. We're looking for
6493 postfix-expression [ expression ]
6494 postfix-expression [ braced-init-list ] (C++11)
6496 FOR_OFFSETOF is set if we're being called in that context, which
6497 changes how we deal with integer constant expressions. */
6499 static tree
6501 tree postfix_expression,
6504 {
6509 /* Consume the `[' token. */
6515 /* Parse the index expression. */
6516 /* ??? For offsetof, there is a question of what to allow here. If
6517 offsetof is not being used in an integral constant expression context,
6518 then we *could* get the right answer by computing the value at runtime.
6519 If we are in an integral constant expression context, then we might
6520 could accept any constant expression; hard to say without analysis.
6521 Rather than open the barn door too wide right away, allow only integer
6522 constant expressions here. */
6525 else
6526 {
6528 {
6535 {
6537 "braced list index is not allowed with array "
6541 }
6542 }
6544 {
6545 /* Here are have these two options:
6546 ARRAY[EXP : EXP] - Array notation expr with default
6547 stride of 1.
6548 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6549 stride. */
6551 postfix_expression);
6554 }
6555 else
6557 }
6561 /* Look for the closing `]'. */
6564 /* Build the ARRAY_REF. */
6568 /* When not doing offsetof, array references are not permitted in
6569 constant-expressions. */
6575 }
6577 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6578 by cp_parser_builtin_offsetof. We're looking for
6580 postfix-expression . template [opt] id-expression
6581 postfix-expression . pseudo-destructor-name
6582 postfix-expression -> template [opt] id-expression
6583 postfix-expression -> pseudo-destructor-name
6585 FOR_OFFSETOF is set if we're being called in that context. That sorta
6586 limits what of the above we'll actually accept, but nevermind.
6587 TOKEN_TYPE is the "." or "->" token, which will already have been
6588 removed from the stream. */
6590 static tree
6593 tree postfix_expression,
6595 location_t location)
6596 {
6597 tree name;
6602 /* If this is a `->' operator, dereference the pointer. */
6605 tf_warning_or_error);
6606 /* Check to see whether or not the expression is type-dependent. */
6608 /* The identifier following the `->' or `.' is not qualified. */
6614 /* Enter the scope corresponding to the type of the object
6615 given by the POSTFIX_EXPRESSION. */
6617 {
6619 /* According to the standard, no expression should ever have
6620 reference type. Unfortunately, we do not currently match
6621 the standard in this respect in that our internal representation
6622 of an expression may have reference type even when the standard
6623 says it does not. Therefore, we have to manually obtain the
6624 underlying type here. */
6626 /* The type of the POSTFIX_EXPRESSION must be complete. */
6628 {
6630 postfix_expression);
6632 }
6633 /* Unlike the object expression in other contexts, *this is not
6634 required to be of complete type for purposes of class member
6635 access (5.2.5) outside the member function body. */
6639 /* Let the name lookup machinery know that we are processing a
6640 class member access expression. */
6642 /* If something went wrong, we want to be able to discern that case,
6643 as opposed to the case where there was no SCOPE due to the type
6644 of expression being dependent. */
6647 /* If the SCOPE was erroneous, make the various semantic analysis
6648 functions exit quickly -- and without issuing additional error
6649 messages. */
6652 }
6654 /* Assume this expression is not a pseudo-destructor access. */
6657 /* If the SCOPE is a scalar type, then, if this is a valid program,
6658 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6659 is type dependent, it can be pseudo-destructor-name or something else.
6660 Try to parse it as pseudo-destructor-name first. */
6662 {
6663 tree s;
6664 tree type;
6667 /* Parse the pseudo-destructor-name. */
6676 {
6678 postfix_expression
6681 }
6682 }
6685 {
6686 /* If the SCOPE is not a scalar type, we are looking at an
6687 ordinary class member access expression, rather than a
6688 pseudo-destructor-name. */
6691 /* Parse the id-expression. */
6692 name = (cp_parser_id_expression
6699 /* In general, build a SCOPE_REF if the member name is qualified.
6700 However, if the name was not dependent and has already been
6701 resolved; there is no need to build the SCOPE_REF. For example;
6703 struct X { void f(); };
6704 template <typename T> void f(T* t) { t->X::f(); }
6706 Even though "t" is dependent, "X::f" is not and has been resolved
6707 to a BASELINK; there is no need to include scope information. */
6709 /* But we do need to remember that there was an explicit scope for
6710 virtual function calls. */
6714 /* If the name is a template-id that names a type, we will get a
6715 TYPE_DECL here. That is invalid code. */
6717 {
6720 }
6721 else
6722 {
6724 {
6726 {
6730 }
6731 else
6734 name,
6735 template_p);
6739 }
6741 adjust_result_of_qualified_name_lookup
6743 postfix_expression
6745 template_p,
6746 tf_warning_or_error);
6747 }
6748 }
6750 /* We no longer need to look up names in the scope of the object on
6751 the left-hand side of the `.' or `->' operator. */
6754 /* Outside of offsetof, these operators may not appear in
6755 constant-expressions. */
6757 && (cp_parser_non_integral_constant_expression
6762 }
6764 /* Cache of LITERAL_ZERO_P constants. */
6768 /* Parse a parenthesized expression-list.
6770 expression-list:
6771 assignment-expression
6772 expression-list, assignment-expression
6774 attribute-list:
6775 expression-list
6776 identifier
6777 identifier, expression-list
6779 CAST_P is true if this expression is the target of a cast.
6781 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6782 argument pack.
6784 Returns a vector of trees. Each element is a representation of an
6785 assignment-expression. NULL is returned if the ( and or ) are
6786 missing. An empty, but allocated, vector is returned on no
6787 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6788 if we are parsing an attribute list for an attribute that wants a
6789 plain identifier argument, normal_attr for an attribute that wants
6790 an expression, or non_attr if we aren't parsing an attribute list. If
6791 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6792 not all of the expressions in the list were constant.
6793 WANT_LITERAL_ZERO_P is true if the caller is interested in
6794 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6795 immediately, this can be removed. */
6804 {
6810 /* Assume all the expressions will be constant. */
6819 /* Within a parenthesized expression, a `>' token is always
6820 the greater-than operator. */
6821 saved_greater_than_is_operator_p
6825 /* Consume expressions until there are no more. */
6828 {
6829 tree expr;
6831 /* At the beginning of attribute lists, check to see if the
6832 next token is an identifier. */
6835 {
6838 /* Consume the identifier. */
6840 /* Save the identifier. */
6842 }
6843 else
6844 {
6847 /* Parse the next assignment-expression. */
6849 {
6850 /* A braced-init-list. */
6856 }
6858 {
6859 expr = (cp_parser_constant_expression
6864 }
6865 else
6866 {
6870 {
6876 /* If a parameter is literal zero alone, remember it
6877 for -Wmemset-transposed-args warning. */
6880 && want_literal_zero_p
6882 == CPP_COMMA
6885 {
6892 else
6893 {
6898 }
6899 /* Consume the 0 token (or '\0', 0LL etc.). */
6901 }
6905 }
6908 cast_p);
6909 }
6914 /* If we have an ellipsis, then this is an expression
6915 expansion. */
6918 {
6919 /* Consume the `...'. */
6922 /* Build the argument pack. */
6924 }
6926 /* Add it to the list. We add error_mark_node
6927 expressions to the list, so that we can still tell if
6928 the correct form for a parenthesized expression-list
6929 is found. That gives better errors. */
6934 }
6936 /* After the first item, attribute lists look the same as
6937 expression lists. */
6940 get_comma:;
6941 /* If the next token isn't a `,', then we are done. */
6945 /* Otherwise, consume the `,' and keep going. */
6947 }
6950 {
6953 skip_comma:;
6954 /* We try and resync to an unnested comma, as that will give the
6955 user better diagnostics. */
6963 {
6964 parser->greater_than_is_operator_p
6967 }
6968 }
6970 parser->greater_than_is_operator_p
6977 }
6979 /* Parse a pseudo-destructor-name.
6981 pseudo-destructor-name:
6982 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6983 :: [opt] nested-name-specifier template template-id :: ~ type-name
6984 :: [opt] nested-name-specifier [opt] ~ type-name
6986 If either of the first two productions is used, sets *SCOPE to the
6987 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6988 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6989 or ERROR_MARK_NODE if the parse fails. */
6991 static void
6993 tree object,
6996 {
6999 /* Handle ~auto. */
7003 {
7006 "%<~auto%> only available with "
7013 }
7015 /* Assume that things will not work out. */
7018 /* Look for the optional `::' operator. */
7020 /* Look for the optional nested-name-specifier. */
7021 nested_name_specifier_p
7028 /* Now, if we saw a nested-name-specifier, we might be doing the
7029 second production. */
7032 {
7033 /* Consume the `template' keyword. */
7035 /* Parse the template-id. */
7039 class_type,
7041 /* Look for the `::' token. */
7043 }
7044 /* If the next token is not a `~', then there might be some
7045 additional qualification. */
7047 {
7048 /* At this point, we're looking for "type-name :: ~". The type-name
7049 must not be a class-name, since this is a pseudo-destructor. So,
7050 it must be either an enum-name, or a typedef-name -- both of which
7051 are just identifiers. So, we peek ahead to check that the "::"
7052 and "~" tokens are present; if they are not, then we can avoid
7053 calling type_name. */
7057 {
7060 }
7062 /* Look for the type-name. */
7067 /* Look for the `::' token. */
7069 }
7070 else
7073 /* Look for the `~'. */
7076 /* Once we see the ~, this has to be a pseudo-destructor. */
7080 /* Look for the type-name again. We are not responsible for
7081 checking that it matches the first type-name. */
7083 }
7085 /* Parse a unary-expression.
7087 unary-expression:
7088 postfix-expression
7089 ++ cast-expression
7090 -- cast-expression
7091 unary-operator cast-expression
7092 sizeof unary-expression
7093 sizeof ( type-id )
7094 alignof ( type-id ) [C++0x]
7095 new-expression
7096 delete-expression
7098 GNU Extensions:
7100 unary-expression:
7101 __extension__ cast-expression
7102 __alignof__ unary-expression
7103 __alignof__ ( type-id )
7104 alignof unary-expression [C++0x]
7105 __real__ cast-expression
7106 __imag__ cast-expression
7107 && identifier
7108 sizeof ( type-id ) { initializer-list , [opt] }
7109 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7110 __alignof__ ( type-id ) { initializer-list , [opt] }
7112 ADDRESS_P is true iff the unary-expression is appearing as the
7113 operand of the `&' operator. CAST_P is true if this expression is
7114 the target of a cast.
7116 Returns a representation of the expression. */
7118 static tree
7121 {
7125 /* Peek at the next token. */
7127 /* Some keywords give away the kind of expression. */
7129 {
7133 {
7136 {
7139 location_t first_loc;
7142 /* Consume the token. */
7145 /* Parse the operand. */
7150 else
7151 {
7152 /* ISO C++ defines alignof only with types, not with
7153 expressions. So pedwarn if alignof is used with a non-
7154 type expression. However, __alignof__ is ok. */
7157 "ISO C++ does not allow %<alignof%> "
7161 }
7162 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7163 SIZEOF_EXPR with the original operand. */
7165 {
7167 {
7169 {
7172 error_mark_node));
7174 }
7175 else
7179 }
7181 }
7183 }
7192 {
7193 /* The saved value of the PEDANTIC flag. */
7195 tree expr;
7197 /* Save away the PEDANTIC flag. */
7199 /* Parse the cast-expression. */
7201 /* Restore the PEDANTIC flag. */
7205 }
7209 {
7210 tree expression;
7212 /* Consume the `__real__' or `__imag__' token. */
7214 /* Parse the cast-expression. */
7216 /* Create the complete representation. */
7220 expression,
7221 tf_warning_or_error);
7222 }
7230 {
7231 tree expr;
7241 parser->type_definition_forbidden_message
7244 saved_integral_constant_expression_p
7246 saved_non_integral_constant_expression_p
7250 saved_greater_than_is_operator_p
7262 parser->greater_than_is_operator_p
7265 parser->integral_constant_expression_p
7267 parser->non_integral_constant_expression_p
7274 }
7278 }
7279 }
7281 /* Look for the `:: new' and `:: delete', which also signal the
7282 beginning of a new-expression, or delete-expression,
7283 respectively. If the next token is `::', then it might be one of
7284 these. */
7286 {
7289 /* See if the token after the `::' is one of the keywords in
7290 which we're interested. */
7292 /* If it's `new', we have a new-expression. */
7295 /* Similarly, for `delete'. */
7298 }
7300 /* Look for a unary operator. */
7302 /* The `++' and `--' operators can be handled similarly, even though
7303 they are not technically unary-operators in the grammar. */
7305 {
7310 /* Handle the GNU address-of-label extension. */
7313 {
7314 tree identifier;
7315 tree expression;
7318 /* Consume the '&&' token. */
7320 /* Look for the identifier. */
7322 /* Create an expression representing the address. */
7325 NIC_ADDR_LABEL))
7328 }
7329 }
7331 {
7332 tree cast_expression;
7338 /* Consume the operator token. */
7340 /* Parse the cast-expression. */
7341 cast_expression
7346 pidk);
7347 /* Now, build an appropriate representation. */
7349 {
7353 RO_UNARY_STAR,
7354 complain);
7359 /* Fall through. */
7362 cast_expression,
7363 complain);
7370 /* Fall through. */
7380 }
7384 non_constant_p))
7388 }
7392 decltype_p,
7393 pidk);
7394 }
7396 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7397 unary-operator, the corresponding tree code is returned. */
7399 static enum tree_code
7401 {
7403 {
7424 }
7425 }
7427 /* Parse a new-expression.
7429 new-expression:
7430 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7431 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7433 Returns a representation of the expression. */
7435 static tree
7437 {
7440 tree type;
7443 tree ret;
7445 /* Look for the optional `::' operator. */
7446 global_scope_p
7450 /* Look for the `new' operator. */
7452 /* There's no easy way to tell a new-placement from the
7453 `( type-id )' construct. */
7455 /* Look for a new-placement. */
7457 /* If that didn't work out, there's no new-placement. */
7459 {
7463 }
7465 /* If the next token is a `(', then we have a parenthesized
7466 type-id. */
7468 {
7472 /* Consume the `('. */
7475 /* Parse the type-id. */
7476 parser->type_definition_forbidden_message
7481 /* Look for the closing `)'. */
7484 /* There should not be a direct-new-declarator in this production,
7485 but GCC used to allowed this, so we check and emit a sensible error
7486 message for this case. */
7488 {
7494 }
7495 }
7496 /* Otherwise, there must be a new-type-id. */
7497 else
7500 /* If the next token is a `(' or '{', then we have a new-initializer. */
7504 else
7507 /* A new-expression may not appear in an integral constant
7508 expression. */
7511 else
7512 {
7513 /* Create a representation of the new-expression. */
7515 tf_warning_or_error);
7516 }
7524 }
7526 /* Parse a new-placement.
7528 new-placement:
7529 ( expression-list )
7531 Returns the same representation as for an expression-list. */
7535 {
7538 /* Parse the expression-list. */
7539 expression_list = (cp_parser_parenthesized_expression_list
7545 }
7547 /* Parse a new-type-id.
7549 new-type-id:
7550 type-specifier-seq new-declarator [opt]
7552 Returns the TYPE allocated. If the new-type-id indicates an array
7553 type, *NELTS is set to the number of elements in the last array
7554 bound; the TYPE will not include the last array bound. */
7556 static tree
7558 {
7559 cp_decl_specifier_seq type_specifier_seq;
7565 /* The type-specifier sequence must not contain type definitions.
7566 (It cannot contain declarations of new types either, but if they
7567 are not definitions we will catch that because they are not
7568 complete.) */
7570 parser->type_definition_forbidden_message
7572 /* Parse the type-specifier-seq. */
7576 /* Restore the old message. */
7582 /* Parse the new-declarator. */
7585 /* Determine the number of elements in the last array dimension, if
7586 any. */
7588 /* Skip down to the last array dimension. */
7593 {
7596 }
7601 {
7604 }
7607 {
7614 else
7616 }
7619 }
7621 /* Parse an (optional) new-declarator.
7623 new-declarator:
7624 ptr-operator new-declarator [opt]
7625 direct-new-declarator
7627 Returns the declarator. */
7631 {
7634 cp_cv_quals cv_quals;
7636 /* We don't know if there's a ptr-operator next, or not. */
7638 /* Look for a ptr-operator. */
7640 /* If that worked, look for more new-declarators. */
7642 {
7645 /* Parse another optional declarator. */
7648 declarator = cp_parser_make_indirect_declarator
7652 }
7654 /* If the next token is a `[', there is a direct-new-declarator. */
7659 }
7661 /* Parse a direct-new-declarator.
7663 direct-new-declarator:
7664 [ expression ]
7665 direct-new-declarator [constant-expression]
7667 */
7671 {
7675 {
7676 tree expression;
7679 /* Look for the opening `['. */
7684 /* The standard requires that the expression have integral
7685 type. DR 74 adds enumeration types. We believe that the
7686 real intent is that these expressions be handled like the
7687 expression in a `switch' condition, which also allows
7688 classes with a single conversion to integral or
7689 enumeration type. */
7691 {
7692 expression
7694 expression,
7697 {
7699 "expression in new-declarator must have integral "
7702 }
7703 }
7705 /* Look for the closing `]'. */
7708 /* Add this bound to the declarator. */
7711 /* If the next token is not a `[', then there are no more
7712 bounds. */
7715 }
7718 }
7720 /* Parse a new-initializer.
7722 new-initializer:
7723 ( expression-list [opt] )
7724 braced-init-list
7726 Returns a representation of the expression-list. */
7730 {
7734 {
7735 tree t;
7742 }
7743 else
7744 expression_list = (cp_parser_parenthesized_expression_list
7750 }
7752 /* Parse a delete-expression.
7754 delete-expression:
7755 :: [opt] delete cast-expression
7756 :: [opt] delete [ ] cast-expression
7758 Returns a representation of the expression. */
7760 static tree
7762 {
7765 tree expression;
7767 /* Look for the optional `::' operator. */
7768 global_scope_p
7772 /* Look for the `delete' keyword. */
7774 /* See if the array syntax is in use. */
7776 {
7777 /* Consume the `[' token. */
7779 /* Look for the `]' token. */
7781 /* Remember that this is the `[]' construct. */
7783 }
7784 else
7787 /* Parse the cast-expression. */
7790 /* A delete-expression may not appear in an integral constant
7791 expression. */
7796 tf_warning_or_error);
7797 }
7799 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7800 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7801 0 otherwise. */
7803 static int
7805 {
7808 {
7850 /* In ((type ()) () the last () isn't a valid cast-expression,
7851 so the whole must be parsed as postfix-expression. */
7856 /* '[' may start a primary-expression in obj-c++ and in C++11,
7857 as a lambda-expression, eg, '(void)[]{}'. */
7864 /* '++' and '--' may or may not start a cast-expression:
7866 struct T { void operator++(int); };
7867 void f() { (T())++; }
7869 vs
7871 int a;
7872 (int)++a; */
7877 }
7878 }
7880 /* Parse a cast-expression.
7882 cast-expression:
7883 unary-expression
7884 ( type-id ) cast-expression
7886 ADDRESS_P is true iff the unary-expression is appearing as the
7887 operand of the `&' operator. CAST_P is true if this expression is
7888 the target of a cast.
7890 Returns a representation of the expression. */
7892 static tree
7895 {
7896 /* If it's a `(', then we might be looking at a cast. */
7898 {
7904 /* There's no way to know yet whether or not this is a cast.
7905 For example, `(int (3))' is a unary-expression, while `(int)
7906 3' is a cast. So, we resort to parsing tentatively. */
7908 /* Types may not be defined in a cast. */
7910 parser->type_definition_forbidden_message
7912 /* Consume the `('. */
7914 /* A very tricky bit is that `(struct S) { 3 }' is a
7915 compound-literal (which we permit in C++ as an extension).
7916 But, that construct is not a cast-expression -- it is a
7917 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7918 is legal; if the compound-literal were a cast-expression,
7919 you'd need an extra set of parentheses.) But, if we parse
7920 the type-id, and it happens to be a class-specifier, then we
7921 will commit to the parse at that point, because we cannot
7922 undo the action that is done when creating a new class. So,
7923 then we cannot back up and do a postfix-expression.
7925 Another tricky case is the following (c++/29234):
7927 struct S { void operator () (); };
7929 void foo ()
7930 {
7931 ( S()() );
7932 }
7934 As a type-id we parse the parenthesized S()() as a function
7935 returning a function, groktypename complains and we cannot
7936 back up in this case either.
7938 Therefore, we scan ahead to the closing `)', and check to see
7939 if the tokens after the `)' can start a cast-expression. Otherwise
7940 we are dealing with an unary-expression, a postfix-expression
7941 or something else.
7943 Yet another tricky case, in C++11, is the following (c++/54891):
7945 (void)[]{};
7947 The issue is that usually, besides the case of lambda-expressions,
7948 the parenthesized type-id cannot be followed by '[', and, eg, we
7949 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7950 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7951 we don't commit, we try a cast-expression, then an unary-expression.
7953 Save tokens so that we can put them back. */
7956 /* We may be looking at a cast-expression. */
7959 cast_expression
7962 /* Roll back the tokens we skipped. */
7964 /* If we aren't looking at a cast-expression, simulate an error so
7965 that the call to cp_parser_error_occurred below returns true. */
7968 else
7969 {
7972 /* Look for the type-id. */
7974 /* Look for the closing `)'. */
7977 }
7979 /* Restore the saved message. */
7982 /* At this point this can only be either a cast or a
7983 parenthesized ctor such as `(T ())' that looks like a cast to
7984 function returning T. */
7986 {
7987 /* Only commit if the cast-expression doesn't start with
7988 '++', '--', or '[' in C++11. */
7996 pidk);
7999 {
8000 /* Warn about old-style casts, if so requested. */
8007 /* Only type conversions to integral or enumeration types
8008 can be used in constant-expressions. */
8011 NIC_CAST))
8014 /* Perform the cast. */
8017 }
8018 }
8019 else
8021 }
8023 /* If we get here, then it's not a cast, so it must be a
8024 unary-expression. */
8027 }
8029 /* Parse a binary expression of the general form:
8031 pm-expression:
8032 cast-expression
8033 pm-expression .* cast-expression
8034 pm-expression ->* cast-expression
8036 multiplicative-expression:
8037 pm-expression
8038 multiplicative-expression * pm-expression
8039 multiplicative-expression / pm-expression
8040 multiplicative-expression % pm-expression
8042 additive-expression:
8043 multiplicative-expression
8044 additive-expression + multiplicative-expression
8045 additive-expression - multiplicative-expression
8047 shift-expression:
8048 additive-expression
8049 shift-expression << additive-expression
8050 shift-expression >> additive-expression
8052 relational-expression:
8053 shift-expression
8054 relational-expression < shift-expression
8055 relational-expression > shift-expression
8056 relational-expression <= shift-expression
8057 relational-expression >= shift-expression
8059 GNU Extension:
8061 relational-expression:
8062 relational-expression <? shift-expression
8063 relational-expression >? shift-expression
8065 equality-expression:
8066 relational-expression
8067 equality-expression == relational-expression
8068 equality-expression != relational-expression
8070 and-expression:
8071 equality-expression
8072 and-expression & equality-expression
8074 exclusive-or-expression:
8075 and-expression
8076 exclusive-or-expression ^ and-expression
8078 inclusive-or-expression:
8079 exclusive-or-expression
8080 inclusive-or-expression | exclusive-or-expression
8082 logical-and-expression:
8083 inclusive-or-expression
8084 logical-and-expression && inclusive-or-expression
8086 logical-or-expression:
8087 logical-and-expression
8088 logical-or-expression || logical-and-expression
8090 All these are implemented with a single function like:
8092 binary-expression:
8093 simple-cast-expression
8094 binary-expression <token> binary-expression
8096 CAST_P is true if this expression is the target of a cast.
8098 The binops_by_token map is used to get the tree codes for each <token> type.
8099 binary-expressions are associated according to a precedence table. */
8101 #define TOKEN_PRECEDENCE(token) \
8102 (((token->type == CPP_GREATER \
8103 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8104 && !parser->greater_than_is_operator_p) \
8105 ? PREC_NOT_OPERATOR \
8106 : binops_by_token[token->type].prec)
8108 static tree
8114 {
8115 cp_parser_expression_stack stack;
8117 cp_parser_expression_stack_entry current;
8118 tree rhs;
8122 tree overload;
8124 /* Parse the first expression. */
8135 {
8136 /* Get an operator token. */
8142 {
8144 "%<>>%> operator is treated"
8148 }
8152 /* Popping an entry off the stack means we completed a subexpression:
8153 - either we found a token which is not an operator (`>' where it is not
8154 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8155 will happen repeatedly;
8156 - or, we found an operator which has lower priority. This is the case
8157 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8158 parsing `3 * 4'. */
8160 {
8163 else
8165 }
8167 get_rhs:
8171 /* We used the operator token. */
8174 /* For "false && x" or "true || x", x will never be executed;
8175 disable warnings while evaluating it. */
8181 /* Extract another operand. It may be the RHS of this expression
8182 or the LHS of a new, higher priority expression. */
8187 /* Get another operator token. Look up its precedence to avoid
8188 building a useless (immediately popped) stack entry for common
8189 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8193 {
8194 /* ... and prepare to parse the RHS of the new, higher priority
8195 expression. Since precedence levels on the stack are
8196 monotonically increasing, we do not have to care about
8197 stack overflows. */
8206 pop:
8208 /* If the stack is not empty, we have parsed into LHS the right side
8209 (`4' in the example above) of an expression we had suspended.
8210 We can use the information on the stack to recover the LHS (`3')
8211 from the stack together with the tree code (`MULT_EXPR'), and
8212 the precedence of the higher level subexpression
8213 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8214 which will be used to actually build the additive expression. */
8219 }
8221 /* Undo the disabling of warnings done above. */
8232 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8233 ERROR_MARK for everything that is not a binary expression.
8234 This makes warn_about_parentheses miss some warnings that
8235 involve unary operators. For unary expressions we should
8236 pass the correct tree_code unless the unary expression was
8237 surrounded by parentheses.
8238 */
8244 == tcc_comparison
8247 else
8256 /* If the binary operator required the use of an overloaded operator,
8257 then this expression cannot be an integral constant-expression.
8258 An overloaded operator can be used even if both operands are
8259 otherwise permissible in an integral constant-expression if at
8260 least one of the operands is of enumeration type. */
8264 NIC_OVERLOADED))
8266 }
8269 }
8271 static tree
8276 {
8279 }
8281 /* Parse the `? expression : assignment-expression' part of a
8282 conditional-expression. The LOGICAL_OR_EXPR is the
8283 logical-or-expression that started the conditional-expression.
8284 Returns a representation of the entire conditional-expression.
8286 This routine is used by cp_parser_assignment_expression.
8288 ? expression : assignment-expression
8290 GNU Extensions:
8292 ? : assignment-expression */
8294 static tree
8296 {
8297 tree expr;
8298 tree assignment_expr;
8302 /* Consume the `?' token. */
8307 {
8310 /* Implicit true clause. */
8314 }
8315 else
8316 {
8319 /* Parse the expression. */
8322 c_inhibit_evaluation_warnings +=
8326 }
8328 /* The next token should be a `:'. */
8330 /* Parse the assignment-expression. */
8334 /* Build the conditional-expression. */
8336 expr,
8337 assignment_expr,
8338 tf_warning_or_error);
8339 }
8341 /* Parse an assignment-expression.
8343 assignment-expression:
8344 conditional-expression
8345 logical-or-expression assignment-operator assignment_expression
8346 throw-expression
8348 CAST_P is true if this expression is the target of a cast.
8349 DECLTYPE_P is true if this expression is the operand of decltype.
8351 Returns a representation for the expression. */
8353 static tree
8356 {
8357 tree expr;
8359 /* If the next token is the `throw' keyword, then we're looking at
8360 a throw-expression. */
8363 /* Otherwise, it must be that we are looking at a
8364 logical-or-expression. */
8365 else
8366 {
8367 /* Parse the binary expressions (logical-or-expression). */
8369 decltype_p,
8371 /* If the next token is a `?' then we're actually looking at a
8372 conditional-expression. */
8375 else
8376 {
8379 /* If it's an assignment-operator, we're using the second
8380 production. */
8381 enum tree_code assignment_operator
8384 {
8386 location_t saved_input_location;
8388 /* Parse the right-hand side of the assignment. */
8394 /* An assignment may not appear in a
8395 constant-expression. */
8397 NIC_ASSIGNMENT))
8399 /* Build the assignment expression. Its default
8400 location is the location of the '=' token. */
8404 assignment_operator,
8405 rhs,
8408 }
8409 }
8410 }
8413 }
8415 /* Parse an (optional) assignment-operator.
8417 assignment-operator: one of
8418 = *= /= %= += -= >>= <<= &= ^= |=
8420 GNU Extension:
8422 assignment-operator: one of
8423 <?= >?=
8425 If the next token is an assignment operator, the corresponding tree
8426 code is returned, and the token is consumed. For example, for
8427 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8428 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8429 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8430 operator, ERROR_MARK is returned. */
8432 static enum tree_code
8434 {
8438 /* Peek at the next token. */
8442 {
8488 /* Nothing else is an assignment operator. */
8490 }
8492 /* If it was an assignment operator, consume it. */
8497 }
8499 /* Parse an expression.
8501 expression:
8502 assignment-expression
8503 expression , assignment-expression
8505 CAST_P is true if this expression is the target of a cast.
8506 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8507 except possibly parenthesized or on the RHS of a comma (N3276).
8509 Returns a representation of the expression. */
8511 static tree
8514 {
8519 {
8520 tree assignment_expression;
8522 /* Parse the next assignment-expression. */
8523 assignment_expression
8526 /* We don't create a temporary for a call that is the immediate operand
8527 of decltype or on the RHS of a comma. But when we see a comma, we
8528 need to create a temporary for a call on the LHS. */
8533 assignment_expression
8537 /* If this is the first assignment-expression, we can just
8538 save it away. */
8541 else
8543 assignment_expression,
8545 /* If the next token is not a comma, then we are done with the
8546 expression. */
8549 /* Consume the `,'. */
8552 /* A comma operator cannot appear in a constant-expression. */
8555 }
8558 }
8560 /* Parse a constant-expression.
8562 constant-expression:
8563 conditional-expression
8565 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8566 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8567 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8568 is false, NON_CONSTANT_P should be NULL. */
8570 static tree
8574 {
8578 tree expression;
8580 /* It might seem that we could simply parse the
8581 conditional-expression, and then check to see if it were
8582 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8583 one that the compiler can figure out is constant, possibly after
8584 doing some simplifications or optimizations. The standard has a
8585 precise definition of constant-expression, and we must honor
8586 that, even though it is somewhat more restrictive.
8588 For example:
8590 int i[(2, 3)];
8592 is not a legal declaration, because `(2, 3)' is not a
8593 constant-expression. The `,' operator is forbidden in a
8594 constant-expression. However, GCC's constant-folding machinery
8595 will fold this operation to an INTEGER_CST for `3'. */
8597 /* Save the old settings. */
8599 saved_allow_non_integral_constant_expression_p
8602 /* We are now parsing a constant-expression. */
8604 parser->allow_non_integral_constant_expression_p
8607 /* Although the grammar says "conditional-expression", we parse an
8608 "assignment-expression", which also permits "throw-expression"
8609 and the use of assignment operators. In the case that
8610 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8611 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8612 actually essential that we look for an assignment-expression.
8613 For example, cp_parser_initializer_clauses uses this function to
8614 determine whether a particular assignment-expression is in fact
8615 constant. */
8617 /* Restore the old settings. */
8618 parser->integral_constant_expression_p
8620 parser->allow_non_integral_constant_expression_p
8623 {
8624 /* Require an rvalue constant expression here; that's what our
8625 callers expect. Reference constant expressions are handled
8626 separately in e.g. cp_parser_template_argument. */
8631 }
8634 parser->non_integral_constant_expression_p
8638 }
8640 /* Parse __builtin_offsetof.
8642 offsetof-expression:
8643 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8645 offsetof-member-designator:
8646 id-expression
8647 | offsetof-member-designator "." id-expression
8648 | offsetof-member-designator "[" expression "]"
8649 | offsetof-member-designator "->" id-expression */
8651 static tree
8653 {
8656 cp_id_kind dummy;
8659 /* We're about to accept non-integral-constant things, but will
8660 definitely yield an integral constant expression. Save and
8661 restore these values around our local parsing. */
8665 /* Consume the "__builtin_offsetof" token. */
8667 /* Consume the opening `('. */
8669 /* Parse the type-id. */
8672 /* Look for the `,'. */
8676 /* Build the (type *)null that begins the traditional offsetof macro. */
8678 tf_warning_or_error);
8680 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8684 {
8687 {
8689 /* offsetof-member-designator "[" expression "]" */
8695 /* offsetof-member-designator "->" identifier */
8698 /* FALLTHRU */
8701 /* offsetof-member-designator "." identifier */
8709 /* Consume the ")" token. */
8714 /* Error. We know the following require will fail, but
8715 that gives the proper error message. */
8720 }
8721 }
8723 success:
8724 /* If we're processing a template, we can't finish the semantics yet.
8725 Otherwise we can fold the entire expression now. */
8727 {
8730 }
8731 else
8734 failure:
8739 }
8741 /* Parse a trait expression.
8743 Returns a representation of the expression, the underlying type
8744 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8746 static tree
8748 {
8749 cp_trait_kind kind;
8755 {
8839 }
8841 /* Consume the token. */
8852 {
8859 }
8861 {
8863 {
8867 {
8870 }
8874 }
8875 }
8879 /* Complete the trait expression, which may mean either processing
8880 the trait expr now or saving it for template instantiation. */
8882 {
8891 }
8892 }
8894 /* Lambdas that appear in variable initializer or default argument scope
8895 get that in their mangling, so we need to record it. We might as well
8896 use the count for function and namespace scopes as well. */
8900 {
8901 tree t;
8906 static void
8908 {
8909 tree_int ti;
8911 /* Once we're inside a function, we ignore other scopes and just push
8912 the function again so that popping works properly. */
8919 {
8920 /* Don't reset the count if we're still in the same function. */
8923 }
8924 }
8926 static void
8928 {
8931 }
8933 static void
8935 {
8938 {
8941 }
8943 }
8945 /* Parse a lambda expression.
8947 lambda-expression:
8948 lambda-introducer lambda-declarator [opt] compound-statement
8950 Returns a representation of the expression. */
8952 static tree
8954 {
8956 tree type;
8964 {
8966 {
8970 }
8972 }
8974 {
8976 {
8979 }
8981 }
8983 /* We may be in the middle of deferred access check. Disable
8984 it now. */
8995 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8998 /* Now that we've started the type, add the capture fields for any
8999 explicit captures. */
9002 {
9003 /* Inside the class, surrounding template-parameter-lists do not apply. */
9004 unsigned int saved_num_template_parameter_lists
9008 bool fully_implicit_function_template_p
9012 bool auto_is_implicit_function_template_parm_p
9023 /* By virtue of defining a local class, a lambda expression has access to
9024 the private variables of enclosing classes. */
9029 {
9035 }
9037 {
9040 }
9042 /* The capture list was built up in reverse order; fix that now. */
9054 parser->fully_implicit_function_template_p
9058 parser->auto_is_implicit_function_template_parm_p
9060 }
9064 /* This field is only used during parsing of the lambda. */
9067 /* This lambda shouldn't have any proxies left at this point. */
9069 /* And now that we're done, push proxies for an enclosing lambda. */
9074 else
9080 }
9082 /* Parse the beginning of a lambda expression.
9084 lambda-introducer:
9085 [ lambda-capture [opt] ]
9087 LAMBDA_EXPR is the current representation of the lambda expression. */
9089 static void
9091 {
9092 /* Need commas after the first capture. */
9095 /* Eat the leading `['. */
9098 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9106 {
9109 }
9112 {
9114 tree capture_id;
9115 tree capture_init_expr;
9119 enum capture_kind_type
9120 {
9121 BY_COPY,
9122 BY_REFERENCE
9123 };
9127 {
9130 }
9134 else
9137 /* Possibly capture `this'. */
9139 {
9149 explicit_init_p);
9151 }
9153 /* Remember whether we want to capture as a reference or not. */
9155 {
9158 }
9160 /* Get the identifier. */
9165 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9166 delimiters, but I modified this to stop on unnested ']' as well. It
9167 was already changed to stop on unnested '}', so the
9168 "closing_parenthesis" name is no more misleading with my change. */
9169 {
9175 }
9177 /* Find the initializer for this capture. */
9181 {
9183 /* An explicit initializer exists. */
9186 "lambda capture initializers "
9192 {
9195 }
9196 }
9197 else
9198 {
9201 /* Turn the identifier into an id-expression. */
9202 capture_init_expr
9207 {
9210 }
9214 {
9217 capture_init_expr);
9220 }
9223 {
9226 capture_init_expr))
9229 }
9231 capture_init_expr
9232 = finish_id_expression
9234 capture_init_expr,
9248 {
9251 }
9252 else
9254 }
9258 {
9263 capture_id);
9267 "capture of %qD redundant with by-reference capture "
9269 }
9272 capture_id,
9273 capture_init_expr,
9275 explicit_init_p);
9276 }
9279 }
9281 /* Parse the (optional) middle of a lambda expression.
9283 lambda-declarator:
9284 < template-parameter-list [opt] >
9285 ( parameter-declaration-clause [opt] )
9286 attribute-specifier [opt]
9287 mutable [opt]
9288 exception-specification [opt]
9289 lambda-return-type-clause [opt]
9291 LAMBDA_EXPR is the current representation of the lambda expression. */
9293 static bool
9295 {
9296 /* 5.1.1.4 of the standard says:
9297 If a lambda-expression does not include a lambda-declarator, it is as if
9298 the lambda-declarator were ().
9299 This means an empty parameter list, no attributes, and no exception
9300 specification. */
9306 /* The template-parameter-list is optional, but must begin with
9307 an opening angle if present. */
9309 {
9312 "lambda templates are only available with "
9321 /* We just processed one more parameter list. */
9323 }
9325 /* The parameter-declaration-clause is optional (unless
9326 template-parameter-list was given), but must begin with an
9327 opening parenthesis if present. */
9329 {
9334 /* Parse parameters. */
9337 /* Default arguments shall not be specified in the
9338 parameter-declaration-clause of a lambda-declarator. */
9348 /* Parse optional `mutable' keyword. */
9350 {
9353 }
9355 /* Parse optional exception specification. */
9358 /* Parse optional trailing return type. */
9360 {
9364 }
9366 /* The function parameters must be in scope all the way until after the
9367 trailing-return-type in case of decltype. */
9369 }
9373 /* Create the function call operator.
9375 Messing with declarators like this is no uglier than building up the
9376 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9377 other code. */
9378 {
9379 cp_decl_specifier_seq return_type_specs;
9381 tree fco;
9388 else
9389 /* Maybe we will deduce the return type later. */
9395 sfk_none);
9400 VIRT_SPEC_UNSPECIFIED,
9401 REF_QUAL_NONE,
9402 exception_spec,
9407 declarator,
9408 attributes);
9410 {
9413 /* Give the object parameter a different name. */
9417 }
9419 {
9423 }
9432 }
9433 }
9435 /* Parse the body of a lambda expression, which is simply
9437 compound-statement
9439 but which requires special handling.
9440 LAMBDA_EXPR is the current representation of the lambda expression. */
9442 static void
9444 {
9449 else
9450 /* Still increment function_depth so that we don't GC in the
9451 middle of an expression. */
9453 /* Clear this in case we're in the middle of a default argument. */
9456 /* Finish the function call operator
9457 - class_specifier
9458 + late_parsing_for_member
9459 + function_definition_after_declarator
9460 + ctor_initializer_opt_and_function_body */
9461 {
9463 tree body;
9465 tree compound_stmt;
9466 tree cap;
9468 /* Let the front end know that we are going to be defining this
9469 function. */
9471 NULL_TREE,
9480 /* Push the proxies for any explicit captures. */
9487 /* 5.1.1.4 of the standard says:
9488 If a lambda-expression does not include a trailing-return-type, it
9489 is as if the trailing-return-type denotes the following type:
9490 * if the compound-statement is of the form
9491 { return attribute-specifier [opt] expression ; }
9492 the type of the returned expression after lvalue-to-rvalue
9493 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9494 (_conv.array_ 4.2), and function-to-pointer conversion
9495 (_conv.func_ 4.3);
9496 * otherwise, void. */
9498 /* In a lambda that has neither a lambda-return-type-clause
9499 nor a deducible form, errors should be reported for return statements
9500 in the body. Since we used void as the placeholder return type, parsing
9501 the body as usual will give such desired behavior. */
9505 {
9509 /* Parse tentatively in case there's more after the initial return
9510 statement. */
9521 {
9525 /* Will get error here if type not deduced yet. */
9529 }
9530 }
9533 {
9538 }
9542 out:
9546 /* Finish the function and generate code for it if necessary. */
9549 /* Only expand if the call op is not a template. */
9552 }
9557 else
9559 }
9561 /* Statements [gram.stmt.stmt] */
9563 /* Parse a statement.
9565 statement:
9566 labeled-statement
9567 expression-statement
9568 compound-statement
9569 selection-statement
9570 iteration-statement
9571 jump-statement
9572 declaration-statement
9573 try-block
9575 C++11:
9577 statement:
9578 labeled-statement
9579 attribute-specifier-seq (opt) expression-statement
9580 attribute-specifier-seq (opt) compound-statement
9581 attribute-specifier-seq (opt) selection-statement
9582 attribute-specifier-seq (opt) iteration-statement
9583 attribute-specifier-seq (opt) jump-statement
9584 declaration-statement
9585 attribute-specifier-seq (opt) try-block
9587 TM Extension:
9589 statement:
9590 atomic-statement
9592 IN_COMPOUND is true when the statement is nested inside a
9593 cp_parser_compound_statement; this matters for certain pragmas.
9595 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9596 is a (possibly labeled) if statement which is not enclosed in braces
9597 and has an else clause. This is used to implement -Wparentheses. */
9599 static void
9602 {
9607 restart:
9610 /* There is no statement yet. */
9616 /* In obj-c++, seeing '[[' might be the either the beginning of
9617 c++11 attributes, or a nested objc-message-expression. So
9618 let's parse the c++11 attributes tentatively. */
9622 {
9625 }
9627 /* Peek at the next token. */
9629 /* Remember the location of the first token in the statement. */
9631 /* If this is a keyword, then that will often determine what kind of
9632 statement we have. */
9634 {
9638 {
9641 /* Looks like a labeled-statement with a case label.
9642 Parse the label, and then use tail recursion to parse
9643 the statement. */
9660 {
9665 }
9666 else
9680 {
9685 }
9686 else
9687 {
9691 }
9695 /* Objective-C++ exception-handling constructs. */
9709 /* This must be a namespace alias definition. */
9722 /* It might be a keyword like `int' that can start a
9723 declaration-statement. */
9725 }
9726 }
9728 {
9729 /* If the next token is a `:', then we are looking at a
9730 labeled-statement. */
9733 {
9734 /* Looks like a labeled-statement with an ordinary label.
9735 Parse the label, and then use tail recursion to parse
9736 the statement. */
9740 }
9741 }
9742 /* Anything that starts with a `{' must be a compound-statement. */
9745 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9746 a statement all its own. */
9748 {
9749 /* Only certain OpenMP pragmas are attached to statements, and thus
9750 are considered statements themselves. All others are not. In
9751 the context of a compound, accept the pragma as a "statement" and
9752 return so that we can check for a close brace. Otherwise we
9753 require a real statement and must go back and read one. */
9759 }
9761 {
9764 }
9766 /* Everything else must be a declaration-statement or an
9767 expression-statement. Try for the declaration-statement
9768 first, unless we are looking at a `;', in which case we know that
9769 we have an expression-statement. */
9771 {
9773 {
9775 {
9776 /* Attributes should be parsed as part of the the
9777 declaration, so let's un-parse them. */
9780 }
9783 /* Try to parse the declaration-statement. */
9785 /* If that worked, we're done. */
9788 }
9789 /* Look for an expression-statement instead. */
9791 }
9793 /* Set the line number for the statement. */
9797 /* Note that for now, we don't do anything with c++11 statements
9798 parsed at this level. */
9801 OPT_Wattributes,
9803 }
9805 /* Parse the label for a labeled-statement, i.e.
9807 identifier :
9808 case constant-expression :
9809 default :
9811 GNU Extension:
9812 case constant-expression ... constant-expression : statement
9814 When a label is parsed without errors, the label is added to the
9815 parse tree by the finish_* functions, so this function doesn't
9816 have to return the label. */
9818 static void
9820 {
9825 /* The next token should be an identifier. */
9829 {
9832 }
9836 {
9838 {
9842 /* Consume the `case' token. */
9844 /* Parse the constant-expression. */
9851 {
9852 /* Consume the `...' token. */
9858 /* We don't need to emit warnings here, as the common code
9859 will do this for us. */
9860 }
9861 else
9866 else
9869 expr);
9870 }
9874 /* Consume the `default' token. */
9879 else
9884 /* Anything else must be an ordinary label. */
9887 }
9889 /* Require the `:' token. */
9892 /* An ordinary label may optionally be followed by attributes.
9893 However, this is only permitted if the attributes are then
9894 followed by a semicolon. This is because, for backward
9895 compatibility, when parsing
9896 lab: __attribute__ ((unused)) int i;
9897 we want the attribute to attach to "i", not "lab". */
9900 {
9901 tree attrs;
9908 ;
9909 else
9911 }
9917 }
9919 /* Parse an expression-statement.
9921 expression-statement:
9922 expression [opt] ;
9924 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9925 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9926 indicates whether this expression-statement is part of an
9927 expression statement. */
9929 static tree
9931 {
9935 /* If the next token is a ';', then there is no expression
9936 statement. */
9938 {
9942 {
9945 }
9946 }
9948 /* Give a helpful message for "A<T>::type t;" and the like. */
9951 {
9958 {
9959 /* A::A a; */
9964 }
9965 }
9967 /* Consume the final `;'. */
9972 /* This is the final expression statement of a statement
9973 expression. */
9979 }
9981 /* Parse a compound-statement.
9983 compound-statement:
9984 { statement-seq [opt] }
9986 GNU extension:
9988 compound-statement:
9989 { label-declaration-seq [opt] statement-seq [opt] }
9991 label-declaration-seq:
9992 label-declaration
9993 label-declaration-seq label-declaration
9995 Returns a tree representing the statement. */
9997 static tree
10000 {
10001 tree compound_stmt;
10003 /* Consume the `{'. */
10010 /* Begin the compound-statement. */
10012 /* If the next keyword is `__label__' we have a label declaration. */
10015 /* Parse an (optional) statement-seq. */
10017 /* Finish the compound-statement. */
10019 /* Consume the `}'. */
10023 }
10025 /* Parse an (optional) statement-seq.
10027 statement-seq:
10028 statement
10029 statement-seq [opt] statement */
10031 static void
10033 {
10034 /* Scan statements until there aren't any more. */
10036 {
10039 /* If we are looking at a `}', then we have run out of
10040 statements; the same is true if we have reached the end
10041 of file, or have stumbled upon a stray '@end'. */
10048 /* If we are in a compound statement and find 'else' then
10049 something went wrong. */
10051 {
10054 else
10055 {
10058 }
10059 }
10061 /* Parse the statement. */
10063 }
10064 }
10066 /* Parse a selection-statement.
10068 selection-statement:
10069 if ( condition ) statement
10070 if ( condition ) statement else statement
10071 switch ( condition ) statement
10073 Returns the new IF_STMT or SWITCH_STMT.
10075 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10076 is a (possibly labeled) if statement which is not enclosed in
10077 braces and has an else clause. This is used to implement
10078 -Wparentheses. */
10080 static tree
10082 {
10089 /* Peek at the next token. */
10092 /* See what kind of keyword it is. */
10095 {
10098 {
10099 tree statement;
10100 tree condition;
10102 /* Look for the `('. */
10104 {
10107 }
10109 /* Begin the selection-statement. */
10112 else
10115 /* Parse the condition. */
10117 /* Look for the `)'. */
10123 {
10127 /* Add the condition. */
10130 /* Parse the then-clause. */
10134 {
10142 }
10143 else
10149 /* If the next token is `else', parse the else-clause. */
10151 RID_ELSE))
10152 {
10153 /* Consume the `else' keyword. */
10156 /* Parse the else-clause. */
10158 {
10159 location_t loc;
10166 }
10167 else
10172 /* If we are currently parsing a then-clause, then
10173 IF_P will not be NULL. We set it to true to
10174 indicate that this if statement has an else clause.
10175 This may trigger the Wparentheses warning below
10176 when we get back up to the parent if statement. */
10179 }
10180 else
10181 {
10182 /* This if statement does not have an else clause. If
10183 NESTED_IF is true, then the then-clause is an if
10184 statement which does have an else clause. We warn
10185 about the potential ambiguity. */
10188 "suggest explicit braces to avoid ambiguous"
10190 }
10192 /* Now we're all done with the if-statement. */
10194 }
10195 else
10196 {
10200 /* Add the condition. */
10203 /* Parse the body of the switch-statement. */
10212 /* Now we're all done with the switch-statement. */
10214 }
10217 }
10223 }
10224 }
10226 /* Parse a condition.
10228 condition:
10229 expression
10230 type-specifier-seq declarator = initializer-clause
10231 type-specifier-seq declarator braced-init-list
10233 GNU Extension:
10235 condition:
10236 type-specifier-seq declarator asm-specification [opt]
10237 attributes [opt] = assignment-expression
10239 Returns the expression that should be tested. */
10241 static tree
10243 {
10244 cp_decl_specifier_seq type_specifiers;
10248 /* Try the declaration first. */
10250 /* New types are not allowed in the type-specifier-seq for a
10251 condition. */
10253 parser->type_definition_forbidden_message
10255 /* Parse the type-specifier-seq. */
10257 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10260 /* Restore the saved message. */
10262 /* If all is well, we might be looking at a declaration. */
10264 {
10265 tree decl;
10266 tree asm_specification;
10267 tree attributes;
10271 /* Parse the declarator. */
10277 /* Parse the attributes. */
10279 /* Parse the asm-specification. */
10281 /* If the next token is not an `=' or '{', then we might still be
10282 looking at an expression. For example:
10284 if (A(a).x)
10286 looks like a decl-specifier-seq and a declarator -- but then
10287 there is no `=', so this is an expression. */
10292 /* If we did see an `=' or '{', then we are looking at a declaration
10293 for sure. */
10295 {
10296 tree pushed_scope;
10300 /* Create the declaration. */
10306 /* Parse the initializer. */
10308 {
10312 }
10313 else
10314 {
10315 /* Consume the `='. */
10318 }
10322 /* Process the initializer. */
10325 asm_specification,
10326 flags);
10332 }
10333 }
10334 /* If we didn't even get past the declarator successfully, we are
10335 definitely not looking at a declaration. */
10336 else
10339 /* Otherwise, we are looking at an expression. */
10341 }
10343 /* Parses a for-statement or range-for-statement until the closing ')',
10344 not included. */
10346 static tree
10348 {
10352 /* Begin the for-statement. */
10355 /* Parse the initialization. */
10360 else
10362 }
10364 static tree
10366 {
10367 /* Normal for loop */
10370 tree stmt;
10373 /* The for-init-statement has already been parsed in
10374 cp_parser_for_init_statement, so no work is needed here. */
10377 /* If there's a condition, process it. */
10381 {
10385 }
10387 /* Look for the `;'. */
10390 /* If there's an expression, process it. */
10396 }
10398 /* Tries to parse a range-based for-statement:
10400 range-based-for:
10401 decl-specifier-seq declarator : expression
10403 The decl-specifier-seq declarator and the `:' are already parsed by
10404 cp_parser_for_init_statement. If processing_template_decl it returns a
10405 newly created RANGE_FOR_STMT; if not, it is converted to a
10406 regular FOR_STMT. */
10408 static tree
10411 {
10415 {
10418 }
10419 else
10422 /* If in template, STMT is converted to a normal for-statement
10423 at instantiation. If not, it is done just ahead. */
10425 {
10433 /* do_auto_deduction doesn't mess with template init-lists. */
10436 }
10437 else
10438 {
10441 }
10443 }
10445 /* Subroutine of cp_convert_range_for: given the initializer expression,
10446 builds up the range temporary. */
10448 static tree
10450 {
10453 /* Find out the type deduced by the declaration
10454 `auto &&__range = range_expr'. */
10459 /* Create the __range variable. */
10466 }
10468 /* Used by cp_parser_range_for in template context: we aren't going to
10469 do a full conversion yet, but we still need to resolve auto in the
10470 type of the for-range-declaration if present. This is basically
10471 a shortcut version of cp_convert_range_for. */
10473 static void
10475 {
10478 {
10481 iter_type = (cp_parser_perform_range_for_lookup
10484 {
10486 iter_type);
10488 tf_warning_or_error);
10491 }
10492 }
10493 }
10495 /* Converts a range-based for-statement into a normal
10496 for-statement, as per the definition.
10498 for (RANGE_DECL : RANGE_EXPR)
10499 BLOCK
10501 should be equivalent to:
10503 {
10504 auto &&__range = RANGE_EXPR;
10505 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10506 __begin != __end;
10507 ++__begin)
10508 {
10509 RANGE_DECL = *__begin;
10510 BLOCK
10511 }
10512 }
10514 If RANGE_EXPR is an array:
10515 BEGIN_EXPR = __range
10516 END_EXPR = __range + ARRAY_SIZE(__range)
10517 Else if RANGE_EXPR has a member 'begin' or 'end':
10518 BEGIN_EXPR = __range.begin()
10519 END_EXPR = __range.end()
10520 Else:
10521 BEGIN_EXPR = begin(__range)
10522 END_EXPR = end(__range);
10524 If __range has a member 'begin' but not 'end', or vice versa, we must
10525 still use the second alternative (it will surely fail, however).
10526 When calling begin()/end() in the third alternative we must use
10527 argument dependent lookup, but always considering 'std' as an associated
10528 namespace. */
10530 tree
10533 {
10539 /* If an error happened previously do nothing or else a lot of
10540 unhelpful errors would be issued. */
10542 else
10543 {
10544 tree range_temp;
10548 /* Can't bind a reference to an array of runtime bound. */
10550 else
10551 {
10556 LOOKUP_ONLYCONVERTING);
10558 }
10561 }
10563 /* The new for initialization statement. */
10571 LOOKUP_ONLYCONVERTING);
10580 LOOKUP_ONLYCONVERTING);
10584 /* The new for condition. */
10591 /* The new increment expression. */
10594 tf_warning_or_error);
10597 /* The declaration is initialized with *__begin inside the loop body. */
10600 tf_warning_or_error),
10602 LOOKUP_ONLYCONVERTING);
10605 }
10607 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10608 We need to solve both at the same time because the method used
10609 depends on the existence of members begin or end.
10610 Returns the type deduced for the iterator expression. */
10612 static tree
10614 {
10616 {
10619 }
10622 {
10627 }
10629 {
10630 /* If RANGE is an array, we will use pointer arithmetic. */
10633 range,
10637 }
10638 else
10639 {
10640 /* If it is not an array, we must do a bit of magic. */
10650 tf_warning_or_error);
10653 tf_warning_or_error);
10656 {
10657 /* Use the member functions. */
10660 else
10666 else
10669 }
10670 else
10671 {
10672 /* Use global functions with ADL. */
10679 tf_warning_or_error);
10681 tf_warning_or_error);
10683 tf_warning_or_error);
10685 tf_warning_or_error);
10688 }
10690 /* Last common checks. */
10692 {
10693 /* If one of the expressions is an error do no more checks. */
10696 }
10699 /* Can happen, when, eg, in a template context, Koenig lookup
10700 can't resolve begin/end (c++/58503). */
10702 else
10703 {
10705 /* The unqualified type of the __begin and __end temporaries should
10706 be the same, as required by the multiple auto declaration. */
10712 }
10713 }
10714 }
10716 /* Helper function for cp_parser_perform_range_for_lookup.
10717 Builds a tree for RANGE.IDENTIFIER(). */
10719 static tree
10721 {
10734 tf_warning_or_error);
10737 }
10739 /* Parse an iteration-statement.
10741 iteration-statement:
10742 while ( condition ) statement
10743 do statement while ( expression ) ;
10744 for ( for-init-statement condition [opt] ; expression [opt] )
10745 statement
10747 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10749 static tree
10751 {
10754 tree statement;
10757 /* Peek at the next token. */
10762 /* Remember whether or not we are already within an iteration
10763 statement. */
10766 /* See what kind of keyword it is. */
10769 {
10771 {
10772 tree condition;
10774 /* Begin the while-statement. */
10776 /* Look for the `('. */
10778 /* Parse the condition. */
10781 /* Look for the `)'. */
10783 /* Parse the dependent statement. */
10787 /* We're done with the while-statement. */
10789 }
10793 {
10794 tree expression;
10796 /* Begin the do-statement. */
10798 /* Parse the body of the do-statement. */
10803 /* Look for the `while' keyword. */
10805 /* Look for the `('. */
10807 /* Parse the expression. */
10809 /* We're done with the do-statement. */
10811 /* Look for the `)'. */
10813 /* Look for the `;'. */
10815 }
10819 {
10820 /* Look for the `('. */
10825 /* Look for the `)'. */
10828 /* Parse the body of the for-statement. */
10833 /* We're done with the for-statement. */
10835 }
10842 }
10845 }
10847 /* Parse a for-init-statement or the declarator of a range-based-for.
10848 Returns true if a range-based-for declaration is seen.
10850 for-init-statement:
10851 expression-statement
10852 simple-declaration */
10854 static bool
10856 {
10857 /* If the next token is a `;', then we have an empty
10858 expression-statement. Grammatically, this is also a
10859 simple-declaration, but an invalid one, because it does not
10860 declare anything. Therefore, if we did not handle this case
10861 specially, we would issue an error message about an invalid
10862 declaration. */
10864 {
10870 {
10871 /* N3994 -- for (id : init) ... */
10874 "type-specifier only available with "
10882 }
10884 /* A colon is used in range-based for. */
10887 /* We're going to speculatively look for a declaration, falling back
10888 to an expression, if necessary. */
10890 /* Parse the declaration. */
10893 decl);
10896 {
10897 /* It is a range-for, consume the ':' */
10901 {
10903 "range-based %<for%> loops only available with "
10906 }
10907 }
10908 else
10909 /* The ';' is not consumed yet because we told
10910 cp_parser_simple_declaration not to. */
10915 /* If the tentative parse failed, then we shall need to look for an
10916 expression-statement. */
10917 }
10918 /* If we are here, it is an expression-statement. */
10921 }
10923 /* Parse a jump-statement.
10925 jump-statement:
10926 break ;
10927 continue ;
10928 return expression [opt] ;
10929 return braced-init-list ;
10930 goto identifier ;
10932 GNU extension:
10934 jump-statement:
10935 goto * expression ;
10937 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10939 static tree
10941 {
10947 /* Peek at the next token. */
10952 /* See what kind of keyword it is. */
10955 {
10959 {
10979 }
10985 {
10992 /* Fall through. */
11002 }
11007 {
11008 tree expr;
11012 {
11016 }
11019 else
11020 /* If the next token is a `;', then there is no
11021 expression. */
11023 /* Build the return-statement. */
11025 /* Look for the final `;'. */
11027 }
11033 {
11036 }
11038 /* Create the goto-statement. */
11040 {
11041 /* Issue a warning about this use of a GNU extension. */
11043 /* Consume the '*' token. */
11045 /* Parse the dependent expression. */
11047 }
11048 else
11050 /* Look for the final `;'. */
11057 }
11060 }
11062 /* Parse a declaration-statement.
11064 declaration-statement:
11065 block-declaration */
11067 static void
11069 {
11072 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11075 /* Parse the block-declaration. */
11078 /* Free any declarators allocated. */
11080 }
11082 /* Some dependent statements (like `if (cond) statement'), are
11083 implicitly in their own scope. In other words, if the statement is
11084 a single statement (as opposed to a compound-statement), it is
11085 none-the-less treated as if it were enclosed in braces. Any
11086 declarations appearing in the dependent statement are out of scope
11087 after control passes that point. This function parses a statement,
11088 but ensures that is in its own scope, even if it is not a
11089 compound-statement.
11091 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11092 is a (possibly labeled) if statement which is not enclosed in
11093 braces and has an else clause. This is used to implement
11094 -Wparentheses.
11096 Returns the new statement. */
11098 static tree
11100 {
11101 tree statement;
11106 /* Mark if () ; with a special NOP_EXPR. */
11108 {
11112 }
11113 /* if a compound is opened, we simply parse the statement directly. */
11116 /* If the token is not a `{', then we must take special action. */
11117 else
11118 {
11119 /* Create a compound-statement. */
11121 /* Parse the dependent-statement. */
11123 /* Finish the dummy compound-statement. */
11125 }
11127 /* Return the statement. */
11129 }
11131 /* For some dependent statements (like `while (cond) statement'), we
11132 have already created a scope. Therefore, even if the dependent
11133 statement is a compound-statement, we do not want to create another
11134 scope. */
11136 static void
11138 {
11139 /* If the token is a `{', then we must take special action. */
11142 else
11143 {
11144 /* Avoid calling cp_parser_compound_statement, so that we
11145 don't create a new scope. Do everything else by hand. */
11147 /* If the next keyword is `__label__' we have a label declaration. */
11150 /* Parse an (optional) statement-seq. */
11153 }
11154 }
11156 /* Declarations [gram.dcl.dcl] */
11158 /* Parse an optional declaration-sequence.
11160 declaration-seq:
11161 declaration
11162 declaration-seq declaration */
11164 static void
11166 {
11168 {
11179 {
11180 /* A declaration consisting of a single semicolon is
11181 invalid. Allow it unless we're being pedantic. */
11186 }
11188 /* If we're entering or exiting a region that's implicitly
11189 extern "C", modify the lang context appropriately. */
11191 {
11194 }
11196 {
11199 }
11202 {
11203 /* A top-level declaration can consist solely of a #pragma.
11204 A nested declaration cannot, so this is done here and not
11205 in cp_parser_declaration. (A #pragma at block scope is
11206 handled in cp_parser_statement.) */
11209 }
11211 /* Parse the declaration itself. */
11213 }
11214 }
11216 /* Parse a declaration.
11218 declaration:
11219 block-declaration
11220 function-definition
11221 template-declaration
11222 explicit-instantiation
11223 explicit-specialization
11224 linkage-specification
11225 namespace-definition
11227 GNU extension:
11229 declaration:
11230 __extension__ declaration */
11232 static void
11234 {
11235 cp_token token1;
11236 cp_token token2;
11241 /* Check for the `__extension__' keyword. */
11243 {
11244 /* Parse the qualified declaration. */
11246 /* Restore the PEDANTIC flag. */
11250 }
11252 /* Try to figure out what kind of declaration is present. */
11257 else
11258 {
11261 }
11263 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11266 /* If the next token is `extern' and the following token is a string
11267 literal, then we have a linkage specification. */
11271 /* If the next token is `template', then we have either a template
11272 declaration, an explicit instantiation, or an explicit
11273 specialization. */
11275 {
11276 /* `template <>' indicates a template specialization. */
11280 /* `template <' indicates a template declaration. */
11283 /* Anything else must be an explicit instantiation. */
11284 else
11286 }
11287 /* If the next token is `export', then we have a template
11288 declaration. */
11291 /* If the next token is `extern', 'static' or 'inline' and the one
11292 after that is `template', we have a GNU extended explicit
11293 instantiation directive. */
11300 /* If the next token is `namespace', check for a named or unnamed
11301 namespace definition. */
11307 /* An unnamed namespace definition. */
11311 /* An inline (associated) namespace definition. */
11315 /* Objective-C++ declaration/definition. */
11322 /* We must have either a block declaration or a function
11323 definition. */
11324 else
11325 /* Try to parse a block-declaration, or a function-definition. */
11328 /* Free any declarators allocated. */
11330 }
11332 /* Parse a block-declaration.
11334 block-declaration:
11335 simple-declaration
11336 asm-definition
11337 namespace-alias-definition
11338 using-declaration
11339 using-directive
11341 GNU Extension:
11343 block-declaration:
11344 __extension__ block-declaration
11346 C++0x Extension:
11348 block-declaration:
11349 static_assert-declaration
11351 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11352 part of a declaration-statement. */
11354 static void
11357 {
11361 /* Check for the `__extension__' keyword. */
11363 {
11364 /* Parse the qualified declaration. */
11366 /* Restore the PEDANTIC flag. */
11370 }
11372 /* Peek at the next token to figure out which kind of declaration is
11373 present. */
11376 /* If the next keyword is `asm', we have an asm-definition. */
11378 {
11382 }
11383 /* If the next keyword is `namespace', we have a
11384 namespace-alias-definition. */
11387 /* If the next keyword is `using', we have a
11388 using-declaration, a using-directive, or an alias-declaration. */
11390 {
11395 /* If the token after `using' is `namespace', then we have a
11396 using-directive. */
11400 /* If the second token after 'using' is '=', then we have an
11401 alias-declaration. */
11407 /* Otherwise, it's a using-declaration. */
11408 else
11411 }
11412 /* If the next keyword is `__label__' we have a misplaced label
11413 declaration. */
11415 {
11419 /* If the next token is now a `;', consume it. */
11422 }
11423 /* If the next token is `static_assert' we have a static assertion. */
11426 /* Anything else must be a simple-declaration. */
11427 else
11430 }
11432 /* Parse a simple-declaration.
11434 simple-declaration:
11435 decl-specifier-seq [opt] init-declarator-list [opt] ;
11437 init-declarator-list:
11438 init-declarator
11439 init-declarator-list , init-declarator
11441 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11442 function-definition as a simple-declaration.
11444 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11445 parsed declaration if it is an uninitialized single declarator not followed
11446 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11447 if present, will not be consumed. */
11449 static void
11453 {
11454 cp_decl_specifier_seq decl_specifiers;
11461 /* Defer access checks until we know what is being declared; the
11462 checks for names appearing in the decl-specifier-seq should be
11463 done as if we were in the scope of the thing being declared. */
11466 /* Parse the decl-specifier-seq. We have to keep track of whether
11467 or not the decl-specifier-seq declares a named class or
11468 enumeration type, since that is the only case in which the
11469 init-declarator-list is allowed to be empty.
11471 [dcl.dcl]
11473 In a simple-declaration, the optional init-declarator-list can be
11474 omitted only when declaring a class or enumeration, that is when
11475 the decl-specifier-seq contains either a class-specifier, an
11476 elaborated-type-specifier, or an enum-specifier. */
11478 CP_PARSER_FLAGS_OPTIONAL,
11481 /* We no longer need to defer access checks. */
11484 /* In a block scope, a valid declaration must always have a
11485 decl-specifier-seq. By not trying to parse declarators, we can
11486 resolve the declaration/expression ambiguity more quickly. */
11489 {
11492 }
11494 /* If the next two tokens are both identifiers, the code is
11495 erroneous. The usual cause of this situation is code like:
11497 T t;
11499 where "T" should name a type -- but does not. */
11502 {
11503 /* If parsing tentatively, we should commit; we really are
11504 looking at a declaration. */
11506 /* Give up. */
11508 }
11510 /* If we have seen at least one decl-specifier, and the next token
11511 is not a parenthesis, then we must be looking at a declaration.
11512 (After "int (" we might be looking at a functional cast.) */
11519 /* Keep going until we hit the `;' at the end of the simple
11520 declaration. */
11523 CPP_SEMICOLON))
11524 {
11527 tree decl;
11530 {
11531 /* If we are processing next declarator, coma is expected */
11537 }
11538 else
11541 /* Parse the init-declarator. */
11544 function_definition_allowed_p,
11546 declares_class_or_enum,
11548 maybe_range_for_decl);
11549 /* If an error occurred while parsing tentatively, exit quickly.
11550 (That usually happens when in the body of a function; each
11551 statement is treated as a declaration-statement until proven
11552 otherwise.) */
11555 /* Handle function definitions specially. */
11557 {
11558 /* If the next token is a `,', then we are probably
11559 processing something like:
11561 void f() {}, *p;
11563 which is erroneous. */
11565 {
11568 "mixing"
11570 }
11571 /* Otherwise, we're done with the list of declarators. */
11572 else
11573 {
11576 }
11577 }
11580 /* The next token should be either a `,' or a `;'. */
11582 /* If it's a `,', there are more declarators to come. */
11585 /* If it's a `;', we are done. */
11588 /* Anything else is an error. */
11589 else
11590 {
11591 /* If we have already issued an error message we don't need
11592 to issue another one. */
11596 /* Skip tokens until we reach the end of the statement. */
11598 /* If the next token is now a `;', consume it. */
11602 }
11603 /* After the first time around, a function-definition is not
11604 allowed -- even if it was OK at first. For example:
11606 int i, f() {}
11608 is not valid. */
11610 }
11612 /* Issue an error message if no declarators are present, and the
11613 decl-specifier-seq does not itself declare a class or
11614 enumeration: [dcl.dcl]/3. */
11616 {
11618 {
11622 /* Ensure an error is issued anyway when finish_decltype_type,
11623 called via cp_parser_decl_specifier_seq, returns a class or
11624 an enumeration (c++/51786). */
11627 }
11628 /* Perform any deferred access checks. */
11630 }
11632 /* Consume the `;'. */
11636 done:
11638 }
11640 /* Parse a decl-specifier-seq.
11642 decl-specifier-seq:
11643 decl-specifier-seq [opt] decl-specifier
11644 decl-specifier attribute-specifier-seq [opt] (C++11)
11646 decl-specifier:
11647 storage-class-specifier
11648 type-specifier
11649 function-specifier
11650 friend
11651 typedef
11653 GNU Extension:
11655 decl-specifier:
11656 attributes
11658 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11660 The parser flags FLAGS is used to control type-specifier parsing.
11662 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11663 flags:
11665 1: one of the decl-specifiers is an elaborated-type-specifier
11666 (i.e., a type declaration)
11667 2: one of the decl-specifiers is an enum-specifier or a
11668 class-specifier (i.e., a type definition)
11670 */
11672 static void
11674 cp_parser_flags flags,
11677 {
11681 cp_decl_spec ds;
11683 /* Clear DECL_SPECS. */
11686 /* Assume no class or enumeration type is declared. */
11689 /* Keep reading specifiers until there are no more to read. */
11691 {
11696 /* Peek at the next token. */
11699 /* Save the first token of the decl spec list for error
11700 reporting. */
11703 /* Handle attributes. */
11705 {
11706 /* Parse the attributes. */
11709 /* In a sequence of declaration specifiers, c++11 attributes
11710 appertain to the type that precede them. In that case
11711 [dcl.spec]/1 says:
11713 The attribute-specifier-seq affects the type only for
11714 the declaration it appears in, not other declarations
11715 involving the same type.
11717 But for now let's force the user to position the
11718 attribute either at the beginning of the declaration or
11719 after the declarator-id, which would clearly mean that it
11720 applies to the declarator. */
11722 {
11724 /* The c++11 attribute is at the beginning of the
11725 declaration. It appertains to the entity being
11727 else
11728 {
11730 {
11731 /* This is an attribute following a
11732 class-specifier. */
11737 }
11738 else
11739 {
11740 decl_specs->std_attributes
11742 attrs);
11745 }
11747 }
11748 }
11750 decl_specs->attributes
11752 attrs);
11756 }
11757 /* Assume we will find a decl-specifier keyword. */
11759 /* If the next token is an appropriate keyword, we can simply
11760 add it to the list. */
11762 {
11763 /* decl-specifier:
11764 friend
11765 constexpr */
11768 {
11771 }
11772 else
11773 {
11775 /* Consume the token. */
11777 }
11785 /* function-specifier:
11786 inline
11787 virtual
11788 explicit */
11795 /* decl-specifier:
11796 typedef */
11799 /* Consume the token. */
11801 /* A constructor declarator cannot appear in a typedef. */
11803 /* The "typedef" keyword can only occur in a declaration; we
11804 may as well commit at this point. */
11811 /* storage-class-specifier:
11812 auto
11813 register
11814 static
11815 extern
11816 mutable
11818 GNU Extension:
11819 thread */
11822 {
11823 /* Consume the token. */
11826 /* Complain about `auto' as a storage specifier, if
11827 we're complaining about C++0x compatibility. */
11831 /* Set the storage class anyway. */
11833 token);
11834 }
11835 else
11836 /* C++0x auto type-specifier. */
11844 /* Consume the token. */
11847 token);
11850 /* Consume the token. */
11856 /* We did not yet find a decl-specifier yet. */
11859 }
11869 /* Constructors are a special case. The `S' in `S()' is not a
11870 decl-specifier; it is the beginning of the declarator. */
11871 constructor_p
11872 = (!found_decl_spec
11873 && constructor_possible_p
11874 && (cp_parser_constructor_declarator_p
11877 /* If we don't have a DECL_SPEC yet, then we must be looking at
11878 a type-specifier. */
11880 {
11883 tree type_spec;
11885 type_spec
11887 decl_specs,
11893 /* If this type-specifier referenced a user-defined type
11894 (a typedef, class-name, etc.), then we can't allow any
11895 more such type-specifiers henceforth.
11897 [dcl.spec]
11899 The longest sequence of decl-specifiers that could
11900 possibly be a type name is taken as the
11901 decl-specifier-seq of a declaration. The sequence shall
11902 be self-consistent as described below.
11904 [dcl.type]
11906 As a general rule, at most one type-specifier is allowed
11907 in the complete decl-specifier-seq of a declaration. The
11908 only exceptions are the following:
11910 -- const or volatile can be combined with any other
11911 type-specifier.
11913 -- signed or unsigned can be combined with char, long,
11914 short, or int.
11916 -- ..
11918 Example:
11920 typedef char* Pc;
11921 void g (const int Pc);
11923 Here, Pc is *not* part of the decl-specifier seq; it's
11924 the declarator. Therefore, once we see a type-specifier
11925 (other than a cv-qualifier), we forbid any additional
11926 user-defined types. We *do* still allow things like `int
11927 int' to be considered a decl-specifier-seq, and issue the
11928 error message later. */
11931 /* A constructor declarator cannot follow a type-specifier. */
11933 {
11938 }
11939 }
11941 /* If we still do not have a DECL_SPEC, then there are no more
11942 decl-specifiers. */
11947 /* After we see one decl-specifier, further decl-specifiers are
11948 always optional. */
11950 }
11952 /* Don't allow a friend specifier with a class definition. */
11957 }
11959 /* Parse an (optional) storage-class-specifier.
11961 storage-class-specifier:
11962 auto
11963 register
11964 static
11965 extern
11966 mutable
11968 GNU Extension:
11970 storage-class-specifier:
11971 thread
11973 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11975 static tree
11977 {
11979 {
11983 /* Fall through for C++98. */
11990 /* Consume the token. */
11995 }
11996 }
11998 /* Parse an (optional) function-specifier.
12000 function-specifier:
12001 inline
12002 virtual
12003 explicit
12005 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12006 Updates DECL_SPECS, if it is non-NULL. */
12008 static tree
12011 {
12014 {
12020 /* 14.5.2.3 [temp.mem]
12022 A member function template shall not be virtual. */
12025 else
12035 }
12037 /* Consume the token. */
12039 }
12041 /* Parse a linkage-specification.
12043 linkage-specification:
12044 extern string-literal { declaration-seq [opt] }
12045 extern string-literal declaration */
12047 static void
12049 {
12050 tree linkage;
12052 /* Look for the `extern' keyword. */
12055 /* Look for the string-literal. */
12058 /* Transform the literal into an identifier. If the literal is a
12059 wide-character string, or contains embedded NULs, then we can't
12060 handle it as the user wants. */
12063 {
12065 /* Assume C++ linkage. */
12067 }
12068 else
12071 /* We're now using the new linkage. */
12074 /* If the next token is a `{', then we're using the first
12075 production. */
12077 {
12080 /* Consume the `{' token. */
12082 /* Parse the declarations. */
12084 /* Look for the closing `}'. */
12086 }
12087 /* Otherwise, there's just one declaration. */
12088 else
12089 {
12092 saved_in_unbraced_linkage_specification_p
12096 parser->in_unbraced_linkage_specification_p
12098 }
12100 /* We're done with the linkage-specification. */
12102 }
12104 /* Parse a static_assert-declaration.
12106 static_assert-declaration:
12107 static_assert ( constant-expression , string-literal ) ;
12109 If MEMBER_P, this static_assert is a class member. */
12111 static void
12113 {
12114 tree condition;
12115 tree message;
12117 location_t saved_loc;
12120 /* Peek at the `static_assert' token so we can keep track of exactly
12121 where the static assertion started. */
12125 /* Look for the `static_assert' keyword. */
12127 RT_STATIC_ASSERT))
12130 /* We know we are in a static assertion; commit to any tentative
12131 parse. */
12135 /* Parse the `(' starting the static assertion condition. */
12138 /* Parse the constant-expression. Allow a non-constant expression
12139 here in order to give better diagnostics in finish_static_assert. */
12140 condition =
12145 /* Parse the separating `,'. */
12148 /* Parse the string-literal message. */
12153 /* A `)' completes the static assertion. */
12160 /* A semicolon terminates the declaration. */
12163 /* Complete the static assertion, which may mean either processing
12164 the static assert now or saving it for template instantiation. */
12166 }
12168 /* Parse the expression in decltype ( expression ). */
12170 static tree
12173 {
12175 tree expr;
12177 /* First, try parsing an id-expression. */
12188 {
12191 cp_id_kind idk;
12195 /* Lookup the name we got back from the id-expression. */
12205 {
12206 /* Complete lookup of the id-expression. */
12207 expr = (finish_id_expression
12220 /* We found an id-expression, but it was something that we
12221 should not have found. This is an error, not something
12222 we can recover from, so note that we found an
12223 id-expression and we'll recover as gracefully as
12224 possible. */
12226 }
12231 /* We have an id-expression. */
12233 }
12236 {
12237 /* Abort the id-expression parse. */
12240 /* Parsing tentatively, again. */
12243 /* Parse a class member access. */
12251 /* We have an id-expression. */
12253 }
12256 /* We have parsed the complete id-expression or member access. */
12258 else
12259 {
12260 /* Abort our attempt to parse an id-expression or member access
12261 expression. */
12264 /* Parse a full expression. */
12267 }
12270 }
12272 /* Parse a `decltype' type. Returns the type.
12274 simple-type-specifier:
12275 decltype ( expression )
12276 C++14 proposal:
12277 decltype ( auto ) */
12279 static tree
12281 {
12282 tree expr;
12291 {
12292 /* Already parsed. */
12295 }
12297 /* Look for the `decltype' token. */
12301 /* Parse the opening `('. */
12305 /* decltype (auto) */
12308 {
12315 }
12317 /* Types cannot be defined in a `decltype' expression. Save away the
12318 old message. */
12321 /* And create the new one. */
12322 parser->type_definition_forbidden_message
12325 /* The restrictions on constant-expressions do not apply inside
12326 decltype expressions. */
12327 saved_integral_constant_expression_p
12329 saved_non_integral_constant_expression_p
12333 /* Within a parenthesized expression, a `>' token is always
12334 the greater-than operator. */
12335 saved_greater_than_is_operator_p
12339 /* Do not actually evaluate the expression. */
12342 /* Do not warn about problems with the expression. */
12347 /* Go back to evaluating expressions. */
12351 /* The `>' token might be the end of a template-id or
12352 template-parameter-list now. */
12353 parser->greater_than_is_operator_p
12356 /* Restore the old message and the integral constant expression
12357 flags. */
12359 parser->integral_constant_expression_p
12361 parser->non_integral_constant_expression_p
12364 /* Parse to the closing `)'. */
12366 {
12370 }
12373 tf_warning_or_error);
12375 rewrite:
12376 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12377 it again. */
12384 }
12386 /* Special member functions [gram.special] */
12388 /* Parse a conversion-function-id.
12390 conversion-function-id:
12391 operator conversion-type-id
12393 Returns an IDENTIFIER_NODE representing the operator. */
12395 static tree
12397 {
12398 tree type;
12399 tree saved_scope;
12400 tree saved_qualifying_scope;
12401 tree saved_object_scope;
12404 /* Look for the `operator' token. */
12407 /* When we parse the conversion-type-id, the current scope will be
12408 reset. However, we need that information in able to look up the
12409 conversion function later, so we save it here. */
12413 /* We must enter the scope of the class so that the names of
12414 entities declared within the class are available in the
12415 conversion-type-id. For example, consider:
12417 struct S {
12418 typedef int I;
12419 operator I();
12420 };
12422 S::operator I() { ... }
12424 In order to see that `I' is a type-name in the definition, we
12425 must be in the scope of `S'. */
12428 /* Parse the conversion-type-id. */
12430 /* Leave the scope of the class, if any. */
12433 /* Restore the saved scope. */
12437 /* If the TYPE is invalid, indicate failure. */
12441 }
12443 /* Parse a conversion-type-id:
12445 conversion-type-id:
12446 type-specifier-seq conversion-declarator [opt]
12448 Returns the TYPE specified. */
12450 static tree
12452 {
12453 tree attributes;
12454 cp_decl_specifier_seq type_specifiers;
12456 tree type_specified;
12459 /* Parse the attributes. */
12463 parser->type_definition_forbidden_message
12466 /* Parse the type-specifiers. */
12473 /* If that didn't work, stop. */
12476 /* Parse the conversion-declarator. */
12484 /* Don't give this error when parsing tentatively. This happens to
12485 work because we always parse this definitively once. */
12488 {
12490 {
12493 }
12497 }
12500 }
12502 /* Parse an (optional) conversion-declarator.
12504 conversion-declarator:
12505 ptr-operator conversion-declarator [opt]
12507 */
12511 {
12514 cp_cv_quals cv_quals;
12516 /* We don't know if there's a ptr-operator next, or not. */
12518 /* Try the ptr-operator. */
12521 /* If it worked, look for more conversion-declarators. */
12523 {
12526 /* Parse another optional declarator. */
12529 declarator = cp_parser_make_indirect_declarator
12533 }
12536 }
12538 /* Parse an (optional) ctor-initializer.
12540 ctor-initializer:
12541 : mem-initializer-list
12543 Returns TRUE iff the ctor-initializer was actually present. */
12545 static bool
12547 {
12548 /* If the next token is not a `:', then there is no
12549 ctor-initializer. */
12551 {
12552 /* Do default initialization of any bases and members. */
12557 }
12559 /* Consume the `:' token. */
12561 /* And the mem-initializer-list. */
12565 }
12567 /* Parse a mem-initializer-list.
12569 mem-initializer-list:
12570 mem-initializer ... [opt]
12571 mem-initializer ... [opt] , mem-initializer-list */
12573 static void
12575 {
12580 /* Let the semantic analysis code know that we are starting the
12581 mem-initializer-list. */
12586 /* Loop through the list. */
12588 {
12589 tree mem_initializer;
12592 /* Parse the mem-initializer. */
12594 /* If the next token is a `...', we're expanding member initializers. */
12596 {
12597 /* Consume the `...'. */
12600 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12601 can be expanded but members cannot. */
12604 {
12609 }
12611 /* Construct the pack expansion type. */
12614 }
12617 {
12621 }
12622 /* Look for a target constructor. */
12626 {
12629 {
12633 }
12635 }
12636 /* Add it to the list, unless it was erroneous. */
12638 {
12641 }
12642 /* If the next token is not a `,', we're done. */
12645 /* Consume the `,' token. */
12647 }
12649 /* Perform semantic analysis. */
12652 }
12654 /* Parse a mem-initializer.
12656 mem-initializer:
12657 mem-initializer-id ( expression-list [opt] )
12658 mem-initializer-id braced-init-list
12660 GNU extension:
12662 mem-initializer:
12663 ( expression-list [opt] )
12665 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12666 class) or FIELD_DECL (for a non-static data member) to initialize;
12667 the TREE_VALUE is the expression-list. An empty initialization
12668 list is represented by void_list_node. */
12670 static tree
12672 {
12673 tree mem_initializer_id;
12674 tree expression_list;
12675 tree member;
12678 /* Find out what is being initialized. */
12680 {
12684 }
12685 else
12686 {
12690 }
12696 {
12703 }
12704 else
12705 {
12715 }
12725 }
12727 /* Parse a mem-initializer-id.
12729 mem-initializer-id:
12730 :: [opt] nested-name-specifier [opt] class-name
12731 identifier
12733 Returns a TYPE indicating the class to be initializer for the first
12734 production. Returns an IDENTIFIER_NODE indicating the data member
12735 to be initialized for the second production. */
12737 static tree
12739 {
12743 tree id;
12747 /* `typename' is not allowed in this context ([temp.res]). */
12749 {
12751 "keyword %<typename%> not allowed in this context (a qualified "
12754 }
12755 /* Look for the optional `::' operator. */
12756 global_scope_p
12760 /* Look for the optional nested-name-specifier. The simplest way to
12761 implement:
12763 [temp.res]
12765 The keyword `typename' is not permitted in a base-specifier or
12766 mem-initializer; in these contexts a qualified name that
12767 depends on a template-parameter is implicitly assumed to be a
12768 type name.
12770 is to assume that we have seen the `typename' keyword at this
12771 point. */
12772 nested_name_specifier_p
12781 /* If there is a `::' operator or a nested-name-specifier, then we
12782 are definitely looking for a class-name. */
12787 typename_type,
12791 /* Otherwise, we could also be looking for an ordinary identifier. */
12793 /* Try a class-name. */
12797 none_type,
12801 /* If we found one, we're done. */
12804 /* Otherwise, look for an ordinary identifier. */
12806 }
12808 /* Overloading [gram.over] */
12810 /* Parse an operator-function-id.
12812 operator-function-id:
12813 operator operator
12815 Returns an IDENTIFIER_NODE for the operator which is a
12816 human-readable spelling of the identifier, e.g., `operator +'. */
12818 static tree
12820 {
12821 /* Look for the `operator' keyword. */
12824 /* And then the name of the operator itself. */
12826 }
12828 /* Return an identifier node for a user-defined literal operator.
12829 The suffix identifier is chained to the operator name identifier. */
12831 static tree
12833 {
12834 tree identifier;
12841 }
12843 /* Parse an operator.
12845 operator:
12846 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12847 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12848 || ++ -- , ->* -> () []
12850 GNU Extensions:
12852 operator:
12853 <? >? <?= >?=
12855 Returns an IDENTIFIER_NODE for the operator which is a
12856 human-readable spelling of the identifier, e.g., `operator +'. */
12858 static tree
12860 {
12865 /* Peek at the next token. */
12867 /* Figure out which operator we have. */
12869 {
12871 {
12874 /* The keyword should be either `new' or `delete'. */
12879 else
12882 /* Consume the `new' or `delete' token. */
12885 /* Peek at the next token. */
12887 /* If it's a `[' token then this is the array variant of the
12888 operator. */
12890 {
12891 /* Consume the `[' token. */
12893 /* Look for the `]' token. */
12897 }
12898 /* Otherwise, we have the non-array variant. */
12899 else
12903 }
13050 /* Consume the `('. */
13052 /* Look for the matching `)'. */
13057 /* Consume the `['. */
13059 /* Look for the matching `]'. */
13074 {
13081 /* Consume the string. */
13087 {
13090 }
13091 else
13092 {
13094 /* Look for the suffix identifier. */
13099 {
13103 }
13104 else
13105 {
13108 }
13109 }
13114 {
13117 }
13120 {
13123 }
13125 {
13128 }
13130 }
13133 /* Anything else is an error. */
13135 }
13137 /* If we have selected an identifier, we need to consume the
13138 operator token. */
13141 /* Otherwise, no valid operator name was present. */
13142 else
13143 {
13146 }
13149 }
13151 /* Parse a template-declaration.
13153 template-declaration:
13154 export [opt] template < template-parameter-list > declaration
13156 If MEMBER_P is TRUE, this template-declaration occurs within a
13157 class-specifier.
13159 The grammar rule given by the standard isn't correct. What
13160 is really meant is:
13162 template-declaration:
13163 export [opt] template-parameter-list-seq
13164 decl-specifier-seq [opt] init-declarator [opt] ;
13165 export [opt] template-parameter-list-seq
13166 function-definition
13168 template-parameter-list-seq:
13169 template-parameter-list-seq [opt]
13170 template < template-parameter-list > */
13172 static void
13174 {
13175 /* Check for `export'. */
13177 {
13178 /* Consume the `export' token. */
13180 /* Warn that we do not support `export'. */
13182 }
13185 }
13187 /* Parse a template-parameter-list.
13189 template-parameter-list:
13190 template-parameter
13191 template-parameter-list , template-parameter
13193 Returns a TREE_LIST. Each node represents a template parameter.
13194 The nodes are connected via their TREE_CHAINs. */
13196 static tree
13198 {
13203 /* The loop below parses the template parms. We first need to know
13204 the total number of template parms to be able to compute proper
13205 canonical types of each dependent type. So after the loop, when
13206 we know the total number of template parms,
13207 end_template_parm_list computes the proper canonical types and
13208 fixes up the dependent types accordingly. */
13210 {
13211 tree parameter;
13214 location_t parm_loc;
13216 /* Parse the template-parameter. */
13221 /* Add it to the list. */
13224 parm_loc,
13225 parameter,
13226 is_non_type,
13227 is_parameter_pack);
13228 else
13229 {
13232 }
13234 /* If the next token is not a `,', we're done. */
13237 /* Otherwise, consume the `,' token. */
13239 }
13242 }
13244 /* Parse a template-parameter.
13246 template-parameter:
13247 type-parameter
13248 parameter-declaration
13250 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13251 the parameter. The TREE_PURPOSE is the default value, if any.
13252 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13253 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13254 set to true iff this parameter is a parameter pack. */
13256 static tree
13259 {
13263 tree parm;
13265 /* Assume it is a type parameter or a template parameter. */
13267 /* Assume it not a parameter pack. */
13269 /* Peek at the next token. */
13271 /* If it is `class' or `template', we have a type-parameter. */
13274 /* If it is `class' or `typename' we do not know yet whether it is a
13275 type parameter or a non-type parameter. Consider:
13277 template <typename T, typename T::X X> ...
13279 or:
13281 template <class C, class D*> ...
13283 Here, the first parameter is a type parameter, and the second is
13284 a non-type parameter. We can tell by looking at the token after
13285 the identifier -- if it is a `,', `=', or `>' then we have a type
13286 parameter. */
13288 {
13289 /* Peek at the token after `class' or `typename'. */
13291 /* If it's an ellipsis, we have a template type parameter
13292 pack. */
13295 /* If it's an identifier, skip it. */
13298 /* Now, see if the token looks like the end of a template
13299 parameter. */
13304 }
13306 /* Otherwise, it is a non-type parameter.
13308 [temp.param]
13310 When parsing a default template-argument for a non-type
13311 template-parameter, the first non-nested `>' is taken as the end
13312 of the template parameter-list rather than a greater-than
13313 operator. */
13315 parameter_declarator
13322 /* If the parameter declaration is marked as a parameter pack, set
13323 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13324 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13325 grokdeclarator. */
13328 {
13331 }
13334 {
13335 /* Can happen in some cases of erroneous input (c++/34892). */
13337 /* Consume the `...' for better error recovery. */
13339 }
13340 /* If the next token is an ellipsis, and we don't already have it
13341 marked as a parameter pack, then we have a parameter pack (that
13342 has no declarator). */
13345 && (declarator_can_be_parameter_pack
13347 {
13348 /* Consume the `...'. */
13353 }
13354 /* We might end up with a pack expansion as the type of the non-type
13355 template parameter, in which case this is a non-type template
13356 parameter pack. */
13359 {
13363 }
13366 {
13367 /* Parameter packs cannot have default arguments. However, a
13368 user may try to do so, so we'll parse them and give an
13369 appropriate diagnostic here. */
13373 /* Find the name of the parameter pack. */
13382 else
13386 /* Parse the default argument, but throw away the result. */
13388 }
13398 }
13400 /* Parse a type-parameter.
13402 type-parameter:
13403 class identifier [opt]
13404 class identifier [opt] = type-id
13405 typename identifier [opt]
13406 typename identifier [opt] = type-id
13407 template < template-parameter-list > class identifier [opt]
13408 template < template-parameter-list > class identifier [opt]
13409 = id-expression
13411 GNU Extension (variadic templates):
13413 type-parameter:
13414 class ... identifier [opt]
13415 typename ... identifier [opt]
13417 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13418 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13419 the declaration of the parameter.
13421 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13423 static tree
13425 {
13427 tree parameter;
13429 /* Look for a keyword to tell us what kind of parameter this is. */
13435 {
13438 {
13439 tree identifier;
13440 tree default_argument;
13442 /* If the next token is an ellipsis, we have a template
13443 argument pack. */
13445 {
13446 /* Consume the `...' token. */
13451 }
13453 /* If the next token is an identifier, then it names the
13454 parameter. */
13457 else
13460 /* Create the parameter. */
13463 /* If the next token is an `=', we have a default argument. */
13465 {
13466 /* Consume the `=' token. */
13468 /* Parse the default-argument. */
13472 /* Template parameter packs cannot have default
13473 arguments. */
13475 {
13478 "template parameter pack %qD cannot have a "
13480 else
13482 "template parameter packs cannot have "
13485 }
13487 }
13488 else
13491 /* Create the combined representation of the parameter and the
13492 default argument. */
13494 }
13498 {
13499 tree identifier;
13500 tree default_argument;
13502 /* Look for the `<'. */
13504 /* Parse the template-parameter-list. */
13506 /* Look for the `>'. */
13508 /* Look for the `class' or 'typename' keywords. */
13510 /* If the next token is an ellipsis, we have a template
13511 argument pack. */
13513 {
13514 /* Consume the `...' token. */
13519 }
13520 /* If the next token is an `=', then there is a
13521 default-argument. If the next token is a `>', we are at
13522 the end of the parameter-list. If the next token is a `,',
13523 then we are at the end of this parameter. */
13527 {
13529 /* Treat invalid names as if the parameter were nameless. */
13532 }
13533 else
13536 /* Create the template parameter. */
13538 identifier);
13540 /* If the next token is an `=', then there is a
13541 default-argument. */
13543 {
13546 /* Consume the `='. */
13548 /* Parse the id-expression. */
13550 /* save token before parsing the id-expression, for error
13551 reporting */
13553 default_argument
13561 /* If the id-expression was a template-id that refers to
13562 a template-class, we already have the declaration here,
13563 so no further lookup is needed. */
13564 ;
13565 else
13566 /* Look up the name. */
13567 default_argument
13569 none_type,
13575 /* See if the default argument is valid. */
13576 default_argument
13579 /* Template parameter packs cannot have default
13580 arguments. */
13582 {
13585 "template parameter pack %qD cannot "
13587 identifier);
13588 else
13592 }
13594 }
13595 else
13598 /* Create the combined representation of the parameter and the
13599 default argument. */
13601 }
13607 }
13610 }
13612 /* Parse a template-id.
13614 template-id:
13615 template-name < template-argument-list [opt] >
13617 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13618 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13619 returned. Otherwise, if the template-name names a function, or set
13620 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13621 names a class, returns a TYPE_DECL for the specialization.
13623 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13624 uninstantiated templates. */
13626 static tree
13632 {
13634 tree templ;
13635 tree arguments;
13636 tree template_id;
13643 /* If the next token corresponds to a template-id, there is no need
13644 to reparse it. */
13647 {
13650 /* Get the stored value. */
13652 /* Perform any access checks that were deferred. */
13655 {
13660 tf_warning_or_error);
13661 }
13662 /* Return the stored value. */
13664 }
13666 /* Avoid performing name lookup if there is no possibility of
13667 finding a template-id. */
13670 && !cp_parser_nth_token_starts_template_argument_list_p
13672 {
13675 }
13677 /* Remember where the template-id starts. */
13683 /* Parse the template-name. */
13686 check_dependency_p,
13687 is_declaration,
13688 tag_type,
13691 {
13694 }
13696 /* If we find the sequence `[:' after a template-name, it's probably
13697 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13698 parse correctly the argument list. */
13705 {
13707 /* Change `:' into `::'. */
13709 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13710 CPP_LESS. */
13713 /* Parse the arguments. */
13716 {
13717 /* If we couldn't parse an argument list, then we revert our changes
13718 and return simply an error. Maybe this is not a template-id
13719 after all. */
13724 }
13725 /* Otherwise, emit an error about the invalid digraph, but continue
13726 parsing because we got our argument list. */
13729 {
13732 "%<<:%> is an alternate spelling for %<[%>."
13735 {
13737 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13740 }
13741 }
13742 }
13743 else
13744 {
13745 /* Look for the `<' that starts the template-argument-list. */
13747 {
13750 }
13751 /* Parse the arguments. */
13753 }
13755 /* Build a representation of the specialization. */
13758 TEMPLATE_ID_EXPR,
13762 {
13764 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13765 template (rather than some instantiation thereof) only if
13766 is not nested within some other construct. For example, in
13767 "template <typename T> void f(T) { A<T>::", A<T> is just an
13768 instantiation of A. */
13771 CPP_SCOPE));
13772 template_id
13774 }
13776 {
13778 }
13779 else
13780 {
13781 /* If it's not a class-template or a template-template, it should be
13782 a function-template. */
13788 }
13790 /* If parsing tentatively, replace the sequence of tokens that makes
13791 up the template-id with a CPP_TEMPLATE_ID token. That way,
13792 should we re-parse the token stream, we will not have to repeat
13793 the effort required to do the parse, nor will we issue duplicate
13794 error messages about problems during instantiation of the
13795 template. */
13797 /* Don't do this if we had a parse error in a declarator; re-parsing
13798 might succeed if a name changes meaning (60361). */
13802 {
13805 /* Reset the contents of the START_OF_ID token. */
13807 /* Retrieve any deferred checks. Do not pop this access checks yet
13808 so the memory will not be reclaimed during token replacing below. */
13814 /* Purge all subsequent tokens. */
13817 /* ??? Can we actually assume that, if template_id ==
13818 error_mark_node, we will have issued a diagnostic to the
13819 user, as opposed to simply marking the tentative parse as
13820 failed? */
13823 }
13827 }
13829 /* Parse a template-name.
13831 template-name:
13832 identifier
13834 The standard should actually say:
13836 template-name:
13837 identifier
13838 operator-function-id
13840 A defect report has been filed about this issue.
13842 A conversion-function-id cannot be a template name because they cannot
13843 be part of a template-id. In fact, looking at this code:
13845 a.operator K<int>()
13847 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13848 It is impossible to call a templated conversion-function-id with an
13849 explicit argument list, since the only allowed template parameter is
13850 the type to which it is converting.
13852 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13853 `template' keyword, in a construction like:
13855 T::template f<3>()
13857 In that case `f' is taken to be a template-name, even though there
13858 is no way of knowing for sure.
13860 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13861 name refers to a set of overloaded functions, at least one of which
13862 is a template, or an IDENTIFIER_NODE with the name of the template,
13863 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13864 names are looked up inside uninstantiated templates. */
13866 static tree
13873 {
13874 tree identifier;
13875 tree decl;
13876 tree fns;
13879 /* If the next token is `operator', then we have either an
13880 operator-function-id or a conversion-function-id. */
13882 {
13883 /* We don't know whether we're looking at an
13884 operator-function-id or a conversion-function-id. */
13886 /* Try an operator-function-id. */
13888 /* If that didn't work, try a conversion-function-id. */
13890 {
13893 }
13894 }
13895 /* Look for the identifier. */
13896 else
13899 /* If we didn't find an identifier, we don't have a template-id. */
13903 /* If the name immediately followed the `template' keyword, then it
13904 is a template-name. However, if the next token is not `<', then
13905 we do not treat it as a template-name, since it is not being used
13906 as part of a template-id. This enables us to handle constructs
13907 like:
13909 template <typename T> struct S { S(); };
13910 template <typename T> S<T>::S();
13912 correctly. We would treat `S' as a template -- if it were `S<T>'
13913 -- but we do not if there is no `<'. */
13917 {
13918 /* In a declaration, in a dependent context, we pretend that the
13919 "template" keyword was present in order to improve error
13920 recovery. For example, given:
13922 template <typename T> void f(T::X<int>);
13924 we want to treat "X<int>" as a template-id. */
13926 && !template_keyword_p
13928 && check_dependency_p
13930 /* Do not do this for dtors (or ctors), since they never
13931 need the template keyword before their name. */
13933 {
13936 /* Explain what went wrong. */
13938 identifier);
13941 /* If parsing tentatively, find the location of the "<" token. */
13944 /* Parse the template arguments so that we can issue error
13945 messages about them. */
13948 /* Skip tokens until we find a good place from which to
13949 continue parsing. */
13954 /* If parsing tentatively, permanently remove the
13955 template argument list. That will prevent duplicate
13956 error messages from being issued about the missing
13957 "template" keyword. */
13963 }
13965 /* If the "template" keyword is present, then there is generally
13966 no point in doing name-lookup, so we just return IDENTIFIER.
13967 But, if the qualifying scope is non-dependent then we can
13968 (and must) do name-lookup normally. */
13974 }
13976 /* Look up the name. */
13978 tag_type,
13981 check_dependency_p,
13985 /* If DECL is a template, then the name was a template-name. */
13987 {
13991 }
13992 else
13993 {
13996 /* The standard does not explicitly indicate whether a name that
13997 names a set of overloaded declarations, some of which are
13998 templates, is a template-name. However, such a name should
13999 be a template-name; otherwise, there is no way to form a
14000 template-id for the overloaded templates. */
14008 {
14009 /* The name does not name a template. */
14012 }
14013 }
14015 /* If DECL is dependent, and refers to a function, then just return
14016 its name; we will look it up again during template instantiation. */
14018 {
14022 }
14025 }
14027 /* Parse a template-argument-list.
14029 template-argument-list:
14030 template-argument ... [opt]
14031 template-argument-list , template-argument ... [opt]
14033 Returns a TREE_VEC containing the arguments. */
14035 static tree
14037 {
14042 tree vec;
14049 /* Even if the template-id appears in an integral
14050 constant-expression, the contents of the argument list do
14051 not. */
14057 /* Parse the arguments. */
14058 do
14059 {
14060 tree argument;
14063 /* Consume the comma. */
14066 /* Parse the template-argument. */
14069 /* If the next token is an ellipsis, we're expanding a template
14070 argument pack. */
14072 {
14074 {
14078 }
14079 /* Consume the `...' token. */
14082 /* Make the argument into a TYPE_PACK_EXPANSION or
14083 EXPR_PACK_EXPANSION. */
14085 }
14088 {
14092 {
14095 }
14096 else
14098 }
14100 }
14113 #ifdef ENABLE_CHECKING
14115 #endif
14117 }
14119 /* Parse a template-argument.
14121 template-argument:
14122 assignment-expression
14123 type-id
14124 id-expression
14126 The representation is that of an assignment-expression, type-id, or
14127 id-expression -- except that the qualified id-expression is
14128 evaluated, so that the value returned is either a DECL or an
14129 OVERLOAD.
14131 Although the standard says "assignment-expression", it forbids
14132 throw-expressions or assignments in the template argument.
14133 Therefore, we use "conditional-expression" instead. */
14135 static tree
14137 {
14138 tree argument;
14144 cp_id_kind idk;
14146 /* There's really no way to know what we're looking at, so we just
14147 try each alternative in order.
14149 [temp.arg]
14151 In a template-argument, an ambiguity between a type-id and an
14152 expression is resolved to a type-id, regardless of the form of
14153 the corresponding template-parameter.
14155 Therefore, we try a type-id first. */
14158 /* If there was no error parsing the type-id but the next token is a
14159 '>>', our behavior depends on which dialect of C++ we're
14160 parsing. In C++98, we probably found a typo for '> >'. But there
14161 are type-id which are also valid expressions. For instance:
14163 struct X { int operator >> (int); };
14164 template <int V> struct Foo {};
14165 Foo<X () >> 5> r;
14167 Here 'X()' is a valid type-id of a function type, but the user just
14168 wanted to write the expression "X() >> 5". Thus, we remember that we
14169 found a valid type-id, but we still try to parse the argument as an
14170 expression to see what happens.
14172 In C++0x, the '>>' will be considered two separate '>'
14173 tokens. */
14177 {
14180 }
14181 else
14182 {
14183 /* If the next token isn't a `,' or a `>', then this argument wasn't
14184 really finished. This means that the argument is not a valid
14185 type-id. */
14188 /* If that worked, we're done. */
14191 }
14192 /* We're still not sure what the argument will be. */
14194 /* Try a template. */
14202 /* If the next token isn't a `,' or a `>', then this argument wasn't
14203 really finished. */
14207 {
14208 /* Figure out what is being referred to. If the id-expression
14209 was for a class template specialization, then we will have a
14210 TYPE_DECL at this point. There is no need to do name lookup
14211 at this point in that case. */
14214 none_type,
14223 }
14225 {
14229 }
14230 /* It must be a non-type argument. There permitted cases are given
14231 in [temp.arg.nontype]:
14233 -- an integral constant-expression of integral or enumeration
14234 type; or
14236 -- the name of a non-type template-parameter; or
14238 -- the name of an object or function with external linkage...
14240 -- the address of an object or function with external linkage...
14242 -- a pointer to member... */
14243 /* Look for a non-type template parameter. */
14245 {
14257 }
14259 /* If the next token is "&", the argument must be the address of an
14260 object or function with external linkage. */
14263 {
14266 }
14267 /* See if we might have an id-expression. */
14274 {
14277 address_p,
14284 else
14285 {
14286 tree probe;
14289 {
14290 /* Strip the dereference temporarily. */
14293 }
14295 /* If we're in a template, we represent a qualified-id referring
14296 to a static data member as a SCOPE_REF even if the scope isn't
14297 dependent so that we can check access control later. */
14302 {
14303 /* A variable without external linkage might still be a
14304 valid constant-expression, so no error is issued here
14305 if the external-linkage check fails. */
14308 }
14310 /* All overloaded functions are allowed; if the external
14311 linkage test does not pass, an error will be issued
14312 later. */
14313 ;
14317 /* A pointer-to-member. */
14318 ;
14320 ;
14321 else
14325 {
14328 tf_warning_or_error);
14329 else
14332 }
14333 }
14334 }
14335 /* If the argument started with "&", there are no other valid
14336 alternatives at this point. */
14338 {
14341 }
14343 /* If the argument wasn't successfully parsed as a type-id followed
14344 by '>>', the argument can only be a constant expression now.
14345 Otherwise, we try parsing the constant-expression tentatively,
14346 because the argument could really be a type-id. */
14357 /* We did our best to parse the argument as a non type-id, but that
14358 was the only alternative that matched (albeit with a '>' after
14359 it). We can assume it's just a typo from the user, and a
14360 diagnostic will then be issued. */
14362 }
14364 /* Parse an explicit-instantiation.
14366 explicit-instantiation:
14367 template declaration
14369 Although the standard says `declaration', what it really means is:
14371 explicit-instantiation:
14372 template decl-specifier-seq [opt] declarator [opt] ;
14374 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14375 supposed to be allowed. A defect report has been filed about this
14376 issue.
14378 GNU Extension:
14380 explicit-instantiation:
14381 storage-class-specifier template
14382 decl-specifier-seq [opt] declarator [opt] ;
14383 function-specifier template
14384 decl-specifier-seq [opt] declarator [opt] ; */
14386 static void
14388 {
14390 cp_decl_specifier_seq decl_specifiers;
14395 /* Look for an (optional) storage-class-specifier or
14396 function-specifier. */
14398 {
14399 extension_specifier
14402 extension_specifier
14405 }
14407 /* Look for the `template' keyword. */
14409 /* Let the front end know that we are processing an explicit
14410 instantiation. */
14412 /* [temp.explicit] says that we are supposed to ignore access
14413 control while processing explicit instantiation directives. */
14415 /* Parse a decl-specifier-seq. */
14417 CP_PARSER_FLAGS_OPTIONAL,
14420 /* If there was exactly one decl-specifier, and it declared a class,
14421 and there's no declarator, then we have an explicit type
14422 instantiation. */
14424 {
14425 tree type;
14429 /* Turn access control back on for names used during
14430 template instantiation. */
14435 }
14436 else
14437 {
14439 tree decl;
14441 /* Parse the declarator. */
14442 declarator
14453 {
14456 "explicit instantiation shall not use"
14460 "explicit instantiation shall not use"
14465 /* Turn access control back on for names used during
14466 template instantiation. */
14468 /* Do the explicit instantiation. */
14470 }
14471 else
14472 {
14474 /* Skip the body of the explicit instantiation. */
14476 }
14477 }
14478 /* We're done with the instantiation. */
14484 }
14486 /* Parse an explicit-specialization.
14488 explicit-specialization:
14489 template < > declaration
14491 Although the standard says `declaration', what it really means is:
14493 explicit-specialization:
14494 template <> decl-specifier [opt] init-declarator [opt] ;
14495 template <> function-definition
14496 template <> explicit-specialization
14497 template <> template-declaration */
14499 static void
14501 {
14505 /* Look for the `template' keyword. */
14507 /* Look for the `<'. */
14509 /* Look for the `>'. */
14511 /* We have processed another parameter list. */
14513 /* [temp]
14515 A template ... explicit specialization ... shall not have C
14516 linkage. */
14518 {
14520 /* Give it C++ linkage to avoid confusing other parts of the
14521 front end. */
14524 }
14525 else
14527 /* Let the front end know that we are beginning a specialization. */
14529 {
14532 }
14534 /* If the next keyword is `template', we need to figure out whether
14535 or not we're looking a template-declaration. */
14537 {
14542 else
14544 }
14545 else
14546 /* Parse the dependent declaration. */
14552 /* We're done with the specialization. */
14554 /* For the erroneous case of a template with C linkage, we pushed an
14555 implicit C++ linkage scope; exit that scope now. */
14558 /* We're done with this parameter list. */
14560 }
14562 /* Parse a type-specifier.
14564 type-specifier:
14565 simple-type-specifier
14566 class-specifier
14567 enum-specifier
14568 elaborated-type-specifier
14569 cv-qualifier
14571 GNU Extension:
14573 type-specifier:
14574 __complex__
14576 Returns a representation of the type-specifier. For a
14577 class-specifier, enum-specifier, or elaborated-type-specifier, a
14578 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14580 The parser flags FLAGS is used to control type-specifier parsing.
14582 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14583 in a decl-specifier-seq.
14585 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14586 class-specifier, enum-specifier, or elaborated-type-specifier, then
14587 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14588 if a type is declared; 2 if it is defined. Otherwise, it is set to
14589 zero.
14591 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14592 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14593 is set to FALSE. */
14595 static tree
14597 cp_parser_flags flags,
14602 {
14608 /* Assume this type-specifier does not declare a new type. */
14611 /* And that it does not specify a cv-qualifier. */
14614 /* Peek at the next token. */
14617 /* If we're looking at a keyword, we can use that to guide the
14618 production we choose. */
14621 {
14626 /* Look for the enum-specifier. */
14628 /* If that worked, we're done. */
14630 {
14635 type_spec,
14636 token,
14639 }
14640 else
14643 /* Any of these indicate either a class-specifier, or an
14644 elaborated-type-specifier. */
14651 /* Parse tentatively so that we can back up if we don't find a
14652 class-specifier. */
14654 /* Look for the class-specifier. */
14657 /* If that worked, we're done. */
14659 {
14664 type_spec,
14665 token,
14668 }
14670 /* Fall through. */
14671 elaborated_type_specifier:
14672 /* We're declaring (not defining) a class or enum. */
14676 /* Fall through. */
14678 /* Look for an elaborated-type-specifier. */
14679 type_spec
14680 = (cp_parser_elaborated_type_specifier
14683 is_declaration));
14686 type_spec,
14687 token,
14710 /* The `__complex__' keyword is a GNU extension. */
14716 }
14718 /* Handle simple keywords. */
14720 {
14722 {
14725 }
14727 }
14729 /* If we do not already have a type-specifier, assume we are looking
14730 at a simple-type-specifier. */
14732 decl_specs,
14733 flags);
14735 /* If we didn't find a type-specifier, and a type-specifier was not
14736 optional in this context, issue an error message. */
14738 {
14741 }
14744 }
14746 /* Parse a simple-type-specifier.
14748 simple-type-specifier:
14749 :: [opt] nested-name-specifier [opt] type-name
14750 :: [opt] nested-name-specifier template template-id
14751 char
14752 wchar_t
14753 bool
14754 short
14755 int
14756 long
14757 signed
14758 unsigned
14759 float
14760 double
14761 void
14763 C++0x Extension:
14765 simple-type-specifier:
14766 auto
14767 decltype ( expression )
14768 char16_t
14769 char32_t
14770 __underlying_type ( type-id )
14772 GNU Extension:
14774 simple-type-specifier:
14775 __int128
14776 __typeof__ unary-expression
14777 __typeof__ ( type-id )
14778 __typeof__ ( type-id ) { initializer-list , [opt] }
14780 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14781 appropriately updated. */
14783 static tree
14786 cp_parser_flags flags)
14787 {
14792 /* Peek at the next token. */
14795 /* If we're looking at a keyword, things are easy. */
14797 {
14832 {
14835 }
14864 {
14868 {
14871 "use of %<auto%> in lambda parameter declaration "
14872 "only available with "
14874 }
14877 "use of %<auto%> in parameter declaration "
14878 "only available with "
14880 else
14882 "ISO C++ forbids use of %<auto%> in parameter "
14884 }
14885 else
14890 /* Since DR 743, decltype can either be a simple-type-specifier by
14891 itself or begin a nested-name-specifier. Parsing it will replace
14892 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14893 handling below decide what to do. */
14899 /* Consume the `typeof' token. */
14901 /* Parse the operand to `typeof'. */
14903 /* If it is not already a TYPE, take its type. */
14909 token,
14918 token,
14928 token,
14933 }
14935 /* If token is an already-parsed decltype not followed by ::,
14936 it's a simple-type-specifier. */
14939 {
14942 {
14944 token,
14946 /* Remember that we are handling a decltype in order to
14947 implement the resolution of DR 1510 when the argument
14948 isn't instantiation dependent. */
14950 }
14953 }
14955 /* If the type-specifier was for a built-in type, we're done. */
14957 {
14958 /* Record the type. */
14965 type,
14966 token,
14971 /* Consume the token. */
14974 /* There is no valid C++ program where a non-template type is
14975 followed by a "<". That usually indicates that the user thought
14976 that the type was a template. */
14981 }
14983 /* The type-specifier must be a user-defined type. */
14985 {
14989 /* Don't gobble tokens or issue error messages if this is an
14990 optional type-specifier. */
14994 /* Look for the optional `::' operator. */
14995 global_p
14999 /* Look for the nested-name specifier. */
15000 qualified_p
15008 /* If we have seen a nested-name-specifier, and the next token
15009 is `template', then we are using the template-id production. */
15012 {
15013 /* Look for the template-id. */
15017 none_type,
15019 /* If the template-id did not name a type, we are out of
15020 luck. */
15022 {
15025 }
15026 }
15027 /* Otherwise, look for a type-name. */
15028 else
15030 /* Keep track of all name-lookups performed in class scopes. */
15032 && !global_p
15033 && !qualified_p
15037 /* If it didn't work out, we don't have a TYPE. */
15043 token,
15045 }
15047 /* If we didn't get a type-name, issue an error message. */
15049 {
15052 }
15055 {
15056 /* See if TYPE is an Objective-C type, and if so, parse and
15057 accept any protocol references following it. Do this before
15058 the cp_parser_check_for_invalid_template_id() call, because
15059 Objective-C types can be followed by '<...>' which would
15060 enclose protocol names rather than template arguments, and so
15061 everything is fine. */
15064 {
15068 /* Clobber the "unqualified" type previously entered into
15069 DECL_SPECS with the new, improved protocol-qualified version. */
15074 }
15076 /* There is no valid C++ program where a non-template type is
15077 followed by a "<". That usually indicates that the user
15078 thought that the type was a template. */
15080 none_type,
15082 }
15085 }
15087 /* Parse a type-name.
15089 type-name:
15090 class-name
15091 enum-name
15092 typedef-name
15093 simple-template-id [in c++0x]
15095 enum-name:
15096 identifier
15098 typedef-name:
15099 identifier
15101 Returns a TYPE_DECL for the type. */
15103 static tree
15105 {
15106 tree type_decl;
15108 /* We can't know yet whether it is a class-name or not. */
15110 /* Try a class-name. */
15114 none_type,
15118 /* If it's not a class-name, keep looking. */
15120 {
15122 /* It must be a typedef-name or an enum-name. */
15126 /* It is either a simple-template-id representing an
15127 instantiation of an alias template... */
15131 none_type,
15133 /* Note that this must be an instantiation of an alias template
15134 because [temp.names]/6 says:
15136 A template-id that names an alias template specialization
15137 is a type-name.
15139 Whereas [temp.names]/7 says:
15141 A simple-template-id that names a class template
15142 specialization is a class-name. */
15147 else
15151 /* ... Or a typedef-name or an enum-name. */
15153 }
15156 }
15158 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15160 enum-name:
15161 identifier
15163 typedef-name:
15164 identifier
15166 Returns a TYPE_DECL for the type. */
15168 static tree
15170 {
15171 tree type_decl;
15172 tree identifier;
15179 /* Look up the type-name. */
15186 {
15187 /* See if this is an Objective-C type. */
15192 }
15194 /* Issue an error if we did not find a type-name. */
15196 /* In Objective-C, we have the complication that class names are
15197 normally type names and start declarations (eg, the
15198 "NSObject" in "NSObject *object;"), but can be used in an
15199 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15200 is an expression. So, a classname followed by a dot is not a
15201 valid type-name. */
15204 {
15209 }
15210 /* Remember that the name was used in the definition of the
15211 current class so that we can check later to see if the
15212 meaning would have been different after the class was
15213 entirely defined. */
15219 }
15221 /* Parse an elaborated-type-specifier. Note that the grammar given
15222 here incorporates the resolution to DR68.
15224 elaborated-type-specifier:
15225 class-key :: [opt] nested-name-specifier [opt] identifier
15226 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15227 enum-key :: [opt] nested-name-specifier [opt] identifier
15228 typename :: [opt] nested-name-specifier identifier
15229 typename :: [opt] nested-name-specifier template [opt]
15230 template-id
15232 GNU extension:
15234 elaborated-type-specifier:
15235 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15236 class-key attributes :: [opt] nested-name-specifier [opt]
15237 template [opt] template-id
15238 enum attributes :: [opt] nested-name-specifier [opt] identifier
15240 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15241 declared `friend'. If IS_DECLARATION is TRUE, then this
15242 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15243 something is being declared.
15245 Returns the TYPE specified. */
15247 static tree
15251 {
15253 tree identifier;
15256 tree globalscope;
15259 /* See if we're looking at the `enum' keyword. */
15261 {
15262 /* Consume the `enum' token. */
15264 /* Remember that it's an enumeration type. */
15266 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15267 enums) is used here. */
15270 {
15274 /* Consume the `struct' or `class' and parse it anyway. */
15276 }
15277 /* Parse the attributes. */
15279 }
15280 /* Or, it might be `typename'. */
15282 RID_TYPENAME))
15283 {
15284 /* Consume the `typename' token. */
15286 /* Remember that it's a `typename' type. */
15288 }
15289 /* Otherwise it must be a class-key. */
15290 else
15291 {
15295 /* Parse the attributes. */
15297 }
15299 /* Look for the `::' operator. */
15302 /* Look for the nested-name-specifier. */
15304 {
15309 is_declaration))
15311 }
15312 else
15313 /* Even though `typename' is not present, the proposed resolution
15314 to Core Issue 180 says that in `class A<T>::B', `B' should be
15315 considered a type-name, even if `A<T>' is dependent. */
15320 is_declaration);
15321 /* For everything but enumeration types, consider a template-id.
15322 For an enumeration type, consider only a plain identifier. */
15324 {
15326 tree decl;
15328 /* Allow the `template' keyword. */
15330 /* If we didn't see `template', we don't know if there's a
15331 template-id or not. */
15334 /* Parse the template-id. */
15338 tag_type,
15339 is_declaration);
15340 /* If we didn't find a template-id, look for an ordinary
15341 identifier. */
15343 ;
15344 /* We can get here when cp_parser_template_id, called by
15345 cp_parser_class_name with tag_type == none_type, succeeds
15346 and caches a BASELINK. Then, when called again here,
15347 instead of failing and returning an error_mark_node
15348 returns it (see template/typename17.C in C++11).
15349 ??? Could we diagnose this earlier? */
15351 {
15354 }
15355 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15356 in effect, then we must assume that, upon instantiation, the
15357 template will correspond to a class. */
15361 typename_type,
15363 /* If the `typename' keyword is in effect and DECL is not a type
15364 decl, then type is non existent. */
15366 ;
15372 }
15375 {
15380 {
15383 }
15385 /* For a `typename', we needn't call xref_tag. */
15391 /* Template parameter lists apply only if we are not within a
15392 function parameter list. */
15393 bool template_parm_lists_apply
15402 /* Look up a qualified name in the usual way. */
15404 {
15405 tree decl;
15406 tree ambiguous_decls;
15409 tag_type,
15416 /* If the lookup was ambiguous, an error will already have been
15417 issued. */
15421 /* If we are parsing friend declaration, DECL may be a
15422 TEMPLATE_DECL tree node here. However, we need to check
15423 whether this TEMPLATE_DECL results in valid code. Consider
15424 the following example:
15426 namespace N {
15427 template <class T> class C {};
15428 }
15429 class X {
15430 template <class T> friend class N::C; // #1, valid code
15431 };
15432 template <class T> class Y {
15433 friend class N::C; // #2, invalid code
15434 };
15436 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15437 name lookup of `N::C'. We see that friend declaration must
15438 be template for the code to be valid. Note that
15439 processing_template_decl does not work here since it is
15440 always 1 for the above two cases. */
15442 decl = (cp_parser_maybe_treat_template_as_class
15447 {
15449 identifier,
15452 }
15455 {
15459 allow_template);
15463 }
15465 /* Forward declarations of nested types, such as
15467 class C1::C2;
15468 class C1::C2::C3;
15470 are invalid unless all components preceding the final '::'
15471 are complete. If all enclosing types are complete, these
15472 declarations become merely pointless.
15474 Invalid forward declarations of nested types are errors
15475 caught elsewhere in parsing. Those that are pointless arrive
15476 here. */
15483 }
15484 else
15485 {
15486 /* An elaborated-type-specifier sometimes introduces a new type and
15487 sometimes names an existing type. Normally, the rule is that it
15488 introduces a new type only if there is not an existing type of
15489 the same name already in scope. For example, given:
15491 struct S {};
15492 void f() { struct S s; }
15494 the `struct S' in the body of `f' is the same `struct S' as in
15495 the global scope; the existing definition is used. However, if
15496 there were no global declaration, this would introduce a new
15497 local class named `S'.
15499 An exception to this rule applies to the following code:
15501 namespace N { struct S; }
15503 Here, the elaborated-type-specifier names a new type
15504 unconditionally; even if there is already an `S' in the
15505 containing scope this declaration names a new type.
15506 This exception only applies if the elaborated-type-specifier
15507 forms the complete declaration:
15509 [class.name]
15511 A declaration consisting solely of `class-key identifier ;' is
15512 either a redeclaration of the name in the current scope or a
15513 forward declaration of the identifier as a class name. It
15514 introduces the name into the current scope.
15516 We are in this situation precisely when the next token is a `;'.
15518 An exception to the exception is that a `friend' declaration does
15519 *not* name a new type; i.e., given:
15521 struct S { friend struct T; };
15523 `T' is not a new type in the scope of `S'.
15525 Also, `new struct S' or `sizeof (struct S)' never results in the
15526 definition of a new type; a new type can only be declared in a
15527 declaration context. */
15529 tag_scope ts;
15533 /* Friends have special name lookup rules. */
15537 CPP_SEMICOLON))
15538 /* This is a `class-key identifier ;' */
15540 else
15543 template_p =
15544 (template_parm_lists_apply
15547 /* An unqualified name was used to reference this type, so
15548 there were no qualifying templates. */
15556 }
15557 }
15562 /* Allow attributes on forward declarations of classes. */
15564 {
15574 else
15577 }
15580 {
15581 /* Indicate whether this class was declared as a `class' or as a
15582 `struct'. */
15586 }
15588 /* A "<" cannot follow an elaborated type specifier. If that
15589 happens, the user was probably trying to form a template-id. */
15594 }
15596 /* Parse an enum-specifier.
15598 enum-specifier:
15599 enum-head { enumerator-list [opt] }
15600 enum-head { enumerator-list , } [C++0x]
15602 enum-head:
15603 enum-key identifier [opt] enum-base [opt]
15604 enum-key nested-name-specifier identifier enum-base [opt]
15606 enum-key:
15607 enum
15608 enum class [C++0x]
15609 enum struct [C++0x]
15611 enum-base: [C++0x]
15612 : type-specifier-seq
15614 opaque-enum-specifier:
15615 enum-key identifier enum-base [opt] ;
15617 GNU Extensions:
15618 enum-key attributes[opt] identifier [opt] enum-base [opt]
15619 { enumerator-list [opt] }attributes[opt]
15620 enum-key attributes[opt] identifier [opt] enum-base [opt]
15621 { enumerator-list, }attributes[opt] [C++0x]
15623 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15624 if the token stream isn't an enum-specifier after all. */
15626 static tree
15628 {
15629 tree identifier;
15631 tree prev_scope;
15633 tree attributes;
15646 /* Parse tentatively so that we can back up if we don't find a
15647 enum-specifier. */
15650 /* Caller guarantees that the current token is 'enum', an identifier
15651 possibly follows, and the token after that is an opening brace.
15652 If we don't have an identifier, fabricate an anonymous name for
15653 the enumeration being defined. */
15656 /* Parse the "class" or "struct", which indicates a scoped
15657 enumeration type in C++0x. */
15660 {
15664 /* Consume the `struct' or `class' token. */
15668 }
15672 /* Clear the qualification. */
15677 /* Figure out in what scope the declaration is being placed. */
15683 nested_name_specifier
15691 {
15692 tree name;
15696 enum_type,
15701 input_location);
15703 {
15706 {
15707 /* Are template enums allowed in ISO? */
15711 /* ignore a typename reference, for it will be solved by name
15712 in start_enum. */
15714 }
15715 }
15718 else
15721 }
15722 else
15723 {
15726 else
15727 {
15733 }
15734 }
15737 /* Check for the `:' that denotes a specified underlying type in C++0x.
15738 Note that a ':' could also indicate a bitfield width, however. */
15740 {
15741 cp_decl_specifier_seq type_specifiers;
15743 /* Consume the `:'. */
15746 /* Parse the type-specifier-seq. */
15751 /* At this point this is surely not elaborated type specifier. */
15760 /* If that didn't work, stop. */
15762 {
15768 }
15769 }
15771 /* Look for the `{' but don't consume it yet. */
15773 {
15775 {
15778 {
15781 }
15782 }
15783 /* An opaque-enum-specifier must have a ';' here. */
15786 {
15789 {
15792 }
15793 }
15794 }
15800 {
15802 {
15806 }
15808 {
15810 }
15811 }
15813 /* Issue an error message if type-definitions are forbidden here. */
15816 else
15817 /* Create the new type. We do this before consuming the opening
15818 brace so the enum will be recorded as being on the line of its
15819 tag (or the 'enum' keyword, if there is no tag). */
15823 /* If the next token is not '{' it is an opaque-enum-specifier or an
15824 elaborated-type-specifier. */
15826 {
15830 {
15831 /* The following catches invalid code such as:
15832 enum class S<int>::E { A, B, C }; */
15840 {
15844 nested_name_specifier);
15846 }
15847 /* If that scope does not contain the scope in which the
15848 class was originally declared, the program is invalid. */
15850 nested_name_specifier))
15851 {
15854 "declaration of %qD in namespace %qD which does not "
15857 else
15859 "declaration of %qD in %qD which does not "
15863 }
15864 }
15869 /* Consume the opening brace. */
15876 {
15880 }
15881 else
15882 {
15888 }
15892 /* If the next token is not '}', then there are some enumerators. */
15894 {
15898 }
15899 else
15902 /* Consume the final '}'. */
15908 }
15909 else
15910 {
15911 /* If a ';' follows, then it is an opaque-enum-specifier
15912 and additional restrictions apply. */
15914 {
15921 }
15922 }
15924 /* Look for trailing attributes to apply to this enumeration, and
15925 apply them if appropriate. */
15927 {
15931 trailing_attr,
15933 }
15935 /* Finish up the enumeration. */
15937 {
15942 }
15945 {
15947 {
15950 }
15952 {
15954 }
15955 }
15956 out:
15959 }
15961 /* Parse an enumerator-list. The enumerators all have the indicated
15962 TYPE.
15964 enumerator-list:
15965 enumerator-definition
15966 enumerator-list , enumerator-definition */
15968 static void
15970 {
15972 {
15973 /* Parse an enumerator-definition. */
15976 /* If the next token is not a ',', we've reached the end of
15977 the list. */
15980 /* Otherwise, consume the `,' and keep going. */
15982 /* If the next token is a `}', there is a trailing comma. */
15984 {
15989 }
15990 }
15991 }
15993 /* Parse an enumerator-definition. The enumerator has the indicated
15994 TYPE.
15996 enumerator-definition:
15997 enumerator
15998 enumerator = constant-expression
16000 enumerator:
16001 identifier */
16003 static void
16005 {
16006 tree identifier;
16007 tree value;
16008 location_t loc;
16010 /* Save the input location because we are interested in the location
16011 of the identifier and not the location of the explicit value. */
16014 /* Look for the identifier. */
16019 /* If the next token is an '=', then there is an explicit value. */
16021 {
16022 /* Consume the `=' token. */
16024 /* Parse the value. */
16026 }
16027 else
16030 /* If we are processing a template, make sure the initializer of the
16031 enumerator doesn't contain any bare template parameter pack. */
16035 /* Create the enumerator. */
16037 }
16039 /* Parse a namespace-name.
16041 namespace-name:
16042 original-namespace-name
16043 namespace-alias
16045 Returns the NAMESPACE_DECL for the namespace. */
16047 static tree
16049 {
16050 tree identifier;
16051 tree namespace_decl;
16055 /* Get the name of the namespace. */
16060 /* Look up the identifier in the currently active scope. Look only
16061 for namespaces, due to:
16063 [basic.lookup.udir]
16065 When looking up a namespace-name in a using-directive or alias
16066 definition, only namespace names are considered.
16068 And:
16070 [basic.lookup.qual]
16072 During the lookup of a name preceding the :: scope resolution
16073 operator, object, function, and enumerator names are ignored.
16075 (Note that cp_parser_qualifying_entity only calls this
16076 function if the token after the name is the scope resolution
16077 operator.) */
16079 none_type,
16085 /* If it's not a namespace, issue an error. */
16088 {
16093 }
16096 }
16098 /* Parse a namespace-definition.
16100 namespace-definition:
16101 named-namespace-definition
16102 unnamed-namespace-definition
16104 named-namespace-definition:
16105 original-namespace-definition
16106 extension-namespace-definition
16108 original-namespace-definition:
16109 namespace identifier { namespace-body }
16111 extension-namespace-definition:
16112 namespace original-namespace-name { namespace-body }
16114 unnamed-namespace-definition:
16115 namespace { namespace-body } */
16117 static void
16119 {
16126 {
16130 }
16131 else
16134 /* Look for the `namespace' keyword. */
16137 /* Get the name of the namespace. We do not attempt to distinguish
16138 between an original-namespace-definition and an
16139 extension-namespace-definition at this point. The semantic
16140 analysis routines are responsible for that. */
16143 else
16146 /* Parse any specified attributes. */
16149 /* Look for the `{' to start the namespace. */
16151 /* Start the namespace. */
16154 /* "inline namespace" is equivalent to a stub namespace definition
16155 followed by a strong using directive. */
16157 {
16159 /* Set up namespace association. */
16163 /* Import the contents of the inline namespace. */
16167 }
16171 /* Parse the body of the namespace. */
16177 /* Finish the namespace. */
16179 /* Look for the final `}'. */
16181 }
16183 /* Parse a namespace-body.
16185 namespace-body:
16186 declaration-seq [opt] */
16188 static void
16190 {
16192 }
16194 /* Parse a namespace-alias-definition.
16196 namespace-alias-definition:
16197 namespace identifier = qualified-namespace-specifier ; */
16199 static void
16201 {
16202 tree identifier;
16203 tree namespace_specifier;
16207 /* Look for the `namespace' keyword. */
16209 /* Look for the identifier. */
16213 /* Look for the `=' token. */
16216 {
16218 /* Skip the definition. */
16223 }
16225 /* Look for the qualified-namespace-specifier. */
16226 namespace_specifier
16228 /* Look for the `;' token. */
16231 /* Register the alias in the symbol table. */
16233 }
16235 /* Parse a qualified-namespace-specifier.
16237 qualified-namespace-specifier:
16238 :: [opt] nested-name-specifier [opt] namespace-name
16240 Returns a NAMESPACE_DECL corresponding to the specified
16241 namespace. */
16243 static tree
16245 {
16246 /* Look for the optional `::'. */
16250 /* Look for the optional nested-name-specifier. */
16258 }
16260 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16261 access declaration.
16263 using-declaration:
16264 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16265 using :: unqualified-id ;
16267 access-declaration:
16268 qualified-id ;
16270 */
16272 static bool
16275 {
16279 tree decl;
16280 tree identifier;
16281 tree qscope;
16286 {
16289 }
16290 else
16291 {
16292 /* Look for the `using' keyword. */
16295 /* Peek at the next token. */
16297 /* See if it's `typename'. */
16299 {
16300 /* Remember that we've seen it. */
16302 /* Consume the `typename' token. */
16304 }
16305 }
16307 /* Look for the optional global scope qualification. */
16308 global_scope_p
16313 /* If we saw `typename', or didn't see `::', then there must be a
16314 nested-name-specifier present. */
16316 {
16322 {
16325 }
16326 }
16327 /* Otherwise, we could be in either of the two productions. In that
16328 case, treat the nested-name-specifier as optional. */
16329 else
16341 /* Something has already gone wrong; there's no need to parse
16342 further. Since an error has occurred, the return value of
16343 cp_parser_parse_definitely will be false, as required. */
16347 /* Parse the unqualified-id. */
16355 {
16360 }
16362 /* The function we call to handle a using-declaration is different
16363 depending on what scope we are in. */
16365 ;
16368 /* [namespace.udecl]
16370 A using declaration shall not name a template-id. */
16373 else
16374 {
16376 {
16377 /* Create the USING_DECL. */
16384 {
16387 }
16388 else
16389 /* Add it to the list of members in this class. */
16391 }
16392 else
16393 {
16395 identifier,
16402 {
16405 }
16408 else
16410 }
16411 }
16413 /* Look for the final `;'. */
16418 "access declarations are deprecated "
16419 "in favour of using-declarations; "
16423 }
16425 /* Parse an alias-declaration.
16427 alias-declaration:
16428 using identifier attribute-specifier-seq [opt] = type-id */
16430 static tree
16432 {
16434 location_t id_location;
16436 cp_decl_specifier_seq decl_specs;
16440 /* Look for the `using' keyword. */
16441 cp_token *using_token
16463 /* Now we are going to parse the type-id of the declaration. */
16465 /*
16466 [dcl.type]/3 says:
16468 "A type-specifier-seq shall not define a class or enumeration
16469 unless it appears in the type-id of an alias-declaration (7.1.3) that
16470 is not the declaration of a template-declaration."
16472 In other words, if we currently are in an alias template, the
16473 type-id should not define a type.
16475 So let's set parser->type_definition_forbidden_message in that
16476 case; cp_parser_check_type_definition (called by
16477 cp_parser_class_specifier) will then emit an error if a type is
16478 defined in the type-id. */
16480 {
16484 }
16488 /* Restore the error message if need be. */
16494 {
16497 }
16499 /* A typedef-name can also be introduced by an alias-declaration. The
16500 identifier following the using keyword becomes a typedef-name. It has
16501 the same semantics as if it were introduced by the typedef
16502 specifier. In particular, it does not define a new type and it shall
16503 not appear in the type-id. */
16508 {
16511 ds_attribute,
16512 attrs_token);
16513 }
16515 ds_typedef,
16516 using_token);
16518 ds_alias,
16519 using_token);
16528 else
16539 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16540 added into the symbol table; otherwise, return the TYPE_DECL. */
16544 {
16548 }
16551 }
16553 /* Parse a using-directive.
16555 using-directive:
16556 using namespace :: [opt] nested-name-specifier [opt]
16557 namespace-name ; */
16559 static void
16561 {
16562 tree namespace_decl;
16563 tree attribs;
16565 /* Look for the `using' keyword. */
16567 /* And the `namespace' keyword. */
16569 /* Look for the optional `::' operator. */
16571 /* And the optional nested-name-specifier. */
16577 /* Get the namespace being used. */
16579 /* And any specified attributes. */
16581 /* Update the symbol table. */
16583 /* Look for the final `;'. */
16585 }
16587 /* Parse an asm-definition.
16589 asm-definition:
16590 asm ( string-literal ) ;
16592 GNU Extension:
16594 asm-definition:
16595 asm volatile [opt] ( string-literal ) ;
16596 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16597 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16598 : asm-operand-list [opt] ) ;
16599 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16600 : asm-operand-list [opt]
16601 : asm-clobber-list [opt] ) ;
16602 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16603 : asm-clobber-list [opt]
16604 : asm-goto-list ) ; */
16606 static void
16608 {
16609 tree string;
16614 tree asm_stmt;
16622 /* Look for the `asm' keyword. */
16627 {
16630 }
16632 /* See if the next token is `volatile'. */
16635 {
16636 /* Remember that we saw the `volatile' keyword. */
16638 /* Consume the token. */
16640 }
16644 {
16645 /* Remember that we saw the `goto' keyword. */
16647 /* Consume the token. */
16649 }
16650 /* Look for the opening `('. */
16653 /* Look for the string. */
16656 {
16660 }
16662 /* If we're allowing GNU extensions, check for the extended assembly
16663 syntax. Unfortunately, the `:' tokens need not be separated by
16664 a space in C, and so, for compatibility, we tolerate that here
16665 too. Doing that means that we have to treat the `::' operator as
16666 two `:' tokens. */
16671 {
16676 /* The extended syntax was used. */
16679 /* Look for outputs. */
16681 {
16682 /* Consume the `:'. */
16684 /* Parse the output-operands. */
16686 CPP_COLON)
16688 CPP_SCOPE)
16690 CPP_CLOSE_PAREN)
16696 }
16697 /* If the next token is `::', there are no outputs, and the
16698 next token is the beginning of the inputs. */
16700 /* The inputs are coming next. */
16703 /* Look for inputs. */
16706 {
16707 /* Consume the `:' or `::'. */
16709 /* Parse the output-operands. */
16711 CPP_COLON)
16713 CPP_SCOPE)
16715 CPP_CLOSE_PAREN))
16720 }
16722 /* The clobbers are coming next. */
16725 /* Look for clobbers. */
16728 {
16730 /* Consume the `:' or `::'. */
16732 /* Parse the clobbers. */
16734 CPP_COLON)
16736 CPP_CLOSE_PAREN))
16738 }
16741 /* The labels are coming next. */
16744 /* Look for labels. */
16747 {
16749 /* Consume the `:' or `::'. */
16751 /* Parse the labels. */
16753 }
16757 }
16761 /* Look for the closing `)'. */
16769 {
16770 /* Create the ASM_EXPR. */
16772 {
16775 /* If the extended syntax was not used, mark the ASM_EXPR. */
16777 {
16783 }
16784 }
16785 else
16787 }
16788 }
16790 /* Declarators [gram.dcl.decl] */
16792 /* Parse an init-declarator.
16794 init-declarator:
16795 declarator initializer [opt]
16797 GNU Extension:
16799 init-declarator:
16800 declarator asm-specification [opt] attributes [opt] initializer [opt]
16802 function-definition:
16803 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16804 function-body
16805 decl-specifier-seq [opt] declarator function-try-block
16807 GNU Extension:
16809 function-definition:
16810 __extension__ function-definition
16812 TM Extension:
16814 function-definition:
16815 decl-specifier-seq [opt] declarator function-transaction-block
16817 The DECL_SPECIFIERS apply to this declarator. Returns a
16818 representation of the entity declared. If MEMBER_P is TRUE, then
16819 this declarator appears in a class scope. The new DECL created by
16820 this declarator is returned.
16822 The CHECKS are access checks that should be performed once we know
16823 what entity is being declared (and, therefore, what classes have
16824 befriended it).
16826 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16827 for a function-definition here as well. If the declarator is a
16828 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16829 be TRUE upon return. By that point, the function-definition will
16830 have been completely parsed.
16832 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16833 is FALSE.
16835 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16836 parsed declaration if it is an uninitialized single declarator not followed
16837 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16838 if present, will not be consumed. If returned, this declarator will be
16839 created with SD_INITIALIZED but will not call cp_finish_decl. */
16841 static tree
16850 {
16854 tree prefix_attributes;
16856 tree asm_specification;
16857 tree initializer;
16859 tree scope;
16861 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16862 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16863 "(...)". */
16873 /* Gather the attributes that were provided with the
16874 decl-specifiers. */
16877 /* Assume that this is not the declarator for a function
16878 definition. */
16882 /* Default arguments are only permitted for function parameters. */
16886 /* Defer access checks while parsing the declarator; we cannot know
16887 what names are accessible until we know what is being
16888 declared. */
16891 /* Parse the declarator. */
16893 declarator
16898 /* Gather up the deferred checks. */
16903 /* If the DECLARATOR was erroneous, there's no need to go
16904 further. */
16908 /* Check that the number of template-parameter-lists is OK. */
16918 /* Figure out what scope the entity declared by the DECLARATOR is
16919 located in. `grokdeclarator' sometimes changes the scope, so
16920 we compute it now. */
16923 /* Perform any lookups in the declared type which were thought to be
16924 dependent, but are not in the scope of the declarator. */
16925 decl_specifiers->type
16928 /* If we're allowing GNU extensions, look for an
16929 asm-specification. */
16931 {
16932 /* Look for an asm-specification. */
16935 }
16936 else
16939 /* Look for attributes. */
16943 /* Peek at the next token. */
16949 {
16950 /* Check to see if the token indicates the start of a
16951 function-definition. */
16953 {
16955 {
16956 /* If a function-definition should not appear here, issue an
16957 error message. */
16961 }
16963 location_t func_brace_location
16966 /* Neither attributes nor an asm-specification are allowed
16967 on a function-definition. */
16970 "an asm-specification is not allowed "
16974 "attributes are not allowed "
16976 /* This is a function-definition. */
16979 /* Parse the function definition. */
16982 decl_specifiers,
16983 declarator,
16984 prefix_attributes);
16985 else
16986 decl =
16987 (cp_parser_function_definition_from_specifiers_and_declarator
16991 {
16992 /* This is where the prologue starts... */
16995 }
16998 }
16999 }
17001 {
17002 /* A non-template declaration involving a function parameter list
17003 containing an implicit template parameter will be made into a
17004 template. If the resulting declaration is not going to be an
17005 actual function then finish the template scope here to prevent it.
17006 An error message will be issued once we have a decl to talk about.
17008 FIXME probably we should do type deduction rather than create an
17009 implicit template, but the standard currently doesn't allow it. */
17012 }
17014 /* [dcl.dcl]
17016 Only in function declarations for constructors, destructors, and
17017 type conversions can the decl-specifier-seq be omitted.
17019 We explicitly postpone this check past the point where we handle
17020 function-definitions because we tolerate function-definitions
17021 that are missing their return types in some modes. */
17023 {
17027 }
17029 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17033 {
17041 {
17047 }
17048 }
17049 else
17050 {
17051 /* If the init-declarator isn't initialized and isn't followed by a
17052 `,' or `;', it's not a valid init-declarator. */
17055 {
17058 else
17059 {
17062 }
17063 }
17066 }
17068 /* Because start_decl has side-effects, we should only call it if we
17069 know we're going ahead. By this point, we know that we cannot
17070 possibly be looking at any other construct. */
17073 /* Enter the newly declared entry in the symbol table. If we're
17074 processing a declaration in a class-specifier, we wait until
17075 after processing the initializer. */
17077 {
17084 /* Adjust location of decl if declarator->id_loc is more appropriate:
17085 set, and decl wasn't merged with another decl, in which case its
17086 location would be different from input_location, and more accurate. */
17091 }
17093 /* Enter the SCOPE. That way unqualified names appearing in the
17094 initializer will be looked up in SCOPE. */
17097 /* Perform deferred access control checks, now that we know in which
17098 SCOPE the declared entity resides. */
17100 {
17103 /* If the entity being declared is a function, pretend that we
17104 are in its scope. If it is a `friend', it may have access to
17105 things that would not otherwise be accessible. */
17107 {
17110 }
17112 /* Perform access checks for template parameters. */
17115 /* Perform the access control checks for the declarator and the
17116 decl-specifiers. */
17119 /* Restore the saved value. */
17122 }
17124 /* Parse the initializer. */
17129 {
17131 {
17135 else
17136 {
17137 /* If the declaration was erroneous, we don't really
17138 know what the user intended, so just silently
17139 consume the initializer. */
17147 }
17148 }
17149 else
17150 {
17151 /* We want to record the extra mangling scope for in-class
17152 initializers of class members and initializers of static data
17153 member templates. The former involves deferring
17154 parsing of the initializer until end of class as with default
17155 arguments. So right here we only handle the latter. */
17165 }
17166 }
17168 /* The old parser allows attributes to appear after a parenthesized
17169 initializer. Mark Mitchell proposed removing this functionality
17170 on the GCC mailing lists on 2002-08-13. This parser accepts the
17171 attributes -- but ignores them. */
17178 /* And now complain about a non-function implicit template. */
17183 /* For an in-class declaration, use `grokfield' to create the
17184 declaration. */
17186 {
17188 {
17191 }
17199 }
17201 /* Finish processing the declaration. But, skip member
17202 declarations. */
17204 {
17207 asm_specification,
17208 /* If the initializer is in parentheses, then this is
17209 a direct-initialization, which means that an
17210 `explicit' constructor is OK. Otherwise, an
17211 `explicit' constructor cannot be used. */
17214 }
17217 /* Core issue #226 (C++0x only): A default template-argument
17218 shall not be specified in a friend class template
17219 declaration. */
17228 {
17231 else
17233 }
17236 }
17238 /* Parse a declarator.
17240 declarator:
17241 direct-declarator
17242 ptr-operator declarator
17244 abstract-declarator:
17245 ptr-operator abstract-declarator [opt]
17246 direct-abstract-declarator
17248 GNU Extensions:
17250 declarator:
17251 attributes [opt] direct-declarator
17252 attributes [opt] ptr-operator declarator
17254 abstract-declarator:
17255 attributes [opt] ptr-operator abstract-declarator [opt]
17256 attributes [opt] direct-abstract-declarator
17258 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17259 detect constructor, destructor or conversion operators. It is set
17260 to -1 if the declarator is a name, and +1 if it is a
17261 function. Otherwise it is set to zero. Usually you just want to
17262 test for >0, but internally the negative value is used.
17264 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17265 a decl-specifier-seq unless it declares a constructor, destructor,
17266 or conversion. It might seem that we could check this condition in
17267 semantic analysis, rather than parsing, but that makes it difficult
17268 to handle something like `f()'. We want to notice that there are
17269 no decl-specifiers, and therefore realize that this is an
17270 expression, not a declaration.)
17272 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17273 the declarator is a direct-declarator of the form "(...)".
17275 MEMBER_P is true iff this declarator is a member-declarator.
17277 FRIEND_P is true iff this declarator is a friend. */
17281 cp_parser_declarator_kind dcl_kind,
17285 {
17288 cp_cv_quals cv_quals;
17289 tree class_type;
17292 /* Assume this is not a constructor, destructor, or type-conversion
17293 operator. */
17300 /* Check for the ptr-operator production. */
17302 /* Parse the ptr-operator. */
17308 /* If that worked, then we have a ptr-operator. */
17310 {
17311 /* If a ptr-operator was found, then this declarator was not
17312 parenthesized. */
17315 /* The dependent declarator is optional if we are parsing an
17316 abstract-declarator. */
17320 /* Parse the dependent declarator. */
17325 friend_p);
17327 /* If we are parsing an abstract-declarator, we must handle the
17328 case where the dependent declarator is absent. */
17333 declarator = cp_parser_make_indirect_declarator
17335 }
17336 /* Everything else is a direct-declarator. */
17337 else
17338 {
17341 CPP_OPEN_PAREN);
17343 ctor_dtor_or_conv_p,
17345 }
17350 }
17352 /* Parse a direct-declarator or direct-abstract-declarator.
17354 direct-declarator:
17355 declarator-id
17356 direct-declarator ( parameter-declaration-clause )
17357 cv-qualifier-seq [opt]
17358 ref-qualifier [opt]
17359 exception-specification [opt]
17360 direct-declarator [ constant-expression [opt] ]
17361 ( declarator )
17363 direct-abstract-declarator:
17364 direct-abstract-declarator [opt]
17365 ( parameter-declaration-clause )
17366 cv-qualifier-seq [opt]
17367 ref-qualifier [opt]
17368 exception-specification [opt]
17369 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17370 ( abstract-declarator )
17372 Returns a representation of the declarator. DCL_KIND is
17373 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17374 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17375 we are parsing a direct-declarator. It is
17376 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17377 of ambiguity we prefer an abstract declarator, as per
17378 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17379 as for cp_parser_declarator. */
17383 cp_parser_declarator_kind dcl_kind,
17386 {
17396 {
17397 /* Peek at the next token. */
17400 {
17401 /* This is either a parameter-declaration-clause, or a
17402 parenthesized declarator. When we know we are parsing a
17403 named declarator, it must be a parenthesized declarator
17404 if FIRST is true. For instance, `(int)' is a
17405 parameter-declaration-clause, with an omitted
17406 direct-abstract-declarator. But `((*))', is a
17407 parenthesized abstract declarator. Finally, when T is a
17408 template parameter `(T)' is a
17409 parameter-declaration-clause, and not a parenthesized
17410 named declarator.
17412 We first try and parse a parameter-declaration-clause,
17413 and then try a nested declarator (if FIRST is true).
17415 It is not an error for it not to be a
17416 parameter-declaration-clause, even when FIRST is
17417 false. Consider,
17419 int i (int);
17420 int i (3);
17422 The first is the declaration of a function while the
17423 second is the definition of a variable, including its
17424 initializer.
17426 Having seen only the parenthesis, we cannot know which of
17427 these two alternatives should be selected. Even more
17428 complex are examples like:
17430 int i (int (a));
17431 int i (int (3));
17433 The former is a function-declaration; the latter is a
17434 variable initialization.
17436 Thus again, we try a parameter-declaration-clause, and if
17437 that fails, we back out and return. */
17440 {
17441 tree params;
17444 /* In a member-declarator, the only valid interpretation
17445 of a parenthesis is the start of a
17446 parameter-declaration-clause. (It is invalid to
17447 initialize a static data member with a parenthesized
17448 initializer; only the "=" form of initialization is
17449 permitted.) */
17453 /* Consume the `('. */
17456 {
17457 /* If this is going to be an abstract declarator, we're
17458 in a declarator and we can't have default args. */
17461 }
17465 /* Parse the parameter-declaration-clause. */
17468 /* Consume the `)'. */
17471 /* If all went well, parse the cv-qualifier-seq,
17472 ref-qualifier and the exception-specification. */
17474 {
17475 cp_cv_quals cv_quals;
17476 cp_virt_specifiers virt_specifiers;
17477 cp_ref_qualifier ref_qual;
17478 tree exception_specification;
17479 tree late_return;
17480 tree attrs;
17490 /* Parse the cv-qualifier-seq. */
17492 /* Parse the ref-qualifier. */
17494 /* And the exception-specification. */
17495 exception_specification
17500 /* In here, we handle cases where attribute is used after
17501 the function declaration. For example:
17502 void func (int x) __attribute__((vector(..))); */
17505 {
17509 CPP_SEMICOLON)
17511 CPP_OPEN_BRACE))
17514 ;
17515 else
17517 }
17518 late_return = (cp_parser_late_return_type_opt
17523 /* Parse the virt-specifier-seq. */
17526 /* Create the function-declarator. */
17528 params,
17529 cv_quals,
17530 virt_specifiers,
17531 ref_qual,
17532 exception_specification,
17533 late_return);
17535 /* Any subsequent parameter lists are to do with
17536 return type, so are not those of the declared
17537 function. */
17539 }
17541 /* Remove the function parms from scope. */
17545 /* Repeat the main loop. */
17547 }
17549 /* If this is the first, we can try a parenthesized
17550 declarator. */
17552 {
17558 /* Consume the `('. */
17560 /* Parse the nested declarator. */
17563 declarator
17569 /* Expect a `)'. */
17576 }
17577 /* Otherwise, we must be done. */
17578 else
17580 }
17584 {
17585 /* Parse an array-declarator. */
17594 /* Consume the `['. */
17596 /* Peek at the next token. */
17598 /* If the next token is `]', then there is no
17599 constant-expression. */
17601 {
17603 bounds
17613 {
17614 /* Normally, the array bound must be an integral constant
17615 expression. However, as an extension, we allow VLAs
17616 in function scopes as long as they aren't part of a
17617 parameter declaration. */
17621 }
17624 {
17625 /* Remember this wasn't a constant-expression. */
17628 }
17629 }
17630 else
17632 /* Look for the closing `]'. */
17634 {
17637 }
17642 }
17644 {
17645 {
17646 tree qualifying_scope;
17647 tree unqualified_name;
17648 tree attrs;
17649 special_function_kind sfk;
17654 /* Parse a declarator-id */
17657 {
17660 /* If we see an ellipsis, we should be looking at a
17661 parameter pack. */
17663 {
17664 /* Consume the `...' */
17668 }
17669 }
17672 unqualified_name
17676 {
17680 {
17681 /* Check whether an error occurred. */
17684 /* We already consumed the ellipsis to mark a
17685 parameter pack, but we have no way to report it,
17686 so abort the tentative parse. We will be exiting
17687 immediately anyway. */
17689 }
17690 else
17696 && (qualifying_scope
17698 {
17701 }
17702 }
17707 {
17712 }
17718 {
17719 /* In the declaration of a member of a template class
17720 outside of the class itself, the SCOPE will sometimes
17721 be a TYPENAME_TYPE. For example, given:
17723 template <typename T>
17724 int S<T>::R::i = 3;
17726 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17727 this context, we must resolve S<T>::R to an ordinary
17728 type, rather than a typename type.
17730 The reason we normally avoid resolving TYPENAME_TYPEs
17731 is that a specialization of `S' might render
17732 `S<T>::R' not a type. However, if `S' is
17733 specialized, then this `i' will not be used, so there
17734 is no harm in resolving the types here. */
17735 tree type;
17737 /* Resolve the TYPENAME_TYPE. */
17740 /* If that failed, the declarator is invalid. */
17742 {
17745 "cannot define member of dependent typedef "
17747 else
17752 }
17754 }
17759 {
17760 tree class_type;
17765 else
17769 {
17772 {
17775 {
17779 "use %<%T::%D%> instead of %<%T::%D%> to "
17781 class_type,
17786 }
17787 else
17789 }
17790 else
17791 {
17792 /* We do not attempt to print the declarator
17793 here because we do not have enough
17794 information about its original syntactic
17795 form. */
17799 }
17800 }
17803 {
17809 for an anonymous type, even if the type
17810 got a name for linkage purposes. */
17812 /* Handle correctly (c++/19200):
17814 struct S {
17815 struct T{};
17816 friend void S(T);
17817 };
17819 and also:
17821 namespace N {
17822 void S();
17823 }
17825 struct S {
17826 friend void N::S();
17827 }; */
17828 && !(friend_p
17831 class_type))
17832 {
17835 }
17843 }
17844 }
17846 unqualified_name,
17847 sfk);
17854 }
17856 handle_declarator:;
17859 {
17860 /* Any names that appear after the declarator-id for a
17861 member are looked up in the containing scope. */
17863 {
17864 /* But declarations with qualified-ids can't appear in a
17865 function. */
17869 }
17871 }
17875 /* Default args are only allowed on function
17876 declarations. */
17878 else
17882 }
17883 /* We're done. */
17884 else
17886 }
17888 /* For an abstract declarator, we might wind up with nothing at this
17889 point. That's an error; the declarator is not optional. */
17893 /* If we entered a scope, we must exit it now. */
17901 }
17903 /* Parse a ptr-operator.
17905 ptr-operator:
17906 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17907 * cv-qualifier-seq [opt]
17908 &
17909 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17910 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17912 GNU Extension:
17914 ptr-operator:
17915 & cv-qualifier-seq [opt]
17917 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17918 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17919 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17920 filled in with the TYPE containing the member. *CV_QUALS is
17921 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17922 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17923 Note that the tree codes returned by this function have nothing
17924 to do with the types of trees that will be eventually be created
17925 to represent the pointer or reference type being parsed. They are
17926 just constants with suggestive names. */
17927 static enum tree_code
17932 {
17937 /* Assume that it's not a pointer-to-member. */
17939 /* And that there are no cv-qualifiers. */
17942 /* Peek at the next token. */
17945 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17955 {
17956 /* Consume the `*', `&' or `&&'. */
17959 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17960 `&', if we are allowing GNU extensions. (The only qualifier
17961 that can legally appear after `&' is `restrict', but that is
17962 enforced during semantic analysis. */
17970 }
17971 else
17972 {
17973 /* Try the pointer-to-member case. */
17975 /* Look for the optional `::' operator. */
17978 /* Look for the nested-name specifier. */
17985 /* If we found it, and the next token is a `*', then we are
17986 indeed looking at a pointer-to-member operator. */
17989 {
17990 /* Indicate that the `*' operator was used. */
17998 else
17999 {
18000 /* The type of which the member is a member is given by the
18001 current SCOPE. */
18003 /* The next name will not be qualified. */
18007 /* Look for optional c++11 attributes. */
18011 /* Look for the optional cv-qualifier-seq. */
18013 }
18014 }
18015 /* If that didn't work we don't have a ptr-operator. */
18018 }
18021 }
18023 /* Parse an (optional) cv-qualifier-seq.
18025 cv-qualifier-seq:
18026 cv-qualifier cv-qualifier-seq [opt]
18028 cv-qualifier:
18029 const
18030 volatile
18032 GNU Extension:
18034 cv-qualifier:
18035 __restrict__
18037 Returns a bitmask representing the cv-qualifiers. */
18039 static cp_cv_quals
18041 {
18045 {
18047 cp_cv_quals cv_qualifier;
18049 /* Peek at the next token. */
18051 /* See if it's a cv-qualifier. */
18053 {
18069 }
18075 {
18078 }
18079 else
18080 {
18083 }
18084 }
18087 }
18089 /* Parse an (optional) ref-qualifier
18091 ref-qualifier:
18092 &
18093 &&
18095 Returns cp_ref_qualifier representing ref-qualifier. */
18097 static cp_ref_qualifier
18099 {
18102 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18107 {
18112 {
18124 }
18129 {
18132 }
18133 else
18134 {
18137 }
18138 }
18141 }
18143 /* Parse an (optional) virt-specifier-seq.
18145 virt-specifier-seq:
18146 virt-specifier virt-specifier-seq [opt]
18148 virt-specifier:
18149 override
18150 final
18152 Returns a bitmask representing the virt-specifiers. */
18154 static cp_virt_specifiers
18156 {
18160 {
18162 cp_virt_specifiers virt_specifier;
18164 /* Peek at the next token. */
18166 /* See if it's a virt-specifier-qualifier. */
18170 {
18173 }
18175 {
18178 }
18180 {
18182 }
18183 else
18187 {
18190 }
18191 else
18192 {
18195 }
18196 }
18198 }
18200 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18201 is in scope even though it isn't real. */
18203 void
18205 {
18206 tree this_parm;
18209 {
18210 /* We don't clear this between NSDMIs. Is it already what we want? */
18215 }
18218 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18220 current_class_ref
18223 }
18225 /* Return true iff our current scope is a non-static data member
18226 initializer. */
18228 bool
18230 {
18231 /* We recognize NSDMI context by the context-less 'this' pointer set up
18232 by the function above. */
18236 }
18238 /* Parse a late-specified return type, if any. This is not a separate
18239 non-terminal, but part of a function declarator, which looks like
18241 -> trailing-type-specifier-seq abstract-declarator(opt)
18243 Returns the type indicated by the type-id.
18245 In addition to this this parses any queued up omp declare simd
18246 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18248 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18249 function. */
18251 static tree
18253 cp_cv_quals quals)
18254 {
18258 && declarator
18264 /* Peek at the next token. */
18266 /* A late-specified return type is indicated by an initial '->'. */
18273 {
18274 /* DR 1207: 'this' is in scope in the trailing return type. */
18276 }
18279 {
18280 /* Consume the ->. */
18284 }
18287 declarator->std_attributes
18291 declarator->std_attributes
18296 {
18299 }
18302 }
18304 /* Parse a declarator-id.
18306 declarator-id:
18307 id-expression
18308 :: [opt] nested-name-specifier [opt] type-name
18310 In the `id-expression' case, the value returned is as for
18311 cp_parser_id_expression if the id-expression was an unqualified-id.
18312 If the id-expression was a qualified-id, then a SCOPE_REF is
18313 returned. The first operand is the scope (either a NAMESPACE_DECL
18314 or TREE_TYPE), but the second is still just a representation of an
18315 unqualified-id. */
18317 static tree
18319 {
18320 tree id;
18321 /* The expression must be an id-expression. Assume that qualified
18322 names are the names of types so that:
18324 template <class T>
18325 int S<T>::R::i = 3;
18327 will work; we must treat `S<T>::R' as the name of a type.
18328 Similarly, assume that qualified names are templates, where
18329 required, so that:
18331 template <class T>
18332 int S<T>::R<T>::i = 3;
18334 will work, too. */
18340 optional_p);
18344 }
18346 /* Parse a type-id.
18348 type-id:
18349 type-specifier-seq abstract-declarator [opt]
18351 Returns the TYPE specified. */
18353 static tree
18356 {
18357 cp_decl_specifier_seq type_specifier_seq;
18360 /* Parse the type-specifier-seq. */
18362 is_trailing_return,
18367 /* There might or might not be an abstract declarator. */
18369 /* Look for the declarator. */
18370 abstract_declarator
18375 /* Check to see if there really was a declarator. */
18380 /* None of the valid uses of 'auto' in C++14 involve the type-id
18381 nonterminal, but it is valid in a trailing-return-type. */
18384 {
18385 /* A type-id with type 'auto' is only ok if the abstract declarator
18386 is a function declarator with a late-specified return type. */
18391 else
18392 {
18395 }
18396 }
18399 is_template_arg);
18400 }
18403 {
18405 }
18408 {
18409 tree r;
18411 parser->type_definition_forbidden_message
18416 {
18419 }
18421 }
18424 {
18426 }
18428 /* Parse a type-specifier-seq.
18430 type-specifier-seq:
18431 type-specifier type-specifier-seq [opt]
18433 GNU extension:
18435 type-specifier-seq:
18436 attributes type-specifier-seq [opt]
18438 If IS_DECLARATION is true, we are at the start of a "condition" or
18439 exception-declaration, so we might be followed by a declarator-id.
18441 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18442 i.e. we've just seen "->".
18444 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18446 static void
18451 {
18456 /* Clear the TYPE_SPECIFIER_SEQ. */
18459 /* In the context of a trailing return type, enum E { } is an
18460 elaborated-type-specifier followed by a function-body, not an
18461 enum-specifier. */
18465 /* Parse the type-specifiers and attributes. */
18467 {
18468 tree type_specifier;
18471 /* Check for attributes first. */
18473 {
18478 }
18480 /* record the token of the beginning of the type specifier seq,
18481 for error reporting purposes*/
18485 /* Look for the type-specifier. */
18487 flags,
18488 type_specifier_seq,
18490 NULL,
18493 {
18494 /* If the first type-specifier could not be found, this is not a
18495 type-specifier-seq at all. */
18497 {
18498 /* Set in_declarator_p to avoid skipping to the semicolon. */
18510 }
18511 /* If subsequent type-specifiers could not be found, the
18512 type-specifier-seq is complete. */
18514 }
18517 /* The standard says that a condition can be:
18519 type-specifier-seq declarator = assignment-expression
18521 However, given:
18523 struct S {};
18524 if (int S = ...)
18526 we should treat the "S" as a declarator, not as a
18527 type-specifier. The standard doesn't say that explicitly for
18528 type-specifier-seq, but it does say that for
18529 decl-specifier-seq in an ordinary declaration. Perhaps it
18530 would be clearer just to allow a decl-specifier-seq here, and
18531 then add a semantic restriction that if any decl-specifiers
18532 that are not type-specifiers appear, the program is invalid. */
18535 }
18536 }
18538 /* Return whether the function currently being declared has an associated
18539 template parameter list. */
18541 static bool
18543 {
18556 }
18558 /* Parse a parameter-declaration-clause.
18560 parameter-declaration-clause:
18561 parameter-declaration-list [opt] ... [opt]
18562 parameter-declaration-list , ...
18564 Returns a representation for the parameter declarations. A return
18565 value of NULL indicates a parameter-declaration-clause consisting
18566 only of an ellipsis. */
18568 static tree
18570 {
18571 tree parameters;
18580 parser->auto_is_implicit_function_template_parm_p
18582 }
18588 && !processing_template_parmlist
18594 /* Peek at the next token. */
18596 /* Check for trivial parameter-declaration-clauses. */
18598 {
18599 /* Consume the `...' token. */
18602 }
18604 /* There are no parameters. */
18605 {
18606 #ifndef NO_IMPLICIT_EXTERN_C
18611 else
18612 #endif
18614 }
18615 /* Check for `(void)', too, which is a special case. */
18619 {
18620 /* Consume the `void' token. */
18622 /* There are no parameters. */
18624 }
18626 /* Parse the parameter-declaration-list. */
18628 /* If a parse error occurred while parsing the
18629 parameter-declaration-list, then the entire
18630 parameter-declaration-clause is erroneous. */
18634 /* Peek at the next token. */
18636 /* If it's a `,', the clause should terminate with an ellipsis. */
18638 {
18639 /* Consume the `,'. */
18641 /* Expect an ellipsis. */
18642 ellipsis_p
18644 }
18645 /* It might also be `...' if the optional trailing `,' was
18646 omitted. */
18648 {
18649 /* Consume the `...' token. */
18651 /* And remember that we saw it. */
18653 }
18654 else
18657 /* Finish the parameter list. */
18662 }
18664 /* Parse a parameter-declaration-list.
18666 parameter-declaration-list:
18667 parameter-declaration
18668 parameter-declaration-list , parameter-declaration
18670 Returns a representation of the parameter-declaration-list, as for
18671 cp_parser_parameter_declaration_clause. However, the
18672 `void_list_node' is never appended to the list. Upon return,
18673 *IS_ERROR will be true iff an error occurred. */
18675 static tree
18677 {
18683 /* Assume all will go well. */
18685 /* The special considerations that apply to a function within an
18686 unbraced linkage specifications do not apply to the parameters
18687 to the function. */
18688 saved_in_unbraced_linkage_specification_p
18692 /* Look for more parameters. */
18694 {
18702 /* Parse the parameter. */
18703 parameter
18708 /* We don't know yet if the enclosing context is deprecated, so wait
18709 and warn in grokparms if appropriate. */
18713 {
18714 /* If a function parameter pack was specified and an implicit template
18715 parameter was introduced during cp_parser_parameter_declaration,
18716 change any implicit parameters introduced into packs. */
18720 {
18728 }
18732 PARM,
18735 }
18739 /* If a parse error occurred parsing the parameter declaration,
18740 then the entire parameter-declaration-list is erroneous. */
18742 {
18746 }
18756 {
18760 }
18762 /* Add the new parameter to the list. */
18766 /* Peek at the next token. */
18769 /* These are for Objective-C++ */
18772 /* The parameter-declaration-list is complete. */
18775 {
18778 /* Peek at the next token. */
18780 /* If it's an ellipsis, then the list is complete. */
18783 /* Otherwise, there must be more parameters. Consume the
18784 `,'. */
18786 /* When parsing something like:
18788 int i(float f, double d)
18790 we can tell after seeing the declaration for "f" that we
18791 are not looking at an initialization of a variable "i",
18792 but rather at the declaration of a function "i".
18794 Due to the fact that the parsing of template arguments
18795 (as specified to a template-id) requires backtracking we
18796 cannot use this technique when inside a template argument
18797 list. */
18801 /* However, a parameter-declaration of the form
18802 "float(f)" (which is a valid declaration of a
18803 parameter "f") can also be interpreted as an
18804 expression (the conversion of "f" to "float"). */
18807 }
18808 else
18809 {
18817 }
18818 }
18820 parser->in_unbraced_linkage_specification_p
18823 /* Reset implicit_template_scope if we are about to leave the function
18824 parameter list that introduced it. Note that for out-of-line member
18825 definitions, there will be one or more class scopes before we get to
18826 the template parameter scope. */
18830 {
18834 {
18837 }
18838 }
18841 }
18843 /* Parse a parameter declaration.
18845 parameter-declaration:
18846 decl-specifier-seq ... [opt] declarator
18847 decl-specifier-seq declarator = assignment-expression
18848 decl-specifier-seq ... [opt] abstract-declarator [opt]
18849 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18851 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18852 declares a template parameter. (In that case, a non-nested `>'
18853 token encountered during the parsing of the assignment-expression
18854 is not interpreted as a greater-than operator.)
18856 Returns a representation of the parameter, or NULL if an error
18857 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18858 true iff the declarator is of the form "(p)". */
18864 {
18866 cp_decl_specifier_seq decl_specifiers;
18868 tree default_argument;
18872 /* In a template parameter, `>' is not an operator.
18874 [temp.param]
18876 When parsing a default template-argument for a non-type
18877 template-parameter, the first non-nested `>' is taken as the end
18878 of the template parameter-list rather than a greater-than
18879 operator. */
18881 /* Type definitions may not appear in parameter types. */
18883 parser->type_definition_forbidden_message
18886 /* Parse the declaration-specifiers. */
18888 CP_PARSER_FLAGS_NONE,
18892 /* Complain about missing 'typename' or other invalid type names. */
18897 /* If an error occurred, there's no reason to attempt to parse the
18898 rest of the declaration. */
18900 {
18903 }
18905 /* Peek at the next token. */
18908 /* If the next token is a `)', `,', `=', `>', or `...', then there
18909 is no declarator. However, when variadic templates are enabled,
18910 there may be a declarator following `...'. */
18915 {
18919 }
18920 /* Otherwise, there should be a declarator. */
18921 else
18922 {
18926 /* After seeing a decl-specifier-seq, if the next token is not a
18927 "(", there is no possibility that the code is a valid
18928 expression. Therefore, if parsing tentatively, we commit at
18929 this point. */
18931 /* In an expression context, having seen:
18933 (int((char ...
18935 we cannot be sure whether we are looking at a
18936 function-type (taking a "char" as a parameter) or a cast
18937 of some object of type "char" to "int". */
18943 /* Parse the declarator. */
18946 CP_PARSER_DECLARATOR_EITHER,
18948 parenthesized_p,
18952 /* After the declarator, allow more attributes. */
18953 decl_specifiers.attributes
18956 }
18958 /* If the next token is an ellipsis, and we have not seen a
18959 declarator name, and the type of the declarator contains parameter
18960 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18961 a parameter pack expansion expression. Otherwise, leave the
18962 ellipsis for a C-style variadic function. */
18965 {
18976 {
18977 /* Consume the `...'. */
18981 /* Build a pack expansion type */
18984 else
18986 }
18987 }
18989 /* The restriction on defining new types applies only to the type
18990 of the parameter, not to the default argument. */
18993 /* If the next token is `=', then process a default argument. */
18995 {
18997 /* If we are defining a class, then the tokens that make up the
18998 default argument must be saved and processed later. */
19003 /* Outside of a class definition, we can just parse the
19004 assignment-expression. */
19005 else
19006 default_argument
19010 {
19013 else
19014 {
19016 "default arguments are only "
19019 }
19020 }
19024 {
19025 /* Find the name of the parameter pack. */
19032 template_parm_p
19038 else
19040 template_parm_p
19047 }
19048 }
19049 else
19053 declarator,
19054 default_argument);
19055 }
19057 /* Parse a default argument and return it.
19059 TEMPLATE_PARM_P is true if this is a default argument for a
19060 non-type template parameter. */
19061 static tree
19063 {
19069 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19070 set correctly. */
19073 /* Local variable names (and the `this' keyword) may not
19074 appear in a default argument. */
19077 /* Parse the assignment-expression. */
19082 /* The "this" pointer is not valid in a default argument. */
19084 {
19089 }
19090 default_argument
19092 /* Restore the "this" pointer. */
19094 {
19097 }
19106 }
19108 /* Parse a function-body.
19110 function-body:
19111 compound_statement */
19113 static void
19115 {
19117 }
19119 /* Parse a ctor-initializer-opt followed by a function-body. Return
19120 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19121 is true we are parsing a function-try-block. */
19123 static bool
19126 {
19134 /* Begin the function body. */
19136 /* Parse the optional ctor-initializer. */
19139 /* If we're parsing a constexpr constructor definition, we need
19140 to check that the constructor body is indeed empty. However,
19141 before we get to cp_parser_function_body lot of junk has been
19142 generated, so we can't just check that we have an empty block.
19143 Rather we take a snapshot of the outermost block, and check whether
19144 cp_parser_function_body changed its state. */
19146 {
19150 }
19151 /* Parse the function-body. */
19155 /* Finish the function body. */
19159 }
19161 /* Parse an initializer.
19163 initializer:
19164 = initializer-clause
19165 ( expression-list )
19167 Returns an expression representing the initializer. If no
19168 initializer is present, NULL_TREE is returned.
19170 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19171 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19172 set to TRUE if there is no initializer present. If there is an
19173 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19174 is set to true; otherwise it is set to false. */
19176 static tree
19179 {
19181 tree init;
19183 /* Peek at the next token. */
19186 /* Let our caller know whether or not this initializer was
19187 parenthesized. */
19189 /* Assume that the initializer is constant. */
19193 {
19194 /* Consume the `='. */
19196 /* Parse the initializer-clause. */
19198 }
19200 {
19205 non_constant_p);
19210 }
19212 {
19217 }
19218 else
19219 {
19220 /* Anything else is an error. */
19223 }
19226 }
19228 /* Parse an initializer-clause.
19230 initializer-clause:
19231 assignment-expression
19232 braced-init-list
19234 Returns an expression representing the initializer.
19236 If the `assignment-expression' production is used the value
19237 returned is simply a representation for the expression.
19239 Otherwise, calls cp_parser_braced_list. */
19241 static tree
19243 {
19244 tree initializer;
19246 /* Assume the expression is constant. */
19249 /* If it is not a `{', then we are looking at an
19250 assignment-expression. */
19252 {
19253 initializer
19256 non_constant_p);
19257 }
19258 else
19262 }
19264 /* Parse a brace-enclosed initializer list.
19266 braced-init-list:
19267 { initializer-list , [opt] }
19268 { }
19270 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19271 the elements of the initializer-list (or NULL, if the last
19272 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19273 NULL_TREE. There is no way to detect whether or not the optional
19274 trailing `,' was provided. NON_CONSTANT_P is as for
19275 cp_parser_initializer. */
19277 static tree
19279 {
19280 tree initializer;
19282 /* Consume the `{' token. */
19284 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19286 /* If it's not a `}', then there is a non-trivial initializer. */
19288 {
19289 /* Parse the initializer list. */
19292 /* A trailing `,' token is allowed. */
19295 }
19296 else
19298 /* Now, there should be a trailing `}'. */
19302 }
19304 /* Consume tokens up to, and including, the next non-nested closing `]'.
19305 Returns true iff we found a closing `]'. */
19307 static bool
19309 {
19313 {
19317 {
19320 /* If we've run out of tokens, then there is no closing `]'. */
19329 {
19332 }
19337 }
19339 /* Consume the token. */
19341 }
19342 }
19344 /* Return true if we are looking at an array-designator, false otherwise. */
19346 static bool
19348 {
19349 /* Consume the `['. */
19354 /* Skip tokens until the next token is a closing square bracket.
19355 If we find the closing `]', and the next token is a `=', then
19356 we are looking at an array designator. */
19357 bool array_designator_p
19361 /* Roll back the tokens we skipped. */
19365 }
19367 /* Parse an initializer-list.
19369 initializer-list:
19370 initializer-clause ... [opt]
19371 initializer-list , initializer-clause ... [opt]
19373 GNU Extension:
19375 initializer-list:
19376 designation initializer-clause ...[opt]
19377 initializer-list , designation initializer-clause ...[opt]
19379 designation:
19380 . identifier =
19381 identifier :
19382 [ constant-expression ] =
19384 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19385 for the initializer. If the INDEX of the elt is non-NULL, it is the
19386 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19387 as for cp_parser_initializer. */
19391 {
19394 /* Assume all of the expressions are constant. */
19397 /* Parse the rest of the list. */
19399 {
19401 tree designator;
19402 tree initializer;
19405 /* If the next token is an identifier and the following one is a
19406 colon, we are looking at the GNU designated-initializer
19407 syntax. */
19411 {
19412 /* Warn the user that they are using an extension. */
19415 /* Consume the identifier. */
19417 /* Consume the `:'. */
19419 }
19420 /* Also handle the C99 syntax, '. id ='. */
19425 {
19426 /* Warn the user that they are using an extension. */
19429 /* Consume the `.'. */
19431 /* Consume the identifier. */
19433 /* Consume the `='. */
19435 }
19436 /* Also handle C99 array designators, '[ const ] ='. */
19440 {
19441 /* In C++11, [ could start a lambda-introducer. */
19447 {
19450 }
19451 else
19452 {
19457 }
19463 }
19464 else
19467 /* Parse the initializer. */
19470 /* If any clause is non-constant, so is the entire initializer. */
19474 /* If we have an ellipsis, this is an initializer pack
19475 expansion. */
19477 {
19478 /* Consume the `...'. */
19481 /* Turn the initializer into an initializer expansion. */
19483 }
19485 /* Add it to the vector. */
19488 /* If the next token is not a comma, we have reached the end of
19489 the list. */
19493 /* Peek at the next token. */
19495 /* If the next token is a `}', then we're still done. An
19496 initializer-clause can have a trailing `,' after the
19497 initializer-list and before the closing `}'. */
19501 /* Consume the `,' token. */
19503 }
19506 }
19508 /* Classes [gram.class] */
19510 /* Parse a class-name.
19512 class-name:
19513 identifier
19514 template-id
19516 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19517 to indicate that names looked up in dependent types should be
19518 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19519 keyword has been used to indicate that the name that appears next
19520 is a template. TAG_TYPE indicates the explicit tag given before
19521 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19522 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19523 is the class being defined in a class-head.
19525 Returns the TYPE_DECL representing the class. */
19527 static tree
19535 {
19536 tree decl;
19537 tree scope;
19542 /* All class-names start with an identifier. */
19545 {
19548 }
19550 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19551 to a template-id, so we save it here. */
19556 /* Any name names a type if we're following the `typename' keyword
19557 in a qualified name where the enclosing scope is type-dependent. */
19560 /* Handle the common case (an identifier, but not a template-id)
19561 efficiently. */
19564 {
19568 /* Look for the identifier. */
19572 /* If the next token isn't an identifier, we are certainly not
19573 looking at a class-name. */
19576 /* If we know this is a type-name, there's no need to look it
19577 up. */
19580 else
19581 {
19582 tree ambiguous_decls;
19583 /* If we already know that this lookup is ambiguous, then
19584 we've already issued an error message; there's no reason
19585 to check again. */
19587 {
19590 }
19591 /* If the next token is a `::', then the name must be a type
19592 name.
19594 [basic.lookup.qual]
19596 During the lookup for a name preceding the :: scope
19597 resolution operator, object, function, and enumerator
19598 names are ignored. */
19601 /* Look up the name. */
19603 tag_type,
19606 check_dependency_p,
19610 {
19614 }
19615 }
19616 }
19617 else
19618 {
19619 /* Try a template-id. */
19621 check_dependency_p,
19622 tag_type,
19623 is_declaration);
19626 }
19630 /* If this is a typename, create a TYPENAME_TYPE. */
19632 {
19637 }
19641 /* Check to see that it is really the name of a class. */
19645 /* Situations like this:
19647 template <typename T> struct A {
19648 typename T::template X<int>::I i;
19649 };
19651 are problematic. Is `T::template X<int>' a class-name? The
19652 standard does not seem to be definitive, but there is no other
19653 valid interpretation of the following `::'. Therefore, those
19654 names are considered class-names. */
19655 {
19659 }
19663 /* In Objective-C 2.0, a classname followed by '.' starts a
19664 dot-syntax expression, and it's not a type-name. */
19676 }
19678 /* Parse a class-specifier.
19680 class-specifier:
19681 class-head { member-specification [opt] }
19683 Returns the TREE_TYPE representing the class. */
19685 static tree
19687 {
19688 tree type;
19702 /* Parse the class-head. */
19705 /* If the class-head was a semantic disaster, skip the entire body
19706 of the class. */
19708 {
19712 }
19714 /* Look for the `{'. */
19716 {
19719 }
19723 /* Issue an error message if type-definitions are forbidden here. */
19725 /* Remember that we are defining one more class. */
19727 /* Inside the class, surrounding template-parameter-lists do not
19728 apply. */
19729 saved_num_template_parameter_lists
19732 /* We are not in a function body. */
19735 /* Or in a loop. */
19738 /* Or in a switch. */
19741 /* We are not immediately inside an extern "lang" block. */
19742 saved_in_unbraced_linkage_specification_p
19746 /* Start the class. */
19748 {
19751 }
19755 /* If the type is erroneous, skip the entire body of the class. */
19757 else
19758 /* Parse the member-specification. */
19761 /* Look for the trailing `}'. */
19763 /* Look for trailing attributes to apply to this class. */
19771 /* We've finished a type definition. Check for the common syntax
19772 error of forgetting a semicolon after the definition. We need to
19773 be careful, as we can't just check for not-a-semicolon and be done
19774 with it; the user might have typed:
19776 class X { } c = ...;
19777 class X { } *p = ...;
19779 and so forth. Instead, enumerate all the possible tokens that
19780 might follow this production; if we don't see one of them, then
19781 complain and silently insert the semicolon. */
19782 {
19787 /* Don't try to parse c++11 attributes here. As per the
19788 grammar, that should be a task for
19789 cp_parser_decl_specifier_seq. */
19793 {
19804 /* While it's legal for type qualifiers and storage class
19805 specifiers to follow type definitions in the grammar, only
19806 compiler testsuites contain code like that. Assume that if
19807 we see such code, then what we're really seeing is a case
19808 like:
19810 class X { }
19811 const <type> var = ...;
19813 or
19815 class Y { }
19816 static <type> func (...) ...
19818 i.e. the qualifier or specifier applies to the next
19819 declaration. To do so, however, we need to look ahead one
19820 more token to see if *that* token is a type specifier.
19822 This code could be improved to handle:
19824 class Z { }
19825 static const <type> var = ...; */
19828 {
19831 /* Handling user-defined types here would be nice, but very
19832 tricky. */
19833 want_semicolon
19836 }
19840 }
19842 /* If we don't have a type, then something is very wrong and we
19843 shouldn't try to do anything clever. Likewise for not seeing the
19844 closing brace. */
19846 {
19847 cp_token_position prev
19858 else
19861 /* Unget one token and smash it to look as though we encountered
19862 a semicolon in the input stream. */
19867 }
19868 }
19870 /* If this class is not itself within the scope of another class,
19871 then we need to parse the bodies of all of the queued function
19872 definitions. Note that the queued functions defined in a class
19873 are not always processed immediately following the
19874 class-specifier for that class. Consider:
19876 struct A {
19877 struct B { void f() { sizeof (A); } };
19878 };
19880 If `f' were processed before the processing of `A' were
19881 completed, there would be no way to compute the size of `A'.
19882 Note that the nesting we are interested in here is lexical --
19883 not the semantic nesting given by TYPE_CONTEXT. In particular,
19884 for:
19886 struct A { struct B; };
19887 struct A::B { void f() { } };
19889 there is no need to delay the parsing of `A::B::f'. */
19891 {
19892 tree decl;
19899 /* In a first pass, parse default arguments to the functions.
19900 Then, in a second pass, parse the bodies of the functions.
19901 This two-phased approach handles cases like:
19903 struct S {
19904 void f() { g(); }
19905 void g(int i = 3);
19906 };
19908 */
19910 {
19912 /* If there are default arguments that have not yet been processed,
19913 take care of them now. */
19915 {
19920 }
19921 /* Make sure that any template parameters are in scope. */
19923 /* Parse the default argument expressions. */
19925 /* Remove any template parameters from the symbol table. */
19927 }
19929 /* Now parse any NSDMIs. */
19933 {
19935 {
19940 }
19943 }
19950 /* Now do some post-NSDMI bookkeeping. */
19956 /* Now parse the body of the functions. */
19958 {
19959 /* OpenMP UDRs need to be parsed before all other functions. */
19966 }
19967 else
19971 }
19972 else
19975 /* Put back any saved access checks. */
19978 /* Restore saved state. */
19982 parser->num_template_parameter_lists
19984 parser->in_unbraced_linkage_specification_p
19988 }
19990 static tree
19992 {
19993 tree ret;
19998 }
20000 /* Parse a class-head.
20002 class-head:
20003 class-key identifier [opt] base-clause [opt]
20004 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20005 class-key nested-name-specifier [opt] template-id
20006 base-clause [opt]
20008 class-virt-specifier:
20009 final
20011 GNU Extensions:
20012 class-key attributes identifier [opt] base-clause [opt]
20013 class-key attributes nested-name-specifier identifier base-clause [opt]
20014 class-key attributes nested-name-specifier [opt] template-id
20015 base-clause [opt]
20017 Upon return BASES is initialized to the list of base classes (or
20018 NULL, if there are none) in the same form returned by
20019 cp_parser_base_clause.
20021 Returns the TYPE of the indicated class. Sets
20022 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20023 involving a nested-name-specifier was used, and FALSE otherwise.
20025 Returns error_mark_node if this is not a class-head.
20027 Returns NULL_TREE if the class-head is syntactically valid, but
20028 semantically invalid in a way that means we should skip the entire
20029 body of the class. */
20031 static tree
20034 {
20035 tree nested_name_specifier;
20039 tree attributes;
20040 tree bases;
20050 /* Assume no nested-name-specifier will be present. */
20052 /* Assume no template parameter lists will be used in defining the
20053 type. */
20057 /* Look for the class-key. */
20062 /* Parse the attributes. */
20065 /* If the next token is `::', that is invalid -- but sometimes
20066 people do try to write:
20068 struct ::S {};
20070 Handle this gracefully by accepting the extra qualifier, and then
20071 issuing an error about it later if this really is a
20072 class-head. If it turns out just to be an elaborated type
20073 specifier, remain silent. */
20079 /* Determine the name of the class. Begin by looking for an
20080 optional nested-name-specifier. */
20082 nested_name_specifier
20088 /* If there was a nested-name-specifier, then there *must* be an
20089 identifier. */
20091 {
20093 /* Although the grammar says `identifier', it really means
20094 `class-name' or `template-name'. You are only allowed to
20095 define a class that has already been declared with this
20096 syntax.
20098 The proposed resolution for Core Issue 180 says that wherever
20099 you see `class T::X' you should treat `X' as a type-name.
20101 It is OK to define an inaccessible class; for example:
20103 class A { class B; };
20104 class A::B {};
20106 We do not know if we will see a class-name, or a
20107 template-name. We look for a class-name first, in case the
20108 class-name is a template-id; if we looked for the
20109 template-name first we would stop after the template-name. */
20114 class_type,
20118 /* If that didn't work, ignore the nested-name-specifier. */
20120 {
20126 }
20127 /* If we could not find a corresponding TYPE, treat this
20128 declaration like an unqualified declaration. */
20131 /* Otherwise, count the number of templates used in TYPE and its
20132 containing scopes. */
20133 else
20134 {
20135 tree scope;
20147 }
20148 }
20149 /* Otherwise, the identifier is optional. */
20150 else
20151 {
20152 /* We don't know whether what comes next is a template-id,
20153 an identifier, or nothing at all. */
20155 /* Check for a template-id. */
20160 class_key,
20162 /* If that didn't work, it could still be an identifier. */
20164 {
20166 {
20169 }
20170 else
20172 }
20173 else
20174 {
20177 }
20178 }
20183 {
20185 class_key,
20187 }
20190 /* If it's not a `:' or a `{' then we can't really be looking at a
20191 class-head, since a class-head only appears as part of a
20192 class-specifier. We have to detect this situation before calling
20193 xref_tag, since that has irreversible side-effects. */
20195 {
20199 }
20201 /* At this point, we're going ahead with the class-specifier, even
20202 if some other problem occurs. */
20205 {
20210 }
20211 /* Issue the error about the overly-qualified name now. */
20213 {
20218 }
20220 {
20225 }
20227 {
20228 tree scope;
20230 /* Reject typedef-names in class heads. */
20232 {
20235 type);
20238 }
20240 /* Figure out in what scope the declaration is being placed. */
20242 /* If that scope does not contain the scope in which the
20243 class was originally declared, the program is invalid. */
20245 {
20248 "declaration of %qD in namespace %qD which does not "
20251 else
20257 }
20258 /* [dcl.meaning]
20260 A declarator-id shall not be qualified except for the
20261 definition of a ... nested class outside of its class
20262 ... [or] the definition or explicit instantiation of a
20263 class member of a namespace outside of its namespace. */
20265 {
20270 }
20271 }
20272 /* An explicit-specialization must be preceded by "template <>". If
20273 it is not, try to recover gracefully. */
20277 {
20281 /* Take the same action that would have been taken by
20282 cp_parser_explicit_specialization. */
20285 }
20286 /* There must be no "return" statements between this point and the
20287 end of this function; set "type "to the correct return value and
20288 use "goto done;" to return. */
20289 /* Make sure that the right number of template parameters were
20290 present. */
20294 {
20295 /* If something went wrong, there is no point in even trying to
20296 process the class-definition. */
20299 }
20301 /* Look up the type. */
20303 {
20307 {
20311 }
20312 else
20313 {
20316 }
20319 }
20321 {
20322 tree class_type;
20324 /* Given:
20326 template <typename T> struct S { struct T };
20327 template <typename T> struct S<T>::T { };
20329 we will get a TYPENAME_TYPE when processing the definition of
20330 `S::T'. We need to resolve it to the actual type before we
20331 try to define it. */
20333 {
20338 else
20339 {
20342 }
20343 }
20347 {
20350 }
20353 /* Enter the scope indicated by the nested-name-specifier. */
20355 /* Get the canonical version of this type. */
20357 /* Call push_template_decl if it seems like we should be defining a
20358 template either from the template headers or the type we're
20359 defining, so that we diagnose both extra and missing headers. */
20363 {
20366 {
20369 }
20370 }
20374 }
20376 {
20377 /* If the class was unnamed, create a dummy name. */
20382 }
20384 /* Indicate whether this class was declared as a `class' or as a
20385 `struct'. */
20390 /* If this type was already complete, and we see another definition,
20391 that's an error. */
20393 {
20395 type);
20397 type);
20400 }
20405 {
20406 /* Apply attributes now, before any use of the class as a template
20407 argument in its base list. */
20410 }
20412 /* We will have entered the scope containing the class; the names of
20413 base classes should be looked up in that context. For example:
20415 struct A { struct B {}; struct C; };
20416 struct A::C : B {};
20418 is valid. */
20420 /* Get the list of base-classes, if there is one. */
20422 {
20423 /* PR59482: enter the class scope so that base-specifiers are looked
20424 up correctly. */
20428 /* PR59482: get out of the previously pushed class scope so that the
20429 subsequent pops pop the right thing. */
20432 }
20433 else
20436 /* If we're really defining a class, process the base classes.
20437 If they're invalid, fail. */
20442 done:
20443 /* Leave the scope given by the nested-name-specifier. We will
20444 enter the class scope itself while processing the members. */
20449 {
20452 }
20458 out:
20461 }
20463 /* Parse a class-key.
20465 class-key:
20466 class
20467 struct
20468 union
20470 Returns the kind of class-key specified, or none_type to indicate
20471 error. */
20473 static enum tag_types
20475 {
20479 /* Look for the class-key. */
20484 /* Check to see if the TOKEN is a class-key. */
20489 }
20491 /* Parse a type-parameter-key.
20493 type-parameter-key:
20494 class
20495 typename
20496 */
20498 static void
20500 {
20501 /* Look for the type-parameter-key. */
20505 {
20508 /* typename is not allowed in a template template parameter
20509 by the standard until C++1Z. */
20511 "ISO C++ forbids typename key in template template parameter;"
20513 }
20514 else
20518 }
20520 /* Parse an (optional) member-specification.
20522 member-specification:
20523 member-declaration member-specification [opt]
20524 access-specifier : member-specification [opt] */
20526 static void
20528 {
20530 {
20534 /* Peek at the next token. */
20536 /* If it's a `}', or EOF then we've seen all the members. */
20542 /* See if this token is a keyword. */
20545 {
20549 /* Consume the access-specifier. */
20551 /* Remember which access-specifier is active. */
20553 /* Look for the `:'. */
20558 /* Accept #pragmas at class scope. */
20560 {
20563 }
20565 /* Otherwise, the next construction must be a
20566 member-declaration. */
20568 }
20569 }
20570 }
20572 /* Parse a member-declaration.
20574 member-declaration:
20575 decl-specifier-seq [opt] member-declarator-list [opt] ;
20576 function-definition ; [opt]
20577 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20578 using-declaration
20579 template-declaration
20580 alias-declaration
20582 member-declarator-list:
20583 member-declarator
20584 member-declarator-list , member-declarator
20586 member-declarator:
20587 declarator pure-specifier [opt]
20588 declarator constant-initializer [opt]
20589 identifier [opt] : constant-expression
20591 GNU Extensions:
20593 member-declaration:
20594 __extension__ member-declaration
20596 member-declarator:
20597 declarator attributes [opt] pure-specifier [opt]
20598 declarator attributes [opt] constant-initializer [opt]
20599 identifier [opt] attributes [opt] : constant-expression
20601 C++0x Extensions:
20603 member-declaration:
20604 static_assert-declaration */
20606 static void
20608 {
20609 cp_decl_specifier_seq decl_specifiers;
20610 tree prefix_attributes;
20611 tree decl;
20620 /* Check for the `__extension__' keyword. */
20622 {
20623 /* Recurse. */
20625 /* Restore the old value of the PEDANTIC flag. */
20629 }
20631 /* Check for a template-declaration. */
20633 {
20634 /* An explicit specialization here is an error condition, and we
20635 expect the specialization handler to detect and report this. */
20639 else
20643 }
20645 /* Check for a using-declaration. */
20647 {
20649 {
20650 /* Parse the using-declaration. */
20654 }
20655 else
20656 {
20657 tree decl;
20661 /* Note that if we actually see the '=' token after the
20662 identifier, cp_parser_alias_declaration commits the
20663 tentative parse. In that case, we really expects an
20664 alias-declaration. Otherwise, we expect a using
20665 declaration. */
20666 alias_decl_expected =
20672 else
20676 }
20677 }
20679 /* Check for @defs. */
20681 {
20686 {
20691 }
20693 }
20695 /* If the next token is `static_assert' we have a static assertion. */
20697 {
20700 }
20707 /* Parse the decl-specifier-seq. */
20710 CP_PARSER_FLAGS_OPTIONAL,
20713 /* Check for an invalid type-name. */
20717 /* If there is no declarator, then the decl-specifier-seq should
20718 specify a type. */
20720 {
20721 /* If there was no decl-specifier-seq, and the next token is a
20722 `;', then we have something like:
20724 struct S { ; };
20726 [class.mem]
20728 Each member-declaration shall declare at least one member
20729 name of the class. */
20731 {
20735 }
20736 else
20737 {
20738 tree type;
20740 /* See if this declaration is a friend. */
20742 /* If there were decl-specifiers, check to see if there was
20743 a class-declaration. */
20746 /* Nested classes have already been added to the class, but
20747 a `friend' needs to be explicitly registered. */
20749 {
20750 /* If the `friend' keyword was present, the friend must
20751 be introduced with a class-key. */
20754 "in C++03 a class-key must be used "
20756 /* In this case:
20758 template <typename T> struct A {
20759 friend struct A<T>::B;
20760 };
20762 A<T>::B will be represented by a TYPENAME_TYPE, and
20763 therefore not recognized by check_tag_decl. */
20765 {
20769 }
20772 "friend declaration does not name a class or "
20774 else
20777 }
20778 /* If there is no TYPE, an error message will already have
20779 been issued. */
20781 ;
20782 /* An anonymous aggregate has to be handled specially; such
20783 a declaration really declares a data member (with a
20784 particular type), as opposed to a nested class. */
20786 {
20787 /* C++11 9.5/6. */
20790 "a storage class on an anonymous aggregate "
20793 /* Remove constructors and such from TYPE, now that we
20794 know it is an anonymous aggregate. */
20796 /* And make the corresponding data member. */
20799 /* Add it to the class. */
20801 }
20802 else
20803 cp_parser_check_access_in_redeclaration
20806 }
20807 }
20808 else
20809 {
20812 /* Clear attributes from the decl_specifiers but keep them
20813 around as prefix attributes that apply them to the entity
20814 being declared. */
20818 /* See if these declarations will be friends. */
20821 /* Keep going until we hit the `;' at the end of the
20822 declaration. */
20824 {
20826 tree first_attribute;
20828 /* Peek at the next token. */
20831 /* Check for a bitfield declaration. */
20836 {
20837 tree identifier;
20838 tree width;
20840 /* Get the name of the bitfield. Note that we cannot just
20841 check TOKEN here because it may have been invalidated by
20842 the call to cp_lexer_peek_nth_token above. */
20845 else
20848 /* Consume the `:' token. */
20850 /* Get the width of the bitfield. */
20851 width
20854 /* Look for attributes that apply to the bitfield. */
20856 /* Remember which attributes are prefix attributes and
20857 which are not. */
20859 /* Combine the attributes. */
20862 /* Create the bitfield declaration. */
20865 identifier,
20866 sfk_none)
20869 width,
20870 attributes);
20871 }
20872 else
20873 {
20875 tree initializer;
20876 tree asm_specification;
20879 /* Parse the declarator. */
20880 declarator
20885 friend_p);
20887 /* If something went wrong parsing the declarator, make sure
20888 that we at least consume some tokens. */
20890 {
20891 /* Skip to the end of the statement. */
20893 /* If the next token is not a semicolon, that is
20894 probably because we just skipped over the body of
20895 a function. So, we consume a semicolon if
20896 present, but do not issue an error message if it
20897 is not present. */
20899 CPP_SEMICOLON))
20902 }
20905 cp_parser_check_for_definition_in_return_type
20909 /* Look for an asm-specification. */
20911 /* Look for attributes that apply to the declaration. */
20913 /* Remember which attributes are prefix attributes and
20914 which are not. */
20916 /* Combine the attributes. */
20919 /* If it's an `=', then we have a constant-initializer or a
20920 pure-specifier. It is not correct to parse the
20921 initializer before registering the member declaration
20922 since the member declaration should be in scope while
20923 its initializer is processed. However, the rest of the
20924 front end does not yet provide an interface that allows
20925 us to handle this correctly. */
20927 {
20928 /* In [class.mem]:
20930 A pure-specifier shall be used only in the declaration of
20931 a virtual function.
20933 A member-declarator can contain a constant-initializer
20934 only if it declares a static member of integral or
20935 enumeration type.
20937 Therefore, if the DECLARATOR is for a function, we look
20938 for a pure-specifier; otherwise, we look for a
20939 constant-initializer. When we call `grokfield', it will
20940 perform more stringent semantics checks. */
20952 {
20954 /* Don't require a constant rvalue in C++11, since we
20955 might want a reference constant. We'll enforce
20956 constancy later. */
20958 /* Parse the initializer. */
20961 }
20962 else
20963 /* Parse the initializer. */
20965 }
20968 {
20972 else
20974 }
20975 /* Otherwise, there is no initializer. */
20976 else
20979 /* See if we are probably looking at a function
20980 definition. We are certainly not looking at a
20981 member-declarator. Calling `grokfield' has
20982 side-effects, so we must not do it unless we are sure
20983 that we are looking at a member-declarator. */
20986 {
20987 /* The grammar does not allow a pure-specifier to be
20988 used when a member function is defined. (It is
20989 possible that this fact is an oversight in the
20990 standard, since a pure function may be defined
20991 outside of the class-specifier. */
20997 declarator,
20998 attributes);
21001 /* If the member was not a friend, declare it here. */
21004 /* Peek at the next token. */
21006 /* If the next token is a semicolon, consume it. */
21010 }
21011 else
21014 /* Create the declaration. */
21019 {
21022 else
21024 }
21025 }
21029 /* Reset PREFIX_ATTRIBUTES. */
21035 /* If there is any qualification still in effect, clear it
21036 now; we will be starting fresh with the next declarator. */
21040 /* If it's a `,', then there are more declarators. */
21042 {
21045 {
21049 }
21050 }
21051 /* If the next token isn't a `;', then we have a parse error. */
21053 CPP_SEMICOLON))
21054 {
21055 /* The next token might be a ways away from where the
21056 actual semicolon is missing. Find the previous token
21057 and use that for our error position. */
21062 /* Assume that the user meant to provide a semicolon. If
21063 we were to cp_parser_skip_to_end_of_statement, we might
21064 skip to a semicolon inside a member function definition
21065 and issue nonsensical error messages. */
21067 }
21070 {
21071 /* Add DECL to the list of members. */
21080 /* Add DECL to the queue of NSDMI to be parsed later. */
21082 }
21086 }
21087 }
21090 out:
21092 }
21094 /* Parse a pure-specifier.
21096 pure-specifier:
21097 = 0
21099 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21100 Otherwise, ERROR_MARK_NODE is returned. */
21102 static tree
21104 {
21107 /* Look for the `=' token. */
21110 /* Look for the `0' token. */
21119 /* Accept = default or = delete in c++0x mode. */
21122 {
21125 }
21127 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21129 {
21134 }
21136 {
21139 }
21142 }
21144 /* Parse a constant-initializer.
21146 constant-initializer:
21147 = constant-expression
21149 Returns a representation of the constant-expression. */
21151 static tree
21153 {
21154 /* Look for the `=' token. */
21158 /* It is invalid to write:
21160 struct S { static const int i = { 7 }; };
21162 */
21164 {
21167 /* Consume the opening brace. */
21169 /* Skip the initializer. */
21171 /* Look for the trailing `}'. */
21175 }
21178 }
21180 /* Derived classes [gram.class.derived] */
21182 /* Parse a base-clause.
21184 base-clause:
21185 : base-specifier-list
21187 base-specifier-list:
21188 base-specifier ... [opt]
21189 base-specifier-list , base-specifier ... [opt]
21191 Returns a TREE_LIST representing the base-classes, in the order in
21192 which they were declared. The representation of each node is as
21193 described by cp_parser_base_specifier.
21195 In the case that no bases are specified, this function will return
21196 NULL_TREE, not ERROR_MARK_NODE. */
21198 static tree
21200 {
21203 /* Look for the `:' that begins the list. */
21206 /* Scan the base-specifier-list. */
21208 {
21210 tree base;
21213 /* Look for the base-specifier. */
21215 /* Look for the (optional) ellipsis. */
21217 {
21218 /* Consume the `...'. */
21222 }
21224 /* Add BASE to the front of the list. */
21226 {
21228 /* Make this a pack expansion type. */
21232 {
21235 }
21236 }
21237 /* Peek at the next token. */
21239 /* If it's not a comma, then the list is complete. */
21242 /* Consume the `,'. */
21244 }
21246 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21247 base class had a qualified name. However, the next name that
21248 appears is certainly not qualified. */
21254 }
21256 /* Parse a base-specifier.
21258 base-specifier:
21259 :: [opt] nested-name-specifier [opt] class-name
21260 virtual access-specifier [opt] :: [opt] nested-name-specifier
21261 [opt] class-name
21262 access-specifier virtual [opt] :: [opt] nested-name-specifier
21263 [opt] class-name
21265 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21266 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21267 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21268 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21270 static tree
21272 {
21280 tree type;
21282 /* Process the optional `virtual' and `access-specifier'. */
21284 {
21285 /* Peek at the next token. */
21287 /* Process `virtual'. */
21289 {
21291 /* If `virtual' appears more than once, issue an error. */
21293 {
21297 }
21301 /* Consume the `virtual' token. */
21309 /* If more than one access specifier appears, issue an
21310 error. */
21313 {
21317 }
21321 /* Consume the access-specifier. */
21329 }
21330 }
21331 /* It is not uncommon to see programs mechanically, erroneously, use
21332 the 'typename' keyword to denote (dependent) qualified types
21333 as base classes. */
21335 {
21340 else
21342 "keyword %<typename%> not allowed in this context "
21345 }
21347 /* Look for the optional `::' operator. */
21349 /* Look for the nested-name-specifier. The simplest way to
21350 implement:
21352 [temp.res]
21354 The keyword `typename' is not permitted in a base-specifier or
21355 mem-initializer; in these contexts a qualified name that
21356 depends on a template-parameter is implicitly assumed to be a
21357 type name.
21359 is to pretend that we have seen the `typename' keyword at this
21360 point. */
21364 typename_type,
21366 /* If the base class is given by a qualified name, assume that names
21367 we see are type names or templates, as appropriate. */
21373 /* DR 950 allows decltype as a base-specifier. */
21375 else
21376 {
21377 /* Otherwise, look for the class-name. */
21379 class_scope_p,
21380 template_p,
21381 typename_type,
21386 }
21392 }
21394 /* Exception handling [gram.exception] */
21396 /* Parse an (optional) noexcept-specification.
21398 noexcept-specification:
21399 noexcept ( constant-expression ) [opt]
21401 If no noexcept-specification is present, returns NULL_TREE.
21402 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21403 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21404 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21405 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21406 in which case a boolean condition is returned instead. */
21408 static tree
21413 {
21417 /* Peek at the next token. */
21420 /* Is it a noexcept-specification? */
21422 {
21423 tree expr;
21427 {
21431 {
21432 /* Types may not be defined in an exception-specification. */
21434 parser->type_definition_forbidden_message
21439 /* Restore the saved message. */
21441 }
21442 else
21443 {
21446 }
21449 }
21450 else
21451 {
21455 }
21457 /* We cannot build a noexcept-spec right away because this will check
21458 that expr is a constexpr. */
21461 else
21463 }
21464 else
21466 }
21468 /* Parse an (optional) exception-specification.
21470 exception-specification:
21471 throw ( type-id-list [opt] )
21473 Returns a TREE_LIST representing the exception-specification. The
21474 TREE_VALUE of each node is a type. */
21476 static tree
21478 {
21480 tree type_id_list;
21483 /* Peek at the next token. */
21486 /* Is it a noexcept-specification? */
21492 /* If it's not `throw', then there's no exception-specification. */
21496 #if 0
21497 /* Enable this once a lot of code has transitioned to noexcept? */
21501 #endif
21503 /* Consume the `throw'. */
21506 /* Look for the `('. */
21509 /* Peek at the next token. */
21511 /* If it's not a `)', then there is a type-id-list. */
21513 {
21514 /* Types may not be defined in an exception-specification. */
21516 parser->type_definition_forbidden_message
21518 /* Parse the type-id-list. */
21520 /* Restore the saved message. */
21522 }
21523 else
21526 /* Look for the `)'. */
21530 }
21532 /* Parse an (optional) type-id-list.
21534 type-id-list:
21535 type-id ... [opt]
21536 type-id-list , type-id ... [opt]
21538 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21539 in the order that the types were presented. */
21541 static tree
21543 {
21547 {
21549 tree type;
21551 /* Get the next type-id. */
21553 /* Parse the optional ellipsis. */
21555 {
21556 /* Consume the `...'. */
21559 /* Turn the type into a pack expansion expression. */
21561 }
21562 /* Add it to the list. */
21564 /* Peek at the next token. */
21566 /* If it is not a `,', we are done. */
21569 /* Consume the `,'. */
21571 }
21574 }
21576 /* Parse a try-block.
21578 try-block:
21579 try compound-statement handler-seq */
21581 static tree
21583 {
21584 tree try_block;
21598 }
21600 /* Parse a function-try-block.
21602 function-try-block:
21603 try ctor-initializer [opt] function-body handler-seq */
21605 static bool
21607 {
21608 tree compound_stmt;
21609 tree try_block;
21612 /* Look for the `try' keyword. */
21615 /* Let the rest of the front end know where we are. */
21617 /* Parse the function-body. */
21618 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21620 /* We're done with the `try' part. */
21622 /* Parse the handlers. */
21624 /* We're done with the handlers. */
21628 }
21630 /* Parse a handler-seq.
21632 handler-seq:
21633 handler handler-seq [opt] */
21635 static void
21637 {
21639 {
21642 /* Parse the handler. */
21644 /* Peek at the next token. */
21646 /* If it's not `catch' then there are no more handlers. */
21649 }
21650 }
21652 /* Parse a handler.
21654 handler:
21655 catch ( exception-declaration ) compound-statement */
21657 static void
21659 {
21660 tree handler;
21661 tree declaration;
21671 }
21673 /* Parse an exception-declaration.
21675 exception-declaration:
21676 type-specifier-seq declarator
21677 type-specifier-seq abstract-declarator
21678 type-specifier-seq
21679 ...
21681 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21682 ellipsis variant is used. */
21684 static tree
21686 {
21687 cp_decl_specifier_seq type_specifiers;
21691 /* If it's an ellipsis, it's easy to handle. */
21693 {
21694 /* Consume the `...' token. */
21697 }
21699 /* Types may not be defined in exception-declarations. */
21701 parser->type_definition_forbidden_message
21704 /* Parse the type-specifier-seq. */
21708 /* If it's a `)', then there is no declarator. */
21711 else
21718 /* Restore the saved message. */
21725 }
21727 /* Parse a throw-expression.
21729 throw-expression:
21730 throw assignment-expression [opt]
21732 Returns a THROW_EXPR representing the throw-expression. */
21734 static tree
21736 {
21737 tree expression;
21742 /* Figure out whether or not there is an assignment-expression
21743 following the "throw" keyword. */
21751 else
21755 }
21757 /* GNU Extensions */
21759 /* Parse an (optional) asm-specification.
21761 asm-specification:
21762 asm ( string-literal )
21764 If the asm-specification is present, returns a STRING_CST
21765 corresponding to the string-literal. Otherwise, returns
21766 NULL_TREE. */
21768 static tree
21770 {
21772 tree asm_specification;
21774 /* Peek at the next token. */
21776 /* If the next token isn't the `asm' keyword, then there's no
21777 asm-specification. */
21781 /* Consume the `asm' token. */
21783 /* Look for the `('. */
21786 /* Look for the string-literal. */
21789 /* Look for the `)'. */
21793 }
21795 /* Parse an asm-operand-list.
21797 asm-operand-list:
21798 asm-operand
21799 asm-operand-list , asm-operand
21801 asm-operand:
21802 string-literal ( expression )
21803 [ string-literal ] string-literal ( expression )
21805 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21806 each node is the expression. The TREE_PURPOSE is itself a
21807 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21808 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21809 is a STRING_CST for the string literal before the parenthesis. Returns
21810 ERROR_MARK_NODE if any of the operands are invalid. */
21812 static tree
21814 {
21819 {
21820 tree string_literal;
21821 tree expression;
21822 tree name;
21825 {
21826 /* Consume the `[' token. */
21828 /* Read the operand name. */
21833 /* Look for the closing `]'. */
21835 }
21836 else
21838 /* Look for the string-literal. */
21841 /* Look for the `('. */
21843 /* Parse the expression. */
21845 /* Look for the `)'. */
21853 /* Add this operand to the list. */
21855 expression,
21856 asm_operands);
21857 /* If the next token is not a `,', there are no more
21858 operands. */
21861 /* Consume the `,'. */
21863 }
21866 }
21868 /* Parse an asm-clobber-list.
21870 asm-clobber-list:
21871 string-literal
21872 asm-clobber-list , string-literal
21874 Returns a TREE_LIST, indicating the clobbers in the order that they
21875 appeared. The TREE_VALUE of each node is a STRING_CST. */
21877 static tree
21879 {
21883 {
21884 tree string_literal;
21886 /* Look for the string literal. */
21888 /* Add it to the list. */
21890 /* If the next token is not a `,', then the list is
21891 complete. */
21894 /* Consume the `,' token. */
21896 }
21899 }
21901 /* Parse an asm-label-list.
21903 asm-label-list:
21904 identifier
21905 asm-label-list , identifier
21907 Returns a TREE_LIST, indicating the labels in the order that they
21908 appeared. The TREE_VALUE of each node is a label. */
21910 static tree
21912 {
21916 {
21919 /* Look for the identifier. */
21922 {
21925 {
21931 }
21932 }
21933 /* If the next token is not a `,', then the list is
21934 complete. */
21937 /* Consume the `,' token. */
21939 }
21942 }
21944 /* Return TRUE iff the next tokens in the stream are possibly the
21945 beginning of a GNU extension attribute. */
21947 static bool
21949 {
21951 }
21953 /* Return TRUE iff the next tokens in the stream are possibly the
21954 beginning of a standard C++-11 attribute specifier. */
21956 static bool
21958 {
21960 }
21962 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21963 beginning of a standard C++-11 attribute specifier. */
21965 static bool
21967 {
21975 }
21977 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21978 beginning of a GNU extension attribute. */
21980 static bool
21982 {
21986 }
21988 /* Return true iff the next tokens can be the beginning of either a
21989 GNU attribute list, or a standard C++11 attribute sequence. */
21991 static bool
21993 {
21996 }
21998 /* Return true iff the next Nth tokens can be the beginning of either
21999 a GNU attribute list, or a standard C++11 attribute sequence. */
22001 static bool
22003 {
22006 }
22008 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22009 of GNU attributes, or return NULL. */
22011 static tree
22013 {
22017 }
22019 #define CILK_SIMD_FN_CLAUSE_MASK \
22020 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22021 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22022 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22023 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22024 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22026 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22027 vector [(<clauses>)] */
22029 static void
22031 {
22035 {
22040 }
22043 {
22046 paren_scope++;
22047 }
22049 {
22052 paren_scope++;
22054 paren_scope--;
22055 /* Do not push the last ')' */
22058 }
22067 }
22069 /* Parse an (optional) series of attributes.
22071 attributes:
22072 attributes attribute
22074 attribute:
22075 __attribute__ (( attribute-list [opt] ))
22077 The return value is as for cp_parser_gnu_attribute_list. */
22079 static tree
22081 {
22085 {
22087 tree attribute_list;
22090 /* Peek at the next token. */
22092 /* If it's not `__attribute__', then we're done. */
22096 /* Consume the `__attribute__' keyword. */
22098 /* Look for the two `(' tokens. */
22102 /* Peek at the next token. */
22105 /* Parse the attribute-list. */
22107 else
22108 /* If the next token is a `)', then there is no attribute
22109 list. */
22112 /* Look for the two `)' tokens. */
22120 /* Add these new attributes to the list. */
22122 }
22125 }
22127 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22128 "__vector" or "__vector__." */
22132 {
22136 }
22138 /* Parse a GNU attribute-list.
22140 attribute-list:
22141 attribute
22142 attribute-list , attribute
22144 attribute:
22145 identifier
22146 identifier ( identifier )
22147 identifier ( identifier , expression-list )
22148 identifier ( expression-list )
22150 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22151 to an attribute. The TREE_PURPOSE of each node is the identifier
22152 indicating which attribute is in use. The TREE_VALUE represents
22153 the arguments, if any. */
22155 static tree
22157 {
22163 {
22165 tree identifier;
22166 tree attribute;
22168 /* Look for the identifier. We also allow keywords here; for
22169 example `__attribute__ ((const))' is legal. */
22173 {
22176 /* Consume the token, but save it since we need it for the
22177 SIMD enabled function parsing. */
22180 /* Save away the identifier that indicates which attribute
22181 this is. */
22183 /* For keywords, use the canonical spelling, not the
22184 parsed identifier. */
22190 /* Peek at the next token. */
22192 /* If it's an `(', then parse the attribute arguments. */
22194 {
22199 {
22202 }
22203 else
22204 vec = cp_parser_parenthesized_expression_list
22210 else
22211 {
22214 }
22215 /* Save the arguments away. */
22217 }
22219 {
22222 }
22225 {
22226 /* Add this attribute to the list. */
22229 }
22232 }
22233 /* Now, look for more attributes. If the next token isn't a
22234 `,', we're done. */
22238 /* Consume the comma and keep going. */
22240 }
22243 /* We built up the list in reverse order. */
22245 }
22247 /* Parse a standard C++11 attribute.
22249 The returned representation is a TREE_LIST which TREE_PURPOSE is
22250 the scoped name of the attribute, and the TREE_VALUE is its
22251 arguments list.
22253 Note that the scoped name of the attribute is itself a TREE_LIST
22254 which TREE_PURPOSE is the namespace of the attribute, and
22255 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22256 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22257 and which TREE_PURPOSE is directly the attribute name.
22259 Clients of the attribute code should use get_attribute_namespace
22260 and get_attribute_name to get the actual namespace and name of
22261 attributes, regardless of their being GNU or C++11 attributes.
22263 attribute:
22264 attribute-token attribute-argument-clause [opt]
22266 attribute-token:
22267 identifier
22268 attribute-scoped-token
22270 attribute-scoped-token:
22271 attribute-namespace :: identifier
22273 attribute-namespace:
22274 identifier
22276 attribute-argument-clause:
22277 ( balanced-token-seq )
22279 balanced-token-seq:
22280 balanced-token [opt]
22281 balanced-token-seq balanced-token
22283 balanced-token:
22284 ( balanced-token-seq )
22285 [ balanced-token-seq ]
22286 { balanced-token-seq }. */
22288 static tree
22290 {
22294 /* First, parse name of the the attribute, a.k.a
22295 attribute-token. */
22312 {
22313 /* We are seeing a scoped attribute token. */
22323 else
22324 {
22328 }
22330 NULL_TREE);
22332 }
22333 else
22334 {
22336 NULL_TREE);
22337 /* C++11 noreturn attribute is equivalent to GNU's. */
22340 /* C++14 deprecated attribute is equivalent to GNU's. */
22342 {
22345 "%<deprecated%> is a C++14 feature;"
22348 }
22349 }
22351 /* Now parse the optional argument clause of the attribute. */
22356 {
22362 /* A GNU attribute that takes an identifier in parameter. */
22365 vec = cp_parser_parenthesized_expression_list
22371 else
22372 {
22375 }
22379 else
22381 }
22384 }
22386 /* Parse a list of standard C++-11 attributes.
22388 attribute-list:
22389 attribute [opt]
22390 attribute-list , attribute[opt]
22391 attribute ...
22392 attribute-list , attribute ...
22393 */
22395 static tree
22397 {
22402 {
22407 {
22410 }
22415 }
22418 }
22420 /* Parse a standard C++-11 attribute specifier.
22422 attribute-specifier:
22423 [ [ attribute-list ] ]
22424 alignment-specifier
22426 alignment-specifier:
22427 alignas ( type-id ... [opt] )
22428 alignas ( alignment-expression ... [opt] ). */
22430 static tree
22432 {
22438 {
22447 else
22448 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22449 when we are sure that we have actually parsed them. */
22451 }
22452 else
22453 {
22454 tree alignas_expr;
22456 /* Look for an alignment-specifier. */
22468 {
22471 }
22477 {
22481 alignas_expr =
22488 }
22491 {
22494 }
22498 /* Build the C++-11 representation of an 'aligned'
22499 attribute. */
22500 attributes =
22504 }
22507 }
22509 /* Parse a standard C++-11 attribute-specifier-seq.
22511 attribute-specifier-seq:
22512 attribute-specifier-seq [opt] attribute-specifier
22513 */
22515 static tree
22517 {
22521 {
22530 }
22534 }
22536 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22537 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22538 current value of the PEDANTIC flag, regardless of whether or not
22539 the `__extension__' keyword is present. The caller is responsible
22540 for restoring the value of the PEDANTIC flag. */
22542 static bool
22544 {
22545 /* Save the old value of the PEDANTIC flag. */
22549 {
22550 /* Consume the `__extension__' token. */
22552 /* We're not being pedantic while the `__extension__' keyword is
22553 in effect. */
22557 }
22560 }
22562 /* Parse a label declaration.
22564 label-declaration:
22565 __label__ label-declarator-seq ;
22567 label-declarator-seq:
22568 identifier , label-declarator-seq
22569 identifier */
22571 static void
22573 {
22574 /* Look for the `__label__' keyword. */
22578 {
22579 tree identifier;
22581 /* Look for an identifier. */
22583 /* If we failed, stop. */
22586 /* Declare it as a label. */
22588 /* If the next token is a `;', stop. */
22591 /* Look for the `,' separating the label declarations. */
22593 }
22595 /* Look for the final `;'. */
22597 }
22599 /* Support Functions */
22601 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22602 NAME should have one of the representations used for an
22603 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22604 is returned. If PARSER->SCOPE is a dependent type, then a
22605 SCOPE_REF is returned.
22607 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22608 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22609 was formed. Abstractly, such entities should not be passed to this
22610 function, because they do not need to be looked up, but it is
22611 simpler to check for this special case here, rather than at the
22612 call-sites.
22614 In cases not explicitly covered above, this function returns a
22615 DECL, OVERLOAD, or baselink representing the result of the lookup.
22616 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22617 is returned.
22619 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22620 (e.g., "struct") that was used. In that case bindings that do not
22621 refer to types are ignored.
22623 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22624 ignored.
22626 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22627 are ignored.
22629 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22630 types.
22632 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22633 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22634 NULL_TREE otherwise. */
22636 static tree
22643 location_t name_location)
22644 {
22645 tree decl;
22648 /* Assume that the lookup will be unambiguous. */
22652 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22653 no longer valid. Note that if we are parsing tentatively, and
22654 the parse fails, OBJECT_TYPE will be automatically restored. */
22660 /* A template-id has already been resolved; there is no lookup to
22661 do. */
22665 {
22669 }
22671 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22672 it should already have been checked to make sure that the name
22673 used matches the type being destroyed. */
22675 {
22676 tree type;
22678 /* Figure out to which type this destructor applies. */
22683 else
22685 /* If that's not a class type, there is no destructor. */
22692 /* If it was a class type, return the destructor. */
22694 }
22696 /* By this point, the NAME should be an ordinary identifier. If
22697 the id-expression was a qualified name, the qualifying scope is
22698 stored in PARSER->SCOPE at this point. */
22701 /* Perform the lookup. */
22703 {
22709 /* If the SCOPE is dependent, the lookup must be deferred until
22710 the template is instantiated -- unless we are explicitly
22711 looking up names in uninstantiated templates. Even then, we
22712 cannot look up the name if the scope is not a class type; it
22713 might, for example, be a template type parameter. */
22718 /* Defer lookup. */
22720 else
22721 {
22724 /* If PARSER->SCOPE is a dependent type, then it must be a
22725 class type, and we must not be checking dependencies;
22726 otherwise, we would have processed this lookup above. So
22727 that PARSER->SCOPE is not considered a dependent base by
22728 lookup_member, we must enter the scope here. */
22732 /* If the PARSER->SCOPE is a template specialization, it
22733 may be instantiated during name lookup. In that case,
22734 errors may be issued. Even if we rollback the current
22735 tentative parse, those errors are valid. */
22740 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22741 lookup result and the nested-name-specifier nominates a class C:
22742 * if the name specified after the nested-name-specifier, when
22743 looked up in C, is the injected-class-name of C (Clause 9), or
22744 * if the name specified after the nested-name-specifier is the
22745 same as the identifier or the simple-template-id's template-
22746 name in the last component of the nested-name-specifier,
22747 the name is instead considered to name the constructor of
22748 class C. [ Note: for example, the constructor is not an
22749 acceptable lookup result in an elaborated-type-specifier so
22750 the constructor would not be used in place of the
22751 injected-class-name. --end note ] Such a constructor name
22752 shall be used only in the declarator-id of a declaration that
22753 names a constructor or in a using-declaration. */
22761 /* If we have a single function from a using decl, pull it out. */
22768 }
22770 /* If the scope is a dependent type and either we deferred lookup or
22771 we did lookup but didn't find the name, rememeber the name. */
22774 {
22776 {
22777 tree type;
22779 /* The resolution to Core Issue 180 says that `struct
22780 A::B' should be considered a type-name, even if `A'
22781 is dependent. */
22786 }
22790 CPP_CLOSE_PAREN)))
22794 else
22797 is_template);
22798 }
22801 }
22803 {
22804 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22805 OBJECT_TYPE is not a class. */
22807 /* If the OBJECT_TYPE is a template specialization, it may
22808 be instantiated during name lookup. In that case, errors
22809 may be issued. Even if we rollback the current tentative
22810 parse, those errors are valid. */
22812 name,
22815 tf_warning_or_error);
22816 else
22820 /* Look it up in the enclosing context. */
22826 }
22827 else
22828 {
22834 }
22836 /* If the lookup failed, let our caller know. */
22840 /* Pull out the template from an injected-class-name (or multiple). */
22844 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22846 {
22849 /* The error message we have to print is too complicated for
22850 cp_parser_error, so we incorporate its actions directly. */
22852 {
22854 name);
22856 }
22858 }
22866 /* If we have resolved the name of a member declaration, check to
22867 see if the declaration is accessible. When the name resolves to
22868 set of overloaded functions, accessibility is checked when
22869 overload resolution is done.
22871 During an explicit instantiation, access is not checked at all,
22872 as per [temp.explicit]. */
22879 }
22881 /* Like cp_parser_lookup_name, but for use in the typical case where
22882 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22883 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22885 static tree
22887 {
22889 none_type,
22894 location);
22895 }
22897 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22898 the current context, return the TYPE_DECL. If TAG_NAME_P is
22899 true, the DECL indicates the class being defined in a class-head,
22900 or declared in an elaborated-type-specifier.
22902 Otherwise, return DECL. */
22904 static tree
22906 {
22907 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22908 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22910 struct A {
22911 template <typename T> struct B;
22912 };
22914 template <typename T> struct A::B {};
22916 Similarly, in an elaborated-type-specifier:
22918 namespace N { struct X{}; }
22920 struct A {
22921 template <typename T> friend struct N::X;
22922 };
22924 However, if the DECL refers to a class type, and we are in
22925 the scope of the class, then the name lookup automatically
22926 finds the TYPE_DECL created by build_self_reference rather
22927 than a TEMPLATE_DECL. For example, in:
22929 template <class T> struct S {
22930 S s;
22931 };
22933 there is no need to handle such case. */
22939 }
22941 /* If too many, or too few, template-parameter lists apply to the
22942 declarator, issue an error message. Returns TRUE if all went well,
22943 and FALSE otherwise. */
22945 static bool
22948 location_t declarator_location)
22949 {
22951 {
22953 {
22961 /* If the DECLARATOR has the form `X<y>' then it uses one
22962 additional level of template parameters. */
22965 return cp_parser_check_template_parameters
22967 }
22982 }
22984 }
22986 /* NUM_TEMPLATES were used in the current declaration. If that is
22987 invalid, return FALSE and issue an error messages. Otherwise,
22988 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22989 declarator and we can print more accurate diagnostics. */
22991 static bool
22994 location_t location,
22996 {
22997 /* If there are the same number of template classes and parameter
22998 lists, that's OK. */
23001 /* If there are more, but only one more, then we are referring to a
23002 member template. That's OK too. */
23005 /* If there are more template classes than parameter lists, we have
23006 something like:
23008 template <class T> void S<T>::R<T>::f (); */
23010 {
23020 else
23023 }
23024 /* Otherwise, there are too many template parameter lists. We have
23025 something like:
23027 template <class T> template <class U> void S::f(); */
23030 }
23032 /* Parse an optional `::' token indicating that the following name is
23033 from the global namespace. If so, PARSER->SCOPE is set to the
23034 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23035 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23036 Returns the new value of PARSER->SCOPE, if the `::' token is
23037 present, and NULL_TREE otherwise. */
23039 static tree
23041 {
23044 /* Peek at the next token. */
23046 /* If we're looking at a `::' token then we're starting from the
23047 global namespace, not our current location. */
23049 {
23050 /* Consume the `::' token. */
23052 /* Set the SCOPE so that we know where to start the lookup. */
23058 }
23060 {
23064 }
23067 }
23069 /* Returns TRUE if the upcoming token sequence is the start of a
23070 constructor declarator. If FRIEND_P is true, the declarator is
23071 preceded by the `friend' specifier. */
23073 static bool
23075 {
23078 tree nested_name_specifier;
23081 /* The common case is that this is not a constructor declarator, so
23082 try to avoid doing lots of work if at all possible. It's not
23083 valid declare a constructor at function scope. */
23086 /* And only certain tokens can begin a constructor declarator. */
23094 /* Parse tentatively; we are going to roll back all of the tokens
23095 consumed here. */
23097 /* Assume that we are looking at a constructor declarator. */
23100 /* Look for the optional `::' operator. */
23103 /* Look for the nested-name-specifier. */
23104 nested_name_specifier
23115 /* Outside of a class-specifier, there must be a
23116 nested-name-specifier. */
23122 /* If we have a class scope, this is easy; DR 147 says that S::S always
23123 names the constructor, and no other qualified name could. */
23126 {
23136 }
23137 /* If we still think that this might be a constructor-declarator,
23138 look for a class-name. */
23140 {
23141 /* If we have:
23143 template <typename T> struct S {
23144 S();
23145 };
23147 we must recognize that the nested `S' names a class. */
23148 tree type_decl;
23152 none_type,
23156 /* If there was no class-name, then this is not a constructor.
23157 Otherwise, if we are in a class-specifier and we aren't
23158 handling a friend declaration, check that its type matches
23159 current_class_type (c++/38313). Note: error_mark_node
23160 is left alone for error recovery purposes. */
23162 && (outside_class_specifier_p
23167 /* If we're still considering a constructor, we have to see a `(',
23168 to begin the parameter-declaration-clause, followed by either a
23169 `)', an `...', or a decl-specifier. We need to check for a
23170 type-specifier to avoid being fooled into thinking that:
23172 S (f) (int);
23174 is a constructor. (It is actually a function named `f' that
23175 takes one parameter (of type `int') and returns a value of type
23176 `S'. */
23184 /* A parameter declaration begins with a decl-specifier,
23185 which is either the "attribute" keyword, a storage class
23186 specifier, or (usually) a type-specifier. */
23188 {
23189 tree type;
23193 /* Names appearing in the type-specifier should be looked up
23194 in the scope of the class. */
23197 else
23198 {
23201 {
23205 {
23208 }
23209 }
23211 }
23213 /* Inside the constructor parameter list, surrounding
23214 template-parameter-lists do not apply. */
23215 saved_num_template_parameter_lists
23219 /* Look for the type-specifier. */
23221 CP_PARSER_FLAGS_NONE,
23227 parser->num_template_parameter_lists
23230 /* Leave the scope of the class. */
23235 }
23236 }
23238 /* We did not really want to consume any tokens. */
23242 }
23244 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23245 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23246 they must be performed once we are in the scope of the function.
23248 Returns the function defined. */
23250 static tree
23251 cp_parser_function_definition_from_specifiers_and_declarator
23254 tree attributes,
23256 {
23257 tree fn;
23260 /* Begin the function-definition. */
23263 /* The things we're about to see are not directly qualified by any
23264 template headers we've seen thus far. */
23267 /* If there were names looked up in the decl-specifier-seq that we
23268 did not check, check them now. We must wait until we are in the
23269 scope of the function to perform the checks, since the function
23270 might be a friend. */
23274 {
23277 }
23280 {
23281 /* Skip the entire function. */
23284 }
23286 {
23287 /* Seen already, skip it. An error message has already been output. */
23291 /* If this is a function from a class, pop the nested class. */
23294 }
23295 else
23296 {
23297 timevar_id_t tv;
23300 else
23306 }
23309 }
23311 /* Parse the part of a function-definition that follows the
23312 declarator. INLINE_P is TRUE iff this function is an inline
23313 function defined within a class-specifier.
23315 Returns the function defined. */
23317 static tree
23320 {
23321 tree fn;
23327 bool fully_implicit_function_template_p
23330 tree implicit_template_parms
23333 cp_binding_level* implicit_template_scope
23339 /* If the next token is `return', then the code may be trying to
23340 make use of the "named return value" extension that G++ used to
23341 support. */
23344 {
23345 /* Consume the `return' keyword. */
23347 /* Look for the identifier that indicates what value is to be
23348 returned. */
23350 /* Issue an error message. */
23353 /* Skip tokens until we reach the start of the function body. */
23355 {
23362 }
23363 }
23364 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23365 anything declared inside `f'. */
23366 saved_in_unbraced_linkage_specification_p
23369 /* Inside the function, surrounding template-parameter-lists do not
23370 apply. */
23371 saved_num_template_parameter_lists
23377 /* If the next token is `try', `__transaction_atomic', or
23378 `__transaction_relaxed`, then we are looking at either function-try-block
23379 or function-transaction-block. Note that all of these include the
23380 function-body. */
23383 RID_TRANSACTION_ATOMIC);
23385 RID_TRANSACTION_RELAXED))
23387 RID_TRANSACTION_RELAXED);
23390 else
23391 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23396 /* Finish the function. */
23399 /* Generate code for it, if necessary. */
23401 /* Restore the saved values. */
23402 parser->in_unbraced_linkage_specification_p
23404 parser->num_template_parameter_lists
23408 parser->fully_implicit_function_template_p
23410 parser->implicit_template_parms
23412 parser->implicit_template_scope
23419 }
23421 /* Parse a template-declaration, assuming that the `export' (and
23422 `extern') keywords, if present, has already been scanned. MEMBER_P
23423 is as for cp_parser_template_declaration. */
23425 static void
23427 {
23430 tree parameter_list;
23435 /* Look for the `template' keyword. */
23440 /* And the `<'. */
23444 {
23445 /* 14.5.2.2 [temp.mem]
23447 A local class shall not have member templates. */
23452 }
23453 /* [temp]
23455 A template ... shall not have C linkage. */
23457 {
23459 /* Give it C++ linkage to avoid confusing other parts of the
23460 front end. */
23463 }
23464 else
23467 /* We cannot perform access checks on the template parameter
23468 declarations until we know what is being declared, just as we
23469 cannot check the decl-specifier list. */
23472 /* If the next token is `>', then we have an invalid
23473 specialization. Rather than complain about an invalid template
23474 parameter, issue an error message here. */
23476 {
23480 }
23481 else
23482 {
23483 /* Parse the template parameters. */
23485 }
23487 /* Get the deferred access checks from the parameter list. These
23488 will be checked once we know what is being declared, as for a
23489 member template the checks must be performed in the scope of the
23490 class containing the member. */
23493 /* Look for the `>'. */
23495 /* We just processed one more parameter list. */
23497 /* If the next token is `template', there are more template
23498 parameters. */
23500 RID_TEMPLATE))
23505 else
23506 {
23507 /* There are no access checks when parsing a template, as we do not
23508 know if a specialization will be a friend. */
23512 checks,
23513 member_p,
23518 /* If this is a member template declaration, let the front
23519 end know. */
23521 {
23526 }
23531 }
23532 /* We are done with the current parameter list. */
23537 /* Finish up. */
23540 /* Check the template arguments for a literal operator template. */
23544 {
23548 else
23549 {
23552 {
23558 }
23560 {
23568 }
23569 else
23571 }
23573 {
23576 " Expected non-type template argument pack <char...>"
23578 decl);
23579 else
23582 decl);
23583 }
23584 }
23585 /* Register member declarations. */
23588 /* For the erroneous case of a template with C linkage, we pushed an
23589 implicit C++ linkage scope; exit that scope now. */
23592 /* If DECL is a function template, we must return to parse it later.
23593 (Even though there is no definition, there might be default
23594 arguments that need handling.) */
23598 }
23600 /* Perform the deferred access checks from a template-parameter-list.
23601 CHECKS is a TREE_LIST of access checks, as returned by
23602 get_deferred_access_checks. */
23604 static void
23605 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23606 {
23610 }
23612 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23613 `function-definition' sequence that follows a template header.
23614 If MEMBER_P is true, this declaration appears in a class scope.
23616 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23617 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23619 static tree
23625 {
23628 cp_decl_specifier_seq decl_specifiers;
23632 /* This function is only used when processing a template
23633 declaration. */
23637 /* Defer access checks until we know what is being declared. */
23640 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23641 alternative. */
23644 CP_PARSER_FLAGS_OPTIONAL,
23650 /* There are no template typedefs. */
23652 {
23656 }
23658 /* Gather up the access checks that occurred the
23659 decl-specifier-seq. */
23662 /* Check for the declaration of a template class. */
23664 {
23666 {
23669 /* In this case:
23671 struct C {
23672 friend template <typename T> struct A<T>::B;
23673 };
23675 A<T>::B will be represented by a TYPENAME_TYPE, and
23676 therefore not recognized by shadow_tag. */
23678 && !decl
23685 else
23688 /* Perform access checks for template parameters. */
23690 }
23691 }
23693 /* Complain about missing 'typename' or other invalid type names. */
23696 {
23697 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23698 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23699 the rest of this declaration. */
23702 }
23704 /* If it's not a template class, try for a template function. If
23705 the next token is a `;', then this declaration does not declare
23706 anything. But, if there were errors in the decl-specifiers, then
23707 the error might well have come from an attempted class-specifier.
23708 In that case, there's no need to warn about a missing declarator. */
23712 {
23715 checks,
23717 member_p,
23718 declares_class_or_enum,
23720 NULL);
23722 /* 7.1.1-1 [dcl.stc]
23724 A storage-class-specifier shall not be specified in an explicit
23725 specialization... */
23727 && explicit_specialization_p
23729 {
23733 }
23737 }
23739 /* Look for a trailing `;' after the declaration. */
23745 out:
23748 /* Clear any current qualification; whatever comes next is the start
23749 of something new. */
23755 }
23757 /* Parse a cast-expression that is not the operand of a unary "&". */
23759 static tree
23761 {
23764 }
23766 /* Parse a functional cast to TYPE. Returns an expression
23767 representing the cast. */
23769 static tree
23771 {
23773 tree expression_list;
23774 tree cast;
23781 {
23789 tf_warning_or_error);
23790 }
23799 else
23800 {
23803 }
23806 tf_warning_or_error);
23807 /* [expr.const]/1: In an integral constant expression "only type
23808 conversions to integral or enumeration type can be used". */
23814 NIC_CONSTRUCTOR))
23817 }
23819 /* Save the tokens that make up the body of a member function defined
23820 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23821 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23822 specifiers applied to the declaration. Returns the FUNCTION_DECL
23823 for the member function. */
23825 static tree
23829 tree attributes)
23830 {
23833 tree fn;
23835 /* Create the FUNCTION_DECL. */
23838 /* If something went badly wrong, bail out now. */
23840 {
23841 /* If there's a function-body, skip it. */
23846 }
23848 /* Remember it, if there default args to post process. */
23851 /* Save away the tokens that make up the body of the
23852 function. */
23854 /* Handle function try blocks. */
23857 /* We can have braced-init-list mem-initializers before the fn body. */
23859 {
23862 {
23863 /* cache_group will stop after an un-nested { } pair, too. */
23867 /* variadic mem-inits have ... after the ')'. */
23870 }
23871 }
23873 /* Handle function try blocks. */
23878 /* Save away the inline definition; we will process it when the
23879 class is complete. */
23883 /* We need to know that this was defined in the class, so that
23884 friend templates are handled correctly. */
23887 /* Add FN to the queue of functions to be parsed later. */
23891 }
23893 /* Save the tokens that make up the in-class initializer for a non-static
23894 data member. Returns a DEFAULT_ARG. */
23896 static tree
23898 {
23900 }
23902 /* Parse a template-argument-list, as well as the trailing ">" (but
23903 not the opening "<"). See cp_parser_template_argument_list for the
23904 return value. */
23906 static tree
23908 {
23909 tree arguments;
23910 tree saved_scope;
23911 tree saved_qualifying_scope;
23912 tree saved_object_scope;
23917 /* [temp.names]
23919 When parsing a template-id, the first non-nested `>' is taken as
23920 the end of the template-argument-list rather than a greater-than
23921 operator. */
23922 saved_greater_than_is_operator_p
23925 /* Parsing the argument list may modify SCOPE, so we save it
23926 here. */
23930 /* We need to evaluate the template arguments, even though this
23931 template-id may be nested within a "sizeof". */
23936 /* Parse the template-argument-list itself. */
23940 else
23942 /* Look for the `>' that ends the template-argument-list. If we find
23943 a '>>' instead, it's probably just a typo. */
23945 {
23947 {
23948 /* In C++0x, a `>>' in a template argument list or cast
23949 expression is considered to be two separate `>'
23950 tokens. So, change the current token to a `>', but don't
23951 consume it: it will be consumed later when the outer
23952 template argument list (or cast expression) is parsed.
23953 Note that this replacement of `>' for `>>' is necessary
23954 even if we are parsing tentatively: in the tentative
23955 case, after calling
23956 cp_parser_enclosed_template_argument_list we will always
23957 throw away all of the template arguments and the first
23958 closing `>', either because the template argument list
23959 was erroneous or because we are replacing those tokens
23960 with a CPP_TEMPLATE_ID token. The second `>' (which will
23961 not have been thrown away) is needed either to close an
23962 outer template argument list or to complete a new-style
23963 cast. */
23966 }
23968 {
23969 /* If we're in a nested template argument list, the '>>' has
23970 to be a typo for '> >'. We emit the error message, but we
23971 continue parsing and we push a '>' as next token, so that
23972 the argument list will be parsed correctly. Note that the
23973 global source location is still on the token before the
23974 '>>', so we need to say explicitly where we want it. */
23980 }
23981 else
23982 {
23983 /* If this is not a nested template argument list, the '>>'
23984 is a typo for '>'. Emit an error message and continue.
23985 Same deal about the token location, but here we can get it
23986 right by consuming the '>>' before issuing the diagnostic. */
23989 "spurious %<>>%>, use %<>%> to terminate "
23991 }
23992 }
23993 else
23995 /* The `>' token might be a greater-than operator again now. */
23996 parser->greater_than_is_operator_p
23998 /* Restore the SAVED_SCOPE. */
24006 }
24008 /* MEMBER_FUNCTION is a member function, or a friend. If default
24009 arguments, or the body of the function have not yet been parsed,
24010 parse them now. */
24012 static void
24014 {
24016 /* If this member is a template, get the underlying
24017 FUNCTION_DECL. */
24021 /* There should not be any class definitions in progress at this
24022 point; the bodies of members are only parsed outside of all class
24023 definitions. */
24025 /* While we're parsing the member functions we might encounter more
24026 classes. We want to handle them right away, but we don't want
24027 them getting mixed up with functions that are currently in the
24028 queue. */
24031 /* Make sure that any template parameters are in scope. */
24034 /* If the body of the function has not yet been parsed, parse it
24035 now. */
24037 {
24038 tree function_scope;
24041 /* The function is no longer pending; we are processing it. */
24046 /* If this is a local class, enter the scope of the containing
24047 function. */
24052 /* Push the body of the function onto the lexer stack. */
24055 /* Let the front end know that we going to be defining this
24056 function. */
24060 /* Don't do access checking if it is a templated function. */
24064 /* #pragma omp declare reduction needs special parsing. */
24066 {
24071 }
24072 else
24073 /* Now, parse the body of the function. */
24080 /* Leave the scope of the containing function. */
24084 }
24086 /* Remove any template parameters from the symbol table. */
24089 /* Restore the queue. */
24092 }
24094 /* If DECL contains any default args, remember it on the unparsed
24095 functions queue. */
24097 static void
24099 {
24100 tree probe;
24103 probe;
24106 {
24110 }
24111 }
24113 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24114 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24115 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24116 from the parameter-type-list. */
24118 static tree
24121 {
24123 tree parsed_arg;
24129 /* Push the saved tokens for the default argument onto the parser's
24130 lexer stack. */
24136 /* Parse the default argument. */
24147 {
24148 /* In a non-template class, check conversions now. In a template,
24149 we'll wait and instantiate these as needed. */
24152 tf_warning_or_error);
24153 else
24155 }
24157 /* If the token stream has not been completely used up, then
24158 there was extra junk after the end of the default
24159 argument. */
24161 {
24164 else
24166 }
24168 /* Revert to the main lexer. */
24172 }
24174 /* FIELD is a non-static data member with an initializer which we saved for
24175 later; parse it now. */
24177 static void
24179 {
24180 tree def;
24187 NULL_TREE);
24193 }
24195 /* FN is a FUNCTION_DECL which may contains a parameter with an
24196 unparsed DEFAULT_ARG. Parse the default args now. This function
24197 assumes that the current scope is the scope in which the default
24198 argument should be processed. */
24200 static void
24202 {
24206 /* While we're parsing the default args, we might (due to the
24207 statement expression extension) encounter more classes. We want
24208 to handle them right away, but we don't want them getting mixed
24209 up with default args that are currently in the queue. */
24212 /* Local variable names (and the `this' keyword) may not appear
24213 in a default argument. */
24224 {
24226 tree parsed_arg;
24228 tree copy;
24235 /* This can happen for a friend declaration for a function
24236 already declared with default arguments. */
24239 parsed_arg
24241 default_arg,
24244 {
24246 }
24250 /* Update any instantiations we've already created. */
24254 }
24258 /* Make sure no default arg is missing. */
24261 /* Restore the state of local_variables_forbidden_p. */
24264 /* Restore the queue. */
24266 }
24268 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24270 sizeof ... ( identifier )
24272 where the 'sizeof' token has already been consumed. */
24274 static tree
24276 {
24277 /* Consume the `...'. */
24284 else
24292 /* The name is not qualified. */
24310 }
24312 /* Parse the operand of `sizeof' (or a similar operator). Returns
24313 either a TYPE or an expression, depending on the form of the
24314 input. The KEYWORD indicates which kind of expression we have
24315 encountered. */
24317 static tree
24319 {
24326 /* If it's a `...', then we are computing the length of a parameter
24327 pack. */
24332 /* Types cannot be defined in a `sizeof' expression. Save away the
24333 old message. */
24335 /* And create the new one. */
24341 /* The restrictions on constant-expressions do not apply inside
24342 sizeof expressions. */
24343 saved_integral_constant_expression_p
24345 saved_non_integral_constant_expression_p
24349 /* Do not actually evaluate the expression. */
24352 /* If it's a `(', then we might be looking at the type-id
24353 construction. */
24355 {
24358 /* We can't be sure yet whether we're looking at a type-id or an
24359 expression. */
24361 /* Note: as a GNU Extension, compound literals are considered
24362 postfix-expressions as they are in C99, so they are valid
24363 arguments to sizeof. See comment in cp_parser_cast_expression
24364 for details. */
24367 else
24368 {
24371 /* Look for the type-id. */
24373 /* Look for the closing `)'. */
24376 }
24378 /* If all went well, then we're done. */
24380 {
24381 cp_decl_specifier_seq decl_specs;
24383 /* Build a trivial decl-specifier-seq. */
24387 /* Call grokdeclarator to figure out what type this is. */
24390 TYPENAME,
24393 }
24394 }
24396 /* If the type-id production did not work out, then we must be
24397 looking at the unary-expression production. */
24401 /* Go back to evaluating expressions. */
24405 /* Free the message we created. */
24407 /* And restore the old one. */
24409 parser->integral_constant_expression_p
24411 parser->non_integral_constant_expression_p
24415 }
24417 /* If the current declaration has no declarator, return true. */
24419 static bool
24421 {
24422 /* If the next token is a `;' or a `,' then there is no
24423 declarator. */
24426 }
24428 /* Update the DECL_SPECS to reflect the storage class indicated by
24429 KEYWORD. */
24431 static void
24436 {
24437 cp_storage_class storage_class;
24440 {
24444 }
24446 {
24449 }
24454 {
24457 }
24460 {
24478 }
24482 /* A storage class specifier cannot be applied alongside a typedef
24483 specifier. If there is a typedef specifier present then set
24484 conflicting_specifiers_p which will trigger an error later
24485 on in grokdeclarator. */
24488 }
24490 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24491 is true, the type is a class or enum definition. */
24493 static void
24495 tree type_spec,
24498 {
24501 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24502 (with, for example, in "typedef int wchar_t;") we remember that
24503 this is what happened. In system headers, we ignore these
24504 declarations so that G++ can work with system headers that are not
24505 C++-safe. */
24507 && !type_definition_p
24517 {
24520 ds_redefined_builtin_type_spec,
24521 token);
24523 {
24527 }
24528 }
24531 else
24532 {
24537 }
24538 }
24540 /* True iff TOKEN is the GNU keyword __thread. */
24542 static bool
24544 {
24547 }
24549 /* Set the location for a declarator specifier and check if it is
24550 duplicated.
24552 DECL_SPECS is the sequence of declarator specifiers onto which to
24553 set the location.
24555 DS is the single declarator specifier to set which location is to
24556 be set onto the existing sequence of declarators.
24558 LOCATION is the location for the declarator specifier to
24559 consider. */
24561 static void
24564 {
24573 {
24577 }
24578 else
24579 {
24581 {
24585 else
24586 {
24589 OPT_Wlong_long,
24591 }
24592 }
24594 {
24599 else
24601 }
24602 else
24603 {
24619 "__complex"
24620 };
24623 }
24624 }
24625 }
24627 /* Return true iff the declarator specifier DS is present in the
24628 sequence of declarator specifiers DECL_SPECS. */
24630 bool
24632 cp_decl_spec ds)
24633 {
24640 }
24642 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24643 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24645 static bool
24647 {
24649 }
24651 /* Issue an error message indicating that TOKEN_DESC was expected.
24652 If KEYWORD is true, it indicated this function is called by
24653 cp_parser_require_keword and the required token can only be
24654 a indicated keyword. */
24656 static void
24658 required_token token_desc,
24660 {
24662 {
24731 }
24733 {
24735 {
24814 }
24815 }
24816 else
24818 }
24822 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24823 issue an error message indicating that TOKEN_DESC was expected.
24825 Returns the token consumed, if the token had the appropriate type.
24826 Otherwise, returns NULL. */
24831 required_token token_desc)
24832 {
24835 else
24836 {
24837 /* Output the MESSAGE -- unless we're parsing tentatively. */
24841 }
24842 }
24844 /* An error message is produced if the next token is not '>'.
24845 All further tokens are skipped until the desired token is
24846 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24848 static void
24850 {
24851 /* Current level of '< ... >'. */
24853 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24856 /* Are we ready, yet? If not, issue error message. */
24860 /* Skip tokens until the desired token is found. */
24862 {
24863 /* Peek at the next token. */
24865 {
24873 /* C++0x views the `>>' operator as two `>' tokens, but
24874 C++98 does not. */
24877 {
24878 /* We've hit a `>>' where the first `>' closes the
24879 template argument list, and the second `>' is
24880 spurious. Just consume the `>>' and stop; we've
24881 already produced at least one error. */
24884 }
24885 /* Fall through for C++0x, so we handle the second `>' in
24886 the `>>'. */
24890 {
24891 /* We've reached the token we want, consume it and stop. */
24894 }
24913 /* The '>' was probably forgotten, don't look further. */
24918 }
24920 /* Consume this token. */
24922 }
24923 }
24925 /* If the next token is the indicated keyword, consume it. Otherwise,
24926 issue an error message indicating that TOKEN_DESC was expected.
24928 Returns the token consumed, if the token had the appropriate type.
24929 Otherwise, returns NULL. */
24934 required_token token_desc)
24935 {
24939 {
24942 }
24945 }
24947 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24948 function-definition. */
24950 static bool
24952 {
24955 /* A ctor-initializer begins with a `:'. */
24957 /* A function-try-block begins with `try'. */
24959 /* A function-transaction-block begins with `__transaction_atomic'
24960 or `__transaction_relaxed'. */
24963 /* The named return value extension begins with `return'. */
24965 }
24967 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24968 definition. */
24970 static bool
24972 {
24979 }
24981 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24982 C++0x) ending a template-argument. */
24984 static bool
24986 {
24994 }
24996 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24997 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24999 static bool
25002 {
25008 /* Check for the sequence `<::' in the original code. It would be lexed as
25009 `[:', where `[' is a digraph, and there is no whitespace before
25010 `:'. */
25012 {
25017 }
25019 }
25021 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25022 or none_type otherwise. */
25024 static enum tag_types
25026 {
25028 {
25038 }
25039 }
25041 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25042 or none_type otherwise or if the token is null. */
25044 static enum tag_types
25046 {
25051 {
25059 }
25060 }
25062 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25064 static void
25066 {
25070 {
25074 type))
25077 }
25078 }
25080 /* Issue an error message if DECL is redeclared with different
25081 access than its original declaration [class.access.spec/3].
25082 This applies to nested classes and nested class templates.
25083 [class.mem/1]. */
25085 static void
25087 {
25096 }
25098 /* Look for the `template' keyword, as a syntactic disambiguator.
25099 Return TRUE iff it is present, in which case it will be
25100 consumed. */
25102 static bool
25104 {
25106 {
25107 /* In C++98 the `template' keyword can only be used within templates;
25108 outside templates the parser can always figure out what is a
25109 template and what is not. In C++11, per the resolution of DR 468,
25110 `template' is allowed in cases where it is not strictly necessary. */
25113 {
25116 "in C++98 %<template%> (as a disambiguator) is only "
25118 /* If this part of the token stream is rescanned, the same
25119 error message would be generated. So, we purge the token
25120 from the stream. */
25123 }
25124 else
25125 {
25126 /* Consume the `template' keyword. */
25129 }
25130 }
25132 }
25134 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25135 set PARSER->SCOPE, and perform other related actions. */
25137 static void
25139 {
25145 /* Get the stored value. */
25147 /* Perform any access checks that were deferred. */
25150 {
25155 }
25156 /* Set the scope from the stored value. */
25160 }
25162 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25163 encounter the end of a block before what we were looking for. */
25165 static bool
25169 {
25171 {
25174 /* Abort a parenthesized expression if we encounter a semicolon. */
25178 /* If we've reached the end of the file, stop. */
25184 /* We've hit the end of an enclosing block, so there's been some
25185 kind of syntax error. */
25188 /* Consume the token. */
25190 /* See if it starts a new group. */
25192 {
25194 /* In theory this should probably check end == '}', but
25195 cp_parser_save_member_function_body needs it to exit
25196 after either '}' or ')' when called with ')'. */
25199 }
25201 {
25205 }
25210 }
25211 }
25213 /* Like above, for caching a default argument or NSDMI. Both of these are
25214 terminated by a non-nested comma, but it can be unclear whether or not a
25215 comma is nested in a template argument list unless we do more parsing.
25216 In order to handle this ambiguity, when we encounter a ',' after a '<'
25217 we try to parse what follows as a parameter-declaration-list (in the
25218 case of a default argument) or a member-declarator (in the case of an
25219 NSDMI). If that succeeds, then we stop caching. */
25221 static tree
25223 {
25228 tree default_argument;
25230 /* Add tokens until we have processed the entire default
25231 argument. We add the range [first_token, token). */
25234 {
25235 /* For list-initialization, this is straightforward. */
25238 }
25240 {
25243 /* Peek at the next token. */
25245 /* What we do depends on what token we have. */
25247 {
25248 /* In valid code, a default argument must be
25249 immediately followed by a `,' `)', or `...'. */
25252 {
25253 /* If we've seen a '<', we might be in a
25254 template-argument-list. Until Core issue 325 is
25255 resolved, we don't know how this situation ought
25256 to be handled, so try to DTRT. We check whether
25257 what comes after the comma is a valid parameter
25258 declaration list. If it is, then the comma ends
25259 the default argument; otherwise the default
25260 argument continues. */
25263 /* Set ITALP so cp_parser_parameter_declaration_list
25264 doesn't decide to commit to this parse. */
25272 {
25279 }
25280 else
25281 {
25285 }
25292 }
25295 /* If we run into a non-nested `;', `}', or `]',
25296 then the code is invalid -- but the default
25297 argument is certainly over. */
25302 /* Handle correctly int n = sizeof ... ( p ); */
25305 /* Update DEPTH, if necessary. */
25320 /* This might be the comparison operator, or it might
25321 start a template argument list. */
25328 /* Fall through for C++0x, which treats the `>>'
25329 operator like two `>' tokens in certain
25330 cases. */
25334 {
25335 /* This might be an operator, or it might close a
25336 template argument list. But if a previous '<'
25337 started a template argument list, this will have
25338 closed it, so we can't be in one anymore. */
25342 }
25345 /* If we run out of tokens, issue an error message. */
25354 /* In these cases, we should look for template-ids.
25355 For example, if the default argument is
25356 `X<int, double>()', we need to do name lookup to
25357 figure out whether or not `X' is a template; if
25358 so, the `,' does not end the default argument.
25360 That is not yet done. */
25365 }
25367 /* If we've reached the end, stop. */
25371 /* Add the token to the token block. */
25373 }
25375 /* Create a DEFAULT_ARG to represent the unparsed default
25376 argument. */
25383 }
25385 /* Begin parsing tentatively. We always save tokens while parsing
25386 tentatively so that if the tentative parsing fails we can restore the
25387 tokens. */
25389 static void
25391 {
25392 /* Enter a new parsing context. */
25394 /* Begin saving tokens. */
25396 /* In order to avoid repetitive access control error messages,
25397 access checks are queued up until we are no longer parsing
25398 tentatively. */
25400 }
25402 /* Commit to the currently active tentative parse. */
25404 static void
25406 {
25410 /* Mark all of the levels as committed. */
25413 {
25420 }
25421 }
25423 /* Commit to the topmost currently active tentative parse.
25425 Note that this function shouldn't be called when there are
25426 irreversible side-effects while in a tentative state. For
25427 example, we shouldn't create a permanent entry in the symbol
25428 table, or issue an error message that might not apply if the
25429 tentative parse is aborted. */
25431 static void
25433 {
25438 {
25446 }
25447 }
25449 /* Abort the currently active tentative parse. All consumed tokens
25450 will be rolled back, and no diagnostics will be issued. */
25452 static void
25454 {
25458 /* Now, pretend that we want to see if the construct was
25459 successfully parsed. */
25461 }
25463 /* Stop parsing tentatively. If a parse error has occurred, restore the
25464 token stream. Otherwise, commit to the tokens we have consumed.
25465 Returns true if no error occurred; false otherwise. */
25467 static bool
25469 {
25473 /* Remember whether or not an error occurred, since we are about to
25474 destroy that information. */
25476 /* Remove the topmost context from the stack. */
25479 /* If no parse errors occurred, commit to the tentative parse. */
25481 {
25482 /* Commit to the tokens read tentatively, unless that was
25483 already done. */
25488 }
25489 /* Otherwise, if errors occurred, roll back our state so that things
25490 are just as they were before we began the tentative parse. */
25491 else
25492 {
25495 }
25496 /* Add the context to the front of the free list. */
25501 }
25503 /* Returns true if we are parsing tentatively and are not committed to
25504 this tentative parse. */
25506 static bool
25508 {
25511 }
25513 /* Returns nonzero iff an error has occurred during the most recent
25514 tentative parse. */
25516 static bool
25518 {
25521 }
25523 /* Returns nonzero if GNU extensions are allowed. */
25525 static bool
25527 {
25529 }
25530 \f
25531 /* Objective-C++ Productions */
25534 /* Parse an Objective-C expression, which feeds into a primary-expression
25535 above.
25537 objc-expression:
25538 objc-message-expression
25539 objc-string-literal
25540 objc-encode-expression
25541 objc-protocol-expression
25542 objc-selector-expression
25544 Returns a tree representation of the expression. */
25546 static tree
25548 {
25549 /* Try to figure out what kind of declaration is present. */
25553 {
25563 {
25575 }
25581 }
25584 }
25586 /* Parse an Objective-C message expression.
25588 objc-message-expression:
25589 [ objc-message-receiver objc-message-args ]
25591 Returns a representation of an Objective-C message. */
25593 static tree
25595 {
25604 }
25606 /* Parse an objc-message-receiver.
25608 objc-message-receiver:
25609 expression
25610 simple-type-specifier
25612 Returns a representation of the type or expression. */
25614 static tree
25616 {
25617 tree rcv;
25619 /* An Objective-C message receiver may be either (1) a type
25620 or (2) an expression. */
25629 CP_PARSER_FLAGS_NONE);
25632 }
25634 /* Parse the arguments and selectors comprising an Objective-C message.
25636 objc-message-args:
25637 objc-selector
25638 objc-selector-args
25639 objc-selector-args , objc-comma-args
25641 objc-selector-args:
25642 objc-selector [opt] : assignment-expression
25643 objc-selector-args objc-selector [opt] : assignment-expression
25645 objc-comma-args:
25646 assignment-expression
25647 objc-comma-args , assignment-expression
25649 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25650 selector arguments and TREE_VALUE containing a list of comma
25651 arguments. */
25653 static tree
25655 {
25661 {
25667 /* Detect if we have a unary selector. */
25676 sel_args
25681 }
25683 /* Handle non-selector arguments, if any. */
25685 {
25686 tree arg;
25691 addl_args
25696 }
25699 {
25702 }
25705 }
25707 /* Parse an Objective-C encode expression.
25709 objc-encode-expression:
25710 @encode objc-typename
25712 Returns an encoded representation of the type argument. */
25714 static tree
25716 {
25717 tree type;
25727 {
25731 }
25733 /* This happens if we find @encode(T) (where T is a template
25734 typename or something dependent on a template typename) when
25735 parsing a template. In that case, we can't compile it
25736 immediately, but we rather create an AT_ENCODE_EXPR which will
25737 need to be instantiated when the template is used.
25738 */
25740 {
25744 }
25747 }
25749 /* Parse an Objective-C @defs expression. */
25751 static tree
25753 {
25754 tree name;
25762 }
25764 /* Parse an Objective-C protocol expression.
25766 objc-protocol-expression:
25767 @protocol ( identifier )
25769 Returns a representation of the protocol expression. */
25771 static tree
25773 {
25774 tree proto;
25782 }
25784 /* Parse an Objective-C selector expression.
25786 objc-selector-expression:
25787 @selector ( objc-method-signature )
25789 objc-method-signature:
25790 objc-selector
25791 objc-selector-seq
25793 objc-selector-seq:
25794 objc-selector :
25795 objc-selector-seq objc-selector :
25797 Returns a representation of the method selector. */
25799 static tree
25801 {
25813 {
25822 {
25823 /* Detect if we have a unary selector. */
25825 {
25828 }
25829 else
25830 {
25832 }
25833 }
25838 {
25839 sel_seq
25842 sel_seq
25845 }
25846 else
25847 sel_seq
25852 }
25854 finish_selector:
25858 }
25860 /* Parse a list of identifiers.
25862 objc-identifier-list:
25863 identifier
25864 objc-identifier-list , identifier
25866 Returns a TREE_LIST of identifier nodes. */
25868 static tree
25870 {
25871 tree identifier;
25872 tree list;
25883 {
25890 identifier));
25892 }
25895 }
25897 /* Parse an Objective-C alias declaration.
25899 objc-alias-declaration:
25900 @compatibility_alias identifier identifier ;
25902 This function registers the alias mapping with the Objective-C front end.
25903 It returns nothing. */
25905 static void
25907 {
25915 }
25917 /* Parse an Objective-C class forward-declaration.
25919 objc-class-declaration:
25920 @class objc-identifier-list ;
25922 The function registers the forward declarations with the Objective-C
25923 front end. It returns nothing. */
25925 static void
25927 {
25930 {
25931 tree id;
25941 else
25943 }
25945 }
25947 /* Parse a list of Objective-C protocol references.
25949 objc-protocol-refs-opt:
25950 objc-protocol-refs [opt]
25952 objc-protocol-refs:
25953 < objc-identifier-list >
25955 Returns a TREE_LIST of identifiers, if any. */
25957 static tree
25959 {
25963 {
25967 }
25970 }
25972 /* Parse a Objective-C visibility specification. */
25974 static void
25976 {
25980 {
25995 }
25997 /* Eat '@private'/'@protected'/'@public'. */
25999 }
26001 /* Parse an Objective-C method type. Return 'true' if it is a class
26002 (+) method, and 'false' if it is an instance (-) method. */
26006 {
26009 else
26011 }
26013 /* Parse an Objective-C protocol qualifier. */
26015 static tree
26017 {
26030 {
26035 }
26038 }
26040 /* Parse an Objective-C typename. */
26042 static tree
26044 {
26048 {
26054 /* An ObjC type name may consist of just protocol qualifiers, in which
26055 case the type shall default to 'id'. */
26057 {
26060 /* If the type could not be parsed, an error has already
26061 been produced. For error recovery, behave as if it had
26062 not been specified, which will use the default type
26063 'id'. */
26065 {
26067 /* We need to skip to the closing parenthesis as
26068 cp_parser_type_id() does not seem to do it for
26069 us. */
26074 }
26075 }
26079 }
26082 }
26084 /* Check to see if TYPE refers to an Objective-C selector name. */
26086 static bool
26088 {
26094 }
26096 /* Parse an Objective-C selector. */
26098 static tree
26100 {
26104 {
26107 }
26109 /* C++ operator names are allowed to appear in ObjC selectors. */
26111 {
26124 }
26125 }
26127 /* Parse an Objective-C params list. */
26129 static tree
26131 {
26137 {
26147 /* Detect if we have a unary selector. */
26150 {
26153 }
26157 {
26158 /* Something went quite wrong. There should be a colon
26159 here, but there is not. Stop parsing parameters. */
26161 }
26163 /* New ObjC allows attributes on parameters too. */
26168 params
26171 type_name,
26172 identifier,
26173 parm_attr));
26176 }
26179 {
26182 }
26184 /* We allow tail attributes for the method. */
26186 {
26194 }
26197 {
26200 }
26202 }
26204 /* Parse the non-keyword Objective-C params. */
26206 static tree
26209 {
26215 {
26217 tree parm;
26223 {
26228 }
26230 /* TODO: parse attributes for tail parameters. */
26239 }
26241 /* We allow tail attributes for the method. */
26243 {
26245 {
26250 }
26251 else
26252 /* We have an error, but parse the attributes, so that we can
26253 carry on. */
26259 }
26262 }
26264 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26266 static void
26268 {
26271 /* If the next token is `extern' and the following token is a string
26272 literal, then we have a linkage specification. */
26274 && cp_parser_is_pure_string_literal
26277 /* Handle #pragma, if any. */
26280 /* Allow stray semicolons. */
26283 /* Mark methods as optional or required, when building protocols. */
26285 {
26288 }
26290 {
26293 }
26296 /* Other stray characters must generate errors. */
26298 {
26302 }
26303 /* Finally, try to parse a block-declaration, or a function-definition. */
26304 else
26306 }
26308 /* Parse a method signature. */
26310 static tree
26312 {
26328 }
26330 static bool
26332 {
26333 tree tattr;
26338 /* If the attributes are followed by a method introducer, this is not allowed.
26339 Dump the attributes and flag the situation. */
26344 /* Otherwise, the attributes introduce some interstitial code, possibly so
26345 rewind to allow that check. */
26348 }
26350 /* Parse an Objective-C method prototype list. */
26352 static void
26354 {
26358 {
26360 {
26365 else
26369 {
26373 }
26376 }
26382 OPT_Wattributes,
26384 else
26385 /* Allow for interspersed non-ObjC++ code. */
26389 }
26393 else
26397 }
26399 /* Parse an Objective-C method definition list. */
26401 static void
26403 {
26407 {
26408 tree meth;
26411 {
26417 else
26422 {
26426 }
26428 NULL_TREE);
26430 /* For historical reasons, we accept an optional semicolon. */
26437 {
26444 }
26445 }
26446 /* The following case will be removed once @synthesize is
26447 completely implemented. */
26458 else
26459 /* Allow for interspersed non-ObjC++ code. */
26463 }
26467 else
26471 }
26473 /* Parse Objective-C ivars. */
26475 static void
26477 {
26488 {
26489 cp_decl_specifier_seq declspecs;
26491 tree prefix_attributes;
26499 CP_PARSER_FLAGS_OPTIONAL,
26503 /* auto, register, static, extern, mutable. */
26505 {
26508 }
26510 /* thread_local. */
26512 {
26515 }
26517 /* typedef. */
26519 {
26522 }
26527 /* Keep going until we hit the `;' at the end of the
26528 declaration. */
26530 {
26535 /* Check for a (possibly unnamed) bitfield declaration. */
26543 {
26544 /* Get the name of the bitfield. */
26547 sfk_none);
26549 eat_colon:
26551 /* Get the width of the bitfield. */
26552 width
26554 }
26555 else
26556 {
26557 /* Parse the declarator. */
26558 declarator
26564 }
26566 /* Look for attributes that apply to the ivar. */
26568 /* Remember which attributes are prefix attributes and
26569 which are not. */
26571 /* Combine the attributes. */
26575 /* Create the bitfield declaration. */
26577 width,
26578 attributes);
26579 else
26584 /* Add the instance variable. */
26588 /* Reset PREFIX_ATTRIBUTES. */
26597 {
26600 }
26602 }
26606 }
26611 /* Do not consume the RID_AT_END, so it will be read again as terminating
26612 the @interface of @implementation. */
26616 /* For historical reasons, we accept an optional semicolon. */
26619 }
26621 /* Parse an Objective-C protocol declaration. */
26623 static void
26625 {
26631 {
26636 }
26638 /* See if we have a forward declaration or a definition. */
26641 /* Try a forward declaration first. */
26643 {
26645 {
26646 tree id;
26656 else
26658 }
26660 }
26662 /* Ok, we got a full-fledged definition (or at least should). */
26663 else
26664 {
26669 }
26670 }
26672 /* Parse an Objective-C superclass or category. */
26674 static void
26679 {
26685 {
26688 }
26690 {
26693 /* If there is no category name, and this is an @interface, we
26694 have a class extension. */
26696 {
26699 }
26700 else
26704 }
26705 }
26707 /* Parse an Objective-C class interface. */
26709 static void
26711 {
26718 {
26719 /* It's hard to recover because even if valid @interface stuff
26720 is to follow, we can't compile it (or validate it) if we
26721 don't even know which class it refers to. Let's assume this
26722 was a stray '@interface' token in the stream and skip it.
26723 */
26725 }
26730 /* We have either a class or a category on our hands. */
26733 else
26734 {
26736 /* Handle instance variable declarations, if any. */
26739 }
26742 }
26744 /* Parse an Objective-C class implementation. */
26746 static void
26748 {
26755 {
26756 /* It's hard to recover because even if valid @implementation
26757 stuff is to follow, we can't compile it (or validate it) if
26758 we don't even know which class it refers to. Let's assume
26759 this was a stray '@implementation' token in the stream and
26760 skip it.
26761 */
26763 }
26767 /* We have either a class or a category on our hands. */
26770 else
26771 {
26773 /* Handle instance variable declarations, if any. */
26776 }
26779 }
26781 /* Consume the @end token and finish off the implementation. */
26783 static void
26785 {
26788 }
26790 /* Parse an Objective-C declaration. */
26792 static void
26794 {
26795 /* Try to figure out what kind of declaration is present. */
26800 {
26816 }
26819 {
26842 }
26843 }
26845 /* Parse an Objective-C try-catch-finally statement.
26847 objc-try-catch-finally-stmt:
26848 @try compound-statement objc-catch-clause-seq [opt]
26849 objc-finally-clause [opt]
26851 objc-catch-clause-seq:
26852 objc-catch-clause objc-catch-clause-seq [opt]
26854 objc-catch-clause:
26855 @catch ( objc-exception-declaration ) compound-statement
26857 objc-finally-clause:
26858 @finally compound-statement
26860 objc-exception-declaration:
26861 parameter-declaration
26862 '...'
26864 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26866 Returns NULL_TREE.
26868 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26869 for C. Keep them in sync. */
26871 static tree
26873 {
26874 location_t location;
26875 tree stmt;
26880 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26881 node, lest it get absorbed into the surrounding block. */
26887 {
26896 {
26897 /* We have "@catch (...)" (where the '...' are literally
26898 what is in the code). Skip the '...'.
26899 parameter_declaration is set to NULL_TREE, and
26900 objc_being_catch_clauses() knows that that means
26901 '...'. */
26904 }
26905 else
26906 {
26907 /* We have "@catch (NSException *exception)" or something
26908 like that. Parse the parameter declaration. */
26912 else
26917 }
26920 else
26921 {
26922 /* If there was no open parenthesis, we are recovering from
26923 an error, and we are trying to figure out what mistake
26924 the user has made. */
26926 /* If there is an immediate closing parenthesis, the user
26927 probably forgot the opening one (ie, they typed "@catch
26928 NSException *e)". Parse the closing parenthesis and keep
26929 going. */
26933 /* If these is no immediate closing parenthesis, the user
26934 probably doesn't know that parenthesis are required at
26935 all (ie, they typed "@catch NSException *e"). So, just
26936 forget about the closing parenthesis and keep going. */
26937 }
26941 }
26943 {
26946 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26947 node, lest it get absorbed into the surrounding block. */
26951 }
26954 }
26956 /* Parse an Objective-C synchronized statement.
26958 objc-synchronized-stmt:
26959 @synchronized ( expression ) compound-statement
26961 Returns NULL_TREE. */
26963 static tree
26965 {
26966 location_t location;
26977 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26978 node, lest it get absorbed into the surrounding block. */
26983 }
26985 /* Parse an Objective-C throw statement.
26987 objc-throw-stmt:
26988 @throw assignment-expression [opt] ;
26990 Returns a constructed '@throw' statement. */
26992 static tree
26994 {
27006 }
27008 /* Parse an Objective-C statement. */
27010 static tree
27012 {
27013 /* Try to figure out what kind of declaration is present. */
27017 {
27028 }
27031 }
27033 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27034 look ahead to see if an objc keyword follows the attributes. This
27035 is to detect the use of prefix attributes on ObjC @interface and
27036 @protocol. */
27038 static bool
27040 {
27045 {
27048 }
27051 }
27053 /* This routine is a minimal replacement for
27054 c_parser_struct_declaration () used when parsing the list of
27055 types/names or ObjC++ properties. For example, when parsing the
27056 code
27058 @property (readonly) int a, b, c;
27060 this function is responsible for parsing "int a, int b, int c" and
27061 returning the declarations as CHAIN of DECLs.
27063 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27064 similar parsing. */
27065 static tree
27067 {
27069 cp_decl_specifier_seq declspecs;
27071 tree prefix_attributes;
27074 CP_PARSER_FLAGS_NONE,
27081 /* auto, register, static, extern, mutable. */
27083 {
27086 }
27088 /* thread_local. */
27090 {
27093 }
27095 /* typedef. */
27097 {
27100 }
27105 /* Keep going until we hit the `;' at the end of the declaration. */
27107 {
27112 /* Parse the declarator. */
27116 /* Look for attributes that apply to the ivar. */
27118 /* Remember which attributes are prefix attributes and
27119 which are not. */
27121 /* Combine the attributes. */
27131 /* Reset PREFIX_ATTRIBUTES. */
27142 {
27145 }
27146 else
27148 }
27150 }
27152 /* Parse an Objective-C @property declaration. The syntax is:
27154 objc-property-declaration:
27155 '@property' objc-property-attributes[opt] struct-declaration ;
27157 objc-property-attributes:
27158 '(' objc-property-attribute-list ')'
27160 objc-property-attribute-list:
27161 objc-property-attribute
27162 objc-property-attribute-list, objc-property-attribute
27164 objc-property-attribute
27165 'getter' = identifier
27166 'setter' = identifier
27167 'readonly'
27168 'readwrite'
27169 'assign'
27170 'retain'
27171 'copy'
27172 'nonatomic'
27174 For example:
27175 @property NSString *name;
27176 @property (readonly) id object;
27177 @property (retain, nonatomic, getter=getTheName) id name;
27178 @property int a, b, c;
27180 PS: This function is identical to
27181 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27182 static void
27184 {
27185 /* The following variables hold the attributes of the properties as
27186 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27187 seen. When we see an attribute, we set them to 'true' (if they
27188 are boolean properties) or to the identifier (if they have an
27189 argument, ie, for getter and setter). Note that here we only
27190 parse the list of attributes, check the syntax and accumulate the
27191 attributes that we find. objc_add_property_declaration() will
27192 then process the information. */
27202 /* 'properties' is the list of properties that we read. Usually a
27203 single one, but maybe more (eg, in "@property int a, b, c;" there
27204 are three). */
27205 tree properties;
27206 location_t loc;
27212 /* Parse the optional attribute list... */
27214 {
27215 /* Eat the '('. */
27219 {
27225 {
27228 }
27232 {
27243 {
27247 else
27252 }
27255 {
27259 }
27261 {
27263 {
27266 }
27267 else
27271 else
27273 }
27274 else
27275 {
27277 {
27280 }
27281 else
27283 }
27289 }
27296 else
27298 }
27300 /* FIXME: "@property (setter, assign);" will generate a spurious
27301 "error: expected ‘)’ before ‘,’ token". This is because
27302 cp_parser_require, unlike the C counterpart, will produce an
27303 error even if we are in error recovery. */
27305 {
27310 }
27311 }
27313 /* ... and the property declaration(s). */
27317 {
27319 /* If the next token is now a `;', consume it. */
27323 }
27327 else
27328 {
27329 /* Comma-separated properties are chained together in
27330 reverse order; add them one by one. */
27339 }
27342 }
27344 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27346 objc-synthesize-declaration:
27347 @synthesize objc-synthesize-identifier-list ;
27349 objc-synthesize-identifier-list:
27350 objc-synthesize-identifier
27351 objc-synthesize-identifier-list, objc-synthesize-identifier
27353 objc-synthesize-identifier
27354 identifier
27355 identifier = identifier
27357 For example:
27358 @synthesize MyProperty;
27359 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27361 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27362 for C. Keep them in sync.
27363 */
27364 static void
27366 {
27368 location_t loc;
27373 {
27377 {
27380 }
27382 {
27386 {
27389 }
27390 }
27391 else
27396 else
27398 }
27401 }
27403 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27405 objc-dynamic-declaration:
27406 @dynamic identifier-list ;
27408 For example:
27409 @dynamic MyProperty;
27410 @dynamic MyProperty, AnotherProperty;
27412 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27413 for C. Keep them in sync.
27414 */
27415 static void
27417 {
27419 location_t loc;
27424 {
27425 tree property;
27428 {
27431 }
27435 else
27437 }
27440 }
27442 \f
27443 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27445 /* Returns name of the next clause.
27446 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27447 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27448 returned and the token is consumed. */
27450 static pragma_omp_clause
27452 {
27466 {
27471 {
27616 }
27617 }
27623 }
27625 /* Validate that a clause of the given type does not already exist. */
27627 static void
27630 {
27631 tree c;
27635 {
27638 }
27639 }
27641 /* OpenMP 2.5:
27642 variable-list:
27643 identifier
27644 variable-list , identifier
27646 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27647 colon). An opening parenthesis will have been consumed by the caller.
27649 If KIND is nonzero, create the appropriate node and install the decl
27650 in OMP_CLAUSE_DECL and add the node to the head of the list.
27652 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27653 return the list created.
27655 COLON can be NULL if only closing parenthesis should end the list,
27656 or pointer to bool which will receive false if the list is terminated
27657 by closing parenthesis or true if the list is terminated by colon. */
27659 static tree
27662 {
27666 {
27669 }
27671 {
27688 {
27690 {
27693 {
27697 }
27698 /* FALL THROUGH. */
27704 {
27712 parser->colon_corrects_to_scope_p
27716 else
27717 {
27718 /* Look for `:'. */
27722 CPP_CLOSE_SQUARE))
27724 }
27725 /* Look for the closing `]'. */
27727 RT_CLOSE_SQUARE))
27731 {
27734 {
27738 }
27742 {
27746 }
27747 }
27750 }
27754 }
27760 }
27761 else
27764 get_comma:
27768 }
27774 {
27778 }
27781 {
27784 /* Try to resync to an unnested comma. Copied from
27785 cp_parser_parenthesized_expression_list. */
27786 skip_comma:
27795 }
27798 }
27800 /* Similarly, but expect leading and trailing parenthesis. This is a very
27801 common case for omp clauses. */
27803 static tree
27805 {
27809 }
27811 /* OpenACC 2.0:
27812 copy ( variable-list )
27813 copyin ( variable-list )
27814 copyout ( variable-list )
27815 create ( variable-list )
27816 delete ( variable-list )
27817 present ( variable-list )
27818 present_or_copy ( variable-list )
27819 pcopy ( variable-list )
27820 present_or_copyin ( variable-list )
27821 pcopyin ( variable-list )
27822 present_or_copyout ( variable-list )
27823 pcopyout ( variable-list )
27824 present_or_create ( variable-list )
27825 pcreate ( variable-list ) */
27827 static tree
27829 tree list)
27830 {
27833 {
27873 }
27881 }
27883 /* OpenACC 2.0:
27884 deviceptr ( variable-list ) */
27886 static tree
27888 {
27892 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27893 cp_parser_oacc_data_clause), as for PRAGMA_OMP_CLAUSE_DEVICEPTR,
27894 variable-list must only allow for pointer variables. */
27897 {
27900 /* FIXME diagnostics: Ideally we should keep individual
27901 locations for all the variables in the var list to make the
27902 following errors more precise. Perhaps
27903 c_parser_omp_var_list_parens should construct a list of
27904 locations to go along with the var list. */
27909 ;
27918 }
27921 }
27923 /* OpenACC:
27924 vector_length ( expression ) */
27926 static tree
27928 {
27932 HOST_WIDE_INT n;
27943 {
27946 }
27949 {
27954 }
27965 }
27967 /* OpenACC 2.0
27968 Parse wait clause or directive parameters. */
27970 static tree
27972 {
27982 {
27987 }
27994 {
27998 {
28000 {
28003 }
28004 else
28005 {
28013 }
28014 }
28015 }
28018 }
28020 /* OpenACC:
28021 wait ( int-expr-list ) */
28023 static tree
28025 {
28034 }
28036 /* OpenMP 3.0:
28037 collapse ( constant-expression ) */
28039 static tree
28041 {
28043 location_t loc;
28044 HOST_WIDE_INT n;
28064 {
28067 }
28075 }
28077 /* OpenMP 2.5:
28078 default ( shared | none ) */
28080 static tree
28082 {
28084 tree c;
28089 {
28094 {
28109 }
28112 }
28113 else
28114 {
28115 invalid_kind:
28117 }
28133 }
28135 /* OpenMP 3.1:
28136 final ( expression ) */
28138 static tree
28140 {
28161 }
28163 /* OpenMP 2.5:
28164 if ( expression ) */
28166 static tree
28168 {
28189 }
28191 /* OpenMP 3.1:
28192 mergeable */
28194 static tree
28197 {
28198 tree c;
28201 location);
28206 }
28208 /* OpenMP 2.5:
28209 nowait */
28211 static tree
28214 {
28215 tree c;
28222 }
28224 /* OpenACC:
28225 num_gangs ( expression ) */
28227 static tree
28229 {
28232 HOST_WIDE_INT n;
28249 {
28252 }
28262 }
28264 /* OpenMP 2.5:
28265 num_threads ( expression ) */
28267 static tree
28269 location_t location)
28270 {
28292 }
28294 /* OpenACC:
28295 num_workers ( expression ) */
28297 static tree
28299 {
28302 HOST_WIDE_INT n;
28319 {
28322 }
28325 location);
28333 }
28335 /* OpenMP 2.5:
28336 ordered */
28338 static tree
28341 {
28342 tree c;
28350 }
28352 /* OpenMP 2.5:
28353 reduction ( reduction-operator : variable-list )
28355 reduction-operator:
28356 One of: + * - & ^ | && ||
28358 OpenMP 3.1:
28360 reduction-operator:
28361 One of: + * - & ^ | && || min max
28363 OpenMP 4.0:
28365 reduction-operator:
28366 One of: + * - & ^ | && ||
28367 id-expression */
28369 static tree
28371 {
28379 {
28389 }
28393 else
28394 {
28405 {
28435 }
28436 else
28437 {
28439 resync_fail:
28444 }
28445 }
28451 NULL);
28453 {
28456 }
28459 }
28461 /* OpenMP 2.5:
28462 schedule ( schedule-kind )
28463 schedule ( schedule-kind , expression )
28465 schedule-kind:
28466 static | dynamic | guided | runtime | auto */
28468 static tree
28470 {
28479 {
28484 {
28505 }
28506 }
28511 else
28516 {
28531 else
28536 }
28544 invalid_kind:
28546 resync_fail:
28551 }
28553 /* OpenMP 3.0:
28554 untied */
28556 static tree
28559 {
28560 tree c;
28567 }
28569 /* OpenMP 4.0:
28570 inbranch
28571 notinbranch */
28573 static tree
28576 {
28581 }
28583 /* OpenMP 4.0:
28584 parallel
28585 for
28586 sections
28587 taskgroup */
28589 static tree
28593 {
28597 }
28599 /* OpenMP 4.0:
28600 num_teams ( expression ) */
28602 static tree
28604 location_t location)
28605 {
28627 }
28629 /* OpenMP 4.0:
28630 thread_limit ( expression ) */
28632 static tree
28634 location_t location)
28635 {
28657 }
28659 /* OpenMP 4.0:
28660 aligned ( variable-list )
28661 aligned ( variable-list : constant-expression ) */
28663 static tree
28665 {
28676 {
28686 }
28692 }
28694 /* OpenMP 4.0:
28695 linear ( variable-list )
28696 linear ( variable-list : expression ) */
28698 static tree
28701 {
28712 {
28716 {
28719 }
28727 }
28733 }
28735 /* OpenMP 4.0:
28736 safelen ( constant-expression ) */
28738 static tree
28740 location_t location)
28741 {
28762 }
28764 /* OpenMP 4.0:
28765 simdlen ( constant-expression ) */
28767 static tree
28769 location_t location)
28770 {
28791 }
28793 /* OpenMP 4.0:
28794 depend ( depend-kind : variable-list )
28796 depend-kind:
28797 in | out | inout */
28799 static tree
28801 {
28809 {
28819 else
28821 }
28822 else
28830 NULL);
28837 invalid_kind:
28839 resync_fail:
28844 }
28846 /* OpenMP 4.0:
28847 map ( map-kind : variable-list )
28848 map ( variable-list )
28850 map-kind:
28851 alloc | to | from | tofrom */
28853 static tree
28855 {
28864 {
28876 else
28877 {
28883 }
28886 }
28889 NULL);
28895 }
28897 /* OpenMP 4.0:
28898 device ( expression ) */
28900 static tree
28902 location_t location)
28903 {
28925 }
28927 /* OpenMP 4.0:
28928 dist_schedule ( static )
28929 dist_schedule ( static , expression ) */
28931 static tree
28933 location_t location)
28934 {
28947 {
28958 }
28963 location);
28967 invalid_kind:
28969 resync_fail:
28974 }
28976 /* OpenMP 4.0:
28977 proc_bind ( proc-bind-kind )
28979 proc-bind-kind:
28980 master | close | spread */
28982 static tree
28984 location_t location)
28985 {
28986 tree c;
28993 {
29003 else
29005 }
29006 else
29015 location);
29020 invalid_kind:
29022 resync_fail:
29027 }
29029 /* OpenACC:
29030 async [( int-expr )] */
29032 static tree
29034 {
29038 /* TODO XXX: FIX -1 (acc_async_noval). */
29042 {
29051 }
29061 }
29063 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29064 is a bitmask in MASK. Return the list of clauses found. */
29066 static tree
29070 {
29075 {
29076 location_t here;
29077 pragma_omp_clause c_kind;
29088 {
29170 clauses =
29181 }
29186 {
29187 /* Remove the invalid clause(s) from the list to avoid
29188 confusing the rest of the compiler. */
29191 }
29192 }
29194 saw_error:
29201 }
29203 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29204 is a bitmask in MASK. Return the list of clauses found; the result
29205 of clause default goes in *pdefault. */
29207 static tree
29211 {
29218 {
29219 pragma_omp_clause c_kind;
29230 {
29242 clauses);
29256 clauses);
29265 clauses);
29289 clauses);
29303 clauses);
29320 OMP_CLAUSE_NOTINBRANCH,
29329 {
29330 clause_not_first:
29334 }
29359 clauses);
29364 clauses);
29369 clauses);
29432 }
29437 {
29438 /* Remove the invalid clause(s) from the list to avoid
29439 confusing the rest of the compiler. */
29442 }
29443 }
29444 saw_error:
29445 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29446 no reason to skip to the end. */
29452 }
29454 /* OpenMP 2.5:
29455 structured-block:
29456 statement
29458 In practice, we're also interested in adding the statement to an
29459 outer node. So it is convenient if we work around the fact that
29460 cp_parser_statement calls add_stmt. */
29462 static unsigned
29464 {
29467 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29468 This preserves the "not within loop or switch" style error messages
29469 for nonsense cases like
29470 void foo() {
29471 #pragma omp single
29472 break;
29473 }
29474 */
29479 }
29481 static void
29483 {
29485 }
29487 static tree
29489 {
29497 }
29499 /* OpenMP 2.5:
29500 # pragma omp atomic new-line
29501 expression-stmt
29503 expression-stmt:
29504 x binop= expr | x++ | ++x | x-- | --x
29505 binop:
29506 +, *, -, /, &, ^, |, <<, >>
29508 where x is an lvalue expression with scalar type.
29510 OpenMP 3.1:
29511 # pragma omp atomic new-line
29512 update-stmt
29514 # pragma omp atomic read new-line
29515 read-stmt
29517 # pragma omp atomic write new-line
29518 write-stmt
29520 # pragma omp atomic update new-line
29521 update-stmt
29523 # pragma omp atomic capture new-line
29524 capture-stmt
29526 # pragma omp atomic capture new-line
29527 capture-block
29529 read-stmt:
29530 v = x
29531 write-stmt:
29532 x = expr
29533 update-stmt:
29534 expression-stmt | x = x binop expr
29535 capture-stmt:
29536 v = expression-stmt
29537 capture-block:
29538 { v = x; update-stmt; } | { update-stmt; v = x; }
29540 OpenMP 4.0:
29541 update-stmt:
29542 expression-stmt | x = x binop expr | x = expr binop x
29543 capture-stmt:
29544 v = update-stmt
29545 capture-block:
29546 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29548 where x and v are lvalue expressions with scalar type. */
29550 static void
29552 {
29560 {
29565 {
29571 }
29572 }
29574 {
29586 else
29590 }
29592 {
29598 {
29603 {
29606 }
29607 }
29608 }
29612 {
29622 else
29627 {
29628 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29629 opcode. */
29634 }
29638 {
29641 }
29642 else
29643 {
29649 }
29652 }
29654 restart:
29658 {
29665 /* FALLTHROUGH */
29675 /* FALLTHROUGH */
29690 /* Undo effects of boolean_increment for post {in,de}crement. */
29692 /* FALLTHRU */
29696 {
29697 /* Undo effects of boolean_increment. */
29699 {
29700 /* This is pre or post increment. */
29705 && !structured_block
29709 }
29710 }
29711 /* FALLTHRU */
29714 {
29749 {
29753 }
29756 {
29762 {
29767 }
29769 {
29780 {
29782 {
29787 }
29788 else
29790 }
29794 }
29797 {
29804 }
29808 }
29812 {
29815 {
29823 }
29825 {
29830 }
29865 }
29876 /* FALLTHROUGH */
29881 }
29888 }
29889 stmt_done:
29891 {
29902 }
29904 {
29907 }
29908 done:
29914 saw_error:
29917 {
29921 {
29925 }
29926 }
29927 }
29930 /* OpenMP 2.5:
29931 # pragma omp barrier new-line */
29933 static void
29935 {
29938 }
29940 /* OpenMP 2.5:
29941 # pragma omp critical [(name)] new-line
29942 structured-block */
29944 static tree
29946 {
29950 {
29962 }
29967 }
29969 /* OpenMP 2.5:
29970 # pragma omp flush flush-vars[opt] new-line
29972 flush-vars:
29973 ( variable-list ) */
29975 static void
29977 {
29983 }
29985 /* Helper function, to parse omp for increment expression. */
29987 static tree
29989 {
29994 {
29997 }
30000 {
30009 /* Fall through: OpenMP disallows NE_EXPR. */
30012 }
30014 /* If decl is an iterator, preserve LHS and RHS of the relational
30015 expr until finish_omp_for. */
30025 }
30027 /* Helper function, to parse omp for increment expression. */
30029 static tree
30031 {
30035 cp_id_kind idk;
30039 {
30047 }
30055 {
30060 }
30067 {
30071 }
30083 do
30084 {
30091 {
30093 {
30096 else
30098 tf_warning_or_error);
30099 }
30100 else
30103 }
30104 }
30108 {
30112 }
30113 else
30117 }
30119 /* Parse the initialization statement of either an OpenMP for loop or
30120 a Cilk Plus for loop.
30122 Return true if the resulting construct should have an
30123 OMP_CLAUSE_PRIVATE added to it. */
30125 static bool
30133 {
30139 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30141 init-expr:
30142 var = lb
30143 integer-type var = lb
30144 random-access-iterator-type var = lb
30145 pointer-type var = lb
30146 */
30147 cp_decl_specifier_seq type_specifiers;
30149 /* First, try to parse as an initialized declaration. See
30150 cp_parser_condition, from whence the bulk of this is copied. */
30157 {
30158 /* If parsing a type specifier seq succeeded, then this
30159 MUST be a initialized declaration. */
30164 CP_PARSER_DECLARATOR_NAMED,
30175 else
30176 {
30186 {
30188 CPP_OPEN_PAREN))
30189 {
30193 else
30196 }
30197 else
30198 /* Trigger an error. */
30203 }
30207 {
30215 {
30218 auto_node);
30223 }
30226 asm_specification,
30227 LOOKUP_ONLYCONVERTING);
30229 {
30232 }
30233 else
30236 }
30237 else
30238 {
30239 /* Consume '='. */
30243 non_class:
30246 else
30249 asm_specification,
30250 LOOKUP_ONLYCONVERTING);
30251 }
30255 }
30256 }
30257 else
30258 {
30259 cp_id_kind idk;
30260 /* If parsing a type specifier sequence failed, then
30261 this MUST be a simple expression. */
30269 && decl
30272 {
30273 tree rhs;
30280 rhs,
30281 tf_warning_or_error));
30283 }
30284 else
30285 {
30290 {
30294 }
30295 }
30296 }
30298 }
30300 /* Parse the restricted form of the for statement allowed by OpenMP. */
30302 static tree
30305 {
30309 location_t loc_first;
30328 {
30331 location_t loc;
30335 {
30338 }
30341 {
30344 }
30353 add_private_clause
30360 {
30363 {
30369 }
30370 else
30372 }
30379 {
30384 {
30388 }
30391 {
30392 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30393 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30398 {
30401 }
30402 else
30403 {
30406 }
30410 }
30411 else
30412 {
30417 }
30418 }
30421 {
30422 tree c;
30424 {
30433 decl);
30437 decl);
30438 }
30440 {
30445 {
30448 }
30449 }
30450 }
30459 {
30460 /* If decl is an iterator, preserve the operator on decl
30461 until finish_omp_for. */
30463 && ((processing_template_decl
30467 else
30471 }
30486 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30487 in between the collapsed for loops to be still considered perfectly
30488 nested. Hopefully the final version clarifies this.
30489 For now handle (multiple) {'s and empty statements. */
30491 do
30492 {
30496 {
30498 bracecount++;
30499 }
30503 else
30504 {
30511 }
30512 }
30516 {
30519 }
30520 }
30522 /* Note that we saved the original contents of this flag when we entered
30523 the structured block, and so we don't need to re-save it here. */
30526 else
30529 /* Note that the grammar doesn't call for a structured block here,
30530 though the loop as a whole is a structured block. */
30537 else
30542 {
30544 {
30546 nbraces--;
30547 }
30550 else
30551 {
30553 {
30556 }
30561 }
30562 }
30569 }
30571 /* Helper function for OpenMP parsing, split clauses and call
30572 finish_omp_clauses on each of the set of clauses afterwards. */
30574 static void
30577 {
30583 }
30585 /* OpenMP 4.0:
30586 #pragma omp simd simd-clause[optseq] new-line
30587 for-loop */
30589 #define OMP_SIMD_CLAUSE_MASK \
30590 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30598 static tree
30601 {
30613 {
30616 }
30627 }
30629 /* OpenMP 2.5:
30630 #pragma omp for for-clause[optseq] new-line
30631 for-loop
30633 OpenMP 4.0:
30634 #pragma omp for simd for-simd-clause[optseq] new-line
30635 for-loop */
30637 #define OMP_FOR_CLAUSE_MASK \
30638 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30647 static tree
30650 {
30661 {
30666 {
30674 cclauses);
30678 cclauses);
30690 }
30691 }
30693 {
30696 }
30701 {
30704 }
30715 }
30717 /* OpenMP 2.5:
30718 # pragma omp master new-line
30719 structured-block */
30721 static tree
30723 {
30727 }
30729 /* OpenMP 2.5:
30730 # pragma omp ordered new-line
30731 structured-block */
30733 static tree
30735 {
30739 }
30741 /* OpenMP 2.5:
30743 section-scope:
30744 { section-sequence }
30746 section-sequence:
30747 section-directive[opt] structured-block
30748 section-sequence section-directive structured-block */
30750 static tree
30752 {
30763 {
30767 }
30770 {
30778 {
30782 }
30784 {
30787 }
30792 }
30803 }
30805 /* OpenMP 2.5:
30806 # pragma omp sections sections-clause[optseq] newline
30807 sections-scope */
30809 #define OMP_SECTIONS_CLAUSE_MASK \
30810 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30816 static tree
30819 {
30831 {
30834 }
30841 }
30843 /* OpenMP 2.5:
30844 # pragma omp parallel parallel-clause[optseq] new-line
30845 structured-block
30846 # pragma omp parallel for parallel-for-clause[optseq] new-line
30847 structured-block
30848 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30849 structured-block
30851 OpenMP 4.0:
30852 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30853 structured-block */
30855 #define OMP_PARALLEL_CLAUSE_MASK \
30856 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30866 static tree
30869 {
30878 {
30891 block);
30896 }
30898 {
30902 }
30904 {
30907 }
30909 {
30913 {
30923 block);
30926 }
30927 }
30937 }
30939 /* OpenMP 2.5:
30940 # pragma omp single single-clause[optseq] new-line
30941 structured-block */
30943 #define OMP_SINGLE_CLAUSE_MASK \
30944 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30949 static tree
30951 {
30961 }
30963 /* OpenMP 3.0:
30964 # pragma omp task task-clause[optseq] new-line
30965 structured-block */
30967 #define OMP_TASK_CLAUSE_MASK \
30968 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30978 static tree
30980 {
30991 }
30993 /* OpenMP 3.0:
30994 # pragma omp taskwait new-line */
30996 static void
30998 {
31001 }
31003 /* OpenMP 3.1:
31004 # pragma omp taskyield new-line */
31006 static void
31008 {
31011 }
31013 /* OpenMP 4.0:
31014 # pragma omp taskgroup new-line
31015 structured-block */
31017 static tree
31019 {
31023 }
31026 /* OpenMP 2.5:
31027 # pragma omp threadprivate (variable-list) */
31029 static void
31031 {
31032 tree vars;
31038 }
31040 /* OpenMP 4.0:
31041 # pragma omp cancel cancel-clause[optseq] new-line */
31043 #define OMP_CANCEL_CLAUSE_MASK \
31044 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31050 static void
31052 {
31056 }
31058 /* OpenMP 4.0:
31059 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31061 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31062 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31067 static void
31069 {
31070 tree clauses;
31074 {
31079 {
31082 }
31083 }
31085 {
31089 }
31092 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31094 pragma_tok);
31096 }
31098 /* OpenMP 4.0:
31099 #pragma omp distribute distribute-clause[optseq] new-line
31100 for-loop */
31102 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31103 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31108 static tree
31111 {
31120 {
31128 else
31131 {
31137 {
31140 cclauses);
31141 else
31143 cclauses);
31144 }
31149 cclauses);
31150 else
31152 cclauses);
31164 }
31165 }
31167 {
31170 }
31175 {
31178 }
31189 }
31191 /* OpenMP 4.0:
31192 # pragma omp teams teams-clause[optseq] new-line
31193 structured-block */
31195 #define OMP_TEAMS_CLAUSE_MASK \
31196 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31204 static tree
31207 {
31216 {
31220 {
31228 cclauses);
31232 cclauses);
31243 }
31244 }
31246 {
31249 }
31254 {
31257 }
31265 }
31267 /* OpenMP 4.0:
31268 # pragma omp target data target-data-clause[optseq] new-line
31269 structured-block */
31271 #define OMP_TARGET_DATA_CLAUSE_MASK \
31272 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31276 static tree
31278 {
31290 }
31292 /* OpenMP 4.0:
31293 # pragma omp target update target-update-clause[optseq] new-line */
31295 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31301 static bool
31304 {
31306 {
31308 "%<#pragma omp target update%> may only be "
31312 }
31314 tree clauses
31319 {
31321 "%<#pragma omp target update must contain at least one "
31324 }
31332 }
31334 /* OpenMP 4.0:
31335 # pragma omp target target-clause[optseq] new-line
31336 structured-block */
31338 #define OMP_TARGET_CLAUSE_MASK \
31339 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31343 static bool
31346 {
31348 {
31352 }
31355 {
31360 {
31368 {
31370 OMP_TARGET_CLAUSE_MASK,
31371 cclauses);
31373 }
31389 }
31391 {
31394 }
31396 {
31400 }
31402 {
31405 }
31406 }
31420 }
31422 /* OpenACC 2.0:
31423 # pragma acc cache (variable-list) new-line
31424 */
31426 static tree
31428 {
31443 }
31445 /* OpenACC 2.0:
31446 # pragma acc data oacc-data-clause[optseq] new-line
31447 structured-block */
31449 #define OACC_DATA_CLAUSE_MASK \
31450 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE))
31462 static tree
31464 {
31477 }
31479 /* OpenACC 2.0:
31480 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31482 or
31484 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31486 LOC is the location of the #pragma token.
31487 */
31489 #define OACC_ENTER_DATA_CLAUSE_MASK \
31490 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT) )
31498 #define OACC_EXIT_DATA_CLAUSE_MASK \
31499 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DELETE) \
31503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT) )
31505 static tree
31508 {
31513 {
31519 }
31524 {
31528 }
31535 else
31540 {
31544 }
31550 else
31555 }
31557 /* OpenACC 2.0:
31558 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31559 structured-block */
31561 #define OACC_KERNELS_CLAUSE_MASK \
31562 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31576 static tree
31578 {
31591 }
31593 /* OpenACC 2.0:
31594 # pragma acc loop oacc-loop-clause[optseq] new-line
31595 structured-block */
31597 #define OACC_LOOP_CLAUSE_MASK \
31598 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
31599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION))
31601 static tree
31603 {
31616 }
31618 /* OpenACC 2.0:
31619 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31620 structured-block */
31622 #define OACC_PARALLEL_CLAUSE_MASK \
31623 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_GANGS) \
31631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_WORKERS) \
31632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_VECTOR_LENGTH) \
31639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31641 static tree
31643 {
31656 }
31658 /* OpenACC 2.0:
31659 # pragma acc update oacc-update-clause[optseq] new-line
31660 */
31662 #define OACC_UPDATE_CLAUSE_MASK \
31663 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HOST) \
31666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SELF) \
31668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31670 static tree
31672 {
31679 {
31681 "%<#pragma acc update%> must contain at least one "
31684 }
31692 }
31694 /* OpenACC 2.0:
31695 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31697 LOC is the location of the #pragma token.
31698 */
31700 #define OACC_WAIT_CLAUSE_MASK \
31701 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC))
31703 static tree
31705 {
31718 }
31720 /* OpenMP 4.0:
31721 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31723 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31724 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31731 static void
31734 {
31736 cp_omp_declare_simd_data data;
31738 {
31743 }
31754 {
31758 {
31771 }
31776 "%<#pragma omp declare simd%> not immediately followed by "
31780 }
31781 }
31783 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31784 This function is modelled similar to the late parsing of omp declare
31785 simd. */
31787 static tree
31789 {
31795 {
31801 }
31803 {
31807 }
31812 {
31819 NULL);
31833 }
31838 }
31840 /* Finalize #pragma omp declare simd clauses after direct declarator has
31841 been parsed, and put that into "omp declare simd" attribute. */
31843 static tree
31845 {
31851 {
31856 }
31861 {
31879 }
31883 }
31886 /* OpenMP 4.0:
31887 # pragma omp declare target new-line
31888 declarations and definitions
31889 # pragma omp end declare target new-line */
31891 static void
31893 {
31896 }
31898 static void
31900 {
31903 {
31906 }
31908 {
31912 {
31915 }
31918 else
31919 {
31923 }
31924 }
31925 else
31926 {
31930 }
31934 "%<#pragma omp end declare target%> without corresponding "
31936 else
31938 }
31940 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31941 expression and optional initializer clause of
31942 #pragma omp declare reduction. We store the expression(s) as
31943 either 3, 6 or 7 special statements inside of the artificial function's
31944 body. The first two statements are DECL_EXPRs for the artificial
31945 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31946 expression that uses those variables.
31947 If there was any INITIALIZER clause, this is followed by further statements,
31948 the fourth and fifth statements are DECL_EXPRs for the artificial
31949 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31950 constructor variant (first token after open paren is not omp_priv),
31951 then the sixth statement is a statement with the function call expression
31952 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31953 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31954 to initialize the OMP_PRIV artificial variable and there is seventh
31955 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31957 static bool
31959 {
31971 tree combiner;
31986 {
31989 }
31992 {
31999 {
32002 }
32018 {
32022 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32026 == CPP_CLOSE_PAREN
32029 {
32033 }
32038 }
32039 else
32040 {
32056 {
32061 }
32063 tree arg;
32076 }
32087 }
32093 }
32095 /* OpenMP 4.0
32096 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32097 initializer-clause[opt] new-line
32099 initializer-clause:
32100 initializer (omp_priv initializer)
32101 initializer (function-name (argument-list)) */
32103 static void
32106 {
32116 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32123 {
32155 }
32167 /* Types may not be defined in declare reduction type list. */
32170 parser->type_definition_forbidden_message
32176 saved_colon_doesnt_start_class_def_p
32181 {
32185 ;
32206 else
32211 else
32213 }
32215 /* Restore the saved message. */
32218 parser->colon_doesnt_start_class_def_p
32223 {
32224 fail:
32227 }
32233 {
32234 tree fntype
32237 NULL_TREE);
32256 {
32261 }
32263 {
32265 {
32274 }
32281 }
32282 else
32283 {
32286 }
32289 else
32292 {
32295 }
32297 {
32300 else
32305 }
32310 else
32311 {
32320 }
32327 }
32331 done:
32332 /* Free any declarators allocated. */
32334 }
32336 /* OpenMP 4.0
32337 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32338 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32339 initializer-clause[opt] new-line
32340 #pragma omp declare target new-line */
32342 static void
32345 {
32347 {
32352 {
32355 context);
32357 }
32360 {
32363 context);
32365 }
32367 {
32370 }
32372 {
32376 }
32377 }
32381 }
32383 /* Main entry point to OpenMP statement pragmas. */
32385 static void
32387 {
32388 tree stmt;
32393 {
32468 }
32472 }
32473 \f
32474 /* Transactional Memory parsing routines. */
32476 /* Parse a transaction attribute.
32478 txn-attribute:
32479 attribute
32480 [ [ identifier ] ]
32482 ??? Simplify this when C++0x bracket attributes are
32483 implemented properly. */
32485 static tree
32487 {
32502 {
32506 /* For keywords, use the canonical spelling,
32507 not the parsed identifier. */
32511 }
32512 else
32516 error1:
32519 }
32521 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32523 transaction-statement:
32524 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32525 compound-statement
32526 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32527 */
32529 static tree
32531 {
32546 else
32547 {
32551 }
32553 /* Parse a noexcept specification. */
32556 /* Keep track if we're in the lexical scope of an outer transaction. */
32568 }
32570 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32572 transaction-expression:
32573 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32574 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32575 */
32577 static tree
32579 {
32604 /* Set this early. This might mean that we allow transaction_cancel in
32605 an expression that we find out later actually has to be a constexpr.
32606 However, we expect that cxx_constant_value will be able to deal with
32607 this; also, if the noexcept has no constexpr, then what we parse next
32608 really is a transaction's body. */
32611 /* Parse a noexcept specification. */
32617 {
32624 }
32625 else
32626 {
32627 /* The only expression that is available got parsed for the noexcept
32628 already. noexcept is true then. */
32631 }
32640 }
32642 /* Parse a function-transaction-block.
32644 function-transaction-block:
32645 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32646 function-body
32647 __transaction_atomic txn-attribute[opt] function-try-block
32648 __transaction_relaxed ctor-initializer[opt] function-body
32649 __transaction_relaxed function-try-block
32650 */
32652 static bool
32654 {
32670 else
32671 {
32675 }
32683 else
32684 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32692 }
32694 /* Parse a __transaction_cancel statement.
32696 cancel-statement:
32697 __transaction_cancel txn-attribute[opt] ;
32698 __transaction_cancel txn-attribute[opt] throw-expression ;
32700 ??? Cancel and throw is not yet implemented. */
32702 static tree
32704 {
32710 RT_TRANSACTION_CANCEL);
32717 /* ??? Parse cancel-and-throw here. */
32722 {
32726 }
32728 {
32732 }
32734 {
32737 {
32743 }
32744 }
32746 {
32750 }
32756 }
32757 \f
32758 /* The parser. */
32762 \f
32763 /* Special handling for the first token or line in the file. The first
32764 thing in the file might be #pragma GCC pch_preprocess, which loads a
32765 PCH file, which is a GC collection point. So we need to handle this
32766 first pragma without benefit of an existing lexer structure.
32768 Always returns one token to the caller in *FIRST_TOKEN. This is
32769 either the true first token of the file, or the first token after
32770 the initial pragma. */
32772 static void
32774 {
32783 {
32790 }
32791 else
32794 /* Skip to the end of the pragma. */
32798 /* Now actually load the PCH file. */
32802 /* Read one more token to return to our caller. We have to do this
32803 after reading the PCH file in, since its pointers have to be
32804 live. */
32806 }
32808 /* Parses the grainsize pragma for the _Cilk_for statement.
32809 Syntax:
32810 #pragma cilk grainsize = <VALUE>. */
32812 static void
32814 {
32816 {
32821 {
32824 }
32826 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32829 else
32831 "%<#pragma cilk grainsize%> is not followed by "
32834 }
32836 }
32838 /* Normal parsing of a pragma token. Here we can (and must) use the
32839 regular lexer. */
32841 static bool
32843 {
32855 {
32863 {
32873 }
32878 {
32888 }
32893 {
32899 "%<#pragma omp taskwait%> may only be "
32904 }
32909 {
32915 "%<#pragma omp taskyield%> may only be "
32920 }
32925 {
32931 "%<#pragma omp cancel%> may only be "
32936 }
32941 {
32947 "%<#pragma omp cancellation point%> may only be "
32952 }
32999 "%<#pragma omp section%> may only be used in "
33004 {
33011 {
33014 }
33017 }
33021 {
33025 }
33031 {
33035 }
33037 /* Ignore the pragma if Cilk Plus is not enabled. */
33039 {
33042 }
33043 else
33044 {
33048 }
33055 bad_stmt:
33058 }
33062 }
33064 /* The interface the pragma parsers have to the lexer. */
33066 enum cpp_ttype
33068 {
33081 else
33082 {
33086 }
33089 }
33091 \f
33092 /* External interface. */
33094 /* Parse one entire translation unit. */
33096 void
33098 {
33110 }
33112 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33113 vectorlength clause:
33114 Syntax:
33115 vectorlength ( constant-expression ) */
33117 static tree
33120 {
33122 tree expr;
33123 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33124 safelen clause. Thus, vectorlength is represented as OMP 4.0
33125 safelen. For SIMD-enabled function it is represented by OMP 4.0
33126 simdlen. */
33129 loc);
33130 else
33132 loc);
33140 /* If expr == error_mark_node, then don't emit any errors nor
33141 create a clause. if any of the above functions returns
33142 error mark node then they would have emitted an error message. */
33144 ;
33152 else
33153 {
33154 tree c;
33156 {
33161 }
33162 else
33163 {
33168 }
33169 }
33174 }
33176 /* Handles the Cilk Plus #pragma simd linear clause.
33177 Syntax:
33178 linear ( simd-linear-variable-list )
33180 simd-linear-variable-list:
33181 simd-linear-variable
33182 simd-linear-variable-list , simd-linear-variable
33184 simd-linear-variable:
33185 id-expression
33186 id-expression : simd-linear-step
33188 simd-linear-step:
33189 conditional-expression */
33191 static tree
33193 {
33199 {
33203 }
33208 {
33211 {
33215 }
33222 {
33226 }
33227 else
33228 {
33232 /* If present, parse the linear step. Otherwise, assume the default
33233 value of 1. */
33235 {
33242 {
33243 /* If an error has occurred, then the whole pragma is
33244 considered ill-formed. Thus, no reason to keep
33245 parsing. */
33248 }
33256 else
33258 "step size must be an integer constant "
33260 }
33262 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33268 }
33273 else
33274 {
33279 }
33280 }
33284 }
33286 /* Returns the name of the next clause. If the clause is not
33287 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33288 token is not consumed. Otherwise, the appropriate enum from the
33289 pragma_simd_clause is returned and the token is consumed. */
33291 static pragma_omp_clause
33293 {
33294 pragma_omp_clause clause_type;
33311 else
33316 }
33318 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33320 static tree
33322 {
33327 {
33328 pragma_omp_clause c_kind;
33335 /* Use the OpenMP 4.0 equivalent function. */
33338 /* Use the OpenMP 4.0 equivalent function. */
33340 clauses);
33342 /* Use the OMP 4.0 equivalent function. */
33344 clauses);
33346 /* Use the OMP 4.0 equivalent function. */
33348 else
33349 {
33353 }
33354 }
33360 else
33362 }
33364 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33366 static void
33368 {
33375 {
33379 }
33388 }
33390 /* Main entry-point for parsing Cilk Plus _Cilk_for
33391 loops. The return value is error_mark_node
33392 when errors happen and CILK_FOR tree on success. */
33394 static tree
33396 {
33411 else
33417 }
33419 /* Create an identifier for a generic parameter type (a synthesized
33420 template parameter implied by `auto' or a concept identifier). */
33423 static tree
33425 {
33429 }
33431 /* Predicate that behaves as is_auto_or_concept but matches the parent
33432 node of the generic type rather than the generic type itself. This
33433 allows for type transformation in add_implicit_template_parms. */
33437 {
33439 }
33441 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33442 (creating a new template parameter list if necessary). Returns the newly
33443 created template type parm. */
33445 tree
33447 {
33450 /* We are either continuing a function template that already contains implicit
33451 template parameters, creating a new fully-implicit function template, or
33452 extending an existing explicit function template with implicit template
33453 parameters. */
33461 {
33465 }
33466 else
33467 {
33468 /* Roll back to the existing template parameter scope (in the case of
33469 extending an explicit function template) or introduce a new template
33470 parameter scope ahead of the function parameter scope (or class scope
33471 in the case of out-of-line member definitions). The function scope is
33472 added back after template parameter synthesis below. */
33477 {
33480 }
33482 {
33483 /* If not defining a class, then any class scope is a scope level in
33484 an out-of-line member definition. In this case simply wind back
33485 beyond the first such scope to inject the template parameter list.
33486 Otherwise wind back to the class being defined. The latter can
33487 occur in class member friend declarations such as:
33489 class A {
33490 void foo (auto);
33491 };
33492 class B {
33493 friend void A::foo (auto);
33494 };
33496 The template parameter list synthesized for the friend declaration
33497 must be injected in the scope of 'B'. This can also occur in
33498 erroneous cases such as:
33500 struct A {
33501 struct B {
33502 void foo (auto);
33503 };
33504 void B::foo (auto) {}
33505 };
33507 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33508 but, nevertheless, the template parameter list synthesized for the
33509 declarator should be injected into the scope of 'A' as if the
33510 ill-formed template was specified explicitly. */
33513 {
33516 }
33517 }
33523 {
33524 /* Introduce a new template parameter list for implicit template
33525 parameters. */
33529 parser->implicit_template_scope
33536 }
33537 else
33538 {
33539 /* Synthesize implicit template parameters at the end of the explicit
33540 template parameter list. */
33547 parser->implicit_template_parms
33549 }
33550 }
33552 /* Synthesize a new template parameter and track the current template
33553 parameter chain with implicit_template_parms. */
33557 synth_id);
33558 tree new_parm
33560 input_location,
33567 parser->implicit_template_parms
33569 else
33574 /* If creating a fully implicit function template, start the new implicit
33575 template parameter list with this synthesized type, otherwise grow the
33576 current template parameter list. */
33579 {
33586 }
33587 else
33588 {
33593 }
33598 }
33600 /* Finish the declaration of a fully implicit function template. Such a
33601 template has no explicit template parameter list so has not been through the
33602 normal template head and tail processing. synthesize_implicit_template_parm
33603 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33604 provided if the declaration is a class member such that its template
33605 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33606 form is returned. Otherwise NULL_TREE is returned. */
33608 tree
33610 {
33615 {
33619 }
33629 }