| blob | ad99cab38cf64969e3e50aa6e4cc9a7e67cbd5f7 |
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_constant_expression
1969 static tree cp_parser_builtin_offsetof
1971 static tree cp_parser_lambda_expression
1973 static void cp_parser_lambda_introducer
1975 static bool cp_parser_lambda_declarator_opt
1977 static void cp_parser_lambda_body
1980 /* Statements [gram.stmt.stmt] */
1982 static void cp_parser_statement
1984 static void cp_parser_label_for_labeled_statement
1986 static tree cp_parser_expression_statement
1988 static tree cp_parser_compound_statement
1990 static void cp_parser_statement_seq_opt
1992 static tree cp_parser_selection_statement
1994 static tree cp_parser_condition
1996 static tree cp_parser_iteration_statement
1998 static bool cp_parser_for_init_statement
2000 static tree cp_parser_for
2002 static tree cp_parser_c_for
2004 static tree cp_parser_range_for
2006 static void do_range_for_auto_deduction
2008 static tree cp_parser_perform_range_for_lookup
2010 static tree cp_parser_range_for_member_function
2012 static tree cp_parser_jump_statement
2014 static void cp_parser_declaration_statement
2017 static tree cp_parser_implicitly_scoped_statement
2019 static void cp_parser_already_scoped_statement
2022 /* Declarations [gram.dcl.dcl] */
2024 static void cp_parser_declaration_seq_opt
2026 static void cp_parser_declaration
2028 static void cp_parser_block_declaration
2030 static void cp_parser_simple_declaration
2032 static void cp_parser_decl_specifier_seq
2034 static tree cp_parser_storage_class_specifier_opt
2036 static tree cp_parser_function_specifier_opt
2038 static tree cp_parser_type_specifier
2041 static tree cp_parser_simple_type_specifier
2043 static tree cp_parser_type_name
2045 static tree cp_parser_nonclass_name
2047 static tree cp_parser_elaborated_type_specifier
2049 static tree cp_parser_enum_specifier
2051 static void cp_parser_enumerator_list
2053 static void cp_parser_enumerator_definition
2055 static tree cp_parser_namespace_name
2057 static void cp_parser_namespace_definition
2059 static void cp_parser_namespace_body
2061 static tree cp_parser_qualified_namespace_specifier
2063 static void cp_parser_namespace_alias_definition
2065 static bool cp_parser_using_declaration
2067 static void cp_parser_using_directive
2069 static tree cp_parser_alias_declaration
2071 static void cp_parser_asm_definition
2073 static void cp_parser_linkage_specification
2075 static void cp_parser_static_assert
2077 static tree cp_parser_decltype
2080 /* Declarators [gram.dcl.decl] */
2082 static tree cp_parser_init_declarator
2083 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2088 static enum tree_code cp_parser_ptr_operator
2090 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2092 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2094 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2096 static tree cp_parser_late_return_type_opt
2098 static tree cp_parser_declarator_id
2100 static tree cp_parser_type_id
2102 static tree cp_parser_template_type_arg
2105 static tree cp_parser_type_id_1
2107 static void cp_parser_type_specifier_seq
2109 static tree cp_parser_parameter_declaration_clause
2111 static tree cp_parser_parameter_declaration_list
2115 static tree cp_parser_default_argument
2117 static void cp_parser_function_body
2119 static tree cp_parser_initializer
2121 static tree cp_parser_initializer_clause
2123 static tree cp_parser_braced_list
2128 static bool cp_parser_ctor_initializer_opt_and_function_body
2131 static tree cp_parser_late_parsing_omp_declare_simd
2134 static tree cp_parser_late_parsing_cilk_simd_fn_info
2137 static tree synthesize_implicit_template_parm
2139 static tree finish_fully_implicit_template
2142 /* Classes [gram.class] */
2144 static tree cp_parser_class_name
2146 static tree cp_parser_class_specifier
2148 static tree cp_parser_class_head
2150 static enum tag_types cp_parser_class_key
2152 static void cp_parser_type_parameter_key
2154 static void cp_parser_member_specification_opt
2156 static void cp_parser_member_declaration
2158 static tree cp_parser_pure_specifier
2160 static tree cp_parser_constant_initializer
2163 /* Derived classes [gram.class.derived] */
2165 static tree cp_parser_base_clause
2167 static tree cp_parser_base_specifier
2170 /* Special member functions [gram.special] */
2172 static tree cp_parser_conversion_function_id
2174 static tree cp_parser_conversion_type_id
2178 static bool cp_parser_ctor_initializer_opt
2180 static void cp_parser_mem_initializer_list
2182 static tree cp_parser_mem_initializer
2184 static tree cp_parser_mem_initializer_id
2187 /* Overloading [gram.over] */
2189 static tree cp_parser_operator_function_id
2191 static tree cp_parser_operator
2194 /* Templates [gram.temp] */
2196 static void cp_parser_template_declaration
2198 static tree cp_parser_template_parameter_list
2200 static tree cp_parser_template_parameter
2202 static tree cp_parser_type_parameter
2204 static tree cp_parser_template_id
2206 static tree cp_parser_template_name
2208 static tree cp_parser_template_argument_list
2210 static tree cp_parser_template_argument
2212 static void cp_parser_explicit_instantiation
2214 static void cp_parser_explicit_specialization
2217 /* Exception handling [gram.exception] */
2219 static tree cp_parser_try_block
2221 static bool cp_parser_function_try_block
2223 static void cp_parser_handler_seq
2225 static void cp_parser_handler
2227 static tree cp_parser_exception_declaration
2229 static tree cp_parser_throw_expression
2231 static tree cp_parser_exception_specification_opt
2233 static tree cp_parser_type_id_list
2236 /* GNU Extensions */
2238 static tree cp_parser_asm_specification_opt
2240 static tree cp_parser_asm_operand_list
2242 static tree cp_parser_asm_clobber_list
2244 static tree cp_parser_asm_label_list
2246 static bool cp_next_tokens_can_be_attribute_p
2248 static bool cp_next_tokens_can_be_gnu_attribute_p
2250 static bool cp_next_tokens_can_be_std_attribute_p
2252 static bool cp_nth_tokens_can_be_std_attribute_p
2254 static bool cp_nth_tokens_can_be_gnu_attribute_p
2256 static bool cp_nth_tokens_can_be_attribute_p
2258 static tree cp_parser_attributes_opt
2260 static tree cp_parser_gnu_attributes_opt
2262 static tree cp_parser_gnu_attribute_list
2264 static tree cp_parser_std_attribute
2266 static tree cp_parser_std_attribute_spec
2268 static tree cp_parser_std_attribute_spec_seq
2270 static bool cp_parser_extension_opt
2272 static void cp_parser_label_declaration
2275 /* Transactional Memory Extensions */
2277 static tree cp_parser_transaction
2279 static tree cp_parser_transaction_expression
2281 static bool cp_parser_function_transaction
2283 static tree cp_parser_transaction_cancel
2287 pragma_external,
2288 pragma_member,
2289 pragma_objc_icode,
2290 pragma_stmt,
2291 pragma_compound
2292 };
2293 static bool cp_parser_pragma
2296 /* Objective-C++ Productions */
2298 static tree cp_parser_objc_message_receiver
2300 static tree cp_parser_objc_message_args
2302 static tree cp_parser_objc_message_expression
2304 static tree cp_parser_objc_encode_expression
2306 static tree cp_parser_objc_defs_expression
2308 static tree cp_parser_objc_protocol_expression
2310 static tree cp_parser_objc_selector_expression
2312 static tree cp_parser_objc_expression
2314 static bool cp_parser_objc_selector_p
2316 static tree cp_parser_objc_selector
2318 static tree cp_parser_objc_protocol_refs_opt
2320 static void cp_parser_objc_declaration
2322 static tree cp_parser_objc_statement
2324 static bool cp_parser_objc_valid_prefix_attributes
2326 static void cp_parser_objc_at_property_declaration
2328 static void cp_parser_objc_at_synthesize_declaration
2330 static void cp_parser_objc_at_dynamic_declaration
2332 static tree cp_parser_objc_struct_declaration
2335 /* Utility Routines */
2337 static tree cp_parser_lookup_name
2339 static tree cp_parser_lookup_name_simple
2341 static tree cp_parser_maybe_treat_template_as_class
2343 static bool cp_parser_check_declarator_template_parameters
2345 static bool cp_parser_check_template_parameters
2347 static tree cp_parser_simple_cast_expression
2349 static tree cp_parser_global_scope_opt
2351 static bool cp_parser_constructor_declarator_p
2353 static tree cp_parser_function_definition_from_specifiers_and_declarator
2355 static tree cp_parser_function_definition_after_declarator
2357 static void cp_parser_template_declaration_after_export
2359 static void cp_parser_perform_template_parameter_access_checks
2361 static tree cp_parser_single_declaration
2363 static tree cp_parser_functional_cast
2365 static tree cp_parser_save_member_function_body
2367 static tree cp_parser_save_nsdmi
2369 static tree cp_parser_enclosed_template_argument_list
2371 static void cp_parser_save_default_args
2373 static void cp_parser_late_parsing_for_member
2375 static tree cp_parser_late_parse_one_default_arg
2377 static void cp_parser_late_parsing_nsdmi
2379 static void cp_parser_late_parsing_default_args
2381 static tree cp_parser_sizeof_operand
2383 static tree cp_parser_trait_expr
2385 static bool cp_parser_declares_only_class_p
2387 static void cp_parser_set_storage_class
2389 static void cp_parser_set_decl_spec_type
2391 static void set_and_check_decl_spec_loc
2394 static bool cp_parser_friend_p
2396 static void cp_parser_required_error
2402 static bool cp_parser_token_starts_function_definition_p
2404 static bool cp_parser_next_token_starts_class_definition_p
2406 static bool cp_parser_next_token_ends_template_argument_p
2408 static bool cp_parser_nth_token_starts_template_argument_list_p
2410 static enum tag_types cp_parser_token_is_class_key
2412 static enum tag_types cp_parser_token_is_type_parameter_key
2414 static void cp_parser_check_class_key
2416 static void cp_parser_check_access_in_redeclaration
2418 static bool cp_parser_optional_template_keyword
2420 static void cp_parser_pre_parsed_nested_name_specifier
2422 static bool cp_parser_cache_group
2424 static tree cp_parser_cache_defarg
2426 static void cp_parser_parse_tentatively
2428 static void cp_parser_commit_to_tentative_parse
2430 static void cp_parser_commit_to_topmost_tentative_parse
2432 static void cp_parser_abort_tentative_parse
2434 static bool cp_parser_parse_definitely
2438 static bool cp_parser_uncommitted_to_tentative_parse_p
2440 static void cp_parser_error
2442 static void cp_parser_name_lookup_error
2444 static bool cp_parser_simulate_error
2446 static bool cp_parser_check_type_definition
2448 static void cp_parser_check_for_definition_in_return_type
2450 static void cp_parser_check_for_invalid_template_id
2452 static bool cp_parser_non_integral_constant_expression
2454 static void cp_parser_diagnose_invalid_type_name
2456 static bool cp_parser_parse_and_diagnose_invalid_type_name
2458 static int cp_parser_skip_to_closing_parenthesis
2460 static void cp_parser_skip_to_end_of_statement
2462 static void cp_parser_consume_semicolon_at_end_of_statement
2464 static void cp_parser_skip_to_end_of_block_or_statement
2466 static bool cp_parser_skip_to_closing_brace
2468 static void cp_parser_skip_to_end_of_template_parameter_list
2470 static void cp_parser_skip_to_pragma_eol
2472 static bool cp_parser_error_occurred
2474 static bool cp_parser_allow_gnu_extensions_p
2476 static bool cp_parser_is_pure_string_literal
2478 static bool cp_parser_is_string_literal
2480 static bool cp_parser_is_keyword
2482 static tree cp_parser_make_typename_type
2486 static bool cp_parser_compound_literal_p
2489 /* Returns nonzero if we are parsing tentatively. */
2493 {
2495 }
2497 /* Returns nonzero if TOKEN is a string literal. */
2499 static bool
2501 {
2507 }
2509 /* Returns nonzero if TOKEN is a string literal
2510 of a user-defined string literal. */
2512 static bool
2514 {
2521 }
2523 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2525 static bool
2527 {
2529 }
2531 /* If not parsing tentatively, issue a diagnostic of the form
2532 FILE:LINE: MESSAGE before TOKEN
2533 where TOKEN is the next token in the input stream. MESSAGE
2534 (specified by the caller) is usually of the form "expected
2535 OTHER-TOKEN". */
2537 static void
2539 {
2541 {
2543 /* This diagnostic makes more sense if it is tagged to the line
2544 of the token we just peeked at. */
2548 {
2553 }
2556 /* Because c_parser_error does not understand
2557 CPP_KEYWORD, keywords are treated like
2558 identifiers. */
2561 }
2562 }
2564 /* Issue an error about name-lookup failing. NAME is the
2565 IDENTIFIER_NODE DECL is the result of
2566 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2567 the thing that we hoped to find. */
2569 static void
2571 tree name,
2572 tree decl,
2573 name_lookup_error desired,
2574 location_t location)
2575 {
2576 /* If name lookup completely failed, tell the user that NAME was not
2577 declared. */
2579 {
2592 else
2594 }
2596 {
2598 {
2615 }
2616 }
2618 {
2620 {
2630 name);
2634 }
2635 }
2636 else
2637 {
2639 {
2652 }
2653 }
2654 }
2656 /* If we are parsing tentatively, remember that an error has occurred
2657 during this tentative parse. Returns true if the error was
2658 simulated; false if a message should be issued by the caller. */
2660 static bool
2662 {
2664 {
2667 }
2669 }
2671 /* This function is called when a type is defined. If type
2672 definitions are forbidden at this point, an error message is
2673 issued. */
2675 static bool
2677 {
2678 /* If types are forbidden here, issue a message. */
2680 {
2681 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2682 in the message need to be interpreted. */
2685 }
2687 }
2689 /* This function is called when the DECLARATOR is processed. The TYPE
2690 was a type defined in the decl-specifiers. If it is invalid to
2691 define a type in the decl-specifiers for DECLARATOR, an error is
2692 issued. TYPE_LOCATION is the location of TYPE and is used
2693 for error reporting. */
2695 static void
2698 {
2699 /* [dcl.fct] forbids type definitions in return types.
2700 Unfortunately, it's not easy to know whether or not we are
2701 processing a return type until after the fact. */
2709 {
2714 type);
2715 }
2716 }
2718 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2719 "<" in any valid C++ program. If the next token is indeed "<",
2720 issue a message warning the user about what appears to be an
2721 invalid attempt to form a template-id. LOCATION is the location
2722 of the type-specifier (TYPE) */
2724 static void
2726 tree type,
2728 location_t location)
2729 {
2733 {
2737 {
2740 else
2742 }
2743 else
2745 /* Remember the location of the invalid "<". */
2748 /* Consume the "<". */
2750 /* Parse the template arguments. */
2752 /* Permanently remove the invalid template arguments so that
2753 this error message is not issued again. */
2756 }
2757 }
2759 /* If parsing an integral constant-expression, issue an error message
2760 about the fact that THING appeared and return true. Otherwise,
2761 return false. In either case, set
2762 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2764 static bool
2766 non_integral_constant thing)
2767 {
2770 {
2772 {
2775 {
2782 "enumeration type cannot appear in a "
2873 }
2877 }
2878 }
2880 }
2882 /* Emit a diagnostic for an invalid type name. This function commits
2883 to the current active tentative parse, if any. (Otherwise, the
2884 problematic construct might be encountered again later, resulting
2885 in duplicate error messages.) LOCATION is the location of ID. */
2887 static void
2889 location_t location)
2890 {
2893 /* Try to lookup the identifier. */
2900 /* If the lookup was ambiguous, an error will already have
2901 been issued. */
2903 /* If the lookup found a template-name, it means that the user forgot
2904 to specify an argument list. Emit a useful error message. */
2908 decl);
2912 /* Something like 'unsigned A a;' */
2915 {
2916 /* Issue an error message. */
2918 /* If we're in a template class, it's possible that the user was
2919 referring to a type from a base class. For example:
2921 template <typename T> struct A { typedef T X; };
2922 template <typename T> struct B : public A<T> { X x; };
2924 The user should have said "typename A<T>::X". */
2937 {
2938 tree b;
2941 b;
2943 {
2947 {
2948 tree field;
2949 /* Go from a particular instantiation of the
2950 template (which will have an empty TYPE_FIELDs),
2951 to the main version. */
2954 field;
2958 {
2963 }
2966 }
2967 }
2968 }
2969 }
2970 /* Here we diagnose qualified-ids where the scope is actually correct,
2971 but the identifier does not resolve to a valid type name. */
2973 {
2975 {
2980 else
2984 }
2987 {
2988 /* A<T>::A<T>() */
2994 }
3001 {
3006 else
3010 }
3011 else
3013 }
3014 }
3016 /* Check for a common situation where a type-name should be present,
3017 but is not, and issue a sensible error message. Returns true if an
3018 invalid type-name was detected.
3020 The situation handled by this function are variable declarations of the
3021 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3022 Usually, `ID' should name a type, but if we got here it means that it
3023 does not. We try to emit the best possible error message depending on
3024 how exactly the id-expression looks like. */
3026 static bool
3028 {
3029 tree id;
3032 /* Avoid duplicate error about ambiguous lookup. */
3034 {
3038 }
3047 /* If the next token is a (, this is a function with no explicit return
3048 type, i.e. constructor, destructor or conversion op. */
3051 {
3054 }
3058 /* Emit a diagnostic for the invalid type. */
3060 out:
3061 /* If we aren't in the middle of a declarator (i.e. in a
3062 parameter-declaration-clause), skip to the end of the declaration;
3063 there's no point in trying to process it. */
3067 }
3069 /* Consume tokens up to, and including, the next non-nested closing `)'.
3070 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3071 are doing error recovery. Returns -1 if OR_COMMA is true and we
3072 found an unnested comma. */
3074 static int
3079 {
3089 {
3093 {
3096 /* If we've run out of tokens, then there is no closing `)'. */
3099 /* This is good for lambda expression capture-lists. */
3109 /* This matches the processing in skip_to_end_of_statement. */
3135 {
3139 }
3144 }
3146 /* Consume the token. */
3148 }
3149 }
3151 /* Consume tokens until we reach the end of the current statement.
3152 Normally, that will be just before consuming a `;'. However, if a
3153 non-nested `}' comes first, then we stop before consuming that. */
3155 static void
3157 {
3160 /* Unwind generic function template scope if necessary. */
3165 {
3169 {
3172 /* If we've run out of tokens, stop. */
3176 /* If the next token is a `;', we have reached the end of the
3177 statement. */
3183 /* If this is a non-nested '}', stop before consuming it.
3184 That way, when confronted with something like:
3186 { 3 + }
3188 we stop before consuming the closing '}', even though we
3189 have not yet reached a `;'. */
3193 /* If it is the closing '}' for a block that we have
3194 scanned, stop -- but only after consuming the token.
3195 That way given:
3197 void f g () { ... }
3198 typedef int I;
3200 we will stop after the body of the erroneously declared
3201 function, but before consuming the following `typedef'
3202 declaration. */
3204 {
3207 }
3215 }
3217 /* Consume the token. */
3219 }
3220 }
3222 /* This function is called at the end of a statement or declaration.
3223 If the next token is a semicolon, it is consumed; otherwise, error
3224 recovery is attempted. */
3226 static void
3228 {
3229 /* Look for the trailing `;'. */
3231 {
3232 /* If there is additional (erroneous) input, skip to the end of
3233 the statement. */
3235 /* If the next token is now a `;', consume it. */
3238 }
3239 }
3241 /* Skip tokens until we have consumed an entire block, or until we
3242 have consumed a non-nested `;'. */
3244 static void
3246 {
3249 /* Unwind generic function template scope if necessary. */
3254 {
3258 {
3261 /* If we've run out of tokens, stop. */
3265 /* Stop if this is an unnested ';'. */
3271 /* Stop if this is an unnested '}', or closes the outermost
3272 nesting level. */
3273 nesting_depth--;
3281 /* Nest. */
3282 nesting_depth++;
3287 }
3289 /* Consume the token. */
3291 }
3292 }
3294 /* Skip tokens until a non-nested closing curly brace is the next
3295 token, or there are no more tokens. Return true in the first case,
3296 false otherwise. */
3298 static bool
3300 {
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* If the next token is a non-nested `}', then we have reached
3316 the end of the current block. */
3322 /* If it the next token is a `{', then we are entering a new
3323 block. Consume the entire block. */
3329 }
3331 /* Consume the token. */
3333 }
3334 }
3336 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3337 parameter is the PRAGMA token, allowing us to purge the entire pragma
3338 sequence. */
3340 static void
3342 {
3347 do
3351 /* Ensure that the pragma is not parsed again. */
3353 }
3355 /* Require pragma end of line, resyncing with it as necessary. The
3356 arguments are as for cp_parser_skip_to_pragma_eol. */
3358 static void
3360 {
3364 }
3366 /* This is a simple wrapper around make_typename_type. When the id is
3367 an unresolved identifier node, we can provide a superior diagnostic
3368 using cp_parser_diagnose_invalid_type_name. */
3370 static tree
3372 location_t id_location)
3373 {
3374 tree result;
3376 {
3382 }
3384 }
3386 /* This is a wrapper around the
3387 make_{pointer,ptrmem,reference}_declarator functions that decides
3388 which one to call based on the CODE and CLASS_TYPE arguments. The
3389 CODE argument should be one of the values returned by
3390 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3391 appertain to the pointer or reference. */
3395 cp_cv_quals cv_qualifiers,
3397 tree attributes)
3398 {
3405 else
3415 }
3417 /* Create a new C++ parser. */
3421 {
3426 /* cp_lexer_new_main is called before doing GC allocation because
3427 cp_lexer_new_main might load a PCH file. */
3430 /* Initialize the binops_by_token so that we can get the tree
3431 directly from the token. */
3439 /* For now, we always accept GNU extensions. */
3442 /* The `>' token is a greater-than operator, not the end of a
3443 template-id. */
3448 /* We are not parsing a constant-expression. */
3453 /* Local variable names are not forbidden. */
3456 /* We are not processing an `extern "C"' declaration. */
3459 /* We are not processing a declarator. */
3462 /* We are not processing a template-argument-list. */
3465 /* We are not in an iteration statement. */
3468 /* We are not in a switch statement. */
3471 /* We are not parsing a type-id inside an expression. */
3474 /* Declarations aren't implicitly extern "C". */
3477 /* String literals should be translated to the execution character set. */
3480 /* We are not parsing a function body. */
3483 /* We can correct until told otherwise. */
3486 /* The unparsed function queue is empty. */
3489 /* There are no classes being defined. */
3492 /* No template parameters apply. */
3495 /* Not declaring an implicit function template. */
3502 }
3504 /* Create a cp_lexer structure which will emit the tokens in CACHE
3505 and push it onto the parser's lexer stack. This is used for delayed
3506 parsing of in-class method bodies and default arguments, and should
3507 not be confused with tentative parsing. */
3508 static void
3510 {
3515 /* Move the current source position to that of the first token in the
3516 new lexer. */
3518 }
3520 /* Pop the top lexer off the parser stack. This is never used for the
3521 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3522 static void
3524 {
3529 /* Put the current source position back where it was before this
3530 lexer was pushed. */
3532 }
3534 /* Lexical conventions [gram.lex] */
3536 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3537 identifier. */
3539 static tree
3541 {
3544 /* Look for the identifier. */
3546 /* Return the value. */
3548 }
3550 /* Parse a sequence of adjacent string constants. Returns a
3551 TREE_STRING representing the combined, nul-terminated string
3552 constant. If TRANSLATE is true, translate the string to the
3553 execution character set. If WIDE_OK is true, a wide string is
3554 invalid here.
3556 C++98 [lex.string] says that if a narrow string literal token is
3557 adjacent to a wide string literal token, the behavior is undefined.
3558 However, C99 6.4.5p4 says that this results in a wide string literal.
3559 We follow C99 here, for consistency with the C front end.
3561 This code is largely lifted from lex_string() in c-lex.c.
3563 FUTURE: ObjC++ will need to handle @-strings here. */
3564 static tree
3567 {
3568 tree value;
3575 tree string_tree;
3581 {
3584 }
3587 {
3591 }
3592 else
3593 {
3596 }
3599 /* Try to avoid the overhead of creating and destroying an obstack
3600 for the common case of just one string. */
3603 {
3611 {
3615 }
3616 else
3620 }
3621 else
3622 {
3626 do
3627 {
3629 count++;
3634 {
3637 {
3640 }
3643 {
3648 }
3650 }
3651 else
3655 {
3660 "unsupported non-standard concatenation "
3662 }
3668 {
3672 }
3673 else
3674 {
3678 }
3679 }
3683 }
3686 {
3689 }
3693 {
3698 {
3713 }
3718 {
3723 else
3725 }
3726 }
3727 else
3728 /* cpp_interpret_string has issued an error. */
3735 }
3737 /* Look up a literal operator with the name and the exact arguments. */
3739 static tree
3741 {
3748 {
3754 {
3757 {
3767 }
3770 /* May be this should be sufficient_parms_p instead,
3771 depending on how exactly should user-defined literals
3772 work in presence of default arguments on the literal
3773 operator parameters. */
3776 }
3777 }
3780 }
3782 /* Parse a user-defined char constant. Returns a call to a user-defined
3783 literal operator taking the character as an argument. */
3785 static tree
3787 {
3795 /* Build up a call to the user-defined operator */
3796 /* Lookup the name we got back from the id-expression. */
3801 {
3806 }
3815 }
3817 /* A subroutine of cp_parser_userdef_numeric_literal to
3818 create a char... template parameter pack from a string node. */
3820 static tree
3822 {
3823 tree charvec;
3829 /* Fill in CHARVEC with all of the parameters. */
3834 /* Build the argument packs. */
3841 }
3843 /* A subroutine of cp_parser_userdef_numeric_literal to
3844 create a char... template parameter pack from a string node. */
3846 static tree
3848 {
3849 tree charvec;
3860 /* First template parm is character type. */
3863 /* Fill in CHARVEC with all of the parameters. */
3870 /* Build the argument packs. */
3877 }
3879 /* Parse a user-defined numeric constant. returns a call to a user-defined
3880 literal operator. */
3882 static tree
3884 {
3895 /* Look for a literal operator taking the exact type of numeric argument
3896 as the literal value. */
3901 {
3904 {
3908 long_long_unsigned_type_node);
3909 else
3910 {
3914 long_double_type_node);
3918 }
3921 }
3922 }
3925 /* If the numeric argument didn't work, look for a raw literal
3926 operator taking a const char* argument consisting of the number
3927 in string format. */
3932 {
3935 {
3938 }
3939 }
3942 /* If the raw literal didn't work, look for a non-type template
3943 function with parameter pack char.... Call the function with
3944 template parameter characters representing the number. */
3948 {
3953 {
3956 }
3957 }
3965 }
3967 /* Parse a user-defined string constant. Returns a call to a user-defined
3968 literal operator taking a character pointer and the length of the string
3969 as arguments. */
3971 static tree
3973 {
3982 /* Look for a template function with typename parameter CharT
3983 and parameter pack CharT... Call the function with
3984 template parameter characters representing the string. */
3988 {
3993 {
3996 }
3997 }
4000 /* Build up a call to the user-defined operator */
4001 /* Lookup the name we got back from the id-expression. */
4007 {
4011 }
4020 }
4023 /* Basic concepts [gram.basic] */
4025 /* Parse a translation-unit.
4027 translation-unit:
4028 declaration-seq [opt]
4030 Returns TRUE if all went well. */
4032 static bool
4034 {
4035 /* The address of the first non-permanent object on the declarator
4036 obstack. */
4041 /* Create the declarator obstack, if necessary. */
4043 {
4045 /* Create the error declarator. */
4047 /* Create the empty parameter list. */
4049 /* Remember where the base of the declarator obstack lies. */
4051 }
4055 /* If there are no tokens left then all went well. */
4057 {
4058 /* Get rid of the token array; we don't need it any more. */
4062 /* This file might have been a context that's implicitly extern
4063 "C". If so, pop the lang context. (Only relevant for PCH.) */
4065 {
4068 }
4070 /* Finish up. */
4074 }
4075 else
4076 {
4079 }
4081 /* Make sure the declarator obstack was fully cleaned up. */
4085 /* All went well. */
4087 }
4089 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4090 decltype context. */
4094 {
4099 }
4101 /* Expressions [gram.expr] */
4103 /* Parse a primary-expression.
4105 primary-expression:
4106 literal
4107 this
4108 ( expression )
4109 id-expression
4110 lambda-expression (C++11)
4112 GNU Extensions:
4114 primary-expression:
4115 ( compound-statement )
4116 __builtin_va_arg ( assignment-expression , type-id )
4117 __builtin_offsetof ( type-id , offsetof-expression )
4119 C++ Extensions:
4120 __has_nothrow_assign ( type-id )
4121 __has_nothrow_constructor ( type-id )
4122 __has_nothrow_copy ( type-id )
4123 __has_trivial_assign ( type-id )
4124 __has_trivial_constructor ( type-id )
4125 __has_trivial_copy ( type-id )
4126 __has_trivial_destructor ( type-id )
4127 __has_virtual_destructor ( type-id )
4128 __is_abstract ( type-id )
4129 __is_base_of ( type-id , type-id )
4130 __is_class ( type-id )
4131 __is_convertible_to ( type-id , type-id )
4132 __is_empty ( type-id )
4133 __is_enum ( type-id )
4134 __is_final ( type-id )
4135 __is_literal_type ( type-id )
4136 __is_pod ( type-id )
4137 __is_polymorphic ( type-id )
4138 __is_std_layout ( type-id )
4139 __is_trivial ( type-id )
4140 __is_union ( type-id )
4142 Objective-C++ Extension:
4144 primary-expression:
4145 objc-expression
4147 literal:
4148 __null
4150 ADDRESS_P is true iff this expression was immediately preceded by
4151 "&" and therefore might denote a pointer-to-member. CAST_P is true
4152 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4153 true iff this expression is a template argument.
4155 Returns a representation of the expression. Upon return, *IDK
4156 indicates what kind of id-expression (if any) was present. */
4158 static tree
4165 {
4168 /* Assume the primary expression is not an id-expression. */
4171 /* Peek at the next token. */
4174 {
4175 /* literal:
4176 integer-literal
4177 character-literal
4178 floating-literal
4179 string-literal
4180 boolean-literal
4181 pointer-literal
4182 user-defined-literal */
4192 {
4196 }
4197 /* Floating-point literals are only allowed in an integral
4198 constant expression if they are cast to an integral or
4199 enumeration type. */
4203 {
4204 /* CAST_P will be set even in invalid code like "int(2.7 +
4205 ...)". Therefore, we have to check that the next token
4206 is sure to end the cast. */
4208 {
4213 enumerator-definition. */
4215 /* The curly brace at the end of an enum-specifier. */
4217 /* The end of a statement. */
4219 /* The end of the cast-expression. */
4221 /* The end of an array bound. */
4223 /* The closing ">" in a template-argument-list. */
4226 /* C++0x only: A ">>" treated like two ">" tokens,
4227 in a template-argument-list. */
4232 }
4234 /* If we are within a cast, then the constraint that the
4235 cast is to an integral or enumeration type will be
4236 checked at that point. If we are not within a cast, then
4237 this code is invalid. */
4240 }
4259 /* ??? Should wide strings be allowed when parser->translate_strings_p
4260 is false (i.e. in attributes)? If not, we can kill the third
4261 argument to cp_parser_string_literal. */
4267 {
4268 tree expr;
4271 /* Consume the `('. */
4273 /* Within a parenthesized expression, a `>' token is always
4274 the greater-than operator. */
4275 saved_greater_than_is_operator_p
4278 /* If we see `( { ' then we are looking at the beginning of
4279 a GNU statement-expression. */
4282 {
4283 /* Statement-expressions are not allowed by the standard. */
4287 /* And they're not allowed outside of a function-body; you
4288 cannot, for example, write:
4290 int i = ({ int j = 3; j + 1; });
4292 at class or namespace scope. */
4295 {
4297 "statement-expressions are not allowed outside "
4301 }
4302 else
4303 {
4304 /* Start the statement-expression. */
4306 /* Parse the compound-statement. */
4308 /* Finish up. */
4310 }
4311 }
4312 else
4313 {
4314 /* Parse the parenthesized expression. */
4316 /* Let the front end know that this expression was
4317 enclosed in parentheses. This matters in case, for
4318 example, the expression is of the form `A::B', since
4319 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4320 not. */
4322 /* DR 705: Wrapping an unqualified name in parentheses
4323 suppresses arg-dependent lookup. We want to pass back
4324 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4325 (c++/37862), but none of the others. */
4328 }
4329 /* The `>' token might be the end of a template-id or
4330 template-parameter-list now. */
4331 parser->greater_than_is_operator_p
4333 /* Consume the `)'. */
4338 }
4342 /* We have an Objective-C++ message. */
4344 {
4346 /* Don't warn about a failed tentative parse. */
4351 }
4355 /* We have an Objective-C++ string literal. */
4362 {
4363 /* These two are the boolean literals. */
4371 /* The `__null' literal. */
4376 /* The `nullptr' literal. */
4381 /* Recognize the `this' keyword. */
4385 {
4389 }
4390 /* Pointers cannot appear in constant-expressions. */
4395 /* The `operator' keyword can be the beginning of an
4396 id-expression. */
4403 {
4404 non_integral_constant name;
4406 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4407 __func__ are the names of variables -- but they are
4408 treated specially. Therefore, they are handled here,
4409 rather than relying on the generic id-expression logic
4410 below. Grammatically, these names are id-expressions.
4412 Consume the token. */
4416 {
4428 }
4433 /* Look up the name. */
4435 }
4438 {
4439 tree expression;
4440 tree type;
4441 source_location type_location;
4443 /* The `__builtin_va_arg' construct is used to handle
4444 `va_arg'. Consume the `__builtin_va_arg' token. */
4446 /* Look for the opening `('. */
4448 /* Now, parse the assignment-expression. */
4451 /* Look for the `,'. */
4454 /* Parse the type-id. */
4456 /* Look for the closing `)'. */
4458 /* Using `va_arg' in a constant-expression is not
4459 allowed. */
4461 NIC_VA_ARG))
4464 }
4492 /* Objective-C++ expressions. */
4502 {
4507 }
4511 }
4513 /* An id-expression can start with either an identifier, a
4514 `::' as the beginning of a qualified-id, or the "operator"
4515 keyword. */
4520 {
4521 tree id_expression;
4522 tree decl;
4528 id_expression:
4529 /* Parse the id-expression. */
4530 id_expression
4547 /* If we have a template-id, then no further lookup is
4548 required. If the template-id was for a template-class, we
4549 will sometimes have a TYPE_DECL at this point. */
4553 /* Look up the name. */
4554 else
4555 {
4556 tree ambiguous_decls;
4558 /* If we already know that this lookup is ambiguous, then
4559 we've already issued an error message; there's no reason
4560 to check again. */
4563 {
4566 }
4569 none_type,
4570 template_p,
4575 /* If the lookup was ambiguous, an error will already have
4576 been issued. */
4580 /* In Objective-C++, we may have an Objective-C 2.0
4581 dot-syntax for classes here. */
4586 {
4587 tree component;
4594 }
4596 /* In Objective-C++, an instance variable (ivar) may be preferred
4597 to whatever cp_parser_lookup_name() found. */
4600 /* If name lookup gives us a SCOPE_REF, then the
4601 qualifying scope was dependent. */
4603 {
4604 /* At this point, we do not know if DECL is a valid
4605 integral constant expression. We assume that it is
4606 in fact such an expression, so that code like:
4608 template <int N> struct A {
4609 int a[B<N>::i];
4610 };
4612 is accepted. At template-instantiation time, we
4613 will check that B<N>::i is actually a constant. */
4615 }
4616 /* Check to see if DECL is a local variable in a context
4617 where that is forbidden. */
4620 {
4621 /* It might be that we only found DECL because we are
4622 trying to be generous with pre-ISO scoping rules.
4623 For example, consider:
4625 int i;
4626 void g() {
4627 for (int i = 0; i < 10; ++i) {}
4628 extern void f(int j = i);
4629 }
4631 Here, name look up will originally find the out
4632 of scope `i'. We need to issue a warning message,
4633 but then use the global `i'. */
4636 {
4639 decl);
4641 }
4642 }
4643 }
4645 decl = (finish_id_expression
4647 idk,
4652 template_arg_p,
4658 }
4660 /* Anything else is an error. */
4664 }
4665 }
4673 {
4676 }
4678 /* Parse an id-expression.
4680 id-expression:
4681 unqualified-id
4682 qualified-id
4684 qualified-id:
4685 :: [opt] nested-name-specifier template [opt] unqualified-id
4686 :: identifier
4687 :: operator-function-id
4688 :: template-id
4690 Return a representation of the unqualified portion of the
4691 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4692 a `::' or nested-name-specifier.
4694 Often, if the id-expression was a qualified-id, the caller will
4695 want to make a SCOPE_REF to represent the qualified-id. This
4696 function does not do this in order to avoid wastefully creating
4697 SCOPE_REFs when they are not required.
4699 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4700 `template' keyword.
4702 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4703 uninstantiated templates.
4705 If *TEMPLATE_P is non-NULL, it is set to true iff the
4706 `template' keyword is used to explicitly indicate that the entity
4707 named is a template.
4709 If DECLARATOR_P is true, the id-expression is appearing as part of
4710 a declarator, rather than as part of an expression. */
4712 static tree
4719 {
4723 /* Assume the `template' keyword was not used. */
4727 /* Look for the optional `::' operator. */
4728 global_scope_p
4731 /* Look for the optional nested-name-specifier. */
4732 nested_name_specifier_p
4735 check_dependency_p,
4737 declarator_p)
4739 /* If there is a nested-name-specifier, then we are looking at
4740 the first qualified-id production. */
4742 {
4743 tree saved_scope;
4744 tree saved_object_scope;
4745 tree saved_qualifying_scope;
4746 tree unqualified_id;
4749 /* See if the next token is the `template' keyword. */
4753 /* Name lookup we do during the processing of the
4754 unqualified-id might obliterate SCOPE. */
4758 /* Process the final unqualified-id. */
4760 check_dependency_p,
4761 declarator_p,
4763 /* Restore the SAVED_SCOPE for our caller. */
4769 }
4770 /* Otherwise, if we are in global scope, then we are looking at one
4771 of the other qualified-id productions. */
4773 {
4775 tree id;
4777 /* Peek at the next token. */
4780 /* If it's an identifier, and the next token is not a "<", then
4781 we can avoid the template-id case. This is an optimization
4782 for this common case. */
4784 && !cp_parser_nth_token_starts_template_argument_list_p
4789 /* Try a template-id. */
4793 none_type,
4794 declarator_p);
4795 /* If that worked, we're done. */
4799 /* Peek at the next token. (Changes in the token buffer may
4800 have invalidated the pointer obtained above.) */
4804 {
4811 /* Fall through. */
4816 }
4817 }
4818 else
4821 declarator_p,
4822 optional_p);
4823 }
4825 /* Parse an unqualified-id.
4827 unqualified-id:
4828 identifier
4829 operator-function-id
4830 conversion-function-id
4831 ~ class-name
4832 template-id
4834 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4835 keyword, in a construct like `A::template ...'.
4837 Returns a representation of unqualified-id. For the `identifier'
4838 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4839 production a BIT_NOT_EXPR is returned; the operand of the
4840 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4841 other productions, see the documentation accompanying the
4842 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4843 names are looked up in uninstantiated templates. If DECLARATOR_P
4844 is true, the unqualified-id is appearing as part of a declarator,
4845 rather than as part of an expression. */
4847 static tree
4853 {
4856 /* Peek at the next token. */
4860 {
4862 {
4863 tree id;
4865 /* We don't know yet whether or not this will be a
4866 template-id. */
4868 /* Try a template-id. */
4870 check_dependency_p,
4871 none_type,
4872 declarator_p);
4873 /* If it worked, we're done. */
4876 /* Otherwise, it's an ordinary identifier. */
4878 }
4882 check_dependency_p,
4883 none_type,
4884 declarator_p);
4887 {
4888 tree type_decl;
4889 tree qualifying_scope;
4890 tree object_scope;
4891 tree scope;
4894 /* Consume the `~' token. */
4896 /* Parse the class-name. The standard, as written, seems to
4897 say that:
4899 template <typename T> struct S { ~S (); };
4900 template <typename T> S<T>::~S() {}
4902 is invalid, since `~' must be followed by a class-name, but
4903 `S<T>' is dependent, and so not known to be a class.
4904 That's not right; we need to look in uninstantiated
4905 templates. A further complication arises from:
4907 template <typename T> void f(T t) {
4908 t.T::~T();
4909 }
4911 Here, it is not possible to look up `T' in the scope of `T'
4912 itself. We must look in both the current scope, and the
4913 scope of the containing complete expression.
4915 Yet another issue is:
4917 struct S {
4918 int S;
4919 ~S();
4920 };
4922 S::~S() {}
4924 The standard does not seem to say that the `S' in `~S'
4925 should refer to the type `S' and not the data member
4926 `S::S'. */
4928 /* DR 244 says that we look up the name after the "~" in the
4929 same scope as we looked up the qualifying name. That idea
4930 isn't fully worked out; it's more complicated than that. */
4935 /* Check for invalid scopes. */
4937 {
4941 }
4943 {
4947 scope);
4952 }
4955 /* If the name is of the form "X::~X" it's OK even if X is a
4956 typedef. */
4965 {
4968 }
4970 /* ~auto means the destructor of whatever the object is. */
4972 {
4975 "%<~auto%> only available with "
4979 }
4981 /* If there was an explicit qualification (S::~T), first look
4982 in the scope given by the qualification (i.e., S).
4984 Note: in the calls to cp_parser_class_name below we pass
4985 typename_type so that lookup finds the injected-class-name
4986 rather than the constructor. */
4990 {
4995 typename_type,
4998 declarator_p);
5001 }
5002 /* In "N::S::~S", look in "N" as well. */
5004 {
5009 type_decl
5013 typename_type,
5016 declarator_p);
5019 }
5020 /* In "p->S::~T", look in the scope given by "*p" as well. */
5022 {
5027 type_decl
5031 typename_type,
5034 declarator_p);
5037 }
5038 /* Look in the surrounding context. */
5040 {
5046 type_decl
5050 typename_type,
5053 declarator_p);
5056 {
5057 /* We couldn't find a type with this name, so just accept
5058 it and check for a match at instantiation time. */
5063 }
5064 }
5065 /* If an error occurred, assume that the name of the
5066 destructor is the same as the name of the qualifying
5067 class. That allows us to keep parsing after running
5068 into ill-formed destructor names. */
5074 /* Check that destructor name and scope match. */
5076 {
5083 }
5085 /* [class.dtor]
5087 A typedef-name that names a class shall not be used as the
5088 identifier in the declarator for a destructor declaration. */
5095 type_decl);
5098 }
5102 {
5103 tree id;
5105 /* This could be a template-id, so we try that first. */
5107 /* Try a template-id. */
5110 none_type,
5111 declarator_p);
5112 /* If that worked, we're done. */
5115 /* We still don't know whether we're looking at an
5116 operator-function-id or a conversion-function-id. */
5118 /* Try an operator-function-id. */
5120 /* If that didn't work, try a conversion-function-id. */
5124 {
5125 /* 17.6.3.3.5 */
5131 }
5134 }
5135 /* Fall through. */
5142 }
5143 }
5145 /* Parse an (optional) nested-name-specifier.
5147 nested-name-specifier: [C++98]
5148 class-or-namespace-name :: nested-name-specifier [opt]
5149 class-or-namespace-name :: template nested-name-specifier [opt]
5151 nested-name-specifier: [C++0x]
5152 type-name ::
5153 namespace-name ::
5154 nested-name-specifier identifier ::
5155 nested-name-specifier template [opt] simple-template-id ::
5157 PARSER->SCOPE should be set appropriately before this function is
5158 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5159 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5160 in name lookups.
5162 Sets PARSER->SCOPE to the class (TYPE) or namespace
5163 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5164 it unchanged if there is no nested-name-specifier. Returns the new
5165 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5167 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5168 part of a declaration and/or decl-specifier. */
5170 static tree
5176 {
5181 /* Remember where the nested-name-specifier starts. */
5183 {
5186 }
5189 {
5190 tree new_scope;
5191 tree old_scope;
5192 tree saved_qualifying_scope;
5195 /* Spot cases that cannot be the beginning of a
5196 nested-name-specifier. */
5199 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5200 the already parsed nested-name-specifier. */
5202 {
5203 /* Grab the nested-name-specifier and continue the loop. */
5205 /* If we originally encountered this nested-name-specifier
5206 with IS_DECLARATION set to false, we will not have
5207 resolved TYPENAME_TYPEs, so we must do so here. */
5210 {
5215 }
5218 }
5220 /* Spot cases that cannot be the beginning of a
5221 nested-name-specifier. On the second and subsequent times
5222 through the loop, we look for the `template' keyword. */
5224 ;
5225 /* A template-id can start a nested-name-specifier. */
5227 ;
5228 /* DR 743: decltype can be used in a nested-name-specifier. */
5230 ;
5231 else
5232 {
5233 /* If the next token is not an identifier, then it is
5234 definitely not a type-name or namespace-name. */
5237 /* If the following token is neither a `<' (to begin a
5238 template-id), nor a `::', then we are not looking at a
5239 nested-name-specifier. */
5245 {
5249 }
5252 && !cp_parser_nth_token_starts_template_argument_list_p
5255 }
5257 /* The nested-name-specifier is optional, so we parse
5258 tentatively. */
5261 /* Look for the optional `template' keyword, if this isn't the
5262 first time through the loop. */
5265 else
5268 /* Save the old scope since the name lookup we are about to do
5269 might destroy it. */
5272 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5273 look up names in "X<T>::I" in order to determine that "Y" is
5274 a template. So, if we have a typename at this point, we make
5275 an effort to look through it. */
5277 && !typename_keyword_p
5282 /* Parse the qualifying entity. */
5283 new_scope
5285 typename_keyword_p,
5286 template_keyword_p,
5287 check_dependency_p,
5288 type_p,
5289 is_declaration);
5290 /* Look for the `::' token. */
5293 /* If we found what we wanted, we keep going; otherwise, we're
5294 done. */
5296 {
5299 /* Restore the OLD_SCOPE since it was valid before the
5300 failed attempt at finding the last
5301 class-or-namespace-name. */
5305 /* If the next token is a decltype, and the one after that is a
5306 `::', then the decltype has failed to resolve to a class or
5307 enumeration type. Give this error even when parsing
5308 tentatively since it can't possibly be valid--and we're going
5309 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5310 won't get another chance.*/
5314 {
5321 /* As below. */
5324 }
5328 /* If the next token is an identifier, and the one after
5329 that is a `::', then any valid interpretation would have
5330 found a class-or-namespace-name. */
5336 {
5339 {
5341 {
5342 tree decl;
5343 tree ambiguous_decls;
5346 none_type,
5355 decl);
5357 {
5358 // cp_parser_lookup_name has the same diagnostic,
5359 // thus make sure to emit it at most once.
5362 {
5367 }
5369 }
5370 else
5371 {
5373 cp_parser_name_lookup_error
5376 else
5377 cp_parser_name_lookup_error
5380 }
5381 }
5384 /* Treat this as a successful nested-name-specifier
5385 due to:
5387 [basic.lookup.qual]
5389 If the name found is not a class-name (clause
5390 _class_) or namespace-name (_namespace.def_), the
5391 program is ill-formed. */
5393 }
5395 }
5397 }
5398 /* We've found one valid nested-name-specifier. */
5400 /* Name lookup always gives us a DECL. */
5403 /* Uses of "template" must be followed by actual templates. */
5415 new_scope);
5416 /* If it is a class scope, try to complete it; we are about to
5417 be looking up names inside the class. */
5419 /* Since checking types for dependency can be expensive,
5420 avoid doing it if the type is already complete. */
5422 /* Do not try to complete dependent types. */
5424 {
5426 /* If it is a typedef to current class, use the current
5427 class instead, as the typedef won't have any names inside
5428 it yet. */
5432 }
5433 /* Make sure we look in the right scope the next time through
5434 the loop. */
5436 }
5438 /* If parsing tentatively, replace the sequence of tokens that makes
5439 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5440 token. That way, should we re-parse the token stream, we will
5441 not have to repeat the effort required to do the parse, nor will
5442 we issue duplicate error messages. */
5444 {
5448 /* Reset the contents of the START token. */
5450 /* Retrieve any deferred checks. Do not pop this access checks yet
5451 so the memory will not be reclaimed during token replacing below. */
5459 /* Purge all subsequent tokens. */
5461 }
5467 }
5469 /* Parse a nested-name-specifier. See
5470 cp_parser_nested_name_specifier_opt for details. This function
5471 behaves identically, except that it will an issue an error if no
5472 nested-name-specifier is present. */
5474 static tree
5480 {
5481 tree scope;
5483 /* Look for the nested-name-specifier. */
5485 typename_keyword_p,
5486 check_dependency_p,
5487 type_p,
5488 is_declaration);
5489 /* If it was not present, issue an error message. */
5491 {
5494 }
5497 }
5499 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5500 this is either a class-name or a namespace-name (which corresponds
5501 to the class-or-namespace-name production in the grammar). For
5502 C++0x, it can also be a type-name that refers to an enumeration
5503 type or a simple-template-id.
5505 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5506 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5507 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5508 TYPE_P is TRUE iff the next name should be taken as a class-name,
5509 even the same name is declared to be another entity in the same
5510 scope.
5512 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5513 specified by the class-or-namespace-name. If neither is found the
5514 ERROR_MARK_NODE is returned. */
5516 static tree
5523 {
5524 tree saved_scope;
5525 tree saved_qualifying_scope;
5526 tree saved_object_scope;
5527 tree scope;
5531 /* DR 743: decltype can appear in a nested-name-specifier. */
5533 {
5537 {
5540 }
5544 }
5546 /* Before we try to parse the class-name, we must save away the
5547 current PARSER->SCOPE since cp_parser_class_name will destroy
5548 it. */
5552 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5553 there is no need to look for a namespace-name. */
5554 only_class_p = template_keyword_p
5559 typename_keyword_p,
5560 template_keyword_p,
5562 check_dependency_p,
5564 is_declaration);
5566 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5570 {
5571 /* Restore the saved scope. */
5576 /* Parse tentatively. */
5579 /* Parse a type-name */
5582 /* "If the name found does not designate a namespace or a class,
5583 enumeration, or dependent type, the program is ill-formed."
5585 We cover classes and dependent types above and namespaces below,
5586 so this code is only looking for enums. */
5592 }
5593 /* If that didn't work, try for a namespace-name. */
5595 {
5596 /* Restore the saved scope. */
5600 /* If we are not looking at an identifier followed by the scope
5601 resolution operator, then this is not part of a
5602 nested-name-specifier. (Note that this function is only used
5603 to parse the components of a nested-name-specifier.) */
5608 }
5611 }
5613 /* Return true if we are looking at a compound-literal, false otherwise. */
5615 static bool
5617 {
5618 /* Consume the `('. */
5623 /* Skip tokens until the next token is a closing parenthesis.
5624 If we find the closing `)', and the next token is a `{', then
5625 we are looking at a compound-literal. */
5626 bool compound_literal_p
5631 /* Roll back the tokens we skipped. */
5635 }
5637 /* Parse a postfix-expression.
5639 postfix-expression:
5640 primary-expression
5641 postfix-expression [ expression ]
5642 postfix-expression ( expression-list [opt] )
5643 simple-type-specifier ( expression-list [opt] )
5644 typename :: [opt] nested-name-specifier identifier
5645 ( expression-list [opt] )
5646 typename :: [opt] nested-name-specifier template [opt] template-id
5647 ( expression-list [opt] )
5648 postfix-expression . template [opt] id-expression
5649 postfix-expression -> template [opt] id-expression
5650 postfix-expression . pseudo-destructor-name
5651 postfix-expression -> pseudo-destructor-name
5652 postfix-expression ++
5653 postfix-expression --
5654 dynamic_cast < type-id > ( expression )
5655 static_cast < type-id > ( expression )
5656 reinterpret_cast < type-id > ( expression )
5657 const_cast < type-id > ( expression )
5658 typeid ( expression )
5659 typeid ( type-id )
5661 GNU Extension:
5663 postfix-expression:
5664 ( type-id ) { initializer-list , [opt] }
5666 This extension is a GNU version of the C99 compound-literal
5667 construct. (The C99 grammar uses `type-name' instead of `type-id',
5668 but they are essentially the same concept.)
5670 If ADDRESS_P is true, the postfix expression is the operand of the
5671 `&' operator. CAST_P is true if this expression is the target of a
5672 cast.
5674 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5675 class member access expressions [expr.ref].
5677 Returns a representation of the expression. */
5679 static tree
5683 {
5685 location_t loc;
5692 /* Peek at the next token. */
5695 /* Some of the productions are determined by keywords. */
5698 {
5703 {
5704 tree type;
5705 tree expression;
5709 /* All of these can be handled in the same way from the point
5710 of view of parsing. Begin by consuming the token
5711 identifying the cast. */
5714 /* New types cannot be defined in the cast. */
5716 parser->type_definition_forbidden_message
5719 /* Look for the opening `<'. */
5721 /* Parse the type to which we are casting. */
5726 /* Look for the closing `>'. */
5728 /* Restore the old message. */
5731 bool saved_greater_than_is_operator_p
5735 /* And the expression which is being cast. */
5740 parser->greater_than_is_operator_p
5743 /* Only type conversions to integral or enumeration types
5744 can be used in constant-expressions. */
5750 {
5752 postfix_expression
5756 postfix_expression
5760 postfix_expression
5762 tf_warning_or_error);
5765 postfix_expression
5770 }
5771 }
5775 {
5776 tree type;
5780 /* Consume the `typeid' token. */
5782 /* Look for the `(' token. */
5784 /* Types cannot be defined in a `typeid' expression. */
5786 parser->type_definition_forbidden_message
5788 /* We can't be sure yet whether we're looking at a type-id or an
5789 expression. */
5791 /* Try a type-id first. */
5796 /* Look for the `)' token. Otherwise, we can't be sure that
5797 we're not looking at an expression: consider `typeid (int
5798 (3))', for example. */
5800 /* If all went well, simply lookup the type-id. */
5803 /* Otherwise, fall back to the expression variant. */
5804 else
5805 {
5806 tree expression;
5808 /* Look for an expression. */
5810 /* Compute its typeid. */
5812 /* Look for the `)' token. */
5814 }
5815 /* Restore the saved message. */
5817 /* `typeid' may not appear in an integral constant expression. */
5820 }
5824 {
5825 tree type;
5826 /* The syntax permitted here is the same permitted for an
5827 elaborated-type-specifier. */
5832 }
5836 {
5840 {
5845 }
5847 {
5852 }
5853 else
5854 {
5855 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5858 }
5860 postfix_expression =
5864 {
5868 }
5870 {
5875 }
5876 else
5877 {
5879 postfix_expression);
5883 }
5885 }
5888 {
5891 tree p;
5905 tf_warning_or_error);
5908 tf_warning_or_error);
5909 else
5910 {
5914 }
5916 }
5919 {
5920 tree type;
5922 /* If the next thing is a simple-type-specifier, we may be
5923 looking at a functional cast. We could also be looking at
5924 an id-expression. So, we try the functional cast, and if
5925 that doesn't work we fall back to the primary-expression. */
5927 /* Look for the simple-type-specifier. */
5930 CP_PARSER_FLAGS_NONE);
5931 /* Parse the cast itself. */
5933 postfix_expression
5935 /* If that worked, we're done. */
5939 /* If the functional-cast didn't work out, try a
5940 compound-literal. */
5943 {
5948 /* Avoid calling cp_parser_type_id pointlessly, see comment
5949 in cp_parser_cast_expression about c++/29234. */
5952 else
5953 {
5954 /* Parse the type. */
5959 /* Look for the `)'. */
5961 }
5963 /* If things aren't going well, there's no need to
5964 keep going. */
5966 {
5968 /* Parse the brace-enclosed initializer list. */
5971 }
5972 /* If that worked, we're definitely looking at a
5973 compound-literal expression. */
5975 {
5976 /* Warn the user that a compound literal is not
5977 allowed in standard C++. */
5980 /* For simplicity, we disallow compound literals in
5981 constant-expressions. We could
5982 allow compound literals of integer type, whose
5983 initializer was a constant, in constant
5984 expressions. Permitting that usage, as a further
5985 extension, would not change the meaning of any
5986 currently accepted programs. (Of course, as
5987 compound literals are not part of ISO C++, the
5988 standard has nothing to say.) */
5990 NIC_NCC))
5991 {
5994 }
5995 /* Form the representation of the compound-literal. */
5996 postfix_expression
5998 tf_warning_or_error);
6000 }
6001 }
6003 /* It must be a primary-expression. */
6004 postfix_expression
6007 decltype_p,
6009 }
6011 }
6013 /* Note that we don't need to worry about calling build_cplus_new on a
6014 class-valued CALL_EXPR in decltype when it isn't the end of the
6015 postfix-expression; unary_complex_lvalue will take care of that for
6016 all these cases. */
6018 /* Keep looping until the postfix-expression is complete. */
6020 {
6024 /* It is not a Koenig lookup function call. */
6025 postfix_expression
6028 /* Peek at the next token. */
6032 {
6035 {
6037 "two consecutive %<[%> shall "
6040 }
6041 postfix_expression
6043 postfix_expression,
6045 decltype_p);
6051 /* postfix-expression ( expression-list [opt] ) */
6052 {
6062 is_builtin_constant_p
6065 {
6066 /* The whole point of __builtin_constant_p is to allow
6067 non-constant expressions to appear as arguments. */
6068 saved_integral_constant_expression_p
6070 saved_non_integral_constant_expression_p
6073 }
6074 args = (cp_parser_parenthesized_expression_list
6080 {
6081 parser->integral_constant_expression_p
6083 parser->non_integral_constant_expression_p
6085 }
6088 {
6091 }
6093 /* Function calls are not permitted in
6094 constant-expressions. */
6097 NIC_FUNC_CALL))
6098 {
6102 }
6107 {
6109 {
6111 {
6114 postfix_expression
6116 complain);
6117 }
6118 else
6119 postfix_expression
6121 }
6122 /* We do not perform argument-dependent lookup if
6123 normal lookup finds a non-function, in accordance
6124 with the expected resolution of DR 218. */
6127 {
6131 /* Do not do argument dependent lookup if regular
6132 lookup finds a member function or a block-scope
6133 function declaration. [basic.lookup.argdep]/3 */
6136 {
6139 postfix_expression
6141 complain);
6142 }
6143 }
6144 }
6147 {
6157 "%<memset%> used with constant zero length "
6158 "parameter; this could be due to transposed "
6161 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6162 to avoid leaking those into folder and middle-end. */
6164 tree arg;
6168 }
6171 {
6181 {
6182 postfix_expression
6186 }
6189 {
6190 postfix_expression
6191 = (build_new_method_call
6197 complain));
6198 }
6199 else
6200 postfix_expression
6204 complain);
6205 }
6209 postfix_expression = (build_offset_ref_call_from_tree
6211 complain));
6213 /* A call to a static class member, or a namespace-scope
6214 function. */
6215 postfix_expression
6218 koenig_p,
6219 complain);
6220 else
6221 /* All other function calls. */
6222 postfix_expression
6225 koenig_p,
6226 complain);
6228 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6232 }
6237 /* postfix-expression . template [opt] id-expression
6238 postfix-expression . pseudo-destructor-name
6239 postfix-expression -> template [opt] id-expression
6240 postfix-expression -> pseudo-destructor-name */
6242 /* Consume the `.' or `->' operator. */
6245 postfix_expression
6247 postfix_expression,
6254 /* postfix-expression ++ */
6255 /* Consume the `++' token. */
6257 /* Generate a representation for the complete expression. */
6258 postfix_expression
6260 POSTINCREMENT_EXPR);
6261 /* Increments may not appear in constant-expressions. */
6269 /* postfix-expression -- */
6270 /* Consume the `--' token. */
6272 /* Generate a representation for the complete expression. */
6273 postfix_expression
6275 POSTDECREMENT_EXPR);
6276 /* Decrements may not appear in constant-expressions. */
6288 else
6290 }
6291 }
6293 /* We should never get here. */
6296 }
6298 /* This function parses Cilk Plus array notations. If a normal array expr. is
6299 parsed then the array index is passed back to the caller through *INIT_INDEX
6300 and the function returns a NULL_TREE. If array notation expr. is parsed,
6301 then *INIT_INDEX is ignored by the caller and the function returns
6302 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6303 error_mark_node. */
6305 static tree
6307 tree array_value)
6308 {
6312 {
6315 }
6324 {
6327 }
6329 {
6330 /* Consume the ':'. */
6333 /* If we are here, then we have a case like this A[:]. */
6335 {
6339 }
6343 }
6344 else
6345 {
6346 /* If we are here, then there are three valid possibilities:
6347 1. ARRAY [ EXP ]
6348 2. ARRAY [ EXP : EXP ]
6349 3. ARRAY [ EXP : EXP : EXP ] */
6353 {
6354 /* This indicates that we have a normal array expression. */
6357 }
6359 /* Consume the ':'. */
6363 {
6366 }
6367 }
6372 {
6376 }
6382 }
6384 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6385 by cp_parser_builtin_offsetof. We're looking for
6387 postfix-expression [ expression ]
6388 postfix-expression [ braced-init-list ] (C++11)
6390 FOR_OFFSETOF is set if we're being called in that context, which
6391 changes how we deal with integer constant expressions. */
6393 static tree
6395 tree postfix_expression,
6398 {
6403 /* Consume the `[' token. */
6409 /* Parse the index expression. */
6410 /* ??? For offsetof, there is a question of what to allow here. If
6411 offsetof is not being used in an integral constant expression context,
6412 then we *could* get the right answer by computing the value at runtime.
6413 If we are in an integral constant expression context, then we might
6414 could accept any constant expression; hard to say without analysis.
6415 Rather than open the barn door too wide right away, allow only integer
6416 constant expressions here. */
6419 else
6420 {
6422 {
6429 {
6431 "braced list index is not allowed with array "
6435 }
6436 }
6438 {
6439 /* Here are have these two options:
6440 ARRAY[EXP : EXP] - Array notation expr with default
6441 stride of 1.
6442 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6443 stride. */
6445 postfix_expression);
6448 }
6449 else
6451 }
6455 /* Look for the closing `]'. */
6458 /* Build the ARRAY_REF. */
6462 /* When not doing offsetof, array references are not permitted in
6463 constant-expressions. */
6469 }
6471 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6472 by cp_parser_builtin_offsetof. We're looking for
6474 postfix-expression . template [opt] id-expression
6475 postfix-expression . pseudo-destructor-name
6476 postfix-expression -> template [opt] id-expression
6477 postfix-expression -> pseudo-destructor-name
6479 FOR_OFFSETOF is set if we're being called in that context. That sorta
6480 limits what of the above we'll actually accept, but nevermind.
6481 TOKEN_TYPE is the "." or "->" token, which will already have been
6482 removed from the stream. */
6484 static tree
6487 tree postfix_expression,
6489 location_t location)
6490 {
6491 tree name;
6496 /* If this is a `->' operator, dereference the pointer. */
6499 tf_warning_or_error);
6500 /* Check to see whether or not the expression is type-dependent. */
6502 /* The identifier following the `->' or `.' is not qualified. */
6508 /* Enter the scope corresponding to the type of the object
6509 given by the POSTFIX_EXPRESSION. */
6511 {
6513 /* According to the standard, no expression should ever have
6514 reference type. Unfortunately, we do not currently match
6515 the standard in this respect in that our internal representation
6516 of an expression may have reference type even when the standard
6517 says it does not. Therefore, we have to manually obtain the
6518 underlying type here. */
6520 /* The type of the POSTFIX_EXPRESSION must be complete. */
6522 {
6524 postfix_expression);
6526 }
6527 /* Unlike the object expression in other contexts, *this is not
6528 required to be of complete type for purposes of class member
6529 access (5.2.5) outside the member function body. */
6533 /* Let the name lookup machinery know that we are processing a
6534 class member access expression. */
6536 /* If something went wrong, we want to be able to discern that case,
6537 as opposed to the case where there was no SCOPE due to the type
6538 of expression being dependent. */
6541 /* If the SCOPE was erroneous, make the various semantic analysis
6542 functions exit quickly -- and without issuing additional error
6543 messages. */
6546 }
6548 /* Assume this expression is not a pseudo-destructor access. */
6551 /* If the SCOPE is a scalar type, then, if this is a valid program,
6552 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6553 is type dependent, it can be pseudo-destructor-name or something else.
6554 Try to parse it as pseudo-destructor-name first. */
6556 {
6557 tree s;
6558 tree type;
6561 /* Parse the pseudo-destructor-name. */
6570 {
6572 postfix_expression
6575 }
6576 }
6579 {
6580 /* If the SCOPE is not a scalar type, we are looking at an
6581 ordinary class member access expression, rather than a
6582 pseudo-destructor-name. */
6585 /* Parse the id-expression. */
6586 name = (cp_parser_id_expression
6593 /* In general, build a SCOPE_REF if the member name is qualified.
6594 However, if the name was not dependent and has already been
6595 resolved; there is no need to build the SCOPE_REF. For example;
6597 struct X { void f(); };
6598 template <typename T> void f(T* t) { t->X::f(); }
6600 Even though "t" is dependent, "X::f" is not and has been resolved
6601 to a BASELINK; there is no need to include scope information. */
6603 /* But we do need to remember that there was an explicit scope for
6604 virtual function calls. */
6608 /* If the name is a template-id that names a type, we will get a
6609 TYPE_DECL here. That is invalid code. */
6611 {
6614 }
6615 else
6616 {
6618 {
6620 {
6624 }
6625 else
6628 name,
6629 template_p);
6633 }
6635 adjust_result_of_qualified_name_lookup
6637 postfix_expression
6639 template_p,
6640 tf_warning_or_error);
6641 }
6642 }
6644 /* We no longer need to look up names in the scope of the object on
6645 the left-hand side of the `.' or `->' operator. */
6648 /* Outside of offsetof, these operators may not appear in
6649 constant-expressions. */
6651 && (cp_parser_non_integral_constant_expression
6656 }
6658 /* Cache of LITERAL_ZERO_P constants. */
6662 /* Parse a parenthesized expression-list.
6664 expression-list:
6665 assignment-expression
6666 expression-list, assignment-expression
6668 attribute-list:
6669 expression-list
6670 identifier
6671 identifier, expression-list
6673 CAST_P is true if this expression is the target of a cast.
6675 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6676 argument pack.
6678 Returns a vector of trees. Each element is a representation of an
6679 assignment-expression. NULL is returned if the ( and or ) are
6680 missing. An empty, but allocated, vector is returned on no
6681 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6682 if we are parsing an attribute list for an attribute that wants a
6683 plain identifier argument, normal_attr for an attribute that wants
6684 an expression, or non_attr if we aren't parsing an attribute list. If
6685 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6686 not all of the expressions in the list were constant.
6687 WANT_LITERAL_ZERO_P is true if the caller is interested in
6688 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6689 immediately, this can be removed. */
6698 {
6704 /* Assume all the expressions will be constant. */
6713 /* Within a parenthesized expression, a `>' token is always
6714 the greater-than operator. */
6715 saved_greater_than_is_operator_p
6719 /* Consume expressions until there are no more. */
6722 {
6723 tree expr;
6725 /* At the beginning of attribute lists, check to see if the
6726 next token is an identifier. */
6729 {
6732 /* Consume the identifier. */
6734 /* Save the identifier. */
6736 }
6737 else
6738 {
6741 /* Parse the next assignment-expression. */
6743 {
6744 /* A braced-init-list. */
6750 }
6752 {
6753 expr = (cp_parser_constant_expression
6758 }
6759 else
6760 {
6764 {
6770 /* If a parameter is literal zero alone, remember it
6771 for -Wmemset-transposed-args warning. */
6774 && want_literal_zero_p
6776 == CPP_COMMA
6779 {
6786 else
6787 {
6792 }
6793 /* Consume the 0 token (or '\0', 0LL etc.). */
6795 }
6799 }
6802 NULL);
6803 }
6808 /* If we have an ellipsis, then this is an expression
6809 expansion. */
6812 {
6813 /* Consume the `...'. */
6816 /* Build the argument pack. */
6818 }
6820 /* Add it to the list. We add error_mark_node
6821 expressions to the list, so that we can still tell if
6822 the correct form for a parenthesized expression-list
6823 is found. That gives better errors. */
6828 }
6830 /* After the first item, attribute lists look the same as
6831 expression lists. */
6834 get_comma:;
6835 /* If the next token isn't a `,', then we are done. */
6839 /* Otherwise, consume the `,' and keep going. */
6841 }
6844 {
6847 skip_comma:;
6848 /* We try and resync to an unnested comma, as that will give the
6849 user better diagnostics. */
6857 {
6858 parser->greater_than_is_operator_p
6861 }
6862 }
6864 parser->greater_than_is_operator_p
6871 }
6873 /* Parse a pseudo-destructor-name.
6875 pseudo-destructor-name:
6876 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6877 :: [opt] nested-name-specifier template template-id :: ~ type-name
6878 :: [opt] nested-name-specifier [opt] ~ type-name
6880 If either of the first two productions is used, sets *SCOPE to the
6881 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6882 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6883 or ERROR_MARK_NODE if the parse fails. */
6885 static void
6887 tree object,
6890 {
6893 /* Handle ~auto. */
6897 {
6900 "%<~auto%> only available with "
6907 }
6909 /* Assume that things will not work out. */
6912 /* Look for the optional `::' operator. */
6914 /* Look for the optional nested-name-specifier. */
6915 nested_name_specifier_p
6922 /* Now, if we saw a nested-name-specifier, we might be doing the
6923 second production. */
6926 {
6927 /* Consume the `template' keyword. */
6929 /* Parse the template-id. */
6933 class_type,
6935 /* Look for the `::' token. */
6937 }
6938 /* If the next token is not a `~', then there might be some
6939 additional qualification. */
6941 {
6942 /* At this point, we're looking for "type-name :: ~". The type-name
6943 must not be a class-name, since this is a pseudo-destructor. So,
6944 it must be either an enum-name, or a typedef-name -- both of which
6945 are just identifiers. So, we peek ahead to check that the "::"
6946 and "~" tokens are present; if they are not, then we can avoid
6947 calling type_name. */
6951 {
6954 }
6956 /* Look for the type-name. */
6961 /* Look for the `::' token. */
6963 }
6964 else
6967 /* Look for the `~'. */
6970 /* Once we see the ~, this has to be a pseudo-destructor. */
6974 /* Look for the type-name again. We are not responsible for
6975 checking that it matches the first type-name. */
6977 }
6979 /* Parse a unary-expression.
6981 unary-expression:
6982 postfix-expression
6983 ++ cast-expression
6984 -- cast-expression
6985 unary-operator cast-expression
6986 sizeof unary-expression
6987 sizeof ( type-id )
6988 alignof ( type-id ) [C++0x]
6989 new-expression
6990 delete-expression
6992 GNU Extensions:
6994 unary-expression:
6995 __extension__ cast-expression
6996 __alignof__ unary-expression
6997 __alignof__ ( type-id )
6998 alignof unary-expression [C++0x]
6999 __real__ cast-expression
7000 __imag__ cast-expression
7001 && identifier
7002 sizeof ( type-id ) { initializer-list , [opt] }
7003 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7004 __alignof__ ( type-id ) { initializer-list , [opt] }
7006 ADDRESS_P is true iff the unary-expression is appearing as the
7007 operand of the `&' operator. CAST_P is true if this expression is
7008 the target of a cast.
7010 Returns a representation of the expression. */
7012 static tree
7015 {
7019 /* Peek at the next token. */
7021 /* Some keywords give away the kind of expression. */
7023 {
7027 {
7030 {
7033 location_t first_loc;
7036 /* Consume the token. */
7039 /* Parse the operand. */
7044 else
7045 {
7046 /* ISO C++ defines alignof only with types, not with
7047 expressions. So pedwarn if alignof is used with a non-
7048 type expression. However, __alignof__ is ok. */
7051 "ISO C++ does not allow %<alignof%> "
7055 }
7056 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7057 SIZEOF_EXPR with the original operand. */
7059 {
7061 {
7063 {
7066 error_mark_node));
7068 }
7069 else
7073 }
7075 }
7077 }
7086 {
7087 /* The saved value of the PEDANTIC flag. */
7089 tree expr;
7091 /* Save away the PEDANTIC flag. */
7093 /* Parse the cast-expression. */
7095 /* Restore the PEDANTIC flag. */
7099 }
7103 {
7104 tree expression;
7106 /* Consume the `__real__' or `__imag__' token. */
7108 /* Parse the cast-expression. */
7110 /* Create the complete representation. */
7114 expression,
7115 tf_warning_or_error);
7116 }
7124 {
7125 tree expr;
7135 parser->type_definition_forbidden_message
7138 saved_integral_constant_expression_p
7140 saved_non_integral_constant_expression_p
7144 saved_greater_than_is_operator_p
7154 parser->greater_than_is_operator_p
7157 parser->integral_constant_expression_p
7159 parser->non_integral_constant_expression_p
7166 }
7170 }
7171 }
7173 /* Look for the `:: new' and `:: delete', which also signal the
7174 beginning of a new-expression, or delete-expression,
7175 respectively. If the next token is `::', then it might be one of
7176 these. */
7178 {
7181 /* See if the token after the `::' is one of the keywords in
7182 which we're interested. */
7184 /* If it's `new', we have a new-expression. */
7187 /* Similarly, for `delete'. */
7190 }
7192 /* Look for a unary operator. */
7194 /* The `++' and `--' operators can be handled similarly, even though
7195 they are not technically unary-operators in the grammar. */
7197 {
7202 /* Handle the GNU address-of-label extension. */
7205 {
7206 tree identifier;
7207 tree expression;
7210 /* Consume the '&&' token. */
7212 /* Look for the identifier. */
7214 /* Create an expression representing the address. */
7217 NIC_ADDR_LABEL))
7220 }
7221 }
7223 {
7224 tree cast_expression;
7230 /* Consume the operator token. */
7232 /* Parse the cast-expression. */
7233 cast_expression
7238 pidk);
7239 /* Now, build an appropriate representation. */
7241 {
7245 RO_UNARY_STAR,
7246 complain);
7251 /* Fall through. */
7254 cast_expression,
7255 complain);
7262 /* Fall through. */
7272 }
7276 non_constant_p))
7280 }
7284 decltype_p,
7285 pidk);
7286 }
7291 {
7294 }
7296 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7297 unary-operator, the corresponding tree code is returned. */
7299 static enum tree_code
7301 {
7303 {
7324 }
7325 }
7327 /* Parse a new-expression.
7329 new-expression:
7330 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7331 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7333 Returns a representation of the expression. */
7335 static tree
7337 {
7340 tree type;
7343 tree ret;
7345 /* Look for the optional `::' operator. */
7346 global_scope_p
7350 /* Look for the `new' operator. */
7352 /* There's no easy way to tell a new-placement from the
7353 `( type-id )' construct. */
7355 /* Look for a new-placement. */
7357 /* If that didn't work out, there's no new-placement. */
7359 {
7363 }
7365 /* If the next token is a `(', then we have a parenthesized
7366 type-id. */
7368 {
7372 /* Consume the `('. */
7375 /* Parse the type-id. */
7376 parser->type_definition_forbidden_message
7381 /* Look for the closing `)'. */
7384 /* There should not be a direct-new-declarator in this production,
7385 but GCC used to allowed this, so we check and emit a sensible error
7386 message for this case. */
7388 {
7394 }
7395 }
7396 /* Otherwise, there must be a new-type-id. */
7397 else
7400 /* If the next token is a `(' or '{', then we have a new-initializer. */
7404 else
7407 /* A new-expression may not appear in an integral constant
7408 expression. */
7411 else
7412 {
7413 /* Create a representation of the new-expression. */
7415 tf_warning_or_error);
7416 }
7424 }
7426 /* Parse a new-placement.
7428 new-placement:
7429 ( expression-list )
7431 Returns the same representation as for an expression-list. */
7435 {
7438 /* Parse the expression-list. */
7439 expression_list = (cp_parser_parenthesized_expression_list
7445 }
7447 /* Parse a new-type-id.
7449 new-type-id:
7450 type-specifier-seq new-declarator [opt]
7452 Returns the TYPE allocated. If the new-type-id indicates an array
7453 type, *NELTS is set to the number of elements in the last array
7454 bound; the TYPE will not include the last array bound. */
7456 static tree
7458 {
7459 cp_decl_specifier_seq type_specifier_seq;
7465 /* The type-specifier sequence must not contain type definitions.
7466 (It cannot contain declarations of new types either, but if they
7467 are not definitions we will catch that because they are not
7468 complete.) */
7470 parser->type_definition_forbidden_message
7472 /* Parse the type-specifier-seq. */
7476 /* Restore the old message. */
7482 /* Parse the new-declarator. */
7485 /* Determine the number of elements in the last array dimension, if
7486 any. */
7488 /* Skip down to the last array dimension. */
7493 {
7496 }
7501 {
7504 }
7507 {
7514 else
7516 }
7519 }
7521 /* Parse an (optional) new-declarator.
7523 new-declarator:
7524 ptr-operator new-declarator [opt]
7525 direct-new-declarator
7527 Returns the declarator. */
7531 {
7534 cp_cv_quals cv_quals;
7536 /* We don't know if there's a ptr-operator next, or not. */
7538 /* Look for a ptr-operator. */
7540 /* If that worked, look for more new-declarators. */
7542 {
7545 /* Parse another optional declarator. */
7548 declarator = cp_parser_make_indirect_declarator
7552 }
7554 /* If the next token is a `[', there is a direct-new-declarator. */
7559 }
7561 /* Parse a direct-new-declarator.
7563 direct-new-declarator:
7564 [ expression ]
7565 direct-new-declarator [constant-expression]
7567 */
7571 {
7575 {
7576 tree expression;
7579 /* Look for the opening `['. */
7584 /* The standard requires that the expression have integral
7585 type. DR 74 adds enumeration types. We believe that the
7586 real intent is that these expressions be handled like the
7587 expression in a `switch' condition, which also allows
7588 classes with a single conversion to integral or
7589 enumeration type. */
7591 {
7592 expression
7594 expression,
7597 {
7599 "expression in new-declarator must have integral "
7602 }
7603 }
7605 /* Look for the closing `]'. */
7608 /* Add this bound to the declarator. */
7611 /* If the next token is not a `[', then there are no more
7612 bounds. */
7615 }
7618 }
7620 /* Parse a new-initializer.
7622 new-initializer:
7623 ( expression-list [opt] )
7624 braced-init-list
7626 Returns a representation of the expression-list. */
7630 {
7634 {
7635 tree t;
7642 }
7643 else
7644 expression_list = (cp_parser_parenthesized_expression_list
7650 }
7652 /* Parse a delete-expression.
7654 delete-expression:
7655 :: [opt] delete cast-expression
7656 :: [opt] delete [ ] cast-expression
7658 Returns a representation of the expression. */
7660 static tree
7662 {
7665 tree expression;
7667 /* Look for the optional `::' operator. */
7668 global_scope_p
7672 /* Look for the `delete' keyword. */
7674 /* See if the array syntax is in use. */
7676 {
7677 /* Consume the `[' token. */
7679 /* Look for the `]' token. */
7681 /* Remember that this is the `[]' construct. */
7683 }
7684 else
7687 /* Parse the cast-expression. */
7690 /* A delete-expression may not appear in an integral constant
7691 expression. */
7696 tf_warning_or_error);
7697 }
7699 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7700 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7701 0 otherwise. */
7703 static int
7705 {
7708 {
7750 /* In ((type ()) () the last () isn't a valid cast-expression,
7751 so the whole must be parsed as postfix-expression. */
7756 /* '[' may start a primary-expression in obj-c++ and in C++11,
7757 as a lambda-expression, eg, '(void)[]{}'. */
7764 /* '++' and '--' may or may not start a cast-expression:
7766 struct T { void operator++(int); };
7767 void f() { (T())++; }
7769 vs
7771 int a;
7772 (int)++a; */
7777 }
7778 }
7780 /* Parse a cast-expression.
7782 cast-expression:
7783 unary-expression
7784 ( type-id ) cast-expression
7786 ADDRESS_P is true iff the unary-expression is appearing as the
7787 operand of the `&' operator. CAST_P is true if this expression is
7788 the target of a cast.
7790 Returns a representation of the expression. */
7792 static tree
7795 {
7796 /* If it's a `(', then we might be looking at a cast. */
7798 {
7804 /* There's no way to know yet whether or not this is a cast.
7805 For example, `(int (3))' is a unary-expression, while `(int)
7806 3' is a cast. So, we resort to parsing tentatively. */
7808 /* Types may not be defined in a cast. */
7810 parser->type_definition_forbidden_message
7812 /* Consume the `('. */
7814 /* A very tricky bit is that `(struct S) { 3 }' is a
7815 compound-literal (which we permit in C++ as an extension).
7816 But, that construct is not a cast-expression -- it is a
7817 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7818 is legal; if the compound-literal were a cast-expression,
7819 you'd need an extra set of parentheses.) But, if we parse
7820 the type-id, and it happens to be a class-specifier, then we
7821 will commit to the parse at that point, because we cannot
7822 undo the action that is done when creating a new class. So,
7823 then we cannot back up and do a postfix-expression.
7825 Another tricky case is the following (c++/29234):
7827 struct S { void operator () (); };
7829 void foo ()
7830 {
7831 ( S()() );
7832 }
7834 As a type-id we parse the parenthesized S()() as a function
7835 returning a function, groktypename complains and we cannot
7836 back up in this case either.
7838 Therefore, we scan ahead to the closing `)', and check to see
7839 if the tokens after the `)' can start a cast-expression. Otherwise
7840 we are dealing with an unary-expression, a postfix-expression
7841 or something else.
7843 Yet another tricky case, in C++11, is the following (c++/54891):
7845 (void)[]{};
7847 The issue is that usually, besides the case of lambda-expressions,
7848 the parenthesized type-id cannot be followed by '[', and, eg, we
7849 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7850 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7851 we don't commit, we try a cast-expression, then an unary-expression.
7853 Save tokens so that we can put them back. */
7856 /* We may be looking at a cast-expression. */
7859 cast_expression
7862 /* Roll back the tokens we skipped. */
7864 /* If we aren't looking at a cast-expression, simulate an error so
7865 that the call to cp_parser_error_occurred below returns true. */
7868 else
7869 {
7872 /* Look for the type-id. */
7874 /* Look for the closing `)'. */
7877 }
7879 /* Restore the saved message. */
7882 /* At this point this can only be either a cast or a
7883 parenthesized ctor such as `(T ())' that looks like a cast to
7884 function returning T. */
7886 {
7887 /* Only commit if the cast-expression doesn't start with
7888 '++', '--', or '[' in C++11. */
7896 pidk);
7899 {
7900 /* Warn about old-style casts, if so requested. */
7907 /* Only type conversions to integral or enumeration types
7908 can be used in constant-expressions. */
7911 NIC_CAST))
7914 /* Perform the cast. */
7917 }
7918 }
7919 else
7921 }
7923 /* If we get here, then it's not a cast, so it must be a
7924 unary-expression. */
7927 }
7929 /* Parse a binary expression of the general form:
7931 pm-expression:
7932 cast-expression
7933 pm-expression .* cast-expression
7934 pm-expression ->* cast-expression
7936 multiplicative-expression:
7937 pm-expression
7938 multiplicative-expression * pm-expression
7939 multiplicative-expression / pm-expression
7940 multiplicative-expression % pm-expression
7942 additive-expression:
7943 multiplicative-expression
7944 additive-expression + multiplicative-expression
7945 additive-expression - multiplicative-expression
7947 shift-expression:
7948 additive-expression
7949 shift-expression << additive-expression
7950 shift-expression >> additive-expression
7952 relational-expression:
7953 shift-expression
7954 relational-expression < shift-expression
7955 relational-expression > shift-expression
7956 relational-expression <= shift-expression
7957 relational-expression >= shift-expression
7959 GNU Extension:
7961 relational-expression:
7962 relational-expression <? shift-expression
7963 relational-expression >? shift-expression
7965 equality-expression:
7966 relational-expression
7967 equality-expression == relational-expression
7968 equality-expression != relational-expression
7970 and-expression:
7971 equality-expression
7972 and-expression & equality-expression
7974 exclusive-or-expression:
7975 and-expression
7976 exclusive-or-expression ^ and-expression
7978 inclusive-or-expression:
7979 exclusive-or-expression
7980 inclusive-or-expression | exclusive-or-expression
7982 logical-and-expression:
7983 inclusive-or-expression
7984 logical-and-expression && inclusive-or-expression
7986 logical-or-expression:
7987 logical-and-expression
7988 logical-or-expression || logical-and-expression
7990 All these are implemented with a single function like:
7992 binary-expression:
7993 simple-cast-expression
7994 binary-expression <token> binary-expression
7996 CAST_P is true if this expression is the target of a cast.
7998 The binops_by_token map is used to get the tree codes for each <token> type.
7999 binary-expressions are associated according to a precedence table. */
8001 #define TOKEN_PRECEDENCE(token) \
8002 (((token->type == CPP_GREATER \
8003 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8004 && !parser->greater_than_is_operator_p) \
8005 ? PREC_NOT_OPERATOR \
8006 : binops_by_token[token->type].prec)
8008 static tree
8014 {
8015 cp_parser_expression_stack stack;
8017 cp_parser_expression_stack_entry current;
8018 tree rhs;
8022 tree overload;
8024 /* Parse the first expression. */
8035 {
8036 /* Get an operator token. */
8042 {
8044 "%<>>%> operator is treated"
8048 }
8052 /* Popping an entry off the stack means we completed a subexpression:
8053 - either we found a token which is not an operator (`>' where it is not
8054 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8055 will happen repeatedly;
8056 - or, we found an operator which has lower priority. This is the case
8057 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8058 parsing `3 * 4'. */
8060 {
8063 else
8065 }
8067 get_rhs:
8071 /* We used the operator token. */
8074 /* For "false && x" or "true || x", x will never be executed;
8075 disable warnings while evaluating it. */
8081 /* Extract another operand. It may be the RHS of this expression
8082 or the LHS of a new, higher priority expression. */
8087 /* Get another operator token. Look up its precedence to avoid
8088 building a useless (immediately popped) stack entry for common
8089 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8093 {
8094 /* ... and prepare to parse the RHS of the new, higher priority
8095 expression. Since precedence levels on the stack are
8096 monotonically increasing, we do not have to care about
8097 stack overflows. */
8106 pop:
8108 /* If the stack is not empty, we have parsed into LHS the right side
8109 (`4' in the example above) of an expression we had suspended.
8110 We can use the information on the stack to recover the LHS (`3')
8111 from the stack together with the tree code (`MULT_EXPR'), and
8112 the precedence of the higher level subexpression
8113 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8114 which will be used to actually build the additive expression. */
8119 }
8121 /* Undo the disabling of warnings done above. */
8132 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8133 ERROR_MARK for everything that is not a binary expression.
8134 This makes warn_about_parentheses miss some warnings that
8135 involve unary operators. For unary expressions we should
8136 pass the correct tree_code unless the unary expression was
8137 surrounded by parentheses.
8138 */
8144 == tcc_comparison
8147 else
8156 /* If the binary operator required the use of an overloaded operator,
8157 then this expression cannot be an integral constant-expression.
8158 An overloaded operator can be used even if both operands are
8159 otherwise permissible in an integral constant-expression if at
8160 least one of the operands is of enumeration type. */
8164 NIC_OVERLOADED))
8166 }
8169 }
8171 static tree
8176 {
8179 }
8181 /* Parse the `? expression : assignment-expression' part of a
8182 conditional-expression. The LOGICAL_OR_EXPR is the
8183 logical-or-expression that started the conditional-expression.
8184 Returns a representation of the entire conditional-expression.
8186 This routine is used by cp_parser_assignment_expression.
8188 ? expression : assignment-expression
8190 GNU Extensions:
8192 ? : assignment-expression */
8194 static tree
8196 {
8197 tree expr;
8198 tree assignment_expr;
8202 /* Consume the `?' token. */
8207 {
8210 /* Implicit true clause. */
8214 }
8215 else
8216 {
8219 /* Parse the expression. */
8222 c_inhibit_evaluation_warnings +=
8226 }
8228 /* The next token should be a `:'. */
8230 /* Parse the assignment-expression. */
8234 /* Build the conditional-expression. */
8236 expr,
8237 assignment_expr,
8238 tf_warning_or_error);
8239 }
8241 /* Parse an assignment-expression.
8243 assignment-expression:
8244 conditional-expression
8245 logical-or-expression assignment-operator assignment_expression
8246 throw-expression
8248 CAST_P is true if this expression is the target of a cast.
8249 DECLTYPE_P is true if this expression is the operand of decltype.
8251 Returns a representation for the expression. */
8253 static tree
8256 {
8257 tree expr;
8259 /* If the next token is the `throw' keyword, then we're looking at
8260 a throw-expression. */
8263 /* Otherwise, it must be that we are looking at a
8264 logical-or-expression. */
8265 else
8266 {
8267 /* Parse the binary expressions (logical-or-expression). */
8269 decltype_p,
8271 /* If the next token is a `?' then we're actually looking at a
8272 conditional-expression. */
8275 else
8276 {
8279 /* If it's an assignment-operator, we're using the second
8280 production. */
8281 enum tree_code assignment_operator
8284 {
8286 location_t saved_input_location;
8288 /* Parse the right-hand side of the assignment. */
8294 /* An assignment may not appear in a
8295 constant-expression. */
8297 NIC_ASSIGNMENT))
8299 /* Build the assignment expression. Its default
8300 location is the location of the '=' token. */
8304 assignment_operator,
8305 rhs,
8308 }
8309 }
8310 }
8313 }
8315 static tree
8318 {
8321 }
8323 /* Parse an (optional) assignment-operator.
8325 assignment-operator: one of
8326 = *= /= %= += -= >>= <<= &= ^= |=
8328 GNU Extension:
8330 assignment-operator: one of
8331 <?= >?=
8333 If the next token is an assignment operator, the corresponding tree
8334 code is returned, and the token is consumed. For example, for
8335 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8336 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8337 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8338 operator, ERROR_MARK is returned. */
8340 static enum tree_code
8342 {
8346 /* Peek at the next token. */
8350 {
8396 /* Nothing else is an assignment operator. */
8398 }
8400 /* If it was an assignment operator, consume it. */
8405 }
8407 /* Parse an expression.
8409 expression:
8410 assignment-expression
8411 expression , assignment-expression
8413 CAST_P is true if this expression is the target of a cast.
8414 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8415 except possibly parenthesized or on the RHS of a comma (N3276).
8417 Returns a representation of the expression. */
8419 static tree
8422 {
8427 {
8428 tree assignment_expression;
8430 /* Parse the next assignment-expression. */
8431 assignment_expression
8434 /* We don't create a temporary for a call that is the immediate operand
8435 of decltype or on the RHS of a comma. But when we see a comma, we
8436 need to create a temporary for a call on the LHS. */
8441 assignment_expression
8445 /* If this is the first assignment-expression, we can just
8446 save it away. */
8449 else
8451 assignment_expression,
8453 /* If the next token is not a comma, then we are done with the
8454 expression. */
8457 /* Consume the `,'. */
8460 /* A comma operator cannot appear in a constant-expression. */
8463 }
8466 }
8468 /* Parse a constant-expression.
8470 constant-expression:
8471 conditional-expression
8473 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8474 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8475 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8476 is false, NON_CONSTANT_P should be NULL. */
8478 static tree
8482 {
8486 tree expression;
8488 /* It might seem that we could simply parse the
8489 conditional-expression, and then check to see if it were
8490 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8491 one that the compiler can figure out is constant, possibly after
8492 doing some simplifications or optimizations. The standard has a
8493 precise definition of constant-expression, and we must honor
8494 that, even though it is somewhat more restrictive.
8496 For example:
8498 int i[(2, 3)];
8500 is not a legal declaration, because `(2, 3)' is not a
8501 constant-expression. The `,' operator is forbidden in a
8502 constant-expression. However, GCC's constant-folding machinery
8503 will fold this operation to an INTEGER_CST for `3'. */
8505 /* Save the old settings. */
8507 saved_allow_non_integral_constant_expression_p
8510 /* We are now parsing a constant-expression. */
8512 parser->allow_non_integral_constant_expression_p
8515 /* Although the grammar says "conditional-expression", we parse an
8516 "assignment-expression", which also permits "throw-expression"
8517 and the use of assignment operators. In the case that
8518 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8519 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8520 actually essential that we look for an assignment-expression.
8521 For example, cp_parser_initializer_clauses uses this function to
8522 determine whether a particular assignment-expression is in fact
8523 constant. */
8525 /* Restore the old settings. */
8526 parser->integral_constant_expression_p
8528 parser->allow_non_integral_constant_expression_p
8531 {
8532 /* Require an rvalue constant expression here; that's what our
8533 callers expect. Reference constant expressions are handled
8534 separately in e.g. cp_parser_template_argument. */
8539 }
8542 parser->non_integral_constant_expression_p
8546 }
8548 /* Parse __builtin_offsetof.
8550 offsetof-expression:
8551 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8553 offsetof-member-designator:
8554 id-expression
8555 | offsetof-member-designator "." id-expression
8556 | offsetof-member-designator "[" expression "]"
8557 | offsetof-member-designator "->" id-expression */
8559 static tree
8561 {
8564 cp_id_kind dummy;
8567 /* We're about to accept non-integral-constant things, but will
8568 definitely yield an integral constant expression. Save and
8569 restore these values around our local parsing. */
8573 /* Consume the "__builtin_offsetof" token. */
8575 /* Consume the opening `('. */
8577 /* Parse the type-id. */
8579 /* Look for the `,'. */
8583 /* Build the (type *)null that begins the traditional offsetof macro. */
8585 tf_warning_or_error);
8587 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8591 {
8594 {
8596 /* offsetof-member-designator "[" expression "]" */
8602 /* offsetof-member-designator "->" identifier */
8605 /* FALLTHRU */
8608 /* offsetof-member-designator "." identifier */
8616 /* Consume the ")" token. */
8621 /* Error. We know the following require will fail, but
8622 that gives the proper error message. */
8627 }
8628 }
8630 success:
8631 /* If we're processing a template, we can't finish the semantics yet.
8632 Otherwise we can fold the entire expression now. */
8635 else
8638 failure:
8643 }
8645 /* Parse a trait expression.
8647 Returns a representation of the expression, the underlying type
8648 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8650 static tree
8652 {
8653 cp_trait_kind kind;
8656 cp_decl_specifier_seq decl_specs;
8659 {
8736 }
8738 /* Consume the token. */
8748 /* Build a trivial decl-specifier-seq. */
8752 /* Call grokdeclarator to figure out what type this is. */
8757 {
8765 /* Build a trivial decl-specifier-seq. */
8769 /* Call grokdeclarator to figure out what type this is. */
8772 }
8776 /* Complete the trait expression, which may mean either processing
8777 the trait expr now or saving it for template instantiation. */
8779 {
8788 }
8789 }
8791 /* Lambdas that appear in variable initializer or default argument scope
8792 get that in their mangling, so we need to record it. We might as well
8793 use the count for function and namespace scopes as well. */
8797 {
8798 tree t;
8803 static void
8805 {
8806 tree_int ti;
8808 /* Once we're inside a function, we ignore other scopes and just push
8809 the function again so that popping works properly. */
8816 {
8817 /* Don't reset the count if we're still in the same function. */
8820 }
8821 }
8823 static void
8825 {
8828 }
8830 static void
8832 {
8835 {
8838 }
8840 }
8842 /* Parse a lambda expression.
8844 lambda-expression:
8845 lambda-introducer lambda-declarator [opt] compound-statement
8847 Returns a representation of the expression. */
8849 static tree
8851 {
8853 tree type;
8860 {
8862 {
8866 }
8868 }
8870 /* We may be in the middle of deferred access check. Disable
8871 it now. */
8882 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8885 /* Now that we've started the type, add the capture fields for any
8886 explicit captures. */
8889 {
8890 /* Inside the class, surrounding template-parameter-lists do not apply. */
8891 unsigned int saved_num_template_parameter_lists
8895 bool fully_implicit_function_template_p
8899 bool auto_is_implicit_function_template_parm_p
8910 /* By virtue of defining a local class, a lambda expression has access to
8911 the private variables of enclosing classes. */
8918 {
8921 }
8923 /* The capture list was built up in reverse order; fix that now. */
8935 parser->fully_implicit_function_template_p
8939 parser->auto_is_implicit_function_template_parm_p
8941 }
8945 /* This field is only used during parsing of the lambda. */
8948 /* This lambda shouldn't have any proxies left at this point. */
8950 /* And now that we're done, push proxies for an enclosing lambda. */
8955 else
8957 }
8959 /* Parse the beginning of a lambda expression.
8961 lambda-introducer:
8962 [ lambda-capture [opt] ]
8964 LAMBDA_EXPR is the current representation of the lambda expression. */
8966 static void
8968 {
8969 /* Need commas after the first capture. */
8972 /* Eat the leading `['. */
8975 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8983 {
8986 }
8989 {
8991 tree capture_id;
8992 tree capture_init_expr;
8996 enum capture_kind_type
8997 {
8998 BY_COPY,
8999 BY_REFERENCE
9000 };
9004 {
9007 }
9011 else
9014 /* Possibly capture `this'. */
9016 {
9026 explicit_init_p);
9028 }
9030 /* Remember whether we want to capture as a reference or not. */
9032 {
9035 }
9037 /* Get the identifier. */
9042 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9043 delimiters, but I modified this to stop on unnested ']' as well. It
9044 was already changed to stop on unnested '}', so the
9045 "closing_parenthesis" name is no more misleading with my change. */
9046 {
9052 }
9054 /* Find the initializer for this capture. */
9058 {
9060 /* An explicit initializer exists. */
9063 "lambda capture initializers "
9069 {
9072 }
9073 }
9074 else
9075 {
9078 /* Turn the identifier into an id-expression. */
9079 capture_init_expr
9084 {
9087 }
9091 {
9094 capture_init_expr);
9097 }
9100 {
9103 capture_init_expr))
9106 }
9108 capture_init_expr
9109 = finish_id_expression
9111 capture_init_expr,
9125 {
9128 }
9129 else
9131 }
9135 {
9140 capture_id);
9144 "capture of %qD redundant with by-reference capture "
9146 }
9149 capture_id,
9150 capture_init_expr,
9152 explicit_init_p);
9153 }
9156 }
9158 /* Parse the (optional) middle of a lambda expression.
9160 lambda-declarator:
9161 < template-parameter-list [opt] >
9162 ( parameter-declaration-clause [opt] )
9163 attribute-specifier [opt]
9164 mutable [opt]
9165 exception-specification [opt]
9166 lambda-return-type-clause [opt]
9168 LAMBDA_EXPR is the current representation of the lambda expression. */
9170 static bool
9172 {
9173 /* 5.1.1.4 of the standard says:
9174 If a lambda-expression does not include a lambda-declarator, it is as if
9175 the lambda-declarator were ().
9176 This means an empty parameter list, no attributes, and no exception
9177 specification. */
9183 /* The template-parameter-list is optional, but must begin with
9184 an opening angle if present. */
9186 {
9189 "lambda templates are only available with "
9198 /* We just processed one more parameter list. */
9200 }
9202 /* The parameter-declaration-clause is optional (unless
9203 template-parameter-list was given), but must begin with an
9204 opening parenthesis if present. */
9206 {
9211 /* Parse parameters. */
9214 /* Default arguments shall not be specified in the
9215 parameter-declaration-clause of a lambda-declarator. */
9225 /* Parse optional `mutable' keyword. */
9227 {
9230 }
9232 /* Parse optional exception specification. */
9235 /* Parse optional trailing return type. */
9237 {
9241 }
9243 /* The function parameters must be in scope all the way until after the
9244 trailing-return-type in case of decltype. */
9246 }
9250 /* Create the function call operator.
9252 Messing with declarators like this is no uglier than building up the
9253 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9254 other code. */
9255 {
9256 cp_decl_specifier_seq return_type_specs;
9258 tree fco;
9265 else
9266 /* Maybe we will deduce the return type later. */
9272 sfk_none);
9277 VIRT_SPEC_UNSPECIFIED,
9278 REF_QUAL_NONE,
9279 exception_spec,
9284 declarator,
9285 attributes);
9287 {
9290 /* Give the object parameter a different name. */
9294 }
9296 {
9300 }
9309 }
9310 }
9312 /* Parse the body of a lambda expression, which is simply
9314 compound-statement
9316 but which requires special handling.
9317 LAMBDA_EXPR is the current representation of the lambda expression. */
9319 static void
9321 {
9326 else
9327 /* Still increment function_depth so that we don't GC in the
9328 middle of an expression. */
9330 /* Clear this in case we're in the middle of a default argument. */
9333 /* Finish the function call operator
9334 - class_specifier
9335 + late_parsing_for_member
9336 + function_definition_after_declarator
9337 + ctor_initializer_opt_and_function_body */
9338 {
9340 tree body;
9342 tree compound_stmt;
9343 tree cap;
9345 /* Let the front end know that we are going to be defining this
9346 function. */
9348 NULL_TREE,
9357 /* Push the proxies for any explicit captures. */
9364 /* 5.1.1.4 of the standard says:
9365 If a lambda-expression does not include a trailing-return-type, it
9366 is as if the trailing-return-type denotes the following type:
9367 * if the compound-statement is of the form
9368 { return attribute-specifier [opt] expression ; }
9369 the type of the returned expression after lvalue-to-rvalue
9370 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9371 (_conv.array_ 4.2), and function-to-pointer conversion
9372 (_conv.func_ 4.3);
9373 * otherwise, void. */
9375 /* In a lambda that has neither a lambda-return-type-clause
9376 nor a deducible form, errors should be reported for return statements
9377 in the body. Since we used void as the placeholder return type, parsing
9378 the body as usual will give such desired behavior. */
9382 {
9386 /* Parse tentatively in case there's more after the initial return
9387 statement. */
9398 {
9402 /* Will get error here if type not deduced yet. */
9406 }
9407 }
9410 {
9415 }
9419 out:
9423 /* Finish the function and generate code for it if necessary. */
9426 /* Only expand if the call op is not a template. */
9429 }
9434 else
9436 }
9438 /* Statements [gram.stmt.stmt] */
9440 /* Parse a statement.
9442 statement:
9443 labeled-statement
9444 expression-statement
9445 compound-statement
9446 selection-statement
9447 iteration-statement
9448 jump-statement
9449 declaration-statement
9450 try-block
9452 C++11:
9454 statement:
9455 labeled-statement
9456 attribute-specifier-seq (opt) expression-statement
9457 attribute-specifier-seq (opt) compound-statement
9458 attribute-specifier-seq (opt) selection-statement
9459 attribute-specifier-seq (opt) iteration-statement
9460 attribute-specifier-seq (opt) jump-statement
9461 declaration-statement
9462 attribute-specifier-seq (opt) try-block
9464 TM Extension:
9466 statement:
9467 atomic-statement
9469 IN_COMPOUND is true when the statement is nested inside a
9470 cp_parser_compound_statement; this matters for certain pragmas.
9472 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9473 is a (possibly labeled) if statement which is not enclosed in braces
9474 and has an else clause. This is used to implement -Wparentheses. */
9476 static void
9479 {
9484 restart:
9487 /* There is no statement yet. */
9493 /* In obj-c++, seeing '[[' might be the either the beginning of
9494 c++11 attributes, or a nested objc-message-expression. So
9495 let's parse the c++11 attributes tentatively. */
9499 {
9502 }
9504 /* Peek at the next token. */
9506 /* Remember the location of the first token in the statement. */
9508 /* If this is a keyword, then that will often determine what kind of
9509 statement we have. */
9511 {
9515 {
9518 /* Looks like a labeled-statement with a case label.
9519 Parse the label, and then use tail recursion to parse
9520 the statement. */
9545 {
9550 }
9551 else
9552 {
9556 }
9560 /* Objective-C++ exception-handling constructs. */
9574 /* This must be a namespace alias definition. */
9587 /* It might be a keyword like `int' that can start a
9588 declaration-statement. */
9590 }
9591 }
9593 {
9594 /* If the next token is a `:', then we are looking at a
9595 labeled-statement. */
9598 {
9599 /* Looks like a labeled-statement with an ordinary label.
9600 Parse the label, and then use tail recursion to parse
9601 the statement. */
9605 }
9606 }
9607 /* Anything that starts with a `{' must be a compound-statement. */
9610 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9611 a statement all its own. */
9613 {
9614 /* Only certain OpenMP pragmas are attached to statements, and thus
9615 are considered statements themselves. All others are not. In
9616 the context of a compound, accept the pragma as a "statement" and
9617 return so that we can check for a close brace. Otherwise we
9618 require a real statement and must go back and read one. */
9624 }
9626 {
9629 }
9631 /* Everything else must be a declaration-statement or an
9632 expression-statement. Try for the declaration-statement
9633 first, unless we are looking at a `;', in which case we know that
9634 we have an expression-statement. */
9636 {
9638 {
9640 {
9641 /* Attributes should be parsed as part of the the
9642 declaration, so let's un-parse them. */
9645 }
9648 /* Try to parse the declaration-statement. */
9650 /* If that worked, we're done. */
9653 }
9654 /* Look for an expression-statement instead. */
9656 }
9658 /* Set the line number for the statement. */
9662 /* Note that for now, we don't do anything with c++11 statements
9663 parsed at this level. */
9666 OPT_Wattributes,
9668 }
9670 /* Parse the label for a labeled-statement, i.e.
9672 identifier :
9673 case constant-expression :
9674 default :
9676 GNU Extension:
9677 case constant-expression ... constant-expression : statement
9679 When a label is parsed without errors, the label is added to the
9680 parse tree by the finish_* functions, so this function doesn't
9681 have to return the label. */
9683 static void
9685 {
9690 /* The next token should be an identifier. */
9694 {
9697 }
9701 {
9703 {
9707 /* Consume the `case' token. */
9709 /* Parse the constant-expression. */
9712 NULL);
9716 {
9717 /* Consume the `...' token. */
9719 expr_hi =
9722 NULL);
9723 /* We don't need to emit warnings here, as the common code
9724 will do this for us. */
9725 }
9726 else
9731 else
9734 expr);
9735 }
9739 /* Consume the `default' token. */
9744 else
9749 /* Anything else must be an ordinary label. */
9752 }
9754 /* Require the `:' token. */
9757 /* An ordinary label may optionally be followed by attributes.
9758 However, this is only permitted if the attributes are then
9759 followed by a semicolon. This is because, for backward
9760 compatibility, when parsing
9761 lab: __attribute__ ((unused)) int i;
9762 we want the attribute to attach to "i", not "lab". */
9765 {
9766 tree attrs;
9773 ;
9774 else
9776 }
9782 }
9784 /* Parse an expression-statement.
9786 expression-statement:
9787 expression [opt] ;
9789 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9790 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9791 indicates whether this expression-statement is part of an
9792 expression statement. */
9794 static tree
9796 {
9800 /* If the next token is a ';', then there is no expression
9801 statement. */
9803 {
9807 {
9810 }
9811 }
9813 /* Give a helpful message for "A<T>::type t;" and the like. */
9816 {
9823 {
9824 /* A::A a; */
9829 }
9830 }
9832 /* Consume the final `;'. */
9837 /* This is the final expression statement of a statement
9838 expression. */
9844 }
9846 /* Parse a compound-statement.
9848 compound-statement:
9849 { statement-seq [opt] }
9851 GNU extension:
9853 compound-statement:
9854 { label-declaration-seq [opt] statement-seq [opt] }
9856 label-declaration-seq:
9857 label-declaration
9858 label-declaration-seq label-declaration
9860 Returns a tree representing the statement. */
9862 static tree
9865 {
9866 tree compound_stmt;
9868 /* Consume the `{'. */
9875 /* Begin the compound-statement. */
9877 /* If the next keyword is `__label__' we have a label declaration. */
9880 /* Parse an (optional) statement-seq. */
9882 /* Finish the compound-statement. */
9884 /* Consume the `}'. */
9888 }
9890 /* Parse an (optional) statement-seq.
9892 statement-seq:
9893 statement
9894 statement-seq [opt] statement */
9896 static void
9898 {
9899 /* Scan statements until there aren't any more. */
9901 {
9904 /* If we are looking at a `}', then we have run out of
9905 statements; the same is true if we have reached the end
9906 of file, or have stumbled upon a stray '@end'. */
9913 /* If we are in a compound statement and find 'else' then
9914 something went wrong. */
9916 {
9919 else
9920 {
9923 }
9924 }
9926 /* Parse the statement. */
9928 }
9929 }
9931 /* Parse a selection-statement.
9933 selection-statement:
9934 if ( condition ) statement
9935 if ( condition ) statement else statement
9936 switch ( condition ) statement
9938 Returns the new IF_STMT or SWITCH_STMT.
9940 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9941 is a (possibly labeled) if statement which is not enclosed in
9942 braces and has an else clause. This is used to implement
9943 -Wparentheses. */
9945 static tree
9947 {
9954 /* Peek at the next token. */
9957 /* See what kind of keyword it is. */
9960 {
9963 {
9964 tree statement;
9965 tree condition;
9967 /* Look for the `('. */
9969 {
9972 }
9974 /* Begin the selection-statement. */
9977 else
9980 /* Parse the condition. */
9982 /* Look for the `)'. */
9988 {
9992 /* Add the condition. */
9995 /* Parse the then-clause. */
9999 {
10007 }
10008 else
10014 /* If the next token is `else', parse the else-clause. */
10016 RID_ELSE))
10017 {
10018 /* Consume the `else' keyword. */
10021 /* Parse the else-clause. */
10023 {
10024 location_t loc;
10031 }
10032 else
10037 /* If we are currently parsing a then-clause, then
10038 IF_P will not be NULL. We set it to true to
10039 indicate that this if statement has an else clause.
10040 This may trigger the Wparentheses warning below
10041 when we get back up to the parent if statement. */
10044 }
10045 else
10046 {
10047 /* This if statement does not have an else clause. If
10048 NESTED_IF is true, then the then-clause is an if
10049 statement which does have an else clause. We warn
10050 about the potential ambiguity. */
10053 "suggest explicit braces to avoid ambiguous"
10055 }
10057 /* Now we're all done with the if-statement. */
10059 }
10060 else
10061 {
10065 /* Add the condition. */
10068 /* Parse the body of the switch-statement. */
10077 /* Now we're all done with the switch-statement. */
10079 }
10082 }
10088 }
10089 }
10091 /* Parse a condition.
10093 condition:
10094 expression
10095 type-specifier-seq declarator = initializer-clause
10096 type-specifier-seq declarator braced-init-list
10098 GNU Extension:
10100 condition:
10101 type-specifier-seq declarator asm-specification [opt]
10102 attributes [opt] = assignment-expression
10104 Returns the expression that should be tested. */
10106 static tree
10108 {
10109 cp_decl_specifier_seq type_specifiers;
10113 /* Try the declaration first. */
10115 /* New types are not allowed in the type-specifier-seq for a
10116 condition. */
10118 parser->type_definition_forbidden_message
10120 /* Parse the type-specifier-seq. */
10122 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10125 /* Restore the saved message. */
10127 /* If all is well, we might be looking at a declaration. */
10129 {
10130 tree decl;
10131 tree asm_specification;
10132 tree attributes;
10136 /* Parse the declarator. */
10142 /* Parse the attributes. */
10144 /* Parse the asm-specification. */
10146 /* If the next token is not an `=' or '{', then we might still be
10147 looking at an expression. For example:
10149 if (A(a).x)
10151 looks like a decl-specifier-seq and a declarator -- but then
10152 there is no `=', so this is an expression. */
10157 /* If we did see an `=' or '{', then we are looking at a declaration
10158 for sure. */
10160 {
10161 tree pushed_scope;
10165 /* Create the declaration. */
10171 /* Parse the initializer. */
10173 {
10177 }
10178 else
10179 {
10180 /* Consume the `='. */
10183 }
10187 /* Process the initializer. */
10190 asm_specification,
10191 flags);
10197 }
10198 }
10199 /* If we didn't even get past the declarator successfully, we are
10200 definitely not looking at a declaration. */
10201 else
10204 /* Otherwise, we are looking at an expression. */
10206 }
10208 /* Parses a for-statement or range-for-statement until the closing ')',
10209 not included. */
10211 static tree
10213 {
10217 /* Begin the for-statement. */
10220 /* Parse the initialization. */
10225 else
10227 }
10229 static tree
10231 {
10232 /* Normal for loop */
10235 tree stmt;
10238 /* The for-init-statement has already been parsed in
10239 cp_parser_for_init_statement, so no work is needed here. */
10242 /* If there's a condition, process it. */
10246 {
10250 }
10252 /* Look for the `;'. */
10255 /* If there's an expression, process it. */
10261 }
10263 /* Tries to parse a range-based for-statement:
10265 range-based-for:
10266 decl-specifier-seq declarator : expression
10268 The decl-specifier-seq declarator and the `:' are already parsed by
10269 cp_parser_for_init_statement. If processing_template_decl it returns a
10270 newly created RANGE_FOR_STMT; if not, it is converted to a
10271 regular FOR_STMT. */
10273 static tree
10276 {
10280 {
10283 }
10284 else
10287 /* If in template, STMT is converted to a normal for-statement
10288 at instantiation. If not, it is done just ahead. */
10290 {
10298 /* do_auto_deduction doesn't mess with template init-lists. */
10301 }
10302 else
10303 {
10306 }
10308 }
10310 /* Subroutine of cp_convert_range_for: given the initializer expression,
10311 builds up the range temporary. */
10313 static tree
10315 {
10318 /* Find out the type deduced by the declaration
10319 `auto &&__range = range_expr'. */
10324 /* Create the __range variable. */
10331 }
10333 /* Used by cp_parser_range_for in template context: we aren't going to
10334 do a full conversion yet, but we still need to resolve auto in the
10335 type of the for-range-declaration if present. This is basically
10336 a shortcut version of cp_convert_range_for. */
10338 static void
10340 {
10343 {
10346 iter_type = (cp_parser_perform_range_for_lookup
10349 {
10351 iter_type);
10353 tf_warning_or_error);
10356 }
10357 }
10358 }
10360 /* Converts a range-based for-statement into a normal
10361 for-statement, as per the definition.
10363 for (RANGE_DECL : RANGE_EXPR)
10364 BLOCK
10366 should be equivalent to:
10368 {
10369 auto &&__range = RANGE_EXPR;
10370 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10371 __begin != __end;
10372 ++__begin)
10373 {
10374 RANGE_DECL = *__begin;
10375 BLOCK
10376 }
10377 }
10379 If RANGE_EXPR is an array:
10380 BEGIN_EXPR = __range
10381 END_EXPR = __range + ARRAY_SIZE(__range)
10382 Else if RANGE_EXPR has a member 'begin' or 'end':
10383 BEGIN_EXPR = __range.begin()
10384 END_EXPR = __range.end()
10385 Else:
10386 BEGIN_EXPR = begin(__range)
10387 END_EXPR = end(__range);
10389 If __range has a member 'begin' but not 'end', or vice versa, we must
10390 still use the second alternative (it will surely fail, however).
10391 When calling begin()/end() in the third alternative we must use
10392 argument dependent lookup, but always considering 'std' as an associated
10393 namespace. */
10395 tree
10398 {
10404 /* If an error happened previously do nothing or else a lot of
10405 unhelpful errors would be issued. */
10407 else
10408 {
10409 tree range_temp;
10413 /* Can't bind a reference to an array of runtime bound. */
10415 else
10416 {
10421 LOOKUP_ONLYCONVERTING);
10423 }
10426 }
10428 /* The new for initialization statement. */
10436 LOOKUP_ONLYCONVERTING);
10445 LOOKUP_ONLYCONVERTING);
10449 /* The new for condition. */
10456 /* The new increment expression. */
10459 tf_warning_or_error);
10462 /* The declaration is initialized with *__begin inside the loop body. */
10465 tf_warning_or_error),
10467 LOOKUP_ONLYCONVERTING);
10470 }
10472 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10473 We need to solve both at the same time because the method used
10474 depends on the existence of members begin or end.
10475 Returns the type deduced for the iterator expression. */
10477 static tree
10479 {
10481 {
10484 }
10487 {
10492 }
10494 {
10495 /* If RANGE is an array, we will use pointer arithmetic. */
10498 range,
10502 }
10503 else
10504 {
10505 /* If it is not an array, we must do a bit of magic. */
10515 tf_warning_or_error);
10518 tf_warning_or_error);
10521 {
10522 /* Use the member functions. */
10525 else
10531 else
10534 }
10535 else
10536 {
10537 /* Use global functions with ADL. */
10544 tf_warning_or_error);
10546 tf_warning_or_error);
10548 tf_warning_or_error);
10550 tf_warning_or_error);
10553 }
10555 /* Last common checks. */
10557 {
10558 /* If one of the expressions is an error do no more checks. */
10561 }
10564 /* Can happen, when, eg, in a template context, Koenig lookup
10565 can't resolve begin/end (c++/58503). */
10567 else
10568 {
10570 /* The unqualified type of the __begin and __end temporaries should
10571 be the same, as required by the multiple auto declaration. */
10577 }
10578 }
10579 }
10581 /* Helper function for cp_parser_perform_range_for_lookup.
10582 Builds a tree for RANGE.IDENTIFIER(). */
10584 static tree
10586 {
10599 tf_warning_or_error);
10602 }
10604 /* Parse an iteration-statement.
10606 iteration-statement:
10607 while ( condition ) statement
10608 do statement while ( expression ) ;
10609 for ( for-init-statement condition [opt] ; expression [opt] )
10610 statement
10612 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10614 static tree
10616 {
10619 tree statement;
10622 /* Peek at the next token. */
10627 /* Remember whether or not we are already within an iteration
10628 statement. */
10631 /* See what kind of keyword it is. */
10634 {
10636 {
10637 tree condition;
10639 /* Begin the while-statement. */
10641 /* Look for the `('. */
10643 /* Parse the condition. */
10646 /* Look for the `)'. */
10648 /* Parse the dependent statement. */
10652 /* We're done with the while-statement. */
10654 }
10658 {
10659 tree expression;
10661 /* Begin the do-statement. */
10663 /* Parse the body of the do-statement. */
10668 /* Look for the `while' keyword. */
10670 /* Look for the `('. */
10672 /* Parse the expression. */
10674 /* We're done with the do-statement. */
10676 /* Look for the `)'. */
10678 /* Look for the `;'. */
10680 }
10684 {
10685 /* Look for the `('. */
10690 /* Look for the `)'. */
10693 /* Parse the body of the for-statement. */
10698 /* We're done with the for-statement. */
10700 }
10707 }
10710 }
10712 /* Parse a for-init-statement or the declarator of a range-based-for.
10713 Returns true if a range-based-for declaration is seen.
10715 for-init-statement:
10716 expression-statement
10717 simple-declaration */
10719 static bool
10721 {
10722 /* If the next token is a `;', then we have an empty
10723 expression-statement. Grammatically, this is also a
10724 simple-declaration, but an invalid one, because it does not
10725 declare anything. Therefore, if we did not handle this case
10726 specially, we would issue an error message about an invalid
10727 declaration. */
10729 {
10735 {
10736 /* N3994 -- for (id : init) ... */
10739 "type-specifier only available with "
10747 }
10749 /* A colon is used in range-based for. */
10752 /* We're going to speculatively look for a declaration, falling back
10753 to an expression, if necessary. */
10755 /* Parse the declaration. */
10758 decl);
10761 {
10762 /* It is a range-for, consume the ':' */
10766 {
10768 "range-based %<for%> loops only available with "
10771 }
10772 }
10773 else
10774 /* The ';' is not consumed yet because we told
10775 cp_parser_simple_declaration not to. */
10780 /* If the tentative parse failed, then we shall need to look for an
10781 expression-statement. */
10782 }
10783 /* If we are here, it is an expression-statement. */
10786 }
10788 /* Parse a jump-statement.
10790 jump-statement:
10791 break ;
10792 continue ;
10793 return expression [opt] ;
10794 return braced-init-list ;
10795 goto identifier ;
10797 GNU extension:
10799 jump-statement:
10800 goto * expression ;
10802 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10804 static tree
10806 {
10812 /* Peek at the next token. */
10817 /* See what kind of keyword it is. */
10820 {
10824 {
10844 }
10850 {
10857 /* Fall through. */
10867 }
10872 {
10873 tree expr;
10877 {
10881 }
10884 else
10885 /* If the next token is a `;', then there is no
10886 expression. */
10888 /* Build the return-statement. */
10890 /* Look for the final `;'. */
10892 }
10896 /* Create the goto-statement. */
10898 {
10899 /* Issue a warning about this use of a GNU extension. */
10901 /* Consume the '*' token. */
10903 /* Parse the dependent expression. */
10905 }
10906 else
10908 /* Look for the final `;'. */
10915 }
10918 }
10920 /* Parse a declaration-statement.
10922 declaration-statement:
10923 block-declaration */
10925 static void
10927 {
10930 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10933 /* Parse the block-declaration. */
10936 /* Free any declarators allocated. */
10938 }
10940 /* Some dependent statements (like `if (cond) statement'), are
10941 implicitly in their own scope. In other words, if the statement is
10942 a single statement (as opposed to a compound-statement), it is
10943 none-the-less treated as if it were enclosed in braces. Any
10944 declarations appearing in the dependent statement are out of scope
10945 after control passes that point. This function parses a statement,
10946 but ensures that is in its own scope, even if it is not a
10947 compound-statement.
10949 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10950 is a (possibly labeled) if statement which is not enclosed in
10951 braces and has an else clause. This is used to implement
10952 -Wparentheses.
10954 Returns the new statement. */
10956 static tree
10958 {
10959 tree statement;
10964 /* Mark if () ; with a special NOP_EXPR. */
10966 {
10970 }
10971 /* if a compound is opened, we simply parse the statement directly. */
10974 /* If the token is not a `{', then we must take special action. */
10975 else
10976 {
10977 /* Create a compound-statement. */
10979 /* Parse the dependent-statement. */
10981 /* Finish the dummy compound-statement. */
10983 }
10985 /* Return the statement. */
10987 }
10989 /* For some dependent statements (like `while (cond) statement'), we
10990 have already created a scope. Therefore, even if the dependent
10991 statement is a compound-statement, we do not want to create another
10992 scope. */
10994 static void
10996 {
10997 /* If the token is a `{', then we must take special action. */
11000 else
11001 {
11002 /* Avoid calling cp_parser_compound_statement, so that we
11003 don't create a new scope. Do everything else by hand. */
11005 /* If the next keyword is `__label__' we have a label declaration. */
11008 /* Parse an (optional) statement-seq. */
11011 }
11012 }
11014 /* Declarations [gram.dcl.dcl] */
11016 /* Parse an optional declaration-sequence.
11018 declaration-seq:
11019 declaration
11020 declaration-seq declaration */
11022 static void
11024 {
11026 {
11037 {
11038 /* A declaration consisting of a single semicolon is
11039 invalid. Allow it unless we're being pedantic. */
11044 }
11046 /* If we're entering or exiting a region that's implicitly
11047 extern "C", modify the lang context appropriately. */
11049 {
11052 }
11054 {
11057 }
11060 {
11061 /* A top-level declaration can consist solely of a #pragma.
11062 A nested declaration cannot, so this is done here and not
11063 in cp_parser_declaration. (A #pragma at block scope is
11064 handled in cp_parser_statement.) */
11067 }
11069 /* Parse the declaration itself. */
11071 }
11072 }
11074 /* Parse a declaration.
11076 declaration:
11077 block-declaration
11078 function-definition
11079 template-declaration
11080 explicit-instantiation
11081 explicit-specialization
11082 linkage-specification
11083 namespace-definition
11085 GNU extension:
11087 declaration:
11088 __extension__ declaration */
11090 static void
11092 {
11093 cp_token token1;
11094 cp_token token2;
11099 /* Check for the `__extension__' keyword. */
11101 {
11102 /* Parse the qualified declaration. */
11104 /* Restore the PEDANTIC flag. */
11108 }
11110 /* Try to figure out what kind of declaration is present. */
11115 else
11116 {
11119 }
11121 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11124 /* If the next token is `extern' and the following token is a string
11125 literal, then we have a linkage specification. */
11129 /* If the next token is `template', then we have either a template
11130 declaration, an explicit instantiation, or an explicit
11131 specialization. */
11133 {
11134 /* `template <>' indicates a template specialization. */
11138 /* `template <' indicates a template declaration. */
11141 /* Anything else must be an explicit instantiation. */
11142 else
11144 }
11145 /* If the next token is `export', then we have a template
11146 declaration. */
11149 /* If the next token is `extern', 'static' or 'inline' and the one
11150 after that is `template', we have a GNU extended explicit
11151 instantiation directive. */
11158 /* If the next token is `namespace', check for a named or unnamed
11159 namespace definition. */
11165 /* An unnamed namespace definition. */
11169 /* An inline (associated) namespace definition. */
11173 /* Objective-C++ declaration/definition. */
11180 /* We must have either a block declaration or a function
11181 definition. */
11182 else
11183 /* Try to parse a block-declaration, or a function-definition. */
11186 /* Free any declarators allocated. */
11188 }
11190 /* Parse a block-declaration.
11192 block-declaration:
11193 simple-declaration
11194 asm-definition
11195 namespace-alias-definition
11196 using-declaration
11197 using-directive
11199 GNU Extension:
11201 block-declaration:
11202 __extension__ block-declaration
11204 C++0x Extension:
11206 block-declaration:
11207 static_assert-declaration
11209 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11210 part of a declaration-statement. */
11212 static void
11215 {
11219 /* Check for the `__extension__' keyword. */
11221 {
11222 /* Parse the qualified declaration. */
11224 /* Restore the PEDANTIC flag. */
11228 }
11230 /* Peek at the next token to figure out which kind of declaration is
11231 present. */
11234 /* If the next keyword is `asm', we have an asm-definition. */
11236 {
11240 }
11241 /* If the next keyword is `namespace', we have a
11242 namespace-alias-definition. */
11245 /* If the next keyword is `using', we have a
11246 using-declaration, a using-directive, or an alias-declaration. */
11248 {
11253 /* If the token after `using' is `namespace', then we have a
11254 using-directive. */
11258 /* If the second token after 'using' is '=', then we have an
11259 alias-declaration. */
11265 /* Otherwise, it's a using-declaration. */
11266 else
11269 }
11270 /* If the next keyword is `__label__' we have a misplaced label
11271 declaration. */
11273 {
11277 /* If the next token is now a `;', consume it. */
11280 }
11281 /* If the next token is `static_assert' we have a static assertion. */
11284 /* Anything else must be a simple-declaration. */
11285 else
11288 }
11290 /* Parse a simple-declaration.
11292 simple-declaration:
11293 decl-specifier-seq [opt] init-declarator-list [opt] ;
11295 init-declarator-list:
11296 init-declarator
11297 init-declarator-list , init-declarator
11299 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11300 function-definition as a simple-declaration.
11302 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11303 parsed declaration if it is an uninitialized single declarator not followed
11304 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11305 if present, will not be consumed. */
11307 static void
11311 {
11312 cp_decl_specifier_seq decl_specifiers;
11319 /* Defer access checks until we know what is being declared; the
11320 checks for names appearing in the decl-specifier-seq should be
11321 done as if we were in the scope of the thing being declared. */
11324 /* Parse the decl-specifier-seq. We have to keep track of whether
11325 or not the decl-specifier-seq declares a named class or
11326 enumeration type, since that is the only case in which the
11327 init-declarator-list is allowed to be empty.
11329 [dcl.dcl]
11331 In a simple-declaration, the optional init-declarator-list can be
11332 omitted only when declaring a class or enumeration, that is when
11333 the decl-specifier-seq contains either a class-specifier, an
11334 elaborated-type-specifier, or an enum-specifier. */
11336 CP_PARSER_FLAGS_OPTIONAL,
11339 /* We no longer need to defer access checks. */
11342 /* In a block scope, a valid declaration must always have a
11343 decl-specifier-seq. By not trying to parse declarators, we can
11344 resolve the declaration/expression ambiguity more quickly. */
11347 {
11350 }
11352 /* If the next two tokens are both identifiers, the code is
11353 erroneous. The usual cause of this situation is code like:
11355 T t;
11357 where "T" should name a type -- but does not. */
11360 {
11361 /* If parsing tentatively, we should commit; we really are
11362 looking at a declaration. */
11364 /* Give up. */
11366 }
11368 /* If we have seen at least one decl-specifier, and the next token
11369 is not a parenthesis, then we must be looking at a declaration.
11370 (After "int (" we might be looking at a functional cast.) */
11377 /* Keep going until we hit the `;' at the end of the simple
11378 declaration. */
11381 CPP_SEMICOLON))
11382 {
11385 tree decl;
11388 {
11389 /* If we are processing next declarator, coma is expected */
11395 }
11396 else
11399 /* Parse the init-declarator. */
11402 function_definition_allowed_p,
11404 declares_class_or_enum,
11406 maybe_range_for_decl);
11407 /* If an error occurred while parsing tentatively, exit quickly.
11408 (That usually happens when in the body of a function; each
11409 statement is treated as a declaration-statement until proven
11410 otherwise.) */
11413 /* Handle function definitions specially. */
11415 {
11416 /* If the next token is a `,', then we are probably
11417 processing something like:
11419 void f() {}, *p;
11421 which is erroneous. */
11423 {
11426 "mixing"
11428 }
11429 /* Otherwise, we're done with the list of declarators. */
11430 else
11431 {
11434 }
11435 }
11438 /* The next token should be either a `,' or a `;'. */
11440 /* If it's a `,', there are more declarators to come. */
11443 /* If it's a `;', we are done. */
11446 /* Anything else is an error. */
11447 else
11448 {
11449 /* If we have already issued an error message we don't need
11450 to issue another one. */
11454 /* Skip tokens until we reach the end of the statement. */
11456 /* If the next token is now a `;', consume it. */
11460 }
11461 /* After the first time around, a function-definition is not
11462 allowed -- even if it was OK at first. For example:
11464 int i, f() {}
11466 is not valid. */
11468 }
11470 /* Issue an error message if no declarators are present, and the
11471 decl-specifier-seq does not itself declare a class or
11472 enumeration: [dcl.dcl]/3. */
11474 {
11476 {
11480 /* Ensure an error is issued anyway when finish_decltype_type,
11481 called via cp_parser_decl_specifier_seq, returns a class or
11482 an enumeration (c++/51786). */
11485 }
11486 /* Perform any deferred access checks. */
11488 }
11490 /* Consume the `;'. */
11494 done:
11496 }
11498 /* Parse a decl-specifier-seq.
11500 decl-specifier-seq:
11501 decl-specifier-seq [opt] decl-specifier
11502 decl-specifier attribute-specifier-seq [opt] (C++11)
11504 decl-specifier:
11505 storage-class-specifier
11506 type-specifier
11507 function-specifier
11508 friend
11509 typedef
11511 GNU Extension:
11513 decl-specifier:
11514 attributes
11516 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11518 The parser flags FLAGS is used to control type-specifier parsing.
11520 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11521 flags:
11523 1: one of the decl-specifiers is an elaborated-type-specifier
11524 (i.e., a type declaration)
11525 2: one of the decl-specifiers is an enum-specifier or a
11526 class-specifier (i.e., a type definition)
11528 */
11530 static void
11532 cp_parser_flags flags,
11535 {
11539 cp_decl_spec ds;
11541 /* Clear DECL_SPECS. */
11544 /* Assume no class or enumeration type is declared. */
11547 /* Keep reading specifiers until there are no more to read. */
11549 {
11554 /* Peek at the next token. */
11557 /* Save the first token of the decl spec list for error
11558 reporting. */
11561 /* Handle attributes. */
11563 {
11564 /* Parse the attributes. */
11567 /* In a sequence of declaration specifiers, c++11 attributes
11568 appertain to the type that precede them. In that case
11569 [dcl.spec]/1 says:
11571 The attribute-specifier-seq affects the type only for
11572 the declaration it appears in, not other declarations
11573 involving the same type.
11575 But for now let's force the user to position the
11576 attribute either at the beginning of the declaration or
11577 after the declarator-id, which would clearly mean that it
11578 applies to the declarator. */
11580 {
11582 /* The c++11 attribute is at the beginning of the
11583 declaration. It appertains to the entity being
11585 else
11586 {
11588 {
11589 /* This is an attribute following a
11590 class-specifier. */
11595 }
11596 else
11597 {
11598 decl_specs->std_attributes
11600 attrs);
11603 }
11605 }
11606 }
11608 decl_specs->attributes
11610 attrs);
11614 }
11615 /* Assume we will find a decl-specifier keyword. */
11617 /* If the next token is an appropriate keyword, we can simply
11618 add it to the list. */
11620 {
11621 /* decl-specifier:
11622 friend
11623 constexpr */
11626 {
11629 }
11630 else
11631 {
11633 /* Consume the token. */
11635 }
11643 /* function-specifier:
11644 inline
11645 virtual
11646 explicit */
11653 /* decl-specifier:
11654 typedef */
11657 /* Consume the token. */
11659 /* A constructor declarator cannot appear in a typedef. */
11661 /* The "typedef" keyword can only occur in a declaration; we
11662 may as well commit at this point. */
11669 /* storage-class-specifier:
11670 auto
11671 register
11672 static
11673 extern
11674 mutable
11676 GNU Extension:
11677 thread */
11680 {
11681 /* Consume the token. */
11684 /* Complain about `auto' as a storage specifier, if
11685 we're complaining about C++0x compatibility. */
11689 /* Set the storage class anyway. */
11691 token);
11692 }
11693 else
11694 /* C++0x auto type-specifier. */
11702 /* Consume the token. */
11705 token);
11708 /* Consume the token. */
11714 /* We did not yet find a decl-specifier yet. */
11717 }
11727 /* Constructors are a special case. The `S' in `S()' is not a
11728 decl-specifier; it is the beginning of the declarator. */
11729 constructor_p
11730 = (!found_decl_spec
11731 && constructor_possible_p
11732 && (cp_parser_constructor_declarator_p
11735 /* If we don't have a DECL_SPEC yet, then we must be looking at
11736 a type-specifier. */
11738 {
11741 tree type_spec;
11743 type_spec
11745 decl_specs,
11751 /* If this type-specifier referenced a user-defined type
11752 (a typedef, class-name, etc.), then we can't allow any
11753 more such type-specifiers henceforth.
11755 [dcl.spec]
11757 The longest sequence of decl-specifiers that could
11758 possibly be a type name is taken as the
11759 decl-specifier-seq of a declaration. The sequence shall
11760 be self-consistent as described below.
11762 [dcl.type]
11764 As a general rule, at most one type-specifier is allowed
11765 in the complete decl-specifier-seq of a declaration. The
11766 only exceptions are the following:
11768 -- const or volatile can be combined with any other
11769 type-specifier.
11771 -- signed or unsigned can be combined with char, long,
11772 short, or int.
11774 -- ..
11776 Example:
11778 typedef char* Pc;
11779 void g (const int Pc);
11781 Here, Pc is *not* part of the decl-specifier seq; it's
11782 the declarator. Therefore, once we see a type-specifier
11783 (other than a cv-qualifier), we forbid any additional
11784 user-defined types. We *do* still allow things like `int
11785 int' to be considered a decl-specifier-seq, and issue the
11786 error message later. */
11789 /* A constructor declarator cannot follow a type-specifier. */
11791 {
11796 }
11797 }
11799 /* If we still do not have a DECL_SPEC, then there are no more
11800 decl-specifiers. */
11805 /* After we see one decl-specifier, further decl-specifiers are
11806 always optional. */
11808 }
11810 /* Don't allow a friend specifier with a class definition. */
11815 }
11817 /* Parse an (optional) storage-class-specifier.
11819 storage-class-specifier:
11820 auto
11821 register
11822 static
11823 extern
11824 mutable
11826 GNU Extension:
11828 storage-class-specifier:
11829 thread
11831 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11833 static tree
11835 {
11837 {
11841 /* Fall through for C++98. */
11848 /* Consume the token. */
11853 }
11854 }
11856 /* Parse an (optional) function-specifier.
11858 function-specifier:
11859 inline
11860 virtual
11861 explicit
11863 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11864 Updates DECL_SPECS, if it is non-NULL. */
11866 static tree
11869 {
11872 {
11878 /* 14.5.2.3 [temp.mem]
11880 A member function template shall not be virtual. */
11883 else
11893 }
11895 /* Consume the token. */
11897 }
11899 /* Parse a linkage-specification.
11901 linkage-specification:
11902 extern string-literal { declaration-seq [opt] }
11903 extern string-literal declaration */
11905 static void
11907 {
11908 tree linkage;
11910 /* Look for the `extern' keyword. */
11913 /* Look for the string-literal. */
11916 /* Transform the literal into an identifier. If the literal is a
11917 wide-character string, or contains embedded NULs, then we can't
11918 handle it as the user wants. */
11921 {
11923 /* Assume C++ linkage. */
11925 }
11926 else
11929 /* We're now using the new linkage. */
11932 /* If the next token is a `{', then we're using the first
11933 production. */
11935 {
11938 /* Consume the `{' token. */
11940 /* Parse the declarations. */
11942 /* Look for the closing `}'. */
11944 }
11945 /* Otherwise, there's just one declaration. */
11946 else
11947 {
11950 saved_in_unbraced_linkage_specification_p
11954 parser->in_unbraced_linkage_specification_p
11956 }
11958 /* We're done with the linkage-specification. */
11960 }
11962 /* Parse a static_assert-declaration.
11964 static_assert-declaration:
11965 static_assert ( constant-expression , string-literal ) ;
11967 If MEMBER_P, this static_assert is a class member. */
11969 static void
11971 {
11972 tree condition;
11973 tree message;
11975 location_t saved_loc;
11978 /* Peek at the `static_assert' token so we can keep track of exactly
11979 where the static assertion started. */
11983 /* Look for the `static_assert' keyword. */
11985 RT_STATIC_ASSERT))
11988 /* We know we are in a static assertion; commit to any tentative
11989 parse. */
11993 /* Parse the `(' starting the static assertion condition. */
11996 /* Parse the constant-expression. Allow a non-constant expression
11997 here in order to give better diagnostics in finish_static_assert. */
11998 condition =
12003 /* Parse the separating `,'. */
12006 /* Parse the string-literal message. */
12011 /* A `)' completes the static assertion. */
12018 /* A semicolon terminates the declaration. */
12021 /* Complete the static assertion, which may mean either processing
12022 the static assert now or saving it for template instantiation. */
12024 }
12026 /* Parse the expression in decltype ( expression ). */
12028 static tree
12031 {
12033 tree expr;
12035 /* First, try parsing an id-expression. */
12046 {
12049 cp_id_kind idk;
12053 /* Lookup the name we got back from the id-expression. */
12064 {
12065 /* Complete lookup of the id-expression. */
12066 expr = (finish_id_expression
12079 /* We found an id-expression, but it was something that we
12080 should not have found. This is an error, not something
12081 we can recover from, so note that we found an
12082 id-expression and we'll recover as gracefully as
12083 possible. */
12085 }
12090 /* We have an id-expression. */
12092 }
12095 {
12096 /* Abort the id-expression parse. */
12099 /* Parsing tentatively, again. */
12102 /* Parse a class member access. */
12110 /* We have an id-expression. */
12112 }
12115 /* We have parsed the complete id-expression or member access. */
12117 else
12118 {
12119 /* Abort our attempt to parse an id-expression or member access
12120 expression. */
12123 /* Parse a full expression. */
12126 }
12129 }
12131 /* Parse a `decltype' type. Returns the type.
12133 simple-type-specifier:
12134 decltype ( expression )
12135 C++14 proposal:
12136 decltype ( auto ) */
12138 static tree
12140 {
12141 tree expr;
12150 {
12151 /* Already parsed. */
12154 }
12156 /* Look for the `decltype' token. */
12160 /* Parse the opening `('. */
12164 /* decltype (auto) */
12167 {
12174 }
12176 /* Types cannot be defined in a `decltype' expression. Save away the
12177 old message. */
12180 /* And create the new one. */
12181 parser->type_definition_forbidden_message
12184 /* The restrictions on constant-expressions do not apply inside
12185 decltype expressions. */
12186 saved_integral_constant_expression_p
12188 saved_non_integral_constant_expression_p
12192 /* Within a parenthesized expression, a `>' token is always
12193 the greater-than operator. */
12194 saved_greater_than_is_operator_p
12198 /* Do not actually evaluate the expression. */
12201 /* Do not warn about problems with the expression. */
12206 /* Go back to evaluating expressions. */
12210 /* The `>' token might be the end of a template-id or
12211 template-parameter-list now. */
12212 parser->greater_than_is_operator_p
12215 /* Restore the old message and the integral constant expression
12216 flags. */
12218 parser->integral_constant_expression_p
12220 parser->non_integral_constant_expression_p
12223 /* Parse to the closing `)'. */
12225 {
12229 }
12232 tf_warning_or_error);
12234 rewrite:
12235 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12236 it again. */
12243 }
12245 /* Special member functions [gram.special] */
12247 /* Parse a conversion-function-id.
12249 conversion-function-id:
12250 operator conversion-type-id
12252 Returns an IDENTIFIER_NODE representing the operator. */
12254 static tree
12256 {
12257 tree type;
12258 tree saved_scope;
12259 tree saved_qualifying_scope;
12260 tree saved_object_scope;
12263 /* Look for the `operator' token. */
12266 /* When we parse the conversion-type-id, the current scope will be
12267 reset. However, we need that information in able to look up the
12268 conversion function later, so we save it here. */
12272 /* We must enter the scope of the class so that the names of
12273 entities declared within the class are available in the
12274 conversion-type-id. For example, consider:
12276 struct S {
12277 typedef int I;
12278 operator I();
12279 };
12281 S::operator I() { ... }
12283 In order to see that `I' is a type-name in the definition, we
12284 must be in the scope of `S'. */
12287 /* Parse the conversion-type-id. */
12289 /* Leave the scope of the class, if any. */
12292 /* Restore the saved scope. */
12296 /* If the TYPE is invalid, indicate failure. */
12300 }
12302 /* Parse a conversion-type-id:
12304 conversion-type-id:
12305 type-specifier-seq conversion-declarator [opt]
12307 Returns the TYPE specified. */
12309 static tree
12311 {
12312 tree attributes;
12313 cp_decl_specifier_seq type_specifiers;
12315 tree type_specified;
12318 /* Parse the attributes. */
12322 parser->type_definition_forbidden_message
12325 /* Parse the type-specifiers. */
12332 /* If that didn't work, stop. */
12335 /* Parse the conversion-declarator. */
12343 /* Don't give this error when parsing tentatively. This happens to
12344 work because we always parse this definitively once. */
12347 {
12349 {
12352 }
12356 }
12359 }
12361 /* Parse an (optional) conversion-declarator.
12363 conversion-declarator:
12364 ptr-operator conversion-declarator [opt]
12366 */
12370 {
12373 cp_cv_quals cv_quals;
12375 /* We don't know if there's a ptr-operator next, or not. */
12377 /* Try the ptr-operator. */
12380 /* If it worked, look for more conversion-declarators. */
12382 {
12385 /* Parse another optional declarator. */
12388 declarator = cp_parser_make_indirect_declarator
12392 }
12395 }
12397 /* Parse an (optional) ctor-initializer.
12399 ctor-initializer:
12400 : mem-initializer-list
12402 Returns TRUE iff the ctor-initializer was actually present. */
12404 static bool
12406 {
12407 /* If the next token is not a `:', then there is no
12408 ctor-initializer. */
12410 {
12411 /* Do default initialization of any bases and members. */
12416 }
12418 /* Consume the `:' token. */
12420 /* And the mem-initializer-list. */
12424 }
12426 /* Parse a mem-initializer-list.
12428 mem-initializer-list:
12429 mem-initializer ... [opt]
12430 mem-initializer ... [opt] , mem-initializer-list */
12432 static void
12434 {
12439 /* Let the semantic analysis code know that we are starting the
12440 mem-initializer-list. */
12445 /* Loop through the list. */
12447 {
12448 tree mem_initializer;
12451 /* Parse the mem-initializer. */
12453 /* If the next token is a `...', we're expanding member initializers. */
12455 {
12456 /* Consume the `...'. */
12459 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12460 can be expanded but members cannot. */
12463 {
12468 }
12470 /* Construct the pack expansion type. */
12473 }
12476 {
12480 }
12481 /* Look for a target constructor. */
12485 {
12488 {
12492 }
12494 }
12495 /* Add it to the list, unless it was erroneous. */
12497 {
12500 }
12501 /* If the next token is not a `,', we're done. */
12504 /* Consume the `,' token. */
12506 }
12508 /* Perform semantic analysis. */
12511 }
12513 /* Parse a mem-initializer.
12515 mem-initializer:
12516 mem-initializer-id ( expression-list [opt] )
12517 mem-initializer-id braced-init-list
12519 GNU extension:
12521 mem-initializer:
12522 ( expression-list [opt] )
12524 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12525 class) or FIELD_DECL (for a non-static data member) to initialize;
12526 the TREE_VALUE is the expression-list. An empty initialization
12527 list is represented by void_list_node. */
12529 static tree
12531 {
12532 tree mem_initializer_id;
12533 tree expression_list;
12534 tree member;
12537 /* Find out what is being initialized. */
12539 {
12543 }
12544 else
12545 {
12549 }
12555 {
12562 }
12563 else
12564 {
12574 }
12584 }
12586 /* Parse a mem-initializer-id.
12588 mem-initializer-id:
12589 :: [opt] nested-name-specifier [opt] class-name
12590 identifier
12592 Returns a TYPE indicating the class to be initializer for the first
12593 production. Returns an IDENTIFIER_NODE indicating the data member
12594 to be initialized for the second production. */
12596 static tree
12598 {
12602 tree id;
12606 /* `typename' is not allowed in this context ([temp.res]). */
12608 {
12610 "keyword %<typename%> not allowed in this context (a qualified "
12613 }
12614 /* Look for the optional `::' operator. */
12615 global_scope_p
12619 /* Look for the optional nested-name-specifier. The simplest way to
12620 implement:
12622 [temp.res]
12624 The keyword `typename' is not permitted in a base-specifier or
12625 mem-initializer; in these contexts a qualified name that
12626 depends on a template-parameter is implicitly assumed to be a
12627 type name.
12629 is to assume that we have seen the `typename' keyword at this
12630 point. */
12631 nested_name_specifier_p
12640 /* If there is a `::' operator or a nested-name-specifier, then we
12641 are definitely looking for a class-name. */
12646 typename_type,
12650 /* Otherwise, we could also be looking for an ordinary identifier. */
12652 /* Try a class-name. */
12656 none_type,
12660 /* If we found one, we're done. */
12663 /* Otherwise, look for an ordinary identifier. */
12665 }
12667 /* Overloading [gram.over] */
12669 /* Parse an operator-function-id.
12671 operator-function-id:
12672 operator operator
12674 Returns an IDENTIFIER_NODE for the operator which is a
12675 human-readable spelling of the identifier, e.g., `operator +'. */
12677 static tree
12679 {
12680 /* Look for the `operator' keyword. */
12683 /* And then the name of the operator itself. */
12685 }
12687 /* Return an identifier node for a user-defined literal operator.
12688 The suffix identifier is chained to the operator name identifier. */
12690 static tree
12692 {
12693 tree identifier;
12700 }
12702 /* Parse an operator.
12704 operator:
12705 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12706 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12707 || ++ -- , ->* -> () []
12709 GNU Extensions:
12711 operator:
12712 <? >? <?= >?=
12714 Returns an IDENTIFIER_NODE for the operator which is a
12715 human-readable spelling of the identifier, e.g., `operator +'. */
12717 static tree
12719 {
12724 /* Peek at the next token. */
12726 /* Figure out which operator we have. */
12728 {
12730 {
12733 /* The keyword should be either `new' or `delete'. */
12738 else
12741 /* Consume the `new' or `delete' token. */
12744 /* Peek at the next token. */
12746 /* If it's a `[' token then this is the array variant of the
12747 operator. */
12749 {
12750 /* Consume the `[' token. */
12752 /* Look for the `]' token. */
12756 }
12757 /* Otherwise, we have the non-array variant. */
12758 else
12762 }
12909 /* Consume the `('. */
12911 /* Look for the matching `)'. */
12916 /* Consume the `['. */
12918 /* Look for the matching `]'. */
12933 {
12940 /* Consume the string. */
12946 {
12949 }
12950 else
12951 {
12953 /* Look for the suffix identifier. */
12958 {
12962 }
12963 else
12964 {
12967 }
12968 }
12973 {
12976 }
12979 {
12982 }
12984 {
12987 }
12989 }
12992 /* Anything else is an error. */
12994 }
12996 /* If we have selected an identifier, we need to consume the
12997 operator token. */
13000 /* Otherwise, no valid operator name was present. */
13001 else
13002 {
13005 }
13008 }
13010 /* Parse a template-declaration.
13012 template-declaration:
13013 export [opt] template < template-parameter-list > declaration
13015 If MEMBER_P is TRUE, this template-declaration occurs within a
13016 class-specifier.
13018 The grammar rule given by the standard isn't correct. What
13019 is really meant is:
13021 template-declaration:
13022 export [opt] template-parameter-list-seq
13023 decl-specifier-seq [opt] init-declarator [opt] ;
13024 export [opt] template-parameter-list-seq
13025 function-definition
13027 template-parameter-list-seq:
13028 template-parameter-list-seq [opt]
13029 template < template-parameter-list > */
13031 static void
13033 {
13034 /* Check for `export'. */
13036 {
13037 /* Consume the `export' token. */
13039 /* Warn that we do not support `export'. */
13041 }
13044 }
13046 /* Parse a template-parameter-list.
13048 template-parameter-list:
13049 template-parameter
13050 template-parameter-list , template-parameter
13052 Returns a TREE_LIST. Each node represents a template parameter.
13053 The nodes are connected via their TREE_CHAINs. */
13055 static tree
13057 {
13062 /* The loop below parses the template parms. We first need to know
13063 the total number of template parms to be able to compute proper
13064 canonical types of each dependent type. So after the loop, when
13065 we know the total number of template parms,
13066 end_template_parm_list computes the proper canonical types and
13067 fixes up the dependent types accordingly. */
13069 {
13070 tree parameter;
13073 location_t parm_loc;
13075 /* Parse the template-parameter. */
13080 /* Add it to the list. */
13083 parm_loc,
13084 parameter,
13085 is_non_type,
13086 is_parameter_pack);
13087 else
13088 {
13091 }
13093 /* If the next token is not a `,', we're done. */
13096 /* Otherwise, consume the `,' token. */
13098 }
13101 }
13103 /* Parse a template-parameter.
13105 template-parameter:
13106 type-parameter
13107 parameter-declaration
13109 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13110 the parameter. The TREE_PURPOSE is the default value, if any.
13111 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13112 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13113 set to true iff this parameter is a parameter pack. */
13115 static tree
13118 {
13122 tree parm;
13124 /* Assume it is a type parameter or a template parameter. */
13126 /* Assume it not a parameter pack. */
13128 /* Peek at the next token. */
13130 /* If it is `class' or `template', we have a type-parameter. */
13133 /* If it is `class' or `typename' we do not know yet whether it is a
13134 type parameter or a non-type parameter. Consider:
13136 template <typename T, typename T::X X> ...
13138 or:
13140 template <class C, class D*> ...
13142 Here, the first parameter is a type parameter, and the second is
13143 a non-type parameter. We can tell by looking at the token after
13144 the identifier -- if it is a `,', `=', or `>' then we have a type
13145 parameter. */
13147 {
13148 /* Peek at the token after `class' or `typename'. */
13150 /* If it's an ellipsis, we have a template type parameter
13151 pack. */
13154 /* If it's an identifier, skip it. */
13157 /* Now, see if the token looks like the end of a template
13158 parameter. */
13163 }
13165 /* Otherwise, it is a non-type parameter.
13167 [temp.param]
13169 When parsing a default template-argument for a non-type
13170 template-parameter, the first non-nested `>' is taken as the end
13171 of the template parameter-list rather than a greater-than
13172 operator. */
13174 parameter_declarator
13181 /* If the parameter declaration is marked as a parameter pack, set
13182 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13183 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13184 grokdeclarator. */
13187 {
13190 }
13193 {
13194 /* Can happen in some cases of erroneous input (c++/34892). */
13196 /* Consume the `...' for better error recovery. */
13198 }
13199 /* If the next token is an ellipsis, and we don't already have it
13200 marked as a parameter pack, then we have a parameter pack (that
13201 has no declarator). */
13204 && (declarator_can_be_parameter_pack
13206 {
13207 /* Consume the `...'. */
13212 }
13213 /* We might end up with a pack expansion as the type of the non-type
13214 template parameter, in which case this is a non-type template
13215 parameter pack. */
13218 {
13222 }
13225 {
13226 /* Parameter packs cannot have default arguments. However, a
13227 user may try to do so, so we'll parse them and give an
13228 appropriate diagnostic here. */
13232 /* Find the name of the parameter pack. */
13241 else
13245 /* Parse the default argument, but throw away the result. */
13247 }
13257 }
13259 /* Parse a type-parameter.
13261 type-parameter:
13262 class identifier [opt]
13263 class identifier [opt] = type-id
13264 typename identifier [opt]
13265 typename identifier [opt] = type-id
13266 template < template-parameter-list > class identifier [opt]
13267 template < template-parameter-list > class identifier [opt]
13268 = id-expression
13270 GNU Extension (variadic templates):
13272 type-parameter:
13273 class ... identifier [opt]
13274 typename ... identifier [opt]
13276 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13277 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13278 the declaration of the parameter.
13280 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13282 static tree
13284 {
13286 tree parameter;
13288 /* Look for a keyword to tell us what kind of parameter this is. */
13294 {
13297 {
13298 tree identifier;
13299 tree default_argument;
13301 /* If the next token is an ellipsis, we have a template
13302 argument pack. */
13304 {
13305 /* Consume the `...' token. */
13310 }
13312 /* If the next token is an identifier, then it names the
13313 parameter. */
13316 else
13319 /* Create the parameter. */
13322 /* If the next token is an `=', we have a default argument. */
13324 {
13325 /* Consume the `=' token. */
13327 /* Parse the default-argument. */
13331 /* Template parameter packs cannot have default
13332 arguments. */
13334 {
13337 "template parameter pack %qD cannot have a "
13339 else
13341 "template parameter packs cannot have "
13344 }
13346 }
13347 else
13350 /* Create the combined representation of the parameter and the
13351 default argument. */
13353 }
13357 {
13358 tree identifier;
13359 tree default_argument;
13361 /* Look for the `<'. */
13363 /* Parse the template-parameter-list. */
13365 /* Look for the `>'. */
13367 /* Look for the `class' or 'typename' keywords. */
13369 /* If the next token is an ellipsis, we have a template
13370 argument pack. */
13372 {
13373 /* Consume the `...' token. */
13378 }
13379 /* If the next token is an `=', then there is a
13380 default-argument. If the next token is a `>', we are at
13381 the end of the parameter-list. If the next token is a `,',
13382 then we are at the end of this parameter. */
13386 {
13388 /* Treat invalid names as if the parameter were nameless. */
13391 }
13392 else
13395 /* Create the template parameter. */
13397 identifier);
13399 /* If the next token is an `=', then there is a
13400 default-argument. */
13402 {
13405 /* Consume the `='. */
13407 /* Parse the id-expression. */
13409 /* save token before parsing the id-expression, for error
13410 reporting */
13412 default_argument
13420 /* If the id-expression was a template-id that refers to
13421 a template-class, we already have the declaration here,
13422 so no further lookup is needed. */
13423 ;
13424 else
13425 /* Look up the name. */
13426 default_argument
13428 none_type,
13434 /* See if the default argument is valid. */
13435 default_argument
13438 /* Template parameter packs cannot have default
13439 arguments. */
13441 {
13444 "template parameter pack %qD cannot "
13446 identifier);
13447 else
13451 }
13453 }
13454 else
13457 /* Create the combined representation of the parameter and the
13458 default argument. */
13460 }
13466 }
13469 }
13471 /* Parse a template-id.
13473 template-id:
13474 template-name < template-argument-list [opt] >
13476 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13477 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13478 returned. Otherwise, if the template-name names a function, or set
13479 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13480 names a class, returns a TYPE_DECL for the specialization.
13482 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13483 uninstantiated templates. */
13485 static tree
13491 {
13493 tree templ;
13494 tree arguments;
13495 tree template_id;
13502 /* If the next token corresponds to a template-id, there is no need
13503 to reparse it. */
13506 {
13509 /* Get the stored value. */
13511 /* Perform any access checks that were deferred. */
13514 {
13519 tf_warning_or_error);
13520 }
13521 /* Return the stored value. */
13523 }
13525 /* Avoid performing name lookup if there is no possibility of
13526 finding a template-id. */
13529 && !cp_parser_nth_token_starts_template_argument_list_p
13531 {
13534 }
13536 /* Remember where the template-id starts. */
13542 /* Parse the template-name. */
13545 check_dependency_p,
13546 is_declaration,
13547 tag_type,
13550 {
13553 }
13555 /* If we find the sequence `[:' after a template-name, it's probably
13556 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13557 parse correctly the argument list. */
13564 {
13566 /* Change `:' into `::'. */
13568 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13569 CPP_LESS. */
13572 /* Parse the arguments. */
13575 {
13576 /* If we couldn't parse an argument list, then we revert our changes
13577 and return simply an error. Maybe this is not a template-id
13578 after all. */
13583 }
13584 /* Otherwise, emit an error about the invalid digraph, but continue
13585 parsing because we got our argument list. */
13588 {
13591 "%<<:%> is an alternate spelling for %<[%>."
13594 {
13596 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13599 }
13600 }
13601 }
13602 else
13603 {
13604 /* Look for the `<' that starts the template-argument-list. */
13606 {
13609 }
13610 /* Parse the arguments. */
13612 }
13614 /* Build a representation of the specialization. */
13617 TEMPLATE_ID_EXPR,
13621 {
13623 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13624 template (rather than some instantiation thereof) only if
13625 is not nested within some other construct. For example, in
13626 "template <typename T> void f(T) { A<T>::", A<T> is just an
13627 instantiation of A. */
13630 CPP_SCOPE));
13631 template_id
13633 }
13635 {
13637 }
13638 else
13639 {
13640 /* If it's not a class-template or a template-template, it should be
13641 a function-template. */
13647 }
13649 /* If parsing tentatively, replace the sequence of tokens that makes
13650 up the template-id with a CPP_TEMPLATE_ID token. That way,
13651 should we re-parse the token stream, we will not have to repeat
13652 the effort required to do the parse, nor will we issue duplicate
13653 error messages about problems during instantiation of the
13654 template. */
13656 /* Don't do this if we had a parse error in a declarator; re-parsing
13657 might succeed if a name changes meaning (60361). */
13661 {
13664 /* Reset the contents of the START_OF_ID token. */
13666 /* Retrieve any deferred checks. Do not pop this access checks yet
13667 so the memory will not be reclaimed during token replacing below. */
13673 /* Purge all subsequent tokens. */
13676 /* ??? Can we actually assume that, if template_id ==
13677 error_mark_node, we will have issued a diagnostic to the
13678 user, as opposed to simply marking the tentative parse as
13679 failed? */
13682 }
13686 }
13688 /* Parse a template-name.
13690 template-name:
13691 identifier
13693 The standard should actually say:
13695 template-name:
13696 identifier
13697 operator-function-id
13699 A defect report has been filed about this issue.
13701 A conversion-function-id cannot be a template name because they cannot
13702 be part of a template-id. In fact, looking at this code:
13704 a.operator K<int>()
13706 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13707 It is impossible to call a templated conversion-function-id with an
13708 explicit argument list, since the only allowed template parameter is
13709 the type to which it is converting.
13711 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13712 `template' keyword, in a construction like:
13714 T::template f<3>()
13716 In that case `f' is taken to be a template-name, even though there
13717 is no way of knowing for sure.
13719 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13720 name refers to a set of overloaded functions, at least one of which
13721 is a template, or an IDENTIFIER_NODE with the name of the template,
13722 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13723 names are looked up inside uninstantiated templates. */
13725 static tree
13732 {
13733 tree identifier;
13734 tree decl;
13735 tree fns;
13738 /* If the next token is `operator', then we have either an
13739 operator-function-id or a conversion-function-id. */
13741 {
13742 /* We don't know whether we're looking at an
13743 operator-function-id or a conversion-function-id. */
13745 /* Try an operator-function-id. */
13747 /* If that didn't work, try a conversion-function-id. */
13749 {
13752 }
13753 }
13754 /* Look for the identifier. */
13755 else
13758 /* If we didn't find an identifier, we don't have a template-id. */
13762 /* If the name immediately followed the `template' keyword, then it
13763 is a template-name. However, if the next token is not `<', then
13764 we do not treat it as a template-name, since it is not being used
13765 as part of a template-id. This enables us to handle constructs
13766 like:
13768 template <typename T> struct S { S(); };
13769 template <typename T> S<T>::S();
13771 correctly. We would treat `S' as a template -- if it were `S<T>'
13772 -- but we do not if there is no `<'. */
13776 {
13777 /* In a declaration, in a dependent context, we pretend that the
13778 "template" keyword was present in order to improve error
13779 recovery. For example, given:
13781 template <typename T> void f(T::X<int>);
13783 we want to treat "X<int>" as a template-id. */
13785 && !template_keyword_p
13787 && check_dependency_p
13789 /* Do not do this for dtors (or ctors), since they never
13790 need the template keyword before their name. */
13792 {
13795 /* Explain what went wrong. */
13797 identifier);
13800 /* If parsing tentatively, find the location of the "<" token. */
13803 /* Parse the template arguments so that we can issue error
13804 messages about them. */
13807 /* Skip tokens until we find a good place from which to
13808 continue parsing. */
13813 /* If parsing tentatively, permanently remove the
13814 template argument list. That will prevent duplicate
13815 error messages from being issued about the missing
13816 "template" keyword. */
13822 }
13824 /* If the "template" keyword is present, then there is generally
13825 no point in doing name-lookup, so we just return IDENTIFIER.
13826 But, if the qualifying scope is non-dependent then we can
13827 (and must) do name-lookup normally. */
13833 }
13835 /* Look up the name. */
13837 tag_type,
13840 check_dependency_p,
13844 /* If DECL is a template, then the name was a template-name. */
13846 ;
13847 else
13848 {
13851 /* The standard does not explicitly indicate whether a name that
13852 names a set of overloaded declarations, some of which are
13853 templates, is a template-name. However, such a name should
13854 be a template-name; otherwise, there is no way to form a
13855 template-id for the overloaded templates. */
13863 {
13864 /* The name does not name a template. */
13867 }
13868 }
13870 /* If DECL is dependent, and refers to a function, then just return
13871 its name; we will look it up again during template instantiation. */
13873 {
13877 }
13880 }
13882 /* Parse a template-argument-list.
13884 template-argument-list:
13885 template-argument ... [opt]
13886 template-argument-list , template-argument ... [opt]
13888 Returns a TREE_VEC containing the arguments. */
13890 static tree
13892 {
13897 tree vec;
13904 /* Even if the template-id appears in an integral
13905 constant-expression, the contents of the argument list do
13906 not. */
13912 /* Parse the arguments. */
13913 do
13914 {
13915 tree argument;
13918 /* Consume the comma. */
13921 /* Parse the template-argument. */
13924 /* If the next token is an ellipsis, we're expanding a template
13925 argument pack. */
13927 {
13929 {
13933 }
13934 /* Consume the `...' token. */
13937 /* Make the argument into a TYPE_PACK_EXPANSION or
13938 EXPR_PACK_EXPANSION. */
13940 }
13943 {
13947 {
13950 }
13951 else
13953 }
13955 }
13968 #ifdef ENABLE_CHECKING
13970 #endif
13972 }
13974 /* Parse a template-argument.
13976 template-argument:
13977 assignment-expression
13978 type-id
13979 id-expression
13981 The representation is that of an assignment-expression, type-id, or
13982 id-expression -- except that the qualified id-expression is
13983 evaluated, so that the value returned is either a DECL or an
13984 OVERLOAD.
13986 Although the standard says "assignment-expression", it forbids
13987 throw-expressions or assignments in the template argument.
13988 Therefore, we use "conditional-expression" instead. */
13990 static tree
13992 {
13993 tree argument;
13999 cp_id_kind idk;
14001 /* There's really no way to know what we're looking at, so we just
14002 try each alternative in order.
14004 [temp.arg]
14006 In a template-argument, an ambiguity between a type-id and an
14007 expression is resolved to a type-id, regardless of the form of
14008 the corresponding template-parameter.
14010 Therefore, we try a type-id first. */
14013 /* If there was no error parsing the type-id but the next token is a
14014 '>>', our behavior depends on which dialect of C++ we're
14015 parsing. In C++98, we probably found a typo for '> >'. But there
14016 are type-id which are also valid expressions. For instance:
14018 struct X { int operator >> (int); };
14019 template <int V> struct Foo {};
14020 Foo<X () >> 5> r;
14022 Here 'X()' is a valid type-id of a function type, but the user just
14023 wanted to write the expression "X() >> 5". Thus, we remember that we
14024 found a valid type-id, but we still try to parse the argument as an
14025 expression to see what happens.
14027 In C++0x, the '>>' will be considered two separate '>'
14028 tokens. */
14032 {
14035 }
14036 else
14037 {
14038 /* If the next token isn't a `,' or a `>', then this argument wasn't
14039 really finished. This means that the argument is not a valid
14040 type-id. */
14043 /* If that worked, we're done. */
14046 }
14047 /* We're still not sure what the argument will be. */
14049 /* Try a template. */
14057 /* If the next token isn't a `,' or a `>', then this argument wasn't
14058 really finished. */
14062 {
14063 /* Figure out what is being referred to. If the id-expression
14064 was for a class template specialization, then we will have a
14065 TYPE_DECL at this point. There is no need to do name lookup
14066 at this point in that case. */
14069 none_type,
14078 }
14081 /* It must be a non-type argument. There permitted cases are given
14082 in [temp.arg.nontype]:
14084 -- an integral constant-expression of integral or enumeration
14085 type; or
14087 -- the name of a non-type template-parameter; or
14089 -- the name of an object or function with external linkage...
14091 -- the address of an object or function with external linkage...
14093 -- a pointer to member... */
14094 /* Look for a non-type template parameter. */
14096 {
14108 }
14110 /* If the next token is "&", the argument must be the address of an
14111 object or function with external linkage. */
14114 {
14117 }
14118 /* See if we might have an id-expression. */
14125 {
14128 address_p,
14135 else
14136 {
14137 tree probe;
14140 {
14141 /* Strip the dereference temporarily. */
14144 }
14146 /* If we're in a template, we represent a qualified-id referring
14147 to a static data member as a SCOPE_REF even if the scope isn't
14148 dependent so that we can check access control later. */
14153 {
14154 /* A variable without external linkage might still be a
14155 valid constant-expression, so no error is issued here
14156 if the external-linkage check fails. */
14159 }
14161 /* All overloaded functions are allowed; if the external
14162 linkage test does not pass, an error will be issued
14163 later. */
14164 ;
14168 /* A pointer-to-member. */
14169 ;
14171 ;
14172 else
14176 {
14179 tf_warning_or_error);
14180 else
14183 }
14184 }
14185 }
14186 /* If the argument started with "&", there are no other valid
14187 alternatives at this point. */
14189 {
14192 }
14194 /* If the argument wasn't successfully parsed as a type-id followed
14195 by '>>', the argument can only be a constant expression now.
14196 Otherwise, we try parsing the constant-expression tentatively,
14197 because the argument could really be a type-id. */
14209 /* We did our best to parse the argument as a non type-id, but that
14210 was the only alternative that matched (albeit with a '>' after
14211 it). We can assume it's just a typo from the user, and a
14212 diagnostic will then be issued. */
14214 }
14216 /* Parse an explicit-instantiation.
14218 explicit-instantiation:
14219 template declaration
14221 Although the standard says `declaration', what it really means is:
14223 explicit-instantiation:
14224 template decl-specifier-seq [opt] declarator [opt] ;
14226 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14227 supposed to be allowed. A defect report has been filed about this
14228 issue.
14230 GNU Extension:
14232 explicit-instantiation:
14233 storage-class-specifier template
14234 decl-specifier-seq [opt] declarator [opt] ;
14235 function-specifier template
14236 decl-specifier-seq [opt] declarator [opt] ; */
14238 static void
14240 {
14242 cp_decl_specifier_seq decl_specifiers;
14247 /* Look for an (optional) storage-class-specifier or
14248 function-specifier. */
14250 {
14251 extension_specifier
14254 extension_specifier
14257 }
14259 /* Look for the `template' keyword. */
14261 /* Let the front end know that we are processing an explicit
14262 instantiation. */
14264 /* [temp.explicit] says that we are supposed to ignore access
14265 control while processing explicit instantiation directives. */
14267 /* Parse a decl-specifier-seq. */
14269 CP_PARSER_FLAGS_OPTIONAL,
14272 /* If there was exactly one decl-specifier, and it declared a class,
14273 and there's no declarator, then we have an explicit type
14274 instantiation. */
14276 {
14277 tree type;
14281 /* Turn access control back on for names used during
14282 template instantiation. */
14287 }
14288 else
14289 {
14291 tree decl;
14293 /* Parse the declarator. */
14294 declarator
14305 {
14308 "explicit instantiation shall not use"
14312 "explicit instantiation shall not use"
14317 /* Turn access control back on for names used during
14318 template instantiation. */
14320 /* Do the explicit instantiation. */
14322 }
14323 else
14324 {
14326 /* Skip the body of the explicit instantiation. */
14328 }
14329 }
14330 /* We're done with the instantiation. */
14336 }
14338 /* Parse an explicit-specialization.
14340 explicit-specialization:
14341 template < > declaration
14343 Although the standard says `declaration', what it really means is:
14345 explicit-specialization:
14346 template <> decl-specifier [opt] init-declarator [opt] ;
14347 template <> function-definition
14348 template <> explicit-specialization
14349 template <> template-declaration */
14351 static void
14353 {
14357 /* Look for the `template' keyword. */
14359 /* Look for the `<'. */
14361 /* Look for the `>'. */
14363 /* We have processed another parameter list. */
14365 /* [temp]
14367 A template ... explicit specialization ... shall not have C
14368 linkage. */
14370 {
14372 /* Give it C++ linkage to avoid confusing other parts of the
14373 front end. */
14376 }
14377 else
14379 /* Let the front end know that we are beginning a specialization. */
14381 {
14384 }
14386 /* If the next keyword is `template', we need to figure out whether
14387 or not we're looking a template-declaration. */
14389 {
14394 else
14396 }
14397 else
14398 /* Parse the dependent declaration. */
14404 /* We're done with the specialization. */
14406 /* For the erroneous case of a template with C linkage, we pushed an
14407 implicit C++ linkage scope; exit that scope now. */
14410 /* We're done with this parameter list. */
14412 }
14414 /* Parse a type-specifier.
14416 type-specifier:
14417 simple-type-specifier
14418 class-specifier
14419 enum-specifier
14420 elaborated-type-specifier
14421 cv-qualifier
14423 GNU Extension:
14425 type-specifier:
14426 __complex__
14428 Returns a representation of the type-specifier. For a
14429 class-specifier, enum-specifier, or elaborated-type-specifier, a
14430 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14432 The parser flags FLAGS is used to control type-specifier parsing.
14434 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14435 in a decl-specifier-seq.
14437 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14438 class-specifier, enum-specifier, or elaborated-type-specifier, then
14439 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14440 if a type is declared; 2 if it is defined. Otherwise, it is set to
14441 zero.
14443 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14444 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14445 is set to FALSE. */
14447 static tree
14449 cp_parser_flags flags,
14454 {
14460 /* Assume this type-specifier does not declare a new type. */
14463 /* And that it does not specify a cv-qualifier. */
14466 /* Peek at the next token. */
14469 /* If we're looking at a keyword, we can use that to guide the
14470 production we choose. */
14473 {
14478 /* Look for the enum-specifier. */
14480 /* If that worked, we're done. */
14482 {
14487 type_spec,
14488 token,
14491 }
14492 else
14495 /* Any of these indicate either a class-specifier, or an
14496 elaborated-type-specifier. */
14503 /* Parse tentatively so that we can back up if we don't find a
14504 class-specifier. */
14506 /* Look for the class-specifier. */
14509 /* If that worked, we're done. */
14511 {
14516 type_spec,
14517 token,
14520 }
14522 /* Fall through. */
14523 elaborated_type_specifier:
14524 /* We're declaring (not defining) a class or enum. */
14528 /* Fall through. */
14530 /* Look for an elaborated-type-specifier. */
14531 type_spec
14532 = (cp_parser_elaborated_type_specifier
14535 is_declaration));
14538 type_spec,
14539 token,
14562 /* The `__complex__' keyword is a GNU extension. */
14568 }
14570 /* Handle simple keywords. */
14572 {
14574 {
14577 }
14579 }
14581 /* If we do not already have a type-specifier, assume we are looking
14582 at a simple-type-specifier. */
14584 decl_specs,
14585 flags);
14587 /* If we didn't find a type-specifier, and a type-specifier was not
14588 optional in this context, issue an error message. */
14590 {
14593 }
14596 }
14598 /* Parse a simple-type-specifier.
14600 simple-type-specifier:
14601 :: [opt] nested-name-specifier [opt] type-name
14602 :: [opt] nested-name-specifier template template-id
14603 char
14604 wchar_t
14605 bool
14606 short
14607 int
14608 long
14609 signed
14610 unsigned
14611 float
14612 double
14613 void
14615 C++0x Extension:
14617 simple-type-specifier:
14618 auto
14619 decltype ( expression )
14620 char16_t
14621 char32_t
14622 __underlying_type ( type-id )
14624 GNU Extension:
14626 simple-type-specifier:
14627 __int128
14628 __typeof__ unary-expression
14629 __typeof__ ( type-id )
14630 __typeof__ ( type-id ) { initializer-list , [opt] }
14632 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14633 appropriately updated. */
14635 static tree
14638 cp_parser_flags flags)
14639 {
14643 /* Peek at the next token. */
14646 /* If we're looking at a keyword, things are easy. */
14648 {
14708 {
14712 {
14715 "use of %<auto%> in lambda parameter declaration "
14716 "only available with "
14718 }
14721 "use of %<auto%> in parameter declaration "
14722 "only available with "
14724 else
14726 "ISO C++ forbids use of %<auto%> in parameter "
14728 }
14729 else
14734 /* Since DR 743, decltype can either be a simple-type-specifier by
14735 itself or begin a nested-name-specifier. Parsing it will replace
14736 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14737 handling below decide what to do. */
14743 /* Consume the `typeof' token. */
14745 /* Parse the operand to `typeof'. */
14747 /* If it is not already a TYPE, take its type. */
14753 token,
14762 token,
14772 token,
14777 }
14779 /* If token is an already-parsed decltype not followed by ::,
14780 it's a simple-type-specifier. */
14783 {
14787 token,
14791 }
14793 /* If the type-specifier was for a built-in type, we're done. */
14795 {
14796 /* Record the type. */
14803 type,
14804 token,
14809 /* Consume the token. */
14812 /* There is no valid C++ program where a non-template type is
14813 followed by a "<". That usually indicates that the user thought
14814 that the type was a template. */
14819 }
14821 /* The type-specifier must be a user-defined type. */
14823 {
14827 /* Don't gobble tokens or issue error messages if this is an
14828 optional type-specifier. */
14832 /* Look for the optional `::' operator. */
14833 global_p
14837 /* Look for the nested-name specifier. */
14838 qualified_p
14846 /* If we have seen a nested-name-specifier, and the next token
14847 is `template', then we are using the template-id production. */
14850 {
14851 /* Look for the template-id. */
14855 none_type,
14857 /* If the template-id did not name a type, we are out of
14858 luck. */
14860 {
14863 }
14864 }
14865 /* Otherwise, look for a type-name. */
14866 else
14868 /* Keep track of all name-lookups performed in class scopes. */
14870 && !global_p
14871 && !qualified_p
14875 /* If it didn't work out, we don't have a TYPE. */
14881 token,
14883 }
14885 /* If we didn't get a type-name, issue an error message. */
14887 {
14890 }
14893 {
14894 /* See if TYPE is an Objective-C type, and if so, parse and
14895 accept any protocol references following it. Do this before
14896 the cp_parser_check_for_invalid_template_id() call, because
14897 Objective-C types can be followed by '<...>' which would
14898 enclose protocol names rather than template arguments, and so
14899 everything is fine. */
14902 {
14906 /* Clobber the "unqualified" type previously entered into
14907 DECL_SPECS with the new, improved protocol-qualified version. */
14912 }
14914 /* There is no valid C++ program where a non-template type is
14915 followed by a "<". That usually indicates that the user
14916 thought that the type was a template. */
14918 none_type,
14920 }
14923 }
14925 /* Parse a type-name.
14927 type-name:
14928 class-name
14929 enum-name
14930 typedef-name
14931 simple-template-id [in c++0x]
14933 enum-name:
14934 identifier
14936 typedef-name:
14937 identifier
14939 Returns a TYPE_DECL for the type. */
14941 static tree
14943 {
14944 tree type_decl;
14946 /* We can't know yet whether it is a class-name or not. */
14948 /* Try a class-name. */
14952 none_type,
14956 /* If it's not a class-name, keep looking. */
14958 {
14960 /* It must be a typedef-name or an enum-name. */
14964 /* It is either a simple-template-id representing an
14965 instantiation of an alias template... */
14969 none_type,
14971 /* Note that this must be an instantiation of an alias template
14972 because [temp.names]/6 says:
14974 A template-id that names an alias template specialization
14975 is a type-name.
14977 Whereas [temp.names]/7 says:
14979 A simple-template-id that names a class template
14980 specialization is a class-name. */
14985 else
14989 /* ... Or a typedef-name or an enum-name. */
14991 }
14994 }
14996 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14998 enum-name:
14999 identifier
15001 typedef-name:
15002 identifier
15004 Returns a TYPE_DECL for the type. */
15006 static tree
15008 {
15009 tree type_decl;
15010 tree identifier;
15017 /* Look up the type-name. */
15024 {
15025 /* See if this is an Objective-C type. */
15030 }
15032 /* Issue an error if we did not find a type-name. */
15034 /* In Objective-C, we have the complication that class names are
15035 normally type names and start declarations (eg, the
15036 "NSObject" in "NSObject *object;"), but can be used in an
15037 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15038 is an expression. So, a classname followed by a dot is not a
15039 valid type-name. */
15042 {
15047 }
15048 /* Remember that the name was used in the definition of the
15049 current class so that we can check later to see if the
15050 meaning would have been different after the class was
15051 entirely defined. */
15057 }
15059 /* Parse an elaborated-type-specifier. Note that the grammar given
15060 here incorporates the resolution to DR68.
15062 elaborated-type-specifier:
15063 class-key :: [opt] nested-name-specifier [opt] identifier
15064 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15065 enum-key :: [opt] nested-name-specifier [opt] identifier
15066 typename :: [opt] nested-name-specifier identifier
15067 typename :: [opt] nested-name-specifier template [opt]
15068 template-id
15070 GNU extension:
15072 elaborated-type-specifier:
15073 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15074 class-key attributes :: [opt] nested-name-specifier [opt]
15075 template [opt] template-id
15076 enum attributes :: [opt] nested-name-specifier [opt] identifier
15078 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15079 declared `friend'. If IS_DECLARATION is TRUE, then this
15080 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15081 something is being declared.
15083 Returns the TYPE specified. */
15085 static tree
15089 {
15091 tree identifier;
15094 tree globalscope;
15097 /* See if we're looking at the `enum' keyword. */
15099 {
15100 /* Consume the `enum' token. */
15102 /* Remember that it's an enumeration type. */
15104 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15105 enums) is used here. */
15108 {
15112 /* Consume the `struct' or `class' and parse it anyway. */
15114 }
15115 /* Parse the attributes. */
15117 }
15118 /* Or, it might be `typename'. */
15120 RID_TYPENAME))
15121 {
15122 /* Consume the `typename' token. */
15124 /* Remember that it's a `typename' type. */
15126 }
15127 /* Otherwise it must be a class-key. */
15128 else
15129 {
15133 /* Parse the attributes. */
15135 }
15137 /* Look for the `::' operator. */
15140 /* Look for the nested-name-specifier. */
15142 {
15147 is_declaration))
15149 }
15150 else
15151 /* Even though `typename' is not present, the proposed resolution
15152 to Core Issue 180 says that in `class A<T>::B', `B' should be
15153 considered a type-name, even if `A<T>' is dependent. */
15158 is_declaration);
15159 /* For everything but enumeration types, consider a template-id.
15160 For an enumeration type, consider only a plain identifier. */
15162 {
15164 tree decl;
15166 /* Allow the `template' keyword. */
15168 /* If we didn't see `template', we don't know if there's a
15169 template-id or not. */
15172 /* Parse the template-id. */
15176 tag_type,
15177 is_declaration);
15178 /* If we didn't find a template-id, look for an ordinary
15179 identifier. */
15181 ;
15182 /* We can get here when cp_parser_template_id, called by
15183 cp_parser_class_name with tag_type == none_type, succeeds
15184 and caches a BASELINK. Then, when called again here,
15185 instead of failing and returning an error_mark_node
15186 returns it (see template/typename17.C in C++11).
15187 ??? Could we diagnose this earlier? */
15189 {
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. */
15229 /* Template parameter lists apply only if we are not within a
15230 function parameter list. */
15231 bool template_parm_lists_apply
15240 /* Look up a qualified name in the usual way. */
15242 {
15243 tree decl;
15244 tree ambiguous_decls;
15247 tag_type,
15254 /* If the lookup was ambiguous, an error will already have been
15255 issued. */
15259 /* If we are parsing friend declaration, DECL may be a
15260 TEMPLATE_DECL tree node here. However, we need to check
15261 whether this TEMPLATE_DECL results in valid code. Consider
15262 the following example:
15264 namespace N {
15265 template <class T> class C {};
15266 }
15267 class X {
15268 template <class T> friend class N::C; // #1, valid code
15269 };
15270 template <class T> class Y {
15271 friend class N::C; // #2, invalid code
15272 };
15274 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15275 name lookup of `N::C'. We see that friend declaration must
15276 be template for the code to be valid. Note that
15277 processing_template_decl does not work here since it is
15278 always 1 for the above two cases. */
15280 decl = (cp_parser_maybe_treat_template_as_class
15285 {
15287 identifier,
15290 }
15293 {
15297 allow_template);
15301 }
15303 /* Forward declarations of nested types, such as
15305 class C1::C2;
15306 class C1::C2::C3;
15308 are invalid unless all components preceding the final '::'
15309 are complete. If all enclosing types are complete, these
15310 declarations become merely pointless.
15312 Invalid forward declarations of nested types are errors
15313 caught elsewhere in parsing. Those that are pointless arrive
15314 here. */
15321 }
15322 else
15323 {
15324 /* An elaborated-type-specifier sometimes introduces a new type and
15325 sometimes names an existing type. Normally, the rule is that it
15326 introduces a new type only if there is not an existing type of
15327 the same name already in scope. For example, given:
15329 struct S {};
15330 void f() { struct S s; }
15332 the `struct S' in the body of `f' is the same `struct S' as in
15333 the global scope; the existing definition is used. However, if
15334 there were no global declaration, this would introduce a new
15335 local class named `S'.
15337 An exception to this rule applies to the following code:
15339 namespace N { struct S; }
15341 Here, the elaborated-type-specifier names a new type
15342 unconditionally; even if there is already an `S' in the
15343 containing scope this declaration names a new type.
15344 This exception only applies if the elaborated-type-specifier
15345 forms the complete declaration:
15347 [class.name]
15349 A declaration consisting solely of `class-key identifier ;' is
15350 either a redeclaration of the name in the current scope or a
15351 forward declaration of the identifier as a class name. It
15352 introduces the name into the current scope.
15354 We are in this situation precisely when the next token is a `;'.
15356 An exception to the exception is that a `friend' declaration does
15357 *not* name a new type; i.e., given:
15359 struct S { friend struct T; };
15361 `T' is not a new type in the scope of `S'.
15363 Also, `new struct S' or `sizeof (struct S)' never results in the
15364 definition of a new type; a new type can only be declared in a
15365 declaration context. */
15367 tag_scope ts;
15371 /* Friends have special name lookup rules. */
15375 CPP_SEMICOLON))
15376 /* This is a `class-key identifier ;' */
15378 else
15381 template_p =
15382 (template_parm_lists_apply
15385 /* An unqualified name was used to reference this type, so
15386 there were no qualifying templates. */
15394 }
15395 }
15400 /* Allow attributes on forward declarations of classes. */
15402 {
15412 else
15415 }
15418 {
15419 /* Indicate whether this class was declared as a `class' or as a
15420 `struct'. */
15424 }
15426 /* A "<" cannot follow an elaborated type specifier. If that
15427 happens, the user was probably trying to form a template-id. */
15432 }
15434 /* Parse an enum-specifier.
15436 enum-specifier:
15437 enum-head { enumerator-list [opt] }
15438 enum-head { enumerator-list , } [C++0x]
15440 enum-head:
15441 enum-key identifier [opt] enum-base [opt]
15442 enum-key nested-name-specifier identifier enum-base [opt]
15444 enum-key:
15445 enum
15446 enum class [C++0x]
15447 enum struct [C++0x]
15449 enum-base: [C++0x]
15450 : type-specifier-seq
15452 opaque-enum-specifier:
15453 enum-key identifier enum-base [opt] ;
15455 GNU Extensions:
15456 enum-key attributes[opt] identifier [opt] enum-base [opt]
15457 { enumerator-list [opt] }attributes[opt]
15458 enum-key attributes[opt] identifier [opt] enum-base [opt]
15459 { enumerator-list, }attributes[opt] [C++0x]
15461 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15462 if the token stream isn't an enum-specifier after all. */
15464 static tree
15466 {
15467 tree identifier;
15469 tree prev_scope;
15471 tree attributes;
15484 /* Parse tentatively so that we can back up if we don't find a
15485 enum-specifier. */
15488 /* Caller guarantees that the current token is 'enum', an identifier
15489 possibly follows, and the token after that is an opening brace.
15490 If we don't have an identifier, fabricate an anonymous name for
15491 the enumeration being defined. */
15494 /* Parse the "class" or "struct", which indicates a scoped
15495 enumeration type in C++0x. */
15498 {
15502 /* Consume the `struct' or `class' token. */
15506 }
15510 /* Clear the qualification. */
15515 /* Figure out in what scope the declaration is being placed. */
15521 nested_name_specifier
15529 {
15530 tree name;
15534 enum_type,
15539 input_location);
15541 {
15544 {
15545 /* Are template enums allowed in ISO? */
15549 /* ignore a typename reference, for it will be solved by name
15550 in start_enum. */
15552 }
15553 }
15556 else
15559 }
15560 else
15561 {
15564 else
15565 {
15571 }
15572 }
15575 /* Check for the `:' that denotes a specified underlying type in C++0x.
15576 Note that a ':' could also indicate a bitfield width, however. */
15578 {
15579 cp_decl_specifier_seq type_specifiers;
15581 /* Consume the `:'. */
15584 /* Parse the type-specifier-seq. */
15589 /* At this point this is surely not elaborated type specifier. */
15598 /* If that didn't work, stop. */
15600 {
15606 }
15607 }
15609 /* Look for the `{' but don't consume it yet. */
15611 {
15613 {
15616 {
15619 }
15620 }
15621 /* An opaque-enum-specifier must have a ';' here. */
15624 {
15627 {
15630 }
15631 }
15632 }
15638 {
15640 {
15644 }
15646 {
15648 }
15649 }
15651 /* Issue an error message if type-definitions are forbidden here. */
15654 else
15655 /* Create the new type. We do this before consuming the opening
15656 brace so the enum will be recorded as being on the line of its
15657 tag (or the 'enum' keyword, if there is no tag). */
15661 /* If the next token is not '{' it is an opaque-enum-specifier or an
15662 elaborated-type-specifier. */
15664 {
15668 {
15669 /* The following catches invalid code such as:
15670 enum class S<int>::E { A, B, C }; */
15678 {
15682 nested_name_specifier);
15684 }
15685 /* If that scope does not contain the scope in which the
15686 class was originally declared, the program is invalid. */
15688 nested_name_specifier))
15689 {
15692 "declaration of %qD in namespace %qD which does not "
15695 else
15697 "declaration of %qD in %qD which does not "
15701 }
15702 }
15707 /* Consume the opening brace. */
15714 {
15718 }
15719 else
15720 {
15726 }
15730 /* If the next token is not '}', then there are some enumerators. */
15732 {
15736 }
15737 else
15740 /* Consume the final '}'. */
15746 }
15747 else
15748 {
15749 /* If a ';' follows, then it is an opaque-enum-specifier
15750 and additional restrictions apply. */
15752 {
15759 }
15760 }
15762 /* Look for trailing attributes to apply to this enumeration, and
15763 apply them if appropriate. */
15765 {
15769 trailing_attr,
15771 }
15773 /* Finish up the enumeration. */
15775 {
15780 }
15783 {
15785 {
15788 }
15790 {
15792 }
15793 }
15794 out:
15797 }
15799 /* Parse an enumerator-list. The enumerators all have the indicated
15800 TYPE.
15802 enumerator-list:
15803 enumerator-definition
15804 enumerator-list , enumerator-definition */
15806 static void
15808 {
15810 {
15811 /* Parse an enumerator-definition. */
15814 /* If the next token is not a ',', we've reached the end of
15815 the list. */
15818 /* Otherwise, consume the `,' and keep going. */
15820 /* If the next token is a `}', there is a trailing comma. */
15822 {
15827 }
15828 }
15829 }
15831 /* Parse an enumerator-definition. The enumerator has the indicated
15832 TYPE.
15834 enumerator-definition:
15835 enumerator
15836 enumerator = constant-expression
15838 enumerator:
15839 identifier */
15841 static void
15843 {
15844 tree identifier;
15845 tree value;
15846 location_t loc;
15848 /* Save the input location because we are interested in the location
15849 of the identifier and not the location of the explicit value. */
15852 /* Look for the identifier. */
15857 /* If the next token is an '=', then there is an explicit value. */
15859 {
15860 /* Consume the `=' token. */
15862 /* Parse the value. */
15865 NULL);
15866 }
15867 else
15870 /* If we are processing a template, make sure the initializer of the
15871 enumerator doesn't contain any bare template parameter pack. */
15875 /* integral_constant_value will pull out this expression, so make sure
15876 it's folded as appropriate. */
15879 /* Create the enumerator. */
15881 }
15883 /* Parse a namespace-name.
15885 namespace-name:
15886 original-namespace-name
15887 namespace-alias
15889 Returns the NAMESPACE_DECL for the namespace. */
15891 static tree
15893 {
15894 tree identifier;
15895 tree namespace_decl;
15899 /* Get the name of the namespace. */
15904 /* Look up the identifier in the currently active scope. Look only
15905 for namespaces, due to:
15907 [basic.lookup.udir]
15909 When looking up a namespace-name in a using-directive or alias
15910 definition, only namespace names are considered.
15912 And:
15914 [basic.lookup.qual]
15916 During the lookup of a name preceding the :: scope resolution
15917 operator, object, function, and enumerator names are ignored.
15919 (Note that cp_parser_qualifying_entity only calls this
15920 function if the token after the name is the scope resolution
15921 operator.) */
15923 none_type,
15929 /* If it's not a namespace, issue an error. */
15932 {
15937 }
15940 }
15942 /* Parse a namespace-definition.
15944 namespace-definition:
15945 named-namespace-definition
15946 unnamed-namespace-definition
15948 named-namespace-definition:
15949 original-namespace-definition
15950 extension-namespace-definition
15952 original-namespace-definition:
15953 namespace identifier { namespace-body }
15955 extension-namespace-definition:
15956 namespace original-namespace-name { namespace-body }
15958 unnamed-namespace-definition:
15959 namespace { namespace-body } */
15961 static void
15963 {
15970 {
15974 }
15975 else
15978 /* Look for the `namespace' keyword. */
15981 /* Get the name of the namespace. We do not attempt to distinguish
15982 between an original-namespace-definition and an
15983 extension-namespace-definition at this point. The semantic
15984 analysis routines are responsible for that. */
15987 else
15990 /* Parse any specified attributes. */
15993 /* Look for the `{' to start the namespace. */
15995 /* Start the namespace. */
15998 /* "inline namespace" is equivalent to a stub namespace definition
15999 followed by a strong using directive. */
16001 {
16003 /* Set up namespace association. */
16007 /* Import the contents of the inline namespace. */
16011 }
16015 /* Parse the body of the namespace. */
16021 /* Finish the namespace. */
16023 /* Look for the final `}'. */
16025 }
16027 /* Parse a namespace-body.
16029 namespace-body:
16030 declaration-seq [opt] */
16032 static void
16034 {
16036 }
16038 /* Parse a namespace-alias-definition.
16040 namespace-alias-definition:
16041 namespace identifier = qualified-namespace-specifier ; */
16043 static void
16045 {
16046 tree identifier;
16047 tree namespace_specifier;
16051 /* Look for the `namespace' keyword. */
16053 /* Look for the identifier. */
16057 /* Look for the `=' token. */
16060 {
16062 /* Skip the definition. */
16067 }
16069 /* Look for the qualified-namespace-specifier. */
16070 namespace_specifier
16072 /* Look for the `;' token. */
16075 /* Register the alias in the symbol table. */
16077 }
16079 /* Parse a qualified-namespace-specifier.
16081 qualified-namespace-specifier:
16082 :: [opt] nested-name-specifier [opt] namespace-name
16084 Returns a NAMESPACE_DECL corresponding to the specified
16085 namespace. */
16087 static tree
16089 {
16090 /* Look for the optional `::'. */
16094 /* Look for the optional nested-name-specifier. */
16102 }
16104 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16105 access declaration.
16107 using-declaration:
16108 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16109 using :: unqualified-id ;
16111 access-declaration:
16112 qualified-id ;
16114 */
16116 static bool
16119 {
16123 tree decl;
16124 tree identifier;
16125 tree qscope;
16130 {
16133 }
16134 else
16135 {
16136 /* Look for the `using' keyword. */
16139 /* Peek at the next token. */
16141 /* See if it's `typename'. */
16143 {
16144 /* Remember that we've seen it. */
16146 /* Consume the `typename' token. */
16148 }
16149 }
16151 /* Look for the optional global scope qualification. */
16152 global_scope_p
16157 /* If we saw `typename', or didn't see `::', then there must be a
16158 nested-name-specifier present. */
16160 {
16166 {
16169 }
16170 }
16171 /* Otherwise, we could be in either of the two productions. In that
16172 case, treat the nested-name-specifier as optional. */
16173 else
16185 /* Something has already gone wrong; there's no need to parse
16186 further. Since an error has occurred, the return value of
16187 cp_parser_parse_definitely will be false, as required. */
16191 /* Parse the unqualified-id. */
16199 {
16204 }
16206 /* The function we call to handle a using-declaration is different
16207 depending on what scope we are in. */
16209 ;
16212 /* [namespace.udecl]
16214 A using declaration shall not name a template-id. */
16217 else
16218 {
16220 {
16221 /* Create the USING_DECL. */
16228 {
16231 }
16232 else
16233 /* Add it to the list of members in this class. */
16235 }
16236 else
16237 {
16239 identifier,
16246 {
16249 }
16252 else
16254 }
16255 }
16257 /* Look for the final `;'. */
16262 "access declarations are deprecated "
16263 "in favour of using-declarations; "
16267 }
16269 /* Parse an alias-declaration.
16271 alias-declaration:
16272 using identifier attribute-specifier-seq [opt] = type-id */
16274 static tree
16276 {
16278 location_t id_location;
16280 cp_decl_specifier_seq decl_specs;
16284 /* Look for the `using' keyword. */
16285 cp_token *using_token
16307 /* Now we are going to parse the type-id of the declaration. */
16309 /*
16310 [dcl.type]/3 says:
16312 "A type-specifier-seq shall not define a class or enumeration
16313 unless it appears in the type-id of an alias-declaration (7.1.3) that
16314 is not the declaration of a template-declaration."
16316 In other words, if we currently are in an alias template, the
16317 type-id should not define a type.
16319 So let's set parser->type_definition_forbidden_message in that
16320 case; cp_parser_check_type_definition (called by
16321 cp_parser_class_specifier) will then emit an error if a type is
16322 defined in the type-id. */
16324 {
16328 }
16332 /* Restore the error message if need be. */
16338 {
16341 }
16343 /* A typedef-name can also be introduced by an alias-declaration. The
16344 identifier following the using keyword becomes a typedef-name. It has
16345 the same semantics as if it were introduced by the typedef
16346 specifier. In particular, it does not define a new type and it shall
16347 not appear in the type-id. */
16352 {
16355 ds_attribute,
16356 attrs_token);
16357 }
16359 ds_typedef,
16360 using_token);
16362 ds_alias,
16363 using_token);
16372 else
16383 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16384 added into the symbol table; otherwise, return the TYPE_DECL. */
16388 {
16392 }
16395 }
16397 /* Parse a using-directive.
16399 using-directive:
16400 using namespace :: [opt] nested-name-specifier [opt]
16401 namespace-name ; */
16403 static void
16405 {
16406 tree namespace_decl;
16407 tree attribs;
16409 /* Look for the `using' keyword. */
16411 /* And the `namespace' keyword. */
16413 /* Look for the optional `::' operator. */
16415 /* And the optional nested-name-specifier. */
16421 /* Get the namespace being used. */
16423 /* And any specified attributes. */
16425 /* Update the symbol table. */
16427 /* Look for the final `;'. */
16429 }
16431 /* Parse an asm-definition.
16433 asm-definition:
16434 asm ( string-literal ) ;
16436 GNU Extension:
16438 asm-definition:
16439 asm volatile [opt] ( string-literal ) ;
16440 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16441 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16442 : asm-operand-list [opt] ) ;
16443 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16444 : asm-operand-list [opt]
16445 : asm-clobber-list [opt] ) ;
16446 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16447 : asm-clobber-list [opt]
16448 : asm-goto-list ) ; */
16450 static void
16452 {
16453 tree string;
16458 tree asm_stmt;
16466 /* Look for the `asm' keyword. */
16468 /* See if the next token is `volatile'. */
16471 {
16472 /* Remember that we saw the `volatile' keyword. */
16474 /* Consume the token. */
16476 }
16480 {
16481 /* Remember that we saw the `goto' keyword. */
16483 /* Consume the token. */
16485 }
16486 /* Look for the opening `('. */
16489 /* Look for the string. */
16492 {
16496 }
16498 /* If we're allowing GNU extensions, check for the extended assembly
16499 syntax. Unfortunately, the `:' tokens need not be separated by
16500 a space in C, and so, for compatibility, we tolerate that here
16501 too. Doing that means that we have to treat the `::' operator as
16502 two `:' tokens. */
16507 {
16512 /* The extended syntax was used. */
16515 /* Look for outputs. */
16517 {
16518 /* Consume the `:'. */
16520 /* Parse the output-operands. */
16522 CPP_COLON)
16524 CPP_SCOPE)
16526 CPP_CLOSE_PAREN)
16532 }
16533 /* If the next token is `::', there are no outputs, and the
16534 next token is the beginning of the inputs. */
16536 /* The inputs are coming next. */
16539 /* Look for inputs. */
16542 {
16543 /* Consume the `:' or `::'. */
16545 /* Parse the output-operands. */
16547 CPP_COLON)
16549 CPP_SCOPE)
16551 CPP_CLOSE_PAREN))
16556 }
16558 /* The clobbers are coming next. */
16561 /* Look for clobbers. */
16564 {
16566 /* Consume the `:' or `::'. */
16568 /* Parse the clobbers. */
16570 CPP_COLON)
16572 CPP_CLOSE_PAREN))
16574 }
16577 /* The labels are coming next. */
16580 /* Look for labels. */
16583 {
16585 /* Consume the `:' or `::'. */
16587 /* Parse the labels. */
16589 }
16593 }
16597 /* Look for the closing `)'. */
16605 {
16606 /* Create the ASM_EXPR. */
16608 {
16611 /* If the extended syntax was not used, mark the ASM_EXPR. */
16613 {
16619 }
16620 }
16621 else
16623 }
16624 }
16626 /* Declarators [gram.dcl.decl] */
16628 /* Parse an init-declarator.
16630 init-declarator:
16631 declarator initializer [opt]
16633 GNU Extension:
16635 init-declarator:
16636 declarator asm-specification [opt] attributes [opt] initializer [opt]
16638 function-definition:
16639 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16640 function-body
16641 decl-specifier-seq [opt] declarator function-try-block
16643 GNU Extension:
16645 function-definition:
16646 __extension__ function-definition
16648 TM Extension:
16650 function-definition:
16651 decl-specifier-seq [opt] declarator function-transaction-block
16653 The DECL_SPECIFIERS apply to this declarator. Returns a
16654 representation of the entity declared. If MEMBER_P is TRUE, then
16655 this declarator appears in a class scope. The new DECL created by
16656 this declarator is returned.
16658 The CHECKS are access checks that should be performed once we know
16659 what entity is being declared (and, therefore, what classes have
16660 befriended it).
16662 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16663 for a function-definition here as well. If the declarator is a
16664 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16665 be TRUE upon return. By that point, the function-definition will
16666 have been completely parsed.
16668 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16669 is FALSE.
16671 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16672 parsed declaration if it is an uninitialized single declarator not followed
16673 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16674 if present, will not be consumed. If returned, this declarator will be
16675 created with SD_INITIALIZED but will not call cp_finish_decl. */
16677 static tree
16686 {
16690 tree prefix_attributes;
16692 tree asm_specification;
16693 tree initializer;
16695 tree scope;
16697 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16698 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16699 "(...)". */
16709 /* Gather the attributes that were provided with the
16710 decl-specifiers. */
16713 /* Assume that this is not the declarator for a function
16714 definition. */
16718 /* Default arguments are only permitted for function parameters. */
16722 /* Defer access checks while parsing the declarator; we cannot know
16723 what names are accessible until we know what is being
16724 declared. */
16727 /* Parse the declarator. */
16729 declarator
16734 /* Gather up the deferred checks. */
16739 /* If the DECLARATOR was erroneous, there's no need to go
16740 further. */
16744 /* Check that the number of template-parameter-lists is OK. */
16754 /* Figure out what scope the entity declared by the DECLARATOR is
16755 located in. `grokdeclarator' sometimes changes the scope, so
16756 we compute it now. */
16759 /* Perform any lookups in the declared type which were thought to be
16760 dependent, but are not in the scope of the declarator. */
16761 decl_specifiers->type
16764 /* If we're allowing GNU extensions, look for an
16765 asm-specification. */
16767 {
16768 /* Look for an asm-specification. */
16771 }
16772 else
16775 /* Look for attributes. */
16779 /* 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 {
16838 /* A non-template declaration involving a function parameter list
16839 containing an implicit template parameter will be made into a
16840 template. If the resulting declaration is not going to be an
16841 actual function then finish the template scope here to prevent it.
16842 An error message will be issued once we have a decl to talk about.
16844 FIXME probably we should do type deduction rather than create an
16845 implicit template, but the standard currently doesn't allow it. */
16848 }
16850 /* [dcl.dcl]
16852 Only in function declarations for constructors, destructors, and
16853 type conversions can the decl-specifier-seq be omitted.
16855 We explicitly postpone this check past the point where we handle
16856 function-definitions because we tolerate function-definitions
16857 that are missing their return types in some modes. */
16859 {
16863 }
16865 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16869 {
16877 {
16883 }
16884 }
16885 else
16886 {
16887 /* If the init-declarator isn't initialized and isn't followed by a
16888 `,' or `;', it's not a valid init-declarator. */
16891 {
16894 else
16895 {
16898 }
16899 }
16902 }
16904 /* Because start_decl has side-effects, we should only call it if we
16905 know we're going ahead. By this point, we know that we cannot
16906 possibly be looking at any other construct. */
16909 /* Enter the newly declared entry in the symbol table. If we're
16910 processing a declaration in a class-specifier, we wait until
16911 after processing the initializer. */
16913 {
16920 /* Adjust location of decl if declarator->id_loc is more appropriate:
16921 set, and decl wasn't merged with another decl, in which case its
16922 location would be different from input_location, and more accurate. */
16927 }
16929 /* Enter the SCOPE. That way unqualified names appearing in the
16930 initializer will be looked up in SCOPE. */
16933 /* Perform deferred access control checks, now that we know in which
16934 SCOPE the declared entity resides. */
16936 {
16939 /* If the entity being declared is a function, pretend that we
16940 are in its scope. If it is a `friend', it may have access to
16941 things that would not otherwise be accessible. */
16943 {
16946 }
16948 /* Perform access checks for template parameters. */
16951 /* Perform the access control checks for the declarator and the
16952 decl-specifiers. */
16955 /* Restore the saved value. */
16958 }
16960 /* Parse the initializer. */
16965 {
16967 {
16971 else
16972 {
16973 /* If the declaration was erroneous, we don't really
16974 know what the user intended, so just silently
16975 consume the initializer. */
16983 }
16984 }
16985 else
16986 {
16987 /* We want to record the extra mangling scope for in-class
16988 initializers of class members and initializers of static data
16989 member templates. The former involves deferring
16990 parsing of the initializer until end of class as with default
16991 arguments. So right here we only handle the latter. */
17001 }
17002 }
17004 /* The old parser allows attributes to appear after a parenthesized
17005 initializer. Mark Mitchell proposed removing this functionality
17006 on the GCC mailing lists on 2002-08-13. This parser accepts the
17007 attributes -- but ignores them. */
17014 /* And now complain about a non-function implicit template. */
17019 /* For an in-class declaration, use `grokfield' to create the
17020 declaration. */
17022 {
17024 {
17027 }
17035 }
17037 /* Finish processing the declaration. But, skip member
17038 declarations. */
17040 {
17043 asm_specification,
17044 /* If the initializer is in parentheses, then this is
17045 a direct-initialization, which means that an
17046 `explicit' constructor is OK. Otherwise, an
17047 `explicit' constructor cannot be used. */
17050 }
17053 /* Core issue #226 (C++0x only): A default template-argument
17054 shall not be specified in a friend class template
17055 declaration. */
17064 {
17067 else
17069 }
17072 }
17074 /* Parse a declarator.
17076 declarator:
17077 direct-declarator
17078 ptr-operator declarator
17080 abstract-declarator:
17081 ptr-operator abstract-declarator [opt]
17082 direct-abstract-declarator
17084 GNU Extensions:
17086 declarator:
17087 attributes [opt] direct-declarator
17088 attributes [opt] ptr-operator declarator
17090 abstract-declarator:
17091 attributes [opt] ptr-operator abstract-declarator [opt]
17092 attributes [opt] direct-abstract-declarator
17094 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17095 detect constructor, destructor or conversion operators. It is set
17096 to -1 if the declarator is a name, and +1 if it is a
17097 function. Otherwise it is set to zero. Usually you just want to
17098 test for >0, but internally the negative value is used.
17100 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17101 a decl-specifier-seq unless it declares a constructor, destructor,
17102 or conversion. It might seem that we could check this condition in
17103 semantic analysis, rather than parsing, but that makes it difficult
17104 to handle something like `f()'. We want to notice that there are
17105 no decl-specifiers, and therefore realize that this is an
17106 expression, not a declaration.)
17108 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17109 the declarator is a direct-declarator of the form "(...)".
17111 MEMBER_P is true iff this declarator is a member-declarator.
17113 FRIEND_P is true iff this declarator is a friend. */
17117 cp_parser_declarator_kind dcl_kind,
17121 {
17124 cp_cv_quals cv_quals;
17125 tree class_type;
17128 /* Assume this is not a constructor, destructor, or type-conversion
17129 operator. */
17136 /* Check for the ptr-operator production. */
17138 /* Parse the ptr-operator. */
17144 /* If that worked, then we have a ptr-operator. */
17146 {
17147 /* If a ptr-operator was found, then this declarator was not
17148 parenthesized. */
17151 /* The dependent declarator is optional if we are parsing an
17152 abstract-declarator. */
17156 /* Parse the dependent declarator. */
17161 friend_p);
17163 /* If we are parsing an abstract-declarator, we must handle the
17164 case where the dependent declarator is absent. */
17169 declarator = cp_parser_make_indirect_declarator
17171 }
17172 /* Everything else is a direct-declarator. */
17173 else
17174 {
17177 CPP_OPEN_PAREN);
17179 ctor_dtor_or_conv_p,
17181 }
17186 }
17188 /* Parse a direct-declarator or direct-abstract-declarator.
17190 direct-declarator:
17191 declarator-id
17192 direct-declarator ( parameter-declaration-clause )
17193 cv-qualifier-seq [opt]
17194 ref-qualifier [opt]
17195 exception-specification [opt]
17196 direct-declarator [ constant-expression [opt] ]
17197 ( declarator )
17199 direct-abstract-declarator:
17200 direct-abstract-declarator [opt]
17201 ( parameter-declaration-clause )
17202 cv-qualifier-seq [opt]
17203 ref-qualifier [opt]
17204 exception-specification [opt]
17205 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17206 ( abstract-declarator )
17208 Returns a representation of the declarator. DCL_KIND is
17209 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17210 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17211 we are parsing a direct-declarator. It is
17212 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17213 of ambiguity we prefer an abstract declarator, as per
17214 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17215 as for cp_parser_declarator. */
17219 cp_parser_declarator_kind dcl_kind,
17222 {
17232 {
17233 /* Peek at the next token. */
17236 {
17237 /* This is either a parameter-declaration-clause, or a
17238 parenthesized declarator. When we know we are parsing a
17239 named declarator, it must be a parenthesized declarator
17240 if FIRST is true. For instance, `(int)' is a
17241 parameter-declaration-clause, with an omitted
17242 direct-abstract-declarator. But `((*))', is a
17243 parenthesized abstract declarator. Finally, when T is a
17244 template parameter `(T)' is a
17245 parameter-declaration-clause, and not a parenthesized
17246 named declarator.
17248 We first try and parse a parameter-declaration-clause,
17249 and then try a nested declarator (if FIRST is true).
17251 It is not an error for it not to be a
17252 parameter-declaration-clause, even when FIRST is
17253 false. Consider,
17255 int i (int);
17256 int i (3);
17258 The first is the declaration of a function while the
17259 second is the definition of a variable, including its
17260 initializer.
17262 Having seen only the parenthesis, we cannot know which of
17263 these two alternatives should be selected. Even more
17264 complex are examples like:
17266 int i (int (a));
17267 int i (int (3));
17269 The former is a function-declaration; the latter is a
17270 variable initialization.
17272 Thus again, we try a parameter-declaration-clause, and if
17273 that fails, we back out and return. */
17276 {
17277 tree params;
17280 /* In a member-declarator, the only valid interpretation
17281 of a parenthesis is the start of a
17282 parameter-declaration-clause. (It is invalid to
17283 initialize a static data member with a parenthesized
17284 initializer; only the "=" form of initialization is
17285 permitted.) */
17289 /* Consume the `('. */
17292 {
17293 /* If this is going to be an abstract declarator, we're
17294 in a declarator and we can't have default args. */
17297 }
17301 /* Parse the parameter-declaration-clause. */
17304 /* Consume the `)'. */
17307 /* If all went well, parse the cv-qualifier-seq,
17308 ref-qualifier and the exception-specification. */
17310 {
17311 cp_cv_quals cv_quals;
17312 cp_virt_specifiers virt_specifiers;
17313 cp_ref_qualifier ref_qual;
17314 tree exception_specification;
17315 tree late_return;
17316 tree attrs;
17326 /* Parse the cv-qualifier-seq. */
17328 /* Parse the ref-qualifier. */
17330 /* And the exception-specification. */
17331 exception_specification
17336 /* In here, we handle cases where attribute is used after
17337 the function declaration. For example:
17338 void func (int x) __attribute__((vector(..))); */
17341 {
17345 CPP_SEMICOLON)
17347 CPP_OPEN_BRACE))
17350 ;
17351 else
17353 }
17354 late_return = (cp_parser_late_return_type_opt
17359 /* Parse the virt-specifier-seq. */
17362 /* Create the function-declarator. */
17364 params,
17365 cv_quals,
17366 virt_specifiers,
17367 ref_qual,
17368 exception_specification,
17369 late_return);
17371 /* Any subsequent parameter lists are to do with
17372 return type, so are not those of the declared
17373 function. */
17375 }
17377 /* Remove the function parms from scope. */
17381 /* Repeat the main loop. */
17383 }
17385 /* If this is the first, we can try a parenthesized
17386 declarator. */
17388 {
17394 /* Consume the `('. */
17396 /* Parse the nested declarator. */
17399 declarator
17405 /* Expect a `)'. */
17412 }
17413 /* Otherwise, we must be done. */
17414 else
17416 }
17420 {
17421 /* Parse an array-declarator. */
17430 /* Consume the `['. */
17432 /* Peek at the next token. */
17434 /* If the next token is `]', then there is no
17435 constant-expression. */
17437 {
17439 bounds
17449 {
17450 /* Normally, the array bound must be an integral constant
17451 expression. However, as an extension, we allow VLAs
17452 in function scopes as long as they aren't part of a
17453 parameter declaration. */
17457 }
17460 {
17461 /* Remember this wasn't a constant-expression. */
17464 }
17465 }
17466 else
17468 /* Look for the closing `]'. */
17470 {
17473 }
17478 }
17480 {
17481 {
17482 tree qualifying_scope;
17483 tree unqualified_name;
17484 tree attrs;
17485 special_function_kind sfk;
17490 /* Parse a declarator-id */
17493 {
17496 /* If we see an ellipsis, we should be looking at a
17497 parameter pack. */
17499 {
17500 /* Consume the `...' */
17504 }
17505 }
17508 unqualified_name
17512 {
17516 {
17517 /* Check whether an error occurred. */
17520 /* We already consumed the ellipsis to mark a
17521 parameter pack, but we have no way to report it,
17522 so abort the tentative parse. We will be exiting
17523 immediately anyway. */
17525 }
17526 else
17532 && (qualifying_scope
17534 {
17537 }
17538 }
17543 {
17548 }
17554 {
17555 /* In the declaration of a member of a template class
17556 outside of the class itself, the SCOPE will sometimes
17557 be a TYPENAME_TYPE. For example, given:
17559 template <typename T>
17560 int S<T>::R::i = 3;
17562 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17563 this context, we must resolve S<T>::R to an ordinary
17564 type, rather than a typename type.
17566 The reason we normally avoid resolving TYPENAME_TYPEs
17567 is that a specialization of `S' might render
17568 `S<T>::R' not a type. However, if `S' is
17569 specialized, then this `i' will not be used, so there
17570 is no harm in resolving the types here. */
17571 tree type;
17573 /* Resolve the TYPENAME_TYPE. */
17576 /* If that failed, the declarator is invalid. */
17578 {
17581 "cannot define member of dependent typedef "
17583 else
17588 }
17590 }
17595 {
17596 tree class_type;
17601 else
17605 {
17608 {
17611 {
17615 "use %<%T::%D%> instead of %<%T::%D%> to "
17617 class_type,
17622 }
17623 else
17625 }
17626 else
17627 {
17628 /* We do not attempt to print the declarator
17629 here because we do not have enough
17630 information about its original syntactic
17631 form. */
17635 }
17636 }
17639 {
17645 for an anonymous type, even if the type
17646 got a name for linkage purposes. */
17648 /* Handle correctly (c++/19200):
17650 struct S {
17651 struct T{};
17652 friend void S(T);
17653 };
17655 and also:
17657 namespace N {
17658 void S();
17659 }
17661 struct S {
17662 friend void N::S();
17663 }; */
17664 && !(friend_p
17667 class_type))
17668 {
17671 }
17679 }
17680 }
17682 unqualified_name,
17683 sfk);
17690 }
17692 handle_declarator:;
17695 {
17696 /* Any names that appear after the declarator-id for a
17697 member are looked up in the containing scope. */
17699 {
17700 /* But declarations with qualified-ids can't appear in a
17701 function. */
17705 }
17707 }
17711 /* Default args are only allowed on function
17712 declarations. */
17714 else
17718 }
17719 /* We're done. */
17720 else
17722 }
17724 /* For an abstract declarator, we might wind up with nothing at this
17725 point. That's an error; the declarator is not optional. */
17729 /* If we entered a scope, we must exit it now. */
17737 }
17739 /* Parse a ptr-operator.
17741 ptr-operator:
17742 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17743 * cv-qualifier-seq [opt]
17744 &
17745 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17746 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17748 GNU Extension:
17750 ptr-operator:
17751 & cv-qualifier-seq [opt]
17753 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17754 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17755 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17756 filled in with the TYPE containing the member. *CV_QUALS is
17757 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17758 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17759 Note that the tree codes returned by this function have nothing
17760 to do with the types of trees that will be eventually be created
17761 to represent the pointer or reference type being parsed. They are
17762 just constants with suggestive names. */
17763 static enum tree_code
17768 {
17773 /* Assume that it's not a pointer-to-member. */
17775 /* And that there are no cv-qualifiers. */
17778 /* Peek at the next token. */
17781 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17791 {
17792 /* Consume the `*', `&' or `&&'. */
17795 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17796 `&', if we are allowing GNU extensions. (The only qualifier
17797 that can legally appear after `&' is `restrict', but that is
17798 enforced during semantic analysis. */
17806 }
17807 else
17808 {
17809 /* Try the pointer-to-member case. */
17811 /* Look for the optional `::' operator. */
17814 /* Look for the nested-name specifier. */
17821 /* If we found it, and the next token is a `*', then we are
17822 indeed looking at a pointer-to-member operator. */
17825 {
17826 /* Indicate that the `*' operator was used. */
17834 else
17835 {
17836 /* The type of which the member is a member is given by the
17837 current SCOPE. */
17839 /* The next name will not be qualified. */
17843 /* Look for optional c++11 attributes. */
17847 /* Look for the optional cv-qualifier-seq. */
17849 }
17850 }
17851 /* If that didn't work we don't have a ptr-operator. */
17854 }
17857 }
17859 /* Parse an (optional) cv-qualifier-seq.
17861 cv-qualifier-seq:
17862 cv-qualifier cv-qualifier-seq [opt]
17864 cv-qualifier:
17865 const
17866 volatile
17868 GNU Extension:
17870 cv-qualifier:
17871 __restrict__
17873 Returns a bitmask representing the cv-qualifiers. */
17875 static cp_cv_quals
17877 {
17881 {
17883 cp_cv_quals cv_qualifier;
17885 /* Peek at the next token. */
17887 /* See if it's a cv-qualifier. */
17889 {
17905 }
17911 {
17914 }
17915 else
17916 {
17919 }
17920 }
17923 }
17925 /* Parse an (optional) ref-qualifier
17927 ref-qualifier:
17928 &
17929 &&
17931 Returns cp_ref_qualifier representing ref-qualifier. */
17933 static cp_ref_qualifier
17935 {
17938 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17943 {
17948 {
17960 }
17965 {
17968 }
17969 else
17970 {
17973 }
17974 }
17977 }
17979 /* Parse an (optional) virt-specifier-seq.
17981 virt-specifier-seq:
17982 virt-specifier virt-specifier-seq [opt]
17984 virt-specifier:
17985 override
17986 final
17988 Returns a bitmask representing the virt-specifiers. */
17990 static cp_virt_specifiers
17992 {
17996 {
17998 cp_virt_specifiers virt_specifier;
18000 /* Peek at the next token. */
18002 /* See if it's a virt-specifier-qualifier. */
18006 {
18009 }
18011 {
18014 }
18016 {
18018 }
18019 else
18023 {
18026 }
18027 else
18028 {
18031 }
18032 }
18034 }
18036 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18037 is in scope even though it isn't real. */
18039 void
18041 {
18042 tree this_parm;
18045 {
18046 /* We don't clear this between NSDMIs. Is it already what we want? */
18051 }
18054 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18056 current_class_ref
18059 }
18061 /* Return true iff our current scope is a non-static data member
18062 initializer. */
18064 bool
18066 {
18067 /* We recognize NSDMI context by the context-less 'this' pointer set up
18068 by the function above. */
18072 }
18074 /* Parse a late-specified return type, if any. This is not a separate
18075 non-terminal, but part of a function declarator, which looks like
18077 -> trailing-type-specifier-seq abstract-declarator(opt)
18079 Returns the type indicated by the type-id.
18081 In addition to this this parses any queued up omp declare simd
18082 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18084 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18085 function. */
18087 static tree
18089 cp_cv_quals quals)
18090 {
18094 && declarator
18100 /* Peek at the next token. */
18102 /* A late-specified return type is indicated by an initial '->'. */
18109 {
18110 /* DR 1207: 'this' is in scope in the trailing return type. */
18112 }
18115 {
18116 /* Consume the ->. */
18120 }
18123 declarator->std_attributes
18127 declarator->std_attributes
18132 {
18135 }
18138 }
18140 /* Parse a declarator-id.
18142 declarator-id:
18143 id-expression
18144 :: [opt] nested-name-specifier [opt] type-name
18146 In the `id-expression' case, the value returned is as for
18147 cp_parser_id_expression if the id-expression was an unqualified-id.
18148 If the id-expression was a qualified-id, then a SCOPE_REF is
18149 returned. The first operand is the scope (either a NAMESPACE_DECL
18150 or TREE_TYPE), but the second is still just a representation of an
18151 unqualified-id. */
18153 static tree
18155 {
18156 tree id;
18157 /* The expression must be an id-expression. Assume that qualified
18158 names are the names of types so that:
18160 template <class T>
18161 int S<T>::R::i = 3;
18163 will work; we must treat `S<T>::R' as the name of a type.
18164 Similarly, assume that qualified names are templates, where
18165 required, so that:
18167 template <class T>
18168 int S<T>::R<T>::i = 3;
18170 will work, too. */
18176 optional_p);
18180 }
18182 /* Parse a type-id.
18184 type-id:
18185 type-specifier-seq abstract-declarator [opt]
18187 Returns the TYPE specified. */
18189 static tree
18192 {
18193 cp_decl_specifier_seq type_specifier_seq;
18196 /* Parse the type-specifier-seq. */
18198 is_trailing_return,
18203 /* There might or might not be an abstract declarator. */
18205 /* Look for the declarator. */
18206 abstract_declarator
18211 /* Check to see if there really was a declarator. */
18216 /* None of the valid uses of 'auto' in C++14 involve the type-id
18217 nonterminal, but it is valid in a trailing-return-type. */
18220 {
18221 /* A type-id with type 'auto' is only ok if the abstract declarator
18222 is a function declarator with a late-specified return type. */
18227 else
18228 {
18231 }
18232 }
18235 is_template_arg);
18236 }
18239 {
18241 }
18244 {
18245 tree r;
18247 parser->type_definition_forbidden_message
18252 {
18255 }
18257 }
18260 {
18262 }
18264 /* Parse a type-specifier-seq.
18266 type-specifier-seq:
18267 type-specifier type-specifier-seq [opt]
18269 GNU extension:
18271 type-specifier-seq:
18272 attributes type-specifier-seq [opt]
18274 If IS_DECLARATION is true, we are at the start of a "condition" or
18275 exception-declaration, so we might be followed by a declarator-id.
18277 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18278 i.e. we've just seen "->".
18280 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18282 static void
18287 {
18292 /* Clear the TYPE_SPECIFIER_SEQ. */
18295 /* In the context of a trailing return type, enum E { } is an
18296 elaborated-type-specifier followed by a function-body, not an
18297 enum-specifier. */
18301 /* Parse the type-specifiers and attributes. */
18303 {
18304 tree type_specifier;
18307 /* Check for attributes first. */
18309 {
18314 }
18316 /* record the token of the beginning of the type specifier seq,
18317 for error reporting purposes*/
18321 /* Look for the type-specifier. */
18323 flags,
18324 type_specifier_seq,
18326 NULL,
18329 {
18330 /* If the first type-specifier could not be found, this is not a
18331 type-specifier-seq at all. */
18333 {
18334 /* Set in_declarator_p to avoid skipping to the semicolon. */
18346 }
18347 /* If subsequent type-specifiers could not be found, the
18348 type-specifier-seq is complete. */
18350 }
18353 /* The standard says that a condition can be:
18355 type-specifier-seq declarator = assignment-expression
18357 However, given:
18359 struct S {};
18360 if (int S = ...)
18362 we should treat the "S" as a declarator, not as a
18363 type-specifier. The standard doesn't say that explicitly for
18364 type-specifier-seq, but it does say that for
18365 decl-specifier-seq in an ordinary declaration. Perhaps it
18366 would be clearer just to allow a decl-specifier-seq here, and
18367 then add a semantic restriction that if any decl-specifiers
18368 that are not type-specifiers appear, the program is invalid. */
18371 }
18372 }
18374 /* Return whether the function currently being declared has an associated
18375 template parameter list. */
18377 static bool
18379 {
18392 }
18394 /* Parse a parameter-declaration-clause.
18396 parameter-declaration-clause:
18397 parameter-declaration-list [opt] ... [opt]
18398 parameter-declaration-list , ...
18400 Returns a representation for the parameter declarations. A return
18401 value of NULL indicates a parameter-declaration-clause consisting
18402 only of an ellipsis. */
18404 static tree
18406 {
18407 tree parameters;
18416 parser->auto_is_implicit_function_template_parm_p
18418 }
18424 && !processing_template_parmlist
18430 /* Peek at the next token. */
18432 /* Check for trivial parameter-declaration-clauses. */
18434 {
18435 /* Consume the `...' token. */
18438 }
18440 /* There are no parameters. */
18441 {
18442 #ifndef NO_IMPLICIT_EXTERN_C
18447 else
18448 #endif
18450 }
18451 /* Check for `(void)', too, which is a special case. */
18455 {
18456 /* Consume the `void' token. */
18458 /* There are no parameters. */
18460 }
18462 /* Parse the parameter-declaration-list. */
18464 /* If a parse error occurred while parsing the
18465 parameter-declaration-list, then the entire
18466 parameter-declaration-clause is erroneous. */
18470 /* Peek at the next token. */
18472 /* If it's a `,', the clause should terminate with an ellipsis. */
18474 {
18475 /* Consume the `,'. */
18477 /* Expect an ellipsis. */
18478 ellipsis_p
18480 }
18481 /* It might also be `...' if the optional trailing `,' was
18482 omitted. */
18484 {
18485 /* Consume the `...' token. */
18487 /* And remember that we saw it. */
18489 }
18490 else
18493 /* Finish the parameter list. */
18498 }
18500 /* Parse a parameter-declaration-list.
18502 parameter-declaration-list:
18503 parameter-declaration
18504 parameter-declaration-list , parameter-declaration
18506 Returns a representation of the parameter-declaration-list, as for
18507 cp_parser_parameter_declaration_clause. However, the
18508 `void_list_node' is never appended to the list. Upon return,
18509 *IS_ERROR will be true iff an error occurred. */
18511 static tree
18513 {
18519 /* Assume all will go well. */
18521 /* The special considerations that apply to a function within an
18522 unbraced linkage specifications do not apply to the parameters
18523 to the function. */
18524 saved_in_unbraced_linkage_specification_p
18528 /* Look for more parameters. */
18530 {
18538 /* Parse the parameter. */
18539 parameter
18544 /* We don't know yet if the enclosing context is deprecated, so wait
18545 and warn in grokparms if appropriate. */
18549 {
18550 /* If a function parameter pack was specified and an implicit template
18551 parameter was introduced during cp_parser_parameter_declaration,
18552 change any implicit parameters introduced into packs. */
18556 {
18564 }
18568 PARM,
18571 }
18575 /* If a parse error occurred parsing the parameter declaration,
18576 then the entire parameter-declaration-list is erroneous. */
18578 {
18582 }
18592 {
18596 }
18598 /* Add the new parameter to the list. */
18602 /* Peek at the next token. */
18605 /* These are for Objective-C++ */
18608 /* The parameter-declaration-list is complete. */
18611 {
18614 /* Peek at the next token. */
18616 /* If it's an ellipsis, then the list is complete. */
18619 /* Otherwise, there must be more parameters. Consume the
18620 `,'. */
18622 /* When parsing something like:
18624 int i(float f, double d)
18626 we can tell after seeing the declaration for "f" that we
18627 are not looking at an initialization of a variable "i",
18628 but rather at the declaration of a function "i".
18630 Due to the fact that the parsing of template arguments
18631 (as specified to a template-id) requires backtracking we
18632 cannot use this technique when inside a template argument
18633 list. */
18637 /* However, a parameter-declaration of the form
18638 "float(f)" (which is a valid declaration of a
18639 parameter "f") can also be interpreted as an
18640 expression (the conversion of "f" to "float"). */
18643 }
18644 else
18645 {
18653 }
18654 }
18656 parser->in_unbraced_linkage_specification_p
18659 /* Reset implicit_template_scope if we are about to leave the function
18660 parameter list that introduced it. Note that for out-of-line member
18661 definitions, there will be one or more class scopes before we get to
18662 the template parameter scope. */
18666 {
18670 {
18673 }
18674 }
18677 }
18679 /* Parse a parameter declaration.
18681 parameter-declaration:
18682 decl-specifier-seq ... [opt] declarator
18683 decl-specifier-seq declarator = assignment-expression
18684 decl-specifier-seq ... [opt] abstract-declarator [opt]
18685 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18687 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18688 declares a template parameter. (In that case, a non-nested `>'
18689 token encountered during the parsing of the assignment-expression
18690 is not interpreted as a greater-than operator.)
18692 Returns a representation of the parameter, or NULL if an error
18693 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18694 true iff the declarator is of the form "(p)". */
18700 {
18702 cp_decl_specifier_seq decl_specifiers;
18704 tree default_argument;
18708 /* In a template parameter, `>' is not an operator.
18710 [temp.param]
18712 When parsing a default template-argument for a non-type
18713 template-parameter, the first non-nested `>' is taken as the end
18714 of the template parameter-list rather than a greater-than
18715 operator. */
18717 /* Type definitions may not appear in parameter types. */
18719 parser->type_definition_forbidden_message
18722 /* Parse the declaration-specifiers. */
18724 CP_PARSER_FLAGS_NONE,
18728 /* Complain about missing 'typename' or other invalid type names. */
18733 /* If an error occurred, there's no reason to attempt to parse the
18734 rest of the declaration. */
18736 {
18739 }
18741 /* Peek at the next token. */
18744 /* If the next token is a `)', `,', `=', `>', or `...', then there
18745 is no declarator. However, when variadic templates are enabled,
18746 there may be a declarator following `...'. */
18751 {
18755 }
18756 /* Otherwise, there should be a declarator. */
18757 else
18758 {
18762 /* After seeing a decl-specifier-seq, if the next token is not a
18763 "(", there is no possibility that the code is a valid
18764 expression. Therefore, if parsing tentatively, we commit at
18765 this point. */
18767 /* In an expression context, having seen:
18769 (int((char ...
18771 we cannot be sure whether we are looking at a
18772 function-type (taking a "char" as a parameter) or a cast
18773 of some object of type "char" to "int". */
18779 /* Parse the declarator. */
18782 CP_PARSER_DECLARATOR_EITHER,
18784 parenthesized_p,
18788 /* After the declarator, allow more attributes. */
18789 decl_specifiers.attributes
18792 }
18794 /* If the next token is an ellipsis, and we have not seen a
18795 declarator name, and the type of the declarator contains parameter
18796 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18797 a parameter pack expansion expression. Otherwise, leave the
18798 ellipsis for a C-style variadic function. */
18801 {
18812 {
18813 /* Consume the `...'. */
18817 /* Build a pack expansion type */
18820 else
18822 }
18823 }
18825 /* The restriction on defining new types applies only to the type
18826 of the parameter, not to the default argument. */
18829 /* If the next token is `=', then process a default argument. */
18831 {
18833 /* If we are defining a class, then the tokens that make up the
18834 default argument must be saved and processed later. */
18839 /* Outside of a class definition, we can just parse the
18840 assignment-expression. */
18841 else
18842 default_argument
18846 {
18849 else
18850 {
18852 "default arguments are only "
18855 }
18856 }
18860 {
18861 /* Find the name of the parameter pack. */
18868 template_parm_p
18874 else
18876 template_parm_p
18883 }
18884 }
18885 else
18889 declarator,
18890 default_argument);
18891 }
18893 /* Parse a default argument and return it.
18895 TEMPLATE_PARM_P is true if this is a default argument for a
18896 non-type template parameter. */
18897 static tree
18899 {
18905 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18906 set correctly. */
18909 /* Local variable names (and the `this' keyword) may not
18910 appear in a default argument. */
18913 /* Parse the assignment-expression. */
18918 /* The "this" pointer is not valid in a default argument. */
18920 {
18925 }
18926 default_argument
18928 /* Restore the "this" pointer. */
18930 {
18933 }
18942 }
18944 /* Parse a function-body.
18946 function-body:
18947 compound_statement */
18949 static void
18951 {
18953 }
18955 /* Parse a ctor-initializer-opt followed by a function-body. Return
18956 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18957 is true we are parsing a function-try-block. */
18959 static bool
18962 {
18970 /* Begin the function body. */
18972 /* Parse the optional ctor-initializer. */
18975 /* If we're parsing a constexpr constructor definition, we need
18976 to check that the constructor body is indeed empty. However,
18977 before we get to cp_parser_function_body lot of junk has been
18978 generated, so we can't just check that we have an empty block.
18979 Rather we take a snapshot of the outermost block, and check whether
18980 cp_parser_function_body changed its state. */
18982 {
18986 }
18987 /* Parse the function-body. */
18991 /* Finish the function body. */
18995 }
18997 /* Parse an initializer.
18999 initializer:
19000 = initializer-clause
19001 ( expression-list )
19003 Returns an expression representing the initializer. If no
19004 initializer is present, NULL_TREE is returned.
19006 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19007 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19008 set to TRUE if there is no initializer present. If there is an
19009 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19010 is set to true; otherwise it is set to false. */
19012 static tree
19015 {
19017 tree init;
19019 /* Peek at the next token. */
19022 /* Let our caller know whether or not this initializer was
19023 parenthesized. */
19025 /* Assume that the initializer is constant. */
19029 {
19030 /* Consume the `='. */
19032 /* Parse the initializer-clause. */
19034 }
19036 {
19041 non_constant_p);
19046 }
19048 {
19053 }
19054 else
19055 {
19056 /* Anything else is an error. */
19059 }
19062 }
19064 /* Parse an initializer-clause.
19066 initializer-clause:
19067 assignment-expression
19068 braced-init-list
19070 Returns an expression representing the initializer.
19072 If the `assignment-expression' production is used the value
19073 returned is simply a representation for the expression.
19075 Otherwise, calls cp_parser_braced_list. */
19077 static tree
19079 {
19080 tree initializer;
19082 /* Assume the expression is constant. */
19085 /* If it is not a `{', then we are looking at an
19086 assignment-expression. */
19088 {
19089 initializer
19092 non_constant_p);
19093 }
19094 else
19098 }
19100 /* Parse a brace-enclosed initializer list.
19102 braced-init-list:
19103 { initializer-list , [opt] }
19104 { }
19106 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19107 the elements of the initializer-list (or NULL, if the last
19108 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19109 NULL_TREE. There is no way to detect whether or not the optional
19110 trailing `,' was provided. NON_CONSTANT_P is as for
19111 cp_parser_initializer. */
19113 static tree
19115 {
19116 tree initializer;
19118 /* Consume the `{' token. */
19120 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19122 /* If it's not a `}', then there is a non-trivial initializer. */
19124 {
19125 /* Parse the initializer list. */
19128 /* A trailing `,' token is allowed. */
19131 }
19132 else
19134 /* Now, there should be a trailing `}'. */
19138 }
19140 /* Parse an initializer-list.
19142 initializer-list:
19143 initializer-clause ... [opt]
19144 initializer-list , initializer-clause ... [opt]
19146 GNU Extension:
19148 initializer-list:
19149 designation initializer-clause ...[opt]
19150 initializer-list , designation initializer-clause ...[opt]
19152 designation:
19153 . identifier =
19154 identifier :
19155 [ constant-expression ] =
19157 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19158 for the initializer. If the INDEX of the elt is non-NULL, it is the
19159 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19160 as for cp_parser_initializer. */
19164 {
19167 /* Assume all of the expressions are constant. */
19170 /* Parse the rest of the list. */
19172 {
19174 tree designator;
19175 tree initializer;
19178 /* If the next token is an identifier and the following one is a
19179 colon, we are looking at the GNU designated-initializer
19180 syntax. */
19184 {
19185 /* Warn the user that they are using an extension. */
19188 /* Consume the identifier. */
19190 /* Consume the `:'. */
19192 }
19193 /* Also handle the C99 syntax, '. id ='. */
19198 {
19199 /* Warn the user that they are using an extension. */
19202 /* Consume the `.'. */
19204 /* Consume the identifier. */
19206 /* Consume the `='. */
19208 }
19209 /* Also handle C99 array designators, '[ const ] ='. */
19213 {
19214 /* In C++11, [ could start a lambda-introducer. */
19226 }
19227 else
19230 /* Parse the initializer. */
19233 /* If any clause is non-constant, so is the entire initializer. */
19237 /* If we have an ellipsis, this is an initializer pack
19238 expansion. */
19240 {
19241 /* Consume the `...'. */
19244 /* Turn the initializer into an initializer expansion. */
19246 }
19248 /* Add it to the vector. */
19251 /* If the next token is not a comma, we have reached the end of
19252 the list. */
19256 /* Peek at the next token. */
19258 /* If the next token is a `}', then we're still done. An
19259 initializer-clause can have a trailing `,' after the
19260 initializer-list and before the closing `}'. */
19264 /* Consume the `,' token. */
19266 }
19269 }
19271 /* Classes [gram.class] */
19273 /* Parse a class-name.
19275 class-name:
19276 identifier
19277 template-id
19279 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19280 to indicate that names looked up in dependent types should be
19281 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19282 keyword has been used to indicate that the name that appears next
19283 is a template. TAG_TYPE indicates the explicit tag given before
19284 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19285 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19286 is the class being defined in a class-head.
19288 Returns the TYPE_DECL representing the class. */
19290 static tree
19298 {
19299 tree decl;
19300 tree scope;
19305 /* All class-names start with an identifier. */
19308 {
19311 }
19313 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19314 to a template-id, so we save it here. */
19319 /* Any name names a type if we're following the `typename' keyword
19320 in a qualified name where the enclosing scope is type-dependent. */
19323 /* Handle the common case (an identifier, but not a template-id)
19324 efficiently. */
19327 {
19331 /* Look for the identifier. */
19335 /* If the next token isn't an identifier, we are certainly not
19336 looking at a class-name. */
19339 /* If we know this is a type-name, there's no need to look it
19340 up. */
19343 else
19344 {
19345 tree ambiguous_decls;
19346 /* If we already know that this lookup is ambiguous, then
19347 we've already issued an error message; there's no reason
19348 to check again. */
19350 {
19353 }
19354 /* If the next token is a `::', then the name must be a type
19355 name.
19357 [basic.lookup.qual]
19359 During the lookup for a name preceding the :: scope
19360 resolution operator, object, function, and enumerator
19361 names are ignored. */
19364 /* Look up the name. */
19366 tag_type,
19369 check_dependency_p,
19373 {
19377 }
19378 }
19379 }
19380 else
19381 {
19382 /* Try a template-id. */
19384 check_dependency_p,
19385 tag_type,
19386 is_declaration);
19389 }
19393 /* If this is a typename, create a TYPENAME_TYPE. */
19395 {
19400 }
19404 /* Check to see that it is really the name of a class. */
19408 /* Situations like this:
19410 template <typename T> struct A {
19411 typename T::template X<int>::I i;
19412 };
19414 are problematic. Is `T::template X<int>' a class-name? The
19415 standard does not seem to be definitive, but there is no other
19416 valid interpretation of the following `::'. Therefore, those
19417 names are considered class-names. */
19418 {
19422 }
19426 /* In Objective-C 2.0, a classname followed by '.' starts a
19427 dot-syntax expression, and it's not a type-name. */
19439 }
19441 /* Parse a class-specifier.
19443 class-specifier:
19444 class-head { member-specification [opt] }
19446 Returns the TREE_TYPE representing the class. */
19448 static tree
19450 {
19451 tree type;
19465 /* Parse the class-head. */
19468 /* If the class-head was a semantic disaster, skip the entire body
19469 of the class. */
19471 {
19475 }
19477 /* Look for the `{'. */
19479 {
19482 }
19486 /* Issue an error message if type-definitions are forbidden here. */
19488 /* Remember that we are defining one more class. */
19490 /* Inside the class, surrounding template-parameter-lists do not
19491 apply. */
19492 saved_num_template_parameter_lists
19495 /* We are not in a function body. */
19498 /* Or in a loop. */
19501 /* Or in a switch. */
19504 /* We are not immediately inside an extern "lang" block. */
19505 saved_in_unbraced_linkage_specification_p
19509 /* Start the class. */
19511 {
19514 }
19518 /* If the type is erroneous, skip the entire body of the class. */
19520 else
19521 /* Parse the member-specification. */
19524 /* Look for the trailing `}'. */
19526 /* Look for trailing attributes to apply to this class. */
19534 /* We've finished a type definition. Check for the common syntax
19535 error of forgetting a semicolon after the definition. We need to
19536 be careful, as we can't just check for not-a-semicolon and be done
19537 with it; the user might have typed:
19539 class X { } c = ...;
19540 class X { } *p = ...;
19542 and so forth. Instead, enumerate all the possible tokens that
19543 might follow this production; if we don't see one of them, then
19544 complain and silently insert the semicolon. */
19545 {
19550 /* Don't try to parse c++11 attributes here. As per the
19551 grammar, that should be a task for
19552 cp_parser_decl_specifier_seq. */
19556 {
19567 /* While it's legal for type qualifiers and storage class
19568 specifiers to follow type definitions in the grammar, only
19569 compiler testsuites contain code like that. Assume that if
19570 we see such code, then what we're really seeing is a case
19571 like:
19573 class X { }
19574 const <type> var = ...;
19576 or
19578 class Y { }
19579 static <type> func (...) ...
19581 i.e. the qualifier or specifier applies to the next
19582 declaration. To do so, however, we need to look ahead one
19583 more token to see if *that* token is a type specifier.
19585 This code could be improved to handle:
19587 class Z { }
19588 static const <type> var = ...; */
19591 {
19594 /* Handling user-defined types here would be nice, but very
19595 tricky. */
19596 want_semicolon
19599 }
19603 }
19605 /* If we don't have a type, then something is very wrong and we
19606 shouldn't try to do anything clever. Likewise for not seeing the
19607 closing brace. */
19609 {
19610 cp_token_position prev
19621 else
19624 /* Unget one token and smash it to look as though we encountered
19625 a semicolon in the input stream. */
19630 }
19631 }
19633 /* If this class is not itself within the scope of another class,
19634 then we need to parse the bodies of all of the queued function
19635 definitions. Note that the queued functions defined in a class
19636 are not always processed immediately following the
19637 class-specifier for that class. Consider:
19639 struct A {
19640 struct B { void f() { sizeof (A); } };
19641 };
19643 If `f' were processed before the processing of `A' were
19644 completed, there would be no way to compute the size of `A'.
19645 Note that the nesting we are interested in here is lexical --
19646 not the semantic nesting given by TYPE_CONTEXT. In particular,
19647 for:
19649 struct A { struct B; };
19650 struct A::B { void f() { } };
19652 there is no need to delay the parsing of `A::B::f'. */
19654 {
19655 tree decl;
19662 /* In a first pass, parse default arguments to the functions.
19663 Then, in a second pass, parse the bodies of the functions.
19664 This two-phased approach handles cases like:
19666 struct S {
19667 void f() { g(); }
19668 void g(int i = 3);
19669 };
19671 */
19673 {
19675 /* If there are default arguments that have not yet been processed,
19676 take care of them now. */
19678 {
19683 }
19684 /* Make sure that any template parameters are in scope. */
19686 /* Parse the default argument expressions. */
19688 /* Remove any template parameters from the symbol table. */
19690 }
19692 /* Now parse any NSDMIs. */
19696 {
19698 {
19703 }
19706 }
19713 /* Now do some post-NSDMI bookkeeping. */
19719 /* Now parse the body of the functions. */
19721 {
19722 /* OpenMP UDRs need to be parsed before all other functions. */
19729 }
19730 else
19734 }
19735 else
19738 /* Put back any saved access checks. */
19741 /* Restore saved state. */
19745 parser->num_template_parameter_lists
19747 parser->in_unbraced_linkage_specification_p
19751 }
19753 static tree
19755 {
19756 tree ret;
19761 }
19763 /* Parse a class-head.
19765 class-head:
19766 class-key identifier [opt] base-clause [opt]
19767 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19768 class-key nested-name-specifier [opt] template-id
19769 base-clause [opt]
19771 class-virt-specifier:
19772 final
19774 GNU Extensions:
19775 class-key attributes identifier [opt] base-clause [opt]
19776 class-key attributes nested-name-specifier identifier base-clause [opt]
19777 class-key attributes nested-name-specifier [opt] template-id
19778 base-clause [opt]
19780 Upon return BASES is initialized to the list of base classes (or
19781 NULL, if there are none) in the same form returned by
19782 cp_parser_base_clause.
19784 Returns the TYPE of the indicated class. Sets
19785 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19786 involving a nested-name-specifier was used, and FALSE otherwise.
19788 Returns error_mark_node if this is not a class-head.
19790 Returns NULL_TREE if the class-head is syntactically valid, but
19791 semantically invalid in a way that means we should skip the entire
19792 body of the class. */
19794 static tree
19797 {
19798 tree nested_name_specifier;
19802 tree attributes;
19803 tree bases;
19813 /* Assume no nested-name-specifier will be present. */
19815 /* Assume no template parameter lists will be used in defining the
19816 type. */
19820 /* Look for the class-key. */
19825 /* Parse the attributes. */
19828 /* If the next token is `::', that is invalid -- but sometimes
19829 people do try to write:
19831 struct ::S {};
19833 Handle this gracefully by accepting the extra qualifier, and then
19834 issuing an error about it later if this really is a
19835 class-head. If it turns out just to be an elaborated type
19836 specifier, remain silent. */
19842 /* Determine the name of the class. Begin by looking for an
19843 optional nested-name-specifier. */
19845 nested_name_specifier
19851 /* If there was a nested-name-specifier, then there *must* be an
19852 identifier. */
19854 {
19856 /* Although the grammar says `identifier', it really means
19857 `class-name' or `template-name'. You are only allowed to
19858 define a class that has already been declared with this
19859 syntax.
19861 The proposed resolution for Core Issue 180 says that wherever
19862 you see `class T::X' you should treat `X' as a type-name.
19864 It is OK to define an inaccessible class; for example:
19866 class A { class B; };
19867 class A::B {};
19869 We do not know if we will see a class-name, or a
19870 template-name. We look for a class-name first, in case the
19871 class-name is a template-id; if we looked for the
19872 template-name first we would stop after the template-name. */
19877 class_type,
19881 /* If that didn't work, ignore the nested-name-specifier. */
19883 {
19889 }
19890 /* If we could not find a corresponding TYPE, treat this
19891 declaration like an unqualified declaration. */
19894 /* Otherwise, count the number of templates used in TYPE and its
19895 containing scopes. */
19896 else
19897 {
19898 tree scope;
19910 }
19911 }
19912 /* Otherwise, the identifier is optional. */
19913 else
19914 {
19915 /* We don't know whether what comes next is a template-id,
19916 an identifier, or nothing at all. */
19918 /* Check for a template-id. */
19923 class_key,
19925 /* If that didn't work, it could still be an identifier. */
19927 {
19929 {
19932 }
19933 else
19935 }
19936 else
19937 {
19940 }
19941 }
19946 {
19948 class_key,
19950 }
19953 /* If it's not a `:' or a `{' then we can't really be looking at a
19954 class-head, since a class-head only appears as part of a
19955 class-specifier. We have to detect this situation before calling
19956 xref_tag, since that has irreversible side-effects. */
19958 {
19962 }
19964 /* At this point, we're going ahead with the class-specifier, even
19965 if some other problem occurs. */
19968 {
19973 }
19974 /* Issue the error about the overly-qualified name now. */
19976 {
19981 }
19983 {
19988 }
19990 {
19991 tree scope;
19993 /* Reject typedef-names in class heads. */
19995 {
19998 type);
20001 }
20003 /* Figure out in what scope the declaration is being placed. */
20005 /* If that scope does not contain the scope in which the
20006 class was originally declared, the program is invalid. */
20008 {
20011 "declaration of %qD in namespace %qD which does not "
20014 else
20020 }
20021 /* [dcl.meaning]
20023 A declarator-id shall not be qualified except for the
20024 definition of a ... nested class outside of its class
20025 ... [or] the definition or explicit instantiation of a
20026 class member of a namespace outside of its namespace. */
20028 {
20033 }
20034 }
20035 /* An explicit-specialization must be preceded by "template <>". If
20036 it is not, try to recover gracefully. */
20040 {
20044 /* Take the same action that would have been taken by
20045 cp_parser_explicit_specialization. */
20048 }
20049 /* There must be no "return" statements between this point and the
20050 end of this function; set "type "to the correct return value and
20051 use "goto done;" to return. */
20052 /* Make sure that the right number of template parameters were
20053 present. */
20057 {
20058 /* If something went wrong, there is no point in even trying to
20059 process the class-definition. */
20062 }
20064 /* Look up the type. */
20066 {
20070 {
20074 }
20075 else
20076 {
20079 }
20082 }
20084 {
20085 tree class_type;
20087 /* Given:
20089 template <typename T> struct S { struct T };
20090 template <typename T> struct S<T>::T { };
20092 we will get a TYPENAME_TYPE when processing the definition of
20093 `S::T'. We need to resolve it to the actual type before we
20094 try to define it. */
20096 {
20101 else
20102 {
20105 }
20106 }
20110 {
20113 }
20116 /* Enter the scope indicated by the nested-name-specifier. */
20118 /* Get the canonical version of this type. */
20120 /* Call push_template_decl if it seems like we should be defining a
20121 template either from the template headers or the type we're
20122 defining, so that we diagnose both extra and missing headers. */
20128 {
20131 {
20134 }
20135 }
20139 }
20141 {
20142 /* If the class was unnamed, create a dummy name. */
20147 }
20149 /* Indicate whether this class was declared as a `class' or as a
20150 `struct'. */
20155 /* If this type was already complete, and we see another definition,
20156 that's an error. */
20158 {
20160 type);
20162 type);
20165 }
20170 {
20171 /* Apply attributes now, before any use of the class as a template
20172 argument in its base list. */
20175 }
20177 /* We will have entered the scope containing the class; the names of
20178 base classes should be looked up in that context. For example:
20180 struct A { struct B {}; struct C; };
20181 struct A::C : B {};
20183 is valid. */
20185 /* Get the list of base-classes, if there is one. */
20187 {
20188 /* PR59482: enter the class scope so that base-specifiers are looked
20189 up correctly. */
20193 /* PR59482: get out of the previously pushed class scope so that the
20194 subsequent pops pop the right thing. */
20197 }
20198 else
20201 /* If we're really defining a class, process the base classes.
20202 If they're invalid, fail. */
20207 done:
20208 /* Leave the scope given by the nested-name-specifier. We will
20209 enter the class scope itself while processing the members. */
20214 {
20217 }
20223 out:
20226 }
20228 /* Parse a class-key.
20230 class-key:
20231 class
20232 struct
20233 union
20235 Returns the kind of class-key specified, or none_type to indicate
20236 error. */
20238 static enum tag_types
20240 {
20244 /* Look for the class-key. */
20249 /* Check to see if the TOKEN is a class-key. */
20254 }
20256 /* Parse a type-parameter-key.
20258 type-parameter-key:
20259 class
20260 typename
20261 */
20263 static void
20265 {
20266 /* Look for the type-parameter-key. */
20270 {
20273 /* typename is not allowed in a template template parameter
20274 by the standard until C++1Z. */
20276 "ISO C++ forbids typename key in template template parameter;"
20278 }
20279 else
20283 }
20285 /* Parse an (optional) member-specification.
20287 member-specification:
20288 member-declaration member-specification [opt]
20289 access-specifier : member-specification [opt] */
20291 static void
20293 {
20295 {
20299 /* Peek at the next token. */
20301 /* If it's a `}', or EOF then we've seen all the members. */
20307 /* See if this token is a keyword. */
20310 {
20314 /* Consume the access-specifier. */
20316 /* Remember which access-specifier is active. */
20318 /* Look for the `:'. */
20323 /* Accept #pragmas at class scope. */
20325 {
20328 }
20330 /* Otherwise, the next construction must be a
20331 member-declaration. */
20333 }
20334 }
20335 }
20337 /* Parse a member-declaration.
20339 member-declaration:
20340 decl-specifier-seq [opt] member-declarator-list [opt] ;
20341 function-definition ; [opt]
20342 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20343 using-declaration
20344 template-declaration
20345 alias-declaration
20347 member-declarator-list:
20348 member-declarator
20349 member-declarator-list , member-declarator
20351 member-declarator:
20352 declarator pure-specifier [opt]
20353 declarator constant-initializer [opt]
20354 identifier [opt] : constant-expression
20356 GNU Extensions:
20358 member-declaration:
20359 __extension__ member-declaration
20361 member-declarator:
20362 declarator attributes [opt] pure-specifier [opt]
20363 declarator attributes [opt] constant-initializer [opt]
20364 identifier [opt] attributes [opt] : constant-expression
20366 C++0x Extensions:
20368 member-declaration:
20369 static_assert-declaration */
20371 static void
20373 {
20374 cp_decl_specifier_seq decl_specifiers;
20375 tree prefix_attributes;
20376 tree decl;
20385 /* Check for the `__extension__' keyword. */
20387 {
20388 /* Recurse. */
20390 /* Restore the old value of the PEDANTIC flag. */
20394 }
20396 /* Check for a template-declaration. */
20398 {
20399 /* An explicit specialization here is an error condition, and we
20400 expect the specialization handler to detect and report this. */
20404 else
20408 }
20410 /* Check for a using-declaration. */
20412 {
20414 {
20415 /* Parse the using-declaration. */
20419 }
20420 else
20421 {
20422 tree decl;
20426 /* Note that if we actually see the '=' token after the
20427 identifier, cp_parser_alias_declaration commits the
20428 tentative parse. In that case, we really expects an
20429 alias-declaration. Otherwise, we expect a using
20430 declaration. */
20431 alias_decl_expected =
20437 else
20441 }
20442 }
20444 /* Check for @defs. */
20446 {
20451 {
20456 }
20458 }
20460 /* If the next token is `static_assert' we have a static assertion. */
20462 {
20465 }
20472 /* Parse the decl-specifier-seq. */
20475 CP_PARSER_FLAGS_OPTIONAL,
20478 /* Check for an invalid type-name. */
20482 /* If there is no declarator, then the decl-specifier-seq should
20483 specify a type. */
20485 {
20486 /* If there was no decl-specifier-seq, and the next token is a
20487 `;', then we have something like:
20489 struct S { ; };
20491 [class.mem]
20493 Each member-declaration shall declare at least one member
20494 name of the class. */
20496 {
20500 }
20501 else
20502 {
20503 tree type;
20505 /* See if this declaration is a friend. */
20507 /* If there were decl-specifiers, check to see if there was
20508 a class-declaration. */
20511 /* Nested classes have already been added to the class, but
20512 a `friend' needs to be explicitly registered. */
20514 {
20515 /* If the `friend' keyword was present, the friend must
20516 be introduced with a class-key. */
20519 "in C++03 a class-key must be used "
20521 /* In this case:
20523 template <typename T> struct A {
20524 friend struct A<T>::B;
20525 };
20527 A<T>::B will be represented by a TYPENAME_TYPE, and
20528 therefore not recognized by check_tag_decl. */
20530 {
20534 }
20537 "friend declaration does not name a class or "
20539 else
20542 }
20543 /* If there is no TYPE, an error message will already have
20544 been issued. */
20546 ;
20547 /* An anonymous aggregate has to be handled specially; such
20548 a declaration really declares a data member (with a
20549 particular type), as opposed to a nested class. */
20551 {
20552 /* C++11 9.5/6. */
20555 "a storage class on an anonymous aggregate "
20558 /* Remove constructors and such from TYPE, now that we
20559 know it is an anonymous aggregate. */
20561 /* And make the corresponding data member. */
20564 /* Add it to the class. */
20566 }
20567 else
20568 cp_parser_check_access_in_redeclaration
20571 }
20572 }
20573 else
20574 {
20577 /* Clear attributes from the decl_specifiers but keep them
20578 around as prefix attributes that apply them to the entity
20579 being declared. */
20583 /* See if these declarations will be friends. */
20586 /* Keep going until we hit the `;' at the end of the
20587 declaration. */
20589 {
20591 tree first_attribute;
20593 /* Peek at the next token. */
20596 /* Check for a bitfield declaration. */
20601 {
20602 tree identifier;
20603 tree width;
20605 /* Get the name of the bitfield. Note that we cannot just
20606 check TOKEN here because it may have been invalidated by
20607 the call to cp_lexer_peek_nth_token above. */
20610 else
20613 /* Consume the `:' token. */
20615 /* Get the width of the bitfield. */
20616 width
20619 NULL);
20621 /* Look for attributes that apply to the bitfield. */
20623 /* Remember which attributes are prefix attributes and
20624 which are not. */
20626 /* Combine the attributes. */
20629 /* Create the bitfield declaration. */
20632 identifier,
20633 sfk_none)
20636 width,
20637 attributes);
20638 }
20639 else
20640 {
20642 tree initializer;
20643 tree asm_specification;
20646 /* Parse the declarator. */
20647 declarator
20652 friend_p);
20654 /* If something went wrong parsing the declarator, make sure
20655 that we at least consume some tokens. */
20657 {
20658 /* Skip to the end of the statement. */
20660 /* If the next token is not a semicolon, that is
20661 probably because we just skipped over the body of
20662 a function. So, we consume a semicolon if
20663 present, but do not issue an error message if it
20664 is not present. */
20666 CPP_SEMICOLON))
20669 }
20672 cp_parser_check_for_definition_in_return_type
20676 /* Look for an asm-specification. */
20678 /* Look for attributes that apply to the declaration. */
20680 /* Remember which attributes are prefix attributes and
20681 which are not. */
20683 /* Combine the attributes. */
20686 /* If it's an `=', then we have a constant-initializer or a
20687 pure-specifier. It is not correct to parse the
20688 initializer before registering the member declaration
20689 since the member declaration should be in scope while
20690 its initializer is processed. However, the rest of the
20691 front end does not yet provide an interface that allows
20692 us to handle this correctly. */
20694 {
20695 /* In [class.mem]:
20697 A pure-specifier shall be used only in the declaration of
20698 a virtual function.
20700 A member-declarator can contain a constant-initializer
20701 only if it declares a static member of integral or
20702 enumeration type.
20704 Therefore, if the DECLARATOR is for a function, we look
20705 for a pure-specifier; otherwise, we look for a
20706 constant-initializer. When we call `grokfield', it will
20707 perform more stringent semantics checks. */
20719 {
20721 /* Don't require a constant rvalue in C++11, since we
20722 might want a reference constant. We'll enforce
20723 constancy later. */
20725 /* Parse the initializer. */
20728 }
20729 else
20730 /* Parse the initializer. */
20732 }
20735 {
20739 else
20741 }
20742 /* Otherwise, there is no initializer. */
20743 else
20746 /* See if we are probably looking at a function
20747 definition. We are certainly not looking at a
20748 member-declarator. Calling `grokfield' has
20749 side-effects, so we must not do it unless we are sure
20750 that we are looking at a member-declarator. */
20753 {
20754 /* The grammar does not allow a pure-specifier to be
20755 used when a member function is defined. (It is
20756 possible that this fact is an oversight in the
20757 standard, since a pure function may be defined
20758 outside of the class-specifier. */
20764 declarator,
20765 attributes);
20768 /* If the member was not a friend, declare it here. */
20771 /* Peek at the next token. */
20773 /* If the next token is a semicolon, consume it. */
20777 }
20778 else
20781 /* Create the declaration. */
20786 {
20789 else
20791 }
20792 }
20796 /* Reset PREFIX_ATTRIBUTES. */
20802 /* If there is any qualification still in effect, clear it
20803 now; we will be starting fresh with the next declarator. */
20807 /* If it's a `,', then there are more declarators. */
20809 {
20812 {
20816 }
20817 }
20818 /* If the next token isn't a `;', then we have a parse error. */
20820 CPP_SEMICOLON))
20821 {
20822 /* The next token might be a ways away from where the
20823 actual semicolon is missing. Find the previous token
20824 and use that for our error position. */
20829 /* Assume that the user meant to provide a semicolon. If
20830 we were to cp_parser_skip_to_end_of_statement, we might
20831 skip to a semicolon inside a member function definition
20832 and issue nonsensical error messages. */
20834 }
20837 {
20838 /* Add DECL to the list of members. */
20847 /* Add DECL to the queue of NSDMI to be parsed later. */
20849 }
20853 }
20854 }
20857 out:
20859 }
20861 /* Parse a pure-specifier.
20863 pure-specifier:
20864 = 0
20866 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20867 Otherwise, ERROR_MARK_NODE is returned. */
20869 static tree
20871 {
20874 /* Look for the `=' token. */
20877 /* Look for the `0' token. */
20886 /* Accept = default or = delete in c++0x mode. */
20889 {
20892 }
20894 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20896 {
20901 }
20903 {
20906 }
20909 }
20911 /* Parse a constant-initializer.
20913 constant-initializer:
20914 = constant-expression
20916 Returns a representation of the constant-expression. */
20918 static tree
20920 {
20921 /* Look for the `=' token. */
20925 /* It is invalid to write:
20927 struct S { static const int i = { 7 }; };
20929 */
20931 {
20934 /* Consume the opening brace. */
20936 /* Skip the initializer. */
20938 /* Look for the trailing `}'. */
20942 }
20946 NULL);
20947 }
20949 /* Derived classes [gram.class.derived] */
20951 /* Parse a base-clause.
20953 base-clause:
20954 : base-specifier-list
20956 base-specifier-list:
20957 base-specifier ... [opt]
20958 base-specifier-list , base-specifier ... [opt]
20960 Returns a TREE_LIST representing the base-classes, in the order in
20961 which they were declared. The representation of each node is as
20962 described by cp_parser_base_specifier.
20964 In the case that no bases are specified, this function will return
20965 NULL_TREE, not ERROR_MARK_NODE. */
20967 static tree
20969 {
20972 /* Look for the `:' that begins the list. */
20975 /* Scan the base-specifier-list. */
20977 {
20979 tree base;
20982 /* Look for the base-specifier. */
20984 /* Look for the (optional) ellipsis. */
20986 {
20987 /* Consume the `...'. */
20991 }
20993 /* Add BASE to the front of the list. */
20995 {
20997 /* Make this a pack expansion type. */
21001 {
21004 }
21005 }
21006 /* Peek at the next token. */
21008 /* If it's not a comma, then the list is complete. */
21011 /* Consume the `,'. */
21013 }
21015 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21016 base class had a qualified name. However, the next name that
21017 appears is certainly not qualified. */
21023 }
21025 /* Parse a base-specifier.
21027 base-specifier:
21028 :: [opt] nested-name-specifier [opt] class-name
21029 virtual access-specifier [opt] :: [opt] nested-name-specifier
21030 [opt] class-name
21031 access-specifier virtual [opt] :: [opt] nested-name-specifier
21032 [opt] class-name
21034 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21035 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21036 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21037 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21039 static tree
21041 {
21049 tree type;
21051 /* Process the optional `virtual' and `access-specifier'. */
21053 {
21054 /* Peek at the next token. */
21056 /* Process `virtual'. */
21058 {
21060 /* If `virtual' appears more than once, issue an error. */
21062 {
21066 }
21070 /* Consume the `virtual' token. */
21078 /* If more than one access specifier appears, issue an
21079 error. */
21082 {
21086 }
21090 /* Consume the access-specifier. */
21098 }
21099 }
21100 /* It is not uncommon to see programs mechanically, erroneously, use
21101 the 'typename' keyword to denote (dependent) qualified types
21102 as base classes. */
21104 {
21109 else
21111 "keyword %<typename%> not allowed in this context "
21114 }
21116 /* Look for the optional `::' operator. */
21118 /* Look for the nested-name-specifier. The simplest way to
21119 implement:
21121 [temp.res]
21123 The keyword `typename' is not permitted in a base-specifier or
21124 mem-initializer; in these contexts a qualified name that
21125 depends on a template-parameter is implicitly assumed to be a
21126 type name.
21128 is to pretend that we have seen the `typename' keyword at this
21129 point. */
21133 typename_type,
21135 /* If the base class is given by a qualified name, assume that names
21136 we see are type names or templates, as appropriate. */
21142 /* DR 950 allows decltype as a base-specifier. */
21144 else
21145 {
21146 /* Otherwise, look for the class-name. */
21148 class_scope_p,
21149 template_p,
21150 typename_type,
21155 }
21161 }
21163 /* Exception handling [gram.exception] */
21165 /* Parse an (optional) noexcept-specification.
21167 noexcept-specification:
21168 noexcept ( constant-expression ) [opt]
21170 If no noexcept-specification is present, returns NULL_TREE.
21171 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21172 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21173 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21174 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21175 in which case a boolean condition is returned instead. */
21177 static tree
21182 {
21186 /* Peek at the next token. */
21189 /* Is it a noexcept-specification? */
21191 {
21192 tree expr;
21196 {
21200 {
21201 /* Types may not be defined in an exception-specification. */
21203 parser->type_definition_forbidden_message
21208 /* Restore the saved message. */
21210 }
21211 else
21212 {
21215 }
21218 }
21219 else
21220 {
21224 }
21226 /* We cannot build a noexcept-spec right away because this will check
21227 that expr is a constexpr. */
21230 else
21232 }
21233 else
21235 }
21237 /* Parse an (optional) exception-specification.
21239 exception-specification:
21240 throw ( type-id-list [opt] )
21242 Returns a TREE_LIST representing the exception-specification. The
21243 TREE_VALUE of each node is a type. */
21245 static tree
21247 {
21249 tree type_id_list;
21252 /* Peek at the next token. */
21255 /* Is it a noexcept-specification? */
21261 /* If it's not `throw', then there's no exception-specification. */
21265 #if 0
21266 /* Enable this once a lot of code has transitioned to noexcept? */
21270 #endif
21272 /* Consume the `throw'. */
21275 /* Look for the `('. */
21278 /* Peek at the next token. */
21280 /* If it's not a `)', then there is a type-id-list. */
21282 {
21283 /* Types may not be defined in an exception-specification. */
21285 parser->type_definition_forbidden_message
21287 /* Parse the type-id-list. */
21289 /* Restore the saved message. */
21291 }
21292 else
21295 /* Look for the `)'. */
21299 }
21301 /* Parse an (optional) type-id-list.
21303 type-id-list:
21304 type-id ... [opt]
21305 type-id-list , type-id ... [opt]
21307 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21308 in the order that the types were presented. */
21310 static tree
21312 {
21316 {
21318 tree type;
21320 /* Get the next type-id. */
21322 /* Parse the optional ellipsis. */
21324 {
21325 /* Consume the `...'. */
21328 /* Turn the type into a pack expansion expression. */
21330 }
21331 /* Add it to the list. */
21333 /* Peek at the next token. */
21335 /* If it is not a `,', we are done. */
21338 /* Consume the `,'. */
21340 }
21343 }
21345 /* Parse a try-block.
21347 try-block:
21348 try compound-statement handler-seq */
21350 static tree
21352 {
21353 tree try_block;
21363 }
21365 /* Parse a function-try-block.
21367 function-try-block:
21368 try ctor-initializer [opt] function-body handler-seq */
21370 static bool
21372 {
21373 tree compound_stmt;
21374 tree try_block;
21377 /* Look for the `try' keyword. */
21380 /* Let the rest of the front end know where we are. */
21382 /* Parse the function-body. */
21383 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21385 /* We're done with the `try' part. */
21387 /* Parse the handlers. */
21389 /* We're done with the handlers. */
21393 }
21395 /* Parse a handler-seq.
21397 handler-seq:
21398 handler handler-seq [opt] */
21400 static void
21402 {
21404 {
21407 /* Parse the handler. */
21409 /* Peek at the next token. */
21411 /* If it's not `catch' then there are no more handlers. */
21414 }
21415 }
21417 /* Parse a handler.
21419 handler:
21420 catch ( exception-declaration ) compound-statement */
21422 static void
21424 {
21425 tree handler;
21426 tree declaration;
21436 }
21438 /* Parse an exception-declaration.
21440 exception-declaration:
21441 type-specifier-seq declarator
21442 type-specifier-seq abstract-declarator
21443 type-specifier-seq
21444 ...
21446 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21447 ellipsis variant is used. */
21449 static tree
21451 {
21452 cp_decl_specifier_seq type_specifiers;
21456 /* If it's an ellipsis, it's easy to handle. */
21458 {
21459 /* Consume the `...' token. */
21462 }
21464 /* Types may not be defined in exception-declarations. */
21466 parser->type_definition_forbidden_message
21469 /* Parse the type-specifier-seq. */
21473 /* If it's a `)', then there is no declarator. */
21476 else
21483 /* Restore the saved message. */
21490 }
21492 /* Parse a throw-expression.
21494 throw-expression:
21495 throw assignment-expression [opt]
21497 Returns a THROW_EXPR representing the throw-expression. */
21499 static tree
21501 {
21502 tree expression;
21507 /* Figure out whether or not there is an assignment-expression
21508 following the "throw" keyword. */
21516 else
21521 }
21523 /* GNU Extensions */
21525 /* Parse an (optional) asm-specification.
21527 asm-specification:
21528 asm ( string-literal )
21530 If the asm-specification is present, returns a STRING_CST
21531 corresponding to the string-literal. Otherwise, returns
21532 NULL_TREE. */
21534 static tree
21536 {
21538 tree asm_specification;
21540 /* Peek at the next token. */
21542 /* If the next token isn't the `asm' keyword, then there's no
21543 asm-specification. */
21547 /* Consume the `asm' token. */
21549 /* Look for the `('. */
21552 /* Look for the string-literal. */
21555 /* Look for the `)'. */
21559 }
21561 /* Parse an asm-operand-list.
21563 asm-operand-list:
21564 asm-operand
21565 asm-operand-list , asm-operand
21567 asm-operand:
21568 string-literal ( expression )
21569 [ string-literal ] string-literal ( expression )
21571 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21572 each node is the expression. The TREE_PURPOSE is itself a
21573 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21574 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21575 is a STRING_CST for the string literal before the parenthesis. Returns
21576 ERROR_MARK_NODE if any of the operands are invalid. */
21578 static tree
21580 {
21585 {
21586 tree string_literal;
21587 tree expression;
21588 tree name;
21591 {
21592 /* Consume the `[' token. */
21594 /* Read the operand name. */
21599 /* Look for the closing `]'. */
21601 }
21602 else
21604 /* Look for the string-literal. */
21607 /* Look for the `('. */
21609 /* Parse the expression. */
21611 /* Look for the `)'. */
21619 /* Add this operand to the list. */
21621 expression,
21622 asm_operands);
21623 /* If the next token is not a `,', there are no more
21624 operands. */
21627 /* Consume the `,'. */
21629 }
21632 }
21634 /* Parse an asm-clobber-list.
21636 asm-clobber-list:
21637 string-literal
21638 asm-clobber-list , string-literal
21640 Returns a TREE_LIST, indicating the clobbers in the order that they
21641 appeared. The TREE_VALUE of each node is a STRING_CST. */
21643 static tree
21645 {
21649 {
21650 tree string_literal;
21652 /* Look for the string literal. */
21654 /* Add it to the list. */
21656 /* If the next token is not a `,', then the list is
21657 complete. */
21660 /* Consume the `,' token. */
21662 }
21665 }
21667 /* Parse an asm-label-list.
21669 asm-label-list:
21670 identifier
21671 asm-label-list , identifier
21673 Returns a TREE_LIST, indicating the labels in the order that they
21674 appeared. The TREE_VALUE of each node is a label. */
21676 static tree
21678 {
21682 {
21685 /* Look for the identifier. */
21688 {
21691 {
21697 }
21698 }
21699 /* If the next token is not a `,', then the list is
21700 complete. */
21703 /* Consume the `,' token. */
21705 }
21708 }
21710 /* Return TRUE iff the next tokens in the stream are possibly the
21711 beginning of a GNU extension attribute. */
21713 static bool
21715 {
21717 }
21719 /* Return TRUE iff the next tokens in the stream are possibly the
21720 beginning of a standard C++-11 attribute specifier. */
21722 static bool
21724 {
21726 }
21728 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21729 beginning of a standard C++-11 attribute specifier. */
21731 static bool
21733 {
21741 }
21743 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21744 beginning of a GNU extension attribute. */
21746 static bool
21748 {
21752 }
21754 /* Return true iff the next tokens can be the beginning of either a
21755 GNU attribute list, or a standard C++11 attribute sequence. */
21757 static bool
21759 {
21762 }
21764 /* Return true iff the next Nth tokens can be the beginning of either
21765 a GNU attribute list, or a standard C++11 attribute sequence. */
21767 static bool
21769 {
21772 }
21774 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21775 of GNU attributes, or return NULL. */
21777 static tree
21779 {
21783 }
21785 #define CILK_SIMD_FN_CLAUSE_MASK \
21786 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21787 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21788 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21789 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21790 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21792 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21793 vector [(<clauses>)] */
21795 static void
21797 {
21801 {
21806 }
21809 {
21812 paren_scope++;
21813 }
21815 {
21818 paren_scope++;
21820 paren_scope--;
21821 /* Do not push the last ')' */
21824 }
21833 }
21835 /* Parse an (optional) series of attributes.
21837 attributes:
21838 attributes attribute
21840 attribute:
21841 __attribute__ (( attribute-list [opt] ))
21843 The return value is as for cp_parser_gnu_attribute_list. */
21845 static tree
21847 {
21851 {
21853 tree attribute_list;
21856 /* Peek at the next token. */
21858 /* If it's not `__attribute__', then we're done. */
21862 /* Consume the `__attribute__' keyword. */
21864 /* Look for the two `(' tokens. */
21868 /* Peek at the next token. */
21871 /* Parse the attribute-list. */
21873 else
21874 /* If the next token is a `)', then there is no attribute
21875 list. */
21878 /* Look for the two `)' tokens. */
21886 /* Add these new attributes to the list. */
21888 }
21891 }
21893 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21894 "__vector" or "__vector__." */
21898 {
21902 }
21904 /* Parse a GNU attribute-list.
21906 attribute-list:
21907 attribute
21908 attribute-list , attribute
21910 attribute:
21911 identifier
21912 identifier ( identifier )
21913 identifier ( identifier , expression-list )
21914 identifier ( expression-list )
21916 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21917 to an attribute. The TREE_PURPOSE of each node is the identifier
21918 indicating which attribute is in use. The TREE_VALUE represents
21919 the arguments, if any. */
21921 static tree
21923 {
21929 {
21931 tree identifier;
21932 tree attribute;
21934 /* Look for the identifier. We also allow keywords here; for
21935 example `__attribute__ ((const))' is legal. */
21939 {
21942 /* Consume the token, but save it since we need it for the
21943 SIMD enabled function parsing. */
21946 /* Save away the identifier that indicates which attribute
21947 this is. */
21949 /* For keywords, use the canonical spelling, not the
21950 parsed identifier. */
21956 /* Peek at the next token. */
21958 /* If it's an `(', then parse the attribute arguments. */
21960 {
21965 {
21968 }
21969 else
21970 vec = cp_parser_parenthesized_expression_list
21976 else
21977 {
21980 }
21981 /* Save the arguments away. */
21983 }
21985 {
21988 }
21991 {
21992 /* Add this attribute to the list. */
21995 }
21998 }
21999 /* Now, look for more attributes. If the next token isn't a
22000 `,', we're done. */
22004 /* Consume the comma and keep going. */
22006 }
22009 /* We built up the list in reverse order. */
22011 }
22013 /* Parse a standard C++11 attribute.
22015 The returned representation is a TREE_LIST which TREE_PURPOSE is
22016 the scoped name of the attribute, and the TREE_VALUE is its
22017 arguments list.
22019 Note that the scoped name of the attribute is itself a TREE_LIST
22020 which TREE_PURPOSE is the namespace of the attribute, and
22021 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22022 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22023 and which TREE_PURPOSE is directly the attribute name.
22025 Clients of the attribute code should use get_attribute_namespace
22026 and get_attribute_name to get the actual namespace and name of
22027 attributes, regardless of their being GNU or C++11 attributes.
22029 attribute:
22030 attribute-token attribute-argument-clause [opt]
22032 attribute-token:
22033 identifier
22034 attribute-scoped-token
22036 attribute-scoped-token:
22037 attribute-namespace :: identifier
22039 attribute-namespace:
22040 identifier
22042 attribute-argument-clause:
22043 ( balanced-token-seq )
22045 balanced-token-seq:
22046 balanced-token [opt]
22047 balanced-token-seq balanced-token
22049 balanced-token:
22050 ( balanced-token-seq )
22051 [ balanced-token-seq ]
22052 { balanced-token-seq }. */
22054 static tree
22056 {
22060 /* First, parse name of the the attribute, a.k.a
22061 attribute-token. */
22078 {
22079 /* We are seeing a scoped attribute token. */
22089 else
22090 {
22094 }
22096 NULL_TREE);
22098 }
22099 else
22100 {
22102 NULL_TREE);
22103 /* C++11 noreturn attribute is equivalent to GNU's. */
22106 /* C++14 deprecated attribute is equivalent to GNU's. */
22109 }
22111 /* Now parse the optional argument clause of the attribute. */
22116 {
22122 /* A GNU attribute that takes an identifier in parameter. */
22125 vec = cp_parser_parenthesized_expression_list
22131 else
22132 {
22135 }
22139 else
22141 }
22144 }
22146 /* Parse a list of standard C++-11 attributes.
22148 attribute-list:
22149 attribute [opt]
22150 attribute-list , attribute[opt]
22151 attribute ...
22152 attribute-list , attribute ...
22153 */
22155 static tree
22157 {
22162 {
22167 {
22170 }
22175 }
22178 }
22180 /* Parse a standard C++-11 attribute specifier.
22182 attribute-specifier:
22183 [ [ attribute-list ] ]
22184 alignment-specifier
22186 alignment-specifier:
22187 alignas ( type-id ... [opt] )
22188 alignas ( alignment-expression ... [opt] ). */
22190 static tree
22192 {
22198 {
22207 else
22208 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22209 when we are sure that we have actually parsed them. */
22211 }
22212 else
22213 {
22214 tree alignas_expr;
22216 /* Look for an alignment-specifier. */
22228 {
22231 }
22237 {
22241 alignas_expr =
22249 }
22252 {
22255 }
22259 /* Build the C++-11 representation of an 'aligned'
22260 attribute. */
22261 attributes =
22265 }
22268 }
22270 /* Parse a standard C++-11 attribute-specifier-seq.
22272 attribute-specifier-seq:
22273 attribute-specifier-seq [opt] attribute-specifier
22274 */
22276 static tree
22278 {
22282 {
22291 }
22295 }
22297 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22298 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22299 current value of the PEDANTIC flag, regardless of whether or not
22300 the `__extension__' keyword is present. The caller is responsible
22301 for restoring the value of the PEDANTIC flag. */
22303 static bool
22305 {
22306 /* Save the old value of the PEDANTIC flag. */
22310 {
22311 /* Consume the `__extension__' token. */
22313 /* We're not being pedantic while the `__extension__' keyword is
22314 in effect. */
22318 }
22321 }
22323 /* Parse a label declaration.
22325 label-declaration:
22326 __label__ label-declarator-seq ;
22328 label-declarator-seq:
22329 identifier , label-declarator-seq
22330 identifier */
22332 static void
22334 {
22335 /* Look for the `__label__' keyword. */
22339 {
22340 tree identifier;
22342 /* Look for an identifier. */
22344 /* If we failed, stop. */
22347 /* Declare it as a label. */
22349 /* If the next token is a `;', stop. */
22352 /* Look for the `,' separating the label declarations. */
22354 }
22356 /* Look for the final `;'. */
22358 }
22360 /* Support Functions */
22362 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22363 NAME should have one of the representations used for an
22364 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22365 is returned. If PARSER->SCOPE is a dependent type, then a
22366 SCOPE_REF is returned.
22368 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22369 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22370 was formed. Abstractly, such entities should not be passed to this
22371 function, because they do not need to be looked up, but it is
22372 simpler to check for this special case here, rather than at the
22373 call-sites.
22375 In cases not explicitly covered above, this function returns a
22376 DECL, OVERLOAD, or baselink representing the result of the lookup.
22377 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22378 is returned.
22380 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22381 (e.g., "struct") that was used. In that case bindings that do not
22382 refer to types are ignored.
22384 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22385 ignored.
22387 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22388 are ignored.
22390 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22391 types.
22393 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22394 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22395 NULL_TREE otherwise. */
22397 static tree
22404 location_t name_location)
22405 {
22406 tree decl;
22409 /* Assume that the lookup will be unambiguous. */
22413 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22414 no longer valid. Note that if we are parsing tentatively, and
22415 the parse fails, OBJECT_TYPE will be automatically restored. */
22421 /* A template-id has already been resolved; there is no lookup to
22422 do. */
22426 {
22430 }
22432 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22433 it should already have been checked to make sure that the name
22434 used matches the type being destroyed. */
22436 {
22437 tree type;
22439 /* Figure out to which type this destructor applies. */
22444 else
22446 /* If that's not a class type, there is no destructor. */
22453 /* If it was a class type, return the destructor. */
22455 }
22457 /* By this point, the NAME should be an ordinary identifier. If
22458 the id-expression was a qualified name, the qualifying scope is
22459 stored in PARSER->SCOPE at this point. */
22462 /* Perform the lookup. */
22464 {
22470 /* If the SCOPE is dependent, the lookup must be deferred until
22471 the template is instantiated -- unless we are explicitly
22472 looking up names in uninstantiated templates. Even then, we
22473 cannot look up the name if the scope is not a class type; it
22474 might, for example, be a template type parameter. */
22479 /* Defer lookup. */
22481 else
22482 {
22485 /* If PARSER->SCOPE is a dependent type, then it must be a
22486 class type, and we must not be checking dependencies;
22487 otherwise, we would have processed this lookup above. So
22488 that PARSER->SCOPE is not considered a dependent base by
22489 lookup_member, we must enter the scope here. */
22493 /* If the PARSER->SCOPE is a template specialization, it
22494 may be instantiated during name lookup. In that case,
22495 errors may be issued. Even if we rollback the current
22496 tentative parse, those errors are valid. */
22501 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22502 lookup result and the nested-name-specifier nominates a class C:
22503 * if the name specified after the nested-name-specifier, when
22504 looked up in C, is the injected-class-name of C (Clause 9), or
22505 * if the name specified after the nested-name-specifier is the
22506 same as the identifier or the simple-template-id's template-
22507 name in the last component of the nested-name-specifier,
22508 the name is instead considered to name the constructor of
22509 class C. [ Note: for example, the constructor is not an
22510 acceptable lookup result in an elaborated-type-specifier so
22511 the constructor would not be used in place of the
22512 injected-class-name. --end note ] Such a constructor name
22513 shall be used only in the declarator-id of a declaration that
22514 names a constructor or in a using-declaration. */
22522 /* If we have a single function from a using decl, pull it out. */
22529 }
22531 /* If the scope is a dependent type and either we deferred lookup or
22532 we did lookup but didn't find the name, rememeber the name. */
22535 {
22537 {
22538 tree type;
22540 /* The resolution to Core Issue 180 says that `struct
22541 A::B' should be considered a type-name, even if `A'
22542 is dependent. */
22547 }
22551 CPP_CLOSE_PAREN)))
22555 else
22558 is_template);
22559 }
22562 }
22564 {
22565 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22566 OBJECT_TYPE is not a class. */
22568 /* If the OBJECT_TYPE is a template specialization, it may
22569 be instantiated during name lookup. In that case, errors
22570 may be issued. Even if we rollback the current tentative
22571 parse, those errors are valid. */
22573 name,
22576 tf_warning_or_error);
22577 else
22581 /* Look it up in the enclosing context. */
22587 }
22588 else
22589 {
22595 }
22597 /* If the lookup failed, let our caller know. */
22601 /* Pull out the template from an injected-class-name (or multiple). */
22605 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22607 {
22610 /* The error message we have to print is too complicated for
22611 cp_parser_error, so we incorporate its actions directly. */
22613 {
22615 name);
22617 }
22619 }
22627 /* If we have resolved the name of a member declaration, check to
22628 see if the declaration is accessible. When the name resolves to
22629 set of overloaded functions, accessibility is checked when
22630 overload resolution is done.
22632 During an explicit instantiation, access is not checked at all,
22633 as per [temp.explicit]. */
22640 }
22642 /* Like cp_parser_lookup_name, but for use in the typical case where
22643 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22644 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22646 static tree
22648 {
22650 none_type,
22655 location);
22656 }
22658 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22659 the current context, return the TYPE_DECL. If TAG_NAME_P is
22660 true, the DECL indicates the class being defined in a class-head,
22661 or declared in an elaborated-type-specifier.
22663 Otherwise, return DECL. */
22665 static tree
22667 {
22668 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22669 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22671 struct A {
22672 template <typename T> struct B;
22673 };
22675 template <typename T> struct A::B {};
22677 Similarly, in an elaborated-type-specifier:
22679 namespace N { struct X{}; }
22681 struct A {
22682 template <typename T> friend struct N::X;
22683 };
22685 However, if the DECL refers to a class type, and we are in
22686 the scope of the class, then the name lookup automatically
22687 finds the TYPE_DECL created by build_self_reference rather
22688 than a TEMPLATE_DECL. For example, in:
22690 template <class T> struct S {
22691 S s;
22692 };
22694 there is no need to handle such case. */
22700 }
22702 /* If too many, or too few, template-parameter lists apply to the
22703 declarator, issue an error message. Returns TRUE if all went well,
22704 and FALSE otherwise. */
22706 static bool
22709 location_t declarator_location)
22710 {
22712 {
22714 {
22722 /* If the DECLARATOR has the form `X<y>' then it uses one
22723 additional level of template parameters. */
22726 return cp_parser_check_template_parameters
22728 }
22743 }
22745 }
22747 /* NUM_TEMPLATES were used in the current declaration. If that is
22748 invalid, return FALSE and issue an error messages. Otherwise,
22749 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22750 declarator and we can print more accurate diagnostics. */
22752 static bool
22755 location_t location,
22757 {
22758 /* If there are the same number of template classes and parameter
22759 lists, that's OK. */
22762 /* If there are more, but only one more, then we are referring to a
22763 member template. That's OK too. */
22766 /* If there are more template classes than parameter lists, we have
22767 something like:
22769 template <class T> void S<T>::R<T>::f (); */
22771 {
22781 else
22784 }
22785 /* Otherwise, there are too many template parameter lists. We have
22786 something like:
22788 template <class T> template <class U> void S::f(); */
22791 }
22793 /* Parse an optional `::' token indicating that the following name is
22794 from the global namespace. If so, PARSER->SCOPE is set to the
22795 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22796 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22797 Returns the new value of PARSER->SCOPE, if the `::' token is
22798 present, and NULL_TREE otherwise. */
22800 static tree
22802 {
22805 /* Peek at the next token. */
22807 /* If we're looking at a `::' token then we're starting from the
22808 global namespace, not our current location. */
22810 {
22811 /* Consume the `::' token. */
22813 /* Set the SCOPE so that we know where to start the lookup. */
22819 }
22821 {
22825 }
22828 }
22830 /* Returns TRUE if the upcoming token sequence is the start of a
22831 constructor declarator. If FRIEND_P is true, the declarator is
22832 preceded by the `friend' specifier. */
22834 static bool
22836 {
22839 tree nested_name_specifier;
22842 /* The common case is that this is not a constructor declarator, so
22843 try to avoid doing lots of work if at all possible. It's not
22844 valid declare a constructor at function scope. */
22847 /* And only certain tokens can begin a constructor declarator. */
22855 /* Parse tentatively; we are going to roll back all of the tokens
22856 consumed here. */
22858 /* Assume that we are looking at a constructor declarator. */
22861 /* Look for the optional `::' operator. */
22864 /* Look for the nested-name-specifier. */
22865 nested_name_specifier
22876 /* Outside of a class-specifier, there must be a
22877 nested-name-specifier. */
22883 /* If we have a class scope, this is easy; DR 147 says that S::S always
22884 names the constructor, and no other qualified name could. */
22887 {
22897 }
22898 /* If we still think that this might be a constructor-declarator,
22899 look for a class-name. */
22901 {
22902 /* If we have:
22904 template <typename T> struct S {
22905 S();
22906 };
22908 we must recognize that the nested `S' names a class. */
22909 tree type_decl;
22913 none_type,
22917 /* If there was no class-name, then this is not a constructor.
22918 Otherwise, if we are in a class-specifier and we aren't
22919 handling a friend declaration, check that its type matches
22920 current_class_type (c++/38313). Note: error_mark_node
22921 is left alone for error recovery purposes. */
22923 && (outside_class_specifier_p
22928 /* If we're still considering a constructor, we have to see a `(',
22929 to begin the parameter-declaration-clause, followed by either a
22930 `)', an `...', or a decl-specifier. We need to check for a
22931 type-specifier to avoid being fooled into thinking that:
22933 S (f) (int);
22935 is a constructor. (It is actually a function named `f' that
22936 takes one parameter (of type `int') and returns a value of type
22937 `S'. */
22945 /* A parameter declaration begins with a decl-specifier,
22946 which is either the "attribute" keyword, a storage class
22947 specifier, or (usually) a type-specifier. */
22949 {
22950 tree type;
22954 /* Names appearing in the type-specifier should be looked up
22955 in the scope of the class. */
22958 else
22959 {
22962 {
22966 {
22969 }
22970 }
22972 }
22974 /* Inside the constructor parameter list, surrounding
22975 template-parameter-lists do not apply. */
22976 saved_num_template_parameter_lists
22980 /* Look for the type-specifier. */
22982 CP_PARSER_FLAGS_NONE,
22988 parser->num_template_parameter_lists
22991 /* Leave the scope of the class. */
22996 }
22997 }
22999 /* We did not really want to consume any tokens. */
23003 }
23005 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23006 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23007 they must be performed once we are in the scope of the function.
23009 Returns the function defined. */
23011 static tree
23012 cp_parser_function_definition_from_specifiers_and_declarator
23015 tree attributes,
23017 {
23018 tree fn;
23021 /* Begin the function-definition. */
23024 /* The things we're about to see are not directly qualified by any
23025 template headers we've seen thus far. */
23028 /* If there were names looked up in the decl-specifier-seq that we
23029 did not check, check them now. We must wait until we are in the
23030 scope of the function to perform the checks, since the function
23031 might be a friend. */
23035 {
23038 }
23041 {
23042 /* Skip the entire function. */
23045 }
23047 {
23048 /* Seen already, skip it. An error message has already been output. */
23052 /* If this is a function from a class, pop the nested class. */
23055 }
23056 else
23057 {
23058 timevar_id_t tv;
23061 else
23067 }
23070 }
23072 /* Parse the part of a function-definition that follows the
23073 declarator. INLINE_P is TRUE iff this function is an inline
23074 function defined within a class-specifier.
23076 Returns the function defined. */
23078 static tree
23081 {
23082 tree fn;
23088 bool fully_implicit_function_template_p
23091 tree implicit_template_parms
23094 cp_binding_level* implicit_template_scope
23100 /* If the next token is `return', then the code may be trying to
23101 make use of the "named return value" extension that G++ used to
23102 support. */
23105 {
23106 /* Consume the `return' keyword. */
23108 /* Look for the identifier that indicates what value is to be
23109 returned. */
23111 /* Issue an error message. */
23114 /* Skip tokens until we reach the start of the function body. */
23116 {
23123 }
23124 }
23125 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23126 anything declared inside `f'. */
23127 saved_in_unbraced_linkage_specification_p
23130 /* Inside the function, surrounding template-parameter-lists do not
23131 apply. */
23132 saved_num_template_parameter_lists
23138 /* If the next token is `try', `__transaction_atomic', or
23139 `__transaction_relaxed`, then we are looking at either function-try-block
23140 or function-transaction-block. Note that all of these include the
23141 function-body. */
23144 RID_TRANSACTION_ATOMIC);
23146 RID_TRANSACTION_RELAXED))
23148 RID_TRANSACTION_RELAXED);
23151 else
23152 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23157 /* Finish the function. */
23160 /* Generate code for it, if necessary. */
23162 /* Restore the saved values. */
23163 parser->in_unbraced_linkage_specification_p
23165 parser->num_template_parameter_lists
23169 parser->fully_implicit_function_template_p
23171 parser->implicit_template_parms
23173 parser->implicit_template_scope
23180 }
23182 /* Parse a template-declaration, assuming that the `export' (and
23183 `extern') keywords, if present, has already been scanned. MEMBER_P
23184 is as for cp_parser_template_declaration. */
23186 static void
23188 {
23191 tree parameter_list;
23196 /* Look for the `template' keyword. */
23201 /* And the `<'. */
23205 {
23206 /* 14.5.2.2 [temp.mem]
23208 A local class shall not have member templates. */
23213 }
23214 /* [temp]
23216 A template ... shall not have C linkage. */
23218 {
23220 /* Give it C++ linkage to avoid confusing other parts of the
23221 front end. */
23224 }
23225 else
23228 /* We cannot perform access checks on the template parameter
23229 declarations until we know what is being declared, just as we
23230 cannot check the decl-specifier list. */
23233 /* If the next token is `>', then we have an invalid
23234 specialization. Rather than complain about an invalid template
23235 parameter, issue an error message here. */
23237 {
23241 }
23242 else
23243 {
23244 /* Parse the template parameters. */
23246 }
23248 /* Get the deferred access checks from the parameter list. These
23249 will be checked once we know what is being declared, as for a
23250 member template the checks must be performed in the scope of the
23251 class containing the member. */
23254 /* Look for the `>'. */
23256 /* We just processed one more parameter list. */
23258 /* If the next token is `template', there are more template
23259 parameters. */
23261 RID_TEMPLATE))
23266 else
23267 {
23268 /* There are no access checks when parsing a template, as we do not
23269 know if a specialization will be a friend. */
23273 checks,
23274 member_p,
23279 /* If this is a member template declaration, let the front
23280 end know. */
23282 {
23287 }
23292 }
23293 /* We are done with the current parameter list. */
23298 /* Finish up. */
23301 /* Check the template arguments for a literal operator template. */
23305 {
23309 else
23310 {
23313 {
23319 }
23321 {
23329 }
23330 else
23332 }
23334 {
23337 " Expected non-type template argument pack <char...>"
23339 decl);
23340 else
23343 decl);
23344 }
23345 }
23346 /* Register member declarations. */
23349 /* For the erroneous case of a template with C linkage, we pushed an
23350 implicit C++ linkage scope; exit that scope now. */
23353 /* If DECL is a function template, we must return to parse it later.
23354 (Even though there is no definition, there might be default
23355 arguments that need handling.) */
23359 }
23361 /* Perform the deferred access checks from a template-parameter-list.
23362 CHECKS is a TREE_LIST of access checks, as returned by
23363 get_deferred_access_checks. */
23365 static void
23366 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23367 {
23371 }
23373 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23374 `function-definition' sequence that follows a template header.
23375 If MEMBER_P is true, this declaration appears in a class scope.
23377 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23378 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23380 static tree
23386 {
23389 cp_decl_specifier_seq decl_specifiers;
23393 /* This function is only used when processing a template
23394 declaration. */
23398 /* Defer access checks until we know what is being declared. */
23401 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23402 alternative. */
23405 CP_PARSER_FLAGS_OPTIONAL,
23411 /* There are no template typedefs. */
23413 {
23417 }
23419 /* Gather up the access checks that occurred the
23420 decl-specifier-seq. */
23423 /* Check for the declaration of a template class. */
23425 {
23427 {
23430 /* In this case:
23432 struct C {
23433 friend template <typename T> struct A<T>::B;
23434 };
23436 A<T>::B will be represented by a TYPENAME_TYPE, and
23437 therefore not recognized by shadow_tag. */
23439 && !decl
23446 else
23449 /* Perform access checks for template parameters. */
23451 }
23452 }
23454 /* Complain about missing 'typename' or other invalid type names. */
23457 {
23458 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23459 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23460 the rest of this declaration. */
23463 }
23465 /* If it's not a template class, try for a template function. If
23466 the next token is a `;', then this declaration does not declare
23467 anything. But, if there were errors in the decl-specifiers, then
23468 the error might well have come from an attempted class-specifier.
23469 In that case, there's no need to warn about a missing declarator. */
23473 {
23476 checks,
23478 member_p,
23479 declares_class_or_enum,
23481 NULL);
23483 /* 7.1.1-1 [dcl.stc]
23485 A storage-class-specifier shall not be specified in an explicit
23486 specialization... */
23488 && explicit_specialization_p
23490 {
23494 }
23498 }
23500 /* Look for a trailing `;' after the declaration. */
23506 out:
23509 /* Clear any current qualification; whatever comes next is the start
23510 of something new. */
23516 }
23518 /* Parse a cast-expression that is not the operand of a unary "&". */
23520 static tree
23522 {
23525 }
23527 /* Parse a functional cast to TYPE. Returns an expression
23528 representing the cast. */
23530 static tree
23532 {
23534 tree expression_list;
23535 tree cast;
23542 {
23550 tf_warning_or_error);
23551 }
23560 else
23561 {
23564 }
23567 tf_warning_or_error);
23568 /* [expr.const]/1: In an integral constant expression "only type
23569 conversions to integral or enumeration type can be used". */
23575 NIC_CONSTRUCTOR))
23578 }
23580 /* Save the tokens that make up the body of a member function defined
23581 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23582 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23583 specifiers applied to the declaration. Returns the FUNCTION_DECL
23584 for the member function. */
23586 static tree
23590 tree attributes)
23591 {
23594 tree fn;
23596 /* Create the FUNCTION_DECL. */
23599 /* If something went badly wrong, bail out now. */
23601 {
23602 /* If there's a function-body, skip it. */
23607 }
23609 /* Remember it, if there default args to post process. */
23612 /* Save away the tokens that make up the body of the
23613 function. */
23615 /* Handle function try blocks. */
23618 /* We can have braced-init-list mem-initializers before the fn body. */
23620 {
23623 {
23624 /* cache_group will stop after an un-nested { } pair, too. */
23628 /* variadic mem-inits have ... after the ')'. */
23631 }
23632 }
23634 /* Handle function try blocks. */
23639 /* Save away the inline definition; we will process it when the
23640 class is complete. */
23644 /* We need to know that this was defined in the class, so that
23645 friend templates are handled correctly. */
23648 /* Add FN to the queue of functions to be parsed later. */
23652 }
23654 /* Save the tokens that make up the in-class initializer for a non-static
23655 data member. Returns a DEFAULT_ARG. */
23657 static tree
23659 {
23661 }
23663 /* Parse a template-argument-list, as well as the trailing ">" (but
23664 not the opening "<"). See cp_parser_template_argument_list for the
23665 return value. */
23667 static tree
23669 {
23670 tree arguments;
23671 tree saved_scope;
23672 tree saved_qualifying_scope;
23673 tree saved_object_scope;
23678 /* [temp.names]
23680 When parsing a template-id, the first non-nested `>' is taken as
23681 the end of the template-argument-list rather than a greater-than
23682 operator. */
23683 saved_greater_than_is_operator_p
23686 /* Parsing the argument list may modify SCOPE, so we save it
23687 here. */
23691 /* We need to evaluate the template arguments, even though this
23692 template-id may be nested within a "sizeof". */
23697 /* Parse the template-argument-list itself. */
23701 else
23703 /* Look for the `>' that ends the template-argument-list. If we find
23704 a '>>' instead, it's probably just a typo. */
23706 {
23708 {
23709 /* In C++0x, a `>>' in a template argument list or cast
23710 expression is considered to be two separate `>'
23711 tokens. So, change the current token to a `>', but don't
23712 consume it: it will be consumed later when the outer
23713 template argument list (or cast expression) is parsed.
23714 Note that this replacement of `>' for `>>' is necessary
23715 even if we are parsing tentatively: in the tentative
23716 case, after calling
23717 cp_parser_enclosed_template_argument_list we will always
23718 throw away all of the template arguments and the first
23719 closing `>', either because the template argument list
23720 was erroneous or because we are replacing those tokens
23721 with a CPP_TEMPLATE_ID token. The second `>' (which will
23722 not have been thrown away) is needed either to close an
23723 outer template argument list or to complete a new-style
23724 cast. */
23727 }
23729 {
23730 /* If we're in a nested template argument list, the '>>' has
23731 to be a typo for '> >'. We emit the error message, but we
23732 continue parsing and we push a '>' as next token, so that
23733 the argument list will be parsed correctly. Note that the
23734 global source location is still on the token before the
23735 '>>', so we need to say explicitly where we want it. */
23741 }
23742 else
23743 {
23744 /* If this is not a nested template argument list, the '>>'
23745 is a typo for '>'. Emit an error message and continue.
23746 Same deal about the token location, but here we can get it
23747 right by consuming the '>>' before issuing the diagnostic. */
23750 "spurious %<>>%>, use %<>%> to terminate "
23752 }
23753 }
23754 else
23756 /* The `>' token might be a greater-than operator again now. */
23757 parser->greater_than_is_operator_p
23759 /* Restore the SAVED_SCOPE. */
23767 }
23769 /* MEMBER_FUNCTION is a member function, or a friend. If default
23770 arguments, or the body of the function have not yet been parsed,
23771 parse them now. */
23773 static void
23775 {
23777 /* If this member is a template, get the underlying
23778 FUNCTION_DECL. */
23782 /* There should not be any class definitions in progress at this
23783 point; the bodies of members are only parsed outside of all class
23784 definitions. */
23786 /* While we're parsing the member functions we might encounter more
23787 classes. We want to handle them right away, but we don't want
23788 them getting mixed up with functions that are currently in the
23789 queue. */
23792 /* Make sure that any template parameters are in scope. */
23795 /* If the body of the function has not yet been parsed, parse it
23796 now. */
23798 {
23799 tree function_scope;
23802 /* The function is no longer pending; we are processing it. */
23807 /* If this is a local class, enter the scope of the containing
23808 function. */
23813 /* Push the body of the function onto the lexer stack. */
23816 /* Let the front end know that we going to be defining this
23817 function. */
23821 /* Don't do access checking if it is a templated function. */
23825 /* #pragma omp declare reduction needs special parsing. */
23827 {
23832 }
23833 else
23834 /* Now, parse the body of the function. */
23841 /* Leave the scope of the containing function. */
23845 }
23847 /* Remove any template parameters from the symbol table. */
23850 /* Restore the queue. */
23853 }
23855 /* If DECL contains any default args, remember it on the unparsed
23856 functions queue. */
23858 static void
23860 {
23861 tree probe;
23864 probe;
23867 {
23871 }
23872 }
23874 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23875 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23876 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23877 from the parameter-type-list. */
23879 static tree
23882 {
23884 tree parsed_arg;
23890 /* Push the saved tokens for the default argument onto the parser's
23891 lexer stack. */
23897 /* Parse the default argument. */
23908 {
23909 /* In a non-template class, check conversions now. In a template,
23910 we'll wait and instantiate these as needed. */
23913 tf_warning_or_error);
23914 else
23916 }
23918 /* If the token stream has not been completely used up, then
23919 there was extra junk after the end of the default
23920 argument. */
23922 {
23925 else
23927 }
23929 /* Revert to the main lexer. */
23933 }
23935 /* FIELD is a non-static data member with an initializer which we saved for
23936 later; parse it now. */
23938 static void
23940 {
23941 tree def;
23948 NULL_TREE);
23954 }
23956 /* FN is a FUNCTION_DECL which may contains a parameter with an
23957 unparsed DEFAULT_ARG. Parse the default args now. This function
23958 assumes that the current scope is the scope in which the default
23959 argument should be processed. */
23961 static void
23963 {
23967 /* While we're parsing the default args, we might (due to the
23968 statement expression extension) encounter more classes. We want
23969 to handle them right away, but we don't want them getting mixed
23970 up with default args that are currently in the queue. */
23973 /* Local variable names (and the `this' keyword) may not appear
23974 in a default argument. */
23985 {
23987 tree parsed_arg;
23989 tree copy;
23996 /* This can happen for a friend declaration for a function
23997 already declared with default arguments. */
24000 parsed_arg
24002 default_arg,
24005 {
24007 }
24011 /* Update any instantiations we've already created. */
24015 }
24019 /* Make sure no default arg is missing. */
24022 /* Restore the state of local_variables_forbidden_p. */
24025 /* Restore the queue. */
24027 }
24029 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24031 sizeof ... ( identifier )
24033 where the 'sizeof' token has already been consumed. */
24035 static tree
24037 {
24038 /* Consume the `...'. */
24045 else
24053 /* The name is not qualified. */
24071 }
24073 /* Parse the operand of `sizeof' (or a similar operator). Returns
24074 either a TYPE or an expression, depending on the form of the
24075 input. The KEYWORD indicates which kind of expression we have
24076 encountered. */
24078 static tree
24080 {
24087 /* If it's a `...', then we are computing the length of a parameter
24088 pack. */
24093 /* Types cannot be defined in a `sizeof' expression. Save away the
24094 old message. */
24096 /* And create the new one. */
24102 /* The restrictions on constant-expressions do not apply inside
24103 sizeof expressions. */
24104 saved_integral_constant_expression_p
24106 saved_non_integral_constant_expression_p
24110 /* Do not actually evaluate the expression. */
24113 /* If it's a `(', then we might be looking at the type-id
24114 construction. */
24116 {
24119 /* We can't be sure yet whether we're looking at a type-id or an
24120 expression. */
24122 /* Note: as a GNU Extension, compound literals are considered
24123 postfix-expressions as they are in C99, so they are valid
24124 arguments to sizeof. See comment in cp_parser_cast_expression
24125 for details. */
24128 else
24129 {
24132 /* Look for the type-id. */
24134 /* Look for the closing `)'. */
24137 }
24139 /* If all went well, then we're done. */
24141 {
24142 cp_decl_specifier_seq decl_specs;
24144 /* Build a trivial decl-specifier-seq. */
24148 /* Call grokdeclarator to figure out what type this is. */
24151 TYPENAME,
24154 }
24155 }
24157 /* If the type-id production did not work out, then we must be
24158 looking at the unary-expression production. */
24163 /* Go back to evaluating expressions. */
24167 /* Free the message we created. */
24169 /* And restore the old one. */
24171 parser->integral_constant_expression_p
24173 parser->non_integral_constant_expression_p
24177 }
24179 /* If the current declaration has no declarator, return true. */
24181 static bool
24183 {
24184 /* If the next token is a `;' or a `,' then there is no
24185 declarator. */
24188 }
24190 /* Update the DECL_SPECS to reflect the storage class indicated by
24191 KEYWORD. */
24193 static void
24198 {
24199 cp_storage_class storage_class;
24202 {
24206 }
24208 {
24211 }
24216 {
24219 }
24222 {
24240 }
24244 /* A storage class specifier cannot be applied alongside a typedef
24245 specifier. If there is a typedef specifier present then set
24246 conflicting_specifiers_p which will trigger an error later
24247 on in grokdeclarator. */
24250 }
24252 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24253 is true, the type is a class or enum definition. */
24255 static void
24257 tree type_spec,
24260 {
24263 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24264 (with, for example, in "typedef int wchar_t;") we remember that
24265 this is what happened. In system headers, we ignore these
24266 declarations so that G++ can work with system headers that are not
24267 C++-safe. */
24269 && !type_definition_p
24279 {
24282 ds_redefined_builtin_type_spec,
24283 token);
24285 {
24289 }
24290 }
24293 else
24294 {
24299 }
24300 }
24302 /* True iff TOKEN is the GNU keyword __thread. */
24304 static bool
24306 {
24309 }
24311 /* Set the location for a declarator specifier and check if it is
24312 duplicated.
24314 DECL_SPECS is the sequence of declarator specifiers onto which to
24315 set the location.
24317 DS is the single declarator specifier to set which location is to
24318 be set onto the existing sequence of declarators.
24320 LOCATION is the location for the declarator specifier to
24321 consider. */
24323 static void
24326 {
24335 {
24339 }
24340 else
24341 {
24343 {
24347 else
24348 {
24351 OPT_Wlong_long,
24353 }
24354 }
24356 {
24361 else
24363 }
24364 else
24365 {
24381 "__complex"
24382 };
24385 }
24386 }
24387 }
24389 /* Return true iff the declarator specifier DS is present in the
24390 sequence of declarator specifiers DECL_SPECS. */
24392 bool
24394 cp_decl_spec ds)
24395 {
24402 }
24404 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24405 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24407 static bool
24409 {
24411 }
24413 /* Issue an error message indicating that TOKEN_DESC was expected.
24414 If KEYWORD is true, it indicated this function is called by
24415 cp_parser_require_keword and the required token can only be
24416 a indicated keyword. */
24418 static void
24420 required_token token_desc,
24422 {
24424 {
24493 }
24495 {
24497 {
24576 }
24577 }
24578 else
24580 }
24584 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24585 issue an error message indicating that TOKEN_DESC was expected.
24587 Returns the token consumed, if the token had the appropriate type.
24588 Otherwise, returns NULL. */
24593 required_token token_desc)
24594 {
24597 else
24598 {
24599 /* Output the MESSAGE -- unless we're parsing tentatively. */
24603 }
24604 }
24606 /* An error message is produced if the next token is not '>'.
24607 All further tokens are skipped until the desired token is
24608 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24610 static void
24612 {
24613 /* Current level of '< ... >'. */
24615 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24618 /* Are we ready, yet? If not, issue error message. */
24622 /* Skip tokens until the desired token is found. */
24624 {
24625 /* Peek at the next token. */
24627 {
24635 /* C++0x views the `>>' operator as two `>' tokens, but
24636 C++98 does not. */
24639 {
24640 /* We've hit a `>>' where the first `>' closes the
24641 template argument list, and the second `>' is
24642 spurious. Just consume the `>>' and stop; we've
24643 already produced at least one error. */
24646 }
24647 /* Fall through for C++0x, so we handle the second `>' in
24648 the `>>'. */
24652 {
24653 /* We've reached the token we want, consume it and stop. */
24656 }
24675 /* The '>' was probably forgotten, don't look further. */
24680 }
24682 /* Consume this token. */
24684 }
24685 }
24687 /* If the next token is the indicated keyword, consume it. Otherwise,
24688 issue an error message indicating that TOKEN_DESC was expected.
24690 Returns the token consumed, if the token had the appropriate type.
24691 Otherwise, returns NULL. */
24696 required_token token_desc)
24697 {
24701 {
24704 }
24707 }
24709 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24710 function-definition. */
24712 static bool
24714 {
24717 /* A ctor-initializer begins with a `:'. */
24719 /* A function-try-block begins with `try'. */
24721 /* A function-transaction-block begins with `__transaction_atomic'
24722 or `__transaction_relaxed'. */
24725 /* The named return value extension begins with `return'. */
24727 }
24729 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24730 definition. */
24732 static bool
24734 {
24741 }
24743 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24744 C++0x) ending a template-argument. */
24746 static bool
24748 {
24756 }
24758 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24759 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24761 static bool
24764 {
24770 /* Check for the sequence `<::' in the original code. It would be lexed as
24771 `[:', where `[' is a digraph, and there is no whitespace before
24772 `:'. */
24774 {
24779 }
24781 }
24783 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24784 or none_type otherwise. */
24786 static enum tag_types
24788 {
24790 {
24800 }
24801 }
24803 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
24804 or none_type otherwise or if the token is null. */
24806 static enum tag_types
24808 {
24813 {
24821 }
24822 }
24824 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24826 static void
24828 {
24832 {
24836 type))
24839 }
24840 }
24842 /* Issue an error message if DECL is redeclared with different
24843 access than its original declaration [class.access.spec/3].
24844 This applies to nested classes and nested class templates.
24845 [class.mem/1]. */
24847 static void
24849 {
24858 }
24860 /* Look for the `template' keyword, as a syntactic disambiguator.
24861 Return TRUE iff it is present, in which case it will be
24862 consumed. */
24864 static bool
24866 {
24868 {
24869 /* In C++98 the `template' keyword can only be used within templates;
24870 outside templates the parser can always figure out what is a
24871 template and what is not. In C++11, per the resolution of DR 468,
24872 `template' is allowed in cases where it is not strictly necessary. */
24875 {
24878 "in C++98 %<template%> (as a disambiguator) is only "
24880 /* If this part of the token stream is rescanned, the same
24881 error message would be generated. So, we purge the token
24882 from the stream. */
24885 }
24886 else
24887 {
24888 /* Consume the `template' keyword. */
24891 }
24892 }
24894 }
24896 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24897 set PARSER->SCOPE, and perform other related actions. */
24899 static void
24901 {
24907 /* Get the stored value. */
24909 /* Perform any access checks that were deferred. */
24912 {
24917 }
24918 /* Set the scope from the stored value. */
24922 }
24924 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24925 encounter the end of a block before what we were looking for. */
24927 static bool
24931 {
24933 {
24936 /* Abort a parenthesized expression if we encounter a semicolon. */
24940 /* If we've reached the end of the file, stop. */
24946 /* We've hit the end of an enclosing block, so there's been some
24947 kind of syntax error. */
24950 /* Consume the token. */
24952 /* See if it starts a new group. */
24954 {
24956 /* In theory this should probably check end == '}', but
24957 cp_parser_save_member_function_body needs it to exit
24958 after either '}' or ')' when called with ')'. */
24961 }
24963 {
24967 }
24972 }
24973 }
24975 /* Like above, for caching a default argument or NSDMI. Both of these are
24976 terminated by a non-nested comma, but it can be unclear whether or not a
24977 comma is nested in a template argument list unless we do more parsing.
24978 In order to handle this ambiguity, when we encounter a ',' after a '<'
24979 we try to parse what follows as a parameter-declaration-list (in the
24980 case of a default argument) or a member-declarator (in the case of an
24981 NSDMI). If that succeeds, then we stop caching. */
24983 static tree
24985 {
24990 tree default_argument;
24992 /* Add tokens until we have processed the entire default
24993 argument. We add the range [first_token, token). */
24996 {
24997 /* For list-initialization, this is straightforward. */
25000 }
25002 {
25005 /* Peek at the next token. */
25007 /* What we do depends on what token we have. */
25009 {
25010 /* In valid code, a default argument must be
25011 immediately followed by a `,' `)', or `...'. */
25014 {
25015 /* If we've seen a '<', we might be in a
25016 template-argument-list. Until Core issue 325 is
25017 resolved, we don't know how this situation ought
25018 to be handled, so try to DTRT. We check whether
25019 what comes after the comma is a valid parameter
25020 declaration list. If it is, then the comma ends
25021 the default argument; otherwise the default
25022 argument continues. */
25025 /* Set ITALP so cp_parser_parameter_declaration_list
25026 doesn't decide to commit to this parse. */
25034 {
25041 }
25042 else
25043 {
25047 }
25054 }
25057 /* If we run into a non-nested `;', `}', or `]',
25058 then the code is invalid -- but the default
25059 argument is certainly over. */
25064 /* Handle correctly int n = sizeof ... ( p ); */
25067 /* Update DEPTH, if necessary. */
25082 /* This might be the comparison operator, or it might
25083 start a template argument list. */
25090 /* Fall through for C++0x, which treats the `>>'
25091 operator like two `>' tokens in certain
25092 cases. */
25096 {
25097 /* This might be an operator, or it might close a
25098 template argument list. But if a previous '<'
25099 started a template argument list, this will have
25100 closed it, so we can't be in one anymore. */
25104 }
25107 /* If we run out of tokens, issue an error message. */
25116 /* In these cases, we should look for template-ids.
25117 For example, if the default argument is
25118 `X<int, double>()', we need to do name lookup to
25119 figure out whether or not `X' is a template; if
25120 so, the `,' does not end the default argument.
25122 That is not yet done. */
25127 }
25129 /* If we've reached the end, stop. */
25133 /* Add the token to the token block. */
25135 }
25137 /* Create a DEFAULT_ARG to represent the unparsed default
25138 argument. */
25145 }
25147 /* Begin parsing tentatively. We always save tokens while parsing
25148 tentatively so that if the tentative parsing fails we can restore the
25149 tokens. */
25151 static void
25153 {
25154 /* Enter a new parsing context. */
25156 /* Begin saving tokens. */
25158 /* In order to avoid repetitive access control error messages,
25159 access checks are queued up until we are no longer parsing
25160 tentatively. */
25162 }
25164 /* Commit to the currently active tentative parse. */
25166 static void
25168 {
25172 /* Mark all of the levels as committed. */
25175 {
25182 }
25183 }
25185 /* Commit to the topmost currently active tentative parse.
25187 Note that this function shouldn't be called when there are
25188 irreversible side-effects while in a tentative state. For
25189 example, we shouldn't create a permanent entry in the symbol
25190 table, or issue an error message that might not apply if the
25191 tentative parse is aborted. */
25193 static void
25195 {
25200 {
25208 }
25209 }
25211 /* Abort the currently active tentative parse. All consumed tokens
25212 will be rolled back, and no diagnostics will be issued. */
25214 static void
25216 {
25220 /* Now, pretend that we want to see if the construct was
25221 successfully parsed. */
25223 }
25225 /* Stop parsing tentatively. If a parse error has occurred, restore the
25226 token stream. Otherwise, commit to the tokens we have consumed.
25227 Returns true if no error occurred; false otherwise. */
25229 static bool
25231 {
25235 /* Remember whether or not an error occurred, since we are about to
25236 destroy that information. */
25238 /* Remove the topmost context from the stack. */
25241 /* If no parse errors occurred, commit to the tentative parse. */
25243 {
25244 /* Commit to the tokens read tentatively, unless that was
25245 already done. */
25250 }
25251 /* Otherwise, if errors occurred, roll back our state so that things
25252 are just as they were before we began the tentative parse. */
25253 else
25254 {
25257 }
25258 /* Add the context to the front of the free list. */
25263 }
25265 /* Returns true if we are parsing tentatively and are not committed to
25266 this tentative parse. */
25268 static bool
25270 {
25273 }
25275 /* Returns nonzero iff an error has occurred during the most recent
25276 tentative parse. */
25278 static bool
25280 {
25283 }
25285 /* Returns nonzero if GNU extensions are allowed. */
25287 static bool
25289 {
25291 }
25292 \f
25293 /* Objective-C++ Productions */
25296 /* Parse an Objective-C expression, which feeds into a primary-expression
25297 above.
25299 objc-expression:
25300 objc-message-expression
25301 objc-string-literal
25302 objc-encode-expression
25303 objc-protocol-expression
25304 objc-selector-expression
25306 Returns a tree representation of the expression. */
25308 static tree
25310 {
25311 /* Try to figure out what kind of declaration is present. */
25315 {
25325 {
25337 }
25343 }
25346 }
25348 /* Parse an Objective-C message expression.
25350 objc-message-expression:
25351 [ objc-message-receiver objc-message-args ]
25353 Returns a representation of an Objective-C message. */
25355 static tree
25357 {
25366 }
25368 /* Parse an objc-message-receiver.
25370 objc-message-receiver:
25371 expression
25372 simple-type-specifier
25374 Returns a representation of the type or expression. */
25376 static tree
25378 {
25379 tree rcv;
25381 /* An Objective-C message receiver may be either (1) a type
25382 or (2) an expression. */
25391 CP_PARSER_FLAGS_NONE);
25394 }
25396 /* Parse the arguments and selectors comprising an Objective-C message.
25398 objc-message-args:
25399 objc-selector
25400 objc-selector-args
25401 objc-selector-args , objc-comma-args
25403 objc-selector-args:
25404 objc-selector [opt] : assignment-expression
25405 objc-selector-args objc-selector [opt] : assignment-expression
25407 objc-comma-args:
25408 assignment-expression
25409 objc-comma-args , assignment-expression
25411 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25412 selector arguments and TREE_VALUE containing a list of comma
25413 arguments. */
25415 static tree
25417 {
25423 {
25429 /* Detect if we have a unary selector. */
25438 sel_args
25443 }
25445 /* Handle non-selector arguments, if any. */
25447 {
25448 tree arg;
25453 addl_args
25458 }
25461 {
25464 }
25467 }
25469 /* Parse an Objective-C encode expression.
25471 objc-encode-expression:
25472 @encode objc-typename
25474 Returns an encoded representation of the type argument. */
25476 static tree
25478 {
25479 tree type;
25489 {
25493 }
25495 /* This happens if we find @encode(T) (where T is a template
25496 typename or something dependent on a template typename) when
25497 parsing a template. In that case, we can't compile it
25498 immediately, but we rather create an AT_ENCODE_EXPR which will
25499 need to be instantiated when the template is used.
25500 */
25502 {
25506 }
25509 }
25511 /* Parse an Objective-C @defs expression. */
25513 static tree
25515 {
25516 tree name;
25524 }
25526 /* Parse an Objective-C protocol expression.
25528 objc-protocol-expression:
25529 @protocol ( identifier )
25531 Returns a representation of the protocol expression. */
25533 static tree
25535 {
25536 tree proto;
25544 }
25546 /* Parse an Objective-C selector expression.
25548 objc-selector-expression:
25549 @selector ( objc-method-signature )
25551 objc-method-signature:
25552 objc-selector
25553 objc-selector-seq
25555 objc-selector-seq:
25556 objc-selector :
25557 objc-selector-seq objc-selector :
25559 Returns a representation of the method selector. */
25561 static tree
25563 {
25575 {
25584 {
25585 /* Detect if we have a unary selector. */
25587 {
25590 }
25591 else
25592 {
25594 }
25595 }
25600 {
25601 sel_seq
25604 sel_seq
25607 }
25608 else
25609 sel_seq
25614 }
25616 finish_selector:
25620 }
25622 /* Parse a list of identifiers.
25624 objc-identifier-list:
25625 identifier
25626 objc-identifier-list , identifier
25628 Returns a TREE_LIST of identifier nodes. */
25630 static tree
25632 {
25633 tree identifier;
25634 tree list;
25645 {
25652 identifier));
25654 }
25657 }
25659 /* Parse an Objective-C alias declaration.
25661 objc-alias-declaration:
25662 @compatibility_alias identifier identifier ;
25664 This function registers the alias mapping with the Objective-C front end.
25665 It returns nothing. */
25667 static void
25669 {
25677 }
25679 /* Parse an Objective-C class forward-declaration.
25681 objc-class-declaration:
25682 @class objc-identifier-list ;
25684 The function registers the forward declarations with the Objective-C
25685 front end. It returns nothing. */
25687 static void
25689 {
25692 {
25693 tree id;
25703 else
25705 }
25707 }
25709 /* Parse a list of Objective-C protocol references.
25711 objc-protocol-refs-opt:
25712 objc-protocol-refs [opt]
25714 objc-protocol-refs:
25715 < objc-identifier-list >
25717 Returns a TREE_LIST of identifiers, if any. */
25719 static tree
25721 {
25725 {
25729 }
25732 }
25734 /* Parse a Objective-C visibility specification. */
25736 static void
25738 {
25742 {
25757 }
25759 /* Eat '@private'/'@protected'/'@public'. */
25761 }
25763 /* Parse an Objective-C method type. Return 'true' if it is a class
25764 (+) method, and 'false' if it is an instance (-) method. */
25768 {
25771 else
25773 }
25775 /* Parse an Objective-C protocol qualifier. */
25777 static tree
25779 {
25792 {
25797 }
25800 }
25802 /* Parse an Objective-C typename. */
25804 static tree
25806 {
25810 {
25816 /* An ObjC type name may consist of just protocol qualifiers, in which
25817 case the type shall default to 'id'. */
25819 {
25822 /* If the type could not be parsed, an error has already
25823 been produced. For error recovery, behave as if it had
25824 not been specified, which will use the default type
25825 'id'. */
25827 {
25829 /* We need to skip to the closing parenthesis as
25830 cp_parser_type_id() does not seem to do it for
25831 us. */
25836 }
25837 }
25841 }
25844 }
25846 /* Check to see if TYPE refers to an Objective-C selector name. */
25848 static bool
25850 {
25856 }
25858 /* Parse an Objective-C selector. */
25860 static tree
25862 {
25866 {
25869 }
25871 /* C++ operator names are allowed to appear in ObjC selectors. */
25873 {
25886 }
25887 }
25889 /* Parse an Objective-C params list. */
25891 static tree
25893 {
25899 {
25909 /* Detect if we have a unary selector. */
25912 {
25915 }
25919 {
25920 /* Something went quite wrong. There should be a colon
25921 here, but there is not. Stop parsing parameters. */
25923 }
25925 /* New ObjC allows attributes on parameters too. */
25930 params
25933 type_name,
25934 identifier,
25935 parm_attr));
25938 }
25941 {
25944 }
25946 /* We allow tail attributes for the method. */
25948 {
25956 }
25959 {
25962 }
25964 }
25966 /* Parse the non-keyword Objective-C params. */
25968 static tree
25971 {
25977 {
25979 tree parm;
25985 {
25990 }
25992 /* TODO: parse attributes for tail parameters. */
26001 }
26003 /* We allow tail attributes for the method. */
26005 {
26007 {
26012 }
26013 else
26014 /* We have an error, but parse the attributes, so that we can
26015 carry on. */
26021 }
26024 }
26026 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26028 static void
26030 {
26033 /* If the next token is `extern' and the following token is a string
26034 literal, then we have a linkage specification. */
26036 && cp_parser_is_pure_string_literal
26039 /* Handle #pragma, if any. */
26042 /* Allow stray semicolons. */
26045 /* Mark methods as optional or required, when building protocols. */
26047 {
26050 }
26052 {
26055 }
26058 /* Other stray characters must generate errors. */
26060 {
26064 }
26065 /* Finally, try to parse a block-declaration, or a function-definition. */
26066 else
26068 }
26070 /* Parse a method signature. */
26072 static tree
26074 {
26090 }
26092 static bool
26094 {
26095 tree tattr;
26100 /* If the attributes are followed by a method introducer, this is not allowed.
26101 Dump the attributes and flag the situation. */
26106 /* Otherwise, the attributes introduce some interstitial code, possibly so
26107 rewind to allow that check. */
26110 }
26112 /* Parse an Objective-C method prototype list. */
26114 static void
26116 {
26120 {
26122 {
26127 else
26131 {
26135 }
26138 }
26144 OPT_Wattributes,
26146 else
26147 /* Allow for interspersed non-ObjC++ code. */
26151 }
26155 else
26159 }
26161 /* Parse an Objective-C method definition list. */
26163 static void
26165 {
26169 {
26170 tree meth;
26173 {
26179 else
26184 {
26188 }
26190 NULL_TREE);
26192 /* For historical reasons, we accept an optional semicolon. */
26199 {
26206 }
26207 }
26208 /* The following case will be removed once @synthesize is
26209 completely implemented. */
26220 else
26221 /* Allow for interspersed non-ObjC++ code. */
26225 }
26229 else
26233 }
26235 /* Parse Objective-C ivars. */
26237 static void
26239 {
26250 {
26251 cp_decl_specifier_seq declspecs;
26253 tree prefix_attributes;
26261 CP_PARSER_FLAGS_OPTIONAL,
26265 /* auto, register, static, extern, mutable. */
26267 {
26270 }
26272 /* thread_local. */
26274 {
26277 }
26279 /* typedef. */
26281 {
26284 }
26289 /* Keep going until we hit the `;' at the end of the
26290 declaration. */
26292 {
26297 /* Check for a (possibly unnamed) bitfield declaration. */
26305 {
26306 /* Get the name of the bitfield. */
26309 sfk_none);
26311 eat_colon:
26313 /* Get the width of the bitfield. */
26314 width
26317 NULL);
26318 }
26319 else
26320 {
26321 /* Parse the declarator. */
26322 declarator
26328 }
26330 /* Look for attributes that apply to the ivar. */
26332 /* Remember which attributes are prefix attributes and
26333 which are not. */
26335 /* Combine the attributes. */
26339 /* Create the bitfield declaration. */
26341 width,
26342 attributes);
26343 else
26348 /* Add the instance variable. */
26352 /* Reset PREFIX_ATTRIBUTES. */
26361 {
26364 }
26366 }
26370 }
26375 /* Do not consume the RID_AT_END, so it will be read again as terminating
26376 the @interface of @implementation. */
26380 /* For historical reasons, we accept an optional semicolon. */
26383 }
26385 /* Parse an Objective-C protocol declaration. */
26387 static void
26389 {
26395 {
26400 }
26402 /* See if we have a forward declaration or a definition. */
26405 /* Try a forward declaration first. */
26407 {
26409 {
26410 tree id;
26420 else
26422 }
26424 }
26426 /* Ok, we got a full-fledged definition (or at least should). */
26427 else
26428 {
26433 }
26434 }
26436 /* Parse an Objective-C superclass or category. */
26438 static void
26443 {
26449 {
26452 }
26454 {
26457 /* If there is no category name, and this is an @interface, we
26458 have a class extension. */
26460 {
26463 }
26464 else
26468 }
26469 }
26471 /* Parse an Objective-C class interface. */
26473 static void
26475 {
26482 {
26483 /* It's hard to recover because even if valid @interface stuff
26484 is to follow, we can't compile it (or validate it) if we
26485 don't even know which class it refers to. Let's assume this
26486 was a stray '@interface' token in the stream and skip it.
26487 */
26489 }
26494 /* We have either a class or a category on our hands. */
26497 else
26498 {
26500 /* Handle instance variable declarations, if any. */
26503 }
26506 }
26508 /* Parse an Objective-C class implementation. */
26510 static void
26512 {
26519 {
26520 /* It's hard to recover because even if valid @implementation
26521 stuff is to follow, we can't compile it (or validate it) if
26522 we don't even know which class it refers to. Let's assume
26523 this was a stray '@implementation' token in the stream and
26524 skip it.
26525 */
26527 }
26531 /* We have either a class or a category on our hands. */
26534 else
26535 {
26537 /* Handle instance variable declarations, if any. */
26540 }
26543 }
26545 /* Consume the @end token and finish off the implementation. */
26547 static void
26549 {
26552 }
26554 /* Parse an Objective-C declaration. */
26556 static void
26558 {
26559 /* Try to figure out what kind of declaration is present. */
26564 {
26580 }
26583 {
26606 }
26607 }
26609 /* Parse an Objective-C try-catch-finally statement.
26611 objc-try-catch-finally-stmt:
26612 @try compound-statement objc-catch-clause-seq [opt]
26613 objc-finally-clause [opt]
26615 objc-catch-clause-seq:
26616 objc-catch-clause objc-catch-clause-seq [opt]
26618 objc-catch-clause:
26619 @catch ( objc-exception-declaration ) compound-statement
26621 objc-finally-clause:
26622 @finally compound-statement
26624 objc-exception-declaration:
26625 parameter-declaration
26626 '...'
26628 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26630 Returns NULL_TREE.
26632 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26633 for C. Keep them in sync. */
26635 static tree
26637 {
26638 location_t location;
26639 tree stmt;
26644 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26645 node, lest it get absorbed into the surrounding block. */
26651 {
26660 {
26661 /* We have "@catch (...)" (where the '...' are literally
26662 what is in the code). Skip the '...'.
26663 parameter_declaration is set to NULL_TREE, and
26664 objc_being_catch_clauses() knows that that means
26665 '...'. */
26668 }
26669 else
26670 {
26671 /* We have "@catch (NSException *exception)" or something
26672 like that. Parse the parameter declaration. */
26676 else
26681 }
26684 else
26685 {
26686 /* If there was no open parenthesis, we are recovering from
26687 an error, and we are trying to figure out what mistake
26688 the user has made. */
26690 /* If there is an immediate closing parenthesis, the user
26691 probably forgot the opening one (ie, they typed "@catch
26692 NSException *e)". Parse the closing parenthesis and keep
26693 going. */
26697 /* If these is no immediate closing parenthesis, the user
26698 probably doesn't know that parenthesis are required at
26699 all (ie, they typed "@catch NSException *e"). So, just
26700 forget about the closing parenthesis and keep going. */
26701 }
26705 }
26707 {
26710 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26711 node, lest it get absorbed into the surrounding block. */
26715 }
26718 }
26720 /* Parse an Objective-C synchronized statement.
26722 objc-synchronized-stmt:
26723 @synchronized ( expression ) compound-statement
26725 Returns NULL_TREE. */
26727 static tree
26729 {
26730 location_t location;
26741 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26742 node, lest it get absorbed into the surrounding block. */
26747 }
26749 /* Parse an Objective-C throw statement.
26751 objc-throw-stmt:
26752 @throw assignment-expression [opt] ;
26754 Returns a constructed '@throw' statement. */
26756 static tree
26758 {
26770 }
26772 /* Parse an Objective-C statement. */
26774 static tree
26776 {
26777 /* Try to figure out what kind of declaration is present. */
26781 {
26792 }
26795 }
26797 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26798 look ahead to see if an objc keyword follows the attributes. This
26799 is to detect the use of prefix attributes on ObjC @interface and
26800 @protocol. */
26802 static bool
26804 {
26809 {
26812 }
26815 }
26817 /* This routine is a minimal replacement for
26818 c_parser_struct_declaration () used when parsing the list of
26819 types/names or ObjC++ properties. For example, when parsing the
26820 code
26822 @property (readonly) int a, b, c;
26824 this function is responsible for parsing "int a, int b, int c" and
26825 returning the declarations as CHAIN of DECLs.
26827 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26828 similar parsing. */
26829 static tree
26831 {
26833 cp_decl_specifier_seq declspecs;
26835 tree prefix_attributes;
26838 CP_PARSER_FLAGS_NONE,
26845 /* auto, register, static, extern, mutable. */
26847 {
26850 }
26852 /* thread_local. */
26854 {
26857 }
26859 /* typedef. */
26861 {
26864 }
26869 /* Keep going until we hit the `;' at the end of the declaration. */
26871 {
26876 /* Parse the declarator. */
26880 /* Look for attributes that apply to the ivar. */
26882 /* Remember which attributes are prefix attributes and
26883 which are not. */
26885 /* Combine the attributes. */
26895 /* Reset PREFIX_ATTRIBUTES. */
26906 {
26909 }
26910 else
26912 }
26914 }
26916 /* Parse an Objective-C @property declaration. The syntax is:
26918 objc-property-declaration:
26919 '@property' objc-property-attributes[opt] struct-declaration ;
26921 objc-property-attributes:
26922 '(' objc-property-attribute-list ')'
26924 objc-property-attribute-list:
26925 objc-property-attribute
26926 objc-property-attribute-list, objc-property-attribute
26928 objc-property-attribute
26929 'getter' = identifier
26930 'setter' = identifier
26931 'readonly'
26932 'readwrite'
26933 'assign'
26934 'retain'
26935 'copy'
26936 'nonatomic'
26938 For example:
26939 @property NSString *name;
26940 @property (readonly) id object;
26941 @property (retain, nonatomic, getter=getTheName) id name;
26942 @property int a, b, c;
26944 PS: This function is identical to
26945 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26946 static void
26948 {
26949 /* The following variables hold the attributes of the properties as
26950 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26951 seen. When we see an attribute, we set them to 'true' (if they
26952 are boolean properties) or to the identifier (if they have an
26953 argument, ie, for getter and setter). Note that here we only
26954 parse the list of attributes, check the syntax and accumulate the
26955 attributes that we find. objc_add_property_declaration() will
26956 then process the information. */
26966 /* 'properties' is the list of properties that we read. Usually a
26967 single one, but maybe more (eg, in "@property int a, b, c;" there
26968 are three). */
26969 tree properties;
26970 location_t loc;
26976 /* Parse the optional attribute list... */
26978 {
26979 /* Eat the '('. */
26983 {
26989 {
26992 }
26996 {
27007 {
27011 else
27016 }
27019 {
27023 }
27025 {
27027 {
27030 }
27031 else
27035 else
27037 }
27038 else
27039 {
27041 {
27044 }
27045 else
27047 }
27053 }
27060 else
27062 }
27064 /* FIXME: "@property (setter, assign);" will generate a spurious
27065 "error: expected ‘)’ before ‘,’ token". This is because
27066 cp_parser_require, unlike the C counterpart, will produce an
27067 error even if we are in error recovery. */
27069 {
27074 }
27075 }
27077 /* ... and the property declaration(s). */
27081 {
27083 /* If the next token is now a `;', consume it. */
27087 }
27091 else
27092 {
27093 /* Comma-separated properties are chained together in
27094 reverse order; add them one by one. */
27103 }
27106 }
27108 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27110 objc-synthesize-declaration:
27111 @synthesize objc-synthesize-identifier-list ;
27113 objc-synthesize-identifier-list:
27114 objc-synthesize-identifier
27115 objc-synthesize-identifier-list, objc-synthesize-identifier
27117 objc-synthesize-identifier
27118 identifier
27119 identifier = identifier
27121 For example:
27122 @synthesize MyProperty;
27123 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27125 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27126 for C. Keep them in sync.
27127 */
27128 static void
27130 {
27132 location_t loc;
27137 {
27141 {
27144 }
27146 {
27150 {
27153 }
27154 }
27155 else
27160 else
27162 }
27165 }
27167 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27169 objc-dynamic-declaration:
27170 @dynamic identifier-list ;
27172 For example:
27173 @dynamic MyProperty;
27174 @dynamic MyProperty, AnotherProperty;
27176 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27177 for C. Keep them in sync.
27178 */
27179 static void
27181 {
27183 location_t loc;
27188 {
27189 tree property;
27192 {
27195 }
27199 else
27201 }
27204 }
27206 \f
27207 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27209 /* Returns name of the next clause.
27210 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27211 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27212 returned and the token is consumed. */
27214 static pragma_omp_clause
27216 {
27228 {
27233 {
27336 }
27337 }
27343 }
27345 /* Validate that a clause of the given type does not already exist. */
27347 static void
27350 {
27351 tree c;
27355 {
27358 }
27359 }
27361 /* OpenMP 2.5:
27362 variable-list:
27363 identifier
27364 variable-list , identifier
27366 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27367 colon). An opening parenthesis will have been consumed by the caller.
27369 If KIND is nonzero, create the appropriate node and install the decl
27370 in OMP_CLAUSE_DECL and add the node to the head of the list.
27372 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27373 return the list created.
27375 COLON can be NULL if only closing parenthesis should end the list,
27376 or pointer to bool which will receive false if the list is terminated
27377 by closing parenthesis or true if the list is terminated by colon. */
27379 static tree
27382 {
27386 {
27389 }
27391 {
27408 {
27410 {
27416 {
27424 parser->colon_corrects_to_scope_p
27428 else
27429 {
27430 /* Look for `:'. */
27434 CPP_CLOSE_SQUARE))
27436 }
27437 /* Look for the closing `]'. */
27439 RT_CLOSE_SQUARE))
27442 }
27446 }
27452 }
27453 else
27456 get_comma:
27460 }
27466 {
27470 }
27473 {
27476 /* Try to resync to an unnested comma. Copied from
27477 cp_parser_parenthesized_expression_list. */
27478 skip_comma:
27487 }
27490 }
27492 /* Similarly, but expect leading and trailing parenthesis. This is a very
27493 common case for omp clauses. */
27495 static tree
27497 {
27501 }
27503 /* OpenMP 3.0:
27504 collapse ( constant-expression ) */
27506 static tree
27508 {
27510 location_t loc;
27511 HOST_WIDE_INT n;
27531 {
27534 }
27542 }
27544 /* OpenMP 2.5:
27545 default ( shared | none ) */
27547 static tree
27549 {
27551 tree c;
27556 {
27561 {
27576 }
27579 }
27580 else
27581 {
27582 invalid_kind:
27584 }
27600 }
27602 /* OpenMP 3.1:
27603 final ( expression ) */
27605 static tree
27607 {
27628 }
27630 /* OpenMP 2.5:
27631 if ( expression ) */
27633 static tree
27635 {
27656 }
27658 /* OpenMP 3.1:
27659 mergeable */
27661 static tree
27664 {
27665 tree c;
27668 location);
27673 }
27675 /* OpenMP 2.5:
27676 nowait */
27678 static tree
27681 {
27682 tree c;
27689 }
27691 /* OpenMP 2.5:
27692 num_threads ( expression ) */
27694 static tree
27696 location_t location)
27697 {
27719 }
27721 /* OpenMP 2.5:
27722 ordered */
27724 static tree
27727 {
27728 tree c;
27736 }
27738 /* OpenMP 2.5:
27739 reduction ( reduction-operator : variable-list )
27741 reduction-operator:
27742 One of: + * - & ^ | && ||
27744 OpenMP 3.1:
27746 reduction-operator:
27747 One of: + * - & ^ | && || min max
27749 OpenMP 4.0:
27751 reduction-operator:
27752 One of: + * - & ^ | && ||
27753 id-expression */
27755 static tree
27757 {
27765 {
27775 }
27779 else
27780 {
27791 {
27821 }
27822 else
27823 {
27825 resync_fail:
27830 }
27831 }
27837 NULL);
27839 {
27842 }
27845 }
27847 /* OpenMP 2.5:
27848 schedule ( schedule-kind )
27849 schedule ( schedule-kind , expression )
27851 schedule-kind:
27852 static | dynamic | guided | runtime | auto */
27854 static tree
27856 {
27865 {
27870 {
27891 }
27892 }
27897 else
27902 {
27917 else
27922 }
27930 invalid_kind:
27932 resync_fail:
27937 }
27939 /* OpenMP 3.0:
27940 untied */
27942 static tree
27945 {
27946 tree c;
27953 }
27955 /* OpenMP 4.0:
27956 inbranch
27957 notinbranch */
27959 static tree
27962 {
27967 }
27969 /* OpenMP 4.0:
27970 parallel
27971 for
27972 sections
27973 taskgroup */
27975 static tree
27979 {
27983 }
27985 /* OpenMP 4.0:
27986 num_teams ( expression ) */
27988 static tree
27990 location_t location)
27991 {
28013 }
28015 /* OpenMP 4.0:
28016 thread_limit ( expression ) */
28018 static tree
28020 location_t location)
28021 {
28043 }
28045 /* OpenMP 4.0:
28046 aligned ( variable-list )
28047 aligned ( variable-list : constant-expression ) */
28049 static tree
28051 {
28062 {
28072 }
28078 }
28080 /* OpenMP 4.0:
28081 linear ( variable-list )
28082 linear ( variable-list : expression ) */
28084 static tree
28087 {
28098 {
28102 {
28105 }
28113 }
28119 }
28121 /* OpenMP 4.0:
28122 safelen ( constant-expression ) */
28124 static tree
28126 location_t location)
28127 {
28148 }
28150 /* OpenMP 4.0:
28151 simdlen ( constant-expression ) */
28153 static tree
28155 location_t location)
28156 {
28177 }
28179 /* OpenMP 4.0:
28180 depend ( depend-kind : variable-list )
28182 depend-kind:
28183 in | out | inout */
28185 static tree
28187 {
28195 {
28205 else
28207 }
28208 else
28216 NULL);
28223 invalid_kind:
28225 resync_fail:
28230 }
28232 /* OpenMP 4.0:
28233 map ( map-kind : variable-list )
28234 map ( variable-list )
28236 map-kind:
28237 alloc | to | from | tofrom */
28239 static tree
28241 {
28250 {
28262 else
28263 {
28269 }
28272 }
28275 NULL);
28281 }
28283 /* OpenMP 4.0:
28284 device ( expression ) */
28286 static tree
28288 location_t location)
28289 {
28311 }
28313 /* OpenMP 4.0:
28314 dist_schedule ( static )
28315 dist_schedule ( static , expression ) */
28317 static tree
28319 location_t location)
28320 {
28333 {
28344 }
28349 location);
28353 invalid_kind:
28355 resync_fail:
28360 }
28362 /* OpenMP 4.0:
28363 proc_bind ( proc-bind-kind )
28365 proc-bind-kind:
28366 master | close | spread */
28368 static tree
28370 location_t location)
28371 {
28372 tree c;
28379 {
28389 else
28391 }
28392 else
28401 location);
28406 invalid_kind:
28408 resync_fail:
28413 }
28415 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28416 is a bitmask in MASK. Return the list of clauses found; the result
28417 of clause default goes in *pdefault. */
28419 static tree
28423 {
28430 {
28431 pragma_omp_clause c_kind;
28442 {
28454 clauses);
28468 clauses);
28477 clauses);
28501 clauses);
28515 clauses);
28532 OMP_CLAUSE_NOTINBRANCH,
28541 {
28542 clause_not_first:
28546 }
28571 clauses);
28576 clauses);
28581 clauses);
28644 }
28649 {
28650 /* Remove the invalid clause(s) from the list to avoid
28651 confusing the rest of the compiler. */
28654 }
28655 }
28656 saw_error:
28657 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28658 no reason to skip to the end. */
28664 }
28666 /* OpenMP 2.5:
28667 structured-block:
28668 statement
28670 In practice, we're also interested in adding the statement to an
28671 outer node. So it is convenient if we work around the fact that
28672 cp_parser_statement calls add_stmt. */
28674 static unsigned
28676 {
28679 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28680 This preserves the "not within loop or switch" style error messages
28681 for nonsense cases like
28682 void foo() {
28683 #pragma omp single
28684 break;
28685 }
28686 */
28691 }
28693 static void
28695 {
28697 }
28699 static tree
28701 {
28709 }
28711 /* OpenMP 2.5:
28712 # pragma omp atomic new-line
28713 expression-stmt
28715 expression-stmt:
28716 x binop= expr | x++ | ++x | x-- | --x
28717 binop:
28718 +, *, -, /, &, ^, |, <<, >>
28720 where x is an lvalue expression with scalar type.
28722 OpenMP 3.1:
28723 # pragma omp atomic new-line
28724 update-stmt
28726 # pragma omp atomic read new-line
28727 read-stmt
28729 # pragma omp atomic write new-line
28730 write-stmt
28732 # pragma omp atomic update new-line
28733 update-stmt
28735 # pragma omp atomic capture new-line
28736 capture-stmt
28738 # pragma omp atomic capture new-line
28739 capture-block
28741 read-stmt:
28742 v = x
28743 write-stmt:
28744 x = expr
28745 update-stmt:
28746 expression-stmt | x = x binop expr
28747 capture-stmt:
28748 v = expression-stmt
28749 capture-block:
28750 { v = x; update-stmt; } | { update-stmt; v = x; }
28752 OpenMP 4.0:
28753 update-stmt:
28754 expression-stmt | x = x binop expr | x = expr binop x
28755 capture-stmt:
28756 v = update-stmt
28757 capture-block:
28758 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28760 where x and v are lvalue expressions with scalar type. */
28762 static void
28764 {
28772 {
28777 {
28783 }
28784 }
28786 {
28798 else
28802 }
28804 {
28810 {
28815 {
28818 }
28819 }
28820 }
28824 {
28835 else
28841 {
28842 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28843 opcode. */
28848 }
28852 {
28855 }
28856 else
28857 {
28864 }
28867 }
28869 restart:
28874 {
28881 /* FALLTHROUGH */
28891 /* FALLTHROUGH */
28906 /* Undo effects of boolean_increment for post {in,de}crement. */
28908 /* FALLTHRU */
28912 {
28913 /* Undo effects of boolean_increment. */
28915 {
28916 /* This is pre or post increment. */
28921 && !structured_block
28925 }
28926 }
28927 /* FALLTHRU */
28930 {
28965 {
28969 }
28972 {
28978 {
28983 }
28985 {
28996 {
28998 {
29003 }
29004 else
29006 }
29010 }
29013 {
29020 }
29024 }
29028 {
29031 {
29039 }
29041 {
29046 }
29081 }
29092 /* FALLTHROUGH */
29097 }
29104 }
29105 stmt_done:
29107 {
29120 }
29122 {
29125 }
29126 done:
29132 saw_error:
29135 {
29139 {
29143 }
29144 }
29145 }
29148 /* OpenMP 2.5:
29149 # pragma omp barrier new-line */
29151 static void
29153 {
29156 }
29158 /* OpenMP 2.5:
29159 # pragma omp critical [(name)] new-line
29160 structured-block */
29162 static tree
29164 {
29168 {
29180 }
29185 }
29187 /* OpenMP 2.5:
29188 # pragma omp flush flush-vars[opt] new-line
29190 flush-vars:
29191 ( variable-list ) */
29193 static void
29195 {
29201 }
29203 /* Helper function, to parse omp for increment expression. */
29205 static tree
29207 {
29212 {
29215 }
29218 {
29227 /* Fall through: OpenMP disallows NE_EXPR. */
29230 }
29232 /* If decl is an iterator, preserve LHS and RHS of the relational
29233 expr until finish_omp_for. */
29243 }
29245 /* Helper function, to parse omp for increment expression. */
29247 static tree
29249 {
29253 cp_id_kind idk;
29257 {
29265 }
29273 {
29278 }
29285 {
29289 }
29301 do
29302 {
29309 {
29311 {
29314 else
29316 tf_warning_or_error);
29317 }
29318 else
29321 }
29322 }
29326 {
29330 }
29331 else
29335 }
29337 /* Parse the initialization statement of either an OpenMP for loop or
29338 a Cilk Plus for loop.
29340 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29341 Plus.
29343 Return true if the resulting construct should have an
29344 OMP_CLAUSE_PRIVATE added to it. */
29346 static bool
29354 {
29360 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29362 init-expr:
29363 var = lb
29364 integer-type var = lb
29365 random-access-iterator-type var = lb
29366 pointer-type var = lb
29367 */
29368 cp_decl_specifier_seq type_specifiers;
29370 /* First, try to parse as an initialized declaration. See
29371 cp_parser_condition, from whence the bulk of this is copied. */
29378 {
29379 /* If parsing a type specifier seq succeeded, then this
29380 MUST be a initialized declaration. */
29385 CP_PARSER_DECLARATOR_NAMED,
29396 else
29397 {
29407 {
29409 CPP_OPEN_PAREN))
29410 {
29414 else
29417 }
29418 else
29419 /* Trigger an error. */
29424 }
29428 {
29436 {
29439 auto_node);
29444 }
29447 asm_specification,
29448 LOOKUP_ONLYCONVERTING);
29450 {
29453 }
29454 else
29457 }
29458 else
29459 {
29460 /* Consume '='. */
29464 non_class:
29467 else
29470 asm_specification,
29471 LOOKUP_ONLYCONVERTING);
29472 }
29476 }
29477 }
29478 else
29479 {
29480 cp_id_kind idk;
29481 /* If parsing a type specifier sequence failed, then
29482 this MUST be a simple expression. */
29487 && decl
29490 {
29491 tree rhs;
29498 rhs,
29499 tf_warning_or_error));
29501 }
29502 else
29503 {
29508 {
29512 }
29513 }
29514 }
29516 }
29518 /* Parse the restricted form of the for statement allowed by OpenMP. */
29520 static tree
29523 {
29527 location_t loc_first;
29546 {
29549 location_t loc;
29552 {
29555 }
29564 add_private_clause
29572 {
29575 {
29581 }
29582 else
29584 }
29591 {
29596 {
29600 }
29603 {
29604 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29605 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29610 {
29613 }
29614 else
29615 {
29618 }
29622 }
29623 else
29624 {
29629 }
29630 }
29633 {
29634 tree c;
29636 {
29645 decl);
29649 decl);
29650 }
29652 {
29657 {
29660 }
29661 }
29662 }
29671 {
29672 /* If decl is an iterator, preserve the operator on decl
29673 until finish_omp_for. */
29675 && ((processing_template_decl
29679 else
29683 }
29698 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29699 in between the collapsed for loops to be still considered perfectly
29700 nested. Hopefully the final version clarifies this.
29701 For now handle (multiple) {'s and empty statements. */
29703 do
29704 {
29708 {
29710 bracecount++;
29711 }
29715 else
29716 {
29723 }
29724 }
29728 {
29731 }
29732 }
29734 /* Note that we saved the original contents of this flag when we entered
29735 the structured block, and so we don't need to re-save it here. */
29738 else
29741 /* Note that the grammar doesn't call for a structured block here,
29742 though the loop as a whole is a structured block. */
29749 else
29754 {
29756 {
29758 nbraces--;
29759 }
29762 else
29763 {
29765 {
29768 }
29773 }
29774 }
29781 }
29783 /* Helper function for OpenMP parsing, split clauses and call
29784 finish_omp_clauses on each of the set of clauses afterwards. */
29786 static void
29789 {
29795 }
29797 /* OpenMP 4.0:
29798 #pragma omp simd simd-clause[optseq] new-line
29799 for-loop */
29801 #define OMP_SIMD_CLAUSE_MASK \
29802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29810 static tree
29813 {
29825 {
29828 }
29839 }
29841 /* OpenMP 2.5:
29842 #pragma omp for for-clause[optseq] new-line
29843 for-loop
29845 OpenMP 4.0:
29846 #pragma omp for simd for-simd-clause[optseq] new-line
29847 for-loop */
29849 #define OMP_FOR_CLAUSE_MASK \
29850 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29859 static tree
29862 {
29873 {
29878 {
29886 cclauses);
29890 cclauses);
29902 }
29903 }
29905 {
29908 }
29913 {
29916 }
29927 }
29929 /* OpenMP 2.5:
29930 # pragma omp master new-line
29931 structured-block */
29933 static tree
29935 {
29939 }
29941 /* OpenMP 2.5:
29942 # pragma omp ordered new-line
29943 structured-block */
29945 static tree
29947 {
29951 }
29953 /* OpenMP 2.5:
29955 section-scope:
29956 { section-sequence }
29958 section-sequence:
29959 section-directive[opt] structured-block
29960 section-sequence section-directive structured-block */
29962 static tree
29964 {
29975 {
29979 }
29982 {
29990 {
29994 }
29996 {
29999 }
30004 }
30015 }
30017 /* OpenMP 2.5:
30018 # pragma omp sections sections-clause[optseq] newline
30019 sections-scope */
30021 #define OMP_SECTIONS_CLAUSE_MASK \
30022 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30028 static tree
30031 {
30043 {
30046 }
30053 }
30055 /* OpenMP 2.5:
30056 # pragma omp parallel parallel-clause[optseq] new-line
30057 structured-block
30058 # pragma omp parallel for parallel-for-clause[optseq] new-line
30059 structured-block
30060 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30061 structured-block
30063 OpenMP 4.0:
30064 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30065 structured-block */
30067 #define OMP_PARALLEL_CLAUSE_MASK \
30068 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30078 static tree
30081 {
30090 {
30103 block);
30108 }
30110 {
30114 }
30116 {
30119 }
30121 {
30125 {
30135 block);
30138 }
30139 }
30149 }
30151 /* OpenMP 2.5:
30152 # pragma omp single single-clause[optseq] new-line
30153 structured-block */
30155 #define OMP_SINGLE_CLAUSE_MASK \
30156 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30161 static tree
30163 {
30173 }
30175 /* OpenMP 3.0:
30176 # pragma omp task task-clause[optseq] new-line
30177 structured-block */
30179 #define OMP_TASK_CLAUSE_MASK \
30180 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30190 static tree
30192 {
30203 }
30205 /* OpenMP 3.0:
30206 # pragma omp taskwait new-line */
30208 static void
30210 {
30213 }
30215 /* OpenMP 3.1:
30216 # pragma omp taskyield new-line */
30218 static void
30220 {
30223 }
30225 /* OpenMP 4.0:
30226 # pragma omp taskgroup new-line
30227 structured-block */
30229 static tree
30231 {
30235 }
30238 /* OpenMP 2.5:
30239 # pragma omp threadprivate (variable-list) */
30241 static void
30243 {
30244 tree vars;
30250 }
30252 /* OpenMP 4.0:
30253 # pragma omp cancel cancel-clause[optseq] new-line */
30255 #define OMP_CANCEL_CLAUSE_MASK \
30256 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30262 static void
30264 {
30268 }
30270 /* OpenMP 4.0:
30271 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30273 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30274 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30279 static void
30281 {
30282 tree clauses;
30286 {
30291 {
30294 }
30295 }
30297 {
30301 }
30304 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30306 pragma_tok);
30308 }
30310 /* OpenMP 4.0:
30311 #pragma omp distribute distribute-clause[optseq] new-line
30312 for-loop */
30314 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30315 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30320 static tree
30323 {
30332 {
30340 else
30343 {
30349 {
30352 cclauses);
30353 else
30355 cclauses);
30356 }
30361 cclauses);
30362 else
30364 cclauses);
30376 }
30377 }
30379 {
30382 }
30387 {
30390 }
30401 }
30403 /* OpenMP 4.0:
30404 # pragma omp teams teams-clause[optseq] new-line
30405 structured-block */
30407 #define OMP_TEAMS_CLAUSE_MASK \
30408 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30416 static tree
30419 {
30428 {
30432 {
30440 cclauses);
30444 cclauses);
30455 }
30456 }
30458 {
30461 }
30466 {
30469 }
30477 }
30479 /* OpenMP 4.0:
30480 # pragma omp target data target-data-clause[optseq] new-line
30481 structured-block */
30483 #define OMP_TARGET_DATA_CLAUSE_MASK \
30484 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30488 static tree
30490 {
30502 }
30504 /* OpenMP 4.0:
30505 # pragma omp target update target-update-clause[optseq] new-line */
30507 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30513 static bool
30516 {
30518 {
30520 "%<#pragma omp target update%> may only be "
30524 }
30526 tree clauses
30531 {
30533 "%<#pragma omp target update must contain at least one "
30536 }
30544 }
30546 /* OpenMP 4.0:
30547 # pragma omp target target-clause[optseq] new-line
30548 structured-block */
30550 #define OMP_TARGET_CLAUSE_MASK \
30551 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30555 static bool
30558 {
30560 {
30564 }
30567 {
30572 {
30580 {
30582 OMP_TARGET_CLAUSE_MASK,
30583 cclauses);
30585 }
30601 }
30603 {
30606 }
30608 {
30612 }
30614 {
30617 }
30618 }
30632 }
30634 /* OpenMP 4.0:
30635 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30637 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30638 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30645 static void
30648 {
30650 cp_omp_declare_simd_data data;
30652 {
30657 }
30668 {
30672 {
30685 }
30690 "%<#pragma omp declare simd%> not immediately followed by "
30694 }
30695 }
30697 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30698 This function is modelled similar to the late parsing of omp declare
30699 simd. */
30701 static tree
30703 {
30709 {
30715 }
30717 {
30721 }
30726 {
30733 NULL);
30747 }
30752 }
30754 /* Finalize #pragma omp declare simd clauses after direct declarator has
30755 been parsed, and put that into "omp declare simd" attribute. */
30757 static tree
30759 {
30765 {
30770 }
30775 {
30793 }
30797 }
30800 /* OpenMP 4.0:
30801 # pragma omp declare target new-line
30802 declarations and definitions
30803 # pragma omp end declare target new-line */
30805 static void
30807 {
30810 }
30812 static void
30814 {
30817 {
30820 }
30822 {
30826 {
30829 }
30832 else
30833 {
30837 }
30838 }
30839 else
30840 {
30844 }
30848 "%<#pragma omp end declare target%> without corresponding "
30850 else
30852 }
30854 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30855 expression and optional initializer clause of
30856 #pragma omp declare reduction. We store the expression(s) as
30857 either 3, 6 or 7 special statements inside of the artificial function's
30858 body. The first two statements are DECL_EXPRs for the artificial
30859 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30860 expression that uses those variables.
30861 If there was any INITIALIZER clause, this is followed by further statements,
30862 the fourth and fifth statements are DECL_EXPRs for the artificial
30863 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30864 constructor variant (first token after open paren is not omp_priv),
30865 then the sixth statement is a statement with the function call expression
30866 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30867 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30868 to initialize the OMP_PRIV artificial variable and there is seventh
30869 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30871 static bool
30873 {
30885 tree combiner;
30900 {
30903 }
30906 {
30913 {
30916 }
30932 {
30936 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30940 == CPP_CLOSE_PAREN
30943 {
30947 }
30952 }
30953 else
30954 {
30970 {
30975 }
30977 tree arg;
30990 }
31001 }
31007 }
31009 /* OpenMP 4.0
31010 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31011 initializer-clause[opt] new-line
31013 initializer-clause:
31014 initializer (omp_priv initializer)
31015 initializer (function-name (argument-list)) */
31017 static void
31020 {
31030 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31037 {
31069 }
31081 /* Types may not be defined in declare reduction type list. */
31084 parser->type_definition_forbidden_message
31090 saved_colon_doesnt_start_class_def_p
31095 {
31099 ;
31120 else
31125 else
31127 }
31129 /* Restore the saved message. */
31132 parser->colon_doesnt_start_class_def_p
31137 {
31138 fail:
31141 }
31147 {
31148 tree fntype
31151 NULL_TREE);
31170 {
31175 }
31177 {
31179 {
31188 }
31195 }
31196 else
31197 {
31200 }
31203 else
31206 {
31209 }
31211 {
31214 else
31219 }
31224 else
31225 {
31234 }
31241 }
31245 done:
31246 /* Free any declarators allocated. */
31248 }
31250 /* OpenMP 4.0
31251 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31252 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31253 initializer-clause[opt] new-line
31254 #pragma omp declare target new-line */
31256 static void
31259 {
31261 {
31266 {
31269 context);
31271 }
31274 {
31277 context);
31279 }
31281 {
31284 }
31286 {
31290 }
31291 }
31295 }
31297 /* Main entry point to OpenMP statement pragmas. */
31299 static void
31301 {
31302 tree stmt;
31307 {
31355 }
31359 }
31360 \f
31361 /* Transactional Memory parsing routines. */
31363 /* Parse a transaction attribute.
31365 txn-attribute:
31366 attribute
31367 [ [ identifier ] ]
31369 ??? Simplify this when C++0x bracket attributes are
31370 implemented properly. */
31372 static tree
31374 {
31389 {
31393 /* For keywords, use the canonical spelling,
31394 not the parsed identifier. */
31398 }
31399 else
31403 error1:
31406 }
31408 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31410 transaction-statement:
31411 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31412 compound-statement
31413 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31414 */
31416 static tree
31418 {
31433 else
31434 {
31438 }
31440 /* Parse a noexcept specification. */
31443 /* Keep track if we're in the lexical scope of an outer transaction. */
31455 }
31457 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31459 transaction-expression:
31460 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31461 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31462 */
31464 static tree
31466 {
31491 /* Set this early. This might mean that we allow transaction_cancel in
31492 an expression that we find out later actually has to be a constexpr.
31493 However, we expect that cxx_constant_value will be able to deal with
31494 this; also, if the noexcept has no constexpr, then what we parse next
31495 really is a transaction's body. */
31498 /* Parse a noexcept specification. */
31504 {
31511 }
31512 else
31513 {
31514 /* The only expression that is available got parsed for the noexcept
31515 already. noexcept is true then. */
31518 }
31527 }
31529 /* Parse a function-transaction-block.
31531 function-transaction-block:
31532 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31533 function-body
31534 __transaction_atomic txn-attribute[opt] function-try-block
31535 __transaction_relaxed ctor-initializer[opt] function-body
31536 __transaction_relaxed function-try-block
31537 */
31539 static bool
31541 {
31557 else
31558 {
31562 }
31570 else
31571 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31579 }
31581 /* Parse a __transaction_cancel statement.
31583 cancel-statement:
31584 __transaction_cancel txn-attribute[opt] ;
31585 __transaction_cancel txn-attribute[opt] throw-expression ;
31587 ??? Cancel and throw is not yet implemented. */
31589 static tree
31591 {
31597 RT_TRANSACTION_CANCEL);
31604 /* ??? Parse cancel-and-throw here. */
31609 {
31613 }
31615 {
31619 }
31621 {
31624 {
31630 }
31631 }
31633 {
31637 }
31643 }
31644 \f
31645 /* The parser. */
31649 \f
31650 /* Special handling for the first token or line in the file. The first
31651 thing in the file might be #pragma GCC pch_preprocess, which loads a
31652 PCH file, which is a GC collection point. So we need to handle this
31653 first pragma without benefit of an existing lexer structure.
31655 Always returns one token to the caller in *FIRST_TOKEN. This is
31656 either the true first token of the file, or the first token after
31657 the initial pragma. */
31659 static void
31661 {
31670 {
31677 }
31678 else
31681 /* Skip to the end of the pragma. */
31685 /* Now actually load the PCH file. */
31689 /* Read one more token to return to our caller. We have to do this
31690 after reading the PCH file in, since its pointers have to be
31691 live. */
31693 }
31695 /* Normal parsing of a pragma token. Here we can (and must) use the
31696 regular lexer. */
31698 static bool
31700 {
31712 {
31720 {
31730 }
31735 {
31745 }
31750 {
31756 "%<#pragma omp taskwait%> may only be "
31761 }
31766 {
31772 "%<#pragma omp taskyield%> may only be "
31777 }
31782 {
31788 "%<#pragma omp cancel%> may only be "
31793 }
31798 {
31804 "%<#pragma omp cancellation point%> may only be "
31809 }
31847 "%<#pragma omp section%> may only be used in "
31852 {
31859 {
31862 }
31865 }
31869 {
31873 }
31882 bad_stmt:
31885 }
31889 }
31891 /* The interface the pragma parsers have to the lexer. */
31893 enum cpp_ttype
31895 {
31908 else
31909 {
31913 }
31916 }
31918 \f
31919 /* External interface. */
31921 /* Parse one entire translation unit. */
31923 void
31925 {
31937 }
31939 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31940 vectorlength clause:
31941 Syntax:
31942 vectorlength ( constant-expression ) */
31944 static tree
31947 {
31949 tree expr;
31950 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31951 safelen clause. Thus, vectorlength is represented as OMP 4.0
31952 safelen. For SIMD-enabled function it is represented by OMP 4.0
31953 simdlen. */
31956 loc);
31957 else
31959 loc);
31967 /* If expr == error_mark_node, then don't emit any errors nor
31968 create a clause. if any of the above functions returns
31969 error mark node then they would have emitted an error message. */
31971 ;
31979 else
31980 {
31981 tree c;
31983 {
31988 }
31989 else
31990 {
31995 }
31996 }
32001 }
32003 /* Handles the Cilk Plus #pragma simd linear clause.
32004 Syntax:
32005 linear ( simd-linear-variable-list )
32007 simd-linear-variable-list:
32008 simd-linear-variable
32009 simd-linear-variable-list , simd-linear-variable
32011 simd-linear-variable:
32012 id-expression
32013 id-expression : simd-linear-step
32015 simd-linear-step:
32016 conditional-expression */
32018 static tree
32020 {
32026 {
32030 }
32035 {
32038 {
32042 }
32049 {
32053 }
32054 else
32055 {
32059 /* If present, parse the linear step. Otherwise, assume the default
32060 value of 1. */
32062 {
32069 {
32070 /* If an error has occurred, then the whole pragma is
32071 considered ill-formed. Thus, no reason to keep
32072 parsing. */
32075 }
32083 else
32085 "step size must be an integer constant "
32087 }
32089 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32095 }
32100 else
32101 {
32106 }
32107 }
32111 }
32113 /* Returns the name of the next clause. If the clause is not
32114 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32115 token is not consumed. Otherwise, the appropriate enum from the
32116 pragma_simd_clause is returned and the token is consumed. */
32118 static pragma_omp_clause
32120 {
32121 pragma_omp_clause clause_type;
32138 else
32143 }
32145 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32147 static tree
32149 {
32154 {
32155 pragma_omp_clause c_kind;
32162 /* Use the OpenMP 4.0 equivalent function. */
32165 /* Use the OpenMP 4.0 equivalent function. */
32167 clauses);
32169 /* Use the OMP 4.0 equivalent function. */
32171 clauses);
32173 /* Use the OMP 4.0 equivalent function. */
32175 else
32176 {
32180 }
32181 }
32187 else
32189 }
32191 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32193 static void
32195 {
32202 {
32206 }
32216 }
32218 /* Create an identifier for a generic parameter type (a synthesized
32219 template parameter implied by `auto' or a concept identifier). */
32222 static tree
32224 {
32228 }
32230 /* Predicate that behaves as is_auto_or_concept but matches the parent
32231 node of the generic type rather than the generic type itself. This
32232 allows for type transformation in add_implicit_template_parms. */
32236 {
32238 }
32240 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32241 (creating a new template parameter list if necessary). Returns the newly
32242 created template type parm. */
32244 tree
32246 {
32249 /* We are either continuing a function template that already contains implicit
32250 template parameters, creating a new fully-implicit function template, or
32251 extending an existing explicit function template with implicit template
32252 parameters. */
32260 {
32264 }
32265 else
32266 {
32267 /* Roll back to the existing template parameter scope (in the case of
32268 extending an explicit function template) or introduce a new template
32269 parameter scope ahead of the function parameter scope (or class scope
32270 in the case of out-of-line member definitions). The function scope is
32271 added back after template parameter synthesis below. */
32276 {
32279 }
32281 {
32282 /* If not defining a class, then any class scope is a scope level in
32283 an out-of-line member definition. In this case simply wind back
32284 beyond the first such scope to inject the template parameter list.
32285 Otherwise wind back to the class being defined. The latter can
32286 occur in class member friend declarations such as:
32288 class A {
32289 void foo (auto);
32290 };
32291 class B {
32292 friend void A::foo (auto);
32293 };
32295 The template parameter list synthesized for the friend declaration
32296 must be injected in the scope of 'B'. This can also occur in
32297 erroneous cases such as:
32299 struct A {
32300 struct B {
32301 void foo (auto);
32302 };
32303 void B::foo (auto) {}
32304 };
32306 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32307 but, nevertheless, the template parameter list synthesized for the
32308 declarator should be injected into the scope of 'A' as if the
32309 ill-formed template was specified explicitly. */
32312 {
32315 }
32316 }
32322 {
32323 /* Introduce a new template parameter list for implicit template
32324 parameters. */
32328 parser->implicit_template_scope
32335 }
32336 else
32337 {
32338 /* Synthesize implicit template parameters at the end of the explicit
32339 template parameter list. */
32346 parser->implicit_template_parms
32348 }
32349 }
32351 /* Synthesize a new template parameter and track the current template
32352 parameter chain with implicit_template_parms. */
32356 synth_id);
32357 tree new_parm
32359 input_location,
32366 parser->implicit_template_parms
32368 else
32373 /* If creating a fully implicit function template, start the new implicit
32374 template parameter list with this synthesized type, otherwise grow the
32375 current template parameter list. */
32378 {
32385 }
32386 else
32387 {
32392 }
32397 }
32399 /* Finish the declaration of a fully implicit function template. Such a
32400 template has no explicit template parameter list so has not been through the
32401 normal template head and tail processing. synthesize_implicit_template_parm
32402 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32403 provided if the declaration is a class member such that its template
32404 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32405 form is returned. Otherwise NULL_TREE is returned. */
32407 tree
32409 {
32414 {
32418 }
32428 }