| blob | f5747e5787f580b6f76ffa7becd72ef9a2b438d9 |
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 {
4506 non_integral_constant name;
4508 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4509 __func__ are the names of variables -- but they are
4510 treated specially. Therefore, they are handled here,
4511 rather than relying on the generic id-expression logic
4512 below. Grammatically, these names are id-expressions.
4514 Consume the token. */
4518 {
4530 }
4535 /* Look up the name. */
4537 }
4540 {
4541 tree expression;
4542 tree type;
4543 source_location type_location;
4545 /* The `__builtin_va_arg' construct is used to handle
4546 `va_arg'. Consume the `__builtin_va_arg' token. */
4548 /* Look for the opening `('. */
4550 /* Now, parse the assignment-expression. */
4552 /* Look for the `,'. */
4555 /* Parse the type-id. */
4557 /* Look for the closing `)'. */
4559 /* Using `va_arg' in a constant-expression is not
4560 allowed. */
4562 NIC_VA_ARG))
4565 }
4595 /* Objective-C++ expressions. */
4605 {
4610 }
4614 }
4616 /* An id-expression can start with either an identifier, a
4617 `::' as the beginning of a qualified-id, or the "operator"
4618 keyword. */
4623 {
4624 tree id_expression;
4625 tree decl;
4631 id_expression:
4632 /* Parse the id-expression. */
4633 id_expression
4650 /* If we have a template-id, then no further lookup is
4651 required. If the template-id was for a template-class, we
4652 will sometimes have a TYPE_DECL at this point. */
4656 /* Look up the name. */
4657 else
4658 {
4659 tree ambiguous_decls;
4661 /* If we already know that this lookup is ambiguous, then
4662 we've already issued an error message; there's no reason
4663 to check again. */
4666 {
4669 }
4672 none_type,
4673 template_p,
4678 /* If the lookup was ambiguous, an error will already have
4679 been issued. */
4683 /* In Objective-C++, we may have an Objective-C 2.0
4684 dot-syntax for classes here. */
4689 {
4690 tree component;
4697 }
4699 /* In Objective-C++, an instance variable (ivar) may be preferred
4700 to whatever cp_parser_lookup_name() found. */
4703 /* If name lookup gives us a SCOPE_REF, then the
4704 qualifying scope was dependent. */
4706 {
4707 /* At this point, we do not know if DECL is a valid
4708 integral constant expression. We assume that it is
4709 in fact such an expression, so that code like:
4711 template <int N> struct A {
4712 int a[B<N>::i];
4713 };
4715 is accepted. At template-instantiation time, we
4716 will check that B<N>::i is actually a constant. */
4718 }
4719 /* Check to see if DECL is a local variable in a context
4720 where that is forbidden. */
4723 {
4724 /* It might be that we only found DECL because we are
4725 trying to be generous with pre-ISO scoping rules.
4726 For example, consider:
4728 int i;
4729 void g() {
4730 for (int i = 0; i < 10; ++i) {}
4731 extern void f(int j = i);
4732 }
4734 Here, name look up will originally find the out
4735 of scope `i'. We need to issue a warning message,
4736 but then use the global `i'. */
4739 {
4742 decl);
4744 }
4745 }
4746 }
4748 decl = (finish_id_expression
4750 idk,
4755 template_arg_p,
4761 }
4763 /* Anything else is an error. */
4767 }
4768 }
4776 {
4779 }
4781 /* Parse an id-expression.
4783 id-expression:
4784 unqualified-id
4785 qualified-id
4787 qualified-id:
4788 :: [opt] nested-name-specifier template [opt] unqualified-id
4789 :: identifier
4790 :: operator-function-id
4791 :: template-id
4793 Return a representation of the unqualified portion of the
4794 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4795 a `::' or nested-name-specifier.
4797 Often, if the id-expression was a qualified-id, the caller will
4798 want to make a SCOPE_REF to represent the qualified-id. This
4799 function does not do this in order to avoid wastefully creating
4800 SCOPE_REFs when they are not required.
4802 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4803 `template' keyword.
4805 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4806 uninstantiated templates.
4808 If *TEMPLATE_P is non-NULL, it is set to true iff the
4809 `template' keyword is used to explicitly indicate that the entity
4810 named is a template.
4812 If DECLARATOR_P is true, the id-expression is appearing as part of
4813 a declarator, rather than as part of an expression. */
4815 static tree
4822 {
4826 /* Assume the `template' keyword was not used. */
4830 /* Look for the optional `::' operator. */
4831 global_scope_p
4834 /* Look for the optional nested-name-specifier. */
4835 nested_name_specifier_p
4838 check_dependency_p,
4840 declarator_p)
4842 /* If there is a nested-name-specifier, then we are looking at
4843 the first qualified-id production. */
4845 {
4846 tree saved_scope;
4847 tree saved_object_scope;
4848 tree saved_qualifying_scope;
4849 tree unqualified_id;
4852 /* See if the next token is the `template' keyword. */
4856 /* Name lookup we do during the processing of the
4857 unqualified-id might obliterate SCOPE. */
4861 /* Process the final unqualified-id. */
4863 check_dependency_p,
4864 declarator_p,
4866 /* Restore the SAVED_SCOPE for our caller. */
4872 }
4873 /* Otherwise, if we are in global scope, then we are looking at one
4874 of the other qualified-id productions. */
4876 {
4878 tree id;
4880 /* Peek at the next token. */
4883 /* If it's an identifier, and the next token is not a "<", then
4884 we can avoid the template-id case. This is an optimization
4885 for this common case. */
4887 && !cp_parser_nth_token_starts_template_argument_list_p
4892 /* Try a template-id. */
4896 none_type,
4897 declarator_p);
4898 /* If that worked, we're done. */
4902 /* Peek at the next token. (Changes in the token buffer may
4903 have invalidated the pointer obtained above.) */
4907 {
4914 /* Fall through. */
4919 }
4920 }
4921 else
4924 declarator_p,
4925 optional_p);
4926 }
4928 /* Parse an unqualified-id.
4930 unqualified-id:
4931 identifier
4932 operator-function-id
4933 conversion-function-id
4934 ~ class-name
4935 template-id
4937 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4938 keyword, in a construct like `A::template ...'.
4940 Returns a representation of unqualified-id. For the `identifier'
4941 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4942 production a BIT_NOT_EXPR is returned; the operand of the
4943 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4944 other productions, see the documentation accompanying the
4945 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4946 names are looked up in uninstantiated templates. If DECLARATOR_P
4947 is true, the unqualified-id is appearing as part of a declarator,
4948 rather than as part of an expression. */
4950 static tree
4956 {
4959 /* Peek at the next token. */
4963 {
4965 {
4966 tree id;
4968 /* We don't know yet whether or not this will be a
4969 template-id. */
4971 /* Try a template-id. */
4973 check_dependency_p,
4974 none_type,
4975 declarator_p);
4976 /* If it worked, we're done. */
4979 /* Otherwise, it's an ordinary identifier. */
4981 }
4985 check_dependency_p,
4986 none_type,
4987 declarator_p);
4990 {
4991 tree type_decl;
4992 tree qualifying_scope;
4993 tree object_scope;
4994 tree scope;
4997 /* Consume the `~' token. */
4999 /* Parse the class-name. The standard, as written, seems to
5000 say that:
5002 template <typename T> struct S { ~S (); };
5003 template <typename T> S<T>::~S() {}
5005 is invalid, since `~' must be followed by a class-name, but
5006 `S<T>' is dependent, and so not known to be a class.
5007 That's not right; we need to look in uninstantiated
5008 templates. A further complication arises from:
5010 template <typename T> void f(T t) {
5011 t.T::~T();
5012 }
5014 Here, it is not possible to look up `T' in the scope of `T'
5015 itself. We must look in both the current scope, and the
5016 scope of the containing complete expression.
5018 Yet another issue is:
5020 struct S {
5021 int S;
5022 ~S();
5023 };
5025 S::~S() {}
5027 The standard does not seem to say that the `S' in `~S'
5028 should refer to the type `S' and not the data member
5029 `S::S'. */
5031 /* DR 244 says that we look up the name after the "~" in the
5032 same scope as we looked up the qualifying name. That idea
5033 isn't fully worked out; it's more complicated than that. */
5038 /* Check for invalid scopes. */
5040 {
5044 }
5046 {
5050 scope);
5055 }
5058 /* If the name is of the form "X::~X" it's OK even if X is a
5059 typedef. */
5068 {
5071 }
5073 /* ~auto means the destructor of whatever the object is. */
5075 {
5078 "%<~auto%> only available with "
5082 }
5084 /* If there was an explicit qualification (S::~T), first look
5085 in the scope given by the qualification (i.e., S).
5087 Note: in the calls to cp_parser_class_name below we pass
5088 typename_type so that lookup finds the injected-class-name
5089 rather than the constructor. */
5093 {
5098 typename_type,
5101 declarator_p);
5104 }
5105 /* In "N::S::~S", look in "N" as well. */
5107 {
5112 type_decl
5116 typename_type,
5119 declarator_p);
5122 }
5123 /* In "p->S::~T", look in the scope given by "*p" as well. */
5125 {
5130 type_decl
5134 typename_type,
5137 declarator_p);
5140 }
5141 /* Look in the surrounding context. */
5143 {
5149 type_decl
5153 typename_type,
5156 declarator_p);
5159 {
5160 /* We couldn't find a type with this name, so just accept
5161 it and check for a match at instantiation time. */
5166 }
5167 }
5168 /* If an error occurred, assume that the name of the
5169 destructor is the same as the name of the qualifying
5170 class. That allows us to keep parsing after running
5171 into ill-formed destructor names. */
5177 /* Check that destructor name and scope match. */
5179 {
5186 }
5188 /* [class.dtor]
5190 A typedef-name that names a class shall not be used as the
5191 identifier in the declarator for a destructor declaration. */
5198 type_decl);
5201 }
5205 {
5206 tree id;
5208 /* This could be a template-id, so we try that first. */
5210 /* Try a template-id. */
5213 none_type,
5214 declarator_p);
5215 /* If that worked, we're done. */
5218 /* We still don't know whether we're looking at an
5219 operator-function-id or a conversion-function-id. */
5221 /* Try an operator-function-id. */
5223 /* If that didn't work, try a conversion-function-id. */
5227 {
5228 /* 17.6.3.3.5 */
5234 }
5237 }
5238 /* Fall through. */
5245 }
5246 }
5248 /* Parse an (optional) nested-name-specifier.
5250 nested-name-specifier: [C++98]
5251 class-or-namespace-name :: nested-name-specifier [opt]
5252 class-or-namespace-name :: template nested-name-specifier [opt]
5254 nested-name-specifier: [C++0x]
5255 type-name ::
5256 namespace-name ::
5257 nested-name-specifier identifier ::
5258 nested-name-specifier template [opt] simple-template-id ::
5260 PARSER->SCOPE should be set appropriately before this function is
5261 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5262 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5263 in name lookups.
5265 Sets PARSER->SCOPE to the class (TYPE) or namespace
5266 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5267 it unchanged if there is no nested-name-specifier. Returns the new
5268 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5270 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5271 part of a declaration and/or decl-specifier. */
5273 static tree
5279 {
5284 /* Remember where the nested-name-specifier starts. */
5286 {
5289 }
5292 {
5293 tree new_scope;
5294 tree old_scope;
5295 tree saved_qualifying_scope;
5298 /* Spot cases that cannot be the beginning of a
5299 nested-name-specifier. */
5302 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5303 the already parsed nested-name-specifier. */
5305 {
5306 /* Grab the nested-name-specifier and continue the loop. */
5308 /* If we originally encountered this nested-name-specifier
5309 with IS_DECLARATION set to false, we will not have
5310 resolved TYPENAME_TYPEs, so we must do so here. */
5313 {
5318 }
5321 }
5323 /* Spot cases that cannot be the beginning of a
5324 nested-name-specifier. On the second and subsequent times
5325 through the loop, we look for the `template' keyword. */
5327 ;
5328 /* A template-id can start a nested-name-specifier. */
5330 ;
5331 /* DR 743: decltype can be used in a nested-name-specifier. */
5333 ;
5334 else
5335 {
5336 /* If the next token is not an identifier, then it is
5337 definitely not a type-name or namespace-name. */
5340 /* If the following token is neither a `<' (to begin a
5341 template-id), nor a `::', then we are not looking at a
5342 nested-name-specifier. */
5348 {
5352 }
5355 && !cp_parser_nth_token_starts_template_argument_list_p
5358 }
5360 /* The nested-name-specifier is optional, so we parse
5361 tentatively. */
5364 /* Look for the optional `template' keyword, if this isn't the
5365 first time through the loop. */
5368 else
5371 /* Save the old scope since the name lookup we are about to do
5372 might destroy it. */
5375 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5376 look up names in "X<T>::I" in order to determine that "Y" is
5377 a template. So, if we have a typename at this point, we make
5378 an effort to look through it. */
5380 && !typename_keyword_p
5385 /* Parse the qualifying entity. */
5386 new_scope
5388 typename_keyword_p,
5389 template_keyword_p,
5390 check_dependency_p,
5391 type_p,
5392 is_declaration);
5393 /* Look for the `::' token. */
5396 /* If we found what we wanted, we keep going; otherwise, we're
5397 done. */
5399 {
5402 /* Restore the OLD_SCOPE since it was valid before the
5403 failed attempt at finding the last
5404 class-or-namespace-name. */
5408 /* If the next token is a decltype, and the one after that is a
5409 `::', then the decltype has failed to resolve to a class or
5410 enumeration type. Give this error even when parsing
5411 tentatively since it can't possibly be valid--and we're going
5412 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5413 won't get another chance.*/
5417 {
5424 /* As below. */
5427 }
5431 /* If the next token is an identifier, and the one after
5432 that is a `::', then any valid interpretation would have
5433 found a class-or-namespace-name. */
5439 {
5442 {
5444 {
5445 tree decl;
5446 tree ambiguous_decls;
5449 none_type,
5458 decl);
5460 {
5461 // cp_parser_lookup_name has the same diagnostic,
5462 // thus make sure to emit it at most once.
5465 {
5470 }
5472 }
5473 else
5474 {
5476 cp_parser_name_lookup_error
5479 else
5480 cp_parser_name_lookup_error
5483 }
5484 }
5487 /* Treat this as a successful nested-name-specifier
5488 due to:
5490 [basic.lookup.qual]
5492 If the name found is not a class-name (clause
5493 _class_) or namespace-name (_namespace.def_), the
5494 program is ill-formed. */
5496 }
5498 }
5500 }
5501 /* We've found one valid nested-name-specifier. */
5503 /* Name lookup always gives us a DECL. */
5506 /* Uses of "template" must be followed by actual templates. */
5518 new_scope);
5519 /* If it is a class scope, try to complete it; we are about to
5520 be looking up names inside the class. */
5522 /* Since checking types for dependency can be expensive,
5523 avoid doing it if the type is already complete. */
5525 /* Do not try to complete dependent types. */
5527 {
5529 /* If it is a typedef to current class, use the current
5530 class instead, as the typedef won't have any names inside
5531 it yet. */
5535 }
5536 /* Make sure we look in the right scope the next time through
5537 the loop. */
5539 }
5541 /* If parsing tentatively, replace the sequence of tokens that makes
5542 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5543 token. That way, should we re-parse the token stream, we will
5544 not have to repeat the effort required to do the parse, nor will
5545 we issue duplicate error messages. */
5547 {
5551 /* Reset the contents of the START token. */
5553 /* Retrieve any deferred checks. Do not pop this access checks yet
5554 so the memory will not be reclaimed during token replacing below. */
5562 /* Purge all subsequent tokens. */
5564 }
5570 }
5572 /* Parse a nested-name-specifier. See
5573 cp_parser_nested_name_specifier_opt for details. This function
5574 behaves identically, except that it will an issue an error if no
5575 nested-name-specifier is present. */
5577 static tree
5583 {
5584 tree scope;
5586 /* Look for the nested-name-specifier. */
5588 typename_keyword_p,
5589 check_dependency_p,
5590 type_p,
5591 is_declaration);
5592 /* If it was not present, issue an error message. */
5594 {
5597 }
5600 }
5602 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5603 this is either a class-name or a namespace-name (which corresponds
5604 to the class-or-namespace-name production in the grammar). For
5605 C++0x, it can also be a type-name that refers to an enumeration
5606 type or a simple-template-id.
5608 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5609 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5610 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5611 TYPE_P is TRUE iff the next name should be taken as a class-name,
5612 even the same name is declared to be another entity in the same
5613 scope.
5615 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5616 specified by the class-or-namespace-name. If neither is found the
5617 ERROR_MARK_NODE is returned. */
5619 static tree
5626 {
5627 tree saved_scope;
5628 tree saved_qualifying_scope;
5629 tree saved_object_scope;
5630 tree scope;
5634 /* DR 743: decltype can appear in a nested-name-specifier. */
5636 {
5640 {
5643 }
5647 }
5649 /* Before we try to parse the class-name, we must save away the
5650 current PARSER->SCOPE since cp_parser_class_name will destroy
5651 it. */
5655 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5656 there is no need to look for a namespace-name. */
5657 only_class_p = template_keyword_p
5662 typename_keyword_p,
5663 template_keyword_p,
5665 check_dependency_p,
5667 is_declaration);
5669 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5673 {
5674 /* Restore the saved scope. */
5679 /* Parse tentatively. */
5682 /* Parse a type-name */
5685 /* "If the name found does not designate a namespace or a class,
5686 enumeration, or dependent type, the program is ill-formed."
5688 We cover classes and dependent types above and namespaces below,
5689 so this code is only looking for enums. */
5695 }
5696 /* If that didn't work, try for a namespace-name. */
5698 {
5699 /* Restore the saved scope. */
5703 /* If we are not looking at an identifier followed by the scope
5704 resolution operator, then this is not part of a
5705 nested-name-specifier. (Note that this function is only used
5706 to parse the components of a nested-name-specifier.) */
5711 }
5714 }
5716 /* Return true if we are looking at a compound-literal, false otherwise. */
5718 static bool
5720 {
5721 /* Consume the `('. */
5726 /* Skip tokens until the next token is a closing parenthesis.
5727 If we find the closing `)', and the next token is a `{', then
5728 we are looking at a compound-literal. */
5729 bool compound_literal_p
5734 /* Roll back the tokens we skipped. */
5738 }
5740 /* Parse a postfix-expression.
5742 postfix-expression:
5743 primary-expression
5744 postfix-expression [ expression ]
5745 postfix-expression ( expression-list [opt] )
5746 simple-type-specifier ( expression-list [opt] )
5747 typename :: [opt] nested-name-specifier identifier
5748 ( expression-list [opt] )
5749 typename :: [opt] nested-name-specifier template [opt] template-id
5750 ( expression-list [opt] )
5751 postfix-expression . template [opt] id-expression
5752 postfix-expression -> template [opt] id-expression
5753 postfix-expression . pseudo-destructor-name
5754 postfix-expression -> pseudo-destructor-name
5755 postfix-expression ++
5756 postfix-expression --
5757 dynamic_cast < type-id > ( expression )
5758 static_cast < type-id > ( expression )
5759 reinterpret_cast < type-id > ( expression )
5760 const_cast < type-id > ( expression )
5761 typeid ( expression )
5762 typeid ( type-id )
5764 GNU Extension:
5766 postfix-expression:
5767 ( type-id ) { initializer-list , [opt] }
5769 This extension is a GNU version of the C99 compound-literal
5770 construct. (The C99 grammar uses `type-name' instead of `type-id',
5771 but they are essentially the same concept.)
5773 If ADDRESS_P is true, the postfix expression is the operand of the
5774 `&' operator. CAST_P is true if this expression is the target of a
5775 cast.
5777 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5778 class member access expressions [expr.ref].
5780 Returns a representation of the expression. */
5782 static tree
5786 {
5788 location_t loc;
5795 /* Peek at the next token. */
5798 /* Some of the productions are determined by keywords. */
5801 {
5806 {
5807 tree type;
5808 tree expression;
5812 /* All of these can be handled in the same way from the point
5813 of view of parsing. Begin by consuming the token
5814 identifying the cast. */
5817 /* New types cannot be defined in the cast. */
5819 parser->type_definition_forbidden_message
5822 /* Look for the opening `<'. */
5824 /* Parse the type to which we are casting. */
5829 /* Look for the closing `>'. */
5831 /* Restore the old message. */
5834 bool saved_greater_than_is_operator_p
5838 /* And the expression which is being cast. */
5843 parser->greater_than_is_operator_p
5846 /* Only type conversions to integral or enumeration types
5847 can be used in constant-expressions. */
5853 {
5855 postfix_expression
5859 postfix_expression
5863 postfix_expression
5865 tf_warning_or_error);
5868 postfix_expression
5873 }
5874 }
5878 {
5879 tree type;
5883 /* Consume the `typeid' token. */
5885 /* Look for the `(' token. */
5887 /* Types cannot be defined in a `typeid' expression. */
5889 parser->type_definition_forbidden_message
5891 /* We can't be sure yet whether we're looking at a type-id or an
5892 expression. */
5894 /* Try a type-id first. */
5899 /* Look for the `)' token. Otherwise, we can't be sure that
5900 we're not looking at an expression: consider `typeid (int
5901 (3))', for example. */
5903 /* If all went well, simply lookup the type-id. */
5906 /* Otherwise, fall back to the expression variant. */
5907 else
5908 {
5909 tree expression;
5911 /* Look for an expression. */
5913 /* Compute its typeid. */
5915 /* Look for the `)' token. */
5917 }
5918 /* Restore the saved message. */
5920 /* `typeid' may not appear in an integral constant expression. */
5923 }
5927 {
5928 tree type;
5929 /* The syntax permitted here is the same permitted for an
5930 elaborated-type-specifier. */
5935 }
5939 {
5943 {
5948 }
5950 {
5955 }
5956 else
5957 {
5958 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5961 }
5963 postfix_expression =
5967 {
5971 }
5973 {
5978 }
5979 else
5980 {
5982 postfix_expression);
5986 }
5988 }
5991 {
5994 tree p;
6008 tf_warning_or_error);
6011 tf_warning_or_error);
6012 else
6013 {
6017 }
6019 }
6022 {
6023 tree type;
6025 /* If the next thing is a simple-type-specifier, we may be
6026 looking at a functional cast. We could also be looking at
6027 an id-expression. So, we try the functional cast, and if
6028 that doesn't work we fall back to the primary-expression. */
6030 /* Look for the simple-type-specifier. */
6033 CP_PARSER_FLAGS_NONE);
6034 /* Parse the cast itself. */
6036 postfix_expression
6038 /* If that worked, we're done. */
6042 /* If the functional-cast didn't work out, try a
6043 compound-literal. */
6046 {
6051 /* Avoid calling cp_parser_type_id pointlessly, see comment
6052 in cp_parser_cast_expression about c++/29234. */
6055 else
6056 {
6057 /* Parse the type. */
6062 /* Look for the `)'. */
6064 }
6066 /* If things aren't going well, there's no need to
6067 keep going. */
6069 {
6071 /* Parse the brace-enclosed initializer list. */
6074 }
6075 /* If that worked, we're definitely looking at a
6076 compound-literal expression. */
6078 {
6079 /* Warn the user that a compound literal is not
6080 allowed in standard C++. */
6083 /* For simplicity, we disallow compound literals in
6084 constant-expressions. We could
6085 allow compound literals of integer type, whose
6086 initializer was a constant, in constant
6087 expressions. Permitting that usage, as a further
6088 extension, would not change the meaning of any
6089 currently accepted programs. (Of course, as
6090 compound literals are not part of ISO C++, the
6091 standard has nothing to say.) */
6093 NIC_NCC))
6094 {
6097 }
6098 /* Form the representation of the compound-literal. */
6099 postfix_expression
6101 tf_warning_or_error);
6103 }
6104 }
6106 /* It must be a primary-expression. */
6107 postfix_expression
6110 decltype_p,
6112 }
6114 }
6116 /* Note that we don't need to worry about calling build_cplus_new on a
6117 class-valued CALL_EXPR in decltype when it isn't the end of the
6118 postfix-expression; unary_complex_lvalue will take care of that for
6119 all these cases. */
6121 /* Keep looping until the postfix-expression is complete. */
6123 {
6127 /* It is not a Koenig lookup function call. */
6128 postfix_expression
6131 /* Peek at the next token. */
6135 {
6138 {
6140 "two consecutive %<[%> shall "
6143 }
6144 postfix_expression
6146 postfix_expression,
6148 decltype_p);
6154 /* postfix-expression ( expression-list [opt] ) */
6155 {
6165 is_builtin_constant_p
6168 {
6169 /* The whole point of __builtin_constant_p is to allow
6170 non-constant expressions to appear as arguments. */
6171 saved_integral_constant_expression_p
6173 saved_non_integral_constant_expression_p
6176 }
6177 args = (cp_parser_parenthesized_expression_list
6183 {
6184 parser->integral_constant_expression_p
6186 parser->non_integral_constant_expression_p
6188 }
6191 {
6194 }
6196 /* Function calls are not permitted in
6197 constant-expressions. */
6200 NIC_FUNC_CALL))
6201 {
6205 }
6210 {
6212 {
6214 {
6217 postfix_expression
6219 complain);
6220 }
6221 else
6222 postfix_expression
6224 }
6225 /* We do not perform argument-dependent lookup if
6226 normal lookup finds a non-function, in accordance
6227 with the expected resolution of DR 218. */
6230 {
6234 /* Do not do argument dependent lookup if regular
6235 lookup finds a member function or a block-scope
6236 function declaration. [basic.lookup.argdep]/3 */
6239 {
6242 postfix_expression
6244 complain);
6245 }
6246 }
6247 }
6250 {
6260 "%<memset%> used with constant zero length "
6261 "parameter; this could be due to transposed "
6264 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6265 to avoid leaking those into folder and middle-end. */
6267 tree arg;
6271 }
6274 {
6284 {
6285 postfix_expression
6289 }
6292 {
6293 postfix_expression
6294 = (build_new_method_call
6300 complain));
6301 }
6302 else
6303 postfix_expression
6307 complain);
6308 }
6312 postfix_expression = (build_offset_ref_call_from_tree
6314 complain));
6316 /* A call to a static class member, or a namespace-scope
6317 function. */
6318 postfix_expression
6321 koenig_p,
6322 complain);
6323 else
6324 /* All other function calls. */
6325 postfix_expression
6328 koenig_p,
6329 complain);
6333 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6337 }
6342 /* postfix-expression . template [opt] id-expression
6343 postfix-expression . pseudo-destructor-name
6344 postfix-expression -> template [opt] id-expression
6345 postfix-expression -> pseudo-destructor-name */
6347 /* Consume the `.' or `->' operator. */
6350 postfix_expression
6352 postfix_expression,
6359 /* postfix-expression ++ */
6360 /* Consume the `++' token. */
6362 /* Generate a representation for the complete expression. */
6363 postfix_expression
6365 POSTINCREMENT_EXPR);
6366 /* Increments may not appear in constant-expressions. */
6374 /* postfix-expression -- */
6375 /* Consume the `--' token. */
6377 /* Generate a representation for the complete expression. */
6378 postfix_expression
6380 POSTDECREMENT_EXPR);
6381 /* Decrements may not appear in constant-expressions. */
6393 else
6395 }
6396 }
6398 /* We should never get here. */
6401 }
6403 /* This function parses Cilk Plus array notations. If a normal array expr. is
6404 parsed then the array index is passed back to the caller through *INIT_INDEX
6405 and the function returns a NULL_TREE. If array notation expr. is parsed,
6406 then *INIT_INDEX is ignored by the caller and the function returns
6407 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6408 error_mark_node. */
6410 static tree
6412 tree array_value)
6413 {
6417 {
6420 }
6429 {
6432 }
6434 {
6435 /* Consume the ':'. */
6438 /* If we are here, then we have a case like this A[:]. */
6440 {
6444 }
6448 }
6449 else
6450 {
6451 /* If we are here, then there are three valid possibilities:
6452 1. ARRAY [ EXP ]
6453 2. ARRAY [ EXP : EXP ]
6454 3. ARRAY [ EXP : EXP : EXP ] */
6458 {
6459 /* This indicates that we have a normal array expression. */
6462 }
6464 /* Consume the ':'. */
6468 {
6471 }
6472 }
6477 {
6481 }
6487 }
6489 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6490 by cp_parser_builtin_offsetof. We're looking for
6492 postfix-expression [ expression ]
6493 postfix-expression [ braced-init-list ] (C++11)
6495 FOR_OFFSETOF is set if we're being called in that context, which
6496 changes how we deal with integer constant expressions. */
6498 static tree
6500 tree postfix_expression,
6503 {
6508 /* Consume the `[' token. */
6514 /* Parse the index expression. */
6515 /* ??? For offsetof, there is a question of what to allow here. If
6516 offsetof is not being used in an integral constant expression context,
6517 then we *could* get the right answer by computing the value at runtime.
6518 If we are in an integral constant expression context, then we might
6519 could accept any constant expression; hard to say without analysis.
6520 Rather than open the barn door too wide right away, allow only integer
6521 constant expressions here. */
6524 else
6525 {
6527 {
6534 {
6536 "braced list index is not allowed with array "
6540 }
6541 }
6543 {
6544 /* Here are have these two options:
6545 ARRAY[EXP : EXP] - Array notation expr with default
6546 stride of 1.
6547 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6548 stride. */
6550 postfix_expression);
6553 }
6554 else
6556 }
6560 /* Look for the closing `]'. */
6563 /* Build the ARRAY_REF. */
6567 /* When not doing offsetof, array references are not permitted in
6568 constant-expressions. */
6574 }
6576 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6577 by cp_parser_builtin_offsetof. We're looking for
6579 postfix-expression . template [opt] id-expression
6580 postfix-expression . pseudo-destructor-name
6581 postfix-expression -> template [opt] id-expression
6582 postfix-expression -> pseudo-destructor-name
6584 FOR_OFFSETOF is set if we're being called in that context. That sorta
6585 limits what of the above we'll actually accept, but nevermind.
6586 TOKEN_TYPE is the "." or "->" token, which will already have been
6587 removed from the stream. */
6589 static tree
6592 tree postfix_expression,
6594 location_t location)
6595 {
6596 tree name;
6601 /* If this is a `->' operator, dereference the pointer. */
6604 tf_warning_or_error);
6605 /* Check to see whether or not the expression is type-dependent. */
6607 /* The identifier following the `->' or `.' is not qualified. */
6613 /* Enter the scope corresponding to the type of the object
6614 given by the POSTFIX_EXPRESSION. */
6616 {
6618 /* According to the standard, no expression should ever have
6619 reference type. Unfortunately, we do not currently match
6620 the standard in this respect in that our internal representation
6621 of an expression may have reference type even when the standard
6622 says it does not. Therefore, we have to manually obtain the
6623 underlying type here. */
6625 /* The type of the POSTFIX_EXPRESSION must be complete. */
6627 {
6629 postfix_expression);
6631 }
6632 /* Unlike the object expression in other contexts, *this is not
6633 required to be of complete type for purposes of class member
6634 access (5.2.5) outside the member function body. */
6638 /* Let the name lookup machinery know that we are processing a
6639 class member access expression. */
6641 /* If something went wrong, we want to be able to discern that case,
6642 as opposed to the case where there was no SCOPE due to the type
6643 of expression being dependent. */
6646 /* If the SCOPE was erroneous, make the various semantic analysis
6647 functions exit quickly -- and without issuing additional error
6648 messages. */
6651 }
6653 /* Assume this expression is not a pseudo-destructor access. */
6656 /* If the SCOPE is a scalar type, then, if this is a valid program,
6657 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6658 is type dependent, it can be pseudo-destructor-name or something else.
6659 Try to parse it as pseudo-destructor-name first. */
6661 {
6662 tree s;
6663 tree type;
6666 /* Parse the pseudo-destructor-name. */
6675 {
6677 postfix_expression
6680 }
6681 }
6684 {
6685 /* If the SCOPE is not a scalar type, we are looking at an
6686 ordinary class member access expression, rather than a
6687 pseudo-destructor-name. */
6690 /* Parse the id-expression. */
6691 name = (cp_parser_id_expression
6698 /* In general, build a SCOPE_REF if the member name is qualified.
6699 However, if the name was not dependent and has already been
6700 resolved; there is no need to build the SCOPE_REF. For example;
6702 struct X { void f(); };
6703 template <typename T> void f(T* t) { t->X::f(); }
6705 Even though "t" is dependent, "X::f" is not and has been resolved
6706 to a BASELINK; there is no need to include scope information. */
6708 /* But we do need to remember that there was an explicit scope for
6709 virtual function calls. */
6713 /* If the name is a template-id that names a type, we will get a
6714 TYPE_DECL here. That is invalid code. */
6716 {
6719 }
6720 else
6721 {
6723 {
6725 {
6729 }
6730 else
6733 name,
6734 template_p);
6738 }
6740 adjust_result_of_qualified_name_lookup
6742 postfix_expression
6744 template_p,
6745 tf_warning_or_error);
6746 }
6747 }
6749 /* We no longer need to look up names in the scope of the object on
6750 the left-hand side of the `.' or `->' operator. */
6753 /* Outside of offsetof, these operators may not appear in
6754 constant-expressions. */
6756 && (cp_parser_non_integral_constant_expression
6761 }
6763 /* Cache of LITERAL_ZERO_P constants. */
6767 /* Parse a parenthesized expression-list.
6769 expression-list:
6770 assignment-expression
6771 expression-list, assignment-expression
6773 attribute-list:
6774 expression-list
6775 identifier
6776 identifier, expression-list
6778 CAST_P is true if this expression is the target of a cast.
6780 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6781 argument pack.
6783 Returns a vector of trees. Each element is a representation of an
6784 assignment-expression. NULL is returned if the ( and or ) are
6785 missing. An empty, but allocated, vector is returned on no
6786 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6787 if we are parsing an attribute list for an attribute that wants a
6788 plain identifier argument, normal_attr for an attribute that wants
6789 an expression, or non_attr if we aren't parsing an attribute list. If
6790 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6791 not all of the expressions in the list were constant.
6792 WANT_LITERAL_ZERO_P is true if the caller is interested in
6793 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6794 immediately, this can be removed. */
6803 {
6809 /* Assume all the expressions will be constant. */
6818 /* Within a parenthesized expression, a `>' token is always
6819 the greater-than operator. */
6820 saved_greater_than_is_operator_p
6824 /* Consume expressions until there are no more. */
6827 {
6828 tree expr;
6830 /* At the beginning of attribute lists, check to see if the
6831 next token is an identifier. */
6834 {
6837 /* Consume the identifier. */
6839 /* Save the identifier. */
6841 }
6842 else
6843 {
6846 /* Parse the next assignment-expression. */
6848 {
6849 /* A braced-init-list. */
6855 }
6857 {
6858 expr = (cp_parser_constant_expression
6863 }
6864 else
6865 {
6869 {
6875 /* If a parameter is literal zero alone, remember it
6876 for -Wmemset-transposed-args warning. */
6879 && want_literal_zero_p
6881 == CPP_COMMA
6884 {
6891 else
6892 {
6897 }
6898 /* Consume the 0 token (or '\0', 0LL etc.). */
6900 }
6904 }
6907 cast_p);
6908 }
6913 /* If we have an ellipsis, then this is an expression
6914 expansion. */
6917 {
6918 /* Consume the `...'. */
6921 /* Build the argument pack. */
6923 }
6925 /* Add it to the list. We add error_mark_node
6926 expressions to the list, so that we can still tell if
6927 the correct form for a parenthesized expression-list
6928 is found. That gives better errors. */
6933 }
6935 /* After the first item, attribute lists look the same as
6936 expression lists. */
6939 get_comma:;
6940 /* If the next token isn't a `,', then we are done. */
6944 /* Otherwise, consume the `,' and keep going. */
6946 }
6949 {
6952 skip_comma:;
6953 /* We try and resync to an unnested comma, as that will give the
6954 user better diagnostics. */
6962 {
6963 parser->greater_than_is_operator_p
6966 }
6967 }
6969 parser->greater_than_is_operator_p
6976 }
6978 /* Parse a pseudo-destructor-name.
6980 pseudo-destructor-name:
6981 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6982 :: [opt] nested-name-specifier template template-id :: ~ type-name
6983 :: [opt] nested-name-specifier [opt] ~ type-name
6985 If either of the first two productions is used, sets *SCOPE to the
6986 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6987 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6988 or ERROR_MARK_NODE if the parse fails. */
6990 static void
6992 tree object,
6995 {
6998 /* Handle ~auto. */
7002 {
7005 "%<~auto%> only available with "
7012 }
7014 /* Assume that things will not work out. */
7017 /* Look for the optional `::' operator. */
7019 /* Look for the optional nested-name-specifier. */
7020 nested_name_specifier_p
7027 /* Now, if we saw a nested-name-specifier, we might be doing the
7028 second production. */
7031 {
7032 /* Consume the `template' keyword. */
7034 /* Parse the template-id. */
7038 class_type,
7040 /* Look for the `::' token. */
7042 }
7043 /* If the next token is not a `~', then there might be some
7044 additional qualification. */
7046 {
7047 /* At this point, we're looking for "type-name :: ~". The type-name
7048 must not be a class-name, since this is a pseudo-destructor. So,
7049 it must be either an enum-name, or a typedef-name -- both of which
7050 are just identifiers. So, we peek ahead to check that the "::"
7051 and "~" tokens are present; if they are not, then we can avoid
7052 calling type_name. */
7056 {
7059 }
7061 /* Look for the type-name. */
7066 /* Look for the `::' token. */
7068 }
7069 else
7072 /* Look for the `~'. */
7075 /* Once we see the ~, this has to be a pseudo-destructor. */
7079 /* Look for the type-name again. We are not responsible for
7080 checking that it matches the first type-name. */
7082 }
7084 /* Parse a unary-expression.
7086 unary-expression:
7087 postfix-expression
7088 ++ cast-expression
7089 -- cast-expression
7090 unary-operator cast-expression
7091 sizeof unary-expression
7092 sizeof ( type-id )
7093 alignof ( type-id ) [C++0x]
7094 new-expression
7095 delete-expression
7097 GNU Extensions:
7099 unary-expression:
7100 __extension__ cast-expression
7101 __alignof__ unary-expression
7102 __alignof__ ( type-id )
7103 alignof unary-expression [C++0x]
7104 __real__ cast-expression
7105 __imag__ cast-expression
7106 && identifier
7107 sizeof ( type-id ) { initializer-list , [opt] }
7108 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7109 __alignof__ ( type-id ) { initializer-list , [opt] }
7111 ADDRESS_P is true iff the unary-expression is appearing as the
7112 operand of the `&' operator. CAST_P is true if this expression is
7113 the target of a cast.
7115 Returns a representation of the expression. */
7117 static tree
7120 {
7124 /* Peek at the next token. */
7126 /* Some keywords give away the kind of expression. */
7128 {
7132 {
7135 {
7138 location_t first_loc;
7141 /* Consume the token. */
7144 /* Parse the operand. */
7149 else
7150 {
7151 /* ISO C++ defines alignof only with types, not with
7152 expressions. So pedwarn if alignof is used with a non-
7153 type expression. However, __alignof__ is ok. */
7156 "ISO C++ does not allow %<alignof%> "
7160 }
7161 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7162 SIZEOF_EXPR with the original operand. */
7164 {
7166 {
7168 {
7171 error_mark_node));
7173 }
7174 else
7178 }
7180 }
7182 }
7191 {
7192 /* The saved value of the PEDANTIC flag. */
7194 tree expr;
7196 /* Save away the PEDANTIC flag. */
7198 /* Parse the cast-expression. */
7200 /* Restore the PEDANTIC flag. */
7204 }
7208 {
7209 tree expression;
7211 /* Consume the `__real__' or `__imag__' token. */
7213 /* Parse the cast-expression. */
7215 /* Create the complete representation. */
7219 expression,
7220 tf_warning_or_error);
7221 }
7229 {
7230 tree expr;
7240 parser->type_definition_forbidden_message
7243 saved_integral_constant_expression_p
7245 saved_non_integral_constant_expression_p
7249 saved_greater_than_is_operator_p
7261 parser->greater_than_is_operator_p
7264 parser->integral_constant_expression_p
7266 parser->non_integral_constant_expression_p
7273 }
7277 }
7278 }
7280 /* Look for the `:: new' and `:: delete', which also signal the
7281 beginning of a new-expression, or delete-expression,
7282 respectively. If the next token is `::', then it might be one of
7283 these. */
7285 {
7288 /* See if the token after the `::' is one of the keywords in
7289 which we're interested. */
7291 /* If it's `new', we have a new-expression. */
7294 /* Similarly, for `delete'. */
7297 }
7299 /* Look for a unary operator. */
7301 /* The `++' and `--' operators can be handled similarly, even though
7302 they are not technically unary-operators in the grammar. */
7304 {
7309 /* Handle the GNU address-of-label extension. */
7312 {
7313 tree identifier;
7314 tree expression;
7317 /* Consume the '&&' token. */
7319 /* Look for the identifier. */
7321 /* Create an expression representing the address. */
7324 NIC_ADDR_LABEL))
7327 }
7328 }
7330 {
7331 tree cast_expression;
7337 /* Consume the operator token. */
7339 /* Parse the cast-expression. */
7340 cast_expression
7345 pidk);
7346 /* Now, build an appropriate representation. */
7348 {
7352 RO_UNARY_STAR,
7353 complain);
7358 /* Fall through. */
7361 cast_expression,
7362 complain);
7369 /* Fall through. */
7379 }
7383 non_constant_p))
7387 }
7391 decltype_p,
7392 pidk);
7393 }
7395 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7396 unary-operator, the corresponding tree code is returned. */
7398 static enum tree_code
7400 {
7402 {
7423 }
7424 }
7426 /* Parse a new-expression.
7428 new-expression:
7429 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7430 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7432 Returns a representation of the expression. */
7434 static tree
7436 {
7439 tree type;
7442 tree ret;
7444 /* Look for the optional `::' operator. */
7445 global_scope_p
7449 /* Look for the `new' operator. */
7451 /* There's no easy way to tell a new-placement from the
7452 `( type-id )' construct. */
7454 /* Look for a new-placement. */
7456 /* If that didn't work out, there's no new-placement. */
7458 {
7462 }
7464 /* If the next token is a `(', then we have a parenthesized
7465 type-id. */
7467 {
7471 /* Consume the `('. */
7474 /* Parse the type-id. */
7475 parser->type_definition_forbidden_message
7480 /* Look for the closing `)'. */
7483 /* There should not be a direct-new-declarator in this production,
7484 but GCC used to allowed this, so we check and emit a sensible error
7485 message for this case. */
7487 {
7493 }
7494 }
7495 /* Otherwise, there must be a new-type-id. */
7496 else
7499 /* If the next token is a `(' or '{', then we have a new-initializer. */
7503 else
7506 /* A new-expression may not appear in an integral constant
7507 expression. */
7510 else
7511 {
7512 /* Create a representation of the new-expression. */
7514 tf_warning_or_error);
7515 }
7523 }
7525 /* Parse a new-placement.
7527 new-placement:
7528 ( expression-list )
7530 Returns the same representation as for an expression-list. */
7534 {
7537 /* Parse the expression-list. */
7538 expression_list = (cp_parser_parenthesized_expression_list
7544 }
7546 /* Parse a new-type-id.
7548 new-type-id:
7549 type-specifier-seq new-declarator [opt]
7551 Returns the TYPE allocated. If the new-type-id indicates an array
7552 type, *NELTS is set to the number of elements in the last array
7553 bound; the TYPE will not include the last array bound. */
7555 static tree
7557 {
7558 cp_decl_specifier_seq type_specifier_seq;
7564 /* The type-specifier sequence must not contain type definitions.
7565 (It cannot contain declarations of new types either, but if they
7566 are not definitions we will catch that because they are not
7567 complete.) */
7569 parser->type_definition_forbidden_message
7571 /* Parse the type-specifier-seq. */
7575 /* Restore the old message. */
7581 /* Parse the new-declarator. */
7584 /* Determine the number of elements in the last array dimension, if
7585 any. */
7587 /* Skip down to the last array dimension. */
7592 {
7595 }
7600 {
7603 }
7606 {
7613 else
7615 }
7618 }
7620 /* Parse an (optional) new-declarator.
7622 new-declarator:
7623 ptr-operator new-declarator [opt]
7624 direct-new-declarator
7626 Returns the declarator. */
7630 {
7633 cp_cv_quals cv_quals;
7635 /* We don't know if there's a ptr-operator next, or not. */
7637 /* Look for a ptr-operator. */
7639 /* If that worked, look for more new-declarators. */
7641 {
7644 /* Parse another optional declarator. */
7647 declarator = cp_parser_make_indirect_declarator
7651 }
7653 /* If the next token is a `[', there is a direct-new-declarator. */
7658 }
7660 /* Parse a direct-new-declarator.
7662 direct-new-declarator:
7663 [ expression ]
7664 direct-new-declarator [constant-expression]
7666 */
7670 {
7674 {
7675 tree expression;
7678 /* Look for the opening `['. */
7683 /* The standard requires that the expression have integral
7684 type. DR 74 adds enumeration types. We believe that the
7685 real intent is that these expressions be handled like the
7686 expression in a `switch' condition, which also allows
7687 classes with a single conversion to integral or
7688 enumeration type. */
7690 {
7691 expression
7693 expression,
7696 {
7698 "expression in new-declarator must have integral "
7701 }
7702 }
7704 /* Look for the closing `]'. */
7707 /* Add this bound to the declarator. */
7710 /* If the next token is not a `[', then there are no more
7711 bounds. */
7714 }
7717 }
7719 /* Parse a new-initializer.
7721 new-initializer:
7722 ( expression-list [opt] )
7723 braced-init-list
7725 Returns a representation of the expression-list. */
7729 {
7733 {
7734 tree t;
7741 }
7742 else
7743 expression_list = (cp_parser_parenthesized_expression_list
7749 }
7751 /* Parse a delete-expression.
7753 delete-expression:
7754 :: [opt] delete cast-expression
7755 :: [opt] delete [ ] cast-expression
7757 Returns a representation of the expression. */
7759 static tree
7761 {
7764 tree expression;
7766 /* Look for the optional `::' operator. */
7767 global_scope_p
7771 /* Look for the `delete' keyword. */
7773 /* See if the array syntax is in use. */
7775 {
7776 /* Consume the `[' token. */
7778 /* Look for the `]' token. */
7780 /* Remember that this is the `[]' construct. */
7782 }
7783 else
7786 /* Parse the cast-expression. */
7789 /* A delete-expression may not appear in an integral constant
7790 expression. */
7795 tf_warning_or_error);
7796 }
7798 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7799 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7800 0 otherwise. */
7802 static int
7804 {
7807 {
7849 /* In ((type ()) () the last () isn't a valid cast-expression,
7850 so the whole must be parsed as postfix-expression. */
7855 /* '[' may start a primary-expression in obj-c++ and in C++11,
7856 as a lambda-expression, eg, '(void)[]{}'. */
7863 /* '++' and '--' may or may not start a cast-expression:
7865 struct T { void operator++(int); };
7866 void f() { (T())++; }
7868 vs
7870 int a;
7871 (int)++a; */
7876 }
7877 }
7879 /* Parse a cast-expression.
7881 cast-expression:
7882 unary-expression
7883 ( type-id ) cast-expression
7885 ADDRESS_P is true iff the unary-expression is appearing as the
7886 operand of the `&' operator. CAST_P is true if this expression is
7887 the target of a cast.
7889 Returns a representation of the expression. */
7891 static tree
7894 {
7895 /* If it's a `(', then we might be looking at a cast. */
7897 {
7903 /* There's no way to know yet whether or not this is a cast.
7904 For example, `(int (3))' is a unary-expression, while `(int)
7905 3' is a cast. So, we resort to parsing tentatively. */
7907 /* Types may not be defined in a cast. */
7909 parser->type_definition_forbidden_message
7911 /* Consume the `('. */
7913 /* A very tricky bit is that `(struct S) { 3 }' is a
7914 compound-literal (which we permit in C++ as an extension).
7915 But, that construct is not a cast-expression -- it is a
7916 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7917 is legal; if the compound-literal were a cast-expression,
7918 you'd need an extra set of parentheses.) But, if we parse
7919 the type-id, and it happens to be a class-specifier, then we
7920 will commit to the parse at that point, because we cannot
7921 undo the action that is done when creating a new class. So,
7922 then we cannot back up and do a postfix-expression.
7924 Another tricky case is the following (c++/29234):
7926 struct S { void operator () (); };
7928 void foo ()
7929 {
7930 ( S()() );
7931 }
7933 As a type-id we parse the parenthesized S()() as a function
7934 returning a function, groktypename complains and we cannot
7935 back up in this case either.
7937 Therefore, we scan ahead to the closing `)', and check to see
7938 if the tokens after the `)' can start a cast-expression. Otherwise
7939 we are dealing with an unary-expression, a postfix-expression
7940 or something else.
7942 Yet another tricky case, in C++11, is the following (c++/54891):
7944 (void)[]{};
7946 The issue is that usually, besides the case of lambda-expressions,
7947 the parenthesized type-id cannot be followed by '[', and, eg, we
7948 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7949 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7950 we don't commit, we try a cast-expression, then an unary-expression.
7952 Save tokens so that we can put them back. */
7955 /* We may be looking at a cast-expression. */
7958 cast_expression
7961 /* Roll back the tokens we skipped. */
7963 /* If we aren't looking at a cast-expression, simulate an error so
7964 that the call to cp_parser_error_occurred below returns true. */
7967 else
7968 {
7971 /* Look for the type-id. */
7973 /* Look for the closing `)'. */
7976 }
7978 /* Restore the saved message. */
7981 /* At this point this can only be either a cast or a
7982 parenthesized ctor such as `(T ())' that looks like a cast to
7983 function returning T. */
7985 {
7986 /* Only commit if the cast-expression doesn't start with
7987 '++', '--', or '[' in C++11. */
7995 pidk);
7998 {
7999 /* Warn about old-style casts, if so requested. */
8006 /* Only type conversions to integral or enumeration types
8007 can be used in constant-expressions. */
8010 NIC_CAST))
8013 /* Perform the cast. */
8016 }
8017 }
8018 else
8020 }
8022 /* If we get here, then it's not a cast, so it must be a
8023 unary-expression. */
8026 }
8028 /* Parse a binary expression of the general form:
8030 pm-expression:
8031 cast-expression
8032 pm-expression .* cast-expression
8033 pm-expression ->* cast-expression
8035 multiplicative-expression:
8036 pm-expression
8037 multiplicative-expression * pm-expression
8038 multiplicative-expression / pm-expression
8039 multiplicative-expression % pm-expression
8041 additive-expression:
8042 multiplicative-expression
8043 additive-expression + multiplicative-expression
8044 additive-expression - multiplicative-expression
8046 shift-expression:
8047 additive-expression
8048 shift-expression << additive-expression
8049 shift-expression >> additive-expression
8051 relational-expression:
8052 shift-expression
8053 relational-expression < shift-expression
8054 relational-expression > shift-expression
8055 relational-expression <= shift-expression
8056 relational-expression >= shift-expression
8058 GNU Extension:
8060 relational-expression:
8061 relational-expression <? shift-expression
8062 relational-expression >? shift-expression
8064 equality-expression:
8065 relational-expression
8066 equality-expression == relational-expression
8067 equality-expression != relational-expression
8069 and-expression:
8070 equality-expression
8071 and-expression & equality-expression
8073 exclusive-or-expression:
8074 and-expression
8075 exclusive-or-expression ^ and-expression
8077 inclusive-or-expression:
8078 exclusive-or-expression
8079 inclusive-or-expression | exclusive-or-expression
8081 logical-and-expression:
8082 inclusive-or-expression
8083 logical-and-expression && inclusive-or-expression
8085 logical-or-expression:
8086 logical-and-expression
8087 logical-or-expression || logical-and-expression
8089 All these are implemented with a single function like:
8091 binary-expression:
8092 simple-cast-expression
8093 binary-expression <token> binary-expression
8095 CAST_P is true if this expression is the target of a cast.
8097 The binops_by_token map is used to get the tree codes for each <token> type.
8098 binary-expressions are associated according to a precedence table. */
8100 #define TOKEN_PRECEDENCE(token) \
8101 (((token->type == CPP_GREATER \
8102 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8103 && !parser->greater_than_is_operator_p) \
8104 ? PREC_NOT_OPERATOR \
8105 : binops_by_token[token->type].prec)
8107 static tree
8113 {
8114 cp_parser_expression_stack stack;
8116 cp_parser_expression_stack_entry current;
8117 tree rhs;
8121 tree overload;
8123 /* Parse the first expression. */
8134 {
8135 /* Get an operator token. */
8141 {
8143 "%<>>%> operator is treated"
8147 }
8151 /* Popping an entry off the stack means we completed a subexpression:
8152 - either we found a token which is not an operator (`>' where it is not
8153 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8154 will happen repeatedly;
8155 - or, we found an operator which has lower priority. This is the case
8156 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8157 parsing `3 * 4'. */
8159 {
8162 else
8164 }
8166 get_rhs:
8170 /* We used the operator token. */
8173 /* For "false && x" or "true || x", x will never be executed;
8174 disable warnings while evaluating it. */
8180 /* Extract another operand. It may be the RHS of this expression
8181 or the LHS of a new, higher priority expression. */
8186 /* Get another operator token. Look up its precedence to avoid
8187 building a useless (immediately popped) stack entry for common
8188 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8192 {
8193 /* ... and prepare to parse the RHS of the new, higher priority
8194 expression. Since precedence levels on the stack are
8195 monotonically increasing, we do not have to care about
8196 stack overflows. */
8205 pop:
8207 /* If the stack is not empty, we have parsed into LHS the right side
8208 (`4' in the example above) of an expression we had suspended.
8209 We can use the information on the stack to recover the LHS (`3')
8210 from the stack together with the tree code (`MULT_EXPR'), and
8211 the precedence of the higher level subexpression
8212 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8213 which will be used to actually build the additive expression. */
8218 }
8220 /* Undo the disabling of warnings done above. */
8231 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8232 ERROR_MARK for everything that is not a binary expression.
8233 This makes warn_about_parentheses miss some warnings that
8234 involve unary operators. For unary expressions we should
8235 pass the correct tree_code unless the unary expression was
8236 surrounded by parentheses.
8237 */
8243 == tcc_comparison
8246 else
8255 /* If the binary operator required the use of an overloaded operator,
8256 then this expression cannot be an integral constant-expression.
8257 An overloaded operator can be used even if both operands are
8258 otherwise permissible in an integral constant-expression if at
8259 least one of the operands is of enumeration type. */
8263 NIC_OVERLOADED))
8265 }
8268 }
8270 static tree
8275 {
8278 }
8280 /* Parse the `? expression : assignment-expression' part of a
8281 conditional-expression. The LOGICAL_OR_EXPR is the
8282 logical-or-expression that started the conditional-expression.
8283 Returns a representation of the entire conditional-expression.
8285 This routine is used by cp_parser_assignment_expression.
8287 ? expression : assignment-expression
8289 GNU Extensions:
8291 ? : assignment-expression */
8293 static tree
8295 {
8296 tree expr;
8297 tree assignment_expr;
8301 /* Consume the `?' token. */
8306 {
8309 /* Implicit true clause. */
8313 }
8314 else
8315 {
8318 /* Parse the expression. */
8321 c_inhibit_evaluation_warnings +=
8325 }
8327 /* The next token should be a `:'. */
8329 /* Parse the assignment-expression. */
8333 /* Build the conditional-expression. */
8335 expr,
8336 assignment_expr,
8337 tf_warning_or_error);
8338 }
8340 /* Parse an assignment-expression.
8342 assignment-expression:
8343 conditional-expression
8344 logical-or-expression assignment-operator assignment_expression
8345 throw-expression
8347 CAST_P is true if this expression is the target of a cast.
8348 DECLTYPE_P is true if this expression is the operand of decltype.
8350 Returns a representation for the expression. */
8352 static tree
8355 {
8356 tree expr;
8358 /* If the next token is the `throw' keyword, then we're looking at
8359 a throw-expression. */
8362 /* Otherwise, it must be that we are looking at a
8363 logical-or-expression. */
8364 else
8365 {
8366 /* Parse the binary expressions (logical-or-expression). */
8368 decltype_p,
8370 /* If the next token is a `?' then we're actually looking at a
8371 conditional-expression. */
8374 else
8375 {
8378 /* If it's an assignment-operator, we're using the second
8379 production. */
8380 enum tree_code assignment_operator
8383 {
8385 location_t saved_input_location;
8387 /* Parse the right-hand side of the assignment. */
8393 /* An assignment may not appear in a
8394 constant-expression. */
8396 NIC_ASSIGNMENT))
8398 /* Build the assignment expression. Its default
8399 location is the location of the '=' token. */
8403 assignment_operator,
8404 rhs,
8407 }
8408 }
8409 }
8412 }
8414 /* Parse an (optional) assignment-operator.
8416 assignment-operator: one of
8417 = *= /= %= += -= >>= <<= &= ^= |=
8419 GNU Extension:
8421 assignment-operator: one of
8422 <?= >?=
8424 If the next token is an assignment operator, the corresponding tree
8425 code is returned, and the token is consumed. For example, for
8426 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8427 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8428 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8429 operator, ERROR_MARK is returned. */
8431 static enum tree_code
8433 {
8437 /* Peek at the next token. */
8441 {
8487 /* Nothing else is an assignment operator. */
8489 }
8491 /* If it was an assignment operator, consume it. */
8496 }
8498 /* Parse an expression.
8500 expression:
8501 assignment-expression
8502 expression , assignment-expression
8504 CAST_P is true if this expression is the target of a cast.
8505 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8506 except possibly parenthesized or on the RHS of a comma (N3276).
8508 Returns a representation of the expression. */
8510 static tree
8513 {
8518 {
8519 tree assignment_expression;
8521 /* Parse the next assignment-expression. */
8522 assignment_expression
8525 /* We don't create a temporary for a call that is the immediate operand
8526 of decltype or on the RHS of a comma. But when we see a comma, we
8527 need to create a temporary for a call on the LHS. */
8532 assignment_expression
8536 /* If this is the first assignment-expression, we can just
8537 save it away. */
8540 else
8542 assignment_expression,
8544 /* If the next token is not a comma, then we are done with the
8545 expression. */
8548 /* Consume the `,'. */
8551 /* A comma operator cannot appear in a constant-expression. */
8554 }
8557 }
8559 /* Parse a constant-expression.
8561 constant-expression:
8562 conditional-expression
8564 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8565 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8566 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8567 is false, NON_CONSTANT_P should be NULL. */
8569 static tree
8573 {
8577 tree expression;
8579 /* It might seem that we could simply parse the
8580 conditional-expression, and then check to see if it were
8581 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8582 one that the compiler can figure out is constant, possibly after
8583 doing some simplifications or optimizations. The standard has a
8584 precise definition of constant-expression, and we must honor
8585 that, even though it is somewhat more restrictive.
8587 For example:
8589 int i[(2, 3)];
8591 is not a legal declaration, because `(2, 3)' is not a
8592 constant-expression. The `,' operator is forbidden in a
8593 constant-expression. However, GCC's constant-folding machinery
8594 will fold this operation to an INTEGER_CST for `3'. */
8596 /* Save the old settings. */
8598 saved_allow_non_integral_constant_expression_p
8601 /* We are now parsing a constant-expression. */
8603 parser->allow_non_integral_constant_expression_p
8606 /* Although the grammar says "conditional-expression", we parse an
8607 "assignment-expression", which also permits "throw-expression"
8608 and the use of assignment operators. In the case that
8609 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8610 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8611 actually essential that we look for an assignment-expression.
8612 For example, cp_parser_initializer_clauses uses this function to
8613 determine whether a particular assignment-expression is in fact
8614 constant. */
8616 /* Restore the old settings. */
8617 parser->integral_constant_expression_p
8619 parser->allow_non_integral_constant_expression_p
8622 {
8623 /* Require an rvalue constant expression here; that's what our
8624 callers expect. Reference constant expressions are handled
8625 separately in e.g. cp_parser_template_argument. */
8630 }
8633 parser->non_integral_constant_expression_p
8637 }
8639 /* Parse __builtin_offsetof.
8641 offsetof-expression:
8642 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8644 offsetof-member-designator:
8645 id-expression
8646 | offsetof-member-designator "." id-expression
8647 | offsetof-member-designator "[" expression "]"
8648 | offsetof-member-designator "->" id-expression */
8650 static tree
8652 {
8655 cp_id_kind dummy;
8658 /* We're about to accept non-integral-constant things, but will
8659 definitely yield an integral constant expression. Save and
8660 restore these values around our local parsing. */
8664 /* Consume the "__builtin_offsetof" token. */
8666 /* Consume the opening `('. */
8668 /* Parse the type-id. */
8671 /* Look for the `,'. */
8675 /* Build the (type *)null that begins the traditional offsetof macro. */
8677 tf_warning_or_error);
8679 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8683 {
8686 {
8688 /* offsetof-member-designator "[" expression "]" */
8694 /* offsetof-member-designator "->" identifier */
8697 /* FALLTHRU */
8700 /* offsetof-member-designator "." identifier */
8708 /* Consume the ")" token. */
8713 /* Error. We know the following require will fail, but
8714 that gives the proper error message. */
8719 }
8720 }
8722 success:
8723 /* If we're processing a template, we can't finish the semantics yet.
8724 Otherwise we can fold the entire expression now. */
8726 {
8729 }
8730 else
8733 failure:
8738 }
8740 /* Parse a trait expression.
8742 Returns a representation of the expression, the underlying type
8743 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8745 static tree
8747 {
8748 cp_trait_kind kind;
8754 {
8838 }
8840 /* Consume the token. */
8851 {
8858 }
8860 {
8862 {
8866 {
8869 }
8873 }
8874 }
8878 /* Complete the trait expression, which may mean either processing
8879 the trait expr now or saving it for template instantiation. */
8881 {
8890 }
8891 }
8893 /* Lambdas that appear in variable initializer or default argument scope
8894 get that in their mangling, so we need to record it. We might as well
8895 use the count for function and namespace scopes as well. */
8899 {
8900 tree t;
8905 static void
8907 {
8908 tree_int ti;
8910 /* Once we're inside a function, we ignore other scopes and just push
8911 the function again so that popping works properly. */
8918 {
8919 /* Don't reset the count if we're still in the same function. */
8922 }
8923 }
8925 static void
8927 {
8930 }
8932 static void
8934 {
8937 {
8940 }
8942 }
8944 /* Parse a lambda expression.
8946 lambda-expression:
8947 lambda-introducer lambda-declarator [opt] compound-statement
8949 Returns a representation of the expression. */
8951 static tree
8953 {
8955 tree type;
8963 {
8965 {
8969 }
8971 }
8973 {
8975 {
8978 }
8980 }
8982 /* We may be in the middle of deferred access check. Disable
8983 it now. */
8994 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8997 /* Now that we've started the type, add the capture fields for any
8998 explicit captures. */
9001 {
9002 /* Inside the class, surrounding template-parameter-lists do not apply. */
9003 unsigned int saved_num_template_parameter_lists
9007 bool fully_implicit_function_template_p
9011 bool auto_is_implicit_function_template_parm_p
9022 /* By virtue of defining a local class, a lambda expression has access to
9023 the private variables of enclosing classes. */
9028 {
9034 }
9036 {
9039 }
9041 /* The capture list was built up in reverse order; fix that now. */
9053 parser->fully_implicit_function_template_p
9057 parser->auto_is_implicit_function_template_parm_p
9059 }
9063 /* This field is only used during parsing of the lambda. */
9066 /* This lambda shouldn't have any proxies left at this point. */
9068 /* And now that we're done, push proxies for an enclosing lambda. */
9073 else
9079 }
9081 /* Parse the beginning of a lambda expression.
9083 lambda-introducer:
9084 [ lambda-capture [opt] ]
9086 LAMBDA_EXPR is the current representation of the lambda expression. */
9088 static void
9090 {
9091 /* Need commas after the first capture. */
9094 /* Eat the leading `['. */
9097 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9105 {
9108 }
9111 {
9113 tree capture_id;
9114 tree capture_init_expr;
9118 enum capture_kind_type
9119 {
9120 BY_COPY,
9121 BY_REFERENCE
9122 };
9126 {
9129 }
9133 else
9136 /* Possibly capture `this'. */
9138 {
9148 explicit_init_p);
9150 }
9152 /* Remember whether we want to capture as a reference or not. */
9154 {
9157 }
9159 /* Get the identifier. */
9164 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9165 delimiters, but I modified this to stop on unnested ']' as well. It
9166 was already changed to stop on unnested '}', so the
9167 "closing_parenthesis" name is no more misleading with my change. */
9168 {
9174 }
9176 /* Find the initializer for this capture. */
9180 {
9182 /* An explicit initializer exists. */
9185 "lambda capture initializers "
9191 {
9194 }
9195 }
9196 else
9197 {
9200 /* Turn the identifier into an id-expression. */
9201 capture_init_expr
9206 {
9209 }
9213 {
9216 capture_init_expr);
9219 }
9222 {
9225 capture_init_expr))
9228 }
9230 capture_init_expr
9231 = finish_id_expression
9233 capture_init_expr,
9247 {
9250 }
9251 else
9253 }
9257 {
9262 capture_id);
9266 "capture of %qD redundant with by-reference capture "
9268 }
9271 capture_id,
9272 capture_init_expr,
9274 explicit_init_p);
9275 }
9278 }
9280 /* Parse the (optional) middle of a lambda expression.
9282 lambda-declarator:
9283 < template-parameter-list [opt] >
9284 ( parameter-declaration-clause [opt] )
9285 attribute-specifier [opt]
9286 mutable [opt]
9287 exception-specification [opt]
9288 lambda-return-type-clause [opt]
9290 LAMBDA_EXPR is the current representation of the lambda expression. */
9292 static bool
9294 {
9295 /* 5.1.1.4 of the standard says:
9296 If a lambda-expression does not include a lambda-declarator, it is as if
9297 the lambda-declarator were ().
9298 This means an empty parameter list, no attributes, and no exception
9299 specification. */
9305 /* The template-parameter-list is optional, but must begin with
9306 an opening angle if present. */
9308 {
9311 "lambda templates are only available with "
9320 /* We just processed one more parameter list. */
9322 }
9324 /* The parameter-declaration-clause is optional (unless
9325 template-parameter-list was given), but must begin with an
9326 opening parenthesis if present. */
9328 {
9333 /* Parse parameters. */
9336 /* Default arguments shall not be specified in the
9337 parameter-declaration-clause of a lambda-declarator. */
9347 /* Parse optional `mutable' keyword. */
9349 {
9352 }
9354 /* Parse optional exception specification. */
9357 /* Parse optional trailing return type. */
9359 {
9363 }
9365 /* The function parameters must be in scope all the way until after the
9366 trailing-return-type in case of decltype. */
9368 }
9372 /* Create the function call operator.
9374 Messing with declarators like this is no uglier than building up the
9375 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9376 other code. */
9377 {
9378 cp_decl_specifier_seq return_type_specs;
9380 tree fco;
9387 else
9388 /* Maybe we will deduce the return type later. */
9394 sfk_none);
9399 VIRT_SPEC_UNSPECIFIED,
9400 REF_QUAL_NONE,
9401 exception_spec,
9406 declarator,
9407 attributes);
9409 {
9412 /* Give the object parameter a different name. */
9416 }
9418 {
9422 }
9431 }
9432 }
9434 /* Parse the body of a lambda expression, which is simply
9436 compound-statement
9438 but which requires special handling.
9439 LAMBDA_EXPR is the current representation of the lambda expression. */
9441 static void
9443 {
9448 else
9449 /* Still increment function_depth so that we don't GC in the
9450 middle of an expression. */
9452 /* Clear this in case we're in the middle of a default argument. */
9455 /* Finish the function call operator
9456 - class_specifier
9457 + late_parsing_for_member
9458 + function_definition_after_declarator
9459 + ctor_initializer_opt_and_function_body */
9460 {
9462 tree body;
9464 tree compound_stmt;
9465 tree cap;
9467 /* Let the front end know that we are going to be defining this
9468 function. */
9470 NULL_TREE,
9479 /* Push the proxies for any explicit captures. */
9486 /* 5.1.1.4 of the standard says:
9487 If a lambda-expression does not include a trailing-return-type, it
9488 is as if the trailing-return-type denotes the following type:
9489 * if the compound-statement is of the form
9490 { return attribute-specifier [opt] expression ; }
9491 the type of the returned expression after lvalue-to-rvalue
9492 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9493 (_conv.array_ 4.2), and function-to-pointer conversion
9494 (_conv.func_ 4.3);
9495 * otherwise, void. */
9497 /* In a lambda that has neither a lambda-return-type-clause
9498 nor a deducible form, errors should be reported for return statements
9499 in the body. Since we used void as the placeholder return type, parsing
9500 the body as usual will give such desired behavior. */
9504 {
9508 /* Parse tentatively in case there's more after the initial return
9509 statement. */
9520 {
9524 /* Will get error here if type not deduced yet. */
9528 }
9529 }
9532 {
9537 }
9541 out:
9545 /* Finish the function and generate code for it if necessary. */
9548 /* Only expand if the call op is not a template. */
9551 }
9556 else
9558 }
9560 /* Statements [gram.stmt.stmt] */
9562 /* Parse a statement.
9564 statement:
9565 labeled-statement
9566 expression-statement
9567 compound-statement
9568 selection-statement
9569 iteration-statement
9570 jump-statement
9571 declaration-statement
9572 try-block
9574 C++11:
9576 statement:
9577 labeled-statement
9578 attribute-specifier-seq (opt) expression-statement
9579 attribute-specifier-seq (opt) compound-statement
9580 attribute-specifier-seq (opt) selection-statement
9581 attribute-specifier-seq (opt) iteration-statement
9582 attribute-specifier-seq (opt) jump-statement
9583 declaration-statement
9584 attribute-specifier-seq (opt) try-block
9586 TM Extension:
9588 statement:
9589 atomic-statement
9591 IN_COMPOUND is true when the statement is nested inside a
9592 cp_parser_compound_statement; this matters for certain pragmas.
9594 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9595 is a (possibly labeled) if statement which is not enclosed in braces
9596 and has an else clause. This is used to implement -Wparentheses. */
9598 static void
9601 {
9606 restart:
9609 /* There is no statement yet. */
9615 /* In obj-c++, seeing '[[' might be the either the beginning of
9616 c++11 attributes, or a nested objc-message-expression. So
9617 let's parse the c++11 attributes tentatively. */
9621 {
9624 }
9626 /* Peek at the next token. */
9628 /* Remember the location of the first token in the statement. */
9630 /* If this is a keyword, then that will often determine what kind of
9631 statement we have. */
9633 {
9637 {
9640 /* Looks like a labeled-statement with a case label.
9641 Parse the label, and then use tail recursion to parse
9642 the statement. */
9659 {
9664 }
9665 else
9679 {
9684 }
9685 else
9686 {
9690 }
9694 /* Objective-C++ exception-handling constructs. */
9708 /* This must be a namespace alias definition. */
9721 /* It might be a keyword like `int' that can start a
9722 declaration-statement. */
9724 }
9725 }
9727 {
9728 /* If the next token is a `:', then we are looking at a
9729 labeled-statement. */
9732 {
9733 /* Looks like a labeled-statement with an ordinary label.
9734 Parse the label, and then use tail recursion to parse
9735 the statement. */
9739 }
9740 }
9741 /* Anything that starts with a `{' must be a compound-statement. */
9744 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9745 a statement all its own. */
9747 {
9748 /* Only certain OpenMP pragmas are attached to statements, and thus
9749 are considered statements themselves. All others are not. In
9750 the context of a compound, accept the pragma as a "statement" and
9751 return so that we can check for a close brace. Otherwise we
9752 require a real statement and must go back and read one. */
9758 }
9760 {
9763 }
9765 /* Everything else must be a declaration-statement or an
9766 expression-statement. Try for the declaration-statement
9767 first, unless we are looking at a `;', in which case we know that
9768 we have an expression-statement. */
9770 {
9772 {
9774 {
9775 /* Attributes should be parsed as part of the the
9776 declaration, so let's un-parse them. */
9779 }
9782 /* Try to parse the declaration-statement. */
9784 /* If that worked, we're done. */
9787 }
9788 /* Look for an expression-statement instead. */
9790 }
9792 /* Set the line number for the statement. */
9796 /* Note that for now, we don't do anything with c++11 statements
9797 parsed at this level. */
9800 OPT_Wattributes,
9802 }
9804 /* Parse the label for a labeled-statement, i.e.
9806 identifier :
9807 case constant-expression :
9808 default :
9810 GNU Extension:
9811 case constant-expression ... constant-expression : statement
9813 When a label is parsed without errors, the label is added to the
9814 parse tree by the finish_* functions, so this function doesn't
9815 have to return the label. */
9817 static void
9819 {
9824 /* The next token should be an identifier. */
9828 {
9831 }
9835 {
9837 {
9841 /* Consume the `case' token. */
9843 /* Parse the constant-expression. */
9848 {
9849 /* Consume the `...' token. */
9851 expr_hi =
9854 /* We don't need to emit warnings here, as the common code
9855 will do this for us. */
9856 }
9857 else
9862 else
9865 expr);
9866 }
9870 /* Consume the `default' token. */
9875 else
9880 /* Anything else must be an ordinary label. */
9883 }
9885 /* Require the `:' token. */
9888 /* An ordinary label may optionally be followed by attributes.
9889 However, this is only permitted if the attributes are then
9890 followed by a semicolon. This is because, for backward
9891 compatibility, when parsing
9892 lab: __attribute__ ((unused)) int i;
9893 we want the attribute to attach to "i", not "lab". */
9896 {
9897 tree attrs;
9904 ;
9905 else
9907 }
9913 }
9915 /* Parse an expression-statement.
9917 expression-statement:
9918 expression [opt] ;
9920 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9921 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9922 indicates whether this expression-statement is part of an
9923 expression statement. */
9925 static tree
9927 {
9931 /* If the next token is a ';', then there is no expression
9932 statement. */
9934 {
9938 {
9941 }
9942 }
9944 /* Give a helpful message for "A<T>::type t;" and the like. */
9947 {
9954 {
9955 /* A::A a; */
9960 }
9961 }
9963 /* Consume the final `;'. */
9968 /* This is the final expression statement of a statement
9969 expression. */
9975 }
9977 /* Parse a compound-statement.
9979 compound-statement:
9980 { statement-seq [opt] }
9982 GNU extension:
9984 compound-statement:
9985 { label-declaration-seq [opt] statement-seq [opt] }
9987 label-declaration-seq:
9988 label-declaration
9989 label-declaration-seq label-declaration
9991 Returns a tree representing the statement. */
9993 static tree
9996 {
9997 tree compound_stmt;
9999 /* Consume the `{'. */
10006 /* Begin the compound-statement. */
10008 /* If the next keyword is `__label__' we have a label declaration. */
10011 /* Parse an (optional) statement-seq. */
10013 /* Finish the compound-statement. */
10015 /* Consume the `}'. */
10019 }
10021 /* Parse an (optional) statement-seq.
10023 statement-seq:
10024 statement
10025 statement-seq [opt] statement */
10027 static void
10029 {
10030 /* Scan statements until there aren't any more. */
10032 {
10035 /* If we are looking at a `}', then we have run out of
10036 statements; the same is true if we have reached the end
10037 of file, or have stumbled upon a stray '@end'. */
10044 /* If we are in a compound statement and find 'else' then
10045 something went wrong. */
10047 {
10050 else
10051 {
10054 }
10055 }
10057 /* Parse the statement. */
10059 }
10060 }
10062 /* Parse a selection-statement.
10064 selection-statement:
10065 if ( condition ) statement
10066 if ( condition ) statement else statement
10067 switch ( condition ) statement
10069 Returns the new IF_STMT or SWITCH_STMT.
10071 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10072 is a (possibly labeled) if statement which is not enclosed in
10073 braces and has an else clause. This is used to implement
10074 -Wparentheses. */
10076 static tree
10078 {
10085 /* Peek at the next token. */
10088 /* See what kind of keyword it is. */
10091 {
10094 {
10095 tree statement;
10096 tree condition;
10098 /* Look for the `('. */
10100 {
10103 }
10105 /* Begin the selection-statement. */
10108 else
10111 /* Parse the condition. */
10113 /* Look for the `)'. */
10119 {
10123 /* Add the condition. */
10126 /* Parse the then-clause. */
10130 {
10138 }
10139 else
10145 /* If the next token is `else', parse the else-clause. */
10147 RID_ELSE))
10148 {
10149 /* Consume the `else' keyword. */
10152 /* Parse the else-clause. */
10154 {
10155 location_t loc;
10162 }
10163 else
10168 /* If we are currently parsing a then-clause, then
10169 IF_P will not be NULL. We set it to true to
10170 indicate that this if statement has an else clause.
10171 This may trigger the Wparentheses warning below
10172 when we get back up to the parent if statement. */
10175 }
10176 else
10177 {
10178 /* This if statement does not have an else clause. If
10179 NESTED_IF is true, then the then-clause is an if
10180 statement which does have an else clause. We warn
10181 about the potential ambiguity. */
10184 "suggest explicit braces to avoid ambiguous"
10186 }
10188 /* Now we're all done with the if-statement. */
10190 }
10191 else
10192 {
10196 /* Add the condition. */
10199 /* Parse the body of the switch-statement. */
10208 /* Now we're all done with the switch-statement. */
10210 }
10213 }
10219 }
10220 }
10222 /* Parse a condition.
10224 condition:
10225 expression
10226 type-specifier-seq declarator = initializer-clause
10227 type-specifier-seq declarator braced-init-list
10229 GNU Extension:
10231 condition:
10232 type-specifier-seq declarator asm-specification [opt]
10233 attributes [opt] = assignment-expression
10235 Returns the expression that should be tested. */
10237 static tree
10239 {
10240 cp_decl_specifier_seq type_specifiers;
10244 /* Try the declaration first. */
10246 /* New types are not allowed in the type-specifier-seq for a
10247 condition. */
10249 parser->type_definition_forbidden_message
10251 /* Parse the type-specifier-seq. */
10253 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10256 /* Restore the saved message. */
10258 /* If all is well, we might be looking at a declaration. */
10260 {
10261 tree decl;
10262 tree asm_specification;
10263 tree attributes;
10267 /* Parse the declarator. */
10273 /* Parse the attributes. */
10275 /* Parse the asm-specification. */
10277 /* If the next token is not an `=' or '{', then we might still be
10278 looking at an expression. For example:
10280 if (A(a).x)
10282 looks like a decl-specifier-seq and a declarator -- but then
10283 there is no `=', so this is an expression. */
10288 /* If we did see an `=' or '{', then we are looking at a declaration
10289 for sure. */
10291 {
10292 tree pushed_scope;
10296 /* Create the declaration. */
10302 /* Parse the initializer. */
10304 {
10308 }
10309 else
10310 {
10311 /* Consume the `='. */
10314 }
10318 /* Process the initializer. */
10321 asm_specification,
10322 flags);
10328 }
10329 }
10330 /* If we didn't even get past the declarator successfully, we are
10331 definitely not looking at a declaration. */
10332 else
10335 /* Otherwise, we are looking at an expression. */
10337 }
10339 /* Parses a for-statement or range-for-statement until the closing ')',
10340 not included. */
10342 static tree
10344 {
10348 /* Begin the for-statement. */
10351 /* Parse the initialization. */
10356 else
10358 }
10360 static tree
10362 {
10363 /* Normal for loop */
10366 tree stmt;
10369 /* The for-init-statement has already been parsed in
10370 cp_parser_for_init_statement, so no work is needed here. */
10373 /* If there's a condition, process it. */
10377 {
10381 }
10383 /* Look for the `;'. */
10386 /* If there's an expression, process it. */
10392 }
10394 /* Tries to parse a range-based for-statement:
10396 range-based-for:
10397 decl-specifier-seq declarator : expression
10399 The decl-specifier-seq declarator and the `:' are already parsed by
10400 cp_parser_for_init_statement. If processing_template_decl it returns a
10401 newly created RANGE_FOR_STMT; if not, it is converted to a
10402 regular FOR_STMT. */
10404 static tree
10407 {
10411 {
10414 }
10415 else
10418 /* If in template, STMT is converted to a normal for-statement
10419 at instantiation. If not, it is done just ahead. */
10421 {
10429 /* do_auto_deduction doesn't mess with template init-lists. */
10432 }
10433 else
10434 {
10437 }
10439 }
10441 /* Subroutine of cp_convert_range_for: given the initializer expression,
10442 builds up the range temporary. */
10444 static tree
10446 {
10449 /* Find out the type deduced by the declaration
10450 `auto &&__range = range_expr'. */
10455 /* Create the __range variable. */
10462 }
10464 /* Used by cp_parser_range_for in template context: we aren't going to
10465 do a full conversion yet, but we still need to resolve auto in the
10466 type of the for-range-declaration if present. This is basically
10467 a shortcut version of cp_convert_range_for. */
10469 static void
10471 {
10474 {
10477 iter_type = (cp_parser_perform_range_for_lookup
10480 {
10482 iter_type);
10484 tf_warning_or_error);
10487 }
10488 }
10489 }
10491 /* Converts a range-based for-statement into a normal
10492 for-statement, as per the definition.
10494 for (RANGE_DECL : RANGE_EXPR)
10495 BLOCK
10497 should be equivalent to:
10499 {
10500 auto &&__range = RANGE_EXPR;
10501 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10502 __begin != __end;
10503 ++__begin)
10504 {
10505 RANGE_DECL = *__begin;
10506 BLOCK
10507 }
10508 }
10510 If RANGE_EXPR is an array:
10511 BEGIN_EXPR = __range
10512 END_EXPR = __range + ARRAY_SIZE(__range)
10513 Else if RANGE_EXPR has a member 'begin' or 'end':
10514 BEGIN_EXPR = __range.begin()
10515 END_EXPR = __range.end()
10516 Else:
10517 BEGIN_EXPR = begin(__range)
10518 END_EXPR = end(__range);
10520 If __range has a member 'begin' but not 'end', or vice versa, we must
10521 still use the second alternative (it will surely fail, however).
10522 When calling begin()/end() in the third alternative we must use
10523 argument dependent lookup, but always considering 'std' as an associated
10524 namespace. */
10526 tree
10529 {
10535 /* If an error happened previously do nothing or else a lot of
10536 unhelpful errors would be issued. */
10538 else
10539 {
10540 tree range_temp;
10544 /* Can't bind a reference to an array of runtime bound. */
10546 else
10547 {
10552 LOOKUP_ONLYCONVERTING);
10554 }
10557 }
10559 /* The new for initialization statement. */
10567 LOOKUP_ONLYCONVERTING);
10576 LOOKUP_ONLYCONVERTING);
10580 /* The new for condition. */
10587 /* The new increment expression. */
10590 tf_warning_or_error);
10593 /* The declaration is initialized with *__begin inside the loop body. */
10596 tf_warning_or_error),
10598 LOOKUP_ONLYCONVERTING);
10601 }
10603 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10604 We need to solve both at the same time because the method used
10605 depends on the existence of members begin or end.
10606 Returns the type deduced for the iterator expression. */
10608 static tree
10610 {
10612 {
10615 }
10618 {
10623 }
10625 {
10626 /* If RANGE is an array, we will use pointer arithmetic. */
10629 range,
10633 }
10634 else
10635 {
10636 /* If it is not an array, we must do a bit of magic. */
10646 tf_warning_or_error);
10649 tf_warning_or_error);
10652 {
10653 /* Use the member functions. */
10656 else
10662 else
10665 }
10666 else
10667 {
10668 /* Use global functions with ADL. */
10675 tf_warning_or_error);
10677 tf_warning_or_error);
10679 tf_warning_or_error);
10681 tf_warning_or_error);
10684 }
10686 /* Last common checks. */
10688 {
10689 /* If one of the expressions is an error do no more checks. */
10692 }
10695 /* Can happen, when, eg, in a template context, Koenig lookup
10696 can't resolve begin/end (c++/58503). */
10698 else
10699 {
10701 /* The unqualified type of the __begin and __end temporaries should
10702 be the same, as required by the multiple auto declaration. */
10708 }
10709 }
10710 }
10712 /* Helper function for cp_parser_perform_range_for_lookup.
10713 Builds a tree for RANGE.IDENTIFIER(). */
10715 static tree
10717 {
10730 tf_warning_or_error);
10733 }
10735 /* Parse an iteration-statement.
10737 iteration-statement:
10738 while ( condition ) statement
10739 do statement while ( expression ) ;
10740 for ( for-init-statement condition [opt] ; expression [opt] )
10741 statement
10743 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10745 static tree
10747 {
10750 tree statement;
10753 /* Peek at the next token. */
10758 /* Remember whether or not we are already within an iteration
10759 statement. */
10762 /* See what kind of keyword it is. */
10765 {
10767 {
10768 tree condition;
10770 /* Begin the while-statement. */
10772 /* Look for the `('. */
10774 /* Parse the condition. */
10777 /* Look for the `)'. */
10779 /* Parse the dependent statement. */
10783 /* We're done with the while-statement. */
10785 }
10789 {
10790 tree expression;
10792 /* Begin the do-statement. */
10794 /* Parse the body of the do-statement. */
10799 /* Look for the `while' keyword. */
10801 /* Look for the `('. */
10803 /* Parse the expression. */
10805 /* We're done with the do-statement. */
10807 /* Look for the `)'. */
10809 /* Look for the `;'. */
10811 }
10815 {
10816 /* Look for the `('. */
10821 /* Look for the `)'. */
10824 /* Parse the body of the for-statement. */
10829 /* We're done with the for-statement. */
10831 }
10838 }
10841 }
10843 /* Parse a for-init-statement or the declarator of a range-based-for.
10844 Returns true if a range-based-for declaration is seen.
10846 for-init-statement:
10847 expression-statement
10848 simple-declaration */
10850 static bool
10852 {
10853 /* If the next token is a `;', then we have an empty
10854 expression-statement. Grammatically, this is also a
10855 simple-declaration, but an invalid one, because it does not
10856 declare anything. Therefore, if we did not handle this case
10857 specially, we would issue an error message about an invalid
10858 declaration. */
10860 {
10866 {
10867 /* N3994 -- for (id : init) ... */
10870 "type-specifier only available with "
10878 }
10880 /* A colon is used in range-based for. */
10883 /* We're going to speculatively look for a declaration, falling back
10884 to an expression, if necessary. */
10886 /* Parse the declaration. */
10889 decl);
10892 {
10893 /* It is a range-for, consume the ':' */
10897 {
10899 "range-based %<for%> loops only available with "
10902 }
10903 }
10904 else
10905 /* The ';' is not consumed yet because we told
10906 cp_parser_simple_declaration not to. */
10911 /* If the tentative parse failed, then we shall need to look for an
10912 expression-statement. */
10913 }
10914 /* If we are here, it is an expression-statement. */
10917 }
10919 /* Parse a jump-statement.
10921 jump-statement:
10922 break ;
10923 continue ;
10924 return expression [opt] ;
10925 return braced-init-list ;
10926 goto identifier ;
10928 GNU extension:
10930 jump-statement:
10931 goto * expression ;
10933 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10935 static tree
10937 {
10943 /* Peek at the next token. */
10948 /* See what kind of keyword it is. */
10951 {
10955 {
10975 }
10981 {
10988 /* Fall through. */
10998 }
11003 {
11004 tree expr;
11008 {
11012 }
11015 else
11016 /* If the next token is a `;', then there is no
11017 expression. */
11019 /* Build the return-statement. */
11021 /* Look for the final `;'. */
11023 }
11031 /* Create the goto-statement. */
11033 {
11034 /* Issue a warning about this use of a GNU extension. */
11036 /* Consume the '*' token. */
11038 /* Parse the dependent expression. */
11040 }
11041 else
11043 /* Look for the final `;'. */
11050 }
11053 }
11055 /* Parse a declaration-statement.
11057 declaration-statement:
11058 block-declaration */
11060 static void
11062 {
11065 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11068 /* Parse the block-declaration. */
11071 /* Free any declarators allocated. */
11073 }
11075 /* Some dependent statements (like `if (cond) statement'), are
11076 implicitly in their own scope. In other words, if the statement is
11077 a single statement (as opposed to a compound-statement), it is
11078 none-the-less treated as if it were enclosed in braces. Any
11079 declarations appearing in the dependent statement are out of scope
11080 after control passes that point. This function parses a statement,
11081 but ensures that is in its own scope, even if it is not a
11082 compound-statement.
11084 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11085 is a (possibly labeled) if statement which is not enclosed in
11086 braces and has an else clause. This is used to implement
11087 -Wparentheses.
11089 Returns the new statement. */
11091 static tree
11093 {
11094 tree statement;
11099 /* Mark if () ; with a special NOP_EXPR. */
11101 {
11105 }
11106 /* if a compound is opened, we simply parse the statement directly. */
11109 /* If the token is not a `{', then we must take special action. */
11110 else
11111 {
11112 /* Create a compound-statement. */
11114 /* Parse the dependent-statement. */
11116 /* Finish the dummy compound-statement. */
11118 }
11120 /* Return the statement. */
11122 }
11124 /* For some dependent statements (like `while (cond) statement'), we
11125 have already created a scope. Therefore, even if the dependent
11126 statement is a compound-statement, we do not want to create another
11127 scope. */
11129 static void
11131 {
11132 /* If the token is a `{', then we must take special action. */
11135 else
11136 {
11137 /* Avoid calling cp_parser_compound_statement, so that we
11138 don't create a new scope. Do everything else by hand. */
11140 /* If the next keyword is `__label__' we have a label declaration. */
11143 /* Parse an (optional) statement-seq. */
11146 }
11147 }
11149 /* Declarations [gram.dcl.dcl] */
11151 /* Parse an optional declaration-sequence.
11153 declaration-seq:
11154 declaration
11155 declaration-seq declaration */
11157 static void
11159 {
11161 {
11172 {
11173 /* A declaration consisting of a single semicolon is
11174 invalid. Allow it unless we're being pedantic. */
11179 }
11181 /* If we're entering or exiting a region that's implicitly
11182 extern "C", modify the lang context appropriately. */
11184 {
11187 }
11189 {
11192 }
11195 {
11196 /* A top-level declaration can consist solely of a #pragma.
11197 A nested declaration cannot, so this is done here and not
11198 in cp_parser_declaration. (A #pragma at block scope is
11199 handled in cp_parser_statement.) */
11202 }
11204 /* Parse the declaration itself. */
11206 }
11207 }
11209 /* Parse a declaration.
11211 declaration:
11212 block-declaration
11213 function-definition
11214 template-declaration
11215 explicit-instantiation
11216 explicit-specialization
11217 linkage-specification
11218 namespace-definition
11220 GNU extension:
11222 declaration:
11223 __extension__ declaration */
11225 static void
11227 {
11228 cp_token token1;
11229 cp_token token2;
11234 /* Check for the `__extension__' keyword. */
11236 {
11237 /* Parse the qualified declaration. */
11239 /* Restore the PEDANTIC flag. */
11243 }
11245 /* Try to figure out what kind of declaration is present. */
11250 else
11251 {
11254 }
11256 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11259 /* If the next token is `extern' and the following token is a string
11260 literal, then we have a linkage specification. */
11264 /* If the next token is `template', then we have either a template
11265 declaration, an explicit instantiation, or an explicit
11266 specialization. */
11268 {
11269 /* `template <>' indicates a template specialization. */
11273 /* `template <' indicates a template declaration. */
11276 /* Anything else must be an explicit instantiation. */
11277 else
11279 }
11280 /* If the next token is `export', then we have a template
11281 declaration. */
11284 /* If the next token is `extern', 'static' or 'inline' and the one
11285 after that is `template', we have a GNU extended explicit
11286 instantiation directive. */
11293 /* If the next token is `namespace', check for a named or unnamed
11294 namespace definition. */
11300 /* An unnamed namespace definition. */
11304 /* An inline (associated) namespace definition. */
11308 /* Objective-C++ declaration/definition. */
11315 /* We must have either a block declaration or a function
11316 definition. */
11317 else
11318 /* Try to parse a block-declaration, or a function-definition. */
11321 /* Free any declarators allocated. */
11323 }
11325 /* Parse a block-declaration.
11327 block-declaration:
11328 simple-declaration
11329 asm-definition
11330 namespace-alias-definition
11331 using-declaration
11332 using-directive
11334 GNU Extension:
11336 block-declaration:
11337 __extension__ block-declaration
11339 C++0x Extension:
11341 block-declaration:
11342 static_assert-declaration
11344 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11345 part of a declaration-statement. */
11347 static void
11350 {
11354 /* Check for the `__extension__' keyword. */
11356 {
11357 /* Parse the qualified declaration. */
11359 /* Restore the PEDANTIC flag. */
11363 }
11365 /* Peek at the next token to figure out which kind of declaration is
11366 present. */
11369 /* If the next keyword is `asm', we have an asm-definition. */
11371 {
11375 }
11376 /* If the next keyword is `namespace', we have a
11377 namespace-alias-definition. */
11380 /* If the next keyword is `using', we have a
11381 using-declaration, a using-directive, or an alias-declaration. */
11383 {
11388 /* If the token after `using' is `namespace', then we have a
11389 using-directive. */
11393 /* If the second token after 'using' is '=', then we have an
11394 alias-declaration. */
11400 /* Otherwise, it's a using-declaration. */
11401 else
11404 }
11405 /* If the next keyword is `__label__' we have a misplaced label
11406 declaration. */
11408 {
11412 /* If the next token is now a `;', consume it. */
11415 }
11416 /* If the next token is `static_assert' we have a static assertion. */
11419 /* Anything else must be a simple-declaration. */
11420 else
11423 }
11425 /* Parse a simple-declaration.
11427 simple-declaration:
11428 decl-specifier-seq [opt] init-declarator-list [opt] ;
11430 init-declarator-list:
11431 init-declarator
11432 init-declarator-list , init-declarator
11434 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11435 function-definition as a simple-declaration.
11437 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11438 parsed declaration if it is an uninitialized single declarator not followed
11439 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11440 if present, will not be consumed. */
11442 static void
11446 {
11447 cp_decl_specifier_seq decl_specifiers;
11454 /* Defer access checks until we know what is being declared; the
11455 checks for names appearing in the decl-specifier-seq should be
11456 done as if we were in the scope of the thing being declared. */
11459 /* Parse the decl-specifier-seq. We have to keep track of whether
11460 or not the decl-specifier-seq declares a named class or
11461 enumeration type, since that is the only case in which the
11462 init-declarator-list is allowed to be empty.
11464 [dcl.dcl]
11466 In a simple-declaration, the optional init-declarator-list can be
11467 omitted only when declaring a class or enumeration, that is when
11468 the decl-specifier-seq contains either a class-specifier, an
11469 elaborated-type-specifier, or an enum-specifier. */
11471 CP_PARSER_FLAGS_OPTIONAL,
11474 /* We no longer need to defer access checks. */
11477 /* In a block scope, a valid declaration must always have a
11478 decl-specifier-seq. By not trying to parse declarators, we can
11479 resolve the declaration/expression ambiguity more quickly. */
11482 {
11485 }
11487 /* If the next two tokens are both identifiers, the code is
11488 erroneous. The usual cause of this situation is code like:
11490 T t;
11492 where "T" should name a type -- but does not. */
11495 {
11496 /* If parsing tentatively, we should commit; we really are
11497 looking at a declaration. */
11499 /* Give up. */
11501 }
11503 /* If we have seen at least one decl-specifier, and the next token
11504 is not a parenthesis, then we must be looking at a declaration.
11505 (After "int (" we might be looking at a functional cast.) */
11512 /* Keep going until we hit the `;' at the end of the simple
11513 declaration. */
11516 CPP_SEMICOLON))
11517 {
11520 tree decl;
11523 {
11524 /* If we are processing next declarator, coma is expected */
11530 }
11531 else
11534 /* Parse the init-declarator. */
11537 function_definition_allowed_p,
11539 declares_class_or_enum,
11541 maybe_range_for_decl);
11542 /* If an error occurred while parsing tentatively, exit quickly.
11543 (That usually happens when in the body of a function; each
11544 statement is treated as a declaration-statement until proven
11545 otherwise.) */
11548 /* Handle function definitions specially. */
11550 {
11551 /* If the next token is a `,', then we are probably
11552 processing something like:
11554 void f() {}, *p;
11556 which is erroneous. */
11558 {
11561 "mixing"
11563 }
11564 /* Otherwise, we're done with the list of declarators. */
11565 else
11566 {
11569 }
11570 }
11573 /* The next token should be either a `,' or a `;'. */
11575 /* If it's a `,', there are more declarators to come. */
11578 /* If it's a `;', we are done. */
11581 /* Anything else is an error. */
11582 else
11583 {
11584 /* If we have already issued an error message we don't need
11585 to issue another one. */
11589 /* Skip tokens until we reach the end of the statement. */
11591 /* If the next token is now a `;', consume it. */
11595 }
11596 /* After the first time around, a function-definition is not
11597 allowed -- even if it was OK at first. For example:
11599 int i, f() {}
11601 is not valid. */
11603 }
11605 /* Issue an error message if no declarators are present, and the
11606 decl-specifier-seq does not itself declare a class or
11607 enumeration: [dcl.dcl]/3. */
11609 {
11611 {
11615 /* Ensure an error is issued anyway when finish_decltype_type,
11616 called via cp_parser_decl_specifier_seq, returns a class or
11617 an enumeration (c++/51786). */
11620 }
11621 /* Perform any deferred access checks. */
11623 }
11625 /* Consume the `;'. */
11629 done:
11631 }
11633 /* Parse a decl-specifier-seq.
11635 decl-specifier-seq:
11636 decl-specifier-seq [opt] decl-specifier
11637 decl-specifier attribute-specifier-seq [opt] (C++11)
11639 decl-specifier:
11640 storage-class-specifier
11641 type-specifier
11642 function-specifier
11643 friend
11644 typedef
11646 GNU Extension:
11648 decl-specifier:
11649 attributes
11651 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11653 The parser flags FLAGS is used to control type-specifier parsing.
11655 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11656 flags:
11658 1: one of the decl-specifiers is an elaborated-type-specifier
11659 (i.e., a type declaration)
11660 2: one of the decl-specifiers is an enum-specifier or a
11661 class-specifier (i.e., a type definition)
11663 */
11665 static void
11667 cp_parser_flags flags,
11670 {
11674 cp_decl_spec ds;
11676 /* Clear DECL_SPECS. */
11679 /* Assume no class or enumeration type is declared. */
11682 /* Keep reading specifiers until there are no more to read. */
11684 {
11689 /* Peek at the next token. */
11692 /* Save the first token of the decl spec list for error
11693 reporting. */
11696 /* Handle attributes. */
11698 {
11699 /* Parse the attributes. */
11702 /* In a sequence of declaration specifiers, c++11 attributes
11703 appertain to the type that precede them. In that case
11704 [dcl.spec]/1 says:
11706 The attribute-specifier-seq affects the type only for
11707 the declaration it appears in, not other declarations
11708 involving the same type.
11710 But for now let's force the user to position the
11711 attribute either at the beginning of the declaration or
11712 after the declarator-id, which would clearly mean that it
11713 applies to the declarator. */
11715 {
11717 /* The c++11 attribute is at the beginning of the
11718 declaration. It appertains to the entity being
11720 else
11721 {
11723 {
11724 /* This is an attribute following a
11725 class-specifier. */
11730 }
11731 else
11732 {
11733 decl_specs->std_attributes
11735 attrs);
11738 }
11740 }
11741 }
11743 decl_specs->attributes
11745 attrs);
11749 }
11750 /* Assume we will find a decl-specifier keyword. */
11752 /* If the next token is an appropriate keyword, we can simply
11753 add it to the list. */
11755 {
11756 /* decl-specifier:
11757 friend
11758 constexpr */
11761 {
11764 }
11765 else
11766 {
11768 /* Consume the token. */
11770 }
11778 /* function-specifier:
11779 inline
11780 virtual
11781 explicit */
11788 /* decl-specifier:
11789 typedef */
11792 /* Consume the token. */
11794 /* A constructor declarator cannot appear in a typedef. */
11796 /* The "typedef" keyword can only occur in a declaration; we
11797 may as well commit at this point. */
11804 /* storage-class-specifier:
11805 auto
11806 register
11807 static
11808 extern
11809 mutable
11811 GNU Extension:
11812 thread */
11815 {
11816 /* Consume the token. */
11819 /* Complain about `auto' as a storage specifier, if
11820 we're complaining about C++0x compatibility. */
11824 /* Set the storage class anyway. */
11826 token);
11827 }
11828 else
11829 /* C++0x auto type-specifier. */
11837 /* Consume the token. */
11840 token);
11843 /* Consume the token. */
11849 /* We did not yet find a decl-specifier yet. */
11852 }
11862 /* Constructors are a special case. The `S' in `S()' is not a
11863 decl-specifier; it is the beginning of the declarator. */
11864 constructor_p
11865 = (!found_decl_spec
11866 && constructor_possible_p
11867 && (cp_parser_constructor_declarator_p
11870 /* If we don't have a DECL_SPEC yet, then we must be looking at
11871 a type-specifier. */
11873 {
11876 tree type_spec;
11878 type_spec
11880 decl_specs,
11886 /* If this type-specifier referenced a user-defined type
11887 (a typedef, class-name, etc.), then we can't allow any
11888 more such type-specifiers henceforth.
11890 [dcl.spec]
11892 The longest sequence of decl-specifiers that could
11893 possibly be a type name is taken as the
11894 decl-specifier-seq of a declaration. The sequence shall
11895 be self-consistent as described below.
11897 [dcl.type]
11899 As a general rule, at most one type-specifier is allowed
11900 in the complete decl-specifier-seq of a declaration. The
11901 only exceptions are the following:
11903 -- const or volatile can be combined with any other
11904 type-specifier.
11906 -- signed or unsigned can be combined with char, long,
11907 short, or int.
11909 -- ..
11911 Example:
11913 typedef char* Pc;
11914 void g (const int Pc);
11916 Here, Pc is *not* part of the decl-specifier seq; it's
11917 the declarator. Therefore, once we see a type-specifier
11918 (other than a cv-qualifier), we forbid any additional
11919 user-defined types. We *do* still allow things like `int
11920 int' to be considered a decl-specifier-seq, and issue the
11921 error message later. */
11924 /* A constructor declarator cannot follow a type-specifier. */
11926 {
11931 }
11932 }
11934 /* If we still do not have a DECL_SPEC, then there are no more
11935 decl-specifiers. */
11940 /* After we see one decl-specifier, further decl-specifiers are
11941 always optional. */
11943 }
11945 /* Don't allow a friend specifier with a class definition. */
11950 }
11952 /* Parse an (optional) storage-class-specifier.
11954 storage-class-specifier:
11955 auto
11956 register
11957 static
11958 extern
11959 mutable
11961 GNU Extension:
11963 storage-class-specifier:
11964 thread
11966 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11968 static tree
11970 {
11972 {
11976 /* Fall through for C++98. */
11983 /* Consume the token. */
11988 }
11989 }
11991 /* Parse an (optional) function-specifier.
11993 function-specifier:
11994 inline
11995 virtual
11996 explicit
11998 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11999 Updates DECL_SPECS, if it is non-NULL. */
12001 static tree
12004 {
12007 {
12013 /* 14.5.2.3 [temp.mem]
12015 A member function template shall not be virtual. */
12018 else
12028 }
12030 /* Consume the token. */
12032 }
12034 /* Parse a linkage-specification.
12036 linkage-specification:
12037 extern string-literal { declaration-seq [opt] }
12038 extern string-literal declaration */
12040 static void
12042 {
12043 tree linkage;
12045 /* Look for the `extern' keyword. */
12048 /* Look for the string-literal. */
12051 /* Transform the literal into an identifier. If the literal is a
12052 wide-character string, or contains embedded NULs, then we can't
12053 handle it as the user wants. */
12056 {
12058 /* Assume C++ linkage. */
12060 }
12061 else
12064 /* We're now using the new linkage. */
12067 /* If the next token is a `{', then we're using the first
12068 production. */
12070 {
12073 /* Consume the `{' token. */
12075 /* Parse the declarations. */
12077 /* Look for the closing `}'. */
12079 }
12080 /* Otherwise, there's just one declaration. */
12081 else
12082 {
12085 saved_in_unbraced_linkage_specification_p
12089 parser->in_unbraced_linkage_specification_p
12091 }
12093 /* We're done with the linkage-specification. */
12095 }
12097 /* Parse a static_assert-declaration.
12099 static_assert-declaration:
12100 static_assert ( constant-expression , string-literal ) ;
12102 If MEMBER_P, this static_assert is a class member. */
12104 static void
12106 {
12107 tree condition;
12108 tree message;
12110 location_t saved_loc;
12113 /* Peek at the `static_assert' token so we can keep track of exactly
12114 where the static assertion started. */
12118 /* Look for the `static_assert' keyword. */
12120 RT_STATIC_ASSERT))
12123 /* We know we are in a static assertion; commit to any tentative
12124 parse. */
12128 /* Parse the `(' starting the static assertion condition. */
12131 /* Parse the constant-expression. Allow a non-constant expression
12132 here in order to give better diagnostics in finish_static_assert. */
12133 condition =
12138 /* Parse the separating `,'. */
12141 /* Parse the string-literal message. */
12146 /* A `)' completes the static assertion. */
12153 /* A semicolon terminates the declaration. */
12156 /* Complete the static assertion, which may mean either processing
12157 the static assert now or saving it for template instantiation. */
12159 }
12161 /* Parse the expression in decltype ( expression ). */
12163 static tree
12166 {
12168 tree expr;
12170 /* First, try parsing an id-expression. */
12181 {
12184 cp_id_kind idk;
12188 /* Lookup the name we got back from the id-expression. */
12199 {
12200 /* Complete lookup of the id-expression. */
12201 expr = (finish_id_expression
12214 /* We found an id-expression, but it was something that we
12215 should not have found. This is an error, not something
12216 we can recover from, so note that we found an
12217 id-expression and we'll recover as gracefully as
12218 possible. */
12220 }
12225 /* We have an id-expression. */
12227 }
12230 {
12231 /* Abort the id-expression parse. */
12234 /* Parsing tentatively, again. */
12237 /* Parse a class member access. */
12245 /* We have an id-expression. */
12247 }
12250 /* We have parsed the complete id-expression or member access. */
12252 else
12253 {
12254 /* Abort our attempt to parse an id-expression or member access
12255 expression. */
12258 /* Parse a full expression. */
12261 }
12264 }
12266 /* Parse a `decltype' type. Returns the type.
12268 simple-type-specifier:
12269 decltype ( expression )
12270 C++14 proposal:
12271 decltype ( auto ) */
12273 static tree
12275 {
12276 tree expr;
12285 {
12286 /* Already parsed. */
12289 }
12291 /* Look for the `decltype' token. */
12295 /* Parse the opening `('. */
12299 /* decltype (auto) */
12302 {
12309 }
12311 /* Types cannot be defined in a `decltype' expression. Save away the
12312 old message. */
12315 /* And create the new one. */
12316 parser->type_definition_forbidden_message
12319 /* The restrictions on constant-expressions do not apply inside
12320 decltype expressions. */
12321 saved_integral_constant_expression_p
12323 saved_non_integral_constant_expression_p
12327 /* Within a parenthesized expression, a `>' token is always
12328 the greater-than operator. */
12329 saved_greater_than_is_operator_p
12333 /* Do not actually evaluate the expression. */
12336 /* Do not warn about problems with the expression. */
12341 /* Go back to evaluating expressions. */
12345 /* The `>' token might be the end of a template-id or
12346 template-parameter-list now. */
12347 parser->greater_than_is_operator_p
12350 /* Restore the old message and the integral constant expression
12351 flags. */
12353 parser->integral_constant_expression_p
12355 parser->non_integral_constant_expression_p
12358 /* Parse to the closing `)'. */
12360 {
12364 }
12367 tf_warning_or_error);
12369 rewrite:
12370 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12371 it again. */
12378 }
12380 /* Special member functions [gram.special] */
12382 /* Parse a conversion-function-id.
12384 conversion-function-id:
12385 operator conversion-type-id
12387 Returns an IDENTIFIER_NODE representing the operator. */
12389 static tree
12391 {
12392 tree type;
12393 tree saved_scope;
12394 tree saved_qualifying_scope;
12395 tree saved_object_scope;
12398 /* Look for the `operator' token. */
12401 /* When we parse the conversion-type-id, the current scope will be
12402 reset. However, we need that information in able to look up the
12403 conversion function later, so we save it here. */
12407 /* We must enter the scope of the class so that the names of
12408 entities declared within the class are available in the
12409 conversion-type-id. For example, consider:
12411 struct S {
12412 typedef int I;
12413 operator I();
12414 };
12416 S::operator I() { ... }
12418 In order to see that `I' is a type-name in the definition, we
12419 must be in the scope of `S'. */
12422 /* Parse the conversion-type-id. */
12424 /* Leave the scope of the class, if any. */
12427 /* Restore the saved scope. */
12431 /* If the TYPE is invalid, indicate failure. */
12435 }
12437 /* Parse a conversion-type-id:
12439 conversion-type-id:
12440 type-specifier-seq conversion-declarator [opt]
12442 Returns the TYPE specified. */
12444 static tree
12446 {
12447 tree attributes;
12448 cp_decl_specifier_seq type_specifiers;
12450 tree type_specified;
12453 /* Parse the attributes. */
12457 parser->type_definition_forbidden_message
12460 /* Parse the type-specifiers. */
12467 /* If that didn't work, stop. */
12470 /* Parse the conversion-declarator. */
12478 /* Don't give this error when parsing tentatively. This happens to
12479 work because we always parse this definitively once. */
12482 {
12484 {
12487 }
12491 }
12494 }
12496 /* Parse an (optional) conversion-declarator.
12498 conversion-declarator:
12499 ptr-operator conversion-declarator [opt]
12501 */
12505 {
12508 cp_cv_quals cv_quals;
12510 /* We don't know if there's a ptr-operator next, or not. */
12512 /* Try the ptr-operator. */
12515 /* If it worked, look for more conversion-declarators. */
12517 {
12520 /* Parse another optional declarator. */
12523 declarator = cp_parser_make_indirect_declarator
12527 }
12530 }
12532 /* Parse an (optional) ctor-initializer.
12534 ctor-initializer:
12535 : mem-initializer-list
12537 Returns TRUE iff the ctor-initializer was actually present. */
12539 static bool
12541 {
12542 /* If the next token is not a `:', then there is no
12543 ctor-initializer. */
12545 {
12546 /* Do default initialization of any bases and members. */
12551 }
12553 /* Consume the `:' token. */
12555 /* And the mem-initializer-list. */
12559 }
12561 /* Parse a mem-initializer-list.
12563 mem-initializer-list:
12564 mem-initializer ... [opt]
12565 mem-initializer ... [opt] , mem-initializer-list */
12567 static void
12569 {
12574 /* Let the semantic analysis code know that we are starting the
12575 mem-initializer-list. */
12580 /* Loop through the list. */
12582 {
12583 tree mem_initializer;
12586 /* Parse the mem-initializer. */
12588 /* If the next token is a `...', we're expanding member initializers. */
12590 {
12591 /* Consume the `...'. */
12594 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12595 can be expanded but members cannot. */
12598 {
12603 }
12605 /* Construct the pack expansion type. */
12608 }
12611 {
12615 }
12616 /* Look for a target constructor. */
12620 {
12623 {
12627 }
12629 }
12630 /* Add it to the list, unless it was erroneous. */
12632 {
12635 }
12636 /* If the next token is not a `,', we're done. */
12639 /* Consume the `,' token. */
12641 }
12643 /* Perform semantic analysis. */
12646 }
12648 /* Parse a mem-initializer.
12650 mem-initializer:
12651 mem-initializer-id ( expression-list [opt] )
12652 mem-initializer-id braced-init-list
12654 GNU extension:
12656 mem-initializer:
12657 ( expression-list [opt] )
12659 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12660 class) or FIELD_DECL (for a non-static data member) to initialize;
12661 the TREE_VALUE is the expression-list. An empty initialization
12662 list is represented by void_list_node. */
12664 static tree
12666 {
12667 tree mem_initializer_id;
12668 tree expression_list;
12669 tree member;
12672 /* Find out what is being initialized. */
12674 {
12678 }
12679 else
12680 {
12684 }
12690 {
12697 }
12698 else
12699 {
12709 }
12719 }
12721 /* Parse a mem-initializer-id.
12723 mem-initializer-id:
12724 :: [opt] nested-name-specifier [opt] class-name
12725 identifier
12727 Returns a TYPE indicating the class to be initializer for the first
12728 production. Returns an IDENTIFIER_NODE indicating the data member
12729 to be initialized for the second production. */
12731 static tree
12733 {
12737 tree id;
12741 /* `typename' is not allowed in this context ([temp.res]). */
12743 {
12745 "keyword %<typename%> not allowed in this context (a qualified "
12748 }
12749 /* Look for the optional `::' operator. */
12750 global_scope_p
12754 /* Look for the optional nested-name-specifier. The simplest way to
12755 implement:
12757 [temp.res]
12759 The keyword `typename' is not permitted in a base-specifier or
12760 mem-initializer; in these contexts a qualified name that
12761 depends on a template-parameter is implicitly assumed to be a
12762 type name.
12764 is to assume that we have seen the `typename' keyword at this
12765 point. */
12766 nested_name_specifier_p
12775 /* If there is a `::' operator or a nested-name-specifier, then we
12776 are definitely looking for a class-name. */
12781 typename_type,
12785 /* Otherwise, we could also be looking for an ordinary identifier. */
12787 /* Try a class-name. */
12791 none_type,
12795 /* If we found one, we're done. */
12798 /* Otherwise, look for an ordinary identifier. */
12800 }
12802 /* Overloading [gram.over] */
12804 /* Parse an operator-function-id.
12806 operator-function-id:
12807 operator operator
12809 Returns an IDENTIFIER_NODE for the operator which is a
12810 human-readable spelling of the identifier, e.g., `operator +'. */
12812 static tree
12814 {
12815 /* Look for the `operator' keyword. */
12818 /* And then the name of the operator itself. */
12820 }
12822 /* Return an identifier node for a user-defined literal operator.
12823 The suffix identifier is chained to the operator name identifier. */
12825 static tree
12827 {
12828 tree identifier;
12835 }
12837 /* Parse an operator.
12839 operator:
12840 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12841 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12842 || ++ -- , ->* -> () []
12844 GNU Extensions:
12846 operator:
12847 <? >? <?= >?=
12849 Returns an IDENTIFIER_NODE for the operator which is a
12850 human-readable spelling of the identifier, e.g., `operator +'. */
12852 static tree
12854 {
12859 /* Peek at the next token. */
12861 /* Figure out which operator we have. */
12863 {
12865 {
12868 /* The keyword should be either `new' or `delete'. */
12873 else
12876 /* Consume the `new' or `delete' token. */
12879 /* Peek at the next token. */
12881 /* If it's a `[' token then this is the array variant of the
12882 operator. */
12884 {
12885 /* Consume the `[' token. */
12887 /* Look for the `]' token. */
12891 }
12892 /* Otherwise, we have the non-array variant. */
12893 else
12897 }
13044 /* Consume the `('. */
13046 /* Look for the matching `)'. */
13051 /* Consume the `['. */
13053 /* Look for the matching `]'. */
13068 {
13075 /* Consume the string. */
13081 {
13084 }
13085 else
13086 {
13088 /* Look for the suffix identifier. */
13093 {
13097 }
13098 else
13099 {
13102 }
13103 }
13108 {
13111 }
13114 {
13117 }
13119 {
13122 }
13124 }
13127 /* Anything else is an error. */
13129 }
13131 /* If we have selected an identifier, we need to consume the
13132 operator token. */
13135 /* Otherwise, no valid operator name was present. */
13136 else
13137 {
13140 }
13143 }
13145 /* Parse a template-declaration.
13147 template-declaration:
13148 export [opt] template < template-parameter-list > declaration
13150 If MEMBER_P is TRUE, this template-declaration occurs within a
13151 class-specifier.
13153 The grammar rule given by the standard isn't correct. What
13154 is really meant is:
13156 template-declaration:
13157 export [opt] template-parameter-list-seq
13158 decl-specifier-seq [opt] init-declarator [opt] ;
13159 export [opt] template-parameter-list-seq
13160 function-definition
13162 template-parameter-list-seq:
13163 template-parameter-list-seq [opt]
13164 template < template-parameter-list > */
13166 static void
13168 {
13169 /* Check for `export'. */
13171 {
13172 /* Consume the `export' token. */
13174 /* Warn that we do not support `export'. */
13176 }
13179 }
13181 /* Parse a template-parameter-list.
13183 template-parameter-list:
13184 template-parameter
13185 template-parameter-list , template-parameter
13187 Returns a TREE_LIST. Each node represents a template parameter.
13188 The nodes are connected via their TREE_CHAINs. */
13190 static tree
13192 {
13197 /* The loop below parses the template parms. We first need to know
13198 the total number of template parms to be able to compute proper
13199 canonical types of each dependent type. So after the loop, when
13200 we know the total number of template parms,
13201 end_template_parm_list computes the proper canonical types and
13202 fixes up the dependent types accordingly. */
13204 {
13205 tree parameter;
13208 location_t parm_loc;
13210 /* Parse the template-parameter. */
13215 /* Add it to the list. */
13218 parm_loc,
13219 parameter,
13220 is_non_type,
13221 is_parameter_pack);
13222 else
13223 {
13226 }
13228 /* If the next token is not a `,', we're done. */
13231 /* Otherwise, consume the `,' token. */
13233 }
13236 }
13238 /* Parse a template-parameter.
13240 template-parameter:
13241 type-parameter
13242 parameter-declaration
13244 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13245 the parameter. The TREE_PURPOSE is the default value, if any.
13246 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13247 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13248 set to true iff this parameter is a parameter pack. */
13250 static tree
13253 {
13257 tree parm;
13259 /* Assume it is a type parameter or a template parameter. */
13261 /* Assume it not a parameter pack. */
13263 /* Peek at the next token. */
13265 /* If it is `class' or `template', we have a type-parameter. */
13268 /* If it is `class' or `typename' we do not know yet whether it is a
13269 type parameter or a non-type parameter. Consider:
13271 template <typename T, typename T::X X> ...
13273 or:
13275 template <class C, class D*> ...
13277 Here, the first parameter is a type parameter, and the second is
13278 a non-type parameter. We can tell by looking at the token after
13279 the identifier -- if it is a `,', `=', or `>' then we have a type
13280 parameter. */
13282 {
13283 /* Peek at the token after `class' or `typename'. */
13285 /* If it's an ellipsis, we have a template type parameter
13286 pack. */
13289 /* If it's an identifier, skip it. */
13292 /* Now, see if the token looks like the end of a template
13293 parameter. */
13298 }
13300 /* Otherwise, it is a non-type parameter.
13302 [temp.param]
13304 When parsing a default template-argument for a non-type
13305 template-parameter, the first non-nested `>' is taken as the end
13306 of the template parameter-list rather than a greater-than
13307 operator. */
13309 parameter_declarator
13316 /* If the parameter declaration is marked as a parameter pack, set
13317 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13318 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13319 grokdeclarator. */
13322 {
13325 }
13328 {
13329 /* Can happen in some cases of erroneous input (c++/34892). */
13331 /* Consume the `...' for better error recovery. */
13333 }
13334 /* If the next token is an ellipsis, and we don't already have it
13335 marked as a parameter pack, then we have a parameter pack (that
13336 has no declarator). */
13339 && (declarator_can_be_parameter_pack
13341 {
13342 /* Consume the `...'. */
13347 }
13348 /* We might end up with a pack expansion as the type of the non-type
13349 template parameter, in which case this is a non-type template
13350 parameter pack. */
13353 {
13357 }
13360 {
13361 /* Parameter packs cannot have default arguments. However, a
13362 user may try to do so, so we'll parse them and give an
13363 appropriate diagnostic here. */
13367 /* Find the name of the parameter pack. */
13376 else
13380 /* Parse the default argument, but throw away the result. */
13382 }
13392 }
13394 /* Parse a type-parameter.
13396 type-parameter:
13397 class identifier [opt]
13398 class identifier [opt] = type-id
13399 typename identifier [opt]
13400 typename identifier [opt] = type-id
13401 template < template-parameter-list > class identifier [opt]
13402 template < template-parameter-list > class identifier [opt]
13403 = id-expression
13405 GNU Extension (variadic templates):
13407 type-parameter:
13408 class ... identifier [opt]
13409 typename ... identifier [opt]
13411 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13412 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13413 the declaration of the parameter.
13415 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13417 static tree
13419 {
13421 tree parameter;
13423 /* Look for a keyword to tell us what kind of parameter this is. */
13429 {
13432 {
13433 tree identifier;
13434 tree default_argument;
13436 /* If the next token is an ellipsis, we have a template
13437 argument pack. */
13439 {
13440 /* Consume the `...' token. */
13445 }
13447 /* If the next token is an identifier, then it names the
13448 parameter. */
13451 else
13454 /* Create the parameter. */
13457 /* If the next token is an `=', we have a default argument. */
13459 {
13460 /* Consume the `=' token. */
13462 /* Parse the default-argument. */
13466 /* Template parameter packs cannot have default
13467 arguments. */
13469 {
13472 "template parameter pack %qD cannot have a "
13474 else
13476 "template parameter packs cannot have "
13479 }
13481 }
13482 else
13485 /* Create the combined representation of the parameter and the
13486 default argument. */
13488 }
13492 {
13493 tree identifier;
13494 tree default_argument;
13496 /* Look for the `<'. */
13498 /* Parse the template-parameter-list. */
13500 /* Look for the `>'. */
13502 /* Look for the `class' or 'typename' keywords. */
13504 /* If the next token is an ellipsis, we have a template
13505 argument pack. */
13507 {
13508 /* Consume the `...' token. */
13513 }
13514 /* If the next token is an `=', then there is a
13515 default-argument. If the next token is a `>', we are at
13516 the end of the parameter-list. If the next token is a `,',
13517 then we are at the end of this parameter. */
13521 {
13523 /* Treat invalid names as if the parameter were nameless. */
13526 }
13527 else
13530 /* Create the template parameter. */
13532 identifier);
13534 /* If the next token is an `=', then there is a
13535 default-argument. */
13537 {
13540 /* Consume the `='. */
13542 /* Parse the id-expression. */
13544 /* save token before parsing the id-expression, for error
13545 reporting */
13547 default_argument
13555 /* If the id-expression was a template-id that refers to
13556 a template-class, we already have the declaration here,
13557 so no further lookup is needed. */
13558 ;
13559 else
13560 /* Look up the name. */
13561 default_argument
13563 none_type,
13569 /* See if the default argument is valid. */
13570 default_argument
13573 /* Template parameter packs cannot have default
13574 arguments. */
13576 {
13579 "template parameter pack %qD cannot "
13581 identifier);
13582 else
13586 }
13588 }
13589 else
13592 /* Create the combined representation of the parameter and the
13593 default argument. */
13595 }
13601 }
13604 }
13606 /* Parse a template-id.
13608 template-id:
13609 template-name < template-argument-list [opt] >
13611 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13612 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13613 returned. Otherwise, if the template-name names a function, or set
13614 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13615 names a class, returns a TYPE_DECL for the specialization.
13617 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13618 uninstantiated templates. */
13620 static tree
13626 {
13628 tree templ;
13629 tree arguments;
13630 tree template_id;
13637 /* If the next token corresponds to a template-id, there is no need
13638 to reparse it. */
13641 {
13644 /* Get the stored value. */
13646 /* Perform any access checks that were deferred. */
13649 {
13654 tf_warning_or_error);
13655 }
13656 /* Return the stored value. */
13658 }
13660 /* Avoid performing name lookup if there is no possibility of
13661 finding a template-id. */
13664 && !cp_parser_nth_token_starts_template_argument_list_p
13666 {
13669 }
13671 /* Remember where the template-id starts. */
13677 /* Parse the template-name. */
13680 check_dependency_p,
13681 is_declaration,
13682 tag_type,
13685 {
13688 }
13690 /* If we find the sequence `[:' after a template-name, it's probably
13691 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13692 parse correctly the argument list. */
13699 {
13701 /* Change `:' into `::'. */
13703 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13704 CPP_LESS. */
13707 /* Parse the arguments. */
13710 {
13711 /* If we couldn't parse an argument list, then we revert our changes
13712 and return simply an error. Maybe this is not a template-id
13713 after all. */
13718 }
13719 /* Otherwise, emit an error about the invalid digraph, but continue
13720 parsing because we got our argument list. */
13723 {
13726 "%<<:%> is an alternate spelling for %<[%>."
13729 {
13731 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13734 }
13735 }
13736 }
13737 else
13738 {
13739 /* Look for the `<' that starts the template-argument-list. */
13741 {
13744 }
13745 /* Parse the arguments. */
13747 }
13749 /* Build a representation of the specialization. */
13752 TEMPLATE_ID_EXPR,
13756 {
13758 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13759 template (rather than some instantiation thereof) only if
13760 is not nested within some other construct. For example, in
13761 "template <typename T> void f(T) { A<T>::", A<T> is just an
13762 instantiation of A. */
13765 CPP_SCOPE));
13766 template_id
13768 }
13770 {
13772 }
13773 else
13774 {
13775 /* If it's not a class-template or a template-template, it should be
13776 a function-template. */
13782 }
13784 /* If parsing tentatively, replace the sequence of tokens that makes
13785 up the template-id with a CPP_TEMPLATE_ID token. That way,
13786 should we re-parse the token stream, we will not have to repeat
13787 the effort required to do the parse, nor will we issue duplicate
13788 error messages about problems during instantiation of the
13789 template. */
13791 /* Don't do this if we had a parse error in a declarator; re-parsing
13792 might succeed if a name changes meaning (60361). */
13796 {
13799 /* Reset the contents of the START_OF_ID token. */
13801 /* Retrieve any deferred checks. Do not pop this access checks yet
13802 so the memory will not be reclaimed during token replacing below. */
13808 /* Purge all subsequent tokens. */
13811 /* ??? Can we actually assume that, if template_id ==
13812 error_mark_node, we will have issued a diagnostic to the
13813 user, as opposed to simply marking the tentative parse as
13814 failed? */
13817 }
13821 }
13823 /* Parse a template-name.
13825 template-name:
13826 identifier
13828 The standard should actually say:
13830 template-name:
13831 identifier
13832 operator-function-id
13834 A defect report has been filed about this issue.
13836 A conversion-function-id cannot be a template name because they cannot
13837 be part of a template-id. In fact, looking at this code:
13839 a.operator K<int>()
13841 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13842 It is impossible to call a templated conversion-function-id with an
13843 explicit argument list, since the only allowed template parameter is
13844 the type to which it is converting.
13846 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13847 `template' keyword, in a construction like:
13849 T::template f<3>()
13851 In that case `f' is taken to be a template-name, even though there
13852 is no way of knowing for sure.
13854 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13855 name refers to a set of overloaded functions, at least one of which
13856 is a template, or an IDENTIFIER_NODE with the name of the template,
13857 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13858 names are looked up inside uninstantiated templates. */
13860 static tree
13867 {
13868 tree identifier;
13869 tree decl;
13870 tree fns;
13873 /* If the next token is `operator', then we have either an
13874 operator-function-id or a conversion-function-id. */
13876 {
13877 /* We don't know whether we're looking at an
13878 operator-function-id or a conversion-function-id. */
13880 /* Try an operator-function-id. */
13882 /* If that didn't work, try a conversion-function-id. */
13884 {
13887 }
13888 }
13889 /* Look for the identifier. */
13890 else
13893 /* If we didn't find an identifier, we don't have a template-id. */
13897 /* If the name immediately followed the `template' keyword, then it
13898 is a template-name. However, if the next token is not `<', then
13899 we do not treat it as a template-name, since it is not being used
13900 as part of a template-id. This enables us to handle constructs
13901 like:
13903 template <typename T> struct S { S(); };
13904 template <typename T> S<T>::S();
13906 correctly. We would treat `S' as a template -- if it were `S<T>'
13907 -- but we do not if there is no `<'. */
13911 {
13912 /* In a declaration, in a dependent context, we pretend that the
13913 "template" keyword was present in order to improve error
13914 recovery. For example, given:
13916 template <typename T> void f(T::X<int>);
13918 we want to treat "X<int>" as a template-id. */
13920 && !template_keyword_p
13922 && check_dependency_p
13924 /* Do not do this for dtors (or ctors), since they never
13925 need the template keyword before their name. */
13927 {
13930 /* Explain what went wrong. */
13932 identifier);
13935 /* If parsing tentatively, find the location of the "<" token. */
13938 /* Parse the template arguments so that we can issue error
13939 messages about them. */
13942 /* Skip tokens until we find a good place from which to
13943 continue parsing. */
13948 /* If parsing tentatively, permanently remove the
13949 template argument list. That will prevent duplicate
13950 error messages from being issued about the missing
13951 "template" keyword. */
13957 }
13959 /* If the "template" keyword is present, then there is generally
13960 no point in doing name-lookup, so we just return IDENTIFIER.
13961 But, if the qualifying scope is non-dependent then we can
13962 (and must) do name-lookup normally. */
13968 }
13970 /* Look up the name. */
13972 tag_type,
13975 check_dependency_p,
13979 /* If DECL is a template, then the name was a template-name. */
13981 ;
13982 else
13983 {
13986 /* The standard does not explicitly indicate whether a name that
13987 names a set of overloaded declarations, some of which are
13988 templates, is a template-name. However, such a name should
13989 be a template-name; otherwise, there is no way to form a
13990 template-id for the overloaded templates. */
13998 {
13999 /* The name does not name a template. */
14002 }
14003 }
14005 /* If DECL is dependent, and refers to a function, then just return
14006 its name; we will look it up again during template instantiation. */
14008 {
14012 }
14015 }
14017 /* Parse a template-argument-list.
14019 template-argument-list:
14020 template-argument ... [opt]
14021 template-argument-list , template-argument ... [opt]
14023 Returns a TREE_VEC containing the arguments. */
14025 static tree
14027 {
14032 tree vec;
14039 /* Even if the template-id appears in an integral
14040 constant-expression, the contents of the argument list do
14041 not. */
14047 /* Parse the arguments. */
14048 do
14049 {
14050 tree argument;
14053 /* Consume the comma. */
14056 /* Parse the template-argument. */
14059 /* If the next token is an ellipsis, we're expanding a template
14060 argument pack. */
14062 {
14064 {
14068 }
14069 /* Consume the `...' token. */
14072 /* Make the argument into a TYPE_PACK_EXPANSION or
14073 EXPR_PACK_EXPANSION. */
14075 }
14078 {
14082 {
14085 }
14086 else
14088 }
14090 }
14103 #ifdef ENABLE_CHECKING
14105 #endif
14107 }
14109 /* Parse a template-argument.
14111 template-argument:
14112 assignment-expression
14113 type-id
14114 id-expression
14116 The representation is that of an assignment-expression, type-id, or
14117 id-expression -- except that the qualified id-expression is
14118 evaluated, so that the value returned is either a DECL or an
14119 OVERLOAD.
14121 Although the standard says "assignment-expression", it forbids
14122 throw-expressions or assignments in the template argument.
14123 Therefore, we use "conditional-expression" instead. */
14125 static tree
14127 {
14128 tree argument;
14134 cp_id_kind idk;
14136 /* There's really no way to know what we're looking at, so we just
14137 try each alternative in order.
14139 [temp.arg]
14141 In a template-argument, an ambiguity between a type-id and an
14142 expression is resolved to a type-id, regardless of the form of
14143 the corresponding template-parameter.
14145 Therefore, we try a type-id first. */
14148 /* If there was no error parsing the type-id but the next token is a
14149 '>>', our behavior depends on which dialect of C++ we're
14150 parsing. In C++98, we probably found a typo for '> >'. But there
14151 are type-id which are also valid expressions. For instance:
14153 struct X { int operator >> (int); };
14154 template <int V> struct Foo {};
14155 Foo<X () >> 5> r;
14157 Here 'X()' is a valid type-id of a function type, but the user just
14158 wanted to write the expression "X() >> 5". Thus, we remember that we
14159 found a valid type-id, but we still try to parse the argument as an
14160 expression to see what happens.
14162 In C++0x, the '>>' will be considered two separate '>'
14163 tokens. */
14167 {
14170 }
14171 else
14172 {
14173 /* If the next token isn't a `,' or a `>', then this argument wasn't
14174 really finished. This means that the argument is not a valid
14175 type-id. */
14178 /* If that worked, we're done. */
14181 }
14182 /* We're still not sure what the argument will be. */
14184 /* Try a template. */
14192 /* If the next token isn't a `,' or a `>', then this argument wasn't
14193 really finished. */
14197 {
14198 /* Figure out what is being referred to. If the id-expression
14199 was for a class template specialization, then we will have a
14200 TYPE_DECL at this point. There is no need to do name lookup
14201 at this point in that case. */
14204 none_type,
14213 }
14216 /* It must be a non-type argument. There permitted cases are given
14217 in [temp.arg.nontype]:
14219 -- an integral constant-expression of integral or enumeration
14220 type; or
14222 -- the name of a non-type template-parameter; or
14224 -- the name of an object or function with external linkage...
14226 -- the address of an object or function with external linkage...
14228 -- a pointer to member... */
14229 /* Look for a non-type template parameter. */
14231 {
14243 }
14245 /* If the next token is "&", the argument must be the address of an
14246 object or function with external linkage. */
14249 {
14252 }
14253 /* See if we might have an id-expression. */
14260 {
14263 address_p,
14270 else
14271 {
14272 tree probe;
14275 {
14276 /* Strip the dereference temporarily. */
14279 }
14281 /* If we're in a template, we represent a qualified-id referring
14282 to a static data member as a SCOPE_REF even if the scope isn't
14283 dependent so that we can check access control later. */
14288 {
14289 /* A variable without external linkage might still be a
14290 valid constant-expression, so no error is issued here
14291 if the external-linkage check fails. */
14294 }
14296 /* All overloaded functions are allowed; if the external
14297 linkage test does not pass, an error will be issued
14298 later. */
14299 ;
14303 /* A pointer-to-member. */
14304 ;
14306 ;
14307 else
14311 {
14314 tf_warning_or_error);
14315 else
14318 }
14319 }
14320 }
14321 /* If the argument started with "&", there are no other valid
14322 alternatives at this point. */
14324 {
14327 }
14329 /* If the argument wasn't successfully parsed as a type-id followed
14330 by '>>', the argument can only be a constant expression now.
14331 Otherwise, we try parsing the constant-expression tentatively,
14332 because the argument could really be a type-id. */
14343 /* We did our best to parse the argument as a non type-id, but that
14344 was the only alternative that matched (albeit with a '>' after
14345 it). We can assume it's just a typo from the user, and a
14346 diagnostic will then be issued. */
14348 }
14350 /* Parse an explicit-instantiation.
14352 explicit-instantiation:
14353 template declaration
14355 Although the standard says `declaration', what it really means is:
14357 explicit-instantiation:
14358 template decl-specifier-seq [opt] declarator [opt] ;
14360 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14361 supposed to be allowed. A defect report has been filed about this
14362 issue.
14364 GNU Extension:
14366 explicit-instantiation:
14367 storage-class-specifier template
14368 decl-specifier-seq [opt] declarator [opt] ;
14369 function-specifier template
14370 decl-specifier-seq [opt] declarator [opt] ; */
14372 static void
14374 {
14376 cp_decl_specifier_seq decl_specifiers;
14381 /* Look for an (optional) storage-class-specifier or
14382 function-specifier. */
14384 {
14385 extension_specifier
14388 extension_specifier
14391 }
14393 /* Look for the `template' keyword. */
14395 /* Let the front end know that we are processing an explicit
14396 instantiation. */
14398 /* [temp.explicit] says that we are supposed to ignore access
14399 control while processing explicit instantiation directives. */
14401 /* Parse a decl-specifier-seq. */
14403 CP_PARSER_FLAGS_OPTIONAL,
14406 /* If there was exactly one decl-specifier, and it declared a class,
14407 and there's no declarator, then we have an explicit type
14408 instantiation. */
14410 {
14411 tree type;
14415 /* Turn access control back on for names used during
14416 template instantiation. */
14421 }
14422 else
14423 {
14425 tree decl;
14427 /* Parse the declarator. */
14428 declarator
14439 {
14442 "explicit instantiation shall not use"
14446 "explicit instantiation shall not use"
14451 /* Turn access control back on for names used during
14452 template instantiation. */
14454 /* Do the explicit instantiation. */
14456 }
14457 else
14458 {
14460 /* Skip the body of the explicit instantiation. */
14462 }
14463 }
14464 /* We're done with the instantiation. */
14470 }
14472 /* Parse an explicit-specialization.
14474 explicit-specialization:
14475 template < > declaration
14477 Although the standard says `declaration', what it really means is:
14479 explicit-specialization:
14480 template <> decl-specifier [opt] init-declarator [opt] ;
14481 template <> function-definition
14482 template <> explicit-specialization
14483 template <> template-declaration */
14485 static void
14487 {
14491 /* Look for the `template' keyword. */
14493 /* Look for the `<'. */
14495 /* Look for the `>'. */
14497 /* We have processed another parameter list. */
14499 /* [temp]
14501 A template ... explicit specialization ... shall not have C
14502 linkage. */
14504 {
14506 /* Give it C++ linkage to avoid confusing other parts of the
14507 front end. */
14510 }
14511 else
14513 /* Let the front end know that we are beginning a specialization. */
14515 {
14518 }
14520 /* If the next keyword is `template', we need to figure out whether
14521 or not we're looking a template-declaration. */
14523 {
14528 else
14530 }
14531 else
14532 /* Parse the dependent declaration. */
14538 /* We're done with the specialization. */
14540 /* For the erroneous case of a template with C linkage, we pushed an
14541 implicit C++ linkage scope; exit that scope now. */
14544 /* We're done with this parameter list. */
14546 }
14548 /* Parse a type-specifier.
14550 type-specifier:
14551 simple-type-specifier
14552 class-specifier
14553 enum-specifier
14554 elaborated-type-specifier
14555 cv-qualifier
14557 GNU Extension:
14559 type-specifier:
14560 __complex__
14562 Returns a representation of the type-specifier. For a
14563 class-specifier, enum-specifier, or elaborated-type-specifier, a
14564 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14566 The parser flags FLAGS is used to control type-specifier parsing.
14568 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14569 in a decl-specifier-seq.
14571 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14572 class-specifier, enum-specifier, or elaborated-type-specifier, then
14573 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14574 if a type is declared; 2 if it is defined. Otherwise, it is set to
14575 zero.
14577 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14578 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14579 is set to FALSE. */
14581 static tree
14583 cp_parser_flags flags,
14588 {
14594 /* Assume this type-specifier does not declare a new type. */
14597 /* And that it does not specify a cv-qualifier. */
14600 /* Peek at the next token. */
14603 /* If we're looking at a keyword, we can use that to guide the
14604 production we choose. */
14607 {
14612 /* Look for the enum-specifier. */
14614 /* If that worked, we're done. */
14616 {
14621 type_spec,
14622 token,
14625 }
14626 else
14629 /* Any of these indicate either a class-specifier, or an
14630 elaborated-type-specifier. */
14637 /* Parse tentatively so that we can back up if we don't find a
14638 class-specifier. */
14640 /* Look for the class-specifier. */
14643 /* If that worked, we're done. */
14645 {
14650 type_spec,
14651 token,
14654 }
14656 /* Fall through. */
14657 elaborated_type_specifier:
14658 /* We're declaring (not defining) a class or enum. */
14662 /* Fall through. */
14664 /* Look for an elaborated-type-specifier. */
14665 type_spec
14666 = (cp_parser_elaborated_type_specifier
14669 is_declaration));
14672 type_spec,
14673 token,
14696 /* The `__complex__' keyword is a GNU extension. */
14702 }
14704 /* Handle simple keywords. */
14706 {
14708 {
14711 }
14713 }
14715 /* If we do not already have a type-specifier, assume we are looking
14716 at a simple-type-specifier. */
14718 decl_specs,
14719 flags);
14721 /* If we didn't find a type-specifier, and a type-specifier was not
14722 optional in this context, issue an error message. */
14724 {
14727 }
14730 }
14732 /* Parse a simple-type-specifier.
14734 simple-type-specifier:
14735 :: [opt] nested-name-specifier [opt] type-name
14736 :: [opt] nested-name-specifier template template-id
14737 char
14738 wchar_t
14739 bool
14740 short
14741 int
14742 long
14743 signed
14744 unsigned
14745 float
14746 double
14747 void
14749 C++0x Extension:
14751 simple-type-specifier:
14752 auto
14753 decltype ( expression )
14754 char16_t
14755 char32_t
14756 __underlying_type ( type-id )
14758 GNU Extension:
14760 simple-type-specifier:
14761 __int128
14762 __typeof__ unary-expression
14763 __typeof__ ( type-id )
14764 __typeof__ ( type-id ) { initializer-list , [opt] }
14766 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14767 appropriately updated. */
14769 static tree
14772 cp_parser_flags flags)
14773 {
14778 /* Peek at the next token. */
14781 /* If we're looking at a keyword, things are easy. */
14783 {
14818 {
14821 }
14850 {
14854 {
14857 "use of %<auto%> in lambda parameter declaration "
14858 "only available with "
14860 }
14863 "use of %<auto%> in parameter declaration "
14864 "only available with "
14866 else
14868 "ISO C++ forbids use of %<auto%> in parameter "
14870 }
14871 else
14876 /* Since DR 743, decltype can either be a simple-type-specifier by
14877 itself or begin a nested-name-specifier. Parsing it will replace
14878 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14879 handling below decide what to do. */
14885 /* Consume the `typeof' token. */
14887 /* Parse the operand to `typeof'. */
14889 /* If it is not already a TYPE, take its type. */
14895 token,
14904 token,
14914 token,
14919 }
14921 /* If token is an already-parsed decltype not followed by ::,
14922 it's a simple-type-specifier. */
14925 {
14929 token,
14933 }
14935 /* If the type-specifier was for a built-in type, we're done. */
14937 {
14938 /* Record the type. */
14945 type,
14946 token,
14951 /* Consume the token. */
14954 /* There is no valid C++ program where a non-template type is
14955 followed by a "<". That usually indicates that the user thought
14956 that the type was a template. */
14961 }
14963 /* The type-specifier must be a user-defined type. */
14965 {
14969 /* Don't gobble tokens or issue error messages if this is an
14970 optional type-specifier. */
14974 /* Look for the optional `::' operator. */
14975 global_p
14979 /* Look for the nested-name specifier. */
14980 qualified_p
14988 /* If we have seen a nested-name-specifier, and the next token
14989 is `template', then we are using the template-id production. */
14992 {
14993 /* Look for the template-id. */
14997 none_type,
14999 /* If the template-id did not name a type, we are out of
15000 luck. */
15002 {
15005 }
15006 }
15007 /* Otherwise, look for a type-name. */
15008 else
15010 /* Keep track of all name-lookups performed in class scopes. */
15012 && !global_p
15013 && !qualified_p
15017 /* If it didn't work out, we don't have a TYPE. */
15023 token,
15025 }
15027 /* If we didn't get a type-name, issue an error message. */
15029 {
15032 }
15035 {
15036 /* See if TYPE is an Objective-C type, and if so, parse and
15037 accept any protocol references following it. Do this before
15038 the cp_parser_check_for_invalid_template_id() call, because
15039 Objective-C types can be followed by '<...>' which would
15040 enclose protocol names rather than template arguments, and so
15041 everything is fine. */
15044 {
15048 /* Clobber the "unqualified" type previously entered into
15049 DECL_SPECS with the new, improved protocol-qualified version. */
15054 }
15056 /* There is no valid C++ program where a non-template type is
15057 followed by a "<". That usually indicates that the user
15058 thought that the type was a template. */
15060 none_type,
15062 }
15065 }
15067 /* Parse a type-name.
15069 type-name:
15070 class-name
15071 enum-name
15072 typedef-name
15073 simple-template-id [in c++0x]
15075 enum-name:
15076 identifier
15078 typedef-name:
15079 identifier
15081 Returns a TYPE_DECL for the type. */
15083 static tree
15085 {
15086 tree type_decl;
15088 /* We can't know yet whether it is a class-name or not. */
15090 /* Try a class-name. */
15094 none_type,
15098 /* If it's not a class-name, keep looking. */
15100 {
15102 /* It must be a typedef-name or an enum-name. */
15106 /* It is either a simple-template-id representing an
15107 instantiation of an alias template... */
15111 none_type,
15113 /* Note that this must be an instantiation of an alias template
15114 because [temp.names]/6 says:
15116 A template-id that names an alias template specialization
15117 is a type-name.
15119 Whereas [temp.names]/7 says:
15121 A simple-template-id that names a class template
15122 specialization is a class-name. */
15127 else
15131 /* ... Or a typedef-name or an enum-name. */
15133 }
15136 }
15138 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15140 enum-name:
15141 identifier
15143 typedef-name:
15144 identifier
15146 Returns a TYPE_DECL for the type. */
15148 static tree
15150 {
15151 tree type_decl;
15152 tree identifier;
15159 /* Look up the type-name. */
15166 {
15167 /* See if this is an Objective-C type. */
15172 }
15174 /* Issue an error if we did not find a type-name. */
15176 /* In Objective-C, we have the complication that class names are
15177 normally type names and start declarations (eg, the
15178 "NSObject" in "NSObject *object;"), but can be used in an
15179 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15180 is an expression. So, a classname followed by a dot is not a
15181 valid type-name. */
15184 {
15189 }
15190 /* Remember that the name was used in the definition of the
15191 current class so that we can check later to see if the
15192 meaning would have been different after the class was
15193 entirely defined. */
15199 }
15201 /* Parse an elaborated-type-specifier. Note that the grammar given
15202 here incorporates the resolution to DR68.
15204 elaborated-type-specifier:
15205 class-key :: [opt] nested-name-specifier [opt] identifier
15206 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15207 enum-key :: [opt] nested-name-specifier [opt] identifier
15208 typename :: [opt] nested-name-specifier identifier
15209 typename :: [opt] nested-name-specifier template [opt]
15210 template-id
15212 GNU extension:
15214 elaborated-type-specifier:
15215 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15216 class-key attributes :: [opt] nested-name-specifier [opt]
15217 template [opt] template-id
15218 enum attributes :: [opt] nested-name-specifier [opt] identifier
15220 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15221 declared `friend'. If IS_DECLARATION is TRUE, then this
15222 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15223 something is being declared.
15225 Returns the TYPE specified. */
15227 static tree
15231 {
15233 tree identifier;
15236 tree globalscope;
15239 /* See if we're looking at the `enum' keyword. */
15241 {
15242 /* Consume the `enum' token. */
15244 /* Remember that it's an enumeration type. */
15246 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15247 enums) is used here. */
15250 {
15254 /* Consume the `struct' or `class' and parse it anyway. */
15256 }
15257 /* Parse the attributes. */
15259 }
15260 /* Or, it might be `typename'. */
15262 RID_TYPENAME))
15263 {
15264 /* Consume the `typename' token. */
15266 /* Remember that it's a `typename' type. */
15268 }
15269 /* Otherwise it must be a class-key. */
15270 else
15271 {
15275 /* Parse the attributes. */
15277 }
15279 /* Look for the `::' operator. */
15282 /* Look for the nested-name-specifier. */
15284 {
15289 is_declaration))
15291 }
15292 else
15293 /* Even though `typename' is not present, the proposed resolution
15294 to Core Issue 180 says that in `class A<T>::B', `B' should be
15295 considered a type-name, even if `A<T>' is dependent. */
15300 is_declaration);
15301 /* For everything but enumeration types, consider a template-id.
15302 For an enumeration type, consider only a plain identifier. */
15304 {
15306 tree decl;
15308 /* Allow the `template' keyword. */
15310 /* If we didn't see `template', we don't know if there's a
15311 template-id or not. */
15314 /* Parse the template-id. */
15318 tag_type,
15319 is_declaration);
15320 /* If we didn't find a template-id, look for an ordinary
15321 identifier. */
15323 ;
15324 /* We can get here when cp_parser_template_id, called by
15325 cp_parser_class_name with tag_type == none_type, succeeds
15326 and caches a BASELINK. Then, when called again here,
15327 instead of failing and returning an error_mark_node
15328 returns it (see template/typename17.C in C++11).
15329 ??? Could we diagnose this earlier? */
15331 {
15334 }
15335 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15336 in effect, then we must assume that, upon instantiation, the
15337 template will correspond to a class. */
15341 typename_type,
15343 /* If the `typename' keyword is in effect and DECL is not a type
15344 decl, then type is non existent. */
15346 ;
15352 }
15355 {
15360 {
15363 }
15365 /* For a `typename', we needn't call xref_tag. */
15371 /* Template parameter lists apply only if we are not within a
15372 function parameter list. */
15373 bool template_parm_lists_apply
15382 /* Look up a qualified name in the usual way. */
15384 {
15385 tree decl;
15386 tree ambiguous_decls;
15389 tag_type,
15396 /* If the lookup was ambiguous, an error will already have been
15397 issued. */
15401 /* If we are parsing friend declaration, DECL may be a
15402 TEMPLATE_DECL tree node here. However, we need to check
15403 whether this TEMPLATE_DECL results in valid code. Consider
15404 the following example:
15406 namespace N {
15407 template <class T> class C {};
15408 }
15409 class X {
15410 template <class T> friend class N::C; // #1, valid code
15411 };
15412 template <class T> class Y {
15413 friend class N::C; // #2, invalid code
15414 };
15416 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15417 name lookup of `N::C'. We see that friend declaration must
15418 be template for the code to be valid. Note that
15419 processing_template_decl does not work here since it is
15420 always 1 for the above two cases. */
15422 decl = (cp_parser_maybe_treat_template_as_class
15427 {
15429 identifier,
15432 }
15435 {
15439 allow_template);
15443 }
15445 /* Forward declarations of nested types, such as
15447 class C1::C2;
15448 class C1::C2::C3;
15450 are invalid unless all components preceding the final '::'
15451 are complete. If all enclosing types are complete, these
15452 declarations become merely pointless.
15454 Invalid forward declarations of nested types are errors
15455 caught elsewhere in parsing. Those that are pointless arrive
15456 here. */
15463 }
15464 else
15465 {
15466 /* An elaborated-type-specifier sometimes introduces a new type and
15467 sometimes names an existing type. Normally, the rule is that it
15468 introduces a new type only if there is not an existing type of
15469 the same name already in scope. For example, given:
15471 struct S {};
15472 void f() { struct S s; }
15474 the `struct S' in the body of `f' is the same `struct S' as in
15475 the global scope; the existing definition is used. However, if
15476 there were no global declaration, this would introduce a new
15477 local class named `S'.
15479 An exception to this rule applies to the following code:
15481 namespace N { struct S; }
15483 Here, the elaborated-type-specifier names a new type
15484 unconditionally; even if there is already an `S' in the
15485 containing scope this declaration names a new type.
15486 This exception only applies if the elaborated-type-specifier
15487 forms the complete declaration:
15489 [class.name]
15491 A declaration consisting solely of `class-key identifier ;' is
15492 either a redeclaration of the name in the current scope or a
15493 forward declaration of the identifier as a class name. It
15494 introduces the name into the current scope.
15496 We are in this situation precisely when the next token is a `;'.
15498 An exception to the exception is that a `friend' declaration does
15499 *not* name a new type; i.e., given:
15501 struct S { friend struct T; };
15503 `T' is not a new type in the scope of `S'.
15505 Also, `new struct S' or `sizeof (struct S)' never results in the
15506 definition of a new type; a new type can only be declared in a
15507 declaration context. */
15509 tag_scope ts;
15513 /* Friends have special name lookup rules. */
15517 CPP_SEMICOLON))
15518 /* This is a `class-key identifier ;' */
15520 else
15523 template_p =
15524 (template_parm_lists_apply
15527 /* An unqualified name was used to reference this type, so
15528 there were no qualifying templates. */
15536 }
15537 }
15542 /* Allow attributes on forward declarations of classes. */
15544 {
15554 else
15557 }
15560 {
15561 /* Indicate whether this class was declared as a `class' or as a
15562 `struct'. */
15566 }
15568 /* A "<" cannot follow an elaborated type specifier. If that
15569 happens, the user was probably trying to form a template-id. */
15574 }
15576 /* Parse an enum-specifier.
15578 enum-specifier:
15579 enum-head { enumerator-list [opt] }
15580 enum-head { enumerator-list , } [C++0x]
15582 enum-head:
15583 enum-key identifier [opt] enum-base [opt]
15584 enum-key nested-name-specifier identifier enum-base [opt]
15586 enum-key:
15587 enum
15588 enum class [C++0x]
15589 enum struct [C++0x]
15591 enum-base: [C++0x]
15592 : type-specifier-seq
15594 opaque-enum-specifier:
15595 enum-key identifier enum-base [opt] ;
15597 GNU Extensions:
15598 enum-key attributes[opt] identifier [opt] enum-base [opt]
15599 { enumerator-list [opt] }attributes[opt]
15600 enum-key attributes[opt] identifier [opt] enum-base [opt]
15601 { enumerator-list, }attributes[opt] [C++0x]
15603 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15604 if the token stream isn't an enum-specifier after all. */
15606 static tree
15608 {
15609 tree identifier;
15611 tree prev_scope;
15613 tree attributes;
15626 /* Parse tentatively so that we can back up if we don't find a
15627 enum-specifier. */
15630 /* Caller guarantees that the current token is 'enum', an identifier
15631 possibly follows, and the token after that is an opening brace.
15632 If we don't have an identifier, fabricate an anonymous name for
15633 the enumeration being defined. */
15636 /* Parse the "class" or "struct", which indicates a scoped
15637 enumeration type in C++0x. */
15640 {
15644 /* Consume the `struct' or `class' token. */
15648 }
15652 /* Clear the qualification. */
15657 /* Figure out in what scope the declaration is being placed. */
15663 nested_name_specifier
15671 {
15672 tree name;
15676 enum_type,
15681 input_location);
15683 {
15686 {
15687 /* Are template enums allowed in ISO? */
15691 /* ignore a typename reference, for it will be solved by name
15692 in start_enum. */
15694 }
15695 }
15698 else
15701 }
15702 else
15703 {
15706 else
15707 {
15713 }
15714 }
15717 /* Check for the `:' that denotes a specified underlying type in C++0x.
15718 Note that a ':' could also indicate a bitfield width, however. */
15720 {
15721 cp_decl_specifier_seq type_specifiers;
15723 /* Consume the `:'. */
15726 /* Parse the type-specifier-seq. */
15731 /* At this point this is surely not elaborated type specifier. */
15740 /* If that didn't work, stop. */
15742 {
15748 }
15749 }
15751 /* Look for the `{' but don't consume it yet. */
15753 {
15755 {
15758 {
15761 }
15762 }
15763 /* An opaque-enum-specifier must have a ';' here. */
15766 {
15769 {
15772 }
15773 }
15774 }
15780 {
15782 {
15786 }
15788 {
15790 }
15791 }
15793 /* Issue an error message if type-definitions are forbidden here. */
15796 else
15797 /* Create the new type. We do this before consuming the opening
15798 brace so the enum will be recorded as being on the line of its
15799 tag (or the 'enum' keyword, if there is no tag). */
15803 /* If the next token is not '{' it is an opaque-enum-specifier or an
15804 elaborated-type-specifier. */
15806 {
15810 {
15811 /* The following catches invalid code such as:
15812 enum class S<int>::E { A, B, C }; */
15820 {
15824 nested_name_specifier);
15826 }
15827 /* If that scope does not contain the scope in which the
15828 class was originally declared, the program is invalid. */
15830 nested_name_specifier))
15831 {
15834 "declaration of %qD in namespace %qD which does not "
15837 else
15839 "declaration of %qD in %qD which does not "
15843 }
15844 }
15849 /* Consume the opening brace. */
15856 {
15860 }
15861 else
15862 {
15868 }
15872 /* If the next token is not '}', then there are some enumerators. */
15874 {
15878 }
15879 else
15882 /* Consume the final '}'. */
15888 }
15889 else
15890 {
15891 /* If a ';' follows, then it is an opaque-enum-specifier
15892 and additional restrictions apply. */
15894 {
15901 }
15902 }
15904 /* Look for trailing attributes to apply to this enumeration, and
15905 apply them if appropriate. */
15907 {
15911 trailing_attr,
15913 }
15915 /* Finish up the enumeration. */
15917 {
15922 }
15925 {
15927 {
15930 }
15932 {
15934 }
15935 }
15936 out:
15939 }
15941 /* Parse an enumerator-list. The enumerators all have the indicated
15942 TYPE.
15944 enumerator-list:
15945 enumerator-definition
15946 enumerator-list , enumerator-definition */
15948 static void
15950 {
15952 {
15953 /* Parse an enumerator-definition. */
15956 /* If the next token is not a ',', we've reached the end of
15957 the list. */
15960 /* Otherwise, consume the `,' and keep going. */
15962 /* If the next token is a `}', there is a trailing comma. */
15964 {
15969 }
15970 }
15971 }
15973 /* Parse an enumerator-definition. The enumerator has the indicated
15974 TYPE.
15976 enumerator-definition:
15977 enumerator
15978 enumerator = constant-expression
15980 enumerator:
15981 identifier */
15983 static void
15985 {
15986 tree identifier;
15987 tree value;
15988 location_t loc;
15990 /* Save the input location because we are interested in the location
15991 of the identifier and not the location of the explicit value. */
15994 /* Look for the identifier. */
15999 /* If the next token is an '=', then there is an explicit value. */
16001 {
16002 /* Consume the `=' token. */
16004 /* Parse the value. */
16006 }
16007 else
16010 /* If we are processing a template, make sure the initializer of the
16011 enumerator doesn't contain any bare template parameter pack. */
16015 /* integral_constant_value will pull out this expression, so make sure
16016 it's folded as appropriate. */
16019 /* Create the enumerator. */
16021 }
16023 /* Parse a namespace-name.
16025 namespace-name:
16026 original-namespace-name
16027 namespace-alias
16029 Returns the NAMESPACE_DECL for the namespace. */
16031 static tree
16033 {
16034 tree identifier;
16035 tree namespace_decl;
16039 /* Get the name of the namespace. */
16044 /* Look up the identifier in the currently active scope. Look only
16045 for namespaces, due to:
16047 [basic.lookup.udir]
16049 When looking up a namespace-name in a using-directive or alias
16050 definition, only namespace names are considered.
16052 And:
16054 [basic.lookup.qual]
16056 During the lookup of a name preceding the :: scope resolution
16057 operator, object, function, and enumerator names are ignored.
16059 (Note that cp_parser_qualifying_entity only calls this
16060 function if the token after the name is the scope resolution
16061 operator.) */
16063 none_type,
16069 /* If it's not a namespace, issue an error. */
16072 {
16077 }
16080 }
16082 /* Parse a namespace-definition.
16084 namespace-definition:
16085 named-namespace-definition
16086 unnamed-namespace-definition
16088 named-namespace-definition:
16089 original-namespace-definition
16090 extension-namespace-definition
16092 original-namespace-definition:
16093 namespace identifier { namespace-body }
16095 extension-namespace-definition:
16096 namespace original-namespace-name { namespace-body }
16098 unnamed-namespace-definition:
16099 namespace { namespace-body } */
16101 static void
16103 {
16110 {
16114 }
16115 else
16118 /* Look for the `namespace' keyword. */
16121 /* Get the name of the namespace. We do not attempt to distinguish
16122 between an original-namespace-definition and an
16123 extension-namespace-definition at this point. The semantic
16124 analysis routines are responsible for that. */
16127 else
16130 /* Parse any specified attributes. */
16133 /* Look for the `{' to start the namespace. */
16135 /* Start the namespace. */
16138 /* "inline namespace" is equivalent to a stub namespace definition
16139 followed by a strong using directive. */
16141 {
16143 /* Set up namespace association. */
16147 /* Import the contents of the inline namespace. */
16151 }
16155 /* Parse the body of the namespace. */
16161 /* Finish the namespace. */
16163 /* Look for the final `}'. */
16165 }
16167 /* Parse a namespace-body.
16169 namespace-body:
16170 declaration-seq [opt] */
16172 static void
16174 {
16176 }
16178 /* Parse a namespace-alias-definition.
16180 namespace-alias-definition:
16181 namespace identifier = qualified-namespace-specifier ; */
16183 static void
16185 {
16186 tree identifier;
16187 tree namespace_specifier;
16191 /* Look for the `namespace' keyword. */
16193 /* Look for the identifier. */
16197 /* Look for the `=' token. */
16200 {
16202 /* Skip the definition. */
16207 }
16209 /* Look for the qualified-namespace-specifier. */
16210 namespace_specifier
16212 /* Look for the `;' token. */
16215 /* Register the alias in the symbol table. */
16217 }
16219 /* Parse a qualified-namespace-specifier.
16221 qualified-namespace-specifier:
16222 :: [opt] nested-name-specifier [opt] namespace-name
16224 Returns a NAMESPACE_DECL corresponding to the specified
16225 namespace. */
16227 static tree
16229 {
16230 /* Look for the optional `::'. */
16234 /* Look for the optional nested-name-specifier. */
16242 }
16244 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16245 access declaration.
16247 using-declaration:
16248 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16249 using :: unqualified-id ;
16251 access-declaration:
16252 qualified-id ;
16254 */
16256 static bool
16259 {
16263 tree decl;
16264 tree identifier;
16265 tree qscope;
16270 {
16273 }
16274 else
16275 {
16276 /* Look for the `using' keyword. */
16279 /* Peek at the next token. */
16281 /* See if it's `typename'. */
16283 {
16284 /* Remember that we've seen it. */
16286 /* Consume the `typename' token. */
16288 }
16289 }
16291 /* Look for the optional global scope qualification. */
16292 global_scope_p
16297 /* If we saw `typename', or didn't see `::', then there must be a
16298 nested-name-specifier present. */
16300 {
16306 {
16309 }
16310 }
16311 /* Otherwise, we could be in either of the two productions. In that
16312 case, treat the nested-name-specifier as optional. */
16313 else
16325 /* Something has already gone wrong; there's no need to parse
16326 further. Since an error has occurred, the return value of
16327 cp_parser_parse_definitely will be false, as required. */
16331 /* Parse the unqualified-id. */
16339 {
16344 }
16346 /* The function we call to handle a using-declaration is different
16347 depending on what scope we are in. */
16349 ;
16352 /* [namespace.udecl]
16354 A using declaration shall not name a template-id. */
16357 else
16358 {
16360 {
16361 /* Create the USING_DECL. */
16368 {
16371 }
16372 else
16373 /* Add it to the list of members in this class. */
16375 }
16376 else
16377 {
16379 identifier,
16386 {
16389 }
16392 else
16394 }
16395 }
16397 /* Look for the final `;'. */
16402 "access declarations are deprecated "
16403 "in favour of using-declarations; "
16407 }
16409 /* Parse an alias-declaration.
16411 alias-declaration:
16412 using identifier attribute-specifier-seq [opt] = type-id */
16414 static tree
16416 {
16418 location_t id_location;
16420 cp_decl_specifier_seq decl_specs;
16424 /* Look for the `using' keyword. */
16425 cp_token *using_token
16447 /* Now we are going to parse the type-id of the declaration. */
16449 /*
16450 [dcl.type]/3 says:
16452 "A type-specifier-seq shall not define a class or enumeration
16453 unless it appears in the type-id of an alias-declaration (7.1.3) that
16454 is not the declaration of a template-declaration."
16456 In other words, if we currently are in an alias template, the
16457 type-id should not define a type.
16459 So let's set parser->type_definition_forbidden_message in that
16460 case; cp_parser_check_type_definition (called by
16461 cp_parser_class_specifier) will then emit an error if a type is
16462 defined in the type-id. */
16464 {
16468 }
16472 /* Restore the error message if need be. */
16478 {
16481 }
16483 /* A typedef-name can also be introduced by an alias-declaration. The
16484 identifier following the using keyword becomes a typedef-name. It has
16485 the same semantics as if it were introduced by the typedef
16486 specifier. In particular, it does not define a new type and it shall
16487 not appear in the type-id. */
16492 {
16495 ds_attribute,
16496 attrs_token);
16497 }
16499 ds_typedef,
16500 using_token);
16502 ds_alias,
16503 using_token);
16512 else
16523 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16524 added into the symbol table; otherwise, return the TYPE_DECL. */
16528 {
16532 }
16535 }
16537 /* Parse a using-directive.
16539 using-directive:
16540 using namespace :: [opt] nested-name-specifier [opt]
16541 namespace-name ; */
16543 static void
16545 {
16546 tree namespace_decl;
16547 tree attribs;
16549 /* Look for the `using' keyword. */
16551 /* And the `namespace' keyword. */
16553 /* Look for the optional `::' operator. */
16555 /* And the optional nested-name-specifier. */
16561 /* Get the namespace being used. */
16563 /* And any specified attributes. */
16565 /* Update the symbol table. */
16567 /* Look for the final `;'. */
16569 }
16571 /* Parse an asm-definition.
16573 asm-definition:
16574 asm ( string-literal ) ;
16576 GNU Extension:
16578 asm-definition:
16579 asm volatile [opt] ( string-literal ) ;
16580 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16581 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16582 : asm-operand-list [opt] ) ;
16583 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16584 : asm-operand-list [opt]
16585 : asm-clobber-list [opt] ) ;
16586 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16587 : asm-clobber-list [opt]
16588 : asm-goto-list ) ; */
16590 static void
16592 {
16593 tree string;
16598 tree asm_stmt;
16606 /* Look for the `asm' keyword. */
16613 /* See if the next token is `volatile'. */
16616 {
16617 /* Remember that we saw the `volatile' keyword. */
16619 /* Consume the token. */
16621 }
16625 {
16626 /* Remember that we saw the `goto' keyword. */
16628 /* Consume the token. */
16630 }
16631 /* Look for the opening `('. */
16634 /* Look for the string. */
16637 {
16641 }
16643 /* If we're allowing GNU extensions, check for the extended assembly
16644 syntax. Unfortunately, the `:' tokens need not be separated by
16645 a space in C, and so, for compatibility, we tolerate that here
16646 too. Doing that means that we have to treat the `::' operator as
16647 two `:' tokens. */
16652 {
16657 /* The extended syntax was used. */
16660 /* Look for outputs. */
16662 {
16663 /* Consume the `:'. */
16665 /* Parse the output-operands. */
16667 CPP_COLON)
16669 CPP_SCOPE)
16671 CPP_CLOSE_PAREN)
16677 }
16678 /* If the next token is `::', there are no outputs, and the
16679 next token is the beginning of the inputs. */
16681 /* The inputs are coming next. */
16684 /* Look for inputs. */
16687 {
16688 /* Consume the `:' or `::'. */
16690 /* Parse the output-operands. */
16692 CPP_COLON)
16694 CPP_SCOPE)
16696 CPP_CLOSE_PAREN))
16701 }
16703 /* The clobbers are coming next. */
16706 /* Look for clobbers. */
16709 {
16711 /* Consume the `:' or `::'. */
16713 /* Parse the clobbers. */
16715 CPP_COLON)
16717 CPP_CLOSE_PAREN))
16719 }
16722 /* The labels are coming next. */
16725 /* Look for labels. */
16728 {
16730 /* Consume the `:' or `::'. */
16732 /* Parse the labels. */
16734 }
16738 }
16742 /* Look for the closing `)'. */
16750 {
16751 /* Create the ASM_EXPR. */
16753 {
16756 /* If the extended syntax was not used, mark the ASM_EXPR. */
16758 {
16764 }
16765 }
16766 else
16768 }
16769 }
16771 /* Declarators [gram.dcl.decl] */
16773 /* Parse an init-declarator.
16775 init-declarator:
16776 declarator initializer [opt]
16778 GNU Extension:
16780 init-declarator:
16781 declarator asm-specification [opt] attributes [opt] initializer [opt]
16783 function-definition:
16784 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16785 function-body
16786 decl-specifier-seq [opt] declarator function-try-block
16788 GNU Extension:
16790 function-definition:
16791 __extension__ function-definition
16793 TM Extension:
16795 function-definition:
16796 decl-specifier-seq [opt] declarator function-transaction-block
16798 The DECL_SPECIFIERS apply to this declarator. Returns a
16799 representation of the entity declared. If MEMBER_P is TRUE, then
16800 this declarator appears in a class scope. The new DECL created by
16801 this declarator is returned.
16803 The CHECKS are access checks that should be performed once we know
16804 what entity is being declared (and, therefore, what classes have
16805 befriended it).
16807 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16808 for a function-definition here as well. If the declarator is a
16809 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16810 be TRUE upon return. By that point, the function-definition will
16811 have been completely parsed.
16813 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16814 is FALSE.
16816 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16817 parsed declaration if it is an uninitialized single declarator not followed
16818 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16819 if present, will not be consumed. If returned, this declarator will be
16820 created with SD_INITIALIZED but will not call cp_finish_decl. */
16822 static tree
16831 {
16835 tree prefix_attributes;
16837 tree asm_specification;
16838 tree initializer;
16840 tree scope;
16842 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16843 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16844 "(...)". */
16854 /* Gather the attributes that were provided with the
16855 decl-specifiers. */
16858 /* Assume that this is not the declarator for a function
16859 definition. */
16863 /* Default arguments are only permitted for function parameters. */
16867 /* Defer access checks while parsing the declarator; we cannot know
16868 what names are accessible until we know what is being
16869 declared. */
16872 /* Parse the declarator. */
16874 declarator
16879 /* Gather up the deferred checks. */
16884 /* If the DECLARATOR was erroneous, there's no need to go
16885 further. */
16889 /* Check that the number of template-parameter-lists is OK. */
16899 /* Figure out what scope the entity declared by the DECLARATOR is
16900 located in. `grokdeclarator' sometimes changes the scope, so
16901 we compute it now. */
16904 /* Perform any lookups in the declared type which were thought to be
16905 dependent, but are not in the scope of the declarator. */
16906 decl_specifiers->type
16909 /* If we're allowing GNU extensions, look for an
16910 asm-specification. */
16912 {
16913 /* Look for an asm-specification. */
16916 }
16917 else
16920 /* Look for attributes. */
16924 /* Peek at the next token. */
16930 {
16931 /* Check to see if the token indicates the start of a
16932 function-definition. */
16934 {
16936 {
16937 /* If a function-definition should not appear here, issue an
16938 error message. */
16942 }
16944 location_t func_brace_location
16947 /* Neither attributes nor an asm-specification are allowed
16948 on a function-definition. */
16951 "an asm-specification is not allowed "
16955 "attributes are not allowed "
16957 /* This is a function-definition. */
16960 /* Parse the function definition. */
16963 decl_specifiers,
16964 declarator,
16965 prefix_attributes);
16966 else
16967 decl =
16968 (cp_parser_function_definition_from_specifiers_and_declarator
16972 {
16973 /* This is where the prologue starts... */
16976 }
16979 }
16980 }
16982 {
16983 /* A non-template declaration involving a function parameter list
16984 containing an implicit template parameter will be made into a
16985 template. If the resulting declaration is not going to be an
16986 actual function then finish the template scope here to prevent it.
16987 An error message will be issued once we have a decl to talk about.
16989 FIXME probably we should do type deduction rather than create an
16990 implicit template, but the standard currently doesn't allow it. */
16993 }
16995 /* [dcl.dcl]
16997 Only in function declarations for constructors, destructors, and
16998 type conversions can the decl-specifier-seq be omitted.
17000 We explicitly postpone this check past the point where we handle
17001 function-definitions because we tolerate function-definitions
17002 that are missing their return types in some modes. */
17004 {
17008 }
17010 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17014 {
17022 {
17028 }
17029 }
17030 else
17031 {
17032 /* If the init-declarator isn't initialized and isn't followed by a
17033 `,' or `;', it's not a valid init-declarator. */
17036 {
17039 else
17040 {
17043 }
17044 }
17047 }
17049 /* Because start_decl has side-effects, we should only call it if we
17050 know we're going ahead. By this point, we know that we cannot
17051 possibly be looking at any other construct. */
17054 /* Enter the newly declared entry in the symbol table. If we're
17055 processing a declaration in a class-specifier, we wait until
17056 after processing the initializer. */
17058 {
17065 /* Adjust location of decl if declarator->id_loc is more appropriate:
17066 set, and decl wasn't merged with another decl, in which case its
17067 location would be different from input_location, and more accurate. */
17072 }
17074 /* Enter the SCOPE. That way unqualified names appearing in the
17075 initializer will be looked up in SCOPE. */
17078 /* Perform deferred access control checks, now that we know in which
17079 SCOPE the declared entity resides. */
17081 {
17084 /* If the entity being declared is a function, pretend that we
17085 are in its scope. If it is a `friend', it may have access to
17086 things that would not otherwise be accessible. */
17088 {
17091 }
17093 /* Perform access checks for template parameters. */
17096 /* Perform the access control checks for the declarator and the
17097 decl-specifiers. */
17100 /* Restore the saved value. */
17103 }
17105 /* Parse the initializer. */
17110 {
17112 {
17116 else
17117 {
17118 /* If the declaration was erroneous, we don't really
17119 know what the user intended, so just silently
17120 consume the initializer. */
17128 }
17129 }
17130 else
17131 {
17132 /* We want to record the extra mangling scope for in-class
17133 initializers of class members and initializers of static data
17134 member templates. The former involves deferring
17135 parsing of the initializer until end of class as with default
17136 arguments. So right here we only handle the latter. */
17146 }
17147 }
17149 /* The old parser allows attributes to appear after a parenthesized
17150 initializer. Mark Mitchell proposed removing this functionality
17151 on the GCC mailing lists on 2002-08-13. This parser accepts the
17152 attributes -- but ignores them. */
17159 /* And now complain about a non-function implicit template. */
17164 /* For an in-class declaration, use `grokfield' to create the
17165 declaration. */
17167 {
17169 {
17172 }
17180 }
17182 /* Finish processing the declaration. But, skip member
17183 declarations. */
17185 {
17188 asm_specification,
17189 /* If the initializer is in parentheses, then this is
17190 a direct-initialization, which means that an
17191 `explicit' constructor is OK. Otherwise, an
17192 `explicit' constructor cannot be used. */
17195 }
17198 /* Core issue #226 (C++0x only): A default template-argument
17199 shall not be specified in a friend class template
17200 declaration. */
17209 {
17212 else
17214 }
17217 }
17219 /* Parse a declarator.
17221 declarator:
17222 direct-declarator
17223 ptr-operator declarator
17225 abstract-declarator:
17226 ptr-operator abstract-declarator [opt]
17227 direct-abstract-declarator
17229 GNU Extensions:
17231 declarator:
17232 attributes [opt] direct-declarator
17233 attributes [opt] ptr-operator declarator
17235 abstract-declarator:
17236 attributes [opt] ptr-operator abstract-declarator [opt]
17237 attributes [opt] direct-abstract-declarator
17239 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17240 detect constructor, destructor or conversion operators. It is set
17241 to -1 if the declarator is a name, and +1 if it is a
17242 function. Otherwise it is set to zero. Usually you just want to
17243 test for >0, but internally the negative value is used.
17245 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17246 a decl-specifier-seq unless it declares a constructor, destructor,
17247 or conversion. It might seem that we could check this condition in
17248 semantic analysis, rather than parsing, but that makes it difficult
17249 to handle something like `f()'. We want to notice that there are
17250 no decl-specifiers, and therefore realize that this is an
17251 expression, not a declaration.)
17253 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17254 the declarator is a direct-declarator of the form "(...)".
17256 MEMBER_P is true iff this declarator is a member-declarator.
17258 FRIEND_P is true iff this declarator is a friend. */
17262 cp_parser_declarator_kind dcl_kind,
17266 {
17269 cp_cv_quals cv_quals;
17270 tree class_type;
17273 /* Assume this is not a constructor, destructor, or type-conversion
17274 operator. */
17281 /* Check for the ptr-operator production. */
17283 /* Parse the ptr-operator. */
17289 /* If that worked, then we have a ptr-operator. */
17291 {
17292 /* If a ptr-operator was found, then this declarator was not
17293 parenthesized. */
17296 /* The dependent declarator is optional if we are parsing an
17297 abstract-declarator. */
17301 /* Parse the dependent declarator. */
17306 friend_p);
17308 /* If we are parsing an abstract-declarator, we must handle the
17309 case where the dependent declarator is absent. */
17314 declarator = cp_parser_make_indirect_declarator
17316 }
17317 /* Everything else is a direct-declarator. */
17318 else
17319 {
17322 CPP_OPEN_PAREN);
17324 ctor_dtor_or_conv_p,
17326 }
17331 }
17333 /* Parse a direct-declarator or direct-abstract-declarator.
17335 direct-declarator:
17336 declarator-id
17337 direct-declarator ( parameter-declaration-clause )
17338 cv-qualifier-seq [opt]
17339 ref-qualifier [opt]
17340 exception-specification [opt]
17341 direct-declarator [ constant-expression [opt] ]
17342 ( declarator )
17344 direct-abstract-declarator:
17345 direct-abstract-declarator [opt]
17346 ( parameter-declaration-clause )
17347 cv-qualifier-seq [opt]
17348 ref-qualifier [opt]
17349 exception-specification [opt]
17350 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17351 ( abstract-declarator )
17353 Returns a representation of the declarator. DCL_KIND is
17354 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17355 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17356 we are parsing a direct-declarator. It is
17357 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17358 of ambiguity we prefer an abstract declarator, as per
17359 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17360 as for cp_parser_declarator. */
17364 cp_parser_declarator_kind dcl_kind,
17367 {
17377 {
17378 /* Peek at the next token. */
17381 {
17382 /* This is either a parameter-declaration-clause, or a
17383 parenthesized declarator. When we know we are parsing a
17384 named declarator, it must be a parenthesized declarator
17385 if FIRST is true. For instance, `(int)' is a
17386 parameter-declaration-clause, with an omitted
17387 direct-abstract-declarator. But `((*))', is a
17388 parenthesized abstract declarator. Finally, when T is a
17389 template parameter `(T)' is a
17390 parameter-declaration-clause, and not a parenthesized
17391 named declarator.
17393 We first try and parse a parameter-declaration-clause,
17394 and then try a nested declarator (if FIRST is true).
17396 It is not an error for it not to be a
17397 parameter-declaration-clause, even when FIRST is
17398 false. Consider,
17400 int i (int);
17401 int i (3);
17403 The first is the declaration of a function while the
17404 second is the definition of a variable, including its
17405 initializer.
17407 Having seen only the parenthesis, we cannot know which of
17408 these two alternatives should be selected. Even more
17409 complex are examples like:
17411 int i (int (a));
17412 int i (int (3));
17414 The former is a function-declaration; the latter is a
17415 variable initialization.
17417 Thus again, we try a parameter-declaration-clause, and if
17418 that fails, we back out and return. */
17421 {
17422 tree params;
17425 /* In a member-declarator, the only valid interpretation
17426 of a parenthesis is the start of a
17427 parameter-declaration-clause. (It is invalid to
17428 initialize a static data member with a parenthesized
17429 initializer; only the "=" form of initialization is
17430 permitted.) */
17434 /* Consume the `('. */
17437 {
17438 /* If this is going to be an abstract declarator, we're
17439 in a declarator and we can't have default args. */
17442 }
17446 /* Parse the parameter-declaration-clause. */
17449 /* Consume the `)'. */
17452 /* If all went well, parse the cv-qualifier-seq,
17453 ref-qualifier and the exception-specification. */
17455 {
17456 cp_cv_quals cv_quals;
17457 cp_virt_specifiers virt_specifiers;
17458 cp_ref_qualifier ref_qual;
17459 tree exception_specification;
17460 tree late_return;
17461 tree attrs;
17471 /* Parse the cv-qualifier-seq. */
17473 /* Parse the ref-qualifier. */
17475 /* And the exception-specification. */
17476 exception_specification
17481 /* In here, we handle cases where attribute is used after
17482 the function declaration. For example:
17483 void func (int x) __attribute__((vector(..))); */
17486 {
17490 CPP_SEMICOLON)
17492 CPP_OPEN_BRACE))
17495 ;
17496 else
17498 }
17499 late_return = (cp_parser_late_return_type_opt
17504 /* Parse the virt-specifier-seq. */
17507 /* Create the function-declarator. */
17509 params,
17510 cv_quals,
17511 virt_specifiers,
17512 ref_qual,
17513 exception_specification,
17514 late_return);
17516 /* Any subsequent parameter lists are to do with
17517 return type, so are not those of the declared
17518 function. */
17520 }
17522 /* Remove the function parms from scope. */
17526 /* Repeat the main loop. */
17528 }
17530 /* If this is the first, we can try a parenthesized
17531 declarator. */
17533 {
17539 /* Consume the `('. */
17541 /* Parse the nested declarator. */
17544 declarator
17550 /* Expect a `)'. */
17557 }
17558 /* Otherwise, we must be done. */
17559 else
17561 }
17565 {
17566 /* Parse an array-declarator. */
17575 /* Consume the `['. */
17577 /* Peek at the next token. */
17579 /* If the next token is `]', then there is no
17580 constant-expression. */
17582 {
17584 bounds
17594 {
17595 /* Normally, the array bound must be an integral constant
17596 expression. However, as an extension, we allow VLAs
17597 in function scopes as long as they aren't part of a
17598 parameter declaration. */
17602 }
17605 {
17606 /* Remember this wasn't a constant-expression. */
17609 }
17610 }
17611 else
17613 /* Look for the closing `]'. */
17615 {
17618 }
17623 }
17625 {
17626 {
17627 tree qualifying_scope;
17628 tree unqualified_name;
17629 tree attrs;
17630 special_function_kind sfk;
17635 /* Parse a declarator-id */
17638 {
17641 /* If we see an ellipsis, we should be looking at a
17642 parameter pack. */
17644 {
17645 /* Consume the `...' */
17649 }
17650 }
17653 unqualified_name
17657 {
17661 {
17662 /* Check whether an error occurred. */
17665 /* We already consumed the ellipsis to mark a
17666 parameter pack, but we have no way to report it,
17667 so abort the tentative parse. We will be exiting
17668 immediately anyway. */
17670 }
17671 else
17677 && (qualifying_scope
17679 {
17682 }
17683 }
17688 {
17693 }
17699 {
17700 /* In the declaration of a member of a template class
17701 outside of the class itself, the SCOPE will sometimes
17702 be a TYPENAME_TYPE. For example, given:
17704 template <typename T>
17705 int S<T>::R::i = 3;
17707 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17708 this context, we must resolve S<T>::R to an ordinary
17709 type, rather than a typename type.
17711 The reason we normally avoid resolving TYPENAME_TYPEs
17712 is that a specialization of `S' might render
17713 `S<T>::R' not a type. However, if `S' is
17714 specialized, then this `i' will not be used, so there
17715 is no harm in resolving the types here. */
17716 tree type;
17718 /* Resolve the TYPENAME_TYPE. */
17721 /* If that failed, the declarator is invalid. */
17723 {
17726 "cannot define member of dependent typedef "
17728 else
17733 }
17735 }
17740 {
17741 tree class_type;
17746 else
17750 {
17753 {
17756 {
17760 "use %<%T::%D%> instead of %<%T::%D%> to "
17762 class_type,
17767 }
17768 else
17770 }
17771 else
17772 {
17773 /* We do not attempt to print the declarator
17774 here because we do not have enough
17775 information about its original syntactic
17776 form. */
17780 }
17781 }
17784 {
17790 for an anonymous type, even if the type
17791 got a name for linkage purposes. */
17793 /* Handle correctly (c++/19200):
17795 struct S {
17796 struct T{};
17797 friend void S(T);
17798 };
17800 and also:
17802 namespace N {
17803 void S();
17804 }
17806 struct S {
17807 friend void N::S();
17808 }; */
17809 && !(friend_p
17812 class_type))
17813 {
17816 }
17824 }
17825 }
17827 unqualified_name,
17828 sfk);
17835 }
17837 handle_declarator:;
17840 {
17841 /* Any names that appear after the declarator-id for a
17842 member are looked up in the containing scope. */
17844 {
17845 /* But declarations with qualified-ids can't appear in a
17846 function. */
17850 }
17852 }
17856 /* Default args are only allowed on function
17857 declarations. */
17859 else
17863 }
17864 /* We're done. */
17865 else
17867 }
17869 /* For an abstract declarator, we might wind up with nothing at this
17870 point. That's an error; the declarator is not optional. */
17874 /* If we entered a scope, we must exit it now. */
17882 }
17884 /* Parse a ptr-operator.
17886 ptr-operator:
17887 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17888 * cv-qualifier-seq [opt]
17889 &
17890 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17891 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17893 GNU Extension:
17895 ptr-operator:
17896 & cv-qualifier-seq [opt]
17898 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17899 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17900 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17901 filled in with the TYPE containing the member. *CV_QUALS is
17902 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17903 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17904 Note that the tree codes returned by this function have nothing
17905 to do with the types of trees that will be eventually be created
17906 to represent the pointer or reference type being parsed. They are
17907 just constants with suggestive names. */
17908 static enum tree_code
17913 {
17918 /* Assume that it's not a pointer-to-member. */
17920 /* And that there are no cv-qualifiers. */
17923 /* Peek at the next token. */
17926 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17936 {
17937 /* Consume the `*', `&' or `&&'. */
17940 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17941 `&', if we are allowing GNU extensions. (The only qualifier
17942 that can legally appear after `&' is `restrict', but that is
17943 enforced during semantic analysis. */
17951 }
17952 else
17953 {
17954 /* Try the pointer-to-member case. */
17956 /* Look for the optional `::' operator. */
17959 /* Look for the nested-name specifier. */
17966 /* If we found it, and the next token is a `*', then we are
17967 indeed looking at a pointer-to-member operator. */
17970 {
17971 /* Indicate that the `*' operator was used. */
17979 else
17980 {
17981 /* The type of which the member is a member is given by the
17982 current SCOPE. */
17984 /* The next name will not be qualified. */
17988 /* Look for optional c++11 attributes. */
17992 /* Look for the optional cv-qualifier-seq. */
17994 }
17995 }
17996 /* If that didn't work we don't have a ptr-operator. */
17999 }
18002 }
18004 /* Parse an (optional) cv-qualifier-seq.
18006 cv-qualifier-seq:
18007 cv-qualifier cv-qualifier-seq [opt]
18009 cv-qualifier:
18010 const
18011 volatile
18013 GNU Extension:
18015 cv-qualifier:
18016 __restrict__
18018 Returns a bitmask representing the cv-qualifiers. */
18020 static cp_cv_quals
18022 {
18026 {
18028 cp_cv_quals cv_qualifier;
18030 /* Peek at the next token. */
18032 /* See if it's a cv-qualifier. */
18034 {
18050 }
18056 {
18059 }
18060 else
18061 {
18064 }
18065 }
18068 }
18070 /* Parse an (optional) ref-qualifier
18072 ref-qualifier:
18073 &
18074 &&
18076 Returns cp_ref_qualifier representing ref-qualifier. */
18078 static cp_ref_qualifier
18080 {
18083 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18088 {
18093 {
18105 }
18110 {
18113 }
18114 else
18115 {
18118 }
18119 }
18122 }
18124 /* Parse an (optional) virt-specifier-seq.
18126 virt-specifier-seq:
18127 virt-specifier virt-specifier-seq [opt]
18129 virt-specifier:
18130 override
18131 final
18133 Returns a bitmask representing the virt-specifiers. */
18135 static cp_virt_specifiers
18137 {
18141 {
18143 cp_virt_specifiers virt_specifier;
18145 /* Peek at the next token. */
18147 /* See if it's a virt-specifier-qualifier. */
18151 {
18154 }
18156 {
18159 }
18161 {
18163 }
18164 else
18168 {
18171 }
18172 else
18173 {
18176 }
18177 }
18179 }
18181 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18182 is in scope even though it isn't real. */
18184 void
18186 {
18187 tree this_parm;
18190 {
18191 /* We don't clear this between NSDMIs. Is it already what we want? */
18196 }
18199 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18201 current_class_ref
18204 }
18206 /* Return true iff our current scope is a non-static data member
18207 initializer. */
18209 bool
18211 {
18212 /* We recognize NSDMI context by the context-less 'this' pointer set up
18213 by the function above. */
18217 }
18219 /* Parse a late-specified return type, if any. This is not a separate
18220 non-terminal, but part of a function declarator, which looks like
18222 -> trailing-type-specifier-seq abstract-declarator(opt)
18224 Returns the type indicated by the type-id.
18226 In addition to this this parses any queued up omp declare simd
18227 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18229 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18230 function. */
18232 static tree
18234 cp_cv_quals quals)
18235 {
18239 && declarator
18245 /* Peek at the next token. */
18247 /* A late-specified return type is indicated by an initial '->'. */
18254 {
18255 /* DR 1207: 'this' is in scope in the trailing return type. */
18257 }
18260 {
18261 /* Consume the ->. */
18265 }
18268 declarator->std_attributes
18272 declarator->std_attributes
18277 {
18280 }
18283 }
18285 /* Parse a declarator-id.
18287 declarator-id:
18288 id-expression
18289 :: [opt] nested-name-specifier [opt] type-name
18291 In the `id-expression' case, the value returned is as for
18292 cp_parser_id_expression if the id-expression was an unqualified-id.
18293 If the id-expression was a qualified-id, then a SCOPE_REF is
18294 returned. The first operand is the scope (either a NAMESPACE_DECL
18295 or TREE_TYPE), but the second is still just a representation of an
18296 unqualified-id. */
18298 static tree
18300 {
18301 tree id;
18302 /* The expression must be an id-expression. Assume that qualified
18303 names are the names of types so that:
18305 template <class T>
18306 int S<T>::R::i = 3;
18308 will work; we must treat `S<T>::R' as the name of a type.
18309 Similarly, assume that qualified names are templates, where
18310 required, so that:
18312 template <class T>
18313 int S<T>::R<T>::i = 3;
18315 will work, too. */
18321 optional_p);
18325 }
18327 /* Parse a type-id.
18329 type-id:
18330 type-specifier-seq abstract-declarator [opt]
18332 Returns the TYPE specified. */
18334 static tree
18337 {
18338 cp_decl_specifier_seq type_specifier_seq;
18341 /* Parse the type-specifier-seq. */
18343 is_trailing_return,
18348 /* There might or might not be an abstract declarator. */
18350 /* Look for the declarator. */
18351 abstract_declarator
18356 /* Check to see if there really was a declarator. */
18361 /* None of the valid uses of 'auto' in C++14 involve the type-id
18362 nonterminal, but it is valid in a trailing-return-type. */
18365 {
18366 /* A type-id with type 'auto' is only ok if the abstract declarator
18367 is a function declarator with a late-specified return type. */
18372 else
18373 {
18376 }
18377 }
18380 is_template_arg);
18381 }
18384 {
18386 }
18389 {
18390 tree r;
18392 parser->type_definition_forbidden_message
18397 {
18400 }
18402 }
18405 {
18407 }
18409 /* Parse a type-specifier-seq.
18411 type-specifier-seq:
18412 type-specifier type-specifier-seq [opt]
18414 GNU extension:
18416 type-specifier-seq:
18417 attributes type-specifier-seq [opt]
18419 If IS_DECLARATION is true, we are at the start of a "condition" or
18420 exception-declaration, so we might be followed by a declarator-id.
18422 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18423 i.e. we've just seen "->".
18425 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18427 static void
18432 {
18437 /* Clear the TYPE_SPECIFIER_SEQ. */
18440 /* In the context of a trailing return type, enum E { } is an
18441 elaborated-type-specifier followed by a function-body, not an
18442 enum-specifier. */
18446 /* Parse the type-specifiers and attributes. */
18448 {
18449 tree type_specifier;
18452 /* Check for attributes first. */
18454 {
18459 }
18461 /* record the token of the beginning of the type specifier seq,
18462 for error reporting purposes*/
18466 /* Look for the type-specifier. */
18468 flags,
18469 type_specifier_seq,
18471 NULL,
18474 {
18475 /* If the first type-specifier could not be found, this is not a
18476 type-specifier-seq at all. */
18478 {
18479 /* Set in_declarator_p to avoid skipping to the semicolon. */
18491 }
18492 /* If subsequent type-specifiers could not be found, the
18493 type-specifier-seq is complete. */
18495 }
18498 /* The standard says that a condition can be:
18500 type-specifier-seq declarator = assignment-expression
18502 However, given:
18504 struct S {};
18505 if (int S = ...)
18507 we should treat the "S" as a declarator, not as a
18508 type-specifier. The standard doesn't say that explicitly for
18509 type-specifier-seq, but it does say that for
18510 decl-specifier-seq in an ordinary declaration. Perhaps it
18511 would be clearer just to allow a decl-specifier-seq here, and
18512 then add a semantic restriction that if any decl-specifiers
18513 that are not type-specifiers appear, the program is invalid. */
18516 }
18517 }
18519 /* Return whether the function currently being declared has an associated
18520 template parameter list. */
18522 static bool
18524 {
18537 }
18539 /* Parse a parameter-declaration-clause.
18541 parameter-declaration-clause:
18542 parameter-declaration-list [opt] ... [opt]
18543 parameter-declaration-list , ...
18545 Returns a representation for the parameter declarations. A return
18546 value of NULL indicates a parameter-declaration-clause consisting
18547 only of an ellipsis. */
18549 static tree
18551 {
18552 tree parameters;
18561 parser->auto_is_implicit_function_template_parm_p
18563 }
18569 && !processing_template_parmlist
18575 /* Peek at the next token. */
18577 /* Check for trivial parameter-declaration-clauses. */
18579 {
18580 /* Consume the `...' token. */
18583 }
18585 /* There are no parameters. */
18586 {
18587 #ifndef NO_IMPLICIT_EXTERN_C
18592 else
18593 #endif
18595 }
18596 /* Check for `(void)', too, which is a special case. */
18600 {
18601 /* Consume the `void' token. */
18603 /* There are no parameters. */
18605 }
18607 /* Parse the parameter-declaration-list. */
18609 /* If a parse error occurred while parsing the
18610 parameter-declaration-list, then the entire
18611 parameter-declaration-clause is erroneous. */
18615 /* Peek at the next token. */
18617 /* If it's a `,', the clause should terminate with an ellipsis. */
18619 {
18620 /* Consume the `,'. */
18622 /* Expect an ellipsis. */
18623 ellipsis_p
18625 }
18626 /* It might also be `...' if the optional trailing `,' was
18627 omitted. */
18629 {
18630 /* Consume the `...' token. */
18632 /* And remember that we saw it. */
18634 }
18635 else
18638 /* Finish the parameter list. */
18643 }
18645 /* Parse a parameter-declaration-list.
18647 parameter-declaration-list:
18648 parameter-declaration
18649 parameter-declaration-list , parameter-declaration
18651 Returns a representation of the parameter-declaration-list, as for
18652 cp_parser_parameter_declaration_clause. However, the
18653 `void_list_node' is never appended to the list. Upon return,
18654 *IS_ERROR will be true iff an error occurred. */
18656 static tree
18658 {
18664 /* Assume all will go well. */
18666 /* The special considerations that apply to a function within an
18667 unbraced linkage specifications do not apply to the parameters
18668 to the function. */
18669 saved_in_unbraced_linkage_specification_p
18673 /* Look for more parameters. */
18675 {
18683 /* Parse the parameter. */
18684 parameter
18689 /* We don't know yet if the enclosing context is deprecated, so wait
18690 and warn in grokparms if appropriate. */
18694 {
18695 /* If a function parameter pack was specified and an implicit template
18696 parameter was introduced during cp_parser_parameter_declaration,
18697 change any implicit parameters introduced into packs. */
18701 {
18709 }
18713 PARM,
18716 }
18720 /* If a parse error occurred parsing the parameter declaration,
18721 then the entire parameter-declaration-list is erroneous. */
18723 {
18727 }
18737 {
18741 }
18743 /* Add the new parameter to the list. */
18747 /* Peek at the next token. */
18750 /* These are for Objective-C++ */
18753 /* The parameter-declaration-list is complete. */
18756 {
18759 /* Peek at the next token. */
18761 /* If it's an ellipsis, then the list is complete. */
18764 /* Otherwise, there must be more parameters. Consume the
18765 `,'. */
18767 /* When parsing something like:
18769 int i(float f, double d)
18771 we can tell after seeing the declaration for "f" that we
18772 are not looking at an initialization of a variable "i",
18773 but rather at the declaration of a function "i".
18775 Due to the fact that the parsing of template arguments
18776 (as specified to a template-id) requires backtracking we
18777 cannot use this technique when inside a template argument
18778 list. */
18782 /* However, a parameter-declaration of the form
18783 "float(f)" (which is a valid declaration of a
18784 parameter "f") can also be interpreted as an
18785 expression (the conversion of "f" to "float"). */
18788 }
18789 else
18790 {
18798 }
18799 }
18801 parser->in_unbraced_linkage_specification_p
18804 /* Reset implicit_template_scope if we are about to leave the function
18805 parameter list that introduced it. Note that for out-of-line member
18806 definitions, there will be one or more class scopes before we get to
18807 the template parameter scope. */
18811 {
18815 {
18818 }
18819 }
18822 }
18824 /* Parse a parameter declaration.
18826 parameter-declaration:
18827 decl-specifier-seq ... [opt] declarator
18828 decl-specifier-seq declarator = assignment-expression
18829 decl-specifier-seq ... [opt] abstract-declarator [opt]
18830 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18832 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18833 declares a template parameter. (In that case, a non-nested `>'
18834 token encountered during the parsing of the assignment-expression
18835 is not interpreted as a greater-than operator.)
18837 Returns a representation of the parameter, or NULL if an error
18838 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18839 true iff the declarator is of the form "(p)". */
18845 {
18847 cp_decl_specifier_seq decl_specifiers;
18849 tree default_argument;
18853 /* In a template parameter, `>' is not an operator.
18855 [temp.param]
18857 When parsing a default template-argument for a non-type
18858 template-parameter, the first non-nested `>' is taken as the end
18859 of the template parameter-list rather than a greater-than
18860 operator. */
18862 /* Type definitions may not appear in parameter types. */
18864 parser->type_definition_forbidden_message
18867 /* Parse the declaration-specifiers. */
18869 CP_PARSER_FLAGS_NONE,
18873 /* Complain about missing 'typename' or other invalid type names. */
18878 /* If an error occurred, there's no reason to attempt to parse the
18879 rest of the declaration. */
18881 {
18884 }
18886 /* Peek at the next token. */
18889 /* If the next token is a `)', `,', `=', `>', or `...', then there
18890 is no declarator. However, when variadic templates are enabled,
18891 there may be a declarator following `...'. */
18896 {
18900 }
18901 /* Otherwise, there should be a declarator. */
18902 else
18903 {
18907 /* After seeing a decl-specifier-seq, if the next token is not a
18908 "(", there is no possibility that the code is a valid
18909 expression. Therefore, if parsing tentatively, we commit at
18910 this point. */
18912 /* In an expression context, having seen:
18914 (int((char ...
18916 we cannot be sure whether we are looking at a
18917 function-type (taking a "char" as a parameter) or a cast
18918 of some object of type "char" to "int". */
18924 /* Parse the declarator. */
18927 CP_PARSER_DECLARATOR_EITHER,
18929 parenthesized_p,
18933 /* After the declarator, allow more attributes. */
18934 decl_specifiers.attributes
18937 }
18939 /* If the next token is an ellipsis, and we have not seen a
18940 declarator name, and the type of the declarator contains parameter
18941 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18942 a parameter pack expansion expression. Otherwise, leave the
18943 ellipsis for a C-style variadic function. */
18946 {
18957 {
18958 /* Consume the `...'. */
18962 /* Build a pack expansion type */
18965 else
18967 }
18968 }
18970 /* The restriction on defining new types applies only to the type
18971 of the parameter, not to the default argument. */
18974 /* If the next token is `=', then process a default argument. */
18976 {
18978 /* If we are defining a class, then the tokens that make up the
18979 default argument must be saved and processed later. */
18984 /* Outside of a class definition, we can just parse the
18985 assignment-expression. */
18986 else
18987 default_argument
18991 {
18994 else
18995 {
18997 "default arguments are only "
19000 }
19001 }
19005 {
19006 /* Find the name of the parameter pack. */
19013 template_parm_p
19019 else
19021 template_parm_p
19028 }
19029 }
19030 else
19034 declarator,
19035 default_argument);
19036 }
19038 /* Parse a default argument and return it.
19040 TEMPLATE_PARM_P is true if this is a default argument for a
19041 non-type template parameter. */
19042 static tree
19044 {
19050 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19051 set correctly. */
19054 /* Local variable names (and the `this' keyword) may not
19055 appear in a default argument. */
19058 /* Parse the assignment-expression. */
19063 /* The "this" pointer is not valid in a default argument. */
19065 {
19070 }
19071 default_argument
19073 /* Restore the "this" pointer. */
19075 {
19078 }
19087 }
19089 /* Parse a function-body.
19091 function-body:
19092 compound_statement */
19094 static void
19096 {
19098 }
19100 /* Parse a ctor-initializer-opt followed by a function-body. Return
19101 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19102 is true we are parsing a function-try-block. */
19104 static bool
19107 {
19115 /* Begin the function body. */
19117 /* Parse the optional ctor-initializer. */
19120 /* If we're parsing a constexpr constructor definition, we need
19121 to check that the constructor body is indeed empty. However,
19122 before we get to cp_parser_function_body lot of junk has been
19123 generated, so we can't just check that we have an empty block.
19124 Rather we take a snapshot of the outermost block, and check whether
19125 cp_parser_function_body changed its state. */
19127 {
19131 }
19132 /* Parse the function-body. */
19136 /* Finish the function body. */
19140 }
19142 /* Parse an initializer.
19144 initializer:
19145 = initializer-clause
19146 ( expression-list )
19148 Returns an expression representing the initializer. If no
19149 initializer is present, NULL_TREE is returned.
19151 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19152 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19153 set to TRUE if there is no initializer present. If there is an
19154 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19155 is set to true; otherwise it is set to false. */
19157 static tree
19160 {
19162 tree init;
19164 /* Peek at the next token. */
19167 /* Let our caller know whether or not this initializer was
19168 parenthesized. */
19170 /* Assume that the initializer is constant. */
19174 {
19175 /* Consume the `='. */
19177 /* Parse the initializer-clause. */
19179 }
19181 {
19186 non_constant_p);
19191 }
19193 {
19198 }
19199 else
19200 {
19201 /* Anything else is an error. */
19204 }
19207 }
19209 /* Parse an initializer-clause.
19211 initializer-clause:
19212 assignment-expression
19213 braced-init-list
19215 Returns an expression representing the initializer.
19217 If the `assignment-expression' production is used the value
19218 returned is simply a representation for the expression.
19220 Otherwise, calls cp_parser_braced_list. */
19222 static tree
19224 {
19225 tree initializer;
19227 /* Assume the expression is constant. */
19230 /* If it is not a `{', then we are looking at an
19231 assignment-expression. */
19233 {
19234 initializer
19237 non_constant_p);
19238 }
19239 else
19243 }
19245 /* Parse a brace-enclosed initializer list.
19247 braced-init-list:
19248 { initializer-list , [opt] }
19249 { }
19251 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19252 the elements of the initializer-list (or NULL, if the last
19253 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19254 NULL_TREE. There is no way to detect whether or not the optional
19255 trailing `,' was provided. NON_CONSTANT_P is as for
19256 cp_parser_initializer. */
19258 static tree
19260 {
19261 tree initializer;
19263 /* Consume the `{' token. */
19265 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19267 /* If it's not a `}', then there is a non-trivial initializer. */
19269 {
19270 /* Parse the initializer list. */
19273 /* A trailing `,' token is allowed. */
19276 }
19277 else
19279 /* Now, there should be a trailing `}'. */
19283 }
19285 /* Consume tokens up to, and including, the next non-nested closing `]'.
19286 Returns true iff we found a closing `]'. */
19288 static bool
19290 {
19294 {
19298 {
19301 /* If we've run out of tokens, then there is no closing `]'. */
19310 {
19313 }
19318 }
19320 /* Consume the token. */
19322 }
19323 }
19325 /* Return true if we are looking at an array-designator, false otherwise. */
19327 static bool
19329 {
19330 /* Consume the `['. */
19335 /* Skip tokens until the next token is a closing square bracket.
19336 If we find the closing `]', and the next token is a `=', then
19337 we are looking at an array designator. */
19338 bool array_designator_p
19342 /* Roll back the tokens we skipped. */
19346 }
19348 /* Parse an initializer-list.
19350 initializer-list:
19351 initializer-clause ... [opt]
19352 initializer-list , initializer-clause ... [opt]
19354 GNU Extension:
19356 initializer-list:
19357 designation initializer-clause ...[opt]
19358 initializer-list , designation initializer-clause ...[opt]
19360 designation:
19361 . identifier =
19362 identifier :
19363 [ constant-expression ] =
19365 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19366 for the initializer. If the INDEX of the elt is non-NULL, it is the
19367 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19368 as for cp_parser_initializer. */
19372 {
19375 /* Assume all of the expressions are constant. */
19378 /* Parse the rest of the list. */
19380 {
19382 tree designator;
19383 tree initializer;
19386 /* If the next token is an identifier and the following one is a
19387 colon, we are looking at the GNU designated-initializer
19388 syntax. */
19392 {
19393 /* Warn the user that they are using an extension. */
19396 /* Consume the identifier. */
19398 /* Consume the `:'. */
19400 }
19401 /* Also handle the C99 syntax, '. id ='. */
19406 {
19407 /* Warn the user that they are using an extension. */
19410 /* Consume the `.'. */
19412 /* Consume the identifier. */
19414 /* Consume the `='. */
19416 }
19417 /* Also handle C99 array designators, '[ const ] ='. */
19421 {
19422 /* In C++11, [ could start a lambda-introducer. */
19428 {
19431 }
19432 else
19433 {
19438 }
19444 }
19445 else
19448 /* Parse the initializer. */
19451 /* If any clause is non-constant, so is the entire initializer. */
19455 /* If we have an ellipsis, this is an initializer pack
19456 expansion. */
19458 {
19459 /* Consume the `...'. */
19462 /* Turn the initializer into an initializer expansion. */
19464 }
19466 /* Add it to the vector. */
19469 /* If the next token is not a comma, we have reached the end of
19470 the list. */
19474 /* Peek at the next token. */
19476 /* If the next token is a `}', then we're still done. An
19477 initializer-clause can have a trailing `,' after the
19478 initializer-list and before the closing `}'. */
19482 /* Consume the `,' token. */
19484 }
19487 }
19489 /* Classes [gram.class] */
19491 /* Parse a class-name.
19493 class-name:
19494 identifier
19495 template-id
19497 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19498 to indicate that names looked up in dependent types should be
19499 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19500 keyword has been used to indicate that the name that appears next
19501 is a template. TAG_TYPE indicates the explicit tag given before
19502 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19503 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19504 is the class being defined in a class-head.
19506 Returns the TYPE_DECL representing the class. */
19508 static tree
19516 {
19517 tree decl;
19518 tree scope;
19523 /* All class-names start with an identifier. */
19526 {
19529 }
19531 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19532 to a template-id, so we save it here. */
19537 /* Any name names a type if we're following the `typename' keyword
19538 in a qualified name where the enclosing scope is type-dependent. */
19541 /* Handle the common case (an identifier, but not a template-id)
19542 efficiently. */
19545 {
19549 /* Look for the identifier. */
19553 /* If the next token isn't an identifier, we are certainly not
19554 looking at a class-name. */
19557 /* If we know this is a type-name, there's no need to look it
19558 up. */
19561 else
19562 {
19563 tree ambiguous_decls;
19564 /* If we already know that this lookup is ambiguous, then
19565 we've already issued an error message; there's no reason
19566 to check again. */
19568 {
19571 }
19572 /* If the next token is a `::', then the name must be a type
19573 name.
19575 [basic.lookup.qual]
19577 During the lookup for a name preceding the :: scope
19578 resolution operator, object, function, and enumerator
19579 names are ignored. */
19582 /* Look up the name. */
19584 tag_type,
19587 check_dependency_p,
19591 {
19595 }
19596 }
19597 }
19598 else
19599 {
19600 /* Try a template-id. */
19602 check_dependency_p,
19603 tag_type,
19604 is_declaration);
19607 }
19611 /* If this is a typename, create a TYPENAME_TYPE. */
19613 {
19618 }
19622 /* Check to see that it is really the name of a class. */
19626 /* Situations like this:
19628 template <typename T> struct A {
19629 typename T::template X<int>::I i;
19630 };
19632 are problematic. Is `T::template X<int>' a class-name? The
19633 standard does not seem to be definitive, but there is no other
19634 valid interpretation of the following `::'. Therefore, those
19635 names are considered class-names. */
19636 {
19640 }
19644 /* In Objective-C 2.0, a classname followed by '.' starts a
19645 dot-syntax expression, and it's not a type-name. */
19657 }
19659 /* Parse a class-specifier.
19661 class-specifier:
19662 class-head { member-specification [opt] }
19664 Returns the TREE_TYPE representing the class. */
19666 static tree
19668 {
19669 tree type;
19683 /* Parse the class-head. */
19686 /* If the class-head was a semantic disaster, skip the entire body
19687 of the class. */
19689 {
19693 }
19695 /* Look for the `{'. */
19697 {
19700 }
19704 /* Issue an error message if type-definitions are forbidden here. */
19706 /* Remember that we are defining one more class. */
19708 /* Inside the class, surrounding template-parameter-lists do not
19709 apply. */
19710 saved_num_template_parameter_lists
19713 /* We are not in a function body. */
19716 /* Or in a loop. */
19719 /* Or in a switch. */
19722 /* We are not immediately inside an extern "lang" block. */
19723 saved_in_unbraced_linkage_specification_p
19727 /* Start the class. */
19729 {
19732 }
19736 /* If the type is erroneous, skip the entire body of the class. */
19738 else
19739 /* Parse the member-specification. */
19742 /* Look for the trailing `}'. */
19744 /* Look for trailing attributes to apply to this class. */
19752 /* We've finished a type definition. Check for the common syntax
19753 error of forgetting a semicolon after the definition. We need to
19754 be careful, as we can't just check for not-a-semicolon and be done
19755 with it; the user might have typed:
19757 class X { } c = ...;
19758 class X { } *p = ...;
19760 and so forth. Instead, enumerate all the possible tokens that
19761 might follow this production; if we don't see one of them, then
19762 complain and silently insert the semicolon. */
19763 {
19768 /* Don't try to parse c++11 attributes here. As per the
19769 grammar, that should be a task for
19770 cp_parser_decl_specifier_seq. */
19774 {
19785 /* While it's legal for type qualifiers and storage class
19786 specifiers to follow type definitions in the grammar, only
19787 compiler testsuites contain code like that. Assume that if
19788 we see such code, then what we're really seeing is a case
19789 like:
19791 class X { }
19792 const <type> var = ...;
19794 or
19796 class Y { }
19797 static <type> func (...) ...
19799 i.e. the qualifier or specifier applies to the next
19800 declaration. To do so, however, we need to look ahead one
19801 more token to see if *that* token is a type specifier.
19803 This code could be improved to handle:
19805 class Z { }
19806 static const <type> var = ...; */
19809 {
19812 /* Handling user-defined types here would be nice, but very
19813 tricky. */
19814 want_semicolon
19817 }
19821 }
19823 /* If we don't have a type, then something is very wrong and we
19824 shouldn't try to do anything clever. Likewise for not seeing the
19825 closing brace. */
19827 {
19828 cp_token_position prev
19839 else
19842 /* Unget one token and smash it to look as though we encountered
19843 a semicolon in the input stream. */
19848 }
19849 }
19851 /* If this class is not itself within the scope of another class,
19852 then we need to parse the bodies of all of the queued function
19853 definitions. Note that the queued functions defined in a class
19854 are not always processed immediately following the
19855 class-specifier for that class. Consider:
19857 struct A {
19858 struct B { void f() { sizeof (A); } };
19859 };
19861 If `f' were processed before the processing of `A' were
19862 completed, there would be no way to compute the size of `A'.
19863 Note that the nesting we are interested in here is lexical --
19864 not the semantic nesting given by TYPE_CONTEXT. In particular,
19865 for:
19867 struct A { struct B; };
19868 struct A::B { void f() { } };
19870 there is no need to delay the parsing of `A::B::f'. */
19872 {
19873 tree decl;
19880 /* In a first pass, parse default arguments to the functions.
19881 Then, in a second pass, parse the bodies of the functions.
19882 This two-phased approach handles cases like:
19884 struct S {
19885 void f() { g(); }
19886 void g(int i = 3);
19887 };
19889 */
19891 {
19893 /* If there are default arguments that have not yet been processed,
19894 take care of them now. */
19896 {
19901 }
19902 /* Make sure that any template parameters are in scope. */
19904 /* Parse the default argument expressions. */
19906 /* Remove any template parameters from the symbol table. */
19908 }
19910 /* Now parse any NSDMIs. */
19914 {
19916 {
19921 }
19924 }
19931 /* Now do some post-NSDMI bookkeeping. */
19937 /* Now parse the body of the functions. */
19939 {
19940 /* OpenMP UDRs need to be parsed before all other functions. */
19947 }
19948 else
19952 }
19953 else
19956 /* Put back any saved access checks. */
19959 /* Restore saved state. */
19963 parser->num_template_parameter_lists
19965 parser->in_unbraced_linkage_specification_p
19969 }
19971 static tree
19973 {
19974 tree ret;
19979 }
19981 /* Parse a class-head.
19983 class-head:
19984 class-key identifier [opt] base-clause [opt]
19985 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19986 class-key nested-name-specifier [opt] template-id
19987 base-clause [opt]
19989 class-virt-specifier:
19990 final
19992 GNU Extensions:
19993 class-key attributes identifier [opt] base-clause [opt]
19994 class-key attributes nested-name-specifier identifier base-clause [opt]
19995 class-key attributes nested-name-specifier [opt] template-id
19996 base-clause [opt]
19998 Upon return BASES is initialized to the list of base classes (or
19999 NULL, if there are none) in the same form returned by
20000 cp_parser_base_clause.
20002 Returns the TYPE of the indicated class. Sets
20003 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20004 involving a nested-name-specifier was used, and FALSE otherwise.
20006 Returns error_mark_node if this is not a class-head.
20008 Returns NULL_TREE if the class-head is syntactically valid, but
20009 semantically invalid in a way that means we should skip the entire
20010 body of the class. */
20012 static tree
20015 {
20016 tree nested_name_specifier;
20020 tree attributes;
20021 tree bases;
20031 /* Assume no nested-name-specifier will be present. */
20033 /* Assume no template parameter lists will be used in defining the
20034 type. */
20038 /* Look for the class-key. */
20043 /* Parse the attributes. */
20046 /* If the next token is `::', that is invalid -- but sometimes
20047 people do try to write:
20049 struct ::S {};
20051 Handle this gracefully by accepting the extra qualifier, and then
20052 issuing an error about it later if this really is a
20053 class-head. If it turns out just to be an elaborated type
20054 specifier, remain silent. */
20060 /* Determine the name of the class. Begin by looking for an
20061 optional nested-name-specifier. */
20063 nested_name_specifier
20069 /* If there was a nested-name-specifier, then there *must* be an
20070 identifier. */
20072 {
20074 /* Although the grammar says `identifier', it really means
20075 `class-name' or `template-name'. You are only allowed to
20076 define a class that has already been declared with this
20077 syntax.
20079 The proposed resolution for Core Issue 180 says that wherever
20080 you see `class T::X' you should treat `X' as a type-name.
20082 It is OK to define an inaccessible class; for example:
20084 class A { class B; };
20085 class A::B {};
20087 We do not know if we will see a class-name, or a
20088 template-name. We look for a class-name first, in case the
20089 class-name is a template-id; if we looked for the
20090 template-name first we would stop after the template-name. */
20095 class_type,
20099 /* If that didn't work, ignore the nested-name-specifier. */
20101 {
20107 }
20108 /* If we could not find a corresponding TYPE, treat this
20109 declaration like an unqualified declaration. */
20112 /* Otherwise, count the number of templates used in TYPE and its
20113 containing scopes. */
20114 else
20115 {
20116 tree scope;
20128 }
20129 }
20130 /* Otherwise, the identifier is optional. */
20131 else
20132 {
20133 /* We don't know whether what comes next is a template-id,
20134 an identifier, or nothing at all. */
20136 /* Check for a template-id. */
20141 class_key,
20143 /* If that didn't work, it could still be an identifier. */
20145 {
20147 {
20150 }
20151 else
20153 }
20154 else
20155 {
20158 }
20159 }
20164 {
20166 class_key,
20168 }
20171 /* If it's not a `:' or a `{' then we can't really be looking at a
20172 class-head, since a class-head only appears as part of a
20173 class-specifier. We have to detect this situation before calling
20174 xref_tag, since that has irreversible side-effects. */
20176 {
20180 }
20182 /* At this point, we're going ahead with the class-specifier, even
20183 if some other problem occurs. */
20186 {
20191 }
20192 /* Issue the error about the overly-qualified name now. */
20194 {
20199 }
20201 {
20206 }
20208 {
20209 tree scope;
20211 /* Reject typedef-names in class heads. */
20213 {
20216 type);
20219 }
20221 /* Figure out in what scope the declaration is being placed. */
20223 /* If that scope does not contain the scope in which the
20224 class was originally declared, the program is invalid. */
20226 {
20229 "declaration of %qD in namespace %qD which does not "
20232 else
20238 }
20239 /* [dcl.meaning]
20241 A declarator-id shall not be qualified except for the
20242 definition of a ... nested class outside of its class
20243 ... [or] the definition or explicit instantiation of a
20244 class member of a namespace outside of its namespace. */
20246 {
20251 }
20252 }
20253 /* An explicit-specialization must be preceded by "template <>". If
20254 it is not, try to recover gracefully. */
20258 {
20262 /* Take the same action that would have been taken by
20263 cp_parser_explicit_specialization. */
20266 }
20267 /* There must be no "return" statements between this point and the
20268 end of this function; set "type "to the correct return value and
20269 use "goto done;" to return. */
20270 /* Make sure that the right number of template parameters were
20271 present. */
20275 {
20276 /* If something went wrong, there is no point in even trying to
20277 process the class-definition. */
20280 }
20282 /* Look up the type. */
20284 {
20288 {
20292 }
20293 else
20294 {
20297 }
20300 }
20302 {
20303 tree class_type;
20305 /* Given:
20307 template <typename T> struct S { struct T };
20308 template <typename T> struct S<T>::T { };
20310 we will get a TYPENAME_TYPE when processing the definition of
20311 `S::T'. We need to resolve it to the actual type before we
20312 try to define it. */
20314 {
20319 else
20320 {
20323 }
20324 }
20328 {
20331 }
20334 /* Enter the scope indicated by the nested-name-specifier. */
20336 /* Get the canonical version of this type. */
20338 /* Call push_template_decl if it seems like we should be defining a
20339 template either from the template headers or the type we're
20340 defining, so that we diagnose both extra and missing headers. */
20344 {
20347 {
20350 }
20351 }
20355 }
20357 {
20358 /* If the class was unnamed, create a dummy name. */
20363 }
20365 /* Indicate whether this class was declared as a `class' or as a
20366 `struct'. */
20371 /* If this type was already complete, and we see another definition,
20372 that's an error. */
20374 {
20376 type);
20378 type);
20381 }
20386 {
20387 /* Apply attributes now, before any use of the class as a template
20388 argument in its base list. */
20391 }
20393 /* We will have entered the scope containing the class; the names of
20394 base classes should be looked up in that context. For example:
20396 struct A { struct B {}; struct C; };
20397 struct A::C : B {};
20399 is valid. */
20401 /* Get the list of base-classes, if there is one. */
20403 {
20404 /* PR59482: enter the class scope so that base-specifiers are looked
20405 up correctly. */
20409 /* PR59482: get out of the previously pushed class scope so that the
20410 subsequent pops pop the right thing. */
20413 }
20414 else
20417 /* If we're really defining a class, process the base classes.
20418 If they're invalid, fail. */
20423 done:
20424 /* Leave the scope given by the nested-name-specifier. We will
20425 enter the class scope itself while processing the members. */
20430 {
20433 }
20439 out:
20442 }
20444 /* Parse a class-key.
20446 class-key:
20447 class
20448 struct
20449 union
20451 Returns the kind of class-key specified, or none_type to indicate
20452 error. */
20454 static enum tag_types
20456 {
20460 /* Look for the class-key. */
20465 /* Check to see if the TOKEN is a class-key. */
20470 }
20472 /* Parse a type-parameter-key.
20474 type-parameter-key:
20475 class
20476 typename
20477 */
20479 static void
20481 {
20482 /* Look for the type-parameter-key. */
20486 {
20489 /* typename is not allowed in a template template parameter
20490 by the standard until C++1Z. */
20492 "ISO C++ forbids typename key in template template parameter;"
20494 }
20495 else
20499 }
20501 /* Parse an (optional) member-specification.
20503 member-specification:
20504 member-declaration member-specification [opt]
20505 access-specifier : member-specification [opt] */
20507 static void
20509 {
20511 {
20515 /* Peek at the next token. */
20517 /* If it's a `}', or EOF then we've seen all the members. */
20523 /* See if this token is a keyword. */
20526 {
20530 /* Consume the access-specifier. */
20532 /* Remember which access-specifier is active. */
20534 /* Look for the `:'. */
20539 /* Accept #pragmas at class scope. */
20541 {
20544 }
20546 /* Otherwise, the next construction must be a
20547 member-declaration. */
20549 }
20550 }
20551 }
20553 /* Parse a member-declaration.
20555 member-declaration:
20556 decl-specifier-seq [opt] member-declarator-list [opt] ;
20557 function-definition ; [opt]
20558 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20559 using-declaration
20560 template-declaration
20561 alias-declaration
20563 member-declarator-list:
20564 member-declarator
20565 member-declarator-list , member-declarator
20567 member-declarator:
20568 declarator pure-specifier [opt]
20569 declarator constant-initializer [opt]
20570 identifier [opt] : constant-expression
20572 GNU Extensions:
20574 member-declaration:
20575 __extension__ member-declaration
20577 member-declarator:
20578 declarator attributes [opt] pure-specifier [opt]
20579 declarator attributes [opt] constant-initializer [opt]
20580 identifier [opt] attributes [opt] : constant-expression
20582 C++0x Extensions:
20584 member-declaration:
20585 static_assert-declaration */
20587 static void
20589 {
20590 cp_decl_specifier_seq decl_specifiers;
20591 tree prefix_attributes;
20592 tree decl;
20601 /* Check for the `__extension__' keyword. */
20603 {
20604 /* Recurse. */
20606 /* Restore the old value of the PEDANTIC flag. */
20610 }
20612 /* Check for a template-declaration. */
20614 {
20615 /* An explicit specialization here is an error condition, and we
20616 expect the specialization handler to detect and report this. */
20620 else
20624 }
20626 /* Check for a using-declaration. */
20628 {
20630 {
20631 /* Parse the using-declaration. */
20635 }
20636 else
20637 {
20638 tree decl;
20642 /* Note that if we actually see the '=' token after the
20643 identifier, cp_parser_alias_declaration commits the
20644 tentative parse. In that case, we really expects an
20645 alias-declaration. Otherwise, we expect a using
20646 declaration. */
20647 alias_decl_expected =
20653 else
20657 }
20658 }
20660 /* Check for @defs. */
20662 {
20667 {
20672 }
20674 }
20676 /* If the next token is `static_assert' we have a static assertion. */
20678 {
20681 }
20688 /* Parse the decl-specifier-seq. */
20691 CP_PARSER_FLAGS_OPTIONAL,
20694 /* Check for an invalid type-name. */
20698 /* If there is no declarator, then the decl-specifier-seq should
20699 specify a type. */
20701 {
20702 /* If there was no decl-specifier-seq, and the next token is a
20703 `;', then we have something like:
20705 struct S { ; };
20707 [class.mem]
20709 Each member-declaration shall declare at least one member
20710 name of the class. */
20712 {
20716 }
20717 else
20718 {
20719 tree type;
20721 /* See if this declaration is a friend. */
20723 /* If there were decl-specifiers, check to see if there was
20724 a class-declaration. */
20727 /* Nested classes have already been added to the class, but
20728 a `friend' needs to be explicitly registered. */
20730 {
20731 /* If the `friend' keyword was present, the friend must
20732 be introduced with a class-key. */
20735 "in C++03 a class-key must be used "
20737 /* In this case:
20739 template <typename T> struct A {
20740 friend struct A<T>::B;
20741 };
20743 A<T>::B will be represented by a TYPENAME_TYPE, and
20744 therefore not recognized by check_tag_decl. */
20746 {
20750 }
20753 "friend declaration does not name a class or "
20755 else
20758 }
20759 /* If there is no TYPE, an error message will already have
20760 been issued. */
20762 ;
20763 /* An anonymous aggregate has to be handled specially; such
20764 a declaration really declares a data member (with a
20765 particular type), as opposed to a nested class. */
20767 {
20768 /* C++11 9.5/6. */
20771 "a storage class on an anonymous aggregate "
20774 /* Remove constructors and such from TYPE, now that we
20775 know it is an anonymous aggregate. */
20777 /* And make the corresponding data member. */
20780 /* Add it to the class. */
20782 }
20783 else
20784 cp_parser_check_access_in_redeclaration
20787 }
20788 }
20789 else
20790 {
20793 /* Clear attributes from the decl_specifiers but keep them
20794 around as prefix attributes that apply them to the entity
20795 being declared. */
20799 /* See if these declarations will be friends. */
20802 /* Keep going until we hit the `;' at the end of the
20803 declaration. */
20805 {
20807 tree first_attribute;
20809 /* Peek at the next token. */
20812 /* Check for a bitfield declaration. */
20817 {
20818 tree identifier;
20819 tree width;
20821 /* Get the name of the bitfield. Note that we cannot just
20822 check TOKEN here because it may have been invalidated by
20823 the call to cp_lexer_peek_nth_token above. */
20826 else
20829 /* Consume the `:' token. */
20831 /* Get the width of the bitfield. */
20832 width
20835 /* Look for attributes that apply to the bitfield. */
20837 /* Remember which attributes are prefix attributes and
20838 which are not. */
20840 /* Combine the attributes. */
20843 /* Create the bitfield declaration. */
20846 identifier,
20847 sfk_none)
20850 width,
20851 attributes);
20852 }
20853 else
20854 {
20856 tree initializer;
20857 tree asm_specification;
20860 /* Parse the declarator. */
20861 declarator
20866 friend_p);
20868 /* If something went wrong parsing the declarator, make sure
20869 that we at least consume some tokens. */
20871 {
20872 /* Skip to the end of the statement. */
20874 /* If the next token is not a semicolon, that is
20875 probably because we just skipped over the body of
20876 a function. So, we consume a semicolon if
20877 present, but do not issue an error message if it
20878 is not present. */
20880 CPP_SEMICOLON))
20883 }
20886 cp_parser_check_for_definition_in_return_type
20890 /* Look for an asm-specification. */
20892 /* Look for attributes that apply to the declaration. */
20894 /* Remember which attributes are prefix attributes and
20895 which are not. */
20897 /* Combine the attributes. */
20900 /* If it's an `=', then we have a constant-initializer or a
20901 pure-specifier. It is not correct to parse the
20902 initializer before registering the member declaration
20903 since the member declaration should be in scope while
20904 its initializer is processed. However, the rest of the
20905 front end does not yet provide an interface that allows
20906 us to handle this correctly. */
20908 {
20909 /* In [class.mem]:
20911 A pure-specifier shall be used only in the declaration of
20912 a virtual function.
20914 A member-declarator can contain a constant-initializer
20915 only if it declares a static member of integral or
20916 enumeration type.
20918 Therefore, if the DECLARATOR is for a function, we look
20919 for a pure-specifier; otherwise, we look for a
20920 constant-initializer. When we call `grokfield', it will
20921 perform more stringent semantics checks. */
20933 {
20935 /* Don't require a constant rvalue in C++11, since we
20936 might want a reference constant. We'll enforce
20937 constancy later. */
20939 /* Parse the initializer. */
20942 }
20943 else
20944 /* Parse the initializer. */
20946 }
20949 {
20953 else
20955 }
20956 /* Otherwise, there is no initializer. */
20957 else
20960 /* See if we are probably looking at a function
20961 definition. We are certainly not looking at a
20962 member-declarator. Calling `grokfield' has
20963 side-effects, so we must not do it unless we are sure
20964 that we are looking at a member-declarator. */
20967 {
20968 /* The grammar does not allow a pure-specifier to be
20969 used when a member function is defined. (It is
20970 possible that this fact is an oversight in the
20971 standard, since a pure function may be defined
20972 outside of the class-specifier. */
20978 declarator,
20979 attributes);
20982 /* If the member was not a friend, declare it here. */
20985 /* Peek at the next token. */
20987 /* If the next token is a semicolon, consume it. */
20991 }
20992 else
20995 /* Create the declaration. */
21000 {
21003 else
21005 }
21006 }
21010 /* Reset PREFIX_ATTRIBUTES. */
21016 /* If there is any qualification still in effect, clear it
21017 now; we will be starting fresh with the next declarator. */
21021 /* If it's a `,', then there are more declarators. */
21023 {
21026 {
21030 }
21031 }
21032 /* If the next token isn't a `;', then we have a parse error. */
21034 CPP_SEMICOLON))
21035 {
21036 /* The next token might be a ways away from where the
21037 actual semicolon is missing. Find the previous token
21038 and use that for our error position. */
21043 /* Assume that the user meant to provide a semicolon. If
21044 we were to cp_parser_skip_to_end_of_statement, we might
21045 skip to a semicolon inside a member function definition
21046 and issue nonsensical error messages. */
21048 }
21051 {
21052 /* Add DECL to the list of members. */
21061 /* Add DECL to the queue of NSDMI to be parsed later. */
21063 }
21067 }
21068 }
21071 out:
21073 }
21075 /* Parse a pure-specifier.
21077 pure-specifier:
21078 = 0
21080 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21081 Otherwise, ERROR_MARK_NODE is returned. */
21083 static tree
21085 {
21088 /* Look for the `=' token. */
21091 /* Look for the `0' token. */
21100 /* Accept = default or = delete in c++0x mode. */
21103 {
21106 }
21108 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21110 {
21115 }
21117 {
21120 }
21123 }
21125 /* Parse a constant-initializer.
21127 constant-initializer:
21128 = constant-expression
21130 Returns a representation of the constant-expression. */
21132 static tree
21134 {
21135 /* Look for the `=' token. */
21139 /* It is invalid to write:
21141 struct S { static const int i = { 7 }; };
21143 */
21145 {
21148 /* Consume the opening brace. */
21150 /* Skip the initializer. */
21152 /* Look for the trailing `}'. */
21156 }
21159 }
21161 /* Derived classes [gram.class.derived] */
21163 /* Parse a base-clause.
21165 base-clause:
21166 : base-specifier-list
21168 base-specifier-list:
21169 base-specifier ... [opt]
21170 base-specifier-list , base-specifier ... [opt]
21172 Returns a TREE_LIST representing the base-classes, in the order in
21173 which they were declared. The representation of each node is as
21174 described by cp_parser_base_specifier.
21176 In the case that no bases are specified, this function will return
21177 NULL_TREE, not ERROR_MARK_NODE. */
21179 static tree
21181 {
21184 /* Look for the `:' that begins the list. */
21187 /* Scan the base-specifier-list. */
21189 {
21191 tree base;
21194 /* Look for the base-specifier. */
21196 /* Look for the (optional) ellipsis. */
21198 {
21199 /* Consume the `...'. */
21203 }
21205 /* Add BASE to the front of the list. */
21207 {
21209 /* Make this a pack expansion type. */
21213 {
21216 }
21217 }
21218 /* Peek at the next token. */
21220 /* If it's not a comma, then the list is complete. */
21223 /* Consume the `,'. */
21225 }
21227 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21228 base class had a qualified name. However, the next name that
21229 appears is certainly not qualified. */
21235 }
21237 /* Parse a base-specifier.
21239 base-specifier:
21240 :: [opt] nested-name-specifier [opt] class-name
21241 virtual access-specifier [opt] :: [opt] nested-name-specifier
21242 [opt] class-name
21243 access-specifier virtual [opt] :: [opt] nested-name-specifier
21244 [opt] class-name
21246 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21247 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21248 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21249 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21251 static tree
21253 {
21261 tree type;
21263 /* Process the optional `virtual' and `access-specifier'. */
21265 {
21266 /* Peek at the next token. */
21268 /* Process `virtual'. */
21270 {
21272 /* If `virtual' appears more than once, issue an error. */
21274 {
21278 }
21282 /* Consume the `virtual' token. */
21290 /* If more than one access specifier appears, issue an
21291 error. */
21294 {
21298 }
21302 /* Consume the access-specifier. */
21310 }
21311 }
21312 /* It is not uncommon to see programs mechanically, erroneously, use
21313 the 'typename' keyword to denote (dependent) qualified types
21314 as base classes. */
21316 {
21321 else
21323 "keyword %<typename%> not allowed in this context "
21326 }
21328 /* Look for the optional `::' operator. */
21330 /* Look for the nested-name-specifier. The simplest way to
21331 implement:
21333 [temp.res]
21335 The keyword `typename' is not permitted in a base-specifier or
21336 mem-initializer; in these contexts a qualified name that
21337 depends on a template-parameter is implicitly assumed to be a
21338 type name.
21340 is to pretend that we have seen the `typename' keyword at this
21341 point. */
21345 typename_type,
21347 /* If the base class is given by a qualified name, assume that names
21348 we see are type names or templates, as appropriate. */
21354 /* DR 950 allows decltype as a base-specifier. */
21356 else
21357 {
21358 /* Otherwise, look for the class-name. */
21360 class_scope_p,
21361 template_p,
21362 typename_type,
21367 }
21373 }
21375 /* Exception handling [gram.exception] */
21377 /* Parse an (optional) noexcept-specification.
21379 noexcept-specification:
21380 noexcept ( constant-expression ) [opt]
21382 If no noexcept-specification is present, returns NULL_TREE.
21383 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21384 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21385 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21386 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21387 in which case a boolean condition is returned instead. */
21389 static tree
21394 {
21398 /* Peek at the next token. */
21401 /* Is it a noexcept-specification? */
21403 {
21404 tree expr;
21408 {
21412 {
21413 /* Types may not be defined in an exception-specification. */
21415 parser->type_definition_forbidden_message
21420 /* Restore the saved message. */
21422 }
21423 else
21424 {
21427 }
21430 }
21431 else
21432 {
21436 }
21438 /* We cannot build a noexcept-spec right away because this will check
21439 that expr is a constexpr. */
21442 else
21444 }
21445 else
21447 }
21449 /* Parse an (optional) exception-specification.
21451 exception-specification:
21452 throw ( type-id-list [opt] )
21454 Returns a TREE_LIST representing the exception-specification. The
21455 TREE_VALUE of each node is a type. */
21457 static tree
21459 {
21461 tree type_id_list;
21464 /* Peek at the next token. */
21467 /* Is it a noexcept-specification? */
21473 /* If it's not `throw', then there's no exception-specification. */
21477 #if 0
21478 /* Enable this once a lot of code has transitioned to noexcept? */
21482 #endif
21484 /* Consume the `throw'. */
21487 /* Look for the `('. */
21490 /* Peek at the next token. */
21492 /* If it's not a `)', then there is a type-id-list. */
21494 {
21495 /* Types may not be defined in an exception-specification. */
21497 parser->type_definition_forbidden_message
21499 /* Parse the type-id-list. */
21501 /* Restore the saved message. */
21503 }
21504 else
21507 /* Look for the `)'. */
21511 }
21513 /* Parse an (optional) type-id-list.
21515 type-id-list:
21516 type-id ... [opt]
21517 type-id-list , type-id ... [opt]
21519 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21520 in the order that the types were presented. */
21522 static tree
21524 {
21528 {
21530 tree type;
21532 /* Get the next type-id. */
21534 /* Parse the optional ellipsis. */
21536 {
21537 /* Consume the `...'. */
21540 /* Turn the type into a pack expansion expression. */
21542 }
21543 /* Add it to the list. */
21545 /* Peek at the next token. */
21547 /* If it is not a `,', we are done. */
21550 /* Consume the `,'. */
21552 }
21555 }
21557 /* Parse a try-block.
21559 try-block:
21560 try compound-statement handler-seq */
21562 static tree
21564 {
21565 tree try_block;
21579 }
21581 /* Parse a function-try-block.
21583 function-try-block:
21584 try ctor-initializer [opt] function-body handler-seq */
21586 static bool
21588 {
21589 tree compound_stmt;
21590 tree try_block;
21593 /* Look for the `try' keyword. */
21596 /* Let the rest of the front end know where we are. */
21598 /* Parse the function-body. */
21599 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21601 /* We're done with the `try' part. */
21603 /* Parse the handlers. */
21605 /* We're done with the handlers. */
21609 }
21611 /* Parse a handler-seq.
21613 handler-seq:
21614 handler handler-seq [opt] */
21616 static void
21618 {
21620 {
21623 /* Parse the handler. */
21625 /* Peek at the next token. */
21627 /* If it's not `catch' then there are no more handlers. */
21630 }
21631 }
21633 /* Parse a handler.
21635 handler:
21636 catch ( exception-declaration ) compound-statement */
21638 static void
21640 {
21641 tree handler;
21642 tree declaration;
21652 }
21654 /* Parse an exception-declaration.
21656 exception-declaration:
21657 type-specifier-seq declarator
21658 type-specifier-seq abstract-declarator
21659 type-specifier-seq
21660 ...
21662 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21663 ellipsis variant is used. */
21665 static tree
21667 {
21668 cp_decl_specifier_seq type_specifiers;
21672 /* If it's an ellipsis, it's easy to handle. */
21674 {
21675 /* Consume the `...' token. */
21678 }
21680 /* Types may not be defined in exception-declarations. */
21682 parser->type_definition_forbidden_message
21685 /* Parse the type-specifier-seq. */
21689 /* If it's a `)', then there is no declarator. */
21692 else
21699 /* Restore the saved message. */
21706 }
21708 /* Parse a throw-expression.
21710 throw-expression:
21711 throw assignment-expression [opt]
21713 Returns a THROW_EXPR representing the throw-expression. */
21715 static tree
21717 {
21718 tree expression;
21723 /* Figure out whether or not there is an assignment-expression
21724 following the "throw" keyword. */
21732 else
21736 }
21738 /* GNU Extensions */
21740 /* Parse an (optional) asm-specification.
21742 asm-specification:
21743 asm ( string-literal )
21745 If the asm-specification is present, returns a STRING_CST
21746 corresponding to the string-literal. Otherwise, returns
21747 NULL_TREE. */
21749 static tree
21751 {
21753 tree asm_specification;
21755 /* Peek at the next token. */
21757 /* If the next token isn't the `asm' keyword, then there's no
21758 asm-specification. */
21762 /* Consume the `asm' token. */
21764 /* Look for the `('. */
21767 /* Look for the string-literal. */
21770 /* Look for the `)'. */
21774 }
21776 /* Parse an asm-operand-list.
21778 asm-operand-list:
21779 asm-operand
21780 asm-operand-list , asm-operand
21782 asm-operand:
21783 string-literal ( expression )
21784 [ string-literal ] string-literal ( expression )
21786 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21787 each node is the expression. The TREE_PURPOSE is itself a
21788 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21789 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21790 is a STRING_CST for the string literal before the parenthesis. Returns
21791 ERROR_MARK_NODE if any of the operands are invalid. */
21793 static tree
21795 {
21800 {
21801 tree string_literal;
21802 tree expression;
21803 tree name;
21806 {
21807 /* Consume the `[' token. */
21809 /* Read the operand name. */
21814 /* Look for the closing `]'. */
21816 }
21817 else
21819 /* Look for the string-literal. */
21822 /* Look for the `('. */
21824 /* Parse the expression. */
21826 /* Look for the `)'. */
21834 /* Add this operand to the list. */
21836 expression,
21837 asm_operands);
21838 /* If the next token is not a `,', there are no more
21839 operands. */
21842 /* Consume the `,'. */
21844 }
21847 }
21849 /* Parse an asm-clobber-list.
21851 asm-clobber-list:
21852 string-literal
21853 asm-clobber-list , string-literal
21855 Returns a TREE_LIST, indicating the clobbers in the order that they
21856 appeared. The TREE_VALUE of each node is a STRING_CST. */
21858 static tree
21860 {
21864 {
21865 tree string_literal;
21867 /* Look for the string literal. */
21869 /* Add it to the list. */
21871 /* If the next token is not a `,', then the list is
21872 complete. */
21875 /* Consume the `,' token. */
21877 }
21880 }
21882 /* Parse an asm-label-list.
21884 asm-label-list:
21885 identifier
21886 asm-label-list , identifier
21888 Returns a TREE_LIST, indicating the labels in the order that they
21889 appeared. The TREE_VALUE of each node is a label. */
21891 static tree
21893 {
21897 {
21900 /* Look for the identifier. */
21903 {
21906 {
21912 }
21913 }
21914 /* If the next token is not a `,', then the list is
21915 complete. */
21918 /* Consume the `,' token. */
21920 }
21923 }
21925 /* Return TRUE iff the next tokens in the stream are possibly the
21926 beginning of a GNU extension attribute. */
21928 static bool
21930 {
21932 }
21934 /* Return TRUE iff the next tokens in the stream are possibly the
21935 beginning of a standard C++-11 attribute specifier. */
21937 static bool
21939 {
21941 }
21943 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21944 beginning of a standard C++-11 attribute specifier. */
21946 static bool
21948 {
21956 }
21958 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21959 beginning of a GNU extension attribute. */
21961 static bool
21963 {
21967 }
21969 /* Return true iff the next tokens can be the beginning of either a
21970 GNU attribute list, or a standard C++11 attribute sequence. */
21972 static bool
21974 {
21977 }
21979 /* Return true iff the next Nth tokens can be the beginning of either
21980 a GNU attribute list, or a standard C++11 attribute sequence. */
21982 static bool
21984 {
21987 }
21989 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21990 of GNU attributes, or return NULL. */
21992 static tree
21994 {
21998 }
22000 #define CILK_SIMD_FN_CLAUSE_MASK \
22001 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22002 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22003 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22004 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22005 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22007 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22008 vector [(<clauses>)] */
22010 static void
22012 {
22016 {
22021 }
22024 {
22027 paren_scope++;
22028 }
22030 {
22033 paren_scope++;
22035 paren_scope--;
22036 /* Do not push the last ')' */
22039 }
22048 }
22050 /* Parse an (optional) series of attributes.
22052 attributes:
22053 attributes attribute
22055 attribute:
22056 __attribute__ (( attribute-list [opt] ))
22058 The return value is as for cp_parser_gnu_attribute_list. */
22060 static tree
22062 {
22066 {
22068 tree attribute_list;
22071 /* Peek at the next token. */
22073 /* If it's not `__attribute__', then we're done. */
22077 /* Consume the `__attribute__' keyword. */
22079 /* Look for the two `(' tokens. */
22083 /* Peek at the next token. */
22086 /* Parse the attribute-list. */
22088 else
22089 /* If the next token is a `)', then there is no attribute
22090 list. */
22093 /* Look for the two `)' tokens. */
22101 /* Add these new attributes to the list. */
22103 }
22106 }
22108 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22109 "__vector" or "__vector__." */
22113 {
22117 }
22119 /* Parse a GNU attribute-list.
22121 attribute-list:
22122 attribute
22123 attribute-list , attribute
22125 attribute:
22126 identifier
22127 identifier ( identifier )
22128 identifier ( identifier , expression-list )
22129 identifier ( expression-list )
22131 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22132 to an attribute. The TREE_PURPOSE of each node is the identifier
22133 indicating which attribute is in use. The TREE_VALUE represents
22134 the arguments, if any. */
22136 static tree
22138 {
22144 {
22146 tree identifier;
22147 tree attribute;
22149 /* Look for the identifier. We also allow keywords here; for
22150 example `__attribute__ ((const))' is legal. */
22154 {
22157 /* Consume the token, but save it since we need it for the
22158 SIMD enabled function parsing. */
22161 /* Save away the identifier that indicates which attribute
22162 this is. */
22164 /* For keywords, use the canonical spelling, not the
22165 parsed identifier. */
22171 /* Peek at the next token. */
22173 /* If it's an `(', then parse the attribute arguments. */
22175 {
22180 {
22183 }
22184 else
22185 vec = cp_parser_parenthesized_expression_list
22191 else
22192 {
22195 }
22196 /* Save the arguments away. */
22198 }
22200 {
22203 }
22206 {
22207 /* Add this attribute to the list. */
22210 }
22213 }
22214 /* Now, look for more attributes. If the next token isn't a
22215 `,', we're done. */
22219 /* Consume the comma and keep going. */
22221 }
22224 /* We built up the list in reverse order. */
22226 }
22228 /* Parse a standard C++11 attribute.
22230 The returned representation is a TREE_LIST which TREE_PURPOSE is
22231 the scoped name of the attribute, and the TREE_VALUE is its
22232 arguments list.
22234 Note that the scoped name of the attribute is itself a TREE_LIST
22235 which TREE_PURPOSE is the namespace of the attribute, and
22236 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22237 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22238 and which TREE_PURPOSE is directly the attribute name.
22240 Clients of the attribute code should use get_attribute_namespace
22241 and get_attribute_name to get the actual namespace and name of
22242 attributes, regardless of their being GNU or C++11 attributes.
22244 attribute:
22245 attribute-token attribute-argument-clause [opt]
22247 attribute-token:
22248 identifier
22249 attribute-scoped-token
22251 attribute-scoped-token:
22252 attribute-namespace :: identifier
22254 attribute-namespace:
22255 identifier
22257 attribute-argument-clause:
22258 ( balanced-token-seq )
22260 balanced-token-seq:
22261 balanced-token [opt]
22262 balanced-token-seq balanced-token
22264 balanced-token:
22265 ( balanced-token-seq )
22266 [ balanced-token-seq ]
22267 { balanced-token-seq }. */
22269 static tree
22271 {
22275 /* First, parse name of the the attribute, a.k.a
22276 attribute-token. */
22293 {
22294 /* We are seeing a scoped attribute token. */
22304 else
22305 {
22309 }
22311 NULL_TREE);
22313 }
22314 else
22315 {
22317 NULL_TREE);
22318 /* C++11 noreturn attribute is equivalent to GNU's. */
22321 /* C++14 deprecated attribute is equivalent to GNU's. */
22323 {
22326 "%<deprecated%> is a C++14 feature;"
22329 }
22330 }
22332 /* Now parse the optional argument clause of the attribute. */
22337 {
22343 /* A GNU attribute that takes an identifier in parameter. */
22346 vec = cp_parser_parenthesized_expression_list
22352 else
22353 {
22356 }
22360 else
22362 }
22365 }
22367 /* Parse a list of standard C++-11 attributes.
22369 attribute-list:
22370 attribute [opt]
22371 attribute-list , attribute[opt]
22372 attribute ...
22373 attribute-list , attribute ...
22374 */
22376 static tree
22378 {
22383 {
22388 {
22391 }
22396 }
22399 }
22401 /* Parse a standard C++-11 attribute specifier.
22403 attribute-specifier:
22404 [ [ attribute-list ] ]
22405 alignment-specifier
22407 alignment-specifier:
22408 alignas ( type-id ... [opt] )
22409 alignas ( alignment-expression ... [opt] ). */
22411 static tree
22413 {
22419 {
22428 else
22429 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22430 when we are sure that we have actually parsed them. */
22432 }
22433 else
22434 {
22435 tree alignas_expr;
22437 /* Look for an alignment-specifier. */
22449 {
22452 }
22458 {
22462 alignas_expr =
22469 }
22472 {
22475 }
22479 /* Build the C++-11 representation of an 'aligned'
22480 attribute. */
22481 attributes =
22485 }
22488 }
22490 /* Parse a standard C++-11 attribute-specifier-seq.
22492 attribute-specifier-seq:
22493 attribute-specifier-seq [opt] attribute-specifier
22494 */
22496 static tree
22498 {
22502 {
22511 }
22515 }
22517 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22518 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22519 current value of the PEDANTIC flag, regardless of whether or not
22520 the `__extension__' keyword is present. The caller is responsible
22521 for restoring the value of the PEDANTIC flag. */
22523 static bool
22525 {
22526 /* Save the old value of the PEDANTIC flag. */
22530 {
22531 /* Consume the `__extension__' token. */
22533 /* We're not being pedantic while the `__extension__' keyword is
22534 in effect. */
22538 }
22541 }
22543 /* Parse a label declaration.
22545 label-declaration:
22546 __label__ label-declarator-seq ;
22548 label-declarator-seq:
22549 identifier , label-declarator-seq
22550 identifier */
22552 static void
22554 {
22555 /* Look for the `__label__' keyword. */
22559 {
22560 tree identifier;
22562 /* Look for an identifier. */
22564 /* If we failed, stop. */
22567 /* Declare it as a label. */
22569 /* If the next token is a `;', stop. */
22572 /* Look for the `,' separating the label declarations. */
22574 }
22576 /* Look for the final `;'. */
22578 }
22580 /* Support Functions */
22582 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22583 NAME should have one of the representations used for an
22584 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22585 is returned. If PARSER->SCOPE is a dependent type, then a
22586 SCOPE_REF is returned.
22588 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22589 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22590 was formed. Abstractly, such entities should not be passed to this
22591 function, because they do not need to be looked up, but it is
22592 simpler to check for this special case here, rather than at the
22593 call-sites.
22595 In cases not explicitly covered above, this function returns a
22596 DECL, OVERLOAD, or baselink representing the result of the lookup.
22597 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22598 is returned.
22600 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22601 (e.g., "struct") that was used. In that case bindings that do not
22602 refer to types are ignored.
22604 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22605 ignored.
22607 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22608 are ignored.
22610 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22611 types.
22613 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22614 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22615 NULL_TREE otherwise. */
22617 static tree
22624 location_t name_location)
22625 {
22626 tree decl;
22629 /* Assume that the lookup will be unambiguous. */
22633 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22634 no longer valid. Note that if we are parsing tentatively, and
22635 the parse fails, OBJECT_TYPE will be automatically restored. */
22641 /* A template-id has already been resolved; there is no lookup to
22642 do. */
22646 {
22650 }
22652 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22653 it should already have been checked to make sure that the name
22654 used matches the type being destroyed. */
22656 {
22657 tree type;
22659 /* Figure out to which type this destructor applies. */
22664 else
22666 /* If that's not a class type, there is no destructor. */
22673 /* If it was a class type, return the destructor. */
22675 }
22677 /* By this point, the NAME should be an ordinary identifier. If
22678 the id-expression was a qualified name, the qualifying scope is
22679 stored in PARSER->SCOPE at this point. */
22682 /* Perform the lookup. */
22684 {
22690 /* If the SCOPE is dependent, the lookup must be deferred until
22691 the template is instantiated -- unless we are explicitly
22692 looking up names in uninstantiated templates. Even then, we
22693 cannot look up the name if the scope is not a class type; it
22694 might, for example, be a template type parameter. */
22699 /* Defer lookup. */
22701 else
22702 {
22705 /* If PARSER->SCOPE is a dependent type, then it must be a
22706 class type, and we must not be checking dependencies;
22707 otherwise, we would have processed this lookup above. So
22708 that PARSER->SCOPE is not considered a dependent base by
22709 lookup_member, we must enter the scope here. */
22713 /* If the PARSER->SCOPE is a template specialization, it
22714 may be instantiated during name lookup. In that case,
22715 errors may be issued. Even if we rollback the current
22716 tentative parse, those errors are valid. */
22721 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22722 lookup result and the nested-name-specifier nominates a class C:
22723 * if the name specified after the nested-name-specifier, when
22724 looked up in C, is the injected-class-name of C (Clause 9), or
22725 * if the name specified after the nested-name-specifier is the
22726 same as the identifier or the simple-template-id's template-
22727 name in the last component of the nested-name-specifier,
22728 the name is instead considered to name the constructor of
22729 class C. [ Note: for example, the constructor is not an
22730 acceptable lookup result in an elaborated-type-specifier so
22731 the constructor would not be used in place of the
22732 injected-class-name. --end note ] Such a constructor name
22733 shall be used only in the declarator-id of a declaration that
22734 names a constructor or in a using-declaration. */
22742 /* If we have a single function from a using decl, pull it out. */
22749 }
22751 /* If the scope is a dependent type and either we deferred lookup or
22752 we did lookup but didn't find the name, rememeber the name. */
22755 {
22757 {
22758 tree type;
22760 /* The resolution to Core Issue 180 says that `struct
22761 A::B' should be considered a type-name, even if `A'
22762 is dependent. */
22767 }
22771 CPP_CLOSE_PAREN)))
22775 else
22778 is_template);
22779 }
22782 }
22784 {
22785 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22786 OBJECT_TYPE is not a class. */
22788 /* If the OBJECT_TYPE is a template specialization, it may
22789 be instantiated during name lookup. In that case, errors
22790 may be issued. Even if we rollback the current tentative
22791 parse, those errors are valid. */
22793 name,
22796 tf_warning_or_error);
22797 else
22801 /* Look it up in the enclosing context. */
22807 }
22808 else
22809 {
22815 }
22817 /* If the lookup failed, let our caller know. */
22821 /* Pull out the template from an injected-class-name (or multiple). */
22825 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22827 {
22830 /* The error message we have to print is too complicated for
22831 cp_parser_error, so we incorporate its actions directly. */
22833 {
22835 name);
22837 }
22839 }
22847 /* If we have resolved the name of a member declaration, check to
22848 see if the declaration is accessible. When the name resolves to
22849 set of overloaded functions, accessibility is checked when
22850 overload resolution is done.
22852 During an explicit instantiation, access is not checked at all,
22853 as per [temp.explicit]. */
22860 }
22862 /* Like cp_parser_lookup_name, but for use in the typical case where
22863 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22864 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22866 static tree
22868 {
22870 none_type,
22875 location);
22876 }
22878 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22879 the current context, return the TYPE_DECL. If TAG_NAME_P is
22880 true, the DECL indicates the class being defined in a class-head,
22881 or declared in an elaborated-type-specifier.
22883 Otherwise, return DECL. */
22885 static tree
22887 {
22888 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22889 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22891 struct A {
22892 template <typename T> struct B;
22893 };
22895 template <typename T> struct A::B {};
22897 Similarly, in an elaborated-type-specifier:
22899 namespace N { struct X{}; }
22901 struct A {
22902 template <typename T> friend struct N::X;
22903 };
22905 However, if the DECL refers to a class type, and we are in
22906 the scope of the class, then the name lookup automatically
22907 finds the TYPE_DECL created by build_self_reference rather
22908 than a TEMPLATE_DECL. For example, in:
22910 template <class T> struct S {
22911 S s;
22912 };
22914 there is no need to handle such case. */
22920 }
22922 /* If too many, or too few, template-parameter lists apply to the
22923 declarator, issue an error message. Returns TRUE if all went well,
22924 and FALSE otherwise. */
22926 static bool
22929 location_t declarator_location)
22930 {
22932 {
22934 {
22942 /* If the DECLARATOR has the form `X<y>' then it uses one
22943 additional level of template parameters. */
22946 return cp_parser_check_template_parameters
22948 }
22963 }
22965 }
22967 /* NUM_TEMPLATES were used in the current declaration. If that is
22968 invalid, return FALSE and issue an error messages. Otherwise,
22969 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22970 declarator and we can print more accurate diagnostics. */
22972 static bool
22975 location_t location,
22977 {
22978 /* If there are the same number of template classes and parameter
22979 lists, that's OK. */
22982 /* If there are more, but only one more, then we are referring to a
22983 member template. That's OK too. */
22986 /* If there are more template classes than parameter lists, we have
22987 something like:
22989 template <class T> void S<T>::R<T>::f (); */
22991 {
23001 else
23004 }
23005 /* Otherwise, there are too many template parameter lists. We have
23006 something like:
23008 template <class T> template <class U> void S::f(); */
23011 }
23013 /* Parse an optional `::' token indicating that the following name is
23014 from the global namespace. If so, PARSER->SCOPE is set to the
23015 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23016 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23017 Returns the new value of PARSER->SCOPE, if the `::' token is
23018 present, and NULL_TREE otherwise. */
23020 static tree
23022 {
23025 /* Peek at the next token. */
23027 /* If we're looking at a `::' token then we're starting from the
23028 global namespace, not our current location. */
23030 {
23031 /* Consume the `::' token. */
23033 /* Set the SCOPE so that we know where to start the lookup. */
23039 }
23041 {
23045 }
23048 }
23050 /* Returns TRUE if the upcoming token sequence is the start of a
23051 constructor declarator. If FRIEND_P is true, the declarator is
23052 preceded by the `friend' specifier. */
23054 static bool
23056 {
23059 tree nested_name_specifier;
23062 /* The common case is that this is not a constructor declarator, so
23063 try to avoid doing lots of work if at all possible. It's not
23064 valid declare a constructor at function scope. */
23067 /* And only certain tokens can begin a constructor declarator. */
23075 /* Parse tentatively; we are going to roll back all of the tokens
23076 consumed here. */
23078 /* Assume that we are looking at a constructor declarator. */
23081 /* Look for the optional `::' operator. */
23084 /* Look for the nested-name-specifier. */
23085 nested_name_specifier
23096 /* Outside of a class-specifier, there must be a
23097 nested-name-specifier. */
23103 /* If we have a class scope, this is easy; DR 147 says that S::S always
23104 names the constructor, and no other qualified name could. */
23107 {
23117 }
23118 /* If we still think that this might be a constructor-declarator,
23119 look for a class-name. */
23121 {
23122 /* If we have:
23124 template <typename T> struct S {
23125 S();
23126 };
23128 we must recognize that the nested `S' names a class. */
23129 tree type_decl;
23133 none_type,
23137 /* If there was no class-name, then this is not a constructor.
23138 Otherwise, if we are in a class-specifier and we aren't
23139 handling a friend declaration, check that its type matches
23140 current_class_type (c++/38313). Note: error_mark_node
23141 is left alone for error recovery purposes. */
23143 && (outside_class_specifier_p
23148 /* If we're still considering a constructor, we have to see a `(',
23149 to begin the parameter-declaration-clause, followed by either a
23150 `)', an `...', or a decl-specifier. We need to check for a
23151 type-specifier to avoid being fooled into thinking that:
23153 S (f) (int);
23155 is a constructor. (It is actually a function named `f' that
23156 takes one parameter (of type `int') and returns a value of type
23157 `S'. */
23165 /* A parameter declaration begins with a decl-specifier,
23166 which is either the "attribute" keyword, a storage class
23167 specifier, or (usually) a type-specifier. */
23169 {
23170 tree type;
23174 /* Names appearing in the type-specifier should be looked up
23175 in the scope of the class. */
23178 else
23179 {
23182 {
23186 {
23189 }
23190 }
23192 }
23194 /* Inside the constructor parameter list, surrounding
23195 template-parameter-lists do not apply. */
23196 saved_num_template_parameter_lists
23200 /* Look for the type-specifier. */
23202 CP_PARSER_FLAGS_NONE,
23208 parser->num_template_parameter_lists
23211 /* Leave the scope of the class. */
23216 }
23217 }
23219 /* We did not really want to consume any tokens. */
23223 }
23225 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23226 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23227 they must be performed once we are in the scope of the function.
23229 Returns the function defined. */
23231 static tree
23232 cp_parser_function_definition_from_specifiers_and_declarator
23235 tree attributes,
23237 {
23238 tree fn;
23241 /* Begin the function-definition. */
23244 /* The things we're about to see are not directly qualified by any
23245 template headers we've seen thus far. */
23248 /* If there were names looked up in the decl-specifier-seq that we
23249 did not check, check them now. We must wait until we are in the
23250 scope of the function to perform the checks, since the function
23251 might be a friend. */
23255 {
23258 }
23261 {
23262 /* Skip the entire function. */
23265 }
23267 {
23268 /* Seen already, skip it. An error message has already been output. */
23272 /* If this is a function from a class, pop the nested class. */
23275 }
23276 else
23277 {
23278 timevar_id_t tv;
23281 else
23287 }
23290 }
23292 /* Parse the part of a function-definition that follows the
23293 declarator. INLINE_P is TRUE iff this function is an inline
23294 function defined within a class-specifier.
23296 Returns the function defined. */
23298 static tree
23301 {
23302 tree fn;
23308 bool fully_implicit_function_template_p
23311 tree implicit_template_parms
23314 cp_binding_level* implicit_template_scope
23320 /* If the next token is `return', then the code may be trying to
23321 make use of the "named return value" extension that G++ used to
23322 support. */
23325 {
23326 /* Consume the `return' keyword. */
23328 /* Look for the identifier that indicates what value is to be
23329 returned. */
23331 /* Issue an error message. */
23334 /* Skip tokens until we reach the start of the function body. */
23336 {
23343 }
23344 }
23345 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23346 anything declared inside `f'. */
23347 saved_in_unbraced_linkage_specification_p
23350 /* Inside the function, surrounding template-parameter-lists do not
23351 apply. */
23352 saved_num_template_parameter_lists
23358 /* If the next token is `try', `__transaction_atomic', or
23359 `__transaction_relaxed`, then we are looking at either function-try-block
23360 or function-transaction-block. Note that all of these include the
23361 function-body. */
23364 RID_TRANSACTION_ATOMIC);
23366 RID_TRANSACTION_RELAXED))
23368 RID_TRANSACTION_RELAXED);
23371 else
23372 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23377 /* Finish the function. */
23380 /* Generate code for it, if necessary. */
23382 /* Restore the saved values. */
23383 parser->in_unbraced_linkage_specification_p
23385 parser->num_template_parameter_lists
23389 parser->fully_implicit_function_template_p
23391 parser->implicit_template_parms
23393 parser->implicit_template_scope
23400 }
23402 /* Parse a template-declaration, assuming that the `export' (and
23403 `extern') keywords, if present, has already been scanned. MEMBER_P
23404 is as for cp_parser_template_declaration. */
23406 static void
23408 {
23411 tree parameter_list;
23416 /* Look for the `template' keyword. */
23421 /* And the `<'. */
23425 {
23426 /* 14.5.2.2 [temp.mem]
23428 A local class shall not have member templates. */
23433 }
23434 /* [temp]
23436 A template ... shall not have C linkage. */
23438 {
23440 /* Give it C++ linkage to avoid confusing other parts of the
23441 front end. */
23444 }
23445 else
23448 /* We cannot perform access checks on the template parameter
23449 declarations until we know what is being declared, just as we
23450 cannot check the decl-specifier list. */
23453 /* If the next token is `>', then we have an invalid
23454 specialization. Rather than complain about an invalid template
23455 parameter, issue an error message here. */
23457 {
23461 }
23462 else
23463 {
23464 /* Parse the template parameters. */
23466 }
23468 /* Get the deferred access checks from the parameter list. These
23469 will be checked once we know what is being declared, as for a
23470 member template the checks must be performed in the scope of the
23471 class containing the member. */
23474 /* Look for the `>'. */
23476 /* We just processed one more parameter list. */
23478 /* If the next token is `template', there are more template
23479 parameters. */
23481 RID_TEMPLATE))
23486 else
23487 {
23488 /* There are no access checks when parsing a template, as we do not
23489 know if a specialization will be a friend. */
23493 checks,
23494 member_p,
23499 /* If this is a member template declaration, let the front
23500 end know. */
23502 {
23507 }
23512 }
23513 /* We are done with the current parameter list. */
23518 /* Finish up. */
23521 /* Check the template arguments for a literal operator template. */
23525 {
23529 else
23530 {
23533 {
23539 }
23541 {
23549 }
23550 else
23552 }
23554 {
23557 " Expected non-type template argument pack <char...>"
23559 decl);
23560 else
23563 decl);
23564 }
23565 }
23566 /* Register member declarations. */
23569 /* For the erroneous case of a template with C linkage, we pushed an
23570 implicit C++ linkage scope; exit that scope now. */
23573 /* If DECL is a function template, we must return to parse it later.
23574 (Even though there is no definition, there might be default
23575 arguments that need handling.) */
23579 }
23581 /* Perform the deferred access checks from a template-parameter-list.
23582 CHECKS is a TREE_LIST of access checks, as returned by
23583 get_deferred_access_checks. */
23585 static void
23586 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23587 {
23591 }
23593 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23594 `function-definition' sequence that follows a template header.
23595 If MEMBER_P is true, this declaration appears in a class scope.
23597 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23598 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23600 static tree
23606 {
23609 cp_decl_specifier_seq decl_specifiers;
23613 /* This function is only used when processing a template
23614 declaration. */
23618 /* Defer access checks until we know what is being declared. */
23621 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23622 alternative. */
23625 CP_PARSER_FLAGS_OPTIONAL,
23631 /* There are no template typedefs. */
23633 {
23637 }
23639 /* Gather up the access checks that occurred the
23640 decl-specifier-seq. */
23643 /* Check for the declaration of a template class. */
23645 {
23647 {
23650 /* In this case:
23652 struct C {
23653 friend template <typename T> struct A<T>::B;
23654 };
23656 A<T>::B will be represented by a TYPENAME_TYPE, and
23657 therefore not recognized by shadow_tag. */
23659 && !decl
23666 else
23669 /* Perform access checks for template parameters. */
23671 }
23672 }
23674 /* Complain about missing 'typename' or other invalid type names. */
23677 {
23678 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23679 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23680 the rest of this declaration. */
23683 }
23685 /* If it's not a template class, try for a template function. If
23686 the next token is a `;', then this declaration does not declare
23687 anything. But, if there were errors in the decl-specifiers, then
23688 the error might well have come from an attempted class-specifier.
23689 In that case, there's no need to warn about a missing declarator. */
23693 {
23696 checks,
23698 member_p,
23699 declares_class_or_enum,
23701 NULL);
23703 /* 7.1.1-1 [dcl.stc]
23705 A storage-class-specifier shall not be specified in an explicit
23706 specialization... */
23708 && explicit_specialization_p
23710 {
23714 }
23718 }
23720 /* Look for a trailing `;' after the declaration. */
23726 out:
23729 /* Clear any current qualification; whatever comes next is the start
23730 of something new. */
23736 }
23738 /* Parse a cast-expression that is not the operand of a unary "&". */
23740 static tree
23742 {
23745 }
23747 /* Parse a functional cast to TYPE. Returns an expression
23748 representing the cast. */
23750 static tree
23752 {
23754 tree expression_list;
23755 tree cast;
23762 {
23770 tf_warning_or_error);
23771 }
23780 else
23781 {
23784 }
23787 tf_warning_or_error);
23788 /* [expr.const]/1: In an integral constant expression "only type
23789 conversions to integral or enumeration type can be used". */
23795 NIC_CONSTRUCTOR))
23798 }
23800 /* Save the tokens that make up the body of a member function defined
23801 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23802 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23803 specifiers applied to the declaration. Returns the FUNCTION_DECL
23804 for the member function. */
23806 static tree
23810 tree attributes)
23811 {
23814 tree fn;
23816 /* Create the FUNCTION_DECL. */
23819 /* If something went badly wrong, bail out now. */
23821 {
23822 /* If there's a function-body, skip it. */
23827 }
23829 /* Remember it, if there default args to post process. */
23832 /* Save away the tokens that make up the body of the
23833 function. */
23835 /* Handle function try blocks. */
23838 /* We can have braced-init-list mem-initializers before the fn body. */
23840 {
23843 {
23844 /* cache_group will stop after an un-nested { } pair, too. */
23848 /* variadic mem-inits have ... after the ')'. */
23851 }
23852 }
23854 /* Handle function try blocks. */
23859 /* Save away the inline definition; we will process it when the
23860 class is complete. */
23864 /* We need to know that this was defined in the class, so that
23865 friend templates are handled correctly. */
23868 /* Add FN to the queue of functions to be parsed later. */
23872 }
23874 /* Save the tokens that make up the in-class initializer for a non-static
23875 data member. Returns a DEFAULT_ARG. */
23877 static tree
23879 {
23881 }
23883 /* Parse a template-argument-list, as well as the trailing ">" (but
23884 not the opening "<"). See cp_parser_template_argument_list for the
23885 return value. */
23887 static tree
23889 {
23890 tree arguments;
23891 tree saved_scope;
23892 tree saved_qualifying_scope;
23893 tree saved_object_scope;
23898 /* [temp.names]
23900 When parsing a template-id, the first non-nested `>' is taken as
23901 the end of the template-argument-list rather than a greater-than
23902 operator. */
23903 saved_greater_than_is_operator_p
23906 /* Parsing the argument list may modify SCOPE, so we save it
23907 here. */
23911 /* We need to evaluate the template arguments, even though this
23912 template-id may be nested within a "sizeof". */
23917 /* Parse the template-argument-list itself. */
23921 else
23923 /* Look for the `>' that ends the template-argument-list. If we find
23924 a '>>' instead, it's probably just a typo. */
23926 {
23928 {
23929 /* In C++0x, a `>>' in a template argument list or cast
23930 expression is considered to be two separate `>'
23931 tokens. So, change the current token to a `>', but don't
23932 consume it: it will be consumed later when the outer
23933 template argument list (or cast expression) is parsed.
23934 Note that this replacement of `>' for `>>' is necessary
23935 even if we are parsing tentatively: in the tentative
23936 case, after calling
23937 cp_parser_enclosed_template_argument_list we will always
23938 throw away all of the template arguments and the first
23939 closing `>', either because the template argument list
23940 was erroneous or because we are replacing those tokens
23941 with a CPP_TEMPLATE_ID token. The second `>' (which will
23942 not have been thrown away) is needed either to close an
23943 outer template argument list or to complete a new-style
23944 cast. */
23947 }
23949 {
23950 /* If we're in a nested template argument list, the '>>' has
23951 to be a typo for '> >'. We emit the error message, but we
23952 continue parsing and we push a '>' as next token, so that
23953 the argument list will be parsed correctly. Note that the
23954 global source location is still on the token before the
23955 '>>', so we need to say explicitly where we want it. */
23961 }
23962 else
23963 {
23964 /* If this is not a nested template argument list, the '>>'
23965 is a typo for '>'. Emit an error message and continue.
23966 Same deal about the token location, but here we can get it
23967 right by consuming the '>>' before issuing the diagnostic. */
23970 "spurious %<>>%>, use %<>%> to terminate "
23972 }
23973 }
23974 else
23976 /* The `>' token might be a greater-than operator again now. */
23977 parser->greater_than_is_operator_p
23979 /* Restore the SAVED_SCOPE. */
23987 }
23989 /* MEMBER_FUNCTION is a member function, or a friend. If default
23990 arguments, or the body of the function have not yet been parsed,
23991 parse them now. */
23993 static void
23995 {
23997 /* If this member is a template, get the underlying
23998 FUNCTION_DECL. */
24002 /* There should not be any class definitions in progress at this
24003 point; the bodies of members are only parsed outside of all class
24004 definitions. */
24006 /* While we're parsing the member functions we might encounter more
24007 classes. We want to handle them right away, but we don't want
24008 them getting mixed up with functions that are currently in the
24009 queue. */
24012 /* Make sure that any template parameters are in scope. */
24015 /* If the body of the function has not yet been parsed, parse it
24016 now. */
24018 {
24019 tree function_scope;
24022 /* The function is no longer pending; we are processing it. */
24027 /* If this is a local class, enter the scope of the containing
24028 function. */
24033 /* Push the body of the function onto the lexer stack. */
24036 /* Let the front end know that we going to be defining this
24037 function. */
24041 /* Don't do access checking if it is a templated function. */
24045 /* #pragma omp declare reduction needs special parsing. */
24047 {
24052 }
24053 else
24054 /* Now, parse the body of the function. */
24061 /* Leave the scope of the containing function. */
24065 }
24067 /* Remove any template parameters from the symbol table. */
24070 /* Restore the queue. */
24073 }
24075 /* If DECL contains any default args, remember it on the unparsed
24076 functions queue. */
24078 static void
24080 {
24081 tree probe;
24084 probe;
24087 {
24091 }
24092 }
24094 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24095 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24096 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24097 from the parameter-type-list. */
24099 static tree
24102 {
24104 tree parsed_arg;
24110 /* Push the saved tokens for the default argument onto the parser's
24111 lexer stack. */
24117 /* Parse the default argument. */
24128 {
24129 /* In a non-template class, check conversions now. In a template,
24130 we'll wait and instantiate these as needed. */
24133 tf_warning_or_error);
24134 else
24136 }
24138 /* If the token stream has not been completely used up, then
24139 there was extra junk after the end of the default
24140 argument. */
24142 {
24145 else
24147 }
24149 /* Revert to the main lexer. */
24153 }
24155 /* FIELD is a non-static data member with an initializer which we saved for
24156 later; parse it now. */
24158 static void
24160 {
24161 tree def;
24168 NULL_TREE);
24174 }
24176 /* FN is a FUNCTION_DECL which may contains a parameter with an
24177 unparsed DEFAULT_ARG. Parse the default args now. This function
24178 assumes that the current scope is the scope in which the default
24179 argument should be processed. */
24181 static void
24183 {
24187 /* While we're parsing the default args, we might (due to the
24188 statement expression extension) encounter more classes. We want
24189 to handle them right away, but we don't want them getting mixed
24190 up with default args that are currently in the queue. */
24193 /* Local variable names (and the `this' keyword) may not appear
24194 in a default argument. */
24205 {
24207 tree parsed_arg;
24209 tree copy;
24216 /* This can happen for a friend declaration for a function
24217 already declared with default arguments. */
24220 parsed_arg
24222 default_arg,
24225 {
24227 }
24231 /* Update any instantiations we've already created. */
24235 }
24239 /* Make sure no default arg is missing. */
24242 /* Restore the state of local_variables_forbidden_p. */
24245 /* Restore the queue. */
24247 }
24249 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24251 sizeof ... ( identifier )
24253 where the 'sizeof' token has already been consumed. */
24255 static tree
24257 {
24258 /* Consume the `...'. */
24265 else
24273 /* The name is not qualified. */
24291 }
24293 /* Parse the operand of `sizeof' (or a similar operator). Returns
24294 either a TYPE or an expression, depending on the form of the
24295 input. The KEYWORD indicates which kind of expression we have
24296 encountered. */
24298 static tree
24300 {
24307 /* If it's a `...', then we are computing the length of a parameter
24308 pack. */
24313 /* Types cannot be defined in a `sizeof' expression. Save away the
24314 old message. */
24316 /* And create the new one. */
24322 /* The restrictions on constant-expressions do not apply inside
24323 sizeof expressions. */
24324 saved_integral_constant_expression_p
24326 saved_non_integral_constant_expression_p
24330 /* Do not actually evaluate the expression. */
24333 /* If it's a `(', then we might be looking at the type-id
24334 construction. */
24336 {
24339 /* We can't be sure yet whether we're looking at a type-id or an
24340 expression. */
24342 /* Note: as a GNU Extension, compound literals are considered
24343 postfix-expressions as they are in C99, so they are valid
24344 arguments to sizeof. See comment in cp_parser_cast_expression
24345 for details. */
24348 else
24349 {
24352 /* Look for the type-id. */
24354 /* Look for the closing `)'. */
24357 }
24359 /* If all went well, then we're done. */
24361 {
24362 cp_decl_specifier_seq decl_specs;
24364 /* Build a trivial decl-specifier-seq. */
24368 /* Call grokdeclarator to figure out what type this is. */
24371 TYPENAME,
24374 }
24375 }
24377 /* If the type-id production did not work out, then we must be
24378 looking at the unary-expression production. */
24382 /* Go back to evaluating expressions. */
24386 /* Free the message we created. */
24388 /* And restore the old one. */
24390 parser->integral_constant_expression_p
24392 parser->non_integral_constant_expression_p
24396 }
24398 /* If the current declaration has no declarator, return true. */
24400 static bool
24402 {
24403 /* If the next token is a `;' or a `,' then there is no
24404 declarator. */
24407 }
24409 /* Update the DECL_SPECS to reflect the storage class indicated by
24410 KEYWORD. */
24412 static void
24417 {
24418 cp_storage_class storage_class;
24421 {
24425 }
24427 {
24430 }
24435 {
24438 }
24441 {
24459 }
24463 /* A storage class specifier cannot be applied alongside a typedef
24464 specifier. If there is a typedef specifier present then set
24465 conflicting_specifiers_p which will trigger an error later
24466 on in grokdeclarator. */
24469 }
24471 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24472 is true, the type is a class or enum definition. */
24474 static void
24476 tree type_spec,
24479 {
24482 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24483 (with, for example, in "typedef int wchar_t;") we remember that
24484 this is what happened. In system headers, we ignore these
24485 declarations so that G++ can work with system headers that are not
24486 C++-safe. */
24488 && !type_definition_p
24498 {
24501 ds_redefined_builtin_type_spec,
24502 token);
24504 {
24508 }
24509 }
24512 else
24513 {
24518 }
24519 }
24521 /* True iff TOKEN is the GNU keyword __thread. */
24523 static bool
24525 {
24528 }
24530 /* Set the location for a declarator specifier and check if it is
24531 duplicated.
24533 DECL_SPECS is the sequence of declarator specifiers onto which to
24534 set the location.
24536 DS is the single declarator specifier to set which location is to
24537 be set onto the existing sequence of declarators.
24539 LOCATION is the location for the declarator specifier to
24540 consider. */
24542 static void
24545 {
24554 {
24558 }
24559 else
24560 {
24562 {
24566 else
24567 {
24570 OPT_Wlong_long,
24572 }
24573 }
24575 {
24580 else
24582 }
24583 else
24584 {
24600 "__complex"
24601 };
24604 }
24605 }
24606 }
24608 /* Return true iff the declarator specifier DS is present in the
24609 sequence of declarator specifiers DECL_SPECS. */
24611 bool
24613 cp_decl_spec ds)
24614 {
24621 }
24623 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24624 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24626 static bool
24628 {
24630 }
24632 /* Issue an error message indicating that TOKEN_DESC was expected.
24633 If KEYWORD is true, it indicated this function is called by
24634 cp_parser_require_keword and the required token can only be
24635 a indicated keyword. */
24637 static void
24639 required_token token_desc,
24641 {
24643 {
24712 }
24714 {
24716 {
24795 }
24796 }
24797 else
24799 }
24803 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24804 issue an error message indicating that TOKEN_DESC was expected.
24806 Returns the token consumed, if the token had the appropriate type.
24807 Otherwise, returns NULL. */
24812 required_token token_desc)
24813 {
24816 else
24817 {
24818 /* Output the MESSAGE -- unless we're parsing tentatively. */
24822 }
24823 }
24825 /* An error message is produced if the next token is not '>'.
24826 All further tokens are skipped until the desired token is
24827 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24829 static void
24831 {
24832 /* Current level of '< ... >'. */
24834 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24837 /* Are we ready, yet? If not, issue error message. */
24841 /* Skip tokens until the desired token is found. */
24843 {
24844 /* Peek at the next token. */
24846 {
24854 /* C++0x views the `>>' operator as two `>' tokens, but
24855 C++98 does not. */
24858 {
24859 /* We've hit a `>>' where the first `>' closes the
24860 template argument list, and the second `>' is
24861 spurious. Just consume the `>>' and stop; we've
24862 already produced at least one error. */
24865 }
24866 /* Fall through for C++0x, so we handle the second `>' in
24867 the `>>'. */
24871 {
24872 /* We've reached the token we want, consume it and stop. */
24875 }
24894 /* The '>' was probably forgotten, don't look further. */
24899 }
24901 /* Consume this token. */
24903 }
24904 }
24906 /* If the next token is the indicated keyword, consume it. Otherwise,
24907 issue an error message indicating that TOKEN_DESC was expected.
24909 Returns the token consumed, if the token had the appropriate type.
24910 Otherwise, returns NULL. */
24915 required_token token_desc)
24916 {
24920 {
24923 }
24926 }
24928 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24929 function-definition. */
24931 static bool
24933 {
24936 /* A ctor-initializer begins with a `:'. */
24938 /* A function-try-block begins with `try'. */
24940 /* A function-transaction-block begins with `__transaction_atomic'
24941 or `__transaction_relaxed'. */
24944 /* The named return value extension begins with `return'. */
24946 }
24948 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24949 definition. */
24951 static bool
24953 {
24960 }
24962 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24963 C++0x) ending a template-argument. */
24965 static bool
24967 {
24975 }
24977 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24978 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24980 static bool
24983 {
24989 /* Check for the sequence `<::' in the original code. It would be lexed as
24990 `[:', where `[' is a digraph, and there is no whitespace before
24991 `:'. */
24993 {
24998 }
25000 }
25002 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25003 or none_type otherwise. */
25005 static enum tag_types
25007 {
25009 {
25019 }
25020 }
25022 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25023 or none_type otherwise or if the token is null. */
25025 static enum tag_types
25027 {
25032 {
25040 }
25041 }
25043 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25045 static void
25047 {
25051 {
25055 type))
25058 }
25059 }
25061 /* Issue an error message if DECL is redeclared with different
25062 access than its original declaration [class.access.spec/3].
25063 This applies to nested classes and nested class templates.
25064 [class.mem/1]. */
25066 static void
25068 {
25077 }
25079 /* Look for the `template' keyword, as a syntactic disambiguator.
25080 Return TRUE iff it is present, in which case it will be
25081 consumed. */
25083 static bool
25085 {
25087 {
25088 /* In C++98 the `template' keyword can only be used within templates;
25089 outside templates the parser can always figure out what is a
25090 template and what is not. In C++11, per the resolution of DR 468,
25091 `template' is allowed in cases where it is not strictly necessary. */
25094 {
25097 "in C++98 %<template%> (as a disambiguator) is only "
25099 /* If this part of the token stream is rescanned, the same
25100 error message would be generated. So, we purge the token
25101 from the stream. */
25104 }
25105 else
25106 {
25107 /* Consume the `template' keyword. */
25110 }
25111 }
25113 }
25115 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25116 set PARSER->SCOPE, and perform other related actions. */
25118 static void
25120 {
25126 /* Get the stored value. */
25128 /* Perform any access checks that were deferred. */
25131 {
25136 }
25137 /* Set the scope from the stored value. */
25141 }
25143 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25144 encounter the end of a block before what we were looking for. */
25146 static bool
25150 {
25152 {
25155 /* Abort a parenthesized expression if we encounter a semicolon. */
25159 /* If we've reached the end of the file, stop. */
25165 /* We've hit the end of an enclosing block, so there's been some
25166 kind of syntax error. */
25169 /* Consume the token. */
25171 /* See if it starts a new group. */
25173 {
25175 /* In theory this should probably check end == '}', but
25176 cp_parser_save_member_function_body needs it to exit
25177 after either '}' or ')' when called with ')'. */
25180 }
25182 {
25186 }
25191 }
25192 }
25194 /* Like above, for caching a default argument or NSDMI. Both of these are
25195 terminated by a non-nested comma, but it can be unclear whether or not a
25196 comma is nested in a template argument list unless we do more parsing.
25197 In order to handle this ambiguity, when we encounter a ',' after a '<'
25198 we try to parse what follows as a parameter-declaration-list (in the
25199 case of a default argument) or a member-declarator (in the case of an
25200 NSDMI). If that succeeds, then we stop caching. */
25202 static tree
25204 {
25209 tree default_argument;
25211 /* Add tokens until we have processed the entire default
25212 argument. We add the range [first_token, token). */
25215 {
25216 /* For list-initialization, this is straightforward. */
25219 }
25221 {
25224 /* Peek at the next token. */
25226 /* What we do depends on what token we have. */
25228 {
25229 /* In valid code, a default argument must be
25230 immediately followed by a `,' `)', or `...'. */
25233 {
25234 /* If we've seen a '<', we might be in a
25235 template-argument-list. Until Core issue 325 is
25236 resolved, we don't know how this situation ought
25237 to be handled, so try to DTRT. We check whether
25238 what comes after the comma is a valid parameter
25239 declaration list. If it is, then the comma ends
25240 the default argument; otherwise the default
25241 argument continues. */
25244 /* Set ITALP so cp_parser_parameter_declaration_list
25245 doesn't decide to commit to this parse. */
25253 {
25260 }
25261 else
25262 {
25266 }
25273 }
25276 /* If we run into a non-nested `;', `}', or `]',
25277 then the code is invalid -- but the default
25278 argument is certainly over. */
25283 /* Handle correctly int n = sizeof ... ( p ); */
25286 /* Update DEPTH, if necessary. */
25301 /* This might be the comparison operator, or it might
25302 start a template argument list. */
25309 /* Fall through for C++0x, which treats the `>>'
25310 operator like two `>' tokens in certain
25311 cases. */
25315 {
25316 /* This might be an operator, or it might close a
25317 template argument list. But if a previous '<'
25318 started a template argument list, this will have
25319 closed it, so we can't be in one anymore. */
25323 }
25326 /* If we run out of tokens, issue an error message. */
25335 /* In these cases, we should look for template-ids.
25336 For example, if the default argument is
25337 `X<int, double>()', we need to do name lookup to
25338 figure out whether or not `X' is a template; if
25339 so, the `,' does not end the default argument.
25341 That is not yet done. */
25346 }
25348 /* If we've reached the end, stop. */
25352 /* Add the token to the token block. */
25354 }
25356 /* Create a DEFAULT_ARG to represent the unparsed default
25357 argument. */
25364 }
25366 /* Begin parsing tentatively. We always save tokens while parsing
25367 tentatively so that if the tentative parsing fails we can restore the
25368 tokens. */
25370 static void
25372 {
25373 /* Enter a new parsing context. */
25375 /* Begin saving tokens. */
25377 /* In order to avoid repetitive access control error messages,
25378 access checks are queued up until we are no longer parsing
25379 tentatively. */
25381 }
25383 /* Commit to the currently active tentative parse. */
25385 static void
25387 {
25391 /* Mark all of the levels as committed. */
25394 {
25401 }
25402 }
25404 /* Commit to the topmost currently active tentative parse.
25406 Note that this function shouldn't be called when there are
25407 irreversible side-effects while in a tentative state. For
25408 example, we shouldn't create a permanent entry in the symbol
25409 table, or issue an error message that might not apply if the
25410 tentative parse is aborted. */
25412 static void
25414 {
25419 {
25427 }
25428 }
25430 /* Abort the currently active tentative parse. All consumed tokens
25431 will be rolled back, and no diagnostics will be issued. */
25433 static void
25435 {
25439 /* Now, pretend that we want to see if the construct was
25440 successfully parsed. */
25442 }
25444 /* Stop parsing tentatively. If a parse error has occurred, restore the
25445 token stream. Otherwise, commit to the tokens we have consumed.
25446 Returns true if no error occurred; false otherwise. */
25448 static bool
25450 {
25454 /* Remember whether or not an error occurred, since we are about to
25455 destroy that information. */
25457 /* Remove the topmost context from the stack. */
25460 /* If no parse errors occurred, commit to the tentative parse. */
25462 {
25463 /* Commit to the tokens read tentatively, unless that was
25464 already done. */
25469 }
25470 /* Otherwise, if errors occurred, roll back our state so that things
25471 are just as they were before we began the tentative parse. */
25472 else
25473 {
25476 }
25477 /* Add the context to the front of the free list. */
25482 }
25484 /* Returns true if we are parsing tentatively and are not committed to
25485 this tentative parse. */
25487 static bool
25489 {
25492 }
25494 /* Returns nonzero iff an error has occurred during the most recent
25495 tentative parse. */
25497 static bool
25499 {
25502 }
25504 /* Returns nonzero if GNU extensions are allowed. */
25506 static bool
25508 {
25510 }
25511 \f
25512 /* Objective-C++ Productions */
25515 /* Parse an Objective-C expression, which feeds into a primary-expression
25516 above.
25518 objc-expression:
25519 objc-message-expression
25520 objc-string-literal
25521 objc-encode-expression
25522 objc-protocol-expression
25523 objc-selector-expression
25525 Returns a tree representation of the expression. */
25527 static tree
25529 {
25530 /* Try to figure out what kind of declaration is present. */
25534 {
25544 {
25556 }
25562 }
25565 }
25567 /* Parse an Objective-C message expression.
25569 objc-message-expression:
25570 [ objc-message-receiver objc-message-args ]
25572 Returns a representation of an Objective-C message. */
25574 static tree
25576 {
25585 }
25587 /* Parse an objc-message-receiver.
25589 objc-message-receiver:
25590 expression
25591 simple-type-specifier
25593 Returns a representation of the type or expression. */
25595 static tree
25597 {
25598 tree rcv;
25600 /* An Objective-C message receiver may be either (1) a type
25601 or (2) an expression. */
25610 CP_PARSER_FLAGS_NONE);
25613 }
25615 /* Parse the arguments and selectors comprising an Objective-C message.
25617 objc-message-args:
25618 objc-selector
25619 objc-selector-args
25620 objc-selector-args , objc-comma-args
25622 objc-selector-args:
25623 objc-selector [opt] : assignment-expression
25624 objc-selector-args objc-selector [opt] : assignment-expression
25626 objc-comma-args:
25627 assignment-expression
25628 objc-comma-args , assignment-expression
25630 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25631 selector arguments and TREE_VALUE containing a list of comma
25632 arguments. */
25634 static tree
25636 {
25642 {
25648 /* Detect if we have a unary selector. */
25657 sel_args
25662 }
25664 /* Handle non-selector arguments, if any. */
25666 {
25667 tree arg;
25672 addl_args
25677 }
25680 {
25683 }
25686 }
25688 /* Parse an Objective-C encode expression.
25690 objc-encode-expression:
25691 @encode objc-typename
25693 Returns an encoded representation of the type argument. */
25695 static tree
25697 {
25698 tree type;
25708 {
25712 }
25714 /* This happens if we find @encode(T) (where T is a template
25715 typename or something dependent on a template typename) when
25716 parsing a template. In that case, we can't compile it
25717 immediately, but we rather create an AT_ENCODE_EXPR which will
25718 need to be instantiated when the template is used.
25719 */
25721 {
25725 }
25728 }
25730 /* Parse an Objective-C @defs expression. */
25732 static tree
25734 {
25735 tree name;
25743 }
25745 /* Parse an Objective-C protocol expression.
25747 objc-protocol-expression:
25748 @protocol ( identifier )
25750 Returns a representation of the protocol expression. */
25752 static tree
25754 {
25755 tree proto;
25763 }
25765 /* Parse an Objective-C selector expression.
25767 objc-selector-expression:
25768 @selector ( objc-method-signature )
25770 objc-method-signature:
25771 objc-selector
25772 objc-selector-seq
25774 objc-selector-seq:
25775 objc-selector :
25776 objc-selector-seq objc-selector :
25778 Returns a representation of the method selector. */
25780 static tree
25782 {
25794 {
25803 {
25804 /* Detect if we have a unary selector. */
25806 {
25809 }
25810 else
25811 {
25813 }
25814 }
25819 {
25820 sel_seq
25823 sel_seq
25826 }
25827 else
25828 sel_seq
25833 }
25835 finish_selector:
25839 }
25841 /* Parse a list of identifiers.
25843 objc-identifier-list:
25844 identifier
25845 objc-identifier-list , identifier
25847 Returns a TREE_LIST of identifier nodes. */
25849 static tree
25851 {
25852 tree identifier;
25853 tree list;
25864 {
25871 identifier));
25873 }
25876 }
25878 /* Parse an Objective-C alias declaration.
25880 objc-alias-declaration:
25881 @compatibility_alias identifier identifier ;
25883 This function registers the alias mapping with the Objective-C front end.
25884 It returns nothing. */
25886 static void
25888 {
25896 }
25898 /* Parse an Objective-C class forward-declaration.
25900 objc-class-declaration:
25901 @class objc-identifier-list ;
25903 The function registers the forward declarations with the Objective-C
25904 front end. It returns nothing. */
25906 static void
25908 {
25911 {
25912 tree id;
25922 else
25924 }
25926 }
25928 /* Parse a list of Objective-C protocol references.
25930 objc-protocol-refs-opt:
25931 objc-protocol-refs [opt]
25933 objc-protocol-refs:
25934 < objc-identifier-list >
25936 Returns a TREE_LIST of identifiers, if any. */
25938 static tree
25940 {
25944 {
25948 }
25951 }
25953 /* Parse a Objective-C visibility specification. */
25955 static void
25957 {
25961 {
25976 }
25978 /* Eat '@private'/'@protected'/'@public'. */
25980 }
25982 /* Parse an Objective-C method type. Return 'true' if it is a class
25983 (+) method, and 'false' if it is an instance (-) method. */
25987 {
25990 else
25992 }
25994 /* Parse an Objective-C protocol qualifier. */
25996 static tree
25998 {
26011 {
26016 }
26019 }
26021 /* Parse an Objective-C typename. */
26023 static tree
26025 {
26029 {
26035 /* An ObjC type name may consist of just protocol qualifiers, in which
26036 case the type shall default to 'id'. */
26038 {
26041 /* If the type could not be parsed, an error has already
26042 been produced. For error recovery, behave as if it had
26043 not been specified, which will use the default type
26044 'id'. */
26046 {
26048 /* We need to skip to the closing parenthesis as
26049 cp_parser_type_id() does not seem to do it for
26050 us. */
26055 }
26056 }
26060 }
26063 }
26065 /* Check to see if TYPE refers to an Objective-C selector name. */
26067 static bool
26069 {
26075 }
26077 /* Parse an Objective-C selector. */
26079 static tree
26081 {
26085 {
26088 }
26090 /* C++ operator names are allowed to appear in ObjC selectors. */
26092 {
26105 }
26106 }
26108 /* Parse an Objective-C params list. */
26110 static tree
26112 {
26118 {
26128 /* Detect if we have a unary selector. */
26131 {
26134 }
26138 {
26139 /* Something went quite wrong. There should be a colon
26140 here, but there is not. Stop parsing parameters. */
26142 }
26144 /* New ObjC allows attributes on parameters too. */
26149 params
26152 type_name,
26153 identifier,
26154 parm_attr));
26157 }
26160 {
26163 }
26165 /* We allow tail attributes for the method. */
26167 {
26175 }
26178 {
26181 }
26183 }
26185 /* Parse the non-keyword Objective-C params. */
26187 static tree
26190 {
26196 {
26198 tree parm;
26204 {
26209 }
26211 /* TODO: parse attributes for tail parameters. */
26220 }
26222 /* We allow tail attributes for the method. */
26224 {
26226 {
26231 }
26232 else
26233 /* We have an error, but parse the attributes, so that we can
26234 carry on. */
26240 }
26243 }
26245 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26247 static void
26249 {
26252 /* If the next token is `extern' and the following token is a string
26253 literal, then we have a linkage specification. */
26255 && cp_parser_is_pure_string_literal
26258 /* Handle #pragma, if any. */
26261 /* Allow stray semicolons. */
26264 /* Mark methods as optional or required, when building protocols. */
26266 {
26269 }
26271 {
26274 }
26277 /* Other stray characters must generate errors. */
26279 {
26283 }
26284 /* Finally, try to parse a block-declaration, or a function-definition. */
26285 else
26287 }
26289 /* Parse a method signature. */
26291 static tree
26293 {
26309 }
26311 static bool
26313 {
26314 tree tattr;
26319 /* If the attributes are followed by a method introducer, this is not allowed.
26320 Dump the attributes and flag the situation. */
26325 /* Otherwise, the attributes introduce some interstitial code, possibly so
26326 rewind to allow that check. */
26329 }
26331 /* Parse an Objective-C method prototype list. */
26333 static void
26335 {
26339 {
26341 {
26346 else
26350 {
26354 }
26357 }
26363 OPT_Wattributes,
26365 else
26366 /* Allow for interspersed non-ObjC++ code. */
26370 }
26374 else
26378 }
26380 /* Parse an Objective-C method definition list. */
26382 static void
26384 {
26388 {
26389 tree meth;
26392 {
26398 else
26403 {
26407 }
26409 NULL_TREE);
26411 /* For historical reasons, we accept an optional semicolon. */
26418 {
26425 }
26426 }
26427 /* The following case will be removed once @synthesize is
26428 completely implemented. */
26439 else
26440 /* Allow for interspersed non-ObjC++ code. */
26444 }
26448 else
26452 }
26454 /* Parse Objective-C ivars. */
26456 static void
26458 {
26469 {
26470 cp_decl_specifier_seq declspecs;
26472 tree prefix_attributes;
26480 CP_PARSER_FLAGS_OPTIONAL,
26484 /* auto, register, static, extern, mutable. */
26486 {
26489 }
26491 /* thread_local. */
26493 {
26496 }
26498 /* typedef. */
26500 {
26503 }
26508 /* Keep going until we hit the `;' at the end of the
26509 declaration. */
26511 {
26516 /* Check for a (possibly unnamed) bitfield declaration. */
26524 {
26525 /* Get the name of the bitfield. */
26528 sfk_none);
26530 eat_colon:
26532 /* Get the width of the bitfield. */
26533 width
26535 }
26536 else
26537 {
26538 /* Parse the declarator. */
26539 declarator
26545 }
26547 /* Look for attributes that apply to the ivar. */
26549 /* Remember which attributes are prefix attributes and
26550 which are not. */
26552 /* Combine the attributes. */
26556 /* Create the bitfield declaration. */
26558 width,
26559 attributes);
26560 else
26565 /* Add the instance variable. */
26569 /* Reset PREFIX_ATTRIBUTES. */
26578 {
26581 }
26583 }
26587 }
26592 /* Do not consume the RID_AT_END, so it will be read again as terminating
26593 the @interface of @implementation. */
26597 /* For historical reasons, we accept an optional semicolon. */
26600 }
26602 /* Parse an Objective-C protocol declaration. */
26604 static void
26606 {
26612 {
26617 }
26619 /* See if we have a forward declaration or a definition. */
26622 /* Try a forward declaration first. */
26624 {
26626 {
26627 tree id;
26637 else
26639 }
26641 }
26643 /* Ok, we got a full-fledged definition (or at least should). */
26644 else
26645 {
26650 }
26651 }
26653 /* Parse an Objective-C superclass or category. */
26655 static void
26660 {
26666 {
26669 }
26671 {
26674 /* If there is no category name, and this is an @interface, we
26675 have a class extension. */
26677 {
26680 }
26681 else
26685 }
26686 }
26688 /* Parse an Objective-C class interface. */
26690 static void
26692 {
26699 {
26700 /* It's hard to recover because even if valid @interface stuff
26701 is to follow, we can't compile it (or validate it) if we
26702 don't even know which class it refers to. Let's assume this
26703 was a stray '@interface' token in the stream and skip it.
26704 */
26706 }
26711 /* We have either a class or a category on our hands. */
26714 else
26715 {
26717 /* Handle instance variable declarations, if any. */
26720 }
26723 }
26725 /* Parse an Objective-C class implementation. */
26727 static void
26729 {
26736 {
26737 /* It's hard to recover because even if valid @implementation
26738 stuff is to follow, we can't compile it (or validate it) if
26739 we don't even know which class it refers to. Let's assume
26740 this was a stray '@implementation' token in the stream and
26741 skip it.
26742 */
26744 }
26748 /* We have either a class or a category on our hands. */
26751 else
26752 {
26754 /* Handle instance variable declarations, if any. */
26757 }
26760 }
26762 /* Consume the @end token and finish off the implementation. */
26764 static void
26766 {
26769 }
26771 /* Parse an Objective-C declaration. */
26773 static void
26775 {
26776 /* Try to figure out what kind of declaration is present. */
26781 {
26797 }
26800 {
26823 }
26824 }
26826 /* Parse an Objective-C try-catch-finally statement.
26828 objc-try-catch-finally-stmt:
26829 @try compound-statement objc-catch-clause-seq [opt]
26830 objc-finally-clause [opt]
26832 objc-catch-clause-seq:
26833 objc-catch-clause objc-catch-clause-seq [opt]
26835 objc-catch-clause:
26836 @catch ( objc-exception-declaration ) compound-statement
26838 objc-finally-clause:
26839 @finally compound-statement
26841 objc-exception-declaration:
26842 parameter-declaration
26843 '...'
26845 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26847 Returns NULL_TREE.
26849 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26850 for C. Keep them in sync. */
26852 static tree
26854 {
26855 location_t location;
26856 tree stmt;
26861 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26862 node, lest it get absorbed into the surrounding block. */
26868 {
26877 {
26878 /* We have "@catch (...)" (where the '...' are literally
26879 what is in the code). Skip the '...'.
26880 parameter_declaration is set to NULL_TREE, and
26881 objc_being_catch_clauses() knows that that means
26882 '...'. */
26885 }
26886 else
26887 {
26888 /* We have "@catch (NSException *exception)" or something
26889 like that. Parse the parameter declaration. */
26893 else
26898 }
26901 else
26902 {
26903 /* If there was no open parenthesis, we are recovering from
26904 an error, and we are trying to figure out what mistake
26905 the user has made. */
26907 /* If there is an immediate closing parenthesis, the user
26908 probably forgot the opening one (ie, they typed "@catch
26909 NSException *e)". Parse the closing parenthesis and keep
26910 going. */
26914 /* If these is no immediate closing parenthesis, the user
26915 probably doesn't know that parenthesis are required at
26916 all (ie, they typed "@catch NSException *e"). So, just
26917 forget about the closing parenthesis and keep going. */
26918 }
26922 }
26924 {
26927 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26928 node, lest it get absorbed into the surrounding block. */
26932 }
26935 }
26937 /* Parse an Objective-C synchronized statement.
26939 objc-synchronized-stmt:
26940 @synchronized ( expression ) compound-statement
26942 Returns NULL_TREE. */
26944 static tree
26946 {
26947 location_t location;
26958 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26959 node, lest it get absorbed into the surrounding block. */
26964 }
26966 /* Parse an Objective-C throw statement.
26968 objc-throw-stmt:
26969 @throw assignment-expression [opt] ;
26971 Returns a constructed '@throw' statement. */
26973 static tree
26975 {
26987 }
26989 /* Parse an Objective-C statement. */
26991 static tree
26993 {
26994 /* Try to figure out what kind of declaration is present. */
26998 {
27009 }
27012 }
27014 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27015 look ahead to see if an objc keyword follows the attributes. This
27016 is to detect the use of prefix attributes on ObjC @interface and
27017 @protocol. */
27019 static bool
27021 {
27026 {
27029 }
27032 }
27034 /* This routine is a minimal replacement for
27035 c_parser_struct_declaration () used when parsing the list of
27036 types/names or ObjC++ properties. For example, when parsing the
27037 code
27039 @property (readonly) int a, b, c;
27041 this function is responsible for parsing "int a, int b, int c" and
27042 returning the declarations as CHAIN of DECLs.
27044 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27045 similar parsing. */
27046 static tree
27048 {
27050 cp_decl_specifier_seq declspecs;
27052 tree prefix_attributes;
27055 CP_PARSER_FLAGS_NONE,
27062 /* auto, register, static, extern, mutable. */
27064 {
27067 }
27069 /* thread_local. */
27071 {
27074 }
27076 /* typedef. */
27078 {
27081 }
27086 /* Keep going until we hit the `;' at the end of the declaration. */
27088 {
27093 /* Parse the declarator. */
27097 /* Look for attributes that apply to the ivar. */
27099 /* Remember which attributes are prefix attributes and
27100 which are not. */
27102 /* Combine the attributes. */
27112 /* Reset PREFIX_ATTRIBUTES. */
27123 {
27126 }
27127 else
27129 }
27131 }
27133 /* Parse an Objective-C @property declaration. The syntax is:
27135 objc-property-declaration:
27136 '@property' objc-property-attributes[opt] struct-declaration ;
27138 objc-property-attributes:
27139 '(' objc-property-attribute-list ')'
27141 objc-property-attribute-list:
27142 objc-property-attribute
27143 objc-property-attribute-list, objc-property-attribute
27145 objc-property-attribute
27146 'getter' = identifier
27147 'setter' = identifier
27148 'readonly'
27149 'readwrite'
27150 'assign'
27151 'retain'
27152 'copy'
27153 'nonatomic'
27155 For example:
27156 @property NSString *name;
27157 @property (readonly) id object;
27158 @property (retain, nonatomic, getter=getTheName) id name;
27159 @property int a, b, c;
27161 PS: This function is identical to
27162 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27163 static void
27165 {
27166 /* The following variables hold the attributes of the properties as
27167 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27168 seen. When we see an attribute, we set them to 'true' (if they
27169 are boolean properties) or to the identifier (if they have an
27170 argument, ie, for getter and setter). Note that here we only
27171 parse the list of attributes, check the syntax and accumulate the
27172 attributes that we find. objc_add_property_declaration() will
27173 then process the information. */
27183 /* 'properties' is the list of properties that we read. Usually a
27184 single one, but maybe more (eg, in "@property int a, b, c;" there
27185 are three). */
27186 tree properties;
27187 location_t loc;
27193 /* Parse the optional attribute list... */
27195 {
27196 /* Eat the '('. */
27200 {
27206 {
27209 }
27213 {
27224 {
27228 else
27233 }
27236 {
27240 }
27242 {
27244 {
27247 }
27248 else
27252 else
27254 }
27255 else
27256 {
27258 {
27261 }
27262 else
27264 }
27270 }
27277 else
27279 }
27281 /* FIXME: "@property (setter, assign);" will generate a spurious
27282 "error: expected ‘)’ before ‘,’ token". This is because
27283 cp_parser_require, unlike the C counterpart, will produce an
27284 error even if we are in error recovery. */
27286 {
27291 }
27292 }
27294 /* ... and the property declaration(s). */
27298 {
27300 /* If the next token is now a `;', consume it. */
27304 }
27308 else
27309 {
27310 /* Comma-separated properties are chained together in
27311 reverse order; add them one by one. */
27320 }
27323 }
27325 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27327 objc-synthesize-declaration:
27328 @synthesize objc-synthesize-identifier-list ;
27330 objc-synthesize-identifier-list:
27331 objc-synthesize-identifier
27332 objc-synthesize-identifier-list, objc-synthesize-identifier
27334 objc-synthesize-identifier
27335 identifier
27336 identifier = identifier
27338 For example:
27339 @synthesize MyProperty;
27340 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27342 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27343 for C. Keep them in sync.
27344 */
27345 static void
27347 {
27349 location_t loc;
27354 {
27358 {
27361 }
27363 {
27367 {
27370 }
27371 }
27372 else
27377 else
27379 }
27382 }
27384 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27386 objc-dynamic-declaration:
27387 @dynamic identifier-list ;
27389 For example:
27390 @dynamic MyProperty;
27391 @dynamic MyProperty, AnotherProperty;
27393 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27394 for C. Keep them in sync.
27395 */
27396 static void
27398 {
27400 location_t loc;
27405 {
27406 tree property;
27409 {
27412 }
27416 else
27418 }
27421 }
27423 \f
27424 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27426 /* Returns name of the next clause.
27427 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27428 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27429 returned and the token is consumed. */
27431 static pragma_omp_clause
27433 {
27447 {
27452 {
27593 }
27594 }
27600 }
27602 /* Validate that a clause of the given type does not already exist. */
27604 static void
27607 {
27608 tree c;
27612 {
27615 }
27616 }
27618 /* OpenMP 2.5:
27619 variable-list:
27620 identifier
27621 variable-list , identifier
27623 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27624 colon). An opening parenthesis will have been consumed by the caller.
27626 If KIND is nonzero, create the appropriate node and install the decl
27627 in OMP_CLAUSE_DECL and add the node to the head of the list.
27629 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27630 return the list created.
27632 COLON can be NULL if only closing parenthesis should end the list,
27633 or pointer to bool which will receive false if the list is terminated
27634 by closing parenthesis or true if the list is terminated by colon. */
27636 static tree
27639 {
27643 {
27646 }
27648 {
27665 {
27667 {
27670 {
27674 }
27675 /* FALL THROUGH. */
27681 {
27689 parser->colon_corrects_to_scope_p
27693 else
27694 {
27695 /* Look for `:'. */
27699 CPP_CLOSE_SQUARE))
27701 }
27702 /* Look for the closing `]'. */
27704 RT_CLOSE_SQUARE))
27708 {
27714 {
27718 }
27722 {
27726 }
27727 }
27730 }
27734 }
27740 }
27741 else
27744 get_comma:
27748 }
27754 {
27758 }
27761 {
27764 /* Try to resync to an unnested comma. Copied from
27765 cp_parser_parenthesized_expression_list. */
27766 skip_comma:
27775 }
27778 }
27780 /* Similarly, but expect leading and trailing parenthesis. This is a very
27781 common case for omp clauses. */
27783 static tree
27785 {
27789 }
27791 /* OpenACC 2.0:
27792 copy ( variable-list )
27793 copyin ( variable-list )
27794 copyout ( variable-list )
27795 create ( variable-list )
27796 delete ( variable-list )
27797 present ( variable-list )
27798 present_or_copy ( variable-list )
27799 pcopy ( variable-list )
27800 present_or_copyin ( variable-list )
27801 pcopyin ( variable-list )
27802 present_or_copyout ( variable-list )
27803 pcopyout ( variable-list )
27804 present_or_create ( variable-list )
27805 pcreate ( variable-list ) */
27807 static tree
27809 tree list)
27810 {
27813 {
27855 }
27863 }
27865 /* OpenACC 2.0:
27866 deviceptr ( variable-list ) */
27868 static tree
27870 {
27874 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27875 cp_parser_oacc_data_clause), as for PRAGMA_OMP_CLAUSE_DEVICEPTR,
27876 variable-list must only allow for pointer variables. */
27879 {
27882 /* FIXME diagnostics: Ideally we should keep individual
27883 locations for all the variables in the var list to make the
27884 following errors more precise. Perhaps
27885 c_parser_omp_var_list_parens should construct a list of
27886 locations to go along with the var list. */
27891 ;
27900 }
27903 }
27905 /* OpenACC:
27906 vector_length ( expression ) */
27908 static tree
27910 {
27914 HOST_WIDE_INT n;
27925 {
27928 }
27931 {
27936 }
27947 }
27949 /* OpenACC 2.0
27950 Parse wait clause or directive parameters. */
27952 static tree
27954 {
27964 {
27969 }
27976 {
27980 {
27982 {
27985 }
27986 else
27987 {
27995 }
27996 }
27997 }
28000 }
28002 /* OpenACC:
28003 wait ( int-expr-list ) */
28005 static tree
28007 {
28016 }
28018 /* OpenMP 3.0:
28019 collapse ( constant-expression ) */
28021 static tree
28023 {
28025 location_t loc;
28026 HOST_WIDE_INT n;
28046 {
28049 }
28057 }
28059 /* OpenMP 2.5:
28060 default ( shared | none ) */
28062 static tree
28064 {
28066 tree c;
28071 {
28076 {
28091 }
28094 }
28095 else
28096 {
28097 invalid_kind:
28099 }
28115 }
28117 /* OpenMP 3.1:
28118 final ( expression ) */
28120 static tree
28122 {
28143 }
28145 /* OpenMP 2.5:
28146 if ( expression ) */
28148 static tree
28150 {
28171 }
28173 /* OpenMP 3.1:
28174 mergeable */
28176 static tree
28179 {
28180 tree c;
28183 location);
28188 }
28190 /* OpenMP 2.5:
28191 nowait */
28193 static tree
28196 {
28197 tree c;
28204 }
28206 /* OpenACC:
28207 num_gangs ( expression ) */
28209 static tree
28211 {
28214 HOST_WIDE_INT n;
28231 {
28234 }
28244 }
28246 /* OpenMP 2.5:
28247 num_threads ( expression ) */
28249 static tree
28251 location_t location)
28252 {
28274 }
28276 /* OpenACC:
28277 num_workers ( expression ) */
28279 static tree
28281 {
28284 HOST_WIDE_INT n;
28301 {
28304 }
28307 location);
28315 }
28317 /* OpenMP 2.5:
28318 ordered */
28320 static tree
28323 {
28324 tree c;
28332 }
28334 /* OpenMP 2.5:
28335 reduction ( reduction-operator : variable-list )
28337 reduction-operator:
28338 One of: + * - & ^ | && ||
28340 OpenMP 3.1:
28342 reduction-operator:
28343 One of: + * - & ^ | && || min max
28345 OpenMP 4.0:
28347 reduction-operator:
28348 One of: + * - & ^ | && ||
28349 id-expression */
28351 static tree
28353 {
28361 {
28371 }
28375 else
28376 {
28387 {
28417 }
28418 else
28419 {
28421 resync_fail:
28426 }
28427 }
28433 NULL);
28435 {
28438 }
28441 }
28443 /* OpenMP 2.5:
28444 schedule ( schedule-kind )
28445 schedule ( schedule-kind , expression )
28447 schedule-kind:
28448 static | dynamic | guided | runtime | auto */
28450 static tree
28452 {
28461 {
28466 {
28487 }
28488 }
28493 else
28498 {
28513 else
28518 }
28526 invalid_kind:
28528 resync_fail:
28533 }
28535 /* OpenMP 3.0:
28536 untied */
28538 static tree
28541 {
28542 tree c;
28549 }
28551 /* OpenMP 4.0:
28552 inbranch
28553 notinbranch */
28555 static tree
28558 {
28563 }
28565 /* OpenMP 4.0:
28566 parallel
28567 for
28568 sections
28569 taskgroup */
28571 static tree
28575 {
28579 }
28581 /* OpenMP 4.0:
28582 num_teams ( expression ) */
28584 static tree
28586 location_t location)
28587 {
28609 }
28611 /* OpenMP 4.0:
28612 thread_limit ( expression ) */
28614 static tree
28616 location_t location)
28617 {
28639 }
28641 /* OpenMP 4.0:
28642 aligned ( variable-list )
28643 aligned ( variable-list : constant-expression ) */
28645 static tree
28647 {
28658 {
28668 }
28674 }
28676 /* OpenMP 4.0:
28677 linear ( variable-list )
28678 linear ( variable-list : expression ) */
28680 static tree
28683 {
28694 {
28698 {
28701 }
28709 }
28715 }
28717 /* OpenMP 4.0:
28718 safelen ( constant-expression ) */
28720 static tree
28722 location_t location)
28723 {
28744 }
28746 /* OpenMP 4.0:
28747 simdlen ( constant-expression ) */
28749 static tree
28751 location_t location)
28752 {
28773 }
28775 /* OpenMP 4.0:
28776 depend ( depend-kind : variable-list )
28778 depend-kind:
28779 in | out | inout */
28781 static tree
28783 {
28791 {
28801 else
28803 }
28804 else
28812 NULL);
28819 invalid_kind:
28821 resync_fail:
28826 }
28828 /* OpenMP 4.0:
28829 map ( map-kind : variable-list )
28830 map ( variable-list )
28832 map-kind:
28833 alloc | to | from | tofrom */
28835 static tree
28837 {
28846 {
28858 else
28859 {
28865 }
28868 }
28871 NULL);
28877 }
28879 /* OpenMP 4.0:
28880 device ( expression ) */
28882 static tree
28884 location_t location)
28885 {
28907 }
28909 /* OpenMP 4.0:
28910 dist_schedule ( static )
28911 dist_schedule ( static , expression ) */
28913 static tree
28915 location_t location)
28916 {
28929 {
28940 }
28945 location);
28949 invalid_kind:
28951 resync_fail:
28956 }
28958 /* OpenMP 4.0:
28959 proc_bind ( proc-bind-kind )
28961 proc-bind-kind:
28962 master | close | spread */
28964 static tree
28966 location_t location)
28967 {
28968 tree c;
28975 {
28985 else
28987 }
28988 else
28997 location);
29002 invalid_kind:
29004 resync_fail:
29009 }
29011 /* OpenACC:
29012 async [( int-expr )] */
29014 static tree
29016 {
29020 /* TODO XXX: FIX -1 (acc_async_noval). */
29024 {
29033 }
29043 }
29045 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29046 is a bitmask in MASK. Return the list of clauses found. */
29048 static tree
29052 {
29057 {
29058 location_t here;
29059 pragma_omp_clause c_kind;
29070 {
29152 clauses =
29163 }
29168 {
29169 /* Remove the invalid clause(s) from the list to avoid
29170 confusing the rest of the compiler. */
29173 }
29174 }
29176 saw_error:
29183 }
29185 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29186 is a bitmask in MASK. Return the list of clauses found; the result
29187 of clause default goes in *pdefault. */
29189 static tree
29193 {
29200 {
29201 pragma_omp_clause c_kind;
29212 {
29224 clauses);
29238 clauses);
29247 clauses);
29271 clauses);
29285 clauses);
29302 OMP_CLAUSE_NOTINBRANCH,
29311 {
29312 clause_not_first:
29316 }
29341 clauses);
29346 clauses);
29351 clauses);
29414 }
29419 {
29420 /* Remove the invalid clause(s) from the list to avoid
29421 confusing the rest of the compiler. */
29424 }
29425 }
29426 saw_error:
29427 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29428 no reason to skip to the end. */
29434 }
29436 /* OpenMP 2.5:
29437 structured-block:
29438 statement
29440 In practice, we're also interested in adding the statement to an
29441 outer node. So it is convenient if we work around the fact that
29442 cp_parser_statement calls add_stmt. */
29444 static unsigned
29446 {
29449 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29450 This preserves the "not within loop or switch" style error messages
29451 for nonsense cases like
29452 void foo() {
29453 #pragma omp single
29454 break;
29455 }
29456 */
29461 }
29463 static void
29465 {
29467 }
29469 static tree
29471 {
29479 }
29481 /* OpenMP 2.5:
29482 # pragma omp atomic new-line
29483 expression-stmt
29485 expression-stmt:
29486 x binop= expr | x++ | ++x | x-- | --x
29487 binop:
29488 +, *, -, /, &, ^, |, <<, >>
29490 where x is an lvalue expression with scalar type.
29492 OpenMP 3.1:
29493 # pragma omp atomic new-line
29494 update-stmt
29496 # pragma omp atomic read new-line
29497 read-stmt
29499 # pragma omp atomic write new-line
29500 write-stmt
29502 # pragma omp atomic update new-line
29503 update-stmt
29505 # pragma omp atomic capture new-line
29506 capture-stmt
29508 # pragma omp atomic capture new-line
29509 capture-block
29511 read-stmt:
29512 v = x
29513 write-stmt:
29514 x = expr
29515 update-stmt:
29516 expression-stmt | x = x binop expr
29517 capture-stmt:
29518 v = expression-stmt
29519 capture-block:
29520 { v = x; update-stmt; } | { update-stmt; v = x; }
29522 OpenMP 4.0:
29523 update-stmt:
29524 expression-stmt | x = x binop expr | x = expr binop x
29525 capture-stmt:
29526 v = update-stmt
29527 capture-block:
29528 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29530 where x and v are lvalue expressions with scalar type. */
29532 static void
29534 {
29542 {
29547 {
29553 }
29554 }
29556 {
29568 else
29572 }
29574 {
29580 {
29585 {
29588 }
29589 }
29590 }
29594 {
29604 else
29609 {
29610 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29611 opcode. */
29616 }
29620 {
29623 }
29624 else
29625 {
29631 }
29634 }
29636 restart:
29640 {
29647 /* FALLTHROUGH */
29657 /* FALLTHROUGH */
29672 /* Undo effects of boolean_increment for post {in,de}crement. */
29674 /* FALLTHRU */
29678 {
29679 /* Undo effects of boolean_increment. */
29681 {
29682 /* This is pre or post increment. */
29687 && !structured_block
29691 }
29692 }
29693 /* FALLTHRU */
29696 {
29731 {
29735 }
29738 {
29744 {
29749 }
29751 {
29762 {
29764 {
29769 }
29770 else
29772 }
29776 }
29779 {
29786 }
29790 }
29794 {
29797 {
29805 }
29807 {
29812 }
29847 }
29858 /* FALLTHROUGH */
29863 }
29870 }
29871 stmt_done:
29873 {
29884 }
29886 {
29889 }
29890 done:
29896 saw_error:
29899 {
29903 {
29907 }
29908 }
29909 }
29912 /* OpenMP 2.5:
29913 # pragma omp barrier new-line */
29915 static void
29917 {
29920 }
29922 /* OpenMP 2.5:
29923 # pragma omp critical [(name)] new-line
29924 structured-block */
29926 static tree
29928 {
29932 {
29944 }
29949 }
29951 /* OpenMP 2.5:
29952 # pragma omp flush flush-vars[opt] new-line
29954 flush-vars:
29955 ( variable-list ) */
29957 static void
29959 {
29965 }
29967 /* Helper function, to parse omp for increment expression. */
29969 static tree
29971 {
29976 {
29979 }
29982 {
29991 /* Fall through: OpenMP disallows NE_EXPR. */
29994 }
29996 /* If decl is an iterator, preserve LHS and RHS of the relational
29997 expr until finish_omp_for. */
30007 }
30009 /* Helper function, to parse omp for increment expression. */
30011 static tree
30013 {
30017 cp_id_kind idk;
30021 {
30029 }
30037 {
30042 }
30049 {
30053 }
30065 do
30066 {
30073 {
30075 {
30078 else
30080 tf_warning_or_error);
30081 }
30082 else
30085 }
30086 }
30090 {
30094 }
30095 else
30099 }
30101 /* Parse the initialization statement of either an OpenMP for loop or
30102 a Cilk Plus for loop.
30104 Return true if the resulting construct should have an
30105 OMP_CLAUSE_PRIVATE added to it. */
30107 static bool
30115 {
30121 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30123 init-expr:
30124 var = lb
30125 integer-type var = lb
30126 random-access-iterator-type var = lb
30127 pointer-type var = lb
30128 */
30129 cp_decl_specifier_seq type_specifiers;
30131 /* First, try to parse as an initialized declaration. See
30132 cp_parser_condition, from whence the bulk of this is copied. */
30139 {
30140 /* If parsing a type specifier seq succeeded, then this
30141 MUST be a initialized declaration. */
30146 CP_PARSER_DECLARATOR_NAMED,
30157 else
30158 {
30168 {
30170 CPP_OPEN_PAREN))
30171 {
30175 else
30178 }
30179 else
30180 /* Trigger an error. */
30185 }
30189 {
30197 {
30200 auto_node);
30205 }
30208 asm_specification,
30209 LOOKUP_ONLYCONVERTING);
30211 {
30214 }
30215 else
30218 }
30219 else
30220 {
30221 /* Consume '='. */
30225 non_class:
30228 else
30231 asm_specification,
30232 LOOKUP_ONLYCONVERTING);
30233 }
30237 }
30238 }
30239 else
30240 {
30241 cp_id_kind idk;
30242 /* If parsing a type specifier sequence failed, then
30243 this MUST be a simple expression. */
30251 && decl
30254 {
30255 tree rhs;
30262 rhs,
30263 tf_warning_or_error));
30265 }
30266 else
30267 {
30272 {
30276 }
30277 }
30278 }
30280 }
30282 /* Parse the restricted form of the for statement allowed by OpenMP. */
30284 static tree
30287 {
30291 location_t loc_first;
30310 {
30313 location_t loc;
30317 {
30320 }
30323 {
30326 }
30335 add_private_clause
30342 {
30345 {
30351 }
30352 else
30354 }
30361 {
30366 {
30370 }
30373 {
30374 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30375 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30380 {
30383 }
30384 else
30385 {
30388 }
30392 }
30393 else
30394 {
30399 }
30400 }
30403 {
30404 tree c;
30406 {
30415 decl);
30419 decl);
30420 }
30422 {
30427 {
30430 }
30431 }
30432 }
30441 {
30442 /* If decl is an iterator, preserve the operator on decl
30443 until finish_omp_for. */
30445 && ((processing_template_decl
30449 else
30453 }
30468 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30469 in between the collapsed for loops to be still considered perfectly
30470 nested. Hopefully the final version clarifies this.
30471 For now handle (multiple) {'s and empty statements. */
30473 do
30474 {
30478 {
30480 bracecount++;
30481 }
30485 else
30486 {
30493 }
30494 }
30498 {
30501 }
30502 }
30504 /* Note that we saved the original contents of this flag when we entered
30505 the structured block, and so we don't need to re-save it here. */
30508 else
30511 /* Note that the grammar doesn't call for a structured block here,
30512 though the loop as a whole is a structured block. */
30519 else
30524 {
30526 {
30528 nbraces--;
30529 }
30532 else
30533 {
30535 {
30538 }
30543 }
30544 }
30551 }
30553 /* Helper function for OpenMP parsing, split clauses and call
30554 finish_omp_clauses on each of the set of clauses afterwards. */
30556 static void
30559 {
30565 }
30567 /* OpenMP 4.0:
30568 #pragma omp simd simd-clause[optseq] new-line
30569 for-loop */
30571 #define OMP_SIMD_CLAUSE_MASK \
30572 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30580 static tree
30583 {
30595 {
30598 }
30609 }
30611 /* OpenMP 2.5:
30612 #pragma omp for for-clause[optseq] new-line
30613 for-loop
30615 OpenMP 4.0:
30616 #pragma omp for simd for-simd-clause[optseq] new-line
30617 for-loop */
30619 #define OMP_FOR_CLAUSE_MASK \
30620 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30629 static tree
30632 {
30643 {
30648 {
30656 cclauses);
30660 cclauses);
30672 }
30673 }
30675 {
30678 }
30683 {
30686 }
30697 }
30699 /* OpenMP 2.5:
30700 # pragma omp master new-line
30701 structured-block */
30703 static tree
30705 {
30709 }
30711 /* OpenMP 2.5:
30712 # pragma omp ordered new-line
30713 structured-block */
30715 static tree
30717 {
30721 }
30723 /* OpenMP 2.5:
30725 section-scope:
30726 { section-sequence }
30728 section-sequence:
30729 section-directive[opt] structured-block
30730 section-sequence section-directive structured-block */
30732 static tree
30734 {
30745 {
30749 }
30752 {
30760 {
30764 }
30766 {
30769 }
30774 }
30785 }
30787 /* OpenMP 2.5:
30788 # pragma omp sections sections-clause[optseq] newline
30789 sections-scope */
30791 #define OMP_SECTIONS_CLAUSE_MASK \
30792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30798 static tree
30801 {
30813 {
30816 }
30823 }
30825 /* OpenMP 2.5:
30826 # pragma omp parallel parallel-clause[optseq] new-line
30827 structured-block
30828 # pragma omp parallel for parallel-for-clause[optseq] new-line
30829 structured-block
30830 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30831 structured-block
30833 OpenMP 4.0:
30834 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30835 structured-block */
30837 #define OMP_PARALLEL_CLAUSE_MASK \
30838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30848 static tree
30851 {
30860 {
30873 block);
30878 }
30880 {
30884 }
30886 {
30889 }
30891 {
30895 {
30905 block);
30908 }
30909 }
30919 }
30921 /* OpenMP 2.5:
30922 # pragma omp single single-clause[optseq] new-line
30923 structured-block */
30925 #define OMP_SINGLE_CLAUSE_MASK \
30926 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30931 static tree
30933 {
30943 }
30945 /* OpenMP 3.0:
30946 # pragma omp task task-clause[optseq] new-line
30947 structured-block */
30949 #define OMP_TASK_CLAUSE_MASK \
30950 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30951 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30952 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30953 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30960 static tree
30962 {
30973 }
30975 /* OpenMP 3.0:
30976 # pragma omp taskwait new-line */
30978 static void
30980 {
30983 }
30985 /* OpenMP 3.1:
30986 # pragma omp taskyield new-line */
30988 static void
30990 {
30993 }
30995 /* OpenMP 4.0:
30996 # pragma omp taskgroup new-line
30997 structured-block */
30999 static tree
31001 {
31005 }
31008 /* OpenMP 2.5:
31009 # pragma omp threadprivate (variable-list) */
31011 static void
31013 {
31014 tree vars;
31020 }
31022 /* OpenMP 4.0:
31023 # pragma omp cancel cancel-clause[optseq] new-line */
31025 #define OMP_CANCEL_CLAUSE_MASK \
31026 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31032 static void
31034 {
31038 }
31040 /* OpenMP 4.0:
31041 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31043 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31044 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31049 static void
31051 {
31052 tree clauses;
31056 {
31061 {
31064 }
31065 }
31067 {
31071 }
31074 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31076 pragma_tok);
31078 }
31080 /* OpenMP 4.0:
31081 #pragma omp distribute distribute-clause[optseq] new-line
31082 for-loop */
31084 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31085 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31090 static tree
31093 {
31102 {
31110 else
31113 {
31119 {
31122 cclauses);
31123 else
31125 cclauses);
31126 }
31131 cclauses);
31132 else
31134 cclauses);
31146 }
31147 }
31149 {
31152 }
31157 {
31160 }
31171 }
31173 /* OpenMP 4.0:
31174 # pragma omp teams teams-clause[optseq] new-line
31175 structured-block */
31177 #define OMP_TEAMS_CLAUSE_MASK \
31178 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31186 static tree
31189 {
31198 {
31202 {
31210 cclauses);
31214 cclauses);
31225 }
31226 }
31228 {
31231 }
31236 {
31239 }
31247 }
31249 /* OpenMP 4.0:
31250 # pragma omp target data target-data-clause[optseq] new-line
31251 structured-block */
31253 #define OMP_TARGET_DATA_CLAUSE_MASK \
31254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31258 static tree
31260 {
31272 }
31274 /* OpenMP 4.0:
31275 # pragma omp target update target-update-clause[optseq] new-line */
31277 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31278 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31283 static bool
31286 {
31288 {
31290 "%<#pragma omp target update%> may only be "
31294 }
31296 tree clauses
31301 {
31303 "%<#pragma omp target update must contain at least one "
31306 }
31314 }
31316 /* OpenMP 4.0:
31317 # pragma omp target target-clause[optseq] new-line
31318 structured-block */
31320 #define OMP_TARGET_CLAUSE_MASK \
31321 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31325 static bool
31328 {
31330 {
31334 }
31337 {
31342 {
31350 {
31352 OMP_TARGET_CLAUSE_MASK,
31353 cclauses);
31355 }
31371 }
31373 {
31376 }
31378 {
31382 }
31384 {
31387 }
31388 }
31402 }
31404 /* OpenACC 2.0:
31405 # pragma acc cache (variable-list) new-line
31406 */
31408 static tree
31411 {
31416 }
31418 /* OpenACC 2.0:
31419 # pragma acc data oacc-data-clause[optseq] new-line
31420 structured-block */
31422 #define OACC_DATA_CLAUSE_MASK \
31423 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE))
31435 static tree
31437 {
31450 }
31452 /* OpenACC 2.0:
31453 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31454 structured-block */
31456 #define OACC_KERNELS_CLAUSE_MASK \
31457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31471 static tree
31473 {
31486 }
31488 /* OpenACC 2.0:
31489 # pragma acc loop oacc-loop-clause[optseq] new-line
31490 structured-block */
31492 #define OACC_LOOP_CLAUSE_MASK \
31493 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
31494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION))
31496 static tree
31498 {
31511 }
31513 /* OpenACC 2.0:
31514 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31515 structured-block */
31517 #define OACC_PARALLEL_CLAUSE_MASK \
31518 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPY) \
31520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYOUT) \
31522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_CREATE) \
31523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICEPTR) \
31524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_GANGS) \
31526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_WORKERS) \
31527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT) \
31528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPY) \
31529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYIN) \
31530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_COPYOUT) \
31531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRESENT_OR_CREATE) \
31532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_VECTOR_LENGTH) \
31534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31536 static tree
31538 {
31551 }
31553 /* OpenACC 2.0:
31554 # pragma acc update oacc-update-clause[optseq] new-line
31555 */
31557 #define OACC_UPDATE_CLAUSE_MASK \
31558 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC) \
31559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HOST) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SELF) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_WAIT))
31565 static tree
31567 {
31574 {
31576 "%<#pragma acc update%> must contain at least one "
31579 }
31587 }
31589 /* OpenACC 2.0:
31590 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31592 LOC is the location of the #pragma token.
31593 */
31595 #define OACC_WAIT_CLAUSE_MASK \
31596 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ASYNC))
31598 static tree
31600 {
31613 }
31615 /* OpenMP 4.0:
31616 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31618 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31619 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31626 static void
31629 {
31631 cp_omp_declare_simd_data data;
31633 {
31638 }
31649 {
31653 {
31666 }
31671 "%<#pragma omp declare simd%> not immediately followed by "
31675 }
31676 }
31678 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31679 This function is modelled similar to the late parsing of omp declare
31680 simd. */
31682 static tree
31684 {
31690 {
31696 }
31698 {
31702 }
31707 {
31714 NULL);
31728 }
31733 }
31735 /* Finalize #pragma omp declare simd clauses after direct declarator has
31736 been parsed, and put that into "omp declare simd" attribute. */
31738 static tree
31740 {
31746 {
31751 }
31756 {
31774 }
31778 }
31781 /* OpenMP 4.0:
31782 # pragma omp declare target new-line
31783 declarations and definitions
31784 # pragma omp end declare target new-line */
31786 static void
31788 {
31791 }
31793 static void
31795 {
31798 {
31801 }
31803 {
31807 {
31810 }
31813 else
31814 {
31818 }
31819 }
31820 else
31821 {
31825 }
31829 "%<#pragma omp end declare target%> without corresponding "
31831 else
31833 }
31835 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31836 expression and optional initializer clause of
31837 #pragma omp declare reduction. We store the expression(s) as
31838 either 3, 6 or 7 special statements inside of the artificial function's
31839 body. The first two statements are DECL_EXPRs for the artificial
31840 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31841 expression that uses those variables.
31842 If there was any INITIALIZER clause, this is followed by further statements,
31843 the fourth and fifth statements are DECL_EXPRs for the artificial
31844 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31845 constructor variant (first token after open paren is not omp_priv),
31846 then the sixth statement is a statement with the function call expression
31847 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31848 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31849 to initialize the OMP_PRIV artificial variable and there is seventh
31850 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31852 static bool
31854 {
31866 tree combiner;
31881 {
31884 }
31887 {
31894 {
31897 }
31913 {
31917 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31921 == CPP_CLOSE_PAREN
31924 {
31928 }
31933 }
31934 else
31935 {
31951 {
31956 }
31958 tree arg;
31971 }
31982 }
31988 }
31990 /* OpenMP 4.0
31991 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31992 initializer-clause[opt] new-line
31994 initializer-clause:
31995 initializer (omp_priv initializer)
31996 initializer (function-name (argument-list)) */
31998 static void
32001 {
32011 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32018 {
32050 }
32062 /* Types may not be defined in declare reduction type list. */
32065 parser->type_definition_forbidden_message
32071 saved_colon_doesnt_start_class_def_p
32076 {
32080 ;
32101 else
32106 else
32108 }
32110 /* Restore the saved message. */
32113 parser->colon_doesnt_start_class_def_p
32118 {
32119 fail:
32122 }
32128 {
32129 tree fntype
32132 NULL_TREE);
32151 {
32156 }
32158 {
32160 {
32169 }
32176 }
32177 else
32178 {
32181 }
32184 else
32187 {
32190 }
32192 {
32195 else
32200 }
32205 else
32206 {
32215 }
32222 }
32226 done:
32227 /* Free any declarators allocated. */
32229 }
32231 /* OpenMP 4.0
32232 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32233 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32234 initializer-clause[opt] new-line
32235 #pragma omp declare target new-line */
32237 static void
32240 {
32242 {
32247 {
32250 context);
32252 }
32255 {
32258 context);
32260 }
32262 {
32265 }
32267 {
32271 }
32272 }
32276 }
32278 /* Main entry point to OpenMP statement pragmas. */
32280 static void
32282 {
32283 tree stmt;
32288 {
32357 }
32361 }
32362 \f
32363 /* Transactional Memory parsing routines. */
32365 /* Parse a transaction attribute.
32367 txn-attribute:
32368 attribute
32369 [ [ identifier ] ]
32371 ??? Simplify this when C++0x bracket attributes are
32372 implemented properly. */
32374 static tree
32376 {
32391 {
32395 /* For keywords, use the canonical spelling,
32396 not the parsed identifier. */
32400 }
32401 else
32405 error1:
32408 }
32410 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32412 transaction-statement:
32413 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32414 compound-statement
32415 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32416 */
32418 static tree
32420 {
32435 else
32436 {
32440 }
32442 /* Parse a noexcept specification. */
32445 /* Keep track if we're in the lexical scope of an outer transaction. */
32457 }
32459 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32461 transaction-expression:
32462 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32463 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32464 */
32466 static tree
32468 {
32493 /* Set this early. This might mean that we allow transaction_cancel in
32494 an expression that we find out later actually has to be a constexpr.
32495 However, we expect that cxx_constant_value will be able to deal with
32496 this; also, if the noexcept has no constexpr, then what we parse next
32497 really is a transaction's body. */
32500 /* Parse a noexcept specification. */
32506 {
32513 }
32514 else
32515 {
32516 /* The only expression that is available got parsed for the noexcept
32517 already. noexcept is true then. */
32520 }
32529 }
32531 /* Parse a function-transaction-block.
32533 function-transaction-block:
32534 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32535 function-body
32536 __transaction_atomic txn-attribute[opt] function-try-block
32537 __transaction_relaxed ctor-initializer[opt] function-body
32538 __transaction_relaxed function-try-block
32539 */
32541 static bool
32543 {
32559 else
32560 {
32564 }
32572 else
32573 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32581 }
32583 /* Parse a __transaction_cancel statement.
32585 cancel-statement:
32586 __transaction_cancel txn-attribute[opt] ;
32587 __transaction_cancel txn-attribute[opt] throw-expression ;
32589 ??? Cancel and throw is not yet implemented. */
32591 static tree
32593 {
32599 RT_TRANSACTION_CANCEL);
32606 /* ??? Parse cancel-and-throw here. */
32611 {
32615 }
32617 {
32621 }
32623 {
32626 {
32632 }
32633 }
32635 {
32639 }
32645 }
32646 \f
32647 /* The parser. */
32651 \f
32652 /* Special handling for the first token or line in the file. The first
32653 thing in the file might be #pragma GCC pch_preprocess, which loads a
32654 PCH file, which is a GC collection point. So we need to handle this
32655 first pragma without benefit of an existing lexer structure.
32657 Always returns one token to the caller in *FIRST_TOKEN. This is
32658 either the true first token of the file, or the first token after
32659 the initial pragma. */
32661 static void
32663 {
32672 {
32679 }
32680 else
32683 /* Skip to the end of the pragma. */
32687 /* Now actually load the PCH file. */
32691 /* Read one more token to return to our caller. We have to do this
32692 after reading the PCH file in, since its pointers have to be
32693 live. */
32695 }
32697 /* Parses the grainsize pragma for the _Cilk_for statement.
32698 Syntax:
32699 #pragma cilk grainsize = <VALUE>. */
32701 static void
32703 {
32705 {
32710 {
32713 }
32715 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32718 else
32720 "%<#pragma cilk grainsize%> is not followed by "
32723 }
32725 }
32727 /* Normal parsing of a pragma token. Here we can (and must) use the
32728 regular lexer. */
32730 static bool
32732 {
32744 {
32752 {
32762 }
32767 {
32777 }
32782 {
32788 "%<#pragma omp taskwait%> may only be "
32793 }
32798 {
32804 "%<#pragma omp taskyield%> may only be "
32809 }
32814 {
32820 "%<#pragma omp cancel%> may only be "
32825 }
32830 {
32836 "%<#pragma omp cancellation point%> may only be "
32841 }
32886 "%<#pragma omp section%> may only be used in "
32891 {
32898 {
32901 }
32904 }
32908 {
32912 }
32918 {
32922 }
32924 /* Ignore the pragma if Cilk Plus is not enabled. */
32926 {
32929 }
32930 else
32931 {
32935 }
32942 bad_stmt:
32945 }
32949 }
32951 /* The interface the pragma parsers have to the lexer. */
32953 enum cpp_ttype
32955 {
32968 else
32969 {
32973 }
32976 }
32978 \f
32979 /* External interface. */
32981 /* Parse one entire translation unit. */
32983 void
32985 {
32997 }
32999 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33000 vectorlength clause:
33001 Syntax:
33002 vectorlength ( constant-expression ) */
33004 static tree
33007 {
33009 tree expr;
33010 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33011 safelen clause. Thus, vectorlength is represented as OMP 4.0
33012 safelen. For SIMD-enabled function it is represented by OMP 4.0
33013 simdlen. */
33016 loc);
33017 else
33019 loc);
33027 /* If expr == error_mark_node, then don't emit any errors nor
33028 create a clause. if any of the above functions returns
33029 error mark node then they would have emitted an error message. */
33031 ;
33039 else
33040 {
33041 tree c;
33043 {
33048 }
33049 else
33050 {
33055 }
33056 }
33061 }
33063 /* Handles the Cilk Plus #pragma simd linear clause.
33064 Syntax:
33065 linear ( simd-linear-variable-list )
33067 simd-linear-variable-list:
33068 simd-linear-variable
33069 simd-linear-variable-list , simd-linear-variable
33071 simd-linear-variable:
33072 id-expression
33073 id-expression : simd-linear-step
33075 simd-linear-step:
33076 conditional-expression */
33078 static tree
33080 {
33086 {
33090 }
33095 {
33098 {
33102 }
33109 {
33113 }
33114 else
33115 {
33119 /* If present, parse the linear step. Otherwise, assume the default
33120 value of 1. */
33122 {
33129 {
33130 /* If an error has occurred, then the whole pragma is
33131 considered ill-formed. Thus, no reason to keep
33132 parsing. */
33135 }
33143 else
33145 "step size must be an integer constant "
33147 }
33149 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33155 }
33160 else
33161 {
33166 }
33167 }
33171 }
33173 /* Returns the name of the next clause. If the clause is not
33174 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33175 token is not consumed. Otherwise, the appropriate enum from the
33176 pragma_simd_clause is returned and the token is consumed. */
33178 static pragma_omp_clause
33180 {
33181 pragma_omp_clause clause_type;
33198 else
33203 }
33205 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33207 static tree
33209 {
33214 {
33215 pragma_omp_clause c_kind;
33222 /* Use the OpenMP 4.0 equivalent function. */
33225 /* Use the OpenMP 4.0 equivalent function. */
33227 clauses);
33229 /* Use the OMP 4.0 equivalent function. */
33231 clauses);
33233 /* Use the OMP 4.0 equivalent function. */
33235 else
33236 {
33240 }
33241 }
33247 else
33249 }
33251 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33253 static void
33255 {
33262 {
33266 }
33275 }
33277 /* Main entry-point for parsing Cilk Plus _Cilk_for
33278 loops. The return value is error_mark_node
33279 when errors happen and CILK_FOR tree on success. */
33281 static tree
33283 {
33298 else
33304 }
33306 /* Create an identifier for a generic parameter type (a synthesized
33307 template parameter implied by `auto' or a concept identifier). */
33310 static tree
33312 {
33316 }
33318 /* Predicate that behaves as is_auto_or_concept but matches the parent
33319 node of the generic type rather than the generic type itself. This
33320 allows for type transformation in add_implicit_template_parms. */
33324 {
33326 }
33328 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33329 (creating a new template parameter list if necessary). Returns the newly
33330 created template type parm. */
33332 tree
33334 {
33337 /* We are either continuing a function template that already contains implicit
33338 template parameters, creating a new fully-implicit function template, or
33339 extending an existing explicit function template with implicit template
33340 parameters. */
33348 {
33352 }
33353 else
33354 {
33355 /* Roll back to the existing template parameter scope (in the case of
33356 extending an explicit function template) or introduce a new template
33357 parameter scope ahead of the function parameter scope (or class scope
33358 in the case of out-of-line member definitions). The function scope is
33359 added back after template parameter synthesis below. */
33364 {
33367 }
33369 {
33370 /* If not defining a class, then any class scope is a scope level in
33371 an out-of-line member definition. In this case simply wind back
33372 beyond the first such scope to inject the template parameter list.
33373 Otherwise wind back to the class being defined. The latter can
33374 occur in class member friend declarations such as:
33376 class A {
33377 void foo (auto);
33378 };
33379 class B {
33380 friend void A::foo (auto);
33381 };
33383 The template parameter list synthesized for the friend declaration
33384 must be injected in the scope of 'B'. This can also occur in
33385 erroneous cases such as:
33387 struct A {
33388 struct B {
33389 void foo (auto);
33390 };
33391 void B::foo (auto) {}
33392 };
33394 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33395 but, nevertheless, the template parameter list synthesized for the
33396 declarator should be injected into the scope of 'A' as if the
33397 ill-formed template was specified explicitly. */
33400 {
33403 }
33404 }
33410 {
33411 /* Introduce a new template parameter list for implicit template
33412 parameters. */
33416 parser->implicit_template_scope
33423 }
33424 else
33425 {
33426 /* Synthesize implicit template parameters at the end of the explicit
33427 template parameter list. */
33434 parser->implicit_template_parms
33436 }
33437 }
33439 /* Synthesize a new template parameter and track the current template
33440 parameter chain with implicit_template_parms. */
33444 synth_id);
33445 tree new_parm
33447 input_location,
33454 parser->implicit_template_parms
33456 else
33461 /* If creating a fully implicit function template, start the new implicit
33462 template parameter list with this synthesized type, otherwise grow the
33463 current template parameter list. */
33466 {
33473 }
33474 else
33475 {
33480 }
33485 }
33487 /* Finish the declaration of a fully implicit function template. Such a
33488 template has no explicit template parameter list so has not been through the
33489 normal template head and tail processing. synthesize_implicit_template_parm
33490 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33491 provided if the declaration is a class member such that its template
33492 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33493 form is returned. Otherwise NULL_TREE is returned. */
33495 tree
33497 {
33502 {
33506 }
33516 }