| blob | 987a903c194c3620803345f84d388b3196c8661c |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 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/>. */
65 \f
66 /* The lexer. */
68 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
69 and c-lex.c) and the C++ parser. */
72 {
74 };
76 /* The various kinds of non integral constant we encounter. */
78 NIC_NONE,
79 /* floating-point literal */
80 NIC_FLOAT,
81 /* %<this%> */
82 NIC_THIS,
83 /* %<__FUNCTION__%> */
84 NIC_FUNC_NAME,
85 /* %<__PRETTY_FUNCTION__%> */
86 NIC_PRETTY_FUNC,
87 /* %<__func__%> */
88 NIC_C99_FUNC,
89 /* "%<va_arg%> */
90 NIC_VA_ARG,
91 /* a cast */
92 NIC_CAST,
93 /* %<typeid%> operator */
94 NIC_TYPEID,
95 /* non-constant compound literals */
96 NIC_NCC,
97 /* a function call */
98 NIC_FUNC_CALL,
99 /* an increment */
100 NIC_INC,
101 /* an decrement */
102 NIC_DEC,
103 /* an array reference */
104 NIC_ARRAY_REF,
105 /* %<->%> */
106 NIC_ARROW,
107 /* %<.%> */
108 NIC_POINT,
109 /* the address of a label */
110 NIC_ADDR_LABEL,
111 /* %<*%> */
112 NIC_STAR,
113 /* %<&%> */
114 NIC_ADDR,
115 /* %<++%> */
116 NIC_PREINCREMENT,
117 /* %<--%> */
118 NIC_PREDECREMENT,
119 /* %<new%> */
120 NIC_NEW,
121 /* %<delete%> */
122 NIC_DEL,
123 /* calls to overloaded operators */
124 NIC_OVERLOADED,
125 /* an assignment */
126 NIC_ASSIGNMENT,
127 /* a comma operator */
128 NIC_COMMA,
129 /* a call to a constructor */
130 NIC_CONSTRUCTOR,
131 /* a transaction expression */
132 NIC_TRANSACTION
135 /* The various kinds of errors about name-lookup failing. */
137 /* NULL */
138 NLE_NULL,
139 /* is not a type */
140 NLE_TYPE,
141 /* is not a class or namespace */
142 NLE_CXX98,
143 /* is not a class, namespace, or enumeration */
144 NLE_NOT_CXX98
147 /* The various kinds of required token */
149 RT_NONE,
171 /* The type is CPP_KEYWORD */
200 RT_TRANSACTION_CANCEL /* __transaction_cancel */
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static tree cp_literal_operator_id
257 static void cp_parser_cilk_simd
259 static tree cp_parser_cilk_for
261 static bool cp_parser_omp_declare_reduction_exprs
263 static tree cp_parser_cilk_simd_vectorlength
266 /* Manifest constants. */
267 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
268 #define CP_SAVED_TOKEN_STACK 5
270 /* Variables. */
272 /* The stream to which debugging output should be written. */
275 /* Nonzero if we are parsing an unevaluated operand: an operand to
276 sizeof, typeof, or alignof. */
279 /* Dump up to NUM tokens in BUFFER to FILE starting with token
280 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
281 first token in BUFFER. If NUM is 0, dump all the tokens. If
282 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
283 highlighted by surrounding it in [[ ]]. */
285 static void
289 {
306 {
309 }
314 {
321 nprinted++;
331 {
341 }
342 }
345 {
348 }
351 }
354 /* Dump all tokens in BUFFER to stderr. */
356 void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
366 }
368 DEBUG_FUNCTION void
370 {
373 else
375 }
378 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
379 description for T. */
381 static void
383 {
385 {
388 }
389 }
392 /* Dump parser context C to FILE. */
394 static void
396 {
401 }
404 /* Print the stack of parsing contexts to FILE starting with FIRST. */
406 static void
408 {
414 {
417 }
418 }
421 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
423 static void
425 {
428 }
431 /* Print an unparsed function entry UF to FILE. */
433 static void
435 {
438 tree fn;
443 i++)
444 {
450 }
455 {
458 }
464 {
467 }
469 }
472 /* Print the stack of unparsed member functions S to FILE. */
474 static void
477 {
483 {
486 }
487 }
490 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
491 the given PARSER. If FILE is NULL, the output is printed on stderr. */
493 static void
495 {
507 next_token);
508 }
511 /* Dump debugging information for the given PARSER. If FILE is NULL,
512 the output is printed on stderr. */
514 void
516 {
519 expanded_location eloc;
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* Returns nonzero if debugging information should be output. */
717 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
757 }
759 /* nonzero if we are presently saving tokens. */
763 {
765 }
767 /* Store the next token from the preprocessor in *TOKEN. Return true
768 if we reach EOF. If LEXER is NULL, assume we are handling an
769 initial #pragma pch_preprocess, and thus want the lexer to return
770 processed strings. */
772 static void
774 {
777 /* Get a new token from the preprocessor. */
778 token->type
786 /* On some systems, some header files are surrounded by an
787 implicit extern "C" block. Set a flag in the token if it
788 comes from such a header. */
793 /* Check to see if this token is a keyword. */
795 {
797 {
798 /* Mark this token as a keyword. */
800 /* Record which keyword. */
802 }
803 else
804 {
808 {
809 /* Warn about the C++0x keyword (but still treat it as
810 an identifier). */
815 /* Clear out the C_RID_CODE so we don't warn about this
816 particular identifier-turned-keyword again. */
818 }
821 }
822 }
824 {
825 /* This only happens in Objective-C++; it must be a keyword. */
828 {
829 /* Replace 'class' with '@class', 'private' with '@private',
830 etc. This prevents confusion with the C++ keyword
831 'class', and makes the tokens consistent with other
832 Objective-C 'AT' keywords. For example '@class' is
833 reported as RID_AT_CLASS which is consistent with
834 '@synchronized', which is reported as
835 RID_AT_SYNCHRONIZED.
836 */
845 }
846 }
848 {
849 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if the next token is a keyword for a decl-specifier. */
935 static bool
937 {
942 {
943 /* auto specifier: storage-class-specifier in C++,
944 simple-type-specifier in C++0x. */
946 /* Storage classes. */
952 /* Elaborated type specifiers. */
958 /* Simple type specifiers. */
972 /* GNU extensions. */
975 /* C++0x extensions. */
986 }
987 }
989 /* Returns TRUE iff the token T begins a decltype type. */
991 static bool
993 {
996 }
998 /* Returns TRUE iff the next token begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Return a pointer to the Nth token in the token stream. If N is 1,
1008 then this is precisely equivalent to cp_lexer_peek_token (except
1009 that it is not inline). One would like to disallow that case, but
1010 there is one case (cp_parser_nth_token_starts_template_id) where
1011 the caller passes a variable for N and it might be 1. */
1015 {
1018 /* N is 1-based, not zero-based. */
1029 {
1032 {
1035 }
1039 }
1042 {
1045 }
1048 }
1050 /* Return the next token, and advance the lexer's next_token pointer
1051 to point to the next non-purged token. */
1055 {
1061 do
1062 {
1065 {
1068 }
1070 }
1075 /* Provide debugging output. */
1077 {
1081 }
1084 }
1086 /* Permanently remove the next token from the token stream, and
1087 advance the next_token pointer to refer to the next non-purged
1088 token. */
1090 static void
1092 {
1101 do
1102 {
1103 tok++;
1105 {
1108 }
1109 }
1112 }
1114 /* Permanently remove all tokens after TOK, up to, but not
1115 including, the token that will be returned next by
1116 cp_lexer_peek_token. */
1118 static void
1120 {
1129 {
1134 }
1135 }
1137 /* Begin saving tokens. All tokens consumed after this point will be
1138 preserved. */
1140 static void
1142 {
1143 /* Provide debugging output. */
1148 }
1150 /* Commit to the portion of the token stream most recently saved. */
1152 static void
1154 {
1155 /* Provide debugging output. */
1160 }
1162 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1163 to the token stream. Stop saving tokens. */
1165 static void
1167 {
1168 /* Provide debugging output. */
1173 }
1175 /* RAII wrapper around the above functions, with sanity checking. Creating
1176 a variable saves tokens, which are committed when the variable is
1177 destroyed unless they are explicitly rolled back by calling the rollback
1178 member function. */
1180 struct saved_token_sentinel
1181 {
1186 {
1189 }
1191 {
1194 }
1196 {
1200 }
1201 };
1203 /* Print a representation of the TOKEN on the STREAM. */
1205 static void
1207 {
1208 /* We don't use cpp_type2name here because the parser defines
1209 a few tokens of its own. */
1211 /* cpplib-defined token types */
1212 #define OP(e, s) #e,
1213 #define TK(e, s) #e,
1214 TTYPE_TABLE
1215 #undef OP
1216 #undef TK
1217 /* C++ parser token types - see "Manifest constants", above. */
1221 };
1223 /* For some tokens, print the associated data. */
1225 {
1227 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1228 For example, `struct' is mapped to an INTEGER_CST. */
1231 /* else fall through */
1249 /* If we have a name for the token, print it out. Otherwise, we
1250 simply give the numeric code. */
1253 else
1256 }
1257 }
1259 DEBUG_FUNCTION void
1261 {
1264 }
1266 DEBUG_FUNCTION void
1268 {
1271 else
1273 }
1276 /* Start emitting debugging information. */
1278 static void
1280 {
1283 }
1285 /* Stop emitting debugging information. */
1287 static void
1289 {
1292 }
1294 /* Create a new cp_token_cache, representing a range of tokens. */
1298 {
1303 }
1305 /* Diagnose if #pragma omp declare simd isn't followed immediately
1306 by function declaration or definition. */
1310 {
1312 {
1316 }
1317 }
1319 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1320 and put that into "omp declare simd" attribute. */
1324 {
1326 {
1328 {
1331 }
1333 {
1336 }
1337 }
1338 }
1339 \f
1340 /* Decl-specifiers. */
1342 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1344 static void
1346 {
1348 }
1350 /* Declarators. */
1352 /* Nothing other than the parser should be creating declarators;
1353 declarators are a semi-syntactic representation of C++ entities.
1354 Other parts of the front end that need to create entities (like
1355 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1370 /* An erroneous declarator. */
1373 /* The obstack on which declarators and related data structures are
1374 allocated. */
1377 /* Alloc BYTES from the declarator memory pool. */
1381 {
1383 }
1385 /* Allocate a declarator of the indicated KIND. Clear fields that are
1386 common to all declarators. */
1390 {
1402 }
1404 /* Make a declarator for a generalized identifier. If
1405 QUALIFYING_SCOPE is non-NULL, the identifier is
1406 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1407 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1408 is, if any. */
1412 special_function_kind sfk)
1413 {
1416 /* It is valid to write:
1418 class C { void f(); };
1419 typedef C D;
1420 void D::f();
1422 The standard is not clear about whether `typedef const C D' is
1423 legal; as of 2002-09-15 the committee is considering that
1424 question. EDG 3.0 allows that syntax. Therefore, we do as
1425 well. */
1439 }
1441 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1442 of modifiers such as const or volatile to apply to the pointer
1443 type, represented as identifiers. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1448 tree attributes)
1449 {
1457 {
1461 }
1462 else
1468 }
1470 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1471 represent the attributes that appertain to the pointer or
1472 reference. */
1474 cp_declarator *
1477 {
1485 {
1489 }
1490 else
1496 }
1498 /* Like make_pointer_declarator -- but for a pointer to a non-static
1499 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1500 appertain to the pointer or reference. */
1502 cp_declarator *
1505 tree attributes)
1506 {
1515 {
1518 }
1519 else
1525 }
1527 /* Make a declarator for the function given by TARGET, with the
1528 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1529 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1530 indicates what exceptions can be thrown. */
1532 cp_declarator *
1534 tree parms,
1535 cp_cv_quals cv_qualifiers,
1536 cp_virt_specifiers virt_specifiers,
1537 cp_ref_qualifier ref_qualifier,
1538 tree exception_specification,
1539 tree late_return_type)
1540 {
1552 {
1556 }
1557 else
1561 }
1563 /* Make a declarator for an array of BOUNDS elements, each of which is
1564 defined by ELEMENT. */
1566 cp_declarator *
1568 {
1575 {
1579 }
1580 else
1584 }
1586 /* Determine whether the declarator we've seen so far can be a
1587 parameter pack, when followed by an ellipsis. */
1588 static bool
1590 {
1591 /* Search for a declarator name, or any other declarator that goes
1592 after the point where the ellipsis could appear in a parameter
1593 pack. If we find any of these, then this declarator can not be
1594 made into a parameter pack. */
1597 {
1599 {
1611 }
1612 }
1615 }
1619 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1620 DECLARATOR and DEFAULT_ARGUMENT. */
1622 cp_parameter_declarator *
1625 tree default_argument)
1626 {
1634 else
1641 }
1643 /* Returns true iff DECLARATOR is a declaration for a function. */
1645 static bool
1647 {
1649 {
1657 }
1659 }
1661 /* The parser. */
1663 /* Overview
1664 --------
1666 A cp_parser parses the token stream as specified by the C++
1667 grammar. Its job is purely parsing, not semantic analysis. For
1668 example, the parser breaks the token stream into declarators,
1669 expressions, statements, and other similar syntactic constructs.
1670 It does not check that the types of the expressions on either side
1671 of an assignment-statement are compatible, or that a function is
1672 not declared with a parameter of type `void'.
1674 The parser invokes routines elsewhere in the compiler to perform
1675 semantic analysis and to build up the abstract syntax tree for the
1676 code processed.
1678 The parser (and the template instantiation code, which is, in a
1679 way, a close relative of parsing) are the only parts of the
1680 compiler that should be calling push_scope and pop_scope, or
1681 related functions. The parser (and template instantiation code)
1682 keeps track of what scope is presently active; everything else
1683 should simply honor that. (The code that generates static
1684 initializers may also need to set the scope, in order to check
1685 access control correctly when emitting the initializers.)
1687 Methodology
1688 -----------
1690 The parser is of the standard recursive-descent variety. Upcoming
1691 tokens in the token stream are examined in order to determine which
1692 production to use when parsing a non-terminal. Some C++ constructs
1693 require arbitrary look ahead to disambiguate. For example, it is
1694 impossible, in the general case, to tell whether a statement is an
1695 expression or declaration without scanning the entire statement.
1696 Therefore, the parser is capable of "parsing tentatively." When the
1697 parser is not sure what construct comes next, it enters this mode.
1698 Then, while we attempt to parse the construct, the parser queues up
1699 error messages, rather than issuing them immediately, and saves the
1700 tokens it consumes. If the construct is parsed successfully, the
1701 parser "commits", i.e., it issues any queued error messages and
1702 the tokens that were being preserved are permanently discarded.
1703 If, however, the construct is not parsed successfully, the parser
1704 rolls back its state completely so that it can resume parsing using
1705 a different alternative.
1707 Future Improvements
1708 -------------------
1710 The performance of the parser could probably be improved substantially.
1711 We could often eliminate the need to parse tentatively by looking ahead
1712 a little bit. In some places, this approach might not entirely eliminate
1713 the need to parse tentatively, but it might still speed up the average
1714 case. */
1716 /* Flags that are passed to some parsing functions. These values can
1717 be bitwise-ored together. */
1719 enum
1720 {
1721 /* No flags. */
1723 /* The construct is optional. If it is not present, then no error
1724 should be issued. */
1726 /* When parsing a type-specifier, treat user-defined type-names
1727 as non-type identifiers. */
1729 /* When parsing a type-specifier, do not try to parse a class-specifier
1730 or enum-specifier. */
1732 /* When parsing a decl-specifier-seq, only allow type-specifier or
1733 constexpr. */
1735 };
1737 /* This type is used for parameters and variables which hold
1738 combinations of the above flags. */
1741 /* The different kinds of declarators we want to parse. */
1744 {
1745 /* We want an abstract declarator. */
1746 CP_PARSER_DECLARATOR_ABSTRACT,
1747 /* We want a named declarator. */
1748 CP_PARSER_DECLARATOR_NAMED,
1749 /* We don't mind, but the name must be an unqualified-id. */
1750 CP_PARSER_DECLARATOR_EITHER
1753 /* The precedence values used to parse binary expressions. The minimum value
1754 of PREC must be 1, because zero is reserved to quickly discriminate
1755 binary operators from other tokens. */
1757 enum cp_parser_prec
1758 {
1759 PREC_NOT_OPERATOR,
1760 PREC_LOGICAL_OR_EXPRESSION,
1761 PREC_LOGICAL_AND_EXPRESSION,
1762 PREC_INCLUSIVE_OR_EXPRESSION,
1763 PREC_EXCLUSIVE_OR_EXPRESSION,
1764 PREC_AND_EXPRESSION,
1765 PREC_EQUALITY_EXPRESSION,
1766 PREC_RELATIONAL_EXPRESSION,
1767 PREC_SHIFT_EXPRESSION,
1768 PREC_ADDITIVE_EXPRESSION,
1769 PREC_MULTIPLICATIVE_EXPRESSION,
1770 PREC_PM_EXPRESSION,
1771 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1772 };
1774 /* A mapping from a token type to a corresponding tree node type, with a
1775 precedence value. */
1778 {
1779 /* The token type. */
1781 /* The corresponding tree code. */
1783 /* The precedence of this operator. */
1788 {
1789 /* Left hand side of the binary operation we are currently
1790 parsing. */
1791 tree lhs;
1792 /* Original tree code for left hand side, if it was a binary
1793 expression itself (used for -Wparentheses). */
1795 /* Tree code for the binary operation we are parsing. */
1797 /* Precedence of the binary operation we are parsing. */
1799 /* Location of the binary operation we are parsing. */
1800 location_t loc;
1803 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1804 entries because precedence levels on the stack are monotonically
1805 increasing. */
1809 /* Prototypes. */
1811 /* Constructors and destructors. */
1816 /* Class variables. */
1820 /* The operator-precedence table used by cp_parser_binary_expression.
1821 Transformed into an associative array (binops_by_token) by
1822 cp_parser_new. */
1855 };
1857 /* The same as binops, but initialized by cp_parser_new so that
1858 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1859 for speed. */
1862 /* Constructors and destructors. */
1864 /* Construct a new context. The context below this one on the stack
1865 is given by NEXT. */
1869 {
1872 /* Allocate the storage. */
1874 {
1875 /* Pull the first entry from the free list. */
1879 }
1880 else
1883 /* No errors have occurred yet in this context. */
1885 /* If this is not the bottommost context, copy information that we
1886 need from the previous context. */
1888 {
1889 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1890 expression, then we are parsing one in this context, too. */
1892 /* Thread the stack. */
1894 }
1897 }
1899 /* Managing the unparsed function queues. */
1901 #define unparsed_funs_with_default_args \
1902 parser->unparsed_queues->last ().funs_with_default_args
1903 #define unparsed_funs_with_definitions \
1904 parser->unparsed_queues->last ().funs_with_definitions
1905 #define unparsed_nsdmis \
1906 parser->unparsed_queues->last ().nsdmis
1907 #define unparsed_classes \
1908 parser->unparsed_queues->last ().classes
1910 static void
1912 {
1915 }
1917 static void
1919 {
1922 }
1924 /* Prototypes. */
1926 /* Constructors and destructors. */
1931 /* Routines to parse various constructs.
1933 Those that return `tree' will return the error_mark_node (rather
1934 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1935 Sometimes, they will return an ordinary node if error-recovery was
1936 attempted, even though a parse error occurred. So, to check
1937 whether or not a parse error occurred, you should always use
1938 cp_parser_error_occurred. If the construct is optional (indicated
1939 either by an `_opt' in the name of the function that does the
1940 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1941 the construct is not present. */
1943 /* Lexical conventions [gram.lex] */
1945 static tree cp_parser_identifier
1947 static tree cp_parser_string_literal
1949 static tree cp_parser_userdef_char_literal
1951 static tree cp_parser_userdef_string_literal
1953 static tree cp_parser_userdef_numeric_literal
1956 /* Basic concepts [gram.basic] */
1958 static bool cp_parser_translation_unit
1961 /* Expressions [gram.expr] */
1963 static tree cp_parser_primary_expression
1965 static tree cp_parser_id_expression
1967 static tree cp_parser_unqualified_id
1969 static tree cp_parser_nested_name_specifier_opt
1971 static tree cp_parser_nested_name_specifier
1973 static tree cp_parser_qualifying_entity
1975 static tree cp_parser_postfix_expression
1977 static tree cp_parser_postfix_open_square_expression
1979 static tree cp_parser_postfix_dot_deref_expression
1983 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1985 static void cp_parser_pseudo_destructor_name
1987 static tree cp_parser_unary_expression
1989 static enum tree_code cp_parser_unary_operator
1991 static tree cp_parser_new_expression
1995 static tree cp_parser_new_type_id
2003 static tree cp_parser_delete_expression
2005 static tree cp_parser_cast_expression
2007 static tree cp_parser_binary_expression
2009 static tree cp_parser_question_colon_clause
2011 static tree cp_parser_assignment_expression
2013 static enum tree_code cp_parser_assignment_operator_opt
2015 static tree cp_parser_expression
2017 static tree cp_parser_constant_expression
2019 static tree cp_parser_builtin_offsetof
2021 static tree cp_parser_lambda_expression
2023 static void cp_parser_lambda_introducer
2025 static bool cp_parser_lambda_declarator_opt
2027 static void cp_parser_lambda_body
2030 /* Statements [gram.stmt.stmt] */
2032 static void cp_parser_statement
2034 static void cp_parser_label_for_labeled_statement
2036 static tree cp_parser_expression_statement
2038 static tree cp_parser_compound_statement
2040 static void cp_parser_statement_seq_opt
2042 static tree cp_parser_selection_statement
2044 static tree cp_parser_condition
2046 static tree cp_parser_iteration_statement
2048 static bool cp_parser_for_init_statement
2050 static tree cp_parser_for
2052 static tree cp_parser_c_for
2054 static tree cp_parser_range_for
2056 static void do_range_for_auto_deduction
2058 static tree cp_parser_perform_range_for_lookup
2060 static tree cp_parser_range_for_member_function
2062 static tree cp_parser_jump_statement
2064 static void cp_parser_declaration_statement
2067 static tree cp_parser_implicitly_scoped_statement
2069 static void cp_parser_already_scoped_statement
2072 /* Declarations [gram.dcl.dcl] */
2074 static void cp_parser_declaration_seq_opt
2076 static void cp_parser_declaration
2078 static void cp_parser_block_declaration
2080 static void cp_parser_simple_declaration
2082 static void cp_parser_decl_specifier_seq
2084 static tree cp_parser_storage_class_specifier_opt
2086 static tree cp_parser_function_specifier_opt
2088 static tree cp_parser_type_specifier
2091 static tree cp_parser_simple_type_specifier
2093 static tree cp_parser_type_name
2095 static tree cp_parser_nonclass_name
2097 static tree cp_parser_elaborated_type_specifier
2099 static tree cp_parser_enum_specifier
2101 static void cp_parser_enumerator_list
2103 static void cp_parser_enumerator_definition
2105 static tree cp_parser_namespace_name
2107 static void cp_parser_namespace_definition
2109 static void cp_parser_namespace_body
2111 static tree cp_parser_qualified_namespace_specifier
2113 static void cp_parser_namespace_alias_definition
2115 static bool cp_parser_using_declaration
2117 static void cp_parser_using_directive
2119 static tree cp_parser_alias_declaration
2121 static void cp_parser_asm_definition
2123 static void cp_parser_linkage_specification
2125 static void cp_parser_static_assert
2127 static tree cp_parser_decltype
2130 /* Declarators [gram.dcl.decl] */
2132 static tree cp_parser_init_declarator
2139 static enum tree_code cp_parser_ptr_operator
2141 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2143 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2145 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2147 static tree cp_parser_late_return_type_opt
2149 static tree cp_parser_declarator_id
2151 static tree cp_parser_type_id
2153 static tree cp_parser_template_type_arg
2156 static tree cp_parser_type_id_1
2158 static void cp_parser_type_specifier_seq
2160 static tree cp_parser_parameter_declaration_clause
2162 static tree cp_parser_parameter_declaration_list
2166 static tree cp_parser_default_argument
2168 static void cp_parser_function_body
2170 static tree cp_parser_initializer
2172 static tree cp_parser_initializer_clause
2174 static tree cp_parser_braced_list
2179 static bool cp_parser_ctor_initializer_opt_and_function_body
2182 static tree cp_parser_late_parsing_omp_declare_simd
2185 static tree cp_parser_late_parsing_cilk_simd_fn_info
2188 static tree synthesize_implicit_template_parm
2190 static tree finish_fully_implicit_template
2193 /* Classes [gram.class] */
2195 static tree cp_parser_class_name
2197 static tree cp_parser_class_specifier
2199 static tree cp_parser_class_head
2201 static enum tag_types cp_parser_class_key
2203 static void cp_parser_type_parameter_key
2205 static void cp_parser_member_specification_opt
2207 static void cp_parser_member_declaration
2209 static tree cp_parser_pure_specifier
2211 static tree cp_parser_constant_initializer
2214 /* Derived classes [gram.class.derived] */
2216 static tree cp_parser_base_clause
2218 static tree cp_parser_base_specifier
2221 /* Special member functions [gram.special] */
2223 static tree cp_parser_conversion_function_id
2225 static tree cp_parser_conversion_type_id
2229 static bool cp_parser_ctor_initializer_opt
2231 static void cp_parser_mem_initializer_list
2233 static tree cp_parser_mem_initializer
2235 static tree cp_parser_mem_initializer_id
2238 /* Overloading [gram.over] */
2240 static tree cp_parser_operator_function_id
2242 static tree cp_parser_operator
2245 /* Templates [gram.temp] */
2247 static void cp_parser_template_declaration
2249 static tree cp_parser_template_parameter_list
2251 static tree cp_parser_template_parameter
2253 static tree cp_parser_type_parameter
2255 static tree cp_parser_template_id
2257 static tree cp_parser_template_name
2259 static tree cp_parser_template_argument_list
2261 static tree cp_parser_template_argument
2263 static void cp_parser_explicit_instantiation
2265 static void cp_parser_explicit_specialization
2268 /* Exception handling [gram.exception] */
2270 static tree cp_parser_try_block
2272 static bool cp_parser_function_try_block
2274 static void cp_parser_handler_seq
2276 static void cp_parser_handler
2278 static tree cp_parser_exception_declaration
2280 static tree cp_parser_throw_expression
2282 static tree cp_parser_exception_specification_opt
2284 static tree cp_parser_type_id_list
2287 /* GNU Extensions */
2289 static tree cp_parser_asm_specification_opt
2291 static tree cp_parser_asm_operand_list
2293 static tree cp_parser_asm_clobber_list
2295 static tree cp_parser_asm_label_list
2297 static bool cp_next_tokens_can_be_attribute_p
2299 static bool cp_next_tokens_can_be_gnu_attribute_p
2301 static bool cp_next_tokens_can_be_std_attribute_p
2303 static bool cp_nth_tokens_can_be_std_attribute_p
2305 static bool cp_nth_tokens_can_be_gnu_attribute_p
2307 static bool cp_nth_tokens_can_be_attribute_p
2309 static tree cp_parser_attributes_opt
2311 static tree cp_parser_gnu_attributes_opt
2313 static tree cp_parser_gnu_attribute_list
2315 static tree cp_parser_std_attribute
2317 static tree cp_parser_std_attribute_spec
2319 static tree cp_parser_std_attribute_spec_seq
2321 static bool cp_parser_extension_opt
2323 static void cp_parser_label_declaration
2326 /* Transactional Memory Extensions */
2328 static tree cp_parser_transaction
2330 static tree cp_parser_transaction_expression
2332 static bool cp_parser_function_transaction
2334 static tree cp_parser_transaction_cancel
2338 pragma_external,
2339 pragma_member,
2340 pragma_objc_icode,
2341 pragma_stmt,
2342 pragma_compound
2343 };
2344 static bool cp_parser_pragma
2347 /* Objective-C++ Productions */
2349 static tree cp_parser_objc_message_receiver
2351 static tree cp_parser_objc_message_args
2353 static tree cp_parser_objc_message_expression
2355 static tree cp_parser_objc_encode_expression
2357 static tree cp_parser_objc_defs_expression
2359 static tree cp_parser_objc_protocol_expression
2361 static tree cp_parser_objc_selector_expression
2363 static tree cp_parser_objc_expression
2365 static bool cp_parser_objc_selector_p
2367 static tree cp_parser_objc_selector
2369 static tree cp_parser_objc_protocol_refs_opt
2371 static void cp_parser_objc_declaration
2373 static tree cp_parser_objc_statement
2375 static bool cp_parser_objc_valid_prefix_attributes
2377 static void cp_parser_objc_at_property_declaration
2379 static void cp_parser_objc_at_synthesize_declaration
2381 static void cp_parser_objc_at_dynamic_declaration
2383 static tree cp_parser_objc_struct_declaration
2386 /* Utility Routines */
2388 static tree cp_parser_lookup_name
2390 static tree cp_parser_lookup_name_simple
2392 static tree cp_parser_maybe_treat_template_as_class
2394 static bool cp_parser_check_declarator_template_parameters
2396 static bool cp_parser_check_template_parameters
2398 static tree cp_parser_simple_cast_expression
2400 static tree cp_parser_global_scope_opt
2402 static bool cp_parser_constructor_declarator_p
2404 static tree cp_parser_function_definition_from_specifiers_and_declarator
2406 static tree cp_parser_function_definition_after_declarator
2408 static void cp_parser_template_declaration_after_export
2410 static void cp_parser_perform_template_parameter_access_checks
2412 static tree cp_parser_single_declaration
2414 static tree cp_parser_functional_cast
2416 static tree cp_parser_save_member_function_body
2418 static tree cp_parser_save_nsdmi
2420 static tree cp_parser_enclosed_template_argument_list
2422 static void cp_parser_save_default_args
2424 static void cp_parser_late_parsing_for_member
2426 static tree cp_parser_late_parse_one_default_arg
2428 static void cp_parser_late_parsing_nsdmi
2430 static void cp_parser_late_parsing_default_args
2432 static tree cp_parser_sizeof_operand
2434 static tree cp_parser_trait_expr
2436 static bool cp_parser_declares_only_class_p
2438 static void cp_parser_set_storage_class
2440 static void cp_parser_set_decl_spec_type
2442 static void set_and_check_decl_spec_loc
2445 static bool cp_parser_friend_p
2447 static void cp_parser_required_error
2453 static bool cp_parser_token_starts_function_definition_p
2455 static bool cp_parser_next_token_starts_class_definition_p
2457 static bool cp_parser_next_token_ends_template_argument_p
2459 static bool cp_parser_nth_token_starts_template_argument_list_p
2461 static enum tag_types cp_parser_token_is_class_key
2463 static enum tag_types cp_parser_token_is_type_parameter_key
2465 static void cp_parser_check_class_key
2467 static void cp_parser_check_access_in_redeclaration
2469 static bool cp_parser_optional_template_keyword
2471 static void cp_parser_pre_parsed_nested_name_specifier
2473 static bool cp_parser_cache_group
2475 static tree cp_parser_cache_defarg
2477 static void cp_parser_parse_tentatively
2479 static void cp_parser_commit_to_tentative_parse
2481 static void cp_parser_commit_to_topmost_tentative_parse
2483 static void cp_parser_abort_tentative_parse
2485 static bool cp_parser_parse_definitely
2489 static bool cp_parser_uncommitted_to_tentative_parse_p
2491 static void cp_parser_error
2493 static void cp_parser_name_lookup_error
2495 static bool cp_parser_simulate_error
2497 static bool cp_parser_check_type_definition
2499 static void cp_parser_check_for_definition_in_return_type
2501 static void cp_parser_check_for_invalid_template_id
2503 static bool cp_parser_non_integral_constant_expression
2505 static void cp_parser_diagnose_invalid_type_name
2507 static bool cp_parser_parse_and_diagnose_invalid_type_name
2509 static int cp_parser_skip_to_closing_parenthesis
2511 static void cp_parser_skip_to_end_of_statement
2513 static void cp_parser_consume_semicolon_at_end_of_statement
2515 static void cp_parser_skip_to_end_of_block_or_statement
2517 static bool cp_parser_skip_to_closing_brace
2519 static void cp_parser_skip_to_end_of_template_parameter_list
2521 static void cp_parser_skip_to_pragma_eol
2523 static bool cp_parser_error_occurred
2525 static bool cp_parser_allow_gnu_extensions_p
2527 static bool cp_parser_is_pure_string_literal
2529 static bool cp_parser_is_string_literal
2531 static bool cp_parser_is_keyword
2533 static tree cp_parser_make_typename_type
2537 static bool cp_parser_compound_literal_p
2539 static bool cp_parser_array_designator_p
2541 static bool cp_parser_skip_to_closing_square_bracket
2544 /* Returns nonzero if we are parsing tentatively. */
2548 {
2550 }
2552 /* Returns nonzero if TOKEN is a string literal. */
2554 static bool
2556 {
2562 }
2564 /* Returns nonzero if TOKEN is a string literal
2565 of a user-defined string literal. */
2567 static bool
2569 {
2576 }
2578 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2580 static bool
2582 {
2584 }
2586 /* If not parsing tentatively, issue a diagnostic of the form
2587 FILE:LINE: MESSAGE before TOKEN
2588 where TOKEN is the next token in the input stream. MESSAGE
2589 (specified by the caller) is usually of the form "expected
2590 OTHER-TOKEN". */
2592 static void
2594 {
2596 {
2598 /* This diagnostic makes more sense if it is tagged to the line
2599 of the token we just peeked at. */
2603 {
2608 }
2611 /* Because c_parser_error does not understand
2612 CPP_KEYWORD, keywords are treated like
2613 identifiers. */
2616 }
2617 }
2619 /* Issue an error about name-lookup failing. NAME is the
2620 IDENTIFIER_NODE DECL is the result of
2621 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2622 the thing that we hoped to find. */
2624 static void
2626 tree name,
2627 tree decl,
2628 name_lookup_error desired,
2629 location_t location)
2630 {
2631 /* If name lookup completely failed, tell the user that NAME was not
2632 declared. */
2634 {
2647 else
2649 }
2651 {
2653 {
2670 }
2671 }
2673 {
2675 {
2685 name);
2689 }
2690 }
2691 else
2692 {
2694 {
2707 }
2708 }
2709 }
2711 /* If we are parsing tentatively, remember that an error has occurred
2712 during this tentative parse. Returns true if the error was
2713 simulated; false if a message should be issued by the caller. */
2715 static bool
2717 {
2719 {
2722 }
2724 }
2726 /* This function is called when a type is defined. If type
2727 definitions are forbidden at this point, an error message is
2728 issued. */
2730 static bool
2732 {
2733 /* If types are forbidden here, issue a message. */
2735 {
2736 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2737 in the message need to be interpreted. */
2740 }
2742 }
2744 /* This function is called when the DECLARATOR is processed. The TYPE
2745 was a type defined in the decl-specifiers. If it is invalid to
2746 define a type in the decl-specifiers for DECLARATOR, an error is
2747 issued. TYPE_LOCATION is the location of TYPE and is used
2748 for error reporting. */
2750 static void
2753 {
2754 /* [dcl.fct] forbids type definitions in return types.
2755 Unfortunately, it's not easy to know whether or not we are
2756 processing a return type until after the fact. */
2764 {
2769 type);
2770 }
2771 }
2773 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2774 "<" in any valid C++ program. If the next token is indeed "<",
2775 issue a message warning the user about what appears to be an
2776 invalid attempt to form a template-id. LOCATION is the location
2777 of the type-specifier (TYPE) */
2779 static void
2781 tree type,
2783 location_t location)
2784 {
2788 {
2792 {
2795 else
2797 }
2798 else
2800 /* Remember the location of the invalid "<". */
2803 /* Consume the "<". */
2805 /* Parse the template arguments. */
2807 /* Permanently remove the invalid template arguments so that
2808 this error message is not issued again. */
2811 }
2812 }
2814 /* If parsing an integral constant-expression, issue an error message
2815 about the fact that THING appeared and return true. Otherwise,
2816 return false. In either case, set
2817 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2819 static bool
2821 non_integral_constant thing)
2822 {
2825 {
2827 {
2830 {
2837 "enumeration type cannot appear in a "
2928 }
2932 }
2933 }
2935 }
2937 /* Emit a diagnostic for an invalid type name. This function commits
2938 to the current active tentative parse, if any. (Otherwise, the
2939 problematic construct might be encountered again later, resulting
2940 in duplicate error messages.) LOCATION is the location of ID. */
2942 static void
2944 location_t location)
2945 {
2948 /* Try to lookup the identifier. */
2955 /* If the lookup was ambiguous, an error will already have
2956 been issued. */
2958 /* If the lookup found a template-name, it means that the user forgot
2959 to specify an argument list. Emit a useful error message. */
2961 {
2964 decl);
2966 }
2970 /* Something like 'unsigned A a;' */
2973 {
2974 /* Issue an error message. */
2976 /* If we're in a template class, it's possible that the user was
2977 referring to a type from a base class. For example:
2979 template <typename T> struct A { typedef T X; };
2980 template <typename T> struct B : public A<T> { X x; };
2982 The user should have said "typename A<T>::X". */
2996 {
2997 tree b;
3000 b;
3002 {
3006 {
3007 tree field;
3008 /* Go from a particular instantiation of the
3009 template (which will have an empty TYPE_FIELDs),
3010 to the main version. */
3013 field;
3017 {
3022 }
3025 }
3026 }
3027 }
3028 }
3029 /* Here we diagnose qualified-ids where the scope is actually correct,
3030 but the identifier does not resolve to a valid type name. */
3032 {
3034 {
3039 else
3045 }
3048 {
3049 /* A<T>::A<T>() */
3055 }
3062 {
3067 else
3073 }
3074 else
3076 }
3077 }
3079 /* Check for a common situation where a type-name should be present,
3080 but is not, and issue a sensible error message. Returns true if an
3081 invalid type-name was detected.
3083 The situation handled by this function are variable declarations of the
3084 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3085 Usually, `ID' should name a type, but if we got here it means that it
3086 does not. We try to emit the best possible error message depending on
3087 how exactly the id-expression looks like. */
3089 static bool
3091 {
3092 tree id;
3095 /* Avoid duplicate error about ambiguous lookup. */
3097 {
3101 }
3110 /* If the next token is a (, this is a function with no explicit return
3111 type, i.e. constructor, destructor or conversion op. */
3114 {
3117 }
3121 /* Emit a diagnostic for the invalid type. */
3123 out:
3124 /* If we aren't in the middle of a declarator (i.e. in a
3125 parameter-declaration-clause), skip to the end of the declaration;
3126 there's no point in trying to process it. */
3130 }
3132 /* Consume tokens up to, and including, the next non-nested closing `)'.
3133 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3134 are doing error recovery. Returns -1 if OR_COMMA is true and we
3135 found an unnested comma. */
3137 static int
3142 {
3152 {
3156 {
3159 /* If we've run out of tokens, then there is no closing `)'. */
3162 /* This is good for lambda expression capture-lists. */
3172 /* This matches the processing in skip_to_end_of_statement. */
3198 {
3202 }
3207 }
3209 /* Consume the token. */
3211 }
3212 }
3214 /* Consume tokens until we reach the end of the current statement.
3215 Normally, that will be just before consuming a `;'. However, if a
3216 non-nested `}' comes first, then we stop before consuming that. */
3218 static void
3220 {
3223 /* Unwind generic function template scope if necessary. */
3228 {
3232 {
3235 /* If we've run out of tokens, stop. */
3239 /* If the next token is a `;', we have reached the end of the
3240 statement. */
3246 /* If this is a non-nested '}', stop before consuming it.
3247 That way, when confronted with something like:
3249 { 3 + }
3251 we stop before consuming the closing '}', even though we
3252 have not yet reached a `;'. */
3256 /* If it is the closing '}' for a block that we have
3257 scanned, stop -- but only after consuming the token.
3258 That way given:
3260 void f g () { ... }
3261 typedef int I;
3263 we will stop after the body of the erroneously declared
3264 function, but before consuming the following `typedef'
3265 declaration. */
3267 {
3270 }
3278 }
3280 /* Consume the token. */
3282 }
3283 }
3285 /* This function is called at the end of a statement or declaration.
3286 If the next token is a semicolon, it is consumed; otherwise, error
3287 recovery is attempted. */
3289 static void
3291 {
3292 /* Look for the trailing `;'. */
3294 {
3295 /* If there is additional (erroneous) input, skip to the end of
3296 the statement. */
3298 /* If the next token is now a `;', consume it. */
3301 }
3302 }
3304 /* Skip tokens until we have consumed an entire block, or until we
3305 have consumed a non-nested `;'. */
3307 static void
3309 {
3312 /* Unwind generic function template scope if necessary. */
3317 {
3321 {
3324 /* If we've run out of tokens, stop. */
3328 /* Stop if this is an unnested ';'. */
3334 /* Stop if this is an unnested '}', or closes the outermost
3335 nesting level. */
3336 nesting_depth--;
3344 /* Nest. */
3345 nesting_depth++;
3350 }
3352 /* Consume the token. */
3354 }
3355 }
3357 /* Skip tokens until a non-nested closing curly brace is the next
3358 token, or there are no more tokens. Return true in the first case,
3359 false otherwise. */
3361 static bool
3363 {
3367 {
3371 {
3374 /* If we've run out of tokens, stop. */
3378 /* If the next token is a non-nested `}', then we have reached
3379 the end of the current block. */
3385 /* If it the next token is a `{', then we are entering a new
3386 block. Consume the entire block. */
3392 }
3394 /* Consume the token. */
3396 }
3397 }
3399 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3400 parameter is the PRAGMA token, allowing us to purge the entire pragma
3401 sequence. */
3403 static void
3405 {
3410 do
3414 /* Ensure that the pragma is not parsed again. */
3416 }
3418 /* Require pragma end of line, resyncing with it as necessary. The
3419 arguments are as for cp_parser_skip_to_pragma_eol. */
3421 static void
3423 {
3427 }
3429 /* This is a simple wrapper around make_typename_type. When the id is
3430 an unresolved identifier node, we can provide a superior diagnostic
3431 using cp_parser_diagnose_invalid_type_name. */
3433 static tree
3435 location_t id_location)
3436 {
3437 tree result;
3439 {
3445 }
3447 }
3449 /* This is a wrapper around the
3450 make_{pointer,ptrmem,reference}_declarator functions that decides
3451 which one to call based on the CODE and CLASS_TYPE arguments. The
3452 CODE argument should be one of the values returned by
3453 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3454 appertain to the pointer or reference. */
3458 cp_cv_quals cv_qualifiers,
3460 tree attributes)
3461 {
3468 else
3478 }
3480 /* Create a new C++ parser. */
3484 {
3489 /* cp_lexer_new_main is called before doing GC allocation because
3490 cp_lexer_new_main might load a PCH file. */
3493 /* Initialize the binops_by_token so that we can get the tree
3494 directly from the token. */
3502 /* For now, we always accept GNU extensions. */
3505 /* The `>' token is a greater-than operator, not the end of a
3506 template-id. */
3511 /* We are not parsing a constant-expression. */
3516 /* Local variable names are not forbidden. */
3519 /* We are not processing an `extern "C"' declaration. */
3522 /* We are not processing a declarator. */
3525 /* We are not processing a template-argument-list. */
3528 /* We are not in an iteration statement. */
3531 /* We are not in a switch statement. */
3534 /* We are not parsing a type-id inside an expression. */
3537 /* Declarations aren't implicitly extern "C". */
3540 /* String literals should be translated to the execution character set. */
3543 /* We are not parsing a function body. */
3546 /* We can correct until told otherwise. */
3549 /* The unparsed function queue is empty. */
3552 /* There are no classes being defined. */
3555 /* No template parameters apply. */
3558 /* Not declaring an implicit function template. */
3565 }
3567 /* Create a cp_lexer structure which will emit the tokens in CACHE
3568 and push it onto the parser's lexer stack. This is used for delayed
3569 parsing of in-class method bodies and default arguments, and should
3570 not be confused with tentative parsing. */
3571 static void
3573 {
3578 /* Move the current source position to that of the first token in the
3579 new lexer. */
3581 }
3583 /* Pop the top lexer off the parser stack. This is never used for the
3584 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3585 static void
3587 {
3592 /* Put the current source position back where it was before this
3593 lexer was pushed. */
3595 }
3597 /* Lexical conventions [gram.lex] */
3599 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3600 identifier. */
3602 static tree
3604 {
3607 /* Look for the identifier. */
3609 /* Return the value. */
3611 }
3613 /* Parse a sequence of adjacent string constants. Returns a
3614 TREE_STRING representing the combined, nul-terminated string
3615 constant. If TRANSLATE is true, translate the string to the
3616 execution character set. If WIDE_OK is true, a wide string is
3617 invalid here.
3619 C++98 [lex.string] says that if a narrow string literal token is
3620 adjacent to a wide string literal token, the behavior is undefined.
3621 However, C99 6.4.5p4 says that this results in a wide string literal.
3622 We follow C99 here, for consistency with the C front end.
3624 This code is largely lifted from lex_string() in c-lex.c.
3626 FUTURE: ObjC++ will need to handle @-strings here. */
3627 static tree
3630 {
3631 tree value;
3638 tree string_tree;
3644 {
3647 }
3650 {
3654 }
3655 else
3656 {
3659 }
3662 /* Try to avoid the overhead of creating and destroying an obstack
3663 for the common case of just one string. */
3666 {
3674 {
3678 }
3679 else
3683 }
3684 else
3685 {
3689 do
3690 {
3692 count++;
3697 {
3700 {
3703 }
3706 {
3711 }
3713 }
3714 else
3718 {
3723 "unsupported non-standard concatenation "
3725 }
3731 {
3735 }
3736 else
3737 {
3741 }
3742 }
3746 }
3749 {
3752 }
3756 {
3761 {
3776 }
3781 {
3786 else
3788 }
3789 }
3790 else
3791 /* cpp_interpret_string has issued an error. */
3798 }
3800 /* Look up a literal operator with the name and the exact arguments. */
3802 static tree
3804 {
3811 {
3817 {
3820 {
3830 }
3833 /* May be this should be sufficient_parms_p instead,
3834 depending on how exactly should user-defined literals
3835 work in presence of default arguments on the literal
3836 operator parameters. */
3839 }
3840 }
3843 }
3845 /* Parse a user-defined char constant. Returns a call to a user-defined
3846 literal operator taking the character as an argument. */
3848 static tree
3850 {
3858 /* Build up a call to the user-defined operator */
3859 /* Lookup the name we got back from the id-expression. */
3864 {
3869 }
3873 }
3875 /* A subroutine of cp_parser_userdef_numeric_literal to
3876 create a char... template parameter pack from a string node. */
3878 static tree
3880 {
3881 tree charvec;
3887 /* Fill in CHARVEC with all of the parameters. */
3892 /* Build the argument packs. */
3899 }
3901 /* A subroutine of cp_parser_userdef_numeric_literal to
3902 create a char... template parameter pack from a string node. */
3904 static tree
3906 {
3907 tree charvec;
3918 /* First template parm is character type. */
3921 /* Fill in CHARVEC with all of the parameters. */
3928 /* Build the argument packs. */
3935 }
3937 /* Parse a user-defined numeric constant. returns a call to a user-defined
3938 literal operator. */
3940 static tree
3942 {
3953 /* Look for a literal operator taking the exact type of numeric argument
3954 as the literal value. */
3959 {
3961 tf_warning_or_error);
3964 {
3967 long_long_unsigned_type_node);
3968 }
3969 else
3970 {
3974 long_double_type_node);
3978 }
3982 }
3985 /* If the numeric argument didn't work, look for a raw literal
3986 operator taking a const char* argument consisting of the number
3987 in string format. */
3992 {
3994 tf_warning_or_error);
3997 }
4000 /* If the raw literal didn't work, look for a non-type template
4001 function with parameter pack char.... Call the function with
4002 template parameter characters representing the number. */
4006 {
4010 tf_warning_or_error);
4013 }
4022 }
4024 /* Parse a user-defined string constant. Returns a call to a user-defined
4025 literal operator taking a character pointer and the length of the string
4026 as arguments. */
4028 static tree
4030 {
4039 /* Build up a call to the user-defined operator. */
4040 /* Lookup the name we got back from the id-expression. */
4047 {
4049 tf_warning_or_error);
4052 }
4055 /* Look for a template function with typename parameter CharT
4056 and parameter pack CharT... Call the function with
4057 template parameter characters representing the string. */
4061 {
4065 tf_warning_or_error);
4068 }
4074 }
4077 /* Basic concepts [gram.basic] */
4079 /* Parse a translation-unit.
4081 translation-unit:
4082 declaration-seq [opt]
4084 Returns TRUE if all went well. */
4086 static bool
4088 {
4089 /* The address of the first non-permanent object on the declarator
4090 obstack. */
4095 /* Create the declarator obstack, if necessary. */
4097 {
4099 /* Create the error declarator. */
4101 /* Create the empty parameter list. */
4103 /* Remember where the base of the declarator obstack lies. */
4105 }
4109 /* If there are no tokens left then all went well. */
4111 {
4112 /* Get rid of the token array; we don't need it any more. */
4116 /* This file might have been a context that's implicitly extern
4117 "C". If so, pop the lang context. (Only relevant for PCH.) */
4119 {
4122 }
4124 /* Finish up. */
4128 }
4129 else
4130 {
4133 }
4135 /* Make sure the declarator obstack was fully cleaned up. */
4139 /* All went well. */
4141 }
4143 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4144 decltype context. */
4148 {
4153 }
4155 /* We're about to parse a collection of statements. If we're currently
4156 parsing tentatively, set up a firewall so that any nested
4157 cp_parser_commit_to_tentative_parse won't affect the current context. */
4159 static cp_token_position
4161 {
4168 }
4170 /* We've finished parsing the collection of statements. Wrap up the
4171 firewall and replace the relevant tokens with the parsed form. */
4173 static void
4175 tree expr)
4176 {
4180 /* Finish the firewall level. */
4182 /* And remember the result of the parse for when we try again. */
4188 }
4190 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4191 enclosing parentheses. */
4193 static tree
4195 {
4198 /* Consume the '('. */
4200 /* Start the statement-expression. */
4202 /* Parse the compound-statement. */
4204 /* Finish up. */
4206 /* Consume the ')'. */
4212 }
4214 /* Expressions [gram.expr] */
4216 /* Parse a primary-expression.
4218 primary-expression:
4219 literal
4220 this
4221 ( expression )
4222 id-expression
4223 lambda-expression (C++11)
4225 GNU Extensions:
4227 primary-expression:
4228 ( compound-statement )
4229 __builtin_va_arg ( assignment-expression , type-id )
4230 __builtin_offsetof ( type-id , offsetof-expression )
4232 C++ Extensions:
4233 __has_nothrow_assign ( type-id )
4234 __has_nothrow_constructor ( type-id )
4235 __has_nothrow_copy ( type-id )
4236 __has_trivial_assign ( type-id )
4237 __has_trivial_constructor ( type-id )
4238 __has_trivial_copy ( type-id )
4239 __has_trivial_destructor ( type-id )
4240 __has_virtual_destructor ( type-id )
4241 __is_abstract ( type-id )
4242 __is_base_of ( type-id , type-id )
4243 __is_class ( type-id )
4244 __is_empty ( type-id )
4245 __is_enum ( type-id )
4246 __is_final ( type-id )
4247 __is_literal_type ( type-id )
4248 __is_pod ( type-id )
4249 __is_polymorphic ( type-id )
4250 __is_std_layout ( type-id )
4251 __is_trivial ( type-id )
4252 __is_union ( type-id )
4254 Objective-C++ Extension:
4256 primary-expression:
4257 objc-expression
4259 literal:
4260 __null
4262 ADDRESS_P is true iff this expression was immediately preceded by
4263 "&" and therefore might denote a pointer-to-member. CAST_P is true
4264 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4265 true iff this expression is a template argument.
4267 Returns a representation of the expression. Upon return, *IDK
4268 indicates what kind of id-expression (if any) was present. */
4270 static tree
4277 {
4280 /* Assume the primary expression is not an id-expression. */
4283 /* Peek at the next token. */
4286 {
4287 /* literal:
4288 integer-literal
4289 character-literal
4290 floating-literal
4291 string-literal
4292 boolean-literal
4293 pointer-literal
4294 user-defined-literal */
4305 {
4309 }
4310 /* Floating-point literals are only allowed in an integral
4311 constant expression if they are cast to an integral or
4312 enumeration type. */
4316 {
4317 /* CAST_P will be set even in invalid code like "int(2.7 +
4318 ...)". Therefore, we have to check that the next token
4319 is sure to end the cast. */
4321 {
4326 enumerator-definition. */
4328 /* The curly brace at the end of an enum-specifier. */
4330 /* The end of a statement. */
4332 /* The end of the cast-expression. */
4334 /* The end of an array bound. */
4336 /* The closing ">" in a template-argument-list. */
4339 /* C++0x only: A ">>" treated like two ">" tokens,
4340 in a template-argument-list. */
4345 }
4347 /* If we are within a cast, then the constraint that the
4348 cast is to an integral or enumeration type will be
4349 checked at that point. If we are not within a cast, then
4350 this code is invalid. */
4353 }
4372 /* ??? Should wide strings be allowed when parser->translate_strings_p
4373 is false (i.e. in attributes)? If not, we can kill the third
4374 argument to cp_parser_string_literal. */
4380 /* If we see `( { ' then we are looking at the beginning of
4381 a GNU statement-expression. */
4384 {
4385 /* Statement-expressions are not allowed by the standard. */
4389 /* And they're not allowed outside of a function-body; you
4390 cannot, for example, write:
4392 int i = ({ int j = 3; j + 1; });
4394 at class or namespace scope. */
4397 {
4399 "statement-expressions are not allowed outside "
4405 }
4406 else
4408 }
4409 /* Otherwise it's a normal parenthesized expression. */
4410 {
4411 tree expr;
4414 /* Consume the `('. */
4416 /* Within a parenthesized expression, a `>' token is always
4417 the greater-than operator. */
4418 saved_greater_than_is_operator_p
4422 /* Parse the parenthesized expression. */
4424 /* Let the front end know that this expression was
4425 enclosed in parentheses. This matters in case, for
4426 example, the expression is of the form `A::B', since
4427 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4428 not. */
4430 /* DR 705: Wrapping an unqualified name in parentheses
4431 suppresses arg-dependent lookup. We want to pass back
4432 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4433 (c++/37862), but none of the others. */
4437 /* The `>' token might be the end of a template-id or
4438 template-parameter-list now. */
4439 parser->greater_than_is_operator_p
4441 /* Consume the `)'. */
4446 }
4449 {
4451 {
4452 /* We might have an Objective-C++ message. */
4455 /* If that works out, we're done ... */
4458 /* ... else, fall though to see if it's a lambda. */
4459 }
4461 /* Don't warn about a failed tentative parse. */
4466 }
4470 /* We have an Objective-C++ string literal. */
4477 {
4478 /* These two are the boolean literals. */
4486 /* The `__null' literal. */
4491 /* The `nullptr' literal. */
4496 /* Recognize the `this' keyword. */
4500 {
4504 }
4505 /* Pointers cannot appear in constant-expressions. */
4510 /* The `operator' keyword can be the beginning of an
4511 id-expression. */
4518 {
4519 non_integral_constant name;
4521 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4522 __func__ are the names of variables -- but they are
4523 treated specially. Therefore, they are handled here,
4524 rather than relying on the generic id-expression logic
4525 below. Grammatically, these names are id-expressions.
4527 Consume the token. */
4531 {
4543 }
4548 /* Look up the name. */
4550 }
4553 {
4554 tree expression;
4555 tree type;
4556 source_location type_location;
4558 /* The `__builtin_va_arg' construct is used to handle
4559 `va_arg'. Consume the `__builtin_va_arg' token. */
4561 /* Look for the opening `('. */
4563 /* Now, parse the assignment-expression. */
4565 /* Look for the `,'. */
4568 /* Parse the type-id. */
4570 /* Look for the closing `)'. */
4572 /* Using `va_arg' in a constant-expression is not
4573 allowed. */
4575 NIC_VA_ARG))
4578 }
4608 /* Objective-C++ expressions. */
4618 {
4623 }
4627 }
4629 /* An id-expression can start with either an identifier, a
4630 `::' as the beginning of a qualified-id, or the "operator"
4631 keyword. */
4636 {
4637 tree id_expression;
4638 tree decl;
4644 id_expression:
4645 /* Parse the id-expression. */
4646 id_expression
4663 /* If we have a template-id, then no further lookup is
4664 required. If the template-id was for a template-class, we
4665 will sometimes have a TYPE_DECL at this point. */
4669 /* Look up the name. */
4670 else
4671 {
4672 tree ambiguous_decls;
4674 /* If we already know that this lookup is ambiguous, then
4675 we've already issued an error message; there's no reason
4676 to check again. */
4679 {
4682 }
4685 none_type,
4686 template_p,
4691 /* If the lookup was ambiguous, an error will already have
4692 been issued. */
4696 /* In Objective-C++, we may have an Objective-C 2.0
4697 dot-syntax for classes here. */
4702 {
4703 tree component;
4710 }
4712 /* In Objective-C++, an instance variable (ivar) may be preferred
4713 to whatever cp_parser_lookup_name() found. */
4716 /* If name lookup gives us a SCOPE_REF, then the
4717 qualifying scope was dependent. */
4719 {
4720 /* At this point, we do not know if DECL is a valid
4721 integral constant expression. We assume that it is
4722 in fact such an expression, so that code like:
4724 template <int N> struct A {
4725 int a[B<N>::i];
4726 };
4728 is accepted. At template-instantiation time, we
4729 will check that B<N>::i is actually a constant. */
4731 }
4732 /* Check to see if DECL is a local variable in a context
4733 where that is forbidden. */
4736 {
4737 /* It might be that we only found DECL because we are
4738 trying to be generous with pre-ISO scoping rules.
4739 For example, consider:
4741 int i;
4742 void g() {
4743 for (int i = 0; i < 10; ++i) {}
4744 extern void f(int j = i);
4745 }
4747 Here, name look up will originally find the out
4748 of scope `i'. We need to issue a warning message,
4749 but then use the global `i'. */
4752 {
4755 decl);
4757 }
4758 }
4759 }
4761 decl = (finish_id_expression
4763 idk,
4768 template_arg_p,
4774 }
4776 /* Anything else is an error. */
4780 }
4781 }
4789 {
4792 }
4794 /* Parse an id-expression.
4796 id-expression:
4797 unqualified-id
4798 qualified-id
4800 qualified-id:
4801 :: [opt] nested-name-specifier template [opt] unqualified-id
4802 :: identifier
4803 :: operator-function-id
4804 :: template-id
4806 Return a representation of the unqualified portion of the
4807 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4808 a `::' or nested-name-specifier.
4810 Often, if the id-expression was a qualified-id, the caller will
4811 want to make a SCOPE_REF to represent the qualified-id. This
4812 function does not do this in order to avoid wastefully creating
4813 SCOPE_REFs when they are not required.
4815 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4816 `template' keyword.
4818 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4819 uninstantiated templates.
4821 If *TEMPLATE_P is non-NULL, it is set to true iff the
4822 `template' keyword is used to explicitly indicate that the entity
4823 named is a template.
4825 If DECLARATOR_P is true, the id-expression is appearing as part of
4826 a declarator, rather than as part of an expression. */
4828 static tree
4835 {
4839 /* Assume the `template' keyword was not used. */
4843 /* Look for the optional `::' operator. */
4844 global_scope_p
4847 /* Look for the optional nested-name-specifier. */
4848 nested_name_specifier_p
4851 check_dependency_p,
4853 declarator_p)
4855 /* If there is a nested-name-specifier, then we are looking at
4856 the first qualified-id production. */
4858 {
4859 tree saved_scope;
4860 tree saved_object_scope;
4861 tree saved_qualifying_scope;
4862 tree unqualified_id;
4865 /* See if the next token is the `template' keyword. */
4869 /* Name lookup we do during the processing of the
4870 unqualified-id might obliterate SCOPE. */
4874 /* Process the final unqualified-id. */
4876 check_dependency_p,
4877 declarator_p,
4879 /* Restore the SAVED_SCOPE for our caller. */
4885 }
4886 /* Otherwise, if we are in global scope, then we are looking at one
4887 of the other qualified-id productions. */
4889 {
4891 tree id;
4893 /* Peek at the next token. */
4896 /* If it's an identifier, and the next token is not a "<", then
4897 we can avoid the template-id case. This is an optimization
4898 for this common case. */
4900 && !cp_parser_nth_token_starts_template_argument_list_p
4905 /* Try a template-id. */
4909 none_type,
4910 declarator_p);
4911 /* If that worked, we're done. */
4915 /* Peek at the next token. (Changes in the token buffer may
4916 have invalidated the pointer obtained above.) */
4920 {
4927 /* Fall through. */
4932 }
4933 }
4934 else
4937 declarator_p,
4938 optional_p);
4939 }
4941 /* Parse an unqualified-id.
4943 unqualified-id:
4944 identifier
4945 operator-function-id
4946 conversion-function-id
4947 ~ class-name
4948 template-id
4950 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4951 keyword, in a construct like `A::template ...'.
4953 Returns a representation of unqualified-id. For the `identifier'
4954 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4955 production a BIT_NOT_EXPR is returned; the operand of the
4956 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4957 other productions, see the documentation accompanying the
4958 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4959 names are looked up in uninstantiated templates. If DECLARATOR_P
4960 is true, the unqualified-id is appearing as part of a declarator,
4961 rather than as part of an expression. */
4963 static tree
4969 {
4972 /* Peek at the next token. */
4976 {
4978 {
4979 tree id;
4981 /* We don't know yet whether or not this will be a
4982 template-id. */
4984 /* Try a template-id. */
4986 check_dependency_p,
4987 none_type,
4988 declarator_p);
4989 /* If it worked, we're done. */
4992 /* Otherwise, it's an ordinary identifier. */
4994 }
4998 check_dependency_p,
4999 none_type,
5000 declarator_p);
5003 {
5004 tree type_decl;
5005 tree qualifying_scope;
5006 tree object_scope;
5007 tree scope;
5010 /* Consume the `~' token. */
5012 /* Parse the class-name. The standard, as written, seems to
5013 say that:
5015 template <typename T> struct S { ~S (); };
5016 template <typename T> S<T>::~S() {}
5018 is invalid, since `~' must be followed by a class-name, but
5019 `S<T>' is dependent, and so not known to be a class.
5020 That's not right; we need to look in uninstantiated
5021 templates. A further complication arises from:
5023 template <typename T> void f(T t) {
5024 t.T::~T();
5025 }
5027 Here, it is not possible to look up `T' in the scope of `T'
5028 itself. We must look in both the current scope, and the
5029 scope of the containing complete expression.
5031 Yet another issue is:
5033 struct S {
5034 int S;
5035 ~S();
5036 };
5038 S::~S() {}
5040 The standard does not seem to say that the `S' in `~S'
5041 should refer to the type `S' and not the data member
5042 `S::S'. */
5044 /* DR 244 says that we look up the name after the "~" in the
5045 same scope as we looked up the qualifying name. That idea
5046 isn't fully worked out; it's more complicated than that. */
5051 /* Check for invalid scopes. */
5053 {
5057 }
5059 {
5063 scope);
5068 }
5071 /* If the name is of the form "X::~X" it's OK even if X is a
5072 typedef. */
5081 {
5084 }
5086 /* ~auto means the destructor of whatever the object is. */
5088 {
5091 "%<~auto%> only available with "
5095 }
5097 /* If there was an explicit qualification (S::~T), first look
5098 in the scope given by the qualification (i.e., S).
5100 Note: in the calls to cp_parser_class_name below we pass
5101 typename_type so that lookup finds the injected-class-name
5102 rather than the constructor. */
5106 {
5111 typename_type,
5114 declarator_p);
5117 }
5118 /* In "N::S::~S", look in "N" as well. */
5120 {
5125 type_decl
5129 typename_type,
5132 declarator_p);
5135 }
5136 /* In "p->S::~T", look in the scope given by "*p" as well. */
5138 {
5143 type_decl
5147 typename_type,
5150 declarator_p);
5153 }
5154 /* Look in the surrounding context. */
5156 {
5162 type_decl
5166 typename_type,
5169 declarator_p);
5172 {
5173 /* We couldn't find a type with this name, so just accept
5174 it and check for a match at instantiation time. */
5179 }
5180 }
5181 /* If an error occurred, assume that the name of the
5182 destructor is the same as the name of the qualifying
5183 class. That allows us to keep parsing after running
5184 into ill-formed destructor names. */
5190 /* Check that destructor name and scope match. */
5192 {
5199 }
5201 /* [class.dtor]
5203 A typedef-name that names a class shall not be used as the
5204 identifier in the declarator for a destructor declaration. */
5211 type_decl);
5214 }
5218 {
5219 tree id;
5221 /* This could be a template-id, so we try that first. */
5223 /* Try a template-id. */
5226 none_type,
5227 declarator_p);
5228 /* If that worked, we're done. */
5231 /* We still don't know whether we're looking at an
5232 operator-function-id or a conversion-function-id. */
5234 /* Try an operator-function-id. */
5236 /* If that didn't work, try a conversion-function-id. */
5240 {
5241 /* 17.6.3.3.5 */
5247 }
5250 }
5251 /* Fall through. */
5258 }
5259 }
5261 /* Parse an (optional) nested-name-specifier.
5263 nested-name-specifier: [C++98]
5264 class-or-namespace-name :: nested-name-specifier [opt]
5265 class-or-namespace-name :: template nested-name-specifier [opt]
5267 nested-name-specifier: [C++0x]
5268 type-name ::
5269 namespace-name ::
5270 nested-name-specifier identifier ::
5271 nested-name-specifier template [opt] simple-template-id ::
5273 PARSER->SCOPE should be set appropriately before this function is
5274 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5275 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5276 in name lookups.
5278 Sets PARSER->SCOPE to the class (TYPE) or namespace
5279 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5280 it unchanged if there is no nested-name-specifier. Returns the new
5281 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5283 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5284 part of a declaration and/or decl-specifier. */
5286 static tree
5292 {
5297 /* Remember where the nested-name-specifier starts. */
5299 {
5302 }
5305 {
5306 tree new_scope;
5307 tree old_scope;
5308 tree saved_qualifying_scope;
5311 /* Spot cases that cannot be the beginning of a
5312 nested-name-specifier. */
5315 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5316 the already parsed nested-name-specifier. */
5318 {
5319 /* Grab the nested-name-specifier and continue the loop. */
5321 /* If we originally encountered this nested-name-specifier
5322 with IS_DECLARATION set to false, we will not have
5323 resolved TYPENAME_TYPEs, so we must do so here. */
5326 {
5331 }
5334 }
5336 /* Spot cases that cannot be the beginning of a
5337 nested-name-specifier. On the second and subsequent times
5338 through the loop, we look for the `template' keyword. */
5340 ;
5341 /* A template-id can start a nested-name-specifier. */
5343 ;
5344 /* DR 743: decltype can be used in a nested-name-specifier. */
5346 ;
5347 else
5348 {
5349 /* If the next token is not an identifier, then it is
5350 definitely not a type-name or namespace-name. */
5353 /* If the following token is neither a `<' (to begin a
5354 template-id), nor a `::', then we are not looking at a
5355 nested-name-specifier. */
5361 {
5365 }
5368 && !cp_parser_nth_token_starts_template_argument_list_p
5371 }
5373 /* The nested-name-specifier is optional, so we parse
5374 tentatively. */
5377 /* Look for the optional `template' keyword, if this isn't the
5378 first time through the loop. */
5381 else
5384 /* Save the old scope since the name lookup we are about to do
5385 might destroy it. */
5388 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5389 look up names in "X<T>::I" in order to determine that "Y" is
5390 a template. So, if we have a typename at this point, we make
5391 an effort to look through it. */
5393 && !typename_keyword_p
5398 /* Parse the qualifying entity. */
5399 new_scope
5401 typename_keyword_p,
5402 template_keyword_p,
5403 check_dependency_p,
5404 type_p,
5405 is_declaration);
5406 /* Look for the `::' token. */
5409 /* If we found what we wanted, we keep going; otherwise, we're
5410 done. */
5412 {
5415 /* Restore the OLD_SCOPE since it was valid before the
5416 failed attempt at finding the last
5417 class-or-namespace-name. */
5421 /* If the next token is a decltype, and the one after that is a
5422 `::', then the decltype has failed to resolve to a class or
5423 enumeration type. Give this error even when parsing
5424 tentatively since it can't possibly be valid--and we're going
5425 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5426 won't get another chance.*/
5430 {
5437 /* As below. */
5440 }
5444 {
5445 /* If we have a non-type template-id followed by ::, it can't
5446 possibly be valid. */
5451 {
5454 {
5460 }
5461 else
5462 {
5463 /* Variable template. */
5468 }
5475 /* As below. */
5479 }
5480 }
5484 /* If the next token is an identifier, and the one after
5485 that is a `::', then any valid interpretation would have
5486 found a class-or-namespace-name. */
5492 {
5495 {
5497 {
5498 tree decl;
5499 tree ambiguous_decls;
5502 none_type,
5511 decl);
5513 {
5514 // cp_parser_lookup_name has the same diagnostic,
5515 // thus make sure to emit it at most once.
5518 {
5523 }
5525 }
5526 else
5527 {
5529 cp_parser_name_lookup_error
5532 else
5533 cp_parser_name_lookup_error
5536 }
5537 }
5540 /* Treat this as a successful nested-name-specifier
5541 due to:
5543 [basic.lookup.qual]
5545 If the name found is not a class-name (clause
5546 _class_) or namespace-name (_namespace.def_), the
5547 program is ill-formed. */
5549 }
5551 }
5553 }
5554 /* We've found one valid nested-name-specifier. */
5556 /* Name lookup always gives us a DECL. */
5559 /* Uses of "template" must be followed by actual templates. */
5571 new_scope);
5572 /* If it is a class scope, try to complete it; we are about to
5573 be looking up names inside the class. */
5575 /* Since checking types for dependency can be expensive,
5576 avoid doing it if the type is already complete. */
5578 /* Do not try to complete dependent types. */
5580 {
5582 /* If it is a typedef to current class, use the current
5583 class instead, as the typedef won't have any names inside
5584 it yet. */
5588 }
5589 /* Make sure we look in the right scope the next time through
5590 the loop. */
5592 }
5594 /* If parsing tentatively, replace the sequence of tokens that makes
5595 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5596 token. That way, should we re-parse the token stream, we will
5597 not have to repeat the effort required to do the parse, nor will
5598 we issue duplicate error messages. */
5600 {
5604 /* Reset the contents of the START token. */
5606 /* Retrieve any deferred checks. Do not pop this access checks yet
5607 so the memory will not be reclaimed during token replacing below. */
5615 /* Purge all subsequent tokens. */
5617 }
5623 }
5625 /* Parse a nested-name-specifier. See
5626 cp_parser_nested_name_specifier_opt for details. This function
5627 behaves identically, except that it will an issue an error if no
5628 nested-name-specifier is present. */
5630 static tree
5636 {
5637 tree scope;
5639 /* Look for the nested-name-specifier. */
5641 typename_keyword_p,
5642 check_dependency_p,
5643 type_p,
5644 is_declaration);
5645 /* If it was not present, issue an error message. */
5647 {
5650 }
5653 }
5655 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5656 this is either a class-name or a namespace-name (which corresponds
5657 to the class-or-namespace-name production in the grammar). For
5658 C++0x, it can also be a type-name that refers to an enumeration
5659 type or a simple-template-id.
5661 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5662 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5663 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5664 TYPE_P is TRUE iff the next name should be taken as a class-name,
5665 even the same name is declared to be another entity in the same
5666 scope.
5668 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5669 specified by the class-or-namespace-name. If neither is found the
5670 ERROR_MARK_NODE is returned. */
5672 static tree
5679 {
5680 tree saved_scope;
5681 tree saved_qualifying_scope;
5682 tree saved_object_scope;
5683 tree scope;
5687 /* DR 743: decltype can appear in a nested-name-specifier. */
5689 {
5693 {
5696 }
5700 }
5702 /* Before we try to parse the class-name, we must save away the
5703 current PARSER->SCOPE since cp_parser_class_name will destroy
5704 it. */
5708 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5709 there is no need to look for a namespace-name. */
5710 only_class_p = template_keyword_p
5715 typename_keyword_p,
5716 template_keyword_p,
5718 check_dependency_p,
5720 is_declaration,
5723 /* If that didn't work, try for a namespace-name. */
5725 {
5726 /* Restore the saved scope. */
5730 /* If we are not looking at an identifier followed by the scope
5731 resolution operator, then this is not part of a
5732 nested-name-specifier. (Note that this function is only used
5733 to parse the components of a nested-name-specifier.) */
5738 }
5741 }
5743 /* Return true if we are looking at a compound-literal, false otherwise. */
5745 static bool
5747 {
5748 /* Consume the `('. */
5753 /* Skip tokens until the next token is a closing parenthesis.
5754 If we find the closing `)', and the next token is a `{', then
5755 we are looking at a compound-literal. */
5756 bool compound_literal_p
5761 /* Roll back the tokens we skipped. */
5765 }
5767 /* Parse a postfix-expression.
5769 postfix-expression:
5770 primary-expression
5771 postfix-expression [ expression ]
5772 postfix-expression ( expression-list [opt] )
5773 simple-type-specifier ( expression-list [opt] )
5774 typename :: [opt] nested-name-specifier identifier
5775 ( expression-list [opt] )
5776 typename :: [opt] nested-name-specifier template [opt] template-id
5777 ( expression-list [opt] )
5778 postfix-expression . template [opt] id-expression
5779 postfix-expression -> template [opt] id-expression
5780 postfix-expression . pseudo-destructor-name
5781 postfix-expression -> pseudo-destructor-name
5782 postfix-expression ++
5783 postfix-expression --
5784 dynamic_cast < type-id > ( expression )
5785 static_cast < type-id > ( expression )
5786 reinterpret_cast < type-id > ( expression )
5787 const_cast < type-id > ( expression )
5788 typeid ( expression )
5789 typeid ( type-id )
5791 GNU Extension:
5793 postfix-expression:
5794 ( type-id ) { initializer-list , [opt] }
5796 This extension is a GNU version of the C99 compound-literal
5797 construct. (The C99 grammar uses `type-name' instead of `type-id',
5798 but they are essentially the same concept.)
5800 If ADDRESS_P is true, the postfix expression is the operand of the
5801 `&' operator. CAST_P is true if this expression is the target of a
5802 cast.
5804 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5805 class member access expressions [expr.ref].
5807 Returns a representation of the expression. */
5809 static tree
5813 {
5815 location_t loc;
5822 /* Peek at the next token. */
5825 /* Some of the productions are determined by keywords. */
5828 {
5833 {
5834 tree type;
5835 tree expression;
5839 /* All of these can be handled in the same way from the point
5840 of view of parsing. Begin by consuming the token
5841 identifying the cast. */
5844 /* New types cannot be defined in the cast. */
5846 parser->type_definition_forbidden_message
5849 /* Look for the opening `<'. */
5851 /* Parse the type to which we are casting. */
5856 /* Look for the closing `>'. */
5858 /* Restore the old message. */
5861 bool saved_greater_than_is_operator_p
5865 /* And the expression which is being cast. */
5870 parser->greater_than_is_operator_p
5873 /* Only type conversions to integral or enumeration types
5874 can be used in constant-expressions. */
5880 {
5882 postfix_expression
5886 postfix_expression
5890 postfix_expression
5892 tf_warning_or_error);
5895 postfix_expression
5900 }
5901 }
5905 {
5906 tree type;
5910 /* Consume the `typeid' token. */
5912 /* Look for the `(' token. */
5914 /* Types cannot be defined in a `typeid' expression. */
5916 parser->type_definition_forbidden_message
5918 /* We can't be sure yet whether we're looking at a type-id or an
5919 expression. */
5921 /* Try a type-id first. */
5926 /* Look for the `)' token. Otherwise, we can't be sure that
5927 we're not looking at an expression: consider `typeid (int
5928 (3))', for example. */
5930 /* If all went well, simply lookup the type-id. */
5933 /* Otherwise, fall back to the expression variant. */
5934 else
5935 {
5936 tree expression;
5938 /* Look for an expression. */
5940 /* Compute its typeid. */
5942 /* Look for the `)' token. */
5944 }
5945 /* Restore the saved message. */
5947 /* `typeid' may not appear in an integral constant expression. */
5950 }
5954 {
5955 tree type;
5956 /* The syntax permitted here is the same permitted for an
5957 elaborated-type-specifier. */
5962 }
5966 {
5970 {
5975 }
5977 {
5982 }
5983 else
5984 {
5985 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5988 }
5990 postfix_expression =
5994 {
5998 }
6000 {
6005 }
6006 else
6007 {
6009 postfix_expression);
6013 }
6015 }
6018 {
6021 tree p;
6035 tf_warning_or_error);
6038 tf_warning_or_error);
6039 else
6040 {
6044 }
6046 }
6049 {
6050 tree type;
6052 /* If the next thing is a simple-type-specifier, we may be
6053 looking at a functional cast. We could also be looking at
6054 an id-expression. So, we try the functional cast, and if
6055 that doesn't work we fall back to the primary-expression. */
6057 /* Look for the simple-type-specifier. */
6060 CP_PARSER_FLAGS_NONE);
6061 /* Parse the cast itself. */
6063 postfix_expression
6065 /* If that worked, we're done. */
6069 /* If the functional-cast didn't work out, try a
6070 compound-literal. */
6073 {
6078 /* Avoid calling cp_parser_type_id pointlessly, see comment
6079 in cp_parser_cast_expression about c++/29234. */
6082 else
6083 {
6084 /* Parse the type. */
6089 /* Look for the `)'. */
6091 }
6093 /* If things aren't going well, there's no need to
6094 keep going. */
6096 {
6098 /* Parse the brace-enclosed initializer list. */
6101 }
6102 /* If that worked, we're definitely looking at a
6103 compound-literal expression. */
6105 {
6106 /* Warn the user that a compound literal is not
6107 allowed in standard C++. */
6110 /* For simplicity, we disallow compound literals in
6111 constant-expressions. We could
6112 allow compound literals of integer type, whose
6113 initializer was a constant, in constant
6114 expressions. Permitting that usage, as a further
6115 extension, would not change the meaning of any
6116 currently accepted programs. (Of course, as
6117 compound literals are not part of ISO C++, the
6118 standard has nothing to say.) */
6120 NIC_NCC))
6121 {
6124 }
6125 /* Form the representation of the compound-literal. */
6126 postfix_expression
6128 tf_warning_or_error);
6130 }
6131 }
6133 /* It must be a primary-expression. */
6134 postfix_expression
6137 decltype_p,
6139 }
6141 }
6143 /* Note that we don't need to worry about calling build_cplus_new on a
6144 class-valued CALL_EXPR in decltype when it isn't the end of the
6145 postfix-expression; unary_complex_lvalue will take care of that for
6146 all these cases. */
6148 /* Keep looping until the postfix-expression is complete. */
6150 {
6154 /* It is not a Koenig lookup function call. */
6155 postfix_expression
6158 /* Peek at the next token. */
6162 {
6165 {
6167 "two consecutive %<[%> shall "
6170 }
6171 postfix_expression
6173 postfix_expression,
6175 decltype_p);
6181 /* postfix-expression ( expression-list [opt] ) */
6182 {
6192 is_builtin_constant_p
6195 {
6196 /* The whole point of __builtin_constant_p is to allow
6197 non-constant expressions to appear as arguments. */
6198 saved_integral_constant_expression_p
6200 saved_non_integral_constant_expression_p
6203 }
6204 args = (cp_parser_parenthesized_expression_list
6210 {
6211 parser->integral_constant_expression_p
6213 parser->non_integral_constant_expression_p
6215 }
6218 {
6221 }
6223 /* Function calls are not permitted in
6224 constant-expressions. */
6227 NIC_FUNC_CALL))
6228 {
6232 }
6237 {
6239 {
6241 {
6244 postfix_expression
6246 complain);
6247 }
6248 else
6249 postfix_expression
6251 }
6252 /* We do not perform argument-dependent lookup if
6253 normal lookup finds a non-function, in accordance
6254 with the expected resolution of DR 218. */
6257 {
6261 /* Do not do argument dependent lookup if regular
6262 lookup finds a member function or a block-scope
6263 function declaration. [basic.lookup.argdep]/3 */
6266 {
6269 postfix_expression
6271 complain);
6272 }
6273 }
6274 }
6277 {
6287 "%<memset%> used with constant zero length "
6288 "parameter; this could be due to transposed "
6291 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6292 to avoid leaking those into folder and middle-end. */
6294 tree arg;
6298 }
6301 {
6311 {
6312 postfix_expression
6316 }
6319 {
6320 postfix_expression
6321 = (build_new_method_call
6327 complain));
6328 }
6329 else
6330 postfix_expression
6334 complain);
6335 }
6339 postfix_expression = (build_offset_ref_call_from_tree
6341 complain));
6343 /* A call to a static class member, or a namespace-scope
6344 function. */
6345 postfix_expression
6348 koenig_p,
6349 complain);
6350 else
6351 /* All other function calls. */
6352 postfix_expression
6355 koenig_p,
6356 complain);
6360 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6364 }
6369 /* postfix-expression . template [opt] id-expression
6370 postfix-expression . pseudo-destructor-name
6371 postfix-expression -> template [opt] id-expression
6372 postfix-expression -> pseudo-destructor-name */
6374 /* Consume the `.' or `->' operator. */
6377 postfix_expression
6379 postfix_expression,
6386 /* postfix-expression ++ */
6387 /* Consume the `++' token. */
6389 /* Generate a representation for the complete expression. */
6390 postfix_expression
6392 POSTINCREMENT_EXPR);
6393 /* Increments may not appear in constant-expressions. */
6401 /* postfix-expression -- */
6402 /* Consume the `--' token. */
6404 /* Generate a representation for the complete expression. */
6405 postfix_expression
6407 POSTDECREMENT_EXPR);
6408 /* Decrements may not appear in constant-expressions. */
6420 else
6422 }
6423 }
6425 /* We should never get here. */
6428 }
6430 /* This function parses Cilk Plus array notations. If a normal array expr. is
6431 parsed then the array index is passed back to the caller through *INIT_INDEX
6432 and the function returns a NULL_TREE. If array notation expr. is parsed,
6433 then *INIT_INDEX is ignored by the caller and the function returns
6434 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6435 error_mark_node. */
6437 static tree
6439 tree array_value)
6440 {
6444 {
6447 }
6456 {
6459 }
6461 {
6462 /* Consume the ':'. */
6465 /* If we are here, then we have a case like this A[:]. */
6467 {
6471 }
6475 }
6476 else
6477 {
6478 /* If we are here, then there are three valid possibilities:
6479 1. ARRAY [ EXP ]
6480 2. ARRAY [ EXP : EXP ]
6481 3. ARRAY [ EXP : EXP : EXP ] */
6486 {
6487 /* This indicates that we have a normal array expression. */
6490 }
6492 /* Consume the ':'. */
6497 {
6501 }
6502 }
6507 {
6511 }
6517 }
6519 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6520 by cp_parser_builtin_offsetof. We're looking for
6522 postfix-expression [ expression ]
6523 postfix-expression [ braced-init-list ] (C++11)
6525 FOR_OFFSETOF is set if we're being called in that context, which
6526 changes how we deal with integer constant expressions. */
6528 static tree
6530 tree postfix_expression,
6533 {
6538 /* Consume the `[' token. */
6544 /* Parse the index expression. */
6545 /* ??? For offsetof, there is a question of what to allow here. If
6546 offsetof is not being used in an integral constant expression context,
6547 then we *could* get the right answer by computing the value at runtime.
6548 If we are in an integral constant expression context, then we might
6549 could accept any constant expression; hard to say without analysis.
6550 Rather than open the barn door too wide right away, allow only integer
6551 constant expressions here. */
6554 else
6555 {
6557 {
6564 {
6566 "braced list index is not allowed with array "
6570 }
6571 }
6573 {
6574 /* Here are have these two options:
6575 ARRAY[EXP : EXP] - Array notation expr with default
6576 stride of 1.
6577 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6578 stride. */
6580 postfix_expression);
6583 }
6584 else
6586 }
6588 /* For offsetof and declaration of types we need
6589 constant integeral values.
6590 Also we meed to fold for negative constants so that diagnostic in
6591 c-family/c-common.c doesn't fail for array-bounds. */
6597 /* Look for the closing `]'. */
6600 /* Build the ARRAY_REF. */
6604 /* When not doing offsetof, array references are not permitted in
6605 constant-expressions. */
6611 }
6613 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6614 by cp_parser_builtin_offsetof. We're looking for
6616 postfix-expression . template [opt] id-expression
6617 postfix-expression . pseudo-destructor-name
6618 postfix-expression -> template [opt] id-expression
6619 postfix-expression -> pseudo-destructor-name
6621 FOR_OFFSETOF is set if we're being called in that context. That sorta
6622 limits what of the above we'll actually accept, but nevermind.
6623 TOKEN_TYPE is the "." or "->" token, which will already have been
6624 removed from the stream. */
6626 static tree
6629 tree postfix_expression,
6631 location_t location)
6632 {
6633 tree name;
6638 /* If this is a `->' operator, dereference the pointer. */
6641 tf_warning_or_error);
6642 /* Check to see whether or not the expression is type-dependent. */
6644 /* The identifier following the `->' or `.' is not qualified. */
6650 /* Enter the scope corresponding to the type of the object
6651 given by the POSTFIX_EXPRESSION. */
6653 {
6655 /* According to the standard, no expression should ever have
6656 reference type. Unfortunately, we do not currently match
6657 the standard in this respect in that our internal representation
6658 of an expression may have reference type even when the standard
6659 says it does not. Therefore, we have to manually obtain the
6660 underlying type here. */
6662 /* The type of the POSTFIX_EXPRESSION must be complete. */
6664 {
6666 postfix_expression);
6668 }
6669 /* Unlike the object expression in other contexts, *this is not
6670 required to be of complete type for purposes of class member
6671 access (5.2.5) outside the member function body. */
6675 /* Let the name lookup machinery know that we are processing a
6676 class member access expression. */
6678 /* If something went wrong, we want to be able to discern that case,
6679 as opposed to the case where there was no SCOPE due to the type
6680 of expression being dependent. */
6683 /* If the SCOPE was erroneous, make the various semantic analysis
6684 functions exit quickly -- and without issuing additional error
6685 messages. */
6688 }
6690 /* Assume this expression is not a pseudo-destructor access. */
6693 /* If the SCOPE is a scalar type, then, if this is a valid program,
6694 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6695 is type dependent, it can be pseudo-destructor-name or something else.
6696 Try to parse it as pseudo-destructor-name first. */
6698 {
6699 tree s;
6700 tree type;
6703 /* Parse the pseudo-destructor-name. */
6712 {
6714 postfix_expression
6717 }
6718 }
6721 {
6722 /* If the SCOPE is not a scalar type, we are looking at an
6723 ordinary class member access expression, rather than a
6724 pseudo-destructor-name. */
6727 /* Parse the id-expression. */
6728 name = (cp_parser_id_expression
6735 /* In general, build a SCOPE_REF if the member name is qualified.
6736 However, if the name was not dependent and has already been
6737 resolved; there is no need to build the SCOPE_REF. For example;
6739 struct X { void f(); };
6740 template <typename T> void f(T* t) { t->X::f(); }
6742 Even though "t" is dependent, "X::f" is not and has been resolved
6743 to a BASELINK; there is no need to include scope information. */
6745 /* But we do need to remember that there was an explicit scope for
6746 virtual function calls. */
6750 /* If the name is a template-id that names a type, we will get a
6751 TYPE_DECL here. That is invalid code. */
6753 {
6756 }
6757 else
6758 {
6760 {
6762 {
6766 }
6767 else
6770 name,
6771 template_p);
6775 }
6777 adjust_result_of_qualified_name_lookup
6779 postfix_expression
6781 template_p,
6782 tf_warning_or_error);
6783 }
6784 }
6786 /* We no longer need to look up names in the scope of the object on
6787 the left-hand side of the `.' or `->' operator. */
6790 /* Outside of offsetof, these operators may not appear in
6791 constant-expressions. */
6793 && (cp_parser_non_integral_constant_expression
6798 }
6800 /* Cache of LITERAL_ZERO_P constants. */
6804 /* Parse a parenthesized expression-list.
6806 expression-list:
6807 assignment-expression
6808 expression-list, assignment-expression
6810 attribute-list:
6811 expression-list
6812 identifier
6813 identifier, expression-list
6815 CAST_P is true if this expression is the target of a cast.
6817 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6818 argument pack.
6820 Returns a vector of trees. Each element is a representation of an
6821 assignment-expression. NULL is returned if the ( and or ) are
6822 missing. An empty, but allocated, vector is returned on no
6823 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6824 if we are parsing an attribute list for an attribute that wants a
6825 plain identifier argument, normal_attr for an attribute that wants
6826 an expression, or non_attr if we aren't parsing an attribute list. If
6827 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6828 not all of the expressions in the list were constant.
6829 WANT_LITERAL_ZERO_P is true if the caller is interested in
6830 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6831 immediately, this can be removed. */
6840 {
6846 /* Assume all the expressions will be constant. */
6855 /* Within a parenthesized expression, a `>' token is always
6856 the greater-than operator. */
6857 saved_greater_than_is_operator_p
6861 /* Consume expressions until there are no more. */
6864 {
6865 tree expr;
6867 /* At the beginning of attribute lists, check to see if the
6868 next token is an identifier. */
6871 {
6874 /* Consume the identifier. */
6876 /* Save the identifier. */
6878 }
6879 else
6880 {
6883 /* Parse the next assignment-expression. */
6885 {
6886 /* A braced-init-list. */
6892 }
6894 {
6895 expr = (cp_parser_constant_expression
6900 }
6901 else
6902 {
6906 {
6912 /* If a parameter is literal zero alone, remember it
6913 for -Wmemset-transposed-args warning. */
6916 && want_literal_zero_p
6918 == CPP_COMMA
6921 {
6928 else
6929 {
6934 }
6935 /* Consume the 0 token (or '\0', 0LL etc.). */
6937 }
6941 }
6944 cast_p);
6945 }
6950 /* If we have an ellipsis, then this is an expression
6951 expansion. */
6954 {
6955 /* Consume the `...'. */
6958 /* Build the argument pack. */
6960 }
6962 /* Add it to the list. We add error_mark_node
6963 expressions to the list, so that we can still tell if
6964 the correct form for a parenthesized expression-list
6965 is found. That gives better errors. */
6970 }
6972 /* After the first item, attribute lists look the same as
6973 expression lists. */
6976 get_comma:;
6977 /* If the next token isn't a `,', then we are done. */
6981 /* Otherwise, consume the `,' and keep going. */
6983 }
6986 {
6989 skip_comma:;
6990 /* We try and resync to an unnested comma, as that will give the
6991 user better diagnostics. */
6999 {
7000 parser->greater_than_is_operator_p
7003 }
7004 }
7006 parser->greater_than_is_operator_p
7013 }
7015 /* Parse a pseudo-destructor-name.
7017 pseudo-destructor-name:
7018 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7019 :: [opt] nested-name-specifier template template-id :: ~ type-name
7020 :: [opt] nested-name-specifier [opt] ~ type-name
7022 If either of the first two productions is used, sets *SCOPE to the
7023 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7024 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7025 or ERROR_MARK_NODE if the parse fails. */
7027 static void
7029 tree object,
7032 {
7035 /* Handle ~auto. */
7039 {
7042 "%<~auto%> only available with "
7049 }
7051 /* Assume that things will not work out. */
7054 /* Look for the optional `::' operator. */
7056 /* Look for the optional nested-name-specifier. */
7057 nested_name_specifier_p
7064 /* Now, if we saw a nested-name-specifier, we might be doing the
7065 second production. */
7068 {
7069 /* Consume the `template' keyword. */
7071 /* Parse the template-id. */
7075 class_type,
7077 /* Look for the `::' token. */
7079 }
7080 /* If the next token is not a `~', then there might be some
7081 additional qualification. */
7083 {
7084 /* At this point, we're looking for "type-name :: ~". The type-name
7085 must not be a class-name, since this is a pseudo-destructor. So,
7086 it must be either an enum-name, or a typedef-name -- both of which
7087 are just identifiers. So, we peek ahead to check that the "::"
7088 and "~" tokens are present; if they are not, then we can avoid
7089 calling type_name. */
7093 {
7096 }
7098 /* Look for the type-name. */
7103 /* Look for the `::' token. */
7105 }
7106 else
7109 /* Look for the `~'. */
7112 /* Once we see the ~, this has to be a pseudo-destructor. */
7116 /* Look for the type-name again. We are not responsible for
7117 checking that it matches the first type-name. */
7119 }
7121 /* Parse a unary-expression.
7123 unary-expression:
7124 postfix-expression
7125 ++ cast-expression
7126 -- cast-expression
7127 unary-operator cast-expression
7128 sizeof unary-expression
7129 sizeof ( type-id )
7130 alignof ( type-id ) [C++0x]
7131 new-expression
7132 delete-expression
7134 GNU Extensions:
7136 unary-expression:
7137 __extension__ cast-expression
7138 __alignof__ unary-expression
7139 __alignof__ ( type-id )
7140 alignof unary-expression [C++0x]
7141 __real__ cast-expression
7142 __imag__ cast-expression
7143 && identifier
7144 sizeof ( type-id ) { initializer-list , [opt] }
7145 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7146 __alignof__ ( type-id ) { initializer-list , [opt] }
7148 ADDRESS_P is true iff the unary-expression is appearing as the
7149 operand of the `&' operator. CAST_P is true if this expression is
7150 the target of a cast.
7152 Returns a representation of the expression. */
7154 static tree
7157 {
7161 /* Peek at the next token. */
7163 /* Some keywords give away the kind of expression. */
7165 {
7169 {
7172 {
7175 location_t first_loc;
7178 /* Consume the token. */
7181 /* Parse the operand. */
7186 else
7187 {
7188 /* ISO C++ defines alignof only with types, not with
7189 expressions. So pedwarn if alignof is used with a non-
7190 type expression. However, __alignof__ is ok. */
7193 "ISO C++ does not allow %<alignof%> "
7197 }
7198 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7199 SIZEOF_EXPR with the original operand. */
7201 {
7203 {
7205 {
7208 error_mark_node));
7210 }
7211 else
7215 }
7217 }
7219 }
7228 {
7229 /* The saved value of the PEDANTIC flag. */
7231 tree expr;
7233 /* Save away the PEDANTIC flag. */
7235 /* Parse the cast-expression. */
7237 /* Restore the PEDANTIC flag. */
7241 }
7245 {
7246 tree expression;
7248 /* Consume the `__real__' or `__imag__' token. */
7250 /* Parse the cast-expression. */
7252 /* Create the complete representation. */
7256 expression,
7257 tf_warning_or_error);
7258 }
7266 {
7267 tree expr;
7277 parser->type_definition_forbidden_message
7280 saved_integral_constant_expression_p
7282 saved_non_integral_constant_expression_p
7286 saved_greater_than_is_operator_p
7298 parser->greater_than_is_operator_p
7301 parser->integral_constant_expression_p
7303 parser->non_integral_constant_expression_p
7310 }
7314 }
7315 }
7317 /* Look for the `:: new' and `:: delete', which also signal the
7318 beginning of a new-expression, or delete-expression,
7319 respectively. If the next token is `::', then it might be one of
7320 these. */
7322 {
7325 /* See if the token after the `::' is one of the keywords in
7326 which we're interested. */
7328 /* If it's `new', we have a new-expression. */
7331 /* Similarly, for `delete'. */
7334 }
7336 /* Look for a unary operator. */
7338 /* The `++' and `--' operators can be handled similarly, even though
7339 they are not technically unary-operators in the grammar. */
7341 {
7346 /* Handle the GNU address-of-label extension. */
7349 {
7350 tree identifier;
7351 tree expression;
7354 /* Consume the '&&' token. */
7356 /* Look for the identifier. */
7358 /* Create an expression representing the address. */
7361 NIC_ADDR_LABEL))
7364 }
7365 }
7367 {
7368 tree cast_expression;
7374 /* Consume the operator token. */
7376 /* Parse the cast-expression. */
7377 cast_expression
7382 pidk);
7383 /* Now, build an appropriate representation. */
7385 {
7389 RO_UNARY_STAR,
7390 complain);
7395 /* Fall through. */
7398 cast_expression,
7399 complain);
7406 /* Fall through. */
7416 }
7420 non_constant_p))
7424 }
7428 decltype_p,
7429 pidk);
7430 }
7432 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7433 unary-operator, the corresponding tree code is returned. */
7435 static enum tree_code
7437 {
7439 {
7460 }
7461 }
7463 /* Parse a new-expression.
7465 new-expression:
7466 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7467 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7469 Returns a representation of the expression. */
7471 static tree
7473 {
7476 tree type;
7479 tree ret;
7481 /* Look for the optional `::' operator. */
7482 global_scope_p
7486 /* Look for the `new' operator. */
7488 /* There's no easy way to tell a new-placement from the
7489 `( type-id )' construct. */
7491 /* Look for a new-placement. */
7493 /* If that didn't work out, there's no new-placement. */
7495 {
7499 }
7501 /* If the next token is a `(', then we have a parenthesized
7502 type-id. */
7504 {
7508 /* Consume the `('. */
7511 /* Parse the type-id. */
7512 parser->type_definition_forbidden_message
7517 /* Look for the closing `)'. */
7520 /* There should not be a direct-new-declarator in this production,
7521 but GCC used to allowed this, so we check and emit a sensible error
7522 message for this case. */
7524 {
7530 }
7531 }
7532 /* Otherwise, there must be a new-type-id. */
7533 else
7536 /* If the next token is a `(' or '{', then we have a new-initializer. */
7540 else
7543 /* A new-expression may not appear in an integral constant
7544 expression. */
7547 else
7548 {
7549 /* Create a representation of the new-expression. */
7551 tf_warning_or_error);
7552 }
7560 }
7562 /* Parse a new-placement.
7564 new-placement:
7565 ( expression-list )
7567 Returns the same representation as for an expression-list. */
7571 {
7574 /* Parse the expression-list. */
7575 expression_list = (cp_parser_parenthesized_expression_list
7581 }
7583 /* Parse a new-type-id.
7585 new-type-id:
7586 type-specifier-seq new-declarator [opt]
7588 Returns the TYPE allocated. If the new-type-id indicates an array
7589 type, *NELTS is set to the number of elements in the last array
7590 bound; the TYPE will not include the last array bound. */
7592 static tree
7594 {
7595 cp_decl_specifier_seq type_specifier_seq;
7601 /* The type-specifier sequence must not contain type definitions.
7602 (It cannot contain declarations of new types either, but if they
7603 are not definitions we will catch that because they are not
7604 complete.) */
7606 parser->type_definition_forbidden_message
7608 /* Parse the type-specifier-seq. */
7612 /* Restore the old message. */
7618 /* Parse the new-declarator. */
7621 /* Determine the number of elements in the last array dimension, if
7622 any. */
7624 /* Skip down to the last array dimension. */
7629 {
7632 }
7637 {
7640 }
7643 {
7650 else
7652 }
7655 }
7657 /* Parse an (optional) new-declarator.
7659 new-declarator:
7660 ptr-operator new-declarator [opt]
7661 direct-new-declarator
7663 Returns the declarator. */
7667 {
7670 cp_cv_quals cv_quals;
7672 /* We don't know if there's a ptr-operator next, or not. */
7674 /* Look for a ptr-operator. */
7676 /* If that worked, look for more new-declarators. */
7678 {
7681 /* Parse another optional declarator. */
7684 declarator = cp_parser_make_indirect_declarator
7688 }
7690 /* If the next token is a `[', there is a direct-new-declarator. */
7695 }
7697 /* Parse a direct-new-declarator.
7699 direct-new-declarator:
7700 [ expression ]
7701 direct-new-declarator [constant-expression]
7703 */
7707 {
7711 {
7712 tree expression;
7715 /* Look for the opening `['. */
7720 /* The standard requires that the expression have integral
7721 type. DR 74 adds enumeration types. We believe that the
7722 real intent is that these expressions be handled like the
7723 expression in a `switch' condition, which also allows
7724 classes with a single conversion to integral or
7725 enumeration type. */
7727 {
7728 expression
7730 expression,
7733 {
7735 "expression in new-declarator must have integral "
7738 }
7739 }
7741 /* Look for the closing `]'. */
7744 /* Add this bound to the declarator. */
7747 /* If the next token is not a `[', then there are no more
7748 bounds. */
7751 }
7754 }
7756 /* Parse a new-initializer.
7758 new-initializer:
7759 ( expression-list [opt] )
7760 braced-init-list
7762 Returns a representation of the expression-list. */
7766 {
7770 {
7771 tree t;
7778 }
7779 else
7780 expression_list = (cp_parser_parenthesized_expression_list
7786 }
7788 /* Parse a delete-expression.
7790 delete-expression:
7791 :: [opt] delete cast-expression
7792 :: [opt] delete [ ] cast-expression
7794 Returns a representation of the expression. */
7796 static tree
7798 {
7801 tree expression;
7803 /* Look for the optional `::' operator. */
7804 global_scope_p
7808 /* Look for the `delete' keyword. */
7810 /* See if the array syntax is in use. */
7812 {
7813 /* Consume the `[' token. */
7815 /* Look for the `]' token. */
7817 /* Remember that this is the `[]' construct. */
7819 }
7820 else
7823 /* Parse the cast-expression. */
7826 /* A delete-expression may not appear in an integral constant
7827 expression. */
7832 tf_warning_or_error);
7833 }
7835 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7836 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7837 0 otherwise. */
7839 static int
7841 {
7844 {
7886 /* In ((type ()) () the last () isn't a valid cast-expression,
7887 so the whole must be parsed as postfix-expression. */
7892 /* '[' may start a primary-expression in obj-c++ and in C++11,
7893 as a lambda-expression, eg, '(void)[]{}'. */
7900 /* '++' and '--' may or may not start a cast-expression:
7902 struct T { void operator++(int); };
7903 void f() { (T())++; }
7905 vs
7907 int a;
7908 (int)++a; */
7913 }
7914 }
7916 /* Parse a cast-expression.
7918 cast-expression:
7919 unary-expression
7920 ( type-id ) cast-expression
7922 ADDRESS_P is true iff the unary-expression is appearing as the
7923 operand of the `&' operator. CAST_P is true if this expression is
7924 the target of a cast.
7926 Returns a representation of the expression. */
7928 static tree
7931 {
7932 /* If it's a `(', then we might be looking at a cast. */
7934 {
7940 /* There's no way to know yet whether or not this is a cast.
7941 For example, `(int (3))' is a unary-expression, while `(int)
7942 3' is a cast. So, we resort to parsing tentatively. */
7944 /* Types may not be defined in a cast. */
7946 parser->type_definition_forbidden_message
7948 /* Consume the `('. */
7950 /* A very tricky bit is that `(struct S) { 3 }' is a
7951 compound-literal (which we permit in C++ as an extension).
7952 But, that construct is not a cast-expression -- it is a
7953 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7954 is legal; if the compound-literal were a cast-expression,
7955 you'd need an extra set of parentheses.) But, if we parse
7956 the type-id, and it happens to be a class-specifier, then we
7957 will commit to the parse at that point, because we cannot
7958 undo the action that is done when creating a new class. So,
7959 then we cannot back up and do a postfix-expression.
7961 Another tricky case is the following (c++/29234):
7963 struct S { void operator () (); };
7965 void foo ()
7966 {
7967 ( S()() );
7968 }
7970 As a type-id we parse the parenthesized S()() as a function
7971 returning a function, groktypename complains and we cannot
7972 back up in this case either.
7974 Therefore, we scan ahead to the closing `)', and check to see
7975 if the tokens after the `)' can start a cast-expression. Otherwise
7976 we are dealing with an unary-expression, a postfix-expression
7977 or something else.
7979 Yet another tricky case, in C++11, is the following (c++/54891):
7981 (void)[]{};
7983 The issue is that usually, besides the case of lambda-expressions,
7984 the parenthesized type-id cannot be followed by '[', and, eg, we
7985 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7986 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7987 we don't commit, we try a cast-expression, then an unary-expression.
7989 Save tokens so that we can put them back. */
7992 /* We may be looking at a cast-expression. */
7995 cast_expression
7998 /* Roll back the tokens we skipped. */
8000 /* If we aren't looking at a cast-expression, simulate an error so
8001 that the call to cp_parser_error_occurred below returns true. */
8004 else
8005 {
8008 /* Look for the type-id. */
8010 /* Look for the closing `)'. */
8013 }
8015 /* Restore the saved message. */
8018 /* At this point this can only be either a cast or a
8019 parenthesized ctor such as `(T ())' that looks like a cast to
8020 function returning T. */
8022 {
8023 /* Only commit if the cast-expression doesn't start with
8024 '++', '--', or '[' in C++11. */
8032 pidk);
8035 {
8036 /* Warn about old-style casts, if so requested. */
8043 /* Only type conversions to integral or enumeration types
8044 can be used in constant-expressions. */
8047 NIC_CAST))
8050 /* Perform the cast. */
8051 /* We don't want to resolve cast too early. Therefore we don't
8052 be able to use build_c_cast. */
8055 }
8056 }
8057 else
8059 }
8061 /* If we get here, then it's not a cast, so it must be a
8062 unary-expression. */
8065 }
8067 /* Parse a binary expression of the general form:
8069 pm-expression:
8070 cast-expression
8071 pm-expression .* cast-expression
8072 pm-expression ->* cast-expression
8074 multiplicative-expression:
8075 pm-expression
8076 multiplicative-expression * pm-expression
8077 multiplicative-expression / pm-expression
8078 multiplicative-expression % pm-expression
8080 additive-expression:
8081 multiplicative-expression
8082 additive-expression + multiplicative-expression
8083 additive-expression - multiplicative-expression
8085 shift-expression:
8086 additive-expression
8087 shift-expression << additive-expression
8088 shift-expression >> additive-expression
8090 relational-expression:
8091 shift-expression
8092 relational-expression < shift-expression
8093 relational-expression > shift-expression
8094 relational-expression <= shift-expression
8095 relational-expression >= shift-expression
8097 GNU Extension:
8099 relational-expression:
8100 relational-expression <? shift-expression
8101 relational-expression >? shift-expression
8103 equality-expression:
8104 relational-expression
8105 equality-expression == relational-expression
8106 equality-expression != relational-expression
8108 and-expression:
8109 equality-expression
8110 and-expression & equality-expression
8112 exclusive-or-expression:
8113 and-expression
8114 exclusive-or-expression ^ and-expression
8116 inclusive-or-expression:
8117 exclusive-or-expression
8118 inclusive-or-expression | exclusive-or-expression
8120 logical-and-expression:
8121 inclusive-or-expression
8122 logical-and-expression && inclusive-or-expression
8124 logical-or-expression:
8125 logical-and-expression
8126 logical-or-expression || logical-and-expression
8128 All these are implemented with a single function like:
8130 binary-expression:
8131 simple-cast-expression
8132 binary-expression <token> binary-expression
8134 CAST_P is true if this expression is the target of a cast.
8136 The binops_by_token map is used to get the tree codes for each <token> type.
8137 binary-expressions are associated according to a precedence table. */
8139 #define TOKEN_PRECEDENCE(token) \
8140 (((token->type == CPP_GREATER \
8141 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8142 && !parser->greater_than_is_operator_p) \
8143 ? PREC_NOT_OPERATOR \
8144 : binops_by_token[token->type].prec)
8146 static tree
8152 {
8153 cp_parser_expression_stack stack;
8155 cp_parser_expression_stack_entry current;
8156 tree rhs;
8160 tree overload;
8162 /* Parse the first expression. */
8173 {
8174 /* Get an operator token. */
8180 {
8182 "%<>>%> operator is treated"
8186 }
8190 /* Popping an entry off the stack means we completed a subexpression:
8191 - either we found a token which is not an operator (`>' where it is not
8192 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8193 will happen repeatedly;
8194 - or, we found an operator which has lower priority. This is the case
8195 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8196 parsing `3 * 4'. */
8198 {
8201 else
8203 }
8205 get_rhs:
8209 /* We used the operator token. */
8212 /* For "false && x" or "true || x", x will never be executed;
8213 disable warnings while evaluating it. */
8219 /* Extract another operand. It may be the RHS of this expression
8220 or the LHS of a new, higher priority expression. */
8225 /* Get another operator token. Look up its precedence to avoid
8226 building a useless (immediately popped) stack entry for common
8227 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8231 {
8232 /* ... and prepare to parse the RHS of the new, higher priority
8233 expression. Since precedence levels on the stack are
8234 monotonically increasing, we do not have to care about
8235 stack overflows. */
8244 pop:
8246 /* If the stack is not empty, we have parsed into LHS the right side
8247 (`4' in the example above) of an expression we had suspended.
8248 We can use the information on the stack to recover the LHS (`3')
8249 from the stack together with the tree code (`MULT_EXPR'), and
8250 the precedence of the higher level subexpression
8251 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8252 which will be used to actually build the additive expression. */
8257 }
8259 /* Undo the disabling of warnings done above. */
8268 /* Avoid warning for !!x == y. */
8273 /* Avoid warning for !b == y where b is boolean. */
8277 /* Avoid warning for !!b == y where b is boolean. */
8285 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8286 ERROR_MARK for everything that is not a binary expression.
8287 This makes warn_about_parentheses miss some warnings that
8288 involve unary operators. For unary expressions we should
8289 pass the correct tree_code unless the unary expression was
8290 surrounded by parentheses.
8291 */
8297 == tcc_comparison
8300 else
8309 /* If the binary operator required the use of an overloaded operator,
8310 then this expression cannot be an integral constant-expression.
8311 An overloaded operator can be used even if both operands are
8312 otherwise permissible in an integral constant-expression if at
8313 least one of the operands is of enumeration type. */
8317 NIC_OVERLOADED))
8319 }
8322 }
8324 static tree
8329 {
8332 }
8334 /* Parse the `? expression : assignment-expression' part of a
8335 conditional-expression. The LOGICAL_OR_EXPR is the
8336 logical-or-expression that started the conditional-expression.
8337 Returns a representation of the entire conditional-expression.
8339 This routine is used by cp_parser_assignment_expression.
8341 ? expression : assignment-expression
8343 GNU Extensions:
8345 ? : assignment-expression */
8347 static tree
8349 {
8350 tree expr;
8351 tree assignment_expr;
8355 /* Consume the `?' token. */
8360 {
8363 /* Implicit true clause. */
8367 }
8368 else
8369 {
8372 /* Parse the expression. */
8375 c_inhibit_evaluation_warnings +=
8379 }
8381 /* The next token should be a `:'. */
8383 /* Parse the assignment-expression. */
8387 /* Build the conditional-expression. */
8389 expr,
8390 assignment_expr,
8391 tf_warning_or_error);
8392 }
8394 /* Parse an assignment-expression.
8396 assignment-expression:
8397 conditional-expression
8398 logical-or-expression assignment-operator assignment_expression
8399 throw-expression
8401 CAST_P is true if this expression is the target of a cast.
8402 DECLTYPE_P is true if this expression is the operand of decltype.
8404 Returns a representation for the expression. */
8406 static tree
8409 {
8410 tree expr;
8412 /* If the next token is the `throw' keyword, then we're looking at
8413 a throw-expression. */
8416 /* Otherwise, it must be that we are looking at a
8417 logical-or-expression. */
8418 else
8419 {
8420 /* Parse the binary expressions (logical-or-expression). */
8422 decltype_p,
8424 /* If the next token is a `?' then we're actually looking at a
8425 conditional-expression. */
8428 else
8429 {
8432 /* If it's an assignment-operator, we're using the second
8433 production. */
8434 enum tree_code assignment_operator
8437 {
8439 location_t saved_input_location;
8441 /* Parse the right-hand side of the assignment. */
8447 /* An assignment may not appear in a
8448 constant-expression. */
8450 NIC_ASSIGNMENT))
8452 /* Build the assignment expression. Its default
8453 location is the location of the '=' token. */
8457 assignment_operator,
8458 rhs,
8461 }
8462 }
8463 }
8466 }
8468 /* Parse an (optional) assignment-operator.
8470 assignment-operator: one of
8471 = *= /= %= += -= >>= <<= &= ^= |=
8473 GNU Extension:
8475 assignment-operator: one of
8476 <?= >?=
8478 If the next token is an assignment operator, the corresponding tree
8479 code is returned, and the token is consumed. For example, for
8480 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8481 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8482 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8483 operator, ERROR_MARK is returned. */
8485 static enum tree_code
8487 {
8491 /* Peek at the next token. */
8495 {
8541 /* Nothing else is an assignment operator. */
8543 }
8545 /* If it was an assignment operator, consume it. */
8550 }
8552 /* Parse an expression.
8554 expression:
8555 assignment-expression
8556 expression , assignment-expression
8558 CAST_P is true if this expression is the target of a cast.
8559 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8560 except possibly parenthesized or on the RHS of a comma (N3276).
8562 Returns a representation of the expression. */
8564 static tree
8567 {
8572 {
8573 tree assignment_expression;
8575 /* Parse the next assignment-expression. */
8576 assignment_expression
8579 /* We don't create a temporary for a call that is the immediate operand
8580 of decltype or on the RHS of a comma. But when we see a comma, we
8581 need to create a temporary for a call on the LHS. */
8586 assignment_expression
8590 /* If this is the first assignment-expression, we can just
8591 save it away. */
8594 else
8596 assignment_expression,
8598 /* If the next token is not a comma, then we are done with the
8599 expression. */
8602 /* Consume the `,'. */
8605 /* A comma operator cannot appear in a constant-expression. */
8608 }
8611 }
8613 /* Parse a constant-expression.
8615 constant-expression:
8616 conditional-expression
8618 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8619 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8620 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8621 is false, NON_CONSTANT_P should be NULL. */
8623 static tree
8627 {
8631 tree expression;
8633 /* It might seem that we could simply parse the
8634 conditional-expression, and then check to see if it were
8635 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8636 one that the compiler can figure out is constant, possibly after
8637 doing some simplifications or optimizations. The standard has a
8638 precise definition of constant-expression, and we must honor
8639 that, even though it is somewhat more restrictive.
8641 For example:
8643 int i[(2, 3)];
8645 is not a legal declaration, because `(2, 3)' is not a
8646 constant-expression. The `,' operator is forbidden in a
8647 constant-expression. However, GCC's constant-folding machinery
8648 will fold this operation to an INTEGER_CST for `3'. */
8650 /* Save the old settings. */
8652 saved_allow_non_integral_constant_expression_p
8655 /* We are now parsing a constant-expression. */
8657 parser->allow_non_integral_constant_expression_p
8660 /* Although the grammar says "conditional-expression", we parse an
8661 "assignment-expression", which also permits "throw-expression"
8662 and the use of assignment operators. In the case that
8663 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8664 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8665 actually essential that we look for an assignment-expression.
8666 For example, cp_parser_initializer_clauses uses this function to
8667 determine whether a particular assignment-expression is in fact
8668 constant. */
8670 /* Restore the old settings. */
8671 parser->integral_constant_expression_p
8673 parser->allow_non_integral_constant_expression_p
8676 {
8677 /* Require an rvalue constant expression here; that's what our
8678 callers expect. Reference constant expressions are handled
8679 separately in e.g. cp_parser_template_argument. */
8684 }
8687 parser->non_integral_constant_expression_p
8691 }
8693 /* Parse __builtin_offsetof.
8695 offsetof-expression:
8696 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8698 offsetof-member-designator:
8699 id-expression
8700 | offsetof-member-designator "." id-expression
8701 | offsetof-member-designator "[" expression "]"
8702 | offsetof-member-designator "->" id-expression */
8704 static tree
8706 {
8709 cp_id_kind dummy;
8712 /* We're about to accept non-integral-constant things, but will
8713 definitely yield an integral constant expression. Save and
8714 restore these values around our local parsing. */
8718 /* Consume the "__builtin_offsetof" token. */
8720 /* Consume the opening `('. */
8722 /* Parse the type-id. */
8725 /* Look for the `,'. */
8729 /* Build the (type *)null that begins the traditional offsetof macro. */
8731 tf_warning_or_error);
8733 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8737 {
8740 {
8742 /* offsetof-member-designator "[" expression "]" */
8748 /* offsetof-member-designator "->" identifier */
8751 /* FALLTHRU */
8754 /* offsetof-member-designator "." identifier */
8762 /* Consume the ")" token. */
8767 /* Error. We know the following require will fail, but
8768 that gives the proper error message. */
8773 }
8774 }
8776 success:
8779 failure:
8784 }
8786 /* Parse a trait expression.
8788 Returns a representation of the expression, the underlying type
8789 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8791 static tree
8793 {
8794 cp_trait_kind kind;
8800 {
8884 }
8886 /* Consume the token. */
8897 {
8904 }
8906 {
8908 {
8912 {
8915 }
8919 }
8920 }
8924 /* Complete the trait expression, which may mean either processing
8925 the trait expr now or saving it for template instantiation. */
8927 {
8936 }
8937 }
8939 /* Lambdas that appear in variable initializer or default argument scope
8940 get that in their mangling, so we need to record it. We might as well
8941 use the count for function and namespace scopes as well. */
8945 {
8946 tree t;
8951 static void
8953 {
8954 tree_int ti;
8956 /* Once we're inside a function, we ignore other scopes and just push
8957 the function again so that popping works properly. */
8964 {
8965 /* Don't reset the count if we're still in the same function. */
8968 }
8969 }
8971 static void
8973 {
8976 }
8978 static void
8980 {
8983 {
8986 }
8988 }
8990 /* Parse a lambda expression.
8992 lambda-expression:
8993 lambda-introducer lambda-declarator [opt] compound-statement
8995 Returns a representation of the expression. */
8997 static tree
8999 {
9001 tree type;
9009 {
9011 {
9015 }
9017 }
9019 {
9021 {
9024 }
9026 }
9028 /* We may be in the middle of deferred access check. Disable
9029 it now. */
9040 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9043 /* Now that we've started the type, add the capture fields for any
9044 explicit captures. */
9047 {
9048 /* Inside the class, surrounding template-parameter-lists do not apply. */
9049 unsigned int saved_num_template_parameter_lists
9053 bool fully_implicit_function_template_p
9057 bool auto_is_implicit_function_template_parm_p
9068 /* By virtue of defining a local class, a lambda expression has access to
9069 the private variables of enclosing classes. */
9074 {
9080 }
9082 {
9085 }
9087 /* The capture list was built up in reverse order; fix that now. */
9099 parser->fully_implicit_function_template_p
9103 parser->auto_is_implicit_function_template_parm_p
9105 }
9109 /* This field is only used during parsing of the lambda. */
9112 /* This lambda shouldn't have any proxies left at this point. */
9114 /* And now that we're done, push proxies for an enclosing lambda. */
9119 else
9125 }
9127 /* Parse the beginning of a lambda expression.
9129 lambda-introducer:
9130 [ lambda-capture [opt] ]
9132 LAMBDA_EXPR is the current representation of the lambda expression. */
9134 static void
9136 {
9137 /* Need commas after the first capture. */
9140 /* Eat the leading `['. */
9143 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9151 {
9154 }
9157 {
9159 tree capture_id;
9160 tree capture_init_expr;
9164 enum capture_kind_type
9165 {
9166 BY_COPY,
9167 BY_REFERENCE
9168 };
9172 {
9175 }
9179 else
9182 /* Possibly capture `this'. */
9184 {
9194 explicit_init_p);
9196 }
9198 /* Remember whether we want to capture as a reference or not. */
9200 {
9203 }
9205 /* Get the identifier. */
9210 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9211 delimiters, but I modified this to stop on unnested ']' as well. It
9212 was already changed to stop on unnested '}', so the
9213 "closing_parenthesis" name is no more misleading with my change. */
9214 {
9220 }
9222 /* Find the initializer for this capture. */
9226 {
9228 /* An explicit initializer exists. */
9231 "lambda capture initializers "
9237 {
9240 }
9241 }
9242 else
9243 {
9246 /* Turn the identifier into an id-expression. */
9247 capture_init_expr
9252 {
9255 }
9259 {
9262 capture_init_expr);
9265 }
9268 {
9271 capture_init_expr))
9274 }
9276 capture_init_expr
9277 = finish_id_expression
9279 capture_init_expr,
9293 {
9296 }
9297 else
9299 }
9303 {
9308 capture_id);
9312 "capture of %qD redundant with by-reference capture "
9314 }
9317 capture_id,
9318 capture_init_expr,
9320 explicit_init_p);
9321 }
9324 }
9326 /* Parse the (optional) middle of a lambda expression.
9328 lambda-declarator:
9329 < template-parameter-list [opt] >
9330 ( parameter-declaration-clause [opt] )
9331 attribute-specifier [opt]
9332 mutable [opt]
9333 exception-specification [opt]
9334 lambda-return-type-clause [opt]
9336 LAMBDA_EXPR is the current representation of the lambda expression. */
9338 static bool
9340 {
9341 /* 5.1.1.4 of the standard says:
9342 If a lambda-expression does not include a lambda-declarator, it is as if
9343 the lambda-declarator were ().
9344 This means an empty parameter list, no attributes, and no exception
9345 specification. */
9351 /* The template-parameter-list is optional, but must begin with
9352 an opening angle if present. */
9354 {
9357 "lambda templates are only available with "
9366 /* We just processed one more parameter list. */
9368 }
9370 /* The parameter-declaration-clause is optional (unless
9371 template-parameter-list was given), but must begin with an
9372 opening parenthesis if present. */
9374 {
9379 /* Parse parameters. */
9382 /* Default arguments shall not be specified in the
9383 parameter-declaration-clause of a lambda-declarator. */
9393 /* Parse optional `mutable' keyword. */
9395 {
9398 }
9400 /* Parse optional exception specification. */
9403 /* Parse optional trailing return type. */
9405 {
9409 }
9411 /* The function parameters must be in scope all the way until after the
9412 trailing-return-type in case of decltype. */
9414 }
9418 /* Create the function call operator.
9420 Messing with declarators like this is no uglier than building up the
9421 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9422 other code. */
9423 {
9424 cp_decl_specifier_seq return_type_specs;
9426 tree fco;
9433 else
9434 /* Maybe we will deduce the return type later. */
9440 sfk_none);
9445 VIRT_SPEC_UNSPECIFIED,
9446 REF_QUAL_NONE,
9447 exception_spec,
9452 declarator,
9453 attributes);
9455 {
9458 /* Give the object parameter a different name. */
9462 }
9464 {
9468 }
9477 }
9478 }
9480 /* Parse the body of a lambda expression, which is simply
9482 compound-statement
9484 but which requires special handling.
9485 LAMBDA_EXPR is the current representation of the lambda expression. */
9487 static void
9489 {
9494 else
9495 /* Still increment function_depth so that we don't GC in the
9496 middle of an expression. */
9498 /* Clear this in case we're in the middle of a default argument. */
9501 /* Finish the function call operator
9502 - class_specifier
9503 + late_parsing_for_member
9504 + function_definition_after_declarator
9505 + ctor_initializer_opt_and_function_body */
9506 {
9508 tree body;
9510 tree compound_stmt;
9511 tree cap;
9513 /* Let the front end know that we are going to be defining this
9514 function. */
9516 NULL_TREE,
9525 /* Push the proxies for any explicit captures. */
9532 /* 5.1.1.4 of the standard says:
9533 If a lambda-expression does not include a trailing-return-type, it
9534 is as if the trailing-return-type denotes the following type:
9535 * if the compound-statement is of the form
9536 { return attribute-specifier [opt] expression ; }
9537 the type of the returned expression after lvalue-to-rvalue
9538 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9539 (_conv.array_ 4.2), and function-to-pointer conversion
9540 (_conv.func_ 4.3);
9541 * otherwise, void. */
9543 /* In a lambda that has neither a lambda-return-type-clause
9544 nor a deducible form, errors should be reported for return statements
9545 in the body. Since we used void as the placeholder return type, parsing
9546 the body as usual will give such desired behavior. */
9550 {
9554 /* Parse tentatively in case there's more after the initial return
9555 statement. */
9566 {
9570 /* Will get error here if type not deduced yet. */
9574 }
9575 }
9578 {
9583 }
9587 out:
9591 /* Finish the function and generate code for it if necessary. */
9594 /* Only expand if the call op is not a template. */
9597 }
9602 else
9604 }
9606 /* Statements [gram.stmt.stmt] */
9608 /* Parse a statement.
9610 statement:
9611 labeled-statement
9612 expression-statement
9613 compound-statement
9614 selection-statement
9615 iteration-statement
9616 jump-statement
9617 declaration-statement
9618 try-block
9620 C++11:
9622 statement:
9623 labeled-statement
9624 attribute-specifier-seq (opt) expression-statement
9625 attribute-specifier-seq (opt) compound-statement
9626 attribute-specifier-seq (opt) selection-statement
9627 attribute-specifier-seq (opt) iteration-statement
9628 attribute-specifier-seq (opt) jump-statement
9629 declaration-statement
9630 attribute-specifier-seq (opt) try-block
9632 TM Extension:
9634 statement:
9635 atomic-statement
9637 IN_COMPOUND is true when the statement is nested inside a
9638 cp_parser_compound_statement; this matters for certain pragmas.
9640 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9641 is a (possibly labeled) if statement which is not enclosed in braces
9642 and has an else clause. This is used to implement -Wparentheses. */
9644 static void
9647 {
9652 restart:
9655 /* There is no statement yet. */
9661 /* In obj-c++, seeing '[[' might be the either the beginning of
9662 c++11 attributes, or a nested objc-message-expression. So
9663 let's parse the c++11 attributes tentatively. */
9667 {
9670 }
9672 /* Peek at the next token. */
9674 /* Remember the location of the first token in the statement. */
9676 /* If this is a keyword, then that will often determine what kind of
9677 statement we have. */
9679 {
9683 {
9686 /* Looks like a labeled-statement with a case label.
9687 Parse the label, and then use tail recursion to parse
9688 the statement. */
9705 {
9710 }
9711 else
9725 {
9730 }
9731 else
9732 {
9736 }
9740 /* Objective-C++ exception-handling constructs. */
9754 /* This must be a namespace alias definition. */
9767 /* It might be a keyword like `int' that can start a
9768 declaration-statement. */
9770 }
9771 }
9773 {
9774 /* If the next token is a `:', then we are looking at a
9775 labeled-statement. */
9778 {
9779 /* Looks like a labeled-statement with an ordinary label.
9780 Parse the label, and then use tail recursion to parse
9781 the statement. */
9785 }
9786 }
9787 /* Anything that starts with a `{' must be a compound-statement. */
9790 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9791 a statement all its own. */
9793 {
9794 /* Only certain OpenMP pragmas are attached to statements, and thus
9795 are considered statements themselves. All others are not. In
9796 the context of a compound, accept the pragma as a "statement" and
9797 return so that we can check for a close brace. Otherwise we
9798 require a real statement and must go back and read one. */
9804 }
9806 {
9809 }
9811 /* Everything else must be a declaration-statement or an
9812 expression-statement. Try for the declaration-statement
9813 first, unless we are looking at a `;', in which case we know that
9814 we have an expression-statement. */
9816 {
9818 {
9820 {
9821 /* Attributes should be parsed as part of the the
9822 declaration, so let's un-parse them. */
9825 }
9828 /* Try to parse the declaration-statement. */
9830 /* If that worked, we're done. */
9833 }
9834 /* Look for an expression-statement instead. */
9836 }
9838 /* Set the line number for the statement. */
9842 /* Note that for now, we don't do anything with c++11 statements
9843 parsed at this level. */
9846 OPT_Wattributes,
9848 }
9850 /* Parse the label for a labeled-statement, i.e.
9852 identifier :
9853 case constant-expression :
9854 default :
9856 GNU Extension:
9857 case constant-expression ... constant-expression : statement
9859 When a label is parsed without errors, the label is added to the
9860 parse tree by the finish_* functions, so this function doesn't
9861 have to return the label. */
9863 static void
9865 {
9870 /* The next token should be an identifier. */
9874 {
9877 }
9881 {
9883 {
9887 /* Consume the `case' token. */
9889 /* Parse the constant-expression. */
9897 {
9898 /* Consume the `...' token. */
9905 /* We don't need to emit warnings here, as the common code
9906 will do this for us. */
9907 }
9908 else
9913 else
9916 expr);
9917 }
9921 /* Consume the `default' token. */
9926 else
9931 /* Anything else must be an ordinary label. */
9934 }
9936 /* Require the `:' token. */
9939 /* An ordinary label may optionally be followed by attributes.
9940 However, this is only permitted if the attributes are then
9941 followed by a semicolon. This is because, for backward
9942 compatibility, when parsing
9943 lab: __attribute__ ((unused)) int i;
9944 we want the attribute to attach to "i", not "lab". */
9947 {
9948 tree attrs;
9955 ;
9956 else
9958 }
9964 }
9966 /* Parse an expression-statement.
9968 expression-statement:
9969 expression [opt] ;
9971 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9972 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9973 indicates whether this expression-statement is part of an
9974 expression statement. */
9976 static tree
9978 {
9982 /* If the next token is a ';', then there is no expression
9983 statement. */
9985 {
9989 {
9992 }
9993 }
9995 /* Give a helpful message for "A<T>::type t;" and the like. */
9998 {
10005 {
10006 /* A::A a; */
10011 }
10012 }
10014 /* Consume the final `;'. */
10019 /* This is the final expression statement of a statement
10020 expression. */
10026 }
10028 /* Parse a compound-statement.
10030 compound-statement:
10031 { statement-seq [opt] }
10033 GNU extension:
10035 compound-statement:
10036 { label-declaration-seq [opt] statement-seq [opt] }
10038 label-declaration-seq:
10039 label-declaration
10040 label-declaration-seq label-declaration
10042 Returns a tree representing the statement. */
10044 static tree
10047 {
10048 tree compound_stmt;
10050 /* Consume the `{'. */
10057 /* Begin the compound-statement. */
10059 /* If the next keyword is `__label__' we have a label declaration. */
10062 /* Parse an (optional) statement-seq. */
10064 /* Finish the compound-statement. */
10066 /* Consume the `}'. */
10070 }
10072 /* Parse an (optional) statement-seq.
10074 statement-seq:
10075 statement
10076 statement-seq [opt] statement */
10078 static void
10080 {
10081 /* Scan statements until there aren't any more. */
10083 {
10086 /* If we are looking at a `}', then we have run out of
10087 statements; the same is true if we have reached the end
10088 of file, or have stumbled upon a stray '@end'. */
10095 /* If we are in a compound statement and find 'else' then
10096 something went wrong. */
10098 {
10101 else
10102 {
10105 }
10106 }
10108 /* Parse the statement. */
10110 }
10111 }
10113 /* Parse a selection-statement.
10115 selection-statement:
10116 if ( condition ) statement
10117 if ( condition ) statement else statement
10118 switch ( condition ) statement
10120 Returns the new IF_STMT or SWITCH_STMT.
10122 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10123 is a (possibly labeled) if statement which is not enclosed in
10124 braces and has an else clause. This is used to implement
10125 -Wparentheses. */
10127 static tree
10129 {
10136 /* Peek at the next token. */
10139 /* See what kind of keyword it is. */
10142 {
10145 {
10146 tree statement;
10147 tree condition;
10149 /* Look for the `('. */
10151 {
10154 }
10156 /* Begin the selection-statement. */
10159 else
10162 /* Parse the condition. */
10164 /* Look for the `)'. */
10170 {
10174 /* Add the condition. */
10177 /* Parse the then-clause. */
10181 {
10189 }
10190 else
10196 /* If the next token is `else', parse the else-clause. */
10198 RID_ELSE))
10199 {
10200 /* Consume the `else' keyword. */
10203 /* Parse the else-clause. */
10205 {
10206 location_t loc;
10213 }
10214 else
10219 /* If we are currently parsing a then-clause, then
10220 IF_P will not be NULL. We set it to true to
10221 indicate that this if statement has an else clause.
10222 This may trigger the Wparentheses warning below
10223 when we get back up to the parent if statement. */
10226 }
10227 else
10228 {
10229 /* This if statement does not have an else clause. If
10230 NESTED_IF is true, then the then-clause is an if
10231 statement which does have an else clause. We warn
10232 about the potential ambiguity. */
10235 "suggest explicit braces to avoid ambiguous"
10237 }
10239 /* Now we're all done with the if-statement. */
10241 }
10242 else
10243 {
10247 /* Add the condition. */
10250 /* Parse the body of the switch-statement. */
10259 /* Now we're all done with the switch-statement. */
10261 }
10264 }
10270 }
10271 }
10273 /* Parse a condition.
10275 condition:
10276 expression
10277 type-specifier-seq declarator = initializer-clause
10278 type-specifier-seq declarator braced-init-list
10280 GNU Extension:
10282 condition:
10283 type-specifier-seq declarator asm-specification [opt]
10284 attributes [opt] = assignment-expression
10286 Returns the expression that should be tested. */
10288 static tree
10290 {
10291 cp_decl_specifier_seq type_specifiers;
10295 /* Try the declaration first. */
10297 /* New types are not allowed in the type-specifier-seq for a
10298 condition. */
10300 parser->type_definition_forbidden_message
10302 /* Parse the type-specifier-seq. */
10304 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10307 /* Restore the saved message. */
10309 /* If all is well, we might be looking at a declaration. */
10311 {
10312 tree decl;
10313 tree asm_specification;
10314 tree attributes;
10318 /* Parse the declarator. */
10324 /* Parse the attributes. */
10326 /* Parse the asm-specification. */
10328 /* If the next token is not an `=' or '{', then we might still be
10329 looking at an expression. For example:
10331 if (A(a).x)
10333 looks like a decl-specifier-seq and a declarator -- but then
10334 there is no `=', so this is an expression. */
10339 /* If we did see an `=' or '{', then we are looking at a declaration
10340 for sure. */
10342 {
10343 tree pushed_scope;
10347 /* Create the declaration. */
10353 /* Parse the initializer. */
10355 {
10359 }
10360 else
10361 {
10362 /* Consume the `='. */
10365 }
10369 /* Process the initializer. */
10372 asm_specification,
10373 flags);
10379 }
10380 }
10381 /* If we didn't even get past the declarator successfully, we are
10382 definitely not looking at a declaration. */
10383 else
10386 /* Otherwise, we are looking at an expression. */
10388 }
10390 /* Parses a for-statement or range-for-statement until the closing ')',
10391 not included. */
10393 static tree
10395 {
10399 /* Begin the for-statement. */
10402 /* Parse the initialization. */
10407 else
10409 }
10411 static tree
10413 {
10414 /* Normal for loop */
10417 tree stmt;
10420 /* The for-init-statement has already been parsed in
10421 cp_parser_for_init_statement, so no work is needed here. */
10424 /* If there's a condition, process it. */
10428 {
10432 }
10434 /* Look for the `;'. */
10437 /* If there's an expression, process it. */
10443 }
10445 /* Tries to parse a range-based for-statement:
10447 range-based-for:
10448 decl-specifier-seq declarator : expression
10450 The decl-specifier-seq declarator and the `:' are already parsed by
10451 cp_parser_for_init_statement. If processing_template_decl it returns a
10452 newly created RANGE_FOR_STMT; if not, it is converted to a
10453 regular FOR_STMT. */
10455 static tree
10458 {
10462 {
10465 }
10466 else
10469 /* If in template, STMT is converted to a normal for-statement
10470 at instantiation. If not, it is done just ahead. */
10472 {
10480 /* do_auto_deduction doesn't mess with template init-lists. */
10483 }
10484 else
10485 {
10488 }
10490 }
10492 /* Subroutine of cp_convert_range_for: given the initializer expression,
10493 builds up the range temporary. */
10495 static tree
10497 {
10500 /* Find out the type deduced by the declaration
10501 `auto &&__range = range_expr'. */
10506 /* Create the __range variable. */
10513 }
10515 /* Used by cp_parser_range_for in template context: we aren't going to
10516 do a full conversion yet, but we still need to resolve auto in the
10517 type of the for-range-declaration if present. This is basically
10518 a shortcut version of cp_convert_range_for. */
10520 static void
10522 {
10525 {
10528 iter_type = (cp_parser_perform_range_for_lookup
10531 {
10533 iter_type);
10535 tf_warning_or_error);
10538 }
10539 }
10540 }
10542 /* Converts a range-based for-statement into a normal
10543 for-statement, as per the definition.
10545 for (RANGE_DECL : RANGE_EXPR)
10546 BLOCK
10548 should be equivalent to:
10550 {
10551 auto &&__range = RANGE_EXPR;
10552 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10553 __begin != __end;
10554 ++__begin)
10555 {
10556 RANGE_DECL = *__begin;
10557 BLOCK
10558 }
10559 }
10561 If RANGE_EXPR is an array:
10562 BEGIN_EXPR = __range
10563 END_EXPR = __range + ARRAY_SIZE(__range)
10564 Else if RANGE_EXPR has a member 'begin' or 'end':
10565 BEGIN_EXPR = __range.begin()
10566 END_EXPR = __range.end()
10567 Else:
10568 BEGIN_EXPR = begin(__range)
10569 END_EXPR = end(__range);
10571 If __range has a member 'begin' but not 'end', or vice versa, we must
10572 still use the second alternative (it will surely fail, however).
10573 When calling begin()/end() in the third alternative we must use
10574 argument dependent lookup, but always considering 'std' as an associated
10575 namespace. */
10577 tree
10580 {
10586 /* If an error happened previously do nothing or else a lot of
10587 unhelpful errors would be issued. */
10589 else
10590 {
10591 tree range_temp;
10595 /* Can't bind a reference to an array of runtime bound. */
10597 else
10598 {
10603 LOOKUP_ONLYCONVERTING);
10605 }
10608 }
10610 /* The new for initialization statement. */
10618 LOOKUP_ONLYCONVERTING);
10627 LOOKUP_ONLYCONVERTING);
10631 /* The new for condition. */
10638 /* The new increment expression. */
10641 tf_warning_or_error);
10644 /* The declaration is initialized with *__begin inside the loop body. */
10647 tf_warning_or_error),
10649 LOOKUP_ONLYCONVERTING);
10652 }
10654 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10655 We need to solve both at the same time because the method used
10656 depends on the existence of members begin or end.
10657 Returns the type deduced for the iterator expression. */
10659 static tree
10661 {
10663 {
10666 }
10669 {
10674 }
10676 {
10677 /* If RANGE is an array, we will use pointer arithmetic. */
10680 range,
10684 }
10685 else
10686 {
10687 /* If it is not an array, we must do a bit of magic. */
10697 tf_warning_or_error);
10700 tf_warning_or_error);
10703 {
10704 /* Use the member functions. */
10707 else
10713 else
10716 }
10717 else
10718 {
10719 /* Use global functions with ADL. */
10726 tf_warning_or_error);
10728 tf_warning_or_error);
10730 tf_warning_or_error);
10732 tf_warning_or_error);
10735 }
10737 /* Last common checks. */
10739 {
10740 /* If one of the expressions is an error do no more checks. */
10743 }
10746 /* Can happen, when, eg, in a template context, Koenig lookup
10747 can't resolve begin/end (c++/58503). */
10749 else
10750 {
10752 /* The unqualified type of the __begin and __end temporaries should
10753 be the same, as required by the multiple auto declaration. */
10759 }
10760 }
10761 }
10763 /* Helper function for cp_parser_perform_range_for_lookup.
10764 Builds a tree for RANGE.IDENTIFIER(). */
10766 static tree
10768 {
10781 tf_warning_or_error);
10784 }
10786 /* Parse an iteration-statement.
10788 iteration-statement:
10789 while ( condition ) statement
10790 do statement while ( expression ) ;
10791 for ( for-init-statement condition [opt] ; expression [opt] )
10792 statement
10794 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10796 static tree
10798 {
10801 tree statement;
10804 /* Peek at the next token. */
10809 /* Remember whether or not we are already within an iteration
10810 statement. */
10813 /* See what kind of keyword it is. */
10816 {
10818 {
10819 tree condition;
10821 /* Begin the while-statement. */
10823 /* Look for the `('. */
10825 /* Parse the condition. */
10828 /* Look for the `)'. */
10830 /* Parse the dependent statement. */
10834 /* We're done with the while-statement. */
10836 }
10840 {
10841 tree expression;
10843 /* Begin the do-statement. */
10845 /* Parse the body of the do-statement. */
10850 /* Look for the `while' keyword. */
10852 /* Look for the `('. */
10854 /* Parse the expression. */
10856 /* We're done with the do-statement. */
10858 /* Look for the `)'. */
10860 /* Look for the `;'. */
10862 }
10866 {
10867 /* Look for the `('. */
10872 /* Look for the `)'. */
10875 /* Parse the body of the for-statement. */
10880 /* We're done with the for-statement. */
10882 }
10889 }
10892 }
10894 /* Parse a for-init-statement or the declarator of a range-based-for.
10895 Returns true if a range-based-for declaration is seen.
10897 for-init-statement:
10898 expression-statement
10899 simple-declaration */
10901 static bool
10903 {
10904 /* If the next token is a `;', then we have an empty
10905 expression-statement. Grammatically, this is also a
10906 simple-declaration, but an invalid one, because it does not
10907 declare anything. Therefore, if we did not handle this case
10908 specially, we would issue an error message about an invalid
10909 declaration. */
10911 {
10917 {
10918 /* N3994 -- for (id : init) ... */
10921 "type-specifier only available with "
10929 }
10931 /* A colon is used in range-based for. */
10934 /* We're going to speculatively look for a declaration, falling back
10935 to an expression, if necessary. */
10937 /* Parse the declaration. */
10940 decl);
10943 {
10944 /* It is a range-for, consume the ':' */
10948 {
10950 "range-based %<for%> loops only available with "
10953 }
10954 }
10955 else
10956 /* The ';' is not consumed yet because we told
10957 cp_parser_simple_declaration not to. */
10962 /* If the tentative parse failed, then we shall need to look for an
10963 expression-statement. */
10964 }
10965 /* If we are here, it is an expression-statement. */
10968 }
10970 /* Parse a jump-statement.
10972 jump-statement:
10973 break ;
10974 continue ;
10975 return expression [opt] ;
10976 return braced-init-list ;
10977 goto identifier ;
10979 GNU extension:
10981 jump-statement:
10982 goto * expression ;
10984 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10986 static tree
10988 {
10994 /* Peek at the next token. */
10999 /* See what kind of keyword it is. */
11002 {
11006 {
11026 }
11032 {
11039 /* Fall through. */
11049 }
11054 {
11055 tree expr;
11059 {
11063 }
11066 else
11067 /* If the next token is a `;', then there is no
11068 expression. */
11070 /* Build the return-statement. */
11072 /* Look for the final `;'. */
11074 }
11080 {
11083 }
11085 /* Create the goto-statement. */
11087 {
11088 /* Issue a warning about this use of a GNU extension. */
11090 /* Consume the '*' token. */
11092 /* Parse the dependent expression. */
11094 }
11095 else
11097 /* Look for the final `;'. */
11104 }
11107 }
11109 /* Parse a declaration-statement.
11111 declaration-statement:
11112 block-declaration */
11114 static void
11116 {
11119 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11122 /* Parse the block-declaration. */
11125 /* Free any declarators allocated. */
11127 }
11129 /* Some dependent statements (like `if (cond) statement'), are
11130 implicitly in their own scope. In other words, if the statement is
11131 a single statement (as opposed to a compound-statement), it is
11132 none-the-less treated as if it were enclosed in braces. Any
11133 declarations appearing in the dependent statement are out of scope
11134 after control passes that point. This function parses a statement,
11135 but ensures that is in its own scope, even if it is not a
11136 compound-statement.
11138 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11139 is a (possibly labeled) if statement which is not enclosed in
11140 braces and has an else clause. This is used to implement
11141 -Wparentheses.
11143 Returns the new statement. */
11145 static tree
11147 {
11148 tree statement;
11153 /* Mark if () ; with a special NOP_EXPR. */
11155 {
11159 }
11160 /* if a compound is opened, we simply parse the statement directly. */
11163 /* If the token is not a `{', then we must take special action. */
11164 else
11165 {
11166 /* Create a compound-statement. */
11168 /* Parse the dependent-statement. */
11170 /* Finish the dummy compound-statement. */
11172 }
11174 /* Return the statement. */
11176 }
11178 /* For some dependent statements (like `while (cond) statement'), we
11179 have already created a scope. Therefore, even if the dependent
11180 statement is a compound-statement, we do not want to create another
11181 scope. */
11183 static void
11185 {
11186 /* If the token is a `{', then we must take special action. */
11189 else
11190 {
11191 /* Avoid calling cp_parser_compound_statement, so that we
11192 don't create a new scope. Do everything else by hand. */
11194 /* If the next keyword is `__label__' we have a label declaration. */
11197 /* Parse an (optional) statement-seq. */
11200 }
11201 }
11203 /* Declarations [gram.dcl.dcl] */
11205 /* Parse an optional declaration-sequence.
11207 declaration-seq:
11208 declaration
11209 declaration-seq declaration */
11211 static void
11213 {
11215 {
11226 {
11227 /* A declaration consisting of a single semicolon is
11228 invalid. Allow it unless we're being pedantic. */
11233 }
11235 /* If we're entering or exiting a region that's implicitly
11236 extern "C", modify the lang context appropriately. */
11238 {
11241 }
11243 {
11246 }
11249 {
11250 /* A top-level declaration can consist solely of a #pragma.
11251 A nested declaration cannot, so this is done here and not
11252 in cp_parser_declaration. (A #pragma at block scope is
11253 handled in cp_parser_statement.) */
11256 }
11258 /* Parse the declaration itself. */
11260 }
11261 }
11263 /* Parse a declaration.
11265 declaration:
11266 block-declaration
11267 function-definition
11268 template-declaration
11269 explicit-instantiation
11270 explicit-specialization
11271 linkage-specification
11272 namespace-definition
11274 GNU extension:
11276 declaration:
11277 __extension__ declaration */
11279 static void
11281 {
11282 cp_token token1;
11283 cp_token token2;
11288 /* Check for the `__extension__' keyword. */
11290 {
11291 /* Parse the qualified declaration. */
11293 /* Restore the PEDANTIC flag. */
11297 }
11299 /* Try to figure out what kind of declaration is present. */
11304 else
11305 {
11308 }
11310 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11313 /* If the next token is `extern' and the following token is a string
11314 literal, then we have a linkage specification. */
11318 /* If the next token is `template', then we have either a template
11319 declaration, an explicit instantiation, or an explicit
11320 specialization. */
11322 {
11323 /* `template <>' indicates a template specialization. */
11327 /* `template <' indicates a template declaration. */
11330 /* Anything else must be an explicit instantiation. */
11331 else
11333 }
11334 /* If the next token is `export', then we have a template
11335 declaration. */
11338 /* If the next token is `extern', 'static' or 'inline' and the one
11339 after that is `template', we have a GNU extended explicit
11340 instantiation directive. */
11347 /* If the next token is `namespace', check for a named or unnamed
11348 namespace definition. */
11354 /* An unnamed namespace definition. */
11358 /* An inline (associated) namespace definition. */
11362 /* Objective-C++ declaration/definition. */
11369 /* We must have either a block declaration or a function
11370 definition. */
11371 else
11372 /* Try to parse a block-declaration, or a function-definition. */
11375 /* Free any declarators allocated. */
11377 }
11379 /* Parse a block-declaration.
11381 block-declaration:
11382 simple-declaration
11383 asm-definition
11384 namespace-alias-definition
11385 using-declaration
11386 using-directive
11388 GNU Extension:
11390 block-declaration:
11391 __extension__ block-declaration
11393 C++0x Extension:
11395 block-declaration:
11396 static_assert-declaration
11398 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11399 part of a declaration-statement. */
11401 static void
11404 {
11408 /* Check for the `__extension__' keyword. */
11410 {
11411 /* Parse the qualified declaration. */
11413 /* Restore the PEDANTIC flag. */
11417 }
11419 /* Peek at the next token to figure out which kind of declaration is
11420 present. */
11423 /* If the next keyword is `asm', we have an asm-definition. */
11425 {
11429 }
11430 /* If the next keyword is `namespace', we have a
11431 namespace-alias-definition. */
11434 /* If the next keyword is `using', we have a
11435 using-declaration, a using-directive, or an alias-declaration. */
11437 {
11442 /* If the token after `using' is `namespace', then we have a
11443 using-directive. */
11447 /* If the second token after 'using' is '=', then we have an
11448 alias-declaration. */
11454 /* Otherwise, it's a using-declaration. */
11455 else
11458 }
11459 /* If the next keyword is `__label__' we have a misplaced label
11460 declaration. */
11462 {
11466 /* If the next token is now a `;', consume it. */
11469 }
11470 /* If the next token is `static_assert' we have a static assertion. */
11473 /* Anything else must be a simple-declaration. */
11474 else
11477 }
11479 /* Parse a simple-declaration.
11481 simple-declaration:
11482 decl-specifier-seq [opt] init-declarator-list [opt] ;
11484 init-declarator-list:
11485 init-declarator
11486 init-declarator-list , init-declarator
11488 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11489 function-definition as a simple-declaration.
11491 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11492 parsed declaration if it is an uninitialized single declarator not followed
11493 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11494 if present, will not be consumed. */
11496 static void
11500 {
11501 cp_decl_specifier_seq decl_specifiers;
11510 /* Defer access checks until we know what is being declared; the
11511 checks for names appearing in the decl-specifier-seq should be
11512 done as if we were in the scope of the thing being declared. */
11515 /* Parse the decl-specifier-seq. We have to keep track of whether
11516 or not the decl-specifier-seq declares a named class or
11517 enumeration type, since that is the only case in which the
11518 init-declarator-list is allowed to be empty.
11520 [dcl.dcl]
11522 In a simple-declaration, the optional init-declarator-list can be
11523 omitted only when declaring a class or enumeration, that is when
11524 the decl-specifier-seq contains either a class-specifier, an
11525 elaborated-type-specifier, or an enum-specifier. */
11527 CP_PARSER_FLAGS_OPTIONAL,
11530 /* We no longer need to defer access checks. */
11533 /* In a block scope, a valid declaration must always have a
11534 decl-specifier-seq. By not trying to parse declarators, we can
11535 resolve the declaration/expression ambiguity more quickly. */
11538 {
11541 }
11543 /* If the next two tokens are both identifiers, the code is
11544 erroneous. The usual cause of this situation is code like:
11546 T t;
11548 where "T" should name a type -- but does not. */
11551 {
11552 /* If parsing tentatively, we should commit; we really are
11553 looking at a declaration. */
11555 /* Give up. */
11557 }
11559 /* If we have seen at least one decl-specifier, and the next token
11560 is not a parenthesis, then we must be looking at a declaration.
11561 (After "int (" we might be looking at a functional cast.) */
11568 /* Keep going until we hit the `;' at the end of the simple
11569 declaration. */
11572 CPP_SEMICOLON))
11573 {
11576 tree decl;
11579 {
11580 /* If we are processing next declarator, comma is expected */
11585 {
11589 }
11590 }
11591 else
11594 /* Parse the init-declarator. */
11597 function_definition_allowed_p,
11599 declares_class_or_enum,
11601 maybe_range_for_decl,
11603 /* If an error occurred while parsing tentatively, exit quickly.
11604 (That usually happens when in the body of a function; each
11605 statement is treated as a declaration-statement until proven
11606 otherwise.) */
11609 /* Handle function definitions specially. */
11611 {
11612 /* If the next token is a `,', then we are probably
11613 processing something like:
11615 void f() {}, *p;
11617 which is erroneous. */
11619 {
11622 "mixing"
11624 }
11625 /* Otherwise, we're done with the list of declarators. */
11626 else
11627 {
11630 }
11631 }
11634 /* The next token should be either a `,' or a `;'. */
11636 /* If it's a `,', there are more declarators to come. */
11639 /* If it's a `;', we are done. */
11642 /* Anything else is an error. */
11643 else
11644 {
11645 /* If we have already issued an error message we don't need
11646 to issue another one. */
11650 /* Skip tokens until we reach the end of the statement. */
11652 /* If the next token is now a `;', consume it. */
11656 }
11657 /* After the first time around, a function-definition is not
11658 allowed -- even if it was OK at first. For example:
11660 int i, f() {}
11662 is not valid. */
11664 }
11666 /* Issue an error message if no declarators are present, and the
11667 decl-specifier-seq does not itself declare a class or
11668 enumeration: [dcl.dcl]/3. */
11670 {
11672 {
11676 /* Ensure an error is issued anyway when finish_decltype_type,
11677 called via cp_parser_decl_specifier_seq, returns a class or
11678 an enumeration (c++/51786). */
11681 }
11682 /* Perform any deferred access checks. */
11684 }
11686 /* Consume the `;'. */
11690 {
11696 }
11698 done:
11700 }
11702 /* Parse a decl-specifier-seq.
11704 decl-specifier-seq:
11705 decl-specifier-seq [opt] decl-specifier
11706 decl-specifier attribute-specifier-seq [opt] (C++11)
11708 decl-specifier:
11709 storage-class-specifier
11710 type-specifier
11711 function-specifier
11712 friend
11713 typedef
11715 GNU Extension:
11717 decl-specifier:
11718 attributes
11720 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11722 The parser flags FLAGS is used to control type-specifier parsing.
11724 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11725 flags:
11727 1: one of the decl-specifiers is an elaborated-type-specifier
11728 (i.e., a type declaration)
11729 2: one of the decl-specifiers is an enum-specifier or a
11730 class-specifier (i.e., a type definition)
11732 */
11734 static void
11736 cp_parser_flags flags,
11739 {
11743 cp_decl_spec ds;
11745 /* Clear DECL_SPECS. */
11748 /* Assume no class or enumeration type is declared. */
11751 /* Keep reading specifiers until there are no more to read. */
11753 {
11758 /* Peek at the next token. */
11761 /* Save the first token of the decl spec list for error
11762 reporting. */
11765 /* Handle attributes. */
11767 {
11768 /* Parse the attributes. */
11771 /* In a sequence of declaration specifiers, c++11 attributes
11772 appertain to the type that precede them. In that case
11773 [dcl.spec]/1 says:
11775 The attribute-specifier-seq affects the type only for
11776 the declaration it appears in, not other declarations
11777 involving the same type.
11779 But for now let's force the user to position the
11780 attribute either at the beginning of the declaration or
11781 after the declarator-id, which would clearly mean that it
11782 applies to the declarator. */
11784 {
11786 /* The c++11 attribute is at the beginning of the
11787 declaration. It appertains to the entity being
11789 else
11790 {
11792 {
11793 /* This is an attribute following a
11794 class-specifier. */
11799 }
11800 else
11801 {
11802 decl_specs->std_attributes
11804 attrs);
11807 }
11809 }
11810 }
11812 decl_specs->attributes
11814 attrs);
11818 }
11819 /* Assume we will find a decl-specifier keyword. */
11821 /* If the next token is an appropriate keyword, we can simply
11822 add it to the list. */
11824 {
11825 /* decl-specifier:
11826 friend
11827 constexpr */
11830 {
11833 }
11834 else
11835 {
11837 /* Consume the token. */
11839 }
11847 /* function-specifier:
11848 inline
11849 virtual
11850 explicit */
11857 /* decl-specifier:
11858 typedef */
11861 /* Consume the token. */
11863 /* A constructor declarator cannot appear in a typedef. */
11865 /* The "typedef" keyword can only occur in a declaration; we
11866 may as well commit at this point. */
11873 /* storage-class-specifier:
11874 auto
11875 register
11876 static
11877 extern
11878 mutable
11880 GNU Extension:
11881 thread */
11884 {
11885 /* Consume the token. */
11888 /* Complain about `auto' as a storage specifier, if
11889 we're complaining about C++0x compatibility. */
11893 /* Set the storage class anyway. */
11895 token);
11896 }
11897 else
11898 /* C++0x auto type-specifier. */
11906 /* Consume the token. */
11909 token);
11912 /* Consume the token. */
11918 /* We did not yet find a decl-specifier yet. */
11921 }
11931 /* Constructors are a special case. The `S' in `S()' is not a
11932 decl-specifier; it is the beginning of the declarator. */
11933 constructor_p
11934 = (!found_decl_spec
11935 && constructor_possible_p
11936 && (cp_parser_constructor_declarator_p
11939 /* If we don't have a DECL_SPEC yet, then we must be looking at
11940 a type-specifier. */
11942 {
11945 tree type_spec;
11947 type_spec
11949 decl_specs,
11955 /* If this type-specifier referenced a user-defined type
11956 (a typedef, class-name, etc.), then we can't allow any
11957 more such type-specifiers henceforth.
11959 [dcl.spec]
11961 The longest sequence of decl-specifiers that could
11962 possibly be a type name is taken as the
11963 decl-specifier-seq of a declaration. The sequence shall
11964 be self-consistent as described below.
11966 [dcl.type]
11968 As a general rule, at most one type-specifier is allowed
11969 in the complete decl-specifier-seq of a declaration. The
11970 only exceptions are the following:
11972 -- const or volatile can be combined with any other
11973 type-specifier.
11975 -- signed or unsigned can be combined with char, long,
11976 short, or int.
11978 -- ..
11980 Example:
11982 typedef char* Pc;
11983 void g (const int Pc);
11985 Here, Pc is *not* part of the decl-specifier seq; it's
11986 the declarator. Therefore, once we see a type-specifier
11987 (other than a cv-qualifier), we forbid any additional
11988 user-defined types. We *do* still allow things like `int
11989 int' to be considered a decl-specifier-seq, and issue the
11990 error message later. */
11993 /* A constructor declarator cannot follow a type-specifier. */
11995 {
12000 }
12001 }
12003 /* If we still do not have a DECL_SPEC, then there are no more
12004 decl-specifiers. */
12009 /* After we see one decl-specifier, further decl-specifiers are
12010 always optional. */
12012 }
12014 /* Don't allow a friend specifier with a class definition. */
12019 }
12021 /* Parse an (optional) storage-class-specifier.
12023 storage-class-specifier:
12024 auto
12025 register
12026 static
12027 extern
12028 mutable
12030 GNU Extension:
12032 storage-class-specifier:
12033 thread
12035 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12037 static tree
12039 {
12041 {
12045 /* Fall through for C++98. */
12052 /* Consume the token. */
12057 }
12058 }
12060 /* Parse an (optional) function-specifier.
12062 function-specifier:
12063 inline
12064 virtual
12065 explicit
12067 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12068 Updates DECL_SPECS, if it is non-NULL. */
12070 static tree
12073 {
12076 {
12082 /* 14.5.2.3 [temp.mem]
12084 A member function template shall not be virtual. */
12087 else
12097 }
12099 /* Consume the token. */
12101 }
12103 /* Parse a linkage-specification.
12105 linkage-specification:
12106 extern string-literal { declaration-seq [opt] }
12107 extern string-literal declaration */
12109 static void
12111 {
12112 tree linkage;
12114 /* Look for the `extern' keyword. */
12117 /* Look for the string-literal. */
12120 /* Transform the literal into an identifier. If the literal is a
12121 wide-character string, or contains embedded NULs, then we can't
12122 handle it as the user wants. */
12125 {
12127 /* Assume C++ linkage. */
12129 }
12130 else
12133 /* We're now using the new linkage. */
12136 /* If the next token is a `{', then we're using the first
12137 production. */
12139 {
12142 /* Consume the `{' token. */
12144 /* Parse the declarations. */
12146 /* Look for the closing `}'. */
12148 }
12149 /* Otherwise, there's just one declaration. */
12150 else
12151 {
12154 saved_in_unbraced_linkage_specification_p
12158 parser->in_unbraced_linkage_specification_p
12160 }
12162 /* We're done with the linkage-specification. */
12164 }
12166 /* Parse a static_assert-declaration.
12168 static_assert-declaration:
12169 static_assert ( constant-expression , string-literal ) ;
12171 If MEMBER_P, this static_assert is a class member. */
12173 static void
12175 {
12176 tree condition;
12177 tree message;
12179 location_t saved_loc;
12182 /* Peek at the `static_assert' token so we can keep track of exactly
12183 where the static assertion started. */
12187 /* Look for the `static_assert' keyword. */
12189 RT_STATIC_ASSERT))
12192 /* We know we are in a static assertion; commit to any tentative
12193 parse. */
12197 /* Parse the `(' starting the static assertion condition. */
12200 /* Parse the constant-expression. Allow a non-constant expression
12201 here in order to give better diagnostics in finish_static_assert. */
12202 condition =
12207 /* Make sure we folded it completely before doing trying to get
12208 constant value. */
12211 /* Parse the separating `,'. */
12214 /* Parse the string-literal message. */
12219 /* A `)' completes the static assertion. */
12226 /* A semicolon terminates the declaration. */
12229 /* Complete the static assertion, which may mean either processing
12230 the static assert now or saving it for template instantiation. */
12232 }
12234 /* Parse the expression in decltype ( expression ). */
12236 static tree
12239 {
12241 tree expr;
12243 /* First, try parsing an id-expression. */
12254 {
12257 cp_id_kind idk;
12261 /* Lookup the name we got back from the id-expression. */
12271 {
12272 /* Complete lookup of the id-expression. */
12273 expr = (finish_id_expression
12286 /* We found an id-expression, but it was something that we
12287 should not have found. This is an error, not something
12288 we can recover from, so note that we found an
12289 id-expression and we'll recover as gracefully as
12290 possible. */
12292 }
12297 /* We have an id-expression. */
12299 }
12302 {
12303 /* Abort the id-expression parse. */
12306 /* Parsing tentatively, again. */
12309 /* Parse a class member access. */
12317 /* We have an id-expression. */
12319 }
12322 /* We have parsed the complete id-expression or member access. */
12324 else
12325 {
12326 /* Abort our attempt to parse an id-expression or member access
12327 expression. */
12330 /* Parse a full expression. */
12333 }
12336 }
12338 /* Parse a `decltype' type. Returns the type.
12340 simple-type-specifier:
12341 decltype ( expression )
12342 C++14 proposal:
12343 decltype ( auto ) */
12345 static tree
12347 {
12348 tree expr;
12357 {
12358 /* Already parsed. */
12361 }
12363 /* Look for the `decltype' token. */
12367 /* Parse the opening `('. */
12371 /* decltype (auto) */
12374 {
12381 }
12383 /* Types cannot be defined in a `decltype' expression. Save away the
12384 old message. */
12387 /* And create the new one. */
12388 parser->type_definition_forbidden_message
12391 /* The restrictions on constant-expressions do not apply inside
12392 decltype expressions. */
12393 saved_integral_constant_expression_p
12395 saved_non_integral_constant_expression_p
12399 /* Within a parenthesized expression, a `>' token is always
12400 the greater-than operator. */
12401 saved_greater_than_is_operator_p
12405 /* Do not actually evaluate the expression. */
12408 /* Do not warn about problems with the expression. */
12413 /* Go back to evaluating expressions. */
12417 /* The `>' token might be the end of a template-id or
12418 template-parameter-list now. */
12419 parser->greater_than_is_operator_p
12422 /* Restore the old message and the integral constant expression
12423 flags. */
12425 parser->integral_constant_expression_p
12427 parser->non_integral_constant_expression_p
12430 /* Parse to the closing `)'. */
12432 {
12436 }
12439 tf_warning_or_error);
12441 rewrite:
12442 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12443 it again. */
12450 }
12452 /* Special member functions [gram.special] */
12454 /* Parse a conversion-function-id.
12456 conversion-function-id:
12457 operator conversion-type-id
12459 Returns an IDENTIFIER_NODE representing the operator. */
12461 static tree
12463 {
12464 tree type;
12465 tree saved_scope;
12466 tree saved_qualifying_scope;
12467 tree saved_object_scope;
12470 /* Look for the `operator' token. */
12473 /* When we parse the conversion-type-id, the current scope will be
12474 reset. However, we need that information in able to look up the
12475 conversion function later, so we save it here. */
12479 /* We must enter the scope of the class so that the names of
12480 entities declared within the class are available in the
12481 conversion-type-id. For example, consider:
12483 struct S {
12484 typedef int I;
12485 operator I();
12486 };
12488 S::operator I() { ... }
12490 In order to see that `I' is a type-name in the definition, we
12491 must be in the scope of `S'. */
12494 /* Parse the conversion-type-id. */
12496 /* Leave the scope of the class, if any. */
12499 /* Restore the saved scope. */
12503 /* If the TYPE is invalid, indicate failure. */
12507 }
12509 /* Parse a conversion-type-id:
12511 conversion-type-id:
12512 type-specifier-seq conversion-declarator [opt]
12514 Returns the TYPE specified. */
12516 static tree
12518 {
12519 tree attributes;
12520 cp_decl_specifier_seq type_specifiers;
12522 tree type_specified;
12525 /* Parse the attributes. */
12529 parser->type_definition_forbidden_message
12532 /* Parse the type-specifiers. */
12539 /* If that didn't work, stop. */
12542 /* Parse the conversion-declarator. */
12550 /* Don't give this error when parsing tentatively. This happens to
12551 work because we always parse this definitively once. */
12554 {
12556 {
12559 }
12563 }
12566 }
12568 /* Parse an (optional) conversion-declarator.
12570 conversion-declarator:
12571 ptr-operator conversion-declarator [opt]
12573 */
12577 {
12580 cp_cv_quals cv_quals;
12582 /* We don't know if there's a ptr-operator next, or not. */
12584 /* Try the ptr-operator. */
12587 /* If it worked, look for more conversion-declarators. */
12589 {
12592 /* Parse another optional declarator. */
12595 declarator = cp_parser_make_indirect_declarator
12599 }
12602 }
12604 /* Parse an (optional) ctor-initializer.
12606 ctor-initializer:
12607 : mem-initializer-list
12609 Returns TRUE iff the ctor-initializer was actually present. */
12611 static bool
12613 {
12614 /* If the next token is not a `:', then there is no
12615 ctor-initializer. */
12617 {
12618 /* Do default initialization of any bases and members. */
12623 }
12625 /* Consume the `:' token. */
12627 /* And the mem-initializer-list. */
12631 }
12633 /* Parse a mem-initializer-list.
12635 mem-initializer-list:
12636 mem-initializer ... [opt]
12637 mem-initializer ... [opt] , mem-initializer-list */
12639 static void
12641 {
12646 /* Let the semantic analysis code know that we are starting the
12647 mem-initializer-list. */
12652 /* Loop through the list. */
12654 {
12655 tree mem_initializer;
12658 /* Parse the mem-initializer. */
12660 /* If the next token is a `...', we're expanding member initializers. */
12662 {
12663 /* Consume the `...'. */
12666 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12667 can be expanded but members cannot. */
12670 {
12675 }
12677 /* Construct the pack expansion type. */
12680 }
12683 {
12687 }
12688 /* Look for a target constructor. */
12692 {
12695 {
12699 }
12701 }
12702 /* Add it to the list, unless it was erroneous. */
12704 {
12707 }
12708 /* If the next token is not a `,', we're done. */
12711 /* Consume the `,' token. */
12713 }
12715 /* Perform semantic analysis. */
12718 }
12720 /* Parse a mem-initializer.
12722 mem-initializer:
12723 mem-initializer-id ( expression-list [opt] )
12724 mem-initializer-id braced-init-list
12726 GNU extension:
12728 mem-initializer:
12729 ( expression-list [opt] )
12731 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12732 class) or FIELD_DECL (for a non-static data member) to initialize;
12733 the TREE_VALUE is the expression-list. An empty initialization
12734 list is represented by void_list_node. */
12736 static tree
12738 {
12739 tree mem_initializer_id;
12740 tree expression_list;
12741 tree member;
12744 /* Find out what is being initialized. */
12746 {
12750 }
12751 else
12752 {
12756 }
12762 {
12769 }
12770 else
12771 {
12781 }
12791 }
12793 /* Parse a mem-initializer-id.
12795 mem-initializer-id:
12796 :: [opt] nested-name-specifier [opt] class-name
12797 identifier
12799 Returns a TYPE indicating the class to be initializer for the first
12800 production. Returns an IDENTIFIER_NODE indicating the data member
12801 to be initialized for the second production. */
12803 static tree
12805 {
12809 tree id;
12813 /* `typename' is not allowed in this context ([temp.res]). */
12815 {
12817 "keyword %<typename%> not allowed in this context (a qualified "
12820 }
12821 /* Look for the optional `::' operator. */
12822 global_scope_p
12826 /* Look for the optional nested-name-specifier. The simplest way to
12827 implement:
12829 [temp.res]
12831 The keyword `typename' is not permitted in a base-specifier or
12832 mem-initializer; in these contexts a qualified name that
12833 depends on a template-parameter is implicitly assumed to be a
12834 type name.
12836 is to assume that we have seen the `typename' keyword at this
12837 point. */
12838 nested_name_specifier_p
12847 /* If there is a `::' operator or a nested-name-specifier, then we
12848 are definitely looking for a class-name. */
12853 typename_type,
12857 /* Otherwise, we could also be looking for an ordinary identifier. */
12859 /* Try a class-name. */
12863 none_type,
12867 /* If we found one, we're done. */
12870 /* Otherwise, look for an ordinary identifier. */
12872 }
12874 /* Overloading [gram.over] */
12876 /* Parse an operator-function-id.
12878 operator-function-id:
12879 operator operator
12881 Returns an IDENTIFIER_NODE for the operator which is a
12882 human-readable spelling of the identifier, e.g., `operator +'. */
12884 static tree
12886 {
12887 /* Look for the `operator' keyword. */
12890 /* And then the name of the operator itself. */
12892 }
12894 /* Return an identifier node for a user-defined literal operator.
12895 The suffix identifier is chained to the operator name identifier. */
12897 static tree
12899 {
12900 tree identifier;
12907 }
12909 /* Parse an operator.
12911 operator:
12912 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12913 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12914 || ++ -- , ->* -> () []
12916 GNU Extensions:
12918 operator:
12919 <? >? <?= >?=
12921 Returns an IDENTIFIER_NODE for the operator which is a
12922 human-readable spelling of the identifier, e.g., `operator +'. */
12924 static tree
12926 {
12931 /* Peek at the next token. */
12933 /* Figure out which operator we have. */
12935 {
12937 {
12940 /* The keyword should be either `new' or `delete'. */
12945 else
12948 /* Consume the `new' or `delete' token. */
12951 /* Peek at the next token. */
12953 /* If it's a `[' token then this is the array variant of the
12954 operator. */
12956 {
12957 /* Consume the `[' token. */
12959 /* Look for the `]' token. */
12963 }
12964 /* Otherwise, we have the non-array variant. */
12965 else
12969 }
13116 /* Consume the `('. */
13118 /* Look for the matching `)'. */
13123 /* Consume the `['. */
13125 /* Look for the matching `]'. */
13140 {
13147 /* Consume the string. */
13153 {
13156 }
13157 else
13158 {
13160 /* Look for the suffix identifier. */
13165 {
13169 }
13170 else
13171 {
13174 }
13175 }
13180 {
13183 }
13186 {
13189 }
13191 {
13194 }
13196 }
13199 /* Anything else is an error. */
13201 }
13203 /* If we have selected an identifier, we need to consume the
13204 operator token. */
13207 /* Otherwise, no valid operator name was present. */
13208 else
13209 {
13212 }
13215 }
13217 /* Parse a template-declaration.
13219 template-declaration:
13220 export [opt] template < template-parameter-list > declaration
13222 If MEMBER_P is TRUE, this template-declaration occurs within a
13223 class-specifier.
13225 The grammar rule given by the standard isn't correct. What
13226 is really meant is:
13228 template-declaration:
13229 export [opt] template-parameter-list-seq
13230 decl-specifier-seq [opt] init-declarator [opt] ;
13231 export [opt] template-parameter-list-seq
13232 function-definition
13234 template-parameter-list-seq:
13235 template-parameter-list-seq [opt]
13236 template < template-parameter-list > */
13238 static void
13240 {
13241 /* Check for `export'. */
13243 {
13244 /* Consume the `export' token. */
13246 /* Warn that we do not support `export'. */
13248 }
13251 }
13253 /* Parse a template-parameter-list.
13255 template-parameter-list:
13256 template-parameter
13257 template-parameter-list , template-parameter
13259 Returns a TREE_LIST. Each node represents a template parameter.
13260 The nodes are connected via their TREE_CHAINs. */
13262 static tree
13264 {
13269 /* The loop below parses the template parms. We first need to know
13270 the total number of template parms to be able to compute proper
13271 canonical types of each dependent type. So after the loop, when
13272 we know the total number of template parms,
13273 end_template_parm_list computes the proper canonical types and
13274 fixes up the dependent types accordingly. */
13276 {
13277 tree parameter;
13280 location_t parm_loc;
13282 /* Parse the template-parameter. */
13287 /* Add it to the list. */
13290 parm_loc,
13291 parameter,
13292 is_non_type,
13293 is_parameter_pack);
13294 else
13295 {
13298 }
13300 /* If the next token is not a `,', we're done. */
13303 /* Otherwise, consume the `,' token. */
13305 }
13308 }
13310 /* Parse a template-parameter.
13312 template-parameter:
13313 type-parameter
13314 parameter-declaration
13316 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13317 the parameter. The TREE_PURPOSE is the default value, if any.
13318 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13319 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13320 set to true iff this parameter is a parameter pack. */
13322 static tree
13325 {
13329 tree parm;
13331 /* Assume it is a type parameter or a template parameter. */
13333 /* Assume it not a parameter pack. */
13335 /* Peek at the next token. */
13337 /* If it is `class' or `template', we have a type-parameter. */
13340 /* If it is `class' or `typename' we do not know yet whether it is a
13341 type parameter or a non-type parameter. Consider:
13343 template <typename T, typename T::X X> ...
13345 or:
13347 template <class C, class D*> ...
13349 Here, the first parameter is a type parameter, and the second is
13350 a non-type parameter. We can tell by looking at the token after
13351 the identifier -- if it is a `,', `=', or `>' then we have a type
13352 parameter. */
13354 {
13355 /* Peek at the token after `class' or `typename'. */
13357 /* If it's an ellipsis, we have a template type parameter
13358 pack. */
13361 /* If it's an identifier, skip it. */
13364 /* Now, see if the token looks like the end of a template
13365 parameter. */
13370 }
13372 /* Otherwise, it is a non-type parameter.
13374 [temp.param]
13376 When parsing a default template-argument for a non-type
13377 template-parameter, the first non-nested `>' is taken as the end
13378 of the template parameter-list rather than a greater-than
13379 operator. */
13381 parameter_declarator
13388 /* If the parameter declaration is marked as a parameter pack, set
13389 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13390 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13391 grokdeclarator. */
13394 {
13397 }
13400 {
13401 /* Can happen in some cases of erroneous input (c++/34892). */
13403 /* Consume the `...' for better error recovery. */
13405 }
13406 /* If the next token is an ellipsis, and we don't already have it
13407 marked as a parameter pack, then we have a parameter pack (that
13408 has no declarator). */
13411 && (declarator_can_be_parameter_pack
13413 {
13414 /* Consume the `...'. */
13419 }
13420 /* We might end up with a pack expansion as the type of the non-type
13421 template parameter, in which case this is a non-type template
13422 parameter pack. */
13425 {
13429 }
13432 {
13433 /* Parameter packs cannot have default arguments. However, a
13434 user may try to do so, so we'll parse them and give an
13435 appropriate diagnostic here. */
13439 /* Find the name of the parameter pack. */
13448 else
13452 /* Parse the default argument, but throw away the result. */
13454 }
13464 }
13466 /* Parse a type-parameter.
13468 type-parameter:
13469 class identifier [opt]
13470 class identifier [opt] = type-id
13471 typename identifier [opt]
13472 typename identifier [opt] = type-id
13473 template < template-parameter-list > class identifier [opt]
13474 template < template-parameter-list > class identifier [opt]
13475 = id-expression
13477 GNU Extension (variadic templates):
13479 type-parameter:
13480 class ... identifier [opt]
13481 typename ... identifier [opt]
13483 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13484 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13485 the declaration of the parameter.
13487 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13489 static tree
13491 {
13493 tree parameter;
13495 /* Look for a keyword to tell us what kind of parameter this is. */
13501 {
13504 {
13505 tree identifier;
13506 tree default_argument;
13508 /* If the next token is an ellipsis, we have a template
13509 argument pack. */
13511 {
13512 /* Consume the `...' token. */
13517 }
13519 /* If the next token is an identifier, then it names the
13520 parameter. */
13523 else
13526 /* Create the parameter. */
13529 /* If the next token is an `=', we have a default argument. */
13531 {
13532 /* Consume the `=' token. */
13534 /* Parse the default-argument. */
13538 /* Template parameter packs cannot have default
13539 arguments. */
13541 {
13544 "template parameter pack %qD cannot have a "
13546 else
13548 "template parameter packs cannot have "
13551 }
13555 }
13556 else
13559 /* Create the combined representation of the parameter and the
13560 default argument. */
13562 }
13566 {
13567 tree identifier;
13568 tree default_argument;
13570 /* Look for the `<'. */
13572 /* Parse the template-parameter-list. */
13574 /* Look for the `>'. */
13576 /* Look for the `class' or 'typename' keywords. */
13578 /* If the next token is an ellipsis, we have a template
13579 argument pack. */
13581 {
13582 /* Consume the `...' token. */
13587 }
13588 /* If the next token is an `=', then there is a
13589 default-argument. If the next token is a `>', we are at
13590 the end of the parameter-list. If the next token is a `,',
13591 then we are at the end of this parameter. */
13595 {
13597 /* Treat invalid names as if the parameter were nameless. */
13600 }
13601 else
13604 /* Create the template parameter. */
13606 identifier);
13608 /* If the next token is an `=', then there is a
13609 default-argument. */
13611 {
13614 /* Consume the `='. */
13616 /* Parse the id-expression. */
13618 /* save token before parsing the id-expression, for error
13619 reporting */
13621 default_argument
13629 /* If the id-expression was a template-id that refers to
13630 a template-class, we already have the declaration here,
13631 so no further lookup is needed. */
13632 ;
13633 else
13634 /* Look up the name. */
13635 default_argument
13637 none_type,
13643 /* See if the default argument is valid. */
13644 default_argument
13647 /* Template parameter packs cannot have default
13648 arguments. */
13650 {
13653 "template parameter pack %qD cannot "
13655 identifier);
13656 else
13660 }
13662 }
13663 else
13666 /* Create the combined representation of the parameter and the
13667 default argument. */
13669 }
13675 }
13678 }
13680 /* Parse a template-id.
13682 template-id:
13683 template-name < template-argument-list [opt] >
13685 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13686 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13687 returned. Otherwise, if the template-name names a function, or set
13688 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13689 names a class, returns a TYPE_DECL for the specialization.
13691 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13692 uninstantiated templates. */
13694 static tree
13700 {
13702 tree templ;
13703 tree arguments;
13704 tree template_id;
13711 /* If the next token corresponds to a template-id, there is no need
13712 to reparse it. */
13715 {
13718 /* Get the stored value. */
13720 /* Perform any access checks that were deferred. */
13723 {
13728 tf_warning_or_error);
13729 }
13730 /* Return the stored value. */
13732 }
13734 /* Avoid performing name lookup if there is no possibility of
13735 finding a template-id. */
13738 && !cp_parser_nth_token_starts_template_argument_list_p
13740 {
13743 }
13745 /* Remember where the template-id starts. */
13751 /* Parse the template-name. */
13754 check_dependency_p,
13755 is_declaration,
13756 tag_type,
13759 {
13762 }
13764 /* If we find the sequence `[:' after a template-name, it's probably
13765 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13766 parse correctly the argument list. */
13773 {
13775 /* Change `:' into `::'. */
13777 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13778 CPP_LESS. */
13781 /* Parse the arguments. */
13784 {
13785 /* If we couldn't parse an argument list, then we revert our changes
13786 and return simply an error. Maybe this is not a template-id
13787 after all. */
13792 }
13793 /* Otherwise, emit an error about the invalid digraph, but continue
13794 parsing because we got our argument list. */
13797 {
13800 "%<<:%> is an alternate spelling for %<[%>."
13803 {
13805 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13808 }
13809 }
13810 }
13811 else
13812 {
13813 /* Look for the `<' that starts the template-argument-list. */
13815 {
13818 }
13819 /* Parse the arguments. */
13821 }
13823 /* Build a representation of the specialization. */
13826 TEMPLATE_ID_EXPR,
13830 {
13832 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13833 template (rather than some instantiation thereof) only if
13834 is not nested within some other construct. For example, in
13835 "template <typename T> void f(T) { A<T>::", A<T> is just an
13836 instantiation of A. */
13839 CPP_SCOPE));
13840 template_id
13842 }
13844 {
13846 }
13847 else
13848 {
13849 /* If it's not a class-template or a template-template, it should be
13850 a function-template. */
13856 }
13858 /* If parsing tentatively, replace the sequence of tokens that makes
13859 up the template-id with a CPP_TEMPLATE_ID token. That way,
13860 should we re-parse the token stream, we will not have to repeat
13861 the effort required to do the parse, nor will we issue duplicate
13862 error messages about problems during instantiation of the
13863 template. */
13865 /* Don't do this if we had a parse error in a declarator; re-parsing
13866 might succeed if a name changes meaning (60361). */
13870 {
13873 /* Reset the contents of the START_OF_ID token. */
13875 /* Retrieve any deferred checks. Do not pop this access checks yet
13876 so the memory will not be reclaimed during token replacing below. */
13882 /* Purge all subsequent tokens. */
13885 /* ??? Can we actually assume that, if template_id ==
13886 error_mark_node, we will have issued a diagnostic to the
13887 user, as opposed to simply marking the tentative parse as
13888 failed? */
13891 }
13895 }
13897 /* Parse a template-name.
13899 template-name:
13900 identifier
13902 The standard should actually say:
13904 template-name:
13905 identifier
13906 operator-function-id
13908 A defect report has been filed about this issue.
13910 A conversion-function-id cannot be a template name because they cannot
13911 be part of a template-id. In fact, looking at this code:
13913 a.operator K<int>()
13915 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13916 It is impossible to call a templated conversion-function-id with an
13917 explicit argument list, since the only allowed template parameter is
13918 the type to which it is converting.
13920 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13921 `template' keyword, in a construction like:
13923 T::template f<3>()
13925 In that case `f' is taken to be a template-name, even though there
13926 is no way of knowing for sure.
13928 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13929 name refers to a set of overloaded functions, at least one of which
13930 is a template, or an IDENTIFIER_NODE with the name of the template,
13931 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13932 names are looked up inside uninstantiated templates. */
13934 static tree
13941 {
13942 tree identifier;
13943 tree decl;
13944 tree fns;
13947 /* If the next token is `operator', then we have either an
13948 operator-function-id or a conversion-function-id. */
13950 {
13951 /* We don't know whether we're looking at an
13952 operator-function-id or a conversion-function-id. */
13954 /* Try an operator-function-id. */
13956 /* If that didn't work, try a conversion-function-id. */
13958 {
13961 }
13962 }
13963 /* Look for the identifier. */
13964 else
13967 /* If we didn't find an identifier, we don't have a template-id. */
13971 /* If the name immediately followed the `template' keyword, then it
13972 is a template-name. However, if the next token is not `<', then
13973 we do not treat it as a template-name, since it is not being used
13974 as part of a template-id. This enables us to handle constructs
13975 like:
13977 template <typename T> struct S { S(); };
13978 template <typename T> S<T>::S();
13980 correctly. We would treat `S' as a template -- if it were `S<T>'
13981 -- but we do not if there is no `<'. */
13985 {
13986 /* In a declaration, in a dependent context, we pretend that the
13987 "template" keyword was present in order to improve error
13988 recovery. For example, given:
13990 template <typename T> void f(T::X<int>);
13992 we want to treat "X<int>" as a template-id. */
13994 && !template_keyword_p
13996 && check_dependency_p
13998 /* Do not do this for dtors (or ctors), since they never
13999 need the template keyword before their name. */
14001 {
14004 /* Explain what went wrong. */
14006 identifier);
14009 /* If parsing tentatively, find the location of the "<" token. */
14012 /* Parse the template arguments so that we can issue error
14013 messages about them. */
14016 /* Skip tokens until we find a good place from which to
14017 continue parsing. */
14022 /* If parsing tentatively, permanently remove the
14023 template argument list. That will prevent duplicate
14024 error messages from being issued about the missing
14025 "template" keyword. */
14031 }
14033 /* If the "template" keyword is present, then there is generally
14034 no point in doing name-lookup, so we just return IDENTIFIER.
14035 But, if the qualifying scope is non-dependent then we can
14036 (and must) do name-lookup normally. */
14042 }
14044 /* Look up the name. */
14046 tag_type,
14049 check_dependency_p,
14055 /* If DECL is a template, then the name was a template-name. */
14057 {
14061 }
14062 else
14063 {
14066 /* The standard does not explicitly indicate whether a name that
14067 names a set of overloaded declarations, some of which are
14068 templates, is a template-name. However, such a name should
14069 be a template-name; otherwise, there is no way to form a
14070 template-id for the overloaded templates. */
14078 {
14079 /* The name does not name a template. */
14082 }
14083 }
14085 /* If DECL is dependent, and refers to a function, then just return
14086 its name; we will look it up again during template instantiation. */
14088 {
14092 }
14095 }
14097 /* Parse a template-argument-list.
14099 template-argument-list:
14100 template-argument ... [opt]
14101 template-argument-list , template-argument ... [opt]
14103 Returns a TREE_VEC containing the arguments. */
14105 static tree
14107 {
14112 tree vec;
14119 /* Even if the template-id appears in an integral
14120 constant-expression, the contents of the argument list do
14121 not. */
14127 /* Parse the arguments. */
14128 do
14129 {
14130 tree argument;
14133 /* Consume the comma. */
14136 /* Parse the template-argument. */
14139 /* If the next token is an ellipsis, we're expanding a template
14140 argument pack. */
14142 {
14144 {
14148 }
14149 /* Consume the `...' token. */
14152 /* Make the argument into a TYPE_PACK_EXPANSION or
14153 EXPR_PACK_EXPANSION. */
14155 }
14158 {
14162 {
14165 }
14166 else
14168 }
14170 }
14183 #ifdef ENABLE_CHECKING
14185 #endif
14187 }
14189 /* Parse a template-argument.
14191 template-argument:
14192 assignment-expression
14193 type-id
14194 id-expression
14196 The representation is that of an assignment-expression, type-id, or
14197 id-expression -- except that the qualified id-expression is
14198 evaluated, so that the value returned is either a DECL or an
14199 OVERLOAD.
14201 Although the standard says "assignment-expression", it forbids
14202 throw-expressions or assignments in the template argument.
14203 Therefore, we use "conditional-expression" instead. */
14205 static tree
14207 {
14208 tree argument;
14214 cp_id_kind idk;
14216 /* There's really no way to know what we're looking at, so we just
14217 try each alternative in order.
14219 [temp.arg]
14221 In a template-argument, an ambiguity between a type-id and an
14222 expression is resolved to a type-id, regardless of the form of
14223 the corresponding template-parameter.
14225 Therefore, we try a type-id first. */
14228 /* If there was no error parsing the type-id but the next token is a
14229 '>>', our behavior depends on which dialect of C++ we're
14230 parsing. In C++98, we probably found a typo for '> >'. But there
14231 are type-id which are also valid expressions. For instance:
14233 struct X { int operator >> (int); };
14234 template <int V> struct Foo {};
14235 Foo<X () >> 5> r;
14237 Here 'X()' is a valid type-id of a function type, but the user just
14238 wanted to write the expression "X() >> 5". Thus, we remember that we
14239 found a valid type-id, but we still try to parse the argument as an
14240 expression to see what happens.
14242 In C++0x, the '>>' will be considered two separate '>'
14243 tokens. */
14247 {
14250 }
14251 else
14252 {
14253 /* If the next token isn't a `,' or a `>', then this argument wasn't
14254 really finished. This means that the argument is not a valid
14255 type-id. */
14258 /* If that worked, we're done. */
14261 }
14262 /* We're still not sure what the argument will be. */
14264 /* Try a template. */
14272 /* If the next token isn't a `,' or a `>', then this argument wasn't
14273 really finished. */
14277 {
14278 /* Figure out what is being referred to. If the id-expression
14279 was for a class template specialization, then we will have a
14280 TYPE_DECL at this point. There is no need to do name lookup
14281 at this point in that case. */
14284 none_type,
14293 }
14295 {
14299 }
14300 /* It must be a non-type argument. There permitted cases are given
14301 in [temp.arg.nontype]:
14303 -- an integral constant-expression of integral or enumeration
14304 type; or
14306 -- the name of a non-type template-parameter; or
14308 -- the name of an object or function with external linkage...
14310 -- the address of an object or function with external linkage...
14312 -- a pointer to member... */
14313 /* Look for a non-type template parameter. */
14315 {
14327 }
14329 /* If the next token is "&", the argument must be the address of an
14330 object or function with external linkage. */
14333 {
14336 }
14337 /* See if we might have an id-expression. */
14344 {
14347 address_p,
14354 else
14355 {
14356 tree probe;
14359 {
14360 /* Strip the dereference temporarily. */
14363 }
14365 /* If we're in a template, we represent a qualified-id referring
14366 to a static data member as a SCOPE_REF even if the scope isn't
14367 dependent so that we can check access control later. */
14372 {
14373 /* A variable without external linkage might still be a
14374 valid constant-expression, so no error is issued here
14375 if the external-linkage check fails. */
14378 }
14380 /* All overloaded functions are allowed; if the external
14381 linkage test does not pass, an error will be issued
14382 later. */
14383 ;
14387 /* A pointer-to-member. */
14388 ;
14390 ;
14391 else
14395 {
14398 tf_warning_or_error);
14399 else
14402 }
14403 }
14404 }
14405 /* If the argument started with "&", there are no other valid
14406 alternatives at this point. */
14408 {
14411 }
14413 /* If the argument wasn't successfully parsed as a type-id followed
14414 by '>>', the argument can only be a constant expression now.
14415 Otherwise, we try parsing the constant-expression tentatively,
14416 because the argument could really be a type-id. */
14427 /* We did our best to parse the argument as a non type-id, but that
14428 was the only alternative that matched (albeit with a '>' after
14429 it). We can assume it's just a typo from the user, and a
14430 diagnostic will then be issued. */
14432 }
14434 /* Parse an explicit-instantiation.
14436 explicit-instantiation:
14437 template declaration
14439 Although the standard says `declaration', what it really means is:
14441 explicit-instantiation:
14442 template decl-specifier-seq [opt] declarator [opt] ;
14444 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14445 supposed to be allowed. A defect report has been filed about this
14446 issue.
14448 GNU Extension:
14450 explicit-instantiation:
14451 storage-class-specifier template
14452 decl-specifier-seq [opt] declarator [opt] ;
14453 function-specifier template
14454 decl-specifier-seq [opt] declarator [opt] ; */
14456 static void
14458 {
14460 cp_decl_specifier_seq decl_specifiers;
14465 /* Look for an (optional) storage-class-specifier or
14466 function-specifier. */
14468 {
14469 extension_specifier
14472 extension_specifier
14475 }
14477 /* Look for the `template' keyword. */
14479 /* Let the front end know that we are processing an explicit
14480 instantiation. */
14482 /* [temp.explicit] says that we are supposed to ignore access
14483 control while processing explicit instantiation directives. */
14485 /* Parse a decl-specifier-seq. */
14487 CP_PARSER_FLAGS_OPTIONAL,
14490 /* If there was exactly one decl-specifier, and it declared a class,
14491 and there's no declarator, then we have an explicit type
14492 instantiation. */
14494 {
14495 tree type;
14499 /* Turn access control back on for names used during
14500 template instantiation. */
14505 }
14506 else
14507 {
14509 tree decl;
14511 /* Parse the declarator. */
14512 declarator
14523 {
14526 "explicit instantiation shall not use"
14530 "explicit instantiation shall not use"
14535 /* Turn access control back on for names used during
14536 template instantiation. */
14538 /* Do the explicit instantiation. */
14540 }
14541 else
14542 {
14544 /* Skip the body of the explicit instantiation. */
14546 }
14547 }
14548 /* We're done with the instantiation. */
14554 }
14556 /* Parse an explicit-specialization.
14558 explicit-specialization:
14559 template < > declaration
14561 Although the standard says `declaration', what it really means is:
14563 explicit-specialization:
14564 template <> decl-specifier [opt] init-declarator [opt] ;
14565 template <> function-definition
14566 template <> explicit-specialization
14567 template <> template-declaration */
14569 static void
14571 {
14575 /* Look for the `template' keyword. */
14577 /* Look for the `<'. */
14579 /* Look for the `>'. */
14581 /* We have processed another parameter list. */
14583 /* [temp]
14585 A template ... explicit specialization ... shall not have C
14586 linkage. */
14588 {
14590 /* Give it C++ linkage to avoid confusing other parts of the
14591 front end. */
14594 }
14595 else
14597 /* Let the front end know that we are beginning a specialization. */
14599 {
14602 }
14604 /* If the next keyword is `template', we need to figure out whether
14605 or not we're looking a template-declaration. */
14607 {
14612 else
14614 }
14615 else
14616 /* Parse the dependent declaration. */
14622 /* We're done with the specialization. */
14624 /* For the erroneous case of a template with C linkage, we pushed an
14625 implicit C++ linkage scope; exit that scope now. */
14628 /* We're done with this parameter list. */
14630 }
14632 /* Parse a type-specifier.
14634 type-specifier:
14635 simple-type-specifier
14636 class-specifier
14637 enum-specifier
14638 elaborated-type-specifier
14639 cv-qualifier
14641 GNU Extension:
14643 type-specifier:
14644 __complex__
14646 Returns a representation of the type-specifier. For a
14647 class-specifier, enum-specifier, or elaborated-type-specifier, a
14648 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14650 The parser flags FLAGS is used to control type-specifier parsing.
14652 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14653 in a decl-specifier-seq.
14655 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14656 class-specifier, enum-specifier, or elaborated-type-specifier, then
14657 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14658 if a type is declared; 2 if it is defined. Otherwise, it is set to
14659 zero.
14661 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14662 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14663 is set to FALSE. */
14665 static tree
14667 cp_parser_flags flags,
14672 {
14678 /* Assume this type-specifier does not declare a new type. */
14681 /* And that it does not specify a cv-qualifier. */
14684 /* Peek at the next token. */
14687 /* If we're looking at a keyword, we can use that to guide the
14688 production we choose. */
14691 {
14696 /* Look for the enum-specifier. */
14698 /* If that worked, we're done. */
14700 {
14705 type_spec,
14706 token,
14709 }
14710 else
14713 /* Any of these indicate either a class-specifier, or an
14714 elaborated-type-specifier. */
14721 /* Parse tentatively so that we can back up if we don't find a
14722 class-specifier. */
14724 /* Look for the class-specifier. */
14727 /* If that worked, we're done. */
14729 {
14734 type_spec,
14735 token,
14738 }
14740 /* Fall through. */
14741 elaborated_type_specifier:
14742 /* We're declaring (not defining) a class or enum. */
14746 /* Fall through. */
14748 /* Look for an elaborated-type-specifier. */
14749 type_spec
14750 = (cp_parser_elaborated_type_specifier
14753 is_declaration));
14756 type_spec,
14757 token,
14780 /* The `__complex__' keyword is a GNU extension. */
14786 }
14788 /* Handle simple keywords. */
14790 {
14792 {
14795 }
14797 }
14799 /* If we do not already have a type-specifier, assume we are looking
14800 at a simple-type-specifier. */
14802 decl_specs,
14803 flags);
14805 /* If we didn't find a type-specifier, and a type-specifier was not
14806 optional in this context, issue an error message. */
14808 {
14811 }
14814 }
14816 /* Parse a simple-type-specifier.
14818 simple-type-specifier:
14819 :: [opt] nested-name-specifier [opt] type-name
14820 :: [opt] nested-name-specifier template template-id
14821 char
14822 wchar_t
14823 bool
14824 short
14825 int
14826 long
14827 signed
14828 unsigned
14829 float
14830 double
14831 void
14833 C++0x Extension:
14835 simple-type-specifier:
14836 auto
14837 decltype ( expression )
14838 char16_t
14839 char32_t
14840 __underlying_type ( type-id )
14842 GNU Extension:
14844 simple-type-specifier:
14845 __int128
14846 __typeof__ unary-expression
14847 __typeof__ ( type-id )
14848 __typeof__ ( type-id ) { initializer-list , [opt] }
14850 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14851 appropriately updated. */
14853 static tree
14856 cp_parser_flags flags)
14857 {
14862 /* Peek at the next token. */
14865 /* If we're looking at a keyword, things are easy. */
14867 {
14902 {
14905 }
14934 {
14937 else
14941 {
14944 "use of %<auto%> in lambda parameter declaration "
14945 "only available with "
14947 }
14950 "use of %<auto%> in parameter declaration "
14951 "only available with "
14953 else
14955 "ISO C++ forbids use of %<auto%> in parameter "
14957 }
14958 else
14963 /* Since DR 743, decltype can either be a simple-type-specifier by
14964 itself or begin a nested-name-specifier. Parsing it will replace
14965 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14966 handling below decide what to do. */
14972 /* Consume the `typeof' token. */
14974 /* Parse the operand to `typeof'. */
14976 /* If it is not already a TYPE, take its type. */
14982 token,
14991 token,
15001 token,
15006 }
15008 /* If token is an already-parsed decltype not followed by ::,
15009 it's a simple-type-specifier. */
15012 {
15015 {
15017 token,
15019 /* Remember that we are handling a decltype in order to
15020 implement the resolution of DR 1510 when the argument
15021 isn't instantiation dependent. */
15023 }
15026 }
15028 /* If the type-specifier was for a built-in type, we're done. */
15030 {
15031 /* Record the type. */
15038 type,
15039 token,
15044 /* Consume the token. */
15050 /* There is no valid C++ program where a non-template type is
15051 followed by a "<". That usually indicates that the user thought
15052 that the type was a template. */
15057 }
15059 /* The type-specifier must be a user-defined type. */
15061 {
15065 /* Don't gobble tokens or issue error messages if this is an
15066 optional type-specifier. */
15070 /* Look for the optional `::' operator. */
15071 global_p
15075 /* Look for the nested-name specifier. */
15076 qualified_p
15084 /* If we have seen a nested-name-specifier, and the next token
15085 is `template', then we are using the template-id production. */
15088 {
15089 /* Look for the template-id. */
15093 none_type,
15095 /* If the template-id did not name a type, we are out of
15096 luck. */
15098 {
15101 }
15102 }
15103 /* Otherwise, look for a type-name. */
15104 else
15106 /* Keep track of all name-lookups performed in class scopes. */
15108 && !global_p
15109 && !qualified_p
15113 /* If it didn't work out, we don't have a TYPE. */
15119 token,
15121 }
15123 /* If we didn't get a type-name, issue an error message. */
15125 {
15128 }
15131 {
15132 /* See if TYPE is an Objective-C type, and if so, parse and
15133 accept any protocol references following it. Do this before
15134 the cp_parser_check_for_invalid_template_id() call, because
15135 Objective-C types can be followed by '<...>' which would
15136 enclose protocol names rather than template arguments, and so
15137 everything is fine. */
15140 {
15144 /* Clobber the "unqualified" type previously entered into
15145 DECL_SPECS with the new, improved protocol-qualified version. */
15150 }
15152 /* There is no valid C++ program where a non-template type is
15153 followed by a "<". That usually indicates that the user
15154 thought that the type was a template. */
15156 none_type,
15158 }
15161 }
15163 /* Parse a type-name.
15165 type-name:
15166 class-name
15167 enum-name
15168 typedef-name
15169 simple-template-id [in c++0x]
15171 enum-name:
15172 identifier
15174 typedef-name:
15175 identifier
15177 Returns a TYPE_DECL for the type. */
15179 static tree
15181 {
15182 tree type_decl;
15184 /* We can't know yet whether it is a class-name or not. */
15186 /* Try a class-name. */
15190 none_type,
15194 /* If it's not a class-name, keep looking. */
15196 {
15198 /* It must be a typedef-name or an enum-name. */
15202 /* It is either a simple-template-id representing an
15203 instantiation of an alias template... */
15207 none_type,
15209 /* Note that this must be an instantiation of an alias template
15210 because [temp.names]/6 says:
15212 A template-id that names an alias template specialization
15213 is a type-name.
15215 Whereas [temp.names]/7 says:
15217 A simple-template-id that names a class template
15218 specialization is a class-name. */
15223 else
15227 /* ... Or a typedef-name or an enum-name. */
15229 }
15232 }
15234 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15236 enum-name:
15237 identifier
15239 typedef-name:
15240 identifier
15242 Returns a TYPE_DECL for the type. */
15244 static tree
15246 {
15247 tree type_decl;
15248 tree identifier;
15255 /* Look up the type-name. */
15262 {
15263 /* See if this is an Objective-C type. */
15268 }
15270 /* Issue an error if we did not find a type-name. */
15272 /* In Objective-C, we have the complication that class names are
15273 normally type names and start declarations (eg, the
15274 "NSObject" in "NSObject *object;"), but can be used in an
15275 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15276 is an expression. So, a classname followed by a dot is not a
15277 valid type-name. */
15280 {
15285 }
15286 /* Remember that the name was used in the definition of the
15287 current class so that we can check later to see if the
15288 meaning would have been different after the class was
15289 entirely defined. */
15295 }
15297 /* Parse an elaborated-type-specifier. Note that the grammar given
15298 here incorporates the resolution to DR68.
15300 elaborated-type-specifier:
15301 class-key :: [opt] nested-name-specifier [opt] identifier
15302 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15303 enum-key :: [opt] nested-name-specifier [opt] identifier
15304 typename :: [opt] nested-name-specifier identifier
15305 typename :: [opt] nested-name-specifier template [opt]
15306 template-id
15308 GNU extension:
15310 elaborated-type-specifier:
15311 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15312 class-key attributes :: [opt] nested-name-specifier [opt]
15313 template [opt] template-id
15314 enum attributes :: [opt] nested-name-specifier [opt] identifier
15316 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15317 declared `friend'. If IS_DECLARATION is TRUE, then this
15318 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15319 something is being declared.
15321 Returns the TYPE specified. */
15323 static tree
15327 {
15329 tree identifier;
15332 tree globalscope;
15335 /* See if we're looking at the `enum' keyword. */
15337 {
15338 /* Consume the `enum' token. */
15340 /* Remember that it's an enumeration type. */
15342 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15343 enums) is used here. */
15346 {
15350 /* Consume the `struct' or `class' and parse it anyway. */
15352 }
15353 /* Parse the attributes. */
15355 }
15356 /* Or, it might be `typename'. */
15358 RID_TYPENAME))
15359 {
15360 /* Consume the `typename' token. */
15362 /* Remember that it's a `typename' type. */
15364 }
15365 /* Otherwise it must be a class-key. */
15366 else
15367 {
15371 /* Parse the attributes. */
15373 }
15375 /* Look for the `::' operator. */
15378 /* Look for the nested-name-specifier. */
15380 {
15385 is_declaration))
15387 }
15388 else
15389 /* Even though `typename' is not present, the proposed resolution
15390 to Core Issue 180 says that in `class A<T>::B', `B' should be
15391 considered a type-name, even if `A<T>' is dependent. */
15396 is_declaration);
15397 /* For everything but enumeration types, consider a template-id.
15398 For an enumeration type, consider only a plain identifier. */
15400 {
15402 tree decl;
15404 /* Allow the `template' keyword. */
15406 /* If we didn't see `template', we don't know if there's a
15407 template-id or not. */
15410 /* Parse the template-id. */
15414 tag_type,
15415 is_declaration);
15416 /* If we didn't find a template-id, look for an ordinary
15417 identifier. */
15419 ;
15420 /* We can get here when cp_parser_template_id, called by
15421 cp_parser_class_name with tag_type == none_type, succeeds
15422 and caches a BASELINK. Then, when called again here,
15423 instead of failing and returning an error_mark_node
15424 returns it (see template/typename17.C in C++11).
15425 ??? Could we diagnose this earlier? */
15427 {
15430 }
15431 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15432 in effect, then we must assume that, upon instantiation, the
15433 template will correspond to a class. */
15437 typename_type,
15439 /* If the `typename' keyword is in effect and DECL is not a type
15440 decl, then type is non existent. */
15442 ;
15448 }
15451 {
15456 {
15459 }
15461 /* For a `typename', we needn't call xref_tag. */
15467 /* Template parameter lists apply only if we are not within a
15468 function parameter list. */
15469 bool template_parm_lists_apply
15478 /* Look up a qualified name in the usual way. */
15480 {
15481 tree decl;
15482 tree ambiguous_decls;
15485 tag_type,
15492 /* If the lookup was ambiguous, an error will already have been
15493 issued. */
15497 /* If we are parsing friend declaration, DECL may be a
15498 TEMPLATE_DECL tree node here. However, we need to check
15499 whether this TEMPLATE_DECL results in valid code. Consider
15500 the following example:
15502 namespace N {
15503 template <class T> class C {};
15504 }
15505 class X {
15506 template <class T> friend class N::C; // #1, valid code
15507 };
15508 template <class T> class Y {
15509 friend class N::C; // #2, invalid code
15510 };
15512 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15513 name lookup of `N::C'. We see that friend declaration must
15514 be template for the code to be valid. Note that
15515 processing_template_decl does not work here since it is
15516 always 1 for the above two cases. */
15518 decl = (cp_parser_maybe_treat_template_as_class
15523 {
15525 identifier,
15528 }
15531 {
15535 allow_template);
15539 }
15541 /* Forward declarations of nested types, such as
15543 class C1::C2;
15544 class C1::C2::C3;
15546 are invalid unless all components preceding the final '::'
15547 are complete. If all enclosing types are complete, these
15548 declarations become merely pointless.
15550 Invalid forward declarations of nested types are errors
15551 caught elsewhere in parsing. Those that are pointless arrive
15552 here. */
15559 }
15560 else
15561 {
15562 /* An elaborated-type-specifier sometimes introduces a new type and
15563 sometimes names an existing type. Normally, the rule is that it
15564 introduces a new type only if there is not an existing type of
15565 the same name already in scope. For example, given:
15567 struct S {};
15568 void f() { struct S s; }
15570 the `struct S' in the body of `f' is the same `struct S' as in
15571 the global scope; the existing definition is used. However, if
15572 there were no global declaration, this would introduce a new
15573 local class named `S'.
15575 An exception to this rule applies to the following code:
15577 namespace N { struct S; }
15579 Here, the elaborated-type-specifier names a new type
15580 unconditionally; even if there is already an `S' in the
15581 containing scope this declaration names a new type.
15582 This exception only applies if the elaborated-type-specifier
15583 forms the complete declaration:
15585 [class.name]
15587 A declaration consisting solely of `class-key identifier ;' is
15588 either a redeclaration of the name in the current scope or a
15589 forward declaration of the identifier as a class name. It
15590 introduces the name into the current scope.
15592 We are in this situation precisely when the next token is a `;'.
15594 An exception to the exception is that a `friend' declaration does
15595 *not* name a new type; i.e., given:
15597 struct S { friend struct T; };
15599 `T' is not a new type in the scope of `S'.
15601 Also, `new struct S' or `sizeof (struct S)' never results in the
15602 definition of a new type; a new type can only be declared in a
15603 declaration context. */
15605 tag_scope ts;
15609 /* Friends have special name lookup rules. */
15613 CPP_SEMICOLON))
15614 /* This is a `class-key identifier ;' */
15616 else
15619 template_p =
15620 (template_parm_lists_apply
15623 /* An unqualified name was used to reference this type, so
15624 there were no qualifying templates. */
15632 }
15633 }
15638 /* Allow attributes on forward declarations of classes. */
15640 {
15650 else
15653 }
15656 {
15657 /* Indicate whether this class was declared as a `class' or as a
15658 `struct'. */
15662 }
15664 /* A "<" cannot follow an elaborated type specifier. If that
15665 happens, the user was probably trying to form a template-id. */
15670 }
15672 /* Parse an enum-specifier.
15674 enum-specifier:
15675 enum-head { enumerator-list [opt] }
15676 enum-head { enumerator-list , } [C++0x]
15678 enum-head:
15679 enum-key identifier [opt] enum-base [opt]
15680 enum-key nested-name-specifier identifier enum-base [opt]
15682 enum-key:
15683 enum
15684 enum class [C++0x]
15685 enum struct [C++0x]
15687 enum-base: [C++0x]
15688 : type-specifier-seq
15690 opaque-enum-specifier:
15691 enum-key identifier enum-base [opt] ;
15693 GNU Extensions:
15694 enum-key attributes[opt] identifier [opt] enum-base [opt]
15695 { enumerator-list [opt] }attributes[opt]
15696 enum-key attributes[opt] identifier [opt] enum-base [opt]
15697 { enumerator-list, }attributes[opt] [C++0x]
15699 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15700 if the token stream isn't an enum-specifier after all. */
15702 static tree
15704 {
15705 tree identifier;
15707 tree prev_scope;
15709 tree attributes;
15722 /* Parse tentatively so that we can back up if we don't find a
15723 enum-specifier. */
15726 /* Caller guarantees that the current token is 'enum', an identifier
15727 possibly follows, and the token after that is an opening brace.
15728 If we don't have an identifier, fabricate an anonymous name for
15729 the enumeration being defined. */
15732 /* Parse the "class" or "struct", which indicates a scoped
15733 enumeration type in C++0x. */
15736 {
15740 /* Consume the `struct' or `class' token. */
15744 }
15748 /* Clear the qualification. */
15753 /* Figure out in what scope the declaration is being placed. */
15759 nested_name_specifier
15767 {
15768 tree name;
15772 enum_type,
15777 input_location);
15779 {
15782 {
15783 /* Are template enums allowed in ISO? */
15787 /* ignore a typename reference, for it will be solved by name
15788 in start_enum. */
15790 }
15791 }
15794 else
15797 }
15798 else
15799 {
15802 else
15803 {
15809 }
15810 }
15813 /* Check for the `:' that denotes a specified underlying type in C++0x.
15814 Note that a ':' could also indicate a bitfield width, however. */
15816 {
15817 cp_decl_specifier_seq type_specifiers;
15819 /* Consume the `:'. */
15822 /* Parse the type-specifier-seq. */
15827 /* At this point this is surely not elaborated type specifier. */
15836 /* If that didn't work, stop. */
15838 {
15844 }
15845 }
15847 /* Look for the `{' but don't consume it yet. */
15849 {
15851 {
15854 {
15857 }
15858 }
15859 /* An opaque-enum-specifier must have a ';' here. */
15862 {
15865 {
15868 }
15869 }
15870 }
15876 {
15878 {
15882 }
15884 {
15886 }
15887 }
15889 /* Issue an error message if type-definitions are forbidden here. */
15892 else
15893 /* Create the new type. We do this before consuming the opening
15894 brace so the enum will be recorded as being on the line of its
15895 tag (or the 'enum' keyword, if there is no tag). */
15899 /* If the next token is not '{' it is an opaque-enum-specifier or an
15900 elaborated-type-specifier. */
15902 {
15906 {
15907 /* The following catches invalid code such as:
15908 enum class S<int>::E { A, B, C }; */
15916 {
15920 nested_name_specifier);
15922 }
15923 /* If that scope does not contain the scope in which the
15924 class was originally declared, the program is invalid. */
15926 nested_name_specifier))
15927 {
15930 "declaration of %qD in namespace %qD which does not "
15933 else
15935 "declaration of %qD in %qD which does not "
15939 }
15940 }
15945 /* Consume the opening brace. */
15952 {
15956 }
15957 else
15958 {
15964 }
15968 /* If the next token is not '}', then there are some enumerators. */
15970 {
15974 }
15975 else
15978 /* Consume the final '}'. */
15984 }
15985 else
15986 {
15987 /* If a ';' follows, then it is an opaque-enum-specifier
15988 and additional restrictions apply. */
15990 {
15997 }
15998 }
16000 /* Look for trailing attributes to apply to this enumeration, and
16001 apply them if appropriate. */
16003 {
16007 trailing_attr,
16009 }
16011 /* Finish up the enumeration. */
16013 {
16018 }
16021 {
16023 {
16026 }
16028 {
16030 }
16031 }
16032 out:
16035 }
16037 /* Parse an enumerator-list. The enumerators all have the indicated
16038 TYPE.
16040 enumerator-list:
16041 enumerator-definition
16042 enumerator-list , enumerator-definition */
16044 static void
16046 {
16048 {
16049 /* Parse an enumerator-definition. */
16052 /* If the next token is not a ',', we've reached the end of
16053 the list. */
16056 /* Otherwise, consume the `,' and keep going. */
16058 /* If the next token is a `}', there is a trailing comma. */
16060 {
16065 }
16066 }
16067 }
16069 /* Parse an enumerator-definition. The enumerator has the indicated
16070 TYPE.
16072 enumerator-definition:
16073 enumerator
16074 enumerator = constant-expression
16076 enumerator:
16077 identifier */
16079 static void
16081 {
16082 tree identifier;
16083 tree value;
16084 location_t loc;
16086 /* Save the input location because we are interested in the location
16087 of the identifier and not the location of the explicit value. */
16090 /* Look for the identifier. */
16095 /* If the next token is an '=', then there is an explicit value. */
16097 {
16098 /* Consume the `=' token. */
16100 /* Parse the value. */
16103 }
16104 else
16107 /* If we are processing a template, make sure the initializer of the
16108 enumerator doesn't contain any bare template parameter pack. */
16112 /* Create the enumerator. */
16114 }
16116 /* Parse a namespace-name.
16118 namespace-name:
16119 original-namespace-name
16120 namespace-alias
16122 Returns the NAMESPACE_DECL for the namespace. */
16124 static tree
16126 {
16127 tree identifier;
16128 tree namespace_decl;
16132 /* Get the name of the namespace. */
16137 /* Look up the identifier in the currently active scope. Look only
16138 for namespaces, due to:
16140 [basic.lookup.udir]
16142 When looking up a namespace-name in a using-directive or alias
16143 definition, only namespace names are considered.
16145 And:
16147 [basic.lookup.qual]
16149 During the lookup of a name preceding the :: scope resolution
16150 operator, object, function, and enumerator names are ignored.
16152 (Note that cp_parser_qualifying_entity only calls this
16153 function if the token after the name is the scope resolution
16154 operator.) */
16156 none_type,
16162 /* If it's not a namespace, issue an error. */
16165 {
16170 }
16173 }
16175 /* Parse a namespace-definition.
16177 namespace-definition:
16178 named-namespace-definition
16179 unnamed-namespace-definition
16181 named-namespace-definition:
16182 original-namespace-definition
16183 extension-namespace-definition
16185 original-namespace-definition:
16186 namespace identifier { namespace-body }
16188 extension-namespace-definition:
16189 namespace original-namespace-name { namespace-body }
16191 unnamed-namespace-definition:
16192 namespace { namespace-body } */
16194 static void
16196 {
16203 {
16207 }
16208 else
16211 /* Look for the `namespace' keyword. */
16214 /* Get the name of the namespace. We do not attempt to distinguish
16215 between an original-namespace-definition and an
16216 extension-namespace-definition at this point. The semantic
16217 analysis routines are responsible for that. */
16220 else
16223 /* Parse any specified attributes. */
16226 /* Look for the `{' to start the namespace. */
16228 /* Start the namespace. */
16231 /* "inline namespace" is equivalent to a stub namespace definition
16232 followed by a strong using directive. */
16234 {
16236 /* Set up namespace association. */
16240 /* Import the contents of the inline namespace. */
16244 }
16248 /* Parse the body of the namespace. */
16254 /* Finish the namespace. */
16256 /* Look for the final `}'. */
16258 }
16260 /* Parse a namespace-body.
16262 namespace-body:
16263 declaration-seq [opt] */
16265 static void
16267 {
16269 }
16271 /* Parse a namespace-alias-definition.
16273 namespace-alias-definition:
16274 namespace identifier = qualified-namespace-specifier ; */
16276 static void
16278 {
16279 tree identifier;
16280 tree namespace_specifier;
16284 /* Look for the `namespace' keyword. */
16286 /* Look for the identifier. */
16290 /* Look for the `=' token. */
16293 {
16295 /* Skip the definition. */
16300 }
16302 /* Look for the qualified-namespace-specifier. */
16303 namespace_specifier
16305 /* Look for the `;' token. */
16308 /* Register the alias in the symbol table. */
16310 }
16312 /* Parse a qualified-namespace-specifier.
16314 qualified-namespace-specifier:
16315 :: [opt] nested-name-specifier [opt] namespace-name
16317 Returns a NAMESPACE_DECL corresponding to the specified
16318 namespace. */
16320 static tree
16322 {
16323 /* Look for the optional `::'. */
16327 /* Look for the optional nested-name-specifier. */
16335 }
16337 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16338 access declaration.
16340 using-declaration:
16341 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16342 using :: unqualified-id ;
16344 access-declaration:
16345 qualified-id ;
16347 */
16349 static bool
16352 {
16356 tree decl;
16357 tree identifier;
16358 tree qscope;
16363 {
16366 }
16367 else
16368 {
16369 /* Look for the `using' keyword. */
16372 /* Peek at the next token. */
16374 /* See if it's `typename'. */
16376 {
16377 /* Remember that we've seen it. */
16379 /* Consume the `typename' token. */
16381 }
16382 }
16384 /* Look for the optional global scope qualification. */
16385 global_scope_p
16390 /* If we saw `typename', or didn't see `::', then there must be a
16391 nested-name-specifier present. */
16393 {
16399 {
16402 }
16403 }
16404 /* Otherwise, we could be in either of the two productions. In that
16405 case, treat the nested-name-specifier as optional. */
16406 else
16418 /* Something has already gone wrong; there's no need to parse
16419 further. Since an error has occurred, the return value of
16420 cp_parser_parse_definitely will be false, as required. */
16424 /* Parse the unqualified-id. */
16432 {
16437 }
16439 /* The function we call to handle a using-declaration is different
16440 depending on what scope we are in. */
16442 ;
16445 /* [namespace.udecl]
16447 A using declaration shall not name a template-id. */
16450 else
16451 {
16453 {
16454 /* Create the USING_DECL. */
16461 {
16464 }
16465 else
16466 /* Add it to the list of members in this class. */
16468 }
16469 else
16470 {
16472 identifier,
16479 {
16482 }
16485 else
16487 }
16488 }
16490 /* Look for the final `;'. */
16495 "access declarations are deprecated "
16496 "in favour of using-declarations; "
16500 }
16502 /* Parse an alias-declaration.
16504 alias-declaration:
16505 using identifier attribute-specifier-seq [opt] = type-id */
16507 static tree
16509 {
16511 location_t id_location;
16513 cp_decl_specifier_seq decl_specs;
16517 /* Look for the `using' keyword. */
16518 cp_token *using_token
16540 /* Now we are going to parse the type-id of the declaration. */
16542 /*
16543 [dcl.type]/3 says:
16545 "A type-specifier-seq shall not define a class or enumeration
16546 unless it appears in the type-id of an alias-declaration (7.1.3) that
16547 is not the declaration of a template-declaration."
16549 In other words, if we currently are in an alias template, the
16550 type-id should not define a type.
16552 So let's set parser->type_definition_forbidden_message in that
16553 case; cp_parser_check_type_definition (called by
16554 cp_parser_class_specifier) will then emit an error if a type is
16555 defined in the type-id. */
16557 {
16561 }
16565 /* Restore the error message if need be. */
16571 {
16574 }
16576 /* A typedef-name can also be introduced by an alias-declaration. The
16577 identifier following the using keyword becomes a typedef-name. It has
16578 the same semantics as if it were introduced by the typedef
16579 specifier. In particular, it does not define a new type and it shall
16580 not appear in the type-id. */
16585 {
16588 ds_attribute,
16589 attrs_token);
16590 }
16592 ds_typedef,
16593 using_token);
16595 ds_alias,
16596 using_token);
16605 else
16616 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16617 added into the symbol table; otherwise, return the TYPE_DECL. */
16621 {
16625 }
16628 }
16630 /* Parse a using-directive.
16632 using-directive:
16633 using namespace :: [opt] nested-name-specifier [opt]
16634 namespace-name ; */
16636 static void
16638 {
16639 tree namespace_decl;
16640 tree attribs;
16642 /* Look for the `using' keyword. */
16644 /* And the `namespace' keyword. */
16646 /* Look for the optional `::' operator. */
16648 /* And the optional nested-name-specifier. */
16654 /* Get the namespace being used. */
16656 /* And any specified attributes. */
16658 /* Update the symbol table. */
16660 /* Look for the final `;'. */
16662 }
16664 /* Parse an asm-definition.
16666 asm-definition:
16667 asm ( string-literal ) ;
16669 GNU Extension:
16671 asm-definition:
16672 asm volatile [opt] ( string-literal ) ;
16673 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16674 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16675 : asm-operand-list [opt] ) ;
16676 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16677 : asm-operand-list [opt]
16678 : asm-clobber-list [opt] ) ;
16679 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16680 : asm-clobber-list [opt]
16681 : asm-goto-list ) ; */
16683 static void
16685 {
16686 tree string;
16691 tree asm_stmt;
16699 /* Look for the `asm' keyword. */
16704 {
16707 }
16709 /* See if the next token is `volatile'. */
16712 {
16713 /* Remember that we saw the `volatile' keyword. */
16715 /* Consume the token. */
16717 }
16721 {
16722 /* Remember that we saw the `goto' keyword. */
16724 /* Consume the token. */
16726 }
16727 /* Look for the opening `('. */
16730 /* Look for the string. */
16733 {
16737 }
16739 /* If we're allowing GNU extensions, check for the extended assembly
16740 syntax. Unfortunately, the `:' tokens need not be separated by
16741 a space in C, and so, for compatibility, we tolerate that here
16742 too. Doing that means that we have to treat the `::' operator as
16743 two `:' tokens. */
16748 {
16753 /* The extended syntax was used. */
16756 /* Look for outputs. */
16758 {
16759 /* Consume the `:'. */
16761 /* Parse the output-operands. */
16763 CPP_COLON)
16765 CPP_SCOPE)
16767 CPP_CLOSE_PAREN)
16769 {
16773 }
16774 }
16775 /* If the next token is `::', there are no outputs, and the
16776 next token is the beginning of the inputs. */
16778 /* The inputs are coming next. */
16781 /* Look for inputs. */
16784 {
16785 /* Consume the `:' or `::'. */
16787 /* Parse the output-operands. */
16789 CPP_COLON)
16791 CPP_SCOPE)
16793 CPP_CLOSE_PAREN))
16794 {
16798 }
16799 }
16801 /* The clobbers are coming next. */
16804 /* Look for clobbers. */
16807 {
16809 /* Consume the `:' or `::'. */
16811 /* Parse the clobbers. */
16813 CPP_COLON)
16815 CPP_CLOSE_PAREN))
16817 }
16820 /* The labels are coming next. */
16823 /* Look for labels. */
16826 {
16828 /* Consume the `:' or `::'. */
16830 /* Parse the labels. */
16832 }
16836 }
16840 /* Look for the closing `)'. */
16848 {
16849 /* Create the ASM_EXPR. */
16851 {
16854 /* If the extended syntax was not used, mark the ASM_EXPR. */
16856 {
16862 }
16863 }
16864 else
16866 }
16867 }
16869 /* Declarators [gram.dcl.decl] */
16871 /* Parse an init-declarator.
16873 init-declarator:
16874 declarator initializer [opt]
16876 GNU Extension:
16878 init-declarator:
16879 declarator asm-specification [opt] attributes [opt] initializer [opt]
16881 function-definition:
16882 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16883 function-body
16884 decl-specifier-seq [opt] declarator function-try-block
16886 GNU Extension:
16888 function-definition:
16889 __extension__ function-definition
16891 TM Extension:
16893 function-definition:
16894 decl-specifier-seq [opt] declarator function-transaction-block
16896 The DECL_SPECIFIERS apply to this declarator. Returns a
16897 representation of the entity declared. If MEMBER_P is TRUE, then
16898 this declarator appears in a class scope. The new DECL created by
16899 this declarator is returned.
16901 The CHECKS are access checks that should be performed once we know
16902 what entity is being declared (and, therefore, what classes have
16903 befriended it).
16905 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16906 for a function-definition here as well. If the declarator is a
16907 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16908 be TRUE upon return. By that point, the function-definition will
16909 have been completely parsed.
16911 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16912 is FALSE.
16914 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16915 parsed declaration if it is an uninitialized single declarator not followed
16916 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16917 if present, will not be consumed. If returned, this declarator will be
16918 created with SD_INITIALIZED but will not call cp_finish_decl.
16920 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16921 and there is an initializer, the pointed location_t is set to the
16922 location of the '=' or `(', or '{' in C++11 token introducing the
16923 initializer. */
16925 static tree
16935 {
16939 tree prefix_attributes;
16941 tree asm_specification;
16942 tree initializer;
16944 tree scope;
16946 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16947 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16948 "(...)". */
16959 /* Gather the attributes that were provided with the
16960 decl-specifiers. */
16963 /* Assume that this is not the declarator for a function
16964 definition. */
16968 /* Default arguments are only permitted for function parameters. */
16972 /* Defer access checks while parsing the declarator; we cannot know
16973 what names are accessible until we know what is being
16974 declared. */
16977 /* Parse the declarator. */
16979 declarator
16984 /* Gather up the deferred checks. */
16989 /* If the DECLARATOR was erroneous, there's no need to go
16990 further. */
16994 /* Check that the number of template-parameter-lists is OK. */
17004 /* Figure out what scope the entity declared by the DECLARATOR is
17005 located in. `grokdeclarator' sometimes changes the scope, so
17006 we compute it now. */
17009 /* Perform any lookups in the declared type which were thought to be
17010 dependent, but are not in the scope of the declarator. */
17011 decl_specifiers->type
17014 /* If we're allowing GNU extensions, look for an
17015 asm-specification. */
17017 {
17018 /* Look for an asm-specification. */
17021 }
17022 else
17025 /* Look for attributes. */
17029 /* Peek at the next token. */
17035 {
17036 /* Check to see if the token indicates the start of a
17037 function-definition. */
17039 {
17041 {
17042 /* If a function-definition should not appear here, issue an
17043 error message. */
17047 }
17049 location_t func_brace_location
17052 /* Neither attributes nor an asm-specification are allowed
17053 on a function-definition. */
17056 "an asm-specification is not allowed "
17060 "attributes are not allowed "
17062 /* This is a function-definition. */
17065 /* Parse the function definition. */
17068 decl_specifiers,
17069 declarator,
17070 prefix_attributes);
17071 else
17072 decl =
17073 (cp_parser_function_definition_from_specifiers_and_declarator
17077 {
17078 /* This is where the prologue starts... */
17081 }
17084 }
17085 }
17087 {
17088 /* A non-template declaration involving a function parameter list
17089 containing an implicit template parameter will be made into a
17090 template. If the resulting declaration is not going to be an
17091 actual function then finish the template scope here to prevent it.
17092 An error message will be issued once we have a decl to talk about.
17094 FIXME probably we should do type deduction rather than create an
17095 implicit template, but the standard currently doesn't allow it. */
17098 }
17100 /* [dcl.dcl]
17102 Only in function declarations for constructors, destructors, and
17103 type conversions can the decl-specifier-seq be omitted.
17105 We explicitly postpone this check past the point where we handle
17106 function-definitions because we tolerate function-definitions
17107 that are missing their return types in some modes. */
17109 {
17113 }
17115 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17119 {
17130 {
17136 }
17137 }
17138 else
17139 {
17140 /* If the init-declarator isn't initialized and isn't followed by a
17141 `,' or `;', it's not a valid init-declarator. */
17144 {
17147 else
17148 {
17152 }
17153 }
17156 }
17158 /* Because start_decl has side-effects, we should only call it if we
17159 know we're going ahead. By this point, we know that we cannot
17160 possibly be looking at any other construct. */
17163 /* Enter the newly declared entry in the symbol table. If we're
17164 processing a declaration in a class-specifier, we wait until
17165 after processing the initializer. */
17167 {
17174 /* Adjust location of decl if declarator->id_loc is more appropriate:
17175 set, and decl wasn't merged with another decl, in which case its
17176 location would be different from input_location, and more accurate. */
17181 }
17183 /* Enter the SCOPE. That way unqualified names appearing in the
17184 initializer will be looked up in SCOPE. */
17187 /* Perform deferred access control checks, now that we know in which
17188 SCOPE the declared entity resides. */
17190 {
17193 /* If the entity being declared is a function, pretend that we
17194 are in its scope. If it is a `friend', it may have access to
17195 things that would not otherwise be accessible. */
17197 {
17200 }
17202 /* Perform access checks for template parameters. */
17205 /* Perform the access control checks for the declarator and the
17206 decl-specifiers. */
17209 /* Restore the saved value. */
17212 }
17214 /* Parse the initializer. */
17219 {
17221 {
17224 else
17225 {
17226 /* If the declaration was erroneous, we don't really
17227 know what the user intended, so just silently
17228 consume the initializer. */
17235 }
17236 }
17237 else
17238 {
17239 /* We want to record the extra mangling scope for in-class
17240 initializers of class members and initializers of static data
17241 member templates. The former involves deferring
17242 parsing of the initializer until end of class as with default
17243 arguments. So right here we only handle the latter. */
17253 }
17254 }
17256 /* The old parser allows attributes to appear after a parenthesized
17257 initializer. Mark Mitchell proposed removing this functionality
17258 on the GCC mailing lists on 2002-08-13. This parser accepts the
17259 attributes -- but ignores them. */
17266 /* And now complain about a non-function implicit template. */
17271 /* For an in-class declaration, use `grokfield' to create the
17272 declaration. */
17274 {
17276 {
17279 }
17287 }
17289 /* Finish processing the declaration. But, skip member
17290 declarations. */
17292 {
17295 asm_specification,
17296 /* If the initializer is in parentheses, then this is
17297 a direct-initialization, which means that an
17298 `explicit' constructor is OK. Otherwise, an
17299 `explicit' constructor cannot be used. */
17302 }
17305 /* Core issue #226 (C++0x only): A default template-argument
17306 shall not be specified in a friend class template
17307 declaration. */
17316 {
17319 else
17321 }
17324 }
17326 /* Parse a declarator.
17328 declarator:
17329 direct-declarator
17330 ptr-operator declarator
17332 abstract-declarator:
17333 ptr-operator abstract-declarator [opt]
17334 direct-abstract-declarator
17336 GNU Extensions:
17338 declarator:
17339 attributes [opt] direct-declarator
17340 attributes [opt] ptr-operator declarator
17342 abstract-declarator:
17343 attributes [opt] ptr-operator abstract-declarator [opt]
17344 attributes [opt] direct-abstract-declarator
17346 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17347 detect constructor, destructor or conversion operators. It is set
17348 to -1 if the declarator is a name, and +1 if it is a
17349 function. Otherwise it is set to zero. Usually you just want to
17350 test for >0, but internally the negative value is used.
17352 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17353 a decl-specifier-seq unless it declares a constructor, destructor,
17354 or conversion. It might seem that we could check this condition in
17355 semantic analysis, rather than parsing, but that makes it difficult
17356 to handle something like `f()'. We want to notice that there are
17357 no decl-specifiers, and therefore realize that this is an
17358 expression, not a declaration.)
17360 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17361 the declarator is a direct-declarator of the form "(...)".
17363 MEMBER_P is true iff this declarator is a member-declarator.
17365 FRIEND_P is true iff this declarator is a friend. */
17369 cp_parser_declarator_kind dcl_kind,
17373 {
17376 cp_cv_quals cv_quals;
17377 tree class_type;
17380 /* Assume this is not a constructor, destructor, or type-conversion
17381 operator. */
17388 /* Check for the ptr-operator production. */
17390 /* Parse the ptr-operator. */
17396 /* If that worked, then we have a ptr-operator. */
17398 {
17399 /* If a ptr-operator was found, then this declarator was not
17400 parenthesized. */
17403 /* The dependent declarator is optional if we are parsing an
17404 abstract-declarator. */
17408 /* Parse the dependent declarator. */
17413 friend_p);
17415 /* If we are parsing an abstract-declarator, we must handle the
17416 case where the dependent declarator is absent. */
17421 declarator = cp_parser_make_indirect_declarator
17423 }
17424 /* Everything else is a direct-declarator. */
17425 else
17426 {
17429 CPP_OPEN_PAREN);
17431 ctor_dtor_or_conv_p,
17433 }
17438 }
17440 /* Parse a direct-declarator or direct-abstract-declarator.
17442 direct-declarator:
17443 declarator-id
17444 direct-declarator ( parameter-declaration-clause )
17445 cv-qualifier-seq [opt]
17446 ref-qualifier [opt]
17447 exception-specification [opt]
17448 direct-declarator [ constant-expression [opt] ]
17449 ( declarator )
17451 direct-abstract-declarator:
17452 direct-abstract-declarator [opt]
17453 ( parameter-declaration-clause )
17454 cv-qualifier-seq [opt]
17455 ref-qualifier [opt]
17456 exception-specification [opt]
17457 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17458 ( abstract-declarator )
17460 Returns a representation of the declarator. DCL_KIND is
17461 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17462 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17463 we are parsing a direct-declarator. It is
17464 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17465 of ambiguity we prefer an abstract declarator, as per
17466 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17467 as for cp_parser_declarator. */
17471 cp_parser_declarator_kind dcl_kind,
17474 {
17484 {
17485 /* Peek at the next token. */
17488 {
17489 /* This is either a parameter-declaration-clause, or a
17490 parenthesized declarator. When we know we are parsing a
17491 named declarator, it must be a parenthesized declarator
17492 if FIRST is true. For instance, `(int)' is a
17493 parameter-declaration-clause, with an omitted
17494 direct-abstract-declarator. But `((*))', is a
17495 parenthesized abstract declarator. Finally, when T is a
17496 template parameter `(T)' is a
17497 parameter-declaration-clause, and not a parenthesized
17498 named declarator.
17500 We first try and parse a parameter-declaration-clause,
17501 and then try a nested declarator (if FIRST is true).
17503 It is not an error for it not to be a
17504 parameter-declaration-clause, even when FIRST is
17505 false. Consider,
17507 int i (int);
17508 int i (3);
17510 The first is the declaration of a function while the
17511 second is the definition of a variable, including its
17512 initializer.
17514 Having seen only the parenthesis, we cannot know which of
17515 these two alternatives should be selected. Even more
17516 complex are examples like:
17518 int i (int (a));
17519 int i (int (3));
17521 The former is a function-declaration; the latter is a
17522 variable initialization.
17524 Thus again, we try a parameter-declaration-clause, and if
17525 that fails, we back out and return. */
17528 {
17529 tree params;
17532 /* In a member-declarator, the only valid interpretation
17533 of a parenthesis is the start of a
17534 parameter-declaration-clause. (It is invalid to
17535 initialize a static data member with a parenthesized
17536 initializer; only the "=" form of initialization is
17537 permitted.) */
17541 /* Consume the `('. */
17544 {
17545 /* If this is going to be an abstract declarator, we're
17546 in a declarator and we can't have default args. */
17549 }
17553 /* Parse the parameter-declaration-clause. */
17556 /* Consume the `)'. */
17559 /* If all went well, parse the cv-qualifier-seq,
17560 ref-qualifier and the exception-specification. */
17562 {
17563 cp_cv_quals cv_quals;
17564 cp_virt_specifiers virt_specifiers;
17565 cp_ref_qualifier ref_qual;
17566 tree exception_specification;
17567 tree late_return;
17568 tree attrs;
17578 /* Parse the cv-qualifier-seq. */
17580 /* Parse the ref-qualifier. */
17582 /* And the exception-specification. */
17583 exception_specification
17588 /* In here, we handle cases where attribute is used after
17589 the function declaration. For example:
17590 void func (int x) __attribute__((vector(..))); */
17593 {
17597 CPP_SEMICOLON)
17599 CPP_OPEN_BRACE))
17602 ;
17603 else
17605 }
17606 late_return = (cp_parser_late_return_type_opt
17611 /* Parse the virt-specifier-seq. */
17614 /* Create the function-declarator. */
17616 params,
17617 cv_quals,
17618 virt_specifiers,
17619 ref_qual,
17620 exception_specification,
17621 late_return);
17623 /* Any subsequent parameter lists are to do with
17624 return type, so are not those of the declared
17625 function. */
17627 }
17629 /* Remove the function parms from scope. */
17633 /* Repeat the main loop. */
17635 }
17637 /* If this is the first, we can try a parenthesized
17638 declarator. */
17640 {
17646 /* Consume the `('. */
17648 /* Parse the nested declarator. */
17651 declarator
17657 /* Expect a `)'. */
17664 }
17665 /* Otherwise, we must be done. */
17666 else
17668 }
17672 {
17673 /* Parse an array-declarator. */
17682 /* Consume the `['. */
17684 /* Peek at the next token. */
17686 /* If the next token is `]', then there is no
17687 constant-expression. */
17689 {
17692 bounds
17702 {
17703 /* Normally, the array bound must be an integral constant
17704 expression. However, as an extension, we allow VLAs
17705 in function scopes as long as they aren't part of a
17706 parameter declaration. */
17710 }
17713 {
17714 /* Remember this wasn't a constant-expression. */
17717 }
17718 }
17719 else
17721 /* Look for the closing `]'. */
17723 {
17726 }
17731 }
17733 {
17734 {
17735 tree qualifying_scope;
17736 tree unqualified_name;
17737 tree attrs;
17738 special_function_kind sfk;
17743 /* Parse a declarator-id */
17746 {
17749 /* If we see an ellipsis, we should be looking at a
17750 parameter pack. */
17752 {
17753 /* Consume the `...' */
17757 }
17758 }
17761 unqualified_name
17765 {
17769 {
17770 /* Check whether an error occurred. */
17773 /* We already consumed the ellipsis to mark a
17774 parameter pack, but we have no way to report it,
17775 so abort the tentative parse. We will be exiting
17776 immediately anyway. */
17778 }
17779 else
17785 && (qualifying_scope
17787 {
17790 }
17791 }
17796 {
17801 }
17807 {
17808 /* In the declaration of a member of a template class
17809 outside of the class itself, the SCOPE will sometimes
17810 be a TYPENAME_TYPE. For example, given:
17812 template <typename T>
17813 int S<T>::R::i = 3;
17815 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17816 this context, we must resolve S<T>::R to an ordinary
17817 type, rather than a typename type.
17819 The reason we normally avoid resolving TYPENAME_TYPEs
17820 is that a specialization of `S' might render
17821 `S<T>::R' not a type. However, if `S' is
17822 specialized, then this `i' will not be used, so there
17823 is no harm in resolving the types here. */
17824 tree type;
17826 /* Resolve the TYPENAME_TYPE. */
17829 /* If that failed, the declarator is invalid. */
17831 {
17834 "cannot define member of dependent typedef "
17836 else
17841 }
17843 }
17848 {
17849 tree class_type;
17854 else
17858 {
17861 {
17864 {
17868 "use %<%T::%D%> instead of %<%T::%D%> to "
17870 class_type,
17875 }
17876 else
17878 }
17879 else
17880 {
17881 /* We do not attempt to print the declarator
17882 here because we do not have enough
17883 information about its original syntactic
17884 form. */
17888 }
17889 }
17892 {
17898 for an anonymous type, even if the type
17899 got a name for linkage purposes. */
17901 /* Handle correctly (c++/19200):
17903 struct S {
17904 struct T{};
17905 friend void S(T);
17906 };
17908 and also:
17910 namespace N {
17911 void S();
17912 }
17914 struct S {
17915 friend void N::S();
17916 }; */
17917 && !(friend_p
17920 class_type))
17921 {
17924 }
17932 }
17933 }
17935 unqualified_name,
17936 sfk);
17943 }
17945 handle_declarator:;
17948 {
17949 /* Any names that appear after the declarator-id for a
17950 member are looked up in the containing scope. */
17952 {
17953 /* But declarations with qualified-ids can't appear in a
17954 function. */
17958 }
17960 }
17964 /* Default args are only allowed on function
17965 declarations. */
17967 else
17971 }
17972 /* We're done. */
17973 else
17975 }
17977 /* For an abstract declarator, we might wind up with nothing at this
17978 point. That's an error; the declarator is not optional. */
17982 /* If we entered a scope, we must exit it now. */
17990 }
17992 /* Parse a ptr-operator.
17994 ptr-operator:
17995 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17996 * cv-qualifier-seq [opt]
17997 &
17998 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17999 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18001 GNU Extension:
18003 ptr-operator:
18004 & cv-qualifier-seq [opt]
18006 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18007 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18008 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18009 filled in with the TYPE containing the member. *CV_QUALS is
18010 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18011 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18012 Note that the tree codes returned by this function have nothing
18013 to do with the types of trees that will be eventually be created
18014 to represent the pointer or reference type being parsed. They are
18015 just constants with suggestive names. */
18016 static enum tree_code
18021 {
18026 /* Assume that it's not a pointer-to-member. */
18028 /* And that there are no cv-qualifiers. */
18031 /* Peek at the next token. */
18034 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18044 {
18045 /* Consume the `*', `&' or `&&'. */
18048 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18049 `&', if we are allowing GNU extensions. (The only qualifier
18050 that can legally appear after `&' is `restrict', but that is
18051 enforced during semantic analysis. */
18059 }
18060 else
18061 {
18062 /* Try the pointer-to-member case. */
18064 /* Look for the optional `::' operator. */
18067 /* Look for the nested-name specifier. */
18074 /* If we found it, and the next token is a `*', then we are
18075 indeed looking at a pointer-to-member operator. */
18078 {
18079 /* Indicate that the `*' operator was used. */
18087 else
18088 {
18089 /* The type of which the member is a member is given by the
18090 current SCOPE. */
18092 /* The next name will not be qualified. */
18096 /* Look for optional c++11 attributes. */
18100 /* Look for the optional cv-qualifier-seq. */
18102 }
18103 }
18104 /* If that didn't work we don't have a ptr-operator. */
18107 }
18110 }
18112 /* Parse an (optional) cv-qualifier-seq.
18114 cv-qualifier-seq:
18115 cv-qualifier cv-qualifier-seq [opt]
18117 cv-qualifier:
18118 const
18119 volatile
18121 GNU Extension:
18123 cv-qualifier:
18124 __restrict__
18126 Returns a bitmask representing the cv-qualifiers. */
18128 static cp_cv_quals
18130 {
18134 {
18136 cp_cv_quals cv_qualifier;
18138 /* Peek at the next token. */
18140 /* See if it's a cv-qualifier. */
18142 {
18158 }
18164 {
18167 }
18168 else
18169 {
18172 }
18173 }
18176 }
18178 /* Parse an (optional) ref-qualifier
18180 ref-qualifier:
18181 &
18182 &&
18184 Returns cp_ref_qualifier representing ref-qualifier. */
18186 static cp_ref_qualifier
18188 {
18191 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18196 {
18201 {
18213 }
18218 {
18221 }
18222 else
18223 {
18226 }
18227 }
18230 }
18232 /* Parse an (optional) virt-specifier-seq.
18234 virt-specifier-seq:
18235 virt-specifier virt-specifier-seq [opt]
18237 virt-specifier:
18238 override
18239 final
18241 Returns a bitmask representing the virt-specifiers. */
18243 static cp_virt_specifiers
18245 {
18249 {
18251 cp_virt_specifiers virt_specifier;
18253 /* Peek at the next token. */
18255 /* See if it's a virt-specifier-qualifier. */
18259 {
18262 }
18264 {
18267 }
18269 {
18271 }
18272 else
18276 {
18279 }
18280 else
18281 {
18284 }
18285 }
18287 }
18289 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18290 is in scope even though it isn't real. */
18292 void
18294 {
18295 tree this_parm;
18298 {
18299 /* We don't clear this between NSDMIs. Is it already what we want? */
18304 }
18307 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18309 current_class_ref
18312 }
18314 /* Return true iff our current scope is a non-static data member
18315 initializer. */
18317 bool
18319 {
18320 /* We recognize NSDMI context by the context-less 'this' pointer set up
18321 by the function above. */
18327 }
18329 /* Parse a late-specified return type, if any. This is not a separate
18330 non-terminal, but part of a function declarator, which looks like
18332 -> trailing-type-specifier-seq abstract-declarator(opt)
18334 Returns the type indicated by the type-id.
18336 In addition to this this parses any queued up omp declare simd
18337 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18339 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18340 function. */
18342 static tree
18344 cp_cv_quals quals)
18345 {
18349 && declarator
18355 /* Peek at the next token. */
18357 /* A late-specified return type is indicated by an initial '->'. */
18364 {
18365 /* DR 1207: 'this' is in scope in the trailing return type. */
18367 }
18370 {
18371 /* Consume the ->. */
18375 }
18378 declarator->std_attributes
18382 declarator->std_attributes
18387 {
18390 }
18393 }
18395 /* Parse a declarator-id.
18397 declarator-id:
18398 id-expression
18399 :: [opt] nested-name-specifier [opt] type-name
18401 In the `id-expression' case, the value returned is as for
18402 cp_parser_id_expression if the id-expression was an unqualified-id.
18403 If the id-expression was a qualified-id, then a SCOPE_REF is
18404 returned. The first operand is the scope (either a NAMESPACE_DECL
18405 or TREE_TYPE), but the second is still just a representation of an
18406 unqualified-id. */
18408 static tree
18410 {
18411 tree id;
18412 /* The expression must be an id-expression. Assume that qualified
18413 names are the names of types so that:
18415 template <class T>
18416 int S<T>::R::i = 3;
18418 will work; we must treat `S<T>::R' as the name of a type.
18419 Similarly, assume that qualified names are templates, where
18420 required, so that:
18422 template <class T>
18423 int S<T>::R<T>::i = 3;
18425 will work, too. */
18431 optional_p);
18435 }
18437 /* Parse a type-id.
18439 type-id:
18440 type-specifier-seq abstract-declarator [opt]
18442 Returns the TYPE specified. */
18444 static tree
18447 {
18448 cp_decl_specifier_seq type_specifier_seq;
18451 /* Parse the type-specifier-seq. */
18453 is_trailing_return,
18458 /* There might or might not be an abstract declarator. */
18460 /* Look for the declarator. */
18461 abstract_declarator
18466 /* Check to see if there really was a declarator. */
18471 /* None of the valid uses of 'auto' in C++14 involve the type-id
18472 nonterminal, but it is valid in a trailing-return-type. */
18475 {
18476 /* A type-id with type 'auto' is only ok if the abstract declarator
18477 is a function declarator with a late-specified return type. */
18482 else
18483 {
18486 }
18487 }
18490 is_template_arg);
18491 }
18494 {
18496 }
18499 {
18500 tree r;
18502 parser->type_definition_forbidden_message
18507 {
18510 }
18512 }
18515 {
18517 }
18519 /* Parse a type-specifier-seq.
18521 type-specifier-seq:
18522 type-specifier type-specifier-seq [opt]
18524 GNU extension:
18526 type-specifier-seq:
18527 attributes type-specifier-seq [opt]
18529 If IS_DECLARATION is true, we are at the start of a "condition" or
18530 exception-declaration, so we might be followed by a declarator-id.
18532 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18533 i.e. we've just seen "->".
18535 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18537 static void
18542 {
18547 /* Clear the TYPE_SPECIFIER_SEQ. */
18550 /* In the context of a trailing return type, enum E { } is an
18551 elaborated-type-specifier followed by a function-body, not an
18552 enum-specifier. */
18556 /* Parse the type-specifiers and attributes. */
18558 {
18559 tree type_specifier;
18562 /* Check for attributes first. */
18564 {
18569 }
18571 /* record the token of the beginning of the type specifier seq,
18572 for error reporting purposes*/
18576 /* Look for the type-specifier. */
18578 flags,
18579 type_specifier_seq,
18581 NULL,
18584 {
18585 /* If the first type-specifier could not be found, this is not a
18586 type-specifier-seq at all. */
18588 {
18589 /* Set in_declarator_p to avoid skipping to the semicolon. */
18601 }
18602 /* If subsequent type-specifiers could not be found, the
18603 type-specifier-seq is complete. */
18605 }
18608 /* The standard says that a condition can be:
18610 type-specifier-seq declarator = assignment-expression
18612 However, given:
18614 struct S {};
18615 if (int S = ...)
18617 we should treat the "S" as a declarator, not as a
18618 type-specifier. The standard doesn't say that explicitly for
18619 type-specifier-seq, but it does say that for
18620 decl-specifier-seq in an ordinary declaration. Perhaps it
18621 would be clearer just to allow a decl-specifier-seq here, and
18622 then add a semantic restriction that if any decl-specifiers
18623 that are not type-specifiers appear, the program is invalid. */
18626 }
18627 }
18629 /* Return whether the function currently being declared has an associated
18630 template parameter list. */
18632 static bool
18634 {
18647 }
18649 /* Parse a parameter-declaration-clause.
18651 parameter-declaration-clause:
18652 parameter-declaration-list [opt] ... [opt]
18653 parameter-declaration-list , ...
18655 Returns a representation for the parameter declarations. A return
18656 value of NULL indicates a parameter-declaration-clause consisting
18657 only of an ellipsis. */
18659 static tree
18661 {
18662 tree parameters;
18671 parser->auto_is_implicit_function_template_parm_p
18673 }
18679 && !processing_template_parmlist
18685 /* Peek at the next token. */
18687 /* Check for trivial parameter-declaration-clauses. */
18689 {
18690 /* Consume the `...' token. */
18693 }
18695 /* There are no parameters. */
18696 {
18697 #ifndef NO_IMPLICIT_EXTERN_C
18702 else
18703 #endif
18705 }
18706 /* Check for `(void)', too, which is a special case. */
18710 {
18711 /* Consume the `void' token. */
18713 /* There are no parameters. */
18715 }
18717 /* Parse the parameter-declaration-list. */
18719 /* If a parse error occurred while parsing the
18720 parameter-declaration-list, then the entire
18721 parameter-declaration-clause is erroneous. */
18725 /* Peek at the next token. */
18727 /* If it's a `,', the clause should terminate with an ellipsis. */
18729 {
18730 /* Consume the `,'. */
18732 /* Expect an ellipsis. */
18733 ellipsis_p
18735 }
18736 /* It might also be `...' if the optional trailing `,' was
18737 omitted. */
18739 {
18740 /* Consume the `...' token. */
18742 /* And remember that we saw it. */
18744 }
18745 else
18748 /* Finish the parameter list. */
18753 }
18755 /* Parse a parameter-declaration-list.
18757 parameter-declaration-list:
18758 parameter-declaration
18759 parameter-declaration-list , parameter-declaration
18761 Returns a representation of the parameter-declaration-list, as for
18762 cp_parser_parameter_declaration_clause. However, the
18763 `void_list_node' is never appended to the list. Upon return,
18764 *IS_ERROR will be true iff an error occurred. */
18766 static tree
18768 {
18774 /* Assume all will go well. */
18776 /* The special considerations that apply to a function within an
18777 unbraced linkage specifications do not apply to the parameters
18778 to the function. */
18779 saved_in_unbraced_linkage_specification_p
18783 /* Look for more parameters. */
18785 {
18793 /* Parse the parameter. */
18794 parameter
18799 /* We don't know yet if the enclosing context is deprecated, so wait
18800 and warn in grokparms if appropriate. */
18804 {
18805 /* If a function parameter pack was specified and an implicit template
18806 parameter was introduced during cp_parser_parameter_declaration,
18807 change any implicit parameters introduced into packs. */
18811 {
18819 }
18823 PARM,
18826 }
18830 /* If a parse error occurred parsing the parameter declaration,
18831 then the entire parameter-declaration-list is erroneous. */
18833 {
18837 }
18847 {
18851 }
18853 /* Add the new parameter to the list. */
18857 /* Peek at the next token. */
18860 /* These are for Objective-C++ */
18863 /* The parameter-declaration-list is complete. */
18866 {
18869 /* Peek at the next token. */
18871 /* If it's an ellipsis, then the list is complete. */
18874 /* Otherwise, there must be more parameters. Consume the
18875 `,'. */
18877 /* When parsing something like:
18879 int i(float f, double d)
18881 we can tell after seeing the declaration for "f" that we
18882 are not looking at an initialization of a variable "i",
18883 but rather at the declaration of a function "i".
18885 Due to the fact that the parsing of template arguments
18886 (as specified to a template-id) requires backtracking we
18887 cannot use this technique when inside a template argument
18888 list. */
18892 /* However, a parameter-declaration of the form
18893 "float(f)" (which is a valid declaration of a
18894 parameter "f") can also be interpreted as an
18895 expression (the conversion of "f" to "float"). */
18898 }
18899 else
18900 {
18908 }
18909 }
18911 parser->in_unbraced_linkage_specification_p
18914 /* Reset implicit_template_scope if we are about to leave the function
18915 parameter list that introduced it. Note that for out-of-line member
18916 definitions, there will be one or more class scopes before we get to
18917 the template parameter scope. */
18921 {
18925 {
18928 }
18929 }
18932 }
18934 /* Parse a parameter declaration.
18936 parameter-declaration:
18937 decl-specifier-seq ... [opt] declarator
18938 decl-specifier-seq declarator = assignment-expression
18939 decl-specifier-seq ... [opt] abstract-declarator [opt]
18940 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18942 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18943 declares a template parameter. (In that case, a non-nested `>'
18944 token encountered during the parsing of the assignment-expression
18945 is not interpreted as a greater-than operator.)
18947 Returns a representation of the parameter, or NULL if an error
18948 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18949 true iff the declarator is of the form "(p)". */
18955 {
18957 cp_decl_specifier_seq decl_specifiers;
18959 tree default_argument;
18963 /* In a template parameter, `>' is not an operator.
18965 [temp.param]
18967 When parsing a default template-argument for a non-type
18968 template-parameter, the first non-nested `>' is taken as the end
18969 of the template parameter-list rather than a greater-than
18970 operator. */
18972 /* Type definitions may not appear in parameter types. */
18974 parser->type_definition_forbidden_message
18977 /* Parse the declaration-specifiers. */
18979 CP_PARSER_FLAGS_NONE,
18983 /* Complain about missing 'typename' or other invalid type names. */
18988 /* If an error occurred, there's no reason to attempt to parse the
18989 rest of the declaration. */
18991 {
18994 }
18996 /* Peek at the next token. */
18999 /* If the next token is a `)', `,', `=', `>', or `...', then there
19000 is no declarator. However, when variadic templates are enabled,
19001 there may be a declarator following `...'. */
19006 {
19010 }
19011 /* Otherwise, there should be a declarator. */
19012 else
19013 {
19017 /* After seeing a decl-specifier-seq, if the next token is not a
19018 "(", there is no possibility that the code is a valid
19019 expression. Therefore, if parsing tentatively, we commit at
19020 this point. */
19022 /* In an expression context, having seen:
19024 (int((char ...
19026 we cannot be sure whether we are looking at a
19027 function-type (taking a "char" as a parameter) or a cast
19028 of some object of type "char" to "int". */
19034 /* Parse the declarator. */
19037 CP_PARSER_DECLARATOR_EITHER,
19039 parenthesized_p,
19043 /* After the declarator, allow more attributes. */
19044 decl_specifiers.attributes
19047 }
19049 /* If the next token is an ellipsis, and we have not seen a
19050 declarator name, and the type of the declarator contains parameter
19051 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19052 a parameter pack expansion expression. Otherwise, leave the
19053 ellipsis for a C-style variadic function. */
19056 {
19067 {
19068 /* Consume the `...'. */
19072 /* Build a pack expansion type */
19075 else
19077 }
19078 }
19080 /* The restriction on defining new types applies only to the type
19081 of the parameter, not to the default argument. */
19084 /* If the next token is `=', then process a default argument. */
19086 {
19088 /* If we are defining a class, then the tokens that make up the
19089 default argument must be saved and processed later. */
19094 /* Outside of a class definition, we can just parse the
19095 assignment-expression. */
19096 else
19097 default_argument
19101 {
19104 else
19105 {
19107 "default arguments are only "
19110 }
19111 }
19115 {
19116 /* Find the name of the parameter pack. */
19123 template_parm_p
19129 else
19131 template_parm_p
19138 }
19139 }
19140 else
19144 declarator,
19145 default_argument);
19146 }
19148 /* Parse a default argument and return it.
19150 TEMPLATE_PARM_P is true if this is a default argument for a
19151 non-type template parameter. */
19152 static tree
19154 {
19160 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19161 set correctly. */
19164 /* Local variable names (and the `this' keyword) may not
19165 appear in a default argument. */
19168 /* Parse the assignment-expression. */
19173 /* The "this" pointer is not valid in a default argument. */
19175 {
19180 }
19181 default_argument
19183 /* Restore the "this" pointer. */
19185 {
19188 }
19197 }
19199 /* Parse a function-body.
19201 function-body:
19202 compound_statement */
19204 static void
19206 {
19208 }
19210 /* Parse a ctor-initializer-opt followed by a function-body. Return
19211 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19212 is true we are parsing a function-try-block. */
19214 static bool
19217 {
19225 /* Begin the function body. */
19227 /* Parse the optional ctor-initializer. */
19230 /* If we're parsing a constexpr constructor definition, we need
19231 to check that the constructor body is indeed empty. However,
19232 before we get to cp_parser_function_body lot of junk has been
19233 generated, so we can't just check that we have an empty block.
19234 Rather we take a snapshot of the outermost block, and check whether
19235 cp_parser_function_body changed its state. */
19237 {
19241 }
19242 /* Parse the function-body. */
19246 /* Finish the function body. */
19250 }
19252 /* Parse an initializer.
19254 initializer:
19255 = initializer-clause
19256 ( expression-list )
19258 Returns an expression representing the initializer. If no
19259 initializer is present, NULL_TREE is returned.
19261 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19262 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19263 set to TRUE if there is no initializer present. If there is an
19264 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19265 is set to true; otherwise it is set to false. */
19267 static tree
19270 {
19272 tree init;
19274 /* Peek at the next token. */
19277 /* Let our caller know whether or not this initializer was
19278 parenthesized. */
19280 /* Assume that the initializer is constant. */
19284 {
19285 /* Consume the `='. */
19287 /* Parse the initializer-clause. */
19289 }
19291 {
19296 non_constant_p);
19301 }
19303 {
19308 }
19309 else
19310 {
19311 /* Anything else is an error. */
19314 }
19317 }
19319 /* Parse an initializer-clause.
19321 initializer-clause:
19322 assignment-expression
19323 braced-init-list
19325 Returns an expression representing the initializer.
19327 If the `assignment-expression' production is used the value
19328 returned is simply a representation for the expression.
19330 Otherwise, calls cp_parser_braced_list. */
19332 static tree
19334 {
19335 tree initializer;
19337 /* Assume the expression is constant. */
19340 /* If it is not a `{', then we are looking at an
19341 assignment-expression. */
19343 initializer
19346 non_constant_p);
19347 else
19351 }
19353 /* Parse a brace-enclosed initializer list.
19355 braced-init-list:
19356 { initializer-list , [opt] }
19357 { }
19359 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19360 the elements of the initializer-list (or NULL, if the last
19361 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19362 NULL_TREE. There is no way to detect whether or not the optional
19363 trailing `,' was provided. NON_CONSTANT_P is as for
19364 cp_parser_initializer. */
19366 static tree
19368 {
19369 tree initializer;
19371 /* Consume the `{' token. */
19373 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19375 /* If it's not a `}', then there is a non-trivial initializer. */
19377 {
19378 /* Parse the initializer list. */
19381 /* A trailing `,' token is allowed. */
19384 }
19385 else
19387 /* Now, there should be a trailing `}'. */
19391 }
19393 /* Consume tokens up to, and including, the next non-nested closing `]'.
19394 Returns true iff we found a closing `]'. */
19396 static bool
19398 {
19402 {
19406 {
19409 /* If we've run out of tokens, then there is no closing `]'. */
19418 {
19421 }
19426 }
19428 /* Consume the token. */
19430 }
19431 }
19433 /* Return true if we are looking at an array-designator, false otherwise. */
19435 static bool
19437 {
19438 /* Consume the `['. */
19443 /* Skip tokens until the next token is a closing square bracket.
19444 If we find the closing `]', and the next token is a `=', then
19445 we are looking at an array designator. */
19446 bool array_designator_p
19450 /* Roll back the tokens we skipped. */
19454 }
19456 /* Parse an initializer-list.
19458 initializer-list:
19459 initializer-clause ... [opt]
19460 initializer-list , initializer-clause ... [opt]
19462 GNU Extension:
19464 initializer-list:
19465 designation initializer-clause ...[opt]
19466 initializer-list , designation initializer-clause ...[opt]
19468 designation:
19469 . identifier =
19470 identifier :
19471 [ constant-expression ] =
19473 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19474 for the initializer. If the INDEX of the elt is non-NULL, it is the
19475 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19476 as for cp_parser_initializer. */
19480 {
19483 /* Assume all of the expressions are constant. */
19486 /* Parse the rest of the list. */
19488 {
19490 tree designator;
19491 tree initializer;
19494 /* If the next token is an identifier and the following one is a
19495 colon, we are looking at the GNU designated-initializer
19496 syntax. */
19500 {
19501 /* Warn the user that they are using an extension. */
19504 /* Consume the identifier. */
19506 /* Consume the `:'. */
19508 }
19509 /* Also handle the C99 syntax, '. id ='. */
19514 {
19515 /* Warn the user that they are using an extension. */
19518 /* Consume the `.'. */
19520 /* Consume the identifier. */
19522 /* Consume the `='. */
19524 }
19525 /* Also handle C99 array designators, '[ const ] ='. */
19529 {
19530 /* In C++11, [ could start a lambda-introducer. */
19536 {
19539 }
19540 else
19541 {
19546 }
19552 }
19553 else
19556 /* Parse the initializer. */
19559 /* If any clause is non-constant, so is the entire initializer. */
19563 /* If we have an ellipsis, this is an initializer pack
19564 expansion. */
19566 {
19567 /* Consume the `...'. */
19570 /* Turn the initializer into an initializer expansion. */
19572 }
19574 /* Add it to the vector. */
19577 /* If the next token is not a comma, we have reached the end of
19578 the list. */
19582 /* Peek at the next token. */
19584 /* If the next token is a `}', then we're still done. An
19585 initializer-clause can have a trailing `,' after the
19586 initializer-list and before the closing `}'. */
19590 /* Consume the `,' token. */
19592 }
19595 }
19597 /* Classes [gram.class] */
19599 /* Parse a class-name.
19601 class-name:
19602 identifier
19603 template-id
19605 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19606 to indicate that names looked up in dependent types should be
19607 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19608 keyword has been used to indicate that the name that appears next
19609 is a template. TAG_TYPE indicates the explicit tag given before
19610 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19611 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19612 is the class being defined in a class-head. If ENUM_OK is TRUE,
19613 enum-names are also accepted.
19615 Returns the TYPE_DECL representing the class. */
19617 static tree
19626 {
19627 tree decl;
19628 tree scope;
19633 /* All class-names start with an identifier. */
19636 {
19639 }
19641 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19642 to a template-id, so we save it here. */
19647 /* Any name names a type if we're following the `typename' keyword
19648 in a qualified name where the enclosing scope is type-dependent. */
19651 /* Handle the common case (an identifier, but not a template-id)
19652 efficiently. */
19655 {
19659 /* Look for the identifier. */
19663 /* If the next token isn't an identifier, we are certainly not
19664 looking at a class-name. */
19667 /* If we know this is a type-name, there's no need to look it
19668 up. */
19671 else
19672 {
19673 tree ambiguous_decls;
19674 /* If we already know that this lookup is ambiguous, then
19675 we've already issued an error message; there's no reason
19676 to check again. */
19678 {
19681 }
19682 /* If the next token is a `::', then the name must be a type
19683 name.
19685 [basic.lookup.qual]
19687 During the lookup for a name preceding the :: scope
19688 resolution operator, object, function, and enumerator
19689 names are ignored. */
19692 /* Look up the name. */
19694 tag_type,
19697 check_dependency_p,
19701 {
19705 }
19706 }
19707 }
19708 else
19709 {
19710 /* Try a template-id. */
19712 check_dependency_p,
19713 tag_type,
19714 is_declaration);
19717 }
19721 /* If this is a typename, create a TYPENAME_TYPE. */
19723 {
19728 }
19732 /* Check to see that it is really the name of a class. */
19736 /* Situations like this:
19738 template <typename T> struct A {
19739 typename T::template X<int>::I i;
19740 };
19742 are problematic. Is `T::template X<int>' a class-name? The
19743 standard does not seem to be definitive, but there is no other
19744 valid interpretation of the following `::'. Therefore, those
19745 names are considered class-names. */
19746 {
19750 }
19755 /* In Objective-C 2.0, a classname followed by '.' starts a
19756 dot-syntax expression, and it's not a type-name. */
19768 }
19770 /* Parse a class-specifier.
19772 class-specifier:
19773 class-head { member-specification [opt] }
19775 Returns the TREE_TYPE representing the class. */
19777 static tree
19779 {
19780 tree type;
19794 /* Parse the class-head. */
19797 /* If the class-head was a semantic disaster, skip the entire body
19798 of the class. */
19800 {
19804 }
19806 /* Look for the `{'. */
19808 {
19811 }
19815 /* Issue an error message if type-definitions are forbidden here. */
19817 /* Remember that we are defining one more class. */
19819 /* Inside the class, surrounding template-parameter-lists do not
19820 apply. */
19821 saved_num_template_parameter_lists
19824 /* We are not in a function body. */
19827 /* Or in a loop. */
19830 /* Or in a switch. */
19833 /* We are not immediately inside an extern "lang" block. */
19834 saved_in_unbraced_linkage_specification_p
19838 /* Start the class. */
19840 {
19843 }
19847 /* If the type is erroneous, skip the entire body of the class. */
19849 else
19850 /* Parse the member-specification. */
19853 /* Look for the trailing `}'. */
19855 /* Look for trailing attributes to apply to this class. */
19863 /* We've finished a type definition. Check for the common syntax
19864 error of forgetting a semicolon after the definition. We need to
19865 be careful, as we can't just check for not-a-semicolon and be done
19866 with it; the user might have typed:
19868 class X { } c = ...;
19869 class X { } *p = ...;
19871 and so forth. Instead, enumerate all the possible tokens that
19872 might follow this production; if we don't see one of them, then
19873 complain and silently insert the semicolon. */
19874 {
19879 /* Don't try to parse c++11 attributes here. As per the
19880 grammar, that should be a task for
19881 cp_parser_decl_specifier_seq. */
19885 {
19896 /* While it's legal for type qualifiers and storage class
19897 specifiers to follow type definitions in the grammar, only
19898 compiler testsuites contain code like that. Assume that if
19899 we see such code, then what we're really seeing is a case
19900 like:
19902 class X { }
19903 const <type> var = ...;
19905 or
19907 class Y { }
19908 static <type> func (...) ...
19910 i.e. the qualifier or specifier applies to the next
19911 declaration. To do so, however, we need to look ahead one
19912 more token to see if *that* token is a type specifier.
19914 This code could be improved to handle:
19916 class Z { }
19917 static const <type> var = ...; */
19920 {
19923 /* Handling user-defined types here would be nice, but very
19924 tricky. */
19925 want_semicolon
19928 }
19932 }
19934 /* If we don't have a type, then something is very wrong and we
19935 shouldn't try to do anything clever. Likewise for not seeing the
19936 closing brace. */
19938 {
19939 cp_token_position prev
19950 else
19953 /* Unget one token and smash it to look as though we encountered
19954 a semicolon in the input stream. */
19959 }
19960 }
19962 /* If this class is not itself within the scope of another class,
19963 then we need to parse the bodies of all of the queued function
19964 definitions. Note that the queued functions defined in a class
19965 are not always processed immediately following the
19966 class-specifier for that class. Consider:
19968 struct A {
19969 struct B { void f() { sizeof (A); } };
19970 };
19972 If `f' were processed before the processing of `A' were
19973 completed, there would be no way to compute the size of `A'.
19974 Note that the nesting we are interested in here is lexical --
19975 not the semantic nesting given by TYPE_CONTEXT. In particular,
19976 for:
19978 struct A { struct B; };
19979 struct A::B { void f() { } };
19981 there is no need to delay the parsing of `A::B::f'. */
19983 {
19984 tree decl;
19991 /* In a first pass, parse default arguments to the functions.
19992 Then, in a second pass, parse the bodies of the functions.
19993 This two-phased approach handles cases like:
19995 struct S {
19996 void f() { g(); }
19997 void g(int i = 3);
19998 };
20000 */
20002 {
20004 /* If there are default arguments that have not yet been processed,
20005 take care of them now. */
20007 {
20012 }
20013 /* Make sure that any template parameters are in scope. */
20015 /* Parse the default argument expressions. */
20017 /* Remove any template parameters from the symbol table. */
20019 }
20021 /* Now parse any NSDMIs. */
20025 {
20027 {
20032 }
20035 }
20042 /* Now do some post-NSDMI bookkeeping. */
20048 /* Now parse the body of the functions. */
20050 {
20051 /* OpenMP UDRs need to be parsed before all other functions. */
20058 }
20059 else
20063 }
20064 else
20067 /* Put back any saved access checks. */
20070 /* Restore saved state. */
20074 parser->num_template_parameter_lists
20076 parser->in_unbraced_linkage_specification_p
20080 }
20082 static tree
20084 {
20085 tree ret;
20090 }
20092 /* Parse a class-head.
20094 class-head:
20095 class-key identifier [opt] base-clause [opt]
20096 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20097 class-key nested-name-specifier [opt] template-id
20098 base-clause [opt]
20100 class-virt-specifier:
20101 final
20103 GNU Extensions:
20104 class-key attributes identifier [opt] base-clause [opt]
20105 class-key attributes nested-name-specifier identifier base-clause [opt]
20106 class-key attributes nested-name-specifier [opt] template-id
20107 base-clause [opt]
20109 Upon return BASES is initialized to the list of base classes (or
20110 NULL, if there are none) in the same form returned by
20111 cp_parser_base_clause.
20113 Returns the TYPE of the indicated class. Sets
20114 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20115 involving a nested-name-specifier was used, and FALSE otherwise.
20117 Returns error_mark_node if this is not a class-head.
20119 Returns NULL_TREE if the class-head is syntactically valid, but
20120 semantically invalid in a way that means we should skip the entire
20121 body of the class. */
20123 static tree
20126 {
20127 tree nested_name_specifier;
20131 tree attributes;
20132 tree bases;
20142 /* Assume no nested-name-specifier will be present. */
20144 /* Assume no template parameter lists will be used in defining the
20145 type. */
20149 /* Look for the class-key. */
20154 /* Parse the attributes. */
20157 /* If the next token is `::', that is invalid -- but sometimes
20158 people do try to write:
20160 struct ::S {};
20162 Handle this gracefully by accepting the extra qualifier, and then
20163 issuing an error about it later if this really is a
20164 class-head. If it turns out just to be an elaborated type
20165 specifier, remain silent. */
20171 /* Determine the name of the class. Begin by looking for an
20172 optional nested-name-specifier. */
20174 nested_name_specifier
20180 /* If there was a nested-name-specifier, then there *must* be an
20181 identifier. */
20183 {
20185 /* Although the grammar says `identifier', it really means
20186 `class-name' or `template-name'. You are only allowed to
20187 define a class that has already been declared with this
20188 syntax.
20190 The proposed resolution for Core Issue 180 says that wherever
20191 you see `class T::X' you should treat `X' as a type-name.
20193 It is OK to define an inaccessible class; for example:
20195 class A { class B; };
20196 class A::B {};
20198 We do not know if we will see a class-name, or a
20199 template-name. We look for a class-name first, in case the
20200 class-name is a template-id; if we looked for the
20201 template-name first we would stop after the template-name. */
20206 class_type,
20210 /* If that didn't work, ignore the nested-name-specifier. */
20212 {
20218 }
20219 /* If we could not find a corresponding TYPE, treat this
20220 declaration like an unqualified declaration. */
20223 /* Otherwise, count the number of templates used in TYPE and its
20224 containing scopes. */
20225 else
20226 {
20227 tree scope;
20239 }
20240 }
20241 /* Otherwise, the identifier is optional. */
20242 else
20243 {
20244 /* We don't know whether what comes next is a template-id,
20245 an identifier, or nothing at all. */
20247 /* Check for a template-id. */
20252 class_key,
20254 /* If that didn't work, it could still be an identifier. */
20256 {
20258 {
20261 }
20262 else
20264 }
20265 else
20266 {
20269 }
20270 }
20275 {
20277 class_key,
20279 }
20282 /* If it's not a `:' or a `{' then we can't really be looking at a
20283 class-head, since a class-head only appears as part of a
20284 class-specifier. We have to detect this situation before calling
20285 xref_tag, since that has irreversible side-effects. */
20287 {
20291 }
20293 /* At this point, we're going ahead with the class-specifier, even
20294 if some other problem occurs. */
20297 {
20302 }
20303 /* Issue the error about the overly-qualified name now. */
20305 {
20310 }
20312 {
20317 }
20319 {
20320 tree scope;
20322 /* Reject typedef-names in class heads. */
20324 {
20327 type);
20330 }
20332 /* Figure out in what scope the declaration is being placed. */
20334 /* If that scope does not contain the scope in which the
20335 class was originally declared, the program is invalid. */
20337 {
20340 "declaration of %qD in namespace %qD which does not "
20343 else
20349 }
20350 /* [dcl.meaning]
20352 A declarator-id shall not be qualified except for the
20353 definition of a ... nested class outside of its class
20354 ... [or] the definition or explicit instantiation of a
20355 class member of a namespace outside of its namespace. */
20357 {
20362 }
20363 }
20364 /* An explicit-specialization must be preceded by "template <>". If
20365 it is not, try to recover gracefully. */
20369 {
20373 /* Take the same action that would have been taken by
20374 cp_parser_explicit_specialization. */
20377 }
20378 /* There must be no "return" statements between this point and the
20379 end of this function; set "type "to the correct return value and
20380 use "goto done;" to return. */
20381 /* Make sure that the right number of template parameters were
20382 present. */
20386 {
20387 /* If something went wrong, there is no point in even trying to
20388 process the class-definition. */
20391 }
20393 /* Look up the type. */
20395 {
20399 {
20403 }
20404 else
20405 {
20408 }
20411 }
20413 {
20414 tree class_type;
20416 /* Given:
20418 template <typename T> struct S { struct T };
20419 template <typename T> struct S<T>::T { };
20421 we will get a TYPENAME_TYPE when processing the definition of
20422 `S::T'. We need to resolve it to the actual type before we
20423 try to define it. */
20425 {
20430 else
20431 {
20434 }
20435 }
20439 {
20442 }
20445 /* Enter the scope indicated by the nested-name-specifier. */
20447 /* Get the canonical version of this type. */
20449 /* Call push_template_decl if it seems like we should be defining a
20450 template either from the template headers or the type we're
20451 defining, so that we diagnose both extra and missing headers. */
20455 {
20458 {
20461 }
20462 }
20466 }
20468 {
20469 /* If the class was unnamed, create a dummy name. */
20474 }
20476 /* Indicate whether this class was declared as a `class' or as a
20477 `struct'. */
20482 /* If this type was already complete, and we see another definition,
20483 that's an error. */
20485 {
20487 type);
20489 type);
20492 }
20497 {
20498 /* Apply attributes now, before any use of the class as a template
20499 argument in its base list. */
20502 }
20504 /* We will have entered the scope containing the class; the names of
20505 base classes should be looked up in that context. For example:
20507 struct A { struct B {}; struct C; };
20508 struct A::C : B {};
20510 is valid. */
20512 /* Get the list of base-classes, if there is one. */
20514 {
20515 /* PR59482: enter the class scope so that base-specifiers are looked
20516 up correctly. */
20520 /* PR59482: get out of the previously pushed class scope so that the
20521 subsequent pops pop the right thing. */
20524 }
20525 else
20528 /* If we're really defining a class, process the base classes.
20529 If they're invalid, fail. */
20534 done:
20535 /* Leave the scope given by the nested-name-specifier. We will
20536 enter the class scope itself while processing the members. */
20541 {
20544 }
20550 out:
20553 }
20555 /* Parse a class-key.
20557 class-key:
20558 class
20559 struct
20560 union
20562 Returns the kind of class-key specified, or none_type to indicate
20563 error. */
20565 static enum tag_types
20567 {
20571 /* Look for the class-key. */
20576 /* Check to see if the TOKEN is a class-key. */
20581 }
20583 /* Parse a type-parameter-key.
20585 type-parameter-key:
20586 class
20587 typename
20588 */
20590 static void
20592 {
20593 /* Look for the type-parameter-key. */
20597 {
20600 /* typename is not allowed in a template template parameter
20601 by the standard until C++1Z. */
20603 "ISO C++ forbids typename key in template template parameter;"
20605 }
20606 else
20610 }
20612 /* Parse an (optional) member-specification.
20614 member-specification:
20615 member-declaration member-specification [opt]
20616 access-specifier : member-specification [opt] */
20618 static void
20620 {
20622 {
20626 /* Peek at the next token. */
20628 /* If it's a `}', or EOF then we've seen all the members. */
20634 /* See if this token is a keyword. */
20637 {
20641 /* Consume the access-specifier. */
20643 /* Remember which access-specifier is active. */
20645 /* Look for the `:'. */
20650 /* Accept #pragmas at class scope. */
20652 {
20655 }
20657 /* Otherwise, the next construction must be a
20658 member-declaration. */
20660 }
20661 }
20662 }
20664 /* Parse a member-declaration.
20666 member-declaration:
20667 decl-specifier-seq [opt] member-declarator-list [opt] ;
20668 function-definition ; [opt]
20669 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20670 using-declaration
20671 template-declaration
20672 alias-declaration
20674 member-declarator-list:
20675 member-declarator
20676 member-declarator-list , member-declarator
20678 member-declarator:
20679 declarator pure-specifier [opt]
20680 declarator constant-initializer [opt]
20681 identifier [opt] : constant-expression
20683 GNU Extensions:
20685 member-declaration:
20686 __extension__ member-declaration
20688 member-declarator:
20689 declarator attributes [opt] pure-specifier [opt]
20690 declarator attributes [opt] constant-initializer [opt]
20691 identifier [opt] attributes [opt] : constant-expression
20693 C++0x Extensions:
20695 member-declaration:
20696 static_assert-declaration */
20698 static void
20700 {
20701 cp_decl_specifier_seq decl_specifiers;
20702 tree prefix_attributes;
20703 tree decl;
20712 /* Check for the `__extension__' keyword. */
20714 {
20715 /* Recurse. */
20717 /* Restore the old value of the PEDANTIC flag. */
20721 }
20723 /* Check for a template-declaration. */
20725 {
20726 /* An explicit specialization here is an error condition, and we
20727 expect the specialization handler to detect and report this. */
20731 else
20735 }
20737 /* Check for a using-declaration. */
20739 {
20741 {
20742 /* Parse the using-declaration. */
20746 }
20747 else
20748 {
20749 tree decl;
20753 /* Note that if we actually see the '=' token after the
20754 identifier, cp_parser_alias_declaration commits the
20755 tentative parse. In that case, we really expects an
20756 alias-declaration. Otherwise, we expect a using
20757 declaration. */
20758 alias_decl_expected =
20764 else
20768 }
20769 }
20771 /* Check for @defs. */
20773 {
20778 {
20783 }
20785 }
20787 /* If the next token is `static_assert' we have a static assertion. */
20789 {
20792 }
20799 /* Parse the decl-specifier-seq. */
20802 CP_PARSER_FLAGS_OPTIONAL,
20805 /* Check for an invalid type-name. */
20809 /* If there is no declarator, then the decl-specifier-seq should
20810 specify a type. */
20812 {
20813 /* If there was no decl-specifier-seq, and the next token is a
20814 `;', then we have something like:
20816 struct S { ; };
20818 [class.mem]
20820 Each member-declaration shall declare at least one member
20821 name of the class. */
20823 {
20827 }
20828 else
20829 {
20830 tree type;
20832 /* See if this declaration is a friend. */
20834 /* If there were decl-specifiers, check to see if there was
20835 a class-declaration. */
20838 /* Nested classes have already been added to the class, but
20839 a `friend' needs to be explicitly registered. */
20841 {
20842 /* If the `friend' keyword was present, the friend must
20843 be introduced with a class-key. */
20846 "in C++03 a class-key must be used "
20848 /* In this case:
20850 template <typename T> struct A {
20851 friend struct A<T>::B;
20852 };
20854 A<T>::B will be represented by a TYPENAME_TYPE, and
20855 therefore not recognized by check_tag_decl. */
20857 {
20861 }
20864 "friend declaration does not name a class or "
20866 else
20869 }
20870 /* If there is no TYPE, an error message will already have
20871 been issued. */
20873 ;
20874 /* An anonymous aggregate has to be handled specially; such
20875 a declaration really declares a data member (with a
20876 particular type), as opposed to a nested class. */
20878 {
20879 /* C++11 9.5/6. */
20882 "a storage class on an anonymous aggregate "
20885 /* Remove constructors and such from TYPE, now that we
20886 know it is an anonymous aggregate. */
20888 /* And make the corresponding data member. */
20891 /* Add it to the class. */
20893 }
20894 else
20895 cp_parser_check_access_in_redeclaration
20898 }
20899 }
20900 else
20901 {
20904 /* Clear attributes from the decl_specifiers but keep them
20905 around as prefix attributes that apply them to the entity
20906 being declared. */
20910 /* See if these declarations will be friends. */
20913 /* Keep going until we hit the `;' at the end of the
20914 declaration. */
20916 {
20918 tree first_attribute;
20920 /* Peek at the next token. */
20923 /* Check for a bitfield declaration. */
20928 {
20929 tree identifier;
20930 tree width;
20932 /* Get the name of the bitfield. Note that we cannot just
20933 check TOKEN here because it may have been invalidated by
20934 the call to cp_lexer_peek_nth_token above. */
20937 else
20940 /* Consume the `:' token. */
20943 /* Get the width of the bitfield. */
20944 width
20948 /* Look for attributes that apply to the bitfield. */
20950 /* Remember which attributes are prefix attributes and
20951 which are not. */
20953 /* Combine the attributes. */
20956 /* Create the bitfield declaration. */
20959 identifier,
20960 sfk_none)
20963 width,
20964 attributes);
20965 }
20966 else
20967 {
20969 tree initializer;
20970 tree asm_specification;
20973 /* Parse the declarator. */
20974 declarator
20979 friend_p);
20981 /* If something went wrong parsing the declarator, make sure
20982 that we at least consume some tokens. */
20984 {
20985 /* Skip to the end of the statement. */
20987 /* If the next token is not a semicolon, that is
20988 probably because we just skipped over the body of
20989 a function. So, we consume a semicolon if
20990 present, but do not issue an error message if it
20991 is not present. */
20993 CPP_SEMICOLON))
20996 }
20999 cp_parser_check_for_definition_in_return_type
21003 /* Look for an asm-specification. */
21005 /* Look for attributes that apply to the declaration. */
21007 /* Remember which attributes are prefix attributes and
21008 which are not. */
21010 /* Combine the attributes. */
21013 /* If it's an `=', then we have a constant-initializer or a
21014 pure-specifier. It is not correct to parse the
21015 initializer before registering the member declaration
21016 since the member declaration should be in scope while
21017 its initializer is processed. However, the rest of the
21018 front end does not yet provide an interface that allows
21019 us to handle this correctly. */
21021 {
21022 /* In [class.mem]:
21024 A pure-specifier shall be used only in the declaration of
21025 a virtual function.
21027 A member-declarator can contain a constant-initializer
21028 only if it declares a static member of integral or
21029 enumeration type.
21031 Therefore, if the DECLARATOR is for a function, we look
21032 for a pure-specifier; otherwise, we look for a
21033 constant-initializer. When we call `grokfield', it will
21034 perform more stringent semantics checks. */
21046 {
21048 /* Don't require a constant rvalue in C++11, since we
21049 might want a reference constant. We'll enforce
21050 constancy later. */
21052 /* Parse the initializer. */
21055 }
21056 else
21057 /* Parse the initializer. */
21059 }
21062 {
21066 else
21068 }
21069 /* Otherwise, there is no initializer. */
21070 else
21073 /* See if we are probably looking at a function
21074 definition. We are certainly not looking at a
21075 member-declarator. Calling `grokfield' has
21076 side-effects, so we must not do it unless we are sure
21077 that we are looking at a member-declarator. */
21080 {
21081 /* The grammar does not allow a pure-specifier to be
21082 used when a member function is defined. (It is
21083 possible that this fact is an oversight in the
21084 standard, since a pure function may be defined
21085 outside of the class-specifier. */
21091 declarator,
21092 attributes);
21095 /* If the member was not a friend, declare it here. */
21098 /* Peek at the next token. */
21100 /* If the next token is a semicolon, consume it. */
21104 }
21105 else
21108 /* Create the declaration. */
21113 {
21116 else
21118 }
21119 }
21123 /* Reset PREFIX_ATTRIBUTES. */
21129 /* If there is any qualification still in effect, clear it
21130 now; we will be starting fresh with the next declarator. */
21134 /* If it's a `,', then there are more declarators. */
21136 {
21139 {
21143 }
21144 }
21145 /* If the next token isn't a `;', then we have a parse error. */
21147 CPP_SEMICOLON))
21148 {
21149 /* The next token might be a ways away from where the
21150 actual semicolon is missing. Find the previous token
21151 and use that for our error position. */
21156 /* Assume that the user meant to provide a semicolon. If
21157 we were to cp_parser_skip_to_end_of_statement, we might
21158 skip to a semicolon inside a member function definition
21159 and issue nonsensical error messages. */
21161 }
21164 {
21165 /* Add DECL to the list of members. */
21167 /* Explicitly include, eg, NSDMIs, for better error
21168 recovery (c++/58650). */
21177 /* Add DECL to the queue of NSDMI to be parsed later. */
21179 }
21183 }
21184 }
21187 out:
21189 }
21191 /* Parse a pure-specifier.
21193 pure-specifier:
21194 = 0
21196 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21197 Otherwise, ERROR_MARK_NODE is returned. */
21199 static tree
21201 {
21204 /* Look for the `=' token. */
21207 /* Look for the `0' token. */
21216 /* Accept = default or = delete in c++0x mode. */
21219 {
21222 }
21224 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21226 {
21231 }
21233 {
21236 }
21239 }
21241 /* Parse a constant-initializer.
21243 constant-initializer:
21244 = constant-expression
21246 Returns a representation of the constant-expression. */
21248 static tree
21250 {
21251 /* Look for the `=' token. */
21255 /* It is invalid to write:
21257 struct S { static const int i = { 7 }; };
21259 */
21261 {
21264 /* Consume the opening brace. */
21266 /* Skip the initializer. */
21268 /* Look for the trailing `}'. */
21272 }
21275 }
21277 /* Derived classes [gram.class.derived] */
21279 /* Parse a base-clause.
21281 base-clause:
21282 : base-specifier-list
21284 base-specifier-list:
21285 base-specifier ... [opt]
21286 base-specifier-list , base-specifier ... [opt]
21288 Returns a TREE_LIST representing the base-classes, in the order in
21289 which they were declared. The representation of each node is as
21290 described by cp_parser_base_specifier.
21292 In the case that no bases are specified, this function will return
21293 NULL_TREE, not ERROR_MARK_NODE. */
21295 static tree
21297 {
21300 /* Look for the `:' that begins the list. */
21303 /* Scan the base-specifier-list. */
21305 {
21307 tree base;
21310 /* Look for the base-specifier. */
21312 /* Look for the (optional) ellipsis. */
21314 {
21315 /* Consume the `...'. */
21319 }
21321 /* Add BASE to the front of the list. */
21323 {
21325 /* Make this a pack expansion type. */
21329 {
21332 }
21333 }
21334 /* Peek at the next token. */
21336 /* If it's not a comma, then the list is complete. */
21339 /* Consume the `,'. */
21341 }
21343 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21344 base class had a qualified name. However, the next name that
21345 appears is certainly not qualified. */
21351 }
21353 /* Parse a base-specifier.
21355 base-specifier:
21356 :: [opt] nested-name-specifier [opt] class-name
21357 virtual access-specifier [opt] :: [opt] nested-name-specifier
21358 [opt] class-name
21359 access-specifier virtual [opt] :: [opt] nested-name-specifier
21360 [opt] class-name
21362 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21363 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21364 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21365 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21367 static tree
21369 {
21377 tree type;
21379 /* Process the optional `virtual' and `access-specifier'. */
21381 {
21382 /* Peek at the next token. */
21384 /* Process `virtual'. */
21386 {
21388 /* If `virtual' appears more than once, issue an error. */
21390 {
21394 }
21398 /* Consume the `virtual' token. */
21406 /* If more than one access specifier appears, issue an
21407 error. */
21410 {
21414 }
21418 /* Consume the access-specifier. */
21426 }
21427 }
21428 /* It is not uncommon to see programs mechanically, erroneously, use
21429 the 'typename' keyword to denote (dependent) qualified types
21430 as base classes. */
21432 {
21437 else
21439 "keyword %<typename%> not allowed in this context "
21442 }
21444 /* Look for the optional `::' operator. */
21446 /* Look for the nested-name-specifier. The simplest way to
21447 implement:
21449 [temp.res]
21451 The keyword `typename' is not permitted in a base-specifier or
21452 mem-initializer; in these contexts a qualified name that
21453 depends on a template-parameter is implicitly assumed to be a
21454 type name.
21456 is to pretend that we have seen the `typename' keyword at this
21457 point. */
21461 typename_type,
21463 /* If the base class is given by a qualified name, assume that names
21464 we see are type names or templates, as appropriate. */
21470 /* DR 950 allows decltype as a base-specifier. */
21472 else
21473 {
21474 /* Otherwise, look for the class-name. */
21476 class_scope_p,
21477 template_p,
21478 typename_type,
21483 }
21489 }
21491 /* Exception handling [gram.exception] */
21493 /* Parse an (optional) noexcept-specification.
21495 noexcept-specification:
21496 noexcept ( constant-expression ) [opt]
21498 If no noexcept-specification is present, returns NULL_TREE.
21499 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21500 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21501 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21502 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21503 in which case a boolean condition is returned instead. */
21505 static tree
21510 {
21514 /* Peek at the next token. */
21517 /* Is it a noexcept-specification? */
21519 {
21520 tree expr;
21524 {
21528 {
21529 /* Types may not be defined in an exception-specification. */
21531 parser->type_definition_forbidden_message
21535 /* Restore the saved message. */
21537 }
21538 else
21539 {
21542 }
21545 }
21546 else
21547 {
21551 }
21553 /* We cannot build a noexcept-spec right away because this will check
21554 that expr is a constexpr. */
21557 else
21559 }
21560 else
21562 }
21564 /* Parse an (optional) exception-specification.
21566 exception-specification:
21567 throw ( type-id-list [opt] )
21569 Returns a TREE_LIST representing the exception-specification. The
21570 TREE_VALUE of each node is a type. */
21572 static tree
21574 {
21576 tree type_id_list;
21579 /* Peek at the next token. */
21582 /* Is it a noexcept-specification? */
21588 /* If it's not `throw', then there's no exception-specification. */
21592 #if 0
21593 /* Enable this once a lot of code has transitioned to noexcept? */
21597 #endif
21599 /* Consume the `throw'. */
21602 /* Look for the `('. */
21605 /* Peek at the next token. */
21607 /* If it's not a `)', then there is a type-id-list. */
21609 {
21610 /* Types may not be defined in an exception-specification. */
21612 parser->type_definition_forbidden_message
21614 /* Parse the type-id-list. */
21616 /* Restore the saved message. */
21618 }
21619 else
21622 /* Look for the `)'. */
21626 }
21628 /* Parse an (optional) type-id-list.
21630 type-id-list:
21631 type-id ... [opt]
21632 type-id-list , type-id ... [opt]
21634 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21635 in the order that the types were presented. */
21637 static tree
21639 {
21643 {
21645 tree type;
21647 /* Get the next type-id. */
21649 /* Parse the optional ellipsis. */
21651 {
21652 /* Consume the `...'. */
21655 /* Turn the type into a pack expansion expression. */
21657 }
21658 /* Add it to the list. */
21660 /* Peek at the next token. */
21662 /* If it is not a `,', we are done. */
21665 /* Consume the `,'. */
21667 }
21670 }
21672 /* Parse a try-block.
21674 try-block:
21675 try compound-statement handler-seq */
21677 static tree
21679 {
21680 tree try_block;
21694 }
21696 /* Parse a function-try-block.
21698 function-try-block:
21699 try ctor-initializer [opt] function-body handler-seq */
21701 static bool
21703 {
21704 tree compound_stmt;
21705 tree try_block;
21708 /* Look for the `try' keyword. */
21711 /* Let the rest of the front end know where we are. */
21713 /* Parse the function-body. */
21714 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21716 /* We're done with the `try' part. */
21718 /* Parse the handlers. */
21720 /* We're done with the handlers. */
21724 }
21726 /* Parse a handler-seq.
21728 handler-seq:
21729 handler handler-seq [opt] */
21731 static void
21733 {
21735 {
21738 /* Parse the handler. */
21740 /* Peek at the next token. */
21742 /* If it's not `catch' then there are no more handlers. */
21745 }
21746 }
21748 /* Parse a handler.
21750 handler:
21751 catch ( exception-declaration ) compound-statement */
21753 static void
21755 {
21756 tree handler;
21757 tree declaration;
21767 }
21769 /* Parse an exception-declaration.
21771 exception-declaration:
21772 type-specifier-seq declarator
21773 type-specifier-seq abstract-declarator
21774 type-specifier-seq
21775 ...
21777 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21778 ellipsis variant is used. */
21780 static tree
21782 {
21783 cp_decl_specifier_seq type_specifiers;
21787 /* If it's an ellipsis, it's easy to handle. */
21789 {
21790 /* Consume the `...' token. */
21793 }
21795 /* Types may not be defined in exception-declarations. */
21797 parser->type_definition_forbidden_message
21800 /* Parse the type-specifier-seq. */
21804 /* If it's a `)', then there is no declarator. */
21807 else
21814 /* Restore the saved message. */
21821 }
21823 /* Parse a throw-expression.
21825 throw-expression:
21826 throw assignment-expression [opt]
21828 Returns a THROW_EXPR representing the throw-expression. */
21830 static tree
21832 {
21833 tree expression;
21838 /* Figure out whether or not there is an assignment-expression
21839 following the "throw" keyword. */
21847 else
21851 }
21853 /* GNU Extensions */
21855 /* Parse an (optional) asm-specification.
21857 asm-specification:
21858 asm ( string-literal )
21860 If the asm-specification is present, returns a STRING_CST
21861 corresponding to the string-literal. Otherwise, returns
21862 NULL_TREE. */
21864 static tree
21866 {
21868 tree asm_specification;
21870 /* Peek at the next token. */
21872 /* If the next token isn't the `asm' keyword, then there's no
21873 asm-specification. */
21877 /* Consume the `asm' token. */
21879 /* Look for the `('. */
21882 /* Look for the string-literal. */
21885 /* Look for the `)'. */
21889 }
21891 /* Parse an asm-operand-list.
21893 asm-operand-list:
21894 asm-operand
21895 asm-operand-list , asm-operand
21897 asm-operand:
21898 string-literal ( expression )
21899 [ string-literal ] string-literal ( expression )
21901 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21902 each node is the expression. The TREE_PURPOSE is itself a
21903 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21904 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21905 is a STRING_CST for the string literal before the parenthesis. Returns
21906 ERROR_MARK_NODE if any of the operands are invalid. */
21908 static tree
21910 {
21915 {
21916 tree string_literal;
21917 tree expression;
21918 tree name;
21921 {
21922 /* Consume the `[' token. */
21924 /* Read the operand name. */
21929 /* Look for the closing `]'. */
21931 }
21932 else
21934 /* Look for the string-literal. */
21937 /* Look for the `('. */
21939 /* Parse the expression. */
21941 /* Look for the `)'. */
21949 /* Add this operand to the list. */
21951 expression,
21952 asm_operands);
21953 /* If the next token is not a `,', there are no more
21954 operands. */
21957 /* Consume the `,'. */
21959 }
21962 }
21964 /* Parse an asm-clobber-list.
21966 asm-clobber-list:
21967 string-literal
21968 asm-clobber-list , string-literal
21970 Returns a TREE_LIST, indicating the clobbers in the order that they
21971 appeared. The TREE_VALUE of each node is a STRING_CST. */
21973 static tree
21975 {
21979 {
21980 tree string_literal;
21982 /* Look for the string literal. */
21984 /* Add it to the list. */
21986 /* If the next token is not a `,', then the list is
21987 complete. */
21990 /* Consume the `,' token. */
21992 }
21995 }
21997 /* Parse an asm-label-list.
21999 asm-label-list:
22000 identifier
22001 asm-label-list , identifier
22003 Returns a TREE_LIST, indicating the labels in the order that they
22004 appeared. The TREE_VALUE of each node is a label. */
22006 static tree
22008 {
22012 {
22015 /* Look for the identifier. */
22018 {
22021 {
22027 }
22028 }
22029 /* If the next token is not a `,', then the list is
22030 complete. */
22033 /* Consume the `,' token. */
22035 }
22038 }
22040 /* Return TRUE iff the next tokens in the stream are possibly the
22041 beginning of a GNU extension attribute. */
22043 static bool
22045 {
22047 }
22049 /* Return TRUE iff the next tokens in the stream are possibly the
22050 beginning of a standard C++-11 attribute specifier. */
22052 static bool
22054 {
22056 }
22058 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22059 beginning of a standard C++-11 attribute specifier. */
22061 static bool
22063 {
22071 }
22073 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22074 beginning of a GNU extension attribute. */
22076 static bool
22078 {
22082 }
22084 /* Return true iff the next tokens can be the beginning of either a
22085 GNU attribute list, or a standard C++11 attribute sequence. */
22087 static bool
22089 {
22092 }
22094 /* Return true iff the next Nth tokens can be the beginning of either
22095 a GNU attribute list, or a standard C++11 attribute sequence. */
22097 static bool
22099 {
22102 }
22104 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22105 of GNU attributes, or return NULL. */
22107 static tree
22109 {
22113 }
22115 #define CILK_SIMD_FN_CLAUSE_MASK \
22116 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22117 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22118 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22119 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22120 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22122 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22123 vector [(<clauses>)] */
22125 static void
22127 {
22131 {
22136 }
22139 {
22142 paren_scope++;
22143 }
22145 {
22148 paren_scope++;
22150 paren_scope--;
22151 /* Do not push the last ')' */
22154 }
22163 }
22165 /* Parse an (optional) series of attributes.
22167 attributes:
22168 attributes attribute
22170 attribute:
22171 __attribute__ (( attribute-list [opt] ))
22173 The return value is as for cp_parser_gnu_attribute_list. */
22175 static tree
22177 {
22181 {
22183 tree attribute_list;
22186 /* Peek at the next token. */
22188 /* If it's not `__attribute__', then we're done. */
22192 /* Consume the `__attribute__' keyword. */
22194 /* Look for the two `(' tokens. */
22198 /* Peek at the next token. */
22201 /* Parse the attribute-list. */
22203 else
22204 /* If the next token is a `)', then there is no attribute
22205 list. */
22208 /* Look for the two `)' tokens. */
22216 /* Add these new attributes to the list. */
22218 }
22221 }
22223 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22224 "__vector" or "__vector__." */
22228 {
22232 }
22234 /* Parse a GNU attribute-list.
22236 attribute-list:
22237 attribute
22238 attribute-list , attribute
22240 attribute:
22241 identifier
22242 identifier ( identifier )
22243 identifier ( identifier , expression-list )
22244 identifier ( expression-list )
22246 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22247 to an attribute. The TREE_PURPOSE of each node is the identifier
22248 indicating which attribute is in use. The TREE_VALUE represents
22249 the arguments, if any. */
22251 static tree
22253 {
22259 {
22261 tree identifier;
22262 tree attribute;
22264 /* Look for the identifier. We also allow keywords here; for
22265 example `__attribute__ ((const))' is legal. */
22269 {
22272 /* Consume the token, but save it since we need it for the
22273 SIMD enabled function parsing. */
22276 /* Save away the identifier that indicates which attribute
22277 this is. */
22279 /* For keywords, use the canonical spelling, not the
22280 parsed identifier. */
22286 /* Peek at the next token. */
22288 /* If it's an `(', then parse the attribute arguments. */
22290 {
22295 {
22298 }
22299 else
22300 vec = cp_parser_parenthesized_expression_list
22306 else
22307 {
22310 }
22311 /* Save the arguments away. */
22313 }
22315 {
22318 }
22321 {
22322 /* Add this attribute to the list. */
22325 }
22328 }
22329 /* Now, look for more attributes. If the next token isn't a
22330 `,', we're done. */
22334 /* Consume the comma and keep going. */
22336 }
22339 /* We built up the list in reverse order. */
22341 }
22343 /* Parse a standard C++11 attribute.
22345 The returned representation is a TREE_LIST which TREE_PURPOSE is
22346 the scoped name of the attribute, and the TREE_VALUE is its
22347 arguments list.
22349 Note that the scoped name of the attribute is itself a TREE_LIST
22350 which TREE_PURPOSE is the namespace of the attribute, and
22351 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22352 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22353 and which TREE_PURPOSE is directly the attribute name.
22355 Clients of the attribute code should use get_attribute_namespace
22356 and get_attribute_name to get the actual namespace and name of
22357 attributes, regardless of their being GNU or C++11 attributes.
22359 attribute:
22360 attribute-token attribute-argument-clause [opt]
22362 attribute-token:
22363 identifier
22364 attribute-scoped-token
22366 attribute-scoped-token:
22367 attribute-namespace :: identifier
22369 attribute-namespace:
22370 identifier
22372 attribute-argument-clause:
22373 ( balanced-token-seq )
22375 balanced-token-seq:
22376 balanced-token [opt]
22377 balanced-token-seq balanced-token
22379 balanced-token:
22380 ( balanced-token-seq )
22381 [ balanced-token-seq ]
22382 { balanced-token-seq }. */
22384 static tree
22386 {
22390 /* First, parse name of the the attribute, a.k.a
22391 attribute-token. */
22408 {
22409 /* We are seeing a scoped attribute token. */
22419 else
22420 {
22424 }
22426 NULL_TREE);
22428 }
22429 else
22430 {
22432 NULL_TREE);
22433 /* C++11 noreturn attribute is equivalent to GNU's. */
22436 /* C++14 deprecated attribute is equivalent to GNU's. */
22438 {
22441 "%<deprecated%> is a C++14 feature;"
22444 }
22445 }
22447 /* Now parse the optional argument clause of the attribute. */
22452 {
22458 /* A GNU attribute that takes an identifier in parameter. */
22461 vec = cp_parser_parenthesized_expression_list
22467 else
22468 {
22471 }
22475 else
22477 }
22480 }
22482 /* Parse a list of standard C++-11 attributes.
22484 attribute-list:
22485 attribute [opt]
22486 attribute-list , attribute[opt]
22487 attribute ...
22488 attribute-list , attribute ...
22489 */
22491 static tree
22493 {
22498 {
22503 {
22506 }
22509 {
22514 }
22518 }
22521 }
22523 /* Parse a standard C++-11 attribute specifier.
22525 attribute-specifier:
22526 [ [ attribute-list ] ]
22527 alignment-specifier
22529 alignment-specifier:
22530 alignas ( type-id ... [opt] )
22531 alignas ( alignment-expression ... [opt] ). */
22533 static tree
22535 {
22541 {
22550 else
22551 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22552 when we are sure that we have actually parsed them. */
22554 }
22555 else
22556 {
22557 tree alignas_expr;
22559 /* Look for an alignment-specifier. */
22571 {
22574 }
22580 {
22584 alignas_expr =
22591 }
22597 {
22600 }
22603 {
22606 }
22608 /* Build the C++-11 representation of an 'aligned'
22609 attribute. */
22610 attributes =
22613 alignas_expr);
22614 }
22617 }
22619 /* Parse a standard C++-11 attribute-specifier-seq.
22621 attribute-specifier-seq:
22622 attribute-specifier-seq [opt] attribute-specifier
22623 */
22625 static tree
22627 {
22631 {
22640 }
22644 }
22646 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22647 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22648 current value of the PEDANTIC flag, regardless of whether or not
22649 the `__extension__' keyword is present. The caller is responsible
22650 for restoring the value of the PEDANTIC flag. */
22652 static bool
22654 {
22655 /* Save the old value of the PEDANTIC flag. */
22659 {
22660 /* Consume the `__extension__' token. */
22662 /* We're not being pedantic while the `__extension__' keyword is
22663 in effect. */
22667 }
22670 }
22672 /* Parse a label declaration.
22674 label-declaration:
22675 __label__ label-declarator-seq ;
22677 label-declarator-seq:
22678 identifier , label-declarator-seq
22679 identifier */
22681 static void
22683 {
22684 /* Look for the `__label__' keyword. */
22688 {
22689 tree identifier;
22691 /* Look for an identifier. */
22693 /* If we failed, stop. */
22696 /* Declare it as a label. */
22698 /* If the next token is a `;', stop. */
22701 /* Look for the `,' separating the label declarations. */
22703 }
22705 /* Look for the final `;'. */
22707 }
22709 /* Support Functions */
22711 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22712 NAME should have one of the representations used for an
22713 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22714 is returned. If PARSER->SCOPE is a dependent type, then a
22715 SCOPE_REF is returned.
22717 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22718 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22719 was formed. Abstractly, such entities should not be passed to this
22720 function, because they do not need to be looked up, but it is
22721 simpler to check for this special case here, rather than at the
22722 call-sites.
22724 In cases not explicitly covered above, this function returns a
22725 DECL, OVERLOAD, or baselink representing the result of the lookup.
22726 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22727 is returned.
22729 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22730 (e.g., "struct") that was used. In that case bindings that do not
22731 refer to types are ignored.
22733 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22734 ignored.
22736 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22737 are ignored.
22739 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22740 types.
22742 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22743 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22744 NULL_TREE otherwise. */
22746 static tree
22753 location_t name_location)
22754 {
22755 tree decl;
22758 /* Assume that the lookup will be unambiguous. */
22762 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22763 no longer valid. Note that if we are parsing tentatively, and
22764 the parse fails, OBJECT_TYPE will be automatically restored. */
22770 /* A template-id has already been resolved; there is no lookup to
22771 do. */
22775 {
22779 }
22781 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22782 it should already have been checked to make sure that the name
22783 used matches the type being destroyed. */
22785 {
22786 tree type;
22788 /* Figure out to which type this destructor applies. */
22793 else
22795 /* If that's not a class type, there is no destructor. */
22802 /* If it was a class type, return the destructor. */
22804 }
22806 /* By this point, the NAME should be an ordinary identifier. If
22807 the id-expression was a qualified name, the qualifying scope is
22808 stored in PARSER->SCOPE at this point. */
22811 /* Perform the lookup. */
22813 {
22819 /* If the SCOPE is dependent, the lookup must be deferred until
22820 the template is instantiated -- unless we are explicitly
22821 looking up names in uninstantiated templates. Even then, we
22822 cannot look up the name if the scope is not a class type; it
22823 might, for example, be a template type parameter. */
22828 /* Defer lookup. */
22830 else
22831 {
22834 /* If PARSER->SCOPE is a dependent type, then it must be a
22835 class type, and we must not be checking dependencies;
22836 otherwise, we would have processed this lookup above. So
22837 that PARSER->SCOPE is not considered a dependent base by
22838 lookup_member, we must enter the scope here. */
22842 /* If the PARSER->SCOPE is a template specialization, it
22843 may be instantiated during name lookup. In that case,
22844 errors may be issued. Even if we rollback the current
22845 tentative parse, those errors are valid. */
22850 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22851 lookup result and the nested-name-specifier nominates a class C:
22852 * if the name specified after the nested-name-specifier, when
22853 looked up in C, is the injected-class-name of C (Clause 9), or
22854 * if the name specified after the nested-name-specifier is the
22855 same as the identifier or the simple-template-id's template-
22856 name in the last component of the nested-name-specifier,
22857 the name is instead considered to name the constructor of
22858 class C. [ Note: for example, the constructor is not an
22859 acceptable lookup result in an elaborated-type-specifier so
22860 the constructor would not be used in place of the
22861 injected-class-name. --end note ] Such a constructor name
22862 shall be used only in the declarator-id of a declaration that
22863 names a constructor or in a using-declaration. */
22871 /* If we have a single function from a using decl, pull it out. */
22878 }
22880 /* If the scope is a dependent type and either we deferred lookup or
22881 we did lookup but didn't find the name, rememeber the name. */
22884 {
22886 {
22887 tree type;
22889 /* The resolution to Core Issue 180 says that `struct
22890 A::B' should be considered a type-name, even if `A'
22891 is dependent. */
22896 }
22900 CPP_CLOSE_PAREN)))
22904 else
22907 is_template);
22908 }
22911 }
22913 {
22914 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22915 OBJECT_TYPE is not a class. */
22917 /* If the OBJECT_TYPE is a template specialization, it may
22918 be instantiated during name lookup. In that case, errors
22919 may be issued. Even if we rollback the current tentative
22920 parse, those errors are valid. */
22922 name,
22925 tf_warning_or_error);
22926 else
22930 /* Look it up in the enclosing context. */
22936 }
22937 else
22938 {
22944 }
22946 /* If the lookup failed, let our caller know. */
22950 /* Pull out the template from an injected-class-name (or multiple). */
22954 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22956 {
22959 /* The error message we have to print is too complicated for
22960 cp_parser_error, so we incorporate its actions directly. */
22962 {
22964 name);
22966 }
22968 }
22976 /* If we have resolved the name of a member declaration, check to
22977 see if the declaration is accessible. When the name resolves to
22978 set of overloaded functions, accessibility is checked when
22979 overload resolution is done.
22981 During an explicit instantiation, access is not checked at all,
22982 as per [temp.explicit]. */
22989 }
22991 /* Like cp_parser_lookup_name, but for use in the typical case where
22992 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22993 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22995 static tree
22997 {
22999 none_type,
23004 location);
23005 }
23007 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23008 the current context, return the TYPE_DECL. If TAG_NAME_P is
23009 true, the DECL indicates the class being defined in a class-head,
23010 or declared in an elaborated-type-specifier.
23012 Otherwise, return DECL. */
23014 static tree
23016 {
23017 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23018 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23020 struct A {
23021 template <typename T> struct B;
23022 };
23024 template <typename T> struct A::B {};
23026 Similarly, in an elaborated-type-specifier:
23028 namespace N { struct X{}; }
23030 struct A {
23031 template <typename T> friend struct N::X;
23032 };
23034 However, if the DECL refers to a class type, and we are in
23035 the scope of the class, then the name lookup automatically
23036 finds the TYPE_DECL created by build_self_reference rather
23037 than a TEMPLATE_DECL. For example, in:
23039 template <class T> struct S {
23040 S s;
23041 };
23043 there is no need to handle such case. */
23049 }
23051 /* If too many, or too few, template-parameter lists apply to the
23052 declarator, issue an error message. Returns TRUE if all went well,
23053 and FALSE otherwise. */
23055 static bool
23058 location_t declarator_location)
23059 {
23061 {
23063 {
23071 /* If the DECLARATOR has the form `X<y>' then it uses one
23072 additional level of template parameters. */
23075 return cp_parser_check_template_parameters
23077 }
23092 }
23094 }
23096 /* NUM_TEMPLATES were used in the current declaration. If that is
23097 invalid, return FALSE and issue an error messages. Otherwise,
23098 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23099 declarator and we can print more accurate diagnostics. */
23101 static bool
23104 location_t location,
23106 {
23107 /* If there are the same number of template classes and parameter
23108 lists, that's OK. */
23111 /* If there are more, but only one more, then we are referring to a
23112 member template. That's OK too. */
23115 /* If there are more template classes than parameter lists, we have
23116 something like:
23118 template <class T> void S<T>::R<T>::f (); */
23120 {
23130 else
23133 }
23134 /* Otherwise, there are too many template parameter lists. We have
23135 something like:
23137 template <class T> template <class U> void S::f(); */
23140 }
23142 /* Parse an optional `::' token indicating that the following name is
23143 from the global namespace. If so, PARSER->SCOPE is set to the
23144 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23145 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23146 Returns the new value of PARSER->SCOPE, if the `::' token is
23147 present, and NULL_TREE otherwise. */
23149 static tree
23151 {
23154 /* Peek at the next token. */
23156 /* If we're looking at a `::' token then we're starting from the
23157 global namespace, not our current location. */
23159 {
23160 /* Consume the `::' token. */
23162 /* Set the SCOPE so that we know where to start the lookup. */
23168 }
23170 {
23174 }
23177 }
23179 /* Returns TRUE if the upcoming token sequence is the start of a
23180 constructor declarator. If FRIEND_P is true, the declarator is
23181 preceded by the `friend' specifier. */
23183 static bool
23185 {
23188 tree nested_name_specifier;
23191 /* The common case is that this is not a constructor declarator, so
23192 try to avoid doing lots of work if at all possible. It's not
23193 valid declare a constructor at function scope. */
23196 /* And only certain tokens can begin a constructor declarator. */
23204 /* Parse tentatively; we are going to roll back all of the tokens
23205 consumed here. */
23207 /* Assume that we are looking at a constructor declarator. */
23210 /* Look for the optional `::' operator. */
23213 /* Look for the nested-name-specifier. */
23214 nested_name_specifier
23225 /* Outside of a class-specifier, there must be a
23226 nested-name-specifier. */
23232 /* If we have a class scope, this is easy; DR 147 says that S::S always
23233 names the constructor, and no other qualified name could. */
23236 {
23246 }
23247 /* If we still think that this might be a constructor-declarator,
23248 look for a class-name. */
23250 {
23251 /* If we have:
23253 template <typename T> struct S {
23254 S();
23255 };
23257 we must recognize that the nested `S' names a class. */
23258 tree type_decl;
23262 none_type,
23266 /* If there was no class-name, then this is not a constructor.
23267 Otherwise, if we are in a class-specifier and we aren't
23268 handling a friend declaration, check that its type matches
23269 current_class_type (c++/38313). Note: error_mark_node
23270 is left alone for error recovery purposes. */
23272 && (outside_class_specifier_p
23277 /* If we're still considering a constructor, we have to see a `(',
23278 to begin the parameter-declaration-clause, followed by either a
23279 `)', an `...', or a decl-specifier. We need to check for a
23280 type-specifier to avoid being fooled into thinking that:
23282 S (f) (int);
23284 is a constructor. (It is actually a function named `f' that
23285 takes one parameter (of type `int') and returns a value of type
23286 `S'. */
23294 /* A parameter declaration begins with a decl-specifier,
23295 which is either the "attribute" keyword, a storage class
23296 specifier, or (usually) a type-specifier. */
23298 {
23299 tree type;
23303 /* Names appearing in the type-specifier should be looked up
23304 in the scope of the class. */
23307 else
23308 {
23311 {
23315 {
23318 }
23319 }
23321 }
23323 /* Inside the constructor parameter list, surrounding
23324 template-parameter-lists do not apply. */
23325 saved_num_template_parameter_lists
23329 /* Look for the type-specifier. */
23331 CP_PARSER_FLAGS_NONE,
23337 parser->num_template_parameter_lists
23340 /* Leave the scope of the class. */
23345 }
23346 }
23348 /* We did not really want to consume any tokens. */
23352 }
23354 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23355 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23356 they must be performed once we are in the scope of the function.
23358 Returns the function defined. */
23360 static tree
23361 cp_parser_function_definition_from_specifiers_and_declarator
23364 tree attributes,
23366 {
23367 tree fn;
23370 /* Begin the function-definition. */
23373 /* The things we're about to see are not directly qualified by any
23374 template headers we've seen thus far. */
23377 /* If there were names looked up in the decl-specifier-seq that we
23378 did not check, check them now. We must wait until we are in the
23379 scope of the function to perform the checks, since the function
23380 might be a friend. */
23384 {
23387 }
23390 {
23391 /* Skip the entire function. */
23394 }
23396 {
23397 /* Seen already, skip it. An error message has already been output. */
23401 /* If this is a function from a class, pop the nested class. */
23404 }
23405 else
23406 {
23407 timevar_id_t tv;
23410 else
23416 }
23419 }
23421 /* Parse the part of a function-definition that follows the
23422 declarator. INLINE_P is TRUE iff this function is an inline
23423 function defined within a class-specifier.
23425 Returns the function defined. */
23427 static tree
23430 {
23431 tree fn;
23437 bool fully_implicit_function_template_p
23440 tree implicit_template_parms
23443 cp_binding_level* implicit_template_scope
23449 /* If the next token is `return', then the code may be trying to
23450 make use of the "named return value" extension that G++ used to
23451 support. */
23454 {
23455 /* Consume the `return' keyword. */
23457 /* Look for the identifier that indicates what value is to be
23458 returned. */
23460 /* Issue an error message. */
23463 /* Skip tokens until we reach the start of the function body. */
23465 {
23472 }
23473 }
23474 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23475 anything declared inside `f'. */
23476 saved_in_unbraced_linkage_specification_p
23479 /* Inside the function, surrounding template-parameter-lists do not
23480 apply. */
23481 saved_num_template_parameter_lists
23487 /* If the next token is `try', `__transaction_atomic', or
23488 `__transaction_relaxed`, then we are looking at either function-try-block
23489 or function-transaction-block. Note that all of these include the
23490 function-body. */
23493 RID_TRANSACTION_ATOMIC);
23495 RID_TRANSACTION_RELAXED))
23497 RID_TRANSACTION_RELAXED);
23500 else
23501 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23506 /* Finish the function. */
23509 /* Generate code for it, if necessary. */
23511 /* Restore the saved values. */
23512 parser->in_unbraced_linkage_specification_p
23514 parser->num_template_parameter_lists
23518 parser->fully_implicit_function_template_p
23520 parser->implicit_template_parms
23522 parser->implicit_template_scope
23529 }
23531 /* Parse a template-declaration, assuming that the `export' (and
23532 `extern') keywords, if present, has already been scanned. MEMBER_P
23533 is as for cp_parser_template_declaration. */
23535 static void
23537 {
23540 tree parameter_list;
23545 /* Look for the `template' keyword. */
23550 /* And the `<'. */
23554 {
23555 /* 14.5.2.2 [temp.mem]
23557 A local class shall not have member templates. */
23562 }
23563 /* [temp]
23565 A template ... shall not have C linkage. */
23567 {
23569 /* Give it C++ linkage to avoid confusing other parts of the
23570 front end. */
23573 }
23574 else
23577 /* We cannot perform access checks on the template parameter
23578 declarations until we know what is being declared, just as we
23579 cannot check the decl-specifier list. */
23582 /* If the next token is `>', then we have an invalid
23583 specialization. Rather than complain about an invalid template
23584 parameter, issue an error message here. */
23586 {
23590 }
23591 else
23592 {
23593 /* Parse the template parameters. */
23595 }
23597 /* Get the deferred access checks from the parameter list. These
23598 will be checked once we know what is being declared, as for a
23599 member template the checks must be performed in the scope of the
23600 class containing the member. */
23603 /* Look for the `>'. */
23605 /* We just processed one more parameter list. */
23607 /* If the next token is `template', there are more template
23608 parameters. */
23610 RID_TEMPLATE))
23615 else
23616 {
23617 /* There are no access checks when parsing a template, as we do not
23618 know if a specialization will be a friend. */
23622 checks,
23623 member_p,
23628 /* If this is a member template declaration, let the front
23629 end know. */
23631 {
23636 }
23641 }
23642 /* We are done with the current parameter list. */
23647 /* Finish up. */
23650 /* Check the template arguments for a literal operator template. */
23654 {
23658 else
23659 {
23662 {
23668 }
23670 {
23678 }
23679 else
23681 }
23683 {
23686 " Expected non-type template argument pack <char...>"
23688 decl);
23689 else
23692 decl);
23693 }
23694 }
23695 /* Register member declarations. */
23698 /* For the erroneous case of a template with C linkage, we pushed an
23699 implicit C++ linkage scope; exit that scope now. */
23702 /* If DECL is a function template, we must return to parse it later.
23703 (Even though there is no definition, there might be default
23704 arguments that need handling.) */
23708 }
23710 /* Perform the deferred access checks from a template-parameter-list.
23711 CHECKS is a TREE_LIST of access checks, as returned by
23712 get_deferred_access_checks. */
23714 static void
23715 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23716 {
23720 }
23722 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23723 `function-definition' sequence that follows a template header.
23724 If MEMBER_P is true, this declaration appears in a class scope.
23726 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23727 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23729 static tree
23735 {
23738 cp_decl_specifier_seq decl_specifiers;
23742 /* This function is only used when processing a template
23743 declaration. */
23747 /* Defer access checks until we know what is being declared. */
23750 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23751 alternative. */
23754 CP_PARSER_FLAGS_OPTIONAL,
23760 /* There are no template typedefs. */
23762 {
23766 }
23768 /* Gather up the access checks that occurred the
23769 decl-specifier-seq. */
23772 /* Check for the declaration of a template class. */
23774 {
23776 {
23779 /* In this case:
23781 struct C {
23782 friend template <typename T> struct A<T>::B;
23783 };
23785 A<T>::B will be represented by a TYPENAME_TYPE, and
23786 therefore not recognized by shadow_tag. */
23788 && !decl
23795 else
23798 /* Perform access checks for template parameters. */
23800 }
23801 }
23803 /* Complain about missing 'typename' or other invalid type names. */
23806 {
23807 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23808 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23809 the rest of this declaration. */
23812 }
23814 /* If it's not a template class, try for a template function. If
23815 the next token is a `;', then this declaration does not declare
23816 anything. But, if there were errors in the decl-specifiers, then
23817 the error might well have come from an attempted class-specifier.
23818 In that case, there's no need to warn about a missing declarator. */
23822 {
23825 checks,
23827 member_p,
23828 declares_class_or_enum,
23832 /* 7.1.1-1 [dcl.stc]
23834 A storage-class-specifier shall not be specified in an explicit
23835 specialization... */
23837 && explicit_specialization_p
23839 {
23843 }
23847 }
23849 /* Look for a trailing `;' after the declaration. */
23855 out:
23858 /* Clear any current qualification; whatever comes next is the start
23859 of something new. */
23865 }
23867 /* Parse a cast-expression that is not the operand of a unary "&". */
23869 static tree
23871 {
23874 }
23876 /* Parse a functional cast to TYPE. Returns an expression
23877 representing the cast. */
23879 static tree
23881 {
23883 tree expression_list;
23884 tree cast;
23891 {
23899 tf_warning_or_error);
23900 }
23909 else
23910 {
23913 }
23916 tf_warning_or_error);
23917 /* [expr.const]/1: In an integral constant expression "only type
23918 conversions to integral or enumeration type can be used". */
23924 NIC_CONSTRUCTOR))
23927 }
23929 /* Save the tokens that make up the body of a member function defined
23930 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23931 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23932 specifiers applied to the declaration. Returns the FUNCTION_DECL
23933 for the member function. */
23935 static tree
23939 tree attributes)
23940 {
23943 tree fn;
23945 /* Create the FUNCTION_DECL. */
23948 /* If something went badly wrong, bail out now. */
23950 {
23951 /* If there's a function-body, skip it. */
23956 }
23958 /* Remember it, if there default args to post process. */
23961 /* Save away the tokens that make up the body of the
23962 function. */
23964 /* Handle function try blocks. */
23967 /* We can have braced-init-list mem-initializers before the fn body. */
23969 {
23972 {
23973 /* cache_group will stop after an un-nested { } pair, too. */
23977 /* variadic mem-inits have ... after the ')'. */
23980 }
23981 }
23983 /* Handle function try blocks. */
23988 /* Save away the inline definition; we will process it when the
23989 class is complete. */
23993 /* We need to know that this was defined in the class, so that
23994 friend templates are handled correctly. */
23997 /* Add FN to the queue of functions to be parsed later. */
24001 }
24003 /* Save the tokens that make up the in-class initializer for a non-static
24004 data member. Returns a DEFAULT_ARG. */
24006 static tree
24008 {
24010 }
24012 /* Parse a template-argument-list, as well as the trailing ">" (but
24013 not the opening "<"). See cp_parser_template_argument_list for the
24014 return value. */
24016 static tree
24018 {
24019 tree arguments;
24020 tree saved_scope;
24021 tree saved_qualifying_scope;
24022 tree saved_object_scope;
24027 /* [temp.names]
24029 When parsing a template-id, the first non-nested `>' is taken as
24030 the end of the template-argument-list rather than a greater-than
24031 operator. */
24032 saved_greater_than_is_operator_p
24035 /* Parsing the argument list may modify SCOPE, so we save it
24036 here. */
24040 /* We need to evaluate the template arguments, even though this
24041 template-id may be nested within a "sizeof". */
24046 /* Parse the template-argument-list itself. */
24050 else
24052 /* Look for the `>' that ends the template-argument-list. If we find
24053 a '>>' instead, it's probably just a typo. */
24055 {
24057 {
24058 /* In C++0x, a `>>' in a template argument list or cast
24059 expression is considered to be two separate `>'
24060 tokens. So, change the current token to a `>', but don't
24061 consume it: it will be consumed later when the outer
24062 template argument list (or cast expression) is parsed.
24063 Note that this replacement of `>' for `>>' is necessary
24064 even if we are parsing tentatively: in the tentative
24065 case, after calling
24066 cp_parser_enclosed_template_argument_list we will always
24067 throw away all of the template arguments and the first
24068 closing `>', either because the template argument list
24069 was erroneous or because we are replacing those tokens
24070 with a CPP_TEMPLATE_ID token. The second `>' (which will
24071 not have been thrown away) is needed either to close an
24072 outer template argument list or to complete a new-style
24073 cast. */
24076 }
24078 {
24079 /* If we're in a nested template argument list, the '>>' has
24080 to be a typo for '> >'. We emit the error message, but we
24081 continue parsing and we push a '>' as next token, so that
24082 the argument list will be parsed correctly. Note that the
24083 global source location is still on the token before the
24084 '>>', so we need to say explicitly where we want it. */
24090 }
24091 else
24092 {
24093 /* If this is not a nested template argument list, the '>>'
24094 is a typo for '>'. Emit an error message and continue.
24095 Same deal about the token location, but here we can get it
24096 right by consuming the '>>' before issuing the diagnostic. */
24099 "spurious %<>>%>, use %<>%> to terminate "
24101 }
24102 }
24103 else
24105 /* The `>' token might be a greater-than operator again now. */
24106 parser->greater_than_is_operator_p
24108 /* Restore the SAVED_SCOPE. */
24116 }
24118 /* MEMBER_FUNCTION is a member function, or a friend. If default
24119 arguments, or the body of the function have not yet been parsed,
24120 parse them now. */
24122 static void
24124 {
24126 /* If this member is a template, get the underlying
24127 FUNCTION_DECL. */
24131 /* There should not be any class definitions in progress at this
24132 point; the bodies of members are only parsed outside of all class
24133 definitions. */
24135 /* While we're parsing the member functions we might encounter more
24136 classes. We want to handle them right away, but we don't want
24137 them getting mixed up with functions that are currently in the
24138 queue. */
24141 /* Make sure that any template parameters are in scope. */
24144 /* If the body of the function has not yet been parsed, parse it
24145 now. */
24147 {
24148 tree function_scope;
24151 /* The function is no longer pending; we are processing it. */
24156 /* If this is a local class, enter the scope of the containing
24157 function. */
24162 /* Push the body of the function onto the lexer stack. */
24165 /* Let the front end know that we going to be defining this
24166 function. */
24170 /* Don't do access checking if it is a templated function. */
24174 /* #pragma omp declare reduction needs special parsing. */
24176 {
24181 }
24182 else
24183 /* Now, parse the body of the function. */
24190 /* Leave the scope of the containing function. */
24194 }
24196 /* Remove any template parameters from the symbol table. */
24199 /* Restore the queue. */
24202 }
24204 /* If DECL contains any default args, remember it on the unparsed
24205 functions queue. */
24207 static void
24209 {
24210 tree probe;
24213 probe;
24216 {
24220 }
24221 }
24223 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24224 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24225 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24226 from the parameter-type-list. */
24228 static tree
24231 {
24233 tree parsed_arg;
24239 /* Push the saved tokens for the default argument onto the parser's
24240 lexer stack. */
24246 /* Parse the default argument. */
24257 {
24258 /* In a non-template class, check conversions now. In a template,
24259 we'll wait and instantiate these as needed. */
24262 tf_warning_or_error);
24263 else
24265 }
24267 /* If the token stream has not been completely used up, then
24268 there was extra junk after the end of the default
24269 argument. */
24271 {
24274 else
24276 }
24278 /* Revert to the main lexer. */
24282 }
24284 /* FIELD is a non-static data member with an initializer which we saved for
24285 later; parse it now. */
24287 static void
24289 {
24290 tree def;
24297 NULL_TREE);
24303 }
24305 /* FN is a FUNCTION_DECL which may contains a parameter with an
24306 unparsed DEFAULT_ARG. Parse the default args now. This function
24307 assumes that the current scope is the scope in which the default
24308 argument should be processed. */
24310 static void
24312 {
24316 /* While we're parsing the default args, we might (due to the
24317 statement expression extension) encounter more classes. We want
24318 to handle them right away, but we don't want them getting mixed
24319 up with default args that are currently in the queue. */
24322 /* Local variable names (and the `this' keyword) may not appear
24323 in a default argument. */
24334 {
24336 tree parsed_arg;
24338 tree copy;
24345 /* This can happen for a friend declaration for a function
24346 already declared with default arguments. */
24349 parsed_arg
24351 default_arg,
24354 {
24356 }
24360 /* Update any instantiations we've already created. */
24364 }
24368 /* Make sure no default arg is missing. */
24371 /* Restore the state of local_variables_forbidden_p. */
24374 /* Restore the queue. */
24376 }
24378 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24380 sizeof ... ( identifier )
24382 where the 'sizeof' token has already been consumed. */
24384 static tree
24386 {
24387 /* Consume the `...'. */
24394 else
24402 /* The name is not qualified. */
24420 }
24422 /* Parse the operand of `sizeof' (or a similar operator). Returns
24423 either a TYPE or an expression, depending on the form of the
24424 input. The KEYWORD indicates which kind of expression we have
24425 encountered. */
24427 static tree
24429 {
24436 /* If it's a `...', then we are computing the length of a parameter
24437 pack. */
24442 /* Types cannot be defined in a `sizeof' expression. Save away the
24443 old message. */
24445 /* And create the new one. */
24451 /* The restrictions on constant-expressions do not apply inside
24452 sizeof expressions. */
24453 saved_integral_constant_expression_p
24455 saved_non_integral_constant_expression_p
24459 /* Do not actually evaluate the expression. */
24462 /* If it's a `(', then we might be looking at the type-id
24463 construction. */
24465 {
24468 /* We can't be sure yet whether we're looking at a type-id or an
24469 expression. */
24471 /* Note: as a GNU Extension, compound literals are considered
24472 postfix-expressions as they are in C99, so they are valid
24473 arguments to sizeof. See comment in cp_parser_cast_expression
24474 for details. */
24477 else
24478 {
24481 /* Look for the type-id. */
24483 /* Look for the closing `)'. */
24486 }
24488 /* If all went well, then we're done. */
24490 {
24491 cp_decl_specifier_seq decl_specs;
24493 /* Build a trivial decl-specifier-seq. */
24497 /* Call grokdeclarator to figure out what type this is. */
24500 TYPENAME,
24503 }
24504 }
24506 /* If the type-id production did not work out, then we must be
24507 looking at the unary-expression production. */
24511 /* Go back to evaluating expressions. */
24515 /* Free the message we created. */
24517 /* And restore the old one. */
24519 parser->integral_constant_expression_p
24521 parser->non_integral_constant_expression_p
24525 }
24527 /* If the current declaration has no declarator, return true. */
24529 static bool
24531 {
24532 /* If the next token is a `;' or a `,' then there is no
24533 declarator. */
24536 }
24538 /* Update the DECL_SPECS to reflect the storage class indicated by
24539 KEYWORD. */
24541 static void
24546 {
24547 cp_storage_class storage_class;
24550 {
24554 }
24556 {
24559 }
24564 {
24567 }
24570 {
24588 }
24592 /* A storage class specifier cannot be applied alongside a typedef
24593 specifier. If there is a typedef specifier present then set
24594 conflicting_specifiers_p which will trigger an error later
24595 on in grokdeclarator. */
24598 }
24600 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24601 is true, the type is a class or enum definition. */
24603 static void
24605 tree type_spec,
24608 {
24611 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24612 (with, for example, in "typedef int wchar_t;") we remember that
24613 this is what happened. In system headers, we ignore these
24614 declarations so that G++ can work with system headers that are not
24615 C++-safe. */
24617 && !type_definition_p
24627 {
24630 ds_redefined_builtin_type_spec,
24631 token);
24633 {
24637 }
24638 }
24641 else
24642 {
24647 }
24648 }
24650 /* True iff TOKEN is the GNU keyword __thread. */
24652 static bool
24654 {
24657 }
24659 /* Set the location for a declarator specifier and check if it is
24660 duplicated.
24662 DECL_SPECS is the sequence of declarator specifiers onto which to
24663 set the location.
24665 DS is the single declarator specifier to set which location is to
24666 be set onto the existing sequence of declarators.
24668 LOCATION is the location for the declarator specifier to
24669 consider. */
24671 static void
24674 {
24683 {
24687 }
24688 else
24689 {
24691 {
24695 else
24696 {
24699 OPT_Wlong_long,
24701 }
24702 }
24704 {
24709 else
24711 }
24712 else
24713 {
24729 "__complex"
24730 };
24733 }
24734 }
24735 }
24737 /* Return true iff the declarator specifier DS is present in the
24738 sequence of declarator specifiers DECL_SPECS. */
24740 bool
24742 cp_decl_spec ds)
24743 {
24750 }
24752 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24753 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24755 static bool
24757 {
24759 }
24761 /* Issue an error message indicating that TOKEN_DESC was expected.
24762 If KEYWORD is true, it indicated this function is called by
24763 cp_parser_require_keword and the required token can only be
24764 a indicated keyword. */
24766 static void
24768 required_token token_desc,
24770 {
24772 {
24841 }
24843 {
24845 {
24924 }
24925 }
24926 else
24928 }
24932 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24933 issue an error message indicating that TOKEN_DESC was expected.
24935 Returns the token consumed, if the token had the appropriate type.
24936 Otherwise, returns NULL. */
24941 required_token token_desc)
24942 {
24945 else
24946 {
24947 /* Output the MESSAGE -- unless we're parsing tentatively. */
24951 }
24952 }
24954 /* An error message is produced if the next token is not '>'.
24955 All further tokens are skipped until the desired token is
24956 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24958 static void
24960 {
24961 /* Current level of '< ... >'. */
24963 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24966 /* Are we ready, yet? If not, issue error message. */
24970 /* Skip tokens until the desired token is found. */
24972 {
24973 /* Peek at the next token. */
24975 {
24983 /* C++0x views the `>>' operator as two `>' tokens, but
24984 C++98 does not. */
24987 {
24988 /* We've hit a `>>' where the first `>' closes the
24989 template argument list, and the second `>' is
24990 spurious. Just consume the `>>' and stop; we've
24991 already produced at least one error. */
24994 }
24995 /* Fall through for C++0x, so we handle the second `>' in
24996 the `>>'. */
25000 {
25001 /* We've reached the token we want, consume it and stop. */
25004 }
25023 /* The '>' was probably forgotten, don't look further. */
25028 }
25030 /* Consume this token. */
25032 }
25033 }
25035 /* If the next token is the indicated keyword, consume it. Otherwise,
25036 issue an error message indicating that TOKEN_DESC was expected.
25038 Returns the token consumed, if the token had the appropriate type.
25039 Otherwise, returns NULL. */
25044 required_token token_desc)
25045 {
25049 {
25052 }
25055 }
25057 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25058 function-definition. */
25060 static bool
25062 {
25065 /* A ctor-initializer begins with a `:'. */
25067 /* A function-try-block begins with `try'. */
25069 /* A function-transaction-block begins with `__transaction_atomic'
25070 or `__transaction_relaxed'. */
25073 /* The named return value extension begins with `return'. */
25075 }
25077 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25078 definition. */
25080 static bool
25082 {
25089 }
25091 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25092 C++0x) ending a template-argument. */
25094 static bool
25096 {
25104 }
25106 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25107 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25109 static bool
25112 {
25118 /* Check for the sequence `<::' in the original code. It would be lexed as
25119 `[:', where `[' is a digraph, and there is no whitespace before
25120 `:'. */
25122 {
25127 }
25129 }
25131 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25132 or none_type otherwise. */
25134 static enum tag_types
25136 {
25138 {
25148 }
25149 }
25151 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25152 or none_type otherwise or if the token is null. */
25154 static enum tag_types
25156 {
25161 {
25169 }
25170 }
25172 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25174 static void
25176 {
25180 {
25184 type))
25187 }
25188 }
25190 /* Issue an error message if DECL is redeclared with different
25191 access than its original declaration [class.access.spec/3].
25192 This applies to nested classes and nested class templates.
25193 [class.mem/1]. */
25195 static void
25197 {
25206 }
25208 /* Look for the `template' keyword, as a syntactic disambiguator.
25209 Return TRUE iff it is present, in which case it will be
25210 consumed. */
25212 static bool
25214 {
25216 {
25217 /* In C++98 the `template' keyword can only be used within templates;
25218 outside templates the parser can always figure out what is a
25219 template and what is not. In C++11, per the resolution of DR 468,
25220 `template' is allowed in cases where it is not strictly necessary. */
25223 {
25226 "in C++98 %<template%> (as a disambiguator) is only "
25228 /* If this part of the token stream is rescanned, the same
25229 error message would be generated. So, we purge the token
25230 from the stream. */
25233 }
25234 else
25235 {
25236 /* Consume the `template' keyword. */
25239 }
25240 }
25242 }
25244 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25245 set PARSER->SCOPE, and perform other related actions. */
25247 static void
25249 {
25255 /* Get the stored value. */
25257 /* Perform any access checks that were deferred. */
25260 {
25265 }
25266 /* Set the scope from the stored value. */
25270 }
25272 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25273 encounter the end of a block before what we were looking for. */
25275 static bool
25279 {
25281 {
25284 /* Abort a parenthesized expression if we encounter a semicolon. */
25288 /* If we've reached the end of the file, stop. */
25294 /* We've hit the end of an enclosing block, so there's been some
25295 kind of syntax error. */
25298 /* Consume the token. */
25300 /* See if it starts a new group. */
25302 {
25304 /* In theory this should probably check end == '}', but
25305 cp_parser_save_member_function_body needs it to exit
25306 after either '}' or ')' when called with ')'. */
25309 }
25311 {
25315 }
25320 }
25321 }
25323 /* Like above, for caching a default argument or NSDMI. Both of these are
25324 terminated by a non-nested comma, but it can be unclear whether or not a
25325 comma is nested in a template argument list unless we do more parsing.
25326 In order to handle this ambiguity, when we encounter a ',' after a '<'
25327 we try to parse what follows as a parameter-declaration-list (in the
25328 case of a default argument) or a member-declarator (in the case of an
25329 NSDMI). If that succeeds, then we stop caching. */
25331 static tree
25333 {
25338 tree default_argument;
25340 /* Add tokens until we have processed the entire default
25341 argument. We add the range [first_token, token). */
25344 {
25345 /* For list-initialization, this is straightforward. */
25348 }
25350 {
25353 /* Peek at the next token. */
25355 /* What we do depends on what token we have. */
25357 {
25358 /* In valid code, a default argument must be
25359 immediately followed by a `,' `)', or `...'. */
25362 {
25363 /* If we've seen a '<', we might be in a
25364 template-argument-list. Until Core issue 325 is
25365 resolved, we don't know how this situation ought
25366 to be handled, so try to DTRT. We check whether
25367 what comes after the comma is a valid parameter
25368 declaration list. If it is, then the comma ends
25369 the default argument; otherwise the default
25370 argument continues. */
25373 /* Set ITALP so cp_parser_parameter_declaration_list
25374 doesn't decide to commit to this parse. */
25382 {
25389 }
25390 else
25391 {
25395 }
25402 }
25405 /* If we run into a non-nested `;', `}', or `]',
25406 then the code is invalid -- but the default
25407 argument is certainly over. */
25412 /* Handle correctly int n = sizeof ... ( p ); */
25415 /* Update DEPTH, if necessary. */
25430 /* This might be the comparison operator, or it might
25431 start a template argument list. */
25438 /* Fall through for C++0x, which treats the `>>'
25439 operator like two `>' tokens in certain
25440 cases. */
25444 {
25445 /* This might be an operator, or it might close a
25446 template argument list. But if a previous '<'
25447 started a template argument list, this will have
25448 closed it, so we can't be in one anymore. */
25452 }
25455 /* If we run out of tokens, issue an error message. */
25464 /* In these cases, we should look for template-ids.
25465 For example, if the default argument is
25466 `X<int, double>()', we need to do name lookup to
25467 figure out whether or not `X' is a template; if
25468 so, the `,' does not end the default argument.
25470 That is not yet done. */
25475 }
25477 /* If we've reached the end, stop. */
25481 /* Add the token to the token block. */
25483 }
25485 /* Create a DEFAULT_ARG to represent the unparsed default
25486 argument. */
25493 }
25495 /* Begin parsing tentatively. We always save tokens while parsing
25496 tentatively so that if the tentative parsing fails we can restore the
25497 tokens. */
25499 static void
25501 {
25502 /* Enter a new parsing context. */
25504 /* Begin saving tokens. */
25506 /* In order to avoid repetitive access control error messages,
25507 access checks are queued up until we are no longer parsing
25508 tentatively. */
25510 }
25512 /* Commit to the currently active tentative parse. */
25514 static void
25516 {
25520 /* Mark all of the levels as committed. */
25523 {
25530 }
25531 }
25533 /* Commit to the topmost currently active tentative parse.
25535 Note that this function shouldn't be called when there are
25536 irreversible side-effects while in a tentative state. For
25537 example, we shouldn't create a permanent entry in the symbol
25538 table, or issue an error message that might not apply if the
25539 tentative parse is aborted. */
25541 static void
25543 {
25548 {
25556 }
25557 }
25559 /* Abort the currently active tentative parse. All consumed tokens
25560 will be rolled back, and no diagnostics will be issued. */
25562 static void
25564 {
25568 /* Now, pretend that we want to see if the construct was
25569 successfully parsed. */
25571 }
25573 /* Stop parsing tentatively. If a parse error has occurred, restore the
25574 token stream. Otherwise, commit to the tokens we have consumed.
25575 Returns true if no error occurred; false otherwise. */
25577 static bool
25579 {
25583 /* Remember whether or not an error occurred, since we are about to
25584 destroy that information. */
25586 /* Remove the topmost context from the stack. */
25589 /* If no parse errors occurred, commit to the tentative parse. */
25591 {
25592 /* Commit to the tokens read tentatively, unless that was
25593 already done. */
25598 }
25599 /* Otherwise, if errors occurred, roll back our state so that things
25600 are just as they were before we began the tentative parse. */
25601 else
25602 {
25605 }
25606 /* Add the context to the front of the free list. */
25611 }
25613 /* Returns true if we are parsing tentatively and are not committed to
25614 this tentative parse. */
25616 static bool
25618 {
25621 }
25623 /* Returns nonzero iff an error has occurred during the most recent
25624 tentative parse. */
25626 static bool
25628 {
25631 }
25633 /* Returns nonzero if GNU extensions are allowed. */
25635 static bool
25637 {
25639 }
25640 \f
25641 /* Objective-C++ Productions */
25644 /* Parse an Objective-C expression, which feeds into a primary-expression
25645 above.
25647 objc-expression:
25648 objc-message-expression
25649 objc-string-literal
25650 objc-encode-expression
25651 objc-protocol-expression
25652 objc-selector-expression
25654 Returns a tree representation of the expression. */
25656 static tree
25658 {
25659 /* Try to figure out what kind of declaration is present. */
25663 {
25673 {
25685 }
25691 }
25694 }
25696 /* Parse an Objective-C message expression.
25698 objc-message-expression:
25699 [ objc-message-receiver objc-message-args ]
25701 Returns a representation of an Objective-C message. */
25703 static tree
25705 {
25714 }
25716 /* Parse an objc-message-receiver.
25718 objc-message-receiver:
25719 expression
25720 simple-type-specifier
25722 Returns a representation of the type or expression. */
25724 static tree
25726 {
25727 tree rcv;
25729 /* An Objective-C message receiver may be either (1) a type
25730 or (2) an expression. */
25734 /* If that worked out, fine. */
25741 CP_PARSER_FLAGS_NONE);
25748 }
25750 /* Parse the arguments and selectors comprising an Objective-C message.
25752 objc-message-args:
25753 objc-selector
25754 objc-selector-args
25755 objc-selector-args , objc-comma-args
25757 objc-selector-args:
25758 objc-selector [opt] : assignment-expression
25759 objc-selector-args objc-selector [opt] : assignment-expression
25761 objc-comma-args:
25762 assignment-expression
25763 objc-comma-args , assignment-expression
25765 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25766 selector arguments and TREE_VALUE containing a list of comma
25767 arguments. */
25769 static tree
25771 {
25777 {
25783 /* Detect if we have a unary selector. */
25792 sel_args
25797 }
25799 /* Handle non-selector arguments, if any. */
25801 {
25802 tree arg;
25807 addl_args
25812 }
25815 {
25818 }
25821 }
25823 /* Parse an Objective-C encode expression.
25825 objc-encode-expression:
25826 @encode objc-typename
25828 Returns an encoded representation of the type argument. */
25830 static tree
25832 {
25833 tree type;
25843 {
25847 }
25849 /* This happens if we find @encode(T) (where T is a template
25850 typename or something dependent on a template typename) when
25851 parsing a template. In that case, we can't compile it
25852 immediately, but we rather create an AT_ENCODE_EXPR which will
25853 need to be instantiated when the template is used.
25854 */
25856 {
25860 }
25863 }
25865 /* Parse an Objective-C @defs expression. */
25867 static tree
25869 {
25870 tree name;
25878 }
25880 /* Parse an Objective-C protocol expression.
25882 objc-protocol-expression:
25883 @protocol ( identifier )
25885 Returns a representation of the protocol expression. */
25887 static tree
25889 {
25890 tree proto;
25898 }
25900 /* Parse an Objective-C selector expression.
25902 objc-selector-expression:
25903 @selector ( objc-method-signature )
25905 objc-method-signature:
25906 objc-selector
25907 objc-selector-seq
25909 objc-selector-seq:
25910 objc-selector :
25911 objc-selector-seq objc-selector :
25913 Returns a representation of the method selector. */
25915 static tree
25917 {
25929 {
25938 {
25939 /* Detect if we have a unary selector. */
25941 {
25944 }
25945 else
25946 {
25948 }
25949 }
25954 {
25955 sel_seq
25958 sel_seq
25961 }
25962 else
25963 sel_seq
25968 }
25970 finish_selector:
25974 }
25976 /* Parse a list of identifiers.
25978 objc-identifier-list:
25979 identifier
25980 objc-identifier-list , identifier
25982 Returns a TREE_LIST of identifier nodes. */
25984 static tree
25986 {
25987 tree identifier;
25988 tree list;
25999 {
26006 identifier));
26008 }
26011 }
26013 /* Parse an Objective-C alias declaration.
26015 objc-alias-declaration:
26016 @compatibility_alias identifier identifier ;
26018 This function registers the alias mapping with the Objective-C front end.
26019 It returns nothing. */
26021 static void
26023 {
26031 }
26033 /* Parse an Objective-C class forward-declaration.
26035 objc-class-declaration:
26036 @class objc-identifier-list ;
26038 The function registers the forward declarations with the Objective-C
26039 front end. It returns nothing. */
26041 static void
26043 {
26046 {
26047 tree id;
26057 else
26059 }
26061 }
26063 /* Parse a list of Objective-C protocol references.
26065 objc-protocol-refs-opt:
26066 objc-protocol-refs [opt]
26068 objc-protocol-refs:
26069 < objc-identifier-list >
26071 Returns a TREE_LIST of identifiers, if any. */
26073 static tree
26075 {
26079 {
26083 }
26086 }
26088 /* Parse a Objective-C visibility specification. */
26090 static void
26092 {
26096 {
26111 }
26113 /* Eat '@private'/'@protected'/'@public'. */
26115 }
26117 /* Parse an Objective-C method type. Return 'true' if it is a class
26118 (+) method, and 'false' if it is an instance (-) method. */
26122 {
26125 else
26127 }
26129 /* Parse an Objective-C protocol qualifier. */
26131 static tree
26133 {
26146 {
26151 }
26154 }
26156 /* Parse an Objective-C typename. */
26158 static tree
26160 {
26164 {
26170 /* An ObjC type name may consist of just protocol qualifiers, in which
26171 case the type shall default to 'id'. */
26173 {
26176 /* If the type could not be parsed, an error has already
26177 been produced. For error recovery, behave as if it had
26178 not been specified, which will use the default type
26179 'id'. */
26181 {
26183 /* We need to skip to the closing parenthesis as
26184 cp_parser_type_id() does not seem to do it for
26185 us. */
26190 }
26191 }
26195 }
26198 }
26200 /* Check to see if TYPE refers to an Objective-C selector name. */
26202 static bool
26204 {
26210 }
26212 /* Parse an Objective-C selector. */
26214 static tree
26216 {
26220 {
26223 }
26225 /* C++ operator names are allowed to appear in ObjC selectors. */
26227 {
26240 }
26241 }
26243 /* Parse an Objective-C params list. */
26245 static tree
26247 {
26253 {
26263 /* Detect if we have a unary selector. */
26266 {
26269 }
26273 {
26274 /* Something went quite wrong. There should be a colon
26275 here, but there is not. Stop parsing parameters. */
26277 }
26279 /* New ObjC allows attributes on parameters too. */
26284 params
26287 type_name,
26288 identifier,
26289 parm_attr));
26292 }
26295 {
26298 }
26300 /* We allow tail attributes for the method. */
26302 {
26310 }
26313 {
26316 }
26318 }
26320 /* Parse the non-keyword Objective-C params. */
26322 static tree
26325 {
26331 {
26333 tree parm;
26339 {
26344 }
26346 /* TODO: parse attributes for tail parameters. */
26355 }
26357 /* We allow tail attributes for the method. */
26359 {
26361 {
26366 }
26367 else
26368 /* We have an error, but parse the attributes, so that we can
26369 carry on. */
26375 }
26378 }
26380 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26382 static void
26384 {
26387 /* If the next token is `extern' and the following token is a string
26388 literal, then we have a linkage specification. */
26390 && cp_parser_is_pure_string_literal
26393 /* Handle #pragma, if any. */
26396 /* Allow stray semicolons. */
26399 /* Mark methods as optional or required, when building protocols. */
26401 {
26404 }
26406 {
26409 }
26412 /* Other stray characters must generate errors. */
26414 {
26418 }
26419 /* Finally, try to parse a block-declaration, or a function-definition. */
26420 else
26422 }
26424 /* Parse a method signature. */
26426 static tree
26428 {
26444 }
26446 static bool
26448 {
26449 tree tattr;
26454 /* If the attributes are followed by a method introducer, this is not allowed.
26455 Dump the attributes and flag the situation. */
26460 /* Otherwise, the attributes introduce some interstitial code, possibly so
26461 rewind to allow that check. */
26464 }
26466 /* Parse an Objective-C method prototype list. */
26468 static void
26470 {
26474 {
26476 {
26481 else
26485 {
26489 }
26492 }
26498 OPT_Wattributes,
26500 else
26501 /* Allow for interspersed non-ObjC++ code. */
26505 }
26509 else
26513 }
26515 /* Parse an Objective-C method definition list. */
26517 static void
26519 {
26523 {
26524 tree meth;
26527 {
26533 else
26538 {
26542 }
26544 NULL_TREE);
26546 /* For historical reasons, we accept an optional semicolon. */
26553 {
26560 }
26561 }
26562 /* The following case will be removed once @synthesize is
26563 completely implemented. */
26574 else
26575 /* Allow for interspersed non-ObjC++ code. */
26579 }
26583 else
26587 }
26589 /* Parse Objective-C ivars. */
26591 static void
26593 {
26604 {
26605 cp_decl_specifier_seq declspecs;
26607 tree prefix_attributes;
26615 CP_PARSER_FLAGS_OPTIONAL,
26619 /* auto, register, static, extern, mutable. */
26621 {
26624 }
26626 /* thread_local. */
26628 {
26631 }
26633 /* typedef. */
26635 {
26638 }
26643 /* Keep going until we hit the `;' at the end of the
26644 declaration. */
26646 {
26651 /* Check for a (possibly unnamed) bitfield declaration. */
26659 {
26660 /* Get the name of the bitfield. */
26663 sfk_none);
26665 eat_colon:
26667 /* Get the width of the bitfield. */
26668 width
26671 }
26672 else
26673 {
26674 /* Parse the declarator. */
26675 declarator
26681 }
26683 /* Look for attributes that apply to the ivar. */
26685 /* Remember which attributes are prefix attributes and
26686 which are not. */
26688 /* Combine the attributes. */
26692 /* Create the bitfield declaration. */
26694 width,
26695 attributes);
26696 else
26701 /* Add the instance variable. */
26705 /* Reset PREFIX_ATTRIBUTES. */
26714 {
26717 }
26719 }
26723 }
26728 /* Do not consume the RID_AT_END, so it will be read again as terminating
26729 the @interface of @implementation. */
26733 /* For historical reasons, we accept an optional semicolon. */
26736 }
26738 /* Parse an Objective-C protocol declaration. */
26740 static void
26742 {
26748 {
26753 }
26755 /* See if we have a forward declaration or a definition. */
26758 /* Try a forward declaration first. */
26760 {
26762 {
26763 tree id;
26773 else
26775 }
26777 }
26779 /* Ok, we got a full-fledged definition (or at least should). */
26780 else
26781 {
26786 }
26787 }
26789 /* Parse an Objective-C superclass or category. */
26791 static void
26796 {
26802 {
26805 }
26807 {
26810 /* If there is no category name, and this is an @interface, we
26811 have a class extension. */
26813 {
26816 }
26817 else
26821 }
26822 }
26824 /* Parse an Objective-C class interface. */
26826 static void
26828 {
26835 {
26836 /* It's hard to recover because even if valid @interface stuff
26837 is to follow, we can't compile it (or validate it) if we
26838 don't even know which class it refers to. Let's assume this
26839 was a stray '@interface' token in the stream and skip it.
26840 */
26842 }
26847 /* We have either a class or a category on our hands. */
26850 else
26851 {
26853 /* Handle instance variable declarations, if any. */
26856 }
26859 }
26861 /* Parse an Objective-C class implementation. */
26863 static void
26865 {
26872 {
26873 /* It's hard to recover because even if valid @implementation
26874 stuff is to follow, we can't compile it (or validate it) if
26875 we don't even know which class it refers to. Let's assume
26876 this was a stray '@implementation' token in the stream and
26877 skip it.
26878 */
26880 }
26884 /* We have either a class or a category on our hands. */
26887 else
26888 {
26890 /* Handle instance variable declarations, if any. */
26893 }
26896 }
26898 /* Consume the @end token and finish off the implementation. */
26900 static void
26902 {
26905 }
26907 /* Parse an Objective-C declaration. */
26909 static void
26911 {
26912 /* Try to figure out what kind of declaration is present. */
26917 {
26933 }
26936 {
26959 }
26960 }
26962 /* Parse an Objective-C try-catch-finally statement.
26964 objc-try-catch-finally-stmt:
26965 @try compound-statement objc-catch-clause-seq [opt]
26966 objc-finally-clause [opt]
26968 objc-catch-clause-seq:
26969 objc-catch-clause objc-catch-clause-seq [opt]
26971 objc-catch-clause:
26972 @catch ( objc-exception-declaration ) compound-statement
26974 objc-finally-clause:
26975 @finally compound-statement
26977 objc-exception-declaration:
26978 parameter-declaration
26979 '...'
26981 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26983 Returns NULL_TREE.
26985 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26986 for C. Keep them in sync. */
26988 static tree
26990 {
26991 location_t location;
26992 tree stmt;
26997 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26998 node, lest it get absorbed into the surrounding block. */
27004 {
27013 {
27014 /* We have "@catch (...)" (where the '...' are literally
27015 what is in the code). Skip the '...'.
27016 parameter_declaration is set to NULL_TREE, and
27017 objc_being_catch_clauses() knows that that means
27018 '...'. */
27021 }
27022 else
27023 {
27024 /* We have "@catch (NSException *exception)" or something
27025 like that. Parse the parameter declaration. */
27029 else
27034 }
27037 else
27038 {
27039 /* If there was no open parenthesis, we are recovering from
27040 an error, and we are trying to figure out what mistake
27041 the user has made. */
27043 /* If there is an immediate closing parenthesis, the user
27044 probably forgot the opening one (ie, they typed "@catch
27045 NSException *e)". Parse the closing parenthesis and keep
27046 going. */
27050 /* If these is no immediate closing parenthesis, the user
27051 probably doesn't know that parenthesis are required at
27052 all (ie, they typed "@catch NSException *e"). So, just
27053 forget about the closing parenthesis and keep going. */
27054 }
27058 }
27060 {
27063 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27064 node, lest it get absorbed into the surrounding block. */
27068 }
27071 }
27073 /* Parse an Objective-C synchronized statement.
27075 objc-synchronized-stmt:
27076 @synchronized ( expression ) compound-statement
27078 Returns NULL_TREE. */
27080 static tree
27082 {
27083 location_t location;
27094 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27095 node, lest it get absorbed into the surrounding block. */
27100 }
27102 /* Parse an Objective-C throw statement.
27104 objc-throw-stmt:
27105 @throw assignment-expression [opt] ;
27107 Returns a constructed '@throw' statement. */
27109 static tree
27111 {
27123 }
27125 /* Parse an Objective-C statement. */
27127 static tree
27129 {
27130 /* Try to figure out what kind of declaration is present. */
27134 {
27145 }
27148 }
27150 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27151 look ahead to see if an objc keyword follows the attributes. This
27152 is to detect the use of prefix attributes on ObjC @interface and
27153 @protocol. */
27155 static bool
27157 {
27162 {
27165 }
27168 }
27170 /* This routine is a minimal replacement for
27171 c_parser_struct_declaration () used when parsing the list of
27172 types/names or ObjC++ properties. For example, when parsing the
27173 code
27175 @property (readonly) int a, b, c;
27177 this function is responsible for parsing "int a, int b, int c" and
27178 returning the declarations as CHAIN of DECLs.
27180 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27181 similar parsing. */
27182 static tree
27184 {
27186 cp_decl_specifier_seq declspecs;
27188 tree prefix_attributes;
27191 CP_PARSER_FLAGS_NONE,
27198 /* auto, register, static, extern, mutable. */
27200 {
27203 }
27205 /* thread_local. */
27207 {
27210 }
27212 /* typedef. */
27214 {
27217 }
27222 /* Keep going until we hit the `;' at the end of the declaration. */
27224 {
27229 /* Parse the declarator. */
27233 /* Look for attributes that apply to the ivar. */
27235 /* Remember which attributes are prefix attributes and
27236 which are not. */
27238 /* Combine the attributes. */
27248 /* Reset PREFIX_ATTRIBUTES. */
27259 {
27262 }
27263 else
27265 }
27267 }
27269 /* Parse an Objective-C @property declaration. The syntax is:
27271 objc-property-declaration:
27272 '@property' objc-property-attributes[opt] struct-declaration ;
27274 objc-property-attributes:
27275 '(' objc-property-attribute-list ')'
27277 objc-property-attribute-list:
27278 objc-property-attribute
27279 objc-property-attribute-list, objc-property-attribute
27281 objc-property-attribute
27282 'getter' = identifier
27283 'setter' = identifier
27284 'readonly'
27285 'readwrite'
27286 'assign'
27287 'retain'
27288 'copy'
27289 'nonatomic'
27291 For example:
27292 @property NSString *name;
27293 @property (readonly) id object;
27294 @property (retain, nonatomic, getter=getTheName) id name;
27295 @property int a, b, c;
27297 PS: This function is identical to
27298 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27299 static void
27301 {
27302 /* The following variables hold the attributes of the properties as
27303 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27304 seen. When we see an attribute, we set them to 'true' (if they
27305 are boolean properties) or to the identifier (if they have an
27306 argument, ie, for getter and setter). Note that here we only
27307 parse the list of attributes, check the syntax and accumulate the
27308 attributes that we find. objc_add_property_declaration() will
27309 then process the information. */
27319 /* 'properties' is the list of properties that we read. Usually a
27320 single one, but maybe more (eg, in "@property int a, b, c;" there
27321 are three). */
27322 tree properties;
27323 location_t loc;
27329 /* Parse the optional attribute list... */
27331 {
27332 /* Eat the '('. */
27336 {
27342 {
27345 }
27349 {
27360 {
27364 else
27369 }
27372 {
27376 }
27378 {
27380 {
27383 }
27384 else
27388 else
27390 }
27391 else
27392 {
27394 {
27397 }
27398 else
27400 }
27406 }
27413 else
27415 }
27417 /* FIXME: "@property (setter, assign);" will generate a spurious
27418 "error: expected ‘)’ before ‘,’ token". This is because
27419 cp_parser_require, unlike the C counterpart, will produce an
27420 error even if we are in error recovery. */
27422 {
27427 }
27428 }
27430 /* ... and the property declaration(s). */
27434 {
27436 /* If the next token is now a `;', consume it. */
27440 }
27444 else
27445 {
27446 /* Comma-separated properties are chained together in
27447 reverse order; add them one by one. */
27456 }
27459 }
27461 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27463 objc-synthesize-declaration:
27464 @synthesize objc-synthesize-identifier-list ;
27466 objc-synthesize-identifier-list:
27467 objc-synthesize-identifier
27468 objc-synthesize-identifier-list, objc-synthesize-identifier
27470 objc-synthesize-identifier
27471 identifier
27472 identifier = identifier
27474 For example:
27475 @synthesize MyProperty;
27476 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27478 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27479 for C. Keep them in sync.
27480 */
27481 static void
27483 {
27485 location_t loc;
27490 {
27494 {
27497 }
27499 {
27503 {
27506 }
27507 }
27508 else
27513 else
27515 }
27518 }
27520 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27522 objc-dynamic-declaration:
27523 @dynamic identifier-list ;
27525 For example:
27526 @dynamic MyProperty;
27527 @dynamic MyProperty, AnotherProperty;
27529 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27530 for C. Keep them in sync.
27531 */
27532 static void
27534 {
27536 location_t loc;
27541 {
27542 tree property;
27545 {
27548 }
27552 else
27554 }
27557 }
27559 \f
27560 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27562 /* Returns name of the next clause.
27563 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27564 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27565 returned and the token is consumed. */
27567 static pragma_omp_clause
27569 {
27583 {
27588 {
27731 }
27732 }
27738 }
27740 /* Validate that a clause of the given type does not already exist. */
27742 static void
27745 {
27746 tree c;
27750 {
27753 }
27754 }
27756 /* OpenMP 2.5:
27757 variable-list:
27758 identifier
27759 variable-list , identifier
27761 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27762 colon). An opening parenthesis will have been consumed by the caller.
27764 If KIND is nonzero, create the appropriate node and install the decl
27765 in OMP_CLAUSE_DECL and add the node to the head of the list.
27767 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27768 return the list created.
27770 COLON can be NULL if only closing parenthesis should end the list,
27771 or pointer to bool which will receive false if the list is terminated
27772 by closing parenthesis or true if the list is terminated by colon. */
27774 static tree
27777 {
27781 {
27784 }
27786 {
27803 {
27805 {
27808 {
27812 }
27813 /* FALL THROUGH. */
27819 {
27827 parser->colon_corrects_to_scope_p
27831 else
27832 {
27833 /* Look for `:'. */
27837 CPP_CLOSE_SQUARE))
27839 }
27840 /* So we need here fully folded values. */
27845 /* Look for the closing `]'. */
27847 RT_CLOSE_SQUARE))
27851 {
27854 {
27858 }
27862 {
27866 }
27867 }
27870 }
27874 }
27880 }
27881 else
27884 get_comma:
27888 }
27894 {
27898 }
27901 {
27904 /* Try to resync to an unnested comma. Copied from
27905 cp_parser_parenthesized_expression_list. */
27906 skip_comma:
27915 }
27918 }
27920 /* Similarly, but expect leading and trailing parenthesis. This is a very
27921 common case for omp clauses. */
27923 static tree
27925 {
27929 }
27931 /* OpenACC 2.0:
27932 copy ( variable-list )
27933 copyin ( variable-list )
27934 copyout ( variable-list )
27935 create ( variable-list )
27936 delete ( variable-list )
27937 present ( variable-list )
27938 present_or_copy ( variable-list )
27939 pcopy ( variable-list )
27940 present_or_copyin ( variable-list )
27941 pcopyin ( variable-list )
27942 present_or_copyout ( variable-list )
27943 pcopyout ( variable-list )
27944 present_or_create ( variable-list )
27945 pcreate ( variable-list ) */
27947 static tree
27949 tree list)
27950 {
27953 {
27993 }
28001 }
28003 /* OpenACC 2.0:
28004 deviceptr ( variable-list ) */
28006 static tree
28008 {
28012 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28013 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28014 variable-list must only allow for pointer variables. */
28017 {
28020 /* FIXME diagnostics: Ideally we should keep individual
28021 locations for all the variables in the var list to make the
28022 following errors more precise. Perhaps
28023 c_parser_omp_var_list_parens should construct a list of
28024 locations to go along with the var list. */
28029 ;
28038 }
28041 }
28043 /* OpenACC:
28044 vector_length ( expression ) */
28046 static tree
28048 {
28058 {
28061 }
28064 {
28069 }
28072 location);
28080 }
28082 /* OpenACC 2.0
28083 Parse wait clause or directive parameters. */
28085 static tree
28087 {
28097 {
28102 }
28109 {
28113 {
28116 else
28117 {
28124 }
28125 }
28126 }
28129 }
28131 /* OpenACC:
28132 wait ( int-expr-list ) */
28134 static tree
28136 {
28145 }
28147 /* OpenMP 3.0:
28148 collapse ( constant-expression ) */
28150 static tree
28152 {
28154 location_t loc;
28155 HOST_WIDE_INT n;
28176 {
28179 }
28187 }
28189 /* OpenMP 2.5:
28190 default ( shared | none ) */
28192 static tree
28194 {
28196 tree c;
28201 {
28206 {
28221 }
28224 }
28225 else
28226 {
28227 invalid_kind:
28229 }
28245 }
28247 /* OpenMP 3.1:
28248 final ( expression ) */
28250 static tree
28252 {
28273 }
28275 /* OpenMP 2.5:
28276 if ( expression ) */
28278 static tree
28280 {
28301 }
28303 /* OpenMP 3.1:
28304 mergeable */
28306 static tree
28309 {
28310 tree c;
28313 location);
28318 }
28320 /* OpenMP 2.5:
28321 nowait */
28323 static tree
28326 {
28327 tree c;
28334 }
28336 /* OpenACC:
28337 num_gangs ( expression ) */
28339 static tree
28341 {
28357 {
28360 }
28370 }
28372 /* OpenMP 2.5:
28373 num_threads ( expression ) */
28375 static tree
28377 location_t location)
28378 {
28400 }
28402 /* OpenACC:
28403 num_workers ( expression ) */
28405 static tree
28407 {
28423 {
28426 }
28429 location);
28437 }
28439 /* OpenMP 2.5:
28440 ordered */
28442 static tree
28445 {
28446 tree c;
28454 }
28456 /* OpenMP 2.5:
28457 reduction ( reduction-operator : variable-list )
28459 reduction-operator:
28460 One of: + * - & ^ | && ||
28462 OpenMP 3.1:
28464 reduction-operator:
28465 One of: + * - & ^ | && || min max
28467 OpenMP 4.0:
28469 reduction-operator:
28470 One of: + * - & ^ | && ||
28471 id-expression */
28473 static tree
28475 {
28483 {
28493 }
28497 else
28498 {
28509 {
28539 }
28540 else
28541 {
28543 resync_fail:
28548 }
28549 }
28555 NULL);
28557 {
28560 }
28563 }
28565 /* OpenMP 2.5:
28566 schedule ( schedule-kind )
28567 schedule ( schedule-kind , expression )
28569 schedule-kind:
28570 static | dynamic | guided | runtime | auto */
28572 static tree
28574 {
28583 {
28588 {
28609 }
28610 }
28615 else
28620 {
28635 else
28640 }
28648 invalid_kind:
28650 resync_fail:
28655 }
28657 /* OpenMP 3.0:
28658 untied */
28660 static tree
28663 {
28664 tree c;
28671 }
28673 /* OpenMP 4.0:
28674 inbranch
28675 notinbranch */
28677 static tree
28680 {
28685 }
28687 /* OpenMP 4.0:
28688 parallel
28689 for
28690 sections
28691 taskgroup */
28693 static tree
28697 {
28701 }
28703 /* OpenMP 4.0:
28704 num_teams ( expression ) */
28706 static tree
28708 location_t location)
28709 {
28731 }
28733 /* OpenMP 4.0:
28734 thread_limit ( expression ) */
28736 static tree
28738 location_t location)
28739 {
28761 }
28763 /* OpenMP 4.0:
28764 aligned ( variable-list )
28765 aligned ( variable-list : constant-expression ) */
28767 static tree
28769 {
28780 {
28791 }
28797 }
28799 /* OpenMP 4.0:
28800 linear ( variable-list )
28801 linear ( variable-list : expression ) */
28803 static tree
28806 {
28817 {
28821 {
28824 }
28832 }
28838 }
28840 /* OpenMP 4.0:
28841 safelen ( constant-expression ) */
28843 static tree
28845 location_t location)
28846 {
28868 }
28870 /* OpenMP 4.0:
28871 simdlen ( constant-expression ) */
28873 static tree
28875 location_t location)
28876 {
28898 }
28900 /* OpenMP 4.0:
28901 depend ( depend-kind : variable-list )
28903 depend-kind:
28904 in | out | inout */
28906 static tree
28908 {
28916 {
28926 else
28928 }
28929 else
28937 NULL);
28944 invalid_kind:
28946 resync_fail:
28951 }
28953 /* OpenMP 4.0:
28954 map ( map-kind : variable-list )
28955 map ( variable-list )
28957 map-kind:
28958 alloc | to | from | tofrom */
28960 static tree
28962 {
28971 {
28983 else
28984 {
28990 }
28993 }
28996 NULL);
29002 }
29004 /* OpenMP 4.0:
29005 device ( expression ) */
29007 static tree
29009 location_t location)
29010 {
29032 }
29034 /* OpenMP 4.0:
29035 dist_schedule ( static )
29036 dist_schedule ( static , expression ) */
29038 static tree
29040 location_t location)
29041 {
29054 {
29065 }
29070 location);
29074 invalid_kind:
29076 resync_fail:
29081 }
29083 /* OpenMP 4.0:
29084 proc_bind ( proc-bind-kind )
29086 proc-bind-kind:
29087 master | close | spread */
29089 static tree
29091 location_t location)
29092 {
29093 tree c;
29100 {
29110 else
29112 }
29113 else
29122 location);
29127 invalid_kind:
29129 resync_fail:
29134 }
29136 /* OpenACC:
29137 async [( int-expr )] */
29139 static tree
29141 {
29148 {
29157 }
29167 }
29169 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29170 is a bitmask in MASK. Return the list of clauses found. */
29172 static tree
29176 {
29181 {
29182 location_t here;
29183 pragma_omp_clause c_kind;
29194 {
29286 }
29291 {
29292 /* Remove the invalid clause(s) from the list to avoid
29293 confusing the rest of the compiler. */
29296 }
29297 }
29299 saw_error:
29306 }
29308 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29309 is a bitmask in MASK. Return the list of clauses found; the result
29310 of clause default goes in *pdefault. */
29312 static tree
29316 {
29323 {
29324 pragma_omp_clause c_kind;
29335 {
29347 clauses);
29361 clauses);
29370 clauses);
29394 clauses);
29408 clauses);
29425 OMP_CLAUSE_NOTINBRANCH,
29434 {
29435 clause_not_first:
29439 }
29464 clauses);
29469 clauses);
29474 clauses);
29537 }
29542 {
29543 /* Remove the invalid clause(s) from the list to avoid
29544 confusing the rest of the compiler. */
29547 }
29548 }
29549 saw_error:
29550 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29551 no reason to skip to the end. */
29557 }
29559 /* OpenMP 2.5:
29560 structured-block:
29561 statement
29563 In practice, we're also interested in adding the statement to an
29564 outer node. So it is convenient if we work around the fact that
29565 cp_parser_statement calls add_stmt. */
29567 static unsigned
29569 {
29572 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29573 This preserves the "not within loop or switch" style error messages
29574 for nonsense cases like
29575 void foo() {
29576 #pragma omp single
29577 break;
29578 }
29579 */
29584 }
29586 static void
29588 {
29590 }
29592 static tree
29594 {
29602 }
29604 /* OpenMP 2.5:
29605 # pragma omp atomic new-line
29606 expression-stmt
29608 expression-stmt:
29609 x binop= expr | x++ | ++x | x-- | --x
29610 binop:
29611 +, *, -, /, &, ^, |, <<, >>
29613 where x is an lvalue expression with scalar type.
29615 OpenMP 3.1:
29616 # pragma omp atomic new-line
29617 update-stmt
29619 # pragma omp atomic read new-line
29620 read-stmt
29622 # pragma omp atomic write new-line
29623 write-stmt
29625 # pragma omp atomic update new-line
29626 update-stmt
29628 # pragma omp atomic capture new-line
29629 capture-stmt
29631 # pragma omp atomic capture new-line
29632 capture-block
29634 read-stmt:
29635 v = x
29636 write-stmt:
29637 x = expr
29638 update-stmt:
29639 expression-stmt | x = x binop expr
29640 capture-stmt:
29641 v = expression-stmt
29642 capture-block:
29643 { v = x; update-stmt; } | { update-stmt; v = x; }
29645 OpenMP 4.0:
29646 update-stmt:
29647 expression-stmt | x = x binop expr | x = expr binop x
29648 capture-stmt:
29649 v = update-stmt
29650 capture-block:
29651 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29653 where x and v are lvalue expressions with scalar type. */
29655 static void
29657 {
29665 {
29670 {
29676 }
29677 }
29679 {
29691 else
29695 }
29697 {
29703 {
29708 {
29711 }
29712 }
29713 }
29717 {
29727 else
29732 {
29733 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29734 opcode. */
29739 }
29743 {
29746 }
29747 else
29748 {
29754 }
29757 }
29759 restart:
29763 {
29770 /* FALLTHROUGH */
29780 /* FALLTHROUGH */
29795 /* Undo effects of boolean_increment for post {in,de}crement. */
29797 /* FALLTHRU */
29801 {
29802 /* Undo effects of boolean_increment. */
29804 {
29805 /* This is pre or post increment. */
29810 && !structured_block
29814 }
29815 }
29816 /* FALLTHRU */
29819 {
29854 {
29858 }
29861 {
29867 {
29872 }
29874 {
29886 {
29888 {
29893 }
29894 else
29896 }
29900 }
29903 {
29910 }
29914 }
29918 {
29921 {
29929 }
29931 {
29936 }
29971 }
29982 /* FALLTHROUGH */
29987 }
29994 }
29995 stmt_done:
29997 {
30008 }
30010 {
30013 }
30014 done:
30020 saw_error:
30023 {
30027 {
30031 }
30032 }
30033 }
30036 /* OpenMP 2.5:
30037 # pragma omp barrier new-line */
30039 static void
30041 {
30044 }
30046 /* OpenMP 2.5:
30047 # pragma omp critical [(name)] new-line
30048 structured-block */
30050 static tree
30052 {
30056 {
30068 }
30073 }
30075 /* OpenMP 2.5:
30076 # pragma omp flush flush-vars[opt] new-line
30078 flush-vars:
30079 ( variable-list ) */
30081 static void
30083 {
30089 }
30091 /* Helper function, to parse omp for increment expression. */
30093 static tree
30095 {
30100 {
30103 }
30106 {
30115 /* Fall through: OpenMP disallows NE_EXPR. */
30118 }
30120 /* If decl is an iterator, preserve LHS and RHS of the relational
30121 expr until finish_omp_for. */
30131 }
30133 /* Helper function, to parse omp for increment expression. */
30135 static tree
30137 {
30141 cp_id_kind idk;
30145 {
30153 }
30161 {
30166 }
30173 {
30177 }
30189 do
30190 {
30197 {
30199 {
30202 else
30204 tf_warning_or_error);
30207 }
30208 else
30211 }
30212 }
30216 {
30220 }
30221 else
30225 }
30227 /* Parse the initialization statement of either an OpenMP for loop or
30228 a Cilk Plus for loop.
30230 Return true if the resulting construct should have an
30231 OMP_CLAUSE_PRIVATE added to it. */
30233 static bool
30241 {
30247 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30249 init-expr:
30250 var = lb
30251 integer-type var = lb
30252 random-access-iterator-type var = lb
30253 pointer-type var = lb
30254 */
30255 cp_decl_specifier_seq type_specifiers;
30257 /* First, try to parse as an initialized declaration. See
30258 cp_parser_condition, from whence the bulk of this is copied. */
30265 {
30266 /* If parsing a type specifier seq succeeded, then this
30267 MUST be a initialized declaration. */
30272 CP_PARSER_DECLARATOR_NAMED,
30283 else
30284 {
30294 {
30296 CPP_OPEN_PAREN))
30297 {
30301 else
30304 }
30305 else
30306 /* Trigger an error. */
30311 }
30315 {
30323 {
30326 auto_node);
30331 }
30334 asm_specification,
30335 LOOKUP_ONLYCONVERTING);
30337 {
30340 }
30341 else
30344 }
30345 else
30346 {
30347 /* Consume '='. */
30351 non_class:
30354 else
30357 asm_specification,
30358 LOOKUP_ONLYCONVERTING);
30359 }
30363 }
30364 }
30365 else
30366 {
30367 cp_id_kind idk;
30368 /* If parsing a type specifier sequence failed, then
30369 this MUST be a simple expression. */
30377 && decl
30380 {
30381 tree rhs;
30388 rhs,
30389 tf_warning_or_error));
30391 }
30392 else
30393 {
30398 {
30402 }
30403 }
30404 }
30406 }
30408 /* Parse the restricted form of the for statement allowed by OpenMP. */
30410 static tree
30413 {
30417 location_t loc_first;
30436 {
30439 location_t loc;
30443 {
30446 }
30449 {
30452 }
30461 add_private_clause
30468 {
30471 {
30477 }
30478 else
30480 }
30487 {
30492 {
30496 }
30499 {
30500 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30501 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30506 {
30509 }
30510 else
30511 {
30514 }
30518 }
30519 else
30520 {
30525 }
30526 }
30529 {
30530 tree c;
30532 {
30541 decl);
30545 decl);
30546 }
30548 {
30553 {
30556 }
30557 }
30558 }
30567 {
30568 /* If decl is an iterator, preserve the operator on decl
30569 until finish_omp_for. */
30571 && ((processing_template_decl
30575 else
30579 }
30594 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30595 in between the collapsed for loops to be still considered perfectly
30596 nested. Hopefully the final version clarifies this.
30597 For now handle (multiple) {'s and empty statements. */
30599 do
30600 {
30604 {
30606 bracecount++;
30607 }
30611 else
30612 {
30619 }
30620 }
30624 {
30627 }
30628 }
30630 /* Note that we saved the original contents of this flag when we entered
30631 the structured block, and so we don't need to re-save it here. */
30634 else
30637 /* Note that the grammar doesn't call for a structured block here,
30638 though the loop as a whole is a structured block. */
30645 else
30650 {
30652 {
30654 nbraces--;
30655 }
30658 else
30659 {
30661 {
30664 }
30669 }
30670 }
30677 }
30679 /* Helper function for OpenMP parsing, split clauses and call
30680 finish_omp_clauses on each of the set of clauses afterwards. */
30682 static void
30685 {
30691 }
30693 /* OpenMP 4.0:
30694 #pragma omp simd simd-clause[optseq] new-line
30695 for-loop */
30697 #define OMP_SIMD_CLAUSE_MASK \
30698 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30706 static tree
30709 {
30721 {
30724 }
30735 }
30737 /* OpenMP 2.5:
30738 #pragma omp for for-clause[optseq] new-line
30739 for-loop
30741 OpenMP 4.0:
30742 #pragma omp for simd for-simd-clause[optseq] new-line
30743 for-loop */
30745 #define OMP_FOR_CLAUSE_MASK \
30746 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30755 static tree
30758 {
30769 {
30774 {
30782 cclauses);
30786 cclauses);
30798 }
30799 }
30801 {
30804 }
30809 {
30812 }
30823 }
30825 /* OpenMP 2.5:
30826 # pragma omp master new-line
30827 structured-block */
30829 static tree
30831 {
30835 }
30837 /* OpenMP 2.5:
30838 # pragma omp ordered new-line
30839 structured-block */
30841 static tree
30843 {
30847 }
30849 /* OpenMP 2.5:
30851 section-scope:
30852 { section-sequence }
30854 section-sequence:
30855 section-directive[opt] structured-block
30856 section-sequence section-directive structured-block */
30858 static tree
30860 {
30871 {
30875 }
30878 {
30886 {
30890 }
30892 {
30895 }
30900 }
30911 }
30913 /* OpenMP 2.5:
30914 # pragma omp sections sections-clause[optseq] newline
30915 sections-scope */
30917 #define OMP_SECTIONS_CLAUSE_MASK \
30918 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30924 static tree
30927 {
30939 {
30942 }
30949 }
30951 /* OpenMP 2.5:
30952 # pragma omp parallel parallel-clause[optseq] new-line
30953 structured-block
30954 # pragma omp parallel for parallel-for-clause[optseq] new-line
30955 structured-block
30956 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30957 structured-block
30959 OpenMP 4.0:
30960 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30961 structured-block */
30963 #define OMP_PARALLEL_CLAUSE_MASK \
30964 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30974 static tree
30977 {
30986 {
30999 block);
31004 }
31006 {
31010 }
31012 {
31015 }
31017 {
31021 {
31031 block);
31034 }
31035 }
31045 }
31047 /* OpenMP 2.5:
31048 # pragma omp single single-clause[optseq] new-line
31049 structured-block */
31051 #define OMP_SINGLE_CLAUSE_MASK \
31052 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31057 static tree
31059 {
31069 }
31071 /* OpenMP 3.0:
31072 # pragma omp task task-clause[optseq] new-line
31073 structured-block */
31075 #define OMP_TASK_CLAUSE_MASK \
31076 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31086 static tree
31088 {
31099 }
31101 /* OpenMP 3.0:
31102 # pragma omp taskwait new-line */
31104 static void
31106 {
31109 }
31111 /* OpenMP 3.1:
31112 # pragma omp taskyield new-line */
31114 static void
31116 {
31119 }
31121 /* OpenMP 4.0:
31122 # pragma omp taskgroup new-line
31123 structured-block */
31125 static tree
31127 {
31131 }
31134 /* OpenMP 2.5:
31135 # pragma omp threadprivate (variable-list) */
31137 static void
31139 {
31140 tree vars;
31146 }
31148 /* OpenMP 4.0:
31149 # pragma omp cancel cancel-clause[optseq] new-line */
31151 #define OMP_CANCEL_CLAUSE_MASK \
31152 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31158 static void
31160 {
31164 }
31166 /* OpenMP 4.0:
31167 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31169 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31170 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31175 static void
31177 {
31178 tree clauses;
31182 {
31187 {
31190 }
31191 }
31193 {
31197 }
31200 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31202 pragma_tok);
31204 }
31206 /* OpenMP 4.0:
31207 #pragma omp distribute distribute-clause[optseq] new-line
31208 for-loop */
31210 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31211 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31216 static tree
31219 {
31228 {
31236 else
31239 {
31245 {
31248 cclauses);
31249 else
31251 cclauses);
31252 }
31257 cclauses);
31258 else
31260 cclauses);
31272 }
31273 }
31275 {
31278 }
31283 {
31286 }
31297 }
31299 /* OpenMP 4.0:
31300 # pragma omp teams teams-clause[optseq] new-line
31301 structured-block */
31303 #define OMP_TEAMS_CLAUSE_MASK \
31304 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31312 static tree
31315 {
31324 {
31328 {
31336 cclauses);
31340 cclauses);
31351 }
31352 }
31354 {
31357 }
31362 {
31365 }
31373 }
31375 /* OpenMP 4.0:
31376 # pragma omp target data target-data-clause[optseq] new-line
31377 structured-block */
31379 #define OMP_TARGET_DATA_CLAUSE_MASK \
31380 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31384 static tree
31386 {
31398 }
31400 /* OpenMP 4.0:
31401 # pragma omp target update target-update-clause[optseq] new-line */
31403 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31404 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31409 static bool
31412 {
31414 {
31416 "%<#pragma omp target update%> may only be "
31420 }
31422 tree clauses
31427 {
31429 "%<#pragma omp target update%> must contain at least one "
31432 }
31440 }
31442 /* OpenMP 4.0:
31443 # pragma omp target target-clause[optseq] new-line
31444 structured-block */
31446 #define OMP_TARGET_CLAUSE_MASK \
31447 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31451 static bool
31454 {
31456 {
31460 }
31463 {
31468 {
31476 {
31478 OMP_TARGET_CLAUSE_MASK,
31479 cclauses);
31481 }
31497 }
31499 {
31502 }
31504 {
31508 }
31510 {
31513 }
31514 }
31528 }
31530 /* OpenACC 2.0:
31531 # pragma acc cache (variable-list) new-line
31532 */
31534 static tree
31536 {
31551 }
31553 /* OpenACC 2.0:
31554 # pragma acc data oacc-data-clause[optseq] new-line
31555 structured-block */
31557 #define OACC_DATA_CLAUSE_MASK \
31558 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31570 static tree
31572 {
31585 }
31587 /* OpenACC 2.0:
31588 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31590 or
31592 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31594 LOC is the location of the #pragma token.
31595 */
31597 #define OACC_ENTER_DATA_CLAUSE_MASK \
31598 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31606 #define OACC_EXIT_DATA_CLAUSE_MASK \
31607 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31613 static tree
31616 {
31621 {
31627 }
31632 {
31636 }
31643 else
31648 {
31652 }
31660 }
31662 /* OpenACC 2.0:
31663 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31664 structured-block */
31666 #define OACC_KERNELS_CLAUSE_MASK \
31667 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31681 static tree
31683 {
31696 }
31698 /* OpenACC 2.0:
31699 # pragma acc loop oacc-loop-clause[optseq] new-line
31700 structured-block */
31702 #define OACC_LOOP_CLAUSE_MASK \
31703 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31706 static tree
31708 {
31721 }
31723 /* OpenACC 2.0:
31724 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31725 structured-block */
31727 #define OACC_PARALLEL_CLAUSE_MASK \
31728 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31746 static tree
31748 {
31761 }
31763 /* OpenACC 2.0:
31764 # pragma acc update oacc-update-clause[optseq] new-line
31765 */
31767 #define OACC_UPDATE_CLAUSE_MASK \
31768 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31775 static tree
31777 {
31784 {
31786 "%<#pragma acc update%> must contain at least one "
31789 }
31797 }
31799 /* OpenACC 2.0:
31800 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31802 LOC is the location of the #pragma token.
31803 */
31805 #define OACC_WAIT_CLAUSE_MASK \
31806 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31808 static tree
31810 {
31823 }
31825 /* OpenMP 4.0:
31826 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31828 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31829 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31836 static void
31839 {
31841 cp_omp_declare_simd_data data;
31843 {
31848 }
31859 {
31863 {
31876 }
31881 "%<#pragma omp declare simd%> not immediately followed by "
31885 }
31886 }
31888 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31889 This function is modelled similar to the late parsing of omp declare
31890 simd. */
31892 static tree
31894 {
31900 {
31906 }
31908 {
31912 }
31917 {
31924 NULL);
31938 }
31943 }
31945 /* Finalize #pragma omp declare simd clauses after direct declarator has
31946 been parsed, and put that into "omp declare simd" attribute. */
31948 static tree
31950 {
31956 {
31961 }
31966 {
31984 }
31988 }
31991 /* OpenMP 4.0:
31992 # pragma omp declare target new-line
31993 declarations and definitions
31994 # pragma omp end declare target new-line */
31996 static void
31998 {
32001 }
32003 static void
32005 {
32008 {
32011 }
32013 {
32017 {
32020 }
32023 else
32024 {
32028 }
32029 }
32030 else
32031 {
32035 }
32039 "%<#pragma omp end declare target%> without corresponding "
32041 else
32043 }
32045 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32046 expression and optional initializer clause of
32047 #pragma omp declare reduction. We store the expression(s) as
32048 either 3, 6 or 7 special statements inside of the artificial function's
32049 body. The first two statements are DECL_EXPRs for the artificial
32050 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32051 expression that uses those variables.
32052 If there was any INITIALIZER clause, this is followed by further statements,
32053 the fourth and fifth statements are DECL_EXPRs for the artificial
32054 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32055 constructor variant (first token after open paren is not omp_priv),
32056 then the sixth statement is a statement with the function call expression
32057 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32058 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32059 to initialize the OMP_PRIV artificial variable and there is seventh
32060 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32062 static bool
32064 {
32076 tree combiner;
32091 {
32094 }
32097 {
32104 {
32107 }
32123 {
32127 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32131 == CPP_CLOSE_PAREN
32134 {
32138 }
32143 }
32144 else
32145 {
32161 {
32166 }
32168 tree arg;
32181 }
32192 }
32198 }
32200 /* OpenMP 4.0
32201 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32202 initializer-clause[opt] new-line
32204 initializer-clause:
32205 initializer (omp_priv initializer)
32206 initializer (function-name (argument-list)) */
32208 static void
32211 {
32221 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32228 {
32260 }
32272 /* Types may not be defined in declare reduction type list. */
32275 parser->type_definition_forbidden_message
32281 saved_colon_doesnt_start_class_def_p
32286 {
32290 ;
32311 else
32316 else
32318 }
32320 /* Restore the saved message. */
32323 parser->colon_doesnt_start_class_def_p
32328 {
32329 fail:
32332 }
32338 {
32339 tree fntype
32342 NULL_TREE);
32361 {
32366 }
32368 {
32370 {
32379 }
32386 }
32387 else
32388 {
32391 }
32394 else
32397 {
32400 }
32402 {
32405 else
32410 }
32415 else
32416 {
32425 }
32432 }
32436 done:
32437 /* Free any declarators allocated. */
32439 }
32441 /* OpenMP 4.0
32442 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32443 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32444 initializer-clause[opt] new-line
32445 #pragma omp declare target new-line */
32447 static void
32450 {
32452 {
32457 {
32460 context);
32462 }
32465 {
32468 context);
32470 }
32472 {
32475 }
32477 {
32481 }
32482 }
32486 }
32488 /* Main entry point to OpenMP statement pragmas. */
32490 static void
32492 {
32493 tree stmt;
32498 {
32573 }
32577 }
32578 \f
32579 /* Transactional Memory parsing routines. */
32581 /* Parse a transaction attribute.
32583 txn-attribute:
32584 attribute
32585 [ [ identifier ] ]
32587 ??? Simplify this when C++0x bracket attributes are
32588 implemented properly. */
32590 static tree
32592 {
32607 {
32611 /* For keywords, use the canonical spelling,
32612 not the parsed identifier. */
32616 }
32617 else
32621 error1:
32624 }
32626 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32628 transaction-statement:
32629 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32630 compound-statement
32631 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32632 */
32634 static tree
32636 {
32651 else
32652 {
32656 }
32658 /* Parse a noexcept specification. */
32661 /* Keep track if we're in the lexical scope of an outer transaction. */
32673 }
32675 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32677 transaction-expression:
32678 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32679 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32680 */
32682 static tree
32684 {
32709 /* Set this early. This might mean that we allow transaction_cancel in
32710 an expression that we find out later actually has to be a constexpr.
32711 However, we expect that cxx_constant_value will be able to deal with
32712 this; also, if the noexcept has no constexpr, then what we parse next
32713 really is a transaction's body. */
32716 /* Parse a noexcept specification. */
32722 {
32729 }
32730 else
32731 {
32732 /* The only expression that is available got parsed for the noexcept
32733 already. noexcept is true then. */
32736 }
32745 }
32747 /* Parse a function-transaction-block.
32749 function-transaction-block:
32750 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32751 function-body
32752 __transaction_atomic txn-attribute[opt] function-try-block
32753 __transaction_relaxed ctor-initializer[opt] function-body
32754 __transaction_relaxed function-try-block
32755 */
32757 static bool
32759 {
32775 else
32776 {
32780 }
32788 else
32789 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32797 }
32799 /* Parse a __transaction_cancel statement.
32801 cancel-statement:
32802 __transaction_cancel txn-attribute[opt] ;
32803 __transaction_cancel txn-attribute[opt] throw-expression ;
32805 ??? Cancel and throw is not yet implemented. */
32807 static tree
32809 {
32815 RT_TRANSACTION_CANCEL);
32822 /* ??? Parse cancel-and-throw here. */
32827 {
32831 }
32833 {
32837 }
32839 {
32842 {
32848 }
32849 }
32851 {
32855 }
32861 }
32862 \f
32863 /* The parser. */
32867 \f
32868 /* Special handling for the first token or line in the file. The first
32869 thing in the file might be #pragma GCC pch_preprocess, which loads a
32870 PCH file, which is a GC collection point. So we need to handle this
32871 first pragma without benefit of an existing lexer structure.
32873 Always returns one token to the caller in *FIRST_TOKEN. This is
32874 either the true first token of the file, or the first token after
32875 the initial pragma. */
32877 static void
32879 {
32888 {
32895 }
32896 else
32899 /* Skip to the end of the pragma. */
32903 /* Now actually load the PCH file. */
32907 /* Read one more token to return to our caller. We have to do this
32908 after reading the PCH file in, since its pointers have to be
32909 live. */
32911 }
32913 /* Parses the grainsize pragma for the _Cilk_for statement.
32914 Syntax:
32915 #pragma cilk grainsize = <VALUE>. */
32917 static void
32919 {
32921 {
32926 {
32929 }
32931 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32934 else
32936 "%<#pragma cilk grainsize%> is not followed by "
32939 }
32941 }
32943 /* Normal parsing of a pragma token. Here we can (and must) use the
32944 regular lexer. */
32946 static bool
32948 {
32960 {
32968 {
32978 }
32983 {
32993 }
32998 {
33004 "%<#pragma omp taskwait%> may only be "
33009 }
33014 {
33020 "%<#pragma omp taskyield%> may only be "
33025 }
33030 {
33036 "%<#pragma omp cancel%> may only be "
33041 }
33046 {
33052 "%<#pragma omp cancellation point%> may only be "
33057 }
33104 "%<#pragma omp section%> may only be used in "
33109 {
33111 {
33115 }
33122 {
33125 }
33128 }
33132 {
33136 }
33142 {
33146 }
33148 /* Ignore the pragma if Cilk Plus is not enabled. */
33150 {
33153 }
33154 else
33155 {
33159 }
33166 bad_stmt:
33169 }
33173 }
33175 /* The interface the pragma parsers have to the lexer. */
33177 enum cpp_ttype
33179 {
33192 else
33193 {
33197 }
33200 }
33202 \f
33203 /* External interface. */
33205 /* Parse one entire translation unit. */
33207 void
33209 {
33222 }
33224 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33225 vectorlength clause:
33226 Syntax:
33227 vectorlength ( constant-expression ) */
33229 static tree
33232 {
33234 tree expr;
33235 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33236 safelen clause. Thus, vectorlength is represented as OMP 4.0
33237 safelen. For SIMD-enabled function it is represented by OMP 4.0
33238 simdlen. */
33241 loc);
33242 else
33244 loc);
33252 /* If expr == error_mark_node, then don't emit any errors nor
33253 create a clause. if any of the above functions returns
33254 error mark node then they would have emitted an error message. */
33256 ;
33264 else
33265 {
33266 tree c;
33268 {
33273 }
33274 else
33275 {
33280 }
33281 }
33286 }
33288 /* Handles the Cilk Plus #pragma simd linear clause.
33289 Syntax:
33290 linear ( simd-linear-variable-list )
33292 simd-linear-variable-list:
33293 simd-linear-variable
33294 simd-linear-variable-list , simd-linear-variable
33296 simd-linear-variable:
33297 id-expression
33298 id-expression : simd-linear-step
33300 simd-linear-step:
33301 conditional-expression */
33303 static tree
33305 {
33311 {
33315 }
33320 {
33323 {
33327 }
33334 {
33338 }
33339 else
33340 {
33344 /* If present, parse the linear step. Otherwise, assume the default
33345 value of 1. */
33347 {
33354 {
33355 /* If an error has occurred, then the whole pragma is
33356 considered ill-formed. Thus, no reason to keep
33357 parsing. */
33360 }
33368 else
33370 "step size must be an integer constant "
33372 }
33374 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33380 }
33385 else
33386 {
33391 }
33392 }
33396 }
33398 /* Returns the name of the next clause. If the clause is not
33399 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33400 token is not consumed. Otherwise, the appropriate enum from the
33401 pragma_simd_clause is returned and the token is consumed. */
33403 static pragma_omp_clause
33405 {
33406 pragma_omp_clause clause_type;
33423 else
33428 }
33430 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33432 static tree
33434 {
33439 {
33440 pragma_omp_clause c_kind;
33447 /* Use the OpenMP 4.0 equivalent function. */
33450 /* Use the OpenMP 4.0 equivalent function. */
33452 clauses);
33454 /* Use the OMP 4.0 equivalent function. */
33456 clauses);
33458 /* Use the OMP 4.0 equivalent function. */
33460 else
33461 {
33465 }
33466 }
33472 else
33474 }
33476 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33478 static void
33480 {
33487 {
33491 }
33500 }
33502 /* Main entry-point for parsing Cilk Plus _Cilk_for
33503 loops. The return value is error_mark_node
33504 when errors happen and CILK_FOR tree on success. */
33506 static tree
33508 {
33523 else
33529 }
33531 /* Create an identifier for a generic parameter type (a synthesized
33532 template parameter implied by `auto' or a concept identifier). */
33535 static tree
33537 {
33541 }
33543 /* Predicate that behaves as is_auto_or_concept but matches the parent
33544 node of the generic type rather than the generic type itself. This
33545 allows for type transformation in add_implicit_template_parms. */
33549 {
33551 }
33553 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33554 (creating a new template parameter list if necessary). Returns the newly
33555 created template type parm. */
33557 tree
33559 {
33562 /* We are either continuing a function template that already contains implicit
33563 template parameters, creating a new fully-implicit function template, or
33564 extending an existing explicit function template with implicit template
33565 parameters. */
33573 {
33577 }
33578 else
33579 {
33580 /* Roll back to the existing template parameter scope (in the case of
33581 extending an explicit function template) or introduce a new template
33582 parameter scope ahead of the function parameter scope (or class scope
33583 in the case of out-of-line member definitions). The function scope is
33584 added back after template parameter synthesis below. */
33589 {
33592 }
33594 {
33595 /* If not defining a class, then any class scope is a scope level in
33596 an out-of-line member definition. In this case simply wind back
33597 beyond the first such scope to inject the template parameter list.
33598 Otherwise wind back to the class being defined. The latter can
33599 occur in class member friend declarations such as:
33601 class A {
33602 void foo (auto);
33603 };
33604 class B {
33605 friend void A::foo (auto);
33606 };
33608 The template parameter list synthesized for the friend declaration
33609 must be injected in the scope of 'B'. This can also occur in
33610 erroneous cases such as:
33612 struct A {
33613 struct B {
33614 void foo (auto);
33615 };
33616 void B::foo (auto) {}
33617 };
33619 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33620 but, nevertheless, the template parameter list synthesized for the
33621 declarator should be injected into the scope of 'A' as if the
33622 ill-formed template was specified explicitly. */
33625 {
33628 }
33629 }
33635 {
33636 /* Introduce a new template parameter list for implicit template
33637 parameters. */
33641 parser->implicit_template_scope
33648 }
33649 else
33650 {
33651 /* Synthesize implicit template parameters at the end of the explicit
33652 template parameter list. */
33659 parser->implicit_template_parms
33661 }
33662 }
33664 /* Synthesize a new template parameter and track the current template
33665 parameter chain with implicit_template_parms. */
33669 synth_id);
33670 tree new_parm
33672 input_location,
33679 parser->implicit_template_parms
33681 else
33686 /* If creating a fully implicit function template, start the new implicit
33687 template parameter list with this synthesized type, otherwise grow the
33688 current template parameter list. */
33691 {
33698 }
33699 else
33700 {
33705 }
33710 }
33712 /* Finish the declaration of a fully implicit function template. Such a
33713 template has no explicit template parameter list so has not been through the
33714 normal template head and tail processing. synthesize_implicit_template_parm
33715 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33716 provided if the declaration is a class member such that its template
33717 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33718 form is returned. Otherwise NULL_TREE is returned. */
33720 tree
33722 {
33727 {
33731 }
33741 }