| blob | 32c7a3fe1469531c18536e74ff52c890335bc757 |
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/>. */
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
186 /* Prototypes. */
192 static void cp_lexer_destroy
194 static int cp_lexer_saving_tokens
198 static void cp_lexer_get_preprocessor_token
206 static bool cp_lexer_next_token_is_not
208 static bool cp_lexer_next_token_is_keyword
212 static void cp_lexer_purge_token
214 static void cp_lexer_purge_tokens_after
216 static void cp_lexer_save_tokens
218 static void cp_lexer_commit_tokens
220 static void cp_lexer_rollback_tokens
222 static void cp_lexer_print_token
226 static void cp_lexer_start_debugging
228 static void cp_lexer_stop_debugging
234 static void cp_parser_initial_pragma
237 static tree cp_literal_operator_id
240 static void cp_parser_cilk_simd
242 static bool cp_parser_omp_declare_reduction_exprs
244 static tree cp_parser_cilk_simd_vectorlength
247 /* Manifest constants. */
248 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
249 #define CP_SAVED_TOKEN_STACK 5
251 /* Variables. */
253 /* The stream to which debugging output should be written. */
256 /* Nonzero if we are parsing an unevaluated operand: an operand to
257 sizeof, typeof, or alignof. */
260 /* Dump up to NUM tokens in BUFFER to FILE starting with token
261 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
262 first token in BUFFER. If NUM is 0, dump all the tokens. If
263 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
264 highlighted by surrounding it in [[ ]]. */
266 static void
270 {
287 {
290 }
295 {
302 nprinted++;
312 {
322 }
323 }
326 {
329 }
332 }
335 /* Dump all tokens in BUFFER to stderr. */
337 void
339 {
341 }
343 DEBUG_FUNCTION void
345 {
347 }
349 DEBUG_FUNCTION void
351 {
354 else
356 }
359 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
360 description for T. */
362 static void
364 {
366 {
369 }
370 }
373 /* Dump parser context C to FILE. */
375 static void
377 {
382 }
385 /* Print the stack of parsing contexts to FILE starting with FIRST. */
387 static void
389 {
395 {
398 }
399 }
402 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
404 static void
406 {
409 }
412 /* Print an unparsed function entry UF to FILE. */
414 static void
416 {
419 tree fn;
424 i++)
425 {
431 }
436 {
439 }
445 {
448 }
450 }
453 /* Print the stack of unparsed member functions S to FILE. */
455 static void
458 {
464 {
467 }
468 }
471 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
472 the given PARSER. If FILE is NULL, the output is printed on stderr. */
474 static void
476 {
488 next_token);
489 }
492 /* Dump debugging information for the given PARSER. If FILE is NULL,
493 the output is printed on stderr. */
495 void
497 {
500 expanded_location eloc;
578 }
580 DEBUG_FUNCTION void
582 {
584 }
586 DEBUG_FUNCTION void
588 {
591 else
593 }
595 /* Allocate memory for a new lexer object and return it. */
599 {
604 /* Allocate the memory. */
607 /* Initially we are not debugging. */
612 /* Create the buffer. */
616 }
619 /* Create a new main C++ lexer, the lexer that gets tokens from the
620 preprocessor. */
624 {
626 cp_token token;
628 /* It's possible that parsing the first pragma will load a PCH file,
629 which is a GC collection point. So we have to do that before
630 allocating any memory. */
635 /* Put the first token in the buffer. */
638 /* Get the remaining tokens from the preprocessor. */
640 {
643 }
652 /* Subsequent preprocessor diagnostics should use compiler
653 diagnostic functions to get the compiler source location. */
658 }
660 /* Create a new lexer whose token stream is primed with the tokens in
661 CACHE. When these tokens are exhausted, no new tokens will be read. */
665 {
670 /* We do not own the buffer. */
677 /* Initially we are not debugging. */
682 }
684 /* Frees all resources associated with LEXER. */
686 static void
688 {
692 }
694 /* Returns nonzero if debugging information should be output. */
698 {
700 }
705 {
709 }
713 {
715 }
719 {
721 }
725 {
728 else
730 }
734 {
738 }
740 /* nonzero if we are presently saving tokens. */
744 {
746 }
748 /* Store the next token from the preprocessor in *TOKEN. Return true
749 if we reach EOF. If LEXER is NULL, assume we are handling an
750 initial #pragma pch_preprocess, and thus want the lexer to return
751 processed strings. */
753 static void
755 {
758 /* Get a new token from the preprocessor. */
759 token->type
767 /* On some systems, some header files are surrounded by an
768 implicit extern "C" block. Set a flag in the token if it
769 comes from such a header. */
774 /* Check to see if this token is a keyword. */
776 {
778 {
779 /* Mark this token as a keyword. */
781 /* Record which keyword. */
783 }
784 else
785 {
789 {
790 /* Warn about the C++0x keyword (but still treat it as
791 an identifier). */
796 /* Clear out the C_RID_CODE so we don't warn about this
797 particular identifier-turned-keyword again. */
799 }
802 }
803 }
805 {
806 /* This only happens in Objective-C++; it must be a keyword. */
809 {
810 /* Replace 'class' with '@class', 'private' with '@private',
811 etc. This prevents confusion with the C++ keyword
812 'class', and makes the tokens consistent with other
813 Objective-C 'AT' keywords. For example '@class' is
814 reported as RID_AT_CLASS which is consistent with
815 '@synchronized', which is reported as
816 RID_AT_SYNCHRONIZED.
817 */
826 }
827 }
829 {
830 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
834 }
835 }
837 /* Update the globals input_location and the input file stack from TOKEN. */
840 {
842 {
844 }
845 }
847 /* Update the globals input_location and the input file stack from LEXER. */
850 {
853 }
855 /* Return a pointer to the next token in the token stream, but do not
856 consume it. */
860 {
862 {
866 }
868 }
870 /* Return true if the next token has the indicated TYPE. */
874 {
876 }
878 /* Return true if the next token does not have the indicated TYPE. */
882 {
884 }
886 /* Return true if the next token is the indicated KEYWORD. */
890 {
892 }
896 {
898 }
902 {
904 }
906 /* Return true if the next token is not the indicated KEYWORD. */
910 {
912 }
914 /* Return true if the next token is a keyword for a decl-specifier. */
916 static bool
918 {
923 {
924 /* auto specifier: storage-class-specifier in C++,
925 simple-type-specifier in C++0x. */
927 /* Storage classes. */
933 /* Elaborated type specifiers. */
939 /* Simple type specifiers. */
954 /* GNU extensions. */
957 /* C++0x extensions. */
964 }
965 }
967 /* Returns TRUE iff the token T begins a decltype type. */
969 static bool
971 {
974 }
976 /* Returns TRUE iff the next token begins a decltype type. */
978 static bool
980 {
983 }
985 /* Return a pointer to the Nth token in the token stream. If N is 1,
986 then this is precisely equivalent to cp_lexer_peek_token (except
987 that it is not inline). One would like to disallow that case, but
988 there is one case (cp_parser_nth_token_starts_template_id) where
989 the caller passes a variable for N and it might be 1. */
993 {
996 /* N is 1-based, not zero-based. */
1007 {
1010 {
1013 }
1017 }
1020 {
1023 }
1026 }
1028 /* Return the next token, and advance the lexer's next_token pointer
1029 to point to the next non-purged token. */
1033 {
1039 do
1040 {
1043 {
1046 }
1048 }
1053 /* Provide debugging output. */
1055 {
1059 }
1062 }
1064 /* Permanently remove the next token from the token stream, and
1065 advance the next_token pointer to refer to the next non-purged
1066 token. */
1068 static void
1070 {
1079 do
1080 {
1081 tok++;
1083 {
1086 }
1087 }
1090 }
1092 /* Permanently remove all tokens after TOK, up to, but not
1093 including, the token that will be returned next by
1094 cp_lexer_peek_token. */
1096 static void
1098 {
1107 {
1112 }
1113 }
1115 /* Begin saving tokens. All tokens consumed after this point will be
1116 preserved. */
1118 static void
1120 {
1121 /* Provide debugging output. */
1126 }
1128 /* Commit to the portion of the token stream most recently saved. */
1130 static void
1132 {
1133 /* Provide debugging output. */
1138 }
1140 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1141 to the token stream. Stop saving tokens. */
1143 static void
1145 {
1146 /* Provide debugging output. */
1151 }
1153 /* Print a representation of the TOKEN on the STREAM. */
1155 static void
1157 {
1158 /* We don't use cpp_type2name here because the parser defines
1159 a few tokens of its own. */
1161 /* cpplib-defined token types */
1162 #define OP(e, s) #e,
1163 #define TK(e, s) #e,
1164 TTYPE_TABLE
1165 #undef OP
1166 #undef TK
1167 /* C++ parser token types - see "Manifest constants", above. */
1171 };
1173 /* For some tokens, print the associated data. */
1175 {
1177 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1178 For example, `struct' is mapped to an INTEGER_CST. */
1181 /* else fall through */
1199 /* If we have a name for the token, print it out. Otherwise, we
1200 simply give the numeric code. */
1203 else
1206 }
1207 }
1209 DEBUG_FUNCTION void
1211 {
1214 }
1216 DEBUG_FUNCTION void
1218 {
1221 else
1223 }
1226 /* Start emitting debugging information. */
1228 static void
1230 {
1233 }
1235 /* Stop emitting debugging information. */
1237 static void
1239 {
1242 }
1244 /* Create a new cp_token_cache, representing a range of tokens. */
1248 {
1253 }
1255 /* Diagnose if #pragma omp declare simd isn't followed immediately
1256 by function declaration or definition. */
1260 {
1262 {
1266 }
1267 }
1269 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1270 and put that into "omp declare simd" attribute. */
1274 {
1276 {
1278 {
1281 }
1283 {
1286 }
1287 }
1288 }
1289 \f
1290 /* Decl-specifiers. */
1292 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1294 static void
1296 {
1298 }
1300 /* Declarators. */
1302 /* Nothing other than the parser should be creating declarators;
1303 declarators are a semi-syntactic representation of C++ entities.
1304 Other parts of the front end that need to create entities (like
1305 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1320 /* An erroneous declarator. */
1323 /* The obstack on which declarators and related data structures are
1324 allocated. */
1327 /* Alloc BYTES from the declarator memory pool. */
1331 {
1333 }
1335 /* Allocate a declarator of the indicated KIND. Clear fields that are
1336 common to all declarators. */
1340 {
1352 }
1354 /* Make a declarator for a generalized identifier. If
1355 QUALIFYING_SCOPE is non-NULL, the identifier is
1356 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1357 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1358 is, if any. */
1362 special_function_kind sfk)
1363 {
1366 /* It is valid to write:
1368 class C { void f(); };
1369 typedef C D;
1370 void D::f();
1372 The standard is not clear about whether `typedef const C D' is
1373 legal; as of 2002-09-15 the committee is considering that
1374 question. EDG 3.0 allows that syntax. Therefore, we do as
1375 well. */
1389 }
1391 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1392 of modifiers such as const or volatile to apply to the pointer
1393 type, represented as identifiers. ATTRIBUTES represent the attributes that
1394 appertain to the pointer or reference. */
1396 cp_declarator *
1398 tree attributes)
1399 {
1407 {
1411 }
1412 else
1418 }
1420 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1421 represent the attributes that appertain to the pointer or
1422 reference. */
1424 cp_declarator *
1427 {
1435 {
1439 }
1440 else
1446 }
1448 /* Like make_pointer_declarator -- but for a pointer to a non-static
1449 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1450 appertain to the pointer or reference. */
1452 cp_declarator *
1455 tree attributes)
1456 {
1465 {
1468 }
1469 else
1475 }
1477 /* Make a declarator for the function given by TARGET, with the
1478 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1479 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1480 indicates what exceptions can be thrown. */
1482 cp_declarator *
1484 tree parms,
1485 cp_cv_quals cv_qualifiers,
1486 cp_virt_specifiers virt_specifiers,
1487 cp_ref_qualifier ref_qualifier,
1488 tree exception_specification,
1489 tree late_return_type)
1490 {
1502 {
1506 }
1507 else
1511 }
1513 /* Make a declarator for an array of BOUNDS elements, each of which is
1514 defined by ELEMENT. */
1516 cp_declarator *
1518 {
1525 {
1529 }
1530 else
1534 }
1536 /* Determine whether the declarator we've seen so far can be a
1537 parameter pack, when followed by an ellipsis. */
1538 static bool
1540 {
1541 /* Search for a declarator name, or any other declarator that goes
1542 after the point where the ellipsis could appear in a parameter
1543 pack. If we find any of these, then this declarator can not be
1544 made into a parameter pack. */
1547 {
1549 {
1561 }
1562 }
1565 }
1569 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1570 DECLARATOR and DEFAULT_ARGUMENT. */
1572 cp_parameter_declarator *
1575 tree default_argument)
1576 {
1584 else
1591 }
1593 /* Returns true iff DECLARATOR is a declaration for a function. */
1595 static bool
1597 {
1599 {
1607 }
1609 }
1611 /* The parser. */
1613 /* Overview
1614 --------
1616 A cp_parser parses the token stream as specified by the C++
1617 grammar. Its job is purely parsing, not semantic analysis. For
1618 example, the parser breaks the token stream into declarators,
1619 expressions, statements, and other similar syntactic constructs.
1620 It does not check that the types of the expressions on either side
1621 of an assignment-statement are compatible, or that a function is
1622 not declared with a parameter of type `void'.
1624 The parser invokes routines elsewhere in the compiler to perform
1625 semantic analysis and to build up the abstract syntax tree for the
1626 code processed.
1628 The parser (and the template instantiation code, which is, in a
1629 way, a close relative of parsing) are the only parts of the
1630 compiler that should be calling push_scope and pop_scope, or
1631 related functions. The parser (and template instantiation code)
1632 keeps track of what scope is presently active; everything else
1633 should simply honor that. (The code that generates static
1634 initializers may also need to set the scope, in order to check
1635 access control correctly when emitting the initializers.)
1637 Methodology
1638 -----------
1640 The parser is of the standard recursive-descent variety. Upcoming
1641 tokens in the token stream are examined in order to determine which
1642 production to use when parsing a non-terminal. Some C++ constructs
1643 require arbitrary look ahead to disambiguate. For example, it is
1644 impossible, in the general case, to tell whether a statement is an
1645 expression or declaration without scanning the entire statement.
1646 Therefore, the parser is capable of "parsing tentatively." When the
1647 parser is not sure what construct comes next, it enters this mode.
1648 Then, while we attempt to parse the construct, the parser queues up
1649 error messages, rather than issuing them immediately, and saves the
1650 tokens it consumes. If the construct is parsed successfully, the
1651 parser "commits", i.e., it issues any queued error messages and
1652 the tokens that were being preserved are permanently discarded.
1653 If, however, the construct is not parsed successfully, the parser
1654 rolls back its state completely so that it can resume parsing using
1655 a different alternative.
1657 Future Improvements
1658 -------------------
1660 The performance of the parser could probably be improved substantially.
1661 We could often eliminate the need to parse tentatively by looking ahead
1662 a little bit. In some places, this approach might not entirely eliminate
1663 the need to parse tentatively, but it might still speed up the average
1664 case. */
1666 /* Flags that are passed to some parsing functions. These values can
1667 be bitwise-ored together. */
1669 enum
1670 {
1671 /* No flags. */
1673 /* The construct is optional. If it is not present, then no error
1674 should be issued. */
1676 /* When parsing a type-specifier, treat user-defined type-names
1677 as non-type identifiers. */
1679 /* When parsing a type-specifier, do not try to parse a class-specifier
1680 or enum-specifier. */
1682 /* When parsing a decl-specifier-seq, only allow type-specifier or
1683 constexpr. */
1685 };
1687 /* This type is used for parameters and variables which hold
1688 combinations of the above flags. */
1691 /* The different kinds of declarators we want to parse. */
1694 {
1695 /* We want an abstract declarator. */
1696 CP_PARSER_DECLARATOR_ABSTRACT,
1697 /* We want a named declarator. */
1698 CP_PARSER_DECLARATOR_NAMED,
1699 /* We don't mind, but the name must be an unqualified-id. */
1700 CP_PARSER_DECLARATOR_EITHER
1703 /* The precedence values used to parse binary expressions. The minimum value
1704 of PREC must be 1, because zero is reserved to quickly discriminate
1705 binary operators from other tokens. */
1707 enum cp_parser_prec
1708 {
1709 PREC_NOT_OPERATOR,
1710 PREC_LOGICAL_OR_EXPRESSION,
1711 PREC_LOGICAL_AND_EXPRESSION,
1712 PREC_INCLUSIVE_OR_EXPRESSION,
1713 PREC_EXCLUSIVE_OR_EXPRESSION,
1714 PREC_AND_EXPRESSION,
1715 PREC_EQUALITY_EXPRESSION,
1716 PREC_RELATIONAL_EXPRESSION,
1717 PREC_SHIFT_EXPRESSION,
1718 PREC_ADDITIVE_EXPRESSION,
1719 PREC_MULTIPLICATIVE_EXPRESSION,
1720 PREC_PM_EXPRESSION,
1721 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1722 };
1724 /* A mapping from a token type to a corresponding tree node type, with a
1725 precedence value. */
1728 {
1729 /* The token type. */
1731 /* The corresponding tree code. */
1733 /* The precedence of this operator. */
1738 {
1739 /* Left hand side of the binary operation we are currently
1740 parsing. */
1741 tree lhs;
1742 /* Original tree code for left hand side, if it was a binary
1743 expression itself (used for -Wparentheses). */
1745 /* Tree code for the binary operation we are parsing. */
1747 /* Precedence of the binary operation we are parsing. */
1749 /* Location of the binary operation we are parsing. */
1750 location_t loc;
1753 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1754 entries because precedence levels on the stack are monotonically
1755 increasing. */
1759 /* Prototypes. */
1761 /* Constructors and destructors. */
1766 /* Class variables. */
1770 /* The operator-precedence table used by cp_parser_binary_expression.
1771 Transformed into an associative array (binops_by_token) by
1772 cp_parser_new. */
1805 };
1807 /* The same as binops, but initialized by cp_parser_new so that
1808 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1809 for speed. */
1812 /* Constructors and destructors. */
1814 /* Construct a new context. The context below this one on the stack
1815 is given by NEXT. */
1819 {
1822 /* Allocate the storage. */
1824 {
1825 /* Pull the first entry from the free list. */
1829 }
1830 else
1833 /* No errors have occurred yet in this context. */
1835 /* If this is not the bottommost context, copy information that we
1836 need from the previous context. */
1838 {
1839 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1840 expression, then we are parsing one in this context, too. */
1842 /* Thread the stack. */
1844 }
1847 }
1849 /* Managing the unparsed function queues. */
1851 #define unparsed_funs_with_default_args \
1852 parser->unparsed_queues->last ().funs_with_default_args
1853 #define unparsed_funs_with_definitions \
1854 parser->unparsed_queues->last ().funs_with_definitions
1855 #define unparsed_nsdmis \
1856 parser->unparsed_queues->last ().nsdmis
1857 #define unparsed_classes \
1858 parser->unparsed_queues->last ().classes
1860 static void
1862 {
1865 }
1867 static void
1869 {
1872 }
1874 /* Prototypes. */
1876 /* Constructors and destructors. */
1881 /* Routines to parse various constructs.
1883 Those that return `tree' will return the error_mark_node (rather
1884 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1885 Sometimes, they will return an ordinary node if error-recovery was
1886 attempted, even though a parse error occurred. So, to check
1887 whether or not a parse error occurred, you should always use
1888 cp_parser_error_occurred. If the construct is optional (indicated
1889 either by an `_opt' in the name of the function that does the
1890 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1891 the construct is not present. */
1893 /* Lexical conventions [gram.lex] */
1895 static tree cp_parser_identifier
1897 static tree cp_parser_string_literal
1899 static tree cp_parser_userdef_char_literal
1901 static tree cp_parser_userdef_string_literal
1903 static tree cp_parser_userdef_numeric_literal
1906 /* Basic concepts [gram.basic] */
1908 static bool cp_parser_translation_unit
1911 /* Expressions [gram.expr] */
1913 static tree cp_parser_primary_expression
1915 static tree cp_parser_id_expression
1917 static tree cp_parser_unqualified_id
1919 static tree cp_parser_nested_name_specifier_opt
1921 static tree cp_parser_nested_name_specifier
1923 static tree cp_parser_qualifying_entity
1925 static tree cp_parser_postfix_expression
1927 static tree cp_parser_postfix_open_square_expression
1929 static tree cp_parser_postfix_dot_deref_expression
1933 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1935 static void cp_parser_pseudo_destructor_name
1937 static tree cp_parser_unary_expression
1939 static enum tree_code cp_parser_unary_operator
1941 static tree cp_parser_new_expression
1945 static tree cp_parser_new_type_id
1953 static tree cp_parser_delete_expression
1955 static tree cp_parser_cast_expression
1957 static tree cp_parser_binary_expression
1959 static tree cp_parser_question_colon_clause
1961 static tree cp_parser_assignment_expression
1963 static enum tree_code cp_parser_assignment_operator_opt
1965 static tree cp_parser_expression
1967 static tree cp_parser_expression
1969 static tree cp_parser_constant_expression
1971 static tree cp_parser_builtin_offsetof
1973 static tree cp_parser_lambda_expression
1975 static void cp_parser_lambda_introducer
1977 static bool cp_parser_lambda_declarator_opt
1979 static void cp_parser_lambda_body
1982 /* Statements [gram.stmt.stmt] */
1984 static void cp_parser_statement
1986 static void cp_parser_label_for_labeled_statement
1988 static tree cp_parser_expression_statement
1990 static tree cp_parser_compound_statement
1992 static void cp_parser_statement_seq_opt
1994 static tree cp_parser_selection_statement
1996 static tree cp_parser_condition
1998 static tree cp_parser_iteration_statement
2000 static bool cp_parser_for_init_statement
2002 static tree cp_parser_for
2004 static tree cp_parser_c_for
2006 static tree cp_parser_range_for
2008 static void do_range_for_auto_deduction
2010 static tree cp_parser_perform_range_for_lookup
2012 static tree cp_parser_range_for_member_function
2014 static tree cp_parser_jump_statement
2016 static void cp_parser_declaration_statement
2019 static tree cp_parser_implicitly_scoped_statement
2021 static void cp_parser_already_scoped_statement
2024 /* Declarations [gram.dcl.dcl] */
2026 static void cp_parser_declaration_seq_opt
2028 static void cp_parser_declaration
2030 static void cp_parser_block_declaration
2032 static void cp_parser_simple_declaration
2034 static void cp_parser_decl_specifier_seq
2036 static tree cp_parser_storage_class_specifier_opt
2038 static tree cp_parser_function_specifier_opt
2040 static tree cp_parser_type_specifier
2043 static tree cp_parser_simple_type_specifier
2045 static tree cp_parser_type_name
2047 static tree cp_parser_nonclass_name
2049 static tree cp_parser_elaborated_type_specifier
2051 static tree cp_parser_enum_specifier
2053 static void cp_parser_enumerator_list
2055 static void cp_parser_enumerator_definition
2057 static tree cp_parser_namespace_name
2059 static void cp_parser_namespace_definition
2061 static void cp_parser_namespace_body
2063 static tree cp_parser_qualified_namespace_specifier
2065 static void cp_parser_namespace_alias_definition
2067 static bool cp_parser_using_declaration
2069 static void cp_parser_using_directive
2071 static tree cp_parser_alias_declaration
2073 static void cp_parser_asm_definition
2075 static void cp_parser_linkage_specification
2077 static void cp_parser_static_assert
2079 static tree cp_parser_decltype
2082 /* Declarators [gram.dcl.decl] */
2084 static tree cp_parser_init_declarator
2085 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2090 static enum tree_code cp_parser_ptr_operator
2092 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2094 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2096 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2098 static tree cp_parser_late_return_type_opt
2100 static tree cp_parser_declarator_id
2102 static tree cp_parser_type_id
2104 static tree cp_parser_template_type_arg
2107 static tree cp_parser_type_id_1
2109 static void cp_parser_type_specifier_seq
2111 static tree cp_parser_parameter_declaration_clause
2113 static tree cp_parser_parameter_declaration_list
2117 static tree cp_parser_default_argument
2119 static void cp_parser_function_body
2121 static tree cp_parser_initializer
2123 static tree cp_parser_initializer_clause
2125 static tree cp_parser_braced_list
2130 static bool cp_parser_ctor_initializer_opt_and_function_body
2133 static tree cp_parser_late_parsing_omp_declare_simd
2136 static tree cp_parser_late_parsing_cilk_simd_fn_info
2139 static tree synthesize_implicit_template_parm
2141 static tree finish_fully_implicit_template
2144 /* Classes [gram.class] */
2146 static tree cp_parser_class_name
2148 static tree cp_parser_class_specifier
2150 static tree cp_parser_class_head
2152 static enum tag_types cp_parser_class_key
2154 static void cp_parser_type_parameter_key
2156 static void cp_parser_member_specification_opt
2158 static void cp_parser_member_declaration
2160 static tree cp_parser_pure_specifier
2162 static tree cp_parser_constant_initializer
2165 /* Derived classes [gram.class.derived] */
2167 static tree cp_parser_base_clause
2169 static tree cp_parser_base_specifier
2172 /* Special member functions [gram.special] */
2174 static tree cp_parser_conversion_function_id
2176 static tree cp_parser_conversion_type_id
2180 static bool cp_parser_ctor_initializer_opt
2182 static void cp_parser_mem_initializer_list
2184 static tree cp_parser_mem_initializer
2186 static tree cp_parser_mem_initializer_id
2189 /* Overloading [gram.over] */
2191 static tree cp_parser_operator_function_id
2193 static tree cp_parser_operator
2196 /* Templates [gram.temp] */
2198 static void cp_parser_template_declaration
2200 static tree cp_parser_template_parameter_list
2202 static tree cp_parser_template_parameter
2204 static tree cp_parser_type_parameter
2206 static tree cp_parser_template_id
2208 static tree cp_parser_template_name
2210 static tree cp_parser_template_argument_list
2212 static tree cp_parser_template_argument
2214 static void cp_parser_explicit_instantiation
2216 static void cp_parser_explicit_specialization
2219 /* Exception handling [gram.exception] */
2221 static tree cp_parser_try_block
2223 static bool cp_parser_function_try_block
2225 static void cp_parser_handler_seq
2227 static void cp_parser_handler
2229 static tree cp_parser_exception_declaration
2231 static tree cp_parser_throw_expression
2233 static tree cp_parser_exception_specification_opt
2235 static tree cp_parser_type_id_list
2238 /* GNU Extensions */
2240 static tree cp_parser_asm_specification_opt
2242 static tree cp_parser_asm_operand_list
2244 static tree cp_parser_asm_clobber_list
2246 static tree cp_parser_asm_label_list
2248 static bool cp_next_tokens_can_be_attribute_p
2250 static bool cp_next_tokens_can_be_gnu_attribute_p
2252 static bool cp_next_tokens_can_be_std_attribute_p
2254 static bool cp_nth_tokens_can_be_std_attribute_p
2256 static bool cp_nth_tokens_can_be_gnu_attribute_p
2258 static bool cp_nth_tokens_can_be_attribute_p
2260 static tree cp_parser_attributes_opt
2262 static tree cp_parser_gnu_attributes_opt
2264 static tree cp_parser_gnu_attribute_list
2266 static tree cp_parser_std_attribute
2268 static tree cp_parser_std_attribute_spec
2270 static tree cp_parser_std_attribute_spec_seq
2272 static bool cp_parser_extension_opt
2274 static void cp_parser_label_declaration
2277 /* Transactional Memory Extensions */
2279 static tree cp_parser_transaction
2281 static tree cp_parser_transaction_expression
2283 static bool cp_parser_function_transaction
2285 static tree cp_parser_transaction_cancel
2289 pragma_external,
2290 pragma_member,
2291 pragma_objc_icode,
2292 pragma_stmt,
2293 pragma_compound
2294 };
2295 static bool cp_parser_pragma
2298 /* Objective-C++ Productions */
2300 static tree cp_parser_objc_message_receiver
2302 static tree cp_parser_objc_message_args
2304 static tree cp_parser_objc_message_expression
2306 static tree cp_parser_objc_encode_expression
2308 static tree cp_parser_objc_defs_expression
2310 static tree cp_parser_objc_protocol_expression
2312 static tree cp_parser_objc_selector_expression
2314 static tree cp_parser_objc_expression
2316 static bool cp_parser_objc_selector_p
2318 static tree cp_parser_objc_selector
2320 static tree cp_parser_objc_protocol_refs_opt
2322 static void cp_parser_objc_declaration
2324 static tree cp_parser_objc_statement
2326 static bool cp_parser_objc_valid_prefix_attributes
2328 static void cp_parser_objc_at_property_declaration
2330 static void cp_parser_objc_at_synthesize_declaration
2332 static void cp_parser_objc_at_dynamic_declaration
2334 static tree cp_parser_objc_struct_declaration
2337 /* Utility Routines */
2339 static tree cp_parser_lookup_name
2341 static tree cp_parser_lookup_name_simple
2343 static tree cp_parser_maybe_treat_template_as_class
2345 static bool cp_parser_check_declarator_template_parameters
2347 static bool cp_parser_check_template_parameters
2349 static tree cp_parser_simple_cast_expression
2351 static tree cp_parser_global_scope_opt
2353 static bool cp_parser_constructor_declarator_p
2355 static tree cp_parser_function_definition_from_specifiers_and_declarator
2357 static tree cp_parser_function_definition_after_declarator
2359 static void cp_parser_template_declaration_after_export
2361 static void cp_parser_perform_template_parameter_access_checks
2363 static tree cp_parser_single_declaration
2365 static tree cp_parser_functional_cast
2367 static tree cp_parser_save_member_function_body
2369 static tree cp_parser_save_nsdmi
2371 static tree cp_parser_enclosed_template_argument_list
2373 static void cp_parser_save_default_args
2375 static void cp_parser_late_parsing_for_member
2377 static tree cp_parser_late_parse_one_default_arg
2379 static void cp_parser_late_parsing_nsdmi
2381 static void cp_parser_late_parsing_default_args
2383 static tree cp_parser_sizeof_operand
2385 static tree cp_parser_trait_expr
2387 static bool cp_parser_declares_only_class_p
2389 static void cp_parser_set_storage_class
2391 static void cp_parser_set_decl_spec_type
2393 static void set_and_check_decl_spec_loc
2396 static bool cp_parser_friend_p
2398 static void cp_parser_required_error
2404 static bool cp_parser_token_starts_function_definition_p
2406 static bool cp_parser_next_token_starts_class_definition_p
2408 static bool cp_parser_next_token_ends_template_argument_p
2410 static bool cp_parser_nth_token_starts_template_argument_list_p
2412 static enum tag_types cp_parser_token_is_class_key
2414 static enum tag_types cp_parser_token_is_type_parameter_key
2416 static void cp_parser_check_class_key
2418 static void cp_parser_check_access_in_redeclaration
2420 static bool cp_parser_optional_template_keyword
2422 static void cp_parser_pre_parsed_nested_name_specifier
2424 static bool cp_parser_cache_group
2426 static tree cp_parser_cache_defarg
2428 static void cp_parser_parse_tentatively
2430 static void cp_parser_commit_to_tentative_parse
2432 static void cp_parser_commit_to_topmost_tentative_parse
2434 static void cp_parser_abort_tentative_parse
2436 static bool cp_parser_parse_definitely
2440 static bool cp_parser_uncommitted_to_tentative_parse_p
2442 static void cp_parser_error
2444 static void cp_parser_name_lookup_error
2446 static bool cp_parser_simulate_error
2448 static bool cp_parser_check_type_definition
2450 static void cp_parser_check_for_definition_in_return_type
2452 static void cp_parser_check_for_invalid_template_id
2454 static bool cp_parser_non_integral_constant_expression
2456 static void cp_parser_diagnose_invalid_type_name
2458 static bool cp_parser_parse_and_diagnose_invalid_type_name
2460 static int cp_parser_skip_to_closing_parenthesis
2462 static void cp_parser_skip_to_end_of_statement
2464 static void cp_parser_consume_semicolon_at_end_of_statement
2466 static void cp_parser_skip_to_end_of_block_or_statement
2468 static bool cp_parser_skip_to_closing_brace
2470 static void cp_parser_skip_to_end_of_template_parameter_list
2472 static void cp_parser_skip_to_pragma_eol
2474 static bool cp_parser_error_occurred
2476 static bool cp_parser_allow_gnu_extensions_p
2478 static bool cp_parser_is_pure_string_literal
2480 static bool cp_parser_is_string_literal
2482 static bool cp_parser_is_keyword
2484 static tree cp_parser_make_typename_type
2488 static bool cp_parser_compound_literal_p
2491 /* Returns nonzero if we are parsing tentatively. */
2495 {
2497 }
2499 /* Returns nonzero if TOKEN is a string literal. */
2501 static bool
2503 {
2509 }
2511 /* Returns nonzero if TOKEN is a string literal
2512 of a user-defined string literal. */
2514 static bool
2516 {
2523 }
2525 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2527 static bool
2529 {
2531 }
2533 /* If not parsing tentatively, issue a diagnostic of the form
2534 FILE:LINE: MESSAGE before TOKEN
2535 where TOKEN is the next token in the input stream. MESSAGE
2536 (specified by the caller) is usually of the form "expected
2537 OTHER-TOKEN". */
2539 static void
2541 {
2543 {
2545 /* This diagnostic makes more sense if it is tagged to the line
2546 of the token we just peeked at. */
2550 {
2555 }
2558 /* Because c_parser_error does not understand
2559 CPP_KEYWORD, keywords are treated like
2560 identifiers. */
2563 }
2564 }
2566 /* Issue an error about name-lookup failing. NAME is the
2567 IDENTIFIER_NODE DECL is the result of
2568 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2569 the thing that we hoped to find. */
2571 static void
2573 tree name,
2574 tree decl,
2575 name_lookup_error desired,
2576 location_t location)
2577 {
2578 /* If name lookup completely failed, tell the user that NAME was not
2579 declared. */
2581 {
2594 else
2596 }
2598 {
2600 {
2617 }
2618 }
2620 {
2622 {
2632 name);
2636 }
2637 }
2638 else
2639 {
2641 {
2654 }
2655 }
2656 }
2658 /* If we are parsing tentatively, remember that an error has occurred
2659 during this tentative parse. Returns true if the error was
2660 simulated; false if a message should be issued by the caller. */
2662 static bool
2664 {
2666 {
2669 }
2671 }
2673 /* This function is called when a type is defined. If type
2674 definitions are forbidden at this point, an error message is
2675 issued. */
2677 static bool
2679 {
2680 /* If types are forbidden here, issue a message. */
2682 {
2683 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2684 in the message need to be interpreted. */
2687 }
2689 }
2691 /* This function is called when the DECLARATOR is processed. The TYPE
2692 was a type defined in the decl-specifiers. If it is invalid to
2693 define a type in the decl-specifiers for DECLARATOR, an error is
2694 issued. TYPE_LOCATION is the location of TYPE and is used
2695 for error reporting. */
2697 static void
2700 {
2701 /* [dcl.fct] forbids type definitions in return types.
2702 Unfortunately, it's not easy to know whether or not we are
2703 processing a return type until after the fact. */
2711 {
2716 type);
2717 }
2718 }
2720 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2721 "<" in any valid C++ program. If the next token is indeed "<",
2722 issue a message warning the user about what appears to be an
2723 invalid attempt to form a template-id. LOCATION is the location
2724 of the type-specifier (TYPE) */
2726 static void
2728 tree type,
2730 location_t location)
2731 {
2735 {
2739 {
2742 else
2744 }
2745 else
2747 /* Remember the location of the invalid "<". */
2750 /* Consume the "<". */
2752 /* Parse the template arguments. */
2754 /* Permanently remove the invalid template arguments so that
2755 this error message is not issued again. */
2758 }
2759 }
2761 /* If parsing an integral constant-expression, issue an error message
2762 about the fact that THING appeared and return true. Otherwise,
2763 return false. In either case, set
2764 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2766 static bool
2768 non_integral_constant thing)
2769 {
2772 {
2774 {
2777 {
2784 "enumeration type cannot appear in a "
2875 }
2879 }
2880 }
2882 }
2884 /* Emit a diagnostic for an invalid type name. SCOPE is the
2885 qualifying scope (or NULL, if none) for ID. This function commits
2886 to the current active tentative parse, if any. (Otherwise, the
2887 problematic construct might be encountered again later, resulting
2888 in duplicate error messages.) LOCATION is the location of ID. */
2890 static void
2893 location_t location)
2894 {
2897 /* Try to lookup the identifier. */
2907 /* If the lookup was ambiguous, an error will already have
2908 been issued. */
2910 /* If the lookup found a template-name, it means that the user forgot
2911 to specify an argument list. Emit a useful error message. */
2915 decl);
2919 /* Something like 'unsigned A a;' */
2922 {
2923 /* Issue an error message. */
2925 /* If we're in a template class, it's possible that the user was
2926 referring to a type from a base class. For example:
2928 template <typename T> struct A { typedef T X; };
2929 template <typename T> struct B : public A<T> { X x; };
2931 The user should have said "typename A<T>::X". */
2944 {
2945 tree b;
2948 b;
2950 {
2954 {
2955 tree field;
2956 /* Go from a particular instantiation of the
2957 template (which will have an empty TYPE_FIELDs),
2958 to the main version. */
2961 field;
2965 {
2970 }
2973 }
2974 }
2975 }
2976 }
2977 /* Here we diagnose qualified-ids where the scope is actually correct,
2978 but the identifier does not resolve to a valid type name. */
2980 {
2982 {
2987 else
2991 }
2994 {
2995 /* A<T>::A<T>() */
3001 }
3008 {
3013 else
3017 }
3018 else
3020 }
3021 }
3023 /* Check for a common situation where a type-name should be present,
3024 but is not, and issue a sensible error message. Returns true if an
3025 invalid type-name was detected.
3027 The situation handled by this function are variable declarations of the
3028 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3029 Usually, `ID' should name a type, but if we got here it means that it
3030 does not. We try to emit the best possible error message depending on
3031 how exactly the id-expression looks like. */
3033 static bool
3035 {
3036 tree id;
3039 /* Avoid duplicate error about ambiguous lookup. */
3041 {
3045 }
3054 /* If the next token is a (, this is a function with no explicit return
3055 type, i.e. constructor, destructor or conversion op. */
3058 {
3061 }
3065 /* Emit a diagnostic for the invalid type. */
3068 out:
3069 /* If we aren't in the middle of a declarator (i.e. in a
3070 parameter-declaration-clause), skip to the end of the declaration;
3071 there's no point in trying to process it. */
3075 }
3077 /* Consume tokens up to, and including, the next non-nested closing `)'.
3078 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3079 are doing error recovery. Returns -1 if OR_COMMA is true and we
3080 found an unnested comma. */
3082 static int
3087 {
3097 {
3101 {
3104 /* If we've run out of tokens, then there is no closing `)'. */
3107 /* This is good for lambda expression capture-lists. */
3117 /* This matches the processing in skip_to_end_of_statement. */
3143 {
3147 }
3152 }
3154 /* Consume the token. */
3156 }
3157 }
3159 /* Consume tokens until we reach the end of the current statement.
3160 Normally, that will be just before consuming a `;'. However, if a
3161 non-nested `}' comes first, then we stop before consuming that. */
3163 static void
3165 {
3168 /* Unwind generic function template scope if necessary. */
3173 {
3177 {
3180 /* If we've run out of tokens, stop. */
3184 /* If the next token is a `;', we have reached the end of the
3185 statement. */
3191 /* If this is a non-nested '}', stop before consuming it.
3192 That way, when confronted with something like:
3194 { 3 + }
3196 we stop before consuming the closing '}', even though we
3197 have not yet reached a `;'. */
3201 /* If it is the closing '}' for a block that we have
3202 scanned, stop -- but only after consuming the token.
3203 That way given:
3205 void f g () { ... }
3206 typedef int I;
3208 we will stop after the body of the erroneously declared
3209 function, but before consuming the following `typedef'
3210 declaration. */
3212 {
3215 }
3223 }
3225 /* Consume the token. */
3227 }
3228 }
3230 /* This function is called at the end of a statement or declaration.
3231 If the next token is a semicolon, it is consumed; otherwise, error
3232 recovery is attempted. */
3234 static void
3236 {
3237 /* Look for the trailing `;'. */
3239 {
3240 /* If there is additional (erroneous) input, skip to the end of
3241 the statement. */
3243 /* If the next token is now a `;', consume it. */
3246 }
3247 }
3249 /* Skip tokens until we have consumed an entire block, or until we
3250 have consumed a non-nested `;'. */
3252 static void
3254 {
3257 /* Unwind generic function template scope if necessary. */
3262 {
3266 {
3269 /* If we've run out of tokens, stop. */
3273 /* Stop if this is an unnested ';'. */
3279 /* Stop if this is an unnested '}', or closes the outermost
3280 nesting level. */
3281 nesting_depth--;
3289 /* Nest. */
3290 nesting_depth++;
3295 }
3297 /* Consume the token. */
3299 }
3300 }
3302 /* Skip tokens until a non-nested closing curly brace is the next
3303 token, or there are no more tokens. Return true in the first case,
3304 false otherwise. */
3306 static bool
3308 {
3312 {
3316 {
3319 /* If we've run out of tokens, stop. */
3323 /* If the next token is a non-nested `}', then we have reached
3324 the end of the current block. */
3330 /* If it the next token is a `{', then we are entering a new
3331 block. Consume the entire block. */
3337 }
3339 /* Consume the token. */
3341 }
3342 }
3344 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3345 parameter is the PRAGMA token, allowing us to purge the entire pragma
3346 sequence. */
3348 static void
3350 {
3355 do
3359 /* Ensure that the pragma is not parsed again. */
3361 }
3363 /* Require pragma end of line, resyncing with it as necessary. The
3364 arguments are as for cp_parser_skip_to_pragma_eol. */
3366 static void
3368 {
3372 }
3374 /* This is a simple wrapper around make_typename_type. When the id is
3375 an unresolved identifier node, we can provide a superior diagnostic
3376 using cp_parser_diagnose_invalid_type_name. */
3378 static tree
3381 {
3382 tree result;
3384 {
3390 }
3392 }
3394 /* This is a wrapper around the
3395 make_{pointer,ptrmem,reference}_declarator functions that decides
3396 which one to call based on the CODE and CLASS_TYPE arguments. The
3397 CODE argument should be one of the values returned by
3398 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3399 appertain to the pointer or reference. */
3403 cp_cv_quals cv_qualifiers,
3405 tree attributes)
3406 {
3413 else
3423 }
3425 /* Create a new C++ parser. */
3429 {
3434 /* cp_lexer_new_main is called before doing GC allocation because
3435 cp_lexer_new_main might load a PCH file. */
3438 /* Initialize the binops_by_token so that we can get the tree
3439 directly from the token. */
3447 /* For now, we always accept GNU extensions. */
3450 /* The `>' token is a greater-than operator, not the end of a
3451 template-id. */
3456 /* We are not parsing a constant-expression. */
3461 /* Local variable names are not forbidden. */
3464 /* We are not processing an `extern "C"' declaration. */
3467 /* We are not processing a declarator. */
3470 /* We are not processing a template-argument-list. */
3473 /* We are not in an iteration statement. */
3476 /* We are not in a switch statement. */
3479 /* We are not parsing a type-id inside an expression. */
3482 /* Declarations aren't implicitly extern "C". */
3485 /* String literals should be translated to the execution character set. */
3488 /* We are not parsing a function body. */
3491 /* We can correct until told otherwise. */
3494 /* The unparsed function queue is empty. */
3497 /* There are no classes being defined. */
3500 /* No template parameters apply. */
3503 /* Not declaring an implicit function template. */
3510 }
3512 /* Create a cp_lexer structure which will emit the tokens in CACHE
3513 and push it onto the parser's lexer stack. This is used for delayed
3514 parsing of in-class method bodies and default arguments, and should
3515 not be confused with tentative parsing. */
3516 static void
3518 {
3523 /* Move the current source position to that of the first token in the
3524 new lexer. */
3526 }
3528 /* Pop the top lexer off the parser stack. This is never used for the
3529 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3530 static void
3532 {
3537 /* Put the current source position back where it was before this
3538 lexer was pushed. */
3540 }
3542 /* Lexical conventions [gram.lex] */
3544 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3545 identifier. */
3547 static tree
3549 {
3552 /* Look for the identifier. */
3554 /* Return the value. */
3556 }
3558 /* Parse a sequence of adjacent string constants. Returns a
3559 TREE_STRING representing the combined, nul-terminated string
3560 constant. If TRANSLATE is true, translate the string to the
3561 execution character set. If WIDE_OK is true, a wide string is
3562 invalid here.
3564 C++98 [lex.string] says that if a narrow string literal token is
3565 adjacent to a wide string literal token, the behavior is undefined.
3566 However, C99 6.4.5p4 says that this results in a wide string literal.
3567 We follow C99 here, for consistency with the C front end.
3569 This code is largely lifted from lex_string() in c-lex.c.
3571 FUTURE: ObjC++ will need to handle @-strings here. */
3572 static tree
3575 {
3576 tree value;
3583 tree string_tree;
3589 {
3592 }
3595 {
3599 }
3600 else
3601 {
3604 }
3607 /* Try to avoid the overhead of creating and destroying an obstack
3608 for the common case of just one string. */
3611 {
3619 {
3623 }
3624 else
3628 }
3629 else
3630 {
3634 do
3635 {
3637 count++;
3642 {
3645 {
3648 }
3651 {
3656 }
3658 }
3659 else
3663 {
3668 "unsupported non-standard concatenation "
3670 }
3676 {
3680 }
3681 else
3682 {
3686 }
3687 }
3691 }
3694 {
3697 }
3701 {
3706 {
3721 }
3726 {
3731 else
3733 }
3734 }
3735 else
3736 /* cpp_interpret_string has issued an error. */
3743 }
3745 /* Look up a literal operator with the name and the exact arguments. */
3747 static tree
3749 {
3756 {
3762 {
3765 {
3775 }
3778 /* May be this should be sufficient_parms_p instead,
3779 depending on how exactly should user-defined literals
3780 work in presence of default arguments on the literal
3781 operator parameters. */
3784 }
3785 }
3788 }
3790 /* Parse a user-defined char constant. Returns a call to a user-defined
3791 literal operator taking the character as an argument. */
3793 static tree
3795 {
3803 /* Build up a call to the user-defined operator */
3804 /* Lookup the name we got back from the id-expression. */
3809 {
3814 }
3823 }
3825 /* A subroutine of cp_parser_userdef_numeric_literal to
3826 create a char... template parameter pack from a string node. */
3828 static tree
3830 {
3831 tree charvec;
3837 /* Fill in CHARVEC with all of the parameters. */
3842 /* Build the argument packs. */
3849 }
3851 /* A subroutine of cp_parser_userdef_numeric_literal to
3852 create a char... template parameter pack from a string node. */
3854 static tree
3856 {
3857 tree charvec;
3868 /* First template parm is character type. */
3871 /* Fill in CHARVEC with all of the parameters. */
3878 /* Build the argument packs. */
3885 }
3887 /* Parse a user-defined numeric constant. returns a call to a user-defined
3888 literal operator. */
3890 static tree
3892 {
3903 /* Look for a literal operator taking the exact type of numeric argument
3904 as the literal value. */
3909 {
3912 {
3916 long_long_unsigned_type_node);
3917 else
3918 {
3922 long_double_type_node);
3926 }
3929 }
3930 }
3933 /* If the numeric argument didn't work, look for a raw literal
3934 operator taking a const char* argument consisting of the number
3935 in string format. */
3940 {
3943 {
3946 }
3947 }
3950 /* If the raw literal didn't work, look for a non-type template
3951 function with parameter pack char.... Call the function with
3952 template parameter characters representing the number. */
3956 {
3961 {
3964 }
3965 }
3973 }
3975 /* Parse a user-defined string constant. Returns a call to a user-defined
3976 literal operator taking a character pointer and the length of the string
3977 as arguments. */
3979 static tree
3981 {
3990 /* Look for a template function with typename parameter CharT
3991 and parameter pack CharT... Call the function with
3992 template parameter characters representing the string. */
3996 {
4001 {
4004 }
4005 }
4008 /* Build up a call to the user-defined operator */
4009 /* Lookup the name we got back from the id-expression. */
4015 {
4019 }
4028 }
4031 /* Basic concepts [gram.basic] */
4033 /* Parse a translation-unit.
4035 translation-unit:
4036 declaration-seq [opt]
4038 Returns TRUE if all went well. */
4040 static bool
4042 {
4043 /* The address of the first non-permanent object on the declarator
4044 obstack. */
4049 /* Create the declarator obstack, if necessary. */
4051 {
4053 /* Create the error declarator. */
4055 /* Create the empty parameter list. */
4057 /* Remember where the base of the declarator obstack lies. */
4059 }
4063 /* If there are no tokens left then all went well. */
4065 {
4066 /* Get rid of the token array; we don't need it any more. */
4070 /* This file might have been a context that's implicitly extern
4071 "C". If so, pop the lang context. (Only relevant for PCH.) */
4073 {
4076 }
4078 /* Finish up. */
4082 }
4083 else
4084 {
4087 }
4089 /* Make sure the declarator obstack was fully cleaned up. */
4093 /* All went well. */
4095 }
4097 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4098 decltype context. */
4102 {
4107 }
4109 /* Expressions [gram.expr] */
4111 /* Parse a primary-expression.
4113 primary-expression:
4114 literal
4115 this
4116 ( expression )
4117 id-expression
4118 lambda-expression (C++11)
4120 GNU Extensions:
4122 primary-expression:
4123 ( compound-statement )
4124 __builtin_va_arg ( assignment-expression , type-id )
4125 __builtin_offsetof ( type-id , offsetof-expression )
4127 C++ Extensions:
4128 __has_nothrow_assign ( type-id )
4129 __has_nothrow_constructor ( type-id )
4130 __has_nothrow_copy ( type-id )
4131 __has_trivial_assign ( type-id )
4132 __has_trivial_constructor ( type-id )
4133 __has_trivial_copy ( type-id )
4134 __has_trivial_destructor ( type-id )
4135 __has_virtual_destructor ( type-id )
4136 __is_abstract ( type-id )
4137 __is_base_of ( type-id , type-id )
4138 __is_class ( type-id )
4139 __is_convertible_to ( type-id , type-id )
4140 __is_empty ( type-id )
4141 __is_enum ( type-id )
4142 __is_final ( type-id )
4143 __is_literal_type ( type-id )
4144 __is_pod ( type-id )
4145 __is_polymorphic ( type-id )
4146 __is_std_layout ( type-id )
4147 __is_trivial ( type-id )
4148 __is_union ( type-id )
4150 Objective-C++ Extension:
4152 primary-expression:
4153 objc-expression
4155 literal:
4156 __null
4158 ADDRESS_P is true iff this expression was immediately preceded by
4159 "&" and therefore might denote a pointer-to-member. CAST_P is true
4160 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4161 true iff this expression is a template argument.
4163 Returns a representation of the expression. Upon return, *IDK
4164 indicates what kind of id-expression (if any) was present. */
4166 static tree
4173 {
4176 /* Assume the primary expression is not an id-expression. */
4179 /* Peek at the next token. */
4182 {
4183 /* literal:
4184 integer-literal
4185 character-literal
4186 floating-literal
4187 string-literal
4188 boolean-literal
4189 pointer-literal
4190 user-defined-literal */
4200 {
4204 }
4205 /* Floating-point literals are only allowed in an integral
4206 constant expression if they are cast to an integral or
4207 enumeration type. */
4211 {
4212 /* CAST_P will be set even in invalid code like "int(2.7 +
4213 ...)". Therefore, we have to check that the next token
4214 is sure to end the cast. */
4216 {
4221 enumerator-definition. */
4223 /* The curly brace at the end of an enum-specifier. */
4225 /* The end of a statement. */
4227 /* The end of the cast-expression. */
4229 /* The end of an array bound. */
4231 /* The closing ">" in a template-argument-list. */
4234 /* C++0x only: A ">>" treated like two ">" tokens,
4235 in a template-argument-list. */
4240 }
4242 /* If we are within a cast, then the constraint that the
4243 cast is to an integral or enumeration type will be
4244 checked at that point. If we are not within a cast, then
4245 this code is invalid. */
4248 }
4267 /* ??? Should wide strings be allowed when parser->translate_strings_p
4268 is false (i.e. in attributes)? If not, we can kill the third
4269 argument to cp_parser_string_literal. */
4275 {
4276 tree expr;
4279 /* Consume the `('. */
4281 /* Within a parenthesized expression, a `>' token is always
4282 the greater-than operator. */
4283 saved_greater_than_is_operator_p
4286 /* If we see `( { ' then we are looking at the beginning of
4287 a GNU statement-expression. */
4290 {
4291 /* Statement-expressions are not allowed by the standard. */
4295 /* And they're not allowed outside of a function-body; you
4296 cannot, for example, write:
4298 int i = ({ int j = 3; j + 1; });
4300 at class or namespace scope. */
4303 {
4305 "statement-expressions are not allowed outside "
4309 }
4310 else
4311 {
4312 /* Start the statement-expression. */
4314 /* Parse the compound-statement. */
4316 /* Finish up. */
4318 }
4319 }
4320 else
4321 {
4322 /* Parse the parenthesized expression. */
4324 /* Let the front end know that this expression was
4325 enclosed in parentheses. This matters in case, for
4326 example, the expression is of the form `A::B', since
4327 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4328 not. */
4330 /* DR 705: Wrapping an unqualified name in parentheses
4331 suppresses arg-dependent lookup. We want to pass back
4332 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4333 (c++/37862), but none of the others. */
4336 }
4337 /* The `>' token might be the end of a template-id or
4338 template-parameter-list now. */
4339 parser->greater_than_is_operator_p
4341 /* Consume the `)'. */
4346 }
4350 /* We have an Objective-C++ message. */
4352 {
4354 /* Don't warn about a failed tentative parse. */
4359 }
4363 /* We have an Objective-C++ string literal. */
4370 {
4371 /* These two are the boolean literals. */
4379 /* The `__null' literal. */
4384 /* The `nullptr' literal. */
4389 /* Recognize the `this' keyword. */
4393 {
4397 }
4398 /* Pointers cannot appear in constant-expressions. */
4403 /* The `operator' keyword can be the beginning of an
4404 id-expression. */
4411 {
4412 non_integral_constant name;
4414 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4415 __func__ are the names of variables -- but they are
4416 treated specially. Therefore, they are handled here,
4417 rather than relying on the generic id-expression logic
4418 below. Grammatically, these names are id-expressions.
4420 Consume the token. */
4424 {
4436 }
4441 /* Look up the name. */
4443 }
4446 {
4447 tree expression;
4448 tree type;
4449 source_location type_location;
4451 /* The `__builtin_va_arg' construct is used to handle
4452 `va_arg'. Consume the `__builtin_va_arg' token. */
4454 /* Look for the opening `('. */
4456 /* Now, parse the assignment-expression. */
4459 /* Look for the `,'. */
4462 /* Parse the type-id. */
4464 /* Look for the closing `)'. */
4466 /* Using `va_arg' in a constant-expression is not
4467 allowed. */
4469 NIC_VA_ARG))
4472 }
4500 /* Objective-C++ expressions. */
4510 {
4515 }
4519 }
4521 /* An id-expression can start with either an identifier, a
4522 `::' as the beginning of a qualified-id, or the "operator"
4523 keyword. */
4528 {
4529 tree id_expression;
4530 tree decl;
4536 id_expression:
4537 /* Parse the id-expression. */
4538 id_expression
4555 /* If we have a template-id, then no further lookup is
4556 required. If the template-id was for a template-class, we
4557 will sometimes have a TYPE_DECL at this point. */
4561 /* Look up the name. */
4562 else
4563 {
4564 tree ambiguous_decls;
4566 /* If we already know that this lookup is ambiguous, then
4567 we've already issued an error message; there's no reason
4568 to check again. */
4571 {
4574 }
4577 none_type,
4578 template_p,
4583 /* If the lookup was ambiguous, an error will already have
4584 been issued. */
4588 /* In Objective-C++, we may have an Objective-C 2.0
4589 dot-syntax for classes here. */
4594 {
4595 tree component;
4602 }
4604 /* In Objective-C++, an instance variable (ivar) may be preferred
4605 to whatever cp_parser_lookup_name() found. */
4608 /* If name lookup gives us a SCOPE_REF, then the
4609 qualifying scope was dependent. */
4611 {
4612 /* At this point, we do not know if DECL is a valid
4613 integral constant expression. We assume that it is
4614 in fact such an expression, so that code like:
4616 template <int N> struct A {
4617 int a[B<N>::i];
4618 };
4620 is accepted. At template-instantiation time, we
4621 will check that B<N>::i is actually a constant. */
4623 }
4624 /* Check to see if DECL is a local variable in a context
4625 where that is forbidden. */
4628 {
4629 /* It might be that we only found DECL because we are
4630 trying to be generous with pre-ISO scoping rules.
4631 For example, consider:
4633 int i;
4634 void g() {
4635 for (int i = 0; i < 10; ++i) {}
4636 extern void f(int j = i);
4637 }
4639 Here, name look up will originally find the out
4640 of scope `i'. We need to issue a warning message,
4641 but then use the global `i'. */
4644 {
4647 decl);
4649 }
4650 }
4651 }
4653 decl = (finish_id_expression
4655 idk,
4660 template_arg_p,
4666 }
4668 /* Anything else is an error. */
4672 }
4673 }
4681 {
4684 }
4686 /* Parse an id-expression.
4688 id-expression:
4689 unqualified-id
4690 qualified-id
4692 qualified-id:
4693 :: [opt] nested-name-specifier template [opt] unqualified-id
4694 :: identifier
4695 :: operator-function-id
4696 :: template-id
4698 Return a representation of the unqualified portion of the
4699 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4700 a `::' or nested-name-specifier.
4702 Often, if the id-expression was a qualified-id, the caller will
4703 want to make a SCOPE_REF to represent the qualified-id. This
4704 function does not do this in order to avoid wastefully creating
4705 SCOPE_REFs when they are not required.
4707 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4708 `template' keyword.
4710 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4711 uninstantiated templates.
4713 If *TEMPLATE_P is non-NULL, it is set to true iff the
4714 `template' keyword is used to explicitly indicate that the entity
4715 named is a template.
4717 If DECLARATOR_P is true, the id-expression is appearing as part of
4718 a declarator, rather than as part of an expression. */
4720 static tree
4727 {
4731 /* Assume the `template' keyword was not used. */
4735 /* Look for the optional `::' operator. */
4736 global_scope_p
4739 /* Look for the optional nested-name-specifier. */
4740 nested_name_specifier_p
4743 check_dependency_p,
4745 declarator_p)
4747 /* If there is a nested-name-specifier, then we are looking at
4748 the first qualified-id production. */
4750 {
4751 tree saved_scope;
4752 tree saved_object_scope;
4753 tree saved_qualifying_scope;
4754 tree unqualified_id;
4757 /* See if the next token is the `template' keyword. */
4761 /* Name lookup we do during the processing of the
4762 unqualified-id might obliterate SCOPE. */
4766 /* Process the final unqualified-id. */
4768 check_dependency_p,
4769 declarator_p,
4771 /* Restore the SAVED_SCOPE for our caller. */
4777 }
4778 /* Otherwise, if we are in global scope, then we are looking at one
4779 of the other qualified-id productions. */
4781 {
4783 tree id;
4785 /* Peek at the next token. */
4788 /* If it's an identifier, and the next token is not a "<", then
4789 we can avoid the template-id case. This is an optimization
4790 for this common case. */
4792 && !cp_parser_nth_token_starts_template_argument_list_p
4797 /* Try a template-id. */
4801 none_type,
4802 declarator_p);
4803 /* If that worked, we're done. */
4807 /* Peek at the next token. (Changes in the token buffer may
4808 have invalidated the pointer obtained above.) */
4812 {
4819 /* Fall through. */
4824 }
4825 }
4826 else
4829 declarator_p,
4830 optional_p);
4831 }
4833 /* Parse an unqualified-id.
4835 unqualified-id:
4836 identifier
4837 operator-function-id
4838 conversion-function-id
4839 ~ class-name
4840 template-id
4842 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4843 keyword, in a construct like `A::template ...'.
4845 Returns a representation of unqualified-id. For the `identifier'
4846 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4847 production a BIT_NOT_EXPR is returned; the operand of the
4848 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4849 other productions, see the documentation accompanying the
4850 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4851 names are looked up in uninstantiated templates. If DECLARATOR_P
4852 is true, the unqualified-id is appearing as part of a declarator,
4853 rather than as part of an expression. */
4855 static tree
4861 {
4864 /* Peek at the next token. */
4868 {
4870 {
4871 tree id;
4873 /* We don't know yet whether or not this will be a
4874 template-id. */
4876 /* Try a template-id. */
4878 check_dependency_p,
4879 none_type,
4880 declarator_p);
4881 /* If it worked, we're done. */
4884 /* Otherwise, it's an ordinary identifier. */
4886 }
4890 check_dependency_p,
4891 none_type,
4892 declarator_p);
4895 {
4896 tree type_decl;
4897 tree qualifying_scope;
4898 tree object_scope;
4899 tree scope;
4902 /* Consume the `~' token. */
4904 /* Parse the class-name. The standard, as written, seems to
4905 say that:
4907 template <typename T> struct S { ~S (); };
4908 template <typename T> S<T>::~S() {}
4910 is invalid, since `~' must be followed by a class-name, but
4911 `S<T>' is dependent, and so not known to be a class.
4912 That's not right; we need to look in uninstantiated
4913 templates. A further complication arises from:
4915 template <typename T> void f(T t) {
4916 t.T::~T();
4917 }
4919 Here, it is not possible to look up `T' in the scope of `T'
4920 itself. We must look in both the current scope, and the
4921 scope of the containing complete expression.
4923 Yet another issue is:
4925 struct S {
4926 int S;
4927 ~S();
4928 };
4930 S::~S() {}
4932 The standard does not seem to say that the `S' in `~S'
4933 should refer to the type `S' and not the data member
4934 `S::S'. */
4936 /* DR 244 says that we look up the name after the "~" in the
4937 same scope as we looked up the qualifying name. That idea
4938 isn't fully worked out; it's more complicated than that. */
4943 /* Check for invalid scopes. */
4945 {
4949 }
4951 {
4955 scope);
4960 }
4963 /* If the name is of the form "X::~X" it's OK even if X is a
4964 typedef. */
4973 {
4976 }
4978 /* ~auto means the destructor of whatever the object is. */
4980 {
4983 "%<~auto%> only available with "
4987 }
4989 /* If there was an explicit qualification (S::~T), first look
4990 in the scope given by the qualification (i.e., S).
4992 Note: in the calls to cp_parser_class_name below we pass
4993 typename_type so that lookup finds the injected-class-name
4994 rather than the constructor. */
4998 {
5003 typename_type,
5006 declarator_p);
5009 }
5010 /* In "N::S::~S", look in "N" as well. */
5012 {
5017 type_decl
5021 typename_type,
5024 declarator_p);
5027 }
5028 /* In "p->S::~T", look in the scope given by "*p" as well. */
5030 {
5035 type_decl
5039 typename_type,
5042 declarator_p);
5045 }
5046 /* Look in the surrounding context. */
5048 {
5054 type_decl
5058 typename_type,
5061 declarator_p);
5064 {
5065 /* We couldn't find a type with this name, so just accept
5066 it and check for a match at instantiation time. */
5071 }
5072 }
5073 /* If an error occurred, assume that the name of the
5074 destructor is the same as the name of the qualifying
5075 class. That allows us to keep parsing after running
5076 into ill-formed destructor names. */
5082 /* Check that destructor name and scope match. */
5084 {
5091 }
5093 /* [class.dtor]
5095 A typedef-name that names a class shall not be used as the
5096 identifier in the declarator for a destructor declaration. */
5103 type_decl);
5106 }
5110 {
5111 tree id;
5113 /* This could be a template-id, so we try that first. */
5115 /* Try a template-id. */
5118 none_type,
5119 declarator_p);
5120 /* If that worked, we're done. */
5123 /* We still don't know whether we're looking at an
5124 operator-function-id or a conversion-function-id. */
5126 /* Try an operator-function-id. */
5128 /* If that didn't work, try a conversion-function-id. */
5132 {
5133 /* 17.6.3.3.5 */
5139 }
5142 }
5143 /* Fall through. */
5150 }
5151 }
5153 /* Parse an (optional) nested-name-specifier.
5155 nested-name-specifier: [C++98]
5156 class-or-namespace-name :: nested-name-specifier [opt]
5157 class-or-namespace-name :: template nested-name-specifier [opt]
5159 nested-name-specifier: [C++0x]
5160 type-name ::
5161 namespace-name ::
5162 nested-name-specifier identifier ::
5163 nested-name-specifier template [opt] simple-template-id ::
5165 PARSER->SCOPE should be set appropriately before this function is
5166 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5167 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5168 in name lookups.
5170 Sets PARSER->SCOPE to the class (TYPE) or namespace
5171 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5172 it unchanged if there is no nested-name-specifier. Returns the new
5173 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5175 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5176 part of a declaration and/or decl-specifier. */
5178 static tree
5184 {
5189 /* Remember where the nested-name-specifier starts. */
5191 {
5194 }
5197 {
5198 tree new_scope;
5199 tree old_scope;
5200 tree saved_qualifying_scope;
5203 /* Spot cases that cannot be the beginning of a
5204 nested-name-specifier. */
5207 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5208 the already parsed nested-name-specifier. */
5210 {
5211 /* Grab the nested-name-specifier and continue the loop. */
5213 /* If we originally encountered this nested-name-specifier
5214 with IS_DECLARATION set to false, we will not have
5215 resolved TYPENAME_TYPEs, so we must do so here. */
5218 {
5223 }
5226 }
5228 /* Spot cases that cannot be the beginning of a
5229 nested-name-specifier. On the second and subsequent times
5230 through the loop, we look for the `template' keyword. */
5232 ;
5233 /* A template-id can start a nested-name-specifier. */
5235 ;
5236 /* DR 743: decltype can be used in a nested-name-specifier. */
5238 ;
5239 else
5240 {
5241 /* If the next token is not an identifier, then it is
5242 definitely not a type-name or namespace-name. */
5245 /* If the following token is neither a `<' (to begin a
5246 template-id), nor a `::', then we are not looking at a
5247 nested-name-specifier. */
5253 {
5257 }
5260 && !cp_parser_nth_token_starts_template_argument_list_p
5263 }
5265 /* The nested-name-specifier is optional, so we parse
5266 tentatively. */
5269 /* Look for the optional `template' keyword, if this isn't the
5270 first time through the loop. */
5273 else
5276 /* Save the old scope since the name lookup we are about to do
5277 might destroy it. */
5280 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5281 look up names in "X<T>::I" in order to determine that "Y" is
5282 a template. So, if we have a typename at this point, we make
5283 an effort to look through it. */
5285 && !typename_keyword_p
5290 /* Parse the qualifying entity. */
5291 new_scope
5293 typename_keyword_p,
5294 template_keyword_p,
5295 check_dependency_p,
5296 type_p,
5297 is_declaration);
5298 /* Look for the `::' token. */
5301 /* If we found what we wanted, we keep going; otherwise, we're
5302 done. */
5304 {
5307 /* Restore the OLD_SCOPE since it was valid before the
5308 failed attempt at finding the last
5309 class-or-namespace-name. */
5313 /* If the next token is a decltype, and the one after that is a
5314 `::', then the decltype has failed to resolve to a class or
5315 enumeration type. Give this error even when parsing
5316 tentatively since it can't possibly be valid--and we're going
5317 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5318 won't get another chance.*/
5322 {
5329 /* As below. */
5332 }
5336 /* If the next token is an identifier, and the one after
5337 that is a `::', then any valid interpretation would have
5338 found a class-or-namespace-name. */
5344 {
5347 {
5349 {
5350 tree decl;
5351 tree ambiguous_decls;
5354 none_type,
5363 decl);
5365 {
5366 // cp_parser_lookup_name has the same diagnostic,
5367 // thus make sure to emit it at most once.
5370 {
5375 }
5377 }
5378 else
5379 {
5381 cp_parser_name_lookup_error
5384 else
5385 cp_parser_name_lookup_error
5388 }
5389 }
5392 /* Treat this as a successful nested-name-specifier
5393 due to:
5395 [basic.lookup.qual]
5397 If the name found is not a class-name (clause
5398 _class_) or namespace-name (_namespace.def_), the
5399 program is ill-formed. */
5401 }
5403 }
5405 }
5406 /* We've found one valid nested-name-specifier. */
5408 /* Name lookup always gives us a DECL. */
5411 /* Uses of "template" must be followed by actual templates. */
5423 new_scope);
5424 /* If it is a class scope, try to complete it; we are about to
5425 be looking up names inside the class. */
5427 /* Since checking types for dependency can be expensive,
5428 avoid doing it if the type is already complete. */
5430 /* Do not try to complete dependent types. */
5432 {
5434 /* If it is a typedef to current class, use the current
5435 class instead, as the typedef won't have any names inside
5436 it yet. */
5440 }
5441 /* Make sure we look in the right scope the next time through
5442 the loop. */
5444 }
5446 /* If parsing tentatively, replace the sequence of tokens that makes
5447 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5448 token. That way, should we re-parse the token stream, we will
5449 not have to repeat the effort required to do the parse, nor will
5450 we issue duplicate error messages. */
5452 {
5456 /* Reset the contents of the START token. */
5458 /* Retrieve any deferred checks. Do not pop this access checks yet
5459 so the memory will not be reclaimed during token replacing below. */
5467 /* Purge all subsequent tokens. */
5469 }
5475 }
5477 /* Parse a nested-name-specifier. See
5478 cp_parser_nested_name_specifier_opt for details. This function
5479 behaves identically, except that it will an issue an error if no
5480 nested-name-specifier is present. */
5482 static tree
5488 {
5489 tree scope;
5491 /* Look for the nested-name-specifier. */
5493 typename_keyword_p,
5494 check_dependency_p,
5495 type_p,
5496 is_declaration);
5497 /* If it was not present, issue an error message. */
5499 {
5502 }
5505 }
5507 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5508 this is either a class-name or a namespace-name (which corresponds
5509 to the class-or-namespace-name production in the grammar). For
5510 C++0x, it can also be a type-name that refers to an enumeration
5511 type or a simple-template-id.
5513 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5514 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5515 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5516 TYPE_P is TRUE iff the next name should be taken as a class-name,
5517 even the same name is declared to be another entity in the same
5518 scope.
5520 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5521 specified by the class-or-namespace-name. If neither is found the
5522 ERROR_MARK_NODE is returned. */
5524 static tree
5531 {
5532 tree saved_scope;
5533 tree saved_qualifying_scope;
5534 tree saved_object_scope;
5535 tree scope;
5539 /* DR 743: decltype can appear in a nested-name-specifier. */
5541 {
5545 {
5548 }
5552 }
5554 /* Before we try to parse the class-name, we must save away the
5555 current PARSER->SCOPE since cp_parser_class_name will destroy
5556 it. */
5560 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5561 there is no need to look for a namespace-name. */
5562 only_class_p = template_keyword_p
5567 typename_keyword_p,
5568 template_keyword_p,
5570 check_dependency_p,
5572 is_declaration);
5574 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5578 {
5579 /* Restore the saved scope. */
5584 /* Parse tentatively. */
5587 /* Parse a type-name */
5590 /* "If the name found does not designate a namespace or a class,
5591 enumeration, or dependent type, the program is ill-formed."
5593 We cover classes and dependent types above and namespaces below,
5594 so this code is only looking for enums. */
5600 }
5601 /* If that didn't work, try for a namespace-name. */
5603 {
5604 /* Restore the saved scope. */
5608 /* If we are not looking at an identifier followed by the scope
5609 resolution operator, then this is not part of a
5610 nested-name-specifier. (Note that this function is only used
5611 to parse the components of a nested-name-specifier.) */
5616 }
5619 }
5621 /* Return true if we are looking at a compound-literal, false otherwise. */
5623 static bool
5625 {
5626 /* Consume the `('. */
5631 /* Skip tokens until the next token is a closing parenthesis.
5632 If we find the closing `)', and the next token is a `{', then
5633 we are looking at a compound-literal. */
5634 bool compound_literal_p
5639 /* Roll back the tokens we skipped. */
5643 }
5645 /* Parse a postfix-expression.
5647 postfix-expression:
5648 primary-expression
5649 postfix-expression [ expression ]
5650 postfix-expression ( expression-list [opt] )
5651 simple-type-specifier ( expression-list [opt] )
5652 typename :: [opt] nested-name-specifier identifier
5653 ( expression-list [opt] )
5654 typename :: [opt] nested-name-specifier template [opt] template-id
5655 ( expression-list [opt] )
5656 postfix-expression . template [opt] id-expression
5657 postfix-expression -> template [opt] id-expression
5658 postfix-expression . pseudo-destructor-name
5659 postfix-expression -> pseudo-destructor-name
5660 postfix-expression ++
5661 postfix-expression --
5662 dynamic_cast < type-id > ( expression )
5663 static_cast < type-id > ( expression )
5664 reinterpret_cast < type-id > ( expression )
5665 const_cast < type-id > ( expression )
5666 typeid ( expression )
5667 typeid ( type-id )
5669 GNU Extension:
5671 postfix-expression:
5672 ( type-id ) { initializer-list , [opt] }
5674 This extension is a GNU version of the C99 compound-literal
5675 construct. (The C99 grammar uses `type-name' instead of `type-id',
5676 but they are essentially the same concept.)
5678 If ADDRESS_P is true, the postfix expression is the operand of the
5679 `&' operator. CAST_P is true if this expression is the target of a
5680 cast.
5682 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5683 class member access expressions [expr.ref].
5685 Returns a representation of the expression. */
5687 static tree
5691 {
5693 location_t loc;
5700 /* Peek at the next token. */
5703 /* Some of the productions are determined by keywords. */
5706 {
5711 {
5712 tree type;
5713 tree expression;
5717 /* All of these can be handled in the same way from the point
5718 of view of parsing. Begin by consuming the token
5719 identifying the cast. */
5722 /* New types cannot be defined in the cast. */
5724 parser->type_definition_forbidden_message
5727 /* Look for the opening `<'. */
5729 /* Parse the type to which we are casting. */
5734 /* Look for the closing `>'. */
5736 /* Restore the old message. */
5739 bool saved_greater_than_is_operator_p
5743 /* And the expression which is being cast. */
5748 parser->greater_than_is_operator_p
5751 /* Only type conversions to integral or enumeration types
5752 can be used in constant-expressions. */
5758 {
5760 postfix_expression
5764 postfix_expression
5768 postfix_expression
5770 tf_warning_or_error);
5773 postfix_expression
5778 }
5779 }
5783 {
5784 tree type;
5788 /* Consume the `typeid' token. */
5790 /* Look for the `(' token. */
5792 /* Types cannot be defined in a `typeid' expression. */
5794 parser->type_definition_forbidden_message
5796 /* We can't be sure yet whether we're looking at a type-id or an
5797 expression. */
5799 /* Try a type-id first. */
5804 /* Look for the `)' token. Otherwise, we can't be sure that
5805 we're not looking at an expression: consider `typeid (int
5806 (3))', for example. */
5808 /* If all went well, simply lookup the type-id. */
5811 /* Otherwise, fall back to the expression variant. */
5812 else
5813 {
5814 tree expression;
5816 /* Look for an expression. */
5818 /* Compute its typeid. */
5820 /* Look for the `)' token. */
5822 }
5823 /* Restore the saved message. */
5825 /* `typeid' may not appear in an integral constant expression. */
5828 }
5832 {
5833 tree type;
5834 /* The syntax permitted here is the same permitted for an
5835 elaborated-type-specifier. */
5840 }
5844 {
5848 {
5853 }
5855 {
5860 }
5861 else
5862 {
5863 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5866 }
5868 postfix_expression =
5872 {
5876 }
5878 {
5883 }
5884 else
5885 {
5887 postfix_expression);
5891 }
5893 }
5896 {
5899 tree p;
5913 tf_warning_or_error);
5916 tf_warning_or_error);
5917 else
5918 {
5922 }
5924 }
5927 {
5928 tree type;
5930 /* If the next thing is a simple-type-specifier, we may be
5931 looking at a functional cast. We could also be looking at
5932 an id-expression. So, we try the functional cast, and if
5933 that doesn't work we fall back to the primary-expression. */
5935 /* Look for the simple-type-specifier. */
5938 CP_PARSER_FLAGS_NONE);
5939 /* Parse the cast itself. */
5941 postfix_expression
5943 /* If that worked, we're done. */
5947 /* If the functional-cast didn't work out, try a
5948 compound-literal. */
5951 {
5956 /* Avoid calling cp_parser_type_id pointlessly, see comment
5957 in cp_parser_cast_expression about c++/29234. */
5960 else
5961 {
5962 /* Parse the type. */
5967 /* Look for the `)'. */
5969 }
5971 /* If things aren't going well, there's no need to
5972 keep going. */
5974 {
5976 /* Parse the brace-enclosed initializer list. */
5979 }
5980 /* If that worked, we're definitely looking at a
5981 compound-literal expression. */
5983 {
5984 /* Warn the user that a compound literal is not
5985 allowed in standard C++. */
5988 /* For simplicity, we disallow compound literals in
5989 constant-expressions. We could
5990 allow compound literals of integer type, whose
5991 initializer was a constant, in constant
5992 expressions. Permitting that usage, as a further
5993 extension, would not change the meaning of any
5994 currently accepted programs. (Of course, as
5995 compound literals are not part of ISO C++, the
5996 standard has nothing to say.) */
5998 NIC_NCC))
5999 {
6002 }
6003 /* Form the representation of the compound-literal. */
6004 postfix_expression
6006 tf_warning_or_error);
6008 }
6009 }
6011 /* It must be a primary-expression. */
6012 postfix_expression
6015 decltype_p,
6017 }
6019 }
6021 /* Note that we don't need to worry about calling build_cplus_new on a
6022 class-valued CALL_EXPR in decltype when it isn't the end of the
6023 postfix-expression; unary_complex_lvalue will take care of that for
6024 all these cases. */
6026 /* Keep looping until the postfix-expression is complete. */
6028 {
6032 /* It is not a Koenig lookup function call. */
6033 postfix_expression
6036 /* Peek at the next token. */
6040 {
6043 {
6045 "two consecutive %<[%> shall "
6048 }
6049 postfix_expression
6051 postfix_expression,
6053 decltype_p);
6059 /* postfix-expression ( expression-list [opt] ) */
6060 {
6070 is_builtin_constant_p
6073 {
6074 /* The whole point of __builtin_constant_p is to allow
6075 non-constant expressions to appear as arguments. */
6076 saved_integral_constant_expression_p
6078 saved_non_integral_constant_expression_p
6081 }
6082 args = (cp_parser_parenthesized_expression_list
6088 {
6089 parser->integral_constant_expression_p
6091 parser->non_integral_constant_expression_p
6093 }
6096 {
6099 }
6101 /* Function calls are not permitted in
6102 constant-expressions. */
6105 NIC_FUNC_CALL))
6106 {
6110 }
6115 {
6117 {
6119 {
6122 postfix_expression
6124 complain);
6125 }
6126 else
6127 postfix_expression
6129 }
6130 /* We do not perform argument-dependent lookup if
6131 normal lookup finds a non-function, in accordance
6132 with the expected resolution of DR 218. */
6135 {
6139 /* Do not do argument dependent lookup if regular
6140 lookup finds a member function or a block-scope
6141 function declaration. [basic.lookup.argdep]/3 */
6144 {
6147 postfix_expression
6149 complain);
6150 }
6151 }
6152 }
6155 {
6165 "%<memset%> used with constant zero length "
6166 "parameter; this could be due to transposed "
6169 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6170 to avoid leaking those into folder and middle-end. */
6172 tree arg;
6176 }
6179 {
6189 {
6190 postfix_expression
6194 }
6197 {
6198 postfix_expression
6199 = (build_new_method_call
6205 complain));
6206 }
6207 else
6208 postfix_expression
6212 complain);
6213 }
6217 postfix_expression = (build_offset_ref_call_from_tree
6219 complain));
6221 /* A call to a static class member, or a namespace-scope
6222 function. */
6223 postfix_expression
6226 koenig_p,
6227 complain);
6228 else
6229 /* All other function calls. */
6230 postfix_expression
6233 koenig_p,
6234 complain);
6236 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6240 }
6245 /* postfix-expression . template [opt] id-expression
6246 postfix-expression . pseudo-destructor-name
6247 postfix-expression -> template [opt] id-expression
6248 postfix-expression -> pseudo-destructor-name */
6250 /* Consume the `.' or `->' operator. */
6253 postfix_expression
6255 postfix_expression,
6262 /* postfix-expression ++ */
6263 /* Consume the `++' token. */
6265 /* Generate a representation for the complete expression. */
6266 postfix_expression
6268 POSTINCREMENT_EXPR);
6269 /* Increments may not appear in constant-expressions. */
6277 /* postfix-expression -- */
6278 /* Consume the `--' token. */
6280 /* Generate a representation for the complete expression. */
6281 postfix_expression
6283 POSTDECREMENT_EXPR);
6284 /* Decrements may not appear in constant-expressions. */
6296 else
6298 }
6299 }
6301 /* We should never get here. */
6304 }
6306 /* This function parses Cilk Plus array notations. If a normal array expr. is
6307 parsed then the array index is passed back to the caller through *INIT_INDEX
6308 and the function returns a NULL_TREE. If array notation expr. is parsed,
6309 then *INIT_INDEX is ignored by the caller and the function returns
6310 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6311 error_mark_node. */
6313 static tree
6315 tree array_value)
6316 {
6320 {
6323 }
6332 {
6335 }
6337 {
6338 /* Consume the ':'. */
6341 /* If we are here, then we have a case like this A[:]. */
6343 {
6347 }
6351 }
6352 else
6353 {
6354 /* If we are here, then there are three valid possibilities:
6355 1. ARRAY [ EXP ]
6356 2. ARRAY [ EXP : EXP ]
6357 3. ARRAY [ EXP : EXP : EXP ] */
6361 {
6362 /* This indicates that we have a normal array expression. */
6365 }
6367 /* Consume the ':'. */
6371 {
6374 }
6375 }
6380 {
6384 }
6390 }
6392 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6393 by cp_parser_builtin_offsetof. We're looking for
6395 postfix-expression [ expression ]
6396 postfix-expression [ braced-init-list ] (C++11)
6398 FOR_OFFSETOF is set if we're being called in that context, which
6399 changes how we deal with integer constant expressions. */
6401 static tree
6403 tree postfix_expression,
6406 {
6411 /* Consume the `[' token. */
6417 /* Parse the index expression. */
6418 /* ??? For offsetof, there is a question of what to allow here. If
6419 offsetof is not being used in an integral constant expression context,
6420 then we *could* get the right answer by computing the value at runtime.
6421 If we are in an integral constant expression context, then we might
6422 could accept any constant expression; hard to say without analysis.
6423 Rather than open the barn door too wide right away, allow only integer
6424 constant expressions here. */
6427 else
6428 {
6430 {
6437 {
6439 "braced list index is not allowed with array "
6443 }
6444 }
6446 {
6447 /* Here are have these two options:
6448 ARRAY[EXP : EXP] - Array notation expr with default
6449 stride of 1.
6450 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6451 stride. */
6453 postfix_expression);
6456 }
6457 else
6459 }
6463 /* Look for the closing `]'. */
6466 /* Build the ARRAY_REF. */
6470 /* When not doing offsetof, array references are not permitted in
6471 constant-expressions. */
6477 }
6479 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6480 by cp_parser_builtin_offsetof. We're looking for
6482 postfix-expression . template [opt] id-expression
6483 postfix-expression . pseudo-destructor-name
6484 postfix-expression -> template [opt] id-expression
6485 postfix-expression -> pseudo-destructor-name
6487 FOR_OFFSETOF is set if we're being called in that context. That sorta
6488 limits what of the above we'll actually accept, but nevermind.
6489 TOKEN_TYPE is the "." or "->" token, which will already have been
6490 removed from the stream. */
6492 static tree
6495 tree postfix_expression,
6497 location_t location)
6498 {
6499 tree name;
6504 /* If this is a `->' operator, dereference the pointer. */
6507 tf_warning_or_error);
6508 /* Check to see whether or not the expression is type-dependent. */
6510 /* The identifier following the `->' or `.' is not qualified. */
6516 /* Enter the scope corresponding to the type of the object
6517 given by the POSTFIX_EXPRESSION. */
6519 {
6521 /* According to the standard, no expression should ever have
6522 reference type. Unfortunately, we do not currently match
6523 the standard in this respect in that our internal representation
6524 of an expression may have reference type even when the standard
6525 says it does not. Therefore, we have to manually obtain the
6526 underlying type here. */
6528 /* The type of the POSTFIX_EXPRESSION must be complete. */
6530 {
6532 postfix_expression);
6534 }
6535 /* Unlike the object expression in other contexts, *this is not
6536 required to be of complete type for purposes of class member
6537 access (5.2.5) outside the member function body. */
6541 /* Let the name lookup machinery know that we are processing a
6542 class member access expression. */
6544 /* If something went wrong, we want to be able to discern that case,
6545 as opposed to the case where there was no SCOPE due to the type
6546 of expression being dependent. */
6549 /* If the SCOPE was erroneous, make the various semantic analysis
6550 functions exit quickly -- and without issuing additional error
6551 messages. */
6554 }
6556 /* Assume this expression is not a pseudo-destructor access. */
6559 /* If the SCOPE is a scalar type, then, if this is a valid program,
6560 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6561 is type dependent, it can be pseudo-destructor-name or something else.
6562 Try to parse it as pseudo-destructor-name first. */
6564 {
6565 tree s;
6566 tree type;
6569 /* Parse the pseudo-destructor-name. */
6578 {
6580 postfix_expression
6583 }
6584 }
6587 {
6588 /* If the SCOPE is not a scalar type, we are looking at an
6589 ordinary class member access expression, rather than a
6590 pseudo-destructor-name. */
6593 /* Parse the id-expression. */
6594 name = (cp_parser_id_expression
6601 /* In general, build a SCOPE_REF if the member name is qualified.
6602 However, if the name was not dependent and has already been
6603 resolved; there is no need to build the SCOPE_REF. For example;
6605 struct X { void f(); };
6606 template <typename T> void f(T* t) { t->X::f(); }
6608 Even though "t" is dependent, "X::f" is not and has been resolved
6609 to a BASELINK; there is no need to include scope information. */
6611 /* But we do need to remember that there was an explicit scope for
6612 virtual function calls. */
6616 /* If the name is a template-id that names a type, we will get a
6617 TYPE_DECL here. That is invalid code. */
6619 {
6622 }
6623 else
6624 {
6626 {
6628 {
6632 }
6633 else
6636 name,
6637 template_p);
6641 }
6643 adjust_result_of_qualified_name_lookup
6645 postfix_expression
6647 template_p,
6648 tf_warning_or_error);
6649 }
6650 }
6652 /* We no longer need to look up names in the scope of the object on
6653 the left-hand side of the `.' or `->' operator. */
6656 /* Outside of offsetof, these operators may not appear in
6657 constant-expressions. */
6659 && (cp_parser_non_integral_constant_expression
6664 }
6666 /* Cache of LITERAL_ZERO_P constants. */
6670 /* Parse a parenthesized expression-list.
6672 expression-list:
6673 assignment-expression
6674 expression-list, assignment-expression
6676 attribute-list:
6677 expression-list
6678 identifier
6679 identifier, expression-list
6681 CAST_P is true if this expression is the target of a cast.
6683 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6684 argument pack.
6686 Returns a vector of trees. Each element is a representation of an
6687 assignment-expression. NULL is returned if the ( and or ) are
6688 missing. An empty, but allocated, vector is returned on no
6689 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6690 if we are parsing an attribute list for an attribute that wants a
6691 plain identifier argument, normal_attr for an attribute that wants
6692 an expression, or non_attr if we aren't parsing an attribute list. If
6693 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6694 not all of the expressions in the list were constant.
6695 WANT_LITERAL_ZERO_P is true if the caller is interested in
6696 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6697 immediately, this can be removed. */
6706 {
6712 /* Assume all the expressions will be constant. */
6721 /* Within a parenthesized expression, a `>' token is always
6722 the greater-than operator. */
6723 saved_greater_than_is_operator_p
6727 /* Consume expressions until there are no more. */
6730 {
6731 tree expr;
6733 /* At the beginning of attribute lists, check to see if the
6734 next token is an identifier. */
6737 {
6740 /* Consume the identifier. */
6742 /* Save the identifier. */
6744 }
6745 else
6746 {
6749 /* Parse the next assignment-expression. */
6751 {
6752 /* A braced-init-list. */
6758 }
6760 {
6761 expr = (cp_parser_constant_expression
6766 }
6767 else
6768 {
6772 {
6778 /* If a parameter is literal zero alone, remember it
6779 for -Wmemset-transposed-args warning. */
6782 && want_literal_zero_p
6784 == CPP_COMMA
6787 {
6794 else
6795 {
6800 }
6801 /* Consume the 0 token (or '\0', 0LL etc.). */
6803 }
6807 }
6810 NULL);
6811 }
6816 /* If we have an ellipsis, then this is an expression
6817 expansion. */
6820 {
6821 /* Consume the `...'. */
6824 /* Build the argument pack. */
6826 }
6828 /* Add it to the list. We add error_mark_node
6829 expressions to the list, so that we can still tell if
6830 the correct form for a parenthesized expression-list
6831 is found. That gives better errors. */
6836 }
6838 /* After the first item, attribute lists look the same as
6839 expression lists. */
6842 get_comma:;
6843 /* If the next token isn't a `,', then we are done. */
6847 /* Otherwise, consume the `,' and keep going. */
6849 }
6852 {
6855 skip_comma:;
6856 /* We try and resync to an unnested comma, as that will give the
6857 user better diagnostics. */
6865 {
6866 parser->greater_than_is_operator_p
6869 }
6870 }
6872 parser->greater_than_is_operator_p
6879 }
6881 /* Parse a pseudo-destructor-name.
6883 pseudo-destructor-name:
6884 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6885 :: [opt] nested-name-specifier template template-id :: ~ type-name
6886 :: [opt] nested-name-specifier [opt] ~ type-name
6888 If either of the first two productions is used, sets *SCOPE to the
6889 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6890 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6891 or ERROR_MARK_NODE if the parse fails. */
6893 static void
6895 tree object,
6898 {
6901 /* Handle ~auto. */
6905 {
6908 "%<~auto%> only available with "
6915 }
6917 /* Assume that things will not work out. */
6920 /* Look for the optional `::' operator. */
6922 /* Look for the optional nested-name-specifier. */
6923 nested_name_specifier_p
6930 /* Now, if we saw a nested-name-specifier, we might be doing the
6931 second production. */
6934 {
6935 /* Consume the `template' keyword. */
6937 /* Parse the template-id. */
6941 class_type,
6943 /* Look for the `::' token. */
6945 }
6946 /* If the next token is not a `~', then there might be some
6947 additional qualification. */
6949 {
6950 /* At this point, we're looking for "type-name :: ~". The type-name
6951 must not be a class-name, since this is a pseudo-destructor. So,
6952 it must be either an enum-name, or a typedef-name -- both of which
6953 are just identifiers. So, we peek ahead to check that the "::"
6954 and "~" tokens are present; if they are not, then we can avoid
6955 calling type_name. */
6959 {
6962 }
6964 /* Look for the type-name. */
6969 /* Look for the `::' token. */
6971 }
6972 else
6975 /* Look for the `~'. */
6978 /* Once we see the ~, this has to be a pseudo-destructor. */
6982 /* Look for the type-name again. We are not responsible for
6983 checking that it matches the first type-name. */
6985 }
6987 /* Parse a unary-expression.
6989 unary-expression:
6990 postfix-expression
6991 ++ cast-expression
6992 -- cast-expression
6993 unary-operator cast-expression
6994 sizeof unary-expression
6995 sizeof ( type-id )
6996 alignof ( type-id ) [C++0x]
6997 new-expression
6998 delete-expression
7000 GNU Extensions:
7002 unary-expression:
7003 __extension__ cast-expression
7004 __alignof__ unary-expression
7005 __alignof__ ( type-id )
7006 alignof unary-expression [C++0x]
7007 __real__ cast-expression
7008 __imag__ cast-expression
7009 && identifier
7010 sizeof ( type-id ) { initializer-list , [opt] }
7011 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7012 __alignof__ ( type-id ) { initializer-list , [opt] }
7014 ADDRESS_P is true iff the unary-expression is appearing as the
7015 operand of the `&' operator. CAST_P is true if this expression is
7016 the target of a cast.
7018 Returns a representation of the expression. */
7020 static tree
7023 {
7027 /* Peek at the next token. */
7029 /* Some keywords give away the kind of expression. */
7031 {
7035 {
7038 {
7041 location_t first_loc;
7044 /* Consume the token. */
7047 /* Parse the operand. */
7052 else
7053 {
7054 /* ISO C++ defines alignof only with types, not with
7055 expressions. So pedwarn if alignof is used with a non-
7056 type expression. However, __alignof__ is ok. */
7059 "ISO C++ does not allow %<alignof%> "
7063 }
7064 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7065 SIZEOF_EXPR with the original operand. */
7067 {
7069 {
7071 {
7074 error_mark_node));
7076 }
7077 else
7081 }
7083 }
7085 }
7094 {
7095 /* The saved value of the PEDANTIC flag. */
7097 tree expr;
7099 /* Save away the PEDANTIC flag. */
7101 /* Parse the cast-expression. */
7103 /* Restore the PEDANTIC flag. */
7107 }
7111 {
7112 tree expression;
7114 /* Consume the `__real__' or `__imag__' token. */
7116 /* Parse the cast-expression. */
7118 /* Create the complete representation. */
7122 expression,
7123 tf_warning_or_error);
7124 }
7132 {
7133 tree expr;
7143 parser->type_definition_forbidden_message
7146 saved_integral_constant_expression_p
7148 saved_non_integral_constant_expression_p
7152 saved_greater_than_is_operator_p
7162 parser->greater_than_is_operator_p
7165 parser->integral_constant_expression_p
7167 parser->non_integral_constant_expression_p
7174 }
7178 }
7179 }
7181 /* Look for the `:: new' and `:: delete', which also signal the
7182 beginning of a new-expression, or delete-expression,
7183 respectively. If the next token is `::', then it might be one of
7184 these. */
7186 {
7189 /* See if the token after the `::' is one of the keywords in
7190 which we're interested. */
7192 /* If it's `new', we have a new-expression. */
7195 /* Similarly, for `delete'. */
7198 }
7200 /* Look for a unary operator. */
7202 /* The `++' and `--' operators can be handled similarly, even though
7203 they are not technically unary-operators in the grammar. */
7205 {
7210 /* Handle the GNU address-of-label extension. */
7213 {
7214 tree identifier;
7215 tree expression;
7218 /* Consume the '&&' token. */
7220 /* Look for the identifier. */
7222 /* Create an expression representing the address. */
7225 NIC_ADDR_LABEL))
7228 }
7229 }
7231 {
7232 tree cast_expression;
7238 /* Consume the operator token. */
7240 /* Parse the cast-expression. */
7241 cast_expression
7246 pidk);
7247 /* Now, build an appropriate representation. */
7249 {
7253 RO_UNARY_STAR,
7254 complain);
7259 /* Fall through. */
7262 cast_expression,
7263 complain);
7270 /* Fall through. */
7280 }
7284 non_constant_p))
7288 }
7292 decltype_p,
7293 pidk);
7294 }
7299 {
7302 }
7304 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7305 unary-operator, the corresponding tree code is returned. */
7307 static enum tree_code
7309 {
7311 {
7332 }
7333 }
7335 /* Parse a new-expression.
7337 new-expression:
7338 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7339 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7341 Returns a representation of the expression. */
7343 static tree
7345 {
7348 tree type;
7351 tree ret;
7353 /* Look for the optional `::' operator. */
7354 global_scope_p
7358 /* Look for the `new' operator. */
7360 /* There's no easy way to tell a new-placement from the
7361 `( type-id )' construct. */
7363 /* Look for a new-placement. */
7365 /* If that didn't work out, there's no new-placement. */
7367 {
7371 }
7373 /* If the next token is a `(', then we have a parenthesized
7374 type-id. */
7376 {
7380 /* Consume the `('. */
7383 /* Parse the type-id. */
7384 parser->type_definition_forbidden_message
7389 /* Look for the closing `)'. */
7392 /* There should not be a direct-new-declarator in this production,
7393 but GCC used to allowed this, so we check and emit a sensible error
7394 message for this case. */
7396 {
7402 }
7403 }
7404 /* Otherwise, there must be a new-type-id. */
7405 else
7408 /* If the next token is a `(' or '{', then we have a new-initializer. */
7412 else
7415 /* A new-expression may not appear in an integral constant
7416 expression. */
7419 else
7420 {
7421 /* Create a representation of the new-expression. */
7423 tf_warning_or_error);
7424 }
7432 }
7434 /* Parse a new-placement.
7436 new-placement:
7437 ( expression-list )
7439 Returns the same representation as for an expression-list. */
7443 {
7446 /* Parse the expression-list. */
7447 expression_list = (cp_parser_parenthesized_expression_list
7453 }
7455 /* Parse a new-type-id.
7457 new-type-id:
7458 type-specifier-seq new-declarator [opt]
7460 Returns the TYPE allocated. If the new-type-id indicates an array
7461 type, *NELTS is set to the number of elements in the last array
7462 bound; the TYPE will not include the last array bound. */
7464 static tree
7466 {
7467 cp_decl_specifier_seq type_specifier_seq;
7473 /* The type-specifier sequence must not contain type definitions.
7474 (It cannot contain declarations of new types either, but if they
7475 are not definitions we will catch that because they are not
7476 complete.) */
7478 parser->type_definition_forbidden_message
7480 /* Parse the type-specifier-seq. */
7484 /* Restore the old message. */
7490 /* Parse the new-declarator. */
7493 /* Determine the number of elements in the last array dimension, if
7494 any. */
7496 /* Skip down to the last array dimension. */
7501 {
7504 }
7509 {
7512 }
7515 {
7522 else
7524 }
7527 }
7529 /* Parse an (optional) new-declarator.
7531 new-declarator:
7532 ptr-operator new-declarator [opt]
7533 direct-new-declarator
7535 Returns the declarator. */
7539 {
7542 cp_cv_quals cv_quals;
7544 /* We don't know if there's a ptr-operator next, or not. */
7546 /* Look for a ptr-operator. */
7548 /* If that worked, look for more new-declarators. */
7550 {
7553 /* Parse another optional declarator. */
7556 declarator = cp_parser_make_indirect_declarator
7560 }
7562 /* If the next token is a `[', there is a direct-new-declarator. */
7567 }
7569 /* Parse a direct-new-declarator.
7571 direct-new-declarator:
7572 [ expression ]
7573 direct-new-declarator [constant-expression]
7575 */
7579 {
7583 {
7584 tree expression;
7587 /* Look for the opening `['. */
7592 /* The standard requires that the expression have integral
7593 type. DR 74 adds enumeration types. We believe that the
7594 real intent is that these expressions be handled like the
7595 expression in a `switch' condition, which also allows
7596 classes with a single conversion to integral or
7597 enumeration type. */
7599 {
7600 expression
7602 expression,
7605 {
7607 "expression in new-declarator must have integral "
7610 }
7611 }
7613 /* Look for the closing `]'. */
7616 /* Add this bound to the declarator. */
7619 /* If the next token is not a `[', then there are no more
7620 bounds. */
7623 }
7626 }
7628 /* Parse a new-initializer.
7630 new-initializer:
7631 ( expression-list [opt] )
7632 braced-init-list
7634 Returns a representation of the expression-list. */
7638 {
7642 {
7643 tree t;
7650 }
7651 else
7652 expression_list = (cp_parser_parenthesized_expression_list
7658 }
7660 /* Parse a delete-expression.
7662 delete-expression:
7663 :: [opt] delete cast-expression
7664 :: [opt] delete [ ] cast-expression
7666 Returns a representation of the expression. */
7668 static tree
7670 {
7673 tree expression;
7675 /* Look for the optional `::' operator. */
7676 global_scope_p
7680 /* Look for the `delete' keyword. */
7682 /* See if the array syntax is in use. */
7684 {
7685 /* Consume the `[' token. */
7687 /* Look for the `]' token. */
7689 /* Remember that this is the `[]' construct. */
7691 }
7692 else
7695 /* Parse the cast-expression. */
7698 /* A delete-expression may not appear in an integral constant
7699 expression. */
7704 tf_warning_or_error);
7705 }
7707 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7708 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7709 0 otherwise. */
7711 static int
7713 {
7716 {
7758 /* In ((type ()) () the last () isn't a valid cast-expression,
7759 so the whole must be parsed as postfix-expression. */
7764 /* '[' may start a primary-expression in obj-c++ and in C++11,
7765 as a lambda-expression, eg, '(void)[]{}'. */
7772 /* '++' and '--' may or may not start a cast-expression:
7774 struct T { void operator++(int); };
7775 void f() { (T())++; }
7777 vs
7779 int a;
7780 (int)++a; */
7785 }
7786 }
7788 /* Parse a cast-expression.
7790 cast-expression:
7791 unary-expression
7792 ( type-id ) cast-expression
7794 ADDRESS_P is true iff the unary-expression is appearing as the
7795 operand of the `&' operator. CAST_P is true if this expression is
7796 the target of a cast.
7798 Returns a representation of the expression. */
7800 static tree
7803 {
7804 /* If it's a `(', then we might be looking at a cast. */
7806 {
7812 /* There's no way to know yet whether or not this is a cast.
7813 For example, `(int (3))' is a unary-expression, while `(int)
7814 3' is a cast. So, we resort to parsing tentatively. */
7816 /* Types may not be defined in a cast. */
7818 parser->type_definition_forbidden_message
7820 /* Consume the `('. */
7822 /* A very tricky bit is that `(struct S) { 3 }' is a
7823 compound-literal (which we permit in C++ as an extension).
7824 But, that construct is not a cast-expression -- it is a
7825 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7826 is legal; if the compound-literal were a cast-expression,
7827 you'd need an extra set of parentheses.) But, if we parse
7828 the type-id, and it happens to be a class-specifier, then we
7829 will commit to the parse at that point, because we cannot
7830 undo the action that is done when creating a new class. So,
7831 then we cannot back up and do a postfix-expression.
7833 Another tricky case is the following (c++/29234):
7835 struct S { void operator () (); };
7837 void foo ()
7838 {
7839 ( S()() );
7840 }
7842 As a type-id we parse the parenthesized S()() as a function
7843 returning a function, groktypename complains and we cannot
7844 back up in this case either.
7846 Therefore, we scan ahead to the closing `)', and check to see
7847 if the tokens after the `)' can start a cast-expression. Otherwise
7848 we are dealing with an unary-expression, a postfix-expression
7849 or something else.
7851 Yet another tricky case, in C++11, is the following (c++/54891):
7853 (void)[]{};
7855 The issue is that usually, besides the case of lambda-expressions,
7856 the parenthesized type-id cannot be followed by '[', and, eg, we
7857 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7858 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7859 we don't commit, we try a cast-expression, then an unary-expression.
7861 Save tokens so that we can put them back. */
7864 /* We may be looking at a cast-expression. */
7867 cast_expression
7870 /* Roll back the tokens we skipped. */
7872 /* If we aren't looking at a cast-expression, simulate an error so
7873 that the call to cp_parser_error_occurred below returns true. */
7876 else
7877 {
7880 /* Look for the type-id. */
7882 /* Look for the closing `)'. */
7885 }
7887 /* Restore the saved message. */
7890 /* At this point this can only be either a cast or a
7891 parenthesized ctor such as `(T ())' that looks like a cast to
7892 function returning T. */
7894 {
7895 /* Only commit if the cast-expression doesn't start with
7896 '++', '--', or '[' in C++11. */
7904 pidk);
7907 {
7908 /* Warn about old-style casts, if so requested. */
7915 /* Only type conversions to integral or enumeration types
7916 can be used in constant-expressions. */
7919 NIC_CAST))
7922 /* Perform the cast. */
7925 }
7926 }
7927 else
7929 }
7931 /* If we get here, then it's not a cast, so it must be a
7932 unary-expression. */
7935 }
7937 /* Parse a binary expression of the general form:
7939 pm-expression:
7940 cast-expression
7941 pm-expression .* cast-expression
7942 pm-expression ->* cast-expression
7944 multiplicative-expression:
7945 pm-expression
7946 multiplicative-expression * pm-expression
7947 multiplicative-expression / pm-expression
7948 multiplicative-expression % pm-expression
7950 additive-expression:
7951 multiplicative-expression
7952 additive-expression + multiplicative-expression
7953 additive-expression - multiplicative-expression
7955 shift-expression:
7956 additive-expression
7957 shift-expression << additive-expression
7958 shift-expression >> additive-expression
7960 relational-expression:
7961 shift-expression
7962 relational-expression < shift-expression
7963 relational-expression > shift-expression
7964 relational-expression <= shift-expression
7965 relational-expression >= shift-expression
7967 GNU Extension:
7969 relational-expression:
7970 relational-expression <? shift-expression
7971 relational-expression >? shift-expression
7973 equality-expression:
7974 relational-expression
7975 equality-expression == relational-expression
7976 equality-expression != relational-expression
7978 and-expression:
7979 equality-expression
7980 and-expression & equality-expression
7982 exclusive-or-expression:
7983 and-expression
7984 exclusive-or-expression ^ and-expression
7986 inclusive-or-expression:
7987 exclusive-or-expression
7988 inclusive-or-expression | exclusive-or-expression
7990 logical-and-expression:
7991 inclusive-or-expression
7992 logical-and-expression && inclusive-or-expression
7994 logical-or-expression:
7995 logical-and-expression
7996 logical-or-expression || logical-and-expression
7998 All these are implemented with a single function like:
8000 binary-expression:
8001 simple-cast-expression
8002 binary-expression <token> binary-expression
8004 CAST_P is true if this expression is the target of a cast.
8006 The binops_by_token map is used to get the tree codes for each <token> type.
8007 binary-expressions are associated according to a precedence table. */
8009 #define TOKEN_PRECEDENCE(token) \
8010 (((token->type == CPP_GREATER \
8011 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8012 && !parser->greater_than_is_operator_p) \
8013 ? PREC_NOT_OPERATOR \
8014 : binops_by_token[token->type].prec)
8016 static tree
8022 {
8023 cp_parser_expression_stack stack;
8025 cp_parser_expression_stack_entry current;
8026 tree rhs;
8030 tree overload;
8031 bool parenthesized_not_lhs_warn
8034 /* Parse the first expression. */
8044 {
8045 /* Get an operator token. */
8051 {
8053 "%<>>%> operator is treated"
8057 }
8061 /* Popping an entry off the stack means we completed a subexpression:
8062 - either we found a token which is not an operator (`>' where it is not
8063 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8064 will happen repeatedly;
8065 - or, we found an operator which has lower priority. This is the case
8066 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8067 parsing `3 * 4'. */
8069 {
8072 else
8074 }
8076 get_rhs:
8080 /* We used the operator token. */
8083 /* For "false && x" or "true || x", x will never be executed;
8084 disable warnings while evaluating it. */
8090 /* Extract another operand. It may be the RHS of this expression
8091 or the LHS of a new, higher priority expression. */
8095 /* Get another operator token. Look up its precedence to avoid
8096 building a useless (immediately popped) stack entry for common
8097 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8101 {
8102 /* ... and prepare to parse the RHS of the new, higher priority
8103 expression. Since precedence levels on the stack are
8104 monotonically increasing, we do not have to care about
8105 stack overflows. */
8114 pop:
8116 /* If the stack is not empty, we have parsed into LHS the right side
8117 (`4' in the example above) of an expression we had suspended.
8118 We can use the information on the stack to recover the LHS (`3')
8119 from the stack together with the tree code (`MULT_EXPR'), and
8120 the precedence of the higher level subexpression
8121 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8122 which will be used to actually build the additive expression. */
8127 }
8129 /* Undo the disabling of warnings done above. */
8141 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8142 ERROR_MARK for everything that is not a binary expression.
8143 This makes warn_about_parentheses miss some warnings that
8144 involve unary operators. For unary expressions we should
8145 pass the correct tree_code unless the unary expression was
8146 surrounded by parentheses.
8147 */
8153 == tcc_comparison
8156 else
8165 /* If the binary operator required the use of an overloaded operator,
8166 then this expression cannot be an integral constant-expression.
8167 An overloaded operator can be used even if both operands are
8168 otherwise permissible in an integral constant-expression if at
8169 least one of the operands is of enumeration type. */
8173 NIC_OVERLOADED))
8175 }
8178 }
8180 static tree
8185 {
8188 }
8190 /* Parse the `? expression : assignment-expression' part of a
8191 conditional-expression. The LOGICAL_OR_EXPR is the
8192 logical-or-expression that started the conditional-expression.
8193 Returns a representation of the entire conditional-expression.
8195 This routine is used by cp_parser_assignment_expression.
8197 ? expression : assignment-expression
8199 GNU Extensions:
8201 ? : assignment-expression */
8203 static tree
8205 {
8206 tree expr;
8207 tree assignment_expr;
8211 /* Consume the `?' token. */
8216 {
8219 /* Implicit true clause. */
8223 }
8224 else
8225 {
8228 /* Parse the expression. */
8231 c_inhibit_evaluation_warnings +=
8235 }
8237 /* The next token should be a `:'. */
8239 /* Parse the assignment-expression. */
8243 /* Build the conditional-expression. */
8245 expr,
8246 assignment_expr,
8247 tf_warning_or_error);
8248 }
8250 /* Parse an assignment-expression.
8252 assignment-expression:
8253 conditional-expression
8254 logical-or-expression assignment-operator assignment_expression
8255 throw-expression
8257 CAST_P is true if this expression is the target of a cast.
8258 DECLTYPE_P is true if this expression is the operand of decltype.
8260 Returns a representation for the expression. */
8262 static tree
8265 {
8266 tree expr;
8268 /* If the next token is the `throw' keyword, then we're looking at
8269 a throw-expression. */
8272 /* Otherwise, it must be that we are looking at a
8273 logical-or-expression. */
8274 else
8275 {
8276 /* Parse the binary expressions (logical-or-expression). */
8278 decltype_p,
8280 /* If the next token is a `?' then we're actually looking at a
8281 conditional-expression. */
8284 else
8285 {
8288 /* If it's an assignment-operator, we're using the second
8289 production. */
8290 enum tree_code assignment_operator
8293 {
8295 location_t saved_input_location;
8297 /* Parse the right-hand side of the assignment. */
8303 /* An assignment may not appear in a
8304 constant-expression. */
8306 NIC_ASSIGNMENT))
8308 /* Build the assignment expression. Its default
8309 location is the location of the '=' token. */
8313 assignment_operator,
8314 rhs,
8317 }
8318 }
8319 }
8322 }
8324 static tree
8327 {
8330 }
8332 /* Parse an (optional) assignment-operator.
8334 assignment-operator: one of
8335 = *= /= %= += -= >>= <<= &= ^= |=
8337 GNU Extension:
8339 assignment-operator: one of
8340 <?= >?=
8342 If the next token is an assignment operator, the corresponding tree
8343 code is returned, and the token is consumed. For example, for
8344 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8345 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8346 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8347 operator, ERROR_MARK is returned. */
8349 static enum tree_code
8351 {
8355 /* Peek at the next token. */
8359 {
8405 /* Nothing else is an assignment operator. */
8407 }
8409 /* If it was an assignment operator, consume it. */
8414 }
8416 /* Parse an expression.
8418 expression:
8419 assignment-expression
8420 expression , assignment-expression
8422 CAST_P is true if this expression is the target of a cast.
8423 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8424 except possibly parenthesized or on the RHS of a comma (N3276).
8426 Returns a representation of the expression. */
8428 static tree
8431 {
8436 {
8437 tree assignment_expression;
8439 /* Parse the next assignment-expression. */
8440 assignment_expression
8443 /* We don't create a temporary for a call that is the immediate operand
8444 of decltype or on the RHS of a comma. But when we see a comma, we
8445 need to create a temporary for a call on the LHS. */
8450 assignment_expression
8454 /* If this is the first assignment-expression, we can just
8455 save it away. */
8458 else
8460 assignment_expression,
8462 /* If the next token is not a comma, then we are done with the
8463 expression. */
8466 /* Consume the `,'. */
8469 /* A comma operator cannot appear in a constant-expression. */
8472 }
8475 }
8479 {
8481 }
8483 /* Parse a constant-expression.
8485 constant-expression:
8486 conditional-expression
8488 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8489 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8490 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8491 is false, NON_CONSTANT_P should be NULL. */
8493 static tree
8497 {
8501 tree expression;
8503 /* It might seem that we could simply parse the
8504 conditional-expression, and then check to see if it were
8505 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8506 one that the compiler can figure out is constant, possibly after
8507 doing some simplifications or optimizations. The standard has a
8508 precise definition of constant-expression, and we must honor
8509 that, even though it is somewhat more restrictive.
8511 For example:
8513 int i[(2, 3)];
8515 is not a legal declaration, because `(2, 3)' is not a
8516 constant-expression. The `,' operator is forbidden in a
8517 constant-expression. However, GCC's constant-folding machinery
8518 will fold this operation to an INTEGER_CST for `3'. */
8520 /* Save the old settings. */
8522 saved_allow_non_integral_constant_expression_p
8525 /* We are now parsing a constant-expression. */
8527 parser->allow_non_integral_constant_expression_p
8530 /* Although the grammar says "conditional-expression", we parse an
8531 "assignment-expression", which also permits "throw-expression"
8532 and the use of assignment operators. In the case that
8533 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8534 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8535 actually essential that we look for an assignment-expression.
8536 For example, cp_parser_initializer_clauses uses this function to
8537 determine whether a particular assignment-expression is in fact
8538 constant. */
8540 /* Restore the old settings. */
8541 parser->integral_constant_expression_p
8543 parser->allow_non_integral_constant_expression_p
8546 {
8547 /* Require an rvalue constant expression here; that's what our
8548 callers expect. Reference constant expressions are handled
8549 separately in e.g. cp_parser_template_argument. */
8554 }
8557 parser->non_integral_constant_expression_p
8561 }
8563 /* Parse __builtin_offsetof.
8565 offsetof-expression:
8566 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8568 offsetof-member-designator:
8569 id-expression
8570 | offsetof-member-designator "." id-expression
8571 | offsetof-member-designator "[" expression "]"
8572 | offsetof-member-designator "->" id-expression */
8574 static tree
8576 {
8579 cp_id_kind dummy;
8582 /* We're about to accept non-integral-constant things, but will
8583 definitely yield an integral constant expression. Save and
8584 restore these values around our local parsing. */
8588 /* Consume the "__builtin_offsetof" token. */
8590 /* Consume the opening `('. */
8592 /* Parse the type-id. */
8594 /* Look for the `,'. */
8598 /* Build the (type *)null that begins the traditional offsetof macro. */
8600 tf_warning_or_error);
8602 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8606 {
8609 {
8611 /* offsetof-member-designator "[" expression "]" */
8617 /* offsetof-member-designator "->" identifier */
8620 /* FALLTHRU */
8623 /* offsetof-member-designator "." identifier */
8631 /* Consume the ")" token. */
8636 /* Error. We know the following require will fail, but
8637 that gives the proper error message. */
8642 }
8643 }
8645 success:
8646 /* If we're processing a template, we can't finish the semantics yet.
8647 Otherwise we can fold the entire expression now. */
8650 else
8653 failure:
8658 }
8660 /* Parse a trait expression.
8662 Returns a representation of the expression, the underlying type
8663 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8665 static tree
8667 {
8668 cp_trait_kind kind;
8671 cp_decl_specifier_seq decl_specs;
8674 {
8751 }
8753 /* Consume the token. */
8763 /* Build a trivial decl-specifier-seq. */
8767 /* Call grokdeclarator to figure out what type this is. */
8772 {
8780 /* Build a trivial decl-specifier-seq. */
8784 /* Call grokdeclarator to figure out what type this is. */
8787 }
8791 /* Complete the trait expression, which may mean either processing
8792 the trait expr now or saving it for template instantiation. */
8794 {
8803 }
8804 }
8806 /* Lambdas that appear in variable initializer or default argument scope
8807 get that in their mangling, so we need to record it. We might as well
8808 use the count for function and namespace scopes as well. */
8812 {
8813 tree t;
8818 static void
8820 {
8821 tree_int ti;
8823 /* Once we're inside a function, we ignore other scopes and just push
8824 the function again so that popping works properly. */
8831 {
8832 /* Don't reset the count if we're still in the same function. */
8835 }
8836 }
8838 static void
8840 {
8843 }
8845 static void
8847 {
8850 {
8853 }
8855 }
8857 /* Parse a lambda expression.
8859 lambda-expression:
8860 lambda-introducer lambda-declarator [opt] compound-statement
8862 Returns a representation of the expression. */
8864 static tree
8866 {
8868 tree type;
8875 {
8877 {
8881 }
8883 }
8885 /* We may be in the middle of deferred access check. Disable
8886 it now. */
8897 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8900 /* Now that we've started the type, add the capture fields for any
8901 explicit captures. */
8904 {
8905 /* Inside the class, surrounding template-parameter-lists do not apply. */
8906 unsigned int saved_num_template_parameter_lists
8910 bool fully_implicit_function_template_p
8914 bool auto_is_implicit_function_template_parm_p
8925 /* By virtue of defining a local class, a lambda expression has access to
8926 the private variables of enclosing classes. */
8933 {
8936 }
8938 /* The capture list was built up in reverse order; fix that now. */
8950 parser->fully_implicit_function_template_p
8954 parser->auto_is_implicit_function_template_parm_p
8956 }
8960 /* This field is only used during parsing of the lambda. */
8963 /* This lambda shouldn't have any proxies left at this point. */
8965 /* And now that we're done, push proxies for an enclosing lambda. */
8970 else
8972 }
8974 /* Parse the beginning of a lambda expression.
8976 lambda-introducer:
8977 [ lambda-capture [opt] ]
8979 LAMBDA_EXPR is the current representation of the lambda expression. */
8981 static void
8983 {
8984 /* Need commas after the first capture. */
8987 /* Eat the leading `['. */
8990 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8998 {
9001 }
9004 {
9006 tree capture_id;
9007 tree capture_init_expr;
9011 enum capture_kind_type
9012 {
9013 BY_COPY,
9014 BY_REFERENCE
9015 };
9019 {
9022 }
9026 else
9029 /* Possibly capture `this'. */
9031 {
9041 explicit_init_p);
9043 }
9045 /* Remember whether we want to capture as a reference or not. */
9047 {
9050 }
9052 /* Get the identifier. */
9057 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9058 delimiters, but I modified this to stop on unnested ']' as well. It
9059 was already changed to stop on unnested '}', so the
9060 "closing_parenthesis" name is no more misleading with my change. */
9061 {
9067 }
9069 /* Find the initializer for this capture. */
9073 {
9075 /* An explicit initializer exists. */
9078 "lambda capture initializers "
9084 {
9087 }
9088 }
9089 else
9090 {
9093 /* Turn the identifier into an id-expression. */
9094 capture_init_expr
9099 {
9102 }
9106 {
9109 capture_init_expr);
9112 }
9115 {
9118 capture_init_expr))
9121 }
9123 capture_init_expr
9124 = finish_id_expression
9126 capture_init_expr,
9140 {
9143 }
9144 else
9146 }
9150 {
9155 capture_id);
9159 "capture of %qD redundant with by-reference capture "
9161 }
9164 capture_id,
9165 capture_init_expr,
9167 explicit_init_p);
9168 }
9171 }
9173 /* Parse the (optional) middle of a lambda expression.
9175 lambda-declarator:
9176 < template-parameter-list [opt] >
9177 ( parameter-declaration-clause [opt] )
9178 attribute-specifier [opt]
9179 mutable [opt]
9180 exception-specification [opt]
9181 lambda-return-type-clause [opt]
9183 LAMBDA_EXPR is the current representation of the lambda expression. */
9185 static bool
9187 {
9188 /* 5.1.1.4 of the standard says:
9189 If a lambda-expression does not include a lambda-declarator, it is as if
9190 the lambda-declarator were ().
9191 This means an empty parameter list, no attributes, and no exception
9192 specification. */
9198 /* The template-parameter-list is optional, but must begin with
9199 an opening angle if present. */
9201 {
9204 "lambda templates are only available with "
9213 /* We just processed one more parameter list. */
9215 }
9217 /* The parameter-declaration-clause is optional (unless
9218 template-parameter-list was given), but must begin with an
9219 opening parenthesis if present. */
9221 {
9226 /* Parse parameters. */
9229 /* Default arguments shall not be specified in the
9230 parameter-declaration-clause of a lambda-declarator. */
9240 /* Parse optional `mutable' keyword. */
9242 {
9245 }
9247 /* Parse optional exception specification. */
9250 /* Parse optional trailing return type. */
9252 {
9256 }
9258 /* The function parameters must be in scope all the way until after the
9259 trailing-return-type in case of decltype. */
9261 }
9265 /* Create the function call operator.
9267 Messing with declarators like this is no uglier than building up the
9268 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9269 other code. */
9270 {
9271 cp_decl_specifier_seq return_type_specs;
9273 tree fco;
9280 else
9281 /* Maybe we will deduce the return type later. */
9287 sfk_none);
9292 VIRT_SPEC_UNSPECIFIED,
9293 REF_QUAL_NONE,
9294 exception_spec,
9299 declarator,
9300 attributes);
9302 {
9305 /* Give the object parameter a different name. */
9309 }
9311 {
9315 }
9324 }
9325 }
9327 /* Parse the body of a lambda expression, which is simply
9329 compound-statement
9331 but which requires special handling.
9332 LAMBDA_EXPR is the current representation of the lambda expression. */
9334 static void
9336 {
9341 else
9342 /* Still increment function_depth so that we don't GC in the
9343 middle of an expression. */
9345 /* Clear this in case we're in the middle of a default argument. */
9348 /* Finish the function call operator
9349 - class_specifier
9350 + late_parsing_for_member
9351 + function_definition_after_declarator
9352 + ctor_initializer_opt_and_function_body */
9353 {
9355 tree body;
9357 tree compound_stmt;
9358 tree cap;
9360 /* Let the front end know that we are going to be defining this
9361 function. */
9363 NULL_TREE,
9372 /* Push the proxies for any explicit captures. */
9379 /* 5.1.1.4 of the standard says:
9380 If a lambda-expression does not include a trailing-return-type, it
9381 is as if the trailing-return-type denotes the following type:
9382 * if the compound-statement is of the form
9383 { return attribute-specifier [opt] expression ; }
9384 the type of the returned expression after lvalue-to-rvalue
9385 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9386 (_conv.array_ 4.2), and function-to-pointer conversion
9387 (_conv.func_ 4.3);
9388 * otherwise, void. */
9390 /* In a lambda that has neither a lambda-return-type-clause
9391 nor a deducible form, errors should be reported for return statements
9392 in the body. Since we used void as the placeholder return type, parsing
9393 the body as usual will give such desired behavior. */
9397 {
9401 /* Parse tentatively in case there's more after the initial return
9402 statement. */
9413 {
9417 /* Will get error here if type not deduced yet. */
9421 }
9422 }
9425 {
9430 }
9434 out:
9438 /* Finish the function and generate code for it if necessary. */
9441 /* Only expand if the call op is not a template. */
9444 }
9449 else
9451 }
9453 /* Statements [gram.stmt.stmt] */
9455 /* Parse a statement.
9457 statement:
9458 labeled-statement
9459 expression-statement
9460 compound-statement
9461 selection-statement
9462 iteration-statement
9463 jump-statement
9464 declaration-statement
9465 try-block
9467 C++11:
9469 statement:
9470 labeled-statement
9471 attribute-specifier-seq (opt) expression-statement
9472 attribute-specifier-seq (opt) compound-statement
9473 attribute-specifier-seq (opt) selection-statement
9474 attribute-specifier-seq (opt) iteration-statement
9475 attribute-specifier-seq (opt) jump-statement
9476 declaration-statement
9477 attribute-specifier-seq (opt) try-block
9479 TM Extension:
9481 statement:
9482 atomic-statement
9484 IN_COMPOUND is true when the statement is nested inside a
9485 cp_parser_compound_statement; this matters for certain pragmas.
9487 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9488 is a (possibly labeled) if statement which is not enclosed in braces
9489 and has an else clause. This is used to implement -Wparentheses. */
9491 static void
9494 {
9499 restart:
9502 /* There is no statement yet. */
9508 /* In obj-c++, seeing '[[' might be the either the beginning of
9509 c++11 attributes, or a nested objc-message-expression. So
9510 let's parse the c++11 attributes tentatively. */
9514 {
9517 }
9519 /* Peek at the next token. */
9521 /* Remember the location of the first token in the statement. */
9523 /* If this is a keyword, then that will often determine what kind of
9524 statement we have. */
9526 {
9530 {
9533 /* Looks like a labeled-statement with a case label.
9534 Parse the label, and then use tail recursion to parse
9535 the statement. */
9560 {
9565 }
9566 else
9567 {
9571 }
9575 /* Objective-C++ exception-handling constructs. */
9589 /* This must be a namespace alias definition. */
9602 /* It might be a keyword like `int' that can start a
9603 declaration-statement. */
9605 }
9606 }
9608 {
9609 /* If the next token is a `:', then we are looking at a
9610 labeled-statement. */
9613 {
9614 /* Looks like a labeled-statement with an ordinary label.
9615 Parse the label, and then use tail recursion to parse
9616 the statement. */
9620 }
9621 }
9622 /* Anything that starts with a `{' must be a compound-statement. */
9625 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9626 a statement all its own. */
9628 {
9629 /* Only certain OpenMP pragmas are attached to statements, and thus
9630 are considered statements themselves. All others are not. In
9631 the context of a compound, accept the pragma as a "statement" and
9632 return so that we can check for a close brace. Otherwise we
9633 require a real statement and must go back and read one. */
9639 }
9641 {
9644 }
9646 /* Everything else must be a declaration-statement or an
9647 expression-statement. Try for the declaration-statement
9648 first, unless we are looking at a `;', in which case we know that
9649 we have an expression-statement. */
9651 {
9653 {
9655 {
9656 /* Attributes should be parsed as part of the the
9657 declaration, so let's un-parse them. */
9660 }
9663 /* Try to parse the declaration-statement. */
9665 /* If that worked, we're done. */
9668 }
9669 /* Look for an expression-statement instead. */
9671 }
9673 /* Set the line number for the statement. */
9677 /* Note that for now, we don't do anything with c++11 statements
9678 parsed at this level. */
9681 OPT_Wattributes,
9683 }
9685 /* Parse the label for a labeled-statement, i.e.
9687 identifier :
9688 case constant-expression :
9689 default :
9691 GNU Extension:
9692 case constant-expression ... constant-expression : statement
9694 When a label is parsed without errors, the label is added to the
9695 parse tree by the finish_* functions, so this function doesn't
9696 have to return the label. */
9698 static void
9700 {
9705 /* The next token should be an identifier. */
9709 {
9712 }
9716 {
9718 {
9722 /* Consume the `case' token. */
9724 /* Parse the constant-expression. */
9727 NULL);
9731 {
9732 /* Consume the `...' token. */
9734 expr_hi =
9737 NULL);
9738 /* We don't need to emit warnings here, as the common code
9739 will do this for us. */
9740 }
9741 else
9746 else
9749 expr);
9750 }
9754 /* Consume the `default' token. */
9759 else
9764 /* Anything else must be an ordinary label. */
9767 }
9769 /* Require the `:' token. */
9772 /* An ordinary label may optionally be followed by attributes.
9773 However, this is only permitted if the attributes are then
9774 followed by a semicolon. This is because, for backward
9775 compatibility, when parsing
9776 lab: __attribute__ ((unused)) int i;
9777 we want the attribute to attach to "i", not "lab". */
9780 {
9781 tree attrs;
9788 ;
9789 else
9791 }
9797 }
9799 /* Parse an expression-statement.
9801 expression-statement:
9802 expression [opt] ;
9804 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9805 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9806 indicates whether this expression-statement is part of an
9807 expression statement. */
9809 static tree
9811 {
9815 /* If the next token is a ';', then there is no expression
9816 statement. */
9818 {
9822 {
9825 }
9826 }
9828 /* Give a helpful message for "A<T>::type t;" and the like. */
9831 {
9838 {
9839 /* A::A a; */
9844 }
9845 }
9847 /* Consume the final `;'. */
9852 /* This is the final expression statement of a statement
9853 expression. */
9859 }
9861 /* Parse a compound-statement.
9863 compound-statement:
9864 { statement-seq [opt] }
9866 GNU extension:
9868 compound-statement:
9869 { label-declaration-seq [opt] statement-seq [opt] }
9871 label-declaration-seq:
9872 label-declaration
9873 label-declaration-seq label-declaration
9875 Returns a tree representing the statement. */
9877 static tree
9880 {
9881 tree compound_stmt;
9883 /* Consume the `{'. */
9890 /* Begin the compound-statement. */
9892 /* If the next keyword is `__label__' we have a label declaration. */
9895 /* Parse an (optional) statement-seq. */
9897 /* Finish the compound-statement. */
9899 /* Consume the `}'. */
9903 }
9905 /* Parse an (optional) statement-seq.
9907 statement-seq:
9908 statement
9909 statement-seq [opt] statement */
9911 static void
9913 {
9914 /* Scan statements until there aren't any more. */
9916 {
9919 /* If we are looking at a `}', then we have run out of
9920 statements; the same is true if we have reached the end
9921 of file, or have stumbled upon a stray '@end'. */
9928 /* If we are in a compound statement and find 'else' then
9929 something went wrong. */
9931 {
9934 else
9935 {
9938 }
9939 }
9941 /* Parse the statement. */
9943 }
9944 }
9946 /* Parse a selection-statement.
9948 selection-statement:
9949 if ( condition ) statement
9950 if ( condition ) statement else statement
9951 switch ( condition ) statement
9953 Returns the new IF_STMT or SWITCH_STMT.
9955 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9956 is a (possibly labeled) if statement which is not enclosed in
9957 braces and has an else clause. This is used to implement
9958 -Wparentheses. */
9960 static tree
9962 {
9969 /* Peek at the next token. */
9972 /* See what kind of keyword it is. */
9975 {
9978 {
9979 tree statement;
9980 tree condition;
9982 /* Look for the `('. */
9984 {
9987 }
9989 /* Begin the selection-statement. */
9992 else
9995 /* Parse the condition. */
9997 /* Look for the `)'. */
10003 {
10007 /* Add the condition. */
10010 /* Parse the then-clause. */
10014 {
10022 }
10023 else
10029 /* If the next token is `else', parse the else-clause. */
10031 RID_ELSE))
10032 {
10033 /* Consume the `else' keyword. */
10036 /* Parse the else-clause. */
10038 {
10039 location_t loc;
10046 }
10047 else
10052 /* If we are currently parsing a then-clause, then
10053 IF_P will not be NULL. We set it to true to
10054 indicate that this if statement has an else clause.
10055 This may trigger the Wparentheses warning below
10056 when we get back up to the parent if statement. */
10059 }
10060 else
10061 {
10062 /* This if statement does not have an else clause. If
10063 NESTED_IF is true, then the then-clause is an if
10064 statement which does have an else clause. We warn
10065 about the potential ambiguity. */
10068 "suggest explicit braces to avoid ambiguous"
10070 }
10072 /* Now we're all done with the if-statement. */
10074 }
10075 else
10076 {
10080 /* Add the condition. */
10083 /* Parse the body of the switch-statement. */
10092 /* Now we're all done with the switch-statement. */
10094 }
10097 }
10103 }
10104 }
10106 /* Parse a condition.
10108 condition:
10109 expression
10110 type-specifier-seq declarator = initializer-clause
10111 type-specifier-seq declarator braced-init-list
10113 GNU Extension:
10115 condition:
10116 type-specifier-seq declarator asm-specification [opt]
10117 attributes [opt] = assignment-expression
10119 Returns the expression that should be tested. */
10121 static tree
10123 {
10124 cp_decl_specifier_seq type_specifiers;
10128 /* Try the declaration first. */
10130 /* New types are not allowed in the type-specifier-seq for a
10131 condition. */
10133 parser->type_definition_forbidden_message
10135 /* Parse the type-specifier-seq. */
10137 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10140 /* Restore the saved message. */
10142 /* If all is well, we might be looking at a declaration. */
10144 {
10145 tree decl;
10146 tree asm_specification;
10147 tree attributes;
10151 /* Parse the declarator. */
10157 /* Parse the attributes. */
10159 /* Parse the asm-specification. */
10161 /* If the next token is not an `=' or '{', then we might still be
10162 looking at an expression. For example:
10164 if (A(a).x)
10166 looks like a decl-specifier-seq and a declarator -- but then
10167 there is no `=', so this is an expression. */
10172 /* If we did see an `=' or '{', then we are looking at a declaration
10173 for sure. */
10175 {
10176 tree pushed_scope;
10180 /* Create the declaration. */
10186 /* Parse the initializer. */
10188 {
10192 }
10193 else
10194 {
10195 /* Consume the `='. */
10198 }
10202 /* Process the initializer. */
10205 asm_specification,
10206 flags);
10212 }
10213 }
10214 /* If we didn't even get past the declarator successfully, we are
10215 definitely not looking at a declaration. */
10216 else
10219 /* Otherwise, we are looking at an expression. */
10221 }
10223 /* Parses a for-statement or range-for-statement until the closing ')',
10224 not included. */
10226 static tree
10228 {
10232 /* Begin the for-statement. */
10235 /* Parse the initialization. */
10240 else
10242 }
10244 static tree
10246 {
10247 /* Normal for loop */
10250 tree stmt;
10253 /* The for-init-statement has already been parsed in
10254 cp_parser_for_init_statement, so no work is needed here. */
10257 /* If there's a condition, process it. */
10261 {
10265 }
10267 /* Look for the `;'. */
10270 /* If there's an expression, process it. */
10276 }
10278 /* Tries to parse a range-based for-statement:
10280 range-based-for:
10281 decl-specifier-seq declarator : expression
10283 The decl-specifier-seq declarator and the `:' are already parsed by
10284 cp_parser_for_init_statement. If processing_template_decl it returns a
10285 newly created RANGE_FOR_STMT; if not, it is converted to a
10286 regular FOR_STMT. */
10288 static tree
10291 {
10295 {
10298 }
10299 else
10302 /* If in template, STMT is converted to a normal for-statement
10303 at instantiation. If not, it is done just ahead. */
10305 {
10313 /* do_auto_deduction doesn't mess with template init-lists. */
10316 }
10317 else
10318 {
10321 }
10323 }
10325 /* Subroutine of cp_convert_range_for: given the initializer expression,
10326 builds up the range temporary. */
10328 static tree
10330 {
10333 /* Find out the type deduced by the declaration
10334 `auto &&__range = range_expr'. */
10339 /* Create the __range variable. */
10346 }
10348 /* Used by cp_parser_range_for in template context: we aren't going to
10349 do a full conversion yet, but we still need to resolve auto in the
10350 type of the for-range-declaration if present. This is basically
10351 a shortcut version of cp_convert_range_for. */
10353 static void
10355 {
10358 {
10361 iter_type = (cp_parser_perform_range_for_lookup
10364 {
10366 iter_type);
10368 tf_warning_or_error);
10371 }
10372 }
10373 }
10375 /* Converts a range-based for-statement into a normal
10376 for-statement, as per the definition.
10378 for (RANGE_DECL : RANGE_EXPR)
10379 BLOCK
10381 should be equivalent to:
10383 {
10384 auto &&__range = RANGE_EXPR;
10385 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10386 __begin != __end;
10387 ++__begin)
10388 {
10389 RANGE_DECL = *__begin;
10390 BLOCK
10391 }
10392 }
10394 If RANGE_EXPR is an array:
10395 BEGIN_EXPR = __range
10396 END_EXPR = __range + ARRAY_SIZE(__range)
10397 Else if RANGE_EXPR has a member 'begin' or 'end':
10398 BEGIN_EXPR = __range.begin()
10399 END_EXPR = __range.end()
10400 Else:
10401 BEGIN_EXPR = begin(__range)
10402 END_EXPR = end(__range);
10404 If __range has a member 'begin' but not 'end', or vice versa, we must
10405 still use the second alternative (it will surely fail, however).
10406 When calling begin()/end() in the third alternative we must use
10407 argument dependent lookup, but always considering 'std' as an associated
10408 namespace. */
10410 tree
10413 {
10419 /* If an error happened previously do nothing or else a lot of
10420 unhelpful errors would be issued. */
10422 else
10423 {
10424 tree range_temp;
10428 /* Can't bind a reference to an array of runtime bound. */
10430 else
10431 {
10436 LOOKUP_ONLYCONVERTING);
10438 }
10441 }
10443 /* The new for initialization statement. */
10451 LOOKUP_ONLYCONVERTING);
10460 LOOKUP_ONLYCONVERTING);
10464 /* The new for condition. */
10471 /* The new increment expression. */
10474 tf_warning_or_error);
10477 /* The declaration is initialized with *__begin inside the loop body. */
10480 tf_warning_or_error),
10482 LOOKUP_ONLYCONVERTING);
10485 }
10487 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10488 We need to solve both at the same time because the method used
10489 depends on the existence of members begin or end.
10490 Returns the type deduced for the iterator expression. */
10492 static tree
10494 {
10496 {
10499 }
10502 {
10507 }
10509 {
10510 /* If RANGE is an array, we will use pointer arithmetic. */
10513 range,
10517 }
10518 else
10519 {
10520 /* If it is not an array, we must do a bit of magic. */
10530 tf_warning_or_error);
10533 tf_warning_or_error);
10536 {
10537 /* Use the member functions. */
10540 else
10546 else
10549 }
10550 else
10551 {
10552 /* Use global functions with ADL. */
10559 tf_warning_or_error);
10561 tf_warning_or_error);
10563 tf_warning_or_error);
10565 tf_warning_or_error);
10568 }
10570 /* Last common checks. */
10572 {
10573 /* If one of the expressions is an error do no more checks. */
10576 }
10579 /* Can happen, when, eg, in a template context, Koenig lookup
10580 can't resolve begin/end (c++/58503). */
10582 else
10583 {
10585 /* The unqualified type of the __begin and __end temporaries should
10586 be the same, as required by the multiple auto declaration. */
10592 }
10593 }
10594 }
10596 /* Helper function for cp_parser_perform_range_for_lookup.
10597 Builds a tree for RANGE.IDENTIFIER(). */
10599 static tree
10601 {
10614 tf_warning_or_error);
10617 }
10619 /* Parse an iteration-statement.
10621 iteration-statement:
10622 while ( condition ) statement
10623 do statement while ( expression ) ;
10624 for ( for-init-statement condition [opt] ; expression [opt] )
10625 statement
10627 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10629 static tree
10631 {
10634 tree statement;
10637 /* Peek at the next token. */
10642 /* Remember whether or not we are already within an iteration
10643 statement. */
10646 /* See what kind of keyword it is. */
10649 {
10651 {
10652 tree condition;
10654 /* Begin the while-statement. */
10656 /* Look for the `('. */
10658 /* Parse the condition. */
10661 /* Look for the `)'. */
10663 /* Parse the dependent statement. */
10667 /* We're done with the while-statement. */
10669 }
10673 {
10674 tree expression;
10676 /* Begin the do-statement. */
10678 /* Parse the body of the do-statement. */
10683 /* Look for the `while' keyword. */
10685 /* Look for the `('. */
10687 /* Parse the expression. */
10689 /* We're done with the do-statement. */
10691 /* Look for the `)'. */
10693 /* Look for the `;'. */
10695 }
10699 {
10700 /* Look for the `('. */
10705 /* Look for the `)'. */
10708 /* Parse the body of the for-statement. */
10713 /* We're done with the for-statement. */
10715 }
10722 }
10725 }
10727 /* Parse a for-init-statement or the declarator of a range-based-for.
10728 Returns true if a range-based-for declaration is seen.
10730 for-init-statement:
10731 expression-statement
10732 simple-declaration */
10734 static bool
10736 {
10737 /* If the next token is a `;', then we have an empty
10738 expression-statement. Grammatically, this is also a
10739 simple-declaration, but an invalid one, because it does not
10740 declare anything. Therefore, if we did not handle this case
10741 specially, we would issue an error message about an invalid
10742 declaration. */
10744 {
10750 {
10751 /* N3994 -- for (id : init) ... */
10754 "type-specifier only available with "
10762 }
10764 /* A colon is used in range-based for. */
10767 /* We're going to speculatively look for a declaration, falling back
10768 to an expression, if necessary. */
10770 /* Parse the declaration. */
10773 decl);
10776 {
10777 /* It is a range-for, consume the ':' */
10781 {
10783 "range-based %<for%> loops only available with "
10786 }
10787 }
10788 else
10789 /* The ';' is not consumed yet because we told
10790 cp_parser_simple_declaration not to. */
10795 /* If the tentative parse failed, then we shall need to look for an
10796 expression-statement. */
10797 }
10798 /* If we are here, it is an expression-statement. */
10801 }
10803 /* Parse a jump-statement.
10805 jump-statement:
10806 break ;
10807 continue ;
10808 return expression [opt] ;
10809 return braced-init-list ;
10810 goto identifier ;
10812 GNU extension:
10814 jump-statement:
10815 goto * expression ;
10817 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10819 static tree
10821 {
10827 /* Peek at the next token. */
10832 /* See what kind of keyword it is. */
10835 {
10839 {
10859 }
10865 {
10872 /* Fall through. */
10882 }
10887 {
10888 tree expr;
10892 {
10896 }
10899 else
10900 /* If the next token is a `;', then there is no
10901 expression. */
10903 /* Build the return-statement. */
10905 /* Look for the final `;'. */
10907 }
10911 /* Create the goto-statement. */
10913 {
10914 /* Issue a warning about this use of a GNU extension. */
10916 /* Consume the '*' token. */
10918 /* Parse the dependent expression. */
10920 }
10921 else
10923 /* Look for the final `;'. */
10930 }
10933 }
10935 /* Parse a declaration-statement.
10937 declaration-statement:
10938 block-declaration */
10940 static void
10942 {
10945 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10948 /* Parse the block-declaration. */
10951 /* Free any declarators allocated. */
10953 }
10955 /* Some dependent statements (like `if (cond) statement'), are
10956 implicitly in their own scope. In other words, if the statement is
10957 a single statement (as opposed to a compound-statement), it is
10958 none-the-less treated as if it were enclosed in braces. Any
10959 declarations appearing in the dependent statement are out of scope
10960 after control passes that point. This function parses a statement,
10961 but ensures that is in its own scope, even if it is not a
10962 compound-statement.
10964 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10965 is a (possibly labeled) if statement which is not enclosed in
10966 braces and has an else clause. This is used to implement
10967 -Wparentheses.
10969 Returns the new statement. */
10971 static tree
10973 {
10974 tree statement;
10979 /* Mark if () ; with a special NOP_EXPR. */
10981 {
10985 }
10986 /* if a compound is opened, we simply parse the statement directly. */
10989 /* If the token is not a `{', then we must take special action. */
10990 else
10991 {
10992 /* Create a compound-statement. */
10994 /* Parse the dependent-statement. */
10996 /* Finish the dummy compound-statement. */
10998 }
11000 /* Return the statement. */
11002 }
11004 /* For some dependent statements (like `while (cond) statement'), we
11005 have already created a scope. Therefore, even if the dependent
11006 statement is a compound-statement, we do not want to create another
11007 scope. */
11009 static void
11011 {
11012 /* If the token is a `{', then we must take special action. */
11015 else
11016 {
11017 /* Avoid calling cp_parser_compound_statement, so that we
11018 don't create a new scope. Do everything else by hand. */
11020 /* If the next keyword is `__label__' we have a label declaration. */
11023 /* Parse an (optional) statement-seq. */
11026 }
11027 }
11029 /* Declarations [gram.dcl.dcl] */
11031 /* Parse an optional declaration-sequence.
11033 declaration-seq:
11034 declaration
11035 declaration-seq declaration */
11037 static void
11039 {
11041 {
11052 {
11053 /* A declaration consisting of a single semicolon is
11054 invalid. Allow it unless we're being pedantic. */
11059 }
11061 /* If we're entering or exiting a region that's implicitly
11062 extern "C", modify the lang context appropriately. */
11064 {
11067 }
11069 {
11072 }
11075 {
11076 /* A top-level declaration can consist solely of a #pragma.
11077 A nested declaration cannot, so this is done here and not
11078 in cp_parser_declaration. (A #pragma at block scope is
11079 handled in cp_parser_statement.) */
11082 }
11084 /* Parse the declaration itself. */
11086 }
11087 }
11089 /* Parse a declaration.
11091 declaration:
11092 block-declaration
11093 function-definition
11094 template-declaration
11095 explicit-instantiation
11096 explicit-specialization
11097 linkage-specification
11098 namespace-definition
11100 GNU extension:
11102 declaration:
11103 __extension__ declaration */
11105 static void
11107 {
11108 cp_token token1;
11109 cp_token token2;
11114 /* Check for the `__extension__' keyword. */
11116 {
11117 /* Parse the qualified declaration. */
11119 /* Restore the PEDANTIC flag. */
11123 }
11125 /* Try to figure out what kind of declaration is present. */
11130 else
11131 {
11134 }
11136 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11139 /* If the next token is `extern' and the following token is a string
11140 literal, then we have a linkage specification. */
11144 /* If the next token is `template', then we have either a template
11145 declaration, an explicit instantiation, or an explicit
11146 specialization. */
11148 {
11149 /* `template <>' indicates a template specialization. */
11153 /* `template <' indicates a template declaration. */
11156 /* Anything else must be an explicit instantiation. */
11157 else
11159 }
11160 /* If the next token is `export', then we have a template
11161 declaration. */
11164 /* If the next token is `extern', 'static' or 'inline' and the one
11165 after that is `template', we have a GNU extended explicit
11166 instantiation directive. */
11173 /* If the next token is `namespace', check for a named or unnamed
11174 namespace definition. */
11180 /* An unnamed namespace definition. */
11184 /* An inline (associated) namespace definition. */
11188 /* Objective-C++ declaration/definition. */
11195 /* We must have either a block declaration or a function
11196 definition. */
11197 else
11198 /* Try to parse a block-declaration, or a function-definition. */
11201 /* Free any declarators allocated. */
11203 }
11205 /* Parse a block-declaration.
11207 block-declaration:
11208 simple-declaration
11209 asm-definition
11210 namespace-alias-definition
11211 using-declaration
11212 using-directive
11214 GNU Extension:
11216 block-declaration:
11217 __extension__ block-declaration
11219 C++0x Extension:
11221 block-declaration:
11222 static_assert-declaration
11224 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11225 part of a declaration-statement. */
11227 static void
11230 {
11234 /* Check for the `__extension__' keyword. */
11236 {
11237 /* Parse the qualified declaration. */
11239 /* Restore the PEDANTIC flag. */
11243 }
11245 /* Peek at the next token to figure out which kind of declaration is
11246 present. */
11249 /* If the next keyword is `asm', we have an asm-definition. */
11251 {
11255 }
11256 /* If the next keyword is `namespace', we have a
11257 namespace-alias-definition. */
11260 /* If the next keyword is `using', we have a
11261 using-declaration, a using-directive, or an alias-declaration. */
11263 {
11268 /* If the token after `using' is `namespace', then we have a
11269 using-directive. */
11273 /* If the second token after 'using' is '=', then we have an
11274 alias-declaration. */
11280 /* Otherwise, it's a using-declaration. */
11281 else
11284 }
11285 /* If the next keyword is `__label__' we have a misplaced label
11286 declaration. */
11288 {
11292 /* If the next token is now a `;', consume it. */
11295 }
11296 /* If the next token is `static_assert' we have a static assertion. */
11299 /* Anything else must be a simple-declaration. */
11300 else
11303 }
11305 /* Parse a simple-declaration.
11307 simple-declaration:
11308 decl-specifier-seq [opt] init-declarator-list [opt] ;
11310 init-declarator-list:
11311 init-declarator
11312 init-declarator-list , init-declarator
11314 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11315 function-definition as a simple-declaration.
11317 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11318 parsed declaration if it is an uninitialized single declarator not followed
11319 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11320 if present, will not be consumed. */
11322 static void
11326 {
11327 cp_decl_specifier_seq decl_specifiers;
11334 /* Defer access checks until we know what is being declared; the
11335 checks for names appearing in the decl-specifier-seq should be
11336 done as if we were in the scope of the thing being declared. */
11339 /* Parse the decl-specifier-seq. We have to keep track of whether
11340 or not the decl-specifier-seq declares a named class or
11341 enumeration type, since that is the only case in which the
11342 init-declarator-list is allowed to be empty.
11344 [dcl.dcl]
11346 In a simple-declaration, the optional init-declarator-list can be
11347 omitted only when declaring a class or enumeration, that is when
11348 the decl-specifier-seq contains either a class-specifier, an
11349 elaborated-type-specifier, or an enum-specifier. */
11351 CP_PARSER_FLAGS_OPTIONAL,
11354 /* We no longer need to defer access checks. */
11357 /* In a block scope, a valid declaration must always have a
11358 decl-specifier-seq. By not trying to parse declarators, we can
11359 resolve the declaration/expression ambiguity more quickly. */
11362 {
11365 }
11367 /* If the next two tokens are both identifiers, the code is
11368 erroneous. The usual cause of this situation is code like:
11370 T t;
11372 where "T" should name a type -- but does not. */
11375 {
11376 /* If parsing tentatively, we should commit; we really are
11377 looking at a declaration. */
11379 /* Give up. */
11381 }
11383 /* If we have seen at least one decl-specifier, and the next token
11384 is not a parenthesis, then we must be looking at a declaration.
11385 (After "int (" we might be looking at a functional cast.) */
11392 /* Keep going until we hit the `;' at the end of the simple
11393 declaration. */
11396 CPP_SEMICOLON))
11397 {
11400 tree decl;
11403 {
11404 /* If we are processing next declarator, coma is expected */
11410 }
11411 else
11414 /* Parse the init-declarator. */
11417 function_definition_allowed_p,
11419 declares_class_or_enum,
11421 maybe_range_for_decl);
11422 /* If an error occurred while parsing tentatively, exit quickly.
11423 (That usually happens when in the body of a function; each
11424 statement is treated as a declaration-statement until proven
11425 otherwise.) */
11428 /* Handle function definitions specially. */
11430 {
11431 /* If the next token is a `,', then we are probably
11432 processing something like:
11434 void f() {}, *p;
11436 which is erroneous. */
11438 {
11441 "mixing"
11443 }
11444 /* Otherwise, we're done with the list of declarators. */
11445 else
11446 {
11449 }
11450 }
11453 /* The next token should be either a `,' or a `;'. */
11455 /* If it's a `,', there are more declarators to come. */
11458 /* If it's a `;', we are done. */
11461 /* Anything else is an error. */
11462 else
11463 {
11464 /* If we have already issued an error message we don't need
11465 to issue another one. */
11469 /* Skip tokens until we reach the end of the statement. */
11471 /* If the next token is now a `;', consume it. */
11475 }
11476 /* After the first time around, a function-definition is not
11477 allowed -- even if it was OK at first. For example:
11479 int i, f() {}
11481 is not valid. */
11483 }
11485 /* Issue an error message if no declarators are present, and the
11486 decl-specifier-seq does not itself declare a class or
11487 enumeration: [dcl.dcl]/3. */
11489 {
11491 {
11495 /* Ensure an error is issued anyway when finish_decltype_type,
11496 called via cp_parser_decl_specifier_seq, returns a class or
11497 an enumeration (c++/51786). */
11500 }
11501 /* Perform any deferred access checks. */
11503 }
11505 /* Consume the `;'. */
11509 done:
11511 }
11513 /* Parse a decl-specifier-seq.
11515 decl-specifier-seq:
11516 decl-specifier-seq [opt] decl-specifier
11517 decl-specifier attribute-specifier-seq [opt] (C++11)
11519 decl-specifier:
11520 storage-class-specifier
11521 type-specifier
11522 function-specifier
11523 friend
11524 typedef
11526 GNU Extension:
11528 decl-specifier:
11529 attributes
11531 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11533 The parser flags FLAGS is used to control type-specifier parsing.
11535 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11536 flags:
11538 1: one of the decl-specifiers is an elaborated-type-specifier
11539 (i.e., a type declaration)
11540 2: one of the decl-specifiers is an enum-specifier or a
11541 class-specifier (i.e., a type definition)
11543 */
11545 static void
11547 cp_parser_flags flags,
11550 {
11554 cp_decl_spec ds;
11556 /* Clear DECL_SPECS. */
11559 /* Assume no class or enumeration type is declared. */
11562 /* Keep reading specifiers until there are no more to read. */
11564 {
11569 /* Peek at the next token. */
11572 /* Save the first token of the decl spec list for error
11573 reporting. */
11576 /* Handle attributes. */
11578 {
11579 /* Parse the attributes. */
11582 /* In a sequence of declaration specifiers, c++11 attributes
11583 appertain to the type that precede them. In that case
11584 [dcl.spec]/1 says:
11586 The attribute-specifier-seq affects the type only for
11587 the declaration it appears in, not other declarations
11588 involving the same type.
11590 But for now let's force the user to position the
11591 attribute either at the beginning of the declaration or
11592 after the declarator-id, which would clearly mean that it
11593 applies to the declarator. */
11595 {
11597 /* The c++11 attribute is at the beginning of the
11598 declaration. It appertains to the entity being
11600 else
11601 {
11603 {
11604 /* This is an attribute following a
11605 class-specifier. */
11610 }
11611 else
11612 {
11613 decl_specs->std_attributes
11615 attrs);
11618 }
11620 }
11621 }
11623 decl_specs->attributes
11625 attrs);
11629 }
11630 /* Assume we will find a decl-specifier keyword. */
11632 /* If the next token is an appropriate keyword, we can simply
11633 add it to the list. */
11635 {
11636 /* decl-specifier:
11637 friend
11638 constexpr */
11641 {
11644 }
11645 else
11646 {
11648 /* Consume the token. */
11650 }
11658 /* function-specifier:
11659 inline
11660 virtual
11661 explicit */
11668 /* decl-specifier:
11669 typedef */
11672 /* Consume the token. */
11674 /* A constructor declarator cannot appear in a typedef. */
11676 /* The "typedef" keyword can only occur in a declaration; we
11677 may as well commit at this point. */
11684 /* storage-class-specifier:
11685 auto
11686 register
11687 static
11688 extern
11689 mutable
11691 GNU Extension:
11692 thread */
11695 {
11696 /* Consume the token. */
11699 /* Complain about `auto' as a storage specifier, if
11700 we're complaining about C++0x compatibility. */
11704 /* Set the storage class anyway. */
11706 token);
11707 }
11708 else
11709 /* C++0x auto type-specifier. */
11717 /* Consume the token. */
11720 token);
11723 /* Consume the token. */
11729 /* We did not yet find a decl-specifier yet. */
11732 }
11742 /* Constructors are a special case. The `S' in `S()' is not a
11743 decl-specifier; it is the beginning of the declarator. */
11744 constructor_p
11745 = (!found_decl_spec
11746 && constructor_possible_p
11747 && (cp_parser_constructor_declarator_p
11750 /* If we don't have a DECL_SPEC yet, then we must be looking at
11751 a type-specifier. */
11753 {
11756 tree type_spec;
11758 type_spec
11760 decl_specs,
11766 /* If this type-specifier referenced a user-defined type
11767 (a typedef, class-name, etc.), then we can't allow any
11768 more such type-specifiers henceforth.
11770 [dcl.spec]
11772 The longest sequence of decl-specifiers that could
11773 possibly be a type name is taken as the
11774 decl-specifier-seq of a declaration. The sequence shall
11775 be self-consistent as described below.
11777 [dcl.type]
11779 As a general rule, at most one type-specifier is allowed
11780 in the complete decl-specifier-seq of a declaration. The
11781 only exceptions are the following:
11783 -- const or volatile can be combined with any other
11784 type-specifier.
11786 -- signed or unsigned can be combined with char, long,
11787 short, or int.
11789 -- ..
11791 Example:
11793 typedef char* Pc;
11794 void g (const int Pc);
11796 Here, Pc is *not* part of the decl-specifier seq; it's
11797 the declarator. Therefore, once we see a type-specifier
11798 (other than a cv-qualifier), we forbid any additional
11799 user-defined types. We *do* still allow things like `int
11800 int' to be considered a decl-specifier-seq, and issue the
11801 error message later. */
11804 /* A constructor declarator cannot follow a type-specifier. */
11806 {
11811 }
11812 }
11814 /* If we still do not have a DECL_SPEC, then there are no more
11815 decl-specifiers. */
11820 /* After we see one decl-specifier, further decl-specifiers are
11821 always optional. */
11823 }
11825 /* Don't allow a friend specifier with a class definition. */
11830 }
11832 /* Parse an (optional) storage-class-specifier.
11834 storage-class-specifier:
11835 auto
11836 register
11837 static
11838 extern
11839 mutable
11841 GNU Extension:
11843 storage-class-specifier:
11844 thread
11846 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11848 static tree
11850 {
11852 {
11856 /* Fall through for C++98. */
11863 /* Consume the token. */
11868 }
11869 }
11871 /* Parse an (optional) function-specifier.
11873 function-specifier:
11874 inline
11875 virtual
11876 explicit
11878 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11879 Updates DECL_SPECS, if it is non-NULL. */
11881 static tree
11884 {
11887 {
11893 /* 14.5.2.3 [temp.mem]
11895 A member function template shall not be virtual. */
11898 else
11908 }
11910 /* Consume the token. */
11912 }
11914 /* Parse a linkage-specification.
11916 linkage-specification:
11917 extern string-literal { declaration-seq [opt] }
11918 extern string-literal declaration */
11920 static void
11922 {
11923 tree linkage;
11925 /* Look for the `extern' keyword. */
11928 /* Look for the string-literal. */
11931 /* Transform the literal into an identifier. If the literal is a
11932 wide-character string, or contains embedded NULs, then we can't
11933 handle it as the user wants. */
11936 {
11938 /* Assume C++ linkage. */
11940 }
11941 else
11944 /* We're now using the new linkage. */
11947 /* If the next token is a `{', then we're using the first
11948 production. */
11950 {
11953 /* Consume the `{' token. */
11955 /* Parse the declarations. */
11957 /* Look for the closing `}'. */
11959 }
11960 /* Otherwise, there's just one declaration. */
11961 else
11962 {
11965 saved_in_unbraced_linkage_specification_p
11969 parser->in_unbraced_linkage_specification_p
11971 }
11973 /* We're done with the linkage-specification. */
11975 }
11977 /* Parse a static_assert-declaration.
11979 static_assert-declaration:
11980 static_assert ( constant-expression , string-literal ) ;
11982 If MEMBER_P, this static_assert is a class member. */
11984 static void
11986 {
11987 tree condition;
11988 tree message;
11990 location_t saved_loc;
11993 /* Peek at the `static_assert' token so we can keep track of exactly
11994 where the static assertion started. */
11998 /* Look for the `static_assert' keyword. */
12000 RT_STATIC_ASSERT))
12003 /* We know we are in a static assertion; commit to any tentative
12004 parse. */
12008 /* Parse the `(' starting the static assertion condition. */
12011 /* Parse the constant-expression. Allow a non-constant expression
12012 here in order to give better diagnostics in finish_static_assert. */
12013 condition =
12018 /* Parse the separating `,'. */
12021 /* Parse the string-literal message. */
12026 /* A `)' completes the static assertion. */
12033 /* A semicolon terminates the declaration. */
12036 /* Complete the static assertion, which may mean either processing
12037 the static assert now or saving it for template instantiation. */
12039 }
12041 /* Parse the expression in decltype ( expression ). */
12043 static tree
12046 {
12048 tree expr;
12050 /* First, try parsing an id-expression. */
12061 {
12064 cp_id_kind idk;
12068 /* Lookup the name we got back from the id-expression. */
12079 {
12080 /* Complete lookup of the id-expression. */
12081 expr = (finish_id_expression
12094 /* We found an id-expression, but it was something that we
12095 should not have found. This is an error, not something
12096 we can recover from, so note that we found an
12097 id-expression and we'll recover as gracefully as
12098 possible. */
12100 }
12105 /* We have an id-expression. */
12107 }
12110 {
12111 /* Abort the id-expression parse. */
12114 /* Parsing tentatively, again. */
12117 /* Parse a class member access. */
12125 /* We have an id-expression. */
12127 }
12130 /* We have parsed the complete id-expression or member access. */
12132 else
12133 {
12134 /* Abort our attempt to parse an id-expression or member access
12135 expression. */
12138 /* Parse a full expression. */
12141 }
12144 }
12146 /* Parse a `decltype' type. Returns the type.
12148 simple-type-specifier:
12149 decltype ( expression )
12150 C++14 proposal:
12151 decltype ( auto ) */
12153 static tree
12155 {
12156 tree expr;
12165 {
12166 /* Already parsed. */
12169 }
12171 /* Look for the `decltype' token. */
12175 /* Parse the opening `('. */
12179 /* decltype (auto) */
12182 {
12189 }
12191 /* Types cannot be defined in a `decltype' expression. Save away the
12192 old message. */
12195 /* And create the new one. */
12196 parser->type_definition_forbidden_message
12199 /* The restrictions on constant-expressions do not apply inside
12200 decltype expressions. */
12201 saved_integral_constant_expression_p
12203 saved_non_integral_constant_expression_p
12207 /* Within a parenthesized expression, a `>' token is always
12208 the greater-than operator. */
12209 saved_greater_than_is_operator_p
12213 /* Do not actually evaluate the expression. */
12216 /* Do not warn about problems with the expression. */
12221 /* Go back to evaluating expressions. */
12225 /* The `>' token might be the end of a template-id or
12226 template-parameter-list now. */
12227 parser->greater_than_is_operator_p
12230 /* Restore the old message and the integral constant expression
12231 flags. */
12233 parser->integral_constant_expression_p
12235 parser->non_integral_constant_expression_p
12238 /* Parse to the closing `)'. */
12240 {
12244 }
12247 tf_warning_or_error);
12249 rewrite:
12250 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12251 it again. */
12258 }
12260 /* Special member functions [gram.special] */
12262 /* Parse a conversion-function-id.
12264 conversion-function-id:
12265 operator conversion-type-id
12267 Returns an IDENTIFIER_NODE representing the operator. */
12269 static tree
12271 {
12272 tree type;
12273 tree saved_scope;
12274 tree saved_qualifying_scope;
12275 tree saved_object_scope;
12278 /* Look for the `operator' token. */
12281 /* When we parse the conversion-type-id, the current scope will be
12282 reset. However, we need that information in able to look up the
12283 conversion function later, so we save it here. */
12287 /* We must enter the scope of the class so that the names of
12288 entities declared within the class are available in the
12289 conversion-type-id. For example, consider:
12291 struct S {
12292 typedef int I;
12293 operator I();
12294 };
12296 S::operator I() { ... }
12298 In order to see that `I' is a type-name in the definition, we
12299 must be in the scope of `S'. */
12302 /* Parse the conversion-type-id. */
12304 /* Leave the scope of the class, if any. */
12307 /* Restore the saved scope. */
12311 /* If the TYPE is invalid, indicate failure. */
12315 }
12317 /* Parse a conversion-type-id:
12319 conversion-type-id:
12320 type-specifier-seq conversion-declarator [opt]
12322 Returns the TYPE specified. */
12324 static tree
12326 {
12327 tree attributes;
12328 cp_decl_specifier_seq type_specifiers;
12330 tree type_specified;
12333 /* Parse the attributes. */
12337 parser->type_definition_forbidden_message
12340 /* Parse the type-specifiers. */
12347 /* If that didn't work, stop. */
12350 /* Parse the conversion-declarator. */
12358 /* Don't give this error when parsing tentatively. This happens to
12359 work because we always parse this definitively once. */
12362 {
12364 {
12367 }
12371 }
12374 }
12376 /* Parse an (optional) conversion-declarator.
12378 conversion-declarator:
12379 ptr-operator conversion-declarator [opt]
12381 */
12385 {
12388 cp_cv_quals cv_quals;
12390 /* We don't know if there's a ptr-operator next, or not. */
12392 /* Try the ptr-operator. */
12395 /* If it worked, look for more conversion-declarators. */
12397 {
12400 /* Parse another optional declarator. */
12403 declarator = cp_parser_make_indirect_declarator
12407 }
12410 }
12412 /* Parse an (optional) ctor-initializer.
12414 ctor-initializer:
12415 : mem-initializer-list
12417 Returns TRUE iff the ctor-initializer was actually present. */
12419 static bool
12421 {
12422 /* If the next token is not a `:', then there is no
12423 ctor-initializer. */
12425 {
12426 /* Do default initialization of any bases and members. */
12431 }
12433 /* Consume the `:' token. */
12435 /* And the mem-initializer-list. */
12439 }
12441 /* Parse a mem-initializer-list.
12443 mem-initializer-list:
12444 mem-initializer ... [opt]
12445 mem-initializer ... [opt] , mem-initializer-list */
12447 static void
12449 {
12454 /* Let the semantic analysis code know that we are starting the
12455 mem-initializer-list. */
12460 /* Loop through the list. */
12462 {
12463 tree mem_initializer;
12466 /* Parse the mem-initializer. */
12468 /* If the next token is a `...', we're expanding member initializers. */
12470 {
12471 /* Consume the `...'. */
12474 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12475 can be expanded but members cannot. */
12478 {
12483 }
12485 /* Construct the pack expansion type. */
12488 }
12491 {
12495 }
12496 /* Look for a target constructor. */
12500 {
12503 {
12507 }
12509 }
12510 /* Add it to the list, unless it was erroneous. */
12512 {
12515 }
12516 /* If the next token is not a `,', we're done. */
12519 /* Consume the `,' token. */
12521 }
12523 /* Perform semantic analysis. */
12526 }
12528 /* Parse a mem-initializer.
12530 mem-initializer:
12531 mem-initializer-id ( expression-list [opt] )
12532 mem-initializer-id braced-init-list
12534 GNU extension:
12536 mem-initializer:
12537 ( expression-list [opt] )
12539 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12540 class) or FIELD_DECL (for a non-static data member) to initialize;
12541 the TREE_VALUE is the expression-list. An empty initialization
12542 list is represented by void_list_node. */
12544 static tree
12546 {
12547 tree mem_initializer_id;
12548 tree expression_list;
12549 tree member;
12552 /* Find out what is being initialized. */
12554 {
12558 }
12559 else
12560 {
12564 }
12570 {
12577 }
12578 else
12579 {
12589 }
12599 }
12601 /* Parse a mem-initializer-id.
12603 mem-initializer-id:
12604 :: [opt] nested-name-specifier [opt] class-name
12605 identifier
12607 Returns a TYPE indicating the class to be initializer for the first
12608 production. Returns an IDENTIFIER_NODE indicating the data member
12609 to be initialized for the second production. */
12611 static tree
12613 {
12617 tree id;
12621 /* `typename' is not allowed in this context ([temp.res]). */
12623 {
12625 "keyword %<typename%> not allowed in this context (a qualified "
12628 }
12629 /* Look for the optional `::' operator. */
12630 global_scope_p
12634 /* Look for the optional nested-name-specifier. The simplest way to
12635 implement:
12637 [temp.res]
12639 The keyword `typename' is not permitted in a base-specifier or
12640 mem-initializer; in these contexts a qualified name that
12641 depends on a template-parameter is implicitly assumed to be a
12642 type name.
12644 is to assume that we have seen the `typename' keyword at this
12645 point. */
12646 nested_name_specifier_p
12655 /* If there is a `::' operator or a nested-name-specifier, then we
12656 are definitely looking for a class-name. */
12661 typename_type,
12665 /* Otherwise, we could also be looking for an ordinary identifier. */
12667 /* Try a class-name. */
12671 none_type,
12675 /* If we found one, we're done. */
12678 /* Otherwise, look for an ordinary identifier. */
12680 }
12682 /* Overloading [gram.over] */
12684 /* Parse an operator-function-id.
12686 operator-function-id:
12687 operator operator
12689 Returns an IDENTIFIER_NODE for the operator which is a
12690 human-readable spelling of the identifier, e.g., `operator +'. */
12692 static tree
12694 {
12695 /* Look for the `operator' keyword. */
12698 /* And then the name of the operator itself. */
12700 }
12702 /* Return an identifier node for a user-defined literal operator.
12703 The suffix identifier is chained to the operator name identifier. */
12705 static tree
12707 {
12708 tree identifier;
12715 }
12717 /* Parse an operator.
12719 operator:
12720 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12721 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12722 || ++ -- , ->* -> () []
12724 GNU Extensions:
12726 operator:
12727 <? >? <?= >?=
12729 Returns an IDENTIFIER_NODE for the operator which is a
12730 human-readable spelling of the identifier, e.g., `operator +'. */
12732 static tree
12734 {
12739 /* Peek at the next token. */
12741 /* Figure out which operator we have. */
12743 {
12745 {
12748 /* The keyword should be either `new' or `delete'. */
12753 else
12756 /* Consume the `new' or `delete' token. */
12759 /* Peek at the next token. */
12761 /* If it's a `[' token then this is the array variant of the
12762 operator. */
12764 {
12765 /* Consume the `[' token. */
12767 /* Look for the `]' token. */
12771 }
12772 /* Otherwise, we have the non-array variant. */
12773 else
12777 }
12924 /* Consume the `('. */
12926 /* Look for the matching `)'. */
12931 /* Consume the `['. */
12933 /* Look for the matching `]'. */
12948 {
12955 /* Consume the string. */
12961 {
12964 }
12965 else
12966 {
12968 /* Look for the suffix identifier. */
12973 {
12977 }
12978 else
12979 {
12982 }
12983 }
12988 {
12991 }
12994 {
12997 }
12999 {
13002 }
13004 }
13007 /* Anything else is an error. */
13009 }
13011 /* If we have selected an identifier, we need to consume the
13012 operator token. */
13015 /* Otherwise, no valid operator name was present. */
13016 else
13017 {
13020 }
13023 }
13025 /* Parse a template-declaration.
13027 template-declaration:
13028 export [opt] template < template-parameter-list > declaration
13030 If MEMBER_P is TRUE, this template-declaration occurs within a
13031 class-specifier.
13033 The grammar rule given by the standard isn't correct. What
13034 is really meant is:
13036 template-declaration:
13037 export [opt] template-parameter-list-seq
13038 decl-specifier-seq [opt] init-declarator [opt] ;
13039 export [opt] template-parameter-list-seq
13040 function-definition
13042 template-parameter-list-seq:
13043 template-parameter-list-seq [opt]
13044 template < template-parameter-list > */
13046 static void
13048 {
13049 /* Check for `export'. */
13051 {
13052 /* Consume the `export' token. */
13054 /* Warn that we do not support `export'. */
13056 }
13059 }
13061 /* Parse a template-parameter-list.
13063 template-parameter-list:
13064 template-parameter
13065 template-parameter-list , template-parameter
13067 Returns a TREE_LIST. Each node represents a template parameter.
13068 The nodes are connected via their TREE_CHAINs. */
13070 static tree
13072 {
13077 /* The loop below parses the template parms. We first need to know
13078 the total number of template parms to be able to compute proper
13079 canonical types of each dependent type. So after the loop, when
13080 we know the total number of template parms,
13081 end_template_parm_list computes the proper canonical types and
13082 fixes up the dependent types accordingly. */
13084 {
13085 tree parameter;
13088 location_t parm_loc;
13090 /* Parse the template-parameter. */
13095 /* Add it to the list. */
13098 parm_loc,
13099 parameter,
13100 is_non_type,
13101 is_parameter_pack);
13102 else
13103 {
13106 }
13108 /* If the next token is not a `,', we're done. */
13111 /* Otherwise, consume the `,' token. */
13113 }
13116 }
13118 /* Parse a template-parameter.
13120 template-parameter:
13121 type-parameter
13122 parameter-declaration
13124 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13125 the parameter. The TREE_PURPOSE is the default value, if any.
13126 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13127 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13128 set to true iff this parameter is a parameter pack. */
13130 static tree
13133 {
13137 tree parm;
13139 /* Assume it is a type parameter or a template parameter. */
13141 /* Assume it not a parameter pack. */
13143 /* Peek at the next token. */
13145 /* If it is `class' or `template', we have a type-parameter. */
13148 /* If it is `class' or `typename' we do not know yet whether it is a
13149 type parameter or a non-type parameter. Consider:
13151 template <typename T, typename T::X X> ...
13153 or:
13155 template <class C, class D*> ...
13157 Here, the first parameter is a type parameter, and the second is
13158 a non-type parameter. We can tell by looking at the token after
13159 the identifier -- if it is a `,', `=', or `>' then we have a type
13160 parameter. */
13162 {
13163 /* Peek at the token after `class' or `typename'. */
13165 /* If it's an ellipsis, we have a template type parameter
13166 pack. */
13169 /* If it's an identifier, skip it. */
13172 /* Now, see if the token looks like the end of a template
13173 parameter. */
13178 }
13180 /* Otherwise, it is a non-type parameter.
13182 [temp.param]
13184 When parsing a default template-argument for a non-type
13185 template-parameter, the first non-nested `>' is taken as the end
13186 of the template parameter-list rather than a greater-than
13187 operator. */
13189 parameter_declarator
13196 /* If the parameter declaration is marked as a parameter pack, set
13197 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13198 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13199 grokdeclarator. */
13202 {
13205 }
13208 {
13209 /* Can happen in some cases of erroneous input (c++/34892). */
13211 /* Consume the `...' for better error recovery. */
13213 }
13214 /* If the next token is an ellipsis, and we don't already have it
13215 marked as a parameter pack, then we have a parameter pack (that
13216 has no declarator). */
13219 && (declarator_can_be_parameter_pack
13221 {
13222 /* Consume the `...'. */
13227 }
13228 /* We might end up with a pack expansion as the type of the non-type
13229 template parameter, in which case this is a non-type template
13230 parameter pack. */
13233 {
13237 }
13240 {
13241 /* Parameter packs cannot have default arguments. However, a
13242 user may try to do so, so we'll parse them and give an
13243 appropriate diagnostic here. */
13247 /* Find the name of the parameter pack. */
13256 else
13260 /* Parse the default argument, but throw away the result. */
13262 }
13272 }
13274 /* Parse a type-parameter.
13276 type-parameter:
13277 class identifier [opt]
13278 class identifier [opt] = type-id
13279 typename identifier [opt]
13280 typename identifier [opt] = type-id
13281 template < template-parameter-list > class identifier [opt]
13282 template < template-parameter-list > class identifier [opt]
13283 = id-expression
13285 GNU Extension (variadic templates):
13287 type-parameter:
13288 class ... identifier [opt]
13289 typename ... identifier [opt]
13291 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13292 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13293 the declaration of the parameter.
13295 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13297 static tree
13299 {
13301 tree parameter;
13303 /* Look for a keyword to tell us what kind of parameter this is. */
13309 {
13312 {
13313 tree identifier;
13314 tree default_argument;
13316 /* If the next token is an ellipsis, we have a template
13317 argument pack. */
13319 {
13320 /* Consume the `...' token. */
13325 }
13327 /* If the next token is an identifier, then it names the
13328 parameter. */
13331 else
13334 /* Create the parameter. */
13337 /* If the next token is an `=', we have a default argument. */
13339 {
13340 /* Consume the `=' token. */
13342 /* Parse the default-argument. */
13346 /* Template parameter packs cannot have default
13347 arguments. */
13349 {
13352 "template parameter pack %qD cannot have a "
13354 else
13356 "template parameter packs cannot have "
13359 }
13361 }
13362 else
13365 /* Create the combined representation of the parameter and the
13366 default argument. */
13368 }
13372 {
13373 tree identifier;
13374 tree default_argument;
13376 /* Look for the `<'. */
13378 /* Parse the template-parameter-list. */
13380 /* Look for the `>'. */
13382 /* Look for the `class' or 'typename' keywords. */
13384 /* If the next token is an ellipsis, we have a template
13385 argument pack. */
13387 {
13388 /* Consume the `...' token. */
13393 }
13394 /* If the next token is an `=', then there is a
13395 default-argument. If the next token is a `>', we are at
13396 the end of the parameter-list. If the next token is a `,',
13397 then we are at the end of this parameter. */
13401 {
13403 /* Treat invalid names as if the parameter were nameless. */
13406 }
13407 else
13410 /* Create the template parameter. */
13412 identifier);
13414 /* If the next token is an `=', then there is a
13415 default-argument. */
13417 {
13420 /* Consume the `='. */
13422 /* Parse the id-expression. */
13424 /* save token before parsing the id-expression, for error
13425 reporting */
13427 default_argument
13435 /* If the id-expression was a template-id that refers to
13436 a template-class, we already have the declaration here,
13437 so no further lookup is needed. */
13438 ;
13439 else
13440 /* Look up the name. */
13441 default_argument
13443 none_type,
13449 /* See if the default argument is valid. */
13450 default_argument
13453 /* Template parameter packs cannot have default
13454 arguments. */
13456 {
13459 "template parameter pack %qD cannot "
13461 identifier);
13462 else
13466 }
13468 }
13469 else
13472 /* Create the combined representation of the parameter and the
13473 default argument. */
13475 }
13481 }
13484 }
13486 /* Parse a template-id.
13488 template-id:
13489 template-name < template-argument-list [opt] >
13491 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13492 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13493 returned. Otherwise, if the template-name names a function, or set
13494 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13495 names a class, returns a TYPE_DECL for the specialization.
13497 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13498 uninstantiated templates. */
13500 static tree
13506 {
13508 tree templ;
13509 tree arguments;
13510 tree template_id;
13517 /* If the next token corresponds to a template-id, there is no need
13518 to reparse it. */
13521 {
13524 /* Get the stored value. */
13526 /* Perform any access checks that were deferred. */
13529 {
13534 tf_warning_or_error);
13535 }
13536 /* Return the stored value. */
13538 }
13540 /* Avoid performing name lookup if there is no possibility of
13541 finding a template-id. */
13544 && !cp_parser_nth_token_starts_template_argument_list_p
13546 {
13549 }
13551 /* Remember where the template-id starts. */
13557 /* Parse the template-name. */
13560 check_dependency_p,
13561 is_declaration,
13562 tag_type,
13565 {
13568 }
13570 /* If we find the sequence `[:' after a template-name, it's probably
13571 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13572 parse correctly the argument list. */
13579 {
13581 /* Change `:' into `::'. */
13583 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13584 CPP_LESS. */
13587 /* Parse the arguments. */
13590 {
13591 /* If we couldn't parse an argument list, then we revert our changes
13592 and return simply an error. Maybe this is not a template-id
13593 after all. */
13598 }
13599 /* Otherwise, emit an error about the invalid digraph, but continue
13600 parsing because we got our argument list. */
13603 {
13606 "%<<:%> is an alternate spelling for %<[%>."
13609 {
13611 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13614 }
13615 }
13616 }
13617 else
13618 {
13619 /* Look for the `<' that starts the template-argument-list. */
13621 {
13624 }
13625 /* Parse the arguments. */
13627 }
13629 /* Build a representation of the specialization. */
13632 TEMPLATE_ID_EXPR,
13636 {
13638 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13639 template (rather than some instantiation thereof) only if
13640 is not nested within some other construct. For example, in
13641 "template <typename T> void f(T) { A<T>::", A<T> is just an
13642 instantiation of A. */
13645 CPP_SCOPE));
13646 template_id
13648 }
13649 else
13650 {
13651 /* If it's not a class-template or a template-template, it should be
13652 a function-template. */
13658 }
13660 /* If parsing tentatively, replace the sequence of tokens that makes
13661 up the template-id with a CPP_TEMPLATE_ID token. That way,
13662 should we re-parse the token stream, we will not have to repeat
13663 the effort required to do the parse, nor will we issue duplicate
13664 error messages about problems during instantiation of the
13665 template. */
13667 /* Don't do this if we had a parse error in a declarator; re-parsing
13668 might succeed if a name changes meaning (60361). */
13672 {
13675 /* Reset the contents of the START_OF_ID token. */
13677 /* Retrieve any deferred checks. Do not pop this access checks yet
13678 so the memory will not be reclaimed during token replacing below. */
13684 /* Purge all subsequent tokens. */
13687 /* ??? Can we actually assume that, if template_id ==
13688 error_mark_node, we will have issued a diagnostic to the
13689 user, as opposed to simply marking the tentative parse as
13690 failed? */
13693 }
13697 }
13699 /* Parse a template-name.
13701 template-name:
13702 identifier
13704 The standard should actually say:
13706 template-name:
13707 identifier
13708 operator-function-id
13710 A defect report has been filed about this issue.
13712 A conversion-function-id cannot be a template name because they cannot
13713 be part of a template-id. In fact, looking at this code:
13715 a.operator K<int>()
13717 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13718 It is impossible to call a templated conversion-function-id with an
13719 explicit argument list, since the only allowed template parameter is
13720 the type to which it is converting.
13722 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13723 `template' keyword, in a construction like:
13725 T::template f<3>()
13727 In that case `f' is taken to be a template-name, even though there
13728 is no way of knowing for sure.
13730 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13731 name refers to a set of overloaded functions, at least one of which
13732 is a template, or an IDENTIFIER_NODE with the name of the template,
13733 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13734 names are looked up inside uninstantiated templates. */
13736 static tree
13743 {
13744 tree identifier;
13745 tree decl;
13746 tree fns;
13749 /* If the next token is `operator', then we have either an
13750 operator-function-id or a conversion-function-id. */
13752 {
13753 /* We don't know whether we're looking at an
13754 operator-function-id or a conversion-function-id. */
13756 /* Try an operator-function-id. */
13758 /* If that didn't work, try a conversion-function-id. */
13760 {
13763 }
13764 }
13765 /* Look for the identifier. */
13766 else
13769 /* If we didn't find an identifier, we don't have a template-id. */
13773 /* If the name immediately followed the `template' keyword, then it
13774 is a template-name. However, if the next token is not `<', then
13775 we do not treat it as a template-name, since it is not being used
13776 as part of a template-id. This enables us to handle constructs
13777 like:
13779 template <typename T> struct S { S(); };
13780 template <typename T> S<T>::S();
13782 correctly. We would treat `S' as a template -- if it were `S<T>'
13783 -- but we do not if there is no `<'. */
13787 {
13788 /* In a declaration, in a dependent context, we pretend that the
13789 "template" keyword was present in order to improve error
13790 recovery. For example, given:
13792 template <typename T> void f(T::X<int>);
13794 we want to treat "X<int>" as a template-id. */
13796 && !template_keyword_p
13798 && check_dependency_p
13800 /* Do not do this for dtors (or ctors), since they never
13801 need the template keyword before their name. */
13803 {
13806 /* Explain what went wrong. */
13808 identifier);
13811 /* If parsing tentatively, find the location of the "<" token. */
13814 /* Parse the template arguments so that we can issue error
13815 messages about them. */
13818 /* Skip tokens until we find a good place from which to
13819 continue parsing. */
13824 /* If parsing tentatively, permanently remove the
13825 template argument list. That will prevent duplicate
13826 error messages from being issued about the missing
13827 "template" keyword. */
13833 }
13835 /* If the "template" keyword is present, then there is generally
13836 no point in doing name-lookup, so we just return IDENTIFIER.
13837 But, if the qualifying scope is non-dependent then we can
13838 (and must) do name-lookup normally. */
13844 }
13846 /* Look up the name. */
13848 tag_type,
13851 check_dependency_p,
13855 /* If DECL is a template, then the name was a template-name. */
13857 ;
13858 else
13859 {
13862 /* The standard does not explicitly indicate whether a name that
13863 names a set of overloaded declarations, some of which are
13864 templates, is a template-name. However, such a name should
13865 be a template-name; otherwise, there is no way to form a
13866 template-id for the overloaded templates. */
13874 {
13875 /* The name does not name a template. */
13878 }
13879 }
13881 /* If DECL is dependent, and refers to a function, then just return
13882 its name; we will look it up again during template instantiation. */
13884 {
13888 }
13891 }
13893 /* Parse a template-argument-list.
13895 template-argument-list:
13896 template-argument ... [opt]
13897 template-argument-list , template-argument ... [opt]
13899 Returns a TREE_VEC containing the arguments. */
13901 static tree
13903 {
13908 tree vec;
13915 /* Even if the template-id appears in an integral
13916 constant-expression, the contents of the argument list do
13917 not. */
13923 /* Parse the arguments. */
13924 do
13925 {
13926 tree argument;
13929 /* Consume the comma. */
13932 /* Parse the template-argument. */
13935 /* If the next token is an ellipsis, we're expanding a template
13936 argument pack. */
13938 {
13940 {
13944 }
13945 /* Consume the `...' token. */
13948 /* Make the argument into a TYPE_PACK_EXPANSION or
13949 EXPR_PACK_EXPANSION. */
13951 }
13954 {
13958 {
13961 }
13962 else
13964 }
13966 }
13979 #ifdef ENABLE_CHECKING
13981 #endif
13983 }
13985 /* Parse a template-argument.
13987 template-argument:
13988 assignment-expression
13989 type-id
13990 id-expression
13992 The representation is that of an assignment-expression, type-id, or
13993 id-expression -- except that the qualified id-expression is
13994 evaluated, so that the value returned is either a DECL or an
13995 OVERLOAD.
13997 Although the standard says "assignment-expression", it forbids
13998 throw-expressions or assignments in the template argument.
13999 Therefore, we use "conditional-expression" instead. */
14001 static tree
14003 {
14004 tree argument;
14010 cp_id_kind idk;
14012 /* There's really no way to know what we're looking at, so we just
14013 try each alternative in order.
14015 [temp.arg]
14017 In a template-argument, an ambiguity between a type-id and an
14018 expression is resolved to a type-id, regardless of the form of
14019 the corresponding template-parameter.
14021 Therefore, we try a type-id first. */
14024 /* If there was no error parsing the type-id but the next token is a
14025 '>>', our behavior depends on which dialect of C++ we're
14026 parsing. In C++98, we probably found a typo for '> >'. But there
14027 are type-id which are also valid expressions. For instance:
14029 struct X { int operator >> (int); };
14030 template <int V> struct Foo {};
14031 Foo<X () >> 5> r;
14033 Here 'X()' is a valid type-id of a function type, but the user just
14034 wanted to write the expression "X() >> 5". Thus, we remember that we
14035 found a valid type-id, but we still try to parse the argument as an
14036 expression to see what happens.
14038 In C++0x, the '>>' will be considered two separate '>'
14039 tokens. */
14043 {
14046 }
14047 else
14048 {
14049 /* If the next token isn't a `,' or a `>', then this argument wasn't
14050 really finished. This means that the argument is not a valid
14051 type-id. */
14054 /* If that worked, we're done. */
14057 }
14058 /* We're still not sure what the argument will be. */
14060 /* Try a template. */
14068 /* If the next token isn't a `,' or a `>', then this argument wasn't
14069 really finished. */
14073 {
14074 /* Figure out what is being referred to. If the id-expression
14075 was for a class template specialization, then we will have a
14076 TYPE_DECL at this point. There is no need to do name lookup
14077 at this point in that case. */
14080 none_type,
14089 }
14092 /* It must be a non-type argument. There permitted cases are given
14093 in [temp.arg.nontype]:
14095 -- an integral constant-expression of integral or enumeration
14096 type; or
14098 -- the name of a non-type template-parameter; or
14100 -- the name of an object or function with external linkage...
14102 -- the address of an object or function with external linkage...
14104 -- a pointer to member... */
14105 /* Look for a non-type template parameter. */
14107 {
14119 }
14121 /* If the next token is "&", the argument must be the address of an
14122 object or function with external linkage. */
14125 {
14128 }
14129 /* See if we might have an id-expression. */
14136 {
14139 address_p,
14146 else
14147 {
14148 tree probe;
14151 {
14152 /* Strip the dereference temporarily. */
14155 }
14157 /* If we're in a template, we represent a qualified-id referring
14158 to a static data member as a SCOPE_REF even if the scope isn't
14159 dependent so that we can check access control later. */
14164 {
14165 /* A variable without external linkage might still be a
14166 valid constant-expression, so no error is issued here
14167 if the external-linkage check fails. */
14170 }
14172 /* All overloaded functions are allowed; if the external
14173 linkage test does not pass, an error will be issued
14174 later. */
14175 ;
14179 /* A pointer-to-member. */
14180 ;
14182 ;
14183 else
14187 {
14190 tf_warning_or_error);
14191 else
14194 }
14195 }
14196 }
14197 /* If the argument started with "&", there are no other valid
14198 alternatives at this point. */
14200 {
14203 }
14205 /* If the argument wasn't successfully parsed as a type-id followed
14206 by '>>', the argument can only be a constant expression now.
14207 Otherwise, we try parsing the constant-expression tentatively,
14208 because the argument could really be a type-id. */
14220 /* We did our best to parse the argument as a non type-id, but that
14221 was the only alternative that matched (albeit with a '>' after
14222 it). We can assume it's just a typo from the user, and a
14223 diagnostic will then be issued. */
14225 }
14227 /* Parse an explicit-instantiation.
14229 explicit-instantiation:
14230 template declaration
14232 Although the standard says `declaration', what it really means is:
14234 explicit-instantiation:
14235 template decl-specifier-seq [opt] declarator [opt] ;
14237 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14238 supposed to be allowed. A defect report has been filed about this
14239 issue.
14241 GNU Extension:
14243 explicit-instantiation:
14244 storage-class-specifier template
14245 decl-specifier-seq [opt] declarator [opt] ;
14246 function-specifier template
14247 decl-specifier-seq [opt] declarator [opt] ; */
14249 static void
14251 {
14253 cp_decl_specifier_seq decl_specifiers;
14258 /* Look for an (optional) storage-class-specifier or
14259 function-specifier. */
14261 {
14262 extension_specifier
14265 extension_specifier
14268 }
14270 /* Look for the `template' keyword. */
14272 /* Let the front end know that we are processing an explicit
14273 instantiation. */
14275 /* [temp.explicit] says that we are supposed to ignore access
14276 control while processing explicit instantiation directives. */
14278 /* Parse a decl-specifier-seq. */
14280 CP_PARSER_FLAGS_OPTIONAL,
14283 /* If there was exactly one decl-specifier, and it declared a class,
14284 and there's no declarator, then we have an explicit type
14285 instantiation. */
14287 {
14288 tree type;
14292 /* Turn access control back on for names used during
14293 template instantiation. */
14298 }
14299 else
14300 {
14302 tree decl;
14304 /* Parse the declarator. */
14305 declarator
14316 {
14319 "explicit instantiation shall not use"
14323 "explicit instantiation shall not use"
14328 /* Turn access control back on for names used during
14329 template instantiation. */
14331 /* Do the explicit instantiation. */
14333 }
14334 else
14335 {
14337 /* Skip the body of the explicit instantiation. */
14339 }
14340 }
14341 /* We're done with the instantiation. */
14347 }
14349 /* Parse an explicit-specialization.
14351 explicit-specialization:
14352 template < > declaration
14354 Although the standard says `declaration', what it really means is:
14356 explicit-specialization:
14357 template <> decl-specifier [opt] init-declarator [opt] ;
14358 template <> function-definition
14359 template <> explicit-specialization
14360 template <> template-declaration */
14362 static void
14364 {
14368 /* Look for the `template' keyword. */
14370 /* Look for the `<'. */
14372 /* Look for the `>'. */
14374 /* We have processed another parameter list. */
14376 /* [temp]
14378 A template ... explicit specialization ... shall not have C
14379 linkage. */
14381 {
14383 /* Give it C++ linkage to avoid confusing other parts of the
14384 front end. */
14387 }
14388 else
14390 /* Let the front end know that we are beginning a specialization. */
14392 {
14395 }
14397 /* If the next keyword is `template', we need to figure out whether
14398 or not we're looking a template-declaration. */
14400 {
14405 else
14407 }
14408 else
14409 /* Parse the dependent declaration. */
14415 /* We're done with the specialization. */
14417 /* For the erroneous case of a template with C linkage, we pushed an
14418 implicit C++ linkage scope; exit that scope now. */
14421 /* We're done with this parameter list. */
14423 }
14425 /* Parse a type-specifier.
14427 type-specifier:
14428 simple-type-specifier
14429 class-specifier
14430 enum-specifier
14431 elaborated-type-specifier
14432 cv-qualifier
14434 GNU Extension:
14436 type-specifier:
14437 __complex__
14439 Returns a representation of the type-specifier. For a
14440 class-specifier, enum-specifier, or elaborated-type-specifier, a
14441 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14443 The parser flags FLAGS is used to control type-specifier parsing.
14445 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14446 in a decl-specifier-seq.
14448 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14449 class-specifier, enum-specifier, or elaborated-type-specifier, then
14450 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14451 if a type is declared; 2 if it is defined. Otherwise, it is set to
14452 zero.
14454 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14455 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14456 is set to FALSE. */
14458 static tree
14460 cp_parser_flags flags,
14465 {
14471 /* Assume this type-specifier does not declare a new type. */
14474 /* And that it does not specify a cv-qualifier. */
14477 /* Peek at the next token. */
14480 /* If we're looking at a keyword, we can use that to guide the
14481 production we choose. */
14484 {
14489 /* Look for the enum-specifier. */
14491 /* If that worked, we're done. */
14493 {
14498 type_spec,
14499 token,
14502 }
14503 else
14506 /* Any of these indicate either a class-specifier, or an
14507 elaborated-type-specifier. */
14514 /* Parse tentatively so that we can back up if we don't find a
14515 class-specifier. */
14517 /* Look for the class-specifier. */
14520 /* If that worked, we're done. */
14522 {
14527 type_spec,
14528 token,
14531 }
14533 /* Fall through. */
14534 elaborated_type_specifier:
14535 /* We're declaring (not defining) a class or enum. */
14539 /* Fall through. */
14541 /* Look for an elaborated-type-specifier. */
14542 type_spec
14543 = (cp_parser_elaborated_type_specifier
14546 is_declaration));
14549 type_spec,
14550 token,
14573 /* The `__complex__' keyword is a GNU extension. */
14579 }
14581 /* Handle simple keywords. */
14583 {
14585 {
14588 }
14590 }
14592 /* If we do not already have a type-specifier, assume we are looking
14593 at a simple-type-specifier. */
14595 decl_specs,
14596 flags);
14598 /* If we didn't find a type-specifier, and a type-specifier was not
14599 optional in this context, issue an error message. */
14601 {
14604 }
14607 }
14609 /* Parse a simple-type-specifier.
14611 simple-type-specifier:
14612 :: [opt] nested-name-specifier [opt] type-name
14613 :: [opt] nested-name-specifier template template-id
14614 char
14615 wchar_t
14616 bool
14617 short
14618 int
14619 long
14620 signed
14621 unsigned
14622 float
14623 double
14624 void
14626 C++0x Extension:
14628 simple-type-specifier:
14629 auto
14630 decltype ( expression )
14631 char16_t
14632 char32_t
14633 __underlying_type ( type-id )
14635 GNU Extension:
14637 simple-type-specifier:
14638 __int128
14639 __typeof__ unary-expression
14640 __typeof__ ( type-id )
14641 __typeof__ ( type-id ) { initializer-list , [opt] }
14643 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14644 appropriately updated. */
14646 static tree
14649 cp_parser_flags flags)
14650 {
14654 /* Peek at the next token. */
14657 /* If we're looking at a keyword, things are easy. */
14659 {
14719 {
14723 {
14726 "use of %<auto%> in lambda parameter declaration "
14727 "only available with "
14729 }
14732 "use of %<auto%> in parameter declaration "
14733 "only available with "
14735 else
14737 "ISO C++ forbids use of %<auto%> in parameter "
14739 }
14740 else
14745 /* Since DR 743, decltype can either be a simple-type-specifier by
14746 itself or begin a nested-name-specifier. Parsing it will replace
14747 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14748 handling below decide what to do. */
14754 /* Consume the `typeof' token. */
14756 /* Parse the operand to `typeof'. */
14758 /* If it is not already a TYPE, take its type. */
14764 token,
14773 token,
14783 token,
14788 }
14790 /* If token is an already-parsed decltype not followed by ::,
14791 it's a simple-type-specifier. */
14794 {
14798 token,
14802 }
14804 /* If the type-specifier was for a built-in type, we're done. */
14806 {
14807 /* Record the type. */
14814 type,
14815 token,
14820 /* Consume the token. */
14823 /* There is no valid C++ program where a non-template type is
14824 followed by a "<". That usually indicates that the user thought
14825 that the type was a template. */
14830 }
14832 /* The type-specifier must be a user-defined type. */
14834 {
14838 /* Don't gobble tokens or issue error messages if this is an
14839 optional type-specifier. */
14843 /* Look for the optional `::' operator. */
14844 global_p
14848 /* Look for the nested-name specifier. */
14849 qualified_p
14857 /* If we have seen a nested-name-specifier, and the next token
14858 is `template', then we are using the template-id production. */
14861 {
14862 /* Look for the template-id. */
14866 none_type,
14868 /* If the template-id did not name a type, we are out of
14869 luck. */
14871 {
14874 }
14875 }
14876 /* Otherwise, look for a type-name. */
14877 else
14879 /* Keep track of all name-lookups performed in class scopes. */
14881 && !global_p
14882 && !qualified_p
14886 /* If it didn't work out, we don't have a TYPE. */
14892 token,
14894 }
14896 /* If we didn't get a type-name, issue an error message. */
14898 {
14901 }
14904 {
14905 /* See if TYPE is an Objective-C type, and if so, parse and
14906 accept any protocol references following it. Do this before
14907 the cp_parser_check_for_invalid_template_id() call, because
14908 Objective-C types can be followed by '<...>' which would
14909 enclose protocol names rather than template arguments, and so
14910 everything is fine. */
14913 {
14917 /* Clobber the "unqualified" type previously entered into
14918 DECL_SPECS with the new, improved protocol-qualified version. */
14923 }
14925 /* There is no valid C++ program where a non-template type is
14926 followed by a "<". That usually indicates that the user
14927 thought that the type was a template. */
14929 none_type,
14931 }
14934 }
14936 /* Parse a type-name.
14938 type-name:
14939 class-name
14940 enum-name
14941 typedef-name
14942 simple-template-id [in c++0x]
14944 enum-name:
14945 identifier
14947 typedef-name:
14948 identifier
14950 Returns a TYPE_DECL for the type. */
14952 static tree
14954 {
14955 tree type_decl;
14957 /* We can't know yet whether it is a class-name or not. */
14959 /* Try a class-name. */
14963 none_type,
14967 /* If it's not a class-name, keep looking. */
14969 {
14971 /* It must be a typedef-name or an enum-name. */
14975 /* It is either a simple-template-id representing an
14976 instantiation of an alias template... */
14980 none_type,
14982 /* Note that this must be an instantiation of an alias template
14983 because [temp.names]/6 says:
14985 A template-id that names an alias template specialization
14986 is a type-name.
14988 Whereas [temp.names]/7 says:
14990 A simple-template-id that names a class template
14991 specialization is a class-name. */
14996 else
15000 /* ... Or a typedef-name or an enum-name. */
15002 }
15005 }
15007 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15009 enum-name:
15010 identifier
15012 typedef-name:
15013 identifier
15015 Returns a TYPE_DECL for the type. */
15017 static tree
15019 {
15020 tree type_decl;
15021 tree identifier;
15028 /* Look up the type-name. */
15035 {
15036 /* See if this is an Objective-C type. */
15041 }
15043 /* Issue an error if we did not find a type-name. */
15045 /* In Objective-C, we have the complication that class names are
15046 normally type names and start declarations (eg, the
15047 "NSObject" in "NSObject *object;"), but can be used in an
15048 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15049 is an expression. So, a classname followed by a dot is not a
15050 valid type-name. */
15053 {
15058 }
15059 /* Remember that the name was used in the definition of the
15060 current class so that we can check later to see if the
15061 meaning would have been different after the class was
15062 entirely defined. */
15068 }
15070 /* Parse an elaborated-type-specifier. Note that the grammar given
15071 here incorporates the resolution to DR68.
15073 elaborated-type-specifier:
15074 class-key :: [opt] nested-name-specifier [opt] identifier
15075 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15076 enum-key :: [opt] nested-name-specifier [opt] identifier
15077 typename :: [opt] nested-name-specifier identifier
15078 typename :: [opt] nested-name-specifier template [opt]
15079 template-id
15081 GNU extension:
15083 elaborated-type-specifier:
15084 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15085 class-key attributes :: [opt] nested-name-specifier [opt]
15086 template [opt] template-id
15087 enum attributes :: [opt] nested-name-specifier [opt] identifier
15089 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15090 declared `friend'. If IS_DECLARATION is TRUE, then this
15091 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15092 something is being declared.
15094 Returns the TYPE specified. */
15096 static tree
15100 {
15102 tree identifier;
15105 tree globalscope;
15108 /* See if we're looking at the `enum' keyword. */
15110 {
15111 /* Consume the `enum' token. */
15113 /* Remember that it's an enumeration type. */
15115 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15116 enums) is used here. */
15119 {
15123 /* Consume the `struct' or `class' and parse it anyway. */
15125 }
15126 /* Parse the attributes. */
15128 }
15129 /* Or, it might be `typename'. */
15131 RID_TYPENAME))
15132 {
15133 /* Consume the `typename' token. */
15135 /* Remember that it's a `typename' type. */
15137 }
15138 /* Otherwise it must be a class-key. */
15139 else
15140 {
15144 /* Parse the attributes. */
15146 }
15148 /* Look for the `::' operator. */
15151 /* Look for the nested-name-specifier. */
15153 {
15158 is_declaration))
15160 }
15161 else
15162 /* Even though `typename' is not present, the proposed resolution
15163 to Core Issue 180 says that in `class A<T>::B', `B' should be
15164 considered a type-name, even if `A<T>' is dependent. */
15169 is_declaration);
15170 /* For everything but enumeration types, consider a template-id.
15171 For an enumeration type, consider only a plain identifier. */
15173 {
15175 tree decl;
15177 /* Allow the `template' keyword. */
15179 /* If we didn't see `template', we don't know if there's a
15180 template-id or not. */
15183 /* Parse the template-id. */
15187 tag_type,
15188 is_declaration);
15189 /* If we didn't find a template-id, look for an ordinary
15190 identifier. */
15192 ;
15193 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15194 in effect, then we must assume that, upon instantiation, the
15195 template will correspond to a class. */
15199 typename_type,
15201 /* If the `typename' keyword is in effect and DECL is not a type
15202 decl, then type is non existent. */
15204 ;
15210 }
15213 {
15218 {
15221 }
15223 /* For a `typename', we needn't call xref_tag. */
15227 identifier,
15230 /* Template parameter lists apply only if we are not within a
15231 function parameter list. */
15232 bool template_parm_lists_apply
15241 /* Look up a qualified name in the usual way. */
15243 {
15244 tree decl;
15245 tree ambiguous_decls;
15248 tag_type,
15255 /* If the lookup was ambiguous, an error will already have been
15256 issued. */
15260 /* If we are parsing friend declaration, DECL may be a
15261 TEMPLATE_DECL tree node here. However, we need to check
15262 whether this TEMPLATE_DECL results in valid code. Consider
15263 the following example:
15265 namespace N {
15266 template <class T> class C {};
15267 }
15268 class X {
15269 template <class T> friend class N::C; // #1, valid code
15270 };
15271 template <class T> class Y {
15272 friend class N::C; // #2, invalid code
15273 };
15275 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15276 name lookup of `N::C'. We see that friend declaration must
15277 be template for the code to be valid. Note that
15278 processing_template_decl does not work here since it is
15279 always 1 for the above two cases. */
15281 decl = (cp_parser_maybe_treat_template_as_class
15286 {
15289 identifier,
15292 }
15295 {
15299 allow_template);
15303 }
15305 /* Forward declarations of nested types, such as
15307 class C1::C2;
15308 class C1::C2::C3;
15310 are invalid unless all components preceding the final '::'
15311 are complete. If all enclosing types are complete, these
15312 declarations become merely pointless.
15314 Invalid forward declarations of nested types are errors
15315 caught elsewhere in parsing. Those that are pointless arrive
15316 here. */
15323 }
15324 else
15325 {
15326 /* An elaborated-type-specifier sometimes introduces a new type and
15327 sometimes names an existing type. Normally, the rule is that it
15328 introduces a new type only if there is not an existing type of
15329 the same name already in scope. For example, given:
15331 struct S {};
15332 void f() { struct S s; }
15334 the `struct S' in the body of `f' is the same `struct S' as in
15335 the global scope; the existing definition is used. However, if
15336 there were no global declaration, this would introduce a new
15337 local class named `S'.
15339 An exception to this rule applies to the following code:
15341 namespace N { struct S; }
15343 Here, the elaborated-type-specifier names a new type
15344 unconditionally; even if there is already an `S' in the
15345 containing scope this declaration names a new type.
15346 This exception only applies if the elaborated-type-specifier
15347 forms the complete declaration:
15349 [class.name]
15351 A declaration consisting solely of `class-key identifier ;' is
15352 either a redeclaration of the name in the current scope or a
15353 forward declaration of the identifier as a class name. It
15354 introduces the name into the current scope.
15356 We are in this situation precisely when the next token is a `;'.
15358 An exception to the exception is that a `friend' declaration does
15359 *not* name a new type; i.e., given:
15361 struct S { friend struct T; };
15363 `T' is not a new type in the scope of `S'.
15365 Also, `new struct S' or `sizeof (struct S)' never results in the
15366 definition of a new type; a new type can only be declared in a
15367 declaration context. */
15369 tag_scope ts;
15373 /* Friends have special name lookup rules. */
15377 CPP_SEMICOLON))
15378 /* This is a `class-key identifier ;' */
15380 else
15383 template_p =
15384 (template_parm_lists_apply
15387 /* An unqualified name was used to reference this type, so
15388 there were no qualifying templates. */
15396 }
15397 }
15402 /* Allow attributes on forward declarations of classes. */
15404 {
15414 else
15417 }
15420 {
15421 /* Indicate whether this class was declared as a `class' or as a
15422 `struct'. */
15426 }
15428 /* A "<" cannot follow an elaborated type specifier. If that
15429 happens, the user was probably trying to form a template-id. */
15434 }
15436 /* Parse an enum-specifier.
15438 enum-specifier:
15439 enum-head { enumerator-list [opt] }
15440 enum-head { enumerator-list , } [C++0x]
15442 enum-head:
15443 enum-key identifier [opt] enum-base [opt]
15444 enum-key nested-name-specifier identifier enum-base [opt]
15446 enum-key:
15447 enum
15448 enum class [C++0x]
15449 enum struct [C++0x]
15451 enum-base: [C++0x]
15452 : type-specifier-seq
15454 opaque-enum-specifier:
15455 enum-key identifier enum-base [opt] ;
15457 GNU Extensions:
15458 enum-key attributes[opt] identifier [opt] enum-base [opt]
15459 { enumerator-list [opt] }attributes[opt]
15460 enum-key attributes[opt] identifier [opt] enum-base [opt]
15461 { enumerator-list, }attributes[opt] [C++0x]
15463 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15464 if the token stream isn't an enum-specifier after all. */
15466 static tree
15468 {
15469 tree identifier;
15471 tree prev_scope;
15473 tree attributes;
15486 /* Parse tentatively so that we can back up if we don't find a
15487 enum-specifier. */
15490 /* Caller guarantees that the current token is 'enum', an identifier
15491 possibly follows, and the token after that is an opening brace.
15492 If we don't have an identifier, fabricate an anonymous name for
15493 the enumeration being defined. */
15496 /* Parse the "class" or "struct", which indicates a scoped
15497 enumeration type in C++0x. */
15500 {
15504 /* Consume the `struct' or `class' token. */
15508 }
15512 /* Clear the qualification. */
15517 /* Figure out in what scope the declaration is being placed. */
15523 nested_name_specifier
15531 {
15532 tree name;
15536 enum_type,
15541 input_location);
15543 {
15546 {
15547 /* Are template enums allowed in ISO? */
15551 /* ignore a typename reference, for it will be solved by name
15552 in start_enum. */
15554 }
15555 }
15558 else
15561 }
15562 else
15563 {
15566 else
15567 {
15573 }
15574 }
15577 /* Check for the `:' that denotes a specified underlying type in C++0x.
15578 Note that a ':' could also indicate a bitfield width, however. */
15580 {
15581 cp_decl_specifier_seq type_specifiers;
15583 /* Consume the `:'. */
15586 /* Parse the type-specifier-seq. */
15591 /* At this point this is surely not elaborated type specifier. */
15600 /* If that didn't work, stop. */
15602 {
15608 }
15609 }
15611 /* Look for the `{' but don't consume it yet. */
15613 {
15615 {
15618 {
15621 }
15622 }
15623 /* An opaque-enum-specifier must have a ';' here. */
15626 {
15629 {
15632 }
15633 }
15634 }
15640 {
15642 {
15646 }
15648 {
15650 }
15651 }
15653 /* Issue an error message if type-definitions are forbidden here. */
15656 else
15657 /* Create the new type. We do this before consuming the opening
15658 brace so the enum will be recorded as being on the line of its
15659 tag (or the 'enum' keyword, if there is no tag). */
15663 /* If the next token is not '{' it is an opaque-enum-specifier or an
15664 elaborated-type-specifier. */
15666 {
15670 {
15671 /* The following catches invalid code such as:
15672 enum class S<int>::E { A, B, C }; */
15680 {
15684 nested_name_specifier);
15686 }
15687 /* If that scope does not contain the scope in which the
15688 class was originally declared, the program is invalid. */
15690 nested_name_specifier))
15691 {
15694 "declaration of %qD in namespace %qD which does not "
15697 else
15699 "declaration of %qD in %qD which does not "
15703 }
15704 }
15709 /* Consume the opening brace. */
15716 {
15720 }
15721 else
15722 {
15728 }
15732 /* If the next token is not '}', then there are some enumerators. */
15734 {
15738 }
15739 else
15742 /* Consume the final '}'. */
15748 }
15749 else
15750 {
15751 /* If a ';' follows, then it is an opaque-enum-specifier
15752 and additional restrictions apply. */
15754 {
15761 }
15762 }
15764 /* Look for trailing attributes to apply to this enumeration, and
15765 apply them if appropriate. */
15767 {
15771 trailing_attr,
15773 }
15775 /* Finish up the enumeration. */
15777 {
15782 }
15785 {
15787 {
15790 }
15792 {
15794 }
15795 }
15796 out:
15799 }
15801 /* Parse an enumerator-list. The enumerators all have the indicated
15802 TYPE.
15804 enumerator-list:
15805 enumerator-definition
15806 enumerator-list , enumerator-definition */
15808 static void
15810 {
15812 {
15813 /* Parse an enumerator-definition. */
15816 /* If the next token is not a ',', we've reached the end of
15817 the list. */
15820 /* Otherwise, consume the `,' and keep going. */
15822 /* If the next token is a `}', there is a trailing comma. */
15824 {
15829 }
15830 }
15831 }
15833 /* Parse an enumerator-definition. The enumerator has the indicated
15834 TYPE.
15836 enumerator-definition:
15837 enumerator
15838 enumerator = constant-expression
15840 enumerator:
15841 identifier */
15843 static void
15845 {
15846 tree identifier;
15847 tree value;
15848 location_t loc;
15850 /* Save the input location because we are interested in the location
15851 of the identifier and not the location of the explicit value. */
15854 /* Look for the identifier. */
15859 /* If the next token is an '=', then there is an explicit value. */
15861 {
15862 /* Consume the `=' token. */
15864 /* Parse the value. */
15867 NULL);
15868 }
15869 else
15872 /* If we are processing a template, make sure the initializer of the
15873 enumerator doesn't contain any bare template parameter pack. */
15877 /* integral_constant_value will pull out this expression, so make sure
15878 it's folded as appropriate. */
15881 /* Create the enumerator. */
15883 }
15885 /* Parse a namespace-name.
15887 namespace-name:
15888 original-namespace-name
15889 namespace-alias
15891 Returns the NAMESPACE_DECL for the namespace. */
15893 static tree
15895 {
15896 tree identifier;
15897 tree namespace_decl;
15901 /* Get the name of the namespace. */
15906 /* Look up the identifier in the currently active scope. Look only
15907 for namespaces, due to:
15909 [basic.lookup.udir]
15911 When looking up a namespace-name in a using-directive or alias
15912 definition, only namespace names are considered.
15914 And:
15916 [basic.lookup.qual]
15918 During the lookup of a name preceding the :: scope resolution
15919 operator, object, function, and enumerator names are ignored.
15921 (Note that cp_parser_qualifying_entity only calls this
15922 function if the token after the name is the scope resolution
15923 operator.) */
15925 none_type,
15931 /* If it's not a namespace, issue an error. */
15934 {
15939 }
15942 }
15944 /* Parse a namespace-definition.
15946 namespace-definition:
15947 named-namespace-definition
15948 unnamed-namespace-definition
15950 named-namespace-definition:
15951 original-namespace-definition
15952 extension-namespace-definition
15954 original-namespace-definition:
15955 namespace identifier { namespace-body }
15957 extension-namespace-definition:
15958 namespace original-namespace-name { namespace-body }
15960 unnamed-namespace-definition:
15961 namespace { namespace-body } */
15963 static void
15965 {
15972 {
15976 }
15977 else
15980 /* Look for the `namespace' keyword. */
15983 /* Get the name of the namespace. We do not attempt to distinguish
15984 between an original-namespace-definition and an
15985 extension-namespace-definition at this point. The semantic
15986 analysis routines are responsible for that. */
15989 else
15992 /* Parse any specified attributes. */
15995 /* Look for the `{' to start the namespace. */
15997 /* Start the namespace. */
16000 /* "inline namespace" is equivalent to a stub namespace definition
16001 followed by a strong using directive. */
16003 {
16005 /* Set up namespace association. */
16009 /* Import the contents of the inline namespace. */
16013 }
16017 /* Parse the body of the namespace. */
16023 /* Finish the namespace. */
16025 /* Look for the final `}'. */
16027 }
16029 /* Parse a namespace-body.
16031 namespace-body:
16032 declaration-seq [opt] */
16034 static void
16036 {
16038 }
16040 /* Parse a namespace-alias-definition.
16042 namespace-alias-definition:
16043 namespace identifier = qualified-namespace-specifier ; */
16045 static void
16047 {
16048 tree identifier;
16049 tree namespace_specifier;
16053 /* Look for the `namespace' keyword. */
16055 /* Look for the identifier. */
16059 /* Look for the `=' token. */
16062 {
16064 /* Skip the definition. */
16069 }
16071 /* Look for the qualified-namespace-specifier. */
16072 namespace_specifier
16074 /* Look for the `;' token. */
16077 /* Register the alias in the symbol table. */
16079 }
16081 /* Parse a qualified-namespace-specifier.
16083 qualified-namespace-specifier:
16084 :: [opt] nested-name-specifier [opt] namespace-name
16086 Returns a NAMESPACE_DECL corresponding to the specified
16087 namespace. */
16089 static tree
16091 {
16092 /* Look for the optional `::'. */
16096 /* Look for the optional nested-name-specifier. */
16104 }
16106 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16107 access declaration.
16109 using-declaration:
16110 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16111 using :: unqualified-id ;
16113 access-declaration:
16114 qualified-id ;
16116 */
16118 static bool
16121 {
16125 tree decl;
16126 tree identifier;
16127 tree qscope;
16132 {
16135 }
16136 else
16137 {
16138 /* Look for the `using' keyword. */
16141 /* Peek at the next token. */
16143 /* See if it's `typename'. */
16145 {
16146 /* Remember that we've seen it. */
16148 /* Consume the `typename' token. */
16150 }
16151 }
16153 /* Look for the optional global scope qualification. */
16154 global_scope_p
16159 /* If we saw `typename', or didn't see `::', then there must be a
16160 nested-name-specifier present. */
16162 {
16168 {
16171 }
16172 }
16173 /* Otherwise, we could be in either of the two productions. In that
16174 case, treat the nested-name-specifier as optional. */
16175 else
16187 /* Something has already gone wrong; there's no need to parse
16188 further. Since an error has occurred, the return value of
16189 cp_parser_parse_definitely will be false, as required. */
16193 /* Parse the unqualified-id. */
16201 {
16206 }
16208 /* The function we call to handle a using-declaration is different
16209 depending on what scope we are in. */
16211 ;
16214 /* [namespace.udecl]
16216 A using declaration shall not name a template-id. */
16219 else
16220 {
16222 {
16223 /* Create the USING_DECL. */
16230 {
16233 }
16234 else
16235 /* Add it to the list of members in this class. */
16237 }
16238 else
16239 {
16241 identifier,
16248 {
16251 }
16254 else
16256 }
16257 }
16259 /* Look for the final `;'. */
16264 "access declarations are deprecated "
16265 "in favour of using-declarations; "
16269 }
16271 /* Parse an alias-declaration.
16273 alias-declaration:
16274 using identifier attribute-specifier-seq [opt] = type-id */
16276 static tree
16278 {
16280 location_t id_location;
16282 cp_decl_specifier_seq decl_specs;
16286 /* Look for the `using' keyword. */
16287 cp_token *using_token
16309 /* Now we are going to parse the type-id of the declaration. */
16311 /*
16312 [dcl.type]/3 says:
16314 "A type-specifier-seq shall not define a class or enumeration
16315 unless it appears in the type-id of an alias-declaration (7.1.3) that
16316 is not the declaration of a template-declaration."
16318 In other words, if we currently are in an alias template, the
16319 type-id should not define a type.
16321 So let's set parser->type_definition_forbidden_message in that
16322 case; cp_parser_check_type_definition (called by
16323 cp_parser_class_specifier) will then emit an error if a type is
16324 defined in the type-id. */
16326 {
16330 }
16334 /* Restore the error message if need be. */
16340 {
16343 }
16345 /* A typedef-name can also be introduced by an alias-declaration. The
16346 identifier following the using keyword becomes a typedef-name. It has
16347 the same semantics as if it were introduced by the typedef
16348 specifier. In particular, it does not define a new type and it shall
16349 not appear in the type-id. */
16354 {
16357 ds_attribute,
16358 attrs_token);
16359 }
16361 ds_typedef,
16362 using_token);
16364 ds_alias,
16365 using_token);
16374 else
16385 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16386 added into the symbol table; otherwise, return the TYPE_DECL. */
16390 {
16394 }
16397 }
16399 /* Parse a using-directive.
16401 using-directive:
16402 using namespace :: [opt] nested-name-specifier [opt]
16403 namespace-name ; */
16405 static void
16407 {
16408 tree namespace_decl;
16409 tree attribs;
16411 /* Look for the `using' keyword. */
16413 /* And the `namespace' keyword. */
16415 /* Look for the optional `::' operator. */
16417 /* And the optional nested-name-specifier. */
16423 /* Get the namespace being used. */
16425 /* And any specified attributes. */
16427 /* Update the symbol table. */
16429 /* Look for the final `;'. */
16431 }
16433 /* Parse an asm-definition.
16435 asm-definition:
16436 asm ( string-literal ) ;
16438 GNU Extension:
16440 asm-definition:
16441 asm volatile [opt] ( string-literal ) ;
16442 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16443 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16444 : asm-operand-list [opt] ) ;
16445 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16446 : asm-operand-list [opt]
16447 : asm-clobber-list [opt] ) ;
16448 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16449 : asm-clobber-list [opt]
16450 : asm-goto-list ) ; */
16452 static void
16454 {
16455 tree string;
16460 tree asm_stmt;
16468 /* Look for the `asm' keyword. */
16470 /* See if the next token is `volatile'. */
16473 {
16474 /* Remember that we saw the `volatile' keyword. */
16476 /* Consume the token. */
16478 }
16482 {
16483 /* Remember that we saw the `goto' keyword. */
16485 /* Consume the token. */
16487 }
16488 /* Look for the opening `('. */
16491 /* Look for the string. */
16494 {
16498 }
16500 /* If we're allowing GNU extensions, check for the extended assembly
16501 syntax. Unfortunately, the `:' tokens need not be separated by
16502 a space in C, and so, for compatibility, we tolerate that here
16503 too. Doing that means that we have to treat the `::' operator as
16504 two `:' tokens. */
16509 {
16514 /* The extended syntax was used. */
16517 /* Look for outputs. */
16519 {
16520 /* Consume the `:'. */
16522 /* Parse the output-operands. */
16524 CPP_COLON)
16526 CPP_SCOPE)
16528 CPP_CLOSE_PAREN)
16534 }
16535 /* If the next token is `::', there are no outputs, and the
16536 next token is the beginning of the inputs. */
16538 /* The inputs are coming next. */
16541 /* Look for inputs. */
16544 {
16545 /* Consume the `:' or `::'. */
16547 /* Parse the output-operands. */
16549 CPP_COLON)
16551 CPP_SCOPE)
16553 CPP_CLOSE_PAREN))
16558 }
16560 /* The clobbers are coming next. */
16563 /* Look for clobbers. */
16566 {
16568 /* Consume the `:' or `::'. */
16570 /* Parse the clobbers. */
16572 CPP_COLON)
16574 CPP_CLOSE_PAREN))
16576 }
16579 /* The labels are coming next. */
16582 /* Look for labels. */
16585 {
16587 /* Consume the `:' or `::'. */
16589 /* Parse the labels. */
16591 }
16595 }
16599 /* Look for the closing `)'. */
16607 {
16608 /* Create the ASM_EXPR. */
16610 {
16613 /* If the extended syntax was not used, mark the ASM_EXPR. */
16615 {
16621 }
16622 }
16623 else
16625 }
16626 }
16628 /* Declarators [gram.dcl.decl] */
16630 /* Parse an init-declarator.
16632 init-declarator:
16633 declarator initializer [opt]
16635 GNU Extension:
16637 init-declarator:
16638 declarator asm-specification [opt] attributes [opt] initializer [opt]
16640 function-definition:
16641 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16642 function-body
16643 decl-specifier-seq [opt] declarator function-try-block
16645 GNU Extension:
16647 function-definition:
16648 __extension__ function-definition
16650 TM Extension:
16652 function-definition:
16653 decl-specifier-seq [opt] declarator function-transaction-block
16655 The DECL_SPECIFIERS apply to this declarator. Returns a
16656 representation of the entity declared. If MEMBER_P is TRUE, then
16657 this declarator appears in a class scope. The new DECL created by
16658 this declarator is returned.
16660 The CHECKS are access checks that should be performed once we know
16661 what entity is being declared (and, therefore, what classes have
16662 befriended it).
16664 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16665 for a function-definition here as well. If the declarator is a
16666 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16667 be TRUE upon return. By that point, the function-definition will
16668 have been completely parsed.
16670 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16671 is FALSE.
16673 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16674 parsed declaration if it is an uninitialized single declarator not followed
16675 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16676 if present, will not be consumed. If returned, this declarator will be
16677 created with SD_INITIALIZED but will not call cp_finish_decl. */
16679 static tree
16688 {
16692 tree prefix_attributes;
16694 tree asm_specification;
16695 tree initializer;
16697 tree scope;
16699 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16700 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16701 "(...)". */
16711 /* Gather the attributes that were provided with the
16712 decl-specifiers. */
16715 /* Assume that this is not the declarator for a function
16716 definition. */
16720 /* Default arguments are only permitted for function parameters. */
16724 /* Defer access checks while parsing the declarator; we cannot know
16725 what names are accessible until we know what is being
16726 declared. */
16729 /* Parse the declarator. */
16731 declarator
16736 /* Gather up the deferred checks. */
16741 /* If the DECLARATOR was erroneous, there's no need to go
16742 further. */
16746 /* Check that the number of template-parameter-lists is OK. */
16756 /* Figure out what scope the entity declared by the DECLARATOR is
16757 located in. `grokdeclarator' sometimes changes the scope, so
16758 we compute it now. */
16761 /* Perform any lookups in the declared type which were thought to be
16762 dependent, but are not in the scope of the declarator. */
16763 decl_specifiers->type
16766 /* If we're allowing GNU extensions, look for an
16767 asm-specification. */
16769 {
16770 /* Look for an asm-specification. */
16773 }
16774 else
16777 /* Look for attributes. */
16781 /* Peek at the next token. */
16785 {
16786 /* Check to see if the token indicates the start of a
16787 function-definition. */
16789 {
16791 {
16792 /* If a function-definition should not appear here, issue an
16793 error message. */
16797 }
16799 location_t func_brace_location
16802 /* Neither attributes nor an asm-specification are allowed
16803 on a function-definition. */
16806 "an asm-specification is not allowed "
16810 "attributes are not allowed "
16812 /* This is a function-definition. */
16815 /* Parse the function definition. */
16818 decl_specifiers,
16819 declarator,
16820 prefix_attributes);
16821 else
16822 decl =
16823 (cp_parser_function_definition_from_specifiers_and_declarator
16827 {
16828 /* This is where the prologue starts... */
16831 }
16834 }
16835 }
16837 /* [dcl.dcl]
16839 Only in function declarations for constructors, destructors, and
16840 type conversions can the decl-specifier-seq be omitted.
16842 We explicitly postpone this check past the point where we handle
16843 function-definitions because we tolerate function-definitions
16844 that are missing their return types in some modes. */
16846 {
16850 }
16852 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16856 {
16864 {
16870 }
16871 }
16872 else
16873 {
16874 /* If the init-declarator isn't initialized and isn't followed by a
16875 `,' or `;', it's not a valid init-declarator. */
16878 {
16881 else
16882 {
16885 }
16886 }
16889 }
16891 /* Because start_decl has side-effects, we should only call it if we
16892 know we're going ahead. By this point, we know that we cannot
16893 possibly be looking at any other construct. */
16896 /* If the decl specifiers were bad, issue an error now that we're
16897 sure this was intended to be a declarator. Then continue
16898 declaring the variable(s), as int, to try to cut down on further
16899 errors. */
16902 {
16905 }
16907 /* Enter the newly declared entry in the symbol table. If we're
16908 processing a declaration in a class-specifier, we wait until
16909 after processing the initializer. */
16911 {
16918 /* Adjust location of decl if declarator->id_loc is more appropriate:
16919 set, and decl wasn't merged with another decl, in which case its
16920 location would be different from input_location, and more accurate. */
16925 }
16927 /* Enter the SCOPE. That way unqualified names appearing in the
16928 initializer will be looked up in SCOPE. */
16931 /* Perform deferred access control checks, now that we know in which
16932 SCOPE the declared entity resides. */
16934 {
16937 /* If the entity being declared is a function, pretend that we
16938 are in its scope. If it is a `friend', it may have access to
16939 things that would not otherwise be accessible. */
16941 {
16944 }
16946 /* Perform access checks for template parameters. */
16949 /* Perform the access control checks for the declarator and the
16950 decl-specifiers. */
16953 /* Restore the saved value. */
16956 }
16958 /* Parse the initializer. */
16963 {
16965 {
16969 else
16970 {
16971 /* If the declaration was erroneous, we don't really
16972 know what the user intended, so just silently
16973 consume the initializer. */
16981 }
16982 }
16983 else
16984 {
16985 /* We want to record the extra mangling scope for in-class
16986 initializers of class members and initializers of static data
16987 member templates. The former involves deferring
16988 parsing of the initializer until end of class as with default
16989 arguments. So right here we only handle the latter. */
16999 }
17000 }
17002 /* The old parser allows attributes to appear after a parenthesized
17003 initializer. Mark Mitchell proposed removing this functionality
17004 on the GCC mailing lists on 2002-08-13. This parser accepts the
17005 attributes -- but ignores them. */
17012 /* A non-template declaration involving a function parameter list containing
17013 an implicit template parameter will have been made into a template. If it
17014 turns out that the resulting declaration is not an actual function then
17015 finish the template declaration here. An error message will already have
17016 been issued. */
17019 {
17021 {
17024 }
17026 }
17028 /* For an in-class declaration, use `grokfield' to create the
17029 declaration. */
17031 {
17033 {
17036 }
17044 }
17046 /* Finish processing the declaration. But, skip member
17047 declarations. */
17049 {
17052 asm_specification,
17053 /* If the initializer is in parentheses, then this is
17054 a direct-initialization, which means that an
17055 `explicit' constructor is OK. Otherwise, an
17056 `explicit' constructor cannot be used. */
17059 }
17062 /* Core issue #226 (C++0x only): A default template-argument
17063 shall not be specified in a friend class template
17064 declaration. */
17073 {
17076 else
17078 }
17081 }
17083 /* Parse a declarator.
17085 declarator:
17086 direct-declarator
17087 ptr-operator declarator
17089 abstract-declarator:
17090 ptr-operator abstract-declarator [opt]
17091 direct-abstract-declarator
17093 GNU Extensions:
17095 declarator:
17096 attributes [opt] direct-declarator
17097 attributes [opt] ptr-operator declarator
17099 abstract-declarator:
17100 attributes [opt] ptr-operator abstract-declarator [opt]
17101 attributes [opt] direct-abstract-declarator
17103 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17104 detect constructor, destructor or conversion operators. It is set
17105 to -1 if the declarator is a name, and +1 if it is a
17106 function. Otherwise it is set to zero. Usually you just want to
17107 test for >0, but internally the negative value is used.
17109 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17110 a decl-specifier-seq unless it declares a constructor, destructor,
17111 or conversion. It might seem that we could check this condition in
17112 semantic analysis, rather than parsing, but that makes it difficult
17113 to handle something like `f()'. We want to notice that there are
17114 no decl-specifiers, and therefore realize that this is an
17115 expression, not a declaration.)
17117 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17118 the declarator is a direct-declarator of the form "(...)".
17120 MEMBER_P is true iff this declarator is a member-declarator.
17122 FRIEND_P is true iff this declarator is a friend. */
17126 cp_parser_declarator_kind dcl_kind,
17130 {
17133 cp_cv_quals cv_quals;
17134 tree class_type;
17137 /* Assume this is not a constructor, destructor, or type-conversion
17138 operator. */
17145 /* Check for the ptr-operator production. */
17147 /* Parse the ptr-operator. */
17153 /* If that worked, then we have a ptr-operator. */
17155 {
17156 /* If a ptr-operator was found, then this declarator was not
17157 parenthesized. */
17160 /* The dependent declarator is optional if we are parsing an
17161 abstract-declarator. */
17165 /* Parse the dependent declarator. */
17170 friend_p);
17172 /* If we are parsing an abstract-declarator, we must handle the
17173 case where the dependent declarator is absent. */
17178 declarator = cp_parser_make_indirect_declarator
17180 }
17181 /* Everything else is a direct-declarator. */
17182 else
17183 {
17186 CPP_OPEN_PAREN);
17188 ctor_dtor_or_conv_p,
17190 }
17195 }
17197 /* Parse a direct-declarator or direct-abstract-declarator.
17199 direct-declarator:
17200 declarator-id
17201 direct-declarator ( parameter-declaration-clause )
17202 cv-qualifier-seq [opt]
17203 ref-qualifier [opt]
17204 exception-specification [opt]
17205 direct-declarator [ constant-expression [opt] ]
17206 ( declarator )
17208 direct-abstract-declarator:
17209 direct-abstract-declarator [opt]
17210 ( parameter-declaration-clause )
17211 cv-qualifier-seq [opt]
17212 ref-qualifier [opt]
17213 exception-specification [opt]
17214 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17215 ( abstract-declarator )
17217 Returns a representation of the declarator. DCL_KIND is
17218 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17219 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17220 we are parsing a direct-declarator. It is
17221 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17222 of ambiguity we prefer an abstract declarator, as per
17223 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17224 as for cp_parser_declarator. */
17228 cp_parser_declarator_kind dcl_kind,
17231 {
17241 {
17242 /* Peek at the next token. */
17245 {
17246 /* This is either a parameter-declaration-clause, or a
17247 parenthesized declarator. When we know we are parsing a
17248 named declarator, it must be a parenthesized declarator
17249 if FIRST is true. For instance, `(int)' is a
17250 parameter-declaration-clause, with an omitted
17251 direct-abstract-declarator. But `((*))', is a
17252 parenthesized abstract declarator. Finally, when T is a
17253 template parameter `(T)' is a
17254 parameter-declaration-clause, and not a parenthesized
17255 named declarator.
17257 We first try and parse a parameter-declaration-clause,
17258 and then try a nested declarator (if FIRST is true).
17260 It is not an error for it not to be a
17261 parameter-declaration-clause, even when FIRST is
17262 false. Consider,
17264 int i (int);
17265 int i (3);
17267 The first is the declaration of a function while the
17268 second is the definition of a variable, including its
17269 initializer.
17271 Having seen only the parenthesis, we cannot know which of
17272 these two alternatives should be selected. Even more
17273 complex are examples like:
17275 int i (int (a));
17276 int i (int (3));
17278 The former is a function-declaration; the latter is a
17279 variable initialization.
17281 Thus again, we try a parameter-declaration-clause, and if
17282 that fails, we back out and return. */
17285 {
17286 tree params;
17289 /* In a member-declarator, the only valid interpretation
17290 of a parenthesis is the start of a
17291 parameter-declaration-clause. (It is invalid to
17292 initialize a static data member with a parenthesized
17293 initializer; only the "=" form of initialization is
17294 permitted.) */
17298 /* Consume the `('. */
17301 {
17302 /* If this is going to be an abstract declarator, we're
17303 in a declarator and we can't have default args. */
17306 }
17310 /* Parse the parameter-declaration-clause. */
17313 /* Consume the `)'. */
17316 /* If all went well, parse the cv-qualifier-seq,
17317 ref-qualifier and the exception-specification. */
17319 {
17320 cp_cv_quals cv_quals;
17321 cp_virt_specifiers virt_specifiers;
17322 cp_ref_qualifier ref_qual;
17323 tree exception_specification;
17324 tree late_return;
17325 tree attrs;
17335 /* Parse the cv-qualifier-seq. */
17337 /* Parse the ref-qualifier. */
17339 /* And the exception-specification. */
17340 exception_specification
17345 /* In here, we handle cases where attribute is used after
17346 the function declaration. For example:
17347 void func (int x) __attribute__((vector(..))); */
17350 {
17354 CPP_SEMICOLON)
17356 CPP_OPEN_BRACE))
17359 ;
17360 else
17362 }
17363 late_return = (cp_parser_late_return_type_opt
17368 /* Parse the virt-specifier-seq. */
17371 /* Create the function-declarator. */
17373 params,
17374 cv_quals,
17375 virt_specifiers,
17376 ref_qual,
17377 exception_specification,
17378 late_return);
17380 /* Any subsequent parameter lists are to do with
17381 return type, so are not those of the declared
17382 function. */
17384 }
17386 /* Remove the function parms from scope. */
17390 /* Repeat the main loop. */
17392 }
17394 /* If this is the first, we can try a parenthesized
17395 declarator. */
17397 {
17403 /* Consume the `('. */
17405 /* Parse the nested declarator. */
17408 declarator
17414 /* Expect a `)'. */
17421 }
17422 /* Otherwise, we must be done. */
17423 else
17425 }
17429 {
17430 /* Parse an array-declarator. */
17439 /* Consume the `['. */
17441 /* Peek at the next token. */
17443 /* If the next token is `]', then there is no
17444 constant-expression. */
17446 {
17448 bounds
17458 {
17459 /* Normally, the array bound must be an integral constant
17460 expression. However, as an extension, we allow VLAs
17461 in function scopes as long as they aren't part of a
17462 parameter declaration. */
17466 }
17469 {
17470 /* Remember this wasn't a constant-expression. */
17473 }
17474 }
17475 else
17477 /* Look for the closing `]'. */
17479 {
17482 }
17487 }
17489 {
17490 {
17491 tree qualifying_scope;
17492 tree unqualified_name;
17493 tree attrs;
17494 special_function_kind sfk;
17499 /* Parse a declarator-id */
17502 {
17505 /* If we see an ellipsis, we should be looking at a
17506 parameter pack. */
17508 {
17509 /* Consume the `...' */
17513 }
17514 }
17517 unqualified_name
17521 {
17525 {
17526 /* Check whether an error occurred. */
17529 /* We already consumed the ellipsis to mark a
17530 parameter pack, but we have no way to report it,
17531 so abort the tentative parse. We will be exiting
17532 immediately anyway. */
17534 }
17535 else
17541 && (qualifying_scope
17543 {
17546 }
17547 }
17552 {
17557 }
17563 {
17564 /* In the declaration of a member of a template class
17565 outside of the class itself, the SCOPE will sometimes
17566 be a TYPENAME_TYPE. For example, given:
17568 template <typename T>
17569 int S<T>::R::i = 3;
17571 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17572 this context, we must resolve S<T>::R to an ordinary
17573 type, rather than a typename type.
17575 The reason we normally avoid resolving TYPENAME_TYPEs
17576 is that a specialization of `S' might render
17577 `S<T>::R' not a type. However, if `S' is
17578 specialized, then this `i' will not be used, so there
17579 is no harm in resolving the types here. */
17580 tree type;
17582 /* Resolve the TYPENAME_TYPE. */
17585 /* If that failed, the declarator is invalid. */
17587 {
17590 "cannot define member of dependent typedef "
17592 else
17597 }
17599 }
17604 {
17605 tree class_type;
17610 else
17614 {
17617 {
17620 {
17624 "use %<%T::%D%> instead of %<%T::%D%> to "
17626 class_type,
17631 }
17632 else
17634 }
17635 else
17636 {
17637 /* We do not attempt to print the declarator
17638 here because we do not have enough
17639 information about its original syntactic
17640 form. */
17644 }
17645 }
17648 {
17654 for an anonymous type, even if the type
17655 got a name for linkage purposes. */
17657 /* Handle correctly (c++/19200):
17659 struct S {
17660 struct T{};
17661 friend void S(T);
17662 };
17664 and also:
17666 namespace N {
17667 void S();
17668 }
17670 struct S {
17671 friend void N::S();
17672 }; */
17673 && !(friend_p
17676 class_type))
17677 {
17680 }
17688 }
17689 }
17691 unqualified_name,
17692 sfk);
17699 }
17701 handle_declarator:;
17704 {
17705 /* Any names that appear after the declarator-id for a
17706 member are looked up in the containing scope. */
17708 {
17709 /* But declarations with qualified-ids can't appear in a
17710 function. */
17714 }
17716 }
17720 /* Default args are only allowed on function
17721 declarations. */
17723 else
17727 }
17728 /* We're done. */
17729 else
17731 }
17733 /* For an abstract declarator, we might wind up with nothing at this
17734 point. That's an error; the declarator is not optional. */
17738 /* If we entered a scope, we must exit it now. */
17746 }
17748 /* Parse a ptr-operator.
17750 ptr-operator:
17751 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17752 * cv-qualifier-seq [opt]
17753 &
17754 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17755 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17757 GNU Extension:
17759 ptr-operator:
17760 & cv-qualifier-seq [opt]
17762 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17763 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17764 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17765 filled in with the TYPE containing the member. *CV_QUALS is
17766 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17767 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17768 Note that the tree codes returned by this function have nothing
17769 to do with the types of trees that will be eventually be created
17770 to represent the pointer or reference type being parsed. They are
17771 just constants with suggestive names. */
17772 static enum tree_code
17777 {
17782 /* Assume that it's not a pointer-to-member. */
17784 /* And that there are no cv-qualifiers. */
17787 /* Peek at the next token. */
17790 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17800 {
17801 /* Consume the `*', `&' or `&&'. */
17804 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17805 `&', if we are allowing GNU extensions. (The only qualifier
17806 that can legally appear after `&' is `restrict', but that is
17807 enforced during semantic analysis. */
17815 }
17816 else
17817 {
17818 /* Try the pointer-to-member case. */
17820 /* Look for the optional `::' operator. */
17823 /* Look for the nested-name specifier. */
17830 /* If we found it, and the next token is a `*', then we are
17831 indeed looking at a pointer-to-member operator. */
17834 {
17835 /* Indicate that the `*' operator was used. */
17843 else
17844 {
17845 /* The type of which the member is a member is given by the
17846 current SCOPE. */
17848 /* The next name will not be qualified. */
17852 /* Look for optional c++11 attributes. */
17856 /* Look for the optional cv-qualifier-seq. */
17858 }
17859 }
17860 /* If that didn't work we don't have a ptr-operator. */
17863 }
17866 }
17868 /* Parse an (optional) cv-qualifier-seq.
17870 cv-qualifier-seq:
17871 cv-qualifier cv-qualifier-seq [opt]
17873 cv-qualifier:
17874 const
17875 volatile
17877 GNU Extension:
17879 cv-qualifier:
17880 __restrict__
17882 Returns a bitmask representing the cv-qualifiers. */
17884 static cp_cv_quals
17886 {
17890 {
17892 cp_cv_quals cv_qualifier;
17894 /* Peek at the next token. */
17896 /* See if it's a cv-qualifier. */
17898 {
17914 }
17920 {
17923 }
17924 else
17925 {
17928 }
17929 }
17932 }
17934 /* Parse an (optional) ref-qualifier
17936 ref-qualifier:
17937 &
17938 &&
17940 Returns cp_ref_qualifier representing ref-qualifier. */
17942 static cp_ref_qualifier
17944 {
17947 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17952 {
17957 {
17969 }
17974 {
17977 }
17978 else
17979 {
17982 }
17983 }
17986 }
17988 /* Parse an (optional) virt-specifier-seq.
17990 virt-specifier-seq:
17991 virt-specifier virt-specifier-seq [opt]
17993 virt-specifier:
17994 override
17995 final
17997 Returns a bitmask representing the virt-specifiers. */
17999 static cp_virt_specifiers
18001 {
18005 {
18007 cp_virt_specifiers virt_specifier;
18009 /* Peek at the next token. */
18011 /* See if it's a virt-specifier-qualifier. */
18015 {
18018 }
18020 {
18023 }
18025 {
18027 }
18028 else
18032 {
18035 }
18036 else
18037 {
18040 }
18041 }
18043 }
18045 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18046 is in scope even though it isn't real. */
18048 void
18050 {
18051 tree this_parm;
18054 {
18055 /* We don't clear this between NSDMIs. Is it already what we want? */
18060 }
18063 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18065 current_class_ref
18068 }
18070 /* Return true iff our current scope is a non-static data member
18071 initializer. */
18073 bool
18075 {
18076 /* We recognize NSDMI context by the context-less 'this' pointer set up
18077 by the function above. */
18081 }
18083 /* Parse a late-specified return type, if any. This is not a separate
18084 non-terminal, but part of a function declarator, which looks like
18086 -> trailing-type-specifier-seq abstract-declarator(opt)
18088 Returns the type indicated by the type-id.
18090 In addition to this this parses any queued up omp declare simd
18091 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18093 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18094 function. */
18096 static tree
18098 cp_cv_quals quals)
18099 {
18103 && declarator
18109 /* Peek at the next token. */
18111 /* A late-specified return type is indicated by an initial '->'. */
18118 {
18119 /* DR 1207: 'this' is in scope in the trailing return type. */
18121 }
18124 {
18125 /* Consume the ->. */
18129 }
18132 declarator->std_attributes
18136 declarator->std_attributes
18141 {
18144 }
18147 }
18149 /* Parse a declarator-id.
18151 declarator-id:
18152 id-expression
18153 :: [opt] nested-name-specifier [opt] type-name
18155 In the `id-expression' case, the value returned is as for
18156 cp_parser_id_expression if the id-expression was an unqualified-id.
18157 If the id-expression was a qualified-id, then a SCOPE_REF is
18158 returned. The first operand is the scope (either a NAMESPACE_DECL
18159 or TREE_TYPE), but the second is still just a representation of an
18160 unqualified-id. */
18162 static tree
18164 {
18165 tree id;
18166 /* The expression must be an id-expression. Assume that qualified
18167 names are the names of types so that:
18169 template <class T>
18170 int S<T>::R::i = 3;
18172 will work; we must treat `S<T>::R' as the name of a type.
18173 Similarly, assume that qualified names are templates, where
18174 required, so that:
18176 template <class T>
18177 int S<T>::R<T>::i = 3;
18179 will work, too. */
18185 optional_p);
18189 }
18191 /* Parse a type-id.
18193 type-id:
18194 type-specifier-seq abstract-declarator [opt]
18196 Returns the TYPE specified. */
18198 static tree
18201 {
18202 cp_decl_specifier_seq type_specifier_seq;
18205 /* Parse the type-specifier-seq. */
18207 is_trailing_return,
18212 /* There might or might not be an abstract declarator. */
18214 /* Look for the declarator. */
18215 abstract_declarator
18220 /* Check to see if there really was a declarator. */
18225 /* None of the valid uses of 'auto' in C++14 involve the type-id
18226 nonterminal, but it is valid in a trailing-return-type. */
18229 {
18230 /* A type-id with type 'auto' is only ok if the abstract declarator
18231 is a function declarator with a late-specified return type. */
18236 else
18237 {
18240 }
18241 }
18244 is_template_arg);
18245 }
18248 {
18250 }
18253 {
18254 tree r;
18256 parser->type_definition_forbidden_message
18261 {
18264 }
18266 }
18269 {
18271 }
18273 /* Parse a type-specifier-seq.
18275 type-specifier-seq:
18276 type-specifier type-specifier-seq [opt]
18278 GNU extension:
18280 type-specifier-seq:
18281 attributes type-specifier-seq [opt]
18283 If IS_DECLARATION is true, we are at the start of a "condition" or
18284 exception-declaration, so we might be followed by a declarator-id.
18286 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18287 i.e. we've just seen "->".
18289 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18291 static void
18296 {
18301 /* Clear the TYPE_SPECIFIER_SEQ. */
18304 /* In the context of a trailing return type, enum E { } is an
18305 elaborated-type-specifier followed by a function-body, not an
18306 enum-specifier. */
18310 /* Parse the type-specifiers and attributes. */
18312 {
18313 tree type_specifier;
18316 /* Check for attributes first. */
18318 {
18323 }
18325 /* record the token of the beginning of the type specifier seq,
18326 for error reporting purposes*/
18330 /* Look for the type-specifier. */
18332 flags,
18333 type_specifier_seq,
18335 NULL,
18338 {
18339 /* If the first type-specifier could not be found, this is not a
18340 type-specifier-seq at all. */
18342 {
18343 /* Set in_declarator_p to avoid skipping to the semicolon. */
18355 }
18356 /* If subsequent type-specifiers could not be found, the
18357 type-specifier-seq is complete. */
18359 }
18362 /* The standard says that a condition can be:
18364 type-specifier-seq declarator = assignment-expression
18366 However, given:
18368 struct S {};
18369 if (int S = ...)
18371 we should treat the "S" as a declarator, not as a
18372 type-specifier. The standard doesn't say that explicitly for
18373 type-specifier-seq, but it does say that for
18374 decl-specifier-seq in an ordinary declaration. Perhaps it
18375 would be clearer just to allow a decl-specifier-seq here, and
18376 then add a semantic restriction that if any decl-specifiers
18377 that are not type-specifiers appear, the program is invalid. */
18380 }
18381 }
18383 /* Return whether the function currently being declared has an associated
18384 template parameter list. */
18386 static bool
18388 {
18401 }
18403 /* Parse a parameter-declaration-clause.
18405 parameter-declaration-clause:
18406 parameter-declaration-list [opt] ... [opt]
18407 parameter-declaration-list , ...
18409 Returns a representation for the parameter declarations. A return
18410 value of NULL indicates a parameter-declaration-clause consisting
18411 only of an ellipsis. */
18413 static tree
18415 {
18416 tree parameters;
18425 parser->auto_is_implicit_function_template_parm_p
18427 }
18433 && !processing_template_parmlist
18439 /* Peek at the next token. */
18441 /* Check for trivial parameter-declaration-clauses. */
18443 {
18444 /* Consume the `...' token. */
18447 }
18449 /* There are no parameters. */
18450 {
18451 #ifndef NO_IMPLICIT_EXTERN_C
18456 else
18457 #endif
18459 }
18460 /* Check for `(void)', too, which is a special case. */
18464 {
18465 /* Consume the `void' token. */
18467 /* There are no parameters. */
18469 }
18471 /* Parse the parameter-declaration-list. */
18473 /* If a parse error occurred while parsing the
18474 parameter-declaration-list, then the entire
18475 parameter-declaration-clause is erroneous. */
18479 /* Peek at the next token. */
18481 /* If it's a `,', the clause should terminate with an ellipsis. */
18483 {
18484 /* Consume the `,'. */
18486 /* Expect an ellipsis. */
18487 ellipsis_p
18489 }
18490 /* It might also be `...' if the optional trailing `,' was
18491 omitted. */
18493 {
18494 /* Consume the `...' token. */
18496 /* And remember that we saw it. */
18498 }
18499 else
18502 /* Finish the parameter list. */
18507 }
18509 /* Parse a parameter-declaration-list.
18511 parameter-declaration-list:
18512 parameter-declaration
18513 parameter-declaration-list , parameter-declaration
18515 Returns a representation of the parameter-declaration-list, as for
18516 cp_parser_parameter_declaration_clause. However, the
18517 `void_list_node' is never appended to the list. Upon return,
18518 *IS_ERROR will be true iff an error occurred. */
18520 static tree
18522 {
18528 /* Assume all will go well. */
18530 /* The special considerations that apply to a function within an
18531 unbraced linkage specifications do not apply to the parameters
18532 to the function. */
18533 saved_in_unbraced_linkage_specification_p
18537 /* Look for more parameters. */
18539 {
18547 /* Parse the parameter. */
18548 parameter
18553 /* We don't know yet if the enclosing context is deprecated, so wait
18554 and warn in grokparms if appropriate. */
18558 {
18559 /* If a function parameter pack was specified and an implicit template
18560 parameter was introduced during cp_parser_parameter_declaration,
18561 change any implicit parameters introduced into packs. */
18565 {
18573 }
18577 PARM,
18580 }
18584 /* If a parse error occurred parsing the parameter declaration,
18585 then the entire parameter-declaration-list is erroneous. */
18587 {
18591 }
18601 {
18605 }
18607 /* Add the new parameter to the list. */
18611 /* Peek at the next token. */
18614 /* These are for Objective-C++ */
18617 /* The parameter-declaration-list is complete. */
18620 {
18623 /* Peek at the next token. */
18625 /* If it's an ellipsis, then the list is complete. */
18628 /* Otherwise, there must be more parameters. Consume the
18629 `,'. */
18631 /* When parsing something like:
18633 int i(float f, double d)
18635 we can tell after seeing the declaration for "f" that we
18636 are not looking at an initialization of a variable "i",
18637 but rather at the declaration of a function "i".
18639 Due to the fact that the parsing of template arguments
18640 (as specified to a template-id) requires backtracking we
18641 cannot use this technique when inside a template argument
18642 list. */
18646 /* However, a parameter-declaration of the form
18647 "float(f)" (which is a valid declaration of a
18648 parameter "f") can also be interpreted as an
18649 expression (the conversion of "f" to "float"). */
18652 }
18653 else
18654 {
18662 }
18663 }
18665 parser->in_unbraced_linkage_specification_p
18668 /* Reset implicit_template_scope if we are about to leave the function
18669 parameter list that introduced it. Note that for out-of-line member
18670 definitions, there will be one or more class scopes before we get to
18671 the template parameter scope. */
18675 {
18679 {
18682 }
18683 }
18686 }
18688 /* Parse a parameter declaration.
18690 parameter-declaration:
18691 decl-specifier-seq ... [opt] declarator
18692 decl-specifier-seq declarator = assignment-expression
18693 decl-specifier-seq ... [opt] abstract-declarator [opt]
18694 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18696 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18697 declares a template parameter. (In that case, a non-nested `>'
18698 token encountered during the parsing of the assignment-expression
18699 is not interpreted as a greater-than operator.)
18701 Returns a representation of the parameter, or NULL if an error
18702 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18703 true iff the declarator is of the form "(p)". */
18709 {
18711 cp_decl_specifier_seq decl_specifiers;
18713 tree default_argument;
18717 /* In a template parameter, `>' is not an operator.
18719 [temp.param]
18721 When parsing a default template-argument for a non-type
18722 template-parameter, the first non-nested `>' is taken as the end
18723 of the template parameter-list rather than a greater-than
18724 operator. */
18726 /* Type definitions may not appear in parameter types. */
18728 parser->type_definition_forbidden_message
18731 /* Parse the declaration-specifiers. */
18733 CP_PARSER_FLAGS_NONE,
18737 /* Complain about missing 'typename' or other invalid type names. */
18742 /* If an error occurred, there's no reason to attempt to parse the
18743 rest of the declaration. */
18745 {
18748 }
18750 /* Peek at the next token. */
18753 /* If the next token is a `)', `,', `=', `>', or `...', then there
18754 is no declarator. However, when variadic templates are enabled,
18755 there may be a declarator following `...'. */
18760 {
18764 }
18765 /* Otherwise, there should be a declarator. */
18766 else
18767 {
18771 /* After seeing a decl-specifier-seq, if the next token is not a
18772 "(", there is no possibility that the code is a valid
18773 expression. Therefore, if parsing tentatively, we commit at
18774 this point. */
18776 /* In an expression context, having seen:
18778 (int((char ...
18780 we cannot be sure whether we are looking at a
18781 function-type (taking a "char" as a parameter) or a cast
18782 of some object of type "char" to "int". */
18788 /* Parse the declarator. */
18791 CP_PARSER_DECLARATOR_EITHER,
18793 parenthesized_p,
18797 /* After the declarator, allow more attributes. */
18798 decl_specifiers.attributes
18801 }
18803 /* If the next token is an ellipsis, and we have not seen a
18804 declarator name, and the type of the declarator contains parameter
18805 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18806 a parameter pack expansion expression. Otherwise, leave the
18807 ellipsis for a C-style variadic function. */
18810 {
18821 {
18822 /* Consume the `...'. */
18826 /* Build a pack expansion type */
18829 else
18831 }
18832 }
18834 /* The restriction on defining new types applies only to the type
18835 of the parameter, not to the default argument. */
18838 /* If the next token is `=', then process a default argument. */
18840 {
18842 /* If we are defining a class, then the tokens that make up the
18843 default argument must be saved and processed later. */
18848 /* Outside of a class definition, we can just parse the
18849 assignment-expression. */
18850 else
18851 default_argument
18855 {
18858 else
18859 {
18861 "default arguments are only "
18864 }
18865 }
18869 {
18870 /* Find the name of the parameter pack. */
18877 template_parm_p
18883 else
18885 template_parm_p
18892 }
18893 }
18894 else
18898 declarator,
18899 default_argument);
18900 }
18902 /* Parse a default argument and return it.
18904 TEMPLATE_PARM_P is true if this is a default argument for a
18905 non-type template parameter. */
18906 static tree
18908 {
18914 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18915 set correctly. */
18918 /* Local variable names (and the `this' keyword) may not
18919 appear in a default argument. */
18922 /* Parse the assignment-expression. */
18927 /* The "this" pointer is not valid in a default argument. */
18929 {
18934 }
18935 default_argument
18937 /* Restore the "this" pointer. */
18939 {
18942 }
18951 }
18953 /* Parse a function-body.
18955 function-body:
18956 compound_statement */
18958 static void
18960 {
18962 }
18964 /* Parse a ctor-initializer-opt followed by a function-body. Return
18965 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18966 is true we are parsing a function-try-block. */
18968 static bool
18971 {
18979 /* Begin the function body. */
18981 /* Parse the optional ctor-initializer. */
18984 /* If we're parsing a constexpr constructor definition, we need
18985 to check that the constructor body is indeed empty. However,
18986 before we get to cp_parser_function_body lot of junk has been
18987 generated, so we can't just check that we have an empty block.
18988 Rather we take a snapshot of the outermost block, and check whether
18989 cp_parser_function_body changed its state. */
18991 {
18995 }
18996 /* Parse the function-body. */
19000 /* Finish the function body. */
19004 }
19006 /* Parse an initializer.
19008 initializer:
19009 = initializer-clause
19010 ( expression-list )
19012 Returns an expression representing the initializer. If no
19013 initializer is present, NULL_TREE is returned.
19015 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19016 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19017 set to TRUE if there is no initializer present. If there is an
19018 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19019 is set to true; otherwise it is set to false. */
19021 static tree
19024 {
19026 tree init;
19028 /* Peek at the next token. */
19031 /* Let our caller know whether or not this initializer was
19032 parenthesized. */
19034 /* Assume that the initializer is constant. */
19038 {
19039 /* Consume the `='. */
19041 /* Parse the initializer-clause. */
19043 }
19045 {
19050 non_constant_p);
19055 }
19057 {
19062 }
19063 else
19064 {
19065 /* Anything else is an error. */
19068 }
19071 }
19073 /* Parse an initializer-clause.
19075 initializer-clause:
19076 assignment-expression
19077 braced-init-list
19079 Returns an expression representing the initializer.
19081 If the `assignment-expression' production is used the value
19082 returned is simply a representation for the expression.
19084 Otherwise, calls cp_parser_braced_list. */
19086 static tree
19088 {
19089 tree initializer;
19091 /* Assume the expression is constant. */
19094 /* If it is not a `{', then we are looking at an
19095 assignment-expression. */
19097 {
19098 initializer
19101 non_constant_p);
19102 }
19103 else
19107 }
19109 /* Parse a brace-enclosed initializer list.
19111 braced-init-list:
19112 { initializer-list , [opt] }
19113 { }
19115 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19116 the elements of the initializer-list (or NULL, if the last
19117 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19118 NULL_TREE. There is no way to detect whether or not the optional
19119 trailing `,' was provided. NON_CONSTANT_P is as for
19120 cp_parser_initializer. */
19122 static tree
19124 {
19125 tree initializer;
19127 /* Consume the `{' token. */
19129 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19131 /* If it's not a `}', then there is a non-trivial initializer. */
19133 {
19134 /* Parse the initializer list. */
19137 /* A trailing `,' token is allowed. */
19140 }
19141 else
19143 /* Now, there should be a trailing `}'. */
19147 }
19149 /* Parse an initializer-list.
19151 initializer-list:
19152 initializer-clause ... [opt]
19153 initializer-list , initializer-clause ... [opt]
19155 GNU Extension:
19157 initializer-list:
19158 designation initializer-clause ...[opt]
19159 initializer-list , designation initializer-clause ...[opt]
19161 designation:
19162 . identifier =
19163 identifier :
19164 [ constant-expression ] =
19166 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19167 for the initializer. If the INDEX of the elt is non-NULL, it is the
19168 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19169 as for cp_parser_initializer. */
19173 {
19176 /* Assume all of the expressions are constant. */
19179 /* Parse the rest of the list. */
19181 {
19183 tree designator;
19184 tree initializer;
19187 /* If the next token is an identifier and the following one is a
19188 colon, we are looking at the GNU designated-initializer
19189 syntax. */
19193 {
19194 /* Warn the user that they are using an extension. */
19197 /* Consume the identifier. */
19199 /* Consume the `:'. */
19201 }
19202 /* Also handle the C99 syntax, '. id ='. */
19207 {
19208 /* Warn the user that they are using an extension. */
19211 /* Consume the `.'. */
19213 /* Consume the identifier. */
19215 /* Consume the `='. */
19217 }
19218 /* Also handle C99 array designators, '[ const ] ='. */
19222 {
19223 /* In C++11, [ could start a lambda-introducer. */
19235 }
19236 else
19239 /* Parse the initializer. */
19242 /* If any clause is non-constant, so is the entire initializer. */
19246 /* If we have an ellipsis, this is an initializer pack
19247 expansion. */
19249 {
19250 /* Consume the `...'. */
19253 /* Turn the initializer into an initializer expansion. */
19255 }
19257 /* Add it to the vector. */
19260 /* If the next token is not a comma, we have reached the end of
19261 the list. */
19265 /* Peek at the next token. */
19267 /* If the next token is a `}', then we're still done. An
19268 initializer-clause can have a trailing `,' after the
19269 initializer-list and before the closing `}'. */
19273 /* Consume the `,' token. */
19275 }
19278 }
19280 /* Classes [gram.class] */
19282 /* Parse a class-name.
19284 class-name:
19285 identifier
19286 template-id
19288 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19289 to indicate that names looked up in dependent types should be
19290 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19291 keyword has been used to indicate that the name that appears next
19292 is a template. TAG_TYPE indicates the explicit tag given before
19293 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19294 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19295 is the class being defined in a class-head.
19297 Returns the TYPE_DECL representing the class. */
19299 static tree
19307 {
19308 tree decl;
19309 tree scope;
19314 /* All class-names start with an identifier. */
19317 {
19320 }
19322 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19323 to a template-id, so we save it here. */
19328 /* Any name names a type if we're following the `typename' keyword
19329 in a qualified name where the enclosing scope is type-dependent. */
19332 /* Handle the common case (an identifier, but not a template-id)
19333 efficiently. */
19336 {
19340 /* Look for the identifier. */
19344 /* If the next token isn't an identifier, we are certainly not
19345 looking at a class-name. */
19348 /* If we know this is a type-name, there's no need to look it
19349 up. */
19352 else
19353 {
19354 tree ambiguous_decls;
19355 /* If we already know that this lookup is ambiguous, then
19356 we've already issued an error message; there's no reason
19357 to check again. */
19359 {
19362 }
19363 /* If the next token is a `::', then the name must be a type
19364 name.
19366 [basic.lookup.qual]
19368 During the lookup for a name preceding the :: scope
19369 resolution operator, object, function, and enumerator
19370 names are ignored. */
19373 /* Look up the name. */
19375 tag_type,
19378 check_dependency_p,
19382 {
19386 }
19387 }
19388 }
19389 else
19390 {
19391 /* Try a template-id. */
19393 check_dependency_p,
19394 tag_type,
19395 is_declaration);
19398 }
19402 /* If this is a typename, create a TYPENAME_TYPE. */
19404 {
19409 }
19413 /* Check to see that it is really the name of a class. */
19417 /* Situations like this:
19419 template <typename T> struct A {
19420 typename T::template X<int>::I i;
19421 };
19423 are problematic. Is `T::template X<int>' a class-name? The
19424 standard does not seem to be definitive, but there is no other
19425 valid interpretation of the following `::'. Therefore, those
19426 names are considered class-names. */
19427 {
19431 }
19435 /* In Objective-C 2.0, a classname followed by '.' starts a
19436 dot-syntax expression, and it's not a type-name. */
19448 }
19450 /* Parse a class-specifier.
19452 class-specifier:
19453 class-head { member-specification [opt] }
19455 Returns the TREE_TYPE representing the class. */
19457 static tree
19459 {
19460 tree type;
19474 /* Parse the class-head. */
19477 /* If the class-head was a semantic disaster, skip the entire body
19478 of the class. */
19480 {
19484 }
19486 /* Look for the `{'. */
19488 {
19491 }
19495 /* Issue an error message if type-definitions are forbidden here. */
19497 /* Remember that we are defining one more class. */
19499 /* Inside the class, surrounding template-parameter-lists do not
19500 apply. */
19501 saved_num_template_parameter_lists
19504 /* We are not in a function body. */
19507 /* Or in a loop. */
19510 /* Or in a switch. */
19513 /* We are not immediately inside an extern "lang" block. */
19514 saved_in_unbraced_linkage_specification_p
19518 /* Start the class. */
19520 {
19523 }
19527 /* If the type is erroneous, skip the entire body of the class. */
19529 else
19530 /* Parse the member-specification. */
19533 /* Look for the trailing `}'. */
19535 /* Look for trailing attributes to apply to this class. */
19543 /* We've finished a type definition. Check for the common syntax
19544 error of forgetting a semicolon after the definition. We need to
19545 be careful, as we can't just check for not-a-semicolon and be done
19546 with it; the user might have typed:
19548 class X { } c = ...;
19549 class X { } *p = ...;
19551 and so forth. Instead, enumerate all the possible tokens that
19552 might follow this production; if we don't see one of them, then
19553 complain and silently insert the semicolon. */
19554 {
19559 /* Don't try to parse c++11 attributes here. As per the
19560 grammar, that should be a task for
19561 cp_parser_decl_specifier_seq. */
19565 {
19576 /* While it's legal for type qualifiers and storage class
19577 specifiers to follow type definitions in the grammar, only
19578 compiler testsuites contain code like that. Assume that if
19579 we see such code, then what we're really seeing is a case
19580 like:
19582 class X { }
19583 const <type> var = ...;
19585 or
19587 class Y { }
19588 static <type> func (...) ...
19590 i.e. the qualifier or specifier applies to the next
19591 declaration. To do so, however, we need to look ahead one
19592 more token to see if *that* token is a type specifier.
19594 This code could be improved to handle:
19596 class Z { }
19597 static const <type> var = ...; */
19600 {
19603 /* Handling user-defined types here would be nice, but very
19604 tricky. */
19605 want_semicolon
19608 }
19612 }
19614 /* If we don't have a type, then something is very wrong and we
19615 shouldn't try to do anything clever. Likewise for not seeing the
19616 closing brace. */
19618 {
19619 cp_token_position prev
19630 else
19633 /* Unget one token and smash it to look as though we encountered
19634 a semicolon in the input stream. */
19639 }
19640 }
19642 /* If this class is not itself within the scope of another class,
19643 then we need to parse the bodies of all of the queued function
19644 definitions. Note that the queued functions defined in a class
19645 are not always processed immediately following the
19646 class-specifier for that class. Consider:
19648 struct A {
19649 struct B { void f() { sizeof (A); } };
19650 };
19652 If `f' were processed before the processing of `A' were
19653 completed, there would be no way to compute the size of `A'.
19654 Note that the nesting we are interested in here is lexical --
19655 not the semantic nesting given by TYPE_CONTEXT. In particular,
19656 for:
19658 struct A { struct B; };
19659 struct A::B { void f() { } };
19661 there is no need to delay the parsing of `A::B::f'. */
19663 {
19664 tree decl;
19671 /* In a first pass, parse default arguments to the functions.
19672 Then, in a second pass, parse the bodies of the functions.
19673 This two-phased approach handles cases like:
19675 struct S {
19676 void f() { g(); }
19677 void g(int i = 3);
19678 };
19680 */
19682 {
19684 /* If there are default arguments that have not yet been processed,
19685 take care of them now. */
19687 {
19692 }
19693 /* Make sure that any template parameters are in scope. */
19695 /* Parse the default argument expressions. */
19697 /* Remove any template parameters from the symbol table. */
19699 }
19701 /* Now parse any NSDMIs. */
19705 {
19707 {
19712 }
19715 }
19722 /* Now do some post-NSDMI bookkeeping. */
19728 /* Now parse the body of the functions. */
19730 {
19731 /* OpenMP UDRs need to be parsed before all other functions. */
19738 }
19739 else
19743 }
19744 else
19747 /* Put back any saved access checks. */
19750 /* Restore saved state. */
19754 parser->num_template_parameter_lists
19756 parser->in_unbraced_linkage_specification_p
19760 }
19762 static tree
19764 {
19765 tree ret;
19770 }
19772 /* Parse a class-head.
19774 class-head:
19775 class-key identifier [opt] base-clause [opt]
19776 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19777 class-key nested-name-specifier [opt] template-id
19778 base-clause [opt]
19780 class-virt-specifier:
19781 final
19783 GNU Extensions:
19784 class-key attributes identifier [opt] base-clause [opt]
19785 class-key attributes nested-name-specifier identifier base-clause [opt]
19786 class-key attributes nested-name-specifier [opt] template-id
19787 base-clause [opt]
19789 Upon return BASES is initialized to the list of base classes (or
19790 NULL, if there are none) in the same form returned by
19791 cp_parser_base_clause.
19793 Returns the TYPE of the indicated class. Sets
19794 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19795 involving a nested-name-specifier was used, and FALSE otherwise.
19797 Returns error_mark_node if this is not a class-head.
19799 Returns NULL_TREE if the class-head is syntactically valid, but
19800 semantically invalid in a way that means we should skip the entire
19801 body of the class. */
19803 static tree
19806 {
19807 tree nested_name_specifier;
19811 tree attributes;
19812 tree bases;
19822 /* Assume no nested-name-specifier will be present. */
19824 /* Assume no template parameter lists will be used in defining the
19825 type. */
19829 /* Look for the class-key. */
19834 /* Parse the attributes. */
19837 /* If the next token is `::', that is invalid -- but sometimes
19838 people do try to write:
19840 struct ::S {};
19842 Handle this gracefully by accepting the extra qualifier, and then
19843 issuing an error about it later if this really is a
19844 class-head. If it turns out just to be an elaborated type
19845 specifier, remain silent. */
19851 /* Determine the name of the class. Begin by looking for an
19852 optional nested-name-specifier. */
19854 nested_name_specifier
19860 /* If there was a nested-name-specifier, then there *must* be an
19861 identifier. */
19863 {
19865 /* Although the grammar says `identifier', it really means
19866 `class-name' or `template-name'. You are only allowed to
19867 define a class that has already been declared with this
19868 syntax.
19870 The proposed resolution for Core Issue 180 says that wherever
19871 you see `class T::X' you should treat `X' as a type-name.
19873 It is OK to define an inaccessible class; for example:
19875 class A { class B; };
19876 class A::B {};
19878 We do not know if we will see a class-name, or a
19879 template-name. We look for a class-name first, in case the
19880 class-name is a template-id; if we looked for the
19881 template-name first we would stop after the template-name. */
19886 class_type,
19890 /* If that didn't work, ignore the nested-name-specifier. */
19892 {
19898 }
19899 /* If we could not find a corresponding TYPE, treat this
19900 declaration like an unqualified declaration. */
19903 /* Otherwise, count the number of templates used in TYPE and its
19904 containing scopes. */
19905 else
19906 {
19907 tree scope;
19919 }
19920 }
19921 /* Otherwise, the identifier is optional. */
19922 else
19923 {
19924 /* We don't know whether what comes next is a template-id,
19925 an identifier, or nothing at all. */
19927 /* Check for a template-id. */
19932 class_key,
19934 /* If that didn't work, it could still be an identifier. */
19936 {
19938 {
19941 }
19942 else
19944 }
19945 else
19946 {
19949 }
19950 }
19955 {
19957 class_key,
19959 }
19962 /* If it's not a `:' or a `{' then we can't really be looking at a
19963 class-head, since a class-head only appears as part of a
19964 class-specifier. We have to detect this situation before calling
19965 xref_tag, since that has irreversible side-effects. */
19967 {
19971 }
19973 /* At this point, we're going ahead with the class-specifier, even
19974 if some other problem occurs. */
19977 {
19982 }
19983 /* Issue the error about the overly-qualified name now. */
19985 {
19990 }
19992 {
19997 }
19999 {
20000 tree scope;
20002 /* Reject typedef-names in class heads. */
20004 {
20007 type);
20010 }
20012 /* Figure out in what scope the declaration is being placed. */
20014 /* If that scope does not contain the scope in which the
20015 class was originally declared, the program is invalid. */
20017 {
20020 "declaration of %qD in namespace %qD which does not "
20023 else
20029 }
20030 /* [dcl.meaning]
20032 A declarator-id shall not be qualified except for the
20033 definition of a ... nested class outside of its class
20034 ... [or] the definition or explicit instantiation of a
20035 class member of a namespace outside of its namespace. */
20037 {
20042 }
20043 }
20044 /* An explicit-specialization must be preceded by "template <>". If
20045 it is not, try to recover gracefully. */
20049 {
20053 /* Take the same action that would have been taken by
20054 cp_parser_explicit_specialization. */
20057 }
20058 /* There must be no "return" statements between this point and the
20059 end of this function; set "type "to the correct return value and
20060 use "goto done;" to return. */
20061 /* Make sure that the right number of template parameters were
20062 present. */
20066 {
20067 /* If something went wrong, there is no point in even trying to
20068 process the class-definition. */
20071 }
20073 /* Look up the type. */
20075 {
20079 {
20083 }
20084 else
20085 {
20088 }
20091 }
20093 {
20094 tree class_type;
20096 /* Given:
20098 template <typename T> struct S { struct T };
20099 template <typename T> struct S<T>::T { };
20101 we will get a TYPENAME_TYPE when processing the definition of
20102 `S::T'. We need to resolve it to the actual type before we
20103 try to define it. */
20105 {
20110 else
20111 {
20114 }
20115 }
20119 {
20122 }
20125 /* Enter the scope indicated by the nested-name-specifier. */
20127 /* Get the canonical version of this type. */
20129 /* Call push_template_decl if it seems like we should be defining a
20130 template either from the template headers or the type we're
20131 defining, so that we diagnose both extra and missing headers. */
20137 {
20140 {
20143 }
20144 }
20148 }
20150 {
20151 /* If the class was unnamed, create a dummy name. */
20156 }
20158 /* Indicate whether this class was declared as a `class' or as a
20159 `struct'. */
20164 /* If this type was already complete, and we see another definition,
20165 that's an error. */
20167 {
20169 type);
20171 type);
20174 }
20179 {
20180 /* Apply attributes now, before any use of the class as a template
20181 argument in its base list. */
20184 }
20186 /* We will have entered the scope containing the class; the names of
20187 base classes should be looked up in that context. For example:
20189 struct A { struct B {}; struct C; };
20190 struct A::C : B {};
20192 is valid. */
20194 /* Get the list of base-classes, if there is one. */
20196 {
20197 /* PR59482: enter the class scope so that base-specifiers are looked
20198 up correctly. */
20202 /* PR59482: get out of the previously pushed class scope so that the
20203 subsequent pops pop the right thing. */
20206 }
20207 else
20210 /* If we're really defining a class, process the base classes.
20211 If they're invalid, fail. */
20216 done:
20217 /* Leave the scope given by the nested-name-specifier. We will
20218 enter the class scope itself while processing the members. */
20223 {
20226 }
20232 out:
20235 }
20237 /* Parse a class-key.
20239 class-key:
20240 class
20241 struct
20242 union
20244 Returns the kind of class-key specified, or none_type to indicate
20245 error. */
20247 static enum tag_types
20249 {
20253 /* Look for the class-key. */
20258 /* Check to see if the TOKEN is a class-key. */
20263 }
20265 /* Parse a type-parameter-key.
20267 type-parameter-key:
20268 class
20269 typename
20270 */
20272 static void
20274 {
20275 /* Look for the type-parameter-key. */
20279 {
20282 /* typename is not allowed in a template template parameter
20283 by the standard until C++1Z. */
20285 "ISO C++ forbids typename key in template template parameter;"
20287 }
20288 else
20292 }
20294 /* Parse an (optional) member-specification.
20296 member-specification:
20297 member-declaration member-specification [opt]
20298 access-specifier : member-specification [opt] */
20300 static void
20302 {
20304 {
20308 /* Peek at the next token. */
20310 /* If it's a `}', or EOF then we've seen all the members. */
20316 /* See if this token is a keyword. */
20319 {
20323 /* Consume the access-specifier. */
20325 /* Remember which access-specifier is active. */
20327 /* Look for the `:'. */
20332 /* Accept #pragmas at class scope. */
20334 {
20337 }
20339 /* Otherwise, the next construction must be a
20340 member-declaration. */
20342 }
20343 }
20344 }
20346 /* Parse a member-declaration.
20348 member-declaration:
20349 decl-specifier-seq [opt] member-declarator-list [opt] ;
20350 function-definition ; [opt]
20351 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20352 using-declaration
20353 template-declaration
20354 alias-declaration
20356 member-declarator-list:
20357 member-declarator
20358 member-declarator-list , member-declarator
20360 member-declarator:
20361 declarator pure-specifier [opt]
20362 declarator constant-initializer [opt]
20363 identifier [opt] : constant-expression
20365 GNU Extensions:
20367 member-declaration:
20368 __extension__ member-declaration
20370 member-declarator:
20371 declarator attributes [opt] pure-specifier [opt]
20372 declarator attributes [opt] constant-initializer [opt]
20373 identifier [opt] attributes [opt] : constant-expression
20375 C++0x Extensions:
20377 member-declaration:
20378 static_assert-declaration */
20380 static void
20382 {
20383 cp_decl_specifier_seq decl_specifiers;
20384 tree prefix_attributes;
20385 tree decl;
20394 /* Check for the `__extension__' keyword. */
20396 {
20397 /* Recurse. */
20399 /* Restore the old value of the PEDANTIC flag. */
20403 }
20405 /* Check for a template-declaration. */
20407 {
20408 /* An explicit specialization here is an error condition, and we
20409 expect the specialization handler to detect and report this. */
20413 else
20417 }
20419 /* Check for a using-declaration. */
20421 {
20423 {
20424 /* Parse the using-declaration. */
20428 }
20429 else
20430 {
20431 tree decl;
20435 /* Note that if we actually see the '=' token after the
20436 identifier, cp_parser_alias_declaration commits the
20437 tentative parse. In that case, we really expects an
20438 alias-declaration. Otherwise, we expect a using
20439 declaration. */
20440 alias_decl_expected =
20446 else
20450 }
20451 }
20453 /* Check for @defs. */
20455 {
20460 {
20465 }
20467 }
20469 /* If the next token is `static_assert' we have a static assertion. */
20471 {
20474 }
20481 /* Parse the decl-specifier-seq. */
20484 CP_PARSER_FLAGS_OPTIONAL,
20487 /* Check for an invalid type-name. */
20491 /* If there is no declarator, then the decl-specifier-seq should
20492 specify a type. */
20494 {
20495 /* If there was no decl-specifier-seq, and the next token is a
20496 `;', then we have something like:
20498 struct S { ; };
20500 [class.mem]
20502 Each member-declaration shall declare at least one member
20503 name of the class. */
20505 {
20509 }
20510 else
20511 {
20512 tree type;
20514 /* See if this declaration is a friend. */
20516 /* If there were decl-specifiers, check to see if there was
20517 a class-declaration. */
20520 /* Nested classes have already been added to the class, but
20521 a `friend' needs to be explicitly registered. */
20523 {
20524 /* If the `friend' keyword was present, the friend must
20525 be introduced with a class-key. */
20528 "in C++03 a class-key must be used "
20530 /* In this case:
20532 template <typename T> struct A {
20533 friend struct A<T>::B;
20534 };
20536 A<T>::B will be represented by a TYPENAME_TYPE, and
20537 therefore not recognized by check_tag_decl. */
20539 {
20543 }
20546 "friend declaration does not name a class or "
20548 else
20551 }
20552 /* If there is no TYPE, an error message will already have
20553 been issued. */
20555 ;
20556 /* An anonymous aggregate has to be handled specially; such
20557 a declaration really declares a data member (with a
20558 particular type), as opposed to a nested class. */
20560 {
20561 /* C++11 9.5/6. */
20564 "a storage class on an anonymous aggregate "
20567 /* Remove constructors and such from TYPE, now that we
20568 know it is an anonymous aggregate. */
20570 /* And make the corresponding data member. */
20573 /* Add it to the class. */
20575 }
20576 else
20577 cp_parser_check_access_in_redeclaration
20580 }
20581 }
20582 else
20583 {
20586 /* Clear attributes from the decl_specifiers but keep them
20587 around as prefix attributes that apply them to the entity
20588 being declared. */
20592 /* See if these declarations will be friends. */
20595 /* Keep going until we hit the `;' at the end of the
20596 declaration. */
20598 {
20600 tree first_attribute;
20602 /* Peek at the next token. */
20605 /* Check for a bitfield declaration. */
20610 {
20611 tree identifier;
20612 tree width;
20614 /* Get the name of the bitfield. Note that we cannot just
20615 check TOKEN here because it may have been invalidated by
20616 the call to cp_lexer_peek_nth_token above. */
20619 else
20622 /* Consume the `:' token. */
20624 /* Get the width of the bitfield. */
20625 width
20628 NULL);
20630 /* Look for attributes that apply to the bitfield. */
20632 /* Remember which attributes are prefix attributes and
20633 which are not. */
20635 /* Combine the attributes. */
20638 /* Create the bitfield declaration. */
20641 identifier,
20642 sfk_none)
20645 width,
20646 attributes);
20647 }
20648 else
20649 {
20651 tree initializer;
20652 tree asm_specification;
20655 /* Parse the declarator. */
20656 declarator
20661 friend_p);
20663 /* If something went wrong parsing the declarator, make sure
20664 that we at least consume some tokens. */
20666 {
20667 /* Skip to the end of the statement. */
20669 /* If the next token is not a semicolon, that is
20670 probably because we just skipped over the body of
20671 a function. So, we consume a semicolon if
20672 present, but do not issue an error message if it
20673 is not present. */
20675 CPP_SEMICOLON))
20678 }
20681 cp_parser_check_for_definition_in_return_type
20685 /* Look for an asm-specification. */
20687 /* Look for attributes that apply to the declaration. */
20689 /* Remember which attributes are prefix attributes and
20690 which are not. */
20692 /* Combine the attributes. */
20695 /* If it's an `=', then we have a constant-initializer or a
20696 pure-specifier. It is not correct to parse the
20697 initializer before registering the member declaration
20698 since the member declaration should be in scope while
20699 its initializer is processed. However, the rest of the
20700 front end does not yet provide an interface that allows
20701 us to handle this correctly. */
20703 {
20704 /* In [class.mem]:
20706 A pure-specifier shall be used only in the declaration of
20707 a virtual function.
20709 A member-declarator can contain a constant-initializer
20710 only if it declares a static member of integral or
20711 enumeration type.
20713 Therefore, if the DECLARATOR is for a function, we look
20714 for a pure-specifier; otherwise, we look for a
20715 constant-initializer. When we call `grokfield', it will
20716 perform more stringent semantics checks. */
20728 {
20730 /* Don't require a constant rvalue in C++11, since we
20731 might want a reference constant. We'll enforce
20732 constancy later. */
20734 /* Parse the initializer. */
20737 }
20738 else
20739 /* Parse the initializer. */
20741 }
20744 {
20748 else
20750 }
20751 /* Otherwise, there is no initializer. */
20752 else
20755 /* See if we are probably looking at a function
20756 definition. We are certainly not looking at a
20757 member-declarator. Calling `grokfield' has
20758 side-effects, so we must not do it unless we are sure
20759 that we are looking at a member-declarator. */
20762 {
20763 /* The grammar does not allow a pure-specifier to be
20764 used when a member function is defined. (It is
20765 possible that this fact is an oversight in the
20766 standard, since a pure function may be defined
20767 outside of the class-specifier. */
20773 declarator,
20774 attributes);
20777 /* If the member was not a friend, declare it here. */
20780 /* Peek at the next token. */
20782 /* If the next token is a semicolon, consume it. */
20786 }
20787 else
20790 /* Create the declaration. */
20795 {
20798 else
20800 }
20801 }
20805 /* Reset PREFIX_ATTRIBUTES. */
20811 /* If there is any qualification still in effect, clear it
20812 now; we will be starting fresh with the next declarator. */
20816 /* If it's a `,', then there are more declarators. */
20818 {
20821 {
20825 }
20826 }
20827 /* If the next token isn't a `;', then we have a parse error. */
20829 CPP_SEMICOLON))
20830 {
20831 /* The next token might be a ways away from where the
20832 actual semicolon is missing. Find the previous token
20833 and use that for our error position. */
20838 /* Assume that the user meant to provide a semicolon. If
20839 we were to cp_parser_skip_to_end_of_statement, we might
20840 skip to a semicolon inside a member function definition
20841 and issue nonsensical error messages. */
20843 }
20846 {
20847 /* Add DECL to the list of members. */
20856 /* Add DECL to the queue of NSDMI to be parsed later. */
20858 }
20862 }
20863 }
20866 out:
20868 }
20870 /* Parse a pure-specifier.
20872 pure-specifier:
20873 = 0
20875 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20876 Otherwise, ERROR_MARK_NODE is returned. */
20878 static tree
20880 {
20883 /* Look for the `=' token. */
20886 /* Look for the `0' token. */
20895 /* Accept = default or = delete in c++0x mode. */
20898 {
20901 }
20903 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20905 {
20910 }
20912 {
20915 }
20918 }
20920 /* Parse a constant-initializer.
20922 constant-initializer:
20923 = constant-expression
20925 Returns a representation of the constant-expression. */
20927 static tree
20929 {
20930 /* Look for the `=' token. */
20934 /* It is invalid to write:
20936 struct S { static const int i = { 7 }; };
20938 */
20940 {
20943 /* Consume the opening brace. */
20945 /* Skip the initializer. */
20947 /* Look for the trailing `}'. */
20951 }
20955 NULL);
20956 }
20958 /* Derived classes [gram.class.derived] */
20960 /* Parse a base-clause.
20962 base-clause:
20963 : base-specifier-list
20965 base-specifier-list:
20966 base-specifier ... [opt]
20967 base-specifier-list , base-specifier ... [opt]
20969 Returns a TREE_LIST representing the base-classes, in the order in
20970 which they were declared. The representation of each node is as
20971 described by cp_parser_base_specifier.
20973 In the case that no bases are specified, this function will return
20974 NULL_TREE, not ERROR_MARK_NODE. */
20976 static tree
20978 {
20981 /* Look for the `:' that begins the list. */
20984 /* Scan the base-specifier-list. */
20986 {
20988 tree base;
20991 /* Look for the base-specifier. */
20993 /* Look for the (optional) ellipsis. */
20995 {
20996 /* Consume the `...'. */
21000 }
21002 /* Add BASE to the front of the list. */
21004 {
21006 /* Make this a pack expansion type. */
21010 {
21013 }
21014 }
21015 /* Peek at the next token. */
21017 /* If it's not a comma, then the list is complete. */
21020 /* Consume the `,'. */
21022 }
21024 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21025 base class had a qualified name. However, the next name that
21026 appears is certainly not qualified. */
21032 }
21034 /* Parse a base-specifier.
21036 base-specifier:
21037 :: [opt] nested-name-specifier [opt] class-name
21038 virtual access-specifier [opt] :: [opt] nested-name-specifier
21039 [opt] class-name
21040 access-specifier virtual [opt] :: [opt] nested-name-specifier
21041 [opt] class-name
21043 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21044 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21045 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21046 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21048 static tree
21050 {
21058 tree type;
21060 /* Process the optional `virtual' and `access-specifier'. */
21062 {
21063 /* Peek at the next token. */
21065 /* Process `virtual'. */
21067 {
21069 /* If `virtual' appears more than once, issue an error. */
21071 {
21075 }
21079 /* Consume the `virtual' token. */
21087 /* If more than one access specifier appears, issue an
21088 error. */
21091 {
21095 }
21099 /* Consume the access-specifier. */
21107 }
21108 }
21109 /* It is not uncommon to see programs mechanically, erroneously, use
21110 the 'typename' keyword to denote (dependent) qualified types
21111 as base classes. */
21113 {
21118 else
21120 "keyword %<typename%> not allowed in this context "
21123 }
21125 /* Look for the optional `::' operator. */
21127 /* Look for the nested-name-specifier. The simplest way to
21128 implement:
21130 [temp.res]
21132 The keyword `typename' is not permitted in a base-specifier or
21133 mem-initializer; in these contexts a qualified name that
21134 depends on a template-parameter is implicitly assumed to be a
21135 type name.
21137 is to pretend that we have seen the `typename' keyword at this
21138 point. */
21142 typename_type,
21144 /* If the base class is given by a qualified name, assume that names
21145 we see are type names or templates, as appropriate. */
21151 /* DR 950 allows decltype as a base-specifier. */
21153 else
21154 {
21155 /* Otherwise, look for the class-name. */
21157 class_scope_p,
21158 template_p,
21159 typename_type,
21164 }
21170 }
21172 /* Exception handling [gram.exception] */
21174 /* Parse an (optional) noexcept-specification.
21176 noexcept-specification:
21177 noexcept ( constant-expression ) [opt]
21179 If no noexcept-specification is present, returns NULL_TREE.
21180 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21181 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21182 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21183 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21184 in which case a boolean condition is returned instead. */
21186 static tree
21191 {
21195 /* Peek at the next token. */
21198 /* Is it a noexcept-specification? */
21200 {
21201 tree expr;
21205 {
21209 {
21210 /* Types may not be defined in an exception-specification. */
21212 parser->type_definition_forbidden_message
21217 /* Restore the saved message. */
21219 }
21220 else
21221 {
21224 }
21227 }
21228 else
21229 {
21233 }
21235 /* We cannot build a noexcept-spec right away because this will check
21236 that expr is a constexpr. */
21239 else
21241 }
21242 else
21244 }
21246 /* Parse an (optional) exception-specification.
21248 exception-specification:
21249 throw ( type-id-list [opt] )
21251 Returns a TREE_LIST representing the exception-specification. The
21252 TREE_VALUE of each node is a type. */
21254 static tree
21256 {
21258 tree type_id_list;
21261 /* Peek at the next token. */
21264 /* Is it a noexcept-specification? */
21270 /* If it's not `throw', then there's no exception-specification. */
21274 #if 0
21275 /* Enable this once a lot of code has transitioned to noexcept? */
21279 #endif
21281 /* Consume the `throw'. */
21284 /* Look for the `('. */
21287 /* Peek at the next token. */
21289 /* If it's not a `)', then there is a type-id-list. */
21291 {
21292 /* Types may not be defined in an exception-specification. */
21294 parser->type_definition_forbidden_message
21296 /* Parse the type-id-list. */
21298 /* Restore the saved message. */
21300 }
21301 else
21304 /* Look for the `)'. */
21308 }
21310 /* Parse an (optional) type-id-list.
21312 type-id-list:
21313 type-id ... [opt]
21314 type-id-list , type-id ... [opt]
21316 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21317 in the order that the types were presented. */
21319 static tree
21321 {
21325 {
21327 tree type;
21329 /* Get the next type-id. */
21331 /* Parse the optional ellipsis. */
21333 {
21334 /* Consume the `...'. */
21337 /* Turn the type into a pack expansion expression. */
21339 }
21340 /* Add it to the list. */
21342 /* Peek at the next token. */
21344 /* If it is not a `,', we are done. */
21347 /* Consume the `,'. */
21349 }
21352 }
21354 /* Parse a try-block.
21356 try-block:
21357 try compound-statement handler-seq */
21359 static tree
21361 {
21362 tree try_block;
21372 }
21374 /* Parse a function-try-block.
21376 function-try-block:
21377 try ctor-initializer [opt] function-body handler-seq */
21379 static bool
21381 {
21382 tree compound_stmt;
21383 tree try_block;
21386 /* Look for the `try' keyword. */
21389 /* Let the rest of the front end know where we are. */
21391 /* Parse the function-body. */
21392 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21394 /* We're done with the `try' part. */
21396 /* Parse the handlers. */
21398 /* We're done with the handlers. */
21402 }
21404 /* Parse a handler-seq.
21406 handler-seq:
21407 handler handler-seq [opt] */
21409 static void
21411 {
21413 {
21416 /* Parse the handler. */
21418 /* Peek at the next token. */
21420 /* If it's not `catch' then there are no more handlers. */
21423 }
21424 }
21426 /* Parse a handler.
21428 handler:
21429 catch ( exception-declaration ) compound-statement */
21431 static void
21433 {
21434 tree handler;
21435 tree declaration;
21445 }
21447 /* Parse an exception-declaration.
21449 exception-declaration:
21450 type-specifier-seq declarator
21451 type-specifier-seq abstract-declarator
21452 type-specifier-seq
21453 ...
21455 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21456 ellipsis variant is used. */
21458 static tree
21460 {
21461 cp_decl_specifier_seq type_specifiers;
21465 /* If it's an ellipsis, it's easy to handle. */
21467 {
21468 /* Consume the `...' token. */
21471 }
21473 /* Types may not be defined in exception-declarations. */
21475 parser->type_definition_forbidden_message
21478 /* Parse the type-specifier-seq. */
21482 /* If it's a `)', then there is no declarator. */
21485 else
21492 /* Restore the saved message. */
21499 }
21501 /* Parse a throw-expression.
21503 throw-expression:
21504 throw assignment-expression [opt]
21506 Returns a THROW_EXPR representing the throw-expression. */
21508 static tree
21510 {
21511 tree expression;
21516 /* Figure out whether or not there is an assignment-expression
21517 following the "throw" keyword. */
21525 else
21530 }
21532 /* GNU Extensions */
21534 /* Parse an (optional) asm-specification.
21536 asm-specification:
21537 asm ( string-literal )
21539 If the asm-specification is present, returns a STRING_CST
21540 corresponding to the string-literal. Otherwise, returns
21541 NULL_TREE. */
21543 static tree
21545 {
21547 tree asm_specification;
21549 /* Peek at the next token. */
21551 /* If the next token isn't the `asm' keyword, then there's no
21552 asm-specification. */
21556 /* Consume the `asm' token. */
21558 /* Look for the `('. */
21561 /* Look for the string-literal. */
21564 /* Look for the `)'. */
21568 }
21570 /* Parse an asm-operand-list.
21572 asm-operand-list:
21573 asm-operand
21574 asm-operand-list , asm-operand
21576 asm-operand:
21577 string-literal ( expression )
21578 [ string-literal ] string-literal ( expression )
21580 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21581 each node is the expression. The TREE_PURPOSE is itself a
21582 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21583 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21584 is a STRING_CST for the string literal before the parenthesis. Returns
21585 ERROR_MARK_NODE if any of the operands are invalid. */
21587 static tree
21589 {
21594 {
21595 tree string_literal;
21596 tree expression;
21597 tree name;
21600 {
21601 /* Consume the `[' token. */
21603 /* Read the operand name. */
21608 /* Look for the closing `]'. */
21610 }
21611 else
21613 /* Look for the string-literal. */
21616 /* Look for the `('. */
21618 /* Parse the expression. */
21620 /* Look for the `)'. */
21628 /* Add this operand to the list. */
21630 expression,
21631 asm_operands);
21632 /* If the next token is not a `,', there are no more
21633 operands. */
21636 /* Consume the `,'. */
21638 }
21641 }
21643 /* Parse an asm-clobber-list.
21645 asm-clobber-list:
21646 string-literal
21647 asm-clobber-list , string-literal
21649 Returns a TREE_LIST, indicating the clobbers in the order that they
21650 appeared. The TREE_VALUE of each node is a STRING_CST. */
21652 static tree
21654 {
21658 {
21659 tree string_literal;
21661 /* Look for the string literal. */
21663 /* Add it to the list. */
21665 /* If the next token is not a `,', then the list is
21666 complete. */
21669 /* Consume the `,' token. */
21671 }
21674 }
21676 /* Parse an asm-label-list.
21678 asm-label-list:
21679 identifier
21680 asm-label-list , identifier
21682 Returns a TREE_LIST, indicating the labels in the order that they
21683 appeared. The TREE_VALUE of each node is a label. */
21685 static tree
21687 {
21691 {
21694 /* Look for the identifier. */
21697 {
21700 {
21706 }
21707 }
21708 /* If the next token is not a `,', then the list is
21709 complete. */
21712 /* Consume the `,' token. */
21714 }
21717 }
21719 /* Return TRUE iff the next tokens in the stream are possibly the
21720 beginning of a GNU extension attribute. */
21722 static bool
21724 {
21726 }
21728 /* Return TRUE iff the next tokens in the stream are possibly the
21729 beginning of a standard C++-11 attribute specifier. */
21731 static bool
21733 {
21735 }
21737 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21738 beginning of a standard C++-11 attribute specifier. */
21740 static bool
21742 {
21750 }
21752 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21753 beginning of a GNU extension attribute. */
21755 static bool
21757 {
21761 }
21763 /* Return true iff the next tokens can be the beginning of either a
21764 GNU attribute list, or a standard C++11 attribute sequence. */
21766 static bool
21768 {
21771 }
21773 /* Return true iff the next Nth tokens can be the beginning of either
21774 a GNU attribute list, or a standard C++11 attribute sequence. */
21776 static bool
21778 {
21781 }
21783 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21784 of GNU attributes, or return NULL. */
21786 static tree
21788 {
21792 }
21794 #define CILK_SIMD_FN_CLAUSE_MASK \
21795 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21796 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21797 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21798 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21799 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21801 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21802 vector [(<clauses>)] */
21804 static void
21806 {
21810 {
21815 }
21818 {
21821 paren_scope++;
21822 }
21824 {
21827 paren_scope++;
21829 paren_scope--;
21830 /* Do not push the last ')' */
21833 }
21842 }
21844 /* Parse an (optional) series of attributes.
21846 attributes:
21847 attributes attribute
21849 attribute:
21850 __attribute__ (( attribute-list [opt] ))
21852 The return value is as for cp_parser_gnu_attribute_list. */
21854 static tree
21856 {
21860 {
21862 tree attribute_list;
21865 /* Peek at the next token. */
21867 /* If it's not `__attribute__', then we're done. */
21871 /* Consume the `__attribute__' keyword. */
21873 /* Look for the two `(' tokens. */
21877 /* Peek at the next token. */
21880 /* Parse the attribute-list. */
21882 else
21883 /* If the next token is a `)', then there is no attribute
21884 list. */
21887 /* Look for the two `)' tokens. */
21895 /* Add these new attributes to the list. */
21897 }
21900 }
21902 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21903 "__vector" or "__vector__." */
21907 {
21911 }
21913 /* Parse a GNU attribute-list.
21915 attribute-list:
21916 attribute
21917 attribute-list , attribute
21919 attribute:
21920 identifier
21921 identifier ( identifier )
21922 identifier ( identifier , expression-list )
21923 identifier ( expression-list )
21925 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21926 to an attribute. The TREE_PURPOSE of each node is the identifier
21927 indicating which attribute is in use. The TREE_VALUE represents
21928 the arguments, if any. */
21930 static tree
21932 {
21938 {
21940 tree identifier;
21941 tree attribute;
21943 /* Look for the identifier. We also allow keywords here; for
21944 example `__attribute__ ((const))' is legal. */
21948 {
21951 /* Consume the token, but save it since we need it for the
21952 SIMD enabled function parsing. */
21955 /* Save away the identifier that indicates which attribute
21956 this is. */
21958 /* For keywords, use the canonical spelling, not the
21959 parsed identifier. */
21965 /* Peek at the next token. */
21967 /* If it's an `(', then parse the attribute arguments. */
21969 {
21974 {
21977 }
21978 else
21979 vec = cp_parser_parenthesized_expression_list
21985 else
21986 {
21989 }
21990 /* Save the arguments away. */
21992 }
21994 {
21997 }
22000 {
22001 /* Add this attribute to the list. */
22004 }
22007 }
22008 /* Now, look for more attributes. If the next token isn't a
22009 `,', we're done. */
22013 /* Consume the comma and keep going. */
22015 }
22018 /* We built up the list in reverse order. */
22020 }
22022 /* Parse a standard C++11 attribute.
22024 The returned representation is a TREE_LIST which TREE_PURPOSE is
22025 the scoped name of the attribute, and the TREE_VALUE is its
22026 arguments list.
22028 Note that the scoped name of the attribute is itself a TREE_LIST
22029 which TREE_PURPOSE is the namespace of the attribute, and
22030 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22031 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22032 and which TREE_PURPOSE is directly the attribute name.
22034 Clients of the attribute code should use get_attribute_namespace
22035 and get_attribute_name to get the actual namespace and name of
22036 attributes, regardless of their being GNU or C++11 attributes.
22038 attribute:
22039 attribute-token attribute-argument-clause [opt]
22041 attribute-token:
22042 identifier
22043 attribute-scoped-token
22045 attribute-scoped-token:
22046 attribute-namespace :: identifier
22048 attribute-namespace:
22049 identifier
22051 attribute-argument-clause:
22052 ( balanced-token-seq )
22054 balanced-token-seq:
22055 balanced-token [opt]
22056 balanced-token-seq balanced-token
22058 balanced-token:
22059 ( balanced-token-seq )
22060 [ balanced-token-seq ]
22061 { balanced-token-seq }. */
22063 static tree
22065 {
22069 /* First, parse name of the the attribute, a.k.a
22070 attribute-token. */
22087 {
22088 /* We are seeing a scoped attribute token. */
22098 else
22099 {
22103 }
22105 NULL_TREE);
22107 }
22108 else
22109 {
22111 NULL_TREE);
22112 /* C++11 noreturn attribute is equivalent to GNU's. */
22115 /* C++14 deprecated attribute is equivalent to GNU's. */
22118 }
22120 /* Now parse the optional argument clause of the attribute. */
22125 {
22131 /* A GNU attribute that takes an identifier in parameter. */
22134 vec = cp_parser_parenthesized_expression_list
22140 else
22141 {
22144 }
22148 else
22150 }
22153 }
22155 /* Parse a list of standard C++-11 attributes.
22157 attribute-list:
22158 attribute [opt]
22159 attribute-list , attribute[opt]
22160 attribute ...
22161 attribute-list , attribute ...
22162 */
22164 static tree
22166 {
22171 {
22176 {
22179 }
22184 }
22187 }
22189 /* Parse a standard C++-11 attribute specifier.
22191 attribute-specifier:
22192 [ [ attribute-list ] ]
22193 alignment-specifier
22195 alignment-specifier:
22196 alignas ( type-id ... [opt] )
22197 alignas ( alignment-expression ... [opt] ). */
22199 static tree
22201 {
22207 {
22216 else
22217 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22218 when we are sure that we have actually parsed them. */
22220 }
22221 else
22222 {
22223 tree alignas_expr;
22225 /* Look for an alignment-specifier. */
22237 {
22240 }
22246 {
22250 alignas_expr =
22258 }
22261 {
22264 }
22268 /* Build the C++-11 representation of an 'aligned'
22269 attribute. */
22270 attributes =
22274 }
22277 }
22279 /* Parse a standard C++-11 attribute-specifier-seq.
22281 attribute-specifier-seq:
22282 attribute-specifier-seq [opt] attribute-specifier
22283 */
22285 static tree
22287 {
22291 {
22300 }
22304 }
22306 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22307 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22308 current value of the PEDANTIC flag, regardless of whether or not
22309 the `__extension__' keyword is present. The caller is responsible
22310 for restoring the value of the PEDANTIC flag. */
22312 static bool
22314 {
22315 /* Save the old value of the PEDANTIC flag. */
22319 {
22320 /* Consume the `__extension__' token. */
22322 /* We're not being pedantic while the `__extension__' keyword is
22323 in effect. */
22327 }
22330 }
22332 /* Parse a label declaration.
22334 label-declaration:
22335 __label__ label-declarator-seq ;
22337 label-declarator-seq:
22338 identifier , label-declarator-seq
22339 identifier */
22341 static void
22343 {
22344 /* Look for the `__label__' keyword. */
22348 {
22349 tree identifier;
22351 /* Look for an identifier. */
22353 /* If we failed, stop. */
22356 /* Declare it as a label. */
22358 /* If the next token is a `;', stop. */
22361 /* Look for the `,' separating the label declarations. */
22363 }
22365 /* Look for the final `;'. */
22367 }
22369 /* Support Functions */
22371 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22372 NAME should have one of the representations used for an
22373 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22374 is returned. If PARSER->SCOPE is a dependent type, then a
22375 SCOPE_REF is returned.
22377 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22378 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22379 was formed. Abstractly, such entities should not be passed to this
22380 function, because they do not need to be looked up, but it is
22381 simpler to check for this special case here, rather than at the
22382 call-sites.
22384 In cases not explicitly covered above, this function returns a
22385 DECL, OVERLOAD, or baselink representing the result of the lookup.
22386 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22387 is returned.
22389 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22390 (e.g., "struct") that was used. In that case bindings that do not
22391 refer to types are ignored.
22393 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22394 ignored.
22396 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22397 are ignored.
22399 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22400 types.
22402 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22403 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22404 NULL_TREE otherwise. */
22406 static tree
22413 location_t name_location)
22414 {
22415 tree decl;
22418 /* Assume that the lookup will be unambiguous. */
22422 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22423 no longer valid. Note that if we are parsing tentatively, and
22424 the parse fails, OBJECT_TYPE will be automatically restored. */
22430 /* A template-id has already been resolved; there is no lookup to
22431 do. */
22435 {
22439 }
22441 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22442 it should already have been checked to make sure that the name
22443 used matches the type being destroyed. */
22445 {
22446 tree type;
22448 /* Figure out to which type this destructor applies. */
22453 else
22455 /* If that's not a class type, there is no destructor. */
22462 /* If it was a class type, return the destructor. */
22464 }
22466 /* By this point, the NAME should be an ordinary identifier. If
22467 the id-expression was a qualified name, the qualifying scope is
22468 stored in PARSER->SCOPE at this point. */
22471 /* Perform the lookup. */
22473 {
22479 /* If the SCOPE is dependent, the lookup must be deferred until
22480 the template is instantiated -- unless we are explicitly
22481 looking up names in uninstantiated templates. Even then, we
22482 cannot look up the name if the scope is not a class type; it
22483 might, for example, be a template type parameter. */
22488 /* Defer lookup. */
22490 else
22491 {
22494 /* If PARSER->SCOPE is a dependent type, then it must be a
22495 class type, and we must not be checking dependencies;
22496 otherwise, we would have processed this lookup above. So
22497 that PARSER->SCOPE is not considered a dependent base by
22498 lookup_member, we must enter the scope here. */
22502 /* If the PARSER->SCOPE is a template specialization, it
22503 may be instantiated during name lookup. In that case,
22504 errors may be issued. Even if we rollback the current
22505 tentative parse, those errors are valid. */
22510 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22511 lookup result and the nested-name-specifier nominates a class C:
22512 * if the name specified after the nested-name-specifier, when
22513 looked up in C, is the injected-class-name of C (Clause 9), or
22514 * if the name specified after the nested-name-specifier is the
22515 same as the identifier or the simple-template-id's template-
22516 name in the last component of the nested-name-specifier,
22517 the name is instead considered to name the constructor of
22518 class C. [ Note: for example, the constructor is not an
22519 acceptable lookup result in an elaborated-type-specifier so
22520 the constructor would not be used in place of the
22521 injected-class-name. --end note ] Such a constructor name
22522 shall be used only in the declarator-id of a declaration that
22523 names a constructor or in a using-declaration. */
22531 /* If we have a single function from a using decl, pull it out. */
22538 }
22540 /* If the scope is a dependent type and either we deferred lookup or
22541 we did lookup but didn't find the name, rememeber the name. */
22544 {
22546 {
22547 tree type;
22549 /* The resolution to Core Issue 180 says that `struct
22550 A::B' should be considered a type-name, even if `A'
22551 is dependent. */
22556 }
22560 CPP_CLOSE_PAREN)))
22564 else
22567 is_template);
22568 }
22571 }
22573 {
22574 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22575 OBJECT_TYPE is not a class. */
22577 /* If the OBJECT_TYPE is a template specialization, it may
22578 be instantiated during name lookup. In that case, errors
22579 may be issued. Even if we rollback the current tentative
22580 parse, those errors are valid. */
22582 name,
22585 tf_warning_or_error);
22586 else
22590 /* Look it up in the enclosing context. */
22596 }
22597 else
22598 {
22604 }
22606 /* If the lookup failed, let our caller know. */
22610 /* Pull out the template from an injected-class-name (or multiple). */
22614 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22616 {
22619 /* The error message we have to print is too complicated for
22620 cp_parser_error, so we incorporate its actions directly. */
22622 {
22624 name);
22626 }
22628 }
22636 /* If we have resolved the name of a member declaration, check to
22637 see if the declaration is accessible. When the name resolves to
22638 set of overloaded functions, accessibility is checked when
22639 overload resolution is done.
22641 During an explicit instantiation, access is not checked at all,
22642 as per [temp.explicit]. */
22649 }
22651 /* Like cp_parser_lookup_name, but for use in the typical case where
22652 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22653 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22655 static tree
22657 {
22659 none_type,
22664 location);
22665 }
22667 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22668 the current context, return the TYPE_DECL. If TAG_NAME_P is
22669 true, the DECL indicates the class being defined in a class-head,
22670 or declared in an elaborated-type-specifier.
22672 Otherwise, return DECL. */
22674 static tree
22676 {
22677 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22678 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22680 struct A {
22681 template <typename T> struct B;
22682 };
22684 template <typename T> struct A::B {};
22686 Similarly, in an elaborated-type-specifier:
22688 namespace N { struct X{}; }
22690 struct A {
22691 template <typename T> friend struct N::X;
22692 };
22694 However, if the DECL refers to a class type, and we are in
22695 the scope of the class, then the name lookup automatically
22696 finds the TYPE_DECL created by build_self_reference rather
22697 than a TEMPLATE_DECL. For example, in:
22699 template <class T> struct S {
22700 S s;
22701 };
22703 there is no need to handle such case. */
22709 }
22711 /* If too many, or too few, template-parameter lists apply to the
22712 declarator, issue an error message. Returns TRUE if all went well,
22713 and FALSE otherwise. */
22715 static bool
22718 location_t declarator_location)
22719 {
22721 {
22723 {
22731 /* If the DECLARATOR has the form `X<y>' then it uses one
22732 additional level of template parameters. */
22735 return cp_parser_check_template_parameters
22737 }
22752 }
22754 }
22756 /* NUM_TEMPLATES were used in the current declaration. If that is
22757 invalid, return FALSE and issue an error messages. Otherwise,
22758 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22759 declarator and we can print more accurate diagnostics. */
22761 static bool
22764 location_t location,
22766 {
22767 /* If there are the same number of template classes and parameter
22768 lists, that's OK. */
22771 /* If there are more, but only one more, then we are referring to a
22772 member template. That's OK too. */
22775 /* If there are more template classes than parameter lists, we have
22776 something like:
22778 template <class T> void S<T>::R<T>::f (); */
22780 {
22790 else
22793 }
22794 /* Otherwise, there are too many template parameter lists. We have
22795 something like:
22797 template <class T> template <class U> void S::f(); */
22800 }
22802 /* Parse an optional `::' token indicating that the following name is
22803 from the global namespace. If so, PARSER->SCOPE is set to the
22804 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22805 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22806 Returns the new value of PARSER->SCOPE, if the `::' token is
22807 present, and NULL_TREE otherwise. */
22809 static tree
22811 {
22814 /* Peek at the next token. */
22816 /* If we're looking at a `::' token then we're starting from the
22817 global namespace, not our current location. */
22819 {
22820 /* Consume the `::' token. */
22822 /* Set the SCOPE so that we know where to start the lookup. */
22828 }
22830 {
22834 }
22837 }
22839 /* Returns TRUE if the upcoming token sequence is the start of a
22840 constructor declarator. If FRIEND_P is true, the declarator is
22841 preceded by the `friend' specifier. */
22843 static bool
22845 {
22848 tree nested_name_specifier;
22851 /* The common case is that this is not a constructor declarator, so
22852 try to avoid doing lots of work if at all possible. It's not
22853 valid declare a constructor at function scope. */
22856 /* And only certain tokens can begin a constructor declarator. */
22864 /* Parse tentatively; we are going to roll back all of the tokens
22865 consumed here. */
22867 /* Assume that we are looking at a constructor declarator. */
22870 /* Look for the optional `::' operator. */
22873 /* Look for the nested-name-specifier. */
22874 nested_name_specifier
22885 /* Outside of a class-specifier, there must be a
22886 nested-name-specifier. */
22892 /* If we have a class scope, this is easy; DR 147 says that S::S always
22893 names the constructor, and no other qualified name could. */
22896 {
22906 }
22907 /* If we still think that this might be a constructor-declarator,
22908 look for a class-name. */
22910 {
22911 /* If we have:
22913 template <typename T> struct S {
22914 S();
22915 };
22917 we must recognize that the nested `S' names a class. */
22918 tree type_decl;
22922 none_type,
22926 /* If there was no class-name, then this is not a constructor.
22927 Otherwise, if we are in a class-specifier and we aren't
22928 handling a friend declaration, check that its type matches
22929 current_class_type (c++/38313). Note: error_mark_node
22930 is left alone for error recovery purposes. */
22932 && (outside_class_specifier_p
22937 /* If we're still considering a constructor, we have to see a `(',
22938 to begin the parameter-declaration-clause, followed by either a
22939 `)', an `...', or a decl-specifier. We need to check for a
22940 type-specifier to avoid being fooled into thinking that:
22942 S (f) (int);
22944 is a constructor. (It is actually a function named `f' that
22945 takes one parameter (of type `int') and returns a value of type
22946 `S'. */
22954 /* A parameter declaration begins with a decl-specifier,
22955 which is either the "attribute" keyword, a storage class
22956 specifier, or (usually) a type-specifier. */
22958 {
22959 tree type;
22963 /* Names appearing in the type-specifier should be looked up
22964 in the scope of the class. */
22967 else
22968 {
22971 {
22975 {
22978 }
22979 }
22981 }
22983 /* Inside the constructor parameter list, surrounding
22984 template-parameter-lists do not apply. */
22985 saved_num_template_parameter_lists
22989 /* Look for the type-specifier. */
22991 CP_PARSER_FLAGS_NONE,
22997 parser->num_template_parameter_lists
23000 /* Leave the scope of the class. */
23005 }
23006 }
23008 /* We did not really want to consume any tokens. */
23012 }
23014 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23015 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23016 they must be performed once we are in the scope of the function.
23018 Returns the function defined. */
23020 static tree
23021 cp_parser_function_definition_from_specifiers_and_declarator
23024 tree attributes,
23026 {
23027 tree fn;
23030 /* Begin the function-definition. */
23033 /* The things we're about to see are not directly qualified by any
23034 template headers we've seen thus far. */
23037 /* If there were names looked up in the decl-specifier-seq that we
23038 did not check, check them now. We must wait until we are in the
23039 scope of the function to perform the checks, since the function
23040 might be a friend. */
23044 {
23047 }
23050 {
23051 /* Skip the entire function. */
23054 }
23056 {
23057 /* Seen already, skip it. An error message has already been output. */
23061 /* If this is a function from a class, pop the nested class. */
23064 }
23065 else
23066 {
23067 timevar_id_t tv;
23070 else
23076 }
23079 }
23081 /* Parse the part of a function-definition that follows the
23082 declarator. INLINE_P is TRUE iff this function is an inline
23083 function defined within a class-specifier.
23085 Returns the function defined. */
23087 static tree
23090 {
23091 tree fn;
23097 bool fully_implicit_function_template_p
23100 tree implicit_template_parms
23103 cp_binding_level* implicit_template_scope
23109 /* If the next token is `return', then the code may be trying to
23110 make use of the "named return value" extension that G++ used to
23111 support. */
23114 {
23115 /* Consume the `return' keyword. */
23117 /* Look for the identifier that indicates what value is to be
23118 returned. */
23120 /* Issue an error message. */
23123 /* Skip tokens until we reach the start of the function body. */
23125 {
23132 }
23133 }
23134 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23135 anything declared inside `f'. */
23136 saved_in_unbraced_linkage_specification_p
23139 /* Inside the function, surrounding template-parameter-lists do not
23140 apply. */
23141 saved_num_template_parameter_lists
23147 /* If the next token is `try', `__transaction_atomic', or
23148 `__transaction_relaxed`, then we are looking at either function-try-block
23149 or function-transaction-block. Note that all of these include the
23150 function-body. */
23153 RID_TRANSACTION_ATOMIC);
23155 RID_TRANSACTION_RELAXED))
23157 RID_TRANSACTION_RELAXED);
23160 else
23161 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23166 /* Finish the function. */
23169 /* Generate code for it, if necessary. */
23171 /* Restore the saved values. */
23172 parser->in_unbraced_linkage_specification_p
23174 parser->num_template_parameter_lists
23178 parser->fully_implicit_function_template_p
23180 parser->implicit_template_parms
23182 parser->implicit_template_scope
23189 }
23191 /* Parse a template-declaration, assuming that the `export' (and
23192 `extern') keywords, if present, has already been scanned. MEMBER_P
23193 is as for cp_parser_template_declaration. */
23195 static void
23197 {
23200 tree parameter_list;
23205 /* Look for the `template' keyword. */
23210 /* And the `<'. */
23214 {
23215 /* 14.5.2.2 [temp.mem]
23217 A local class shall not have member templates. */
23222 }
23223 /* [temp]
23225 A template ... shall not have C linkage. */
23227 {
23229 /* Give it C++ linkage to avoid confusing other parts of the
23230 front end. */
23233 }
23234 else
23237 /* We cannot perform access checks on the template parameter
23238 declarations until we know what is being declared, just as we
23239 cannot check the decl-specifier list. */
23242 /* If the next token is `>', then we have an invalid
23243 specialization. Rather than complain about an invalid template
23244 parameter, issue an error message here. */
23246 {
23250 }
23251 else
23252 {
23253 /* Parse the template parameters. */
23255 }
23257 /* Get the deferred access checks from the parameter list. These
23258 will be checked once we know what is being declared, as for a
23259 member template the checks must be performed in the scope of the
23260 class containing the member. */
23263 /* Look for the `>'. */
23265 /* We just processed one more parameter list. */
23267 /* If the next token is `template', there are more template
23268 parameters. */
23270 RID_TEMPLATE))
23275 else
23276 {
23277 /* There are no access checks when parsing a template, as we do not
23278 know if a specialization will be a friend. */
23282 checks,
23283 member_p,
23288 /* If this is a member template declaration, let the front
23289 end know. */
23291 {
23296 }
23301 }
23302 /* We are done with the current parameter list. */
23307 /* Finish up. */
23310 /* Check the template arguments for a literal operator template. */
23314 {
23318 else
23319 {
23322 {
23328 }
23330 {
23338 }
23339 else
23341 }
23343 {
23346 " Expected non-type template argument pack <char...>"
23348 decl);
23349 else
23352 decl);
23353 }
23354 }
23355 /* Register member declarations. */
23358 /* For the erroneous case of a template with C linkage, we pushed an
23359 implicit C++ linkage scope; exit that scope now. */
23362 /* If DECL is a function template, we must return to parse it later.
23363 (Even though there is no definition, there might be default
23364 arguments that need handling.) */
23368 }
23370 /* Perform the deferred access checks from a template-parameter-list.
23371 CHECKS is a TREE_LIST of access checks, as returned by
23372 get_deferred_access_checks. */
23374 static void
23375 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23376 {
23380 }
23382 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23383 `function-definition' sequence that follows a template header.
23384 If MEMBER_P is true, this declaration appears in a class scope.
23386 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23387 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23389 static tree
23395 {
23398 cp_decl_specifier_seq decl_specifiers;
23402 /* This function is only used when processing a template
23403 declaration. */
23407 /* Defer access checks until we know what is being declared. */
23410 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23411 alternative. */
23414 CP_PARSER_FLAGS_OPTIONAL,
23420 /* There are no template typedefs. */
23422 {
23426 }
23428 /* Gather up the access checks that occurred the
23429 decl-specifier-seq. */
23432 /* Check for the declaration of a template class. */
23434 {
23436 {
23439 /* In this case:
23441 struct C {
23442 friend template <typename T> struct A<T>::B;
23443 };
23445 A<T>::B will be represented by a TYPENAME_TYPE, and
23446 therefore not recognized by shadow_tag. */
23448 && !decl
23455 else
23458 /* Perform access checks for template parameters. */
23460 }
23461 }
23463 /* Complain about missing 'typename' or other invalid type names. */
23466 {
23467 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23468 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23469 the rest of this declaration. */
23472 }
23474 /* If it's not a template class, try for a template function. If
23475 the next token is a `;', then this declaration does not declare
23476 anything. But, if there were errors in the decl-specifiers, then
23477 the error might well have come from an attempted class-specifier.
23478 In that case, there's no need to warn about a missing declarator. */
23482 {
23485 checks,
23487 member_p,
23488 declares_class_or_enum,
23490 NULL);
23492 /* 7.1.1-1 [dcl.stc]
23494 A storage-class-specifier shall not be specified in an explicit
23495 specialization... */
23497 && explicit_specialization_p
23499 {
23503 }
23507 }
23509 /* Look for a trailing `;' after the declaration. */
23515 out:
23518 /* Clear any current qualification; whatever comes next is the start
23519 of something new. */
23525 }
23527 /* Parse a cast-expression that is not the operand of a unary "&". */
23529 static tree
23531 {
23534 }
23536 /* Parse a functional cast to TYPE. Returns an expression
23537 representing the cast. */
23539 static tree
23541 {
23543 tree expression_list;
23544 tree cast;
23551 {
23559 tf_warning_or_error);
23560 }
23569 else
23570 {
23573 }
23576 tf_warning_or_error);
23577 /* [expr.const]/1: In an integral constant expression "only type
23578 conversions to integral or enumeration type can be used". */
23584 NIC_CONSTRUCTOR))
23587 }
23589 /* Save the tokens that make up the body of a member function defined
23590 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23591 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23592 specifiers applied to the declaration. Returns the FUNCTION_DECL
23593 for the member function. */
23595 static tree
23599 tree attributes)
23600 {
23603 tree fn;
23605 /* Create the FUNCTION_DECL. */
23608 /* If something went badly wrong, bail out now. */
23610 {
23611 /* If there's a function-body, skip it. */
23616 }
23618 /* Remember it, if there default args to post process. */
23621 /* Save away the tokens that make up the body of the
23622 function. */
23624 /* Handle function try blocks. */
23627 /* We can have braced-init-list mem-initializers before the fn body. */
23629 {
23632 {
23633 /* cache_group will stop after an un-nested { } pair, too. */
23637 /* variadic mem-inits have ... after the ')'. */
23640 }
23641 }
23643 /* Handle function try blocks. */
23648 /* Save away the inline definition; we will process it when the
23649 class is complete. */
23653 /* We need to know that this was defined in the class, so that
23654 friend templates are handled correctly. */
23657 /* Add FN to the queue of functions to be parsed later. */
23661 }
23663 /* Save the tokens that make up the in-class initializer for a non-static
23664 data member. Returns a DEFAULT_ARG. */
23666 static tree
23668 {
23670 }
23672 /* Parse a template-argument-list, as well as the trailing ">" (but
23673 not the opening "<"). See cp_parser_template_argument_list for the
23674 return value. */
23676 static tree
23678 {
23679 tree arguments;
23680 tree saved_scope;
23681 tree saved_qualifying_scope;
23682 tree saved_object_scope;
23687 /* [temp.names]
23689 When parsing a template-id, the first non-nested `>' is taken as
23690 the end of the template-argument-list rather than a greater-than
23691 operator. */
23692 saved_greater_than_is_operator_p
23695 /* Parsing the argument list may modify SCOPE, so we save it
23696 here. */
23700 /* We need to evaluate the template arguments, even though this
23701 template-id may be nested within a "sizeof". */
23706 /* Parse the template-argument-list itself. */
23710 else
23712 /* Look for the `>' that ends the template-argument-list. If we find
23713 a '>>' instead, it's probably just a typo. */
23715 {
23717 {
23718 /* In C++0x, a `>>' in a template argument list or cast
23719 expression is considered to be two separate `>'
23720 tokens. So, change the current token to a `>', but don't
23721 consume it: it will be consumed later when the outer
23722 template argument list (or cast expression) is parsed.
23723 Note that this replacement of `>' for `>>' is necessary
23724 even if we are parsing tentatively: in the tentative
23725 case, after calling
23726 cp_parser_enclosed_template_argument_list we will always
23727 throw away all of the template arguments and the first
23728 closing `>', either because the template argument list
23729 was erroneous or because we are replacing those tokens
23730 with a CPP_TEMPLATE_ID token. The second `>' (which will
23731 not have been thrown away) is needed either to close an
23732 outer template argument list or to complete a new-style
23733 cast. */
23736 }
23738 {
23739 /* If we're in a nested template argument list, the '>>' has
23740 to be a typo for '> >'. We emit the error message, but we
23741 continue parsing and we push a '>' as next token, so that
23742 the argument list will be parsed correctly. Note that the
23743 global source location is still on the token before the
23744 '>>', so we need to say explicitly where we want it. */
23750 }
23751 else
23752 {
23753 /* If this is not a nested template argument list, the '>>'
23754 is a typo for '>'. Emit an error message and continue.
23755 Same deal about the token location, but here we can get it
23756 right by consuming the '>>' before issuing the diagnostic. */
23759 "spurious %<>>%>, use %<>%> to terminate "
23761 }
23762 }
23763 else
23765 /* The `>' token might be a greater-than operator again now. */
23766 parser->greater_than_is_operator_p
23768 /* Restore the SAVED_SCOPE. */
23776 }
23778 /* MEMBER_FUNCTION is a member function, or a friend. If default
23779 arguments, or the body of the function have not yet been parsed,
23780 parse them now. */
23782 static void
23784 {
23786 /* If this member is a template, get the underlying
23787 FUNCTION_DECL. */
23791 /* There should not be any class definitions in progress at this
23792 point; the bodies of members are only parsed outside of all class
23793 definitions. */
23795 /* While we're parsing the member functions we might encounter more
23796 classes. We want to handle them right away, but we don't want
23797 them getting mixed up with functions that are currently in the
23798 queue. */
23801 /* Make sure that any template parameters are in scope. */
23804 /* If the body of the function has not yet been parsed, parse it
23805 now. */
23807 {
23808 tree function_scope;
23811 /* The function is no longer pending; we are processing it. */
23816 /* If this is a local class, enter the scope of the containing
23817 function. */
23822 /* Push the body of the function onto the lexer stack. */
23825 /* Let the front end know that we going to be defining this
23826 function. */
23830 /* Don't do access checking if it is a templated function. */
23834 /* #pragma omp declare reduction needs special parsing. */
23836 {
23841 }
23842 else
23843 /* Now, parse the body of the function. */
23850 /* Leave the scope of the containing function. */
23854 }
23856 /* Remove any template parameters from the symbol table. */
23859 /* Restore the queue. */
23862 }
23864 /* If DECL contains any default args, remember it on the unparsed
23865 functions queue. */
23867 static void
23869 {
23870 tree probe;
23873 probe;
23876 {
23880 }
23881 }
23883 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23884 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23885 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23886 from the parameter-type-list. */
23888 static tree
23891 {
23893 tree parsed_arg;
23899 /* Push the saved tokens for the default argument onto the parser's
23900 lexer stack. */
23906 /* Parse the default argument. */
23917 {
23918 /* In a non-template class, check conversions now. In a template,
23919 we'll wait and instantiate these as needed. */
23922 tf_warning_or_error);
23923 else
23925 }
23927 /* If the token stream has not been completely used up, then
23928 there was extra junk after the end of the default
23929 argument. */
23931 {
23934 else
23936 }
23938 /* Revert to the main lexer. */
23942 }
23944 /* FIELD is a non-static data member with an initializer which we saved for
23945 later; parse it now. */
23947 static void
23949 {
23950 tree def;
23957 NULL_TREE);
23963 }
23965 /* FN is a FUNCTION_DECL which may contains a parameter with an
23966 unparsed DEFAULT_ARG. Parse the default args now. This function
23967 assumes that the current scope is the scope in which the default
23968 argument should be processed. */
23970 static void
23972 {
23976 /* While we're parsing the default args, we might (due to the
23977 statement expression extension) encounter more classes. We want
23978 to handle them right away, but we don't want them getting mixed
23979 up with default args that are currently in the queue. */
23982 /* Local variable names (and the `this' keyword) may not appear
23983 in a default argument. */
23994 {
23996 tree parsed_arg;
23998 tree copy;
24005 /* This can happen for a friend declaration for a function
24006 already declared with default arguments. */
24009 parsed_arg
24011 default_arg,
24014 {
24016 }
24020 /* Update any instantiations we've already created. */
24024 }
24028 /* Make sure no default arg is missing. */
24031 /* Restore the state of local_variables_forbidden_p. */
24034 /* Restore the queue. */
24036 }
24038 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24040 sizeof ... ( identifier )
24042 where the 'sizeof' token has already been consumed. */
24044 static tree
24046 {
24047 /* Consume the `...'. */
24054 else
24062 /* The name is not qualified. */
24080 }
24082 /* Parse the operand of `sizeof' (or a similar operator). Returns
24083 either a TYPE or an expression, depending on the form of the
24084 input. The KEYWORD indicates which kind of expression we have
24085 encountered. */
24087 static tree
24089 {
24096 /* If it's a `...', then we are computing the length of a parameter
24097 pack. */
24102 /* Types cannot be defined in a `sizeof' expression. Save away the
24103 old message. */
24105 /* And create the new one. */
24111 /* The restrictions on constant-expressions do not apply inside
24112 sizeof expressions. */
24113 saved_integral_constant_expression_p
24115 saved_non_integral_constant_expression_p
24119 /* Do not actually evaluate the expression. */
24122 /* If it's a `(', then we might be looking at the type-id
24123 construction. */
24125 {
24128 /* We can't be sure yet whether we're looking at a type-id or an
24129 expression. */
24131 /* Note: as a GNU Extension, compound literals are considered
24132 postfix-expressions as they are in C99, so they are valid
24133 arguments to sizeof. See comment in cp_parser_cast_expression
24134 for details. */
24137 else
24138 {
24141 /* Look for the type-id. */
24143 /* Look for the closing `)'. */
24146 }
24148 /* If all went well, then we're done. */
24150 {
24151 cp_decl_specifier_seq decl_specs;
24153 /* Build a trivial decl-specifier-seq. */
24157 /* Call grokdeclarator to figure out what type this is. */
24160 TYPENAME,
24163 }
24164 }
24166 /* If the type-id production did not work out, then we must be
24167 looking at the unary-expression production. */
24172 /* Go back to evaluating expressions. */
24176 /* Free the message we created. */
24178 /* And restore the old one. */
24180 parser->integral_constant_expression_p
24182 parser->non_integral_constant_expression_p
24186 }
24188 /* If the current declaration has no declarator, return true. */
24190 static bool
24192 {
24193 /* If the next token is a `;' or a `,' then there is no
24194 declarator. */
24197 }
24199 /* Update the DECL_SPECS to reflect the storage class indicated by
24200 KEYWORD. */
24202 static void
24207 {
24208 cp_storage_class storage_class;
24211 {
24215 }
24217 {
24220 }
24225 {
24228 }
24231 {
24249 }
24253 /* A storage class specifier cannot be applied alongside a typedef
24254 specifier. If there is a typedef specifier present then set
24255 conflicting_specifiers_p which will trigger an error later
24256 on in grokdeclarator. */
24259 }
24261 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24262 is true, the type is a class or enum definition. */
24264 static void
24266 tree type_spec,
24269 {
24272 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24273 (with, for example, in "typedef int wchar_t;") we remember that
24274 this is what happened. In system headers, we ignore these
24275 declarations so that G++ can work with system headers that are not
24276 C++-safe. */
24278 && !type_definition_p
24288 {
24291 ds_redefined_builtin_type_spec,
24292 token);
24294 {
24298 }
24299 }
24302 else
24303 {
24308 }
24309 }
24311 /* True iff TOKEN is the GNU keyword __thread. */
24313 static bool
24315 {
24318 }
24320 /* Set the location for a declarator specifier and check if it is
24321 duplicated.
24323 DECL_SPECS is the sequence of declarator specifiers onto which to
24324 set the location.
24326 DS is the single declarator specifier to set which location is to
24327 be set onto the existing sequence of declarators.
24329 LOCATION is the location for the declarator specifier to
24330 consider. */
24332 static void
24335 {
24344 {
24348 }
24349 else
24350 {
24352 {
24356 else
24357 {
24360 OPT_Wlong_long,
24362 }
24363 }
24365 {
24370 else
24372 }
24373 else
24374 {
24390 "__complex"
24391 };
24394 }
24395 }
24396 }
24398 /* Return true iff the declarator specifier DS is present in the
24399 sequence of declarator specifiers DECL_SPECS. */
24401 bool
24403 cp_decl_spec ds)
24404 {
24411 }
24413 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24414 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24416 static bool
24418 {
24420 }
24422 /* Issue an error message indicating that TOKEN_DESC was expected.
24423 If KEYWORD is true, it indicated this function is called by
24424 cp_parser_require_keword and the required token can only be
24425 a indicated keyword. */
24427 static void
24429 required_token token_desc,
24431 {
24433 {
24502 }
24504 {
24506 {
24585 }
24586 }
24587 else
24589 }
24593 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24594 issue an error message indicating that TOKEN_DESC was expected.
24596 Returns the token consumed, if the token had the appropriate type.
24597 Otherwise, returns NULL. */
24602 required_token token_desc)
24603 {
24606 else
24607 {
24608 /* Output the MESSAGE -- unless we're parsing tentatively. */
24612 }
24613 }
24615 /* An error message is produced if the next token is not '>'.
24616 All further tokens are skipped until the desired token is
24617 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24619 static void
24621 {
24622 /* Current level of '< ... >'. */
24624 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24627 /* Are we ready, yet? If not, issue error message. */
24631 /* Skip tokens until the desired token is found. */
24633 {
24634 /* Peek at the next token. */
24636 {
24644 /* C++0x views the `>>' operator as two `>' tokens, but
24645 C++98 does not. */
24648 {
24649 /* We've hit a `>>' where the first `>' closes the
24650 template argument list, and the second `>' is
24651 spurious. Just consume the `>>' and stop; we've
24652 already produced at least one error. */
24655 }
24656 /* Fall through for C++0x, so we handle the second `>' in
24657 the `>>'. */
24661 {
24662 /* We've reached the token we want, consume it and stop. */
24665 }
24684 /* The '>' was probably forgotten, don't look further. */
24689 }
24691 /* Consume this token. */
24693 }
24694 }
24696 /* If the next token is the indicated keyword, consume it. Otherwise,
24697 issue an error message indicating that TOKEN_DESC was expected.
24699 Returns the token consumed, if the token had the appropriate type.
24700 Otherwise, returns NULL. */
24705 required_token token_desc)
24706 {
24710 {
24713 }
24716 }
24718 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24719 function-definition. */
24721 static bool
24723 {
24726 /* A ctor-initializer begins with a `:'. */
24728 /* A function-try-block begins with `try'. */
24730 /* A function-transaction-block begins with `__transaction_atomic'
24731 or `__transaction_relaxed'. */
24734 /* The named return value extension begins with `return'. */
24736 }
24738 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24739 definition. */
24741 static bool
24743 {
24750 }
24752 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24753 C++0x) ending a template-argument. */
24755 static bool
24757 {
24765 }
24767 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24768 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24770 static bool
24773 {
24779 /* Check for the sequence `<::' in the original code. It would be lexed as
24780 `[:', where `[' is a digraph, and there is no whitespace before
24781 `:'. */
24783 {
24788 }
24790 }
24792 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24793 or none_type otherwise. */
24795 static enum tag_types
24797 {
24799 {
24809 }
24810 }
24812 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
24813 or none_type otherwise or if the token is null. */
24815 static enum tag_types
24817 {
24822 {
24830 }
24831 }
24833 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24835 static void
24837 {
24841 {
24845 type))
24848 }
24849 }
24851 /* Issue an error message if DECL is redeclared with different
24852 access than its original declaration [class.access.spec/3].
24853 This applies to nested classes and nested class templates.
24854 [class.mem/1]. */
24856 static void
24858 {
24867 }
24869 /* Look for the `template' keyword, as a syntactic disambiguator.
24870 Return TRUE iff it is present, in which case it will be
24871 consumed. */
24873 static bool
24875 {
24877 {
24878 /* In C++98 the `template' keyword can only be used within templates;
24879 outside templates the parser can always figure out what is a
24880 template and what is not. In C++11, per the resolution of DR 468,
24881 `template' is allowed in cases where it is not strictly necessary. */
24884 {
24887 "in C++98 %<template%> (as a disambiguator) is only "
24889 /* If this part of the token stream is rescanned, the same
24890 error message would be generated. So, we purge the token
24891 from the stream. */
24894 }
24895 else
24896 {
24897 /* Consume the `template' keyword. */
24900 }
24901 }
24903 }
24905 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24906 set PARSER->SCOPE, and perform other related actions. */
24908 static void
24910 {
24916 /* Get the stored value. */
24918 /* Perform any access checks that were deferred. */
24921 {
24926 }
24927 /* Set the scope from the stored value. */
24931 }
24933 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24934 encounter the end of a block before what we were looking for. */
24936 static bool
24940 {
24942 {
24945 /* Abort a parenthesized expression if we encounter a semicolon. */
24949 /* If we've reached the end of the file, stop. */
24955 /* We've hit the end of an enclosing block, so there's been some
24956 kind of syntax error. */
24959 /* Consume the token. */
24961 /* See if it starts a new group. */
24963 {
24965 /* In theory this should probably check end == '}', but
24966 cp_parser_save_member_function_body needs it to exit
24967 after either '}' or ')' when called with ')'. */
24970 }
24972 {
24976 }
24981 }
24982 }
24984 /* Like above, for caching a default argument or NSDMI. Both of these are
24985 terminated by a non-nested comma, but it can be unclear whether or not a
24986 comma is nested in a template argument list unless we do more parsing.
24987 In order to handle this ambiguity, when we encounter a ',' after a '<'
24988 we try to parse what follows as a parameter-declaration-list (in the
24989 case of a default argument) or a member-declarator (in the case of an
24990 NSDMI). If that succeeds, then we stop caching. */
24992 static tree
24994 {
24999 tree default_argument;
25001 /* Add tokens until we have processed the entire default
25002 argument. We add the range [first_token, token). */
25005 {
25006 /* For list-initialization, this is straightforward. */
25009 }
25011 {
25014 /* Peek at the next token. */
25016 /* What we do depends on what token we have. */
25018 {
25019 /* In valid code, a default argument must be
25020 immediately followed by a `,' `)', or `...'. */
25023 {
25024 /* If we've seen a '<', we might be in a
25025 template-argument-list. Until Core issue 325 is
25026 resolved, we don't know how this situation ought
25027 to be handled, so try to DTRT. We check whether
25028 what comes after the comma is a valid parameter
25029 declaration list. If it is, then the comma ends
25030 the default argument; otherwise the default
25031 argument continues. */
25034 /* Set ITALP so cp_parser_parameter_declaration_list
25035 doesn't decide to commit to this parse. */
25043 {
25050 }
25051 else
25052 {
25056 }
25063 }
25066 /* If we run into a non-nested `;', `}', or `]',
25067 then the code is invalid -- but the default
25068 argument is certainly over. */
25073 /* Handle correctly int n = sizeof ... ( p ); */
25076 /* Update DEPTH, if necessary. */
25091 /* This might be the comparison operator, or it might
25092 start a template argument list. */
25099 /* Fall through for C++0x, which treats the `>>'
25100 operator like two `>' tokens in certain
25101 cases. */
25105 {
25106 /* This might be an operator, or it might close a
25107 template argument list. But if a previous '<'
25108 started a template argument list, this will have
25109 closed it, so we can't be in one anymore. */
25113 }
25116 /* If we run out of tokens, issue an error message. */
25125 /* In these cases, we should look for template-ids.
25126 For example, if the default argument is
25127 `X<int, double>()', we need to do name lookup to
25128 figure out whether or not `X' is a template; if
25129 so, the `,' does not end the default argument.
25131 That is not yet done. */
25136 }
25138 /* If we've reached the end, stop. */
25142 /* Add the token to the token block. */
25144 }
25146 /* Create a DEFAULT_ARG to represent the unparsed default
25147 argument. */
25154 }
25156 /* Begin parsing tentatively. We always save tokens while parsing
25157 tentatively so that if the tentative parsing fails we can restore the
25158 tokens. */
25160 static void
25162 {
25163 /* Enter a new parsing context. */
25165 /* Begin saving tokens. */
25167 /* In order to avoid repetitive access control error messages,
25168 access checks are queued up until we are no longer parsing
25169 tentatively. */
25171 }
25173 /* Commit to the currently active tentative parse. */
25175 static void
25177 {
25181 /* Mark all of the levels as committed. */
25184 {
25191 }
25192 }
25194 /* Commit to the topmost currently active tentative parse.
25196 Note that this function shouldn't be called when there are
25197 irreversible side-effects while in a tentative state. For
25198 example, we shouldn't create a permanent entry in the symbol
25199 table, or issue an error message that might not apply if the
25200 tentative parse is aborted. */
25202 static void
25204 {
25209 {
25217 }
25218 }
25220 /* Abort the currently active tentative parse. All consumed tokens
25221 will be rolled back, and no diagnostics will be issued. */
25223 static void
25225 {
25229 /* Now, pretend that we want to see if the construct was
25230 successfully parsed. */
25232 }
25234 /* Stop parsing tentatively. If a parse error has occurred, restore the
25235 token stream. Otherwise, commit to the tokens we have consumed.
25236 Returns true if no error occurred; false otherwise. */
25238 static bool
25240 {
25244 /* Remember whether or not an error occurred, since we are about to
25245 destroy that information. */
25247 /* Remove the topmost context from the stack. */
25250 /* If no parse errors occurred, commit to the tentative parse. */
25252 {
25253 /* Commit to the tokens read tentatively, unless that was
25254 already done. */
25259 }
25260 /* Otherwise, if errors occurred, roll back our state so that things
25261 are just as they were before we began the tentative parse. */
25262 else
25263 {
25266 }
25267 /* Add the context to the front of the free list. */
25272 }
25274 /* Returns true if we are parsing tentatively and are not committed to
25275 this tentative parse. */
25277 static bool
25279 {
25282 }
25284 /* Returns nonzero iff an error has occurred during the most recent
25285 tentative parse. */
25287 static bool
25289 {
25292 }
25294 /* Returns nonzero if GNU extensions are allowed. */
25296 static bool
25298 {
25300 }
25301 \f
25302 /* Objective-C++ Productions */
25305 /* Parse an Objective-C expression, which feeds into a primary-expression
25306 above.
25308 objc-expression:
25309 objc-message-expression
25310 objc-string-literal
25311 objc-encode-expression
25312 objc-protocol-expression
25313 objc-selector-expression
25315 Returns a tree representation of the expression. */
25317 static tree
25319 {
25320 /* Try to figure out what kind of declaration is present. */
25324 {
25334 {
25346 }
25352 }
25355 }
25357 /* Parse an Objective-C message expression.
25359 objc-message-expression:
25360 [ objc-message-receiver objc-message-args ]
25362 Returns a representation of an Objective-C message. */
25364 static tree
25366 {
25375 }
25377 /* Parse an objc-message-receiver.
25379 objc-message-receiver:
25380 expression
25381 simple-type-specifier
25383 Returns a representation of the type or expression. */
25385 static tree
25387 {
25388 tree rcv;
25390 /* An Objective-C message receiver may be either (1) a type
25391 or (2) an expression. */
25400 CP_PARSER_FLAGS_NONE);
25403 }
25405 /* Parse the arguments and selectors comprising an Objective-C message.
25407 objc-message-args:
25408 objc-selector
25409 objc-selector-args
25410 objc-selector-args , objc-comma-args
25412 objc-selector-args:
25413 objc-selector [opt] : assignment-expression
25414 objc-selector-args objc-selector [opt] : assignment-expression
25416 objc-comma-args:
25417 assignment-expression
25418 objc-comma-args , assignment-expression
25420 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25421 selector arguments and TREE_VALUE containing a list of comma
25422 arguments. */
25424 static tree
25426 {
25432 {
25438 /* Detect if we have a unary selector. */
25447 sel_args
25452 }
25454 /* Handle non-selector arguments, if any. */
25456 {
25457 tree arg;
25462 addl_args
25467 }
25470 {
25473 }
25476 }
25478 /* Parse an Objective-C encode expression.
25480 objc-encode-expression:
25481 @encode objc-typename
25483 Returns an encoded representation of the type argument. */
25485 static tree
25487 {
25488 tree type;
25498 {
25502 }
25504 /* This happens if we find @encode(T) (where T is a template
25505 typename or something dependent on a template typename) when
25506 parsing a template. In that case, we can't compile it
25507 immediately, but we rather create an AT_ENCODE_EXPR which will
25508 need to be instantiated when the template is used.
25509 */
25511 {
25515 }
25518 }
25520 /* Parse an Objective-C @defs expression. */
25522 static tree
25524 {
25525 tree name;
25533 }
25535 /* Parse an Objective-C protocol expression.
25537 objc-protocol-expression:
25538 @protocol ( identifier )
25540 Returns a representation of the protocol expression. */
25542 static tree
25544 {
25545 tree proto;
25553 }
25555 /* Parse an Objective-C selector expression.
25557 objc-selector-expression:
25558 @selector ( objc-method-signature )
25560 objc-method-signature:
25561 objc-selector
25562 objc-selector-seq
25564 objc-selector-seq:
25565 objc-selector :
25566 objc-selector-seq objc-selector :
25568 Returns a representation of the method selector. */
25570 static tree
25572 {
25584 {
25593 {
25594 /* Detect if we have a unary selector. */
25596 {
25599 }
25600 else
25601 {
25603 }
25604 }
25609 {
25610 sel_seq
25613 sel_seq
25616 }
25617 else
25618 sel_seq
25623 }
25625 finish_selector:
25629 }
25631 /* Parse a list of identifiers.
25633 objc-identifier-list:
25634 identifier
25635 objc-identifier-list , identifier
25637 Returns a TREE_LIST of identifier nodes. */
25639 static tree
25641 {
25642 tree identifier;
25643 tree list;
25654 {
25661 identifier));
25663 }
25666 }
25668 /* Parse an Objective-C alias declaration.
25670 objc-alias-declaration:
25671 @compatibility_alias identifier identifier ;
25673 This function registers the alias mapping with the Objective-C front end.
25674 It returns nothing. */
25676 static void
25678 {
25686 }
25688 /* Parse an Objective-C class forward-declaration.
25690 objc-class-declaration:
25691 @class objc-identifier-list ;
25693 The function registers the forward declarations with the Objective-C
25694 front end. It returns nothing. */
25696 static void
25698 {
25701 {
25702 tree id;
25712 else
25714 }
25716 }
25718 /* Parse a list of Objective-C protocol references.
25720 objc-protocol-refs-opt:
25721 objc-protocol-refs [opt]
25723 objc-protocol-refs:
25724 < objc-identifier-list >
25726 Returns a TREE_LIST of identifiers, if any. */
25728 static tree
25730 {
25734 {
25738 }
25741 }
25743 /* Parse a Objective-C visibility specification. */
25745 static void
25747 {
25751 {
25766 }
25768 /* Eat '@private'/'@protected'/'@public'. */
25770 }
25772 /* Parse an Objective-C method type. Return 'true' if it is a class
25773 (+) method, and 'false' if it is an instance (-) method. */
25777 {
25780 else
25782 }
25784 /* Parse an Objective-C protocol qualifier. */
25786 static tree
25788 {
25801 {
25806 }
25809 }
25811 /* Parse an Objective-C typename. */
25813 static tree
25815 {
25819 {
25825 /* An ObjC type name may consist of just protocol qualifiers, in which
25826 case the type shall default to 'id'. */
25828 {
25831 /* If the type could not be parsed, an error has already
25832 been produced. For error recovery, behave as if it had
25833 not been specified, which will use the default type
25834 'id'. */
25836 {
25838 /* We need to skip to the closing parenthesis as
25839 cp_parser_type_id() does not seem to do it for
25840 us. */
25845 }
25846 }
25850 }
25853 }
25855 /* Check to see if TYPE refers to an Objective-C selector name. */
25857 static bool
25859 {
25865 }
25867 /* Parse an Objective-C selector. */
25869 static tree
25871 {
25875 {
25878 }
25880 /* C++ operator names are allowed to appear in ObjC selectors. */
25882 {
25895 }
25896 }
25898 /* Parse an Objective-C params list. */
25900 static tree
25902 {
25908 {
25918 /* Detect if we have a unary selector. */
25921 {
25924 }
25928 {
25929 /* Something went quite wrong. There should be a colon
25930 here, but there is not. Stop parsing parameters. */
25932 }
25934 /* New ObjC allows attributes on parameters too. */
25939 params
25942 type_name,
25943 identifier,
25944 parm_attr));
25947 }
25950 {
25953 }
25955 /* We allow tail attributes for the method. */
25957 {
25965 }
25968 {
25971 }
25973 }
25975 /* Parse the non-keyword Objective-C params. */
25977 static tree
25980 {
25986 {
25988 tree parm;
25994 {
25999 }
26001 /* TODO: parse attributes for tail parameters. */
26010 }
26012 /* We allow tail attributes for the method. */
26014 {
26016 {
26021 }
26022 else
26023 /* We have an error, but parse the attributes, so that we can
26024 carry on. */
26030 }
26033 }
26035 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26037 static void
26039 {
26042 /* If the next token is `extern' and the following token is a string
26043 literal, then we have a linkage specification. */
26045 && cp_parser_is_pure_string_literal
26048 /* Handle #pragma, if any. */
26051 /* Allow stray semicolons. */
26054 /* Mark methods as optional or required, when building protocols. */
26056 {
26059 }
26061 {
26064 }
26067 /* Other stray characters must generate errors. */
26069 {
26073 }
26074 /* Finally, try to parse a block-declaration, or a function-definition. */
26075 else
26077 }
26079 /* Parse a method signature. */
26081 static tree
26083 {
26099 }
26101 static bool
26103 {
26104 tree tattr;
26109 /* If the attributes are followed by a method introducer, this is not allowed.
26110 Dump the attributes and flag the situation. */
26115 /* Otherwise, the attributes introduce some interstitial code, possibly so
26116 rewind to allow that check. */
26119 }
26121 /* Parse an Objective-C method prototype list. */
26123 static void
26125 {
26129 {
26131 {
26136 else
26140 {
26144 }
26147 }
26153 OPT_Wattributes,
26155 else
26156 /* Allow for interspersed non-ObjC++ code. */
26160 }
26164 else
26168 }
26170 /* Parse an Objective-C method definition list. */
26172 static void
26174 {
26178 {
26179 tree meth;
26182 {
26188 else
26193 {
26197 }
26199 NULL_TREE);
26201 /* For historical reasons, we accept an optional semicolon. */
26208 {
26215 }
26216 }
26217 /* The following case will be removed once @synthesize is
26218 completely implemented. */
26229 else
26230 /* Allow for interspersed non-ObjC++ code. */
26234 }
26238 else
26242 }
26244 /* Parse Objective-C ivars. */
26246 static void
26248 {
26259 {
26260 cp_decl_specifier_seq declspecs;
26262 tree prefix_attributes;
26270 CP_PARSER_FLAGS_OPTIONAL,
26274 /* auto, register, static, extern, mutable. */
26276 {
26279 }
26281 /* thread_local. */
26283 {
26286 }
26288 /* typedef. */
26290 {
26293 }
26298 /* Keep going until we hit the `;' at the end of the
26299 declaration. */
26301 {
26306 /* Check for a (possibly unnamed) bitfield declaration. */
26314 {
26315 /* Get the name of the bitfield. */
26318 sfk_none);
26320 eat_colon:
26322 /* Get the width of the bitfield. */
26323 width
26326 NULL);
26327 }
26328 else
26329 {
26330 /* Parse the declarator. */
26331 declarator
26337 }
26339 /* Look for attributes that apply to the ivar. */
26341 /* Remember which attributes are prefix attributes and
26342 which are not. */
26344 /* Combine the attributes. */
26348 /* Create the bitfield declaration. */
26350 width,
26351 attributes);
26352 else
26357 /* Add the instance variable. */
26361 /* Reset PREFIX_ATTRIBUTES. */
26370 {
26373 }
26375 }
26379 }
26384 /* Do not consume the RID_AT_END, so it will be read again as terminating
26385 the @interface of @implementation. */
26389 /* For historical reasons, we accept an optional semicolon. */
26392 }
26394 /* Parse an Objective-C protocol declaration. */
26396 static void
26398 {
26404 {
26409 }
26411 /* See if we have a forward declaration or a definition. */
26414 /* Try a forward declaration first. */
26416 {
26418 {
26419 tree id;
26429 else
26431 }
26433 }
26435 /* Ok, we got a full-fledged definition (or at least should). */
26436 else
26437 {
26442 }
26443 }
26445 /* Parse an Objective-C superclass or category. */
26447 static void
26452 {
26458 {
26461 }
26463 {
26466 /* If there is no category name, and this is an @interface, we
26467 have a class extension. */
26469 {
26472 }
26473 else
26477 }
26478 }
26480 /* Parse an Objective-C class interface. */
26482 static void
26484 {
26491 {
26492 /* It's hard to recover because even if valid @interface stuff
26493 is to follow, we can't compile it (or validate it) if we
26494 don't even know which class it refers to. Let's assume this
26495 was a stray '@interface' token in the stream and skip it.
26496 */
26498 }
26503 /* We have either a class or a category on our hands. */
26506 else
26507 {
26509 /* Handle instance variable declarations, if any. */
26512 }
26515 }
26517 /* Parse an Objective-C class implementation. */
26519 static void
26521 {
26528 {
26529 /* It's hard to recover because even if valid @implementation
26530 stuff is to follow, we can't compile it (or validate it) if
26531 we don't even know which class it refers to. Let's assume
26532 this was a stray '@implementation' token in the stream and
26533 skip it.
26534 */
26536 }
26540 /* We have either a class or a category on our hands. */
26543 else
26544 {
26546 /* Handle instance variable declarations, if any. */
26549 }
26552 }
26554 /* Consume the @end token and finish off the implementation. */
26556 static void
26558 {
26561 }
26563 /* Parse an Objective-C declaration. */
26565 static void
26567 {
26568 /* Try to figure out what kind of declaration is present. */
26573 {
26589 }
26592 {
26615 }
26616 }
26618 /* Parse an Objective-C try-catch-finally statement.
26620 objc-try-catch-finally-stmt:
26621 @try compound-statement objc-catch-clause-seq [opt]
26622 objc-finally-clause [opt]
26624 objc-catch-clause-seq:
26625 objc-catch-clause objc-catch-clause-seq [opt]
26627 objc-catch-clause:
26628 @catch ( objc-exception-declaration ) compound-statement
26630 objc-finally-clause:
26631 @finally compound-statement
26633 objc-exception-declaration:
26634 parameter-declaration
26635 '...'
26637 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26639 Returns NULL_TREE.
26641 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26642 for C. Keep them in sync. */
26644 static tree
26646 {
26647 location_t location;
26648 tree stmt;
26653 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26654 node, lest it get absorbed into the surrounding block. */
26660 {
26669 {
26670 /* We have "@catch (...)" (where the '...' are literally
26671 what is in the code). Skip the '...'.
26672 parameter_declaration is set to NULL_TREE, and
26673 objc_being_catch_clauses() knows that that means
26674 '...'. */
26677 }
26678 else
26679 {
26680 /* We have "@catch (NSException *exception)" or something
26681 like that. Parse the parameter declaration. */
26685 else
26690 }
26693 else
26694 {
26695 /* If there was no open parenthesis, we are recovering from
26696 an error, and we are trying to figure out what mistake
26697 the user has made. */
26699 /* If there is an immediate closing parenthesis, the user
26700 probably forgot the opening one (ie, they typed "@catch
26701 NSException *e)". Parse the closing parenthesis and keep
26702 going. */
26706 /* If these is no immediate closing parenthesis, the user
26707 probably doesn't know that parenthesis are required at
26708 all (ie, they typed "@catch NSException *e"). So, just
26709 forget about the closing parenthesis and keep going. */
26710 }
26714 }
26716 {
26719 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26720 node, lest it get absorbed into the surrounding block. */
26724 }
26727 }
26729 /* Parse an Objective-C synchronized statement.
26731 objc-synchronized-stmt:
26732 @synchronized ( expression ) compound-statement
26734 Returns NULL_TREE. */
26736 static tree
26738 {
26739 location_t location;
26750 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26751 node, lest it get absorbed into the surrounding block. */
26756 }
26758 /* Parse an Objective-C throw statement.
26760 objc-throw-stmt:
26761 @throw assignment-expression [opt] ;
26763 Returns a constructed '@throw' statement. */
26765 static tree
26767 {
26779 }
26781 /* Parse an Objective-C statement. */
26783 static tree
26785 {
26786 /* Try to figure out what kind of declaration is present. */
26790 {
26801 }
26804 }
26806 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26807 look ahead to see if an objc keyword follows the attributes. This
26808 is to detect the use of prefix attributes on ObjC @interface and
26809 @protocol. */
26811 static bool
26813 {
26818 {
26821 }
26824 }
26826 /* This routine is a minimal replacement for
26827 c_parser_struct_declaration () used when parsing the list of
26828 types/names or ObjC++ properties. For example, when parsing the
26829 code
26831 @property (readonly) int a, b, c;
26833 this function is responsible for parsing "int a, int b, int c" and
26834 returning the declarations as CHAIN of DECLs.
26836 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26837 similar parsing. */
26838 static tree
26840 {
26842 cp_decl_specifier_seq declspecs;
26844 tree prefix_attributes;
26847 CP_PARSER_FLAGS_NONE,
26854 /* auto, register, static, extern, mutable. */
26856 {
26859 }
26861 /* thread_local. */
26863 {
26866 }
26868 /* typedef. */
26870 {
26873 }
26878 /* Keep going until we hit the `;' at the end of the declaration. */
26880 {
26885 /* Parse the declarator. */
26889 /* Look for attributes that apply to the ivar. */
26891 /* Remember which attributes are prefix attributes and
26892 which are not. */
26894 /* Combine the attributes. */
26904 /* Reset PREFIX_ATTRIBUTES. */
26915 {
26918 }
26919 else
26921 }
26923 }
26925 /* Parse an Objective-C @property declaration. The syntax is:
26927 objc-property-declaration:
26928 '@property' objc-property-attributes[opt] struct-declaration ;
26930 objc-property-attributes:
26931 '(' objc-property-attribute-list ')'
26933 objc-property-attribute-list:
26934 objc-property-attribute
26935 objc-property-attribute-list, objc-property-attribute
26937 objc-property-attribute
26938 'getter' = identifier
26939 'setter' = identifier
26940 'readonly'
26941 'readwrite'
26942 'assign'
26943 'retain'
26944 'copy'
26945 'nonatomic'
26947 For example:
26948 @property NSString *name;
26949 @property (readonly) id object;
26950 @property (retain, nonatomic, getter=getTheName) id name;
26951 @property int a, b, c;
26953 PS: This function is identical to
26954 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26955 static void
26957 {
26958 /* The following variables hold the attributes of the properties as
26959 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26960 seen. When we see an attribute, we set them to 'true' (if they
26961 are boolean properties) or to the identifier (if they have an
26962 argument, ie, for getter and setter). Note that here we only
26963 parse the list of attributes, check the syntax and accumulate the
26964 attributes that we find. objc_add_property_declaration() will
26965 then process the information. */
26975 /* 'properties' is the list of properties that we read. Usually a
26976 single one, but maybe more (eg, in "@property int a, b, c;" there
26977 are three). */
26978 tree properties;
26979 location_t loc;
26985 /* Parse the optional attribute list... */
26987 {
26988 /* Eat the '('. */
26992 {
26998 {
27001 }
27005 {
27016 {
27020 else
27025 }
27028 {
27032 }
27034 {
27036 {
27039 }
27040 else
27044 else
27046 }
27047 else
27048 {
27050 {
27053 }
27054 else
27056 }
27062 }
27069 else
27071 }
27073 /* FIXME: "@property (setter, assign);" will generate a spurious
27074 "error: expected ‘)’ before ‘,’ token". This is because
27075 cp_parser_require, unlike the C counterpart, will produce an
27076 error even if we are in error recovery. */
27078 {
27083 }
27084 }
27086 /* ... and the property declaration(s). */
27090 {
27092 /* If the next token is now a `;', consume it. */
27096 }
27100 else
27101 {
27102 /* Comma-separated properties are chained together in
27103 reverse order; add them one by one. */
27112 }
27115 }
27117 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27119 objc-synthesize-declaration:
27120 @synthesize objc-synthesize-identifier-list ;
27122 objc-synthesize-identifier-list:
27123 objc-synthesize-identifier
27124 objc-synthesize-identifier-list, objc-synthesize-identifier
27126 objc-synthesize-identifier
27127 identifier
27128 identifier = identifier
27130 For example:
27131 @synthesize MyProperty;
27132 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27134 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27135 for C. Keep them in sync.
27136 */
27137 static void
27139 {
27141 location_t loc;
27146 {
27150 {
27153 }
27155 {
27159 {
27162 }
27163 }
27164 else
27169 else
27171 }
27174 }
27176 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27178 objc-dynamic-declaration:
27179 @dynamic identifier-list ;
27181 For example:
27182 @dynamic MyProperty;
27183 @dynamic MyProperty, AnotherProperty;
27185 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27186 for C. Keep them in sync.
27187 */
27188 static void
27190 {
27192 location_t loc;
27197 {
27198 tree property;
27201 {
27204 }
27208 else
27210 }
27213 }
27215 \f
27216 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27218 /* Returns name of the next clause.
27219 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27220 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27221 returned and the token is consumed. */
27223 static pragma_omp_clause
27225 {
27237 {
27242 {
27345 }
27346 }
27352 }
27354 /* Validate that a clause of the given type does not already exist. */
27356 static void
27359 {
27360 tree c;
27364 {
27367 }
27368 }
27370 /* OpenMP 2.5:
27371 variable-list:
27372 identifier
27373 variable-list , identifier
27375 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27376 colon). An opening parenthesis will have been consumed by the caller.
27378 If KIND is nonzero, create the appropriate node and install the decl
27379 in OMP_CLAUSE_DECL and add the node to the head of the list.
27381 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27382 return the list created.
27384 COLON can be NULL if only closing parenthesis should end the list,
27385 or pointer to bool which will receive false if the list is terminated
27386 by closing parenthesis or true if the list is terminated by colon. */
27388 static tree
27391 {
27395 {
27398 }
27400 {
27417 {
27419 {
27425 {
27432 NULL);
27434 parser->colon_corrects_to_scope_p
27438 else
27439 {
27440 /* Look for `:'. */
27444 CPP_CLOSE_SQUARE))
27447 NULL);
27448 }
27449 /* Look for the closing `]'. */
27451 RT_CLOSE_SQUARE))
27454 }
27458 }
27464 }
27465 else
27468 get_comma:
27472 }
27478 {
27482 }
27485 {
27488 /* Try to resync to an unnested comma. Copied from
27489 cp_parser_parenthesized_expression_list. */
27490 skip_comma:
27499 }
27502 }
27504 /* Similarly, but expect leading and trailing parenthesis. This is a very
27505 common case for omp clauses. */
27507 static tree
27509 {
27513 }
27515 /* OpenMP 3.0:
27516 collapse ( constant-expression ) */
27518 static tree
27520 {
27522 location_t loc;
27523 HOST_WIDE_INT n;
27543 {
27546 }
27554 }
27556 /* OpenMP 2.5:
27557 default ( shared | none ) */
27559 static tree
27561 {
27563 tree c;
27568 {
27573 {
27588 }
27591 }
27592 else
27593 {
27594 invalid_kind:
27596 }
27612 }
27614 /* OpenMP 3.1:
27615 final ( expression ) */
27617 static tree
27619 {
27640 }
27642 /* OpenMP 2.5:
27643 if ( expression ) */
27645 static tree
27647 {
27668 }
27670 /* OpenMP 3.1:
27671 mergeable */
27673 static tree
27676 {
27677 tree c;
27680 location);
27685 }
27687 /* OpenMP 2.5:
27688 nowait */
27690 static tree
27693 {
27694 tree c;
27701 }
27703 /* OpenMP 2.5:
27704 num_threads ( expression ) */
27706 static tree
27708 location_t location)
27709 {
27731 }
27733 /* OpenMP 2.5:
27734 ordered */
27736 static tree
27739 {
27740 tree c;
27748 }
27750 /* OpenMP 2.5:
27751 reduction ( reduction-operator : variable-list )
27753 reduction-operator:
27754 One of: + * - & ^ | && ||
27756 OpenMP 3.1:
27758 reduction-operator:
27759 One of: + * - & ^ | && || min max
27761 OpenMP 4.0:
27763 reduction-operator:
27764 One of: + * - & ^ | && ||
27765 id-expression */
27767 static tree
27769 {
27777 {
27787 }
27791 else
27792 {
27803 {
27833 }
27834 else
27835 {
27837 resync_fail:
27842 }
27843 }
27849 NULL);
27851 {
27854 }
27857 }
27859 /* OpenMP 2.5:
27860 schedule ( schedule-kind )
27861 schedule ( schedule-kind , expression )
27863 schedule-kind:
27864 static | dynamic | guided | runtime | auto */
27866 static tree
27868 {
27877 {
27882 {
27903 }
27904 }
27909 else
27914 {
27929 else
27934 }
27942 invalid_kind:
27944 resync_fail:
27949 }
27951 /* OpenMP 3.0:
27952 untied */
27954 static tree
27957 {
27958 tree c;
27965 }
27967 /* OpenMP 4.0:
27968 inbranch
27969 notinbranch */
27971 static tree
27974 {
27979 }
27981 /* OpenMP 4.0:
27982 parallel
27983 for
27984 sections
27985 taskgroup */
27987 static tree
27991 {
27995 }
27997 /* OpenMP 4.0:
27998 num_teams ( expression ) */
28000 static tree
28002 location_t location)
28003 {
28025 }
28027 /* OpenMP 4.0:
28028 thread_limit ( expression ) */
28030 static tree
28032 location_t location)
28033 {
28055 }
28057 /* OpenMP 4.0:
28058 aligned ( variable-list )
28059 aligned ( variable-list : constant-expression ) */
28061 static tree
28063 {
28074 {
28084 }
28090 }
28092 /* OpenMP 4.0:
28093 linear ( variable-list )
28094 linear ( variable-list : expression ) */
28096 static tree
28099 {
28110 {
28114 {
28117 }
28125 }
28131 }
28133 /* OpenMP 4.0:
28134 safelen ( constant-expression ) */
28136 static tree
28138 location_t location)
28139 {
28160 }
28162 /* OpenMP 4.0:
28163 simdlen ( constant-expression ) */
28165 static tree
28167 location_t location)
28168 {
28189 }
28191 /* OpenMP 4.0:
28192 depend ( depend-kind : variable-list )
28194 depend-kind:
28195 in | out | inout */
28197 static tree
28199 {
28207 {
28217 else
28219 }
28220 else
28228 NULL);
28235 invalid_kind:
28237 resync_fail:
28242 }
28244 /* OpenMP 4.0:
28245 map ( map-kind : variable-list )
28246 map ( variable-list )
28248 map-kind:
28249 alloc | to | from | tofrom */
28251 static tree
28253 {
28262 {
28274 else
28275 {
28281 }
28284 }
28287 NULL);
28293 }
28295 /* OpenMP 4.0:
28296 device ( expression ) */
28298 static tree
28300 location_t location)
28301 {
28323 }
28325 /* OpenMP 4.0:
28326 dist_schedule ( static )
28327 dist_schedule ( static , expression ) */
28329 static tree
28331 location_t location)
28332 {
28345 {
28356 }
28361 location);
28365 invalid_kind:
28367 resync_fail:
28372 }
28374 /* OpenMP 4.0:
28375 proc_bind ( proc-bind-kind )
28377 proc-bind-kind:
28378 master | close | spread */
28380 static tree
28382 location_t location)
28383 {
28384 tree c;
28391 {
28401 else
28403 }
28404 else
28413 location);
28418 invalid_kind:
28420 resync_fail:
28425 }
28427 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28428 is a bitmask in MASK. Return the list of clauses found; the result
28429 of clause default goes in *pdefault. */
28431 static tree
28435 {
28442 {
28443 pragma_omp_clause c_kind;
28454 {
28466 clauses);
28480 clauses);
28489 clauses);
28513 clauses);
28527 clauses);
28544 OMP_CLAUSE_NOTINBRANCH,
28553 {
28554 clause_not_first:
28558 }
28583 clauses);
28588 clauses);
28593 clauses);
28656 }
28661 {
28662 /* Remove the invalid clause(s) from the list to avoid
28663 confusing the rest of the compiler. */
28666 }
28667 }
28668 saw_error:
28669 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28670 no reason to skip to the end. */
28676 }
28678 /* OpenMP 2.5:
28679 structured-block:
28680 statement
28682 In practice, we're also interested in adding the statement to an
28683 outer node. So it is convenient if we work around the fact that
28684 cp_parser_statement calls add_stmt. */
28686 static unsigned
28688 {
28691 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28692 This preserves the "not within loop or switch" style error messages
28693 for nonsense cases like
28694 void foo() {
28695 #pragma omp single
28696 break;
28697 }
28698 */
28703 }
28705 static void
28707 {
28709 }
28711 static tree
28713 {
28721 }
28723 /* OpenMP 2.5:
28724 # pragma omp atomic new-line
28725 expression-stmt
28727 expression-stmt:
28728 x binop= expr | x++ | ++x | x-- | --x
28729 binop:
28730 +, *, -, /, &, ^, |, <<, >>
28732 where x is an lvalue expression with scalar type.
28734 OpenMP 3.1:
28735 # pragma omp atomic new-line
28736 update-stmt
28738 # pragma omp atomic read new-line
28739 read-stmt
28741 # pragma omp atomic write new-line
28742 write-stmt
28744 # pragma omp atomic update new-line
28745 update-stmt
28747 # pragma omp atomic capture new-line
28748 capture-stmt
28750 # pragma omp atomic capture new-line
28751 capture-block
28753 read-stmt:
28754 v = x
28755 write-stmt:
28756 x = expr
28757 update-stmt:
28758 expression-stmt | x = x binop expr
28759 capture-stmt:
28760 v = expression-stmt
28761 capture-block:
28762 { v = x; update-stmt; } | { update-stmt; v = x; }
28764 OpenMP 4.0:
28765 update-stmt:
28766 expression-stmt | x = x binop expr | x = expr binop x
28767 capture-stmt:
28768 v = update-stmt
28769 capture-block:
28770 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28772 where x and v are lvalue expressions with scalar type. */
28774 static void
28776 {
28784 {
28789 {
28795 }
28796 }
28798 {
28810 else
28814 }
28816 {
28822 {
28827 {
28830 }
28831 }
28832 }
28836 {
28847 else
28853 {
28854 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28855 opcode. */
28860 }
28864 {
28867 }
28868 else
28869 {
28876 }
28879 }
28881 restart:
28886 {
28893 /* FALLTHROUGH */
28903 /* FALLTHROUGH */
28918 /* Undo effects of boolean_increment for post {in,de}crement. */
28920 /* FALLTHRU */
28924 {
28925 /* Undo effects of boolean_increment. */
28927 {
28928 /* This is pre or post increment. */
28933 && !structured_block
28937 }
28938 }
28939 /* FALLTHRU */
28942 {
28977 {
28981 }
28984 {
28990 {
28995 }
28997 {
29008 {
29010 {
29015 }
29016 else
29018 }
29022 }
29025 {
29032 }
29036 }
29040 {
29043 {
29051 }
29053 {
29058 }
29093 }
29104 /* FALLTHROUGH */
29109 }
29116 }
29117 stmt_done:
29119 {
29132 }
29134 {
29137 }
29138 done:
29144 saw_error:
29147 {
29151 {
29155 }
29156 }
29157 }
29160 /* OpenMP 2.5:
29161 # pragma omp barrier new-line */
29163 static void
29165 {
29168 }
29170 /* OpenMP 2.5:
29171 # pragma omp critical [(name)] new-line
29172 structured-block */
29174 static tree
29176 {
29180 {
29192 }
29197 }
29199 /* OpenMP 2.5:
29200 # pragma omp flush flush-vars[opt] new-line
29202 flush-vars:
29203 ( variable-list ) */
29205 static void
29207 {
29213 }
29215 /* Helper function, to parse omp for increment expression. */
29217 static tree
29219 {
29224 {
29227 }
29230 {
29239 /* Fall through: OpenMP disallows NE_EXPR. */
29242 }
29244 /* If decl is an iterator, preserve LHS and RHS of the relational
29245 expr until finish_omp_for. */
29255 }
29257 /* Helper function, to parse omp for increment expression. */
29259 static tree
29261 {
29265 cp_id_kind idk;
29269 {
29277 }
29285 {
29290 }
29297 {
29301 }
29313 do
29314 {
29321 {
29323 {
29326 else
29328 tf_warning_or_error);
29329 }
29330 else
29333 }
29334 }
29338 {
29342 }
29343 else
29347 }
29349 /* Parse the initialization statement of either an OpenMP for loop or
29350 a Cilk Plus for loop.
29352 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29353 Plus.
29355 Return true if the resulting construct should have an
29356 OMP_CLAUSE_PRIVATE added to it. */
29358 static bool
29366 {
29372 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29374 init-expr:
29375 var = lb
29376 integer-type var = lb
29377 random-access-iterator-type var = lb
29378 pointer-type var = lb
29379 */
29380 cp_decl_specifier_seq type_specifiers;
29382 /* First, try to parse as an initialized declaration. See
29383 cp_parser_condition, from whence the bulk of this is copied. */
29390 {
29391 /* If parsing a type specifier seq succeeded, then this
29392 MUST be a initialized declaration. */
29397 CP_PARSER_DECLARATOR_NAMED,
29408 else
29409 {
29419 {
29421 CPP_OPEN_PAREN))
29422 {
29426 else
29429 }
29430 else
29431 /* Trigger an error. */
29436 }
29440 {
29448 {
29451 auto_node);
29456 }
29459 asm_specification,
29460 LOOKUP_ONLYCONVERTING);
29462 {
29465 }
29466 else
29469 }
29470 else
29471 {
29472 /* Consume '='. */
29476 non_class:
29479 else
29482 asm_specification,
29483 LOOKUP_ONLYCONVERTING);
29484 }
29488 }
29489 }
29490 else
29491 {
29492 cp_id_kind idk;
29493 /* If parsing a type specifier sequence failed, then
29494 this MUST be a simple expression. */
29499 && decl
29502 {
29503 tree rhs;
29510 rhs,
29511 tf_warning_or_error));
29513 }
29514 else
29515 {
29520 {
29524 }
29525 }
29526 }
29528 }
29530 /* Parse the restricted form of the for statement allowed by OpenMP. */
29532 static tree
29535 {
29539 location_t loc_first;
29558 {
29561 location_t loc;
29564 {
29567 }
29576 add_private_clause
29584 {
29587 {
29593 }
29594 else
29596 }
29603 {
29608 {
29612 }
29615 {
29616 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29617 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29622 {
29625 }
29626 else
29627 {
29630 }
29634 }
29635 else
29636 {
29641 }
29642 }
29645 {
29646 tree c;
29648 {
29657 decl);
29661 decl);
29662 }
29664 {
29669 {
29672 }
29673 }
29674 }
29683 {
29684 /* If decl is an iterator, preserve the operator on decl
29685 until finish_omp_for. */
29687 && ((processing_template_decl
29691 else
29695 }
29710 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29711 in between the collapsed for loops to be still considered perfectly
29712 nested. Hopefully the final version clarifies this.
29713 For now handle (multiple) {'s and empty statements. */
29715 do
29716 {
29720 {
29722 bracecount++;
29723 }
29727 else
29728 {
29735 }
29736 }
29740 {
29743 }
29744 }
29746 /* Note that we saved the original contents of this flag when we entered
29747 the structured block, and so we don't need to re-save it here. */
29750 else
29753 /* Note that the grammar doesn't call for a structured block here,
29754 though the loop as a whole is a structured block. */
29761 else
29766 {
29768 {
29770 nbraces--;
29771 }
29774 else
29775 {
29777 {
29780 }
29785 }
29786 }
29793 }
29795 /* Helper function for OpenMP parsing, split clauses and call
29796 finish_omp_clauses on each of the set of clauses afterwards. */
29798 static void
29801 {
29807 }
29809 /* OpenMP 4.0:
29810 #pragma omp simd simd-clause[optseq] new-line
29811 for-loop */
29813 #define OMP_SIMD_CLAUSE_MASK \
29814 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29822 static tree
29825 {
29837 {
29840 }
29851 }
29853 /* OpenMP 2.5:
29854 #pragma omp for for-clause[optseq] new-line
29855 for-loop
29857 OpenMP 4.0:
29858 #pragma omp for simd for-simd-clause[optseq] new-line
29859 for-loop */
29861 #define OMP_FOR_CLAUSE_MASK \
29862 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29871 static tree
29874 {
29885 {
29890 {
29898 cclauses);
29902 cclauses);
29914 }
29915 }
29917 {
29920 }
29925 {
29928 }
29939 }
29941 /* OpenMP 2.5:
29942 # pragma omp master new-line
29943 structured-block */
29945 static tree
29947 {
29951 }
29953 /* OpenMP 2.5:
29954 # pragma omp ordered new-line
29955 structured-block */
29957 static tree
29959 {
29963 }
29965 /* OpenMP 2.5:
29967 section-scope:
29968 { section-sequence }
29970 section-sequence:
29971 section-directive[opt] structured-block
29972 section-sequence section-directive structured-block */
29974 static tree
29976 {
29987 {
29991 }
29994 {
30002 {
30006 }
30008 {
30011 }
30016 }
30027 }
30029 /* OpenMP 2.5:
30030 # pragma omp sections sections-clause[optseq] newline
30031 sections-scope */
30033 #define OMP_SECTIONS_CLAUSE_MASK \
30034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30040 static tree
30043 {
30055 {
30058 }
30065 }
30067 /* OpenMP 2.5:
30068 # pragma omp parallel parallel-clause[optseq] new-line
30069 structured-block
30070 # pragma omp parallel for parallel-for-clause[optseq] new-line
30071 structured-block
30072 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30073 structured-block
30075 OpenMP 4.0:
30076 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30077 structured-block */
30079 #define OMP_PARALLEL_CLAUSE_MASK \
30080 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30090 static tree
30093 {
30102 {
30115 block);
30120 }
30122 {
30126 }
30128 {
30131 }
30133 {
30137 {
30147 block);
30150 }
30151 }
30161 }
30163 /* OpenMP 2.5:
30164 # pragma omp single single-clause[optseq] new-line
30165 structured-block */
30167 #define OMP_SINGLE_CLAUSE_MASK \
30168 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30173 static tree
30175 {
30185 }
30187 /* OpenMP 3.0:
30188 # pragma omp task task-clause[optseq] new-line
30189 structured-block */
30191 #define OMP_TASK_CLAUSE_MASK \
30192 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30202 static tree
30204 {
30215 }
30217 /* OpenMP 3.0:
30218 # pragma omp taskwait new-line */
30220 static void
30222 {
30225 }
30227 /* OpenMP 3.1:
30228 # pragma omp taskyield new-line */
30230 static void
30232 {
30235 }
30237 /* OpenMP 4.0:
30238 # pragma omp taskgroup new-line
30239 structured-block */
30241 static tree
30243 {
30247 }
30250 /* OpenMP 2.5:
30251 # pragma omp threadprivate (variable-list) */
30253 static void
30255 {
30256 tree vars;
30262 }
30264 /* OpenMP 4.0:
30265 # pragma omp cancel cancel-clause[optseq] new-line */
30267 #define OMP_CANCEL_CLAUSE_MASK \
30268 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30274 static void
30276 {
30280 }
30282 /* OpenMP 4.0:
30283 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30285 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30286 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30291 static void
30293 {
30294 tree clauses;
30298 {
30303 {
30306 }
30307 }
30309 {
30313 }
30316 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30318 pragma_tok);
30320 }
30322 /* OpenMP 4.0:
30323 #pragma omp distribute distribute-clause[optseq] new-line
30324 for-loop */
30326 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30327 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30332 static tree
30335 {
30344 {
30352 else
30355 {
30361 {
30364 cclauses);
30365 else
30367 cclauses);
30368 }
30373 cclauses);
30374 else
30376 cclauses);
30388 }
30389 }
30391 {
30394 }
30399 {
30402 }
30413 }
30415 /* OpenMP 4.0:
30416 # pragma omp teams teams-clause[optseq] new-line
30417 structured-block */
30419 #define OMP_TEAMS_CLAUSE_MASK \
30420 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30428 static tree
30431 {
30440 {
30444 {
30452 cclauses);
30456 cclauses);
30467 }
30468 }
30470 {
30473 }
30478 {
30481 }
30489 }
30491 /* OpenMP 4.0:
30492 # pragma omp target data target-data-clause[optseq] new-line
30493 structured-block */
30495 #define OMP_TARGET_DATA_CLAUSE_MASK \
30496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30500 static tree
30502 {
30514 }
30516 /* OpenMP 4.0:
30517 # pragma omp target update target-update-clause[optseq] new-line */
30519 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30520 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30525 static bool
30528 {
30530 {
30532 "%<#pragma omp target update%> may only be "
30536 }
30538 tree clauses
30543 {
30545 "%<#pragma omp target update must contain at least one "
30548 }
30556 }
30558 /* OpenMP 4.0:
30559 # pragma omp target target-clause[optseq] new-line
30560 structured-block */
30562 #define OMP_TARGET_CLAUSE_MASK \
30563 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30567 static bool
30570 {
30572 {
30576 }
30579 {
30584 {
30592 {
30594 OMP_TARGET_CLAUSE_MASK,
30595 cclauses);
30597 }
30613 }
30615 {
30618 }
30620 {
30624 }
30626 {
30629 }
30630 }
30644 }
30646 /* OpenMP 4.0:
30647 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30649 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30657 static void
30660 {
30662 cp_omp_declare_simd_data data;
30664 {
30669 }
30680 {
30684 {
30697 }
30702 "%<#pragma omp declare simd%> not immediately followed by "
30706 }
30707 }
30709 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30710 This function is modelled similar to the late parsing of omp declare
30711 simd. */
30713 static tree
30715 {
30721 {
30727 }
30729 {
30733 }
30738 {
30745 NULL);
30759 }
30764 }
30766 /* Finalize #pragma omp declare simd clauses after direct declarator has
30767 been parsed, and put that into "omp declare simd" attribute. */
30769 static tree
30771 {
30777 {
30782 }
30787 {
30805 }
30809 }
30812 /* OpenMP 4.0:
30813 # pragma omp declare target new-line
30814 declarations and definitions
30815 # pragma omp end declare target new-line */
30817 static void
30819 {
30822 }
30824 static void
30826 {
30829 {
30832 }
30834 {
30838 {
30841 }
30844 else
30845 {
30849 }
30850 }
30851 else
30852 {
30856 }
30860 "%<#pragma omp end declare target%> without corresponding "
30862 else
30864 }
30866 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30867 expression and optional initializer clause of
30868 #pragma omp declare reduction. We store the expression(s) as
30869 either 3, 6 or 7 special statements inside of the artificial function's
30870 body. The first two statements are DECL_EXPRs for the artificial
30871 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30872 expression that uses those variables.
30873 If there was any INITIALIZER clause, this is followed by further statements,
30874 the fourth and fifth statements are DECL_EXPRs for the artificial
30875 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30876 constructor variant (first token after open paren is not omp_priv),
30877 then the sixth statement is a statement with the function call expression
30878 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30879 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30880 to initialize the OMP_PRIV artificial variable and there is seventh
30881 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30883 static bool
30885 {
30897 tree combiner;
30912 {
30915 }
30918 {
30925 {
30928 }
30944 {
30948 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30952 == CPP_CLOSE_PAREN
30955 {
30959 }
30964 }
30965 else
30966 {
30982 {
30987 }
30989 tree arg;
31002 }
31013 }
31019 }
31021 /* OpenMP 4.0
31022 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31023 initializer-clause[opt] new-line
31025 initializer-clause:
31026 initializer (omp_priv initializer)
31027 initializer (function-name (argument-list)) */
31029 static void
31032 {
31042 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31049 {
31081 }
31093 /* Types may not be defined in declare reduction type list. */
31096 parser->type_definition_forbidden_message
31102 saved_colon_doesnt_start_class_def_p
31107 {
31111 ;
31132 else
31137 else
31139 }
31141 /* Restore the saved message. */
31144 parser->colon_doesnt_start_class_def_p
31149 {
31150 fail:
31153 }
31159 {
31160 tree fntype
31163 NULL_TREE);
31182 {
31187 }
31189 {
31191 {
31200 }
31207 }
31208 else
31209 {
31212 }
31215 else
31218 {
31221 }
31223 {
31226 else
31231 }
31236 else
31237 {
31246 }
31253 }
31257 done:
31258 /* Free any declarators allocated. */
31260 }
31262 /* OpenMP 4.0
31263 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31264 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31265 initializer-clause[opt] new-line
31266 #pragma omp declare target new-line */
31268 static void
31271 {
31273 {
31278 {
31281 context);
31283 }
31286 {
31289 context);
31291 }
31293 {
31296 }
31298 {
31302 }
31303 }
31307 }
31309 /* Main entry point to OpenMP statement pragmas. */
31311 static void
31313 {
31314 tree stmt;
31319 {
31367 }
31371 }
31372 \f
31373 /* Transactional Memory parsing routines. */
31375 /* Parse a transaction attribute.
31377 txn-attribute:
31378 attribute
31379 [ [ identifier ] ]
31381 ??? Simplify this when C++0x bracket attributes are
31382 implemented properly. */
31384 static tree
31386 {
31401 {
31405 /* For keywords, use the canonical spelling,
31406 not the parsed identifier. */
31410 }
31411 else
31415 error1:
31418 }
31420 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31422 transaction-statement:
31423 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31424 compound-statement
31425 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31426 */
31428 static tree
31430 {
31445 else
31446 {
31450 }
31452 /* Parse a noexcept specification. */
31455 /* Keep track if we're in the lexical scope of an outer transaction. */
31467 }
31469 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31471 transaction-expression:
31472 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31473 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31474 */
31476 static tree
31478 {
31503 /* Set this early. This might mean that we allow transaction_cancel in
31504 an expression that we find out later actually has to be a constexpr.
31505 However, we expect that cxx_constant_value will be able to deal with
31506 this; also, if the noexcept has no constexpr, then what we parse next
31507 really is a transaction's body. */
31510 /* Parse a noexcept specification. */
31516 {
31523 }
31524 else
31525 {
31526 /* The only expression that is available got parsed for the noexcept
31527 already. noexcept is true then. */
31530 }
31539 }
31541 /* Parse a function-transaction-block.
31543 function-transaction-block:
31544 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31545 function-body
31546 __transaction_atomic txn-attribute[opt] function-try-block
31547 __transaction_relaxed ctor-initializer[opt] function-body
31548 __transaction_relaxed function-try-block
31549 */
31551 static bool
31553 {
31569 else
31570 {
31574 }
31582 else
31583 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31591 }
31593 /* Parse a __transaction_cancel statement.
31595 cancel-statement:
31596 __transaction_cancel txn-attribute[opt] ;
31597 __transaction_cancel txn-attribute[opt] throw-expression ;
31599 ??? Cancel and throw is not yet implemented. */
31601 static tree
31603 {
31609 RT_TRANSACTION_CANCEL);
31616 /* ??? Parse cancel-and-throw here. */
31621 {
31625 }
31627 {
31631 }
31633 {
31636 {
31642 }
31643 }
31645 {
31649 }
31655 }
31656 \f
31657 /* The parser. */
31661 \f
31662 /* Special handling for the first token or line in the file. The first
31663 thing in the file might be #pragma GCC pch_preprocess, which loads a
31664 PCH file, which is a GC collection point. So we need to handle this
31665 first pragma without benefit of an existing lexer structure.
31667 Always returns one token to the caller in *FIRST_TOKEN. This is
31668 either the true first token of the file, or the first token after
31669 the initial pragma. */
31671 static void
31673 {
31682 {
31689 }
31690 else
31693 /* Skip to the end of the pragma. */
31697 /* Now actually load the PCH file. */
31701 /* Read one more token to return to our caller. We have to do this
31702 after reading the PCH file in, since its pointers have to be
31703 live. */
31705 }
31707 /* Normal parsing of a pragma token. Here we can (and must) use the
31708 regular lexer. */
31710 static bool
31712 {
31724 {
31732 {
31742 }
31747 {
31757 }
31762 {
31768 "%<#pragma omp taskwait%> may only be "
31773 }
31778 {
31784 "%<#pragma omp taskyield%> may only be "
31789 }
31794 {
31800 "%<#pragma omp cancel%> may only be "
31805 }
31810 {
31816 "%<#pragma omp cancellation point%> may only be "
31821 }
31859 "%<#pragma omp section%> may only be used in "
31864 {
31871 {
31874 }
31877 }
31881 {
31885 }
31894 bad_stmt:
31897 }
31901 }
31903 /* The interface the pragma parsers have to the lexer. */
31905 enum cpp_ttype
31907 {
31920 else
31921 {
31925 }
31928 }
31930 \f
31931 /* External interface. */
31933 /* Parse one entire translation unit. */
31935 void
31937 {
31941 {
31944 }
31952 }
31954 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31955 vectorlength clause:
31956 Syntax:
31957 vectorlength ( constant-expression ) */
31959 static tree
31962 {
31964 tree expr;
31965 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31966 safelen clause. Thus, vectorlength is represented as OMP 4.0
31967 safelen. For SIMD-enabled function it is represented by OMP 4.0
31968 simdlen. */
31971 loc);
31972 else
31974 loc);
31982 /* If expr == error_mark_node, then don't emit any errors nor
31983 create a clause. if any of the above functions returns
31984 error mark node then they would have emitted an error message. */
31986 ;
31994 else
31995 {
31996 tree c;
31998 {
32003 }
32004 else
32005 {
32010 }
32011 }
32016 }
32018 /* Handles the Cilk Plus #pragma simd linear clause.
32019 Syntax:
32020 linear ( simd-linear-variable-list )
32022 simd-linear-variable-list:
32023 simd-linear-variable
32024 simd-linear-variable-list , simd-linear-variable
32026 simd-linear-variable:
32027 id-expression
32028 id-expression : simd-linear-step
32030 simd-linear-step:
32031 conditional-expression */
32033 static tree
32035 {
32041 {
32045 }
32050 {
32053 {
32057 }
32064 {
32068 }
32069 else
32070 {
32074 /* If present, parse the linear step. Otherwise, assume the default
32075 value of 1. */
32077 {
32084 {
32085 /* If an error has occurred, then the whole pragma is
32086 considered ill-formed. Thus, no reason to keep
32087 parsing. */
32090 }
32098 else
32100 "step size must be an integer constant "
32102 }
32104 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32110 }
32115 else
32116 {
32121 }
32122 }
32126 }
32128 /* Returns the name of the next clause. If the clause is not
32129 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32130 token is not consumed. Otherwise, the appropriate enum from the
32131 pragma_simd_clause is returned and the token is consumed. */
32133 static pragma_omp_clause
32135 {
32136 pragma_omp_clause clause_type;
32153 else
32158 }
32160 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32162 static tree
32164 {
32169 {
32170 pragma_omp_clause c_kind;
32177 /* Use the OpenMP 4.0 equivalent function. */
32180 /* Use the OpenMP 4.0 equivalent function. */
32182 clauses);
32184 /* Use the OMP 4.0 equivalent function. */
32186 clauses);
32188 /* Use the OMP 4.0 equivalent function. */
32190 else
32191 {
32195 }
32196 }
32202 else
32204 }
32206 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32208 static void
32210 {
32217 {
32221 }
32231 }
32233 /* Create an identifier for a generic parameter type (a synthesized
32234 template parameter implied by `auto' or a concept identifier). */
32237 static tree
32239 {
32243 }
32245 /* Predicate that behaves as is_auto_or_concept but matches the parent
32246 node of the generic type rather than the generic type itself. This
32247 allows for type transformation in add_implicit_template_parms. */
32251 {
32253 }
32255 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32256 (creating a new template parameter list if necessary). Returns the newly
32257 created template type parm. */
32259 tree
32261 {
32264 /* We are either continuing a function template that already contains implicit
32265 template parameters, creating a new fully-implicit function template, or
32266 extending an existing explicit function template with implicit template
32267 parameters. */
32275 {
32279 }
32280 else
32281 {
32282 /* Roll back to the existing template parameter scope (in the case of
32283 extending an explicit function template) or introduce a new template
32284 parameter scope ahead of the function parameter scope (or class scope
32285 in the case of out-of-line member definitions). The function scope is
32286 added back after template parameter synthesis below. */
32291 {
32294 }
32296 {
32297 /* If not defining a class, then any class scope is a scope level in
32298 an out-of-line member definition. In this case simply wind back
32299 beyond the first such scope to inject the template parameter list.
32300 Otherwise wind back to the class being defined. The latter can
32301 occur in class member friend declarations such as:
32303 class A {
32304 void foo (auto);
32305 };
32306 class B {
32307 friend void A::foo (auto);
32308 };
32310 The template parameter list synthesized for the friend declaration
32311 must be injected in the scope of 'B'. This can also occur in
32312 erroneous cases such as:
32314 struct A {
32315 struct B {
32316 void foo (auto);
32317 };
32318 void B::foo (auto) {}
32319 };
32321 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32322 but, nevertheless, the template parameter list synthesized for the
32323 declarator should be injected into the scope of 'A' as if the
32324 ill-formed template was specified explicitly. */
32327 {
32330 }
32331 }
32337 {
32338 /* Introduce a new template parameter list for implicit template
32339 parameters. */
32343 parser->implicit_template_scope
32350 }
32351 else
32352 {
32353 /* Synthesize implicit template parameters at the end of the explicit
32354 template parameter list. */
32361 parser->implicit_template_parms
32363 }
32364 }
32366 /* Synthesize a new template parameter and track the current template
32367 parameter chain with implicit_template_parms. */
32371 synth_id);
32372 tree new_parm
32374 input_location,
32381 parser->implicit_template_parms
32383 else
32388 /* If creating a fully implicit function template, start the new implicit
32389 template parameter list with this synthesized type, otherwise grow the
32390 current template parameter list. */
32393 {
32400 }
32401 else
32402 {
32407 }
32412 }
32414 /* Finish the declaration of a fully implicit function template. Such a
32415 template has no explicit template parameter list so has not been through the
32416 normal template head and tail processing. synthesize_implicit_template_parm
32417 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32418 provided if the declaration is a class member such that its template
32419 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32420 form is returned. Otherwise NULL_TREE is returned. */
32422 tree
32424 {
32429 {
32433 }
32443 }