| blob | d16e0d34fa5130017db0ddec261580219de18232 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2014 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
59 \f
60 /* The lexer. */
62 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
63 and c-lex.c) and the C++ parser. */
66 {
68 };
70 /* The various kinds of non integral constant we encounter. */
72 NIC_NONE,
73 /* floating-point literal */
74 NIC_FLOAT,
75 /* %<this%> */
76 NIC_THIS,
77 /* %<__FUNCTION__%> */
78 NIC_FUNC_NAME,
79 /* %<__PRETTY_FUNCTION__%> */
80 NIC_PRETTY_FUNC,
81 /* %<__func__%> */
82 NIC_C99_FUNC,
83 /* "%<va_arg%> */
84 NIC_VA_ARG,
85 /* a cast */
86 NIC_CAST,
87 /* %<typeid%> operator */
88 NIC_TYPEID,
89 /* non-constant compound literals */
90 NIC_NCC,
91 /* a function call */
92 NIC_FUNC_CALL,
93 /* an increment */
94 NIC_INC,
95 /* an decrement */
96 NIC_DEC,
97 /* an array reference */
98 NIC_ARRAY_REF,
99 /* %<->%> */
100 NIC_ARROW,
101 /* %<.%> */
102 NIC_POINT,
103 /* the address of a label */
104 NIC_ADDR_LABEL,
105 /* %<*%> */
106 NIC_STAR,
107 /* %<&%> */
108 NIC_ADDR,
109 /* %<++%> */
110 NIC_PREINCREMENT,
111 /* %<--%> */
112 NIC_PREDECREMENT,
113 /* %<new%> */
114 NIC_NEW,
115 /* %<delete%> */
116 NIC_DEL,
117 /* calls to overloaded operators */
118 NIC_OVERLOADED,
119 /* an assignment */
120 NIC_ASSIGNMENT,
121 /* a comma operator */
122 NIC_COMMA,
123 /* a call to a constructor */
124 NIC_CONSTRUCTOR,
125 /* a transaction expression */
126 NIC_TRANSACTION
129 /* The various kinds of errors about name-lookup failing. */
131 /* NULL */
132 NLE_NULL,
133 /* is not a type */
134 NLE_TYPE,
135 /* is not a class or namespace */
136 NLE_CXX98,
137 /* is not a class, namespace, or enumeration */
138 NLE_NOT_CXX98
141 /* The various kinds of required token */
143 RT_NONE,
165 /* The type is CPP_KEYWORD */
194 RT_TRANSACTION_CANCEL /* __transaction_cancel */
197 /* Prototypes. */
203 static void cp_lexer_destroy
205 static int cp_lexer_saving_tokens
209 static void cp_lexer_get_preprocessor_token
217 static bool cp_lexer_next_token_is_not
219 static bool cp_lexer_next_token_is_keyword
223 static void cp_lexer_purge_token
225 static void cp_lexer_purge_tokens_after
227 static void cp_lexer_save_tokens
229 static void cp_lexer_commit_tokens
231 static void cp_lexer_rollback_tokens
233 static void cp_lexer_print_token
237 static void cp_lexer_start_debugging
239 static void cp_lexer_stop_debugging
245 static void cp_parser_initial_pragma
248 static tree cp_literal_operator_id
251 static void cp_parser_cilk_simd
253 static tree cp_parser_cilk_for
255 static bool cp_parser_omp_declare_reduction_exprs
257 static tree cp_parser_cilk_simd_vectorlength
260 /* Manifest constants. */
261 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
262 #define CP_SAVED_TOKEN_STACK 5
264 /* Variables. */
266 /* The stream to which debugging output should be written. */
269 /* Nonzero if we are parsing an unevaluated operand: an operand to
270 sizeof, typeof, or alignof. */
273 /* Dump up to NUM tokens in BUFFER to FILE starting with token
274 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
275 first token in BUFFER. If NUM is 0, dump all the tokens. If
276 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
277 highlighted by surrounding it in [[ ]]. */
279 static void
283 {
300 {
303 }
308 {
315 nprinted++;
325 {
335 }
336 }
339 {
342 }
345 }
348 /* Dump all tokens in BUFFER to stderr. */
350 void
352 {
354 }
356 DEBUG_FUNCTION void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
367 else
369 }
372 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
373 description for T. */
375 static void
377 {
379 {
382 }
383 }
386 /* Dump parser context C to FILE. */
388 static void
390 {
395 }
398 /* Print the stack of parsing contexts to FILE starting with FIRST. */
400 static void
402 {
408 {
411 }
412 }
415 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
417 static void
419 {
422 }
425 /* Print an unparsed function entry UF to FILE. */
427 static void
429 {
432 tree fn;
437 i++)
438 {
444 }
449 {
452 }
458 {
461 }
463 }
466 /* Print the stack of unparsed member functions S to FILE. */
468 static void
471 {
477 {
480 }
481 }
484 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
485 the given PARSER. If FILE is NULL, the output is printed on stderr. */
487 static void
489 {
501 next_token);
502 }
505 /* Dump debugging information for the given PARSER. If FILE is NULL,
506 the output is printed on stderr. */
508 void
510 {
513 expanded_location eloc;
591 }
593 DEBUG_FUNCTION void
595 {
597 }
599 DEBUG_FUNCTION void
601 {
604 else
606 }
608 /* Allocate memory for a new lexer object and return it. */
612 {
617 /* Allocate the memory. */
620 /* Initially we are not debugging. */
625 /* Create the buffer. */
629 }
632 /* Create a new main C++ lexer, the lexer that gets tokens from the
633 preprocessor. */
637 {
639 cp_token token;
641 /* It's possible that parsing the first pragma will load a PCH file,
642 which is a GC collection point. So we have to do that before
643 allocating any memory. */
648 /* Put the first token in the buffer. */
651 /* Get the remaining tokens from the preprocessor. */
653 {
656 }
665 /* Subsequent preprocessor diagnostics should use compiler
666 diagnostic functions to get the compiler source location. */
671 }
673 /* Create a new lexer whose token stream is primed with the tokens in
674 CACHE. When these tokens are exhausted, no new tokens will be read. */
678 {
683 /* We do not own the buffer. */
690 /* Initially we are not debugging. */
695 }
697 /* Frees all resources associated with LEXER. */
699 static void
701 {
705 }
707 /* Returns nonzero if debugging information should be output. */
711 {
713 }
718 {
722 }
726 {
728 }
732 {
734 }
738 {
741 else
743 }
747 {
751 }
753 /* nonzero if we are presently saving tokens. */
757 {
759 }
761 /* Store the next token from the preprocessor in *TOKEN. Return true
762 if we reach EOF. If LEXER is NULL, assume we are handling an
763 initial #pragma pch_preprocess, and thus want the lexer to return
764 processed strings. */
766 static void
768 {
771 /* Get a new token from the preprocessor. */
772 token->type
780 /* On some systems, some header files are surrounded by an
781 implicit extern "C" block. Set a flag in the token if it
782 comes from such a header. */
787 /* Check to see if this token is a keyword. */
789 {
791 {
792 /* Mark this token as a keyword. */
794 /* Record which keyword. */
796 }
797 else
798 {
802 {
803 /* Warn about the C++0x keyword (but still treat it as
804 an identifier). */
809 /* Clear out the C_RID_CODE so we don't warn about this
810 particular identifier-turned-keyword again. */
812 }
815 }
816 }
818 {
819 /* This only happens in Objective-C++; it must be a keyword. */
822 {
823 /* Replace 'class' with '@class', 'private' with '@private',
824 etc. This prevents confusion with the C++ keyword
825 'class', and makes the tokens consistent with other
826 Objective-C 'AT' keywords. For example '@class' is
827 reported as RID_AT_CLASS which is consistent with
828 '@synchronized', which is reported as
829 RID_AT_SYNCHRONIZED.
830 */
839 }
840 }
842 {
843 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
847 }
848 }
850 /* Update the globals input_location and the input file stack from TOKEN. */
853 {
855 {
857 }
858 }
860 /* Update the globals input_location and the input file stack from LEXER. */
863 {
866 }
868 /* Return a pointer to the next token in the token stream, but do not
869 consume it. */
873 {
875 {
879 }
881 }
883 /* Return true if the next token has the indicated TYPE. */
887 {
889 }
891 /* Return true if the next token does not have the indicated TYPE. */
895 {
897 }
899 /* Return true if the next token is the indicated KEYWORD. */
903 {
905 }
909 {
911 }
915 {
917 }
919 /* Return true if the next token is not the indicated KEYWORD. */
923 {
925 }
927 /* Return true if the next token is a keyword for a decl-specifier. */
929 static bool
931 {
936 {
937 /* auto specifier: storage-class-specifier in C++,
938 simple-type-specifier in C++0x. */
940 /* Storage classes. */
946 /* Elaborated type specifiers. */
952 /* Simple type specifiers. */
966 /* GNU extensions. */
969 /* C++0x extensions. */
980 }
981 }
983 /* Returns TRUE iff the token T begins a decltype type. */
985 static bool
987 {
990 }
992 /* Returns TRUE iff the next token begins a decltype type. */
994 static bool
996 {
999 }
1001 /* Return a pointer to the Nth token in the token stream. If N is 1,
1002 then this is precisely equivalent to cp_lexer_peek_token (except
1003 that it is not inline). One would like to disallow that case, but
1004 there is one case (cp_parser_nth_token_starts_template_id) where
1005 the caller passes a variable for N and it might be 1. */
1009 {
1012 /* N is 1-based, not zero-based. */
1023 {
1026 {
1029 }
1033 }
1036 {
1039 }
1042 }
1044 /* Return the next token, and advance the lexer's next_token pointer
1045 to point to the next non-purged token. */
1049 {
1055 do
1056 {
1059 {
1062 }
1064 }
1069 /* Provide debugging output. */
1071 {
1075 }
1078 }
1080 /* Permanently remove the next token from the token stream, and
1081 advance the next_token pointer to refer to the next non-purged
1082 token. */
1084 static void
1086 {
1095 do
1096 {
1097 tok++;
1099 {
1102 }
1103 }
1106 }
1108 /* Permanently remove all tokens after TOK, up to, but not
1109 including, the token that will be returned next by
1110 cp_lexer_peek_token. */
1112 static void
1114 {
1123 {
1128 }
1129 }
1131 /* Begin saving tokens. All tokens consumed after this point will be
1132 preserved. */
1134 static void
1136 {
1137 /* Provide debugging output. */
1142 }
1144 /* Commit to the portion of the token stream most recently saved. */
1146 static void
1148 {
1149 /* Provide debugging output. */
1154 }
1156 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1157 to the token stream. Stop saving tokens. */
1159 static void
1161 {
1162 /* Provide debugging output. */
1167 }
1169 /* RAII wrapper around the above functions, with sanity checking. Creating
1170 a variable saves tokens, which are committed when the variable is
1171 destroyed unless they are explicitly rolled back by calling the rollback
1172 member function. */
1174 struct saved_token_sentinel
1175 {
1180 {
1183 }
1185 {
1188 }
1190 {
1194 }
1195 };
1197 /* Print a representation of the TOKEN on the STREAM. */
1199 static void
1201 {
1202 /* We don't use cpp_type2name here because the parser defines
1203 a few tokens of its own. */
1205 /* cpplib-defined token types */
1206 #define OP(e, s) #e,
1207 #define TK(e, s) #e,
1208 TTYPE_TABLE
1209 #undef OP
1210 #undef TK
1211 /* C++ parser token types - see "Manifest constants", above. */
1215 };
1217 /* For some tokens, print the associated data. */
1219 {
1221 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1222 For example, `struct' is mapped to an INTEGER_CST. */
1225 /* else fall through */
1243 /* If we have a name for the token, print it out. Otherwise, we
1244 simply give the numeric code. */
1247 else
1250 }
1251 }
1253 DEBUG_FUNCTION void
1255 {
1258 }
1260 DEBUG_FUNCTION void
1262 {
1265 else
1267 }
1270 /* Start emitting debugging information. */
1272 static void
1274 {
1277 }
1279 /* Stop emitting debugging information. */
1281 static void
1283 {
1286 }
1288 /* Create a new cp_token_cache, representing a range of tokens. */
1292 {
1297 }
1299 /* Diagnose if #pragma omp declare simd isn't followed immediately
1300 by function declaration or definition. */
1304 {
1306 {
1310 }
1311 }
1313 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1314 and put that into "omp declare simd" attribute. */
1318 {
1320 {
1322 {
1325 }
1327 {
1330 }
1331 }
1332 }
1333 \f
1334 /* Decl-specifiers. */
1336 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1338 static void
1340 {
1342 }
1344 /* Declarators. */
1346 /* Nothing other than the parser should be creating declarators;
1347 declarators are a semi-syntactic representation of C++ entities.
1348 Other parts of the front end that need to create entities (like
1349 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1364 /* An erroneous declarator. */
1367 /* The obstack on which declarators and related data structures are
1368 allocated. */
1371 /* Alloc BYTES from the declarator memory pool. */
1375 {
1377 }
1379 /* Allocate a declarator of the indicated KIND. Clear fields that are
1380 common to all declarators. */
1384 {
1396 }
1398 /* Make a declarator for a generalized identifier. If
1399 QUALIFYING_SCOPE is non-NULL, the identifier is
1400 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1401 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1402 is, if any. */
1406 special_function_kind sfk)
1407 {
1410 /* It is valid to write:
1412 class C { void f(); };
1413 typedef C D;
1414 void D::f();
1416 The standard is not clear about whether `typedef const C D' is
1417 legal; as of 2002-09-15 the committee is considering that
1418 question. EDG 3.0 allows that syntax. Therefore, we do as
1419 well. */
1433 }
1435 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1436 of modifiers such as const or volatile to apply to the pointer
1437 type, represented as identifiers. ATTRIBUTES represent the attributes that
1438 appertain to the pointer or reference. */
1440 cp_declarator *
1442 tree attributes)
1443 {
1451 {
1455 }
1456 else
1462 }
1464 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1465 represent the attributes that appertain to the pointer or
1466 reference. */
1468 cp_declarator *
1471 {
1479 {
1483 }
1484 else
1490 }
1492 /* Like make_pointer_declarator -- but for a pointer to a non-static
1493 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1494 appertain to the pointer or reference. */
1496 cp_declarator *
1499 tree attributes)
1500 {
1509 {
1512 }
1513 else
1519 }
1521 /* Make a declarator for the function given by TARGET, with the
1522 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1523 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1524 indicates what exceptions can be thrown. */
1526 cp_declarator *
1528 tree parms,
1529 cp_cv_quals cv_qualifiers,
1530 cp_virt_specifiers virt_specifiers,
1531 cp_ref_qualifier ref_qualifier,
1532 tree exception_specification,
1533 tree late_return_type)
1534 {
1546 {
1550 }
1551 else
1555 }
1557 /* Make a declarator for an array of BOUNDS elements, each of which is
1558 defined by ELEMENT. */
1560 cp_declarator *
1562 {
1569 {
1573 }
1574 else
1578 }
1580 /* Determine whether the declarator we've seen so far can be a
1581 parameter pack, when followed by an ellipsis. */
1582 static bool
1584 {
1585 /* Search for a declarator name, or any other declarator that goes
1586 after the point where the ellipsis could appear in a parameter
1587 pack. If we find any of these, then this declarator can not be
1588 made into a parameter pack. */
1591 {
1593 {
1605 }
1606 }
1609 }
1613 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1614 DECLARATOR and DEFAULT_ARGUMENT. */
1616 cp_parameter_declarator *
1619 tree default_argument)
1620 {
1628 else
1635 }
1637 /* Returns true iff DECLARATOR is a declaration for a function. */
1639 static bool
1641 {
1643 {
1651 }
1653 }
1655 /* The parser. */
1657 /* Overview
1658 --------
1660 A cp_parser parses the token stream as specified by the C++
1661 grammar. Its job is purely parsing, not semantic analysis. For
1662 example, the parser breaks the token stream into declarators,
1663 expressions, statements, and other similar syntactic constructs.
1664 It does not check that the types of the expressions on either side
1665 of an assignment-statement are compatible, or that a function is
1666 not declared with a parameter of type `void'.
1668 The parser invokes routines elsewhere in the compiler to perform
1669 semantic analysis and to build up the abstract syntax tree for the
1670 code processed.
1672 The parser (and the template instantiation code, which is, in a
1673 way, a close relative of parsing) are the only parts of the
1674 compiler that should be calling push_scope and pop_scope, or
1675 related functions. The parser (and template instantiation code)
1676 keeps track of what scope is presently active; everything else
1677 should simply honor that. (The code that generates static
1678 initializers may also need to set the scope, in order to check
1679 access control correctly when emitting the initializers.)
1681 Methodology
1682 -----------
1684 The parser is of the standard recursive-descent variety. Upcoming
1685 tokens in the token stream are examined in order to determine which
1686 production to use when parsing a non-terminal. Some C++ constructs
1687 require arbitrary look ahead to disambiguate. For example, it is
1688 impossible, in the general case, to tell whether a statement is an
1689 expression or declaration without scanning the entire statement.
1690 Therefore, the parser is capable of "parsing tentatively." When the
1691 parser is not sure what construct comes next, it enters this mode.
1692 Then, while we attempt to parse the construct, the parser queues up
1693 error messages, rather than issuing them immediately, and saves the
1694 tokens it consumes. If the construct is parsed successfully, the
1695 parser "commits", i.e., it issues any queued error messages and
1696 the tokens that were being preserved are permanently discarded.
1697 If, however, the construct is not parsed successfully, the parser
1698 rolls back its state completely so that it can resume parsing using
1699 a different alternative.
1701 Future Improvements
1702 -------------------
1704 The performance of the parser could probably be improved substantially.
1705 We could often eliminate the need to parse tentatively by looking ahead
1706 a little bit. In some places, this approach might not entirely eliminate
1707 the need to parse tentatively, but it might still speed up the average
1708 case. */
1710 /* Flags that are passed to some parsing functions. These values can
1711 be bitwise-ored together. */
1713 enum
1714 {
1715 /* No flags. */
1717 /* The construct is optional. If it is not present, then no error
1718 should be issued. */
1720 /* When parsing a type-specifier, treat user-defined type-names
1721 as non-type identifiers. */
1723 /* When parsing a type-specifier, do not try to parse a class-specifier
1724 or enum-specifier. */
1726 /* When parsing a decl-specifier-seq, only allow type-specifier or
1727 constexpr. */
1729 };
1731 /* This type is used for parameters and variables which hold
1732 combinations of the above flags. */
1735 /* The different kinds of declarators we want to parse. */
1738 {
1739 /* We want an abstract declarator. */
1740 CP_PARSER_DECLARATOR_ABSTRACT,
1741 /* We want a named declarator. */
1742 CP_PARSER_DECLARATOR_NAMED,
1743 /* We don't mind, but the name must be an unqualified-id. */
1744 CP_PARSER_DECLARATOR_EITHER
1747 /* The precedence values used to parse binary expressions. The minimum value
1748 of PREC must be 1, because zero is reserved to quickly discriminate
1749 binary operators from other tokens. */
1751 enum cp_parser_prec
1752 {
1753 PREC_NOT_OPERATOR,
1754 PREC_LOGICAL_OR_EXPRESSION,
1755 PREC_LOGICAL_AND_EXPRESSION,
1756 PREC_INCLUSIVE_OR_EXPRESSION,
1757 PREC_EXCLUSIVE_OR_EXPRESSION,
1758 PREC_AND_EXPRESSION,
1759 PREC_EQUALITY_EXPRESSION,
1760 PREC_RELATIONAL_EXPRESSION,
1761 PREC_SHIFT_EXPRESSION,
1762 PREC_ADDITIVE_EXPRESSION,
1763 PREC_MULTIPLICATIVE_EXPRESSION,
1764 PREC_PM_EXPRESSION,
1765 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1766 };
1768 /* A mapping from a token type to a corresponding tree node type, with a
1769 precedence value. */
1772 {
1773 /* The token type. */
1775 /* The corresponding tree code. */
1777 /* The precedence of this operator. */
1782 {
1783 /* Left hand side of the binary operation we are currently
1784 parsing. */
1785 tree lhs;
1786 /* Original tree code for left hand side, if it was a binary
1787 expression itself (used for -Wparentheses). */
1789 /* Tree code for the binary operation we are parsing. */
1791 /* Precedence of the binary operation we are parsing. */
1793 /* Location of the binary operation we are parsing. */
1794 location_t loc;
1797 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1798 entries because precedence levels on the stack are monotonically
1799 increasing. */
1803 /* Prototypes. */
1805 /* Constructors and destructors. */
1810 /* Class variables. */
1814 /* The operator-precedence table used by cp_parser_binary_expression.
1815 Transformed into an associative array (binops_by_token) by
1816 cp_parser_new. */
1849 };
1851 /* The same as binops, but initialized by cp_parser_new so that
1852 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1853 for speed. */
1856 /* Constructors and destructors. */
1858 /* Construct a new context. The context below this one on the stack
1859 is given by NEXT. */
1863 {
1866 /* Allocate the storage. */
1868 {
1869 /* Pull the first entry from the free list. */
1873 }
1874 else
1877 /* No errors have occurred yet in this context. */
1879 /* If this is not the bottommost context, copy information that we
1880 need from the previous context. */
1882 {
1883 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1884 expression, then we are parsing one in this context, too. */
1886 /* Thread the stack. */
1888 }
1891 }
1893 /* Managing the unparsed function queues. */
1895 #define unparsed_funs_with_default_args \
1896 parser->unparsed_queues->last ().funs_with_default_args
1897 #define unparsed_funs_with_definitions \
1898 parser->unparsed_queues->last ().funs_with_definitions
1899 #define unparsed_nsdmis \
1900 parser->unparsed_queues->last ().nsdmis
1901 #define unparsed_classes \
1902 parser->unparsed_queues->last ().classes
1904 static void
1906 {
1909 }
1911 static void
1913 {
1916 }
1918 /* Prototypes. */
1920 /* Constructors and destructors. */
1925 /* Routines to parse various constructs.
1927 Those that return `tree' will return the error_mark_node (rather
1928 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1929 Sometimes, they will return an ordinary node if error-recovery was
1930 attempted, even though a parse error occurred. So, to check
1931 whether or not a parse error occurred, you should always use
1932 cp_parser_error_occurred. If the construct is optional (indicated
1933 either by an `_opt' in the name of the function that does the
1934 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1935 the construct is not present. */
1937 /* Lexical conventions [gram.lex] */
1939 static tree cp_parser_identifier
1941 static tree cp_parser_string_literal
1943 static tree cp_parser_userdef_char_literal
1945 static tree cp_parser_userdef_string_literal
1947 static tree cp_parser_userdef_numeric_literal
1950 /* Basic concepts [gram.basic] */
1952 static bool cp_parser_translation_unit
1955 /* Expressions [gram.expr] */
1957 static tree cp_parser_primary_expression
1959 static tree cp_parser_id_expression
1961 static tree cp_parser_unqualified_id
1963 static tree cp_parser_nested_name_specifier_opt
1965 static tree cp_parser_nested_name_specifier
1967 static tree cp_parser_qualifying_entity
1969 static tree cp_parser_postfix_expression
1971 static tree cp_parser_postfix_open_square_expression
1973 static tree cp_parser_postfix_dot_deref_expression
1977 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1979 static void cp_parser_pseudo_destructor_name
1981 static tree cp_parser_unary_expression
1983 static enum tree_code cp_parser_unary_operator
1985 static tree cp_parser_new_expression
1989 static tree cp_parser_new_type_id
1997 static tree cp_parser_delete_expression
1999 static tree cp_parser_cast_expression
2001 static tree cp_parser_binary_expression
2003 static tree cp_parser_question_colon_clause
2005 static tree cp_parser_assignment_expression
2007 static enum tree_code cp_parser_assignment_operator_opt
2009 static tree cp_parser_expression
2011 static tree cp_parser_constant_expression
2013 static tree cp_parser_builtin_offsetof
2015 static tree cp_parser_lambda_expression
2017 static void cp_parser_lambda_introducer
2019 static bool cp_parser_lambda_declarator_opt
2021 static void cp_parser_lambda_body
2024 /* Statements [gram.stmt.stmt] */
2026 static void cp_parser_statement
2028 static void cp_parser_label_for_labeled_statement
2030 static tree cp_parser_expression_statement
2032 static tree cp_parser_compound_statement
2034 static void cp_parser_statement_seq_opt
2036 static tree cp_parser_selection_statement
2038 static tree cp_parser_condition
2040 static tree cp_parser_iteration_statement
2042 static bool cp_parser_for_init_statement
2044 static tree cp_parser_for
2046 static tree cp_parser_c_for
2048 static tree cp_parser_range_for
2050 static void do_range_for_auto_deduction
2052 static tree cp_parser_perform_range_for_lookup
2054 static tree cp_parser_range_for_member_function
2056 static tree cp_parser_jump_statement
2058 static void cp_parser_declaration_statement
2061 static tree cp_parser_implicitly_scoped_statement
2063 static void cp_parser_already_scoped_statement
2066 /* Declarations [gram.dcl.dcl] */
2068 static void cp_parser_declaration_seq_opt
2070 static void cp_parser_declaration
2072 static void cp_parser_block_declaration
2074 static void cp_parser_simple_declaration
2076 static void cp_parser_decl_specifier_seq
2078 static tree cp_parser_storage_class_specifier_opt
2080 static tree cp_parser_function_specifier_opt
2082 static tree cp_parser_type_specifier
2085 static tree cp_parser_simple_type_specifier
2087 static tree cp_parser_type_name
2089 static tree cp_parser_nonclass_name
2091 static tree cp_parser_elaborated_type_specifier
2093 static tree cp_parser_enum_specifier
2095 static void cp_parser_enumerator_list
2097 static void cp_parser_enumerator_definition
2099 static tree cp_parser_namespace_name
2101 static void cp_parser_namespace_definition
2103 static void cp_parser_namespace_body
2105 static tree cp_parser_qualified_namespace_specifier
2107 static void cp_parser_namespace_alias_definition
2109 static bool cp_parser_using_declaration
2111 static void cp_parser_using_directive
2113 static tree cp_parser_alias_declaration
2115 static void cp_parser_asm_definition
2117 static void cp_parser_linkage_specification
2119 static void cp_parser_static_assert
2121 static tree cp_parser_decltype
2124 /* Declarators [gram.dcl.decl] */
2126 static tree cp_parser_init_declarator
2127 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2132 static enum tree_code cp_parser_ptr_operator
2134 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2136 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2138 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2140 static tree cp_parser_late_return_type_opt
2142 static tree cp_parser_declarator_id
2144 static tree cp_parser_type_id
2146 static tree cp_parser_template_type_arg
2149 static tree cp_parser_type_id_1
2151 static void cp_parser_type_specifier_seq
2153 static tree cp_parser_parameter_declaration_clause
2155 static tree cp_parser_parameter_declaration_list
2159 static tree cp_parser_default_argument
2161 static void cp_parser_function_body
2163 static tree cp_parser_initializer
2165 static tree cp_parser_initializer_clause
2167 static tree cp_parser_braced_list
2172 static bool cp_parser_ctor_initializer_opt_and_function_body
2175 static tree cp_parser_late_parsing_omp_declare_simd
2178 static tree cp_parser_late_parsing_cilk_simd_fn_info
2181 static tree synthesize_implicit_template_parm
2183 static tree finish_fully_implicit_template
2186 /* Classes [gram.class] */
2188 static tree cp_parser_class_name
2190 static tree cp_parser_class_specifier
2192 static tree cp_parser_class_head
2194 static enum tag_types cp_parser_class_key
2196 static void cp_parser_type_parameter_key
2198 static void cp_parser_member_specification_opt
2200 static void cp_parser_member_declaration
2202 static tree cp_parser_pure_specifier
2204 static tree cp_parser_constant_initializer
2207 /* Derived classes [gram.class.derived] */
2209 static tree cp_parser_base_clause
2211 static tree cp_parser_base_specifier
2214 /* Special member functions [gram.special] */
2216 static tree cp_parser_conversion_function_id
2218 static tree cp_parser_conversion_type_id
2222 static bool cp_parser_ctor_initializer_opt
2224 static void cp_parser_mem_initializer_list
2226 static tree cp_parser_mem_initializer
2228 static tree cp_parser_mem_initializer_id
2231 /* Overloading [gram.over] */
2233 static tree cp_parser_operator_function_id
2235 static tree cp_parser_operator
2238 /* Templates [gram.temp] */
2240 static void cp_parser_template_declaration
2242 static tree cp_parser_template_parameter_list
2244 static tree cp_parser_template_parameter
2246 static tree cp_parser_type_parameter
2248 static tree cp_parser_template_id
2250 static tree cp_parser_template_name
2252 static tree cp_parser_template_argument_list
2254 static tree cp_parser_template_argument
2256 static void cp_parser_explicit_instantiation
2258 static void cp_parser_explicit_specialization
2261 /* Exception handling [gram.exception] */
2263 static tree cp_parser_try_block
2265 static bool cp_parser_function_try_block
2267 static void cp_parser_handler_seq
2269 static void cp_parser_handler
2271 static tree cp_parser_exception_declaration
2273 static tree cp_parser_throw_expression
2275 static tree cp_parser_exception_specification_opt
2277 static tree cp_parser_type_id_list
2280 /* GNU Extensions */
2282 static tree cp_parser_asm_specification_opt
2284 static tree cp_parser_asm_operand_list
2286 static tree cp_parser_asm_clobber_list
2288 static tree cp_parser_asm_label_list
2290 static bool cp_next_tokens_can_be_attribute_p
2292 static bool cp_next_tokens_can_be_gnu_attribute_p
2294 static bool cp_next_tokens_can_be_std_attribute_p
2296 static bool cp_nth_tokens_can_be_std_attribute_p
2298 static bool cp_nth_tokens_can_be_gnu_attribute_p
2300 static bool cp_nth_tokens_can_be_attribute_p
2302 static tree cp_parser_attributes_opt
2304 static tree cp_parser_gnu_attributes_opt
2306 static tree cp_parser_gnu_attribute_list
2308 static tree cp_parser_std_attribute
2310 static tree cp_parser_std_attribute_spec
2312 static tree cp_parser_std_attribute_spec_seq
2314 static bool cp_parser_extension_opt
2316 static void cp_parser_label_declaration
2319 /* Transactional Memory Extensions */
2321 static tree cp_parser_transaction
2323 static tree cp_parser_transaction_expression
2325 static bool cp_parser_function_transaction
2327 static tree cp_parser_transaction_cancel
2331 pragma_external,
2332 pragma_member,
2333 pragma_objc_icode,
2334 pragma_stmt,
2335 pragma_compound
2336 };
2337 static bool cp_parser_pragma
2340 /* Objective-C++ Productions */
2342 static tree cp_parser_objc_message_receiver
2344 static tree cp_parser_objc_message_args
2346 static tree cp_parser_objc_message_expression
2348 static tree cp_parser_objc_encode_expression
2350 static tree cp_parser_objc_defs_expression
2352 static tree cp_parser_objc_protocol_expression
2354 static tree cp_parser_objc_selector_expression
2356 static tree cp_parser_objc_expression
2358 static bool cp_parser_objc_selector_p
2360 static tree cp_parser_objc_selector
2362 static tree cp_parser_objc_protocol_refs_opt
2364 static void cp_parser_objc_declaration
2366 static tree cp_parser_objc_statement
2368 static bool cp_parser_objc_valid_prefix_attributes
2370 static void cp_parser_objc_at_property_declaration
2372 static void cp_parser_objc_at_synthesize_declaration
2374 static void cp_parser_objc_at_dynamic_declaration
2376 static tree cp_parser_objc_struct_declaration
2379 /* Utility Routines */
2381 static tree cp_parser_lookup_name
2383 static tree cp_parser_lookup_name_simple
2385 static tree cp_parser_maybe_treat_template_as_class
2387 static bool cp_parser_check_declarator_template_parameters
2389 static bool cp_parser_check_template_parameters
2391 static tree cp_parser_simple_cast_expression
2393 static tree cp_parser_global_scope_opt
2395 static bool cp_parser_constructor_declarator_p
2397 static tree cp_parser_function_definition_from_specifiers_and_declarator
2399 static tree cp_parser_function_definition_after_declarator
2401 static void cp_parser_template_declaration_after_export
2403 static void cp_parser_perform_template_parameter_access_checks
2405 static tree cp_parser_single_declaration
2407 static tree cp_parser_functional_cast
2409 static tree cp_parser_save_member_function_body
2411 static tree cp_parser_save_nsdmi
2413 static tree cp_parser_enclosed_template_argument_list
2415 static void cp_parser_save_default_args
2417 static void cp_parser_late_parsing_for_member
2419 static tree cp_parser_late_parse_one_default_arg
2421 static void cp_parser_late_parsing_nsdmi
2423 static void cp_parser_late_parsing_default_args
2425 static tree cp_parser_sizeof_operand
2427 static tree cp_parser_trait_expr
2429 static bool cp_parser_declares_only_class_p
2431 static void cp_parser_set_storage_class
2433 static void cp_parser_set_decl_spec_type
2435 static void set_and_check_decl_spec_loc
2438 static bool cp_parser_friend_p
2440 static void cp_parser_required_error
2446 static bool cp_parser_token_starts_function_definition_p
2448 static bool cp_parser_next_token_starts_class_definition_p
2450 static bool cp_parser_next_token_ends_template_argument_p
2452 static bool cp_parser_nth_token_starts_template_argument_list_p
2454 static enum tag_types cp_parser_token_is_class_key
2456 static enum tag_types cp_parser_token_is_type_parameter_key
2458 static void cp_parser_check_class_key
2460 static void cp_parser_check_access_in_redeclaration
2462 static bool cp_parser_optional_template_keyword
2464 static void cp_parser_pre_parsed_nested_name_specifier
2466 static bool cp_parser_cache_group
2468 static tree cp_parser_cache_defarg
2470 static void cp_parser_parse_tentatively
2472 static void cp_parser_commit_to_tentative_parse
2474 static void cp_parser_commit_to_topmost_tentative_parse
2476 static void cp_parser_abort_tentative_parse
2478 static bool cp_parser_parse_definitely
2482 static bool cp_parser_uncommitted_to_tentative_parse_p
2484 static void cp_parser_error
2486 static void cp_parser_name_lookup_error
2488 static bool cp_parser_simulate_error
2490 static bool cp_parser_check_type_definition
2492 static void cp_parser_check_for_definition_in_return_type
2494 static void cp_parser_check_for_invalid_template_id
2496 static bool cp_parser_non_integral_constant_expression
2498 static void cp_parser_diagnose_invalid_type_name
2500 static bool cp_parser_parse_and_diagnose_invalid_type_name
2502 static int cp_parser_skip_to_closing_parenthesis
2504 static void cp_parser_skip_to_end_of_statement
2506 static void cp_parser_consume_semicolon_at_end_of_statement
2508 static void cp_parser_skip_to_end_of_block_or_statement
2510 static bool cp_parser_skip_to_closing_brace
2512 static void cp_parser_skip_to_end_of_template_parameter_list
2514 static void cp_parser_skip_to_pragma_eol
2516 static bool cp_parser_error_occurred
2518 static bool cp_parser_allow_gnu_extensions_p
2520 static bool cp_parser_is_pure_string_literal
2522 static bool cp_parser_is_string_literal
2524 static bool cp_parser_is_keyword
2526 static tree cp_parser_make_typename_type
2530 static bool cp_parser_compound_literal_p
2532 static bool cp_parser_array_designator_p
2534 static bool cp_parser_skip_to_closing_square_bracket
2537 /* Returns nonzero if we are parsing tentatively. */
2541 {
2543 }
2545 /* Returns nonzero if TOKEN is a string literal. */
2547 static bool
2549 {
2555 }
2557 /* Returns nonzero if TOKEN is a string literal
2558 of a user-defined string literal. */
2560 static bool
2562 {
2569 }
2571 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2573 static bool
2575 {
2577 }
2579 /* If not parsing tentatively, issue a diagnostic of the form
2580 FILE:LINE: MESSAGE before TOKEN
2581 where TOKEN is the next token in the input stream. MESSAGE
2582 (specified by the caller) is usually of the form "expected
2583 OTHER-TOKEN". */
2585 static void
2587 {
2589 {
2591 /* This diagnostic makes more sense if it is tagged to the line
2592 of the token we just peeked at. */
2596 {
2601 }
2604 /* Because c_parser_error does not understand
2605 CPP_KEYWORD, keywords are treated like
2606 identifiers. */
2609 }
2610 }
2612 /* Issue an error about name-lookup failing. NAME is the
2613 IDENTIFIER_NODE DECL is the result of
2614 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2615 the thing that we hoped to find. */
2617 static void
2619 tree name,
2620 tree decl,
2621 name_lookup_error desired,
2622 location_t location)
2623 {
2624 /* If name lookup completely failed, tell the user that NAME was not
2625 declared. */
2627 {
2640 else
2642 }
2644 {
2646 {
2663 }
2664 }
2666 {
2668 {
2678 name);
2682 }
2683 }
2684 else
2685 {
2687 {
2700 }
2701 }
2702 }
2704 /* If we are parsing tentatively, remember that an error has occurred
2705 during this tentative parse. Returns true if the error was
2706 simulated; false if a message should be issued by the caller. */
2708 static bool
2710 {
2712 {
2715 }
2717 }
2719 /* This function is called when a type is defined. If type
2720 definitions are forbidden at this point, an error message is
2721 issued. */
2723 static bool
2725 {
2726 /* If types are forbidden here, issue a message. */
2728 {
2729 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2730 in the message need to be interpreted. */
2733 }
2735 }
2737 /* This function is called when the DECLARATOR is processed. The TYPE
2738 was a type defined in the decl-specifiers. If it is invalid to
2739 define a type in the decl-specifiers for DECLARATOR, an error is
2740 issued. TYPE_LOCATION is the location of TYPE and is used
2741 for error reporting. */
2743 static void
2746 {
2747 /* [dcl.fct] forbids type definitions in return types.
2748 Unfortunately, it's not easy to know whether or not we are
2749 processing a return type until after the fact. */
2757 {
2762 type);
2763 }
2764 }
2766 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2767 "<" in any valid C++ program. If the next token is indeed "<",
2768 issue a message warning the user about what appears to be an
2769 invalid attempt to form a template-id. LOCATION is the location
2770 of the type-specifier (TYPE) */
2772 static void
2774 tree type,
2776 location_t location)
2777 {
2781 {
2785 {
2788 else
2790 }
2791 else
2793 /* Remember the location of the invalid "<". */
2796 /* Consume the "<". */
2798 /* Parse the template arguments. */
2800 /* Permanently remove the invalid template arguments so that
2801 this error message is not issued again. */
2804 }
2805 }
2807 /* If parsing an integral constant-expression, issue an error message
2808 about the fact that THING appeared and return true. Otherwise,
2809 return false. In either case, set
2810 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2812 static bool
2814 non_integral_constant thing)
2815 {
2818 {
2820 {
2823 {
2830 "enumeration type cannot appear in a "
2921 }
2925 }
2926 }
2928 }
2930 /* Emit a diagnostic for an invalid type name. This function commits
2931 to the current active tentative parse, if any. (Otherwise, the
2932 problematic construct might be encountered again later, resulting
2933 in duplicate error messages.) LOCATION is the location of ID. */
2935 static void
2937 location_t location)
2938 {
2941 /* Try to lookup the identifier. */
2948 /* If the lookup was ambiguous, an error will already have
2949 been issued. */
2951 /* If the lookup found a template-name, it means that the user forgot
2952 to specify an argument list. Emit a useful error message. */
2956 decl);
2960 /* Something like 'unsigned A a;' */
2963 {
2964 /* Issue an error message. */
2966 /* If we're in a template class, it's possible that the user was
2967 referring to a type from a base class. For example:
2969 template <typename T> struct A { typedef T X; };
2970 template <typename T> struct B : public A<T> { X x; };
2972 The user should have said "typename A<T>::X". */
2985 {
2986 tree b;
2989 b;
2991 {
2995 {
2996 tree field;
2997 /* Go from a particular instantiation of the
2998 template (which will have an empty TYPE_FIELDs),
2999 to the main version. */
3002 field;
3006 {
3011 }
3014 }
3015 }
3016 }
3017 }
3018 /* Here we diagnose qualified-ids where the scope is actually correct,
3019 but the identifier does not resolve to a valid type name. */
3021 {
3023 {
3028 else
3032 }
3035 {
3036 /* A<T>::A<T>() */
3042 }
3049 {
3054 else
3058 }
3059 else
3061 }
3062 }
3064 /* Check for a common situation where a type-name should be present,
3065 but is not, and issue a sensible error message. Returns true if an
3066 invalid type-name was detected.
3068 The situation handled by this function are variable declarations of the
3069 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3070 Usually, `ID' should name a type, but if we got here it means that it
3071 does not. We try to emit the best possible error message depending on
3072 how exactly the id-expression looks like. */
3074 static bool
3076 {
3077 tree id;
3080 /* Avoid duplicate error about ambiguous lookup. */
3082 {
3086 }
3095 /* If the next token is a (, this is a function with no explicit return
3096 type, i.e. constructor, destructor or conversion op. */
3099 {
3102 }
3106 /* Emit a diagnostic for the invalid type. */
3108 out:
3109 /* If we aren't in the middle of a declarator (i.e. in a
3110 parameter-declaration-clause), skip to the end of the declaration;
3111 there's no point in trying to process it. */
3115 }
3117 /* Consume tokens up to, and including, the next non-nested closing `)'.
3118 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3119 are doing error recovery. Returns -1 if OR_COMMA is true and we
3120 found an unnested comma. */
3122 static int
3127 {
3137 {
3141 {
3144 /* If we've run out of tokens, then there is no closing `)'. */
3147 /* This is good for lambda expression capture-lists. */
3157 /* This matches the processing in skip_to_end_of_statement. */
3183 {
3187 }
3192 }
3194 /* Consume the token. */
3196 }
3197 }
3199 /* Consume tokens until we reach the end of the current statement.
3200 Normally, that will be just before consuming a `;'. However, if a
3201 non-nested `}' comes first, then we stop before consuming that. */
3203 static void
3205 {
3208 /* Unwind generic function template scope if necessary. */
3213 {
3217 {
3220 /* If we've run out of tokens, stop. */
3224 /* If the next token is a `;', we have reached the end of the
3225 statement. */
3231 /* If this is a non-nested '}', stop before consuming it.
3232 That way, when confronted with something like:
3234 { 3 + }
3236 we stop before consuming the closing '}', even though we
3237 have not yet reached a `;'. */
3241 /* If it is the closing '}' for a block that we have
3242 scanned, stop -- but only after consuming the token.
3243 That way given:
3245 void f g () { ... }
3246 typedef int I;
3248 we will stop after the body of the erroneously declared
3249 function, but before consuming the following `typedef'
3250 declaration. */
3252 {
3255 }
3263 }
3265 /* Consume the token. */
3267 }
3268 }
3270 /* This function is called at the end of a statement or declaration.
3271 If the next token is a semicolon, it is consumed; otherwise, error
3272 recovery is attempted. */
3274 static void
3276 {
3277 /* Look for the trailing `;'. */
3279 {
3280 /* If there is additional (erroneous) input, skip to the end of
3281 the statement. */
3283 /* If the next token is now a `;', consume it. */
3286 }
3287 }
3289 /* Skip tokens until we have consumed an entire block, or until we
3290 have consumed a non-nested `;'. */
3292 static void
3294 {
3297 /* Unwind generic function template scope if necessary. */
3302 {
3306 {
3309 /* If we've run out of tokens, stop. */
3313 /* Stop if this is an unnested ';'. */
3319 /* Stop if this is an unnested '}', or closes the outermost
3320 nesting level. */
3321 nesting_depth--;
3329 /* Nest. */
3330 nesting_depth++;
3335 }
3337 /* Consume the token. */
3339 }
3340 }
3342 /* Skip tokens until a non-nested closing curly brace is the next
3343 token, or there are no more tokens. Return true in the first case,
3344 false otherwise. */
3346 static bool
3348 {
3352 {
3356 {
3359 /* If we've run out of tokens, stop. */
3363 /* If the next token is a non-nested `}', then we have reached
3364 the end of the current block. */
3370 /* If it the next token is a `{', then we are entering a new
3371 block. Consume the entire block. */
3377 }
3379 /* Consume the token. */
3381 }
3382 }
3384 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3385 parameter is the PRAGMA token, allowing us to purge the entire pragma
3386 sequence. */
3388 static void
3390 {
3395 do
3399 /* Ensure that the pragma is not parsed again. */
3401 }
3403 /* Require pragma end of line, resyncing with it as necessary. The
3404 arguments are as for cp_parser_skip_to_pragma_eol. */
3406 static void
3408 {
3412 }
3414 /* This is a simple wrapper around make_typename_type. When the id is
3415 an unresolved identifier node, we can provide a superior diagnostic
3416 using cp_parser_diagnose_invalid_type_name. */
3418 static tree
3420 location_t id_location)
3421 {
3422 tree result;
3424 {
3430 }
3432 }
3434 /* This is a wrapper around the
3435 make_{pointer,ptrmem,reference}_declarator functions that decides
3436 which one to call based on the CODE and CLASS_TYPE arguments. The
3437 CODE argument should be one of the values returned by
3438 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3439 appertain to the pointer or reference. */
3443 cp_cv_quals cv_qualifiers,
3445 tree attributes)
3446 {
3453 else
3463 }
3465 /* Create a new C++ parser. */
3469 {
3474 /* cp_lexer_new_main is called before doing GC allocation because
3475 cp_lexer_new_main might load a PCH file. */
3478 /* Initialize the binops_by_token so that we can get the tree
3479 directly from the token. */
3487 /* For now, we always accept GNU extensions. */
3490 /* The `>' token is a greater-than operator, not the end of a
3491 template-id. */
3496 /* We are not parsing a constant-expression. */
3501 /* Local variable names are not forbidden. */
3504 /* We are not processing an `extern "C"' declaration. */
3507 /* We are not processing a declarator. */
3510 /* We are not processing a template-argument-list. */
3513 /* We are not in an iteration statement. */
3516 /* We are not in a switch statement. */
3519 /* We are not parsing a type-id inside an expression. */
3522 /* Declarations aren't implicitly extern "C". */
3525 /* String literals should be translated to the execution character set. */
3528 /* We are not parsing a function body. */
3531 /* We can correct until told otherwise. */
3534 /* The unparsed function queue is empty. */
3537 /* There are no classes being defined. */
3540 /* No template parameters apply. */
3543 /* Not declaring an implicit function template. */
3550 }
3552 /* Create a cp_lexer structure which will emit the tokens in CACHE
3553 and push it onto the parser's lexer stack. This is used for delayed
3554 parsing of in-class method bodies and default arguments, and should
3555 not be confused with tentative parsing. */
3556 static void
3558 {
3563 /* Move the current source position to that of the first token in the
3564 new lexer. */
3566 }
3568 /* Pop the top lexer off the parser stack. This is never used for the
3569 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3570 static void
3572 {
3577 /* Put the current source position back where it was before this
3578 lexer was pushed. */
3580 }
3582 /* Lexical conventions [gram.lex] */
3584 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3585 identifier. */
3587 static tree
3589 {
3592 /* Look for the identifier. */
3594 /* Return the value. */
3596 }
3598 /* Parse a sequence of adjacent string constants. Returns a
3599 TREE_STRING representing the combined, nul-terminated string
3600 constant. If TRANSLATE is true, translate the string to the
3601 execution character set. If WIDE_OK is true, a wide string is
3602 invalid here.
3604 C++98 [lex.string] says that if a narrow string literal token is
3605 adjacent to a wide string literal token, the behavior is undefined.
3606 However, C99 6.4.5p4 says that this results in a wide string literal.
3607 We follow C99 here, for consistency with the C front end.
3609 This code is largely lifted from lex_string() in c-lex.c.
3611 FUTURE: ObjC++ will need to handle @-strings here. */
3612 static tree
3615 {
3616 tree value;
3623 tree string_tree;
3629 {
3632 }
3635 {
3639 }
3640 else
3641 {
3644 }
3647 /* Try to avoid the overhead of creating and destroying an obstack
3648 for the common case of just one string. */
3651 {
3659 {
3663 }
3664 else
3668 }
3669 else
3670 {
3674 do
3675 {
3677 count++;
3682 {
3685 {
3688 }
3691 {
3696 }
3698 }
3699 else
3703 {
3708 "unsupported non-standard concatenation "
3710 }
3716 {
3720 }
3721 else
3722 {
3726 }
3727 }
3731 }
3734 {
3737 }
3741 {
3746 {
3761 }
3766 {
3771 else
3773 }
3774 }
3775 else
3776 /* cpp_interpret_string has issued an error. */
3783 }
3785 /* Look up a literal operator with the name and the exact arguments. */
3787 static tree
3789 {
3796 {
3802 {
3805 {
3815 }
3818 /* May be this should be sufficient_parms_p instead,
3819 depending on how exactly should user-defined literals
3820 work in presence of default arguments on the literal
3821 operator parameters. */
3824 }
3825 }
3828 }
3830 /* Parse a user-defined char constant. Returns a call to a user-defined
3831 literal operator taking the character as an argument. */
3833 static tree
3835 {
3843 /* Build up a call to the user-defined operator */
3844 /* Lookup the name we got back from the id-expression. */
3849 {
3854 }
3863 }
3865 /* A subroutine of cp_parser_userdef_numeric_literal to
3866 create a char... template parameter pack from a string node. */
3868 static tree
3870 {
3871 tree charvec;
3877 /* Fill in CHARVEC with all of the parameters. */
3882 /* Build the argument packs. */
3889 }
3891 /* A subroutine of cp_parser_userdef_numeric_literal to
3892 create a char... template parameter pack from a string node. */
3894 static tree
3896 {
3897 tree charvec;
3908 /* First template parm is character type. */
3911 /* Fill in CHARVEC with all of the parameters. */
3918 /* Build the argument packs. */
3925 }
3927 /* Parse a user-defined numeric constant. returns a call to a user-defined
3928 literal operator. */
3930 static tree
3932 {
3943 /* Look for a literal operator taking the exact type of numeric argument
3944 as the literal value. */
3949 {
3952 {
3956 long_long_unsigned_type_node);
3957 else
3958 {
3962 long_double_type_node);
3966 }
3969 }
3970 }
3973 /* If the numeric argument didn't work, look for a raw literal
3974 operator taking a const char* argument consisting of the number
3975 in string format. */
3980 {
3983 {
3986 }
3987 }
3990 /* If the raw literal didn't work, look for a non-type template
3991 function with parameter pack char.... Call the function with
3992 template parameter characters representing the number. */
3996 {
4001 {
4004 }
4005 }
4013 }
4015 /* Parse a user-defined string constant. Returns a call to a user-defined
4016 literal operator taking a character pointer and the length of the string
4017 as arguments. */
4019 static tree
4021 {
4030 /* Look for a template function with typename parameter CharT
4031 and parameter pack CharT... Call the function with
4032 template parameter characters representing the string. */
4036 {
4041 {
4044 }
4045 }
4048 /* Build up a call to the user-defined operator */
4049 /* Lookup the name we got back from the id-expression. */
4055 {
4059 }
4068 }
4071 /* Basic concepts [gram.basic] */
4073 /* Parse a translation-unit.
4075 translation-unit:
4076 declaration-seq [opt]
4078 Returns TRUE if all went well. */
4080 static bool
4082 {
4083 /* The address of the first non-permanent object on the declarator
4084 obstack. */
4089 /* Create the declarator obstack, if necessary. */
4091 {
4093 /* Create the error declarator. */
4095 /* Create the empty parameter list. */
4097 /* Remember where the base of the declarator obstack lies. */
4099 }
4103 /* If there are no tokens left then all went well. */
4105 {
4106 /* Get rid of the token array; we don't need it any more. */
4110 /* This file might have been a context that's implicitly extern
4111 "C". If so, pop the lang context. (Only relevant for PCH.) */
4113 {
4116 }
4118 /* Finish up. */
4122 }
4123 else
4124 {
4127 }
4129 /* Make sure the declarator obstack was fully cleaned up. */
4133 /* All went well. */
4135 }
4137 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4138 decltype context. */
4142 {
4147 }
4149 /* We're about to parse a collection of statements. If we're currently
4150 parsing tentatively, set up a firewall so that any nested
4151 cp_parser_commit_to_tentative_parse won't affect the current context. */
4153 static cp_token_position
4155 {
4162 }
4164 /* We've finished parsing the collection of statements. Wrap up the
4165 firewall and replace the relevant tokens with the parsed form. */
4167 static void
4169 tree expr)
4170 {
4174 /* Finish the firewall level. */
4176 /* And remember the result of the parse for when we try again. */
4182 }
4184 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4185 enclosing parentheses. */
4187 static tree
4189 {
4192 /* Consume the '('. */
4194 /* Start the statement-expression. */
4196 /* Parse the compound-statement. */
4198 /* Finish up. */
4200 /* Consume the ')'. */
4206 }
4208 /* Expressions [gram.expr] */
4210 /* Parse a primary-expression.
4212 primary-expression:
4213 literal
4214 this
4215 ( expression )
4216 id-expression
4217 lambda-expression (C++11)
4219 GNU Extensions:
4221 primary-expression:
4222 ( compound-statement )
4223 __builtin_va_arg ( assignment-expression , type-id )
4224 __builtin_offsetof ( type-id , offsetof-expression )
4226 C++ Extensions:
4227 __has_nothrow_assign ( type-id )
4228 __has_nothrow_constructor ( type-id )
4229 __has_nothrow_copy ( type-id )
4230 __has_trivial_assign ( type-id )
4231 __has_trivial_constructor ( type-id )
4232 __has_trivial_copy ( type-id )
4233 __has_trivial_destructor ( type-id )
4234 __has_virtual_destructor ( type-id )
4235 __is_abstract ( type-id )
4236 __is_base_of ( type-id , type-id )
4237 __is_class ( type-id )
4238 __is_empty ( type-id )
4239 __is_enum ( type-id )
4240 __is_final ( type-id )
4241 __is_literal_type ( type-id )
4242 __is_pod ( type-id )
4243 __is_polymorphic ( type-id )
4244 __is_std_layout ( type-id )
4245 __is_trivial ( type-id )
4246 __is_union ( type-id )
4248 Objective-C++ Extension:
4250 primary-expression:
4251 objc-expression
4253 literal:
4254 __null
4256 ADDRESS_P is true iff this expression was immediately preceded by
4257 "&" and therefore might denote a pointer-to-member. CAST_P is true
4258 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4259 true iff this expression is a template argument.
4261 Returns a representation of the expression. Upon return, *IDK
4262 indicates what kind of id-expression (if any) was present. */
4264 static tree
4271 {
4274 /* Assume the primary expression is not an id-expression. */
4277 /* Peek at the next token. */
4280 {
4281 /* literal:
4282 integer-literal
4283 character-literal
4284 floating-literal
4285 string-literal
4286 boolean-literal
4287 pointer-literal
4288 user-defined-literal */
4299 {
4303 }
4304 /* Floating-point literals are only allowed in an integral
4305 constant expression if they are cast to an integral or
4306 enumeration type. */
4310 {
4311 /* CAST_P will be set even in invalid code like "int(2.7 +
4312 ...)". Therefore, we have to check that the next token
4313 is sure to end the cast. */
4315 {
4320 enumerator-definition. */
4322 /* The curly brace at the end of an enum-specifier. */
4324 /* The end of a statement. */
4326 /* The end of the cast-expression. */
4328 /* The end of an array bound. */
4330 /* The closing ">" in a template-argument-list. */
4333 /* C++0x only: A ">>" treated like two ">" tokens,
4334 in a template-argument-list. */
4339 }
4341 /* If we are within a cast, then the constraint that the
4342 cast is to an integral or enumeration type will be
4343 checked at that point. If we are not within a cast, then
4344 this code is invalid. */
4347 }
4366 /* ??? Should wide strings be allowed when parser->translate_strings_p
4367 is false (i.e. in attributes)? If not, we can kill the third
4368 argument to cp_parser_string_literal. */
4374 /* If we see `( { ' then we are looking at the beginning of
4375 a GNU statement-expression. */
4378 {
4379 /* Statement-expressions are not allowed by the standard. */
4383 /* And they're not allowed outside of a function-body; you
4384 cannot, for example, write:
4386 int i = ({ int j = 3; j + 1; });
4388 at class or namespace scope. */
4391 {
4393 "statement-expressions are not allowed outside "
4399 }
4400 else
4402 }
4403 /* Otherwise it's a normal parenthesized expression. */
4404 {
4405 tree expr;
4408 /* Consume the `('. */
4410 /* Within a parenthesized expression, a `>' token is always
4411 the greater-than operator. */
4412 saved_greater_than_is_operator_p
4416 /* Parse the parenthesized expression. */
4418 /* Let the front end know that this expression was
4419 enclosed in parentheses. This matters in case, for
4420 example, the expression is of the form `A::B', since
4421 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4422 not. */
4424 /* DR 705: Wrapping an unqualified name in parentheses
4425 suppresses arg-dependent lookup. We want to pass back
4426 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4427 (c++/37862), but none of the others. */
4431 /* The `>' token might be the end of a template-id or
4432 template-parameter-list now. */
4433 parser->greater_than_is_operator_p
4435 /* Consume the `)'. */
4440 }
4444 /* We have an Objective-C++ message. */
4446 {
4448 /* Don't warn about a failed tentative parse. */
4453 }
4457 /* We have an Objective-C++ string literal. */
4464 {
4465 /* These two are the boolean literals. */
4473 /* The `__null' literal. */
4478 /* The `nullptr' literal. */
4483 /* Recognize the `this' keyword. */
4487 {
4491 }
4492 /* Pointers cannot appear in constant-expressions. */
4497 /* The `operator' keyword can be the beginning of an
4498 id-expression. */
4505 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4506 __func__ are the names of variables. */
4510 {
4511 tree expression;
4512 tree type;
4513 source_location type_location;
4515 /* The `__builtin_va_arg' construct is used to handle
4516 `va_arg'. Consume the `__builtin_va_arg' token. */
4518 /* Look for the opening `('. */
4520 /* Now, parse the assignment-expression. */
4522 /* Look for the `,'. */
4525 /* Parse the type-id. */
4527 /* Look for the closing `)'. */
4529 /* Using `va_arg' in a constant-expression is not
4530 allowed. */
4532 NIC_VA_ARG))
4535 }
4565 /* Objective-C++ expressions. */
4575 {
4580 }
4584 }
4586 /* An id-expression can start with either an identifier, a
4587 `::' as the beginning of a qualified-id, or the "operator"
4588 keyword. */
4593 {
4594 tree id_expression;
4595 tree decl;
4601 id_expression:
4602 /* Parse the id-expression. */
4603 id_expression
4620 /* If we have a template-id, then no further lookup is
4621 required. If the template-id was for a template-class, we
4622 will sometimes have a TYPE_DECL at this point. */
4626 /* Look up the name. */
4627 else
4628 {
4629 tree ambiguous_decls;
4631 /* If we already know that this lookup is ambiguous, then
4632 we've already issued an error message; there's no reason
4633 to check again. */
4636 {
4639 }
4642 none_type,
4643 template_p,
4648 /* If the lookup was ambiguous, an error will already have
4649 been issued. */
4653 /* In Objective-C++, we may have an Objective-C 2.0
4654 dot-syntax for classes here. */
4659 {
4660 tree component;
4667 }
4669 /* In Objective-C++, an instance variable (ivar) may be preferred
4670 to whatever cp_parser_lookup_name() found. */
4673 /* If name lookup gives us a SCOPE_REF, then the
4674 qualifying scope was dependent. */
4676 {
4677 /* At this point, we do not know if DECL is a valid
4678 integral constant expression. We assume that it is
4679 in fact such an expression, so that code like:
4681 template <int N> struct A {
4682 int a[B<N>::i];
4683 };
4685 is accepted. At template-instantiation time, we
4686 will check that B<N>::i is actually a constant. */
4688 }
4689 /* Check to see if DECL is a local variable in a context
4690 where that is forbidden. */
4693 {
4694 /* It might be that we only found DECL because we are
4695 trying to be generous with pre-ISO scoping rules.
4696 For example, consider:
4698 int i;
4699 void g() {
4700 for (int i = 0; i < 10; ++i) {}
4701 extern void f(int j = i);
4702 }
4704 Here, name look up will originally find the out
4705 of scope `i'. We need to issue a warning message,
4706 but then use the global `i'. */
4709 {
4712 decl);
4714 }
4715 }
4716 }
4718 decl = (finish_id_expression
4720 idk,
4725 template_arg_p,
4731 }
4733 /* Anything else is an error. */
4737 }
4738 }
4746 {
4749 }
4751 /* Parse an id-expression.
4753 id-expression:
4754 unqualified-id
4755 qualified-id
4757 qualified-id:
4758 :: [opt] nested-name-specifier template [opt] unqualified-id
4759 :: identifier
4760 :: operator-function-id
4761 :: template-id
4763 Return a representation of the unqualified portion of the
4764 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4765 a `::' or nested-name-specifier.
4767 Often, if the id-expression was a qualified-id, the caller will
4768 want to make a SCOPE_REF to represent the qualified-id. This
4769 function does not do this in order to avoid wastefully creating
4770 SCOPE_REFs when they are not required.
4772 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4773 `template' keyword.
4775 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4776 uninstantiated templates.
4778 If *TEMPLATE_P is non-NULL, it is set to true iff the
4779 `template' keyword is used to explicitly indicate that the entity
4780 named is a template.
4782 If DECLARATOR_P is true, the id-expression is appearing as part of
4783 a declarator, rather than as part of an expression. */
4785 static tree
4792 {
4796 /* Assume the `template' keyword was not used. */
4800 /* Look for the optional `::' operator. */
4801 global_scope_p
4804 /* Look for the optional nested-name-specifier. */
4805 nested_name_specifier_p
4808 check_dependency_p,
4810 declarator_p)
4812 /* If there is a nested-name-specifier, then we are looking at
4813 the first qualified-id production. */
4815 {
4816 tree saved_scope;
4817 tree saved_object_scope;
4818 tree saved_qualifying_scope;
4819 tree unqualified_id;
4822 /* See if the next token is the `template' keyword. */
4826 /* Name lookup we do during the processing of the
4827 unqualified-id might obliterate SCOPE. */
4831 /* Process the final unqualified-id. */
4833 check_dependency_p,
4834 declarator_p,
4836 /* Restore the SAVED_SCOPE for our caller. */
4842 }
4843 /* Otherwise, if we are in global scope, then we are looking at one
4844 of the other qualified-id productions. */
4846 {
4848 tree id;
4850 /* Peek at the next token. */
4853 /* If it's an identifier, and the next token is not a "<", then
4854 we can avoid the template-id case. This is an optimization
4855 for this common case. */
4857 && !cp_parser_nth_token_starts_template_argument_list_p
4862 /* Try a template-id. */
4866 none_type,
4867 declarator_p);
4868 /* If that worked, we're done. */
4872 /* Peek at the next token. (Changes in the token buffer may
4873 have invalidated the pointer obtained above.) */
4877 {
4884 /* Fall through. */
4889 }
4890 }
4891 else
4894 declarator_p,
4895 optional_p);
4896 }
4898 /* Parse an unqualified-id.
4900 unqualified-id:
4901 identifier
4902 operator-function-id
4903 conversion-function-id
4904 ~ class-name
4905 template-id
4907 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4908 keyword, in a construct like `A::template ...'.
4910 Returns a representation of unqualified-id. For the `identifier'
4911 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4912 production a BIT_NOT_EXPR is returned; the operand of the
4913 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4914 other productions, see the documentation accompanying the
4915 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4916 names are looked up in uninstantiated templates. If DECLARATOR_P
4917 is true, the unqualified-id is appearing as part of a declarator,
4918 rather than as part of an expression. */
4920 static tree
4926 {
4928 tree id;
4930 /* Peek at the next token. */
4934 {
4936 {
4937 /* We don't know yet whether or not this will be a
4938 template-id. */
4940 /* Try a template-id. */
4942 check_dependency_p,
4943 none_type,
4944 declarator_p);
4945 /* If it worked, we're done. */
4948 /* Otherwise, it's an ordinary identifier. */
4950 }
4954 check_dependency_p,
4955 none_type,
4956 declarator_p);
4959 {
4960 tree type_decl;
4961 tree qualifying_scope;
4962 tree object_scope;
4963 tree scope;
4966 /* Consume the `~' token. */
4968 /* Parse the class-name. The standard, as written, seems to
4969 say that:
4971 template <typename T> struct S { ~S (); };
4972 template <typename T> S<T>::~S() {}
4974 is invalid, since `~' must be followed by a class-name, but
4975 `S<T>' is dependent, and so not known to be a class.
4976 That's not right; we need to look in uninstantiated
4977 templates. A further complication arises from:
4979 template <typename T> void f(T t) {
4980 t.T::~T();
4981 }
4983 Here, it is not possible to look up `T' in the scope of `T'
4984 itself. We must look in both the current scope, and the
4985 scope of the containing complete expression.
4987 Yet another issue is:
4989 struct S {
4990 int S;
4991 ~S();
4992 };
4994 S::~S() {}
4996 The standard does not seem to say that the `S' in `~S'
4997 should refer to the type `S' and not the data member
4998 `S::S'. */
5000 /* DR 244 says that we look up the name after the "~" in the
5001 same scope as we looked up the qualifying name. That idea
5002 isn't fully worked out; it's more complicated than that. */
5007 /* Check for invalid scopes. */
5009 {
5013 }
5015 {
5019 scope);
5024 }
5027 /* If the name is of the form "X::~X" it's OK even if X is a
5028 typedef. */
5037 {
5040 }
5042 /* ~auto means the destructor of whatever the object is. */
5044 {
5047 "%<~auto%> only available with "
5051 }
5053 /* If there was an explicit qualification (S::~T), first look
5054 in the scope given by the qualification (i.e., S).
5056 Note: in the calls to cp_parser_class_name below we pass
5057 typename_type so that lookup finds the injected-class-name
5058 rather than the constructor. */
5062 {
5067 typename_type,
5070 declarator_p);
5073 }
5074 /* In "N::S::~S", look in "N" as well. */
5076 {
5081 type_decl
5085 typename_type,
5088 declarator_p);
5091 }
5092 /* In "p->S::~T", look in the scope given by "*p" as well. */
5094 {
5099 type_decl
5103 typename_type,
5106 declarator_p);
5109 }
5110 /* Look in the surrounding context. */
5112 {
5118 type_decl
5122 typename_type,
5125 declarator_p);
5128 {
5129 /* We couldn't find a type with this name, so just accept
5130 it and check for a match at instantiation time. */
5135 }
5136 }
5137 /* If an error occurred, assume that the name of the
5138 destructor is the same as the name of the qualifying
5139 class. That allows us to keep parsing after running
5140 into ill-formed destructor names. */
5146 /* Check that destructor name and scope match. */
5148 {
5155 }
5157 /* [class.dtor]
5159 A typedef-name that names a class shall not be used as the
5160 identifier in the declarator for a destructor declaration. */
5167 type_decl);
5170 }
5174 {
5176 /* This could be a template-id, so we try that first. */
5178 /* Try a template-id. */
5181 none_type,
5182 declarator_p);
5183 /* If that worked, we're done. */
5186 /* We still don't know whether we're looking at an
5187 operator-function-id or a conversion-function-id. */
5189 /* Try an operator-function-id. */
5191 /* If that didn't work, try a conversion-function-id. */
5195 {
5196 /* 17.6.3.3.5 */
5202 }
5215 }
5216 /* Fall through. */
5223 }
5224 }
5226 /* Parse an (optional) nested-name-specifier.
5228 nested-name-specifier: [C++98]
5229 class-or-namespace-name :: nested-name-specifier [opt]
5230 class-or-namespace-name :: template nested-name-specifier [opt]
5232 nested-name-specifier: [C++0x]
5233 type-name ::
5234 namespace-name ::
5235 nested-name-specifier identifier ::
5236 nested-name-specifier template [opt] simple-template-id ::
5238 PARSER->SCOPE should be set appropriately before this function is
5239 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5240 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5241 in name lookups.
5243 Sets PARSER->SCOPE to the class (TYPE) or namespace
5244 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5245 it unchanged if there is no nested-name-specifier. Returns the new
5246 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5248 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5249 part of a declaration and/or decl-specifier. */
5251 static tree
5257 {
5262 /* Remember where the nested-name-specifier starts. */
5264 {
5267 }
5270 {
5271 tree new_scope;
5272 tree old_scope;
5273 tree saved_qualifying_scope;
5276 /* Spot cases that cannot be the beginning of a
5277 nested-name-specifier. */
5280 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5281 the already parsed nested-name-specifier. */
5283 {
5284 /* Grab the nested-name-specifier and continue the loop. */
5286 /* If we originally encountered this nested-name-specifier
5287 with IS_DECLARATION set to false, we will not have
5288 resolved TYPENAME_TYPEs, so we must do so here. */
5291 {
5296 }
5299 }
5301 /* Spot cases that cannot be the beginning of a
5302 nested-name-specifier. On the second and subsequent times
5303 through the loop, we look for the `template' keyword. */
5305 ;
5306 /* A template-id can start a nested-name-specifier. */
5308 ;
5309 /* DR 743: decltype can be used in a nested-name-specifier. */
5311 ;
5312 else
5313 {
5314 /* If the next token is not an identifier, then it is
5315 definitely not a type-name or namespace-name. */
5318 /* If the following token is neither a `<' (to begin a
5319 template-id), nor a `::', then we are not looking at a
5320 nested-name-specifier. */
5326 {
5330 }
5333 && !cp_parser_nth_token_starts_template_argument_list_p
5336 }
5338 /* The nested-name-specifier is optional, so we parse
5339 tentatively. */
5342 /* Look for the optional `template' keyword, if this isn't the
5343 first time through the loop. */
5346 else
5349 /* Save the old scope since the name lookup we are about to do
5350 might destroy it. */
5353 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5354 look up names in "X<T>::I" in order to determine that "Y" is
5355 a template. So, if we have a typename at this point, we make
5356 an effort to look through it. */
5358 && !typename_keyword_p
5363 /* Parse the qualifying entity. */
5364 new_scope
5366 typename_keyword_p,
5367 template_keyword_p,
5368 check_dependency_p,
5369 type_p,
5370 is_declaration);
5371 /* Look for the `::' token. */
5374 /* If we found what we wanted, we keep going; otherwise, we're
5375 done. */
5377 {
5380 /* Restore the OLD_SCOPE since it was valid before the
5381 failed attempt at finding the last
5382 class-or-namespace-name. */
5386 /* If the next token is a decltype, and the one after that is a
5387 `::', then the decltype has failed to resolve to a class or
5388 enumeration type. Give this error even when parsing
5389 tentatively since it can't possibly be valid--and we're going
5390 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5391 won't get another chance.*/
5395 {
5402 /* As below. */
5405 }
5409 /* If the next token is an identifier, and the one after
5410 that is a `::', then any valid interpretation would have
5411 found a class-or-namespace-name. */
5417 {
5420 {
5422 {
5423 tree decl;
5424 tree ambiguous_decls;
5427 none_type,
5436 decl);
5438 {
5439 // cp_parser_lookup_name has the same diagnostic,
5440 // thus make sure to emit it at most once.
5443 {
5448 }
5450 }
5451 else
5452 {
5454 cp_parser_name_lookup_error
5457 else
5458 cp_parser_name_lookup_error
5461 }
5462 }
5465 /* Treat this as a successful nested-name-specifier
5466 due to:
5468 [basic.lookup.qual]
5470 If the name found is not a class-name (clause
5471 _class_) or namespace-name (_namespace.def_), the
5472 program is ill-formed. */
5474 }
5476 }
5478 }
5479 /* We've found one valid nested-name-specifier. */
5481 /* Name lookup always gives us a DECL. */
5484 /* Uses of "template" must be followed by actual templates. */
5496 new_scope);
5497 /* If it is a class scope, try to complete it; we are about to
5498 be looking up names inside the class. */
5500 /* Since checking types for dependency can be expensive,
5501 avoid doing it if the type is already complete. */
5503 /* Do not try to complete dependent types. */
5505 {
5507 /* If it is a typedef to current class, use the current
5508 class instead, as the typedef won't have any names inside
5509 it yet. */
5513 }
5514 /* Make sure we look in the right scope the next time through
5515 the loop. */
5517 }
5519 /* If parsing tentatively, replace the sequence of tokens that makes
5520 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5521 token. That way, should we re-parse the token stream, we will
5522 not have to repeat the effort required to do the parse, nor will
5523 we issue duplicate error messages. */
5525 {
5529 /* Reset the contents of the START token. */
5531 /* Retrieve any deferred checks. Do not pop this access checks yet
5532 so the memory will not be reclaimed during token replacing below. */
5540 /* Purge all subsequent tokens. */
5542 }
5548 }
5550 /* Parse a nested-name-specifier. See
5551 cp_parser_nested_name_specifier_opt for details. This function
5552 behaves identically, except that it will an issue an error if no
5553 nested-name-specifier is present. */
5555 static tree
5561 {
5562 tree scope;
5564 /* Look for the nested-name-specifier. */
5566 typename_keyword_p,
5567 check_dependency_p,
5568 type_p,
5569 is_declaration);
5570 /* If it was not present, issue an error message. */
5572 {
5575 }
5578 }
5580 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5581 this is either a class-name or a namespace-name (which corresponds
5582 to the class-or-namespace-name production in the grammar). For
5583 C++0x, it can also be a type-name that refers to an enumeration
5584 type or a simple-template-id.
5586 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5587 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5588 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5589 TYPE_P is TRUE iff the next name should be taken as a class-name,
5590 even the same name is declared to be another entity in the same
5591 scope.
5593 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5594 specified by the class-or-namespace-name. If neither is found the
5595 ERROR_MARK_NODE is returned. */
5597 static tree
5604 {
5605 tree saved_scope;
5606 tree saved_qualifying_scope;
5607 tree saved_object_scope;
5608 tree scope;
5612 /* DR 743: decltype can appear in a nested-name-specifier. */
5614 {
5618 {
5621 }
5625 }
5627 /* Before we try to parse the class-name, we must save away the
5628 current PARSER->SCOPE since cp_parser_class_name will destroy
5629 it. */
5633 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5634 there is no need to look for a namespace-name. */
5635 only_class_p = template_keyword_p
5640 typename_keyword_p,
5641 template_keyword_p,
5643 check_dependency_p,
5645 is_declaration);
5647 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5651 {
5652 /* Restore the saved scope. */
5657 /* Parse tentatively. */
5660 /* Parse a type-name */
5663 /* "If the name found does not designate a namespace or a class,
5664 enumeration, or dependent type, the program is ill-formed."
5666 We cover classes and dependent types above and namespaces below,
5667 so this code is only looking for enums. */
5673 }
5674 /* If that didn't work, try for a namespace-name. */
5676 {
5677 /* Restore the saved scope. */
5681 /* If we are not looking at an identifier followed by the scope
5682 resolution operator, then this is not part of a
5683 nested-name-specifier. (Note that this function is only used
5684 to parse the components of a nested-name-specifier.) */
5689 }
5692 }
5694 /* Return true if we are looking at a compound-literal, false otherwise. */
5696 static bool
5698 {
5699 /* Consume the `('. */
5704 /* Skip tokens until the next token is a closing parenthesis.
5705 If we find the closing `)', and the next token is a `{', then
5706 we are looking at a compound-literal. */
5707 bool compound_literal_p
5712 /* Roll back the tokens we skipped. */
5716 }
5718 /* Parse a postfix-expression.
5720 postfix-expression:
5721 primary-expression
5722 postfix-expression [ expression ]
5723 postfix-expression ( expression-list [opt] )
5724 simple-type-specifier ( expression-list [opt] )
5725 typename :: [opt] nested-name-specifier identifier
5726 ( expression-list [opt] )
5727 typename :: [opt] nested-name-specifier template [opt] template-id
5728 ( expression-list [opt] )
5729 postfix-expression . template [opt] id-expression
5730 postfix-expression -> template [opt] id-expression
5731 postfix-expression . pseudo-destructor-name
5732 postfix-expression -> pseudo-destructor-name
5733 postfix-expression ++
5734 postfix-expression --
5735 dynamic_cast < type-id > ( expression )
5736 static_cast < type-id > ( expression )
5737 reinterpret_cast < type-id > ( expression )
5738 const_cast < type-id > ( expression )
5739 typeid ( expression )
5740 typeid ( type-id )
5742 GNU Extension:
5744 postfix-expression:
5745 ( type-id ) { initializer-list , [opt] }
5747 This extension is a GNU version of the C99 compound-literal
5748 construct. (The C99 grammar uses `type-name' instead of `type-id',
5749 but they are essentially the same concept.)
5751 If ADDRESS_P is true, the postfix expression is the operand of the
5752 `&' operator. CAST_P is true if this expression is the target of a
5753 cast.
5755 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5756 class member access expressions [expr.ref].
5758 Returns a representation of the expression. */
5760 static tree
5764 {
5766 location_t loc;
5773 /* Peek at the next token. */
5776 /* Some of the productions are determined by keywords. */
5779 {
5784 {
5785 tree type;
5786 tree expression;
5790 /* All of these can be handled in the same way from the point
5791 of view of parsing. Begin by consuming the token
5792 identifying the cast. */
5795 /* New types cannot be defined in the cast. */
5797 parser->type_definition_forbidden_message
5800 /* Look for the opening `<'. */
5802 /* Parse the type to which we are casting. */
5807 /* Look for the closing `>'. */
5809 /* Restore the old message. */
5812 bool saved_greater_than_is_operator_p
5816 /* And the expression which is being cast. */
5821 parser->greater_than_is_operator_p
5824 /* Only type conversions to integral or enumeration types
5825 can be used in constant-expressions. */
5831 {
5833 postfix_expression
5837 postfix_expression
5841 postfix_expression
5843 tf_warning_or_error);
5846 postfix_expression
5851 }
5852 }
5856 {
5857 tree type;
5861 /* Consume the `typeid' token. */
5863 /* Look for the `(' token. */
5865 /* Types cannot be defined in a `typeid' expression. */
5867 parser->type_definition_forbidden_message
5869 /* We can't be sure yet whether we're looking at a type-id or an
5870 expression. */
5872 /* Try a type-id first. */
5877 /* Look for the `)' token. Otherwise, we can't be sure that
5878 we're not looking at an expression: consider `typeid (int
5879 (3))', for example. */
5881 /* If all went well, simply lookup the type-id. */
5884 /* Otherwise, fall back to the expression variant. */
5885 else
5886 {
5887 tree expression;
5889 /* Look for an expression. */
5891 /* Compute its typeid. */
5893 /* Look for the `)' token. */
5895 }
5896 /* Restore the saved message. */
5898 /* `typeid' may not appear in an integral constant expression. */
5901 }
5905 {
5906 tree type;
5907 /* The syntax permitted here is the same permitted for an
5908 elaborated-type-specifier. */
5913 }
5917 {
5921 {
5926 }
5928 {
5933 }
5934 else
5935 {
5936 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5939 }
5941 postfix_expression =
5945 {
5949 }
5951 {
5956 }
5957 else
5958 {
5960 postfix_expression);
5964 }
5966 }
5969 {
5972 tree p;
5986 tf_warning_or_error);
5989 tf_warning_or_error);
5990 else
5991 {
5995 }
5997 }
6000 {
6001 tree type;
6003 /* If the next thing is a simple-type-specifier, we may be
6004 looking at a functional cast. We could also be looking at
6005 an id-expression. So, we try the functional cast, and if
6006 that doesn't work we fall back to the primary-expression. */
6008 /* Look for the simple-type-specifier. */
6011 CP_PARSER_FLAGS_NONE);
6012 /* Parse the cast itself. */
6014 postfix_expression
6016 /* If that worked, we're done. */
6020 /* If the functional-cast didn't work out, try a
6021 compound-literal. */
6024 {
6029 /* Avoid calling cp_parser_type_id pointlessly, see comment
6030 in cp_parser_cast_expression about c++/29234. */
6033 else
6034 {
6035 /* Parse the type. */
6040 /* Look for the `)'. */
6042 }
6044 /* If things aren't going well, there's no need to
6045 keep going. */
6047 {
6049 /* Parse the brace-enclosed initializer list. */
6052 }
6053 /* If that worked, we're definitely looking at a
6054 compound-literal expression. */
6056 {
6057 /* Warn the user that a compound literal is not
6058 allowed in standard C++. */
6061 /* For simplicity, we disallow compound literals in
6062 constant-expressions. We could
6063 allow compound literals of integer type, whose
6064 initializer was a constant, in constant
6065 expressions. Permitting that usage, as a further
6066 extension, would not change the meaning of any
6067 currently accepted programs. (Of course, as
6068 compound literals are not part of ISO C++, the
6069 standard has nothing to say.) */
6071 NIC_NCC))
6072 {
6075 }
6076 /* Form the representation of the compound-literal. */
6077 postfix_expression
6079 tf_warning_or_error);
6081 }
6082 }
6084 /* It must be a primary-expression. */
6085 postfix_expression
6088 decltype_p,
6090 }
6092 }
6094 /* Note that we don't need to worry about calling build_cplus_new on a
6095 class-valued CALL_EXPR in decltype when it isn't the end of the
6096 postfix-expression; unary_complex_lvalue will take care of that for
6097 all these cases. */
6099 /* Keep looping until the postfix-expression is complete. */
6101 {
6105 /* It is not a Koenig lookup function call. */
6106 postfix_expression
6109 /* Peek at the next token. */
6113 {
6116 {
6118 "two consecutive %<[%> shall "
6121 }
6122 postfix_expression
6124 postfix_expression,
6126 decltype_p);
6132 /* postfix-expression ( expression-list [opt] ) */
6133 {
6143 is_builtin_constant_p
6146 {
6147 /* The whole point of __builtin_constant_p is to allow
6148 non-constant expressions to appear as arguments. */
6149 saved_integral_constant_expression_p
6151 saved_non_integral_constant_expression_p
6154 }
6155 args = (cp_parser_parenthesized_expression_list
6161 {
6162 parser->integral_constant_expression_p
6164 parser->non_integral_constant_expression_p
6166 }
6169 {
6172 }
6174 /* Function calls are not permitted in
6175 constant-expressions. */
6178 NIC_FUNC_CALL))
6179 {
6183 }
6188 {
6190 {
6192 {
6195 postfix_expression
6197 complain);
6198 }
6199 else
6200 postfix_expression
6202 }
6203 /* We do not perform argument-dependent lookup if
6204 normal lookup finds a non-function, in accordance
6205 with the expected resolution of DR 218. */
6208 {
6212 /* Do not do argument dependent lookup if regular
6213 lookup finds a member function or a block-scope
6214 function declaration. [basic.lookup.argdep]/3 */
6217 {
6220 postfix_expression
6222 complain);
6223 }
6224 }
6225 }
6228 {
6238 "%<memset%> used with constant zero length "
6239 "parameter; this could be due to transposed "
6242 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6243 to avoid leaking those into folder and middle-end. */
6245 tree arg;
6249 }
6252 {
6262 {
6263 postfix_expression
6267 }
6270 {
6271 postfix_expression
6272 = (build_new_method_call
6278 complain));
6279 }
6280 else
6281 postfix_expression
6285 complain);
6286 }
6290 postfix_expression = (build_offset_ref_call_from_tree
6292 complain));
6294 /* A call to a static class member, or a namespace-scope
6295 function. */
6296 postfix_expression
6299 koenig_p,
6300 complain);
6301 else
6302 /* All other function calls. */
6303 postfix_expression
6306 koenig_p,
6307 complain);
6311 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6315 }
6320 /* postfix-expression . template [opt] id-expression
6321 postfix-expression . pseudo-destructor-name
6322 postfix-expression -> template [opt] id-expression
6323 postfix-expression -> pseudo-destructor-name */
6325 /* Consume the `.' or `->' operator. */
6328 postfix_expression
6330 postfix_expression,
6337 /* postfix-expression ++ */
6338 /* Consume the `++' token. */
6340 /* Generate a representation for the complete expression. */
6341 postfix_expression
6343 POSTINCREMENT_EXPR);
6344 /* Increments may not appear in constant-expressions. */
6352 /* postfix-expression -- */
6353 /* Consume the `--' token. */
6355 /* Generate a representation for the complete expression. */
6356 postfix_expression
6358 POSTDECREMENT_EXPR);
6359 /* Decrements may not appear in constant-expressions. */
6371 else
6373 }
6374 }
6376 /* We should never get here. */
6379 }
6381 /* This function parses Cilk Plus array notations. If a normal array expr. is
6382 parsed then the array index is passed back to the caller through *INIT_INDEX
6383 and the function returns a NULL_TREE. If array notation expr. is parsed,
6384 then *INIT_INDEX is ignored by the caller and the function returns
6385 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6386 error_mark_node. */
6388 static tree
6390 tree array_value)
6391 {
6395 {
6398 }
6407 {
6410 }
6412 {
6413 /* Consume the ':'. */
6416 /* If we are here, then we have a case like this A[:]. */
6418 {
6422 }
6426 }
6427 else
6428 {
6429 /* If we are here, then there are three valid possibilities:
6430 1. ARRAY [ EXP ]
6431 2. ARRAY [ EXP : EXP ]
6432 3. ARRAY [ EXP : EXP : EXP ] */
6436 {
6437 /* This indicates that we have a normal array expression. */
6440 }
6442 /* Consume the ':'. */
6446 {
6449 }
6450 }
6455 {
6459 }
6465 }
6467 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6468 by cp_parser_builtin_offsetof. We're looking for
6470 postfix-expression [ expression ]
6471 postfix-expression [ braced-init-list ] (C++11)
6473 FOR_OFFSETOF is set if we're being called in that context, which
6474 changes how we deal with integer constant expressions. */
6476 static tree
6478 tree postfix_expression,
6481 {
6486 /* Consume the `[' token. */
6492 /* Parse the index expression. */
6493 /* ??? For offsetof, there is a question of what to allow here. If
6494 offsetof is not being used in an integral constant expression context,
6495 then we *could* get the right answer by computing the value at runtime.
6496 If we are in an integral constant expression context, then we might
6497 could accept any constant expression; hard to say without analysis.
6498 Rather than open the barn door too wide right away, allow only integer
6499 constant expressions here. */
6502 else
6503 {
6505 {
6512 {
6514 "braced list index is not allowed with array "
6518 }
6519 }
6521 {
6522 /* Here are have these two options:
6523 ARRAY[EXP : EXP] - Array notation expr with default
6524 stride of 1.
6525 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6526 stride. */
6528 postfix_expression);
6531 }
6532 else
6534 }
6538 /* Look for the closing `]'. */
6541 /* Build the ARRAY_REF. */
6545 /* When not doing offsetof, array references are not permitted in
6546 constant-expressions. */
6552 }
6554 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6555 by cp_parser_builtin_offsetof. We're looking for
6557 postfix-expression . template [opt] id-expression
6558 postfix-expression . pseudo-destructor-name
6559 postfix-expression -> template [opt] id-expression
6560 postfix-expression -> pseudo-destructor-name
6562 FOR_OFFSETOF is set if we're being called in that context. That sorta
6563 limits what of the above we'll actually accept, but nevermind.
6564 TOKEN_TYPE is the "." or "->" token, which will already have been
6565 removed from the stream. */
6567 static tree
6570 tree postfix_expression,
6572 location_t location)
6573 {
6574 tree name;
6579 /* If this is a `->' operator, dereference the pointer. */
6582 tf_warning_or_error);
6583 /* Check to see whether or not the expression is type-dependent. */
6585 /* The identifier following the `->' or `.' is not qualified. */
6591 /* Enter the scope corresponding to the type of the object
6592 given by the POSTFIX_EXPRESSION. */
6594 {
6596 /* According to the standard, no expression should ever have
6597 reference type. Unfortunately, we do not currently match
6598 the standard in this respect in that our internal representation
6599 of an expression may have reference type even when the standard
6600 says it does not. Therefore, we have to manually obtain the
6601 underlying type here. */
6603 /* The type of the POSTFIX_EXPRESSION must be complete. */
6605 {
6607 postfix_expression);
6609 }
6610 /* Unlike the object expression in other contexts, *this is not
6611 required to be of complete type for purposes of class member
6612 access (5.2.5) outside the member function body. */
6616 /* Let the name lookup machinery know that we are processing a
6617 class member access expression. */
6619 /* If something went wrong, we want to be able to discern that case,
6620 as opposed to the case where there was no SCOPE due to the type
6621 of expression being dependent. */
6624 /* If the SCOPE was erroneous, make the various semantic analysis
6625 functions exit quickly -- and without issuing additional error
6626 messages. */
6629 }
6631 /* Assume this expression is not a pseudo-destructor access. */
6634 /* If the SCOPE is a scalar type, then, if this is a valid program,
6635 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6636 is type dependent, it can be pseudo-destructor-name or something else.
6637 Try to parse it as pseudo-destructor-name first. */
6639 {
6640 tree s;
6641 tree type;
6644 /* Parse the pseudo-destructor-name. */
6653 {
6655 postfix_expression
6658 }
6659 }
6662 {
6663 /* If the SCOPE is not a scalar type, we are looking at an
6664 ordinary class member access expression, rather than a
6665 pseudo-destructor-name. */
6668 /* Parse the id-expression. */
6669 name = (cp_parser_id_expression
6676 /* In general, build a SCOPE_REF if the member name is qualified.
6677 However, if the name was not dependent and has already been
6678 resolved; there is no need to build the SCOPE_REF. For example;
6680 struct X { void f(); };
6681 template <typename T> void f(T* t) { t->X::f(); }
6683 Even though "t" is dependent, "X::f" is not and has been resolved
6684 to a BASELINK; there is no need to include scope information. */
6686 /* But we do need to remember that there was an explicit scope for
6687 virtual function calls. */
6691 /* If the name is a template-id that names a type, we will get a
6692 TYPE_DECL here. That is invalid code. */
6694 {
6697 }
6698 else
6699 {
6701 {
6703 {
6707 }
6708 else
6711 name,
6712 template_p);
6716 }
6718 adjust_result_of_qualified_name_lookup
6720 postfix_expression
6722 template_p,
6723 tf_warning_or_error);
6724 }
6725 }
6727 /* We no longer need to look up names in the scope of the object on
6728 the left-hand side of the `.' or `->' operator. */
6731 /* Outside of offsetof, these operators may not appear in
6732 constant-expressions. */
6734 && (cp_parser_non_integral_constant_expression
6739 }
6741 /* Cache of LITERAL_ZERO_P constants. */
6745 /* Parse a parenthesized expression-list.
6747 expression-list:
6748 assignment-expression
6749 expression-list, assignment-expression
6751 attribute-list:
6752 expression-list
6753 identifier
6754 identifier, expression-list
6756 CAST_P is true if this expression is the target of a cast.
6758 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6759 argument pack.
6761 Returns a vector of trees. Each element is a representation of an
6762 assignment-expression. NULL is returned if the ( and or ) are
6763 missing. An empty, but allocated, vector is returned on no
6764 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6765 if we are parsing an attribute list for an attribute that wants a
6766 plain identifier argument, normal_attr for an attribute that wants
6767 an expression, or non_attr if we aren't parsing an attribute list. If
6768 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6769 not all of the expressions in the list were constant.
6770 WANT_LITERAL_ZERO_P is true if the caller is interested in
6771 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6772 immediately, this can be removed. */
6781 {
6787 /* Assume all the expressions will be constant. */
6796 /* Within a parenthesized expression, a `>' token is always
6797 the greater-than operator. */
6798 saved_greater_than_is_operator_p
6802 /* Consume expressions until there are no more. */
6805 {
6806 tree expr;
6808 /* At the beginning of attribute lists, check to see if the
6809 next token is an identifier. */
6812 {
6815 /* Consume the identifier. */
6817 /* Save the identifier. */
6819 }
6820 else
6821 {
6824 /* Parse the next assignment-expression. */
6826 {
6827 /* A braced-init-list. */
6833 }
6835 {
6836 expr = (cp_parser_constant_expression
6841 }
6842 else
6843 {
6847 {
6853 /* If a parameter is literal zero alone, remember it
6854 for -Wmemset-transposed-args warning. */
6857 && want_literal_zero_p
6859 == CPP_COMMA
6862 {
6869 else
6870 {
6875 }
6876 /* Consume the 0 token (or '\0', 0LL etc.). */
6878 }
6882 }
6885 cast_p);
6886 }
6891 /* If we have an ellipsis, then this is an expression
6892 expansion. */
6895 {
6896 /* Consume the `...'. */
6899 /* Build the argument pack. */
6901 }
6903 /* Add it to the list. We add error_mark_node
6904 expressions to the list, so that we can still tell if
6905 the correct form for a parenthesized expression-list
6906 is found. That gives better errors. */
6911 }
6913 /* After the first item, attribute lists look the same as
6914 expression lists. */
6917 get_comma:;
6918 /* If the next token isn't a `,', then we are done. */
6922 /* Otherwise, consume the `,' and keep going. */
6924 }
6927 {
6930 skip_comma:;
6931 /* We try and resync to an unnested comma, as that will give the
6932 user better diagnostics. */
6940 {
6941 parser->greater_than_is_operator_p
6944 }
6945 }
6947 parser->greater_than_is_operator_p
6954 }
6956 /* Parse a pseudo-destructor-name.
6958 pseudo-destructor-name:
6959 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6960 :: [opt] nested-name-specifier template template-id :: ~ type-name
6961 :: [opt] nested-name-specifier [opt] ~ type-name
6963 If either of the first two productions is used, sets *SCOPE to the
6964 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6965 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6966 or ERROR_MARK_NODE if the parse fails. */
6968 static void
6970 tree object,
6973 {
6976 /* Handle ~auto. */
6980 {
6983 "%<~auto%> only available with "
6990 }
6992 /* Assume that things will not work out. */
6995 /* Look for the optional `::' operator. */
6997 /* Look for the optional nested-name-specifier. */
6998 nested_name_specifier_p
7005 /* Now, if we saw a nested-name-specifier, we might be doing the
7006 second production. */
7009 {
7010 /* Consume the `template' keyword. */
7012 /* Parse the template-id. */
7016 class_type,
7018 /* Look for the `::' token. */
7020 }
7021 /* If the next token is not a `~', then there might be some
7022 additional qualification. */
7024 {
7025 /* At this point, we're looking for "type-name :: ~". The type-name
7026 must not be a class-name, since this is a pseudo-destructor. So,
7027 it must be either an enum-name, or a typedef-name -- both of which
7028 are just identifiers. So, we peek ahead to check that the "::"
7029 and "~" tokens are present; if they are not, then we can avoid
7030 calling type_name. */
7034 {
7037 }
7039 /* Look for the type-name. */
7044 /* Look for the `::' token. */
7046 }
7047 else
7050 /* Look for the `~'. */
7053 /* Once we see the ~, this has to be a pseudo-destructor. */
7057 /* Look for the type-name again. We are not responsible for
7058 checking that it matches the first type-name. */
7060 }
7062 /* Parse a unary-expression.
7064 unary-expression:
7065 postfix-expression
7066 ++ cast-expression
7067 -- cast-expression
7068 unary-operator cast-expression
7069 sizeof unary-expression
7070 sizeof ( type-id )
7071 alignof ( type-id ) [C++0x]
7072 new-expression
7073 delete-expression
7075 GNU Extensions:
7077 unary-expression:
7078 __extension__ cast-expression
7079 __alignof__ unary-expression
7080 __alignof__ ( type-id )
7081 alignof unary-expression [C++0x]
7082 __real__ cast-expression
7083 __imag__ cast-expression
7084 && identifier
7085 sizeof ( type-id ) { initializer-list , [opt] }
7086 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7087 __alignof__ ( type-id ) { initializer-list , [opt] }
7089 ADDRESS_P is true iff the unary-expression is appearing as the
7090 operand of the `&' operator. CAST_P is true if this expression is
7091 the target of a cast.
7093 Returns a representation of the expression. */
7095 static tree
7098 {
7102 /* Peek at the next token. */
7104 /* Some keywords give away the kind of expression. */
7106 {
7110 {
7113 {
7116 location_t first_loc;
7119 /* Consume the token. */
7122 /* Parse the operand. */
7127 else
7128 {
7129 /* ISO C++ defines alignof only with types, not with
7130 expressions. So pedwarn if alignof is used with a non-
7131 type expression. However, __alignof__ is ok. */
7134 "ISO C++ does not allow %<alignof%> "
7138 }
7139 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7140 SIZEOF_EXPR with the original operand. */
7142 {
7144 {
7146 {
7149 error_mark_node));
7151 }
7152 else
7156 }
7158 }
7160 }
7169 {
7170 /* The saved value of the PEDANTIC flag. */
7172 tree expr;
7174 /* Save away the PEDANTIC flag. */
7176 /* Parse the cast-expression. */
7178 /* Restore the PEDANTIC flag. */
7182 }
7186 {
7187 tree expression;
7189 /* Consume the `__real__' or `__imag__' token. */
7191 /* Parse the cast-expression. */
7193 /* Create the complete representation. */
7197 expression,
7198 tf_warning_or_error);
7199 }
7207 {
7208 tree expr;
7218 parser->type_definition_forbidden_message
7221 saved_integral_constant_expression_p
7223 saved_non_integral_constant_expression_p
7227 saved_greater_than_is_operator_p
7239 parser->greater_than_is_operator_p
7242 parser->integral_constant_expression_p
7244 parser->non_integral_constant_expression_p
7251 }
7255 }
7256 }
7258 /* Look for the `:: new' and `:: delete', which also signal the
7259 beginning of a new-expression, or delete-expression,
7260 respectively. If the next token is `::', then it might be one of
7261 these. */
7263 {
7266 /* See if the token after the `::' is one of the keywords in
7267 which we're interested. */
7269 /* If it's `new', we have a new-expression. */
7272 /* Similarly, for `delete'. */
7275 }
7277 /* Look for a unary operator. */
7279 /* The `++' and `--' operators can be handled similarly, even though
7280 they are not technically unary-operators in the grammar. */
7282 {
7287 /* Handle the GNU address-of-label extension. */
7290 {
7291 tree identifier;
7292 tree expression;
7295 /* Consume the '&&' token. */
7297 /* Look for the identifier. */
7299 /* Create an expression representing the address. */
7302 NIC_ADDR_LABEL))
7305 }
7306 }
7308 {
7309 tree cast_expression;
7315 /* Consume the operator token. */
7317 /* Parse the cast-expression. */
7318 cast_expression
7323 pidk);
7324 /* Now, build an appropriate representation. */
7326 {
7330 RO_UNARY_STAR,
7331 complain);
7336 /* Fall through. */
7339 cast_expression,
7340 complain);
7347 /* Fall through. */
7357 }
7361 non_constant_p))
7365 }
7369 decltype_p,
7370 pidk);
7371 }
7373 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7374 unary-operator, the corresponding tree code is returned. */
7376 static enum tree_code
7378 {
7380 {
7401 }
7402 }
7404 /* Parse a new-expression.
7406 new-expression:
7407 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7408 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7410 Returns a representation of the expression. */
7412 static tree
7414 {
7417 tree type;
7420 tree ret;
7422 /* Look for the optional `::' operator. */
7423 global_scope_p
7427 /* Look for the `new' operator. */
7429 /* There's no easy way to tell a new-placement from the
7430 `( type-id )' construct. */
7432 /* Look for a new-placement. */
7434 /* If that didn't work out, there's no new-placement. */
7436 {
7440 }
7442 /* If the next token is a `(', then we have a parenthesized
7443 type-id. */
7445 {
7449 /* Consume the `('. */
7452 /* Parse the type-id. */
7453 parser->type_definition_forbidden_message
7458 /* Look for the closing `)'. */
7461 /* There should not be a direct-new-declarator in this production,
7462 but GCC used to allowed this, so we check and emit a sensible error
7463 message for this case. */
7465 {
7471 }
7472 }
7473 /* Otherwise, there must be a new-type-id. */
7474 else
7477 /* If the next token is a `(' or '{', then we have a new-initializer. */
7481 else
7484 /* A new-expression may not appear in an integral constant
7485 expression. */
7488 else
7489 {
7490 /* Create a representation of the new-expression. */
7492 tf_warning_or_error);
7493 }
7501 }
7503 /* Parse a new-placement.
7505 new-placement:
7506 ( expression-list )
7508 Returns the same representation as for an expression-list. */
7512 {
7515 /* Parse the expression-list. */
7516 expression_list = (cp_parser_parenthesized_expression_list
7522 }
7524 /* Parse a new-type-id.
7526 new-type-id:
7527 type-specifier-seq new-declarator [opt]
7529 Returns the TYPE allocated. If the new-type-id indicates an array
7530 type, *NELTS is set to the number of elements in the last array
7531 bound; the TYPE will not include the last array bound. */
7533 static tree
7535 {
7536 cp_decl_specifier_seq type_specifier_seq;
7542 /* The type-specifier sequence must not contain type definitions.
7543 (It cannot contain declarations of new types either, but if they
7544 are not definitions we will catch that because they are not
7545 complete.) */
7547 parser->type_definition_forbidden_message
7549 /* Parse the type-specifier-seq. */
7553 /* Restore the old message. */
7559 /* Parse the new-declarator. */
7562 /* Determine the number of elements in the last array dimension, if
7563 any. */
7565 /* Skip down to the last array dimension. */
7570 {
7573 }
7578 {
7581 }
7584 {
7591 else
7593 }
7596 }
7598 /* Parse an (optional) new-declarator.
7600 new-declarator:
7601 ptr-operator new-declarator [opt]
7602 direct-new-declarator
7604 Returns the declarator. */
7608 {
7611 cp_cv_quals cv_quals;
7613 /* We don't know if there's a ptr-operator next, or not. */
7615 /* Look for a ptr-operator. */
7617 /* If that worked, look for more new-declarators. */
7619 {
7622 /* Parse another optional declarator. */
7625 declarator = cp_parser_make_indirect_declarator
7629 }
7631 /* If the next token is a `[', there is a direct-new-declarator. */
7636 }
7638 /* Parse a direct-new-declarator.
7640 direct-new-declarator:
7641 [ expression ]
7642 direct-new-declarator [constant-expression]
7644 */
7648 {
7652 {
7653 tree expression;
7656 /* Look for the opening `['. */
7661 /* The standard requires that the expression have integral
7662 type. DR 74 adds enumeration types. We believe that the
7663 real intent is that these expressions be handled like the
7664 expression in a `switch' condition, which also allows
7665 classes with a single conversion to integral or
7666 enumeration type. */
7668 {
7669 expression
7671 expression,
7674 {
7676 "expression in new-declarator must have integral "
7679 }
7680 }
7682 /* Look for the closing `]'. */
7685 /* Add this bound to the declarator. */
7688 /* If the next token is not a `[', then there are no more
7689 bounds. */
7692 }
7695 }
7697 /* Parse a new-initializer.
7699 new-initializer:
7700 ( expression-list [opt] )
7701 braced-init-list
7703 Returns a representation of the expression-list. */
7707 {
7711 {
7712 tree t;
7719 }
7720 else
7721 expression_list = (cp_parser_parenthesized_expression_list
7727 }
7729 /* Parse a delete-expression.
7731 delete-expression:
7732 :: [opt] delete cast-expression
7733 :: [opt] delete [ ] cast-expression
7735 Returns a representation of the expression. */
7737 static tree
7739 {
7742 tree expression;
7744 /* Look for the optional `::' operator. */
7745 global_scope_p
7749 /* Look for the `delete' keyword. */
7751 /* See if the array syntax is in use. */
7753 {
7754 /* Consume the `[' token. */
7756 /* Look for the `]' token. */
7758 /* Remember that this is the `[]' construct. */
7760 }
7761 else
7764 /* Parse the cast-expression. */
7767 /* A delete-expression may not appear in an integral constant
7768 expression. */
7773 tf_warning_or_error);
7774 }
7776 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7777 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7778 0 otherwise. */
7780 static int
7782 {
7785 {
7827 /* In ((type ()) () the last () isn't a valid cast-expression,
7828 so the whole must be parsed as postfix-expression. */
7833 /* '[' may start a primary-expression in obj-c++ and in C++11,
7834 as a lambda-expression, eg, '(void)[]{}'. */
7841 /* '++' and '--' may or may not start a cast-expression:
7843 struct T { void operator++(int); };
7844 void f() { (T())++; }
7846 vs
7848 int a;
7849 (int)++a; */
7854 }
7855 }
7857 /* Parse a cast-expression.
7859 cast-expression:
7860 unary-expression
7861 ( type-id ) cast-expression
7863 ADDRESS_P is true iff the unary-expression is appearing as the
7864 operand of the `&' operator. CAST_P is true if this expression is
7865 the target of a cast.
7867 Returns a representation of the expression. */
7869 static tree
7872 {
7873 /* If it's a `(', then we might be looking at a cast. */
7875 {
7881 /* There's no way to know yet whether or not this is a cast.
7882 For example, `(int (3))' is a unary-expression, while `(int)
7883 3' is a cast. So, we resort to parsing tentatively. */
7885 /* Types may not be defined in a cast. */
7887 parser->type_definition_forbidden_message
7889 /* Consume the `('. */
7891 /* A very tricky bit is that `(struct S) { 3 }' is a
7892 compound-literal (which we permit in C++ as an extension).
7893 But, that construct is not a cast-expression -- it is a
7894 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7895 is legal; if the compound-literal were a cast-expression,
7896 you'd need an extra set of parentheses.) But, if we parse
7897 the type-id, and it happens to be a class-specifier, then we
7898 will commit to the parse at that point, because we cannot
7899 undo the action that is done when creating a new class. So,
7900 then we cannot back up and do a postfix-expression.
7902 Another tricky case is the following (c++/29234):
7904 struct S { void operator () (); };
7906 void foo ()
7907 {
7908 ( S()() );
7909 }
7911 As a type-id we parse the parenthesized S()() as a function
7912 returning a function, groktypename complains and we cannot
7913 back up in this case either.
7915 Therefore, we scan ahead to the closing `)', and check to see
7916 if the tokens after the `)' can start a cast-expression. Otherwise
7917 we are dealing with an unary-expression, a postfix-expression
7918 or something else.
7920 Yet another tricky case, in C++11, is the following (c++/54891):
7922 (void)[]{};
7924 The issue is that usually, besides the case of lambda-expressions,
7925 the parenthesized type-id cannot be followed by '[', and, eg, we
7926 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7927 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7928 we don't commit, we try a cast-expression, then an unary-expression.
7930 Save tokens so that we can put them back. */
7933 /* We may be looking at a cast-expression. */
7936 cast_expression
7939 /* Roll back the tokens we skipped. */
7941 /* If we aren't looking at a cast-expression, simulate an error so
7942 that the call to cp_parser_error_occurred below returns true. */
7945 else
7946 {
7949 /* Look for the type-id. */
7951 /* Look for the closing `)'. */
7954 }
7956 /* Restore the saved message. */
7959 /* At this point this can only be either a cast or a
7960 parenthesized ctor such as `(T ())' that looks like a cast to
7961 function returning T. */
7963 {
7964 /* Only commit if the cast-expression doesn't start with
7965 '++', '--', or '[' in C++11. */
7973 pidk);
7976 {
7977 /* Warn about old-style casts, if so requested. */
7984 /* Only type conversions to integral or enumeration types
7985 can be used in constant-expressions. */
7988 NIC_CAST))
7991 /* Perform the cast. */
7994 }
7995 }
7996 else
7998 }
8000 /* If we get here, then it's not a cast, so it must be a
8001 unary-expression. */
8004 }
8006 /* Parse a binary expression of the general form:
8008 pm-expression:
8009 cast-expression
8010 pm-expression .* cast-expression
8011 pm-expression ->* cast-expression
8013 multiplicative-expression:
8014 pm-expression
8015 multiplicative-expression * pm-expression
8016 multiplicative-expression / pm-expression
8017 multiplicative-expression % pm-expression
8019 additive-expression:
8020 multiplicative-expression
8021 additive-expression + multiplicative-expression
8022 additive-expression - multiplicative-expression
8024 shift-expression:
8025 additive-expression
8026 shift-expression << additive-expression
8027 shift-expression >> additive-expression
8029 relational-expression:
8030 shift-expression
8031 relational-expression < shift-expression
8032 relational-expression > shift-expression
8033 relational-expression <= shift-expression
8034 relational-expression >= shift-expression
8036 GNU Extension:
8038 relational-expression:
8039 relational-expression <? shift-expression
8040 relational-expression >? shift-expression
8042 equality-expression:
8043 relational-expression
8044 equality-expression == relational-expression
8045 equality-expression != relational-expression
8047 and-expression:
8048 equality-expression
8049 and-expression & equality-expression
8051 exclusive-or-expression:
8052 and-expression
8053 exclusive-or-expression ^ and-expression
8055 inclusive-or-expression:
8056 exclusive-or-expression
8057 inclusive-or-expression | exclusive-or-expression
8059 logical-and-expression:
8060 inclusive-or-expression
8061 logical-and-expression && inclusive-or-expression
8063 logical-or-expression:
8064 logical-and-expression
8065 logical-or-expression || logical-and-expression
8067 All these are implemented with a single function like:
8069 binary-expression:
8070 simple-cast-expression
8071 binary-expression <token> binary-expression
8073 CAST_P is true if this expression is the target of a cast.
8075 The binops_by_token map is used to get the tree codes for each <token> type.
8076 binary-expressions are associated according to a precedence table. */
8078 #define TOKEN_PRECEDENCE(token) \
8079 (((token->type == CPP_GREATER \
8080 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8081 && !parser->greater_than_is_operator_p) \
8082 ? PREC_NOT_OPERATOR \
8083 : binops_by_token[token->type].prec)
8085 static tree
8091 {
8092 cp_parser_expression_stack stack;
8094 cp_parser_expression_stack_entry current;
8095 tree rhs;
8099 tree overload;
8101 /* Parse the first expression. */
8112 {
8113 /* Get an operator token. */
8119 {
8121 "%<>>%> operator is treated"
8125 }
8129 /* Popping an entry off the stack means we completed a subexpression:
8130 - either we found a token which is not an operator (`>' where it is not
8131 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8132 will happen repeatedly;
8133 - or, we found an operator which has lower priority. This is the case
8134 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8135 parsing `3 * 4'. */
8137 {
8140 else
8142 }
8144 get_rhs:
8148 /* We used the operator token. */
8151 /* For "false && x" or "true || x", x will never be executed;
8152 disable warnings while evaluating it. */
8158 /* Extract another operand. It may be the RHS of this expression
8159 or the LHS of a new, higher priority expression. */
8164 /* Get another operator token. Look up its precedence to avoid
8165 building a useless (immediately popped) stack entry for common
8166 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8170 {
8171 /* ... and prepare to parse the RHS of the new, higher priority
8172 expression. Since precedence levels on the stack are
8173 monotonically increasing, we do not have to care about
8174 stack overflows. */
8183 pop:
8185 /* If the stack is not empty, we have parsed into LHS the right side
8186 (`4' in the example above) of an expression we had suspended.
8187 We can use the information on the stack to recover the LHS (`3')
8188 from the stack together with the tree code (`MULT_EXPR'), and
8189 the precedence of the higher level subexpression
8190 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8191 which will be used to actually build the additive expression. */
8196 }
8198 /* Undo the disabling of warnings done above. */
8209 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8210 ERROR_MARK for everything that is not a binary expression.
8211 This makes warn_about_parentheses miss some warnings that
8212 involve unary operators. For unary expressions we should
8213 pass the correct tree_code unless the unary expression was
8214 surrounded by parentheses.
8215 */
8221 == tcc_comparison
8224 else
8233 /* If the binary operator required the use of an overloaded operator,
8234 then this expression cannot be an integral constant-expression.
8235 An overloaded operator can be used even if both operands are
8236 otherwise permissible in an integral constant-expression if at
8237 least one of the operands is of enumeration type. */
8241 NIC_OVERLOADED))
8243 }
8246 }
8248 static tree
8253 {
8256 }
8258 /* Parse the `? expression : assignment-expression' part of a
8259 conditional-expression. The LOGICAL_OR_EXPR is the
8260 logical-or-expression that started the conditional-expression.
8261 Returns a representation of the entire conditional-expression.
8263 This routine is used by cp_parser_assignment_expression.
8265 ? expression : assignment-expression
8267 GNU Extensions:
8269 ? : assignment-expression */
8271 static tree
8273 {
8274 tree expr;
8275 tree assignment_expr;
8279 /* Consume the `?' token. */
8284 {
8287 /* Implicit true clause. */
8291 }
8292 else
8293 {
8296 /* Parse the expression. */
8299 c_inhibit_evaluation_warnings +=
8303 }
8305 /* The next token should be a `:'. */
8307 /* Parse the assignment-expression. */
8311 /* Build the conditional-expression. */
8313 expr,
8314 assignment_expr,
8315 tf_warning_or_error);
8316 }
8318 /* Parse an assignment-expression.
8320 assignment-expression:
8321 conditional-expression
8322 logical-or-expression assignment-operator assignment_expression
8323 throw-expression
8325 CAST_P is true if this expression is the target of a cast.
8326 DECLTYPE_P is true if this expression is the operand of decltype.
8328 Returns a representation for the expression. */
8330 static tree
8333 {
8334 tree expr;
8336 /* If the next token is the `throw' keyword, then we're looking at
8337 a throw-expression. */
8340 /* Otherwise, it must be that we are looking at a
8341 logical-or-expression. */
8342 else
8343 {
8344 /* Parse the binary expressions (logical-or-expression). */
8346 decltype_p,
8348 /* If the next token is a `?' then we're actually looking at a
8349 conditional-expression. */
8352 else
8353 {
8356 /* If it's an assignment-operator, we're using the second
8357 production. */
8358 enum tree_code assignment_operator
8361 {
8363 location_t saved_input_location;
8365 /* Parse the right-hand side of the assignment. */
8371 /* An assignment may not appear in a
8372 constant-expression. */
8374 NIC_ASSIGNMENT))
8376 /* Build the assignment expression. Its default
8377 location is the location of the '=' token. */
8381 assignment_operator,
8382 rhs,
8385 }
8386 }
8387 }
8390 }
8392 /* Parse an (optional) assignment-operator.
8394 assignment-operator: one of
8395 = *= /= %= += -= >>= <<= &= ^= |=
8397 GNU Extension:
8399 assignment-operator: one of
8400 <?= >?=
8402 If the next token is an assignment operator, the corresponding tree
8403 code is returned, and the token is consumed. For example, for
8404 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8405 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8406 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8407 operator, ERROR_MARK is returned. */
8409 static enum tree_code
8411 {
8415 /* Peek at the next token. */
8419 {
8465 /* Nothing else is an assignment operator. */
8467 }
8469 /* If it was an assignment operator, consume it. */
8474 }
8476 /* Parse an expression.
8478 expression:
8479 assignment-expression
8480 expression , assignment-expression
8482 CAST_P is true if this expression is the target of a cast.
8483 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8484 except possibly parenthesized or on the RHS of a comma (N3276).
8486 Returns a representation of the expression. */
8488 static tree
8491 {
8496 {
8497 tree assignment_expression;
8499 /* Parse the next assignment-expression. */
8500 assignment_expression
8503 /* We don't create a temporary for a call that is the immediate operand
8504 of decltype or on the RHS of a comma. But when we see a comma, we
8505 need to create a temporary for a call on the LHS. */
8510 assignment_expression
8514 /* If this is the first assignment-expression, we can just
8515 save it away. */
8518 else
8520 assignment_expression,
8522 /* If the next token is not a comma, then we are done with the
8523 expression. */
8526 /* Consume the `,'. */
8529 /* A comma operator cannot appear in a constant-expression. */
8532 }
8535 }
8537 /* Parse a constant-expression.
8539 constant-expression:
8540 conditional-expression
8542 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8543 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8544 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8545 is false, NON_CONSTANT_P should be NULL. */
8547 static tree
8551 {
8555 tree expression;
8557 /* It might seem that we could simply parse the
8558 conditional-expression, and then check to see if it were
8559 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8560 one that the compiler can figure out is constant, possibly after
8561 doing some simplifications or optimizations. The standard has a
8562 precise definition of constant-expression, and we must honor
8563 that, even though it is somewhat more restrictive.
8565 For example:
8567 int i[(2, 3)];
8569 is not a legal declaration, because `(2, 3)' is not a
8570 constant-expression. The `,' operator is forbidden in a
8571 constant-expression. However, GCC's constant-folding machinery
8572 will fold this operation to an INTEGER_CST for `3'. */
8574 /* Save the old settings. */
8576 saved_allow_non_integral_constant_expression_p
8579 /* We are now parsing a constant-expression. */
8581 parser->allow_non_integral_constant_expression_p
8584 /* Although the grammar says "conditional-expression", we parse an
8585 "assignment-expression", which also permits "throw-expression"
8586 and the use of assignment operators. In the case that
8587 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8588 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8589 actually essential that we look for an assignment-expression.
8590 For example, cp_parser_initializer_clauses uses this function to
8591 determine whether a particular assignment-expression is in fact
8592 constant. */
8594 /* Restore the old settings. */
8595 parser->integral_constant_expression_p
8597 parser->allow_non_integral_constant_expression_p
8600 {
8601 /* Require an rvalue constant expression here; that's what our
8602 callers expect. Reference constant expressions are handled
8603 separately in e.g. cp_parser_template_argument. */
8608 }
8611 parser->non_integral_constant_expression_p
8615 }
8617 /* Parse __builtin_offsetof.
8619 offsetof-expression:
8620 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8622 offsetof-member-designator:
8623 id-expression
8624 | offsetof-member-designator "." id-expression
8625 | offsetof-member-designator "[" expression "]"
8626 | offsetof-member-designator "->" id-expression */
8628 static tree
8630 {
8633 cp_id_kind dummy;
8636 /* We're about to accept non-integral-constant things, but will
8637 definitely yield an integral constant expression. Save and
8638 restore these values around our local parsing. */
8642 /* Consume the "__builtin_offsetof" token. */
8644 /* Consume the opening `('. */
8646 /* Parse the type-id. */
8649 /* Look for the `,'. */
8653 /* Build the (type *)null that begins the traditional offsetof macro. */
8655 tf_warning_or_error);
8657 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8661 {
8664 {
8666 /* offsetof-member-designator "[" expression "]" */
8672 /* offsetof-member-designator "->" identifier */
8675 /* FALLTHRU */
8678 /* offsetof-member-designator "." identifier */
8686 /* Consume the ")" token. */
8691 /* Error. We know the following require will fail, but
8692 that gives the proper error message. */
8697 }
8698 }
8700 success:
8701 /* If we're processing a template, we can't finish the semantics yet.
8702 Otherwise we can fold the entire expression now. */
8704 {
8707 }
8708 else
8711 failure:
8716 }
8718 /* Parse a trait expression.
8720 Returns a representation of the expression, the underlying type
8721 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8723 static tree
8725 {
8726 cp_trait_kind kind;
8732 {
8816 }
8818 /* Consume the token. */
8829 {
8836 }
8838 {
8840 {
8844 {
8847 }
8851 }
8852 }
8856 /* Complete the trait expression, which may mean either processing
8857 the trait expr now or saving it for template instantiation. */
8859 {
8868 }
8869 }
8871 /* Lambdas that appear in variable initializer or default argument scope
8872 get that in their mangling, so we need to record it. We might as well
8873 use the count for function and namespace scopes as well. */
8877 {
8878 tree t;
8883 static void
8885 {
8886 tree_int ti;
8888 /* Once we're inside a function, we ignore other scopes and just push
8889 the function again so that popping works properly. */
8896 {
8897 /* Don't reset the count if we're still in the same function. */
8900 }
8901 }
8903 static void
8905 {
8908 }
8910 static void
8912 {
8915 {
8918 }
8920 }
8922 /* Parse a lambda expression.
8924 lambda-expression:
8925 lambda-introducer lambda-declarator [opt] compound-statement
8927 Returns a representation of the expression. */
8929 static tree
8931 {
8933 tree type;
8941 {
8943 {
8947 }
8949 }
8951 {
8953 {
8956 }
8958 }
8960 /* We may be in the middle of deferred access check. Disable
8961 it now. */
8972 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8975 /* Now that we've started the type, add the capture fields for any
8976 explicit captures. */
8979 {
8980 /* Inside the class, surrounding template-parameter-lists do not apply. */
8981 unsigned int saved_num_template_parameter_lists
8985 bool fully_implicit_function_template_p
8989 bool auto_is_implicit_function_template_parm_p
9000 /* By virtue of defining a local class, a lambda expression has access to
9001 the private variables of enclosing classes. */
9006 {
9012 }
9014 {
9017 }
9019 /* The capture list was built up in reverse order; fix that now. */
9031 parser->fully_implicit_function_template_p
9035 parser->auto_is_implicit_function_template_parm_p
9037 }
9041 /* This field is only used during parsing of the lambda. */
9044 /* This lambda shouldn't have any proxies left at this point. */
9046 /* And now that we're done, push proxies for an enclosing lambda. */
9051 else
9057 }
9059 /* Parse the beginning of a lambda expression.
9061 lambda-introducer:
9062 [ lambda-capture [opt] ]
9064 LAMBDA_EXPR is the current representation of the lambda expression. */
9066 static void
9068 {
9069 /* Need commas after the first capture. */
9072 /* Eat the leading `['. */
9075 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9083 {
9086 }
9089 {
9091 tree capture_id;
9092 tree capture_init_expr;
9096 enum capture_kind_type
9097 {
9098 BY_COPY,
9099 BY_REFERENCE
9100 };
9104 {
9107 }
9111 else
9114 /* Possibly capture `this'. */
9116 {
9126 explicit_init_p);
9128 }
9130 /* Remember whether we want to capture as a reference or not. */
9132 {
9135 }
9137 /* Get the identifier. */
9142 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9143 delimiters, but I modified this to stop on unnested ']' as well. It
9144 was already changed to stop on unnested '}', so the
9145 "closing_parenthesis" name is no more misleading with my change. */
9146 {
9152 }
9154 /* Find the initializer for this capture. */
9158 {
9160 /* An explicit initializer exists. */
9163 "lambda capture initializers "
9169 {
9172 }
9173 }
9174 else
9175 {
9178 /* Turn the identifier into an id-expression. */
9179 capture_init_expr
9184 {
9187 }
9191 {
9194 capture_init_expr);
9197 }
9200 {
9203 capture_init_expr))
9206 }
9208 capture_init_expr
9209 = finish_id_expression
9211 capture_init_expr,
9225 {
9228 }
9229 else
9231 }
9235 {
9240 capture_id);
9244 "capture of %qD redundant with by-reference capture "
9246 }
9249 capture_id,
9250 capture_init_expr,
9252 explicit_init_p);
9253 }
9256 }
9258 /* Parse the (optional) middle of a lambda expression.
9260 lambda-declarator:
9261 < template-parameter-list [opt] >
9262 ( parameter-declaration-clause [opt] )
9263 attribute-specifier [opt]
9264 mutable [opt]
9265 exception-specification [opt]
9266 lambda-return-type-clause [opt]
9268 LAMBDA_EXPR is the current representation of the lambda expression. */
9270 static bool
9272 {
9273 /* 5.1.1.4 of the standard says:
9274 If a lambda-expression does not include a lambda-declarator, it is as if
9275 the lambda-declarator were ().
9276 This means an empty parameter list, no attributes, and no exception
9277 specification. */
9283 /* The template-parameter-list is optional, but must begin with
9284 an opening angle if present. */
9286 {
9289 "lambda templates are only available with "
9298 /* We just processed one more parameter list. */
9300 }
9302 /* The parameter-declaration-clause is optional (unless
9303 template-parameter-list was given), but must begin with an
9304 opening parenthesis if present. */
9306 {
9311 /* Parse parameters. */
9314 /* Default arguments shall not be specified in the
9315 parameter-declaration-clause of a lambda-declarator. */
9325 /* Parse optional `mutable' keyword. */
9327 {
9330 }
9332 /* Parse optional exception specification. */
9335 /* Parse optional trailing return type. */
9337 {
9341 }
9343 /* The function parameters must be in scope all the way until after the
9344 trailing-return-type in case of decltype. */
9346 }
9350 /* Create the function call operator.
9352 Messing with declarators like this is no uglier than building up the
9353 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9354 other code. */
9355 {
9356 cp_decl_specifier_seq return_type_specs;
9358 tree fco;
9365 else
9366 /* Maybe we will deduce the return type later. */
9372 sfk_none);
9377 VIRT_SPEC_UNSPECIFIED,
9378 REF_QUAL_NONE,
9379 exception_spec,
9384 declarator,
9385 attributes);
9387 {
9390 /* Give the object parameter a different name. */
9394 }
9396 {
9400 }
9409 }
9410 }
9412 /* Parse the body of a lambda expression, which is simply
9414 compound-statement
9416 but which requires special handling.
9417 LAMBDA_EXPR is the current representation of the lambda expression. */
9419 static void
9421 {
9426 else
9427 /* Still increment function_depth so that we don't GC in the
9428 middle of an expression. */
9430 /* Clear this in case we're in the middle of a default argument. */
9433 /* Finish the function call operator
9434 - class_specifier
9435 + late_parsing_for_member
9436 + function_definition_after_declarator
9437 + ctor_initializer_opt_and_function_body */
9438 {
9440 tree body;
9442 tree compound_stmt;
9443 tree cap;
9445 /* Let the front end know that we are going to be defining this
9446 function. */
9448 NULL_TREE,
9457 /* Push the proxies for any explicit captures. */
9464 /* 5.1.1.4 of the standard says:
9465 If a lambda-expression does not include a trailing-return-type, it
9466 is as if the trailing-return-type denotes the following type:
9467 * if the compound-statement is of the form
9468 { return attribute-specifier [opt] expression ; }
9469 the type of the returned expression after lvalue-to-rvalue
9470 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9471 (_conv.array_ 4.2), and function-to-pointer conversion
9472 (_conv.func_ 4.3);
9473 * otherwise, void. */
9475 /* In a lambda that has neither a lambda-return-type-clause
9476 nor a deducible form, errors should be reported for return statements
9477 in the body. Since we used void as the placeholder return type, parsing
9478 the body as usual will give such desired behavior. */
9482 {
9486 /* Parse tentatively in case there's more after the initial return
9487 statement. */
9498 {
9502 /* Will get error here if type not deduced yet. */
9506 }
9507 }
9510 {
9515 }
9519 out:
9523 /* Finish the function and generate code for it if necessary. */
9526 /* Only expand if the call op is not a template. */
9529 }
9534 else
9536 }
9538 /* Statements [gram.stmt.stmt] */
9540 /* Parse a statement.
9542 statement:
9543 labeled-statement
9544 expression-statement
9545 compound-statement
9546 selection-statement
9547 iteration-statement
9548 jump-statement
9549 declaration-statement
9550 try-block
9552 C++11:
9554 statement:
9555 labeled-statement
9556 attribute-specifier-seq (opt) expression-statement
9557 attribute-specifier-seq (opt) compound-statement
9558 attribute-specifier-seq (opt) selection-statement
9559 attribute-specifier-seq (opt) iteration-statement
9560 attribute-specifier-seq (opt) jump-statement
9561 declaration-statement
9562 attribute-specifier-seq (opt) try-block
9564 TM Extension:
9566 statement:
9567 atomic-statement
9569 IN_COMPOUND is true when the statement is nested inside a
9570 cp_parser_compound_statement; this matters for certain pragmas.
9572 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9573 is a (possibly labeled) if statement which is not enclosed in braces
9574 and has an else clause. This is used to implement -Wparentheses. */
9576 static void
9579 {
9584 restart:
9587 /* There is no statement yet. */
9593 /* In obj-c++, seeing '[[' might be the either the beginning of
9594 c++11 attributes, or a nested objc-message-expression. So
9595 let's parse the c++11 attributes tentatively. */
9599 {
9602 }
9604 /* Peek at the next token. */
9606 /* Remember the location of the first token in the statement. */
9608 /* If this is a keyword, then that will often determine what kind of
9609 statement we have. */
9611 {
9615 {
9618 /* Looks like a labeled-statement with a case label.
9619 Parse the label, and then use tail recursion to parse
9620 the statement. */
9637 {
9642 }
9643 else
9657 {
9662 }
9663 else
9664 {
9668 }
9672 /* Objective-C++ exception-handling constructs. */
9686 /* This must be a namespace alias definition. */
9699 /* It might be a keyword like `int' that can start a
9700 declaration-statement. */
9702 }
9703 }
9705 {
9706 /* If the next token is a `:', then we are looking at a
9707 labeled-statement. */
9710 {
9711 /* Looks like a labeled-statement with an ordinary label.
9712 Parse the label, and then use tail recursion to parse
9713 the statement. */
9717 }
9718 }
9719 /* Anything that starts with a `{' must be a compound-statement. */
9722 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9723 a statement all its own. */
9725 {
9726 /* Only certain OpenMP pragmas are attached to statements, and thus
9727 are considered statements themselves. All others are not. In
9728 the context of a compound, accept the pragma as a "statement" and
9729 return so that we can check for a close brace. Otherwise we
9730 require a real statement and must go back and read one. */
9736 }
9738 {
9741 }
9743 /* Everything else must be a declaration-statement or an
9744 expression-statement. Try for the declaration-statement
9745 first, unless we are looking at a `;', in which case we know that
9746 we have an expression-statement. */
9748 {
9750 {
9752 {
9753 /* Attributes should be parsed as part of the the
9754 declaration, so let's un-parse them. */
9757 }
9760 /* Try to parse the declaration-statement. */
9762 /* If that worked, we're done. */
9765 }
9766 /* Look for an expression-statement instead. */
9768 }
9770 /* Set the line number for the statement. */
9774 /* Note that for now, we don't do anything with c++11 statements
9775 parsed at this level. */
9778 OPT_Wattributes,
9780 }
9782 /* Parse the label for a labeled-statement, i.e.
9784 identifier :
9785 case constant-expression :
9786 default :
9788 GNU Extension:
9789 case constant-expression ... constant-expression : statement
9791 When a label is parsed without errors, the label is added to the
9792 parse tree by the finish_* functions, so this function doesn't
9793 have to return the label. */
9795 static void
9797 {
9802 /* The next token should be an identifier. */
9806 {
9809 }
9813 {
9815 {
9819 /* Consume the `case' token. */
9821 /* Parse the constant-expression. */
9826 {
9827 /* Consume the `...' token. */
9829 expr_hi =
9832 /* We don't need to emit warnings here, as the common code
9833 will do this for us. */
9834 }
9835 else
9840 else
9843 expr);
9844 }
9848 /* Consume the `default' token. */
9853 else
9858 /* Anything else must be an ordinary label. */
9861 }
9863 /* Require the `:' token. */
9866 /* An ordinary label may optionally be followed by attributes.
9867 However, this is only permitted if the attributes are then
9868 followed by a semicolon. This is because, for backward
9869 compatibility, when parsing
9870 lab: __attribute__ ((unused)) int i;
9871 we want the attribute to attach to "i", not "lab". */
9874 {
9875 tree attrs;
9882 ;
9883 else
9885 }
9891 }
9893 /* Parse an expression-statement.
9895 expression-statement:
9896 expression [opt] ;
9898 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9899 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9900 indicates whether this expression-statement is part of an
9901 expression statement. */
9903 static tree
9905 {
9909 /* If the next token is a ';', then there is no expression
9910 statement. */
9912 {
9916 {
9919 }
9920 }
9922 /* Give a helpful message for "A<T>::type t;" and the like. */
9925 {
9932 {
9933 /* A::A a; */
9938 }
9939 }
9941 /* Consume the final `;'. */
9946 /* This is the final expression statement of a statement
9947 expression. */
9953 }
9955 /* Parse a compound-statement.
9957 compound-statement:
9958 { statement-seq [opt] }
9960 GNU extension:
9962 compound-statement:
9963 { label-declaration-seq [opt] statement-seq [opt] }
9965 label-declaration-seq:
9966 label-declaration
9967 label-declaration-seq label-declaration
9969 Returns a tree representing the statement. */
9971 static tree
9974 {
9975 tree compound_stmt;
9977 /* Consume the `{'. */
9984 /* Begin the compound-statement. */
9986 /* If the next keyword is `__label__' we have a label declaration. */
9989 /* Parse an (optional) statement-seq. */
9991 /* Finish the compound-statement. */
9993 /* Consume the `}'. */
9997 }
9999 /* Parse an (optional) statement-seq.
10001 statement-seq:
10002 statement
10003 statement-seq [opt] statement */
10005 static void
10007 {
10008 /* Scan statements until there aren't any more. */
10010 {
10013 /* If we are looking at a `}', then we have run out of
10014 statements; the same is true if we have reached the end
10015 of file, or have stumbled upon a stray '@end'. */
10022 /* If we are in a compound statement and find 'else' then
10023 something went wrong. */
10025 {
10028 else
10029 {
10032 }
10033 }
10035 /* Parse the statement. */
10037 }
10038 }
10040 /* Parse a selection-statement.
10042 selection-statement:
10043 if ( condition ) statement
10044 if ( condition ) statement else statement
10045 switch ( condition ) statement
10047 Returns the new IF_STMT or SWITCH_STMT.
10049 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10050 is a (possibly labeled) if statement which is not enclosed in
10051 braces and has an else clause. This is used to implement
10052 -Wparentheses. */
10054 static tree
10056 {
10063 /* Peek at the next token. */
10066 /* See what kind of keyword it is. */
10069 {
10072 {
10073 tree statement;
10074 tree condition;
10076 /* Look for the `('. */
10078 {
10081 }
10083 /* Begin the selection-statement. */
10086 else
10089 /* Parse the condition. */
10091 /* Look for the `)'. */
10097 {
10101 /* Add the condition. */
10104 /* Parse the then-clause. */
10108 {
10116 }
10117 else
10123 /* If the next token is `else', parse the else-clause. */
10125 RID_ELSE))
10126 {
10127 /* Consume the `else' keyword. */
10130 /* Parse the else-clause. */
10132 {
10133 location_t loc;
10140 }
10141 else
10146 /* If we are currently parsing a then-clause, then
10147 IF_P will not be NULL. We set it to true to
10148 indicate that this if statement has an else clause.
10149 This may trigger the Wparentheses warning below
10150 when we get back up to the parent if statement. */
10153 }
10154 else
10155 {
10156 /* This if statement does not have an else clause. If
10157 NESTED_IF is true, then the then-clause is an if
10158 statement which does have an else clause. We warn
10159 about the potential ambiguity. */
10162 "suggest explicit braces to avoid ambiguous"
10164 }
10166 /* Now we're all done with the if-statement. */
10168 }
10169 else
10170 {
10174 /* Add the condition. */
10177 /* Parse the body of the switch-statement. */
10186 /* Now we're all done with the switch-statement. */
10188 }
10191 }
10197 }
10198 }
10200 /* Parse a condition.
10202 condition:
10203 expression
10204 type-specifier-seq declarator = initializer-clause
10205 type-specifier-seq declarator braced-init-list
10207 GNU Extension:
10209 condition:
10210 type-specifier-seq declarator asm-specification [opt]
10211 attributes [opt] = assignment-expression
10213 Returns the expression that should be tested. */
10215 static tree
10217 {
10218 cp_decl_specifier_seq type_specifiers;
10222 /* Try the declaration first. */
10224 /* New types are not allowed in the type-specifier-seq for a
10225 condition. */
10227 parser->type_definition_forbidden_message
10229 /* Parse the type-specifier-seq. */
10231 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10234 /* Restore the saved message. */
10236 /* If all is well, we might be looking at a declaration. */
10238 {
10239 tree decl;
10240 tree asm_specification;
10241 tree attributes;
10245 /* Parse the declarator. */
10251 /* Parse the attributes. */
10253 /* Parse the asm-specification. */
10255 /* If the next token is not an `=' or '{', then we might still be
10256 looking at an expression. For example:
10258 if (A(a).x)
10260 looks like a decl-specifier-seq and a declarator -- but then
10261 there is no `=', so this is an expression. */
10266 /* If we did see an `=' or '{', then we are looking at a declaration
10267 for sure. */
10269 {
10270 tree pushed_scope;
10274 /* Create the declaration. */
10280 /* Parse the initializer. */
10282 {
10286 }
10287 else
10288 {
10289 /* Consume the `='. */
10292 }
10296 /* Process the initializer. */
10299 asm_specification,
10300 flags);
10306 }
10307 }
10308 /* If we didn't even get past the declarator successfully, we are
10309 definitely not looking at a declaration. */
10310 else
10313 /* Otherwise, we are looking at an expression. */
10315 }
10317 /* Parses a for-statement or range-for-statement until the closing ')',
10318 not included. */
10320 static tree
10322 {
10326 /* Begin the for-statement. */
10329 /* Parse the initialization. */
10334 else
10336 }
10338 static tree
10340 {
10341 /* Normal for loop */
10344 tree stmt;
10347 /* The for-init-statement has already been parsed in
10348 cp_parser_for_init_statement, so no work is needed here. */
10351 /* If there's a condition, process it. */
10355 {
10359 }
10361 /* Look for the `;'. */
10364 /* If there's an expression, process it. */
10370 }
10372 /* Tries to parse a range-based for-statement:
10374 range-based-for:
10375 decl-specifier-seq declarator : expression
10377 The decl-specifier-seq declarator and the `:' are already parsed by
10378 cp_parser_for_init_statement. If processing_template_decl it returns a
10379 newly created RANGE_FOR_STMT; if not, it is converted to a
10380 regular FOR_STMT. */
10382 static tree
10385 {
10389 {
10392 }
10393 else
10396 /* If in template, STMT is converted to a normal for-statement
10397 at instantiation. If not, it is done just ahead. */
10399 {
10407 /* do_auto_deduction doesn't mess with template init-lists. */
10410 }
10411 else
10412 {
10415 }
10417 }
10419 /* Subroutine of cp_convert_range_for: given the initializer expression,
10420 builds up the range temporary. */
10422 static tree
10424 {
10427 /* Find out the type deduced by the declaration
10428 `auto &&__range = range_expr'. */
10433 /* Create the __range variable. */
10440 }
10442 /* Used by cp_parser_range_for in template context: we aren't going to
10443 do a full conversion yet, but we still need to resolve auto in the
10444 type of the for-range-declaration if present. This is basically
10445 a shortcut version of cp_convert_range_for. */
10447 static void
10449 {
10452 {
10455 iter_type = (cp_parser_perform_range_for_lookup
10458 {
10460 iter_type);
10462 tf_warning_or_error);
10465 }
10466 }
10467 }
10469 /* Converts a range-based for-statement into a normal
10470 for-statement, as per the definition.
10472 for (RANGE_DECL : RANGE_EXPR)
10473 BLOCK
10475 should be equivalent to:
10477 {
10478 auto &&__range = RANGE_EXPR;
10479 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10480 __begin != __end;
10481 ++__begin)
10482 {
10483 RANGE_DECL = *__begin;
10484 BLOCK
10485 }
10486 }
10488 If RANGE_EXPR is an array:
10489 BEGIN_EXPR = __range
10490 END_EXPR = __range + ARRAY_SIZE(__range)
10491 Else if RANGE_EXPR has a member 'begin' or 'end':
10492 BEGIN_EXPR = __range.begin()
10493 END_EXPR = __range.end()
10494 Else:
10495 BEGIN_EXPR = begin(__range)
10496 END_EXPR = end(__range);
10498 If __range has a member 'begin' but not 'end', or vice versa, we must
10499 still use the second alternative (it will surely fail, however).
10500 When calling begin()/end() in the third alternative we must use
10501 argument dependent lookup, but always considering 'std' as an associated
10502 namespace. */
10504 tree
10507 {
10513 /* If an error happened previously do nothing or else a lot of
10514 unhelpful errors would be issued. */
10516 else
10517 {
10518 tree range_temp;
10522 /* Can't bind a reference to an array of runtime bound. */
10524 else
10525 {
10530 LOOKUP_ONLYCONVERTING);
10532 }
10535 }
10537 /* The new for initialization statement. */
10545 LOOKUP_ONLYCONVERTING);
10554 LOOKUP_ONLYCONVERTING);
10558 /* The new for condition. */
10565 /* The new increment expression. */
10568 tf_warning_or_error);
10571 /* The declaration is initialized with *__begin inside the loop body. */
10574 tf_warning_or_error),
10576 LOOKUP_ONLYCONVERTING);
10579 }
10581 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10582 We need to solve both at the same time because the method used
10583 depends on the existence of members begin or end.
10584 Returns the type deduced for the iterator expression. */
10586 static tree
10588 {
10590 {
10593 }
10596 {
10601 }
10603 {
10604 /* If RANGE is an array, we will use pointer arithmetic. */
10607 range,
10611 }
10612 else
10613 {
10614 /* If it is not an array, we must do a bit of magic. */
10624 tf_warning_or_error);
10627 tf_warning_or_error);
10630 {
10631 /* Use the member functions. */
10634 else
10640 else
10643 }
10644 else
10645 {
10646 /* Use global functions with ADL. */
10653 tf_warning_or_error);
10655 tf_warning_or_error);
10657 tf_warning_or_error);
10659 tf_warning_or_error);
10662 }
10664 /* Last common checks. */
10666 {
10667 /* If one of the expressions is an error do no more checks. */
10670 }
10673 /* Can happen, when, eg, in a template context, Koenig lookup
10674 can't resolve begin/end (c++/58503). */
10676 else
10677 {
10679 /* The unqualified type of the __begin and __end temporaries should
10680 be the same, as required by the multiple auto declaration. */
10686 }
10687 }
10688 }
10690 /* Helper function for cp_parser_perform_range_for_lookup.
10691 Builds a tree for RANGE.IDENTIFIER(). */
10693 static tree
10695 {
10708 tf_warning_or_error);
10711 }
10713 /* Parse an iteration-statement.
10715 iteration-statement:
10716 while ( condition ) statement
10717 do statement while ( expression ) ;
10718 for ( for-init-statement condition [opt] ; expression [opt] )
10719 statement
10721 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10723 static tree
10725 {
10728 tree statement;
10731 /* Peek at the next token. */
10736 /* Remember whether or not we are already within an iteration
10737 statement. */
10740 /* See what kind of keyword it is. */
10743 {
10745 {
10746 tree condition;
10748 /* Begin the while-statement. */
10750 /* Look for the `('. */
10752 /* Parse the condition. */
10755 /* Look for the `)'. */
10757 /* Parse the dependent statement. */
10761 /* We're done with the while-statement. */
10763 }
10767 {
10768 tree expression;
10770 /* Begin the do-statement. */
10772 /* Parse the body of the do-statement. */
10777 /* Look for the `while' keyword. */
10779 /* Look for the `('. */
10781 /* Parse the expression. */
10783 /* We're done with the do-statement. */
10785 /* Look for the `)'. */
10787 /* Look for the `;'. */
10789 }
10793 {
10794 /* Look for the `('. */
10799 /* Look for the `)'. */
10802 /* Parse the body of the for-statement. */
10807 /* We're done with the for-statement. */
10809 }
10816 }
10819 }
10821 /* Parse a for-init-statement or the declarator of a range-based-for.
10822 Returns true if a range-based-for declaration is seen.
10824 for-init-statement:
10825 expression-statement
10826 simple-declaration */
10828 static bool
10830 {
10831 /* If the next token is a `;', then we have an empty
10832 expression-statement. Grammatically, this is also a
10833 simple-declaration, but an invalid one, because it does not
10834 declare anything. Therefore, if we did not handle this case
10835 specially, we would issue an error message about an invalid
10836 declaration. */
10838 {
10844 {
10845 /* N3994 -- for (id : init) ... */
10848 "type-specifier only available with "
10856 }
10858 /* A colon is used in range-based for. */
10861 /* We're going to speculatively look for a declaration, falling back
10862 to an expression, if necessary. */
10864 /* Parse the declaration. */
10867 decl);
10870 {
10871 /* It is a range-for, consume the ':' */
10875 {
10877 "range-based %<for%> loops only available with "
10880 }
10881 }
10882 else
10883 /* The ';' is not consumed yet because we told
10884 cp_parser_simple_declaration not to. */
10889 /* If the tentative parse failed, then we shall need to look for an
10890 expression-statement. */
10891 }
10892 /* If we are here, it is an expression-statement. */
10895 }
10897 /* Parse a jump-statement.
10899 jump-statement:
10900 break ;
10901 continue ;
10902 return expression [opt] ;
10903 return braced-init-list ;
10904 goto identifier ;
10906 GNU extension:
10908 jump-statement:
10909 goto * expression ;
10911 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10913 static tree
10915 {
10921 /* Peek at the next token. */
10926 /* See what kind of keyword it is. */
10929 {
10933 {
10953 }
10959 {
10966 /* Fall through. */
10976 }
10981 {
10982 tree expr;
10986 {
10990 }
10993 else
10994 /* If the next token is a `;', then there is no
10995 expression. */
10997 /* Build the return-statement. */
10999 /* Look for the final `;'. */
11001 }
11009 /* Create the goto-statement. */
11011 {
11012 /* Issue a warning about this use of a GNU extension. */
11014 /* Consume the '*' token. */
11016 /* Parse the dependent expression. */
11018 }
11019 else
11021 /* Look for the final `;'. */
11028 }
11031 }
11033 /* Parse a declaration-statement.
11035 declaration-statement:
11036 block-declaration */
11038 static void
11040 {
11043 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11046 /* Parse the block-declaration. */
11049 /* Free any declarators allocated. */
11051 }
11053 /* Some dependent statements (like `if (cond) statement'), are
11054 implicitly in their own scope. In other words, if the statement is
11055 a single statement (as opposed to a compound-statement), it is
11056 none-the-less treated as if it were enclosed in braces. Any
11057 declarations appearing in the dependent statement are out of scope
11058 after control passes that point. This function parses a statement,
11059 but ensures that is in its own scope, even if it is not a
11060 compound-statement.
11062 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11063 is a (possibly labeled) if statement which is not enclosed in
11064 braces and has an else clause. This is used to implement
11065 -Wparentheses.
11067 Returns the new statement. */
11069 static tree
11071 {
11072 tree statement;
11077 /* Mark if () ; with a special NOP_EXPR. */
11079 {
11083 }
11084 /* if a compound is opened, we simply parse the statement directly. */
11087 /* If the token is not a `{', then we must take special action. */
11088 else
11089 {
11090 /* Create a compound-statement. */
11092 /* Parse the dependent-statement. */
11094 /* Finish the dummy compound-statement. */
11096 }
11098 /* Return the statement. */
11100 }
11102 /* For some dependent statements (like `while (cond) statement'), we
11103 have already created a scope. Therefore, even if the dependent
11104 statement is a compound-statement, we do not want to create another
11105 scope. */
11107 static void
11109 {
11110 /* If the token is a `{', then we must take special action. */
11113 else
11114 {
11115 /* Avoid calling cp_parser_compound_statement, so that we
11116 don't create a new scope. Do everything else by hand. */
11118 /* If the next keyword is `__label__' we have a label declaration. */
11121 /* Parse an (optional) statement-seq. */
11124 }
11125 }
11127 /* Declarations [gram.dcl.dcl] */
11129 /* Parse an optional declaration-sequence.
11131 declaration-seq:
11132 declaration
11133 declaration-seq declaration */
11135 static void
11137 {
11139 {
11150 {
11151 /* A declaration consisting of a single semicolon is
11152 invalid. Allow it unless we're being pedantic. */
11157 }
11159 /* If we're entering or exiting a region that's implicitly
11160 extern "C", modify the lang context appropriately. */
11162 {
11165 }
11167 {
11170 }
11173 {
11174 /* A top-level declaration can consist solely of a #pragma.
11175 A nested declaration cannot, so this is done here and not
11176 in cp_parser_declaration. (A #pragma at block scope is
11177 handled in cp_parser_statement.) */
11180 }
11182 /* Parse the declaration itself. */
11184 }
11185 }
11187 /* Parse a declaration.
11189 declaration:
11190 block-declaration
11191 function-definition
11192 template-declaration
11193 explicit-instantiation
11194 explicit-specialization
11195 linkage-specification
11196 namespace-definition
11198 GNU extension:
11200 declaration:
11201 __extension__ declaration */
11203 static void
11205 {
11206 cp_token token1;
11207 cp_token token2;
11212 /* Check for the `__extension__' keyword. */
11214 {
11215 /* Parse the qualified declaration. */
11217 /* Restore the PEDANTIC flag. */
11221 }
11223 /* Try to figure out what kind of declaration is present. */
11228 else
11229 {
11232 }
11234 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11237 /* If the next token is `extern' and the following token is a string
11238 literal, then we have a linkage specification. */
11242 /* If the next token is `template', then we have either a template
11243 declaration, an explicit instantiation, or an explicit
11244 specialization. */
11246 {
11247 /* `template <>' indicates a template specialization. */
11251 /* `template <' indicates a template declaration. */
11254 /* Anything else must be an explicit instantiation. */
11255 else
11257 }
11258 /* If the next token is `export', then we have a template
11259 declaration. */
11262 /* If the next token is `extern', 'static' or 'inline' and the one
11263 after that is `template', we have a GNU extended explicit
11264 instantiation directive. */
11271 /* If the next token is `namespace', check for a named or unnamed
11272 namespace definition. */
11278 /* An unnamed namespace definition. */
11282 /* An inline (associated) namespace definition. */
11286 /* Objective-C++ declaration/definition. */
11293 /* We must have either a block declaration or a function
11294 definition. */
11295 else
11296 /* Try to parse a block-declaration, or a function-definition. */
11299 /* Free any declarators allocated. */
11301 }
11303 /* Parse a block-declaration.
11305 block-declaration:
11306 simple-declaration
11307 asm-definition
11308 namespace-alias-definition
11309 using-declaration
11310 using-directive
11312 GNU Extension:
11314 block-declaration:
11315 __extension__ block-declaration
11317 C++0x Extension:
11319 block-declaration:
11320 static_assert-declaration
11322 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11323 part of a declaration-statement. */
11325 static void
11328 {
11332 /* Check for the `__extension__' keyword. */
11334 {
11335 /* Parse the qualified declaration. */
11337 /* Restore the PEDANTIC flag. */
11341 }
11343 /* Peek at the next token to figure out which kind of declaration is
11344 present. */
11347 /* If the next keyword is `asm', we have an asm-definition. */
11349 {
11353 }
11354 /* If the next keyword is `namespace', we have a
11355 namespace-alias-definition. */
11358 /* If the next keyword is `using', we have a
11359 using-declaration, a using-directive, or an alias-declaration. */
11361 {
11366 /* If the token after `using' is `namespace', then we have a
11367 using-directive. */
11371 /* If the second token after 'using' is '=', then we have an
11372 alias-declaration. */
11378 /* Otherwise, it's a using-declaration. */
11379 else
11382 }
11383 /* If the next keyword is `__label__' we have a misplaced label
11384 declaration. */
11386 {
11390 /* If the next token is now a `;', consume it. */
11393 }
11394 /* If the next token is `static_assert' we have a static assertion. */
11397 /* Anything else must be a simple-declaration. */
11398 else
11401 }
11403 /* Parse a simple-declaration.
11405 simple-declaration:
11406 decl-specifier-seq [opt] init-declarator-list [opt] ;
11408 init-declarator-list:
11409 init-declarator
11410 init-declarator-list , init-declarator
11412 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11413 function-definition as a simple-declaration.
11415 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11416 parsed declaration if it is an uninitialized single declarator not followed
11417 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11418 if present, will not be consumed. */
11420 static void
11424 {
11425 cp_decl_specifier_seq decl_specifiers;
11432 /* Defer access checks until we know what is being declared; the
11433 checks for names appearing in the decl-specifier-seq should be
11434 done as if we were in the scope of the thing being declared. */
11437 /* Parse the decl-specifier-seq. We have to keep track of whether
11438 or not the decl-specifier-seq declares a named class or
11439 enumeration type, since that is the only case in which the
11440 init-declarator-list is allowed to be empty.
11442 [dcl.dcl]
11444 In a simple-declaration, the optional init-declarator-list can be
11445 omitted only when declaring a class or enumeration, that is when
11446 the decl-specifier-seq contains either a class-specifier, an
11447 elaborated-type-specifier, or an enum-specifier. */
11449 CP_PARSER_FLAGS_OPTIONAL,
11452 /* We no longer need to defer access checks. */
11455 /* In a block scope, a valid declaration must always have a
11456 decl-specifier-seq. By not trying to parse declarators, we can
11457 resolve the declaration/expression ambiguity more quickly. */
11460 {
11463 }
11465 /* If the next two tokens are both identifiers, the code is
11466 erroneous. The usual cause of this situation is code like:
11468 T t;
11470 where "T" should name a type -- but does not. */
11473 {
11474 /* If parsing tentatively, we should commit; we really are
11475 looking at a declaration. */
11477 /* Give up. */
11479 }
11481 /* If we have seen at least one decl-specifier, and the next token
11482 is not a parenthesis, then we must be looking at a declaration.
11483 (After "int (" we might be looking at a functional cast.) */
11490 /* Keep going until we hit the `;' at the end of the simple
11491 declaration. */
11494 CPP_SEMICOLON))
11495 {
11498 tree decl;
11501 {
11502 /* If we are processing next declarator, coma is expected */
11508 }
11509 else
11512 /* Parse the init-declarator. */
11515 function_definition_allowed_p,
11517 declares_class_or_enum,
11519 maybe_range_for_decl);
11520 /* If an error occurred while parsing tentatively, exit quickly.
11521 (That usually happens when in the body of a function; each
11522 statement is treated as a declaration-statement until proven
11523 otherwise.) */
11526 /* Handle function definitions specially. */
11528 {
11529 /* If the next token is a `,', then we are probably
11530 processing something like:
11532 void f() {}, *p;
11534 which is erroneous. */
11536 {
11539 "mixing"
11541 }
11542 /* Otherwise, we're done with the list of declarators. */
11543 else
11544 {
11547 }
11548 }
11551 /* The next token should be either a `,' or a `;'. */
11553 /* If it's a `,', there are more declarators to come. */
11556 /* If it's a `;', we are done. */
11559 /* Anything else is an error. */
11560 else
11561 {
11562 /* If we have already issued an error message we don't need
11563 to issue another one. */
11567 /* Skip tokens until we reach the end of the statement. */
11569 /* If the next token is now a `;', consume it. */
11573 }
11574 /* After the first time around, a function-definition is not
11575 allowed -- even if it was OK at first. For example:
11577 int i, f() {}
11579 is not valid. */
11581 }
11583 /* Issue an error message if no declarators are present, and the
11584 decl-specifier-seq does not itself declare a class or
11585 enumeration: [dcl.dcl]/3. */
11587 {
11589 {
11593 /* Ensure an error is issued anyway when finish_decltype_type,
11594 called via cp_parser_decl_specifier_seq, returns a class or
11595 an enumeration (c++/51786). */
11598 }
11599 /* Perform any deferred access checks. */
11601 }
11603 /* Consume the `;'. */
11607 done:
11609 }
11611 /* Parse a decl-specifier-seq.
11613 decl-specifier-seq:
11614 decl-specifier-seq [opt] decl-specifier
11615 decl-specifier attribute-specifier-seq [opt] (C++11)
11617 decl-specifier:
11618 storage-class-specifier
11619 type-specifier
11620 function-specifier
11621 friend
11622 typedef
11624 GNU Extension:
11626 decl-specifier:
11627 attributes
11629 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11631 The parser flags FLAGS is used to control type-specifier parsing.
11633 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11634 flags:
11636 1: one of the decl-specifiers is an elaborated-type-specifier
11637 (i.e., a type declaration)
11638 2: one of the decl-specifiers is an enum-specifier or a
11639 class-specifier (i.e., a type definition)
11641 */
11643 static void
11645 cp_parser_flags flags,
11648 {
11652 cp_decl_spec ds;
11654 /* Clear DECL_SPECS. */
11657 /* Assume no class or enumeration type is declared. */
11660 /* Keep reading specifiers until there are no more to read. */
11662 {
11667 /* Peek at the next token. */
11670 /* Save the first token of the decl spec list for error
11671 reporting. */
11674 /* Handle attributes. */
11676 {
11677 /* Parse the attributes. */
11680 /* In a sequence of declaration specifiers, c++11 attributes
11681 appertain to the type that precede them. In that case
11682 [dcl.spec]/1 says:
11684 The attribute-specifier-seq affects the type only for
11685 the declaration it appears in, not other declarations
11686 involving the same type.
11688 But for now let's force the user to position the
11689 attribute either at the beginning of the declaration or
11690 after the declarator-id, which would clearly mean that it
11691 applies to the declarator. */
11693 {
11695 /* The c++11 attribute is at the beginning of the
11696 declaration. It appertains to the entity being
11698 else
11699 {
11701 {
11702 /* This is an attribute following a
11703 class-specifier. */
11708 }
11709 else
11710 {
11711 decl_specs->std_attributes
11713 attrs);
11716 }
11718 }
11719 }
11721 decl_specs->attributes
11723 attrs);
11727 }
11728 /* Assume we will find a decl-specifier keyword. */
11730 /* If the next token is an appropriate keyword, we can simply
11731 add it to the list. */
11733 {
11734 /* decl-specifier:
11735 friend
11736 constexpr */
11739 {
11742 }
11743 else
11744 {
11746 /* Consume the token. */
11748 }
11756 /* function-specifier:
11757 inline
11758 virtual
11759 explicit */
11766 /* decl-specifier:
11767 typedef */
11770 /* Consume the token. */
11772 /* A constructor declarator cannot appear in a typedef. */
11774 /* The "typedef" keyword can only occur in a declaration; we
11775 may as well commit at this point. */
11782 /* storage-class-specifier:
11783 auto
11784 register
11785 static
11786 extern
11787 mutable
11789 GNU Extension:
11790 thread */
11793 {
11794 /* Consume the token. */
11797 /* Complain about `auto' as a storage specifier, if
11798 we're complaining about C++0x compatibility. */
11802 /* Set the storage class anyway. */
11804 token);
11805 }
11806 else
11807 /* C++0x auto type-specifier. */
11815 /* Consume the token. */
11818 token);
11821 /* Consume the token. */
11827 /* We did not yet find a decl-specifier yet. */
11830 }
11840 /* Constructors are a special case. The `S' in `S()' is not a
11841 decl-specifier; it is the beginning of the declarator. */
11842 constructor_p
11843 = (!found_decl_spec
11844 && constructor_possible_p
11845 && (cp_parser_constructor_declarator_p
11848 /* If we don't have a DECL_SPEC yet, then we must be looking at
11849 a type-specifier. */
11851 {
11854 tree type_spec;
11856 type_spec
11858 decl_specs,
11864 /* If this type-specifier referenced a user-defined type
11865 (a typedef, class-name, etc.), then we can't allow any
11866 more such type-specifiers henceforth.
11868 [dcl.spec]
11870 The longest sequence of decl-specifiers that could
11871 possibly be a type name is taken as the
11872 decl-specifier-seq of a declaration. The sequence shall
11873 be self-consistent as described below.
11875 [dcl.type]
11877 As a general rule, at most one type-specifier is allowed
11878 in the complete decl-specifier-seq of a declaration. The
11879 only exceptions are the following:
11881 -- const or volatile can be combined with any other
11882 type-specifier.
11884 -- signed or unsigned can be combined with char, long,
11885 short, or int.
11887 -- ..
11889 Example:
11891 typedef char* Pc;
11892 void g (const int Pc);
11894 Here, Pc is *not* part of the decl-specifier seq; it's
11895 the declarator. Therefore, once we see a type-specifier
11896 (other than a cv-qualifier), we forbid any additional
11897 user-defined types. We *do* still allow things like `int
11898 int' to be considered a decl-specifier-seq, and issue the
11899 error message later. */
11902 /* A constructor declarator cannot follow a type-specifier. */
11904 {
11909 }
11910 }
11912 /* If we still do not have a DECL_SPEC, then there are no more
11913 decl-specifiers. */
11918 /* After we see one decl-specifier, further decl-specifiers are
11919 always optional. */
11921 }
11923 /* Don't allow a friend specifier with a class definition. */
11928 }
11930 /* Parse an (optional) storage-class-specifier.
11932 storage-class-specifier:
11933 auto
11934 register
11935 static
11936 extern
11937 mutable
11939 GNU Extension:
11941 storage-class-specifier:
11942 thread
11944 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11946 static tree
11948 {
11950 {
11954 /* Fall through for C++98. */
11961 /* Consume the token. */
11966 }
11967 }
11969 /* Parse an (optional) function-specifier.
11971 function-specifier:
11972 inline
11973 virtual
11974 explicit
11976 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11977 Updates DECL_SPECS, if it is non-NULL. */
11979 static tree
11982 {
11985 {
11991 /* 14.5.2.3 [temp.mem]
11993 A member function template shall not be virtual. */
11996 else
12006 }
12008 /* Consume the token. */
12010 }
12012 /* Parse a linkage-specification.
12014 linkage-specification:
12015 extern string-literal { declaration-seq [opt] }
12016 extern string-literal declaration */
12018 static void
12020 {
12021 tree linkage;
12023 /* Look for the `extern' keyword. */
12026 /* Look for the string-literal. */
12029 /* Transform the literal into an identifier. If the literal is a
12030 wide-character string, or contains embedded NULs, then we can't
12031 handle it as the user wants. */
12034 {
12036 /* Assume C++ linkage. */
12038 }
12039 else
12042 /* We're now using the new linkage. */
12045 /* If the next token is a `{', then we're using the first
12046 production. */
12048 {
12051 /* Consume the `{' token. */
12053 /* Parse the declarations. */
12055 /* Look for the closing `}'. */
12057 }
12058 /* Otherwise, there's just one declaration. */
12059 else
12060 {
12063 saved_in_unbraced_linkage_specification_p
12067 parser->in_unbraced_linkage_specification_p
12069 }
12071 /* We're done with the linkage-specification. */
12073 }
12075 /* Parse a static_assert-declaration.
12077 static_assert-declaration:
12078 static_assert ( constant-expression , string-literal ) ;
12080 If MEMBER_P, this static_assert is a class member. */
12082 static void
12084 {
12085 tree condition;
12086 tree message;
12088 location_t saved_loc;
12091 /* Peek at the `static_assert' token so we can keep track of exactly
12092 where the static assertion started. */
12096 /* Look for the `static_assert' keyword. */
12098 RT_STATIC_ASSERT))
12101 /* We know we are in a static assertion; commit to any tentative
12102 parse. */
12106 /* Parse the `(' starting the static assertion condition. */
12109 /* Parse the constant-expression. Allow a non-constant expression
12110 here in order to give better diagnostics in finish_static_assert. */
12111 condition =
12116 /* Parse the separating `,'. */
12119 /* Parse the string-literal message. */
12124 /* A `)' completes the static assertion. */
12131 /* A semicolon terminates the declaration. */
12134 /* Complete the static assertion, which may mean either processing
12135 the static assert now or saving it for template instantiation. */
12137 }
12139 /* Parse the expression in decltype ( expression ). */
12141 static tree
12144 {
12146 tree expr;
12148 /* First, try parsing an id-expression. */
12159 {
12162 cp_id_kind idk;
12166 /* Lookup the name we got back from the id-expression. */
12177 {
12178 /* Complete lookup of the id-expression. */
12179 expr = (finish_id_expression
12192 /* We found an id-expression, but it was something that we
12193 should not have found. This is an error, not something
12194 we can recover from, so note that we found an
12195 id-expression and we'll recover as gracefully as
12196 possible. */
12198 }
12203 /* We have an id-expression. */
12205 }
12208 {
12209 /* Abort the id-expression parse. */
12212 /* Parsing tentatively, again. */
12215 /* Parse a class member access. */
12223 /* We have an id-expression. */
12225 }
12228 /* We have parsed the complete id-expression or member access. */
12230 else
12231 {
12232 /* Abort our attempt to parse an id-expression or member access
12233 expression. */
12236 /* Parse a full expression. */
12239 }
12242 }
12244 /* Parse a `decltype' type. Returns the type.
12246 simple-type-specifier:
12247 decltype ( expression )
12248 C++14 proposal:
12249 decltype ( auto ) */
12251 static tree
12253 {
12254 tree expr;
12263 {
12264 /* Already parsed. */
12267 }
12269 /* Look for the `decltype' token. */
12273 /* Parse the opening `('. */
12277 /* decltype (auto) */
12280 {
12287 }
12289 /* Types cannot be defined in a `decltype' expression. Save away the
12290 old message. */
12293 /* And create the new one. */
12294 parser->type_definition_forbidden_message
12297 /* The restrictions on constant-expressions do not apply inside
12298 decltype expressions. */
12299 saved_integral_constant_expression_p
12301 saved_non_integral_constant_expression_p
12305 /* Within a parenthesized expression, a `>' token is always
12306 the greater-than operator. */
12307 saved_greater_than_is_operator_p
12311 /* Do not actually evaluate the expression. */
12314 /* Do not warn about problems with the expression. */
12319 /* Go back to evaluating expressions. */
12323 /* The `>' token might be the end of a template-id or
12324 template-parameter-list now. */
12325 parser->greater_than_is_operator_p
12328 /* Restore the old message and the integral constant expression
12329 flags. */
12331 parser->integral_constant_expression_p
12333 parser->non_integral_constant_expression_p
12336 /* Parse to the closing `)'. */
12338 {
12342 }
12345 tf_warning_or_error);
12347 rewrite:
12348 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12349 it again. */
12356 }
12358 /* Special member functions [gram.special] */
12360 /* Parse a conversion-function-id.
12362 conversion-function-id:
12363 operator conversion-type-id
12365 Returns an IDENTIFIER_NODE representing the operator. */
12367 static tree
12369 {
12370 tree type;
12371 tree saved_scope;
12372 tree saved_qualifying_scope;
12373 tree saved_object_scope;
12376 /* Look for the `operator' token. */
12379 /* When we parse the conversion-type-id, the current scope will be
12380 reset. However, we need that information in able to look up the
12381 conversion function later, so we save it here. */
12385 /* We must enter the scope of the class so that the names of
12386 entities declared within the class are available in the
12387 conversion-type-id. For example, consider:
12389 struct S {
12390 typedef int I;
12391 operator I();
12392 };
12394 S::operator I() { ... }
12396 In order to see that `I' is a type-name in the definition, we
12397 must be in the scope of `S'. */
12400 /* Parse the conversion-type-id. */
12402 /* Leave the scope of the class, if any. */
12405 /* Restore the saved scope. */
12409 /* If the TYPE is invalid, indicate failure. */
12413 }
12415 /* Parse a conversion-type-id:
12417 conversion-type-id:
12418 type-specifier-seq conversion-declarator [opt]
12420 Returns the TYPE specified. */
12422 static tree
12424 {
12425 tree attributes;
12426 cp_decl_specifier_seq type_specifiers;
12428 tree type_specified;
12431 /* Parse the attributes. */
12435 parser->type_definition_forbidden_message
12438 /* Parse the type-specifiers. */
12445 /* If that didn't work, stop. */
12448 /* Parse the conversion-declarator. */
12456 /* Don't give this error when parsing tentatively. This happens to
12457 work because we always parse this definitively once. */
12460 {
12462 {
12465 }
12469 }
12472 }
12474 /* Parse an (optional) conversion-declarator.
12476 conversion-declarator:
12477 ptr-operator conversion-declarator [opt]
12479 */
12483 {
12486 cp_cv_quals cv_quals;
12488 /* We don't know if there's a ptr-operator next, or not. */
12490 /* Try the ptr-operator. */
12493 /* If it worked, look for more conversion-declarators. */
12495 {
12498 /* Parse another optional declarator. */
12501 declarator = cp_parser_make_indirect_declarator
12505 }
12508 }
12510 /* Parse an (optional) ctor-initializer.
12512 ctor-initializer:
12513 : mem-initializer-list
12515 Returns TRUE iff the ctor-initializer was actually present. */
12517 static bool
12519 {
12520 /* If the next token is not a `:', then there is no
12521 ctor-initializer. */
12523 {
12524 /* Do default initialization of any bases and members. */
12529 }
12531 /* Consume the `:' token. */
12533 /* And the mem-initializer-list. */
12537 }
12539 /* Parse a mem-initializer-list.
12541 mem-initializer-list:
12542 mem-initializer ... [opt]
12543 mem-initializer ... [opt] , mem-initializer-list */
12545 static void
12547 {
12552 /* Let the semantic analysis code know that we are starting the
12553 mem-initializer-list. */
12558 /* Loop through the list. */
12560 {
12561 tree mem_initializer;
12564 /* Parse the mem-initializer. */
12566 /* If the next token is a `...', we're expanding member initializers. */
12568 {
12569 /* Consume the `...'. */
12572 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12573 can be expanded but members cannot. */
12576 {
12581 }
12583 /* Construct the pack expansion type. */
12586 }
12589 {
12593 }
12594 /* Look for a target constructor. */
12598 {
12601 {
12605 }
12607 }
12608 /* Add it to the list, unless it was erroneous. */
12610 {
12613 }
12614 /* If the next token is not a `,', we're done. */
12617 /* Consume the `,' token. */
12619 }
12621 /* Perform semantic analysis. */
12624 }
12626 /* Parse a mem-initializer.
12628 mem-initializer:
12629 mem-initializer-id ( expression-list [opt] )
12630 mem-initializer-id braced-init-list
12632 GNU extension:
12634 mem-initializer:
12635 ( expression-list [opt] )
12637 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12638 class) or FIELD_DECL (for a non-static data member) to initialize;
12639 the TREE_VALUE is the expression-list. An empty initialization
12640 list is represented by void_list_node. */
12642 static tree
12644 {
12645 tree mem_initializer_id;
12646 tree expression_list;
12647 tree member;
12650 /* Find out what is being initialized. */
12652 {
12656 }
12657 else
12658 {
12662 }
12668 {
12675 }
12676 else
12677 {
12687 }
12697 }
12699 /* Parse a mem-initializer-id.
12701 mem-initializer-id:
12702 :: [opt] nested-name-specifier [opt] class-name
12703 identifier
12705 Returns a TYPE indicating the class to be initializer for the first
12706 production. Returns an IDENTIFIER_NODE indicating the data member
12707 to be initialized for the second production. */
12709 static tree
12711 {
12715 tree id;
12719 /* `typename' is not allowed in this context ([temp.res]). */
12721 {
12723 "keyword %<typename%> not allowed in this context (a qualified "
12726 }
12727 /* Look for the optional `::' operator. */
12728 global_scope_p
12732 /* Look for the optional nested-name-specifier. The simplest way to
12733 implement:
12735 [temp.res]
12737 The keyword `typename' is not permitted in a base-specifier or
12738 mem-initializer; in these contexts a qualified name that
12739 depends on a template-parameter is implicitly assumed to be a
12740 type name.
12742 is to assume that we have seen the `typename' keyword at this
12743 point. */
12744 nested_name_specifier_p
12753 /* If there is a `::' operator or a nested-name-specifier, then we
12754 are definitely looking for a class-name. */
12759 typename_type,
12763 /* Otherwise, we could also be looking for an ordinary identifier. */
12765 /* Try a class-name. */
12769 none_type,
12773 /* If we found one, we're done. */
12776 /* Otherwise, look for an ordinary identifier. */
12778 }
12780 /* Overloading [gram.over] */
12782 /* Parse an operator-function-id.
12784 operator-function-id:
12785 operator operator
12787 Returns an IDENTIFIER_NODE for the operator which is a
12788 human-readable spelling of the identifier, e.g., `operator +'. */
12790 static tree
12792 {
12793 /* Look for the `operator' keyword. */
12796 /* And then the name of the operator itself. */
12798 }
12800 /* Return an identifier node for a user-defined literal operator.
12801 The suffix identifier is chained to the operator name identifier. */
12803 static tree
12805 {
12806 tree identifier;
12813 }
12815 /* Parse an operator.
12817 operator:
12818 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12819 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12820 || ++ -- , ->* -> () []
12822 GNU Extensions:
12824 operator:
12825 <? >? <?= >?=
12827 Returns an IDENTIFIER_NODE for the operator which is a
12828 human-readable spelling of the identifier, e.g., `operator +'. */
12830 static tree
12832 {
12837 /* Peek at the next token. */
12839 /* Figure out which operator we have. */
12841 {
12843 {
12846 /* The keyword should be either `new' or `delete'. */
12851 else
12854 /* Consume the `new' or `delete' token. */
12857 /* Peek at the next token. */
12859 /* If it's a `[' token then this is the array variant of the
12860 operator. */
12862 {
12863 /* Consume the `[' token. */
12865 /* Look for the `]' token. */
12869 }
12870 /* Otherwise, we have the non-array variant. */
12871 else
12875 }
13022 /* Consume the `('. */
13024 /* Look for the matching `)'. */
13029 /* Consume the `['. */
13031 /* Look for the matching `]'. */
13046 {
13053 /* Consume the string. */
13059 {
13062 }
13063 else
13064 {
13066 /* Look for the suffix identifier. */
13071 {
13075 }
13076 else
13077 {
13080 }
13081 }
13086 {
13089 }
13092 {
13095 }
13097 {
13100 }
13102 }
13105 /* Anything else is an error. */
13107 }
13109 /* If we have selected an identifier, we need to consume the
13110 operator token. */
13113 /* Otherwise, no valid operator name was present. */
13114 else
13115 {
13118 }
13121 }
13123 /* Parse a template-declaration.
13125 template-declaration:
13126 export [opt] template < template-parameter-list > declaration
13128 If MEMBER_P is TRUE, this template-declaration occurs within a
13129 class-specifier.
13131 The grammar rule given by the standard isn't correct. What
13132 is really meant is:
13134 template-declaration:
13135 export [opt] template-parameter-list-seq
13136 decl-specifier-seq [opt] init-declarator [opt] ;
13137 export [opt] template-parameter-list-seq
13138 function-definition
13140 template-parameter-list-seq:
13141 template-parameter-list-seq [opt]
13142 template < template-parameter-list > */
13144 static void
13146 {
13147 /* Check for `export'. */
13149 {
13150 /* Consume the `export' token. */
13152 /* Warn that we do not support `export'. */
13154 }
13157 }
13159 /* Parse a template-parameter-list.
13161 template-parameter-list:
13162 template-parameter
13163 template-parameter-list , template-parameter
13165 Returns a TREE_LIST. Each node represents a template parameter.
13166 The nodes are connected via their TREE_CHAINs. */
13168 static tree
13170 {
13175 /* The loop below parses the template parms. We first need to know
13176 the total number of template parms to be able to compute proper
13177 canonical types of each dependent type. So after the loop, when
13178 we know the total number of template parms,
13179 end_template_parm_list computes the proper canonical types and
13180 fixes up the dependent types accordingly. */
13182 {
13183 tree parameter;
13186 location_t parm_loc;
13188 /* Parse the template-parameter. */
13193 /* Add it to the list. */
13196 parm_loc,
13197 parameter,
13198 is_non_type,
13199 is_parameter_pack);
13200 else
13201 {
13204 }
13206 /* If the next token is not a `,', we're done. */
13209 /* Otherwise, consume the `,' token. */
13211 }
13214 }
13216 /* Parse a template-parameter.
13218 template-parameter:
13219 type-parameter
13220 parameter-declaration
13222 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13223 the parameter. The TREE_PURPOSE is the default value, if any.
13224 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13225 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13226 set to true iff this parameter is a parameter pack. */
13228 static tree
13231 {
13235 tree parm;
13237 /* Assume it is a type parameter or a template parameter. */
13239 /* Assume it not a parameter pack. */
13241 /* Peek at the next token. */
13243 /* If it is `class' or `template', we have a type-parameter. */
13246 /* If it is `class' or `typename' we do not know yet whether it is a
13247 type parameter or a non-type parameter. Consider:
13249 template <typename T, typename T::X X> ...
13251 or:
13253 template <class C, class D*> ...
13255 Here, the first parameter is a type parameter, and the second is
13256 a non-type parameter. We can tell by looking at the token after
13257 the identifier -- if it is a `,', `=', or `>' then we have a type
13258 parameter. */
13260 {
13261 /* Peek at the token after `class' or `typename'. */
13263 /* If it's an ellipsis, we have a template type parameter
13264 pack. */
13267 /* If it's an identifier, skip it. */
13270 /* Now, see if the token looks like the end of a template
13271 parameter. */
13276 }
13278 /* Otherwise, it is a non-type parameter.
13280 [temp.param]
13282 When parsing a default template-argument for a non-type
13283 template-parameter, the first non-nested `>' is taken as the end
13284 of the template parameter-list rather than a greater-than
13285 operator. */
13287 parameter_declarator
13294 /* If the parameter declaration is marked as a parameter pack, set
13295 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13296 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13297 grokdeclarator. */
13300 {
13303 }
13306 {
13307 /* Can happen in some cases of erroneous input (c++/34892). */
13309 /* Consume the `...' for better error recovery. */
13311 }
13312 /* If the next token is an ellipsis, and we don't already have it
13313 marked as a parameter pack, then we have a parameter pack (that
13314 has no declarator). */
13317 && (declarator_can_be_parameter_pack
13319 {
13320 /* Consume the `...'. */
13325 }
13326 /* We might end up with a pack expansion as the type of the non-type
13327 template parameter, in which case this is a non-type template
13328 parameter pack. */
13331 {
13335 }
13338 {
13339 /* Parameter packs cannot have default arguments. However, a
13340 user may try to do so, so we'll parse them and give an
13341 appropriate diagnostic here. */
13345 /* Find the name of the parameter pack. */
13354 else
13358 /* Parse the default argument, but throw away the result. */
13360 }
13370 }
13372 /* Parse a type-parameter.
13374 type-parameter:
13375 class identifier [opt]
13376 class identifier [opt] = type-id
13377 typename identifier [opt]
13378 typename identifier [opt] = type-id
13379 template < template-parameter-list > class identifier [opt]
13380 template < template-parameter-list > class identifier [opt]
13381 = id-expression
13383 GNU Extension (variadic templates):
13385 type-parameter:
13386 class ... identifier [opt]
13387 typename ... identifier [opt]
13389 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13390 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13391 the declaration of the parameter.
13393 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13395 static tree
13397 {
13399 tree parameter;
13401 /* Look for a keyword to tell us what kind of parameter this is. */
13407 {
13410 {
13411 tree identifier;
13412 tree default_argument;
13414 /* If the next token is an ellipsis, we have a template
13415 argument pack. */
13417 {
13418 /* Consume the `...' token. */
13423 }
13425 /* If the next token is an identifier, then it names the
13426 parameter. */
13429 else
13432 /* Create the parameter. */
13435 /* If the next token is an `=', we have a default argument. */
13437 {
13438 /* Consume the `=' token. */
13440 /* Parse the default-argument. */
13444 /* Template parameter packs cannot have default
13445 arguments. */
13447 {
13450 "template parameter pack %qD cannot have a "
13452 else
13454 "template parameter packs cannot have "
13457 }
13459 }
13460 else
13463 /* Create the combined representation of the parameter and the
13464 default argument. */
13466 }
13470 {
13471 tree identifier;
13472 tree default_argument;
13474 /* Look for the `<'. */
13476 /* Parse the template-parameter-list. */
13478 /* Look for the `>'. */
13480 /* Look for the `class' or 'typename' keywords. */
13482 /* If the next token is an ellipsis, we have a template
13483 argument pack. */
13485 {
13486 /* Consume the `...' token. */
13491 }
13492 /* If the next token is an `=', then there is a
13493 default-argument. If the next token is a `>', we are at
13494 the end of the parameter-list. If the next token is a `,',
13495 then we are at the end of this parameter. */
13499 {
13501 /* Treat invalid names as if the parameter were nameless. */
13504 }
13505 else
13508 /* Create the template parameter. */
13510 identifier);
13512 /* If the next token is an `=', then there is a
13513 default-argument. */
13515 {
13518 /* Consume the `='. */
13520 /* Parse the id-expression. */
13522 /* save token before parsing the id-expression, for error
13523 reporting */
13525 default_argument
13533 /* If the id-expression was a template-id that refers to
13534 a template-class, we already have the declaration here,
13535 so no further lookup is needed. */
13536 ;
13537 else
13538 /* Look up the name. */
13539 default_argument
13541 none_type,
13547 /* See if the default argument is valid. */
13548 default_argument
13551 /* Template parameter packs cannot have default
13552 arguments. */
13554 {
13557 "template parameter pack %qD cannot "
13559 identifier);
13560 else
13564 }
13566 }
13567 else
13570 /* Create the combined representation of the parameter and the
13571 default argument. */
13573 }
13579 }
13582 }
13584 /* Parse a template-id.
13586 template-id:
13587 template-name < template-argument-list [opt] >
13589 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13590 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13591 returned. Otherwise, if the template-name names a function, or set
13592 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13593 names a class, returns a TYPE_DECL for the specialization.
13595 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13596 uninstantiated templates. */
13598 static tree
13604 {
13606 tree templ;
13607 tree arguments;
13608 tree template_id;
13615 /* If the next token corresponds to a template-id, there is no need
13616 to reparse it. */
13619 {
13622 /* Get the stored value. */
13624 /* Perform any access checks that were deferred. */
13627 {
13632 tf_warning_or_error);
13633 }
13634 /* Return the stored value. */
13636 }
13638 /* Avoid performing name lookup if there is no possibility of
13639 finding a template-id. */
13642 && !cp_parser_nth_token_starts_template_argument_list_p
13644 {
13647 }
13649 /* Remember where the template-id starts. */
13655 /* Parse the template-name. */
13658 check_dependency_p,
13659 is_declaration,
13660 tag_type,
13663 {
13666 }
13668 /* If we find the sequence `[:' after a template-name, it's probably
13669 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13670 parse correctly the argument list. */
13677 {
13679 /* Change `:' into `::'. */
13681 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13682 CPP_LESS. */
13685 /* Parse the arguments. */
13688 {
13689 /* If we couldn't parse an argument list, then we revert our changes
13690 and return simply an error. Maybe this is not a template-id
13691 after all. */
13696 }
13697 /* Otherwise, emit an error about the invalid digraph, but continue
13698 parsing because we got our argument list. */
13701 {
13704 "%<<:%> is an alternate spelling for %<[%>."
13707 {
13709 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13712 }
13713 }
13714 }
13715 else
13716 {
13717 /* Look for the `<' that starts the template-argument-list. */
13719 {
13722 }
13723 /* Parse the arguments. */
13725 }
13727 /* Build a representation of the specialization. */
13730 TEMPLATE_ID_EXPR,
13734 {
13736 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13737 template (rather than some instantiation thereof) only if
13738 is not nested within some other construct. For example, in
13739 "template <typename T> void f(T) { A<T>::", A<T> is just an
13740 instantiation of A. */
13743 CPP_SCOPE));
13744 template_id
13746 }
13748 {
13750 }
13751 else
13752 {
13753 /* If it's not a class-template or a template-template, it should be
13754 a function-template. */
13760 }
13762 /* If parsing tentatively, replace the sequence of tokens that makes
13763 up the template-id with a CPP_TEMPLATE_ID token. That way,
13764 should we re-parse the token stream, we will not have to repeat
13765 the effort required to do the parse, nor will we issue duplicate
13766 error messages about problems during instantiation of the
13767 template. */
13769 /* Don't do this if we had a parse error in a declarator; re-parsing
13770 might succeed if a name changes meaning (60361). */
13774 {
13777 /* Reset the contents of the START_OF_ID token. */
13779 /* Retrieve any deferred checks. Do not pop this access checks yet
13780 so the memory will not be reclaimed during token replacing below. */
13786 /* Purge all subsequent tokens. */
13789 /* ??? Can we actually assume that, if template_id ==
13790 error_mark_node, we will have issued a diagnostic to the
13791 user, as opposed to simply marking the tentative parse as
13792 failed? */
13795 }
13799 }
13801 /* Parse a template-name.
13803 template-name:
13804 identifier
13806 The standard should actually say:
13808 template-name:
13809 identifier
13810 operator-function-id
13812 A defect report has been filed about this issue.
13814 A conversion-function-id cannot be a template name because they cannot
13815 be part of a template-id. In fact, looking at this code:
13817 a.operator K<int>()
13819 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13820 It is impossible to call a templated conversion-function-id with an
13821 explicit argument list, since the only allowed template parameter is
13822 the type to which it is converting.
13824 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13825 `template' keyword, in a construction like:
13827 T::template f<3>()
13829 In that case `f' is taken to be a template-name, even though there
13830 is no way of knowing for sure.
13832 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13833 name refers to a set of overloaded functions, at least one of which
13834 is a template, or an IDENTIFIER_NODE with the name of the template,
13835 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13836 names are looked up inside uninstantiated templates. */
13838 static tree
13845 {
13846 tree identifier;
13847 tree decl;
13848 tree fns;
13851 /* If the next token is `operator', then we have either an
13852 operator-function-id or a conversion-function-id. */
13854 {
13855 /* We don't know whether we're looking at an
13856 operator-function-id or a conversion-function-id. */
13858 /* Try an operator-function-id. */
13860 /* If that didn't work, try a conversion-function-id. */
13862 {
13865 }
13866 }
13867 /* Look for the identifier. */
13868 else
13871 /* If we didn't find an identifier, we don't have a template-id. */
13875 /* If the name immediately followed the `template' keyword, then it
13876 is a template-name. However, if the next token is not `<', then
13877 we do not treat it as a template-name, since it is not being used
13878 as part of a template-id. This enables us to handle constructs
13879 like:
13881 template <typename T> struct S { S(); };
13882 template <typename T> S<T>::S();
13884 correctly. We would treat `S' as a template -- if it were `S<T>'
13885 -- but we do not if there is no `<'. */
13889 {
13890 /* In a declaration, in a dependent context, we pretend that the
13891 "template" keyword was present in order to improve error
13892 recovery. For example, given:
13894 template <typename T> void f(T::X<int>);
13896 we want to treat "X<int>" as a template-id. */
13898 && !template_keyword_p
13900 && check_dependency_p
13902 /* Do not do this for dtors (or ctors), since they never
13903 need the template keyword before their name. */
13905 {
13908 /* Explain what went wrong. */
13910 identifier);
13913 /* If parsing tentatively, find the location of the "<" token. */
13916 /* Parse the template arguments so that we can issue error
13917 messages about them. */
13920 /* Skip tokens until we find a good place from which to
13921 continue parsing. */
13926 /* If parsing tentatively, permanently remove the
13927 template argument list. That will prevent duplicate
13928 error messages from being issued about the missing
13929 "template" keyword. */
13935 }
13937 /* If the "template" keyword is present, then there is generally
13938 no point in doing name-lookup, so we just return IDENTIFIER.
13939 But, if the qualifying scope is non-dependent then we can
13940 (and must) do name-lookup normally. */
13946 }
13948 /* Look up the name. */
13950 tag_type,
13953 check_dependency_p,
13957 /* If DECL is a template, then the name was a template-name. */
13959 ;
13960 else
13961 {
13964 /* The standard does not explicitly indicate whether a name that
13965 names a set of overloaded declarations, some of which are
13966 templates, is a template-name. However, such a name should
13967 be a template-name; otherwise, there is no way to form a
13968 template-id for the overloaded templates. */
13976 {
13977 /* The name does not name a template. */
13980 }
13981 }
13983 /* If DECL is dependent, and refers to a function, then just return
13984 its name; we will look it up again during template instantiation. */
13986 {
13990 }
13993 }
13995 /* Parse a template-argument-list.
13997 template-argument-list:
13998 template-argument ... [opt]
13999 template-argument-list , template-argument ... [opt]
14001 Returns a TREE_VEC containing the arguments. */
14003 static tree
14005 {
14010 tree vec;
14017 /* Even if the template-id appears in an integral
14018 constant-expression, the contents of the argument list do
14019 not. */
14025 /* Parse the arguments. */
14026 do
14027 {
14028 tree argument;
14031 /* Consume the comma. */
14034 /* Parse the template-argument. */
14037 /* If the next token is an ellipsis, we're expanding a template
14038 argument pack. */
14040 {
14042 {
14046 }
14047 /* Consume the `...' token. */
14050 /* Make the argument into a TYPE_PACK_EXPANSION or
14051 EXPR_PACK_EXPANSION. */
14053 }
14056 {
14060 {
14063 }
14064 else
14066 }
14068 }
14081 #ifdef ENABLE_CHECKING
14083 #endif
14085 }
14087 /* Parse a template-argument.
14089 template-argument:
14090 assignment-expression
14091 type-id
14092 id-expression
14094 The representation is that of an assignment-expression, type-id, or
14095 id-expression -- except that the qualified id-expression is
14096 evaluated, so that the value returned is either a DECL or an
14097 OVERLOAD.
14099 Although the standard says "assignment-expression", it forbids
14100 throw-expressions or assignments in the template argument.
14101 Therefore, we use "conditional-expression" instead. */
14103 static tree
14105 {
14106 tree argument;
14112 cp_id_kind idk;
14114 /* There's really no way to know what we're looking at, so we just
14115 try each alternative in order.
14117 [temp.arg]
14119 In a template-argument, an ambiguity between a type-id and an
14120 expression is resolved to a type-id, regardless of the form of
14121 the corresponding template-parameter.
14123 Therefore, we try a type-id first. */
14126 /* If there was no error parsing the type-id but the next token is a
14127 '>>', our behavior depends on which dialect of C++ we're
14128 parsing. In C++98, we probably found a typo for '> >'. But there
14129 are type-id which are also valid expressions. For instance:
14131 struct X { int operator >> (int); };
14132 template <int V> struct Foo {};
14133 Foo<X () >> 5> r;
14135 Here 'X()' is a valid type-id of a function type, but the user just
14136 wanted to write the expression "X() >> 5". Thus, we remember that we
14137 found a valid type-id, but we still try to parse the argument as an
14138 expression to see what happens.
14140 In C++0x, the '>>' will be considered two separate '>'
14141 tokens. */
14145 {
14148 }
14149 else
14150 {
14151 /* If the next token isn't a `,' or a `>', then this argument wasn't
14152 really finished. This means that the argument is not a valid
14153 type-id. */
14156 /* If that worked, we're done. */
14159 }
14160 /* We're still not sure what the argument will be. */
14162 /* Try a template. */
14170 /* If the next token isn't a `,' or a `>', then this argument wasn't
14171 really finished. */
14175 {
14176 /* Figure out what is being referred to. If the id-expression
14177 was for a class template specialization, then we will have a
14178 TYPE_DECL at this point. There is no need to do name lookup
14179 at this point in that case. */
14182 none_type,
14191 }
14194 /* It must be a non-type argument. There permitted cases are given
14195 in [temp.arg.nontype]:
14197 -- an integral constant-expression of integral or enumeration
14198 type; or
14200 -- the name of a non-type template-parameter; or
14202 -- the name of an object or function with external linkage...
14204 -- the address of an object or function with external linkage...
14206 -- a pointer to member... */
14207 /* Look for a non-type template parameter. */
14209 {
14221 }
14223 /* If the next token is "&", the argument must be the address of an
14224 object or function with external linkage. */
14227 {
14230 }
14231 /* See if we might have an id-expression. */
14238 {
14241 address_p,
14248 else
14249 {
14250 tree probe;
14253 {
14254 /* Strip the dereference temporarily. */
14257 }
14259 /* If we're in a template, we represent a qualified-id referring
14260 to a static data member as a SCOPE_REF even if the scope isn't
14261 dependent so that we can check access control later. */
14266 {
14267 /* A variable without external linkage might still be a
14268 valid constant-expression, so no error is issued here
14269 if the external-linkage check fails. */
14272 }
14274 /* All overloaded functions are allowed; if the external
14275 linkage test does not pass, an error will be issued
14276 later. */
14277 ;
14281 /* A pointer-to-member. */
14282 ;
14284 ;
14285 else
14289 {
14292 tf_warning_or_error);
14293 else
14296 }
14297 }
14298 }
14299 /* If the argument started with "&", there are no other valid
14300 alternatives at this point. */
14302 {
14305 }
14307 /* If the argument wasn't successfully parsed as a type-id followed
14308 by '>>', the argument can only be a constant expression now.
14309 Otherwise, we try parsing the constant-expression tentatively,
14310 because the argument could really be a type-id. */
14321 /* We did our best to parse the argument as a non type-id, but that
14322 was the only alternative that matched (albeit with a '>' after
14323 it). We can assume it's just a typo from the user, and a
14324 diagnostic will then be issued. */
14326 }
14328 /* Parse an explicit-instantiation.
14330 explicit-instantiation:
14331 template declaration
14333 Although the standard says `declaration', what it really means is:
14335 explicit-instantiation:
14336 template decl-specifier-seq [opt] declarator [opt] ;
14338 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14339 supposed to be allowed. A defect report has been filed about this
14340 issue.
14342 GNU Extension:
14344 explicit-instantiation:
14345 storage-class-specifier template
14346 decl-specifier-seq [opt] declarator [opt] ;
14347 function-specifier template
14348 decl-specifier-seq [opt] declarator [opt] ; */
14350 static void
14352 {
14354 cp_decl_specifier_seq decl_specifiers;
14359 /* Look for an (optional) storage-class-specifier or
14360 function-specifier. */
14362 {
14363 extension_specifier
14366 extension_specifier
14369 }
14371 /* Look for the `template' keyword. */
14373 /* Let the front end know that we are processing an explicit
14374 instantiation. */
14376 /* [temp.explicit] says that we are supposed to ignore access
14377 control while processing explicit instantiation directives. */
14379 /* Parse a decl-specifier-seq. */
14381 CP_PARSER_FLAGS_OPTIONAL,
14384 /* If there was exactly one decl-specifier, and it declared a class,
14385 and there's no declarator, then we have an explicit type
14386 instantiation. */
14388 {
14389 tree type;
14393 /* Turn access control back on for names used during
14394 template instantiation. */
14399 }
14400 else
14401 {
14403 tree decl;
14405 /* Parse the declarator. */
14406 declarator
14417 {
14420 "explicit instantiation shall not use"
14424 "explicit instantiation shall not use"
14429 /* Turn access control back on for names used during
14430 template instantiation. */
14432 /* Do the explicit instantiation. */
14434 }
14435 else
14436 {
14438 /* Skip the body of the explicit instantiation. */
14440 }
14441 }
14442 /* We're done with the instantiation. */
14448 }
14450 /* Parse an explicit-specialization.
14452 explicit-specialization:
14453 template < > declaration
14455 Although the standard says `declaration', what it really means is:
14457 explicit-specialization:
14458 template <> decl-specifier [opt] init-declarator [opt] ;
14459 template <> function-definition
14460 template <> explicit-specialization
14461 template <> template-declaration */
14463 static void
14465 {
14469 /* Look for the `template' keyword. */
14471 /* Look for the `<'. */
14473 /* Look for the `>'. */
14475 /* We have processed another parameter list. */
14477 /* [temp]
14479 A template ... explicit specialization ... shall not have C
14480 linkage. */
14482 {
14484 /* Give it C++ linkage to avoid confusing other parts of the
14485 front end. */
14488 }
14489 else
14491 /* Let the front end know that we are beginning a specialization. */
14493 {
14496 }
14498 /* If the next keyword is `template', we need to figure out whether
14499 or not we're looking a template-declaration. */
14501 {
14506 else
14508 }
14509 else
14510 /* Parse the dependent declaration. */
14516 /* We're done with the specialization. */
14518 /* For the erroneous case of a template with C linkage, we pushed an
14519 implicit C++ linkage scope; exit that scope now. */
14522 /* We're done with this parameter list. */
14524 }
14526 /* Parse a type-specifier.
14528 type-specifier:
14529 simple-type-specifier
14530 class-specifier
14531 enum-specifier
14532 elaborated-type-specifier
14533 cv-qualifier
14535 GNU Extension:
14537 type-specifier:
14538 __complex__
14540 Returns a representation of the type-specifier. For a
14541 class-specifier, enum-specifier, or elaborated-type-specifier, a
14542 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14544 The parser flags FLAGS is used to control type-specifier parsing.
14546 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14547 in a decl-specifier-seq.
14549 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14550 class-specifier, enum-specifier, or elaborated-type-specifier, then
14551 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14552 if a type is declared; 2 if it is defined. Otherwise, it is set to
14553 zero.
14555 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14556 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14557 is set to FALSE. */
14559 static tree
14561 cp_parser_flags flags,
14566 {
14572 /* Assume this type-specifier does not declare a new type. */
14575 /* And that it does not specify a cv-qualifier. */
14578 /* Peek at the next token. */
14581 /* If we're looking at a keyword, we can use that to guide the
14582 production we choose. */
14585 {
14590 /* Look for the enum-specifier. */
14592 /* If that worked, we're done. */
14594 {
14599 type_spec,
14600 token,
14603 }
14604 else
14607 /* Any of these indicate either a class-specifier, or an
14608 elaborated-type-specifier. */
14615 /* Parse tentatively so that we can back up if we don't find a
14616 class-specifier. */
14618 /* Look for the class-specifier. */
14621 /* If that worked, we're done. */
14623 {
14628 type_spec,
14629 token,
14632 }
14634 /* Fall through. */
14635 elaborated_type_specifier:
14636 /* We're declaring (not defining) a class or enum. */
14640 /* Fall through. */
14642 /* Look for an elaborated-type-specifier. */
14643 type_spec
14644 = (cp_parser_elaborated_type_specifier
14647 is_declaration));
14650 type_spec,
14651 token,
14674 /* The `__complex__' keyword is a GNU extension. */
14680 }
14682 /* Handle simple keywords. */
14684 {
14686 {
14689 }
14691 }
14693 /* If we do not already have a type-specifier, assume we are looking
14694 at a simple-type-specifier. */
14696 decl_specs,
14697 flags);
14699 /* If we didn't find a type-specifier, and a type-specifier was not
14700 optional in this context, issue an error message. */
14702 {
14705 }
14708 }
14710 /* Parse a simple-type-specifier.
14712 simple-type-specifier:
14713 :: [opt] nested-name-specifier [opt] type-name
14714 :: [opt] nested-name-specifier template template-id
14715 char
14716 wchar_t
14717 bool
14718 short
14719 int
14720 long
14721 signed
14722 unsigned
14723 float
14724 double
14725 void
14727 C++0x Extension:
14729 simple-type-specifier:
14730 auto
14731 decltype ( expression )
14732 char16_t
14733 char32_t
14734 __underlying_type ( type-id )
14736 GNU Extension:
14738 simple-type-specifier:
14739 __int128
14740 __typeof__ unary-expression
14741 __typeof__ ( type-id )
14742 __typeof__ ( type-id ) { initializer-list , [opt] }
14744 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14745 appropriately updated. */
14747 static tree
14750 cp_parser_flags flags)
14751 {
14756 /* Peek at the next token. */
14759 /* If we're looking at a keyword, things are easy. */
14761 {
14796 {
14799 }
14828 {
14832 {
14835 "use of %<auto%> in lambda parameter declaration "
14836 "only available with "
14838 }
14841 "use of %<auto%> in parameter declaration "
14842 "only available with "
14844 else
14846 "ISO C++ forbids use of %<auto%> in parameter "
14848 }
14849 else
14854 /* Since DR 743, decltype can either be a simple-type-specifier by
14855 itself or begin a nested-name-specifier. Parsing it will replace
14856 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14857 handling below decide what to do. */
14863 /* Consume the `typeof' token. */
14865 /* Parse the operand to `typeof'. */
14867 /* If it is not already a TYPE, take its type. */
14873 token,
14882 token,
14892 token,
14897 }
14899 /* If token is an already-parsed decltype not followed by ::,
14900 it's a simple-type-specifier. */
14903 {
14906 {
14908 token,
14910 /* Remember that we are handling a decltype in order to
14911 implement the resolution of DR 1510 when the argument
14912 isn't instantiation dependent. */
14914 }
14917 }
14919 /* If the type-specifier was for a built-in type, we're done. */
14921 {
14922 /* Record the type. */
14929 type,
14930 token,
14935 /* Consume the token. */
14938 /* There is no valid C++ program where a non-template type is
14939 followed by a "<". That usually indicates that the user thought
14940 that the type was a template. */
14945 }
14947 /* The type-specifier must be a user-defined type. */
14949 {
14953 /* Don't gobble tokens or issue error messages if this is an
14954 optional type-specifier. */
14958 /* Look for the optional `::' operator. */
14959 global_p
14963 /* Look for the nested-name specifier. */
14964 qualified_p
14972 /* If we have seen a nested-name-specifier, and the next token
14973 is `template', then we are using the template-id production. */
14976 {
14977 /* Look for the template-id. */
14981 none_type,
14983 /* If the template-id did not name a type, we are out of
14984 luck. */
14986 {
14989 }
14990 }
14991 /* Otherwise, look for a type-name. */
14992 else
14994 /* Keep track of all name-lookups performed in class scopes. */
14996 && !global_p
14997 && !qualified_p
15001 /* If it didn't work out, we don't have a TYPE. */
15007 token,
15009 }
15011 /* If we didn't get a type-name, issue an error message. */
15013 {
15016 }
15019 {
15020 /* See if TYPE is an Objective-C type, and if so, parse and
15021 accept any protocol references following it. Do this before
15022 the cp_parser_check_for_invalid_template_id() call, because
15023 Objective-C types can be followed by '<...>' which would
15024 enclose protocol names rather than template arguments, and so
15025 everything is fine. */
15028 {
15032 /* Clobber the "unqualified" type previously entered into
15033 DECL_SPECS with the new, improved protocol-qualified version. */
15038 }
15040 /* There is no valid C++ program where a non-template type is
15041 followed by a "<". That usually indicates that the user
15042 thought that the type was a template. */
15044 none_type,
15046 }
15049 }
15051 /* Parse a type-name.
15053 type-name:
15054 class-name
15055 enum-name
15056 typedef-name
15057 simple-template-id [in c++0x]
15059 enum-name:
15060 identifier
15062 typedef-name:
15063 identifier
15065 Returns a TYPE_DECL for the type. */
15067 static tree
15069 {
15070 tree type_decl;
15072 /* We can't know yet whether it is a class-name or not. */
15074 /* Try a class-name. */
15078 none_type,
15082 /* If it's not a class-name, keep looking. */
15084 {
15086 /* It must be a typedef-name or an enum-name. */
15090 /* It is either a simple-template-id representing an
15091 instantiation of an alias template... */
15095 none_type,
15097 /* Note that this must be an instantiation of an alias template
15098 because [temp.names]/6 says:
15100 A template-id that names an alias template specialization
15101 is a type-name.
15103 Whereas [temp.names]/7 says:
15105 A simple-template-id that names a class template
15106 specialization is a class-name. */
15111 else
15115 /* ... Or a typedef-name or an enum-name. */
15117 }
15120 }
15122 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15124 enum-name:
15125 identifier
15127 typedef-name:
15128 identifier
15130 Returns a TYPE_DECL for the type. */
15132 static tree
15134 {
15135 tree type_decl;
15136 tree identifier;
15143 /* Look up the type-name. */
15150 {
15151 /* See if this is an Objective-C type. */
15156 }
15158 /* Issue an error if we did not find a type-name. */
15160 /* In Objective-C, we have the complication that class names are
15161 normally type names and start declarations (eg, the
15162 "NSObject" in "NSObject *object;"), but can be used in an
15163 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15164 is an expression. So, a classname followed by a dot is not a
15165 valid type-name. */
15168 {
15173 }
15174 /* Remember that the name was used in the definition of the
15175 current class so that we can check later to see if the
15176 meaning would have been different after the class was
15177 entirely defined. */
15183 }
15185 /* Parse an elaborated-type-specifier. Note that the grammar given
15186 here incorporates the resolution to DR68.
15188 elaborated-type-specifier:
15189 class-key :: [opt] nested-name-specifier [opt] identifier
15190 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15191 enum-key :: [opt] nested-name-specifier [opt] identifier
15192 typename :: [opt] nested-name-specifier identifier
15193 typename :: [opt] nested-name-specifier template [opt]
15194 template-id
15196 GNU extension:
15198 elaborated-type-specifier:
15199 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15200 class-key attributes :: [opt] nested-name-specifier [opt]
15201 template [opt] template-id
15202 enum attributes :: [opt] nested-name-specifier [opt] identifier
15204 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15205 declared `friend'. If IS_DECLARATION is TRUE, then this
15206 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15207 something is being declared.
15209 Returns the TYPE specified. */
15211 static tree
15215 {
15217 tree identifier;
15220 tree globalscope;
15223 /* See if we're looking at the `enum' keyword. */
15225 {
15226 /* Consume the `enum' token. */
15228 /* Remember that it's an enumeration type. */
15230 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15231 enums) is used here. */
15234 {
15238 /* Consume the `struct' or `class' and parse it anyway. */
15240 }
15241 /* Parse the attributes. */
15243 }
15244 /* Or, it might be `typename'. */
15246 RID_TYPENAME))
15247 {
15248 /* Consume the `typename' token. */
15250 /* Remember that it's a `typename' type. */
15252 }
15253 /* Otherwise it must be a class-key. */
15254 else
15255 {
15259 /* Parse the attributes. */
15261 }
15263 /* Look for the `::' operator. */
15266 /* Look for the nested-name-specifier. */
15268 {
15273 is_declaration))
15275 }
15276 else
15277 /* Even though `typename' is not present, the proposed resolution
15278 to Core Issue 180 says that in `class A<T>::B', `B' should be
15279 considered a type-name, even if `A<T>' is dependent. */
15284 is_declaration);
15285 /* For everything but enumeration types, consider a template-id.
15286 For an enumeration type, consider only a plain identifier. */
15288 {
15290 tree decl;
15292 /* Allow the `template' keyword. */
15294 /* If we didn't see `template', we don't know if there's a
15295 template-id or not. */
15298 /* Parse the template-id. */
15302 tag_type,
15303 is_declaration);
15304 /* If we didn't find a template-id, look for an ordinary
15305 identifier. */
15307 ;
15308 /* We can get here when cp_parser_template_id, called by
15309 cp_parser_class_name with tag_type == none_type, succeeds
15310 and caches a BASELINK. Then, when called again here,
15311 instead of failing and returning an error_mark_node
15312 returns it (see template/typename17.C in C++11).
15313 ??? Could we diagnose this earlier? */
15315 {
15318 }
15319 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15320 in effect, then we must assume that, upon instantiation, the
15321 template will correspond to a class. */
15325 typename_type,
15327 /* If the `typename' keyword is in effect and DECL is not a type
15328 decl, then type is non existent. */
15330 ;
15336 }
15339 {
15344 {
15347 }
15349 /* For a `typename', we needn't call xref_tag. */
15355 /* Template parameter lists apply only if we are not within a
15356 function parameter list. */
15357 bool template_parm_lists_apply
15366 /* Look up a qualified name in the usual way. */
15368 {
15369 tree decl;
15370 tree ambiguous_decls;
15373 tag_type,
15380 /* If the lookup was ambiguous, an error will already have been
15381 issued. */
15385 /* If we are parsing friend declaration, DECL may be a
15386 TEMPLATE_DECL tree node here. However, we need to check
15387 whether this TEMPLATE_DECL results in valid code. Consider
15388 the following example:
15390 namespace N {
15391 template <class T> class C {};
15392 }
15393 class X {
15394 template <class T> friend class N::C; // #1, valid code
15395 };
15396 template <class T> class Y {
15397 friend class N::C; // #2, invalid code
15398 };
15400 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15401 name lookup of `N::C'. We see that friend declaration must
15402 be template for the code to be valid. Note that
15403 processing_template_decl does not work here since it is
15404 always 1 for the above two cases. */
15406 decl = (cp_parser_maybe_treat_template_as_class
15411 {
15413 identifier,
15416 }
15419 {
15423 allow_template);
15427 }
15429 /* Forward declarations of nested types, such as
15431 class C1::C2;
15432 class C1::C2::C3;
15434 are invalid unless all components preceding the final '::'
15435 are complete. If all enclosing types are complete, these
15436 declarations become merely pointless.
15438 Invalid forward declarations of nested types are errors
15439 caught elsewhere in parsing. Those that are pointless arrive
15440 here. */
15447 }
15448 else
15449 {
15450 /* An elaborated-type-specifier sometimes introduces a new type and
15451 sometimes names an existing type. Normally, the rule is that it
15452 introduces a new type only if there is not an existing type of
15453 the same name already in scope. For example, given:
15455 struct S {};
15456 void f() { struct S s; }
15458 the `struct S' in the body of `f' is the same `struct S' as in
15459 the global scope; the existing definition is used. However, if
15460 there were no global declaration, this would introduce a new
15461 local class named `S'.
15463 An exception to this rule applies to the following code:
15465 namespace N { struct S; }
15467 Here, the elaborated-type-specifier names a new type
15468 unconditionally; even if there is already an `S' in the
15469 containing scope this declaration names a new type.
15470 This exception only applies if the elaborated-type-specifier
15471 forms the complete declaration:
15473 [class.name]
15475 A declaration consisting solely of `class-key identifier ;' is
15476 either a redeclaration of the name in the current scope or a
15477 forward declaration of the identifier as a class name. It
15478 introduces the name into the current scope.
15480 We are in this situation precisely when the next token is a `;'.
15482 An exception to the exception is that a `friend' declaration does
15483 *not* name a new type; i.e., given:
15485 struct S { friend struct T; };
15487 `T' is not a new type in the scope of `S'.
15489 Also, `new struct S' or `sizeof (struct S)' never results in the
15490 definition of a new type; a new type can only be declared in a
15491 declaration context. */
15493 tag_scope ts;
15497 /* Friends have special name lookup rules. */
15501 CPP_SEMICOLON))
15502 /* This is a `class-key identifier ;' */
15504 else
15507 template_p =
15508 (template_parm_lists_apply
15511 /* An unqualified name was used to reference this type, so
15512 there were no qualifying templates. */
15520 }
15521 }
15526 /* Allow attributes on forward declarations of classes. */
15528 {
15538 else
15541 }
15544 {
15545 /* Indicate whether this class was declared as a `class' or as a
15546 `struct'. */
15550 }
15552 /* A "<" cannot follow an elaborated type specifier. If that
15553 happens, the user was probably trying to form a template-id. */
15558 }
15560 /* Parse an enum-specifier.
15562 enum-specifier:
15563 enum-head { enumerator-list [opt] }
15564 enum-head { enumerator-list , } [C++0x]
15566 enum-head:
15567 enum-key identifier [opt] enum-base [opt]
15568 enum-key nested-name-specifier identifier enum-base [opt]
15570 enum-key:
15571 enum
15572 enum class [C++0x]
15573 enum struct [C++0x]
15575 enum-base: [C++0x]
15576 : type-specifier-seq
15578 opaque-enum-specifier:
15579 enum-key identifier enum-base [opt] ;
15581 GNU Extensions:
15582 enum-key attributes[opt] identifier [opt] enum-base [opt]
15583 { enumerator-list [opt] }attributes[opt]
15584 enum-key attributes[opt] identifier [opt] enum-base [opt]
15585 { enumerator-list, }attributes[opt] [C++0x]
15587 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15588 if the token stream isn't an enum-specifier after all. */
15590 static tree
15592 {
15593 tree identifier;
15595 tree prev_scope;
15597 tree attributes;
15610 /* Parse tentatively so that we can back up if we don't find a
15611 enum-specifier. */
15614 /* Caller guarantees that the current token is 'enum', an identifier
15615 possibly follows, and the token after that is an opening brace.
15616 If we don't have an identifier, fabricate an anonymous name for
15617 the enumeration being defined. */
15620 /* Parse the "class" or "struct", which indicates a scoped
15621 enumeration type in C++0x. */
15624 {
15628 /* Consume the `struct' or `class' token. */
15632 }
15636 /* Clear the qualification. */
15641 /* Figure out in what scope the declaration is being placed. */
15647 nested_name_specifier
15655 {
15656 tree name;
15660 enum_type,
15665 input_location);
15667 {
15670 {
15671 /* Are template enums allowed in ISO? */
15675 /* ignore a typename reference, for it will be solved by name
15676 in start_enum. */
15678 }
15679 }
15682 else
15685 }
15686 else
15687 {
15690 else
15691 {
15697 }
15698 }
15701 /* Check for the `:' that denotes a specified underlying type in C++0x.
15702 Note that a ':' could also indicate a bitfield width, however. */
15704 {
15705 cp_decl_specifier_seq type_specifiers;
15707 /* Consume the `:'. */
15710 /* Parse the type-specifier-seq. */
15715 /* At this point this is surely not elaborated type specifier. */
15724 /* If that didn't work, stop. */
15726 {
15732 }
15733 }
15735 /* Look for the `{' but don't consume it yet. */
15737 {
15739 {
15742 {
15745 }
15746 }
15747 /* An opaque-enum-specifier must have a ';' here. */
15750 {
15753 {
15756 }
15757 }
15758 }
15764 {
15766 {
15770 }
15772 {
15774 }
15775 }
15777 /* Issue an error message if type-definitions are forbidden here. */
15780 else
15781 /* Create the new type. We do this before consuming the opening
15782 brace so the enum will be recorded as being on the line of its
15783 tag (or the 'enum' keyword, if there is no tag). */
15787 /* If the next token is not '{' it is an opaque-enum-specifier or an
15788 elaborated-type-specifier. */
15790 {
15794 {
15795 /* The following catches invalid code such as:
15796 enum class S<int>::E { A, B, C }; */
15804 {
15808 nested_name_specifier);
15810 }
15811 /* If that scope does not contain the scope in which the
15812 class was originally declared, the program is invalid. */
15814 nested_name_specifier))
15815 {
15818 "declaration of %qD in namespace %qD which does not "
15821 else
15823 "declaration of %qD in %qD which does not "
15827 }
15828 }
15833 /* Consume the opening brace. */
15840 {
15844 }
15845 else
15846 {
15852 }
15856 /* If the next token is not '}', then there are some enumerators. */
15858 {
15862 }
15863 else
15866 /* Consume the final '}'. */
15872 }
15873 else
15874 {
15875 /* If a ';' follows, then it is an opaque-enum-specifier
15876 and additional restrictions apply. */
15878 {
15885 }
15886 }
15888 /* Look for trailing attributes to apply to this enumeration, and
15889 apply them if appropriate. */
15891 {
15895 trailing_attr,
15897 }
15899 /* Finish up the enumeration. */
15901 {
15906 }
15909 {
15911 {
15914 }
15916 {
15918 }
15919 }
15920 out:
15923 }
15925 /* Parse an enumerator-list. The enumerators all have the indicated
15926 TYPE.
15928 enumerator-list:
15929 enumerator-definition
15930 enumerator-list , enumerator-definition */
15932 static void
15934 {
15936 {
15937 /* Parse an enumerator-definition. */
15940 /* If the next token is not a ',', we've reached the end of
15941 the list. */
15944 /* Otherwise, consume the `,' and keep going. */
15946 /* If the next token is a `}', there is a trailing comma. */
15948 {
15953 }
15954 }
15955 }
15957 /* Parse an enumerator-definition. The enumerator has the indicated
15958 TYPE.
15960 enumerator-definition:
15961 enumerator
15962 enumerator = constant-expression
15964 enumerator:
15965 identifier */
15967 static void
15969 {
15970 tree identifier;
15971 tree value;
15972 location_t loc;
15974 /* Save the input location because we are interested in the location
15975 of the identifier and not the location of the explicit value. */
15978 /* Look for the identifier. */
15983 /* If the next token is an '=', then there is an explicit value. */
15985 {
15986 /* Consume the `=' token. */
15988 /* Parse the value. */
15990 }
15991 else
15994 /* If we are processing a template, make sure the initializer of the
15995 enumerator doesn't contain any bare template parameter pack. */
15999 /* integral_constant_value will pull out this expression, so make sure
16000 it's folded as appropriate. */
16003 /* Create the enumerator. */
16005 }
16007 /* Parse a namespace-name.
16009 namespace-name:
16010 original-namespace-name
16011 namespace-alias
16013 Returns the NAMESPACE_DECL for the namespace. */
16015 static tree
16017 {
16018 tree identifier;
16019 tree namespace_decl;
16023 /* Get the name of the namespace. */
16028 /* Look up the identifier in the currently active scope. Look only
16029 for namespaces, due to:
16031 [basic.lookup.udir]
16033 When looking up a namespace-name in a using-directive or alias
16034 definition, only namespace names are considered.
16036 And:
16038 [basic.lookup.qual]
16040 During the lookup of a name preceding the :: scope resolution
16041 operator, object, function, and enumerator names are ignored.
16043 (Note that cp_parser_qualifying_entity only calls this
16044 function if the token after the name is the scope resolution
16045 operator.) */
16047 none_type,
16053 /* If it's not a namespace, issue an error. */
16056 {
16061 }
16064 }
16066 /* Parse a namespace-definition.
16068 namespace-definition:
16069 named-namespace-definition
16070 unnamed-namespace-definition
16072 named-namespace-definition:
16073 original-namespace-definition
16074 extension-namespace-definition
16076 original-namespace-definition:
16077 namespace identifier { namespace-body }
16079 extension-namespace-definition:
16080 namespace original-namespace-name { namespace-body }
16082 unnamed-namespace-definition:
16083 namespace { namespace-body } */
16085 static void
16087 {
16094 {
16098 }
16099 else
16102 /* Look for the `namespace' keyword. */
16105 /* Get the name of the namespace. We do not attempt to distinguish
16106 between an original-namespace-definition and an
16107 extension-namespace-definition at this point. The semantic
16108 analysis routines are responsible for that. */
16111 else
16114 /* Parse any specified attributes. */
16117 /* Look for the `{' to start the namespace. */
16119 /* Start the namespace. */
16122 /* "inline namespace" is equivalent to a stub namespace definition
16123 followed by a strong using directive. */
16125 {
16127 /* Set up namespace association. */
16131 /* Import the contents of the inline namespace. */
16135 }
16139 /* Parse the body of the namespace. */
16145 /* Finish the namespace. */
16147 /* Look for the final `}'. */
16149 }
16151 /* Parse a namespace-body.
16153 namespace-body:
16154 declaration-seq [opt] */
16156 static void
16158 {
16160 }
16162 /* Parse a namespace-alias-definition.
16164 namespace-alias-definition:
16165 namespace identifier = qualified-namespace-specifier ; */
16167 static void
16169 {
16170 tree identifier;
16171 tree namespace_specifier;
16175 /* Look for the `namespace' keyword. */
16177 /* Look for the identifier. */
16181 /* Look for the `=' token. */
16184 {
16186 /* Skip the definition. */
16191 }
16193 /* Look for the qualified-namespace-specifier. */
16194 namespace_specifier
16196 /* Look for the `;' token. */
16199 /* Register the alias in the symbol table. */
16201 }
16203 /* Parse a qualified-namespace-specifier.
16205 qualified-namespace-specifier:
16206 :: [opt] nested-name-specifier [opt] namespace-name
16208 Returns a NAMESPACE_DECL corresponding to the specified
16209 namespace. */
16211 static tree
16213 {
16214 /* Look for the optional `::'. */
16218 /* Look for the optional nested-name-specifier. */
16226 }
16228 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16229 access declaration.
16231 using-declaration:
16232 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16233 using :: unqualified-id ;
16235 access-declaration:
16236 qualified-id ;
16238 */
16240 static bool
16243 {
16247 tree decl;
16248 tree identifier;
16249 tree qscope;
16254 {
16257 }
16258 else
16259 {
16260 /* Look for the `using' keyword. */
16263 /* Peek at the next token. */
16265 /* See if it's `typename'. */
16267 {
16268 /* Remember that we've seen it. */
16270 /* Consume the `typename' token. */
16272 }
16273 }
16275 /* Look for the optional global scope qualification. */
16276 global_scope_p
16281 /* If we saw `typename', or didn't see `::', then there must be a
16282 nested-name-specifier present. */
16284 {
16290 {
16293 }
16294 }
16295 /* Otherwise, we could be in either of the two productions. In that
16296 case, treat the nested-name-specifier as optional. */
16297 else
16309 /* Something has already gone wrong; there's no need to parse
16310 further. Since an error has occurred, the return value of
16311 cp_parser_parse_definitely will be false, as required. */
16315 /* Parse the unqualified-id. */
16323 {
16328 }
16330 /* The function we call to handle a using-declaration is different
16331 depending on what scope we are in. */
16333 ;
16336 /* [namespace.udecl]
16338 A using declaration shall not name a template-id. */
16341 else
16342 {
16344 {
16345 /* Create the USING_DECL. */
16352 {
16355 }
16356 else
16357 /* Add it to the list of members in this class. */
16359 }
16360 else
16361 {
16363 identifier,
16370 {
16373 }
16376 else
16378 }
16379 }
16381 /* Look for the final `;'. */
16386 "access declarations are deprecated "
16387 "in favour of using-declarations; "
16391 }
16393 /* Parse an alias-declaration.
16395 alias-declaration:
16396 using identifier attribute-specifier-seq [opt] = type-id */
16398 static tree
16400 {
16402 location_t id_location;
16404 cp_decl_specifier_seq decl_specs;
16408 /* Look for the `using' keyword. */
16409 cp_token *using_token
16431 /* Now we are going to parse the type-id of the declaration. */
16433 /*
16434 [dcl.type]/3 says:
16436 "A type-specifier-seq shall not define a class or enumeration
16437 unless it appears in the type-id of an alias-declaration (7.1.3) that
16438 is not the declaration of a template-declaration."
16440 In other words, if we currently are in an alias template, the
16441 type-id should not define a type.
16443 So let's set parser->type_definition_forbidden_message in that
16444 case; cp_parser_check_type_definition (called by
16445 cp_parser_class_specifier) will then emit an error if a type is
16446 defined in the type-id. */
16448 {
16452 }
16456 /* Restore the error message if need be. */
16462 {
16465 }
16467 /* A typedef-name can also be introduced by an alias-declaration. The
16468 identifier following the using keyword becomes a typedef-name. It has
16469 the same semantics as if it were introduced by the typedef
16470 specifier. In particular, it does not define a new type and it shall
16471 not appear in the type-id. */
16476 {
16479 ds_attribute,
16480 attrs_token);
16481 }
16483 ds_typedef,
16484 using_token);
16486 ds_alias,
16487 using_token);
16496 else
16507 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16508 added into the symbol table; otherwise, return the TYPE_DECL. */
16512 {
16516 }
16519 }
16521 /* Parse a using-directive.
16523 using-directive:
16524 using namespace :: [opt] nested-name-specifier [opt]
16525 namespace-name ; */
16527 static void
16529 {
16530 tree namespace_decl;
16531 tree attribs;
16533 /* Look for the `using' keyword. */
16535 /* And the `namespace' keyword. */
16537 /* Look for the optional `::' operator. */
16539 /* And the optional nested-name-specifier. */
16545 /* Get the namespace being used. */
16547 /* And any specified attributes. */
16549 /* Update the symbol table. */
16551 /* Look for the final `;'. */
16553 }
16555 /* Parse an asm-definition.
16557 asm-definition:
16558 asm ( string-literal ) ;
16560 GNU Extension:
16562 asm-definition:
16563 asm volatile [opt] ( string-literal ) ;
16564 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16565 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16566 : asm-operand-list [opt] ) ;
16567 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16568 : asm-operand-list [opt]
16569 : asm-clobber-list [opt] ) ;
16570 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16571 : asm-clobber-list [opt]
16572 : asm-goto-list ) ; */
16574 static void
16576 {
16577 tree string;
16582 tree asm_stmt;
16590 /* Look for the `asm' keyword. */
16597 /* See if the next token is `volatile'. */
16600 {
16601 /* Remember that we saw the `volatile' keyword. */
16603 /* Consume the token. */
16605 }
16609 {
16610 /* Remember that we saw the `goto' keyword. */
16612 /* Consume the token. */
16614 }
16615 /* Look for the opening `('. */
16618 /* Look for the string. */
16621 {
16625 }
16627 /* If we're allowing GNU extensions, check for the extended assembly
16628 syntax. Unfortunately, the `:' tokens need not be separated by
16629 a space in C, and so, for compatibility, we tolerate that here
16630 too. Doing that means that we have to treat the `::' operator as
16631 two `:' tokens. */
16636 {
16641 /* The extended syntax was used. */
16644 /* Look for outputs. */
16646 {
16647 /* Consume the `:'. */
16649 /* Parse the output-operands. */
16651 CPP_COLON)
16653 CPP_SCOPE)
16655 CPP_CLOSE_PAREN)
16661 }
16662 /* If the next token is `::', there are no outputs, and the
16663 next token is the beginning of the inputs. */
16665 /* The inputs are coming next. */
16668 /* Look for inputs. */
16671 {
16672 /* Consume the `:' or `::'. */
16674 /* Parse the output-operands. */
16676 CPP_COLON)
16678 CPP_SCOPE)
16680 CPP_CLOSE_PAREN))
16685 }
16687 /* The clobbers are coming next. */
16690 /* Look for clobbers. */
16693 {
16695 /* Consume the `:' or `::'. */
16697 /* Parse the clobbers. */
16699 CPP_COLON)
16701 CPP_CLOSE_PAREN))
16703 }
16706 /* The labels are coming next. */
16709 /* Look for labels. */
16712 {
16714 /* Consume the `:' or `::'. */
16716 /* Parse the labels. */
16718 }
16722 }
16726 /* Look for the closing `)'. */
16734 {
16735 /* Create the ASM_EXPR. */
16737 {
16740 /* If the extended syntax was not used, mark the ASM_EXPR. */
16742 {
16748 }
16749 }
16750 else
16752 }
16753 }
16755 /* Declarators [gram.dcl.decl] */
16757 /* Parse an init-declarator.
16759 init-declarator:
16760 declarator initializer [opt]
16762 GNU Extension:
16764 init-declarator:
16765 declarator asm-specification [opt] attributes [opt] initializer [opt]
16767 function-definition:
16768 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16769 function-body
16770 decl-specifier-seq [opt] declarator function-try-block
16772 GNU Extension:
16774 function-definition:
16775 __extension__ function-definition
16777 TM Extension:
16779 function-definition:
16780 decl-specifier-seq [opt] declarator function-transaction-block
16782 The DECL_SPECIFIERS apply to this declarator. Returns a
16783 representation of the entity declared. If MEMBER_P is TRUE, then
16784 this declarator appears in a class scope. The new DECL created by
16785 this declarator is returned.
16787 The CHECKS are access checks that should be performed once we know
16788 what entity is being declared (and, therefore, what classes have
16789 befriended it).
16791 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16792 for a function-definition here as well. If the declarator is a
16793 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16794 be TRUE upon return. By that point, the function-definition will
16795 have been completely parsed.
16797 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16798 is FALSE.
16800 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16801 parsed declaration if it is an uninitialized single declarator not followed
16802 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16803 if present, will not be consumed. If returned, this declarator will be
16804 created with SD_INITIALIZED but will not call cp_finish_decl. */
16806 static tree
16815 {
16819 tree prefix_attributes;
16821 tree asm_specification;
16822 tree initializer;
16824 tree scope;
16826 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16827 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16828 "(...)". */
16838 /* Gather the attributes that were provided with the
16839 decl-specifiers. */
16842 /* Assume that this is not the declarator for a function
16843 definition. */
16847 /* Default arguments are only permitted for function parameters. */
16851 /* Defer access checks while parsing the declarator; we cannot know
16852 what names are accessible until we know what is being
16853 declared. */
16856 /* Parse the declarator. */
16858 declarator
16863 /* Gather up the deferred checks. */
16868 /* If the DECLARATOR was erroneous, there's no need to go
16869 further. */
16873 /* Check that the number of template-parameter-lists is OK. */
16883 /* Figure out what scope the entity declared by the DECLARATOR is
16884 located in. `grokdeclarator' sometimes changes the scope, so
16885 we compute it now. */
16888 /* Perform any lookups in the declared type which were thought to be
16889 dependent, but are not in the scope of the declarator. */
16890 decl_specifiers->type
16893 /* If we're allowing GNU extensions, look for an
16894 asm-specification. */
16896 {
16897 /* Look for an asm-specification. */
16900 }
16901 else
16904 /* Look for attributes. */
16908 /* Peek at the next token. */
16914 {
16915 /* Check to see if the token indicates the start of a
16916 function-definition. */
16918 {
16920 {
16921 /* If a function-definition should not appear here, issue an
16922 error message. */
16926 }
16928 location_t func_brace_location
16931 /* Neither attributes nor an asm-specification are allowed
16932 on a function-definition. */
16935 "an asm-specification is not allowed "
16939 "attributes are not allowed "
16941 /* This is a function-definition. */
16944 /* Parse the function definition. */
16947 decl_specifiers,
16948 declarator,
16949 prefix_attributes);
16950 else
16951 decl =
16952 (cp_parser_function_definition_from_specifiers_and_declarator
16956 {
16957 /* This is where the prologue starts... */
16960 }
16963 }
16964 }
16966 {
16967 /* A non-template declaration involving a function parameter list
16968 containing an implicit template parameter will be made into a
16969 template. If the resulting declaration is not going to be an
16970 actual function then finish the template scope here to prevent it.
16971 An error message will be issued once we have a decl to talk about.
16973 FIXME probably we should do type deduction rather than create an
16974 implicit template, but the standard currently doesn't allow it. */
16977 }
16979 /* [dcl.dcl]
16981 Only in function declarations for constructors, destructors, and
16982 type conversions can the decl-specifier-seq be omitted.
16984 We explicitly postpone this check past the point where we handle
16985 function-definitions because we tolerate function-definitions
16986 that are missing their return types in some modes. */
16988 {
16992 }
16994 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16998 {
17006 {
17012 }
17013 }
17014 else
17015 {
17016 /* If the init-declarator isn't initialized and isn't followed by a
17017 `,' or `;', it's not a valid init-declarator. */
17020 {
17023 else
17024 {
17027 }
17028 }
17031 }
17033 /* Because start_decl has side-effects, we should only call it if we
17034 know we're going ahead. By this point, we know that we cannot
17035 possibly be looking at any other construct. */
17038 /* Enter the newly declared entry in the symbol table. If we're
17039 processing a declaration in a class-specifier, we wait until
17040 after processing the initializer. */
17042 {
17049 /* Adjust location of decl if declarator->id_loc is more appropriate:
17050 set, and decl wasn't merged with another decl, in which case its
17051 location would be different from input_location, and more accurate. */
17056 }
17058 /* Enter the SCOPE. That way unqualified names appearing in the
17059 initializer will be looked up in SCOPE. */
17062 /* Perform deferred access control checks, now that we know in which
17063 SCOPE the declared entity resides. */
17065 {
17068 /* If the entity being declared is a function, pretend that we
17069 are in its scope. If it is a `friend', it may have access to
17070 things that would not otherwise be accessible. */
17072 {
17075 }
17077 /* Perform access checks for template parameters. */
17080 /* Perform the access control checks for the declarator and the
17081 decl-specifiers. */
17084 /* Restore the saved value. */
17087 }
17089 /* Parse the initializer. */
17094 {
17096 {
17100 else
17101 {
17102 /* If the declaration was erroneous, we don't really
17103 know what the user intended, so just silently
17104 consume the initializer. */
17112 }
17113 }
17114 else
17115 {
17116 /* We want to record the extra mangling scope for in-class
17117 initializers of class members and initializers of static data
17118 member templates. The former involves deferring
17119 parsing of the initializer until end of class as with default
17120 arguments. So right here we only handle the latter. */
17130 }
17131 }
17133 /* The old parser allows attributes to appear after a parenthesized
17134 initializer. Mark Mitchell proposed removing this functionality
17135 on the GCC mailing lists on 2002-08-13. This parser accepts the
17136 attributes -- but ignores them. */
17143 /* And now complain about a non-function implicit template. */
17148 /* For an in-class declaration, use `grokfield' to create the
17149 declaration. */
17151 {
17153 {
17156 }
17164 }
17166 /* Finish processing the declaration. But, skip member
17167 declarations. */
17169 {
17172 asm_specification,
17173 /* If the initializer is in parentheses, then this is
17174 a direct-initialization, which means that an
17175 `explicit' constructor is OK. Otherwise, an
17176 `explicit' constructor cannot be used. */
17179 }
17182 /* Core issue #226 (C++0x only): A default template-argument
17183 shall not be specified in a friend class template
17184 declaration. */
17193 {
17196 else
17198 }
17201 }
17203 /* Parse a declarator.
17205 declarator:
17206 direct-declarator
17207 ptr-operator declarator
17209 abstract-declarator:
17210 ptr-operator abstract-declarator [opt]
17211 direct-abstract-declarator
17213 GNU Extensions:
17215 declarator:
17216 attributes [opt] direct-declarator
17217 attributes [opt] ptr-operator declarator
17219 abstract-declarator:
17220 attributes [opt] ptr-operator abstract-declarator [opt]
17221 attributes [opt] direct-abstract-declarator
17223 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17224 detect constructor, destructor or conversion operators. It is set
17225 to -1 if the declarator is a name, and +1 if it is a
17226 function. Otherwise it is set to zero. Usually you just want to
17227 test for >0, but internally the negative value is used.
17229 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17230 a decl-specifier-seq unless it declares a constructor, destructor,
17231 or conversion. It might seem that we could check this condition in
17232 semantic analysis, rather than parsing, but that makes it difficult
17233 to handle something like `f()'. We want to notice that there are
17234 no decl-specifiers, and therefore realize that this is an
17235 expression, not a declaration.)
17237 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17238 the declarator is a direct-declarator of the form "(...)".
17240 MEMBER_P is true iff this declarator is a member-declarator.
17242 FRIEND_P is true iff this declarator is a friend. */
17246 cp_parser_declarator_kind dcl_kind,
17250 {
17253 cp_cv_quals cv_quals;
17254 tree class_type;
17257 /* Assume this is not a constructor, destructor, or type-conversion
17258 operator. */
17265 /* Check for the ptr-operator production. */
17267 /* Parse the ptr-operator. */
17273 /* If that worked, then we have a ptr-operator. */
17275 {
17276 /* If a ptr-operator was found, then this declarator was not
17277 parenthesized. */
17280 /* The dependent declarator is optional if we are parsing an
17281 abstract-declarator. */
17285 /* Parse the dependent declarator. */
17290 friend_p);
17292 /* If we are parsing an abstract-declarator, we must handle the
17293 case where the dependent declarator is absent. */
17298 declarator = cp_parser_make_indirect_declarator
17300 }
17301 /* Everything else is a direct-declarator. */
17302 else
17303 {
17306 CPP_OPEN_PAREN);
17308 ctor_dtor_or_conv_p,
17310 }
17315 }
17317 /* Parse a direct-declarator or direct-abstract-declarator.
17319 direct-declarator:
17320 declarator-id
17321 direct-declarator ( parameter-declaration-clause )
17322 cv-qualifier-seq [opt]
17323 ref-qualifier [opt]
17324 exception-specification [opt]
17325 direct-declarator [ constant-expression [opt] ]
17326 ( declarator )
17328 direct-abstract-declarator:
17329 direct-abstract-declarator [opt]
17330 ( parameter-declaration-clause )
17331 cv-qualifier-seq [opt]
17332 ref-qualifier [opt]
17333 exception-specification [opt]
17334 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17335 ( abstract-declarator )
17337 Returns a representation of the declarator. DCL_KIND is
17338 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17339 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17340 we are parsing a direct-declarator. It is
17341 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17342 of ambiguity we prefer an abstract declarator, as per
17343 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17344 as for cp_parser_declarator. */
17348 cp_parser_declarator_kind dcl_kind,
17351 {
17361 {
17362 /* Peek at the next token. */
17365 {
17366 /* This is either a parameter-declaration-clause, or a
17367 parenthesized declarator. When we know we are parsing a
17368 named declarator, it must be a parenthesized declarator
17369 if FIRST is true. For instance, `(int)' is a
17370 parameter-declaration-clause, with an omitted
17371 direct-abstract-declarator. But `((*))', is a
17372 parenthesized abstract declarator. Finally, when T is a
17373 template parameter `(T)' is a
17374 parameter-declaration-clause, and not a parenthesized
17375 named declarator.
17377 We first try and parse a parameter-declaration-clause,
17378 and then try a nested declarator (if FIRST is true).
17380 It is not an error for it not to be a
17381 parameter-declaration-clause, even when FIRST is
17382 false. Consider,
17384 int i (int);
17385 int i (3);
17387 The first is the declaration of a function while the
17388 second is the definition of a variable, including its
17389 initializer.
17391 Having seen only the parenthesis, we cannot know which of
17392 these two alternatives should be selected. Even more
17393 complex are examples like:
17395 int i (int (a));
17396 int i (int (3));
17398 The former is a function-declaration; the latter is a
17399 variable initialization.
17401 Thus again, we try a parameter-declaration-clause, and if
17402 that fails, we back out and return. */
17405 {
17406 tree params;
17409 /* In a member-declarator, the only valid interpretation
17410 of a parenthesis is the start of a
17411 parameter-declaration-clause. (It is invalid to
17412 initialize a static data member with a parenthesized
17413 initializer; only the "=" form of initialization is
17414 permitted.) */
17418 /* Consume the `('. */
17421 {
17422 /* If this is going to be an abstract declarator, we're
17423 in a declarator and we can't have default args. */
17426 }
17430 /* Parse the parameter-declaration-clause. */
17433 /* Consume the `)'. */
17436 /* If all went well, parse the cv-qualifier-seq,
17437 ref-qualifier and the exception-specification. */
17439 {
17440 cp_cv_quals cv_quals;
17441 cp_virt_specifiers virt_specifiers;
17442 cp_ref_qualifier ref_qual;
17443 tree exception_specification;
17444 tree late_return;
17445 tree attrs;
17455 /* Parse the cv-qualifier-seq. */
17457 /* Parse the ref-qualifier. */
17459 /* And the exception-specification. */
17460 exception_specification
17465 /* In here, we handle cases where attribute is used after
17466 the function declaration. For example:
17467 void func (int x) __attribute__((vector(..))); */
17470 {
17474 CPP_SEMICOLON)
17476 CPP_OPEN_BRACE))
17479 ;
17480 else
17482 }
17483 late_return = (cp_parser_late_return_type_opt
17488 /* Parse the virt-specifier-seq. */
17491 /* Create the function-declarator. */
17493 params,
17494 cv_quals,
17495 virt_specifiers,
17496 ref_qual,
17497 exception_specification,
17498 late_return);
17500 /* Any subsequent parameter lists are to do with
17501 return type, so are not those of the declared
17502 function. */
17504 }
17506 /* Remove the function parms from scope. */
17510 /* Repeat the main loop. */
17512 }
17514 /* If this is the first, we can try a parenthesized
17515 declarator. */
17517 {
17523 /* Consume the `('. */
17525 /* Parse the nested declarator. */
17528 declarator
17534 /* Expect a `)'. */
17541 }
17542 /* Otherwise, we must be done. */
17543 else
17545 }
17549 {
17550 /* Parse an array-declarator. */
17559 /* Consume the `['. */
17561 /* Peek at the next token. */
17563 /* If the next token is `]', then there is no
17564 constant-expression. */
17566 {
17568 bounds
17578 {
17579 /* Normally, the array bound must be an integral constant
17580 expression. However, as an extension, we allow VLAs
17581 in function scopes as long as they aren't part of a
17582 parameter declaration. */
17586 }
17589 {
17590 /* Remember this wasn't a constant-expression. */
17593 }
17594 }
17595 else
17597 /* Look for the closing `]'. */
17599 {
17602 }
17607 }
17609 {
17610 {
17611 tree qualifying_scope;
17612 tree unqualified_name;
17613 tree attrs;
17614 special_function_kind sfk;
17619 /* Parse a declarator-id */
17622 {
17625 /* If we see an ellipsis, we should be looking at a
17626 parameter pack. */
17628 {
17629 /* Consume the `...' */
17633 }
17634 }
17637 unqualified_name
17641 {
17645 {
17646 /* Check whether an error occurred. */
17649 /* We already consumed the ellipsis to mark a
17650 parameter pack, but we have no way to report it,
17651 so abort the tentative parse. We will be exiting
17652 immediately anyway. */
17654 }
17655 else
17661 && (qualifying_scope
17663 {
17666 }
17667 }
17672 {
17677 }
17683 {
17684 /* In the declaration of a member of a template class
17685 outside of the class itself, the SCOPE will sometimes
17686 be a TYPENAME_TYPE. For example, given:
17688 template <typename T>
17689 int S<T>::R::i = 3;
17691 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17692 this context, we must resolve S<T>::R to an ordinary
17693 type, rather than a typename type.
17695 The reason we normally avoid resolving TYPENAME_TYPEs
17696 is that a specialization of `S' might render
17697 `S<T>::R' not a type. However, if `S' is
17698 specialized, then this `i' will not be used, so there
17699 is no harm in resolving the types here. */
17700 tree type;
17702 /* Resolve the TYPENAME_TYPE. */
17705 /* If that failed, the declarator is invalid. */
17707 {
17710 "cannot define member of dependent typedef "
17712 else
17717 }
17719 }
17724 {
17725 tree class_type;
17730 else
17734 {
17737 {
17740 {
17744 "use %<%T::%D%> instead of %<%T::%D%> to "
17746 class_type,
17751 }
17752 else
17754 }
17755 else
17756 {
17757 /* We do not attempt to print the declarator
17758 here because we do not have enough
17759 information about its original syntactic
17760 form. */
17764 }
17765 }
17768 {
17774 for an anonymous type, even if the type
17775 got a name for linkage purposes. */
17777 /* Handle correctly (c++/19200):
17779 struct S {
17780 struct T{};
17781 friend void S(T);
17782 };
17784 and also:
17786 namespace N {
17787 void S();
17788 }
17790 struct S {
17791 friend void N::S();
17792 }; */
17793 && !(friend_p
17796 class_type))
17797 {
17800 }
17808 }
17809 }
17811 unqualified_name,
17812 sfk);
17819 }
17821 handle_declarator:;
17824 {
17825 /* Any names that appear after the declarator-id for a
17826 member are looked up in the containing scope. */
17828 {
17829 /* But declarations with qualified-ids can't appear in a
17830 function. */
17834 }
17836 }
17840 /* Default args are only allowed on function
17841 declarations. */
17843 else
17847 }
17848 /* We're done. */
17849 else
17851 }
17853 /* For an abstract declarator, we might wind up with nothing at this
17854 point. That's an error; the declarator is not optional. */
17858 /* If we entered a scope, we must exit it now. */
17866 }
17868 /* Parse a ptr-operator.
17870 ptr-operator:
17871 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17872 * cv-qualifier-seq [opt]
17873 &
17874 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17875 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17877 GNU Extension:
17879 ptr-operator:
17880 & cv-qualifier-seq [opt]
17882 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17883 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17884 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17885 filled in with the TYPE containing the member. *CV_QUALS is
17886 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17887 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17888 Note that the tree codes returned by this function have nothing
17889 to do with the types of trees that will be eventually be created
17890 to represent the pointer or reference type being parsed. They are
17891 just constants with suggestive names. */
17892 static enum tree_code
17897 {
17902 /* Assume that it's not a pointer-to-member. */
17904 /* And that there are no cv-qualifiers. */
17907 /* Peek at the next token. */
17910 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17920 {
17921 /* Consume the `*', `&' or `&&'. */
17924 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17925 `&', if we are allowing GNU extensions. (The only qualifier
17926 that can legally appear after `&' is `restrict', but that is
17927 enforced during semantic analysis. */
17935 }
17936 else
17937 {
17938 /* Try the pointer-to-member case. */
17940 /* Look for the optional `::' operator. */
17943 /* Look for the nested-name specifier. */
17950 /* If we found it, and the next token is a `*', then we are
17951 indeed looking at a pointer-to-member operator. */
17954 {
17955 /* Indicate that the `*' operator was used. */
17963 else
17964 {
17965 /* The type of which the member is a member is given by the
17966 current SCOPE. */
17968 /* The next name will not be qualified. */
17972 /* Look for optional c++11 attributes. */
17976 /* Look for the optional cv-qualifier-seq. */
17978 }
17979 }
17980 /* If that didn't work we don't have a ptr-operator. */
17983 }
17986 }
17988 /* Parse an (optional) cv-qualifier-seq.
17990 cv-qualifier-seq:
17991 cv-qualifier cv-qualifier-seq [opt]
17993 cv-qualifier:
17994 const
17995 volatile
17997 GNU Extension:
17999 cv-qualifier:
18000 __restrict__
18002 Returns a bitmask representing the cv-qualifiers. */
18004 static cp_cv_quals
18006 {
18010 {
18012 cp_cv_quals cv_qualifier;
18014 /* Peek at the next token. */
18016 /* See if it's a cv-qualifier. */
18018 {
18034 }
18040 {
18043 }
18044 else
18045 {
18048 }
18049 }
18052 }
18054 /* Parse an (optional) ref-qualifier
18056 ref-qualifier:
18057 &
18058 &&
18060 Returns cp_ref_qualifier representing ref-qualifier. */
18062 static cp_ref_qualifier
18064 {
18067 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18072 {
18077 {
18089 }
18094 {
18097 }
18098 else
18099 {
18102 }
18103 }
18106 }
18108 /* Parse an (optional) virt-specifier-seq.
18110 virt-specifier-seq:
18111 virt-specifier virt-specifier-seq [opt]
18113 virt-specifier:
18114 override
18115 final
18117 Returns a bitmask representing the virt-specifiers. */
18119 static cp_virt_specifiers
18121 {
18125 {
18127 cp_virt_specifiers virt_specifier;
18129 /* Peek at the next token. */
18131 /* See if it's a virt-specifier-qualifier. */
18135 {
18138 }
18140 {
18143 }
18145 {
18147 }
18148 else
18152 {
18155 }
18156 else
18157 {
18160 }
18161 }
18163 }
18165 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18166 is in scope even though it isn't real. */
18168 void
18170 {
18171 tree this_parm;
18174 {
18175 /* We don't clear this between NSDMIs. Is it already what we want? */
18180 }
18183 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18185 current_class_ref
18188 }
18190 /* Return true iff our current scope is a non-static data member
18191 initializer. */
18193 bool
18195 {
18196 /* We recognize NSDMI context by the context-less 'this' pointer set up
18197 by the function above. */
18201 }
18203 /* Parse a late-specified return type, if any. This is not a separate
18204 non-terminal, but part of a function declarator, which looks like
18206 -> trailing-type-specifier-seq abstract-declarator(opt)
18208 Returns the type indicated by the type-id.
18210 In addition to this this parses any queued up omp declare simd
18211 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18213 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18214 function. */
18216 static tree
18218 cp_cv_quals quals)
18219 {
18223 && declarator
18229 /* Peek at the next token. */
18231 /* A late-specified return type is indicated by an initial '->'. */
18238 {
18239 /* DR 1207: 'this' is in scope in the trailing return type. */
18241 }
18244 {
18245 /* Consume the ->. */
18249 }
18252 declarator->std_attributes
18256 declarator->std_attributes
18261 {
18264 }
18267 }
18269 /* Parse a declarator-id.
18271 declarator-id:
18272 id-expression
18273 :: [opt] nested-name-specifier [opt] type-name
18275 In the `id-expression' case, the value returned is as for
18276 cp_parser_id_expression if the id-expression was an unqualified-id.
18277 If the id-expression was a qualified-id, then a SCOPE_REF is
18278 returned. The first operand is the scope (either a NAMESPACE_DECL
18279 or TREE_TYPE), but the second is still just a representation of an
18280 unqualified-id. */
18282 static tree
18284 {
18285 tree id;
18286 /* The expression must be an id-expression. Assume that qualified
18287 names are the names of types so that:
18289 template <class T>
18290 int S<T>::R::i = 3;
18292 will work; we must treat `S<T>::R' as the name of a type.
18293 Similarly, assume that qualified names are templates, where
18294 required, so that:
18296 template <class T>
18297 int S<T>::R<T>::i = 3;
18299 will work, too. */
18305 optional_p);
18309 }
18311 /* Parse a type-id.
18313 type-id:
18314 type-specifier-seq abstract-declarator [opt]
18316 Returns the TYPE specified. */
18318 static tree
18321 {
18322 cp_decl_specifier_seq type_specifier_seq;
18325 /* Parse the type-specifier-seq. */
18327 is_trailing_return,
18332 /* There might or might not be an abstract declarator. */
18334 /* Look for the declarator. */
18335 abstract_declarator
18340 /* Check to see if there really was a declarator. */
18345 /* None of the valid uses of 'auto' in C++14 involve the type-id
18346 nonterminal, but it is valid in a trailing-return-type. */
18349 {
18350 /* A type-id with type 'auto' is only ok if the abstract declarator
18351 is a function declarator with a late-specified return type. */
18356 else
18357 {
18360 }
18361 }
18364 is_template_arg);
18365 }
18368 {
18370 }
18373 {
18374 tree r;
18376 parser->type_definition_forbidden_message
18381 {
18384 }
18386 }
18389 {
18391 }
18393 /* Parse a type-specifier-seq.
18395 type-specifier-seq:
18396 type-specifier type-specifier-seq [opt]
18398 GNU extension:
18400 type-specifier-seq:
18401 attributes type-specifier-seq [opt]
18403 If IS_DECLARATION is true, we are at the start of a "condition" or
18404 exception-declaration, so we might be followed by a declarator-id.
18406 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18407 i.e. we've just seen "->".
18409 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18411 static void
18416 {
18421 /* Clear the TYPE_SPECIFIER_SEQ. */
18424 /* In the context of a trailing return type, enum E { } is an
18425 elaborated-type-specifier followed by a function-body, not an
18426 enum-specifier. */
18430 /* Parse the type-specifiers and attributes. */
18432 {
18433 tree type_specifier;
18436 /* Check for attributes first. */
18438 {
18443 }
18445 /* record the token of the beginning of the type specifier seq,
18446 for error reporting purposes*/
18450 /* Look for the type-specifier. */
18452 flags,
18453 type_specifier_seq,
18455 NULL,
18458 {
18459 /* If the first type-specifier could not be found, this is not a
18460 type-specifier-seq at all. */
18462 {
18463 /* Set in_declarator_p to avoid skipping to the semicolon. */
18475 }
18476 /* If subsequent type-specifiers could not be found, the
18477 type-specifier-seq is complete. */
18479 }
18482 /* The standard says that a condition can be:
18484 type-specifier-seq declarator = assignment-expression
18486 However, given:
18488 struct S {};
18489 if (int S = ...)
18491 we should treat the "S" as a declarator, not as a
18492 type-specifier. The standard doesn't say that explicitly for
18493 type-specifier-seq, but it does say that for
18494 decl-specifier-seq in an ordinary declaration. Perhaps it
18495 would be clearer just to allow a decl-specifier-seq here, and
18496 then add a semantic restriction that if any decl-specifiers
18497 that are not type-specifiers appear, the program is invalid. */
18500 }
18501 }
18503 /* Return whether the function currently being declared has an associated
18504 template parameter list. */
18506 static bool
18508 {
18521 }
18523 /* Parse a parameter-declaration-clause.
18525 parameter-declaration-clause:
18526 parameter-declaration-list [opt] ... [opt]
18527 parameter-declaration-list , ...
18529 Returns a representation for the parameter declarations. A return
18530 value of NULL indicates a parameter-declaration-clause consisting
18531 only of an ellipsis. */
18533 static tree
18535 {
18536 tree parameters;
18545 parser->auto_is_implicit_function_template_parm_p
18547 }
18553 && !processing_template_parmlist
18559 /* Peek at the next token. */
18561 /* Check for trivial parameter-declaration-clauses. */
18563 {
18564 /* Consume the `...' token. */
18567 }
18569 /* There are no parameters. */
18570 {
18571 #ifndef NO_IMPLICIT_EXTERN_C
18576 else
18577 #endif
18579 }
18580 /* Check for `(void)', too, which is a special case. */
18584 {
18585 /* Consume the `void' token. */
18587 /* There are no parameters. */
18589 }
18591 /* Parse the parameter-declaration-list. */
18593 /* If a parse error occurred while parsing the
18594 parameter-declaration-list, then the entire
18595 parameter-declaration-clause is erroneous. */
18599 /* Peek at the next token. */
18601 /* If it's a `,', the clause should terminate with an ellipsis. */
18603 {
18604 /* Consume the `,'. */
18606 /* Expect an ellipsis. */
18607 ellipsis_p
18609 }
18610 /* It might also be `...' if the optional trailing `,' was
18611 omitted. */
18613 {
18614 /* Consume the `...' token. */
18616 /* And remember that we saw it. */
18618 }
18619 else
18622 /* Finish the parameter list. */
18627 }
18629 /* Parse a parameter-declaration-list.
18631 parameter-declaration-list:
18632 parameter-declaration
18633 parameter-declaration-list , parameter-declaration
18635 Returns a representation of the parameter-declaration-list, as for
18636 cp_parser_parameter_declaration_clause. However, the
18637 `void_list_node' is never appended to the list. Upon return,
18638 *IS_ERROR will be true iff an error occurred. */
18640 static tree
18642 {
18648 /* Assume all will go well. */
18650 /* The special considerations that apply to a function within an
18651 unbraced linkage specifications do not apply to the parameters
18652 to the function. */
18653 saved_in_unbraced_linkage_specification_p
18657 /* Look for more parameters. */
18659 {
18667 /* Parse the parameter. */
18668 parameter
18673 /* We don't know yet if the enclosing context is deprecated, so wait
18674 and warn in grokparms if appropriate. */
18678 {
18679 /* If a function parameter pack was specified and an implicit template
18680 parameter was introduced during cp_parser_parameter_declaration,
18681 change any implicit parameters introduced into packs. */
18685 {
18693 }
18697 PARM,
18700 }
18704 /* If a parse error occurred parsing the parameter declaration,
18705 then the entire parameter-declaration-list is erroneous. */
18707 {
18711 }
18721 {
18725 }
18727 /* Add the new parameter to the list. */
18731 /* Peek at the next token. */
18734 /* These are for Objective-C++ */
18737 /* The parameter-declaration-list is complete. */
18740 {
18743 /* Peek at the next token. */
18745 /* If it's an ellipsis, then the list is complete. */
18748 /* Otherwise, there must be more parameters. Consume the
18749 `,'. */
18751 /* When parsing something like:
18753 int i(float f, double d)
18755 we can tell after seeing the declaration for "f" that we
18756 are not looking at an initialization of a variable "i",
18757 but rather at the declaration of a function "i".
18759 Due to the fact that the parsing of template arguments
18760 (as specified to a template-id) requires backtracking we
18761 cannot use this technique when inside a template argument
18762 list. */
18766 /* However, a parameter-declaration of the form
18767 "float(f)" (which is a valid declaration of a
18768 parameter "f") can also be interpreted as an
18769 expression (the conversion of "f" to "float"). */
18772 }
18773 else
18774 {
18782 }
18783 }
18785 parser->in_unbraced_linkage_specification_p
18788 /* Reset implicit_template_scope if we are about to leave the function
18789 parameter list that introduced it. Note that for out-of-line member
18790 definitions, there will be one or more class scopes before we get to
18791 the template parameter scope. */
18795 {
18799 {
18802 }
18803 }
18806 }
18808 /* Parse a parameter declaration.
18810 parameter-declaration:
18811 decl-specifier-seq ... [opt] declarator
18812 decl-specifier-seq declarator = assignment-expression
18813 decl-specifier-seq ... [opt] abstract-declarator [opt]
18814 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18816 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18817 declares a template parameter. (In that case, a non-nested `>'
18818 token encountered during the parsing of the assignment-expression
18819 is not interpreted as a greater-than operator.)
18821 Returns a representation of the parameter, or NULL if an error
18822 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18823 true iff the declarator is of the form "(p)". */
18829 {
18831 cp_decl_specifier_seq decl_specifiers;
18833 tree default_argument;
18837 /* In a template parameter, `>' is not an operator.
18839 [temp.param]
18841 When parsing a default template-argument for a non-type
18842 template-parameter, the first non-nested `>' is taken as the end
18843 of the template parameter-list rather than a greater-than
18844 operator. */
18846 /* Type definitions may not appear in parameter types. */
18848 parser->type_definition_forbidden_message
18851 /* Parse the declaration-specifiers. */
18853 CP_PARSER_FLAGS_NONE,
18857 /* Complain about missing 'typename' or other invalid type names. */
18862 /* If an error occurred, there's no reason to attempt to parse the
18863 rest of the declaration. */
18865 {
18868 }
18870 /* Peek at the next token. */
18873 /* If the next token is a `)', `,', `=', `>', or `...', then there
18874 is no declarator. However, when variadic templates are enabled,
18875 there may be a declarator following `...'. */
18880 {
18884 }
18885 /* Otherwise, there should be a declarator. */
18886 else
18887 {
18891 /* After seeing a decl-specifier-seq, if the next token is not a
18892 "(", there is no possibility that the code is a valid
18893 expression. Therefore, if parsing tentatively, we commit at
18894 this point. */
18896 /* In an expression context, having seen:
18898 (int((char ...
18900 we cannot be sure whether we are looking at a
18901 function-type (taking a "char" as a parameter) or a cast
18902 of some object of type "char" to "int". */
18908 /* Parse the declarator. */
18911 CP_PARSER_DECLARATOR_EITHER,
18913 parenthesized_p,
18917 /* After the declarator, allow more attributes. */
18918 decl_specifiers.attributes
18921 }
18923 /* If the next token is an ellipsis, and we have not seen a
18924 declarator name, and the type of the declarator contains parameter
18925 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18926 a parameter pack expansion expression. Otherwise, leave the
18927 ellipsis for a C-style variadic function. */
18930 {
18941 {
18942 /* Consume the `...'. */
18946 /* Build a pack expansion type */
18949 else
18951 }
18952 }
18954 /* The restriction on defining new types applies only to the type
18955 of the parameter, not to the default argument. */
18958 /* If the next token is `=', then process a default argument. */
18960 {
18962 /* If we are defining a class, then the tokens that make up the
18963 default argument must be saved and processed later. */
18968 /* Outside of a class definition, we can just parse the
18969 assignment-expression. */
18970 else
18971 default_argument
18975 {
18978 else
18979 {
18981 "default arguments are only "
18984 }
18985 }
18989 {
18990 /* Find the name of the parameter pack. */
18997 template_parm_p
19003 else
19005 template_parm_p
19012 }
19013 }
19014 else
19018 declarator,
19019 default_argument);
19020 }
19022 /* Parse a default argument and return it.
19024 TEMPLATE_PARM_P is true if this is a default argument for a
19025 non-type template parameter. */
19026 static tree
19028 {
19034 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19035 set correctly. */
19038 /* Local variable names (and the `this' keyword) may not
19039 appear in a default argument. */
19042 /* Parse the assignment-expression. */
19047 /* The "this" pointer is not valid in a default argument. */
19049 {
19054 }
19055 default_argument
19057 /* Restore the "this" pointer. */
19059 {
19062 }
19071 }
19073 /* Parse a function-body.
19075 function-body:
19076 compound_statement */
19078 static void
19080 {
19082 }
19084 /* Parse a ctor-initializer-opt followed by a function-body. Return
19085 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19086 is true we are parsing a function-try-block. */
19088 static bool
19091 {
19099 /* Begin the function body. */
19101 /* Parse the optional ctor-initializer. */
19104 /* If we're parsing a constexpr constructor definition, we need
19105 to check that the constructor body is indeed empty. However,
19106 before we get to cp_parser_function_body lot of junk has been
19107 generated, so we can't just check that we have an empty block.
19108 Rather we take a snapshot of the outermost block, and check whether
19109 cp_parser_function_body changed its state. */
19111 {
19115 }
19116 /* Parse the function-body. */
19120 /* Finish the function body. */
19124 }
19126 /* Parse an initializer.
19128 initializer:
19129 = initializer-clause
19130 ( expression-list )
19132 Returns an expression representing the initializer. If no
19133 initializer is present, NULL_TREE is returned.
19135 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19136 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19137 set to TRUE if there is no initializer present. If there is an
19138 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19139 is set to true; otherwise it is set to false. */
19141 static tree
19144 {
19146 tree init;
19148 /* Peek at the next token. */
19151 /* Let our caller know whether or not this initializer was
19152 parenthesized. */
19154 /* Assume that the initializer is constant. */
19158 {
19159 /* Consume the `='. */
19161 /* Parse the initializer-clause. */
19163 }
19165 {
19170 non_constant_p);
19175 }
19177 {
19182 }
19183 else
19184 {
19185 /* Anything else is an error. */
19188 }
19191 }
19193 /* Parse an initializer-clause.
19195 initializer-clause:
19196 assignment-expression
19197 braced-init-list
19199 Returns an expression representing the initializer.
19201 If the `assignment-expression' production is used the value
19202 returned is simply a representation for the expression.
19204 Otherwise, calls cp_parser_braced_list. */
19206 static tree
19208 {
19209 tree initializer;
19211 /* Assume the expression is constant. */
19214 /* If it is not a `{', then we are looking at an
19215 assignment-expression. */
19217 {
19218 initializer
19221 non_constant_p);
19222 }
19223 else
19227 }
19229 /* Parse a brace-enclosed initializer list.
19231 braced-init-list:
19232 { initializer-list , [opt] }
19233 { }
19235 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19236 the elements of the initializer-list (or NULL, if the last
19237 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19238 NULL_TREE. There is no way to detect whether or not the optional
19239 trailing `,' was provided. NON_CONSTANT_P is as for
19240 cp_parser_initializer. */
19242 static tree
19244 {
19245 tree initializer;
19247 /* Consume the `{' token. */
19249 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19251 /* If it's not a `}', then there is a non-trivial initializer. */
19253 {
19254 /* Parse the initializer list. */
19257 /* A trailing `,' token is allowed. */
19260 }
19261 else
19263 /* Now, there should be a trailing `}'. */
19267 }
19269 /* Consume tokens up to, and including, the next non-nested closing `]'.
19270 Returns true iff we found a closing `]'. */
19272 static bool
19274 {
19278 {
19282 {
19285 /* If we've run out of tokens, then there is no closing `]'. */
19294 {
19297 }
19302 }
19304 /* Consume the token. */
19306 }
19307 }
19309 /* Return true if we are looking at an array-designator, false otherwise. */
19311 static bool
19313 {
19314 /* Consume the `['. */
19319 /* Skip tokens until the next token is a closing square bracket.
19320 If we find the closing `]', and the next token is a `=', then
19321 we are looking at an array designator. */
19322 bool array_designator_p
19326 /* Roll back the tokens we skipped. */
19330 }
19332 /* Parse an initializer-list.
19334 initializer-list:
19335 initializer-clause ... [opt]
19336 initializer-list , initializer-clause ... [opt]
19338 GNU Extension:
19340 initializer-list:
19341 designation initializer-clause ...[opt]
19342 initializer-list , designation initializer-clause ...[opt]
19344 designation:
19345 . identifier =
19346 identifier :
19347 [ constant-expression ] =
19349 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19350 for the initializer. If the INDEX of the elt is non-NULL, it is the
19351 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19352 as for cp_parser_initializer. */
19356 {
19359 /* Assume all of the expressions are constant. */
19362 /* Parse the rest of the list. */
19364 {
19366 tree designator;
19367 tree initializer;
19370 /* If the next token is an identifier and the following one is a
19371 colon, we are looking at the GNU designated-initializer
19372 syntax. */
19376 {
19377 /* Warn the user that they are using an extension. */
19380 /* Consume the identifier. */
19382 /* Consume the `:'. */
19384 }
19385 /* Also handle the C99 syntax, '. id ='. */
19390 {
19391 /* Warn the user that they are using an extension. */
19394 /* Consume the `.'. */
19396 /* Consume the identifier. */
19398 /* Consume the `='. */
19400 }
19401 /* Also handle C99 array designators, '[ const ] ='. */
19405 {
19406 /* In C++11, [ could start a lambda-introducer. */
19412 {
19415 }
19416 else
19417 {
19422 }
19428 }
19429 else
19432 /* Parse the initializer. */
19435 /* If any clause is non-constant, so is the entire initializer. */
19439 /* If we have an ellipsis, this is an initializer pack
19440 expansion. */
19442 {
19443 /* Consume the `...'. */
19446 /* Turn the initializer into an initializer expansion. */
19448 }
19450 /* Add it to the vector. */
19453 /* If the next token is not a comma, we have reached the end of
19454 the list. */
19458 /* Peek at the next token. */
19460 /* If the next token is a `}', then we're still done. An
19461 initializer-clause can have a trailing `,' after the
19462 initializer-list and before the closing `}'. */
19466 /* Consume the `,' token. */
19468 }
19471 }
19473 /* Classes [gram.class] */
19475 /* Parse a class-name.
19477 class-name:
19478 identifier
19479 template-id
19481 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19482 to indicate that names looked up in dependent types should be
19483 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19484 keyword has been used to indicate that the name that appears next
19485 is a template. TAG_TYPE indicates the explicit tag given before
19486 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19487 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19488 is the class being defined in a class-head.
19490 Returns the TYPE_DECL representing the class. */
19492 static tree
19500 {
19501 tree decl;
19502 tree scope;
19507 /* All class-names start with an identifier. */
19510 {
19513 }
19515 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19516 to a template-id, so we save it here. */
19521 /* Any name names a type if we're following the `typename' keyword
19522 in a qualified name where the enclosing scope is type-dependent. */
19525 /* Handle the common case (an identifier, but not a template-id)
19526 efficiently. */
19529 {
19533 /* Look for the identifier. */
19537 /* If the next token isn't an identifier, we are certainly not
19538 looking at a class-name. */
19541 /* If we know this is a type-name, there's no need to look it
19542 up. */
19545 else
19546 {
19547 tree ambiguous_decls;
19548 /* If we already know that this lookup is ambiguous, then
19549 we've already issued an error message; there's no reason
19550 to check again. */
19552 {
19555 }
19556 /* If the next token is a `::', then the name must be a type
19557 name.
19559 [basic.lookup.qual]
19561 During the lookup for a name preceding the :: scope
19562 resolution operator, object, function, and enumerator
19563 names are ignored. */
19566 /* Look up the name. */
19568 tag_type,
19571 check_dependency_p,
19575 {
19579 }
19580 }
19581 }
19582 else
19583 {
19584 /* Try a template-id. */
19586 check_dependency_p,
19587 tag_type,
19588 is_declaration);
19591 }
19595 /* If this is a typename, create a TYPENAME_TYPE. */
19597 {
19602 }
19606 /* Check to see that it is really the name of a class. */
19610 /* Situations like this:
19612 template <typename T> struct A {
19613 typename T::template X<int>::I i;
19614 };
19616 are problematic. Is `T::template X<int>' a class-name? The
19617 standard does not seem to be definitive, but there is no other
19618 valid interpretation of the following `::'. Therefore, those
19619 names are considered class-names. */
19620 {
19624 }
19628 /* In Objective-C 2.0, a classname followed by '.' starts a
19629 dot-syntax expression, and it's not a type-name. */
19641 }
19643 /* Parse a class-specifier.
19645 class-specifier:
19646 class-head { member-specification [opt] }
19648 Returns the TREE_TYPE representing the class. */
19650 static tree
19652 {
19653 tree type;
19667 /* Parse the class-head. */
19670 /* If the class-head was a semantic disaster, skip the entire body
19671 of the class. */
19673 {
19677 }
19679 /* Look for the `{'. */
19681 {
19684 }
19688 /* Issue an error message if type-definitions are forbidden here. */
19690 /* Remember that we are defining one more class. */
19692 /* Inside the class, surrounding template-parameter-lists do not
19693 apply. */
19694 saved_num_template_parameter_lists
19697 /* We are not in a function body. */
19700 /* Or in a loop. */
19703 /* Or in a switch. */
19706 /* We are not immediately inside an extern "lang" block. */
19707 saved_in_unbraced_linkage_specification_p
19711 /* Start the class. */
19713 {
19716 }
19720 /* If the type is erroneous, skip the entire body of the class. */
19722 else
19723 /* Parse the member-specification. */
19726 /* Look for the trailing `}'. */
19728 /* Look for trailing attributes to apply to this class. */
19736 /* We've finished a type definition. Check for the common syntax
19737 error of forgetting a semicolon after the definition. We need to
19738 be careful, as we can't just check for not-a-semicolon and be done
19739 with it; the user might have typed:
19741 class X { } c = ...;
19742 class X { } *p = ...;
19744 and so forth. Instead, enumerate all the possible tokens that
19745 might follow this production; if we don't see one of them, then
19746 complain and silently insert the semicolon. */
19747 {
19752 /* Don't try to parse c++11 attributes here. As per the
19753 grammar, that should be a task for
19754 cp_parser_decl_specifier_seq. */
19758 {
19769 /* While it's legal for type qualifiers and storage class
19770 specifiers to follow type definitions in the grammar, only
19771 compiler testsuites contain code like that. Assume that if
19772 we see such code, then what we're really seeing is a case
19773 like:
19775 class X { }
19776 const <type> var = ...;
19778 or
19780 class Y { }
19781 static <type> func (...) ...
19783 i.e. the qualifier or specifier applies to the next
19784 declaration. To do so, however, we need to look ahead one
19785 more token to see if *that* token is a type specifier.
19787 This code could be improved to handle:
19789 class Z { }
19790 static const <type> var = ...; */
19793 {
19796 /* Handling user-defined types here would be nice, but very
19797 tricky. */
19798 want_semicolon
19801 }
19805 }
19807 /* If we don't have a type, then something is very wrong and we
19808 shouldn't try to do anything clever. Likewise for not seeing the
19809 closing brace. */
19811 {
19812 cp_token_position prev
19823 else
19826 /* Unget one token and smash it to look as though we encountered
19827 a semicolon in the input stream. */
19832 }
19833 }
19835 /* If this class is not itself within the scope of another class,
19836 then we need to parse the bodies of all of the queued function
19837 definitions. Note that the queued functions defined in a class
19838 are not always processed immediately following the
19839 class-specifier for that class. Consider:
19841 struct A {
19842 struct B { void f() { sizeof (A); } };
19843 };
19845 If `f' were processed before the processing of `A' were
19846 completed, there would be no way to compute the size of `A'.
19847 Note that the nesting we are interested in here is lexical --
19848 not the semantic nesting given by TYPE_CONTEXT. In particular,
19849 for:
19851 struct A { struct B; };
19852 struct A::B { void f() { } };
19854 there is no need to delay the parsing of `A::B::f'. */
19856 {
19857 tree decl;
19864 /* In a first pass, parse default arguments to the functions.
19865 Then, in a second pass, parse the bodies of the functions.
19866 This two-phased approach handles cases like:
19868 struct S {
19869 void f() { g(); }
19870 void g(int i = 3);
19871 };
19873 */
19875 {
19877 /* If there are default arguments that have not yet been processed,
19878 take care of them now. */
19880 {
19885 }
19886 /* Make sure that any template parameters are in scope. */
19888 /* Parse the default argument expressions. */
19890 /* Remove any template parameters from the symbol table. */
19892 }
19894 /* Now parse any NSDMIs. */
19898 {
19900 {
19905 }
19908 }
19915 /* Now do some post-NSDMI bookkeeping. */
19921 /* Now parse the body of the functions. */
19923 {
19924 /* OpenMP UDRs need to be parsed before all other functions. */
19931 }
19932 else
19936 }
19937 else
19940 /* Put back any saved access checks. */
19943 /* Restore saved state. */
19947 parser->num_template_parameter_lists
19949 parser->in_unbraced_linkage_specification_p
19953 }
19955 static tree
19957 {
19958 tree ret;
19963 }
19965 /* Parse a class-head.
19967 class-head:
19968 class-key identifier [opt] base-clause [opt]
19969 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19970 class-key nested-name-specifier [opt] template-id
19971 base-clause [opt]
19973 class-virt-specifier:
19974 final
19976 GNU Extensions:
19977 class-key attributes identifier [opt] base-clause [opt]
19978 class-key attributes nested-name-specifier identifier base-clause [opt]
19979 class-key attributes nested-name-specifier [opt] template-id
19980 base-clause [opt]
19982 Upon return BASES is initialized to the list of base classes (or
19983 NULL, if there are none) in the same form returned by
19984 cp_parser_base_clause.
19986 Returns the TYPE of the indicated class. Sets
19987 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19988 involving a nested-name-specifier was used, and FALSE otherwise.
19990 Returns error_mark_node if this is not a class-head.
19992 Returns NULL_TREE if the class-head is syntactically valid, but
19993 semantically invalid in a way that means we should skip the entire
19994 body of the class. */
19996 static tree
19999 {
20000 tree nested_name_specifier;
20004 tree attributes;
20005 tree bases;
20015 /* Assume no nested-name-specifier will be present. */
20017 /* Assume no template parameter lists will be used in defining the
20018 type. */
20022 /* Look for the class-key. */
20027 /* Parse the attributes. */
20030 /* If the next token is `::', that is invalid -- but sometimes
20031 people do try to write:
20033 struct ::S {};
20035 Handle this gracefully by accepting the extra qualifier, and then
20036 issuing an error about it later if this really is a
20037 class-head. If it turns out just to be an elaborated type
20038 specifier, remain silent. */
20044 /* Determine the name of the class. Begin by looking for an
20045 optional nested-name-specifier. */
20047 nested_name_specifier
20053 /* If there was a nested-name-specifier, then there *must* be an
20054 identifier. */
20056 {
20058 /* Although the grammar says `identifier', it really means
20059 `class-name' or `template-name'. You are only allowed to
20060 define a class that has already been declared with this
20061 syntax.
20063 The proposed resolution for Core Issue 180 says that wherever
20064 you see `class T::X' you should treat `X' as a type-name.
20066 It is OK to define an inaccessible class; for example:
20068 class A { class B; };
20069 class A::B {};
20071 We do not know if we will see a class-name, or a
20072 template-name. We look for a class-name first, in case the
20073 class-name is a template-id; if we looked for the
20074 template-name first we would stop after the template-name. */
20079 class_type,
20083 /* If that didn't work, ignore the nested-name-specifier. */
20085 {
20091 }
20092 /* If we could not find a corresponding TYPE, treat this
20093 declaration like an unqualified declaration. */
20096 /* Otherwise, count the number of templates used in TYPE and its
20097 containing scopes. */
20098 else
20099 {
20100 tree scope;
20112 }
20113 }
20114 /* Otherwise, the identifier is optional. */
20115 else
20116 {
20117 /* We don't know whether what comes next is a template-id,
20118 an identifier, or nothing at all. */
20120 /* Check for a template-id. */
20125 class_key,
20127 /* If that didn't work, it could still be an identifier. */
20129 {
20131 {
20134 }
20135 else
20137 }
20138 else
20139 {
20142 }
20143 }
20148 {
20150 class_key,
20152 }
20155 /* If it's not a `:' or a `{' then we can't really be looking at a
20156 class-head, since a class-head only appears as part of a
20157 class-specifier. We have to detect this situation before calling
20158 xref_tag, since that has irreversible side-effects. */
20160 {
20164 }
20166 /* At this point, we're going ahead with the class-specifier, even
20167 if some other problem occurs. */
20170 {
20175 }
20176 /* Issue the error about the overly-qualified name now. */
20178 {
20183 }
20185 {
20190 }
20192 {
20193 tree scope;
20195 /* Reject typedef-names in class heads. */
20197 {
20200 type);
20203 }
20205 /* Figure out in what scope the declaration is being placed. */
20207 /* If that scope does not contain the scope in which the
20208 class was originally declared, the program is invalid. */
20210 {
20213 "declaration of %qD in namespace %qD which does not "
20216 else
20222 }
20223 /* [dcl.meaning]
20225 A declarator-id shall not be qualified except for the
20226 definition of a ... nested class outside of its class
20227 ... [or] the definition or explicit instantiation of a
20228 class member of a namespace outside of its namespace. */
20230 {
20235 }
20236 }
20237 /* An explicit-specialization must be preceded by "template <>". If
20238 it is not, try to recover gracefully. */
20242 {
20246 /* Take the same action that would have been taken by
20247 cp_parser_explicit_specialization. */
20250 }
20251 /* There must be no "return" statements between this point and the
20252 end of this function; set "type "to the correct return value and
20253 use "goto done;" to return. */
20254 /* Make sure that the right number of template parameters were
20255 present. */
20259 {
20260 /* If something went wrong, there is no point in even trying to
20261 process the class-definition. */
20264 }
20266 /* Look up the type. */
20268 {
20272 {
20276 }
20277 else
20278 {
20281 }
20284 }
20286 {
20287 tree class_type;
20289 /* Given:
20291 template <typename T> struct S { struct T };
20292 template <typename T> struct S<T>::T { };
20294 we will get a TYPENAME_TYPE when processing the definition of
20295 `S::T'. We need to resolve it to the actual type before we
20296 try to define it. */
20298 {
20303 else
20304 {
20307 }
20308 }
20312 {
20315 }
20318 /* Enter the scope indicated by the nested-name-specifier. */
20320 /* Get the canonical version of this type. */
20322 /* Call push_template_decl if it seems like we should be defining a
20323 template either from the template headers or the type we're
20324 defining, so that we diagnose both extra and missing headers. */
20328 {
20331 {
20334 }
20335 }
20339 }
20341 {
20342 /* If the class was unnamed, create a dummy name. */
20347 }
20349 /* Indicate whether this class was declared as a `class' or as a
20350 `struct'. */
20355 /* If this type was already complete, and we see another definition,
20356 that's an error. */
20358 {
20360 type);
20362 type);
20365 }
20370 {
20371 /* Apply attributes now, before any use of the class as a template
20372 argument in its base list. */
20375 }
20377 /* We will have entered the scope containing the class; the names of
20378 base classes should be looked up in that context. For example:
20380 struct A { struct B {}; struct C; };
20381 struct A::C : B {};
20383 is valid. */
20385 /* Get the list of base-classes, if there is one. */
20387 {
20388 /* PR59482: enter the class scope so that base-specifiers are looked
20389 up correctly. */
20393 /* PR59482: get out of the previously pushed class scope so that the
20394 subsequent pops pop the right thing. */
20397 }
20398 else
20401 /* If we're really defining a class, process the base classes.
20402 If they're invalid, fail. */
20407 done:
20408 /* Leave the scope given by the nested-name-specifier. We will
20409 enter the class scope itself while processing the members. */
20414 {
20417 }
20423 out:
20426 }
20428 /* Parse a class-key.
20430 class-key:
20431 class
20432 struct
20433 union
20435 Returns the kind of class-key specified, or none_type to indicate
20436 error. */
20438 static enum tag_types
20440 {
20444 /* Look for the class-key. */
20449 /* Check to see if the TOKEN is a class-key. */
20454 }
20456 /* Parse a type-parameter-key.
20458 type-parameter-key:
20459 class
20460 typename
20461 */
20463 static void
20465 {
20466 /* Look for the type-parameter-key. */
20470 {
20473 /* typename is not allowed in a template template parameter
20474 by the standard until C++1Z. */
20476 "ISO C++ forbids typename key in template template parameter;"
20478 }
20479 else
20483 }
20485 /* Parse an (optional) member-specification.
20487 member-specification:
20488 member-declaration member-specification [opt]
20489 access-specifier : member-specification [opt] */
20491 static void
20493 {
20495 {
20499 /* Peek at the next token. */
20501 /* If it's a `}', or EOF then we've seen all the members. */
20507 /* See if this token is a keyword. */
20510 {
20514 /* Consume the access-specifier. */
20516 /* Remember which access-specifier is active. */
20518 /* Look for the `:'. */
20523 /* Accept #pragmas at class scope. */
20525 {
20528 }
20530 /* Otherwise, the next construction must be a
20531 member-declaration. */
20533 }
20534 }
20535 }
20537 /* Parse a member-declaration.
20539 member-declaration:
20540 decl-specifier-seq [opt] member-declarator-list [opt] ;
20541 function-definition ; [opt]
20542 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20543 using-declaration
20544 template-declaration
20545 alias-declaration
20547 member-declarator-list:
20548 member-declarator
20549 member-declarator-list , member-declarator
20551 member-declarator:
20552 declarator pure-specifier [opt]
20553 declarator constant-initializer [opt]
20554 identifier [opt] : constant-expression
20556 GNU Extensions:
20558 member-declaration:
20559 __extension__ member-declaration
20561 member-declarator:
20562 declarator attributes [opt] pure-specifier [opt]
20563 declarator attributes [opt] constant-initializer [opt]
20564 identifier [opt] attributes [opt] : constant-expression
20566 C++0x Extensions:
20568 member-declaration:
20569 static_assert-declaration */
20571 static void
20573 {
20574 cp_decl_specifier_seq decl_specifiers;
20575 tree prefix_attributes;
20576 tree decl;
20585 /* Check for the `__extension__' keyword. */
20587 {
20588 /* Recurse. */
20590 /* Restore the old value of the PEDANTIC flag. */
20594 }
20596 /* Check for a template-declaration. */
20598 {
20599 /* An explicit specialization here is an error condition, and we
20600 expect the specialization handler to detect and report this. */
20604 else
20608 }
20610 /* Check for a using-declaration. */
20612 {
20614 {
20615 /* Parse the using-declaration. */
20619 }
20620 else
20621 {
20622 tree decl;
20626 /* Note that if we actually see the '=' token after the
20627 identifier, cp_parser_alias_declaration commits the
20628 tentative parse. In that case, we really expects an
20629 alias-declaration. Otherwise, we expect a using
20630 declaration. */
20631 alias_decl_expected =
20637 else
20641 }
20642 }
20644 /* Check for @defs. */
20646 {
20651 {
20656 }
20658 }
20660 /* If the next token is `static_assert' we have a static assertion. */
20662 {
20665 }
20672 /* Parse the decl-specifier-seq. */
20675 CP_PARSER_FLAGS_OPTIONAL,
20678 /* Check for an invalid type-name. */
20682 /* If there is no declarator, then the decl-specifier-seq should
20683 specify a type. */
20685 {
20686 /* If there was no decl-specifier-seq, and the next token is a
20687 `;', then we have something like:
20689 struct S { ; };
20691 [class.mem]
20693 Each member-declaration shall declare at least one member
20694 name of the class. */
20696 {
20700 }
20701 else
20702 {
20703 tree type;
20705 /* See if this declaration is a friend. */
20707 /* If there were decl-specifiers, check to see if there was
20708 a class-declaration. */
20711 /* Nested classes have already been added to the class, but
20712 a `friend' needs to be explicitly registered. */
20714 {
20715 /* If the `friend' keyword was present, the friend must
20716 be introduced with a class-key. */
20719 "in C++03 a class-key must be used "
20721 /* In this case:
20723 template <typename T> struct A {
20724 friend struct A<T>::B;
20725 };
20727 A<T>::B will be represented by a TYPENAME_TYPE, and
20728 therefore not recognized by check_tag_decl. */
20730 {
20734 }
20737 "friend declaration does not name a class or "
20739 else
20742 }
20743 /* If there is no TYPE, an error message will already have
20744 been issued. */
20746 ;
20747 /* An anonymous aggregate has to be handled specially; such
20748 a declaration really declares a data member (with a
20749 particular type), as opposed to a nested class. */
20751 {
20752 /* C++11 9.5/6. */
20755 "a storage class on an anonymous aggregate "
20758 /* Remove constructors and such from TYPE, now that we
20759 know it is an anonymous aggregate. */
20761 /* And make the corresponding data member. */
20764 /* Add it to the class. */
20766 }
20767 else
20768 cp_parser_check_access_in_redeclaration
20771 }
20772 }
20773 else
20774 {
20777 /* Clear attributes from the decl_specifiers but keep them
20778 around as prefix attributes that apply them to the entity
20779 being declared. */
20783 /* See if these declarations will be friends. */
20786 /* Keep going until we hit the `;' at the end of the
20787 declaration. */
20789 {
20791 tree first_attribute;
20793 /* Peek at the next token. */
20796 /* Check for a bitfield declaration. */
20801 {
20802 tree identifier;
20803 tree width;
20805 /* Get the name of the bitfield. Note that we cannot just
20806 check TOKEN here because it may have been invalidated by
20807 the call to cp_lexer_peek_nth_token above. */
20810 else
20813 /* Consume the `:' token. */
20815 /* Get the width of the bitfield. */
20816 width
20819 /* Look for attributes that apply to the bitfield. */
20821 /* Remember which attributes are prefix attributes and
20822 which are not. */
20824 /* Combine the attributes. */
20827 /* Create the bitfield declaration. */
20830 identifier,
20831 sfk_none)
20834 width,
20835 attributes);
20836 }
20837 else
20838 {
20840 tree initializer;
20841 tree asm_specification;
20844 /* Parse the declarator. */
20845 declarator
20850 friend_p);
20852 /* If something went wrong parsing the declarator, make sure
20853 that we at least consume some tokens. */
20855 {
20856 /* Skip to the end of the statement. */
20858 /* If the next token is not a semicolon, that is
20859 probably because we just skipped over the body of
20860 a function. So, we consume a semicolon if
20861 present, but do not issue an error message if it
20862 is not present. */
20864 CPP_SEMICOLON))
20867 }
20870 cp_parser_check_for_definition_in_return_type
20874 /* Look for an asm-specification. */
20876 /* Look for attributes that apply to the declaration. */
20878 /* Remember which attributes are prefix attributes and
20879 which are not. */
20881 /* Combine the attributes. */
20884 /* If it's an `=', then we have a constant-initializer or a
20885 pure-specifier. It is not correct to parse the
20886 initializer before registering the member declaration
20887 since the member declaration should be in scope while
20888 its initializer is processed. However, the rest of the
20889 front end does not yet provide an interface that allows
20890 us to handle this correctly. */
20892 {
20893 /* In [class.mem]:
20895 A pure-specifier shall be used only in the declaration of
20896 a virtual function.
20898 A member-declarator can contain a constant-initializer
20899 only if it declares a static member of integral or
20900 enumeration type.
20902 Therefore, if the DECLARATOR is for a function, we look
20903 for a pure-specifier; otherwise, we look for a
20904 constant-initializer. When we call `grokfield', it will
20905 perform more stringent semantics checks. */
20917 {
20919 /* Don't require a constant rvalue in C++11, since we
20920 might want a reference constant. We'll enforce
20921 constancy later. */
20923 /* Parse the initializer. */
20926 }
20927 else
20928 /* Parse the initializer. */
20930 }
20933 {
20937 else
20939 }
20940 /* Otherwise, there is no initializer. */
20941 else
20944 /* See if we are probably looking at a function
20945 definition. We are certainly not looking at a
20946 member-declarator. Calling `grokfield' has
20947 side-effects, so we must not do it unless we are sure
20948 that we are looking at a member-declarator. */
20951 {
20952 /* The grammar does not allow a pure-specifier to be
20953 used when a member function is defined. (It is
20954 possible that this fact is an oversight in the
20955 standard, since a pure function may be defined
20956 outside of the class-specifier. */
20962 declarator,
20963 attributes);
20966 /* If the member was not a friend, declare it here. */
20969 /* Peek at the next token. */
20971 /* If the next token is a semicolon, consume it. */
20975 }
20976 else
20979 /* Create the declaration. */
20984 {
20987 else
20989 }
20990 }
20994 /* Reset PREFIX_ATTRIBUTES. */
21000 /* If there is any qualification still in effect, clear it
21001 now; we will be starting fresh with the next declarator. */
21005 /* If it's a `,', then there are more declarators. */
21007 {
21010 {
21014 }
21015 }
21016 /* If the next token isn't a `;', then we have a parse error. */
21018 CPP_SEMICOLON))
21019 {
21020 /* The next token might be a ways away from where the
21021 actual semicolon is missing. Find the previous token
21022 and use that for our error position. */
21027 /* Assume that the user meant to provide a semicolon. If
21028 we were to cp_parser_skip_to_end_of_statement, we might
21029 skip to a semicolon inside a member function definition
21030 and issue nonsensical error messages. */
21032 }
21035 {
21036 /* Add DECL to the list of members. */
21045 /* Add DECL to the queue of NSDMI to be parsed later. */
21047 }
21051 }
21052 }
21055 out:
21057 }
21059 /* Parse a pure-specifier.
21061 pure-specifier:
21062 = 0
21064 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21065 Otherwise, ERROR_MARK_NODE is returned. */
21067 static tree
21069 {
21072 /* Look for the `=' token. */
21075 /* Look for the `0' token. */
21084 /* Accept = default or = delete in c++0x mode. */
21087 {
21090 }
21092 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21094 {
21099 }
21101 {
21104 }
21107 }
21109 /* Parse a constant-initializer.
21111 constant-initializer:
21112 = constant-expression
21114 Returns a representation of the constant-expression. */
21116 static tree
21118 {
21119 /* Look for the `=' token. */
21123 /* It is invalid to write:
21125 struct S { static const int i = { 7 }; };
21127 */
21129 {
21132 /* Consume the opening brace. */
21134 /* Skip the initializer. */
21136 /* Look for the trailing `}'. */
21140 }
21143 }
21145 /* Derived classes [gram.class.derived] */
21147 /* Parse a base-clause.
21149 base-clause:
21150 : base-specifier-list
21152 base-specifier-list:
21153 base-specifier ... [opt]
21154 base-specifier-list , base-specifier ... [opt]
21156 Returns a TREE_LIST representing the base-classes, in the order in
21157 which they were declared. The representation of each node is as
21158 described by cp_parser_base_specifier.
21160 In the case that no bases are specified, this function will return
21161 NULL_TREE, not ERROR_MARK_NODE. */
21163 static tree
21165 {
21168 /* Look for the `:' that begins the list. */
21171 /* Scan the base-specifier-list. */
21173 {
21175 tree base;
21178 /* Look for the base-specifier. */
21180 /* Look for the (optional) ellipsis. */
21182 {
21183 /* Consume the `...'. */
21187 }
21189 /* Add BASE to the front of the list. */
21191 {
21193 /* Make this a pack expansion type. */
21197 {
21200 }
21201 }
21202 /* Peek at the next token. */
21204 /* If it's not a comma, then the list is complete. */
21207 /* Consume the `,'. */
21209 }
21211 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21212 base class had a qualified name. However, the next name that
21213 appears is certainly not qualified. */
21219 }
21221 /* Parse a base-specifier.
21223 base-specifier:
21224 :: [opt] nested-name-specifier [opt] class-name
21225 virtual access-specifier [opt] :: [opt] nested-name-specifier
21226 [opt] class-name
21227 access-specifier virtual [opt] :: [opt] nested-name-specifier
21228 [opt] class-name
21230 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21231 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21232 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21233 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21235 static tree
21237 {
21245 tree type;
21247 /* Process the optional `virtual' and `access-specifier'. */
21249 {
21250 /* Peek at the next token. */
21252 /* Process `virtual'. */
21254 {
21256 /* If `virtual' appears more than once, issue an error. */
21258 {
21262 }
21266 /* Consume the `virtual' token. */
21274 /* If more than one access specifier appears, issue an
21275 error. */
21278 {
21282 }
21286 /* Consume the access-specifier. */
21294 }
21295 }
21296 /* It is not uncommon to see programs mechanically, erroneously, use
21297 the 'typename' keyword to denote (dependent) qualified types
21298 as base classes. */
21300 {
21305 else
21307 "keyword %<typename%> not allowed in this context "
21310 }
21312 /* Look for the optional `::' operator. */
21314 /* Look for the nested-name-specifier. The simplest way to
21315 implement:
21317 [temp.res]
21319 The keyword `typename' is not permitted in a base-specifier or
21320 mem-initializer; in these contexts a qualified name that
21321 depends on a template-parameter is implicitly assumed to be a
21322 type name.
21324 is to pretend that we have seen the `typename' keyword at this
21325 point. */
21329 typename_type,
21331 /* If the base class is given by a qualified name, assume that names
21332 we see are type names or templates, as appropriate. */
21338 /* DR 950 allows decltype as a base-specifier. */
21340 else
21341 {
21342 /* Otherwise, look for the class-name. */
21344 class_scope_p,
21345 template_p,
21346 typename_type,
21351 }
21357 }
21359 /* Exception handling [gram.exception] */
21361 /* Parse an (optional) noexcept-specification.
21363 noexcept-specification:
21364 noexcept ( constant-expression ) [opt]
21366 If no noexcept-specification is present, returns NULL_TREE.
21367 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21368 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21369 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21370 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21371 in which case a boolean condition is returned instead. */
21373 static tree
21378 {
21382 /* Peek at the next token. */
21385 /* Is it a noexcept-specification? */
21387 {
21388 tree expr;
21392 {
21396 {
21397 /* Types may not be defined in an exception-specification. */
21399 parser->type_definition_forbidden_message
21404 /* Restore the saved message. */
21406 }
21407 else
21408 {
21411 }
21414 }
21415 else
21416 {
21420 }
21422 /* We cannot build a noexcept-spec right away because this will check
21423 that expr is a constexpr. */
21426 else
21428 }
21429 else
21431 }
21433 /* Parse an (optional) exception-specification.
21435 exception-specification:
21436 throw ( type-id-list [opt] )
21438 Returns a TREE_LIST representing the exception-specification. The
21439 TREE_VALUE of each node is a type. */
21441 static tree
21443 {
21445 tree type_id_list;
21448 /* Peek at the next token. */
21451 /* Is it a noexcept-specification? */
21457 /* If it's not `throw', then there's no exception-specification. */
21461 #if 0
21462 /* Enable this once a lot of code has transitioned to noexcept? */
21466 #endif
21468 /* Consume the `throw'. */
21471 /* Look for the `('. */
21474 /* Peek at the next token. */
21476 /* If it's not a `)', then there is a type-id-list. */
21478 {
21479 /* Types may not be defined in an exception-specification. */
21481 parser->type_definition_forbidden_message
21483 /* Parse the type-id-list. */
21485 /* Restore the saved message. */
21487 }
21488 else
21491 /* Look for the `)'. */
21495 }
21497 /* Parse an (optional) type-id-list.
21499 type-id-list:
21500 type-id ... [opt]
21501 type-id-list , type-id ... [opt]
21503 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21504 in the order that the types were presented. */
21506 static tree
21508 {
21512 {
21514 tree type;
21516 /* Get the next type-id. */
21518 /* Parse the optional ellipsis. */
21520 {
21521 /* Consume the `...'. */
21524 /* Turn the type into a pack expansion expression. */
21526 }
21527 /* Add it to the list. */
21529 /* Peek at the next token. */
21531 /* If it is not a `,', we are done. */
21534 /* Consume the `,'. */
21536 }
21539 }
21541 /* Parse a try-block.
21543 try-block:
21544 try compound-statement handler-seq */
21546 static tree
21548 {
21549 tree try_block;
21563 }
21565 /* Parse a function-try-block.
21567 function-try-block:
21568 try ctor-initializer [opt] function-body handler-seq */
21570 static bool
21572 {
21573 tree compound_stmt;
21574 tree try_block;
21577 /* Look for the `try' keyword. */
21580 /* Let the rest of the front end know where we are. */
21582 /* Parse the function-body. */
21583 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21585 /* We're done with the `try' part. */
21587 /* Parse the handlers. */
21589 /* We're done with the handlers. */
21593 }
21595 /* Parse a handler-seq.
21597 handler-seq:
21598 handler handler-seq [opt] */
21600 static void
21602 {
21604 {
21607 /* Parse the handler. */
21609 /* Peek at the next token. */
21611 /* If it's not `catch' then there are no more handlers. */
21614 }
21615 }
21617 /* Parse a handler.
21619 handler:
21620 catch ( exception-declaration ) compound-statement */
21622 static void
21624 {
21625 tree handler;
21626 tree declaration;
21636 }
21638 /* Parse an exception-declaration.
21640 exception-declaration:
21641 type-specifier-seq declarator
21642 type-specifier-seq abstract-declarator
21643 type-specifier-seq
21644 ...
21646 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21647 ellipsis variant is used. */
21649 static tree
21651 {
21652 cp_decl_specifier_seq type_specifiers;
21656 /* If it's an ellipsis, it's easy to handle. */
21658 {
21659 /* Consume the `...' token. */
21662 }
21664 /* Types may not be defined in exception-declarations. */
21666 parser->type_definition_forbidden_message
21669 /* Parse the type-specifier-seq. */
21673 /* If it's a `)', then there is no declarator. */
21676 else
21683 /* Restore the saved message. */
21690 }
21692 /* Parse a throw-expression.
21694 throw-expression:
21695 throw assignment-expression [opt]
21697 Returns a THROW_EXPR representing the throw-expression. */
21699 static tree
21701 {
21702 tree expression;
21707 /* Figure out whether or not there is an assignment-expression
21708 following the "throw" keyword. */
21716 else
21720 }
21722 /* GNU Extensions */
21724 /* Parse an (optional) asm-specification.
21726 asm-specification:
21727 asm ( string-literal )
21729 If the asm-specification is present, returns a STRING_CST
21730 corresponding to the string-literal. Otherwise, returns
21731 NULL_TREE. */
21733 static tree
21735 {
21737 tree asm_specification;
21739 /* Peek at the next token. */
21741 /* If the next token isn't the `asm' keyword, then there's no
21742 asm-specification. */
21746 /* Consume the `asm' token. */
21748 /* Look for the `('. */
21751 /* Look for the string-literal. */
21754 /* Look for the `)'. */
21758 }
21760 /* Parse an asm-operand-list.
21762 asm-operand-list:
21763 asm-operand
21764 asm-operand-list , asm-operand
21766 asm-operand:
21767 string-literal ( expression )
21768 [ string-literal ] string-literal ( expression )
21770 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21771 each node is the expression. The TREE_PURPOSE is itself a
21772 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21773 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21774 is a STRING_CST for the string literal before the parenthesis. Returns
21775 ERROR_MARK_NODE if any of the operands are invalid. */
21777 static tree
21779 {
21784 {
21785 tree string_literal;
21786 tree expression;
21787 tree name;
21790 {
21791 /* Consume the `[' token. */
21793 /* Read the operand name. */
21798 /* Look for the closing `]'. */
21800 }
21801 else
21803 /* Look for the string-literal. */
21806 /* Look for the `('. */
21808 /* Parse the expression. */
21810 /* Look for the `)'. */
21818 /* Add this operand to the list. */
21820 expression,
21821 asm_operands);
21822 /* If the next token is not a `,', there are no more
21823 operands. */
21826 /* Consume the `,'. */
21828 }
21831 }
21833 /* Parse an asm-clobber-list.
21835 asm-clobber-list:
21836 string-literal
21837 asm-clobber-list , string-literal
21839 Returns a TREE_LIST, indicating the clobbers in the order that they
21840 appeared. The TREE_VALUE of each node is a STRING_CST. */
21842 static tree
21844 {
21848 {
21849 tree string_literal;
21851 /* Look for the string literal. */
21853 /* Add it to the list. */
21855 /* If the next token is not a `,', then the list is
21856 complete. */
21859 /* Consume the `,' token. */
21861 }
21864 }
21866 /* Parse an asm-label-list.
21868 asm-label-list:
21869 identifier
21870 asm-label-list , identifier
21872 Returns a TREE_LIST, indicating the labels in the order that they
21873 appeared. The TREE_VALUE of each node is a label. */
21875 static tree
21877 {
21881 {
21884 /* Look for the identifier. */
21887 {
21890 {
21896 }
21897 }
21898 /* If the next token is not a `,', then the list is
21899 complete. */
21902 /* Consume the `,' token. */
21904 }
21907 }
21909 /* Return TRUE iff the next tokens in the stream are possibly the
21910 beginning of a GNU extension attribute. */
21912 static bool
21914 {
21916 }
21918 /* Return TRUE iff the next tokens in the stream are possibly the
21919 beginning of a standard C++-11 attribute specifier. */
21921 static bool
21923 {
21925 }
21927 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21928 beginning of a standard C++-11 attribute specifier. */
21930 static bool
21932 {
21940 }
21942 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21943 beginning of a GNU extension attribute. */
21945 static bool
21947 {
21951 }
21953 /* Return true iff the next tokens can be the beginning of either a
21954 GNU attribute list, or a standard C++11 attribute sequence. */
21956 static bool
21958 {
21961 }
21963 /* Return true iff the next Nth tokens can be the beginning of either
21964 a GNU attribute list, or a standard C++11 attribute sequence. */
21966 static bool
21968 {
21971 }
21973 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21974 of GNU attributes, or return NULL. */
21976 static tree
21978 {
21982 }
21984 #define CILK_SIMD_FN_CLAUSE_MASK \
21985 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21986 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21987 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21988 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21989 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21991 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21992 vector [(<clauses>)] */
21994 static void
21996 {
22000 {
22005 }
22008 {
22011 paren_scope++;
22012 }
22014 {
22017 paren_scope++;
22019 paren_scope--;
22020 /* Do not push the last ')' */
22023 }
22032 }
22034 /* Parse an (optional) series of attributes.
22036 attributes:
22037 attributes attribute
22039 attribute:
22040 __attribute__ (( attribute-list [opt] ))
22042 The return value is as for cp_parser_gnu_attribute_list. */
22044 static tree
22046 {
22050 {
22052 tree attribute_list;
22055 /* Peek at the next token. */
22057 /* If it's not `__attribute__', then we're done. */
22061 /* Consume the `__attribute__' keyword. */
22063 /* Look for the two `(' tokens. */
22067 /* Peek at the next token. */
22070 /* Parse the attribute-list. */
22072 else
22073 /* If the next token is a `)', then there is no attribute
22074 list. */
22077 /* Look for the two `)' tokens. */
22085 /* Add these new attributes to the list. */
22087 }
22090 }
22092 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22093 "__vector" or "__vector__." */
22097 {
22101 }
22103 /* Parse a GNU attribute-list.
22105 attribute-list:
22106 attribute
22107 attribute-list , attribute
22109 attribute:
22110 identifier
22111 identifier ( identifier )
22112 identifier ( identifier , expression-list )
22113 identifier ( expression-list )
22115 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22116 to an attribute. The TREE_PURPOSE of each node is the identifier
22117 indicating which attribute is in use. The TREE_VALUE represents
22118 the arguments, if any. */
22120 static tree
22122 {
22128 {
22130 tree identifier;
22131 tree attribute;
22133 /* Look for the identifier. We also allow keywords here; for
22134 example `__attribute__ ((const))' is legal. */
22138 {
22141 /* Consume the token, but save it since we need it for the
22142 SIMD enabled function parsing. */
22145 /* Save away the identifier that indicates which attribute
22146 this is. */
22148 /* For keywords, use the canonical spelling, not the
22149 parsed identifier. */
22155 /* Peek at the next token. */
22157 /* If it's an `(', then parse the attribute arguments. */
22159 {
22164 {
22167 }
22168 else
22169 vec = cp_parser_parenthesized_expression_list
22175 else
22176 {
22179 }
22180 /* Save the arguments away. */
22182 }
22184 {
22187 }
22190 {
22191 /* Add this attribute to the list. */
22194 }
22197 }
22198 /* Now, look for more attributes. If the next token isn't a
22199 `,', we're done. */
22203 /* Consume the comma and keep going. */
22205 }
22208 /* We built up the list in reverse order. */
22210 }
22212 /* Parse a standard C++11 attribute.
22214 The returned representation is a TREE_LIST which TREE_PURPOSE is
22215 the scoped name of the attribute, and the TREE_VALUE is its
22216 arguments list.
22218 Note that the scoped name of the attribute is itself a TREE_LIST
22219 which TREE_PURPOSE is the namespace of the attribute, and
22220 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22221 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22222 and which TREE_PURPOSE is directly the attribute name.
22224 Clients of the attribute code should use get_attribute_namespace
22225 and get_attribute_name to get the actual namespace and name of
22226 attributes, regardless of their being GNU or C++11 attributes.
22228 attribute:
22229 attribute-token attribute-argument-clause [opt]
22231 attribute-token:
22232 identifier
22233 attribute-scoped-token
22235 attribute-scoped-token:
22236 attribute-namespace :: identifier
22238 attribute-namespace:
22239 identifier
22241 attribute-argument-clause:
22242 ( balanced-token-seq )
22244 balanced-token-seq:
22245 balanced-token [opt]
22246 balanced-token-seq balanced-token
22248 balanced-token:
22249 ( balanced-token-seq )
22250 [ balanced-token-seq ]
22251 { balanced-token-seq }. */
22253 static tree
22255 {
22259 /* First, parse name of the the attribute, a.k.a
22260 attribute-token. */
22277 {
22278 /* We are seeing a scoped attribute token. */
22288 else
22289 {
22293 }
22295 NULL_TREE);
22297 }
22298 else
22299 {
22301 NULL_TREE);
22302 /* C++11 noreturn attribute is equivalent to GNU's. */
22305 /* C++14 deprecated attribute is equivalent to GNU's. */
22307 {
22310 "%<deprecated%> is a C++14 feature;"
22313 }
22314 }
22316 /* Now parse the optional argument clause of the attribute. */
22321 {
22327 /* A GNU attribute that takes an identifier in parameter. */
22330 vec = cp_parser_parenthesized_expression_list
22336 else
22337 {
22340 }
22344 else
22346 }
22349 }
22351 /* Parse a list of standard C++-11 attributes.
22353 attribute-list:
22354 attribute [opt]
22355 attribute-list , attribute[opt]
22356 attribute ...
22357 attribute-list , attribute ...
22358 */
22360 static tree
22362 {
22367 {
22372 {
22375 }
22380 }
22383 }
22385 /* Parse a standard C++-11 attribute specifier.
22387 attribute-specifier:
22388 [ [ attribute-list ] ]
22389 alignment-specifier
22391 alignment-specifier:
22392 alignas ( type-id ... [opt] )
22393 alignas ( alignment-expression ... [opt] ). */
22395 static tree
22397 {
22403 {
22412 else
22413 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22414 when we are sure that we have actually parsed them. */
22416 }
22417 else
22418 {
22419 tree alignas_expr;
22421 /* Look for an alignment-specifier. */
22433 {
22436 }
22442 {
22446 alignas_expr =
22453 }
22456 {
22459 }
22463 /* Build the C++-11 representation of an 'aligned'
22464 attribute. */
22465 attributes =
22469 }
22472 }
22474 /* Parse a standard C++-11 attribute-specifier-seq.
22476 attribute-specifier-seq:
22477 attribute-specifier-seq [opt] attribute-specifier
22478 */
22480 static tree
22482 {
22486 {
22495 }
22499 }
22501 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22502 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22503 current value of the PEDANTIC flag, regardless of whether or not
22504 the `__extension__' keyword is present. The caller is responsible
22505 for restoring the value of the PEDANTIC flag. */
22507 static bool
22509 {
22510 /* Save the old value of the PEDANTIC flag. */
22514 {
22515 /* Consume the `__extension__' token. */
22517 /* We're not being pedantic while the `__extension__' keyword is
22518 in effect. */
22522 }
22525 }
22527 /* Parse a label declaration.
22529 label-declaration:
22530 __label__ label-declarator-seq ;
22532 label-declarator-seq:
22533 identifier , label-declarator-seq
22534 identifier */
22536 static void
22538 {
22539 /* Look for the `__label__' keyword. */
22543 {
22544 tree identifier;
22546 /* Look for an identifier. */
22548 /* If we failed, stop. */
22551 /* Declare it as a label. */
22553 /* If the next token is a `;', stop. */
22556 /* Look for the `,' separating the label declarations. */
22558 }
22560 /* Look for the final `;'. */
22562 }
22564 /* Support Functions */
22566 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22567 NAME should have one of the representations used for an
22568 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22569 is returned. If PARSER->SCOPE is a dependent type, then a
22570 SCOPE_REF is returned.
22572 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22573 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22574 was formed. Abstractly, such entities should not be passed to this
22575 function, because they do not need to be looked up, but it is
22576 simpler to check for this special case here, rather than at the
22577 call-sites.
22579 In cases not explicitly covered above, this function returns a
22580 DECL, OVERLOAD, or baselink representing the result of the lookup.
22581 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22582 is returned.
22584 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22585 (e.g., "struct") that was used. In that case bindings that do not
22586 refer to types are ignored.
22588 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22589 ignored.
22591 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22592 are ignored.
22594 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22595 types.
22597 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22598 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22599 NULL_TREE otherwise. */
22601 static tree
22608 location_t name_location)
22609 {
22610 tree decl;
22613 /* Assume that the lookup will be unambiguous. */
22617 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22618 no longer valid. Note that if we are parsing tentatively, and
22619 the parse fails, OBJECT_TYPE will be automatically restored. */
22625 /* A template-id has already been resolved; there is no lookup to
22626 do. */
22630 {
22634 }
22636 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22637 it should already have been checked to make sure that the name
22638 used matches the type being destroyed. */
22640 {
22641 tree type;
22643 /* Figure out to which type this destructor applies. */
22648 else
22650 /* If that's not a class type, there is no destructor. */
22657 /* If it was a class type, return the destructor. */
22659 }
22661 /* By this point, the NAME should be an ordinary identifier. If
22662 the id-expression was a qualified name, the qualifying scope is
22663 stored in PARSER->SCOPE at this point. */
22666 /* Perform the lookup. */
22668 {
22674 /* If the SCOPE is dependent, the lookup must be deferred until
22675 the template is instantiated -- unless we are explicitly
22676 looking up names in uninstantiated templates. Even then, we
22677 cannot look up the name if the scope is not a class type; it
22678 might, for example, be a template type parameter. */
22683 /* Defer lookup. */
22685 else
22686 {
22689 /* If PARSER->SCOPE is a dependent type, then it must be a
22690 class type, and we must not be checking dependencies;
22691 otherwise, we would have processed this lookup above. So
22692 that PARSER->SCOPE is not considered a dependent base by
22693 lookup_member, we must enter the scope here. */
22697 /* If the PARSER->SCOPE is a template specialization, it
22698 may be instantiated during name lookup. In that case,
22699 errors may be issued. Even if we rollback the current
22700 tentative parse, those errors are valid. */
22705 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22706 lookup result and the nested-name-specifier nominates a class C:
22707 * if the name specified after the nested-name-specifier, when
22708 looked up in C, is the injected-class-name of C (Clause 9), or
22709 * if the name specified after the nested-name-specifier is the
22710 same as the identifier or the simple-template-id's template-
22711 name in the last component of the nested-name-specifier,
22712 the name is instead considered to name the constructor of
22713 class C. [ Note: for example, the constructor is not an
22714 acceptable lookup result in an elaborated-type-specifier so
22715 the constructor would not be used in place of the
22716 injected-class-name. --end note ] Such a constructor name
22717 shall be used only in the declarator-id of a declaration that
22718 names a constructor or in a using-declaration. */
22726 /* If we have a single function from a using decl, pull it out. */
22733 }
22735 /* If the scope is a dependent type and either we deferred lookup or
22736 we did lookup but didn't find the name, rememeber the name. */
22739 {
22741 {
22742 tree type;
22744 /* The resolution to Core Issue 180 says that `struct
22745 A::B' should be considered a type-name, even if `A'
22746 is dependent. */
22751 }
22755 CPP_CLOSE_PAREN)))
22759 else
22762 is_template);
22763 }
22766 }
22768 {
22769 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22770 OBJECT_TYPE is not a class. */
22772 /* If the OBJECT_TYPE is a template specialization, it may
22773 be instantiated during name lookup. In that case, errors
22774 may be issued. Even if we rollback the current tentative
22775 parse, those errors are valid. */
22777 name,
22780 tf_warning_or_error);
22781 else
22785 /* Look it up in the enclosing context. */
22791 }
22792 else
22793 {
22799 }
22801 /* If the lookup failed, let our caller know. */
22805 /* Pull out the template from an injected-class-name (or multiple). */
22809 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22811 {
22814 /* The error message we have to print is too complicated for
22815 cp_parser_error, so we incorporate its actions directly. */
22817 {
22819 name);
22821 }
22823 }
22831 /* If we have resolved the name of a member declaration, check to
22832 see if the declaration is accessible. When the name resolves to
22833 set of overloaded functions, accessibility is checked when
22834 overload resolution is done.
22836 During an explicit instantiation, access is not checked at all,
22837 as per [temp.explicit]. */
22844 }
22846 /* Like cp_parser_lookup_name, but for use in the typical case where
22847 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22848 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22850 static tree
22852 {
22854 none_type,
22859 location);
22860 }
22862 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22863 the current context, return the TYPE_DECL. If TAG_NAME_P is
22864 true, the DECL indicates the class being defined in a class-head,
22865 or declared in an elaborated-type-specifier.
22867 Otherwise, return DECL. */
22869 static tree
22871 {
22872 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22873 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22875 struct A {
22876 template <typename T> struct B;
22877 };
22879 template <typename T> struct A::B {};
22881 Similarly, in an elaborated-type-specifier:
22883 namespace N { struct X{}; }
22885 struct A {
22886 template <typename T> friend struct N::X;
22887 };
22889 However, if the DECL refers to a class type, and we are in
22890 the scope of the class, then the name lookup automatically
22891 finds the TYPE_DECL created by build_self_reference rather
22892 than a TEMPLATE_DECL. For example, in:
22894 template <class T> struct S {
22895 S s;
22896 };
22898 there is no need to handle such case. */
22904 }
22906 /* If too many, or too few, template-parameter lists apply to the
22907 declarator, issue an error message. Returns TRUE if all went well,
22908 and FALSE otherwise. */
22910 static bool
22913 location_t declarator_location)
22914 {
22916 {
22918 {
22926 /* If the DECLARATOR has the form `X<y>' then it uses one
22927 additional level of template parameters. */
22930 return cp_parser_check_template_parameters
22932 }
22947 }
22949 }
22951 /* NUM_TEMPLATES were used in the current declaration. If that is
22952 invalid, return FALSE and issue an error messages. Otherwise,
22953 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22954 declarator and we can print more accurate diagnostics. */
22956 static bool
22959 location_t location,
22961 {
22962 /* If there are the same number of template classes and parameter
22963 lists, that's OK. */
22966 /* If there are more, but only one more, then we are referring to a
22967 member template. That's OK too. */
22970 /* If there are more template classes than parameter lists, we have
22971 something like:
22973 template <class T> void S<T>::R<T>::f (); */
22975 {
22985 else
22988 }
22989 /* Otherwise, there are too many template parameter lists. We have
22990 something like:
22992 template <class T> template <class U> void S::f(); */
22995 }
22997 /* Parse an optional `::' token indicating that the following name is
22998 from the global namespace. If so, PARSER->SCOPE is set to the
22999 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23000 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23001 Returns the new value of PARSER->SCOPE, if the `::' token is
23002 present, and NULL_TREE otherwise. */
23004 static tree
23006 {
23009 /* Peek at the next token. */
23011 /* If we're looking at a `::' token then we're starting from the
23012 global namespace, not our current location. */
23014 {
23015 /* Consume the `::' token. */
23017 /* Set the SCOPE so that we know where to start the lookup. */
23023 }
23025 {
23029 }
23032 }
23034 /* Returns TRUE if the upcoming token sequence is the start of a
23035 constructor declarator. If FRIEND_P is true, the declarator is
23036 preceded by the `friend' specifier. */
23038 static bool
23040 {
23043 tree nested_name_specifier;
23046 /* The common case is that this is not a constructor declarator, so
23047 try to avoid doing lots of work if at all possible. It's not
23048 valid declare a constructor at function scope. */
23051 /* And only certain tokens can begin a constructor declarator. */
23059 /* Parse tentatively; we are going to roll back all of the tokens
23060 consumed here. */
23062 /* Assume that we are looking at a constructor declarator. */
23065 /* Look for the optional `::' operator. */
23068 /* Look for the nested-name-specifier. */
23069 nested_name_specifier
23080 /* Outside of a class-specifier, there must be a
23081 nested-name-specifier. */
23087 /* If we have a class scope, this is easy; DR 147 says that S::S always
23088 names the constructor, and no other qualified name could. */
23091 {
23101 }
23102 /* If we still think that this might be a constructor-declarator,
23103 look for a class-name. */
23105 {
23106 /* If we have:
23108 template <typename T> struct S {
23109 S();
23110 };
23112 we must recognize that the nested `S' names a class. */
23113 tree type_decl;
23117 none_type,
23121 /* If there was no class-name, then this is not a constructor.
23122 Otherwise, if we are in a class-specifier and we aren't
23123 handling a friend declaration, check that its type matches
23124 current_class_type (c++/38313). Note: error_mark_node
23125 is left alone for error recovery purposes. */
23127 && (outside_class_specifier_p
23132 /* If we're still considering a constructor, we have to see a `(',
23133 to begin the parameter-declaration-clause, followed by either a
23134 `)', an `...', or a decl-specifier. We need to check for a
23135 type-specifier to avoid being fooled into thinking that:
23137 S (f) (int);
23139 is a constructor. (It is actually a function named `f' that
23140 takes one parameter (of type `int') and returns a value of type
23141 `S'. */
23149 /* A parameter declaration begins with a decl-specifier,
23150 which is either the "attribute" keyword, a storage class
23151 specifier, or (usually) a type-specifier. */
23153 {
23154 tree type;
23158 /* Names appearing in the type-specifier should be looked up
23159 in the scope of the class. */
23162 else
23163 {
23166 {
23170 {
23173 }
23174 }
23176 }
23178 /* Inside the constructor parameter list, surrounding
23179 template-parameter-lists do not apply. */
23180 saved_num_template_parameter_lists
23184 /* Look for the type-specifier. */
23186 CP_PARSER_FLAGS_NONE,
23192 parser->num_template_parameter_lists
23195 /* Leave the scope of the class. */
23200 }
23201 }
23203 /* We did not really want to consume any tokens. */
23207 }
23209 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23210 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23211 they must be performed once we are in the scope of the function.
23213 Returns the function defined. */
23215 static tree
23216 cp_parser_function_definition_from_specifiers_and_declarator
23219 tree attributes,
23221 {
23222 tree fn;
23225 /* Begin the function-definition. */
23228 /* The things we're about to see are not directly qualified by any
23229 template headers we've seen thus far. */
23232 /* If there were names looked up in the decl-specifier-seq that we
23233 did not check, check them now. We must wait until we are in the
23234 scope of the function to perform the checks, since the function
23235 might be a friend. */
23239 {
23242 }
23245 {
23246 /* Skip the entire function. */
23249 }
23251 {
23252 /* Seen already, skip it. An error message has already been output. */
23256 /* If this is a function from a class, pop the nested class. */
23259 }
23260 else
23261 {
23262 timevar_id_t tv;
23265 else
23271 }
23274 }
23276 /* Parse the part of a function-definition that follows the
23277 declarator. INLINE_P is TRUE iff this function is an inline
23278 function defined within a class-specifier.
23280 Returns the function defined. */
23282 static tree
23285 {
23286 tree fn;
23292 bool fully_implicit_function_template_p
23295 tree implicit_template_parms
23298 cp_binding_level* implicit_template_scope
23304 /* If the next token is `return', then the code may be trying to
23305 make use of the "named return value" extension that G++ used to
23306 support. */
23309 {
23310 /* Consume the `return' keyword. */
23312 /* Look for the identifier that indicates what value is to be
23313 returned. */
23315 /* Issue an error message. */
23318 /* Skip tokens until we reach the start of the function body. */
23320 {
23327 }
23328 }
23329 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23330 anything declared inside `f'. */
23331 saved_in_unbraced_linkage_specification_p
23334 /* Inside the function, surrounding template-parameter-lists do not
23335 apply. */
23336 saved_num_template_parameter_lists
23342 /* If the next token is `try', `__transaction_atomic', or
23343 `__transaction_relaxed`, then we are looking at either function-try-block
23344 or function-transaction-block. Note that all of these include the
23345 function-body. */
23348 RID_TRANSACTION_ATOMIC);
23350 RID_TRANSACTION_RELAXED))
23352 RID_TRANSACTION_RELAXED);
23355 else
23356 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23361 /* Finish the function. */
23364 /* Generate code for it, if necessary. */
23366 /* Restore the saved values. */
23367 parser->in_unbraced_linkage_specification_p
23369 parser->num_template_parameter_lists
23373 parser->fully_implicit_function_template_p
23375 parser->implicit_template_parms
23377 parser->implicit_template_scope
23384 }
23386 /* Parse a template-declaration, assuming that the `export' (and
23387 `extern') keywords, if present, has already been scanned. MEMBER_P
23388 is as for cp_parser_template_declaration. */
23390 static void
23392 {
23395 tree parameter_list;
23400 /* Look for the `template' keyword. */
23405 /* And the `<'. */
23409 {
23410 /* 14.5.2.2 [temp.mem]
23412 A local class shall not have member templates. */
23417 }
23418 /* [temp]
23420 A template ... shall not have C linkage. */
23422 {
23424 /* Give it C++ linkage to avoid confusing other parts of the
23425 front end. */
23428 }
23429 else
23432 /* We cannot perform access checks on the template parameter
23433 declarations until we know what is being declared, just as we
23434 cannot check the decl-specifier list. */
23437 /* If the next token is `>', then we have an invalid
23438 specialization. Rather than complain about an invalid template
23439 parameter, issue an error message here. */
23441 {
23445 }
23446 else
23447 {
23448 /* Parse the template parameters. */
23450 }
23452 /* Get the deferred access checks from the parameter list. These
23453 will be checked once we know what is being declared, as for a
23454 member template the checks must be performed in the scope of the
23455 class containing the member. */
23458 /* Look for the `>'. */
23460 /* We just processed one more parameter list. */
23462 /* If the next token is `template', there are more template
23463 parameters. */
23465 RID_TEMPLATE))
23470 else
23471 {
23472 /* There are no access checks when parsing a template, as we do not
23473 know if a specialization will be a friend. */
23477 checks,
23478 member_p,
23483 /* If this is a member template declaration, let the front
23484 end know. */
23486 {
23491 }
23496 }
23497 /* We are done with the current parameter list. */
23502 /* Finish up. */
23505 /* Check the template arguments for a literal operator template. */
23509 {
23513 else
23514 {
23517 {
23523 }
23525 {
23533 }
23534 else
23536 }
23538 {
23541 " Expected non-type template argument pack <char...>"
23543 decl);
23544 else
23547 decl);
23548 }
23549 }
23550 /* Register member declarations. */
23553 /* For the erroneous case of a template with C linkage, we pushed an
23554 implicit C++ linkage scope; exit that scope now. */
23557 /* If DECL is a function template, we must return to parse it later.
23558 (Even though there is no definition, there might be default
23559 arguments that need handling.) */
23563 }
23565 /* Perform the deferred access checks from a template-parameter-list.
23566 CHECKS is a TREE_LIST of access checks, as returned by
23567 get_deferred_access_checks. */
23569 static void
23570 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23571 {
23575 }
23577 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23578 `function-definition' sequence that follows a template header.
23579 If MEMBER_P is true, this declaration appears in a class scope.
23581 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23582 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23584 static tree
23590 {
23593 cp_decl_specifier_seq decl_specifiers;
23597 /* This function is only used when processing a template
23598 declaration. */
23602 /* Defer access checks until we know what is being declared. */
23605 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23606 alternative. */
23609 CP_PARSER_FLAGS_OPTIONAL,
23615 /* There are no template typedefs. */
23617 {
23621 }
23623 /* Gather up the access checks that occurred the
23624 decl-specifier-seq. */
23627 /* Check for the declaration of a template class. */
23629 {
23631 {
23634 /* In this case:
23636 struct C {
23637 friend template <typename T> struct A<T>::B;
23638 };
23640 A<T>::B will be represented by a TYPENAME_TYPE, and
23641 therefore not recognized by shadow_tag. */
23643 && !decl
23650 else
23653 /* Perform access checks for template parameters. */
23655 }
23656 }
23658 /* Complain about missing 'typename' or other invalid type names. */
23661 {
23662 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23663 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23664 the rest of this declaration. */
23667 }
23669 /* If it's not a template class, try for a template function. If
23670 the next token is a `;', then this declaration does not declare
23671 anything. But, if there were errors in the decl-specifiers, then
23672 the error might well have come from an attempted class-specifier.
23673 In that case, there's no need to warn about a missing declarator. */
23677 {
23680 checks,
23682 member_p,
23683 declares_class_or_enum,
23685 NULL);
23687 /* 7.1.1-1 [dcl.stc]
23689 A storage-class-specifier shall not be specified in an explicit
23690 specialization... */
23692 && explicit_specialization_p
23694 {
23698 }
23702 }
23704 /* Look for a trailing `;' after the declaration. */
23710 out:
23713 /* Clear any current qualification; whatever comes next is the start
23714 of something new. */
23720 }
23722 /* Parse a cast-expression that is not the operand of a unary "&". */
23724 static tree
23726 {
23729 }
23731 /* Parse a functional cast to TYPE. Returns an expression
23732 representing the cast. */
23734 static tree
23736 {
23738 tree expression_list;
23739 tree cast;
23746 {
23754 tf_warning_or_error);
23755 }
23764 else
23765 {
23768 }
23771 tf_warning_or_error);
23772 /* [expr.const]/1: In an integral constant expression "only type
23773 conversions to integral or enumeration type can be used". */
23779 NIC_CONSTRUCTOR))
23782 }
23784 /* Save the tokens that make up the body of a member function defined
23785 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23786 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23787 specifiers applied to the declaration. Returns the FUNCTION_DECL
23788 for the member function. */
23790 static tree
23794 tree attributes)
23795 {
23798 tree fn;
23800 /* Create the FUNCTION_DECL. */
23803 /* If something went badly wrong, bail out now. */
23805 {
23806 /* If there's a function-body, skip it. */
23811 }
23813 /* Remember it, if there default args to post process. */
23816 /* Save away the tokens that make up the body of the
23817 function. */
23819 /* Handle function try blocks. */
23822 /* We can have braced-init-list mem-initializers before the fn body. */
23824 {
23827 {
23828 /* cache_group will stop after an un-nested { } pair, too. */
23832 /* variadic mem-inits have ... after the ')'. */
23835 }
23836 }
23838 /* Handle function try blocks. */
23843 /* Save away the inline definition; we will process it when the
23844 class is complete. */
23848 /* We need to know that this was defined in the class, so that
23849 friend templates are handled correctly. */
23852 /* Add FN to the queue of functions to be parsed later. */
23856 }
23858 /* Save the tokens that make up the in-class initializer for a non-static
23859 data member. Returns a DEFAULT_ARG. */
23861 static tree
23863 {
23865 }
23867 /* Parse a template-argument-list, as well as the trailing ">" (but
23868 not the opening "<"). See cp_parser_template_argument_list for the
23869 return value. */
23871 static tree
23873 {
23874 tree arguments;
23875 tree saved_scope;
23876 tree saved_qualifying_scope;
23877 tree saved_object_scope;
23882 /* [temp.names]
23884 When parsing a template-id, the first non-nested `>' is taken as
23885 the end of the template-argument-list rather than a greater-than
23886 operator. */
23887 saved_greater_than_is_operator_p
23890 /* Parsing the argument list may modify SCOPE, so we save it
23891 here. */
23895 /* We need to evaluate the template arguments, even though this
23896 template-id may be nested within a "sizeof". */
23901 /* Parse the template-argument-list itself. */
23905 else
23907 /* Look for the `>' that ends the template-argument-list. If we find
23908 a '>>' instead, it's probably just a typo. */
23910 {
23912 {
23913 /* In C++0x, a `>>' in a template argument list or cast
23914 expression is considered to be two separate `>'
23915 tokens. So, change the current token to a `>', but don't
23916 consume it: it will be consumed later when the outer
23917 template argument list (or cast expression) is parsed.
23918 Note that this replacement of `>' for `>>' is necessary
23919 even if we are parsing tentatively: in the tentative
23920 case, after calling
23921 cp_parser_enclosed_template_argument_list we will always
23922 throw away all of the template arguments and the first
23923 closing `>', either because the template argument list
23924 was erroneous or because we are replacing those tokens
23925 with a CPP_TEMPLATE_ID token. The second `>' (which will
23926 not have been thrown away) is needed either to close an
23927 outer template argument list or to complete a new-style
23928 cast. */
23931 }
23933 {
23934 /* If we're in a nested template argument list, the '>>' has
23935 to be a typo for '> >'. We emit the error message, but we
23936 continue parsing and we push a '>' as next token, so that
23937 the argument list will be parsed correctly. Note that the
23938 global source location is still on the token before the
23939 '>>', so we need to say explicitly where we want it. */
23945 }
23946 else
23947 {
23948 /* If this is not a nested template argument list, the '>>'
23949 is a typo for '>'. Emit an error message and continue.
23950 Same deal about the token location, but here we can get it
23951 right by consuming the '>>' before issuing the diagnostic. */
23954 "spurious %<>>%>, use %<>%> to terminate "
23956 }
23957 }
23958 else
23960 /* The `>' token might be a greater-than operator again now. */
23961 parser->greater_than_is_operator_p
23963 /* Restore the SAVED_SCOPE. */
23971 }
23973 /* MEMBER_FUNCTION is a member function, or a friend. If default
23974 arguments, or the body of the function have not yet been parsed,
23975 parse them now. */
23977 static void
23979 {
23981 /* If this member is a template, get the underlying
23982 FUNCTION_DECL. */
23986 /* There should not be any class definitions in progress at this
23987 point; the bodies of members are only parsed outside of all class
23988 definitions. */
23990 /* While we're parsing the member functions we might encounter more
23991 classes. We want to handle them right away, but we don't want
23992 them getting mixed up with functions that are currently in the
23993 queue. */
23996 /* Make sure that any template parameters are in scope. */
23999 /* If the body of the function has not yet been parsed, parse it
24000 now. */
24002 {
24003 tree function_scope;
24006 /* The function is no longer pending; we are processing it. */
24011 /* If this is a local class, enter the scope of the containing
24012 function. */
24017 /* Push the body of the function onto the lexer stack. */
24020 /* Let the front end know that we going to be defining this
24021 function. */
24025 /* Don't do access checking if it is a templated function. */
24029 /* #pragma omp declare reduction needs special parsing. */
24031 {
24036 }
24037 else
24038 /* Now, parse the body of the function. */
24045 /* Leave the scope of the containing function. */
24049 }
24051 /* Remove any template parameters from the symbol table. */
24054 /* Restore the queue. */
24057 }
24059 /* If DECL contains any default args, remember it on the unparsed
24060 functions queue. */
24062 static void
24064 {
24065 tree probe;
24068 probe;
24071 {
24075 }
24076 }
24078 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24079 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24080 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24081 from the parameter-type-list. */
24083 static tree
24086 {
24088 tree parsed_arg;
24094 /* Push the saved tokens for the default argument onto the parser's
24095 lexer stack. */
24101 /* Parse the default argument. */
24112 {
24113 /* In a non-template class, check conversions now. In a template,
24114 we'll wait and instantiate these as needed. */
24117 tf_warning_or_error);
24118 else
24120 }
24122 /* If the token stream has not been completely used up, then
24123 there was extra junk after the end of the default
24124 argument. */
24126 {
24129 else
24131 }
24133 /* Revert to the main lexer. */
24137 }
24139 /* FIELD is a non-static data member with an initializer which we saved for
24140 later; parse it now. */
24142 static void
24144 {
24145 tree def;
24152 NULL_TREE);
24158 }
24160 /* FN is a FUNCTION_DECL which may contains a parameter with an
24161 unparsed DEFAULT_ARG. Parse the default args now. This function
24162 assumes that the current scope is the scope in which the default
24163 argument should be processed. */
24165 static void
24167 {
24171 /* While we're parsing the default args, we might (due to the
24172 statement expression extension) encounter more classes. We want
24173 to handle them right away, but we don't want them getting mixed
24174 up with default args that are currently in the queue. */
24177 /* Local variable names (and the `this' keyword) may not appear
24178 in a default argument. */
24189 {
24191 tree parsed_arg;
24193 tree copy;
24200 /* This can happen for a friend declaration for a function
24201 already declared with default arguments. */
24204 parsed_arg
24206 default_arg,
24209 {
24211 }
24215 /* Update any instantiations we've already created. */
24219 }
24223 /* Make sure no default arg is missing. */
24226 /* Restore the state of local_variables_forbidden_p. */
24229 /* Restore the queue. */
24231 }
24233 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24235 sizeof ... ( identifier )
24237 where the 'sizeof' token has already been consumed. */
24239 static tree
24241 {
24242 /* Consume the `...'. */
24249 else
24257 /* The name is not qualified. */
24275 }
24277 /* Parse the operand of `sizeof' (or a similar operator). Returns
24278 either a TYPE or an expression, depending on the form of the
24279 input. The KEYWORD indicates which kind of expression we have
24280 encountered. */
24282 static tree
24284 {
24291 /* If it's a `...', then we are computing the length of a parameter
24292 pack. */
24297 /* Types cannot be defined in a `sizeof' expression. Save away the
24298 old message. */
24300 /* And create the new one. */
24306 /* The restrictions on constant-expressions do not apply inside
24307 sizeof expressions. */
24308 saved_integral_constant_expression_p
24310 saved_non_integral_constant_expression_p
24314 /* Do not actually evaluate the expression. */
24317 /* If it's a `(', then we might be looking at the type-id
24318 construction. */
24320 {
24323 /* We can't be sure yet whether we're looking at a type-id or an
24324 expression. */
24326 /* Note: as a GNU Extension, compound literals are considered
24327 postfix-expressions as they are in C99, so they are valid
24328 arguments to sizeof. See comment in cp_parser_cast_expression
24329 for details. */
24332 else
24333 {
24336 /* Look for the type-id. */
24338 /* Look for the closing `)'. */
24341 }
24343 /* If all went well, then we're done. */
24345 {
24346 cp_decl_specifier_seq decl_specs;
24348 /* Build a trivial decl-specifier-seq. */
24352 /* Call grokdeclarator to figure out what type this is. */
24355 TYPENAME,
24358 }
24359 }
24361 /* If the type-id production did not work out, then we must be
24362 looking at the unary-expression production. */
24366 /* Go back to evaluating expressions. */
24370 /* Free the message we created. */
24372 /* And restore the old one. */
24374 parser->integral_constant_expression_p
24376 parser->non_integral_constant_expression_p
24380 }
24382 /* If the current declaration has no declarator, return true. */
24384 static bool
24386 {
24387 /* If the next token is a `;' or a `,' then there is no
24388 declarator. */
24391 }
24393 /* Update the DECL_SPECS to reflect the storage class indicated by
24394 KEYWORD. */
24396 static void
24401 {
24402 cp_storage_class storage_class;
24405 {
24409 }
24411 {
24414 }
24419 {
24422 }
24425 {
24443 }
24447 /* A storage class specifier cannot be applied alongside a typedef
24448 specifier. If there is a typedef specifier present then set
24449 conflicting_specifiers_p which will trigger an error later
24450 on in grokdeclarator. */
24453 }
24455 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24456 is true, the type is a class or enum definition. */
24458 static void
24460 tree type_spec,
24463 {
24466 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24467 (with, for example, in "typedef int wchar_t;") we remember that
24468 this is what happened. In system headers, we ignore these
24469 declarations so that G++ can work with system headers that are not
24470 C++-safe. */
24472 && !type_definition_p
24482 {
24485 ds_redefined_builtin_type_spec,
24486 token);
24488 {
24492 }
24493 }
24496 else
24497 {
24502 }
24503 }
24505 /* True iff TOKEN is the GNU keyword __thread. */
24507 static bool
24509 {
24512 }
24514 /* Set the location for a declarator specifier and check if it is
24515 duplicated.
24517 DECL_SPECS is the sequence of declarator specifiers onto which to
24518 set the location.
24520 DS is the single declarator specifier to set which location is to
24521 be set onto the existing sequence of declarators.
24523 LOCATION is the location for the declarator specifier to
24524 consider. */
24526 static void
24529 {
24538 {
24542 }
24543 else
24544 {
24546 {
24550 else
24551 {
24554 OPT_Wlong_long,
24556 }
24557 }
24559 {
24564 else
24566 }
24567 else
24568 {
24584 "__complex"
24585 };
24588 }
24589 }
24590 }
24592 /* Return true iff the declarator specifier DS is present in the
24593 sequence of declarator specifiers DECL_SPECS. */
24595 bool
24597 cp_decl_spec ds)
24598 {
24605 }
24607 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24608 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24610 static bool
24612 {
24614 }
24616 /* Issue an error message indicating that TOKEN_DESC was expected.
24617 If KEYWORD is true, it indicated this function is called by
24618 cp_parser_require_keword and the required token can only be
24619 a indicated keyword. */
24621 static void
24623 required_token token_desc,
24625 {
24627 {
24696 }
24698 {
24700 {
24779 }
24780 }
24781 else
24783 }
24787 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24788 issue an error message indicating that TOKEN_DESC was expected.
24790 Returns the token consumed, if the token had the appropriate type.
24791 Otherwise, returns NULL. */
24796 required_token token_desc)
24797 {
24800 else
24801 {
24802 /* Output the MESSAGE -- unless we're parsing tentatively. */
24806 }
24807 }
24809 /* An error message is produced if the next token is not '>'.
24810 All further tokens are skipped until the desired token is
24811 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24813 static void
24815 {
24816 /* Current level of '< ... >'. */
24818 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24821 /* Are we ready, yet? If not, issue error message. */
24825 /* Skip tokens until the desired token is found. */
24827 {
24828 /* Peek at the next token. */
24830 {
24838 /* C++0x views the `>>' operator as two `>' tokens, but
24839 C++98 does not. */
24842 {
24843 /* We've hit a `>>' where the first `>' closes the
24844 template argument list, and the second `>' is
24845 spurious. Just consume the `>>' and stop; we've
24846 already produced at least one error. */
24849 }
24850 /* Fall through for C++0x, so we handle the second `>' in
24851 the `>>'. */
24855 {
24856 /* We've reached the token we want, consume it and stop. */
24859 }
24878 /* The '>' was probably forgotten, don't look further. */
24883 }
24885 /* Consume this token. */
24887 }
24888 }
24890 /* If the next token is the indicated keyword, consume it. Otherwise,
24891 issue an error message indicating that TOKEN_DESC was expected.
24893 Returns the token consumed, if the token had the appropriate type.
24894 Otherwise, returns NULL. */
24899 required_token token_desc)
24900 {
24904 {
24907 }
24910 }
24912 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24913 function-definition. */
24915 static bool
24917 {
24920 /* A ctor-initializer begins with a `:'. */
24922 /* A function-try-block begins with `try'. */
24924 /* A function-transaction-block begins with `__transaction_atomic'
24925 or `__transaction_relaxed'. */
24928 /* The named return value extension begins with `return'. */
24930 }
24932 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24933 definition. */
24935 static bool
24937 {
24944 }
24946 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24947 C++0x) ending a template-argument. */
24949 static bool
24951 {
24959 }
24961 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24962 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24964 static bool
24967 {
24973 /* Check for the sequence `<::' in the original code. It would be lexed as
24974 `[:', where `[' is a digraph, and there is no whitespace before
24975 `:'. */
24977 {
24982 }
24984 }
24986 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24987 or none_type otherwise. */
24989 static enum tag_types
24991 {
24993 {
25003 }
25004 }
25006 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25007 or none_type otherwise or if the token is null. */
25009 static enum tag_types
25011 {
25016 {
25024 }
25025 }
25027 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25029 static void
25031 {
25035 {
25039 type))
25042 }
25043 }
25045 /* Issue an error message if DECL is redeclared with different
25046 access than its original declaration [class.access.spec/3].
25047 This applies to nested classes and nested class templates.
25048 [class.mem/1]. */
25050 static void
25052 {
25061 }
25063 /* Look for the `template' keyword, as a syntactic disambiguator.
25064 Return TRUE iff it is present, in which case it will be
25065 consumed. */
25067 static bool
25069 {
25071 {
25072 /* In C++98 the `template' keyword can only be used within templates;
25073 outside templates the parser can always figure out what is a
25074 template and what is not. In C++11, per the resolution of DR 468,
25075 `template' is allowed in cases where it is not strictly necessary. */
25078 {
25081 "in C++98 %<template%> (as a disambiguator) is only "
25083 /* If this part of the token stream is rescanned, the same
25084 error message would be generated. So, we purge the token
25085 from the stream. */
25088 }
25089 else
25090 {
25091 /* Consume the `template' keyword. */
25094 }
25095 }
25097 }
25099 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25100 set PARSER->SCOPE, and perform other related actions. */
25102 static void
25104 {
25110 /* Get the stored value. */
25112 /* Perform any access checks that were deferred. */
25115 {
25120 }
25121 /* Set the scope from the stored value. */
25125 }
25127 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25128 encounter the end of a block before what we were looking for. */
25130 static bool
25134 {
25136 {
25139 /* Abort a parenthesized expression if we encounter a semicolon. */
25143 /* If we've reached the end of the file, stop. */
25149 /* We've hit the end of an enclosing block, so there's been some
25150 kind of syntax error. */
25153 /* Consume the token. */
25155 /* See if it starts a new group. */
25157 {
25159 /* In theory this should probably check end == '}', but
25160 cp_parser_save_member_function_body needs it to exit
25161 after either '}' or ')' when called with ')'. */
25164 }
25166 {
25170 }
25175 }
25176 }
25178 /* Like above, for caching a default argument or NSDMI. Both of these are
25179 terminated by a non-nested comma, but it can be unclear whether or not a
25180 comma is nested in a template argument list unless we do more parsing.
25181 In order to handle this ambiguity, when we encounter a ',' after a '<'
25182 we try to parse what follows as a parameter-declaration-list (in the
25183 case of a default argument) or a member-declarator (in the case of an
25184 NSDMI). If that succeeds, then we stop caching. */
25186 static tree
25188 {
25193 tree default_argument;
25195 /* Add tokens until we have processed the entire default
25196 argument. We add the range [first_token, token). */
25199 {
25200 /* For list-initialization, this is straightforward. */
25203 }
25205 {
25208 /* Peek at the next token. */
25210 /* What we do depends on what token we have. */
25212 {
25213 /* In valid code, a default argument must be
25214 immediately followed by a `,' `)', or `...'. */
25217 {
25218 /* If we've seen a '<', we might be in a
25219 template-argument-list. Until Core issue 325 is
25220 resolved, we don't know how this situation ought
25221 to be handled, so try to DTRT. We check whether
25222 what comes after the comma is a valid parameter
25223 declaration list. If it is, then the comma ends
25224 the default argument; otherwise the default
25225 argument continues. */
25228 /* Set ITALP so cp_parser_parameter_declaration_list
25229 doesn't decide to commit to this parse. */
25237 {
25244 }
25245 else
25246 {
25250 }
25257 }
25260 /* If we run into a non-nested `;', `}', or `]',
25261 then the code is invalid -- but the default
25262 argument is certainly over. */
25267 /* Handle correctly int n = sizeof ... ( p ); */
25270 /* Update DEPTH, if necessary. */
25285 /* This might be the comparison operator, or it might
25286 start a template argument list. */
25293 /* Fall through for C++0x, which treats the `>>'
25294 operator like two `>' tokens in certain
25295 cases. */
25299 {
25300 /* This might be an operator, or it might close a
25301 template argument list. But if a previous '<'
25302 started a template argument list, this will have
25303 closed it, so we can't be in one anymore. */
25307 }
25310 /* If we run out of tokens, issue an error message. */
25319 /* In these cases, we should look for template-ids.
25320 For example, if the default argument is
25321 `X<int, double>()', we need to do name lookup to
25322 figure out whether or not `X' is a template; if
25323 so, the `,' does not end the default argument.
25325 That is not yet done. */
25330 }
25332 /* If we've reached the end, stop. */
25336 /* Add the token to the token block. */
25338 }
25340 /* Create a DEFAULT_ARG to represent the unparsed default
25341 argument. */
25348 }
25350 /* Begin parsing tentatively. We always save tokens while parsing
25351 tentatively so that if the tentative parsing fails we can restore the
25352 tokens. */
25354 static void
25356 {
25357 /* Enter a new parsing context. */
25359 /* Begin saving tokens. */
25361 /* In order to avoid repetitive access control error messages,
25362 access checks are queued up until we are no longer parsing
25363 tentatively. */
25365 }
25367 /* Commit to the currently active tentative parse. */
25369 static void
25371 {
25375 /* Mark all of the levels as committed. */
25378 {
25385 }
25386 }
25388 /* Commit to the topmost currently active tentative parse.
25390 Note that this function shouldn't be called when there are
25391 irreversible side-effects while in a tentative state. For
25392 example, we shouldn't create a permanent entry in the symbol
25393 table, or issue an error message that might not apply if the
25394 tentative parse is aborted. */
25396 static void
25398 {
25403 {
25411 }
25412 }
25414 /* Abort the currently active tentative parse. All consumed tokens
25415 will be rolled back, and no diagnostics will be issued. */
25417 static void
25419 {
25423 /* Now, pretend that we want to see if the construct was
25424 successfully parsed. */
25426 }
25428 /* Stop parsing tentatively. If a parse error has occurred, restore the
25429 token stream. Otherwise, commit to the tokens we have consumed.
25430 Returns true if no error occurred; false otherwise. */
25432 static bool
25434 {
25438 /* Remember whether or not an error occurred, since we are about to
25439 destroy that information. */
25441 /* Remove the topmost context from the stack. */
25444 /* If no parse errors occurred, commit to the tentative parse. */
25446 {
25447 /* Commit to the tokens read tentatively, unless that was
25448 already done. */
25453 }
25454 /* Otherwise, if errors occurred, roll back our state so that things
25455 are just as they were before we began the tentative parse. */
25456 else
25457 {
25460 }
25461 /* Add the context to the front of the free list. */
25466 }
25468 /* Returns true if we are parsing tentatively and are not committed to
25469 this tentative parse. */
25471 static bool
25473 {
25476 }
25478 /* Returns nonzero iff an error has occurred during the most recent
25479 tentative parse. */
25481 static bool
25483 {
25486 }
25488 /* Returns nonzero if GNU extensions are allowed. */
25490 static bool
25492 {
25494 }
25495 \f
25496 /* Objective-C++ Productions */
25499 /* Parse an Objective-C expression, which feeds into a primary-expression
25500 above.
25502 objc-expression:
25503 objc-message-expression
25504 objc-string-literal
25505 objc-encode-expression
25506 objc-protocol-expression
25507 objc-selector-expression
25509 Returns a tree representation of the expression. */
25511 static tree
25513 {
25514 /* Try to figure out what kind of declaration is present. */
25518 {
25528 {
25540 }
25546 }
25549 }
25551 /* Parse an Objective-C message expression.
25553 objc-message-expression:
25554 [ objc-message-receiver objc-message-args ]
25556 Returns a representation of an Objective-C message. */
25558 static tree
25560 {
25569 }
25571 /* Parse an objc-message-receiver.
25573 objc-message-receiver:
25574 expression
25575 simple-type-specifier
25577 Returns a representation of the type or expression. */
25579 static tree
25581 {
25582 tree rcv;
25584 /* An Objective-C message receiver may be either (1) a type
25585 or (2) an expression. */
25594 CP_PARSER_FLAGS_NONE);
25597 }
25599 /* Parse the arguments and selectors comprising an Objective-C message.
25601 objc-message-args:
25602 objc-selector
25603 objc-selector-args
25604 objc-selector-args , objc-comma-args
25606 objc-selector-args:
25607 objc-selector [opt] : assignment-expression
25608 objc-selector-args objc-selector [opt] : assignment-expression
25610 objc-comma-args:
25611 assignment-expression
25612 objc-comma-args , assignment-expression
25614 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25615 selector arguments and TREE_VALUE containing a list of comma
25616 arguments. */
25618 static tree
25620 {
25626 {
25632 /* Detect if we have a unary selector. */
25641 sel_args
25646 }
25648 /* Handle non-selector arguments, if any. */
25650 {
25651 tree arg;
25656 addl_args
25661 }
25664 {
25667 }
25670 }
25672 /* Parse an Objective-C encode expression.
25674 objc-encode-expression:
25675 @encode objc-typename
25677 Returns an encoded representation of the type argument. */
25679 static tree
25681 {
25682 tree type;
25692 {
25696 }
25698 /* This happens if we find @encode(T) (where T is a template
25699 typename or something dependent on a template typename) when
25700 parsing a template. In that case, we can't compile it
25701 immediately, but we rather create an AT_ENCODE_EXPR which will
25702 need to be instantiated when the template is used.
25703 */
25705 {
25709 }
25712 }
25714 /* Parse an Objective-C @defs expression. */
25716 static tree
25718 {
25719 tree name;
25727 }
25729 /* Parse an Objective-C protocol expression.
25731 objc-protocol-expression:
25732 @protocol ( identifier )
25734 Returns a representation of the protocol expression. */
25736 static tree
25738 {
25739 tree proto;
25747 }
25749 /* Parse an Objective-C selector expression.
25751 objc-selector-expression:
25752 @selector ( objc-method-signature )
25754 objc-method-signature:
25755 objc-selector
25756 objc-selector-seq
25758 objc-selector-seq:
25759 objc-selector :
25760 objc-selector-seq objc-selector :
25762 Returns a representation of the method selector. */
25764 static tree
25766 {
25778 {
25787 {
25788 /* Detect if we have a unary selector. */
25790 {
25793 }
25794 else
25795 {
25797 }
25798 }
25803 {
25804 sel_seq
25807 sel_seq
25810 }
25811 else
25812 sel_seq
25817 }
25819 finish_selector:
25823 }
25825 /* Parse a list of identifiers.
25827 objc-identifier-list:
25828 identifier
25829 objc-identifier-list , identifier
25831 Returns a TREE_LIST of identifier nodes. */
25833 static tree
25835 {
25836 tree identifier;
25837 tree list;
25848 {
25855 identifier));
25857 }
25860 }
25862 /* Parse an Objective-C alias declaration.
25864 objc-alias-declaration:
25865 @compatibility_alias identifier identifier ;
25867 This function registers the alias mapping with the Objective-C front end.
25868 It returns nothing. */
25870 static void
25872 {
25880 }
25882 /* Parse an Objective-C class forward-declaration.
25884 objc-class-declaration:
25885 @class objc-identifier-list ;
25887 The function registers the forward declarations with the Objective-C
25888 front end. It returns nothing. */
25890 static void
25892 {
25895 {
25896 tree id;
25906 else
25908 }
25910 }
25912 /* Parse a list of Objective-C protocol references.
25914 objc-protocol-refs-opt:
25915 objc-protocol-refs [opt]
25917 objc-protocol-refs:
25918 < objc-identifier-list >
25920 Returns a TREE_LIST of identifiers, if any. */
25922 static tree
25924 {
25928 {
25932 }
25935 }
25937 /* Parse a Objective-C visibility specification. */
25939 static void
25941 {
25945 {
25960 }
25962 /* Eat '@private'/'@protected'/'@public'. */
25964 }
25966 /* Parse an Objective-C method type. Return 'true' if it is a class
25967 (+) method, and 'false' if it is an instance (-) method. */
25971 {
25974 else
25976 }
25978 /* Parse an Objective-C protocol qualifier. */
25980 static tree
25982 {
25995 {
26000 }
26003 }
26005 /* Parse an Objective-C typename. */
26007 static tree
26009 {
26013 {
26019 /* An ObjC type name may consist of just protocol qualifiers, in which
26020 case the type shall default to 'id'. */
26022 {
26025 /* If the type could not be parsed, an error has already
26026 been produced. For error recovery, behave as if it had
26027 not been specified, which will use the default type
26028 'id'. */
26030 {
26032 /* We need to skip to the closing parenthesis as
26033 cp_parser_type_id() does not seem to do it for
26034 us. */
26039 }
26040 }
26044 }
26047 }
26049 /* Check to see if TYPE refers to an Objective-C selector name. */
26051 static bool
26053 {
26059 }
26061 /* Parse an Objective-C selector. */
26063 static tree
26065 {
26069 {
26072 }
26074 /* C++ operator names are allowed to appear in ObjC selectors. */
26076 {
26089 }
26090 }
26092 /* Parse an Objective-C params list. */
26094 static tree
26096 {
26102 {
26112 /* Detect if we have a unary selector. */
26115 {
26118 }
26122 {
26123 /* Something went quite wrong. There should be a colon
26124 here, but there is not. Stop parsing parameters. */
26126 }
26128 /* New ObjC allows attributes on parameters too. */
26133 params
26136 type_name,
26137 identifier,
26138 parm_attr));
26141 }
26144 {
26147 }
26149 /* We allow tail attributes for the method. */
26151 {
26159 }
26162 {
26165 }
26167 }
26169 /* Parse the non-keyword Objective-C params. */
26171 static tree
26174 {
26180 {
26182 tree parm;
26188 {
26193 }
26195 /* TODO: parse attributes for tail parameters. */
26204 }
26206 /* We allow tail attributes for the method. */
26208 {
26210 {
26215 }
26216 else
26217 /* We have an error, but parse the attributes, so that we can
26218 carry on. */
26224 }
26227 }
26229 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26231 static void
26233 {
26236 /* If the next token is `extern' and the following token is a string
26237 literal, then we have a linkage specification. */
26239 && cp_parser_is_pure_string_literal
26242 /* Handle #pragma, if any. */
26245 /* Allow stray semicolons. */
26248 /* Mark methods as optional or required, when building protocols. */
26250 {
26253 }
26255 {
26258 }
26261 /* Other stray characters must generate errors. */
26263 {
26267 }
26268 /* Finally, try to parse a block-declaration, or a function-definition. */
26269 else
26271 }
26273 /* Parse a method signature. */
26275 static tree
26277 {
26293 }
26295 static bool
26297 {
26298 tree tattr;
26303 /* If the attributes are followed by a method introducer, this is not allowed.
26304 Dump the attributes and flag the situation. */
26309 /* Otherwise, the attributes introduce some interstitial code, possibly so
26310 rewind to allow that check. */
26313 }
26315 /* Parse an Objective-C method prototype list. */
26317 static void
26319 {
26323 {
26325 {
26330 else
26334 {
26338 }
26341 }
26347 OPT_Wattributes,
26349 else
26350 /* Allow for interspersed non-ObjC++ code. */
26354 }
26358 else
26362 }
26364 /* Parse an Objective-C method definition list. */
26366 static void
26368 {
26372 {
26373 tree meth;
26376 {
26382 else
26387 {
26391 }
26393 NULL_TREE);
26395 /* For historical reasons, we accept an optional semicolon. */
26402 {
26409 }
26410 }
26411 /* The following case will be removed once @synthesize is
26412 completely implemented. */
26423 else
26424 /* Allow for interspersed non-ObjC++ code. */
26428 }
26432 else
26436 }
26438 /* Parse Objective-C ivars. */
26440 static void
26442 {
26453 {
26454 cp_decl_specifier_seq declspecs;
26456 tree prefix_attributes;
26464 CP_PARSER_FLAGS_OPTIONAL,
26468 /* auto, register, static, extern, mutable. */
26470 {
26473 }
26475 /* thread_local. */
26477 {
26480 }
26482 /* typedef. */
26484 {
26487 }
26492 /* Keep going until we hit the `;' at the end of the
26493 declaration. */
26495 {
26500 /* Check for a (possibly unnamed) bitfield declaration. */
26508 {
26509 /* Get the name of the bitfield. */
26512 sfk_none);
26514 eat_colon:
26516 /* Get the width of the bitfield. */
26517 width
26519 }
26520 else
26521 {
26522 /* Parse the declarator. */
26523 declarator
26529 }
26531 /* Look for attributes that apply to the ivar. */
26533 /* Remember which attributes are prefix attributes and
26534 which are not. */
26536 /* Combine the attributes. */
26540 /* Create the bitfield declaration. */
26542 width,
26543 attributes);
26544 else
26549 /* Add the instance variable. */
26553 /* Reset PREFIX_ATTRIBUTES. */
26562 {
26565 }
26567 }
26571 }
26576 /* Do not consume the RID_AT_END, so it will be read again as terminating
26577 the @interface of @implementation. */
26581 /* For historical reasons, we accept an optional semicolon. */
26584 }
26586 /* Parse an Objective-C protocol declaration. */
26588 static void
26590 {
26596 {
26601 }
26603 /* See if we have a forward declaration or a definition. */
26606 /* Try a forward declaration first. */
26608 {
26610 {
26611 tree id;
26621 else
26623 }
26625 }
26627 /* Ok, we got a full-fledged definition (or at least should). */
26628 else
26629 {
26634 }
26635 }
26637 /* Parse an Objective-C superclass or category. */
26639 static void
26644 {
26650 {
26653 }
26655 {
26658 /* If there is no category name, and this is an @interface, we
26659 have a class extension. */
26661 {
26664 }
26665 else
26669 }
26670 }
26672 /* Parse an Objective-C class interface. */
26674 static void
26676 {
26683 {
26684 /* It's hard to recover because even if valid @interface stuff
26685 is to follow, we can't compile it (or validate it) if we
26686 don't even know which class it refers to. Let's assume this
26687 was a stray '@interface' token in the stream and skip it.
26688 */
26690 }
26695 /* We have either a class or a category on our hands. */
26698 else
26699 {
26701 /* Handle instance variable declarations, if any. */
26704 }
26707 }
26709 /* Parse an Objective-C class implementation. */
26711 static void
26713 {
26720 {
26721 /* It's hard to recover because even if valid @implementation
26722 stuff is to follow, we can't compile it (or validate it) if
26723 we don't even know which class it refers to. Let's assume
26724 this was a stray '@implementation' token in the stream and
26725 skip it.
26726 */
26728 }
26732 /* We have either a class or a category on our hands. */
26735 else
26736 {
26738 /* Handle instance variable declarations, if any. */
26741 }
26744 }
26746 /* Consume the @end token and finish off the implementation. */
26748 static void
26750 {
26753 }
26755 /* Parse an Objective-C declaration. */
26757 static void
26759 {
26760 /* Try to figure out what kind of declaration is present. */
26765 {
26781 }
26784 {
26807 }
26808 }
26810 /* Parse an Objective-C try-catch-finally statement.
26812 objc-try-catch-finally-stmt:
26813 @try compound-statement objc-catch-clause-seq [opt]
26814 objc-finally-clause [opt]
26816 objc-catch-clause-seq:
26817 objc-catch-clause objc-catch-clause-seq [opt]
26819 objc-catch-clause:
26820 @catch ( objc-exception-declaration ) compound-statement
26822 objc-finally-clause:
26823 @finally compound-statement
26825 objc-exception-declaration:
26826 parameter-declaration
26827 '...'
26829 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26831 Returns NULL_TREE.
26833 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26834 for C. Keep them in sync. */
26836 static tree
26838 {
26839 location_t location;
26840 tree stmt;
26845 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26846 node, lest it get absorbed into the surrounding block. */
26852 {
26861 {
26862 /* We have "@catch (...)" (where the '...' are literally
26863 what is in the code). Skip the '...'.
26864 parameter_declaration is set to NULL_TREE, and
26865 objc_being_catch_clauses() knows that that means
26866 '...'. */
26869 }
26870 else
26871 {
26872 /* We have "@catch (NSException *exception)" or something
26873 like that. Parse the parameter declaration. */
26877 else
26882 }
26885 else
26886 {
26887 /* If there was no open parenthesis, we are recovering from
26888 an error, and we are trying to figure out what mistake
26889 the user has made. */
26891 /* If there is an immediate closing parenthesis, the user
26892 probably forgot the opening one (ie, they typed "@catch
26893 NSException *e)". Parse the closing parenthesis and keep
26894 going. */
26898 /* If these is no immediate closing parenthesis, the user
26899 probably doesn't know that parenthesis are required at
26900 all (ie, they typed "@catch NSException *e"). So, just
26901 forget about the closing parenthesis and keep going. */
26902 }
26906 }
26908 {
26911 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26912 node, lest it get absorbed into the surrounding block. */
26916 }
26919 }
26921 /* Parse an Objective-C synchronized statement.
26923 objc-synchronized-stmt:
26924 @synchronized ( expression ) compound-statement
26926 Returns NULL_TREE. */
26928 static tree
26930 {
26931 location_t location;
26942 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26943 node, lest it get absorbed into the surrounding block. */
26948 }
26950 /* Parse an Objective-C throw statement.
26952 objc-throw-stmt:
26953 @throw assignment-expression [opt] ;
26955 Returns a constructed '@throw' statement. */
26957 static tree
26959 {
26971 }
26973 /* Parse an Objective-C statement. */
26975 static tree
26977 {
26978 /* Try to figure out what kind of declaration is present. */
26982 {
26993 }
26996 }
26998 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26999 look ahead to see if an objc keyword follows the attributes. This
27000 is to detect the use of prefix attributes on ObjC @interface and
27001 @protocol. */
27003 static bool
27005 {
27010 {
27013 }
27016 }
27018 /* This routine is a minimal replacement for
27019 c_parser_struct_declaration () used when parsing the list of
27020 types/names or ObjC++ properties. For example, when parsing the
27021 code
27023 @property (readonly) int a, b, c;
27025 this function is responsible for parsing "int a, int b, int c" and
27026 returning the declarations as CHAIN of DECLs.
27028 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27029 similar parsing. */
27030 static tree
27032 {
27034 cp_decl_specifier_seq declspecs;
27036 tree prefix_attributes;
27039 CP_PARSER_FLAGS_NONE,
27046 /* auto, register, static, extern, mutable. */
27048 {
27051 }
27053 /* thread_local. */
27055 {
27058 }
27060 /* typedef. */
27062 {
27065 }
27070 /* Keep going until we hit the `;' at the end of the declaration. */
27072 {
27077 /* Parse the declarator. */
27081 /* Look for attributes that apply to the ivar. */
27083 /* Remember which attributes are prefix attributes and
27084 which are not. */
27086 /* Combine the attributes. */
27096 /* Reset PREFIX_ATTRIBUTES. */
27107 {
27110 }
27111 else
27113 }
27115 }
27117 /* Parse an Objective-C @property declaration. The syntax is:
27119 objc-property-declaration:
27120 '@property' objc-property-attributes[opt] struct-declaration ;
27122 objc-property-attributes:
27123 '(' objc-property-attribute-list ')'
27125 objc-property-attribute-list:
27126 objc-property-attribute
27127 objc-property-attribute-list, objc-property-attribute
27129 objc-property-attribute
27130 'getter' = identifier
27131 'setter' = identifier
27132 'readonly'
27133 'readwrite'
27134 'assign'
27135 'retain'
27136 'copy'
27137 'nonatomic'
27139 For example:
27140 @property NSString *name;
27141 @property (readonly) id object;
27142 @property (retain, nonatomic, getter=getTheName) id name;
27143 @property int a, b, c;
27145 PS: This function is identical to
27146 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27147 static void
27149 {
27150 /* The following variables hold the attributes of the properties as
27151 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27152 seen. When we see an attribute, we set them to 'true' (if they
27153 are boolean properties) or to the identifier (if they have an
27154 argument, ie, for getter and setter). Note that here we only
27155 parse the list of attributes, check the syntax and accumulate the
27156 attributes that we find. objc_add_property_declaration() will
27157 then process the information. */
27167 /* 'properties' is the list of properties that we read. Usually a
27168 single one, but maybe more (eg, in "@property int a, b, c;" there
27169 are three). */
27170 tree properties;
27171 location_t loc;
27177 /* Parse the optional attribute list... */
27179 {
27180 /* Eat the '('. */
27184 {
27190 {
27193 }
27197 {
27208 {
27212 else
27217 }
27220 {
27224 }
27226 {
27228 {
27231 }
27232 else
27236 else
27238 }
27239 else
27240 {
27242 {
27245 }
27246 else
27248 }
27254 }
27261 else
27263 }
27265 /* FIXME: "@property (setter, assign);" will generate a spurious
27266 "error: expected ‘)’ before ‘,’ token". This is because
27267 cp_parser_require, unlike the C counterpart, will produce an
27268 error even if we are in error recovery. */
27270 {
27275 }
27276 }
27278 /* ... and the property declaration(s). */
27282 {
27284 /* If the next token is now a `;', consume it. */
27288 }
27292 else
27293 {
27294 /* Comma-separated properties are chained together in
27295 reverse order; add them one by one. */
27304 }
27307 }
27309 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27311 objc-synthesize-declaration:
27312 @synthesize objc-synthesize-identifier-list ;
27314 objc-synthesize-identifier-list:
27315 objc-synthesize-identifier
27316 objc-synthesize-identifier-list, objc-synthesize-identifier
27318 objc-synthesize-identifier
27319 identifier
27320 identifier = identifier
27322 For example:
27323 @synthesize MyProperty;
27324 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27326 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27327 for C. Keep them in sync.
27328 */
27329 static void
27331 {
27333 location_t loc;
27338 {
27342 {
27345 }
27347 {
27351 {
27354 }
27355 }
27356 else
27361 else
27363 }
27366 }
27368 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27370 objc-dynamic-declaration:
27371 @dynamic identifier-list ;
27373 For example:
27374 @dynamic MyProperty;
27375 @dynamic MyProperty, AnotherProperty;
27377 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27378 for C. Keep them in sync.
27379 */
27380 static void
27382 {
27384 location_t loc;
27389 {
27390 tree property;
27393 {
27396 }
27400 else
27402 }
27405 }
27407 \f
27408 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27410 /* Returns name of the next clause.
27411 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27412 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27413 returned and the token is consumed. */
27415 static pragma_omp_clause
27417 {
27431 {
27436 {
27581 }
27582 }
27588 }
27590 /* Validate that a clause of the given type does not already exist. */
27592 static void
27595 {
27596 tree c;
27600 {
27603 }
27604 }
27606 /* OpenMP 2.5:
27607 variable-list:
27608 identifier
27609 variable-list , identifier
27611 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27612 colon). An opening parenthesis will have been consumed by the caller.
27614 If KIND is nonzero, create the appropriate node and install the decl
27615 in OMP_CLAUSE_DECL and add the node to the head of the list.
27617 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27618 return the list created.
27620 COLON can be NULL if only closing parenthesis should end the list,
27621 or pointer to bool which will receive false if the list is terminated
27622 by closing parenthesis or true if the list is terminated by colon. */
27624 static tree
27627 {
27631 {
27634 }
27636 {
27653 {
27655 {
27658 {
27662 }
27663 /* FALL THROUGH. */
27669 {
27677 parser->colon_corrects_to_scope_p
27681 else
27682 {
27683 /* Look for `:'. */
27687 CPP_CLOSE_SQUARE))
27689 }
27690 /* Look for the closing `]'. */
27692 RT_CLOSE_SQUARE))
27696 {
27699 {
27703 }
27707 {
27711 }
27712 }
27715 }
27719 }
27725 }
27726 else
27729 get_comma:
27733 }
27739 {
27743 }
27746 {
27749 /* Try to resync to an unnested comma. Copied from
27750 cp_parser_parenthesized_expression_list. */
27751 skip_comma:
27760 }
27763 }
27765 /* Similarly, but expect leading and trailing parenthesis. This is a very
27766 common case for omp clauses. */
27768 static tree
27770 {
27774 }
27776 /* OpenACC 2.0:
27777 copy ( variable-list )
27778 copyin ( variable-list )
27779 copyout ( variable-list )
27780 create ( variable-list )
27781 delete ( variable-list )
27782 present ( variable-list )
27783 present_or_copy ( variable-list )
27784 pcopy ( variable-list )
27785 present_or_copyin ( variable-list )
27786 pcopyin ( variable-list )
27787 present_or_copyout ( variable-list )
27788 pcopyout ( variable-list )
27789 present_or_create ( variable-list )
27790 pcreate ( variable-list ) */
27792 static tree
27794 tree list)
27795 {
27798 {
27838 }
27846 }
27848 /* OpenACC 2.0:
27849 deviceptr ( variable-list ) */
27851 static tree
27853 {
27857 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27858 cp_parser_oacc_data_clause), as for PRAGMA_OMP_CLAUSE_DEVICEPTR,
27859 variable-list must only allow for pointer variables. */
27862 {
27865 /* FIXME diagnostics: Ideally we should keep individual
27866 locations for all the variables in the var list to make the
27867 following errors more precise. Perhaps
27868 c_parser_omp_var_list_parens should construct a list of
27869 locations to go along with the var list. */
27874 ;
27883 }
27886 }
27888 /* OpenACC:
27889 vector_length ( expression ) */
27891 static tree
27893 {
27897 HOST_WIDE_INT n;
27908 {
27911 }
27914 {
27919 }
27930 }
27932 /* OpenACC 2.0
27933 Parse wait clause or directive parameters. */
27935 static tree
27937 {
27947 {
27952 }
27959 {
27963 {
27965 {
27968 }
27969 else
27970 {
27978 }
27979 }
27980 }
27983 }
27985 /* OpenACC:
27986 wait ( int-expr-list ) */
27988 static tree
27990 {
27999 }
28001 /* OpenMP 3.0:
28002 collapse ( constant-expression ) */
28004 static tree
28006 {
28008 location_t loc;
28009 HOST_WIDE_INT n;
28029 {
28032 }
28040 }
28042 /* OpenMP 2.5:
28043 default ( shared | none ) */
28045 static tree
28047 {
28049 tree c;
28054 {
28059 {
28074 }
28077 }
28078 else
28079 {
28080 invalid_kind:
28082 }
28098 }
28100 /* OpenMP 3.1:
28101 final ( expression ) */
28103 static tree
28105 {
28126 }
28128 /* OpenMP 2.5:
28129 if ( expression ) */
28131 static tree
28133 {
28154 }
28156 /* OpenMP 3.1:
28157 mergeable */
28159 static tree
28162 {
28163 tree c;
28166 location);
28171 }
28173 /* OpenMP 2.5:
28174 nowait */
28176 static tree
28179 {
28180 tree c;
28187 }
28189 /* OpenACC:
28190 num_gangs ( expression ) */
28192 static tree
28194 {
28197 HOST_WIDE_INT n;
28214 {
28217 }
28227 }
28229 /* OpenMP 2.5:
28230 num_threads ( expression ) */
28232 static tree
28234 location_t location)
28235 {
28257 }
28259 /* OpenACC:
28260 num_workers ( expression ) */
28262 static tree
28264 {
28267 HOST_WIDE_INT n;
28284 {
28287 }
28290 location);
28298 }
28300 /* OpenMP 2.5:
28301 ordered */
28303 static tree
28306 {
28307 tree c;
28315 }
28317 /* OpenMP 2.5:
28318 reduction ( reduction-operator : variable-list )
28320 reduction-operator:
28321 One of: + * - & ^ | && ||
28323 OpenMP 3.1:
28325 reduction-operator:
28326 One of: + * - & ^ | && || min max
28328 OpenMP 4.0:
28330 reduction-operator:
28331 One of: + * - & ^ | && ||
28332 id-expression */
28334 static tree
28336 {
28344 {
28354 }
28358 else
28359 {
28370 {
28400 }
28401 else
28402 {
28404 resync_fail:
28409 }
28410 }
28416 NULL);
28418 {
28421 }
28424 }
28426 /* OpenMP 2.5:
28427 schedule ( schedule-kind )
28428 schedule ( schedule-kind , expression )
28430 schedule-kind:
28431 static | dynamic | guided | runtime | auto */
28433 static tree
28435 {
28444 {
28449 {
28470 }
28471 }
28476 else
28481 {
28496 else
28501 }
28509 invalid_kind:
28511 resync_fail:
28516 }
28518 /* OpenMP 3.0:
28519 untied */
28521 static tree
28524 {
28525 tree c;
28532 }
28534 /* OpenMP 4.0:
28535 inbranch
28536 notinbranch */
28538 static tree
28541 {
28546 }
28548 /* OpenMP 4.0:
28549 parallel
28550 for
28551 sections
28552 taskgroup */
28554 static tree
28558 {
28562 }
28564 /* OpenMP 4.0:
28565 num_teams ( expression ) */
28567 static tree
28569 location_t location)
28570 {
28592 }
28594 /* OpenMP 4.0:
28595 thread_limit ( expression ) */
28597 static tree
28599 location_t location)
28600 {
28622 }
28624 /* OpenMP 4.0:
28625 aligned ( variable-list )
28626 aligned ( variable-list : constant-expression ) */
28628 static tree
28630 {
28641 {
28651 }
28657 }
28659 /* OpenMP 4.0:
28660 linear ( variable-list )
28661 linear ( variable-list : expression ) */
28663 static tree
28666 {
28677 {
28681 {
28684 }
28692 }
28698 }
28700 /* OpenMP 4.0:
28701 safelen ( constant-expression ) */
28703 static tree
28705 location_t location)
28706 {
28727 }
28729 /* OpenMP 4.0:
28730 simdlen ( constant-expression ) */
28732 static tree
28734 location_t location)
28735 {
28756 }
28758 /* OpenMP 4.0:
28759 depend ( depend-kind : variable-list )
28761 depend-kind:
28762 in | out | inout */
28764 static tree
28766 {
28774 {
28784 else
28786 }
28787 else
28795 NULL);
28802 invalid_kind:
28804 resync_fail:
28809 }
28811 /* OpenMP 4.0:
28812 map ( map-kind : variable-list )
28813 map ( variable-list )
28815 map-kind:
28816 alloc | to | from | tofrom */
28818 static tree
28820 {
28829 {
28841 else
28842 {
28848 }
28851 }
28854 NULL);
28860 }
28862 /* OpenMP 4.0:
28863 device ( expression ) */
28865 static tree
28867 location_t location)
28868 {
28890 }
28892 /* OpenMP 4.0:
28893 dist_schedule ( static )
28894 dist_schedule ( static , expression ) */
28896 static tree
28898 location_t location)
28899 {
28912 {
28923 }
28928 location);
28932 invalid_kind:
28934 resync_fail:
28939 }
28941 /* OpenMP 4.0:
28942 proc_bind ( proc-bind-kind )
28944 proc-bind-kind:
28945 master | close | spread */
28947 static tree
28949 location_t location)
28950 {
28951 tree c;
28958 {
28968 else
28970 }
28971 else
28980 location);
28985 invalid_kind:
28987 resync_fail:
28992 }
28994 /* OpenACC:
28995 async [( int-expr )] */
28997 static tree
28999 {
29003 /* TODO XXX: FIX -1 (acc_async_noval). */
29007 {
29016 }
29026 }
29028 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29029 is a bitmask in MASK. Return the list of clauses found. */
29031 static tree
29035 {
29040 {
29041 location_t here;
29042 pragma_omp_clause c_kind;
29053 {
29135 clauses =
29146 }
29151 {
29152 /* Remove the invalid clause(s) from the list to avoid
29153 confusing the rest of the compiler. */
29156 }
29157 }
29159 saw_error:
29166 }
29168 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29169 is a bitmask in MASK. Return the list of clauses found; the result
29170 of clause default goes in *pdefault. */
29172 static tree
29176 {
29183 {
29184 pragma_omp_clause c_kind;
29195 {
29207 clauses);
29221 clauses);
29230 clauses);
29254 clauses);
29268 clauses);
29285 OMP_CLAUSE_NOTINBRANCH,
29294 {
29295 clause_not_first:
29299 }
29324 clauses);
29329 clauses);
29334 clauses);
29397 }
29402 {
29403 /* Remove the invalid clause(s) from the list to avoid
29404 confusing the rest of the compiler. */
29407 }
29408 }
29409 saw_error:
29410 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29411 no reason to skip to the end. */
29417 }
29419 /* OpenMP 2.5:
29420 structured-block:
29421 statement
29423 In practice, we're also interested in adding the statement to an
29424 outer node. So it is convenient if we work around the fact that
29425 cp_parser_statement calls add_stmt. */
29427 static unsigned
29429 {
29432 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29433 This preserves the "not within loop or switch" style error messages
29434 for nonsense cases like
29435 void foo() {
29436 #pragma omp single
29437 break;
29438 }
29439 */
29444 }
29446 static void
29448 {
29450 }
29452 static tree
29454 {
29462 }
29464 /* OpenMP 2.5:
29465 # pragma omp atomic new-line
29466 expression-stmt
29468 expression-stmt:
29469 x binop= expr | x++ | ++x | x-- | --x
29470 binop:
29471 +, *, -, /, &, ^, |, <<, >>
29473 where x is an lvalue expression with scalar type.
29475 OpenMP 3.1:
29476 # pragma omp atomic new-line
29477 update-stmt
29479 # pragma omp atomic read new-line
29480 read-stmt
29482 # pragma omp atomic write new-line
29483 write-stmt
29485 # pragma omp atomic update new-line
29486 update-stmt
29488 # pragma omp atomic capture new-line
29489 capture-stmt
29491 # pragma omp atomic capture new-line
29492 capture-block
29494 read-stmt:
29495 v = x
29496 write-stmt:
29497 x = expr
29498 update-stmt:
29499 expression-stmt | x = x binop expr
29500 capture-stmt:
29501 v = expression-stmt
29502 capture-block:
29503 { v = x; update-stmt; } | { update-stmt; v = x; }
29505 OpenMP 4.0:
29506 update-stmt:
29507 expression-stmt | x = x binop expr | x = expr binop x
29508 capture-stmt:
29509 v = update-stmt
29510 capture-block:
29511 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29513 where x and v are lvalue expressions with scalar type. */
29515 static void
29517 {
29525 {
29530 {
29536 }
29537 }
29539 {
29551 else
29555 }
29557 {
29563 {
29568 {
29571 }
29572 }
29573 }
29577 {
29587 else
29592 {
29593 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29594 opcode. */
29599 }
29603 {
29606 }
29607 else
29608 {
29614 }
29617 }
29619 restart:
29623 {
29630 /* FALLTHROUGH */
29640 /* FALLTHROUGH */
29655 /* Undo effects of boolean_increment for post {in,de}crement. */
29657 /* FALLTHRU */
29661 {
29662 /* Undo effects of boolean_increment. */
29664 {
29665 /* This is pre or post increment. */
29670 && !structured_block
29674 }
29675 }
29676 /* FALLTHRU */
29679 {
29714 {
29718 }
29721 {
29727 {
29732 }
29734 {
29745 {
29747 {
29752 }
29753 else
29755 }
29759 }
29762 {
29769 }
29773 }
29777 {
29780 {
29788 }
29790 {
29795 }
29830 }
29841 /* FALLTHROUGH */
29846 }
29853 }
29854 stmt_done:
29856 {
29867 }
29869 {
29872 }
29873 done:
29879 saw_error:
29882 {
29886 {
29890 }
29891 }
29892 }
29895 /* OpenMP 2.5:
29896 # pragma omp barrier new-line */
29898 static void
29900 {
29903 }
29905 /* OpenMP 2.5:
29906 # pragma omp critical [(name)] new-line
29907 structured-block */
29909 static tree
29911 {
29915 {
29927 }
29932 }
29934 /* OpenMP 2.5:
29935 # pragma omp flush flush-vars[opt] new-line
29937 flush-vars:
29938 ( variable-list ) */
29940 static void
29942 {
29948 }
29950 /* Helper function, to parse omp for increment expression. */
29952 static tree
29954 {
29959 {
29962 }
29965 {
29974 /* Fall through: OpenMP disallows NE_EXPR. */
29977 }
29979 /* If decl is an iterator, preserve LHS and RHS of the relational
29980 expr until finish_omp_for. */
29990 }
29992 /* Helper function, to parse omp for increment expression. */
29994 static tree
29996 {
30000 cp_id_kind idk;
30004 {
30012 }
30020 {
30025 }
30032 {
30036 }
30048 do
30049 {
30056 {
30058 {
30061 else
30063 tf_warning_or_error);
30064 }
30065 else
30068 }
30069 }
30073 {
30077 }
30078 else
30082 }
30084 /* Parse the initialization statement of either an OpenMP for loop or
30085 a Cilk Plus for loop.
30087 Return true if the resulting construct should have an
30088 OMP_CLAUSE_PRIVATE added to it. */
30090 static bool
30098 {
30104 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30106 init-expr:
30107 var = lb
30108 integer-type var = lb
30109 random-access-iterator-type var = lb
30110 pointer-type var = lb
30111 */
30112 cp_decl_specifier_seq type_specifiers;
30114 /* First, try to parse as an initialized declaration. See
30115 cp_parser_condition, from whence the bulk of this is copied. */
30122 {
30123 /* If parsing a type specifier seq succeeded, then this
30124 MUST be a initialized declaration. */
30129 CP_PARSER_DECLARATOR_NAMED,
30140 else
30141 {
30151 {
30153 CPP_OPEN_PAREN))
30154 {
30158 else
30161 }
30162 else
30163 /* Trigger an error. */
30168 }
30172 {
30180 {
30183 auto_node);
30188 }
30191 asm_specification,
30192 LOOKUP_ONLYCONVERTING);
30194 {
30197 }
30198 else
30201 }
30202 else
30203 {
30204 /* Consume '='. */
30208 non_class:
30211 else
30214 asm_specification,
30215 LOOKUP_ONLYCONVERTING);
30216 }
30220 }
30221 }
30222 else
30223 {
30224 cp_id_kind idk;
30225 /* If parsing a type specifier sequence failed, then
30226 this MUST be a simple expression. */
30234 && decl
30237 {
30238 tree rhs;
30245 rhs,
30246 tf_warning_or_error));
30248 }
30249 else
30250 {
30255 {
30259 }
30260 }
30261 }
30263 }
30265 /* Parse the restricted form of the for statement allowed by OpenMP. */
30267 static tree
30270 {
30274 location_t loc_first;
30293 {
30296 location_t loc;
30300 {
30303 }
30306 {
30309 }
30318 add_private_clause
30325 {
30328 {
30334 }
30335 else
30337 }
30344 {
30349 {
30353 }
30356 {
30357 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30358 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30363 {
30366 }
30367 else
30368 {
30371 }
30375 }
30376 else
30377 {
30382 }
30383 }
30386 {
30387 tree c;
30389 {
30398 decl);
30402 decl);
30403 }
30405 {
30410 {
30413 }
30414 }
30415 }
30424 {
30425 /* If decl is an iterator, preserve the operator on decl
30426 until finish_omp_for. */
30428 && ((processing_template_decl
30432 else
30436 }
30451 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30452 in between the collapsed for loops to be still considered perfectly
30453 nested. Hopefully the final version clarifies this.
30454 For now handle (multiple) {'s and empty statements. */
30456 do
30457 {
30461 {
30463 bracecount++;
30464 }
30468 else
30469 {
30476 }
30477 }
30481 {
30484 }
30485 }
30487 /* Note that we saved the original contents of this flag when we entered
30488 the structured block, and so we don't need to re-save it here. */
30491 else
30494 /* Note that the grammar doesn't call for a structured block here,
30495 though the loop as a whole is a structured block. */
30502 else
30507 {
30509 {
30511 nbraces--;
30512 }
30515 else
30516 {
30518 {
30521 }
30526 }
30527 }
30534 }
30536 /* Helper function for OpenMP parsing, split clauses and call
30537 finish_omp_clauses on each of the set of clauses afterwards. */
30539 static void
30542 {
30548 }
30550 /* OpenMP 4.0:
30551 #pragma omp simd simd-clause[optseq] new-line
30552 for-loop */
30554 #define OMP_SIMD_CLAUSE_MASK \
30555 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30563 static tree
30566 {
30578 {
30581 }
30592 }
30594 /* OpenMP 2.5:
30595 #pragma omp for for-clause[optseq] new-line
30596 for-loop
30598 OpenMP 4.0:
30599 #pragma omp for simd for-simd-clause[optseq] new-line
30600 for-loop */
30602 #define OMP_FOR_CLAUSE_MASK \
30603 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30612 static tree
30615 {
30626 {
30631 {
30639 cclauses);
30643 cclauses);
30655 }
30656 }
30658 {
30661 }
30666 {
30669 }
30680 }
30682 /* OpenMP 2.5:
30683 # pragma omp master new-line
30684 structured-block */
30686 static tree
30688 {
30692 }
30694 /* OpenMP 2.5:
30695 # pragma omp ordered new-line
30696 structured-block */
30698 static tree
30700 {
30704 }
30706 /* OpenMP 2.5:
30708 section-scope:
30709 { section-sequence }
30711 section-sequence:
30712 section-directive[opt] structured-block
30713 section-sequence section-directive structured-block */
30715 static tree
30717 {
30728 {
30732 }
30735 {
30743 {
30747 }
30749 {
30752 }
30757 }
30768 }
30770 /* OpenMP 2.5:
30771 # pragma omp sections sections-clause[optseq] newline
30772 sections-scope */
30774 #define OMP_SECTIONS_CLAUSE_MASK \
30775 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30781 static tree
30784 {
30796 {
30799 }
30806 }
30808 /* OpenMP 2.5:
30809 # pragma omp parallel parallel-clause[optseq] new-line
30810 structured-block
30811 # pragma omp parallel for parallel-for-clause[optseq] new-line
30812 structured-block
30813 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30814 structured-block
30816 OpenMP 4.0:
30817 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30818 structured-block */
30820 #define OMP_PARALLEL_CLAUSE_MASK \
30821 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30831 static tree
30834 {
30843 {
30856 block);
30861 }
30863 {
30867 }
30869 {
30872 }
30874 {
30878 {
30888 block);
30891 }
30892 }
30902 }
30904 /* OpenMP 2.5:
30905 # pragma omp single single-clause[optseq] new-line
30906 structured-block */
30908 #define OMP_SINGLE_CLAUSE_MASK \
30909 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30914 static tree
30916 {
30926 }
30928 /* OpenMP 3.0:
30929 # pragma omp task task-clause[optseq] new-line
30930 structured-block */
30932 #define OMP_TASK_CLAUSE_MASK \
30933 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30943 static tree
30945 {
30956 }
30958 /* OpenMP 3.0:
30959 # pragma omp taskwait new-line */
30961 static void
30963 {
30966 }
30968 /* OpenMP 3.1:
30969 # pragma omp taskyield new-line */
30971 static void
30973 {
30976 }
30978 /* OpenMP 4.0:
30979 # pragma omp taskgroup new-line
30980 structured-block */
30982 static tree
30984 {
30988 }
30991 /* OpenMP 2.5:
30992 # pragma omp threadprivate (variable-list) */
30994 static void
30996 {
30997 tree vars;
31003 }
31005 /* OpenMP 4.0:
31006 # pragma omp cancel cancel-clause[optseq] new-line */
31008 #define OMP_CANCEL_CLAUSE_MASK \
31009 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31015 static void
31017 {
31021 }
31023 /* OpenMP 4.0:
31024 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31026 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31027 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31032 static void
31034 {
31035 tree clauses;
31039 {
31044 {
31047 }
31048 }
31050 {
31054 }
31057 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31059 pragma_tok);
31061 }
31063 /* OpenMP 4.0:
31064 #pragma omp distribute distribute-clause[optseq] new-line
31065 for-loop */
31067 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31068 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31073 static tree
31076 {
31085 {
31093 else
31096 {
31102 {
31105 cclauses);
31106 else
31108 cclauses);
31109 }
31114 cclauses);
31115 else
31117 cclauses);
31129 }
31130 }
31132 {
31135 }
31140 {
31143 }
31154 }
31156 /* OpenMP 4.0:
31157 # pragma omp teams teams-clause[optseq] new-line
31158 structured-block */
31160 #define OMP_TEAMS_CLAUSE_MASK \
31161 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31169 static tree
31172 {
31181 {
31185 {
31193 cclauses);
31197 cclauses);
31208 }
31209 }
31211 {
31214 }
31219 {
31222 }
31230 }
31232 /* OpenMP 4.0:
31233 # pragma omp target data target-data-clause[optseq] new-line
31234 structured-block */
31236 #define OMP_TARGET_DATA_CLAUSE_MASK \
31237 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31241 static tree
31243 {
31255 }
31257 /* OpenMP 4.0:
31258 # pragma omp target update target-update-clause[optseq] new-line */
31260 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31261 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31266 static bool
31269 {
31271 {
31273 "%<#pragma omp target update%> may only be "
31277 }
31279 tree clauses
31284 {
31286 "%<#pragma omp target update must contain at least one "
31289 }
31297 }
31299 /* OpenMP 4.0:
31300 # pragma omp target target-clause[optseq] new-line
31301 structured-block */
31303 #define OMP_TARGET_CLAUSE_MASK \
31304 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31308 static bool
31311 {
31313 {
31317 }
31320 {
31325 {
31333 {
31335 OMP_TARGET_CLAUSE_MASK,
31336 cclauses);
31338 }
31354 }
31356 {
31359 }
31361 {
31365 }
31367 {
31370 }
31371 }
31385 }
31387 /* OpenACC 2.0:
31388 # pragma acc cache (variable-list) new-line
31389 */
31391 static tree
31393 {
31408 }
31410 /* OpenACC 2.0:
31411 # pragma acc data oacc-data-clause[optseq] new-line
31412 structured-block */
31414 #define OACC_DATA_CLAUSE_MASK \
31415 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE))
31427 static tree
31429 {
31442 }
31444 /* OpenACC 2.0:
31445 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31447 or
31449 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31451 LOC is the location of the #pragma token.
31452 */
31454 #define OACC_ENTER_DATA_CLAUSE_MASK \
31455 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT) )
31463 #define OACC_EXIT_DATA_CLAUSE_MASK \
31464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DELETE) \
31468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT) )
31470 static tree
31473 {
31478 {
31484 }
31489 {
31493 }
31500 else
31505 {
31509 }
31515 else
31520 }
31522 /* OpenACC 2.0:
31523 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31524 structured-block */
31526 #define OACC_KERNELS_CLAUSE_MASK \
31527 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31541 static tree
31543 {
31556 }
31558 /* OpenACC 2.0:
31559 # pragma acc loop oacc-loop-clause[optseq] new-line
31560 structured-block */
31562 #define OACC_LOOP_CLAUSE_MASK \
31563 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION))
31566 static tree
31568 {
31581 }
31583 /* OpenACC 2.0:
31584 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31585 structured-block */
31587 #define OACC_PARALLEL_CLAUSE_MASK \
31588 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_GANGS) \
31596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_WORKERS) \
31597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_VECTOR_LENGTH) \
31604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31606 static tree
31608 {
31621 }
31623 /* OpenACC 2.0:
31624 # pragma acc update oacc-update-clause[optseq] new-line
31625 */
31627 #define OACC_UPDATE_CLAUSE_MASK \
31628 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HOST) \
31631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SELF) \
31633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31635 static tree
31637 {
31644 {
31646 "%<#pragma acc update%> must contain at least one "
31649 }
31657 }
31659 /* OpenACC 2.0:
31660 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31662 LOC is the location of the #pragma token.
31663 */
31665 #define OACC_WAIT_CLAUSE_MASK \
31666 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC))
31668 static tree
31670 {
31683 }
31685 /* OpenMP 4.0:
31686 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31688 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31689 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31696 static void
31699 {
31701 cp_omp_declare_simd_data data;
31703 {
31708 }
31719 {
31723 {
31736 }
31741 "%<#pragma omp declare simd%> not immediately followed by "
31745 }
31746 }
31748 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31749 This function is modelled similar to the late parsing of omp declare
31750 simd. */
31752 static tree
31754 {
31760 {
31766 }
31768 {
31772 }
31777 {
31784 NULL);
31798 }
31803 }
31805 /* Finalize #pragma omp declare simd clauses after direct declarator has
31806 been parsed, and put that into "omp declare simd" attribute. */
31808 static tree
31810 {
31816 {
31821 }
31826 {
31844 }
31848 }
31851 /* OpenMP 4.0:
31852 # pragma omp declare target new-line
31853 declarations and definitions
31854 # pragma omp end declare target new-line */
31856 static void
31858 {
31861 }
31863 static void
31865 {
31868 {
31871 }
31873 {
31877 {
31880 }
31883 else
31884 {
31888 }
31889 }
31890 else
31891 {
31895 }
31899 "%<#pragma omp end declare target%> without corresponding "
31901 else
31903 }
31905 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31906 expression and optional initializer clause of
31907 #pragma omp declare reduction. We store the expression(s) as
31908 either 3, 6 or 7 special statements inside of the artificial function's
31909 body. The first two statements are DECL_EXPRs for the artificial
31910 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31911 expression that uses those variables.
31912 If there was any INITIALIZER clause, this is followed by further statements,
31913 the fourth and fifth statements are DECL_EXPRs for the artificial
31914 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31915 constructor variant (first token after open paren is not omp_priv),
31916 then the sixth statement is a statement with the function call expression
31917 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31918 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31919 to initialize the OMP_PRIV artificial variable and there is seventh
31920 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31922 static bool
31924 {
31936 tree combiner;
31951 {
31954 }
31957 {
31964 {
31967 }
31983 {
31987 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31991 == CPP_CLOSE_PAREN
31994 {
31998 }
32003 }
32004 else
32005 {
32021 {
32026 }
32028 tree arg;
32041 }
32052 }
32058 }
32060 /* OpenMP 4.0
32061 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32062 initializer-clause[opt] new-line
32064 initializer-clause:
32065 initializer (omp_priv initializer)
32066 initializer (function-name (argument-list)) */
32068 static void
32071 {
32081 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32088 {
32120 }
32132 /* Types may not be defined in declare reduction type list. */
32135 parser->type_definition_forbidden_message
32141 saved_colon_doesnt_start_class_def_p
32146 {
32150 ;
32171 else
32176 else
32178 }
32180 /* Restore the saved message. */
32183 parser->colon_doesnt_start_class_def_p
32188 {
32189 fail:
32192 }
32198 {
32199 tree fntype
32202 NULL_TREE);
32221 {
32226 }
32228 {
32230 {
32239 }
32246 }
32247 else
32248 {
32251 }
32254 else
32257 {
32260 }
32262 {
32265 else
32270 }
32275 else
32276 {
32285 }
32292 }
32296 done:
32297 /* Free any declarators allocated. */
32299 }
32301 /* OpenMP 4.0
32302 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32303 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32304 initializer-clause[opt] new-line
32305 #pragma omp declare target new-line */
32307 static void
32310 {
32312 {
32317 {
32320 context);
32322 }
32325 {
32328 context);
32330 }
32332 {
32335 }
32337 {
32341 }
32342 }
32346 }
32348 /* Main entry point to OpenMP statement pragmas. */
32350 static void
32352 {
32353 tree stmt;
32358 {
32433 }
32437 }
32438 \f
32439 /* Transactional Memory parsing routines. */
32441 /* Parse a transaction attribute.
32443 txn-attribute:
32444 attribute
32445 [ [ identifier ] ]
32447 ??? Simplify this when C++0x bracket attributes are
32448 implemented properly. */
32450 static tree
32452 {
32467 {
32471 /* For keywords, use the canonical spelling,
32472 not the parsed identifier. */
32476 }
32477 else
32481 error1:
32484 }
32486 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32488 transaction-statement:
32489 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32490 compound-statement
32491 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32492 */
32494 static tree
32496 {
32511 else
32512 {
32516 }
32518 /* Parse a noexcept specification. */
32521 /* Keep track if we're in the lexical scope of an outer transaction. */
32533 }
32535 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32537 transaction-expression:
32538 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32539 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32540 */
32542 static tree
32544 {
32569 /* Set this early. This might mean that we allow transaction_cancel in
32570 an expression that we find out later actually has to be a constexpr.
32571 However, we expect that cxx_constant_value will be able to deal with
32572 this; also, if the noexcept has no constexpr, then what we parse next
32573 really is a transaction's body. */
32576 /* Parse a noexcept specification. */
32582 {
32589 }
32590 else
32591 {
32592 /* The only expression that is available got parsed for the noexcept
32593 already. noexcept is true then. */
32596 }
32605 }
32607 /* Parse a function-transaction-block.
32609 function-transaction-block:
32610 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32611 function-body
32612 __transaction_atomic txn-attribute[opt] function-try-block
32613 __transaction_relaxed ctor-initializer[opt] function-body
32614 __transaction_relaxed function-try-block
32615 */
32617 static bool
32619 {
32635 else
32636 {
32640 }
32648 else
32649 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32657 }
32659 /* Parse a __transaction_cancel statement.
32661 cancel-statement:
32662 __transaction_cancel txn-attribute[opt] ;
32663 __transaction_cancel txn-attribute[opt] throw-expression ;
32665 ??? Cancel and throw is not yet implemented. */
32667 static tree
32669 {
32675 RT_TRANSACTION_CANCEL);
32682 /* ??? Parse cancel-and-throw here. */
32687 {
32691 }
32693 {
32697 }
32699 {
32702 {
32708 }
32709 }
32711 {
32715 }
32721 }
32722 \f
32723 /* The parser. */
32727 \f
32728 /* Special handling for the first token or line in the file. The first
32729 thing in the file might be #pragma GCC pch_preprocess, which loads a
32730 PCH file, which is a GC collection point. So we need to handle this
32731 first pragma without benefit of an existing lexer structure.
32733 Always returns one token to the caller in *FIRST_TOKEN. This is
32734 either the true first token of the file, or the first token after
32735 the initial pragma. */
32737 static void
32739 {
32748 {
32755 }
32756 else
32759 /* Skip to the end of the pragma. */
32763 /* Now actually load the PCH file. */
32767 /* Read one more token to return to our caller. We have to do this
32768 after reading the PCH file in, since its pointers have to be
32769 live. */
32771 }
32773 /* Parses the grainsize pragma for the _Cilk_for statement.
32774 Syntax:
32775 #pragma cilk grainsize = <VALUE>. */
32777 static void
32779 {
32781 {
32786 {
32789 }
32791 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32794 else
32796 "%<#pragma cilk grainsize%> is not followed by "
32799 }
32801 }
32803 /* Normal parsing of a pragma token. Here we can (and must) use the
32804 regular lexer. */
32806 static bool
32808 {
32820 {
32828 {
32838 }
32843 {
32853 }
32858 {
32864 "%<#pragma omp taskwait%> may only be "
32869 }
32874 {
32880 "%<#pragma omp taskyield%> may only be "
32885 }
32890 {
32896 "%<#pragma omp cancel%> may only be "
32901 }
32906 {
32912 "%<#pragma omp cancellation point%> may only be "
32917 }
32964 "%<#pragma omp section%> may only be used in "
32969 {
32976 {
32979 }
32982 }
32986 {
32990 }
32996 {
33000 }
33002 /* Ignore the pragma if Cilk Plus is not enabled. */
33004 {
33007 }
33008 else
33009 {
33013 }
33020 bad_stmt:
33023 }
33027 }
33029 /* The interface the pragma parsers have to the lexer. */
33031 enum cpp_ttype
33033 {
33046 else
33047 {
33051 }
33054 }
33056 \f
33057 /* External interface. */
33059 /* Parse one entire translation unit. */
33061 void
33063 {
33075 }
33077 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33078 vectorlength clause:
33079 Syntax:
33080 vectorlength ( constant-expression ) */
33082 static tree
33085 {
33087 tree expr;
33088 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33089 safelen clause. Thus, vectorlength is represented as OMP 4.0
33090 safelen. For SIMD-enabled function it is represented by OMP 4.0
33091 simdlen. */
33094 loc);
33095 else
33097 loc);
33105 /* If expr == error_mark_node, then don't emit any errors nor
33106 create a clause. if any of the above functions returns
33107 error mark node then they would have emitted an error message. */
33109 ;
33117 else
33118 {
33119 tree c;
33121 {
33126 }
33127 else
33128 {
33133 }
33134 }
33139 }
33141 /* Handles the Cilk Plus #pragma simd linear clause.
33142 Syntax:
33143 linear ( simd-linear-variable-list )
33145 simd-linear-variable-list:
33146 simd-linear-variable
33147 simd-linear-variable-list , simd-linear-variable
33149 simd-linear-variable:
33150 id-expression
33151 id-expression : simd-linear-step
33153 simd-linear-step:
33154 conditional-expression */
33156 static tree
33158 {
33164 {
33168 }
33173 {
33176 {
33180 }
33187 {
33191 }
33192 else
33193 {
33197 /* If present, parse the linear step. Otherwise, assume the default
33198 value of 1. */
33200 {
33207 {
33208 /* If an error has occurred, then the whole pragma is
33209 considered ill-formed. Thus, no reason to keep
33210 parsing. */
33213 }
33221 else
33223 "step size must be an integer constant "
33225 }
33227 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33233 }
33238 else
33239 {
33244 }
33245 }
33249 }
33251 /* Returns the name of the next clause. If the clause is not
33252 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33253 token is not consumed. Otherwise, the appropriate enum from the
33254 pragma_simd_clause is returned and the token is consumed. */
33256 static pragma_omp_clause
33258 {
33259 pragma_omp_clause clause_type;
33276 else
33281 }
33283 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33285 static tree
33287 {
33292 {
33293 pragma_omp_clause c_kind;
33300 /* Use the OpenMP 4.0 equivalent function. */
33303 /* Use the OpenMP 4.0 equivalent function. */
33305 clauses);
33307 /* Use the OMP 4.0 equivalent function. */
33309 clauses);
33311 /* Use the OMP 4.0 equivalent function. */
33313 else
33314 {
33318 }
33319 }
33325 else
33327 }
33329 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33331 static void
33333 {
33340 {
33344 }
33353 }
33355 /* Main entry-point for parsing Cilk Plus _Cilk_for
33356 loops. The return value is error_mark_node
33357 when errors happen and CILK_FOR tree on success. */
33359 static tree
33361 {
33376 else
33382 }
33384 /* Create an identifier for a generic parameter type (a synthesized
33385 template parameter implied by `auto' or a concept identifier). */
33388 static tree
33390 {
33394 }
33396 /* Predicate that behaves as is_auto_or_concept but matches the parent
33397 node of the generic type rather than the generic type itself. This
33398 allows for type transformation in add_implicit_template_parms. */
33402 {
33404 }
33406 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33407 (creating a new template parameter list if necessary). Returns the newly
33408 created template type parm. */
33410 tree
33412 {
33415 /* We are either continuing a function template that already contains implicit
33416 template parameters, creating a new fully-implicit function template, or
33417 extending an existing explicit function template with implicit template
33418 parameters. */
33426 {
33430 }
33431 else
33432 {
33433 /* Roll back to the existing template parameter scope (in the case of
33434 extending an explicit function template) or introduce a new template
33435 parameter scope ahead of the function parameter scope (or class scope
33436 in the case of out-of-line member definitions). The function scope is
33437 added back after template parameter synthesis below. */
33442 {
33445 }
33447 {
33448 /* If not defining a class, then any class scope is a scope level in
33449 an out-of-line member definition. In this case simply wind back
33450 beyond the first such scope to inject the template parameter list.
33451 Otherwise wind back to the class being defined. The latter can
33452 occur in class member friend declarations such as:
33454 class A {
33455 void foo (auto);
33456 };
33457 class B {
33458 friend void A::foo (auto);
33459 };
33461 The template parameter list synthesized for the friend declaration
33462 must be injected in the scope of 'B'. This can also occur in
33463 erroneous cases such as:
33465 struct A {
33466 struct B {
33467 void foo (auto);
33468 };
33469 void B::foo (auto) {}
33470 };
33472 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33473 but, nevertheless, the template parameter list synthesized for the
33474 declarator should be injected into the scope of 'A' as if the
33475 ill-formed template was specified explicitly. */
33478 {
33481 }
33482 }
33488 {
33489 /* Introduce a new template parameter list for implicit template
33490 parameters. */
33494 parser->implicit_template_scope
33501 }
33502 else
33503 {
33504 /* Synthesize implicit template parameters at the end of the explicit
33505 template parameter list. */
33512 parser->implicit_template_parms
33514 }
33515 }
33517 /* Synthesize a new template parameter and track the current template
33518 parameter chain with implicit_template_parms. */
33522 synth_id);
33523 tree new_parm
33525 input_location,
33532 parser->implicit_template_parms
33534 else
33539 /* If creating a fully implicit function template, start the new implicit
33540 template parameter list with this synthesized type, otherwise grow the
33541 current template parameter list. */
33544 {
33551 }
33552 else
33553 {
33558 }
33563 }
33565 /* Finish the declaration of a fully implicit function template. Such a
33566 template has no explicit template parameter list so has not been through the
33567 normal template head and tail processing. synthesize_implicit_template_parm
33568 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33569 provided if the declaration is a class member such that its template
33570 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33571 form is returned. Otherwise NULL_TREE is returned. */
33573 tree
33575 {
33580 {
33584 }
33594 }