| blob | e81e9d34767d57340f689eec5f43ef524600e389 |
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. */
2963 decl);
2967 /* Something like 'unsigned A a;' */
2970 {
2971 /* Issue an error message. */
2973 /* If we're in a template class, it's possible that the user was
2974 referring to a type from a base class. For example:
2976 template <typename T> struct A { typedef T X; };
2977 template <typename T> struct B : public A<T> { X x; };
2979 The user should have said "typename A<T>::X". */
2993 {
2994 tree b;
2997 b;
2999 {
3003 {
3004 tree field;
3005 /* Go from a particular instantiation of the
3006 template (which will have an empty TYPE_FIELDs),
3007 to the main version. */
3010 field;
3014 {
3019 }
3022 }
3023 }
3024 }
3025 }
3026 /* Here we diagnose qualified-ids where the scope is actually correct,
3027 but the identifier does not resolve to a valid type name. */
3029 {
3031 {
3036 else
3040 }
3043 {
3044 /* A<T>::A<T>() */
3050 }
3057 {
3062 else
3066 }
3067 else
3069 }
3070 }
3072 /* Check for a common situation where a type-name should be present,
3073 but is not, and issue a sensible error message. Returns true if an
3074 invalid type-name was detected.
3076 The situation handled by this function are variable declarations of the
3077 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3078 Usually, `ID' should name a type, but if we got here it means that it
3079 does not. We try to emit the best possible error message depending on
3080 how exactly the id-expression looks like. */
3082 static bool
3084 {
3085 tree id;
3088 /* Avoid duplicate error about ambiguous lookup. */
3090 {
3094 }
3103 /* If the next token is a (, this is a function with no explicit return
3104 type, i.e. constructor, destructor or conversion op. */
3107 {
3110 }
3114 /* Emit a diagnostic for the invalid type. */
3116 out:
3117 /* If we aren't in the middle of a declarator (i.e. in a
3118 parameter-declaration-clause), skip to the end of the declaration;
3119 there's no point in trying to process it. */
3123 }
3125 /* Consume tokens up to, and including, the next non-nested closing `)'.
3126 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3127 are doing error recovery. Returns -1 if OR_COMMA is true and we
3128 found an unnested comma. */
3130 static int
3135 {
3145 {
3149 {
3152 /* If we've run out of tokens, then there is no closing `)'. */
3155 /* This is good for lambda expression capture-lists. */
3165 /* This matches the processing in skip_to_end_of_statement. */
3191 {
3195 }
3200 }
3202 /* Consume the token. */
3204 }
3205 }
3207 /* Consume tokens until we reach the end of the current statement.
3208 Normally, that will be just before consuming a `;'. However, if a
3209 non-nested `}' comes first, then we stop before consuming that. */
3211 static void
3213 {
3216 /* Unwind generic function template scope if necessary. */
3221 {
3225 {
3228 /* If we've run out of tokens, stop. */
3232 /* If the next token is a `;', we have reached the end of the
3233 statement. */
3239 /* If this is a non-nested '}', stop before consuming it.
3240 That way, when confronted with something like:
3242 { 3 + }
3244 we stop before consuming the closing '}', even though we
3245 have not yet reached a `;'. */
3249 /* If it is the closing '}' for a block that we have
3250 scanned, stop -- but only after consuming the token.
3251 That way given:
3253 void f g () { ... }
3254 typedef int I;
3256 we will stop after the body of the erroneously declared
3257 function, but before consuming the following `typedef'
3258 declaration. */
3260 {
3263 }
3271 }
3273 /* Consume the token. */
3275 }
3276 }
3278 /* This function is called at the end of a statement or declaration.
3279 If the next token is a semicolon, it is consumed; otherwise, error
3280 recovery is attempted. */
3282 static void
3284 {
3285 /* Look for the trailing `;'. */
3287 {
3288 /* If there is additional (erroneous) input, skip to the end of
3289 the statement. */
3291 /* If the next token is now a `;', consume it. */
3294 }
3295 }
3297 /* Skip tokens until we have consumed an entire block, or until we
3298 have consumed a non-nested `;'. */
3300 static void
3302 {
3305 /* Unwind generic function template scope if necessary. */
3310 {
3314 {
3317 /* If we've run out of tokens, stop. */
3321 /* Stop if this is an unnested ';'. */
3327 /* Stop if this is an unnested '}', or closes the outermost
3328 nesting level. */
3329 nesting_depth--;
3337 /* Nest. */
3338 nesting_depth++;
3343 }
3345 /* Consume the token. */
3347 }
3348 }
3350 /* Skip tokens until a non-nested closing curly brace is the next
3351 token, or there are no more tokens. Return true in the first case,
3352 false otherwise. */
3354 static bool
3356 {
3360 {
3364 {
3367 /* If we've run out of tokens, stop. */
3371 /* If the next token is a non-nested `}', then we have reached
3372 the end of the current block. */
3378 /* If it the next token is a `{', then we are entering a new
3379 block. Consume the entire block. */
3385 }
3387 /* Consume the token. */
3389 }
3390 }
3392 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3393 parameter is the PRAGMA token, allowing us to purge the entire pragma
3394 sequence. */
3396 static void
3398 {
3403 do
3407 /* Ensure that the pragma is not parsed again. */
3409 }
3411 /* Require pragma end of line, resyncing with it as necessary. The
3412 arguments are as for cp_parser_skip_to_pragma_eol. */
3414 static void
3416 {
3420 }
3422 /* This is a simple wrapper around make_typename_type. When the id is
3423 an unresolved identifier node, we can provide a superior diagnostic
3424 using cp_parser_diagnose_invalid_type_name. */
3426 static tree
3428 location_t id_location)
3429 {
3430 tree result;
3432 {
3438 }
3440 }
3442 /* This is a wrapper around the
3443 make_{pointer,ptrmem,reference}_declarator functions that decides
3444 which one to call based on the CODE and CLASS_TYPE arguments. The
3445 CODE argument should be one of the values returned by
3446 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3447 appertain to the pointer or reference. */
3451 cp_cv_quals cv_qualifiers,
3453 tree attributes)
3454 {
3461 else
3471 }
3473 /* Create a new C++ parser. */
3477 {
3482 /* cp_lexer_new_main is called before doing GC allocation because
3483 cp_lexer_new_main might load a PCH file. */
3486 /* Initialize the binops_by_token so that we can get the tree
3487 directly from the token. */
3495 /* For now, we always accept GNU extensions. */
3498 /* The `>' token is a greater-than operator, not the end of a
3499 template-id. */
3504 /* We are not parsing a constant-expression. */
3509 /* Local variable names are not forbidden. */
3512 /* We are not processing an `extern "C"' declaration. */
3515 /* We are not processing a declarator. */
3518 /* We are not processing a template-argument-list. */
3521 /* We are not in an iteration statement. */
3524 /* We are not in a switch statement. */
3527 /* We are not parsing a type-id inside an expression. */
3530 /* Declarations aren't implicitly extern "C". */
3533 /* String literals should be translated to the execution character set. */
3536 /* We are not parsing a function body. */
3539 /* We can correct until told otherwise. */
3542 /* The unparsed function queue is empty. */
3545 /* There are no classes being defined. */
3548 /* No template parameters apply. */
3551 /* Not declaring an implicit function template. */
3558 }
3560 /* Create a cp_lexer structure which will emit the tokens in CACHE
3561 and push it onto the parser's lexer stack. This is used for delayed
3562 parsing of in-class method bodies and default arguments, and should
3563 not be confused with tentative parsing. */
3564 static void
3566 {
3571 /* Move the current source position to that of the first token in the
3572 new lexer. */
3574 }
3576 /* Pop the top lexer off the parser stack. This is never used for the
3577 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3578 static void
3580 {
3585 /* Put the current source position back where it was before this
3586 lexer was pushed. */
3588 }
3590 /* Lexical conventions [gram.lex] */
3592 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3593 identifier. */
3595 static tree
3597 {
3600 /* Look for the identifier. */
3602 /* Return the value. */
3604 }
3606 /* Parse a sequence of adjacent string constants. Returns a
3607 TREE_STRING representing the combined, nul-terminated string
3608 constant. If TRANSLATE is true, translate the string to the
3609 execution character set. If WIDE_OK is true, a wide string is
3610 invalid here.
3612 C++98 [lex.string] says that if a narrow string literal token is
3613 adjacent to a wide string literal token, the behavior is undefined.
3614 However, C99 6.4.5p4 says that this results in a wide string literal.
3615 We follow C99 here, for consistency with the C front end.
3617 This code is largely lifted from lex_string() in c-lex.c.
3619 FUTURE: ObjC++ will need to handle @-strings here. */
3620 static tree
3623 {
3624 tree value;
3631 tree string_tree;
3637 {
3640 }
3643 {
3647 }
3648 else
3649 {
3652 }
3655 /* Try to avoid the overhead of creating and destroying an obstack
3656 for the common case of just one string. */
3659 {
3667 {
3671 }
3672 else
3676 }
3677 else
3678 {
3682 do
3683 {
3685 count++;
3690 {
3693 {
3696 }
3699 {
3704 }
3706 }
3707 else
3711 {
3716 "unsupported non-standard concatenation "
3718 }
3724 {
3728 }
3729 else
3730 {
3734 }
3735 }
3739 }
3742 {
3745 }
3749 {
3754 {
3769 }
3774 {
3779 else
3781 }
3782 }
3783 else
3784 /* cpp_interpret_string has issued an error. */
3791 }
3793 /* Look up a literal operator with the name and the exact arguments. */
3795 static tree
3797 {
3804 {
3810 {
3813 {
3823 }
3826 /* May be this should be sufficient_parms_p instead,
3827 depending on how exactly should user-defined literals
3828 work in presence of default arguments on the literal
3829 operator parameters. */
3832 }
3833 }
3836 }
3838 /* Parse a user-defined char constant. Returns a call to a user-defined
3839 literal operator taking the character as an argument. */
3841 static tree
3843 {
3851 /* Build up a call to the user-defined operator */
3852 /* Lookup the name we got back from the id-expression. */
3857 {
3862 }
3866 }
3868 /* A subroutine of cp_parser_userdef_numeric_literal to
3869 create a char... template parameter pack from a string node. */
3871 static tree
3873 {
3874 tree charvec;
3880 /* Fill in CHARVEC with all of the parameters. */
3885 /* Build the argument packs. */
3892 }
3894 /* A subroutine of cp_parser_userdef_numeric_literal to
3895 create a char... template parameter pack from a string node. */
3897 static tree
3899 {
3900 tree charvec;
3911 /* First template parm is character type. */
3914 /* Fill in CHARVEC with all of the parameters. */
3921 /* Build the argument packs. */
3928 }
3930 /* Parse a user-defined numeric constant. returns a call to a user-defined
3931 literal operator. */
3933 static tree
3935 {
3946 /* Look for a literal operator taking the exact type of numeric argument
3947 as the literal value. */
3952 {
3954 tf_warning_or_error);
3957 {
3960 long_long_unsigned_type_node);
3961 }
3962 else
3963 {
3967 long_double_type_node);
3971 }
3975 }
3978 /* If the numeric argument didn't work, look for a raw literal
3979 operator taking a const char* argument consisting of the number
3980 in string format. */
3985 {
3987 tf_warning_or_error);
3990 }
3993 /* If the raw literal didn't work, look for a non-type template
3994 function with parameter pack char.... Call the function with
3995 template parameter characters representing the number. */
3999 {
4003 tf_warning_or_error);
4006 }
4015 }
4017 /* Parse a user-defined string constant. Returns a call to a user-defined
4018 literal operator taking a character pointer and the length of the string
4019 as arguments. */
4021 static tree
4023 {
4032 /* Build up a call to the user-defined operator. */
4033 /* Lookup the name we got back from the id-expression. */
4040 {
4042 tf_warning_or_error);
4045 }
4048 /* Look for a template function with typename parameter CharT
4049 and parameter pack CharT... Call the function with
4050 template parameter characters representing the string. */
4054 {
4058 tf_warning_or_error);
4061 }
4067 }
4070 /* Basic concepts [gram.basic] */
4072 /* Parse a translation-unit.
4074 translation-unit:
4075 declaration-seq [opt]
4077 Returns TRUE if all went well. */
4079 static bool
4081 {
4082 /* The address of the first non-permanent object on the declarator
4083 obstack. */
4088 /* Create the declarator obstack, if necessary. */
4090 {
4092 /* Create the error declarator. */
4094 /* Create the empty parameter list. */
4096 /* Remember where the base of the declarator obstack lies. */
4098 }
4102 /* If there are no tokens left then all went well. */
4104 {
4105 /* Get rid of the token array; we don't need it any more. */
4109 /* This file might have been a context that's implicitly extern
4110 "C". If so, pop the lang context. (Only relevant for PCH.) */
4112 {
4115 }
4117 /* Finish up. */
4121 }
4122 else
4123 {
4126 }
4128 /* Make sure the declarator obstack was fully cleaned up. */
4132 /* All went well. */
4134 }
4136 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4137 decltype context. */
4141 {
4146 }
4148 /* We're about to parse a collection of statements. If we're currently
4149 parsing tentatively, set up a firewall so that any nested
4150 cp_parser_commit_to_tentative_parse won't affect the current context. */
4152 static cp_token_position
4154 {
4161 }
4163 /* We've finished parsing the collection of statements. Wrap up the
4164 firewall and replace the relevant tokens with the parsed form. */
4166 static void
4168 tree expr)
4169 {
4173 /* Finish the firewall level. */
4175 /* And remember the result of the parse for when we try again. */
4181 }
4183 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4184 enclosing parentheses. */
4186 static tree
4188 {
4191 /* Consume the '('. */
4193 /* Start the statement-expression. */
4195 /* Parse the compound-statement. */
4197 /* Finish up. */
4199 /* Consume the ')'. */
4205 }
4207 /* Expressions [gram.expr] */
4209 /* Parse a primary-expression.
4211 primary-expression:
4212 literal
4213 this
4214 ( expression )
4215 id-expression
4216 lambda-expression (C++11)
4218 GNU Extensions:
4220 primary-expression:
4221 ( compound-statement )
4222 __builtin_va_arg ( assignment-expression , type-id )
4223 __builtin_offsetof ( type-id , offsetof-expression )
4225 C++ Extensions:
4226 __has_nothrow_assign ( type-id )
4227 __has_nothrow_constructor ( type-id )
4228 __has_nothrow_copy ( type-id )
4229 __has_trivial_assign ( type-id )
4230 __has_trivial_constructor ( type-id )
4231 __has_trivial_copy ( type-id )
4232 __has_trivial_destructor ( type-id )
4233 __has_virtual_destructor ( type-id )
4234 __is_abstract ( type-id )
4235 __is_base_of ( type-id , type-id )
4236 __is_class ( type-id )
4237 __is_empty ( type-id )
4238 __is_enum ( type-id )
4239 __is_final ( type-id )
4240 __is_literal_type ( type-id )
4241 __is_pod ( type-id )
4242 __is_polymorphic ( type-id )
4243 __is_std_layout ( type-id )
4244 __is_trivial ( type-id )
4245 __is_union ( type-id )
4247 Objective-C++ Extension:
4249 primary-expression:
4250 objc-expression
4252 literal:
4253 __null
4255 ADDRESS_P is true iff this expression was immediately preceded by
4256 "&" and therefore might denote a pointer-to-member. CAST_P is true
4257 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4258 true iff this expression is a template argument.
4260 Returns a representation of the expression. Upon return, *IDK
4261 indicates what kind of id-expression (if any) was present. */
4263 static tree
4270 {
4273 /* Assume the primary expression is not an id-expression. */
4276 /* Peek at the next token. */
4279 {
4280 /* literal:
4281 integer-literal
4282 character-literal
4283 floating-literal
4284 string-literal
4285 boolean-literal
4286 pointer-literal
4287 user-defined-literal */
4298 {
4302 }
4303 /* Floating-point literals are only allowed in an integral
4304 constant expression if they are cast to an integral or
4305 enumeration type. */
4309 {
4310 /* CAST_P will be set even in invalid code like "int(2.7 +
4311 ...)". Therefore, we have to check that the next token
4312 is sure to end the cast. */
4314 {
4319 enumerator-definition. */
4321 /* The curly brace at the end of an enum-specifier. */
4323 /* The end of a statement. */
4325 /* The end of the cast-expression. */
4327 /* The end of an array bound. */
4329 /* The closing ">" in a template-argument-list. */
4332 /* C++0x only: A ">>" treated like two ">" tokens,
4333 in a template-argument-list. */
4338 }
4340 /* If we are within a cast, then the constraint that the
4341 cast is to an integral or enumeration type will be
4342 checked at that point. If we are not within a cast, then
4343 this code is invalid. */
4346 }
4365 /* ??? Should wide strings be allowed when parser->translate_strings_p
4366 is false (i.e. in attributes)? If not, we can kill the third
4367 argument to cp_parser_string_literal. */
4373 /* If we see `( { ' then we are looking at the beginning of
4374 a GNU statement-expression. */
4377 {
4378 /* Statement-expressions are not allowed by the standard. */
4382 /* And they're not allowed outside of a function-body; you
4383 cannot, for example, write:
4385 int i = ({ int j = 3; j + 1; });
4387 at class or namespace scope. */
4390 {
4392 "statement-expressions are not allowed outside "
4398 }
4399 else
4401 }
4402 /* Otherwise it's a normal parenthesized expression. */
4403 {
4404 tree expr;
4407 /* Consume the `('. */
4409 /* Within a parenthesized expression, a `>' token is always
4410 the greater-than operator. */
4411 saved_greater_than_is_operator_p
4415 /* Parse the parenthesized expression. */
4417 /* Let the front end know that this expression was
4418 enclosed in parentheses. This matters in case, for
4419 example, the expression is of the form `A::B', since
4420 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4421 not. */
4423 /* DR 705: Wrapping an unqualified name in parentheses
4424 suppresses arg-dependent lookup. We want to pass back
4425 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4426 (c++/37862), but none of the others. */
4430 /* The `>' token might be the end of a template-id or
4431 template-parameter-list now. */
4432 parser->greater_than_is_operator_p
4434 /* Consume the `)'. */
4439 }
4442 {
4444 {
4445 /* We might have an Objective-C++ message. */
4448 /* If that works out, we're done ... */
4451 /* ... else, fall though to see if it's a lambda. */
4452 }
4454 /* Don't warn about a failed tentative parse. */
4459 }
4463 /* We have an Objective-C++ string literal. */
4470 {
4471 /* These two are the boolean literals. */
4479 /* The `__null' literal. */
4484 /* The `nullptr' literal. */
4489 /* Recognize the `this' keyword. */
4493 {
4497 }
4498 /* Pointers cannot appear in constant-expressions. */
4503 /* The `operator' keyword can be the beginning of an
4504 id-expression. */
4511 {
4512 non_integral_constant name;
4514 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4515 __func__ are the names of variables -- but they are
4516 treated specially. Therefore, they are handled here,
4517 rather than relying on the generic id-expression logic
4518 below. Grammatically, these names are id-expressions.
4520 Consume the token. */
4524 {
4536 }
4541 /* Look up the name. */
4543 }
4546 {
4547 tree expression;
4548 tree type;
4549 source_location type_location;
4551 /* The `__builtin_va_arg' construct is used to handle
4552 `va_arg'. Consume the `__builtin_va_arg' token. */
4554 /* Look for the opening `('. */
4556 /* Now, parse the assignment-expression. */
4558 /* Look for the `,'. */
4561 /* Parse the type-id. */
4563 /* Look for the closing `)'. */
4565 /* Using `va_arg' in a constant-expression is not
4566 allowed. */
4568 NIC_VA_ARG))
4571 }
4601 /* Objective-C++ expressions. */
4611 {
4616 }
4620 }
4622 /* An id-expression can start with either an identifier, a
4623 `::' as the beginning of a qualified-id, or the "operator"
4624 keyword. */
4629 {
4630 tree id_expression;
4631 tree decl;
4637 id_expression:
4638 /* Parse the id-expression. */
4639 id_expression
4656 /* If we have a template-id, then no further lookup is
4657 required. If the template-id was for a template-class, we
4658 will sometimes have a TYPE_DECL at this point. */
4662 /* Look up the name. */
4663 else
4664 {
4665 tree ambiguous_decls;
4667 /* If we already know that this lookup is ambiguous, then
4668 we've already issued an error message; there's no reason
4669 to check again. */
4672 {
4675 }
4678 none_type,
4679 template_p,
4684 /* If the lookup was ambiguous, an error will already have
4685 been issued. */
4689 /* In Objective-C++, we may have an Objective-C 2.0
4690 dot-syntax for classes here. */
4695 {
4696 tree component;
4703 }
4705 /* In Objective-C++, an instance variable (ivar) may be preferred
4706 to whatever cp_parser_lookup_name() found. */
4709 /* If name lookup gives us a SCOPE_REF, then the
4710 qualifying scope was dependent. */
4712 {
4713 /* At this point, we do not know if DECL is a valid
4714 integral constant expression. We assume that it is
4715 in fact such an expression, so that code like:
4717 template <int N> struct A {
4718 int a[B<N>::i];
4719 };
4721 is accepted. At template-instantiation time, we
4722 will check that B<N>::i is actually a constant. */
4724 }
4725 /* Check to see if DECL is a local variable in a context
4726 where that is forbidden. */
4729 {
4730 /* It might be that we only found DECL because we are
4731 trying to be generous with pre-ISO scoping rules.
4732 For example, consider:
4734 int i;
4735 void g() {
4736 for (int i = 0; i < 10; ++i) {}
4737 extern void f(int j = i);
4738 }
4740 Here, name look up will originally find the out
4741 of scope `i'. We need to issue a warning message,
4742 but then use the global `i'. */
4745 {
4748 decl);
4750 }
4751 }
4752 }
4754 decl = (finish_id_expression
4756 idk,
4761 template_arg_p,
4767 }
4769 /* Anything else is an error. */
4773 }
4774 }
4782 {
4785 }
4787 /* Parse an id-expression.
4789 id-expression:
4790 unqualified-id
4791 qualified-id
4793 qualified-id:
4794 :: [opt] nested-name-specifier template [opt] unqualified-id
4795 :: identifier
4796 :: operator-function-id
4797 :: template-id
4799 Return a representation of the unqualified portion of the
4800 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4801 a `::' or nested-name-specifier.
4803 Often, if the id-expression was a qualified-id, the caller will
4804 want to make a SCOPE_REF to represent the qualified-id. This
4805 function does not do this in order to avoid wastefully creating
4806 SCOPE_REFs when they are not required.
4808 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4809 `template' keyword.
4811 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4812 uninstantiated templates.
4814 If *TEMPLATE_P is non-NULL, it is set to true iff the
4815 `template' keyword is used to explicitly indicate that the entity
4816 named is a template.
4818 If DECLARATOR_P is true, the id-expression is appearing as part of
4819 a declarator, rather than as part of an expression. */
4821 static tree
4828 {
4832 /* Assume the `template' keyword was not used. */
4836 /* Look for the optional `::' operator. */
4837 global_scope_p
4840 /* Look for the optional nested-name-specifier. */
4841 nested_name_specifier_p
4844 check_dependency_p,
4846 declarator_p)
4848 /* If there is a nested-name-specifier, then we are looking at
4849 the first qualified-id production. */
4851 {
4852 tree saved_scope;
4853 tree saved_object_scope;
4854 tree saved_qualifying_scope;
4855 tree unqualified_id;
4858 /* See if the next token is the `template' keyword. */
4862 /* Name lookup we do during the processing of the
4863 unqualified-id might obliterate SCOPE. */
4867 /* Process the final unqualified-id. */
4869 check_dependency_p,
4870 declarator_p,
4872 /* Restore the SAVED_SCOPE for our caller. */
4878 }
4879 /* Otherwise, if we are in global scope, then we are looking at one
4880 of the other qualified-id productions. */
4882 {
4884 tree id;
4886 /* Peek at the next token. */
4889 /* If it's an identifier, and the next token is not a "<", then
4890 we can avoid the template-id case. This is an optimization
4891 for this common case. */
4893 && !cp_parser_nth_token_starts_template_argument_list_p
4898 /* Try a template-id. */
4902 none_type,
4903 declarator_p);
4904 /* If that worked, we're done. */
4908 /* Peek at the next token. (Changes in the token buffer may
4909 have invalidated the pointer obtained above.) */
4913 {
4920 /* Fall through. */
4925 }
4926 }
4927 else
4930 declarator_p,
4931 optional_p);
4932 }
4934 /* Parse an unqualified-id.
4936 unqualified-id:
4937 identifier
4938 operator-function-id
4939 conversion-function-id
4940 ~ class-name
4941 template-id
4943 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4944 keyword, in a construct like `A::template ...'.
4946 Returns a representation of unqualified-id. For the `identifier'
4947 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4948 production a BIT_NOT_EXPR is returned; the operand of the
4949 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4950 other productions, see the documentation accompanying the
4951 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4952 names are looked up in uninstantiated templates. If DECLARATOR_P
4953 is true, the unqualified-id is appearing as part of a declarator,
4954 rather than as part of an expression. */
4956 static tree
4962 {
4965 /* Peek at the next token. */
4969 {
4971 {
4972 tree id;
4974 /* We don't know yet whether or not this will be a
4975 template-id. */
4977 /* Try a template-id. */
4979 check_dependency_p,
4980 none_type,
4981 declarator_p);
4982 /* If it worked, we're done. */
4985 /* Otherwise, it's an ordinary identifier. */
4987 }
4991 check_dependency_p,
4992 none_type,
4993 declarator_p);
4996 {
4997 tree type_decl;
4998 tree qualifying_scope;
4999 tree object_scope;
5000 tree scope;
5003 /* Consume the `~' token. */
5005 /* Parse the class-name. The standard, as written, seems to
5006 say that:
5008 template <typename T> struct S { ~S (); };
5009 template <typename T> S<T>::~S() {}
5011 is invalid, since `~' must be followed by a class-name, but
5012 `S<T>' is dependent, and so not known to be a class.
5013 That's not right; we need to look in uninstantiated
5014 templates. A further complication arises from:
5016 template <typename T> void f(T t) {
5017 t.T::~T();
5018 }
5020 Here, it is not possible to look up `T' in the scope of `T'
5021 itself. We must look in both the current scope, and the
5022 scope of the containing complete expression.
5024 Yet another issue is:
5026 struct S {
5027 int S;
5028 ~S();
5029 };
5031 S::~S() {}
5033 The standard does not seem to say that the `S' in `~S'
5034 should refer to the type `S' and not the data member
5035 `S::S'. */
5037 /* DR 244 says that we look up the name after the "~" in the
5038 same scope as we looked up the qualifying name. That idea
5039 isn't fully worked out; it's more complicated than that. */
5044 /* Check for invalid scopes. */
5046 {
5050 }
5052 {
5056 scope);
5061 }
5064 /* If the name is of the form "X::~X" it's OK even if X is a
5065 typedef. */
5074 {
5077 }
5079 /* ~auto means the destructor of whatever the object is. */
5081 {
5084 "%<~auto%> only available with "
5088 }
5090 /* If there was an explicit qualification (S::~T), first look
5091 in the scope given by the qualification (i.e., S).
5093 Note: in the calls to cp_parser_class_name below we pass
5094 typename_type so that lookup finds the injected-class-name
5095 rather than the constructor. */
5099 {
5104 typename_type,
5107 declarator_p);
5110 }
5111 /* In "N::S::~S", look in "N" as well. */
5113 {
5118 type_decl
5122 typename_type,
5125 declarator_p);
5128 }
5129 /* In "p->S::~T", look in the scope given by "*p" as well. */
5131 {
5136 type_decl
5140 typename_type,
5143 declarator_p);
5146 }
5147 /* Look in the surrounding context. */
5149 {
5155 type_decl
5159 typename_type,
5162 declarator_p);
5165 {
5166 /* We couldn't find a type with this name, so just accept
5167 it and check for a match at instantiation time. */
5172 }
5173 }
5174 /* If an error occurred, assume that the name of the
5175 destructor is the same as the name of the qualifying
5176 class. That allows us to keep parsing after running
5177 into ill-formed destructor names. */
5183 /* Check that destructor name and scope match. */
5185 {
5192 }
5194 /* [class.dtor]
5196 A typedef-name that names a class shall not be used as the
5197 identifier in the declarator for a destructor declaration. */
5204 type_decl);
5207 }
5211 {
5212 tree id;
5214 /* This could be a template-id, so we try that first. */
5216 /* Try a template-id. */
5219 none_type,
5220 declarator_p);
5221 /* If that worked, we're done. */
5224 /* We still don't know whether we're looking at an
5225 operator-function-id or a conversion-function-id. */
5227 /* Try an operator-function-id. */
5229 /* If that didn't work, try a conversion-function-id. */
5233 {
5234 /* 17.6.3.3.5 */
5240 }
5243 }
5244 /* Fall through. */
5251 }
5252 }
5254 /* Parse an (optional) nested-name-specifier.
5256 nested-name-specifier: [C++98]
5257 class-or-namespace-name :: nested-name-specifier [opt]
5258 class-or-namespace-name :: template nested-name-specifier [opt]
5260 nested-name-specifier: [C++0x]
5261 type-name ::
5262 namespace-name ::
5263 nested-name-specifier identifier ::
5264 nested-name-specifier template [opt] simple-template-id ::
5266 PARSER->SCOPE should be set appropriately before this function is
5267 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5268 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5269 in name lookups.
5271 Sets PARSER->SCOPE to the class (TYPE) or namespace
5272 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5273 it unchanged if there is no nested-name-specifier. Returns the new
5274 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5276 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5277 part of a declaration and/or decl-specifier. */
5279 static tree
5285 {
5290 /* Remember where the nested-name-specifier starts. */
5292 {
5295 }
5298 {
5299 tree new_scope;
5300 tree old_scope;
5301 tree saved_qualifying_scope;
5304 /* Spot cases that cannot be the beginning of a
5305 nested-name-specifier. */
5308 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5309 the already parsed nested-name-specifier. */
5311 {
5312 /* Grab the nested-name-specifier and continue the loop. */
5314 /* If we originally encountered this nested-name-specifier
5315 with IS_DECLARATION set to false, we will not have
5316 resolved TYPENAME_TYPEs, so we must do so here. */
5319 {
5324 }
5327 }
5329 /* Spot cases that cannot be the beginning of a
5330 nested-name-specifier. On the second and subsequent times
5331 through the loop, we look for the `template' keyword. */
5333 ;
5334 /* A template-id can start a nested-name-specifier. */
5336 ;
5337 /* DR 743: decltype can be used in a nested-name-specifier. */
5339 ;
5340 else
5341 {
5342 /* If the next token is not an identifier, then it is
5343 definitely not a type-name or namespace-name. */
5346 /* If the following token is neither a `<' (to begin a
5347 template-id), nor a `::', then we are not looking at a
5348 nested-name-specifier. */
5354 {
5358 }
5361 && !cp_parser_nth_token_starts_template_argument_list_p
5364 }
5366 /* The nested-name-specifier is optional, so we parse
5367 tentatively. */
5370 /* Look for the optional `template' keyword, if this isn't the
5371 first time through the loop. */
5374 else
5377 /* Save the old scope since the name lookup we are about to do
5378 might destroy it. */
5381 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5382 look up names in "X<T>::I" in order to determine that "Y" is
5383 a template. So, if we have a typename at this point, we make
5384 an effort to look through it. */
5386 && !typename_keyword_p
5391 /* Parse the qualifying entity. */
5392 new_scope
5394 typename_keyword_p,
5395 template_keyword_p,
5396 check_dependency_p,
5397 type_p,
5398 is_declaration);
5399 /* Look for the `::' token. */
5402 /* If we found what we wanted, we keep going; otherwise, we're
5403 done. */
5405 {
5408 /* Restore the OLD_SCOPE since it was valid before the
5409 failed attempt at finding the last
5410 class-or-namespace-name. */
5414 /* If the next token is a decltype, and the one after that is a
5415 `::', then the decltype has failed to resolve to a class or
5416 enumeration type. Give this error even when parsing
5417 tentatively since it can't possibly be valid--and we're going
5418 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5419 won't get another chance.*/
5423 {
5430 /* As below. */
5433 }
5437 {
5438 /* If we have a non-type template-id followed by ::, it can't
5439 possibly be valid. */
5444 {
5447 {
5453 }
5454 else
5455 {
5456 /* Variable template. */
5461 }
5468 /* As below. */
5472 }
5473 }
5477 /* If the next token is an identifier, and the one after
5478 that is a `::', then any valid interpretation would have
5479 found a class-or-namespace-name. */
5485 {
5488 {
5490 {
5491 tree decl;
5492 tree ambiguous_decls;
5495 none_type,
5504 decl);
5506 {
5507 // cp_parser_lookup_name has the same diagnostic,
5508 // thus make sure to emit it at most once.
5511 {
5516 }
5518 }
5519 else
5520 {
5522 cp_parser_name_lookup_error
5525 else
5526 cp_parser_name_lookup_error
5529 }
5530 }
5533 /* Treat this as a successful nested-name-specifier
5534 due to:
5536 [basic.lookup.qual]
5538 If the name found is not a class-name (clause
5539 _class_) or namespace-name (_namespace.def_), the
5540 program is ill-formed. */
5542 }
5544 }
5546 }
5547 /* We've found one valid nested-name-specifier. */
5549 /* Name lookup always gives us a DECL. */
5552 /* Uses of "template" must be followed by actual templates. */
5564 new_scope);
5565 /* If it is a class scope, try to complete it; we are about to
5566 be looking up names inside the class. */
5568 /* Since checking types for dependency can be expensive,
5569 avoid doing it if the type is already complete. */
5571 /* Do not try to complete dependent types. */
5573 {
5575 /* If it is a typedef to current class, use the current
5576 class instead, as the typedef won't have any names inside
5577 it yet. */
5581 }
5582 /* Make sure we look in the right scope the next time through
5583 the loop. */
5585 }
5587 /* If parsing tentatively, replace the sequence of tokens that makes
5588 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5589 token. That way, should we re-parse the token stream, we will
5590 not have to repeat the effort required to do the parse, nor will
5591 we issue duplicate error messages. */
5593 {
5597 /* Reset the contents of the START token. */
5599 /* Retrieve any deferred checks. Do not pop this access checks yet
5600 so the memory will not be reclaimed during token replacing below. */
5608 /* Purge all subsequent tokens. */
5610 }
5616 }
5618 /* Parse a nested-name-specifier. See
5619 cp_parser_nested_name_specifier_opt for details. This function
5620 behaves identically, except that it will an issue an error if no
5621 nested-name-specifier is present. */
5623 static tree
5629 {
5630 tree scope;
5632 /* Look for the nested-name-specifier. */
5634 typename_keyword_p,
5635 check_dependency_p,
5636 type_p,
5637 is_declaration);
5638 /* If it was not present, issue an error message. */
5640 {
5643 }
5646 }
5648 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5649 this is either a class-name or a namespace-name (which corresponds
5650 to the class-or-namespace-name production in the grammar). For
5651 C++0x, it can also be a type-name that refers to an enumeration
5652 type or a simple-template-id.
5654 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5655 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5656 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5657 TYPE_P is TRUE iff the next name should be taken as a class-name,
5658 even the same name is declared to be another entity in the same
5659 scope.
5661 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5662 specified by the class-or-namespace-name. If neither is found the
5663 ERROR_MARK_NODE is returned. */
5665 static tree
5672 {
5673 tree saved_scope;
5674 tree saved_qualifying_scope;
5675 tree saved_object_scope;
5676 tree scope;
5680 /* DR 743: decltype can appear in a nested-name-specifier. */
5682 {
5686 {
5689 }
5693 }
5695 /* Before we try to parse the class-name, we must save away the
5696 current PARSER->SCOPE since cp_parser_class_name will destroy
5697 it. */
5701 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5702 there is no need to look for a namespace-name. */
5703 only_class_p = template_keyword_p
5708 typename_keyword_p,
5709 template_keyword_p,
5711 check_dependency_p,
5713 is_declaration);
5715 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5719 {
5720 /* Restore the saved scope. */
5725 /* Parse tentatively. */
5728 /* Parse a type-name */
5731 /* "If the name found does not designate a namespace or a class,
5732 enumeration, or dependent type, the program is ill-formed."
5734 We cover classes and dependent types above and namespaces below,
5735 so this code is only looking for enums. */
5741 }
5742 /* If that didn't work, try for a namespace-name. */
5744 {
5745 /* Restore the saved scope. */
5749 /* If we are not looking at an identifier followed by the scope
5750 resolution operator, then this is not part of a
5751 nested-name-specifier. (Note that this function is only used
5752 to parse the components of a nested-name-specifier.) */
5757 }
5760 }
5762 /* Return true if we are looking at a compound-literal, false otherwise. */
5764 static bool
5766 {
5767 /* Consume the `('. */
5772 /* Skip tokens until the next token is a closing parenthesis.
5773 If we find the closing `)', and the next token is a `{', then
5774 we are looking at a compound-literal. */
5775 bool compound_literal_p
5780 /* Roll back the tokens we skipped. */
5784 }
5786 /* Parse a postfix-expression.
5788 postfix-expression:
5789 primary-expression
5790 postfix-expression [ expression ]
5791 postfix-expression ( expression-list [opt] )
5792 simple-type-specifier ( expression-list [opt] )
5793 typename :: [opt] nested-name-specifier identifier
5794 ( expression-list [opt] )
5795 typename :: [opt] nested-name-specifier template [opt] template-id
5796 ( expression-list [opt] )
5797 postfix-expression . template [opt] id-expression
5798 postfix-expression -> template [opt] id-expression
5799 postfix-expression . pseudo-destructor-name
5800 postfix-expression -> pseudo-destructor-name
5801 postfix-expression ++
5802 postfix-expression --
5803 dynamic_cast < type-id > ( expression )
5804 static_cast < type-id > ( expression )
5805 reinterpret_cast < type-id > ( expression )
5806 const_cast < type-id > ( expression )
5807 typeid ( expression )
5808 typeid ( type-id )
5810 GNU Extension:
5812 postfix-expression:
5813 ( type-id ) { initializer-list , [opt] }
5815 This extension is a GNU version of the C99 compound-literal
5816 construct. (The C99 grammar uses `type-name' instead of `type-id',
5817 but they are essentially the same concept.)
5819 If ADDRESS_P is true, the postfix expression is the operand of the
5820 `&' operator. CAST_P is true if this expression is the target of a
5821 cast.
5823 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5824 class member access expressions [expr.ref].
5826 Returns a representation of the expression. */
5828 static tree
5832 {
5834 location_t loc;
5841 /* Peek at the next token. */
5844 /* Some of the productions are determined by keywords. */
5847 {
5852 {
5853 tree type;
5854 tree expression;
5858 /* All of these can be handled in the same way from the point
5859 of view of parsing. Begin by consuming the token
5860 identifying the cast. */
5863 /* New types cannot be defined in the cast. */
5865 parser->type_definition_forbidden_message
5868 /* Look for the opening `<'. */
5870 /* Parse the type to which we are casting. */
5875 /* Look for the closing `>'. */
5877 /* Restore the old message. */
5880 bool saved_greater_than_is_operator_p
5884 /* And the expression which is being cast. */
5889 parser->greater_than_is_operator_p
5892 /* Only type conversions to integral or enumeration types
5893 can be used in constant-expressions. */
5899 {
5901 postfix_expression
5905 postfix_expression
5909 postfix_expression
5911 tf_warning_or_error);
5914 postfix_expression
5919 }
5920 }
5924 {
5925 tree type;
5929 /* Consume the `typeid' token. */
5931 /* Look for the `(' token. */
5933 /* Types cannot be defined in a `typeid' expression. */
5935 parser->type_definition_forbidden_message
5937 /* We can't be sure yet whether we're looking at a type-id or an
5938 expression. */
5940 /* Try a type-id first. */
5945 /* Look for the `)' token. Otherwise, we can't be sure that
5946 we're not looking at an expression: consider `typeid (int
5947 (3))', for example. */
5949 /* If all went well, simply lookup the type-id. */
5952 /* Otherwise, fall back to the expression variant. */
5953 else
5954 {
5955 tree expression;
5957 /* Look for an expression. */
5959 /* Compute its typeid. */
5961 /* Look for the `)' token. */
5963 }
5964 /* Restore the saved message. */
5966 /* `typeid' may not appear in an integral constant expression. */
5969 }
5973 {
5974 tree type;
5975 /* The syntax permitted here is the same permitted for an
5976 elaborated-type-specifier. */
5981 }
5985 {
5989 {
5994 }
5996 {
6001 }
6002 else
6003 {
6004 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6007 }
6009 postfix_expression =
6013 {
6017 }
6019 {
6024 }
6025 else
6026 {
6028 postfix_expression);
6032 }
6034 }
6037 {
6040 tree p;
6054 tf_warning_or_error);
6057 tf_warning_or_error);
6058 else
6059 {
6063 }
6065 }
6068 {
6069 tree type;
6071 /* If the next thing is a simple-type-specifier, we may be
6072 looking at a functional cast. We could also be looking at
6073 an id-expression. So, we try the functional cast, and if
6074 that doesn't work we fall back to the primary-expression. */
6076 /* Look for the simple-type-specifier. */
6079 CP_PARSER_FLAGS_NONE);
6080 /* Parse the cast itself. */
6082 postfix_expression
6084 /* If that worked, we're done. */
6088 /* If the functional-cast didn't work out, try a
6089 compound-literal. */
6092 {
6097 /* Avoid calling cp_parser_type_id pointlessly, see comment
6098 in cp_parser_cast_expression about c++/29234. */
6101 else
6102 {
6103 /* Parse the type. */
6108 /* Look for the `)'. */
6110 }
6112 /* If things aren't going well, there's no need to
6113 keep going. */
6115 {
6117 /* Parse the brace-enclosed initializer list. */
6120 }
6121 /* If that worked, we're definitely looking at a
6122 compound-literal expression. */
6124 {
6125 /* Warn the user that a compound literal is not
6126 allowed in standard C++. */
6129 /* For simplicity, we disallow compound literals in
6130 constant-expressions. We could
6131 allow compound literals of integer type, whose
6132 initializer was a constant, in constant
6133 expressions. Permitting that usage, as a further
6134 extension, would not change the meaning of any
6135 currently accepted programs. (Of course, as
6136 compound literals are not part of ISO C++, the
6137 standard has nothing to say.) */
6139 NIC_NCC))
6140 {
6143 }
6144 /* Form the representation of the compound-literal. */
6145 postfix_expression
6147 tf_warning_or_error);
6149 }
6150 }
6152 /* It must be a primary-expression. */
6153 postfix_expression
6156 decltype_p,
6158 }
6160 }
6162 /* Note that we don't need to worry about calling build_cplus_new on a
6163 class-valued CALL_EXPR in decltype when it isn't the end of the
6164 postfix-expression; unary_complex_lvalue will take care of that for
6165 all these cases. */
6167 /* Keep looping until the postfix-expression is complete. */
6169 {
6173 /* It is not a Koenig lookup function call. */
6174 postfix_expression
6177 /* Peek at the next token. */
6181 {
6184 {
6186 "two consecutive %<[%> shall "
6189 }
6190 postfix_expression
6192 postfix_expression,
6194 decltype_p);
6200 /* postfix-expression ( expression-list [opt] ) */
6201 {
6211 is_builtin_constant_p
6214 {
6215 /* The whole point of __builtin_constant_p is to allow
6216 non-constant expressions to appear as arguments. */
6217 saved_integral_constant_expression_p
6219 saved_non_integral_constant_expression_p
6222 }
6223 args = (cp_parser_parenthesized_expression_list
6229 {
6230 parser->integral_constant_expression_p
6232 parser->non_integral_constant_expression_p
6234 }
6237 {
6240 }
6242 /* Function calls are not permitted in
6243 constant-expressions. */
6246 NIC_FUNC_CALL))
6247 {
6251 }
6256 {
6258 {
6260 {
6263 postfix_expression
6265 complain);
6266 }
6267 else
6268 postfix_expression
6270 }
6271 /* We do not perform argument-dependent lookup if
6272 normal lookup finds a non-function, in accordance
6273 with the expected resolution of DR 218. */
6276 {
6280 /* Do not do argument dependent lookup if regular
6281 lookup finds a member function or a block-scope
6282 function declaration. [basic.lookup.argdep]/3 */
6285 {
6288 postfix_expression
6290 complain);
6291 }
6292 }
6293 }
6296 {
6306 "%<memset%> used with constant zero length "
6307 "parameter; this could be due to transposed "
6310 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6311 to avoid leaking those into folder and middle-end. */
6313 tree arg;
6317 }
6320 {
6330 {
6331 postfix_expression
6335 }
6338 {
6339 postfix_expression
6340 = (build_new_method_call
6346 complain));
6347 }
6348 else
6349 postfix_expression
6353 complain);
6354 }
6358 postfix_expression = (build_offset_ref_call_from_tree
6360 complain));
6362 /* A call to a static class member, or a namespace-scope
6363 function. */
6364 postfix_expression
6367 koenig_p,
6368 complain);
6369 else
6370 /* All other function calls. */
6371 postfix_expression
6374 koenig_p,
6375 complain);
6379 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6383 }
6388 /* postfix-expression . template [opt] id-expression
6389 postfix-expression . pseudo-destructor-name
6390 postfix-expression -> template [opt] id-expression
6391 postfix-expression -> pseudo-destructor-name */
6393 /* Consume the `.' or `->' operator. */
6396 postfix_expression
6398 postfix_expression,
6405 /* postfix-expression ++ */
6406 /* Consume the `++' token. */
6408 /* Generate a representation for the complete expression. */
6409 postfix_expression
6411 POSTINCREMENT_EXPR);
6412 /* Increments may not appear in constant-expressions. */
6420 /* postfix-expression -- */
6421 /* Consume the `--' token. */
6423 /* Generate a representation for the complete expression. */
6424 postfix_expression
6426 POSTDECREMENT_EXPR);
6427 /* Decrements may not appear in constant-expressions. */
6439 else
6441 }
6442 }
6444 /* We should never get here. */
6447 }
6449 /* This function parses Cilk Plus array notations. If a normal array expr. is
6450 parsed then the array index is passed back to the caller through *INIT_INDEX
6451 and the function returns a NULL_TREE. If array notation expr. is parsed,
6452 then *INIT_INDEX is ignored by the caller and the function returns
6453 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6454 error_mark_node. */
6456 static tree
6458 tree array_value)
6459 {
6463 {
6466 }
6475 {
6478 }
6480 {
6481 /* Consume the ':'. */
6484 /* If we are here, then we have a case like this A[:]. */
6486 {
6490 }
6494 }
6495 else
6496 {
6497 /* If we are here, then there are three valid possibilities:
6498 1. ARRAY [ EXP ]
6499 2. ARRAY [ EXP : EXP ]
6500 3. ARRAY [ EXP : EXP : EXP ] */
6504 {
6505 /* This indicates that we have a normal array expression. */
6508 }
6510 /* Consume the ':'. */
6514 {
6517 }
6518 }
6523 {
6527 }
6533 }
6535 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6536 by cp_parser_builtin_offsetof. We're looking for
6538 postfix-expression [ expression ]
6539 postfix-expression [ braced-init-list ] (C++11)
6541 FOR_OFFSETOF is set if we're being called in that context, which
6542 changes how we deal with integer constant expressions. */
6544 static tree
6546 tree postfix_expression,
6549 {
6554 /* Consume the `[' token. */
6560 /* Parse the index expression. */
6561 /* ??? For offsetof, there is a question of what to allow here. If
6562 offsetof is not being used in an integral constant expression context,
6563 then we *could* get the right answer by computing the value at runtime.
6564 If we are in an integral constant expression context, then we might
6565 could accept any constant expression; hard to say without analysis.
6566 Rather than open the barn door too wide right away, allow only integer
6567 constant expressions here. */
6570 else
6571 {
6573 {
6580 {
6582 "braced list index is not allowed with array "
6586 }
6587 }
6589 {
6590 /* Here are have these two options:
6591 ARRAY[EXP : EXP] - Array notation expr with default
6592 stride of 1.
6593 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6594 stride. */
6596 postfix_expression);
6599 }
6600 else
6602 }
6606 /* Look for the closing `]'. */
6609 /* Build the ARRAY_REF. */
6613 /* When not doing offsetof, array references are not permitted in
6614 constant-expressions. */
6620 }
6622 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6623 by cp_parser_builtin_offsetof. We're looking for
6625 postfix-expression . template [opt] id-expression
6626 postfix-expression . pseudo-destructor-name
6627 postfix-expression -> template [opt] id-expression
6628 postfix-expression -> pseudo-destructor-name
6630 FOR_OFFSETOF is set if we're being called in that context. That sorta
6631 limits what of the above we'll actually accept, but nevermind.
6632 TOKEN_TYPE is the "." or "->" token, which will already have been
6633 removed from the stream. */
6635 static tree
6638 tree postfix_expression,
6640 location_t location)
6641 {
6642 tree name;
6647 /* If this is a `->' operator, dereference the pointer. */
6650 tf_warning_or_error);
6651 /* Check to see whether or not the expression is type-dependent. */
6653 /* The identifier following the `->' or `.' is not qualified. */
6659 /* Enter the scope corresponding to the type of the object
6660 given by the POSTFIX_EXPRESSION. */
6662 {
6664 /* According to the standard, no expression should ever have
6665 reference type. Unfortunately, we do not currently match
6666 the standard in this respect in that our internal representation
6667 of an expression may have reference type even when the standard
6668 says it does not. Therefore, we have to manually obtain the
6669 underlying type here. */
6671 /* The type of the POSTFIX_EXPRESSION must be complete. */
6673 {
6675 postfix_expression);
6677 }
6678 /* Unlike the object expression in other contexts, *this is not
6679 required to be of complete type for purposes of class member
6680 access (5.2.5) outside the member function body. */
6684 /* Let the name lookup machinery know that we are processing a
6685 class member access expression. */
6687 /* If something went wrong, we want to be able to discern that case,
6688 as opposed to the case where there was no SCOPE due to the type
6689 of expression being dependent. */
6692 /* If the SCOPE was erroneous, make the various semantic analysis
6693 functions exit quickly -- and without issuing additional error
6694 messages. */
6697 }
6699 /* Assume this expression is not a pseudo-destructor access. */
6702 /* If the SCOPE is a scalar type, then, if this is a valid program,
6703 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6704 is type dependent, it can be pseudo-destructor-name or something else.
6705 Try to parse it as pseudo-destructor-name first. */
6707 {
6708 tree s;
6709 tree type;
6712 /* Parse the pseudo-destructor-name. */
6721 {
6723 postfix_expression
6726 }
6727 }
6730 {
6731 /* If the SCOPE is not a scalar type, we are looking at an
6732 ordinary class member access expression, rather than a
6733 pseudo-destructor-name. */
6736 /* Parse the id-expression. */
6737 name = (cp_parser_id_expression
6744 /* In general, build a SCOPE_REF if the member name is qualified.
6745 However, if the name was not dependent and has already been
6746 resolved; there is no need to build the SCOPE_REF. For example;
6748 struct X { void f(); };
6749 template <typename T> void f(T* t) { t->X::f(); }
6751 Even though "t" is dependent, "X::f" is not and has been resolved
6752 to a BASELINK; there is no need to include scope information. */
6754 /* But we do need to remember that there was an explicit scope for
6755 virtual function calls. */
6759 /* If the name is a template-id that names a type, we will get a
6760 TYPE_DECL here. That is invalid code. */
6762 {
6765 }
6766 else
6767 {
6769 {
6771 {
6775 }
6776 else
6779 name,
6780 template_p);
6784 }
6786 adjust_result_of_qualified_name_lookup
6788 postfix_expression
6790 template_p,
6791 tf_warning_or_error);
6792 }
6793 }
6795 /* We no longer need to look up names in the scope of the object on
6796 the left-hand side of the `.' or `->' operator. */
6799 /* Outside of offsetof, these operators may not appear in
6800 constant-expressions. */
6802 && (cp_parser_non_integral_constant_expression
6807 }
6809 /* Cache of LITERAL_ZERO_P constants. */
6813 /* Parse a parenthesized expression-list.
6815 expression-list:
6816 assignment-expression
6817 expression-list, assignment-expression
6819 attribute-list:
6820 expression-list
6821 identifier
6822 identifier, expression-list
6824 CAST_P is true if this expression is the target of a cast.
6826 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6827 argument pack.
6829 Returns a vector of trees. Each element is a representation of an
6830 assignment-expression. NULL is returned if the ( and or ) are
6831 missing. An empty, but allocated, vector is returned on no
6832 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6833 if we are parsing an attribute list for an attribute that wants a
6834 plain identifier argument, normal_attr for an attribute that wants
6835 an expression, or non_attr if we aren't parsing an attribute list. If
6836 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6837 not all of the expressions in the list were constant.
6838 WANT_LITERAL_ZERO_P is true if the caller is interested in
6839 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6840 immediately, this can be removed. */
6849 {
6855 /* Assume all the expressions will be constant. */
6864 /* Within a parenthesized expression, a `>' token is always
6865 the greater-than operator. */
6866 saved_greater_than_is_operator_p
6870 /* Consume expressions until there are no more. */
6873 {
6874 tree expr;
6876 /* At the beginning of attribute lists, check to see if the
6877 next token is an identifier. */
6880 {
6883 /* Consume the identifier. */
6885 /* Save the identifier. */
6887 }
6888 else
6889 {
6892 /* Parse the next assignment-expression. */
6894 {
6895 /* A braced-init-list. */
6901 }
6903 {
6904 expr = (cp_parser_constant_expression
6909 }
6910 else
6911 {
6915 {
6921 /* If a parameter is literal zero alone, remember it
6922 for -Wmemset-transposed-args warning. */
6925 && want_literal_zero_p
6927 == CPP_COMMA
6930 {
6937 else
6938 {
6943 }
6944 /* Consume the 0 token (or '\0', 0LL etc.). */
6946 }
6950 }
6953 cast_p);
6954 }
6959 /* If we have an ellipsis, then this is an expression
6960 expansion. */
6963 {
6964 /* Consume the `...'. */
6967 /* Build the argument pack. */
6969 }
6971 /* Add it to the list. We add error_mark_node
6972 expressions to the list, so that we can still tell if
6973 the correct form for a parenthesized expression-list
6974 is found. That gives better errors. */
6979 }
6981 /* After the first item, attribute lists look the same as
6982 expression lists. */
6985 get_comma:;
6986 /* If the next token isn't a `,', then we are done. */
6990 /* Otherwise, consume the `,' and keep going. */
6992 }
6995 {
6998 skip_comma:;
6999 /* We try and resync to an unnested comma, as that will give the
7000 user better diagnostics. */
7008 {
7009 parser->greater_than_is_operator_p
7012 }
7013 }
7015 parser->greater_than_is_operator_p
7022 }
7024 /* Parse a pseudo-destructor-name.
7026 pseudo-destructor-name:
7027 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7028 :: [opt] nested-name-specifier template template-id :: ~ type-name
7029 :: [opt] nested-name-specifier [opt] ~ type-name
7031 If either of the first two productions is used, sets *SCOPE to the
7032 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7033 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7034 or ERROR_MARK_NODE if the parse fails. */
7036 static void
7038 tree object,
7041 {
7044 /* Handle ~auto. */
7048 {
7051 "%<~auto%> only available with "
7058 }
7060 /* Assume that things will not work out. */
7063 /* Look for the optional `::' operator. */
7065 /* Look for the optional nested-name-specifier. */
7066 nested_name_specifier_p
7073 /* Now, if we saw a nested-name-specifier, we might be doing the
7074 second production. */
7077 {
7078 /* Consume the `template' keyword. */
7080 /* Parse the template-id. */
7084 class_type,
7086 /* Look for the `::' token. */
7088 }
7089 /* If the next token is not a `~', then there might be some
7090 additional qualification. */
7092 {
7093 /* At this point, we're looking for "type-name :: ~". The type-name
7094 must not be a class-name, since this is a pseudo-destructor. So,
7095 it must be either an enum-name, or a typedef-name -- both of which
7096 are just identifiers. So, we peek ahead to check that the "::"
7097 and "~" tokens are present; if they are not, then we can avoid
7098 calling type_name. */
7102 {
7105 }
7107 /* Look for the type-name. */
7112 /* Look for the `::' token. */
7114 }
7115 else
7118 /* Look for the `~'. */
7121 /* Once we see the ~, this has to be a pseudo-destructor. */
7125 /* Look for the type-name again. We are not responsible for
7126 checking that it matches the first type-name. */
7128 }
7130 /* Parse a unary-expression.
7132 unary-expression:
7133 postfix-expression
7134 ++ cast-expression
7135 -- cast-expression
7136 unary-operator cast-expression
7137 sizeof unary-expression
7138 sizeof ( type-id )
7139 alignof ( type-id ) [C++0x]
7140 new-expression
7141 delete-expression
7143 GNU Extensions:
7145 unary-expression:
7146 __extension__ cast-expression
7147 __alignof__ unary-expression
7148 __alignof__ ( type-id )
7149 alignof unary-expression [C++0x]
7150 __real__ cast-expression
7151 __imag__ cast-expression
7152 && identifier
7153 sizeof ( type-id ) { initializer-list , [opt] }
7154 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7155 __alignof__ ( type-id ) { initializer-list , [opt] }
7157 ADDRESS_P is true iff the unary-expression is appearing as the
7158 operand of the `&' operator. CAST_P is true if this expression is
7159 the target of a cast.
7161 Returns a representation of the expression. */
7163 static tree
7166 {
7170 /* Peek at the next token. */
7172 /* Some keywords give away the kind of expression. */
7174 {
7178 {
7181 {
7184 location_t first_loc;
7187 /* Consume the token. */
7190 /* Parse the operand. */
7195 else
7196 {
7197 /* ISO C++ defines alignof only with types, not with
7198 expressions. So pedwarn if alignof is used with a non-
7199 type expression. However, __alignof__ is ok. */
7202 "ISO C++ does not allow %<alignof%> "
7206 }
7207 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7208 SIZEOF_EXPR with the original operand. */
7210 {
7212 {
7214 {
7217 error_mark_node));
7219 }
7220 else
7224 }
7226 }
7228 }
7237 {
7238 /* The saved value of the PEDANTIC flag. */
7240 tree expr;
7242 /* Save away the PEDANTIC flag. */
7244 /* Parse the cast-expression. */
7246 /* Restore the PEDANTIC flag. */
7250 }
7254 {
7255 tree expression;
7257 /* Consume the `__real__' or `__imag__' token. */
7259 /* Parse the cast-expression. */
7261 /* Create the complete representation. */
7265 expression,
7266 tf_warning_or_error);
7267 }
7275 {
7276 tree expr;
7286 parser->type_definition_forbidden_message
7289 saved_integral_constant_expression_p
7291 saved_non_integral_constant_expression_p
7295 saved_greater_than_is_operator_p
7307 parser->greater_than_is_operator_p
7310 parser->integral_constant_expression_p
7312 parser->non_integral_constant_expression_p
7319 }
7323 }
7324 }
7326 /* Look for the `:: new' and `:: delete', which also signal the
7327 beginning of a new-expression, or delete-expression,
7328 respectively. If the next token is `::', then it might be one of
7329 these. */
7331 {
7334 /* See if the token after the `::' is one of the keywords in
7335 which we're interested. */
7337 /* If it's `new', we have a new-expression. */
7340 /* Similarly, for `delete'. */
7343 }
7345 /* Look for a unary operator. */
7347 /* The `++' and `--' operators can be handled similarly, even though
7348 they are not technically unary-operators in the grammar. */
7350 {
7355 /* Handle the GNU address-of-label extension. */
7358 {
7359 tree identifier;
7360 tree expression;
7363 /* Consume the '&&' token. */
7365 /* Look for the identifier. */
7367 /* Create an expression representing the address. */
7370 NIC_ADDR_LABEL))
7373 }
7374 }
7376 {
7377 tree cast_expression;
7383 /* Consume the operator token. */
7385 /* Parse the cast-expression. */
7386 cast_expression
7391 pidk);
7392 /* Now, build an appropriate representation. */
7394 {
7398 RO_UNARY_STAR,
7399 complain);
7404 /* Fall through. */
7407 cast_expression,
7408 complain);
7415 /* Fall through. */
7425 }
7429 non_constant_p))
7433 }
7437 decltype_p,
7438 pidk);
7439 }
7441 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7442 unary-operator, the corresponding tree code is returned. */
7444 static enum tree_code
7446 {
7448 {
7469 }
7470 }
7472 /* Parse a new-expression.
7474 new-expression:
7475 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7476 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7478 Returns a representation of the expression. */
7480 static tree
7482 {
7485 tree type;
7488 tree ret;
7490 /* Look for the optional `::' operator. */
7491 global_scope_p
7495 /* Look for the `new' operator. */
7497 /* There's no easy way to tell a new-placement from the
7498 `( type-id )' construct. */
7500 /* Look for a new-placement. */
7502 /* If that didn't work out, there's no new-placement. */
7504 {
7508 }
7510 /* If the next token is a `(', then we have a parenthesized
7511 type-id. */
7513 {
7517 /* Consume the `('. */
7520 /* Parse the type-id. */
7521 parser->type_definition_forbidden_message
7526 /* Look for the closing `)'. */
7529 /* There should not be a direct-new-declarator in this production,
7530 but GCC used to allowed this, so we check and emit a sensible error
7531 message for this case. */
7533 {
7539 }
7540 }
7541 /* Otherwise, there must be a new-type-id. */
7542 else
7545 /* If the next token is a `(' or '{', then we have a new-initializer. */
7549 else
7552 /* A new-expression may not appear in an integral constant
7553 expression. */
7556 else
7557 {
7558 /* Create a representation of the new-expression. */
7560 tf_warning_or_error);
7561 }
7569 }
7571 /* Parse a new-placement.
7573 new-placement:
7574 ( expression-list )
7576 Returns the same representation as for an expression-list. */
7580 {
7583 /* Parse the expression-list. */
7584 expression_list = (cp_parser_parenthesized_expression_list
7590 }
7592 /* Parse a new-type-id.
7594 new-type-id:
7595 type-specifier-seq new-declarator [opt]
7597 Returns the TYPE allocated. If the new-type-id indicates an array
7598 type, *NELTS is set to the number of elements in the last array
7599 bound; the TYPE will not include the last array bound. */
7601 static tree
7603 {
7604 cp_decl_specifier_seq type_specifier_seq;
7610 /* The type-specifier sequence must not contain type definitions.
7611 (It cannot contain declarations of new types either, but if they
7612 are not definitions we will catch that because they are not
7613 complete.) */
7615 parser->type_definition_forbidden_message
7617 /* Parse the type-specifier-seq. */
7621 /* Restore the old message. */
7627 /* Parse the new-declarator. */
7630 /* Determine the number of elements in the last array dimension, if
7631 any. */
7633 /* Skip down to the last array dimension. */
7638 {
7641 }
7646 {
7649 }
7652 {
7659 else
7661 }
7664 }
7666 /* Parse an (optional) new-declarator.
7668 new-declarator:
7669 ptr-operator new-declarator [opt]
7670 direct-new-declarator
7672 Returns the declarator. */
7676 {
7679 cp_cv_quals cv_quals;
7681 /* We don't know if there's a ptr-operator next, or not. */
7683 /* Look for a ptr-operator. */
7685 /* If that worked, look for more new-declarators. */
7687 {
7690 /* Parse another optional declarator. */
7693 declarator = cp_parser_make_indirect_declarator
7697 }
7699 /* If the next token is a `[', there is a direct-new-declarator. */
7704 }
7706 /* Parse a direct-new-declarator.
7708 direct-new-declarator:
7709 [ expression ]
7710 direct-new-declarator [constant-expression]
7712 */
7716 {
7720 {
7721 tree expression;
7724 /* Look for the opening `['. */
7729 /* The standard requires that the expression have integral
7730 type. DR 74 adds enumeration types. We believe that the
7731 real intent is that these expressions be handled like the
7732 expression in a `switch' condition, which also allows
7733 classes with a single conversion to integral or
7734 enumeration type. */
7736 {
7737 expression
7739 expression,
7742 {
7744 "expression in new-declarator must have integral "
7747 }
7748 }
7750 /* Look for the closing `]'. */
7753 /* Add this bound to the declarator. */
7756 /* If the next token is not a `[', then there are no more
7757 bounds. */
7760 }
7763 }
7765 /* Parse a new-initializer.
7767 new-initializer:
7768 ( expression-list [opt] )
7769 braced-init-list
7771 Returns a representation of the expression-list. */
7775 {
7779 {
7780 tree t;
7787 }
7788 else
7789 expression_list = (cp_parser_parenthesized_expression_list
7795 }
7797 /* Parse a delete-expression.
7799 delete-expression:
7800 :: [opt] delete cast-expression
7801 :: [opt] delete [ ] cast-expression
7803 Returns a representation of the expression. */
7805 static tree
7807 {
7810 tree expression;
7812 /* Look for the optional `::' operator. */
7813 global_scope_p
7817 /* Look for the `delete' keyword. */
7819 /* See if the array syntax is in use. */
7821 {
7822 /* Consume the `[' token. */
7824 /* Look for the `]' token. */
7826 /* Remember that this is the `[]' construct. */
7828 }
7829 else
7832 /* Parse the cast-expression. */
7835 /* A delete-expression may not appear in an integral constant
7836 expression. */
7841 tf_warning_or_error);
7842 }
7844 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7845 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7846 0 otherwise. */
7848 static int
7850 {
7853 {
7895 /* In ((type ()) () the last () isn't a valid cast-expression,
7896 so the whole must be parsed as postfix-expression. */
7901 /* '[' may start a primary-expression in obj-c++ and in C++11,
7902 as a lambda-expression, eg, '(void)[]{}'. */
7909 /* '++' and '--' may or may not start a cast-expression:
7911 struct T { void operator++(int); };
7912 void f() { (T())++; }
7914 vs
7916 int a;
7917 (int)++a; */
7922 }
7923 }
7925 /* Parse a cast-expression.
7927 cast-expression:
7928 unary-expression
7929 ( type-id ) cast-expression
7931 ADDRESS_P is true iff the unary-expression is appearing as the
7932 operand of the `&' operator. CAST_P is true if this expression is
7933 the target of a cast.
7935 Returns a representation of the expression. */
7937 static tree
7940 {
7941 /* If it's a `(', then we might be looking at a cast. */
7943 {
7949 /* There's no way to know yet whether or not this is a cast.
7950 For example, `(int (3))' is a unary-expression, while `(int)
7951 3' is a cast. So, we resort to parsing tentatively. */
7953 /* Types may not be defined in a cast. */
7955 parser->type_definition_forbidden_message
7957 /* Consume the `('. */
7959 /* A very tricky bit is that `(struct S) { 3 }' is a
7960 compound-literal (which we permit in C++ as an extension).
7961 But, that construct is not a cast-expression -- it is a
7962 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7963 is legal; if the compound-literal were a cast-expression,
7964 you'd need an extra set of parentheses.) But, if we parse
7965 the type-id, and it happens to be a class-specifier, then we
7966 will commit to the parse at that point, because we cannot
7967 undo the action that is done when creating a new class. So,
7968 then we cannot back up and do a postfix-expression.
7970 Another tricky case is the following (c++/29234):
7972 struct S { void operator () (); };
7974 void foo ()
7975 {
7976 ( S()() );
7977 }
7979 As a type-id we parse the parenthesized S()() as a function
7980 returning a function, groktypename complains and we cannot
7981 back up in this case either.
7983 Therefore, we scan ahead to the closing `)', and check to see
7984 if the tokens after the `)' can start a cast-expression. Otherwise
7985 we are dealing with an unary-expression, a postfix-expression
7986 or something else.
7988 Yet another tricky case, in C++11, is the following (c++/54891):
7990 (void)[]{};
7992 The issue is that usually, besides the case of lambda-expressions,
7993 the parenthesized type-id cannot be followed by '[', and, eg, we
7994 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7995 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7996 we don't commit, we try a cast-expression, then an unary-expression.
7998 Save tokens so that we can put them back. */
8001 /* We may be looking at a cast-expression. */
8004 cast_expression
8007 /* Roll back the tokens we skipped. */
8009 /* If we aren't looking at a cast-expression, simulate an error so
8010 that the call to cp_parser_error_occurred below returns true. */
8013 else
8014 {
8017 /* Look for the type-id. */
8019 /* Look for the closing `)'. */
8022 }
8024 /* Restore the saved message. */
8027 /* At this point this can only be either a cast or a
8028 parenthesized ctor such as `(T ())' that looks like a cast to
8029 function returning T. */
8031 {
8032 /* Only commit if the cast-expression doesn't start with
8033 '++', '--', or '[' in C++11. */
8041 pidk);
8044 {
8045 /* Warn about old-style casts, if so requested. */
8052 /* Only type conversions to integral or enumeration types
8053 can be used in constant-expressions. */
8056 NIC_CAST))
8059 /* Perform the cast. */
8062 }
8063 }
8064 else
8066 }
8068 /* If we get here, then it's not a cast, so it must be a
8069 unary-expression. */
8072 }
8074 /* Parse a binary expression of the general form:
8076 pm-expression:
8077 cast-expression
8078 pm-expression .* cast-expression
8079 pm-expression ->* cast-expression
8081 multiplicative-expression:
8082 pm-expression
8083 multiplicative-expression * pm-expression
8084 multiplicative-expression / pm-expression
8085 multiplicative-expression % pm-expression
8087 additive-expression:
8088 multiplicative-expression
8089 additive-expression + multiplicative-expression
8090 additive-expression - multiplicative-expression
8092 shift-expression:
8093 additive-expression
8094 shift-expression << additive-expression
8095 shift-expression >> additive-expression
8097 relational-expression:
8098 shift-expression
8099 relational-expression < shift-expression
8100 relational-expression > shift-expression
8101 relational-expression <= shift-expression
8102 relational-expression >= shift-expression
8104 GNU Extension:
8106 relational-expression:
8107 relational-expression <? shift-expression
8108 relational-expression >? shift-expression
8110 equality-expression:
8111 relational-expression
8112 equality-expression == relational-expression
8113 equality-expression != relational-expression
8115 and-expression:
8116 equality-expression
8117 and-expression & equality-expression
8119 exclusive-or-expression:
8120 and-expression
8121 exclusive-or-expression ^ and-expression
8123 inclusive-or-expression:
8124 exclusive-or-expression
8125 inclusive-or-expression | exclusive-or-expression
8127 logical-and-expression:
8128 inclusive-or-expression
8129 logical-and-expression && inclusive-or-expression
8131 logical-or-expression:
8132 logical-and-expression
8133 logical-or-expression || logical-and-expression
8135 All these are implemented with a single function like:
8137 binary-expression:
8138 simple-cast-expression
8139 binary-expression <token> binary-expression
8141 CAST_P is true if this expression is the target of a cast.
8143 The binops_by_token map is used to get the tree codes for each <token> type.
8144 binary-expressions are associated according to a precedence table. */
8146 #define TOKEN_PRECEDENCE(token) \
8147 (((token->type == CPP_GREATER \
8148 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8149 && !parser->greater_than_is_operator_p) \
8150 ? PREC_NOT_OPERATOR \
8151 : binops_by_token[token->type].prec)
8153 static tree
8159 {
8160 cp_parser_expression_stack stack;
8162 cp_parser_expression_stack_entry current;
8163 tree rhs;
8167 tree overload;
8169 /* Parse the first expression. */
8180 {
8181 /* Get an operator token. */
8187 {
8189 "%<>>%> operator is treated"
8193 }
8197 /* Popping an entry off the stack means we completed a subexpression:
8198 - either we found a token which is not an operator (`>' where it is not
8199 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8200 will happen repeatedly;
8201 - or, we found an operator which has lower priority. This is the case
8202 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8203 parsing `3 * 4'. */
8205 {
8208 else
8210 }
8212 get_rhs:
8216 /* We used the operator token. */
8219 /* For "false && x" or "true || x", x will never be executed;
8220 disable warnings while evaluating it. */
8226 /* Extract another operand. It may be the RHS of this expression
8227 or the LHS of a new, higher priority expression. */
8232 /* Get another operator token. Look up its precedence to avoid
8233 building a useless (immediately popped) stack entry for common
8234 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8238 {
8239 /* ... and prepare to parse the RHS of the new, higher priority
8240 expression. Since precedence levels on the stack are
8241 monotonically increasing, we do not have to care about
8242 stack overflows. */
8251 pop:
8253 /* If the stack is not empty, we have parsed into LHS the right side
8254 (`4' in the example above) of an expression we had suspended.
8255 We can use the information on the stack to recover the LHS (`3')
8256 from the stack together with the tree code (`MULT_EXPR'), and
8257 the precedence of the higher level subexpression
8258 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8259 which will be used to actually build the additive expression. */
8264 }
8266 /* Undo the disabling of warnings done above. */
8277 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8278 ERROR_MARK for everything that is not a binary expression.
8279 This makes warn_about_parentheses miss some warnings that
8280 involve unary operators. For unary expressions we should
8281 pass the correct tree_code unless the unary expression was
8282 surrounded by parentheses.
8283 */
8289 == tcc_comparison
8292 else
8301 /* If the binary operator required the use of an overloaded operator,
8302 then this expression cannot be an integral constant-expression.
8303 An overloaded operator can be used even if both operands are
8304 otherwise permissible in an integral constant-expression if at
8305 least one of the operands is of enumeration type. */
8309 NIC_OVERLOADED))
8311 }
8314 }
8316 static tree
8321 {
8324 }
8326 /* Parse the `? expression : assignment-expression' part of a
8327 conditional-expression. The LOGICAL_OR_EXPR is the
8328 logical-or-expression that started the conditional-expression.
8329 Returns a representation of the entire conditional-expression.
8331 This routine is used by cp_parser_assignment_expression.
8333 ? expression : assignment-expression
8335 GNU Extensions:
8337 ? : assignment-expression */
8339 static tree
8341 {
8342 tree expr;
8343 tree assignment_expr;
8347 /* Consume the `?' token. */
8352 {
8355 /* Implicit true clause. */
8359 }
8360 else
8361 {
8364 /* Parse the expression. */
8367 c_inhibit_evaluation_warnings +=
8371 }
8373 /* The next token should be a `:'. */
8375 /* Parse the assignment-expression. */
8379 /* Build the conditional-expression. */
8381 expr,
8382 assignment_expr,
8383 tf_warning_or_error);
8384 }
8386 /* Parse an assignment-expression.
8388 assignment-expression:
8389 conditional-expression
8390 logical-or-expression assignment-operator assignment_expression
8391 throw-expression
8393 CAST_P is true if this expression is the target of a cast.
8394 DECLTYPE_P is true if this expression is the operand of decltype.
8396 Returns a representation for the expression. */
8398 static tree
8401 {
8402 tree expr;
8404 /* If the next token is the `throw' keyword, then we're looking at
8405 a throw-expression. */
8408 /* Otherwise, it must be that we are looking at a
8409 logical-or-expression. */
8410 else
8411 {
8412 /* Parse the binary expressions (logical-or-expression). */
8414 decltype_p,
8416 /* If the next token is a `?' then we're actually looking at a
8417 conditional-expression. */
8420 else
8421 {
8424 /* If it's an assignment-operator, we're using the second
8425 production. */
8426 enum tree_code assignment_operator
8429 {
8431 location_t saved_input_location;
8433 /* Parse the right-hand side of the assignment. */
8439 /* An assignment may not appear in a
8440 constant-expression. */
8442 NIC_ASSIGNMENT))
8444 /* Build the assignment expression. Its default
8445 location is the location of the '=' token. */
8449 assignment_operator,
8450 rhs,
8453 }
8454 }
8455 }
8458 }
8460 /* Parse an (optional) assignment-operator.
8462 assignment-operator: one of
8463 = *= /= %= += -= >>= <<= &= ^= |=
8465 GNU Extension:
8467 assignment-operator: one of
8468 <?= >?=
8470 If the next token is an assignment operator, the corresponding tree
8471 code is returned, and the token is consumed. For example, for
8472 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8473 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8474 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8475 operator, ERROR_MARK is returned. */
8477 static enum tree_code
8479 {
8483 /* Peek at the next token. */
8487 {
8533 /* Nothing else is an assignment operator. */
8535 }
8537 /* If it was an assignment operator, consume it. */
8542 }
8544 /* Parse an expression.
8546 expression:
8547 assignment-expression
8548 expression , assignment-expression
8550 CAST_P is true if this expression is the target of a cast.
8551 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8552 except possibly parenthesized or on the RHS of a comma (N3276).
8554 Returns a representation of the expression. */
8556 static tree
8559 {
8564 {
8565 tree assignment_expression;
8567 /* Parse the next assignment-expression. */
8568 assignment_expression
8571 /* We don't create a temporary for a call that is the immediate operand
8572 of decltype or on the RHS of a comma. But when we see a comma, we
8573 need to create a temporary for a call on the LHS. */
8578 assignment_expression
8582 /* If this is the first assignment-expression, we can just
8583 save it away. */
8586 else
8588 assignment_expression,
8590 /* If the next token is not a comma, then we are done with the
8591 expression. */
8594 /* Consume the `,'. */
8597 /* A comma operator cannot appear in a constant-expression. */
8600 }
8603 }
8605 /* Parse a constant-expression.
8607 constant-expression:
8608 conditional-expression
8610 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8611 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8612 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8613 is false, NON_CONSTANT_P should be NULL. */
8615 static tree
8619 {
8623 tree expression;
8625 /* It might seem that we could simply parse the
8626 conditional-expression, and then check to see if it were
8627 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8628 one that the compiler can figure out is constant, possibly after
8629 doing some simplifications or optimizations. The standard has a
8630 precise definition of constant-expression, and we must honor
8631 that, even though it is somewhat more restrictive.
8633 For example:
8635 int i[(2, 3)];
8637 is not a legal declaration, because `(2, 3)' is not a
8638 constant-expression. The `,' operator is forbidden in a
8639 constant-expression. However, GCC's constant-folding machinery
8640 will fold this operation to an INTEGER_CST for `3'. */
8642 /* Save the old settings. */
8644 saved_allow_non_integral_constant_expression_p
8647 /* We are now parsing a constant-expression. */
8649 parser->allow_non_integral_constant_expression_p
8652 /* Although the grammar says "conditional-expression", we parse an
8653 "assignment-expression", which also permits "throw-expression"
8654 and the use of assignment operators. In the case that
8655 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8656 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8657 actually essential that we look for an assignment-expression.
8658 For example, cp_parser_initializer_clauses uses this function to
8659 determine whether a particular assignment-expression is in fact
8660 constant. */
8662 /* Restore the old settings. */
8663 parser->integral_constant_expression_p
8665 parser->allow_non_integral_constant_expression_p
8668 {
8669 /* Require an rvalue constant expression here; that's what our
8670 callers expect. Reference constant expressions are handled
8671 separately in e.g. cp_parser_template_argument. */
8676 }
8679 parser->non_integral_constant_expression_p
8683 }
8685 /* Parse __builtin_offsetof.
8687 offsetof-expression:
8688 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8690 offsetof-member-designator:
8691 id-expression
8692 | offsetof-member-designator "." id-expression
8693 | offsetof-member-designator "[" expression "]"
8694 | offsetof-member-designator "->" id-expression */
8696 static tree
8698 {
8701 cp_id_kind dummy;
8704 /* We're about to accept non-integral-constant things, but will
8705 definitely yield an integral constant expression. Save and
8706 restore these values around our local parsing. */
8710 /* Consume the "__builtin_offsetof" token. */
8712 /* Consume the opening `('. */
8714 /* Parse the type-id. */
8717 /* Look for the `,'. */
8721 /* Build the (type *)null that begins the traditional offsetof macro. */
8723 tf_warning_or_error);
8725 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8729 {
8732 {
8734 /* offsetof-member-designator "[" expression "]" */
8740 /* offsetof-member-designator "->" identifier */
8743 /* FALLTHRU */
8746 /* offsetof-member-designator "." identifier */
8754 /* Consume the ")" token. */
8759 /* Error. We know the following require will fail, but
8760 that gives the proper error message. */
8765 }
8766 }
8768 success:
8771 failure:
8776 }
8778 /* Parse a trait expression.
8780 Returns a representation of the expression, the underlying type
8781 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8783 static tree
8785 {
8786 cp_trait_kind kind;
8792 {
8876 }
8878 /* Consume the token. */
8889 {
8896 }
8898 {
8900 {
8904 {
8907 }
8911 }
8912 }
8916 /* Complete the trait expression, which may mean either processing
8917 the trait expr now or saving it for template instantiation. */
8919 {
8928 }
8929 }
8931 /* Lambdas that appear in variable initializer or default argument scope
8932 get that in their mangling, so we need to record it. We might as well
8933 use the count for function and namespace scopes as well. */
8937 {
8938 tree t;
8943 static void
8945 {
8946 tree_int ti;
8948 /* Once we're inside a function, we ignore other scopes and just push
8949 the function again so that popping works properly. */
8956 {
8957 /* Don't reset the count if we're still in the same function. */
8960 }
8961 }
8963 static void
8965 {
8968 }
8970 static void
8972 {
8975 {
8978 }
8980 }
8982 /* Parse a lambda expression.
8984 lambda-expression:
8985 lambda-introducer lambda-declarator [opt] compound-statement
8987 Returns a representation of the expression. */
8989 static tree
8991 {
8993 tree type;
9001 {
9003 {
9007 }
9009 }
9011 {
9013 {
9016 }
9018 }
9020 /* We may be in the middle of deferred access check. Disable
9021 it now. */
9032 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9035 /* Now that we've started the type, add the capture fields for any
9036 explicit captures. */
9039 {
9040 /* Inside the class, surrounding template-parameter-lists do not apply. */
9041 unsigned int saved_num_template_parameter_lists
9045 bool fully_implicit_function_template_p
9049 bool auto_is_implicit_function_template_parm_p
9060 /* By virtue of defining a local class, a lambda expression has access to
9061 the private variables of enclosing classes. */
9066 {
9072 }
9074 {
9077 }
9079 /* The capture list was built up in reverse order; fix that now. */
9091 parser->fully_implicit_function_template_p
9095 parser->auto_is_implicit_function_template_parm_p
9097 }
9101 /* This field is only used during parsing of the lambda. */
9104 /* This lambda shouldn't have any proxies left at this point. */
9106 /* And now that we're done, push proxies for an enclosing lambda. */
9111 else
9117 }
9119 /* Parse the beginning of a lambda expression.
9121 lambda-introducer:
9122 [ lambda-capture [opt] ]
9124 LAMBDA_EXPR is the current representation of the lambda expression. */
9126 static void
9128 {
9129 /* Need commas after the first capture. */
9132 /* Eat the leading `['. */
9135 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9143 {
9146 }
9149 {
9151 tree capture_id;
9152 tree capture_init_expr;
9156 enum capture_kind_type
9157 {
9158 BY_COPY,
9159 BY_REFERENCE
9160 };
9164 {
9167 }
9171 else
9174 /* Possibly capture `this'. */
9176 {
9186 explicit_init_p);
9188 }
9190 /* Remember whether we want to capture as a reference or not. */
9192 {
9195 }
9197 /* Get the identifier. */
9202 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9203 delimiters, but I modified this to stop on unnested ']' as well. It
9204 was already changed to stop on unnested '}', so the
9205 "closing_parenthesis" name is no more misleading with my change. */
9206 {
9212 }
9214 /* Find the initializer for this capture. */
9218 {
9220 /* An explicit initializer exists. */
9223 "lambda capture initializers "
9229 {
9232 }
9233 }
9234 else
9235 {
9238 /* Turn the identifier into an id-expression. */
9239 capture_init_expr
9244 {
9247 }
9251 {
9254 capture_init_expr);
9257 }
9260 {
9263 capture_init_expr))
9266 }
9268 capture_init_expr
9269 = finish_id_expression
9271 capture_init_expr,
9285 {
9288 }
9289 else
9291 }
9295 {
9300 capture_id);
9304 "capture of %qD redundant with by-reference capture "
9306 }
9309 capture_id,
9310 capture_init_expr,
9312 explicit_init_p);
9313 }
9316 }
9318 /* Parse the (optional) middle of a lambda expression.
9320 lambda-declarator:
9321 < template-parameter-list [opt] >
9322 ( parameter-declaration-clause [opt] )
9323 attribute-specifier [opt]
9324 mutable [opt]
9325 exception-specification [opt]
9326 lambda-return-type-clause [opt]
9328 LAMBDA_EXPR is the current representation of the lambda expression. */
9330 static bool
9332 {
9333 /* 5.1.1.4 of the standard says:
9334 If a lambda-expression does not include a lambda-declarator, it is as if
9335 the lambda-declarator were ().
9336 This means an empty parameter list, no attributes, and no exception
9337 specification. */
9343 /* The template-parameter-list is optional, but must begin with
9344 an opening angle if present. */
9346 {
9349 "lambda templates are only available with "
9358 /* We just processed one more parameter list. */
9360 }
9362 /* The parameter-declaration-clause is optional (unless
9363 template-parameter-list was given), but must begin with an
9364 opening parenthesis if present. */
9366 {
9371 /* Parse parameters. */
9374 /* Default arguments shall not be specified in the
9375 parameter-declaration-clause of a lambda-declarator. */
9385 /* Parse optional `mutable' keyword. */
9387 {
9390 }
9392 /* Parse optional exception specification. */
9395 /* Parse optional trailing return type. */
9397 {
9401 }
9403 /* The function parameters must be in scope all the way until after the
9404 trailing-return-type in case of decltype. */
9406 }
9410 /* Create the function call operator.
9412 Messing with declarators like this is no uglier than building up the
9413 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9414 other code. */
9415 {
9416 cp_decl_specifier_seq return_type_specs;
9418 tree fco;
9425 else
9426 /* Maybe we will deduce the return type later. */
9432 sfk_none);
9437 VIRT_SPEC_UNSPECIFIED,
9438 REF_QUAL_NONE,
9439 exception_spec,
9444 declarator,
9445 attributes);
9447 {
9450 /* Give the object parameter a different name. */
9454 }
9456 {
9460 }
9469 }
9470 }
9472 /* Parse the body of a lambda expression, which is simply
9474 compound-statement
9476 but which requires special handling.
9477 LAMBDA_EXPR is the current representation of the lambda expression. */
9479 static void
9481 {
9486 else
9487 /* Still increment function_depth so that we don't GC in the
9488 middle of an expression. */
9490 /* Clear this in case we're in the middle of a default argument. */
9493 /* Finish the function call operator
9494 - class_specifier
9495 + late_parsing_for_member
9496 + function_definition_after_declarator
9497 + ctor_initializer_opt_and_function_body */
9498 {
9500 tree body;
9502 tree compound_stmt;
9503 tree cap;
9505 /* Let the front end know that we are going to be defining this
9506 function. */
9508 NULL_TREE,
9517 /* Push the proxies for any explicit captures. */
9524 /* 5.1.1.4 of the standard says:
9525 If a lambda-expression does not include a trailing-return-type, it
9526 is as if the trailing-return-type denotes the following type:
9527 * if the compound-statement is of the form
9528 { return attribute-specifier [opt] expression ; }
9529 the type of the returned expression after lvalue-to-rvalue
9530 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9531 (_conv.array_ 4.2), and function-to-pointer conversion
9532 (_conv.func_ 4.3);
9533 * otherwise, void. */
9535 /* In a lambda that has neither a lambda-return-type-clause
9536 nor a deducible form, errors should be reported for return statements
9537 in the body. Since we used void as the placeholder return type, parsing
9538 the body as usual will give such desired behavior. */
9542 {
9546 /* Parse tentatively in case there's more after the initial return
9547 statement. */
9558 {
9562 /* Will get error here if type not deduced yet. */
9566 }
9567 }
9570 {
9575 }
9579 out:
9583 /* Finish the function and generate code for it if necessary. */
9586 /* Only expand if the call op is not a template. */
9589 }
9594 else
9596 }
9598 /* Statements [gram.stmt.stmt] */
9600 /* Parse a statement.
9602 statement:
9603 labeled-statement
9604 expression-statement
9605 compound-statement
9606 selection-statement
9607 iteration-statement
9608 jump-statement
9609 declaration-statement
9610 try-block
9612 C++11:
9614 statement:
9615 labeled-statement
9616 attribute-specifier-seq (opt) expression-statement
9617 attribute-specifier-seq (opt) compound-statement
9618 attribute-specifier-seq (opt) selection-statement
9619 attribute-specifier-seq (opt) iteration-statement
9620 attribute-specifier-seq (opt) jump-statement
9621 declaration-statement
9622 attribute-specifier-seq (opt) try-block
9624 TM Extension:
9626 statement:
9627 atomic-statement
9629 IN_COMPOUND is true when the statement is nested inside a
9630 cp_parser_compound_statement; this matters for certain pragmas.
9632 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9633 is a (possibly labeled) if statement which is not enclosed in braces
9634 and has an else clause. This is used to implement -Wparentheses. */
9636 static void
9639 {
9644 restart:
9647 /* There is no statement yet. */
9653 /* In obj-c++, seeing '[[' might be the either the beginning of
9654 c++11 attributes, or a nested objc-message-expression. So
9655 let's parse the c++11 attributes tentatively. */
9659 {
9662 }
9664 /* Peek at the next token. */
9666 /* Remember the location of the first token in the statement. */
9668 /* If this is a keyword, then that will often determine what kind of
9669 statement we have. */
9671 {
9675 {
9678 /* Looks like a labeled-statement with a case label.
9679 Parse the label, and then use tail recursion to parse
9680 the statement. */
9697 {
9702 }
9703 else
9717 {
9722 }
9723 else
9724 {
9728 }
9732 /* Objective-C++ exception-handling constructs. */
9746 /* This must be a namespace alias definition. */
9759 /* It might be a keyword like `int' that can start a
9760 declaration-statement. */
9762 }
9763 }
9765 {
9766 /* If the next token is a `:', then we are looking at a
9767 labeled-statement. */
9770 {
9771 /* Looks like a labeled-statement with an ordinary label.
9772 Parse the label, and then use tail recursion to parse
9773 the statement. */
9777 }
9778 }
9779 /* Anything that starts with a `{' must be a compound-statement. */
9782 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9783 a statement all its own. */
9785 {
9786 /* Only certain OpenMP pragmas are attached to statements, and thus
9787 are considered statements themselves. All others are not. In
9788 the context of a compound, accept the pragma as a "statement" and
9789 return so that we can check for a close brace. Otherwise we
9790 require a real statement and must go back and read one. */
9796 }
9798 {
9801 }
9803 /* Everything else must be a declaration-statement or an
9804 expression-statement. Try for the declaration-statement
9805 first, unless we are looking at a `;', in which case we know that
9806 we have an expression-statement. */
9808 {
9810 {
9812 {
9813 /* Attributes should be parsed as part of the the
9814 declaration, so let's un-parse them. */
9817 }
9820 /* Try to parse the declaration-statement. */
9822 /* If that worked, we're done. */
9825 }
9826 /* Look for an expression-statement instead. */
9828 }
9830 /* Set the line number for the statement. */
9834 /* Note that for now, we don't do anything with c++11 statements
9835 parsed at this level. */
9838 OPT_Wattributes,
9840 }
9842 /* Parse the label for a labeled-statement, i.e.
9844 identifier :
9845 case constant-expression :
9846 default :
9848 GNU Extension:
9849 case constant-expression ... constant-expression : statement
9851 When a label is parsed without errors, the label is added to the
9852 parse tree by the finish_* functions, so this function doesn't
9853 have to return the label. */
9855 static void
9857 {
9862 /* The next token should be an identifier. */
9866 {
9869 }
9873 {
9875 {
9879 /* Consume the `case' token. */
9881 /* Parse the constant-expression. */
9888 {
9889 /* Consume the `...' token. */
9895 /* We don't need to emit warnings here, as the common code
9896 will do this for us. */
9897 }
9898 else
9903 else
9906 expr);
9907 }
9911 /* Consume the `default' token. */
9916 else
9921 /* Anything else must be an ordinary label. */
9924 }
9926 /* Require the `:' token. */
9929 /* An ordinary label may optionally be followed by attributes.
9930 However, this is only permitted if the attributes are then
9931 followed by a semicolon. This is because, for backward
9932 compatibility, when parsing
9933 lab: __attribute__ ((unused)) int i;
9934 we want the attribute to attach to "i", not "lab". */
9937 {
9938 tree attrs;
9945 ;
9946 else
9948 }
9954 }
9956 /* Parse an expression-statement.
9958 expression-statement:
9959 expression [opt] ;
9961 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9962 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9963 indicates whether this expression-statement is part of an
9964 expression statement. */
9966 static tree
9968 {
9972 /* If the next token is a ';', then there is no expression
9973 statement. */
9975 {
9979 {
9982 }
9983 }
9985 /* Give a helpful message for "A<T>::type t;" and the like. */
9988 {
9995 {
9996 /* A::A a; */
10001 }
10002 }
10004 /* Consume the final `;'. */
10009 /* This is the final expression statement of a statement
10010 expression. */
10016 }
10018 /* Parse a compound-statement.
10020 compound-statement:
10021 { statement-seq [opt] }
10023 GNU extension:
10025 compound-statement:
10026 { label-declaration-seq [opt] statement-seq [opt] }
10028 label-declaration-seq:
10029 label-declaration
10030 label-declaration-seq label-declaration
10032 Returns a tree representing the statement. */
10034 static tree
10037 {
10038 tree compound_stmt;
10040 /* Consume the `{'. */
10047 /* Begin the compound-statement. */
10049 /* If the next keyword is `__label__' we have a label declaration. */
10052 /* Parse an (optional) statement-seq. */
10054 /* Finish the compound-statement. */
10056 /* Consume the `}'. */
10060 }
10062 /* Parse an (optional) statement-seq.
10064 statement-seq:
10065 statement
10066 statement-seq [opt] statement */
10068 static void
10070 {
10071 /* Scan statements until there aren't any more. */
10073 {
10076 /* If we are looking at a `}', then we have run out of
10077 statements; the same is true if we have reached the end
10078 of file, or have stumbled upon a stray '@end'. */
10085 /* If we are in a compound statement and find 'else' then
10086 something went wrong. */
10088 {
10091 else
10092 {
10095 }
10096 }
10098 /* Parse the statement. */
10100 }
10101 }
10103 /* Parse a selection-statement.
10105 selection-statement:
10106 if ( condition ) statement
10107 if ( condition ) statement else statement
10108 switch ( condition ) statement
10110 Returns the new IF_STMT or SWITCH_STMT.
10112 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10113 is a (possibly labeled) if statement which is not enclosed in
10114 braces and has an else clause. This is used to implement
10115 -Wparentheses. */
10117 static tree
10119 {
10126 /* Peek at the next token. */
10129 /* See what kind of keyword it is. */
10132 {
10135 {
10136 tree statement;
10137 tree condition;
10139 /* Look for the `('. */
10141 {
10144 }
10146 /* Begin the selection-statement. */
10149 else
10152 /* Parse the condition. */
10154 /* Look for the `)'. */
10160 {
10164 /* Add the condition. */
10167 /* Parse the then-clause. */
10171 {
10179 }
10180 else
10186 /* If the next token is `else', parse the else-clause. */
10188 RID_ELSE))
10189 {
10190 /* Consume the `else' keyword. */
10193 /* Parse the else-clause. */
10195 {
10196 location_t loc;
10203 }
10204 else
10209 /* If we are currently parsing a then-clause, then
10210 IF_P will not be NULL. We set it to true to
10211 indicate that this if statement has an else clause.
10212 This may trigger the Wparentheses warning below
10213 when we get back up to the parent if statement. */
10216 }
10217 else
10218 {
10219 /* This if statement does not have an else clause. If
10220 NESTED_IF is true, then the then-clause is an if
10221 statement which does have an else clause. We warn
10222 about the potential ambiguity. */
10225 "suggest explicit braces to avoid ambiguous"
10227 }
10229 /* Now we're all done with the if-statement. */
10231 }
10232 else
10233 {
10237 /* Add the condition. */
10240 /* Parse the body of the switch-statement. */
10249 /* Now we're all done with the switch-statement. */
10251 }
10254 }
10260 }
10261 }
10263 /* Parse a condition.
10265 condition:
10266 expression
10267 type-specifier-seq declarator = initializer-clause
10268 type-specifier-seq declarator braced-init-list
10270 GNU Extension:
10272 condition:
10273 type-specifier-seq declarator asm-specification [opt]
10274 attributes [opt] = assignment-expression
10276 Returns the expression that should be tested. */
10278 static tree
10280 {
10281 cp_decl_specifier_seq type_specifiers;
10285 /* Try the declaration first. */
10287 /* New types are not allowed in the type-specifier-seq for a
10288 condition. */
10290 parser->type_definition_forbidden_message
10292 /* Parse the type-specifier-seq. */
10294 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10297 /* Restore the saved message. */
10299 /* If all is well, we might be looking at a declaration. */
10301 {
10302 tree decl;
10303 tree asm_specification;
10304 tree attributes;
10308 /* Parse the declarator. */
10314 /* Parse the attributes. */
10316 /* Parse the asm-specification. */
10318 /* If the next token is not an `=' or '{', then we might still be
10319 looking at an expression. For example:
10321 if (A(a).x)
10323 looks like a decl-specifier-seq and a declarator -- but then
10324 there is no `=', so this is an expression. */
10329 /* If we did see an `=' or '{', then we are looking at a declaration
10330 for sure. */
10332 {
10333 tree pushed_scope;
10337 /* Create the declaration. */
10343 /* Parse the initializer. */
10345 {
10349 }
10350 else
10351 {
10352 /* Consume the `='. */
10355 }
10359 /* Process the initializer. */
10362 asm_specification,
10363 flags);
10369 }
10370 }
10371 /* If we didn't even get past the declarator successfully, we are
10372 definitely not looking at a declaration. */
10373 else
10376 /* Otherwise, we are looking at an expression. */
10378 }
10380 /* Parses a for-statement or range-for-statement until the closing ')',
10381 not included. */
10383 static tree
10385 {
10389 /* Begin the for-statement. */
10392 /* Parse the initialization. */
10397 else
10399 }
10401 static tree
10403 {
10404 /* Normal for loop */
10407 tree stmt;
10410 /* The for-init-statement has already been parsed in
10411 cp_parser_for_init_statement, so no work is needed here. */
10414 /* If there's a condition, process it. */
10418 {
10422 }
10424 /* Look for the `;'. */
10427 /* If there's an expression, process it. */
10433 }
10435 /* Tries to parse a range-based for-statement:
10437 range-based-for:
10438 decl-specifier-seq declarator : expression
10440 The decl-specifier-seq declarator and the `:' are already parsed by
10441 cp_parser_for_init_statement. If processing_template_decl it returns a
10442 newly created RANGE_FOR_STMT; if not, it is converted to a
10443 regular FOR_STMT. */
10445 static tree
10448 {
10452 {
10455 }
10456 else
10459 /* If in template, STMT is converted to a normal for-statement
10460 at instantiation. If not, it is done just ahead. */
10462 {
10470 /* do_auto_deduction doesn't mess with template init-lists. */
10473 }
10474 else
10475 {
10478 }
10480 }
10482 /* Subroutine of cp_convert_range_for: given the initializer expression,
10483 builds up the range temporary. */
10485 static tree
10487 {
10490 /* Find out the type deduced by the declaration
10491 `auto &&__range = range_expr'. */
10496 /* Create the __range variable. */
10503 }
10505 /* Used by cp_parser_range_for in template context: we aren't going to
10506 do a full conversion yet, but we still need to resolve auto in the
10507 type of the for-range-declaration if present. This is basically
10508 a shortcut version of cp_convert_range_for. */
10510 static void
10512 {
10515 {
10518 iter_type = (cp_parser_perform_range_for_lookup
10521 {
10523 iter_type);
10525 tf_warning_or_error);
10528 }
10529 }
10530 }
10532 /* Converts a range-based for-statement into a normal
10533 for-statement, as per the definition.
10535 for (RANGE_DECL : RANGE_EXPR)
10536 BLOCK
10538 should be equivalent to:
10540 {
10541 auto &&__range = RANGE_EXPR;
10542 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10543 __begin != __end;
10544 ++__begin)
10545 {
10546 RANGE_DECL = *__begin;
10547 BLOCK
10548 }
10549 }
10551 If RANGE_EXPR is an array:
10552 BEGIN_EXPR = __range
10553 END_EXPR = __range + ARRAY_SIZE(__range)
10554 Else if RANGE_EXPR has a member 'begin' or 'end':
10555 BEGIN_EXPR = __range.begin()
10556 END_EXPR = __range.end()
10557 Else:
10558 BEGIN_EXPR = begin(__range)
10559 END_EXPR = end(__range);
10561 If __range has a member 'begin' but not 'end', or vice versa, we must
10562 still use the second alternative (it will surely fail, however).
10563 When calling begin()/end() in the third alternative we must use
10564 argument dependent lookup, but always considering 'std' as an associated
10565 namespace. */
10567 tree
10570 {
10576 /* If an error happened previously do nothing or else a lot of
10577 unhelpful errors would be issued. */
10579 else
10580 {
10581 tree range_temp;
10585 /* Can't bind a reference to an array of runtime bound. */
10587 else
10588 {
10593 LOOKUP_ONLYCONVERTING);
10595 }
10598 }
10600 /* The new for initialization statement. */
10608 LOOKUP_ONLYCONVERTING);
10617 LOOKUP_ONLYCONVERTING);
10621 /* The new for condition. */
10628 /* The new increment expression. */
10631 tf_warning_or_error);
10634 /* The declaration is initialized with *__begin inside the loop body. */
10637 tf_warning_or_error),
10639 LOOKUP_ONLYCONVERTING);
10642 }
10644 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10645 We need to solve both at the same time because the method used
10646 depends on the existence of members begin or end.
10647 Returns the type deduced for the iterator expression. */
10649 static tree
10651 {
10653 {
10656 }
10659 {
10664 }
10666 {
10667 /* If RANGE is an array, we will use pointer arithmetic. */
10670 range,
10674 }
10675 else
10676 {
10677 /* If it is not an array, we must do a bit of magic. */
10687 tf_warning_or_error);
10690 tf_warning_or_error);
10693 {
10694 /* Use the member functions. */
10697 else
10703 else
10706 }
10707 else
10708 {
10709 /* Use global functions with ADL. */
10716 tf_warning_or_error);
10718 tf_warning_or_error);
10720 tf_warning_or_error);
10722 tf_warning_or_error);
10725 }
10727 /* Last common checks. */
10729 {
10730 /* If one of the expressions is an error do no more checks. */
10733 }
10736 /* Can happen, when, eg, in a template context, Koenig lookup
10737 can't resolve begin/end (c++/58503). */
10739 else
10740 {
10742 /* The unqualified type of the __begin and __end temporaries should
10743 be the same, as required by the multiple auto declaration. */
10749 }
10750 }
10751 }
10753 /* Helper function for cp_parser_perform_range_for_lookup.
10754 Builds a tree for RANGE.IDENTIFIER(). */
10756 static tree
10758 {
10771 tf_warning_or_error);
10774 }
10776 /* Parse an iteration-statement.
10778 iteration-statement:
10779 while ( condition ) statement
10780 do statement while ( expression ) ;
10781 for ( for-init-statement condition [opt] ; expression [opt] )
10782 statement
10784 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10786 static tree
10788 {
10791 tree statement;
10794 /* Peek at the next token. */
10799 /* Remember whether or not we are already within an iteration
10800 statement. */
10803 /* See what kind of keyword it is. */
10806 {
10808 {
10809 tree condition;
10811 /* Begin the while-statement. */
10813 /* Look for the `('. */
10815 /* Parse the condition. */
10818 /* Look for the `)'. */
10820 /* Parse the dependent statement. */
10824 /* We're done with the while-statement. */
10826 }
10830 {
10831 tree expression;
10833 /* Begin the do-statement. */
10835 /* Parse the body of the do-statement. */
10840 /* Look for the `while' keyword. */
10842 /* Look for the `('. */
10844 /* Parse the expression. */
10846 /* We're done with the do-statement. */
10848 /* Look for the `)'. */
10850 /* Look for the `;'. */
10852 }
10856 {
10857 /* Look for the `('. */
10862 /* Look for the `)'. */
10865 /* Parse the body of the for-statement. */
10870 /* We're done with the for-statement. */
10872 }
10879 }
10882 }
10884 /* Parse a for-init-statement or the declarator of a range-based-for.
10885 Returns true if a range-based-for declaration is seen.
10887 for-init-statement:
10888 expression-statement
10889 simple-declaration */
10891 static bool
10893 {
10894 /* If the next token is a `;', then we have an empty
10895 expression-statement. Grammatically, this is also a
10896 simple-declaration, but an invalid one, because it does not
10897 declare anything. Therefore, if we did not handle this case
10898 specially, we would issue an error message about an invalid
10899 declaration. */
10901 {
10907 {
10908 /* N3994 -- for (id : init) ... */
10911 "type-specifier only available with "
10919 }
10921 /* A colon is used in range-based for. */
10924 /* We're going to speculatively look for a declaration, falling back
10925 to an expression, if necessary. */
10927 /* Parse the declaration. */
10930 decl);
10933 {
10934 /* It is a range-for, consume the ':' */
10938 {
10940 "range-based %<for%> loops only available with "
10943 }
10944 }
10945 else
10946 /* The ';' is not consumed yet because we told
10947 cp_parser_simple_declaration not to. */
10952 /* If the tentative parse failed, then we shall need to look for an
10953 expression-statement. */
10954 }
10955 /* If we are here, it is an expression-statement. */
10958 }
10960 /* Parse a jump-statement.
10962 jump-statement:
10963 break ;
10964 continue ;
10965 return expression [opt] ;
10966 return braced-init-list ;
10967 goto identifier ;
10969 GNU extension:
10971 jump-statement:
10972 goto * expression ;
10974 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10976 static tree
10978 {
10984 /* Peek at the next token. */
10989 /* See what kind of keyword it is. */
10992 {
10996 {
11016 }
11022 {
11029 /* Fall through. */
11039 }
11044 {
11045 tree expr;
11049 {
11053 }
11056 else
11057 /* If the next token is a `;', then there is no
11058 expression. */
11060 /* Build the return-statement. */
11062 /* Look for the final `;'. */
11064 }
11070 {
11073 }
11075 /* Create the goto-statement. */
11077 {
11078 /* Issue a warning about this use of a GNU extension. */
11080 /* Consume the '*' token. */
11082 /* Parse the dependent expression. */
11084 }
11085 else
11087 /* Look for the final `;'. */
11094 }
11097 }
11099 /* Parse a declaration-statement.
11101 declaration-statement:
11102 block-declaration */
11104 static void
11106 {
11109 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11112 /* Parse the block-declaration. */
11115 /* Free any declarators allocated. */
11117 }
11119 /* Some dependent statements (like `if (cond) statement'), are
11120 implicitly in their own scope. In other words, if the statement is
11121 a single statement (as opposed to a compound-statement), it is
11122 none-the-less treated as if it were enclosed in braces. Any
11123 declarations appearing in the dependent statement are out of scope
11124 after control passes that point. This function parses a statement,
11125 but ensures that is in its own scope, even if it is not a
11126 compound-statement.
11128 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11129 is a (possibly labeled) if statement which is not enclosed in
11130 braces and has an else clause. This is used to implement
11131 -Wparentheses.
11133 Returns the new statement. */
11135 static tree
11137 {
11138 tree statement;
11143 /* Mark if () ; with a special NOP_EXPR. */
11145 {
11149 }
11150 /* if a compound is opened, we simply parse the statement directly. */
11153 /* If the token is not a `{', then we must take special action. */
11154 else
11155 {
11156 /* Create a compound-statement. */
11158 /* Parse the dependent-statement. */
11160 /* Finish the dummy compound-statement. */
11162 }
11164 /* Return the statement. */
11166 }
11168 /* For some dependent statements (like `while (cond) statement'), we
11169 have already created a scope. Therefore, even if the dependent
11170 statement is a compound-statement, we do not want to create another
11171 scope. */
11173 static void
11175 {
11176 /* If the token is a `{', then we must take special action. */
11179 else
11180 {
11181 /* Avoid calling cp_parser_compound_statement, so that we
11182 don't create a new scope. Do everything else by hand. */
11184 /* If the next keyword is `__label__' we have a label declaration. */
11187 /* Parse an (optional) statement-seq. */
11190 }
11191 }
11193 /* Declarations [gram.dcl.dcl] */
11195 /* Parse an optional declaration-sequence.
11197 declaration-seq:
11198 declaration
11199 declaration-seq declaration */
11201 static void
11203 {
11205 {
11216 {
11217 /* A declaration consisting of a single semicolon is
11218 invalid. Allow it unless we're being pedantic. */
11223 }
11225 /* If we're entering or exiting a region that's implicitly
11226 extern "C", modify the lang context appropriately. */
11228 {
11231 }
11233 {
11236 }
11239 {
11240 /* A top-level declaration can consist solely of a #pragma.
11241 A nested declaration cannot, so this is done here and not
11242 in cp_parser_declaration. (A #pragma at block scope is
11243 handled in cp_parser_statement.) */
11246 }
11248 /* Parse the declaration itself. */
11250 }
11251 }
11253 /* Parse a declaration.
11255 declaration:
11256 block-declaration
11257 function-definition
11258 template-declaration
11259 explicit-instantiation
11260 explicit-specialization
11261 linkage-specification
11262 namespace-definition
11264 GNU extension:
11266 declaration:
11267 __extension__ declaration */
11269 static void
11271 {
11272 cp_token token1;
11273 cp_token token2;
11278 /* Check for the `__extension__' keyword. */
11280 {
11281 /* Parse the qualified declaration. */
11283 /* Restore the PEDANTIC flag. */
11287 }
11289 /* Try to figure out what kind of declaration is present. */
11294 else
11295 {
11298 }
11300 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11303 /* If the next token is `extern' and the following token is a string
11304 literal, then we have a linkage specification. */
11308 /* If the next token is `template', then we have either a template
11309 declaration, an explicit instantiation, or an explicit
11310 specialization. */
11312 {
11313 /* `template <>' indicates a template specialization. */
11317 /* `template <' indicates a template declaration. */
11320 /* Anything else must be an explicit instantiation. */
11321 else
11323 }
11324 /* If the next token is `export', then we have a template
11325 declaration. */
11328 /* If the next token is `extern', 'static' or 'inline' and the one
11329 after that is `template', we have a GNU extended explicit
11330 instantiation directive. */
11337 /* If the next token is `namespace', check for a named or unnamed
11338 namespace definition. */
11344 /* An unnamed namespace definition. */
11348 /* An inline (associated) namespace definition. */
11352 /* Objective-C++ declaration/definition. */
11359 /* We must have either a block declaration or a function
11360 definition. */
11361 else
11362 /* Try to parse a block-declaration, or a function-definition. */
11365 /* Free any declarators allocated. */
11367 }
11369 /* Parse a block-declaration.
11371 block-declaration:
11372 simple-declaration
11373 asm-definition
11374 namespace-alias-definition
11375 using-declaration
11376 using-directive
11378 GNU Extension:
11380 block-declaration:
11381 __extension__ block-declaration
11383 C++0x Extension:
11385 block-declaration:
11386 static_assert-declaration
11388 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11389 part of a declaration-statement. */
11391 static void
11394 {
11398 /* Check for the `__extension__' keyword. */
11400 {
11401 /* Parse the qualified declaration. */
11403 /* Restore the PEDANTIC flag. */
11407 }
11409 /* Peek at the next token to figure out which kind of declaration is
11410 present. */
11413 /* If the next keyword is `asm', we have an asm-definition. */
11415 {
11419 }
11420 /* If the next keyword is `namespace', we have a
11421 namespace-alias-definition. */
11424 /* If the next keyword is `using', we have a
11425 using-declaration, a using-directive, or an alias-declaration. */
11427 {
11432 /* If the token after `using' is `namespace', then we have a
11433 using-directive. */
11437 /* If the second token after 'using' is '=', then we have an
11438 alias-declaration. */
11444 /* Otherwise, it's a using-declaration. */
11445 else
11448 }
11449 /* If the next keyword is `__label__' we have a misplaced label
11450 declaration. */
11452 {
11456 /* If the next token is now a `;', consume it. */
11459 }
11460 /* If the next token is `static_assert' we have a static assertion. */
11463 /* Anything else must be a simple-declaration. */
11464 else
11467 }
11469 /* Parse a simple-declaration.
11471 simple-declaration:
11472 decl-specifier-seq [opt] init-declarator-list [opt] ;
11474 init-declarator-list:
11475 init-declarator
11476 init-declarator-list , init-declarator
11478 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11479 function-definition as a simple-declaration.
11481 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11482 parsed declaration if it is an uninitialized single declarator not followed
11483 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11484 if present, will not be consumed. */
11486 static void
11490 {
11491 cp_decl_specifier_seq decl_specifiers;
11500 /* Defer access checks until we know what is being declared; the
11501 checks for names appearing in the decl-specifier-seq should be
11502 done as if we were in the scope of the thing being declared. */
11505 /* Parse the decl-specifier-seq. We have to keep track of whether
11506 or not the decl-specifier-seq declares a named class or
11507 enumeration type, since that is the only case in which the
11508 init-declarator-list is allowed to be empty.
11510 [dcl.dcl]
11512 In a simple-declaration, the optional init-declarator-list can be
11513 omitted only when declaring a class or enumeration, that is when
11514 the decl-specifier-seq contains either a class-specifier, an
11515 elaborated-type-specifier, or an enum-specifier. */
11517 CP_PARSER_FLAGS_OPTIONAL,
11520 /* We no longer need to defer access checks. */
11523 /* In a block scope, a valid declaration must always have a
11524 decl-specifier-seq. By not trying to parse declarators, we can
11525 resolve the declaration/expression ambiguity more quickly. */
11528 {
11531 }
11533 /* If the next two tokens are both identifiers, the code is
11534 erroneous. The usual cause of this situation is code like:
11536 T t;
11538 where "T" should name a type -- but does not. */
11541 {
11542 /* If parsing tentatively, we should commit; we really are
11543 looking at a declaration. */
11545 /* Give up. */
11547 }
11549 /* If we have seen at least one decl-specifier, and the next token
11550 is not a parenthesis, then we must be looking at a declaration.
11551 (After "int (" we might be looking at a functional cast.) */
11558 /* Keep going until we hit the `;' at the end of the simple
11559 declaration. */
11562 CPP_SEMICOLON))
11563 {
11566 tree decl;
11569 {
11570 /* If we are processing next declarator, comma is expected */
11575 {
11579 }
11580 }
11581 else
11584 /* Parse the init-declarator. */
11587 function_definition_allowed_p,
11589 declares_class_or_enum,
11591 maybe_range_for_decl,
11593 /* If an error occurred while parsing tentatively, exit quickly.
11594 (That usually happens when in the body of a function; each
11595 statement is treated as a declaration-statement until proven
11596 otherwise.) */
11599 /* Handle function definitions specially. */
11601 {
11602 /* If the next token is a `,', then we are probably
11603 processing something like:
11605 void f() {}, *p;
11607 which is erroneous. */
11609 {
11612 "mixing"
11614 }
11615 /* Otherwise, we're done with the list of declarators. */
11616 else
11617 {
11620 }
11621 }
11624 /* The next token should be either a `,' or a `;'. */
11626 /* If it's a `,', there are more declarators to come. */
11629 /* If it's a `;', we are done. */
11632 /* Anything else is an error. */
11633 else
11634 {
11635 /* If we have already issued an error message we don't need
11636 to issue another one. */
11640 /* Skip tokens until we reach the end of the statement. */
11642 /* If the next token is now a `;', consume it. */
11646 }
11647 /* After the first time around, a function-definition is not
11648 allowed -- even if it was OK at first. For example:
11650 int i, f() {}
11652 is not valid. */
11654 }
11656 /* Issue an error message if no declarators are present, and the
11657 decl-specifier-seq does not itself declare a class or
11658 enumeration: [dcl.dcl]/3. */
11660 {
11662 {
11666 /* Ensure an error is issued anyway when finish_decltype_type,
11667 called via cp_parser_decl_specifier_seq, returns a class or
11668 an enumeration (c++/51786). */
11671 }
11672 /* Perform any deferred access checks. */
11674 }
11676 /* Consume the `;'. */
11680 {
11686 }
11688 done:
11690 }
11692 /* Parse a decl-specifier-seq.
11694 decl-specifier-seq:
11695 decl-specifier-seq [opt] decl-specifier
11696 decl-specifier attribute-specifier-seq [opt] (C++11)
11698 decl-specifier:
11699 storage-class-specifier
11700 type-specifier
11701 function-specifier
11702 friend
11703 typedef
11705 GNU Extension:
11707 decl-specifier:
11708 attributes
11710 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11712 The parser flags FLAGS is used to control type-specifier parsing.
11714 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11715 flags:
11717 1: one of the decl-specifiers is an elaborated-type-specifier
11718 (i.e., a type declaration)
11719 2: one of the decl-specifiers is an enum-specifier or a
11720 class-specifier (i.e., a type definition)
11722 */
11724 static void
11726 cp_parser_flags flags,
11729 {
11733 cp_decl_spec ds;
11735 /* Clear DECL_SPECS. */
11738 /* Assume no class or enumeration type is declared. */
11741 /* Keep reading specifiers until there are no more to read. */
11743 {
11748 /* Peek at the next token. */
11751 /* Save the first token of the decl spec list for error
11752 reporting. */
11755 /* Handle attributes. */
11757 {
11758 /* Parse the attributes. */
11761 /* In a sequence of declaration specifiers, c++11 attributes
11762 appertain to the type that precede them. In that case
11763 [dcl.spec]/1 says:
11765 The attribute-specifier-seq affects the type only for
11766 the declaration it appears in, not other declarations
11767 involving the same type.
11769 But for now let's force the user to position the
11770 attribute either at the beginning of the declaration or
11771 after the declarator-id, which would clearly mean that it
11772 applies to the declarator. */
11774 {
11776 /* The c++11 attribute is at the beginning of the
11777 declaration. It appertains to the entity being
11779 else
11780 {
11782 {
11783 /* This is an attribute following a
11784 class-specifier. */
11789 }
11790 else
11791 {
11792 decl_specs->std_attributes
11794 attrs);
11797 }
11799 }
11800 }
11802 decl_specs->attributes
11804 attrs);
11808 }
11809 /* Assume we will find a decl-specifier keyword. */
11811 /* If the next token is an appropriate keyword, we can simply
11812 add it to the list. */
11814 {
11815 /* decl-specifier:
11816 friend
11817 constexpr */
11820 {
11823 }
11824 else
11825 {
11827 /* Consume the token. */
11829 }
11837 /* function-specifier:
11838 inline
11839 virtual
11840 explicit */
11847 /* decl-specifier:
11848 typedef */
11851 /* Consume the token. */
11853 /* A constructor declarator cannot appear in a typedef. */
11855 /* The "typedef" keyword can only occur in a declaration; we
11856 may as well commit at this point. */
11863 /* storage-class-specifier:
11864 auto
11865 register
11866 static
11867 extern
11868 mutable
11870 GNU Extension:
11871 thread */
11874 {
11875 /* Consume the token. */
11878 /* Complain about `auto' as a storage specifier, if
11879 we're complaining about C++0x compatibility. */
11883 /* Set the storage class anyway. */
11885 token);
11886 }
11887 else
11888 /* C++0x auto type-specifier. */
11896 /* Consume the token. */
11899 token);
11902 /* Consume the token. */
11908 /* We did not yet find a decl-specifier yet. */
11911 }
11921 /* Constructors are a special case. The `S' in `S()' is not a
11922 decl-specifier; it is the beginning of the declarator. */
11923 constructor_p
11924 = (!found_decl_spec
11925 && constructor_possible_p
11926 && (cp_parser_constructor_declarator_p
11929 /* If we don't have a DECL_SPEC yet, then we must be looking at
11930 a type-specifier. */
11932 {
11935 tree type_spec;
11937 type_spec
11939 decl_specs,
11945 /* If this type-specifier referenced a user-defined type
11946 (a typedef, class-name, etc.), then we can't allow any
11947 more such type-specifiers henceforth.
11949 [dcl.spec]
11951 The longest sequence of decl-specifiers that could
11952 possibly be a type name is taken as the
11953 decl-specifier-seq of a declaration. The sequence shall
11954 be self-consistent as described below.
11956 [dcl.type]
11958 As a general rule, at most one type-specifier is allowed
11959 in the complete decl-specifier-seq of a declaration. The
11960 only exceptions are the following:
11962 -- const or volatile can be combined with any other
11963 type-specifier.
11965 -- signed or unsigned can be combined with char, long,
11966 short, or int.
11968 -- ..
11970 Example:
11972 typedef char* Pc;
11973 void g (const int Pc);
11975 Here, Pc is *not* part of the decl-specifier seq; it's
11976 the declarator. Therefore, once we see a type-specifier
11977 (other than a cv-qualifier), we forbid any additional
11978 user-defined types. We *do* still allow things like `int
11979 int' to be considered a decl-specifier-seq, and issue the
11980 error message later. */
11983 /* A constructor declarator cannot follow a type-specifier. */
11985 {
11990 }
11991 }
11993 /* If we still do not have a DECL_SPEC, then there are no more
11994 decl-specifiers. */
11999 /* After we see one decl-specifier, further decl-specifiers are
12000 always optional. */
12002 }
12004 /* Don't allow a friend specifier with a class definition. */
12009 }
12011 /* Parse an (optional) storage-class-specifier.
12013 storage-class-specifier:
12014 auto
12015 register
12016 static
12017 extern
12018 mutable
12020 GNU Extension:
12022 storage-class-specifier:
12023 thread
12025 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12027 static tree
12029 {
12031 {
12035 /* Fall through for C++98. */
12042 /* Consume the token. */
12047 }
12048 }
12050 /* Parse an (optional) function-specifier.
12052 function-specifier:
12053 inline
12054 virtual
12055 explicit
12057 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12058 Updates DECL_SPECS, if it is non-NULL. */
12060 static tree
12063 {
12066 {
12072 /* 14.5.2.3 [temp.mem]
12074 A member function template shall not be virtual. */
12077 else
12087 }
12089 /* Consume the token. */
12091 }
12093 /* Parse a linkage-specification.
12095 linkage-specification:
12096 extern string-literal { declaration-seq [opt] }
12097 extern string-literal declaration */
12099 static void
12101 {
12102 tree linkage;
12104 /* Look for the `extern' keyword. */
12107 /* Look for the string-literal. */
12110 /* Transform the literal into an identifier. If the literal is a
12111 wide-character string, or contains embedded NULs, then we can't
12112 handle it as the user wants. */
12115 {
12117 /* Assume C++ linkage. */
12119 }
12120 else
12123 /* We're now using the new linkage. */
12126 /* If the next token is a `{', then we're using the first
12127 production. */
12129 {
12132 /* Consume the `{' token. */
12134 /* Parse the declarations. */
12136 /* Look for the closing `}'. */
12138 }
12139 /* Otherwise, there's just one declaration. */
12140 else
12141 {
12144 saved_in_unbraced_linkage_specification_p
12148 parser->in_unbraced_linkage_specification_p
12150 }
12152 /* We're done with the linkage-specification. */
12154 }
12156 /* Parse a static_assert-declaration.
12158 static_assert-declaration:
12159 static_assert ( constant-expression , string-literal ) ;
12161 If MEMBER_P, this static_assert is a class member. */
12163 static void
12165 {
12166 tree condition;
12167 tree message;
12169 location_t saved_loc;
12172 /* Peek at the `static_assert' token so we can keep track of exactly
12173 where the static assertion started. */
12177 /* Look for the `static_assert' keyword. */
12179 RT_STATIC_ASSERT))
12182 /* We know we are in a static assertion; commit to any tentative
12183 parse. */
12187 /* Parse the `(' starting the static assertion condition. */
12190 /* Parse the constant-expression. Allow a non-constant expression
12191 here in order to give better diagnostics in finish_static_assert. */
12192 condition =
12197 /* Parse the separating `,'. */
12200 /* Parse the string-literal message. */
12205 /* A `)' completes the static assertion. */
12212 /* A semicolon terminates the declaration. */
12215 /* Complete the static assertion, which may mean either processing
12216 the static assert now or saving it for template instantiation. */
12218 }
12220 /* Parse the expression in decltype ( expression ). */
12222 static tree
12225 {
12227 tree expr;
12229 /* First, try parsing an id-expression. */
12240 {
12243 cp_id_kind idk;
12247 /* Lookup the name we got back from the id-expression. */
12257 {
12258 /* Complete lookup of the id-expression. */
12259 expr = (finish_id_expression
12272 /* We found an id-expression, but it was something that we
12273 should not have found. This is an error, not something
12274 we can recover from, so note that we found an
12275 id-expression and we'll recover as gracefully as
12276 possible. */
12278 }
12283 /* We have an id-expression. */
12285 }
12288 {
12289 /* Abort the id-expression parse. */
12292 /* Parsing tentatively, again. */
12295 /* Parse a class member access. */
12303 /* We have an id-expression. */
12305 }
12308 /* We have parsed the complete id-expression or member access. */
12310 else
12311 {
12312 /* Abort our attempt to parse an id-expression or member access
12313 expression. */
12316 /* Parse a full expression. */
12319 }
12322 }
12324 /* Parse a `decltype' type. Returns the type.
12326 simple-type-specifier:
12327 decltype ( expression )
12328 C++14 proposal:
12329 decltype ( auto ) */
12331 static tree
12333 {
12334 tree expr;
12343 {
12344 /* Already parsed. */
12347 }
12349 /* Look for the `decltype' token. */
12353 /* Parse the opening `('. */
12357 /* decltype (auto) */
12360 {
12367 }
12369 /* Types cannot be defined in a `decltype' expression. Save away the
12370 old message. */
12373 /* And create the new one. */
12374 parser->type_definition_forbidden_message
12377 /* The restrictions on constant-expressions do not apply inside
12378 decltype expressions. */
12379 saved_integral_constant_expression_p
12381 saved_non_integral_constant_expression_p
12385 /* Within a parenthesized expression, a `>' token is always
12386 the greater-than operator. */
12387 saved_greater_than_is_operator_p
12391 /* Do not actually evaluate the expression. */
12394 /* Do not warn about problems with the expression. */
12399 /* Go back to evaluating expressions. */
12403 /* The `>' token might be the end of a template-id or
12404 template-parameter-list now. */
12405 parser->greater_than_is_operator_p
12408 /* Restore the old message and the integral constant expression
12409 flags. */
12411 parser->integral_constant_expression_p
12413 parser->non_integral_constant_expression_p
12416 /* Parse to the closing `)'. */
12418 {
12422 }
12425 tf_warning_or_error);
12427 rewrite:
12428 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12429 it again. */
12436 }
12438 /* Special member functions [gram.special] */
12440 /* Parse a conversion-function-id.
12442 conversion-function-id:
12443 operator conversion-type-id
12445 Returns an IDENTIFIER_NODE representing the operator. */
12447 static tree
12449 {
12450 tree type;
12451 tree saved_scope;
12452 tree saved_qualifying_scope;
12453 tree saved_object_scope;
12456 /* Look for the `operator' token. */
12459 /* When we parse the conversion-type-id, the current scope will be
12460 reset. However, we need that information in able to look up the
12461 conversion function later, so we save it here. */
12465 /* We must enter the scope of the class so that the names of
12466 entities declared within the class are available in the
12467 conversion-type-id. For example, consider:
12469 struct S {
12470 typedef int I;
12471 operator I();
12472 };
12474 S::operator I() { ... }
12476 In order to see that `I' is a type-name in the definition, we
12477 must be in the scope of `S'. */
12480 /* Parse the conversion-type-id. */
12482 /* Leave the scope of the class, if any. */
12485 /* Restore the saved scope. */
12489 /* If the TYPE is invalid, indicate failure. */
12493 }
12495 /* Parse a conversion-type-id:
12497 conversion-type-id:
12498 type-specifier-seq conversion-declarator [opt]
12500 Returns the TYPE specified. */
12502 static tree
12504 {
12505 tree attributes;
12506 cp_decl_specifier_seq type_specifiers;
12508 tree type_specified;
12511 /* Parse the attributes. */
12515 parser->type_definition_forbidden_message
12518 /* Parse the type-specifiers. */
12525 /* If that didn't work, stop. */
12528 /* Parse the conversion-declarator. */
12536 /* Don't give this error when parsing tentatively. This happens to
12537 work because we always parse this definitively once. */
12540 {
12542 {
12545 }
12549 }
12552 }
12554 /* Parse an (optional) conversion-declarator.
12556 conversion-declarator:
12557 ptr-operator conversion-declarator [opt]
12559 */
12563 {
12566 cp_cv_quals cv_quals;
12568 /* We don't know if there's a ptr-operator next, or not. */
12570 /* Try the ptr-operator. */
12573 /* If it worked, look for more conversion-declarators. */
12575 {
12578 /* Parse another optional declarator. */
12581 declarator = cp_parser_make_indirect_declarator
12585 }
12588 }
12590 /* Parse an (optional) ctor-initializer.
12592 ctor-initializer:
12593 : mem-initializer-list
12595 Returns TRUE iff the ctor-initializer was actually present. */
12597 static bool
12599 {
12600 /* If the next token is not a `:', then there is no
12601 ctor-initializer. */
12603 {
12604 /* Do default initialization of any bases and members. */
12609 }
12611 /* Consume the `:' token. */
12613 /* And the mem-initializer-list. */
12617 }
12619 /* Parse a mem-initializer-list.
12621 mem-initializer-list:
12622 mem-initializer ... [opt]
12623 mem-initializer ... [opt] , mem-initializer-list */
12625 static void
12627 {
12632 /* Let the semantic analysis code know that we are starting the
12633 mem-initializer-list. */
12638 /* Loop through the list. */
12640 {
12641 tree mem_initializer;
12644 /* Parse the mem-initializer. */
12646 /* If the next token is a `...', we're expanding member initializers. */
12648 {
12649 /* Consume the `...'. */
12652 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12653 can be expanded but members cannot. */
12656 {
12661 }
12663 /* Construct the pack expansion type. */
12666 }
12669 {
12673 }
12674 /* Look for a target constructor. */
12678 {
12681 {
12685 }
12687 }
12688 /* Add it to the list, unless it was erroneous. */
12690 {
12693 }
12694 /* If the next token is not a `,', we're done. */
12697 /* Consume the `,' token. */
12699 }
12701 /* Perform semantic analysis. */
12704 }
12706 /* Parse a mem-initializer.
12708 mem-initializer:
12709 mem-initializer-id ( expression-list [opt] )
12710 mem-initializer-id braced-init-list
12712 GNU extension:
12714 mem-initializer:
12715 ( expression-list [opt] )
12717 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12718 class) or FIELD_DECL (for a non-static data member) to initialize;
12719 the TREE_VALUE is the expression-list. An empty initialization
12720 list is represented by void_list_node. */
12722 static tree
12724 {
12725 tree mem_initializer_id;
12726 tree expression_list;
12727 tree member;
12730 /* Find out what is being initialized. */
12732 {
12736 }
12737 else
12738 {
12742 }
12748 {
12755 }
12756 else
12757 {
12767 }
12777 }
12779 /* Parse a mem-initializer-id.
12781 mem-initializer-id:
12782 :: [opt] nested-name-specifier [opt] class-name
12783 identifier
12785 Returns a TYPE indicating the class to be initializer for the first
12786 production. Returns an IDENTIFIER_NODE indicating the data member
12787 to be initialized for the second production. */
12789 static tree
12791 {
12795 tree id;
12799 /* `typename' is not allowed in this context ([temp.res]). */
12801 {
12803 "keyword %<typename%> not allowed in this context (a qualified "
12806 }
12807 /* Look for the optional `::' operator. */
12808 global_scope_p
12812 /* Look for the optional nested-name-specifier. The simplest way to
12813 implement:
12815 [temp.res]
12817 The keyword `typename' is not permitted in a base-specifier or
12818 mem-initializer; in these contexts a qualified name that
12819 depends on a template-parameter is implicitly assumed to be a
12820 type name.
12822 is to assume that we have seen the `typename' keyword at this
12823 point. */
12824 nested_name_specifier_p
12833 /* If there is a `::' operator or a nested-name-specifier, then we
12834 are definitely looking for a class-name. */
12839 typename_type,
12843 /* Otherwise, we could also be looking for an ordinary identifier. */
12845 /* Try a class-name. */
12849 none_type,
12853 /* If we found one, we're done. */
12856 /* Otherwise, look for an ordinary identifier. */
12858 }
12860 /* Overloading [gram.over] */
12862 /* Parse an operator-function-id.
12864 operator-function-id:
12865 operator operator
12867 Returns an IDENTIFIER_NODE for the operator which is a
12868 human-readable spelling of the identifier, e.g., `operator +'. */
12870 static tree
12872 {
12873 /* Look for the `operator' keyword. */
12876 /* And then the name of the operator itself. */
12878 }
12880 /* Return an identifier node for a user-defined literal operator.
12881 The suffix identifier is chained to the operator name identifier. */
12883 static tree
12885 {
12886 tree identifier;
12893 }
12895 /* Parse an operator.
12897 operator:
12898 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12899 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12900 || ++ -- , ->* -> () []
12902 GNU Extensions:
12904 operator:
12905 <? >? <?= >?=
12907 Returns an IDENTIFIER_NODE for the operator which is a
12908 human-readable spelling of the identifier, e.g., `operator +'. */
12910 static tree
12912 {
12917 /* Peek at the next token. */
12919 /* Figure out which operator we have. */
12921 {
12923 {
12926 /* The keyword should be either `new' or `delete'. */
12931 else
12934 /* Consume the `new' or `delete' token. */
12937 /* Peek at the next token. */
12939 /* If it's a `[' token then this is the array variant of the
12940 operator. */
12942 {
12943 /* Consume the `[' token. */
12945 /* Look for the `]' token. */
12949 }
12950 /* Otherwise, we have the non-array variant. */
12951 else
12955 }
13102 /* Consume the `('. */
13104 /* Look for the matching `)'. */
13109 /* Consume the `['. */
13111 /* Look for the matching `]'. */
13126 {
13133 /* Consume the string. */
13139 {
13142 }
13143 else
13144 {
13146 /* Look for the suffix identifier. */
13151 {
13155 }
13156 else
13157 {
13160 }
13161 }
13166 {
13169 }
13172 {
13175 }
13177 {
13180 }
13182 }
13185 /* Anything else is an error. */
13187 }
13189 /* If we have selected an identifier, we need to consume the
13190 operator token. */
13193 /* Otherwise, no valid operator name was present. */
13194 else
13195 {
13198 }
13201 }
13203 /* Parse a template-declaration.
13205 template-declaration:
13206 export [opt] template < template-parameter-list > declaration
13208 If MEMBER_P is TRUE, this template-declaration occurs within a
13209 class-specifier.
13211 The grammar rule given by the standard isn't correct. What
13212 is really meant is:
13214 template-declaration:
13215 export [opt] template-parameter-list-seq
13216 decl-specifier-seq [opt] init-declarator [opt] ;
13217 export [opt] template-parameter-list-seq
13218 function-definition
13220 template-parameter-list-seq:
13221 template-parameter-list-seq [opt]
13222 template < template-parameter-list > */
13224 static void
13226 {
13227 /* Check for `export'. */
13229 {
13230 /* Consume the `export' token. */
13232 /* Warn that we do not support `export'. */
13234 }
13237 }
13239 /* Parse a template-parameter-list.
13241 template-parameter-list:
13242 template-parameter
13243 template-parameter-list , template-parameter
13245 Returns a TREE_LIST. Each node represents a template parameter.
13246 The nodes are connected via their TREE_CHAINs. */
13248 static tree
13250 {
13255 /* The loop below parses the template parms. We first need to know
13256 the total number of template parms to be able to compute proper
13257 canonical types of each dependent type. So after the loop, when
13258 we know the total number of template parms,
13259 end_template_parm_list computes the proper canonical types and
13260 fixes up the dependent types accordingly. */
13262 {
13263 tree parameter;
13266 location_t parm_loc;
13268 /* Parse the template-parameter. */
13273 /* Add it to the list. */
13276 parm_loc,
13277 parameter,
13278 is_non_type,
13279 is_parameter_pack);
13280 else
13281 {
13284 }
13286 /* If the next token is not a `,', we're done. */
13289 /* Otherwise, consume the `,' token. */
13291 }
13294 }
13296 /* Parse a template-parameter.
13298 template-parameter:
13299 type-parameter
13300 parameter-declaration
13302 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13303 the parameter. The TREE_PURPOSE is the default value, if any.
13304 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13305 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13306 set to true iff this parameter is a parameter pack. */
13308 static tree
13311 {
13315 tree parm;
13317 /* Assume it is a type parameter or a template parameter. */
13319 /* Assume it not a parameter pack. */
13321 /* Peek at the next token. */
13323 /* If it is `class' or `template', we have a type-parameter. */
13326 /* If it is `class' or `typename' we do not know yet whether it is a
13327 type parameter or a non-type parameter. Consider:
13329 template <typename T, typename T::X X> ...
13331 or:
13333 template <class C, class D*> ...
13335 Here, the first parameter is a type parameter, and the second is
13336 a non-type parameter. We can tell by looking at the token after
13337 the identifier -- if it is a `,', `=', or `>' then we have a type
13338 parameter. */
13340 {
13341 /* Peek at the token after `class' or `typename'. */
13343 /* If it's an ellipsis, we have a template type parameter
13344 pack. */
13347 /* If it's an identifier, skip it. */
13350 /* Now, see if the token looks like the end of a template
13351 parameter. */
13356 }
13358 /* Otherwise, it is a non-type parameter.
13360 [temp.param]
13362 When parsing a default template-argument for a non-type
13363 template-parameter, the first non-nested `>' is taken as the end
13364 of the template parameter-list rather than a greater-than
13365 operator. */
13367 parameter_declarator
13374 /* If the parameter declaration is marked as a parameter pack, set
13375 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13376 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13377 grokdeclarator. */
13380 {
13383 }
13386 {
13387 /* Can happen in some cases of erroneous input (c++/34892). */
13389 /* Consume the `...' for better error recovery. */
13391 }
13392 /* If the next token is an ellipsis, and we don't already have it
13393 marked as a parameter pack, then we have a parameter pack (that
13394 has no declarator). */
13397 && (declarator_can_be_parameter_pack
13399 {
13400 /* Consume the `...'. */
13405 }
13406 /* We might end up with a pack expansion as the type of the non-type
13407 template parameter, in which case this is a non-type template
13408 parameter pack. */
13411 {
13415 }
13418 {
13419 /* Parameter packs cannot have default arguments. However, a
13420 user may try to do so, so we'll parse them and give an
13421 appropriate diagnostic here. */
13425 /* Find the name of the parameter pack. */
13434 else
13438 /* Parse the default argument, but throw away the result. */
13440 }
13450 }
13452 /* Parse a type-parameter.
13454 type-parameter:
13455 class identifier [opt]
13456 class identifier [opt] = type-id
13457 typename identifier [opt]
13458 typename identifier [opt] = type-id
13459 template < template-parameter-list > class identifier [opt]
13460 template < template-parameter-list > class identifier [opt]
13461 = id-expression
13463 GNU Extension (variadic templates):
13465 type-parameter:
13466 class ... identifier [opt]
13467 typename ... identifier [opt]
13469 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13470 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13471 the declaration of the parameter.
13473 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13475 static tree
13477 {
13479 tree parameter;
13481 /* Look for a keyword to tell us what kind of parameter this is. */
13487 {
13490 {
13491 tree identifier;
13492 tree default_argument;
13494 /* If the next token is an ellipsis, we have a template
13495 argument pack. */
13497 {
13498 /* Consume the `...' token. */
13503 }
13505 /* If the next token is an identifier, then it names the
13506 parameter. */
13509 else
13512 /* Create the parameter. */
13515 /* If the next token is an `=', we have a default argument. */
13517 {
13518 /* Consume the `=' token. */
13520 /* Parse the default-argument. */
13524 /* Template parameter packs cannot have default
13525 arguments. */
13527 {
13530 "template parameter pack %qD cannot have a "
13532 else
13534 "template parameter packs cannot have "
13537 }
13541 }
13542 else
13545 /* Create the combined representation of the parameter and the
13546 default argument. */
13548 }
13552 {
13553 tree identifier;
13554 tree default_argument;
13556 /* Look for the `<'. */
13558 /* Parse the template-parameter-list. */
13560 /* Look for the `>'. */
13562 /* Look for the `class' or 'typename' keywords. */
13564 /* If the next token is an ellipsis, we have a template
13565 argument pack. */
13567 {
13568 /* Consume the `...' token. */
13573 }
13574 /* If the next token is an `=', then there is a
13575 default-argument. If the next token is a `>', we are at
13576 the end of the parameter-list. If the next token is a `,',
13577 then we are at the end of this parameter. */
13581 {
13583 /* Treat invalid names as if the parameter were nameless. */
13586 }
13587 else
13590 /* Create the template parameter. */
13592 identifier);
13594 /* If the next token is an `=', then there is a
13595 default-argument. */
13597 {
13600 /* Consume the `='. */
13602 /* Parse the id-expression. */
13604 /* save token before parsing the id-expression, for error
13605 reporting */
13607 default_argument
13615 /* If the id-expression was a template-id that refers to
13616 a template-class, we already have the declaration here,
13617 so no further lookup is needed. */
13618 ;
13619 else
13620 /* Look up the name. */
13621 default_argument
13623 none_type,
13629 /* See if the default argument is valid. */
13630 default_argument
13633 /* Template parameter packs cannot have default
13634 arguments. */
13636 {
13639 "template parameter pack %qD cannot "
13641 identifier);
13642 else
13646 }
13648 }
13649 else
13652 /* Create the combined representation of the parameter and the
13653 default argument. */
13655 }
13661 }
13664 }
13666 /* Parse a template-id.
13668 template-id:
13669 template-name < template-argument-list [opt] >
13671 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13672 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13673 returned. Otherwise, if the template-name names a function, or set
13674 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13675 names a class, returns a TYPE_DECL for the specialization.
13677 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13678 uninstantiated templates. */
13680 static tree
13686 {
13688 tree templ;
13689 tree arguments;
13690 tree template_id;
13697 /* If the next token corresponds to a template-id, there is no need
13698 to reparse it. */
13701 {
13704 /* Get the stored value. */
13706 /* Perform any access checks that were deferred. */
13709 {
13714 tf_warning_or_error);
13715 }
13716 /* Return the stored value. */
13718 }
13720 /* Avoid performing name lookup if there is no possibility of
13721 finding a template-id. */
13724 && !cp_parser_nth_token_starts_template_argument_list_p
13726 {
13729 }
13731 /* Remember where the template-id starts. */
13737 /* Parse the template-name. */
13740 check_dependency_p,
13741 is_declaration,
13742 tag_type,
13745 {
13748 }
13750 /* If we find the sequence `[:' after a template-name, it's probably
13751 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13752 parse correctly the argument list. */
13759 {
13761 /* Change `:' into `::'. */
13763 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13764 CPP_LESS. */
13767 /* Parse the arguments. */
13770 {
13771 /* If we couldn't parse an argument list, then we revert our changes
13772 and return simply an error. Maybe this is not a template-id
13773 after all. */
13778 }
13779 /* Otherwise, emit an error about the invalid digraph, but continue
13780 parsing because we got our argument list. */
13783 {
13786 "%<<:%> is an alternate spelling for %<[%>."
13789 {
13791 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13794 }
13795 }
13796 }
13797 else
13798 {
13799 /* Look for the `<' that starts the template-argument-list. */
13801 {
13804 }
13805 /* Parse the arguments. */
13807 }
13809 /* Build a representation of the specialization. */
13812 TEMPLATE_ID_EXPR,
13816 {
13818 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13819 template (rather than some instantiation thereof) only if
13820 is not nested within some other construct. For example, in
13821 "template <typename T> void f(T) { A<T>::", A<T> is just an
13822 instantiation of A. */
13825 CPP_SCOPE));
13826 template_id
13828 }
13830 {
13832 }
13833 else
13834 {
13835 /* If it's not a class-template or a template-template, it should be
13836 a function-template. */
13842 }
13844 /* If parsing tentatively, replace the sequence of tokens that makes
13845 up the template-id with a CPP_TEMPLATE_ID token. That way,
13846 should we re-parse the token stream, we will not have to repeat
13847 the effort required to do the parse, nor will we issue duplicate
13848 error messages about problems during instantiation of the
13849 template. */
13851 /* Don't do this if we had a parse error in a declarator; re-parsing
13852 might succeed if a name changes meaning (60361). */
13856 {
13859 /* Reset the contents of the START_OF_ID token. */
13861 /* Retrieve any deferred checks. Do not pop this access checks yet
13862 so the memory will not be reclaimed during token replacing below. */
13868 /* Purge all subsequent tokens. */
13871 /* ??? Can we actually assume that, if template_id ==
13872 error_mark_node, we will have issued a diagnostic to the
13873 user, as opposed to simply marking the tentative parse as
13874 failed? */
13877 }
13881 }
13883 /* Parse a template-name.
13885 template-name:
13886 identifier
13888 The standard should actually say:
13890 template-name:
13891 identifier
13892 operator-function-id
13894 A defect report has been filed about this issue.
13896 A conversion-function-id cannot be a template name because they cannot
13897 be part of a template-id. In fact, looking at this code:
13899 a.operator K<int>()
13901 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13902 It is impossible to call a templated conversion-function-id with an
13903 explicit argument list, since the only allowed template parameter is
13904 the type to which it is converting.
13906 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13907 `template' keyword, in a construction like:
13909 T::template f<3>()
13911 In that case `f' is taken to be a template-name, even though there
13912 is no way of knowing for sure.
13914 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13915 name refers to a set of overloaded functions, at least one of which
13916 is a template, or an IDENTIFIER_NODE with the name of the template,
13917 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13918 names are looked up inside uninstantiated templates. */
13920 static tree
13927 {
13928 tree identifier;
13929 tree decl;
13930 tree fns;
13933 /* If the next token is `operator', then we have either an
13934 operator-function-id or a conversion-function-id. */
13936 {
13937 /* We don't know whether we're looking at an
13938 operator-function-id or a conversion-function-id. */
13940 /* Try an operator-function-id. */
13942 /* If that didn't work, try a conversion-function-id. */
13944 {
13947 }
13948 }
13949 /* Look for the identifier. */
13950 else
13953 /* If we didn't find an identifier, we don't have a template-id. */
13957 /* If the name immediately followed the `template' keyword, then it
13958 is a template-name. However, if the next token is not `<', then
13959 we do not treat it as a template-name, since it is not being used
13960 as part of a template-id. This enables us to handle constructs
13961 like:
13963 template <typename T> struct S { S(); };
13964 template <typename T> S<T>::S();
13966 correctly. We would treat `S' as a template -- if it were `S<T>'
13967 -- but we do not if there is no `<'. */
13971 {
13972 /* In a declaration, in a dependent context, we pretend that the
13973 "template" keyword was present in order to improve error
13974 recovery. For example, given:
13976 template <typename T> void f(T::X<int>);
13978 we want to treat "X<int>" as a template-id. */
13980 && !template_keyword_p
13982 && check_dependency_p
13984 /* Do not do this for dtors (or ctors), since they never
13985 need the template keyword before their name. */
13987 {
13990 /* Explain what went wrong. */
13992 identifier);
13995 /* If parsing tentatively, find the location of the "<" token. */
13998 /* Parse the template arguments so that we can issue error
13999 messages about them. */
14002 /* Skip tokens until we find a good place from which to
14003 continue parsing. */
14008 /* If parsing tentatively, permanently remove the
14009 template argument list. That will prevent duplicate
14010 error messages from being issued about the missing
14011 "template" keyword. */
14017 }
14019 /* If the "template" keyword is present, then there is generally
14020 no point in doing name-lookup, so we just return IDENTIFIER.
14021 But, if the qualifying scope is non-dependent then we can
14022 (and must) do name-lookup normally. */
14028 }
14030 /* Look up the name. */
14032 tag_type,
14035 check_dependency_p,
14039 /* If DECL is a template, then the name was a template-name. */
14041 {
14045 }
14046 else
14047 {
14050 /* The standard does not explicitly indicate whether a name that
14051 names a set of overloaded declarations, some of which are
14052 templates, is a template-name. However, such a name should
14053 be a template-name; otherwise, there is no way to form a
14054 template-id for the overloaded templates. */
14062 {
14063 /* The name does not name a template. */
14066 }
14067 }
14069 /* If DECL is dependent, and refers to a function, then just return
14070 its name; we will look it up again during template instantiation. */
14072 {
14076 }
14079 }
14081 /* Parse a template-argument-list.
14083 template-argument-list:
14084 template-argument ... [opt]
14085 template-argument-list , template-argument ... [opt]
14087 Returns a TREE_VEC containing the arguments. */
14089 static tree
14091 {
14096 tree vec;
14103 /* Even if the template-id appears in an integral
14104 constant-expression, the contents of the argument list do
14105 not. */
14111 /* Parse the arguments. */
14112 do
14113 {
14114 tree argument;
14117 /* Consume the comma. */
14120 /* Parse the template-argument. */
14123 /* If the next token is an ellipsis, we're expanding a template
14124 argument pack. */
14126 {
14128 {
14132 }
14133 /* Consume the `...' token. */
14136 /* Make the argument into a TYPE_PACK_EXPANSION or
14137 EXPR_PACK_EXPANSION. */
14139 }
14142 {
14146 {
14149 }
14150 else
14152 }
14154 }
14167 #ifdef ENABLE_CHECKING
14169 #endif
14171 }
14173 /* Parse a template-argument.
14175 template-argument:
14176 assignment-expression
14177 type-id
14178 id-expression
14180 The representation is that of an assignment-expression, type-id, or
14181 id-expression -- except that the qualified id-expression is
14182 evaluated, so that the value returned is either a DECL or an
14183 OVERLOAD.
14185 Although the standard says "assignment-expression", it forbids
14186 throw-expressions or assignments in the template argument.
14187 Therefore, we use "conditional-expression" instead. */
14189 static tree
14191 {
14192 tree argument;
14198 cp_id_kind idk;
14200 /* There's really no way to know what we're looking at, so we just
14201 try each alternative in order.
14203 [temp.arg]
14205 In a template-argument, an ambiguity between a type-id and an
14206 expression is resolved to a type-id, regardless of the form of
14207 the corresponding template-parameter.
14209 Therefore, we try a type-id first. */
14212 /* If there was no error parsing the type-id but the next token is a
14213 '>>', our behavior depends on which dialect of C++ we're
14214 parsing. In C++98, we probably found a typo for '> >'. But there
14215 are type-id which are also valid expressions. For instance:
14217 struct X { int operator >> (int); };
14218 template <int V> struct Foo {};
14219 Foo<X () >> 5> r;
14221 Here 'X()' is a valid type-id of a function type, but the user just
14222 wanted to write the expression "X() >> 5". Thus, we remember that we
14223 found a valid type-id, but we still try to parse the argument as an
14224 expression to see what happens.
14226 In C++0x, the '>>' will be considered two separate '>'
14227 tokens. */
14231 {
14234 }
14235 else
14236 {
14237 /* If the next token isn't a `,' or a `>', then this argument wasn't
14238 really finished. This means that the argument is not a valid
14239 type-id. */
14242 /* If that worked, we're done. */
14245 }
14246 /* We're still not sure what the argument will be. */
14248 /* Try a template. */
14256 /* If the next token isn't a `,' or a `>', then this argument wasn't
14257 really finished. */
14261 {
14262 /* Figure out what is being referred to. If the id-expression
14263 was for a class template specialization, then we will have a
14264 TYPE_DECL at this point. There is no need to do name lookup
14265 at this point in that case. */
14268 none_type,
14277 }
14279 {
14283 }
14284 /* It must be a non-type argument. There permitted cases are given
14285 in [temp.arg.nontype]:
14287 -- an integral constant-expression of integral or enumeration
14288 type; or
14290 -- the name of a non-type template-parameter; or
14292 -- the name of an object or function with external linkage...
14294 -- the address of an object or function with external linkage...
14296 -- a pointer to member... */
14297 /* Look for a non-type template parameter. */
14299 {
14311 }
14313 /* If the next token is "&", the argument must be the address of an
14314 object or function with external linkage. */
14317 {
14320 }
14321 /* See if we might have an id-expression. */
14328 {
14331 address_p,
14338 else
14339 {
14340 tree probe;
14343 {
14344 /* Strip the dereference temporarily. */
14347 }
14349 /* If we're in a template, we represent a qualified-id referring
14350 to a static data member as a SCOPE_REF even if the scope isn't
14351 dependent so that we can check access control later. */
14356 {
14357 /* A variable without external linkage might still be a
14358 valid constant-expression, so no error is issued here
14359 if the external-linkage check fails. */
14362 }
14364 /* All overloaded functions are allowed; if the external
14365 linkage test does not pass, an error will be issued
14366 later. */
14367 ;
14371 /* A pointer-to-member. */
14372 ;
14374 ;
14375 else
14379 {
14382 tf_warning_or_error);
14383 else
14386 }
14387 }
14388 }
14389 /* If the argument started with "&", there are no other valid
14390 alternatives at this point. */
14392 {
14395 }
14397 /* If the argument wasn't successfully parsed as a type-id followed
14398 by '>>', the argument can only be a constant expression now.
14399 Otherwise, we try parsing the constant-expression tentatively,
14400 because the argument could really be a type-id. */
14411 /* We did our best to parse the argument as a non type-id, but that
14412 was the only alternative that matched (albeit with a '>' after
14413 it). We can assume it's just a typo from the user, and a
14414 diagnostic will then be issued. */
14416 }
14418 /* Parse an explicit-instantiation.
14420 explicit-instantiation:
14421 template declaration
14423 Although the standard says `declaration', what it really means is:
14425 explicit-instantiation:
14426 template decl-specifier-seq [opt] declarator [opt] ;
14428 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14429 supposed to be allowed. A defect report has been filed about this
14430 issue.
14432 GNU Extension:
14434 explicit-instantiation:
14435 storage-class-specifier template
14436 decl-specifier-seq [opt] declarator [opt] ;
14437 function-specifier template
14438 decl-specifier-seq [opt] declarator [opt] ; */
14440 static void
14442 {
14444 cp_decl_specifier_seq decl_specifiers;
14449 /* Look for an (optional) storage-class-specifier or
14450 function-specifier. */
14452 {
14453 extension_specifier
14456 extension_specifier
14459 }
14461 /* Look for the `template' keyword. */
14463 /* Let the front end know that we are processing an explicit
14464 instantiation. */
14466 /* [temp.explicit] says that we are supposed to ignore access
14467 control while processing explicit instantiation directives. */
14469 /* Parse a decl-specifier-seq. */
14471 CP_PARSER_FLAGS_OPTIONAL,
14474 /* If there was exactly one decl-specifier, and it declared a class,
14475 and there's no declarator, then we have an explicit type
14476 instantiation. */
14478 {
14479 tree type;
14483 /* Turn access control back on for names used during
14484 template instantiation. */
14489 }
14490 else
14491 {
14493 tree decl;
14495 /* Parse the declarator. */
14496 declarator
14507 {
14510 "explicit instantiation shall not use"
14514 "explicit instantiation shall not use"
14519 /* Turn access control back on for names used during
14520 template instantiation. */
14522 /* Do the explicit instantiation. */
14524 }
14525 else
14526 {
14528 /* Skip the body of the explicit instantiation. */
14530 }
14531 }
14532 /* We're done with the instantiation. */
14538 }
14540 /* Parse an explicit-specialization.
14542 explicit-specialization:
14543 template < > declaration
14545 Although the standard says `declaration', what it really means is:
14547 explicit-specialization:
14548 template <> decl-specifier [opt] init-declarator [opt] ;
14549 template <> function-definition
14550 template <> explicit-specialization
14551 template <> template-declaration */
14553 static void
14555 {
14559 /* Look for the `template' keyword. */
14561 /* Look for the `<'. */
14563 /* Look for the `>'. */
14565 /* We have processed another parameter list. */
14567 /* [temp]
14569 A template ... explicit specialization ... shall not have C
14570 linkage. */
14572 {
14574 /* Give it C++ linkage to avoid confusing other parts of the
14575 front end. */
14578 }
14579 else
14581 /* Let the front end know that we are beginning a specialization. */
14583 {
14586 }
14588 /* If the next keyword is `template', we need to figure out whether
14589 or not we're looking a template-declaration. */
14591 {
14596 else
14598 }
14599 else
14600 /* Parse the dependent declaration. */
14606 /* We're done with the specialization. */
14608 /* For the erroneous case of a template with C linkage, we pushed an
14609 implicit C++ linkage scope; exit that scope now. */
14612 /* We're done with this parameter list. */
14614 }
14616 /* Parse a type-specifier.
14618 type-specifier:
14619 simple-type-specifier
14620 class-specifier
14621 enum-specifier
14622 elaborated-type-specifier
14623 cv-qualifier
14625 GNU Extension:
14627 type-specifier:
14628 __complex__
14630 Returns a representation of the type-specifier. For a
14631 class-specifier, enum-specifier, or elaborated-type-specifier, a
14632 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14634 The parser flags FLAGS is used to control type-specifier parsing.
14636 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14637 in a decl-specifier-seq.
14639 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14640 class-specifier, enum-specifier, or elaborated-type-specifier, then
14641 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14642 if a type is declared; 2 if it is defined. Otherwise, it is set to
14643 zero.
14645 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14646 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14647 is set to FALSE. */
14649 static tree
14651 cp_parser_flags flags,
14656 {
14662 /* Assume this type-specifier does not declare a new type. */
14665 /* And that it does not specify a cv-qualifier. */
14668 /* Peek at the next token. */
14671 /* If we're looking at a keyword, we can use that to guide the
14672 production we choose. */
14675 {
14680 /* Look for the enum-specifier. */
14682 /* If that worked, we're done. */
14684 {
14689 type_spec,
14690 token,
14693 }
14694 else
14697 /* Any of these indicate either a class-specifier, or an
14698 elaborated-type-specifier. */
14705 /* Parse tentatively so that we can back up if we don't find a
14706 class-specifier. */
14708 /* Look for the class-specifier. */
14711 /* If that worked, we're done. */
14713 {
14718 type_spec,
14719 token,
14722 }
14724 /* Fall through. */
14725 elaborated_type_specifier:
14726 /* We're declaring (not defining) a class or enum. */
14730 /* Fall through. */
14732 /* Look for an elaborated-type-specifier. */
14733 type_spec
14734 = (cp_parser_elaborated_type_specifier
14737 is_declaration));
14740 type_spec,
14741 token,
14764 /* The `__complex__' keyword is a GNU extension. */
14770 }
14772 /* Handle simple keywords. */
14774 {
14776 {
14779 }
14781 }
14783 /* If we do not already have a type-specifier, assume we are looking
14784 at a simple-type-specifier. */
14786 decl_specs,
14787 flags);
14789 /* If we didn't find a type-specifier, and a type-specifier was not
14790 optional in this context, issue an error message. */
14792 {
14795 }
14798 }
14800 /* Parse a simple-type-specifier.
14802 simple-type-specifier:
14803 :: [opt] nested-name-specifier [opt] type-name
14804 :: [opt] nested-name-specifier template template-id
14805 char
14806 wchar_t
14807 bool
14808 short
14809 int
14810 long
14811 signed
14812 unsigned
14813 float
14814 double
14815 void
14817 C++0x Extension:
14819 simple-type-specifier:
14820 auto
14821 decltype ( expression )
14822 char16_t
14823 char32_t
14824 __underlying_type ( type-id )
14826 GNU Extension:
14828 simple-type-specifier:
14829 __int128
14830 __typeof__ unary-expression
14831 __typeof__ ( type-id )
14832 __typeof__ ( type-id ) { initializer-list , [opt] }
14834 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14835 appropriately updated. */
14837 static tree
14840 cp_parser_flags flags)
14841 {
14846 /* Peek at the next token. */
14849 /* If we're looking at a keyword, things are easy. */
14851 {
14886 {
14889 }
14918 {
14921 else
14925 {
14928 "use of %<auto%> in lambda parameter declaration "
14929 "only available with "
14931 }
14934 "use of %<auto%> in parameter declaration "
14935 "only available with "
14937 else
14939 "ISO C++ forbids use of %<auto%> in parameter "
14941 }
14942 else
14947 /* Since DR 743, decltype can either be a simple-type-specifier by
14948 itself or begin a nested-name-specifier. Parsing it will replace
14949 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14950 handling below decide what to do. */
14956 /* Consume the `typeof' token. */
14958 /* Parse the operand to `typeof'. */
14960 /* If it is not already a TYPE, take its type. */
14966 token,
14975 token,
14985 token,
14990 }
14992 /* If token is an already-parsed decltype not followed by ::,
14993 it's a simple-type-specifier. */
14996 {
14999 {
15001 token,
15003 /* Remember that we are handling a decltype in order to
15004 implement the resolution of DR 1510 when the argument
15005 isn't instantiation dependent. */
15007 }
15010 }
15012 /* If the type-specifier was for a built-in type, we're done. */
15014 {
15015 /* Record the type. */
15022 type,
15023 token,
15028 /* Consume the token. */
15034 /* There is no valid C++ program where a non-template type is
15035 followed by a "<". That usually indicates that the user thought
15036 that the type was a template. */
15041 }
15043 /* The type-specifier must be a user-defined type. */
15045 {
15049 /* Don't gobble tokens or issue error messages if this is an
15050 optional type-specifier. */
15054 /* Look for the optional `::' operator. */
15055 global_p
15059 /* Look for the nested-name specifier. */
15060 qualified_p
15068 /* If we have seen a nested-name-specifier, and the next token
15069 is `template', then we are using the template-id production. */
15072 {
15073 /* Look for the template-id. */
15077 none_type,
15079 /* If the template-id did not name a type, we are out of
15080 luck. */
15082 {
15085 }
15086 }
15087 /* Otherwise, look for a type-name. */
15088 else
15090 /* Keep track of all name-lookups performed in class scopes. */
15092 && !global_p
15093 && !qualified_p
15097 /* If it didn't work out, we don't have a TYPE. */
15103 token,
15105 }
15107 /* If we didn't get a type-name, issue an error message. */
15109 {
15112 }
15115 {
15116 /* See if TYPE is an Objective-C type, and if so, parse and
15117 accept any protocol references following it. Do this before
15118 the cp_parser_check_for_invalid_template_id() call, because
15119 Objective-C types can be followed by '<...>' which would
15120 enclose protocol names rather than template arguments, and so
15121 everything is fine. */
15124 {
15128 /* Clobber the "unqualified" type previously entered into
15129 DECL_SPECS with the new, improved protocol-qualified version. */
15134 }
15136 /* There is no valid C++ program where a non-template type is
15137 followed by a "<". That usually indicates that the user
15138 thought that the type was a template. */
15140 none_type,
15142 }
15145 }
15147 /* Parse a type-name.
15149 type-name:
15150 class-name
15151 enum-name
15152 typedef-name
15153 simple-template-id [in c++0x]
15155 enum-name:
15156 identifier
15158 typedef-name:
15159 identifier
15161 Returns a TYPE_DECL for the type. */
15163 static tree
15165 {
15166 tree type_decl;
15168 /* We can't know yet whether it is a class-name or not. */
15170 /* Try a class-name. */
15174 none_type,
15178 /* If it's not a class-name, keep looking. */
15180 {
15182 /* It must be a typedef-name or an enum-name. */
15186 /* It is either a simple-template-id representing an
15187 instantiation of an alias template... */
15191 none_type,
15193 /* Note that this must be an instantiation of an alias template
15194 because [temp.names]/6 says:
15196 A template-id that names an alias template specialization
15197 is a type-name.
15199 Whereas [temp.names]/7 says:
15201 A simple-template-id that names a class template
15202 specialization is a class-name. */
15207 else
15211 /* ... Or a typedef-name or an enum-name. */
15213 }
15216 }
15218 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15220 enum-name:
15221 identifier
15223 typedef-name:
15224 identifier
15226 Returns a TYPE_DECL for the type. */
15228 static tree
15230 {
15231 tree type_decl;
15232 tree identifier;
15239 /* Look up the type-name. */
15246 {
15247 /* See if this is an Objective-C type. */
15252 }
15254 /* Issue an error if we did not find a type-name. */
15256 /* In Objective-C, we have the complication that class names are
15257 normally type names and start declarations (eg, the
15258 "NSObject" in "NSObject *object;"), but can be used in an
15259 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15260 is an expression. So, a classname followed by a dot is not a
15261 valid type-name. */
15264 {
15269 }
15270 /* Remember that the name was used in the definition of the
15271 current class so that we can check later to see if the
15272 meaning would have been different after the class was
15273 entirely defined. */
15279 }
15281 /* Parse an elaborated-type-specifier. Note that the grammar given
15282 here incorporates the resolution to DR68.
15284 elaborated-type-specifier:
15285 class-key :: [opt] nested-name-specifier [opt] identifier
15286 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15287 enum-key :: [opt] nested-name-specifier [opt] identifier
15288 typename :: [opt] nested-name-specifier identifier
15289 typename :: [opt] nested-name-specifier template [opt]
15290 template-id
15292 GNU extension:
15294 elaborated-type-specifier:
15295 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15296 class-key attributes :: [opt] nested-name-specifier [opt]
15297 template [opt] template-id
15298 enum attributes :: [opt] nested-name-specifier [opt] identifier
15300 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15301 declared `friend'. If IS_DECLARATION is TRUE, then this
15302 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15303 something is being declared.
15305 Returns the TYPE specified. */
15307 static tree
15311 {
15313 tree identifier;
15316 tree globalscope;
15319 /* See if we're looking at the `enum' keyword. */
15321 {
15322 /* Consume the `enum' token. */
15324 /* Remember that it's an enumeration type. */
15326 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15327 enums) is used here. */
15330 {
15334 /* Consume the `struct' or `class' and parse it anyway. */
15336 }
15337 /* Parse the attributes. */
15339 }
15340 /* Or, it might be `typename'. */
15342 RID_TYPENAME))
15343 {
15344 /* Consume the `typename' token. */
15346 /* Remember that it's a `typename' type. */
15348 }
15349 /* Otherwise it must be a class-key. */
15350 else
15351 {
15355 /* Parse the attributes. */
15357 }
15359 /* Look for the `::' operator. */
15362 /* Look for the nested-name-specifier. */
15364 {
15369 is_declaration))
15371 }
15372 else
15373 /* Even though `typename' is not present, the proposed resolution
15374 to Core Issue 180 says that in `class A<T>::B', `B' should be
15375 considered a type-name, even if `A<T>' is dependent. */
15380 is_declaration);
15381 /* For everything but enumeration types, consider a template-id.
15382 For an enumeration type, consider only a plain identifier. */
15384 {
15386 tree decl;
15388 /* Allow the `template' keyword. */
15390 /* If we didn't see `template', we don't know if there's a
15391 template-id or not. */
15394 /* Parse the template-id. */
15398 tag_type,
15399 is_declaration);
15400 /* If we didn't find a template-id, look for an ordinary
15401 identifier. */
15403 ;
15404 /* We can get here when cp_parser_template_id, called by
15405 cp_parser_class_name with tag_type == none_type, succeeds
15406 and caches a BASELINK. Then, when called again here,
15407 instead of failing and returning an error_mark_node
15408 returns it (see template/typename17.C in C++11).
15409 ??? Could we diagnose this earlier? */
15411 {
15414 }
15415 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15416 in effect, then we must assume that, upon instantiation, the
15417 template will correspond to a class. */
15421 typename_type,
15423 /* If the `typename' keyword is in effect and DECL is not a type
15424 decl, then type is non existent. */
15426 ;
15432 }
15435 {
15440 {
15443 }
15445 /* For a `typename', we needn't call xref_tag. */
15451 /* Template parameter lists apply only if we are not within a
15452 function parameter list. */
15453 bool template_parm_lists_apply
15462 /* Look up a qualified name in the usual way. */
15464 {
15465 tree decl;
15466 tree ambiguous_decls;
15469 tag_type,
15476 /* If the lookup was ambiguous, an error will already have been
15477 issued. */
15481 /* If we are parsing friend declaration, DECL may be a
15482 TEMPLATE_DECL tree node here. However, we need to check
15483 whether this TEMPLATE_DECL results in valid code. Consider
15484 the following example:
15486 namespace N {
15487 template <class T> class C {};
15488 }
15489 class X {
15490 template <class T> friend class N::C; // #1, valid code
15491 };
15492 template <class T> class Y {
15493 friend class N::C; // #2, invalid code
15494 };
15496 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15497 name lookup of `N::C'. We see that friend declaration must
15498 be template for the code to be valid. Note that
15499 processing_template_decl does not work here since it is
15500 always 1 for the above two cases. */
15502 decl = (cp_parser_maybe_treat_template_as_class
15507 {
15509 identifier,
15512 }
15515 {
15519 allow_template);
15523 }
15525 /* Forward declarations of nested types, such as
15527 class C1::C2;
15528 class C1::C2::C3;
15530 are invalid unless all components preceding the final '::'
15531 are complete. If all enclosing types are complete, these
15532 declarations become merely pointless.
15534 Invalid forward declarations of nested types are errors
15535 caught elsewhere in parsing. Those that are pointless arrive
15536 here. */
15543 }
15544 else
15545 {
15546 /* An elaborated-type-specifier sometimes introduces a new type and
15547 sometimes names an existing type. Normally, the rule is that it
15548 introduces a new type only if there is not an existing type of
15549 the same name already in scope. For example, given:
15551 struct S {};
15552 void f() { struct S s; }
15554 the `struct S' in the body of `f' is the same `struct S' as in
15555 the global scope; the existing definition is used. However, if
15556 there were no global declaration, this would introduce a new
15557 local class named `S'.
15559 An exception to this rule applies to the following code:
15561 namespace N { struct S; }
15563 Here, the elaborated-type-specifier names a new type
15564 unconditionally; even if there is already an `S' in the
15565 containing scope this declaration names a new type.
15566 This exception only applies if the elaborated-type-specifier
15567 forms the complete declaration:
15569 [class.name]
15571 A declaration consisting solely of `class-key identifier ;' is
15572 either a redeclaration of the name in the current scope or a
15573 forward declaration of the identifier as a class name. It
15574 introduces the name into the current scope.
15576 We are in this situation precisely when the next token is a `;'.
15578 An exception to the exception is that a `friend' declaration does
15579 *not* name a new type; i.e., given:
15581 struct S { friend struct T; };
15583 `T' is not a new type in the scope of `S'.
15585 Also, `new struct S' or `sizeof (struct S)' never results in the
15586 definition of a new type; a new type can only be declared in a
15587 declaration context. */
15589 tag_scope ts;
15593 /* Friends have special name lookup rules. */
15597 CPP_SEMICOLON))
15598 /* This is a `class-key identifier ;' */
15600 else
15603 template_p =
15604 (template_parm_lists_apply
15607 /* An unqualified name was used to reference this type, so
15608 there were no qualifying templates. */
15616 }
15617 }
15622 /* Allow attributes on forward declarations of classes. */
15624 {
15634 else
15637 }
15640 {
15641 /* Indicate whether this class was declared as a `class' or as a
15642 `struct'. */
15646 }
15648 /* A "<" cannot follow an elaborated type specifier. If that
15649 happens, the user was probably trying to form a template-id. */
15654 }
15656 /* Parse an enum-specifier.
15658 enum-specifier:
15659 enum-head { enumerator-list [opt] }
15660 enum-head { enumerator-list , } [C++0x]
15662 enum-head:
15663 enum-key identifier [opt] enum-base [opt]
15664 enum-key nested-name-specifier identifier enum-base [opt]
15666 enum-key:
15667 enum
15668 enum class [C++0x]
15669 enum struct [C++0x]
15671 enum-base: [C++0x]
15672 : type-specifier-seq
15674 opaque-enum-specifier:
15675 enum-key identifier enum-base [opt] ;
15677 GNU Extensions:
15678 enum-key attributes[opt] identifier [opt] enum-base [opt]
15679 { enumerator-list [opt] }attributes[opt]
15680 enum-key attributes[opt] identifier [opt] enum-base [opt]
15681 { enumerator-list, }attributes[opt] [C++0x]
15683 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15684 if the token stream isn't an enum-specifier after all. */
15686 static tree
15688 {
15689 tree identifier;
15691 tree prev_scope;
15693 tree attributes;
15706 /* Parse tentatively so that we can back up if we don't find a
15707 enum-specifier. */
15710 /* Caller guarantees that the current token is 'enum', an identifier
15711 possibly follows, and the token after that is an opening brace.
15712 If we don't have an identifier, fabricate an anonymous name for
15713 the enumeration being defined. */
15716 /* Parse the "class" or "struct", which indicates a scoped
15717 enumeration type in C++0x. */
15720 {
15724 /* Consume the `struct' or `class' token. */
15728 }
15732 /* Clear the qualification. */
15737 /* Figure out in what scope the declaration is being placed. */
15743 nested_name_specifier
15751 {
15752 tree name;
15756 enum_type,
15761 input_location);
15763 {
15766 {
15767 /* Are template enums allowed in ISO? */
15771 /* ignore a typename reference, for it will be solved by name
15772 in start_enum. */
15774 }
15775 }
15778 else
15781 }
15782 else
15783 {
15786 else
15787 {
15793 }
15794 }
15797 /* Check for the `:' that denotes a specified underlying type in C++0x.
15798 Note that a ':' could also indicate a bitfield width, however. */
15800 {
15801 cp_decl_specifier_seq type_specifiers;
15803 /* Consume the `:'. */
15806 /* Parse the type-specifier-seq. */
15811 /* At this point this is surely not elaborated type specifier. */
15820 /* If that didn't work, stop. */
15822 {
15828 }
15829 }
15831 /* Look for the `{' but don't consume it yet. */
15833 {
15835 {
15838 {
15841 }
15842 }
15843 /* An opaque-enum-specifier must have a ';' here. */
15846 {
15849 {
15852 }
15853 }
15854 }
15860 {
15862 {
15866 }
15868 {
15870 }
15871 }
15873 /* Issue an error message if type-definitions are forbidden here. */
15876 else
15877 /* Create the new type. We do this before consuming the opening
15878 brace so the enum will be recorded as being on the line of its
15879 tag (or the 'enum' keyword, if there is no tag). */
15883 /* If the next token is not '{' it is an opaque-enum-specifier or an
15884 elaborated-type-specifier. */
15886 {
15890 {
15891 /* The following catches invalid code such as:
15892 enum class S<int>::E { A, B, C }; */
15900 {
15904 nested_name_specifier);
15906 }
15907 /* If that scope does not contain the scope in which the
15908 class was originally declared, the program is invalid. */
15910 nested_name_specifier))
15911 {
15914 "declaration of %qD in namespace %qD which does not "
15917 else
15919 "declaration of %qD in %qD which does not "
15923 }
15924 }
15929 /* Consume the opening brace. */
15936 {
15940 }
15941 else
15942 {
15948 }
15952 /* If the next token is not '}', then there are some enumerators. */
15954 {
15958 }
15959 else
15962 /* Consume the final '}'. */
15968 }
15969 else
15970 {
15971 /* If a ';' follows, then it is an opaque-enum-specifier
15972 and additional restrictions apply. */
15974 {
15981 }
15982 }
15984 /* Look for trailing attributes to apply to this enumeration, and
15985 apply them if appropriate. */
15987 {
15991 trailing_attr,
15993 }
15995 /* Finish up the enumeration. */
15997 {
16002 }
16005 {
16007 {
16010 }
16012 {
16014 }
16015 }
16016 out:
16019 }
16021 /* Parse an enumerator-list. The enumerators all have the indicated
16022 TYPE.
16024 enumerator-list:
16025 enumerator-definition
16026 enumerator-list , enumerator-definition */
16028 static void
16030 {
16032 {
16033 /* Parse an enumerator-definition. */
16036 /* If the next token is not a ',', we've reached the end of
16037 the list. */
16040 /* Otherwise, consume the `,' and keep going. */
16042 /* If the next token is a `}', there is a trailing comma. */
16044 {
16049 }
16050 }
16051 }
16053 /* Parse an enumerator-definition. The enumerator has the indicated
16054 TYPE.
16056 enumerator-definition:
16057 enumerator
16058 enumerator = constant-expression
16060 enumerator:
16061 identifier */
16063 static void
16065 {
16066 tree identifier;
16067 tree value;
16068 location_t loc;
16070 /* Save the input location because we are interested in the location
16071 of the identifier and not the location of the explicit value. */
16074 /* Look for the identifier. */
16079 /* If the next token is an '=', then there is an explicit value. */
16081 {
16082 /* Consume the `=' token. */
16084 /* Parse the value. */
16086 }
16087 else
16090 /* If we are processing a template, make sure the initializer of the
16091 enumerator doesn't contain any bare template parameter pack. */
16095 /* Create the enumerator. */
16097 }
16099 /* Parse a namespace-name.
16101 namespace-name:
16102 original-namespace-name
16103 namespace-alias
16105 Returns the NAMESPACE_DECL for the namespace. */
16107 static tree
16109 {
16110 tree identifier;
16111 tree namespace_decl;
16115 /* Get the name of the namespace. */
16120 /* Look up the identifier in the currently active scope. Look only
16121 for namespaces, due to:
16123 [basic.lookup.udir]
16125 When looking up a namespace-name in a using-directive or alias
16126 definition, only namespace names are considered.
16128 And:
16130 [basic.lookup.qual]
16132 During the lookup of a name preceding the :: scope resolution
16133 operator, object, function, and enumerator names are ignored.
16135 (Note that cp_parser_qualifying_entity only calls this
16136 function if the token after the name is the scope resolution
16137 operator.) */
16139 none_type,
16145 /* If it's not a namespace, issue an error. */
16148 {
16153 }
16156 }
16158 /* Parse a namespace-definition.
16160 namespace-definition:
16161 named-namespace-definition
16162 unnamed-namespace-definition
16164 named-namespace-definition:
16165 original-namespace-definition
16166 extension-namespace-definition
16168 original-namespace-definition:
16169 namespace identifier { namespace-body }
16171 extension-namespace-definition:
16172 namespace original-namespace-name { namespace-body }
16174 unnamed-namespace-definition:
16175 namespace { namespace-body } */
16177 static void
16179 {
16186 {
16190 }
16191 else
16194 /* Look for the `namespace' keyword. */
16197 /* Get the name of the namespace. We do not attempt to distinguish
16198 between an original-namespace-definition and an
16199 extension-namespace-definition at this point. The semantic
16200 analysis routines are responsible for that. */
16203 else
16206 /* Parse any specified attributes. */
16209 /* Look for the `{' to start the namespace. */
16211 /* Start the namespace. */
16214 /* "inline namespace" is equivalent to a stub namespace definition
16215 followed by a strong using directive. */
16217 {
16219 /* Set up namespace association. */
16223 /* Import the contents of the inline namespace. */
16227 }
16231 /* Parse the body of the namespace. */
16237 /* Finish the namespace. */
16239 /* Look for the final `}'. */
16241 }
16243 /* Parse a namespace-body.
16245 namespace-body:
16246 declaration-seq [opt] */
16248 static void
16250 {
16252 }
16254 /* Parse a namespace-alias-definition.
16256 namespace-alias-definition:
16257 namespace identifier = qualified-namespace-specifier ; */
16259 static void
16261 {
16262 tree identifier;
16263 tree namespace_specifier;
16267 /* Look for the `namespace' keyword. */
16269 /* Look for the identifier. */
16273 /* Look for the `=' token. */
16276 {
16278 /* Skip the definition. */
16283 }
16285 /* Look for the qualified-namespace-specifier. */
16286 namespace_specifier
16288 /* Look for the `;' token. */
16291 /* Register the alias in the symbol table. */
16293 }
16295 /* Parse a qualified-namespace-specifier.
16297 qualified-namespace-specifier:
16298 :: [opt] nested-name-specifier [opt] namespace-name
16300 Returns a NAMESPACE_DECL corresponding to the specified
16301 namespace. */
16303 static tree
16305 {
16306 /* Look for the optional `::'. */
16310 /* Look for the optional nested-name-specifier. */
16318 }
16320 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16321 access declaration.
16323 using-declaration:
16324 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16325 using :: unqualified-id ;
16327 access-declaration:
16328 qualified-id ;
16330 */
16332 static bool
16335 {
16339 tree decl;
16340 tree identifier;
16341 tree qscope;
16346 {
16349 }
16350 else
16351 {
16352 /* Look for the `using' keyword. */
16355 /* Peek at the next token. */
16357 /* See if it's `typename'. */
16359 {
16360 /* Remember that we've seen it. */
16362 /* Consume the `typename' token. */
16364 }
16365 }
16367 /* Look for the optional global scope qualification. */
16368 global_scope_p
16373 /* If we saw `typename', or didn't see `::', then there must be a
16374 nested-name-specifier present. */
16376 {
16382 {
16385 }
16386 }
16387 /* Otherwise, we could be in either of the two productions. In that
16388 case, treat the nested-name-specifier as optional. */
16389 else
16401 /* Something has already gone wrong; there's no need to parse
16402 further. Since an error has occurred, the return value of
16403 cp_parser_parse_definitely will be false, as required. */
16407 /* Parse the unqualified-id. */
16415 {
16420 }
16422 /* The function we call to handle a using-declaration is different
16423 depending on what scope we are in. */
16425 ;
16428 /* [namespace.udecl]
16430 A using declaration shall not name a template-id. */
16433 else
16434 {
16436 {
16437 /* Create the USING_DECL. */
16444 {
16447 }
16448 else
16449 /* Add it to the list of members in this class. */
16451 }
16452 else
16453 {
16455 identifier,
16462 {
16465 }
16468 else
16470 }
16471 }
16473 /* Look for the final `;'. */
16478 "access declarations are deprecated "
16479 "in favour of using-declarations; "
16483 }
16485 /* Parse an alias-declaration.
16487 alias-declaration:
16488 using identifier attribute-specifier-seq [opt] = type-id */
16490 static tree
16492 {
16494 location_t id_location;
16496 cp_decl_specifier_seq decl_specs;
16500 /* Look for the `using' keyword. */
16501 cp_token *using_token
16523 /* Now we are going to parse the type-id of the declaration. */
16525 /*
16526 [dcl.type]/3 says:
16528 "A type-specifier-seq shall not define a class or enumeration
16529 unless it appears in the type-id of an alias-declaration (7.1.3) that
16530 is not the declaration of a template-declaration."
16532 In other words, if we currently are in an alias template, the
16533 type-id should not define a type.
16535 So let's set parser->type_definition_forbidden_message in that
16536 case; cp_parser_check_type_definition (called by
16537 cp_parser_class_specifier) will then emit an error if a type is
16538 defined in the type-id. */
16540 {
16544 }
16548 /* Restore the error message if need be. */
16554 {
16557 }
16559 /* A typedef-name can also be introduced by an alias-declaration. The
16560 identifier following the using keyword becomes a typedef-name. It has
16561 the same semantics as if it were introduced by the typedef
16562 specifier. In particular, it does not define a new type and it shall
16563 not appear in the type-id. */
16568 {
16571 ds_attribute,
16572 attrs_token);
16573 }
16575 ds_typedef,
16576 using_token);
16578 ds_alias,
16579 using_token);
16588 else
16599 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16600 added into the symbol table; otherwise, return the TYPE_DECL. */
16604 {
16608 }
16611 }
16613 /* Parse a using-directive.
16615 using-directive:
16616 using namespace :: [opt] nested-name-specifier [opt]
16617 namespace-name ; */
16619 static void
16621 {
16622 tree namespace_decl;
16623 tree attribs;
16625 /* Look for the `using' keyword. */
16627 /* And the `namespace' keyword. */
16629 /* Look for the optional `::' operator. */
16631 /* And the optional nested-name-specifier. */
16637 /* Get the namespace being used. */
16639 /* And any specified attributes. */
16641 /* Update the symbol table. */
16643 /* Look for the final `;'. */
16645 }
16647 /* Parse an asm-definition.
16649 asm-definition:
16650 asm ( string-literal ) ;
16652 GNU Extension:
16654 asm-definition:
16655 asm volatile [opt] ( string-literal ) ;
16656 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16657 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16658 : asm-operand-list [opt] ) ;
16659 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16660 : asm-operand-list [opt]
16661 : asm-clobber-list [opt] ) ;
16662 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16663 : asm-clobber-list [opt]
16664 : asm-goto-list ) ; */
16666 static void
16668 {
16669 tree string;
16674 tree asm_stmt;
16682 /* Look for the `asm' keyword. */
16687 {
16690 }
16692 /* See if the next token is `volatile'. */
16695 {
16696 /* Remember that we saw the `volatile' keyword. */
16698 /* Consume the token. */
16700 }
16704 {
16705 /* Remember that we saw the `goto' keyword. */
16707 /* Consume the token. */
16709 }
16710 /* Look for the opening `('. */
16713 /* Look for the string. */
16716 {
16720 }
16722 /* If we're allowing GNU extensions, check for the extended assembly
16723 syntax. Unfortunately, the `:' tokens need not be separated by
16724 a space in C, and so, for compatibility, we tolerate that here
16725 too. Doing that means that we have to treat the `::' operator as
16726 two `:' tokens. */
16731 {
16736 /* The extended syntax was used. */
16739 /* Look for outputs. */
16741 {
16742 /* Consume the `:'. */
16744 /* Parse the output-operands. */
16746 CPP_COLON)
16748 CPP_SCOPE)
16750 CPP_CLOSE_PAREN)
16756 }
16757 /* If the next token is `::', there are no outputs, and the
16758 next token is the beginning of the inputs. */
16760 /* The inputs are coming next. */
16763 /* Look for inputs. */
16766 {
16767 /* Consume the `:' or `::'. */
16769 /* Parse the output-operands. */
16771 CPP_COLON)
16773 CPP_SCOPE)
16775 CPP_CLOSE_PAREN))
16780 }
16782 /* The clobbers are coming next. */
16785 /* Look for clobbers. */
16788 {
16790 /* Consume the `:' or `::'. */
16792 /* Parse the clobbers. */
16794 CPP_COLON)
16796 CPP_CLOSE_PAREN))
16798 }
16801 /* The labels are coming next. */
16804 /* Look for labels. */
16807 {
16809 /* Consume the `:' or `::'. */
16811 /* Parse the labels. */
16813 }
16817 }
16821 /* Look for the closing `)'. */
16829 {
16830 /* Create the ASM_EXPR. */
16832 {
16835 /* If the extended syntax was not used, mark the ASM_EXPR. */
16837 {
16843 }
16844 }
16845 else
16847 }
16848 }
16850 /* Declarators [gram.dcl.decl] */
16852 /* Parse an init-declarator.
16854 init-declarator:
16855 declarator initializer [opt]
16857 GNU Extension:
16859 init-declarator:
16860 declarator asm-specification [opt] attributes [opt] initializer [opt]
16862 function-definition:
16863 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16864 function-body
16865 decl-specifier-seq [opt] declarator function-try-block
16867 GNU Extension:
16869 function-definition:
16870 __extension__ function-definition
16872 TM Extension:
16874 function-definition:
16875 decl-specifier-seq [opt] declarator function-transaction-block
16877 The DECL_SPECIFIERS apply to this declarator. Returns a
16878 representation of the entity declared. If MEMBER_P is TRUE, then
16879 this declarator appears in a class scope. The new DECL created by
16880 this declarator is returned.
16882 The CHECKS are access checks that should be performed once we know
16883 what entity is being declared (and, therefore, what classes have
16884 befriended it).
16886 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16887 for a function-definition here as well. If the declarator is a
16888 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16889 be TRUE upon return. By that point, the function-definition will
16890 have been completely parsed.
16892 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16893 is FALSE.
16895 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16896 parsed declaration if it is an uninitialized single declarator not followed
16897 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16898 if present, will not be consumed. If returned, this declarator will be
16899 created with SD_INITIALIZED but will not call cp_finish_decl.
16901 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16902 and there is an initializer, the pointed location_t is set to the
16903 location of the '=' or `(', or '{' in C++11 token introducing the
16904 initializer. */
16906 static tree
16916 {
16920 tree prefix_attributes;
16922 tree asm_specification;
16923 tree initializer;
16925 tree scope;
16927 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16928 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16929 "(...)". */
16940 /* Gather the attributes that were provided with the
16941 decl-specifiers. */
16944 /* Assume that this is not the declarator for a function
16945 definition. */
16949 /* Default arguments are only permitted for function parameters. */
16953 /* Defer access checks while parsing the declarator; we cannot know
16954 what names are accessible until we know what is being
16955 declared. */
16958 /* Parse the declarator. */
16960 declarator
16965 /* Gather up the deferred checks. */
16970 /* If the DECLARATOR was erroneous, there's no need to go
16971 further. */
16975 /* Check that the number of template-parameter-lists is OK. */
16985 /* Figure out what scope the entity declared by the DECLARATOR is
16986 located in. `grokdeclarator' sometimes changes the scope, so
16987 we compute it now. */
16990 /* Perform any lookups in the declared type which were thought to be
16991 dependent, but are not in the scope of the declarator. */
16992 decl_specifiers->type
16995 /* If we're allowing GNU extensions, look for an
16996 asm-specification. */
16998 {
16999 /* Look for an asm-specification. */
17002 }
17003 else
17006 /* Look for attributes. */
17010 /* Peek at the next token. */
17016 {
17017 /* Check to see if the token indicates the start of a
17018 function-definition. */
17020 {
17022 {
17023 /* If a function-definition should not appear here, issue an
17024 error message. */
17028 }
17030 location_t func_brace_location
17033 /* Neither attributes nor an asm-specification are allowed
17034 on a function-definition. */
17037 "an asm-specification is not allowed "
17041 "attributes are not allowed "
17043 /* This is a function-definition. */
17046 /* Parse the function definition. */
17049 decl_specifiers,
17050 declarator,
17051 prefix_attributes);
17052 else
17053 decl =
17054 (cp_parser_function_definition_from_specifiers_and_declarator
17058 {
17059 /* This is where the prologue starts... */
17062 }
17065 }
17066 }
17068 {
17069 /* A non-template declaration involving a function parameter list
17070 containing an implicit template parameter will be made into a
17071 template. If the resulting declaration is not going to be an
17072 actual function then finish the template scope here to prevent it.
17073 An error message will be issued once we have a decl to talk about.
17075 FIXME probably we should do type deduction rather than create an
17076 implicit template, but the standard currently doesn't allow it. */
17079 }
17081 /* [dcl.dcl]
17083 Only in function declarations for constructors, destructors, and
17084 type conversions can the decl-specifier-seq be omitted.
17086 We explicitly postpone this check past the point where we handle
17087 function-definitions because we tolerate function-definitions
17088 that are missing their return types in some modes. */
17090 {
17094 }
17096 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17100 {
17111 {
17117 }
17118 }
17119 else
17120 {
17121 /* If the init-declarator isn't initialized and isn't followed by a
17122 `,' or `;', it's not a valid init-declarator. */
17125 {
17128 else
17129 {
17133 }
17134 }
17137 }
17139 /* Because start_decl has side-effects, we should only call it if we
17140 know we're going ahead. By this point, we know that we cannot
17141 possibly be looking at any other construct. */
17144 /* Enter the newly declared entry in the symbol table. If we're
17145 processing a declaration in a class-specifier, we wait until
17146 after processing the initializer. */
17148 {
17155 /* Adjust location of decl if declarator->id_loc is more appropriate:
17156 set, and decl wasn't merged with another decl, in which case its
17157 location would be different from input_location, and more accurate. */
17162 }
17164 /* Enter the SCOPE. That way unqualified names appearing in the
17165 initializer will be looked up in SCOPE. */
17168 /* Perform deferred access control checks, now that we know in which
17169 SCOPE the declared entity resides. */
17171 {
17174 /* If the entity being declared is a function, pretend that we
17175 are in its scope. If it is a `friend', it may have access to
17176 things that would not otherwise be accessible. */
17178 {
17181 }
17183 /* Perform access checks for template parameters. */
17186 /* Perform the access control checks for the declarator and the
17187 decl-specifiers. */
17190 /* Restore the saved value. */
17193 }
17195 /* Parse the initializer. */
17200 {
17202 {
17205 else
17206 {
17207 /* If the declaration was erroneous, we don't really
17208 know what the user intended, so just silently
17209 consume the initializer. */
17216 }
17217 }
17218 else
17219 {
17220 /* We want to record the extra mangling scope for in-class
17221 initializers of class members and initializers of static data
17222 member templates. The former involves deferring
17223 parsing of the initializer until end of class as with default
17224 arguments. So right here we only handle the latter. */
17234 }
17235 }
17237 /* The old parser allows attributes to appear after a parenthesized
17238 initializer. Mark Mitchell proposed removing this functionality
17239 on the GCC mailing lists on 2002-08-13. This parser accepts the
17240 attributes -- but ignores them. */
17247 /* And now complain about a non-function implicit template. */
17252 /* For an in-class declaration, use `grokfield' to create the
17253 declaration. */
17255 {
17257 {
17260 }
17268 }
17270 /* Finish processing the declaration. But, skip member
17271 declarations. */
17273 {
17276 asm_specification,
17277 /* If the initializer is in parentheses, then this is
17278 a direct-initialization, which means that an
17279 `explicit' constructor is OK. Otherwise, an
17280 `explicit' constructor cannot be used. */
17283 }
17286 /* Core issue #226 (C++0x only): A default template-argument
17287 shall not be specified in a friend class template
17288 declaration. */
17297 {
17300 else
17302 }
17305 }
17307 /* Parse a declarator.
17309 declarator:
17310 direct-declarator
17311 ptr-operator declarator
17313 abstract-declarator:
17314 ptr-operator abstract-declarator [opt]
17315 direct-abstract-declarator
17317 GNU Extensions:
17319 declarator:
17320 attributes [opt] direct-declarator
17321 attributes [opt] ptr-operator declarator
17323 abstract-declarator:
17324 attributes [opt] ptr-operator abstract-declarator [opt]
17325 attributes [opt] direct-abstract-declarator
17327 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17328 detect constructor, destructor or conversion operators. It is set
17329 to -1 if the declarator is a name, and +1 if it is a
17330 function. Otherwise it is set to zero. Usually you just want to
17331 test for >0, but internally the negative value is used.
17333 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17334 a decl-specifier-seq unless it declares a constructor, destructor,
17335 or conversion. It might seem that we could check this condition in
17336 semantic analysis, rather than parsing, but that makes it difficult
17337 to handle something like `f()'. We want to notice that there are
17338 no decl-specifiers, and therefore realize that this is an
17339 expression, not a declaration.)
17341 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17342 the declarator is a direct-declarator of the form "(...)".
17344 MEMBER_P is true iff this declarator is a member-declarator.
17346 FRIEND_P is true iff this declarator is a friend. */
17350 cp_parser_declarator_kind dcl_kind,
17354 {
17357 cp_cv_quals cv_quals;
17358 tree class_type;
17361 /* Assume this is not a constructor, destructor, or type-conversion
17362 operator. */
17369 /* Check for the ptr-operator production. */
17371 /* Parse the ptr-operator. */
17377 /* If that worked, then we have a ptr-operator. */
17379 {
17380 /* If a ptr-operator was found, then this declarator was not
17381 parenthesized. */
17384 /* The dependent declarator is optional if we are parsing an
17385 abstract-declarator. */
17389 /* Parse the dependent declarator. */
17394 friend_p);
17396 /* If we are parsing an abstract-declarator, we must handle the
17397 case where the dependent declarator is absent. */
17402 declarator = cp_parser_make_indirect_declarator
17404 }
17405 /* Everything else is a direct-declarator. */
17406 else
17407 {
17410 CPP_OPEN_PAREN);
17412 ctor_dtor_or_conv_p,
17414 }
17419 }
17421 /* Parse a direct-declarator or direct-abstract-declarator.
17423 direct-declarator:
17424 declarator-id
17425 direct-declarator ( parameter-declaration-clause )
17426 cv-qualifier-seq [opt]
17427 ref-qualifier [opt]
17428 exception-specification [opt]
17429 direct-declarator [ constant-expression [opt] ]
17430 ( declarator )
17432 direct-abstract-declarator:
17433 direct-abstract-declarator [opt]
17434 ( parameter-declaration-clause )
17435 cv-qualifier-seq [opt]
17436 ref-qualifier [opt]
17437 exception-specification [opt]
17438 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17439 ( abstract-declarator )
17441 Returns a representation of the declarator. DCL_KIND is
17442 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17443 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17444 we are parsing a direct-declarator. It is
17445 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17446 of ambiguity we prefer an abstract declarator, as per
17447 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17448 as for cp_parser_declarator. */
17452 cp_parser_declarator_kind dcl_kind,
17455 {
17465 {
17466 /* Peek at the next token. */
17469 {
17470 /* This is either a parameter-declaration-clause, or a
17471 parenthesized declarator. When we know we are parsing a
17472 named declarator, it must be a parenthesized declarator
17473 if FIRST is true. For instance, `(int)' is a
17474 parameter-declaration-clause, with an omitted
17475 direct-abstract-declarator. But `((*))', is a
17476 parenthesized abstract declarator. Finally, when T is a
17477 template parameter `(T)' is a
17478 parameter-declaration-clause, and not a parenthesized
17479 named declarator.
17481 We first try and parse a parameter-declaration-clause,
17482 and then try a nested declarator (if FIRST is true).
17484 It is not an error for it not to be a
17485 parameter-declaration-clause, even when FIRST is
17486 false. Consider,
17488 int i (int);
17489 int i (3);
17491 The first is the declaration of a function while the
17492 second is the definition of a variable, including its
17493 initializer.
17495 Having seen only the parenthesis, we cannot know which of
17496 these two alternatives should be selected. Even more
17497 complex are examples like:
17499 int i (int (a));
17500 int i (int (3));
17502 The former is a function-declaration; the latter is a
17503 variable initialization.
17505 Thus again, we try a parameter-declaration-clause, and if
17506 that fails, we back out and return. */
17509 {
17510 tree params;
17513 /* In a member-declarator, the only valid interpretation
17514 of a parenthesis is the start of a
17515 parameter-declaration-clause. (It is invalid to
17516 initialize a static data member with a parenthesized
17517 initializer; only the "=" form of initialization is
17518 permitted.) */
17522 /* Consume the `('. */
17525 {
17526 /* If this is going to be an abstract declarator, we're
17527 in a declarator and we can't have default args. */
17530 }
17534 /* Parse the parameter-declaration-clause. */
17537 /* Consume the `)'. */
17540 /* If all went well, parse the cv-qualifier-seq,
17541 ref-qualifier and the exception-specification. */
17543 {
17544 cp_cv_quals cv_quals;
17545 cp_virt_specifiers virt_specifiers;
17546 cp_ref_qualifier ref_qual;
17547 tree exception_specification;
17548 tree late_return;
17549 tree attrs;
17559 /* Parse the cv-qualifier-seq. */
17561 /* Parse the ref-qualifier. */
17563 /* And the exception-specification. */
17564 exception_specification
17569 /* In here, we handle cases where attribute is used after
17570 the function declaration. For example:
17571 void func (int x) __attribute__((vector(..))); */
17574 {
17578 CPP_SEMICOLON)
17580 CPP_OPEN_BRACE))
17583 ;
17584 else
17586 }
17587 late_return = (cp_parser_late_return_type_opt
17592 /* Parse the virt-specifier-seq. */
17595 /* Create the function-declarator. */
17597 params,
17598 cv_quals,
17599 virt_specifiers,
17600 ref_qual,
17601 exception_specification,
17602 late_return);
17604 /* Any subsequent parameter lists are to do with
17605 return type, so are not those of the declared
17606 function. */
17608 }
17610 /* Remove the function parms from scope. */
17614 /* Repeat the main loop. */
17616 }
17618 /* If this is the first, we can try a parenthesized
17619 declarator. */
17621 {
17627 /* Consume the `('. */
17629 /* Parse the nested declarator. */
17632 declarator
17638 /* Expect a `)'. */
17645 }
17646 /* Otherwise, we must be done. */
17647 else
17649 }
17653 {
17654 /* Parse an array-declarator. */
17663 /* Consume the `['. */
17665 /* Peek at the next token. */
17667 /* If the next token is `]', then there is no
17668 constant-expression. */
17670 {
17672 bounds
17682 {
17683 /* Normally, the array bound must be an integral constant
17684 expression. However, as an extension, we allow VLAs
17685 in function scopes as long as they aren't part of a
17686 parameter declaration. */
17690 }
17693 {
17694 /* Remember this wasn't a constant-expression. */
17697 }
17698 }
17699 else
17701 /* Look for the closing `]'. */
17703 {
17706 }
17711 }
17713 {
17714 {
17715 tree qualifying_scope;
17716 tree unqualified_name;
17717 tree attrs;
17718 special_function_kind sfk;
17723 /* Parse a declarator-id */
17726 {
17729 /* If we see an ellipsis, we should be looking at a
17730 parameter pack. */
17732 {
17733 /* Consume the `...' */
17737 }
17738 }
17741 unqualified_name
17745 {
17749 {
17750 /* Check whether an error occurred. */
17753 /* We already consumed the ellipsis to mark a
17754 parameter pack, but we have no way to report it,
17755 so abort the tentative parse. We will be exiting
17756 immediately anyway. */
17758 }
17759 else
17765 && (qualifying_scope
17767 {
17770 }
17771 }
17776 {
17781 }
17787 {
17788 /* In the declaration of a member of a template class
17789 outside of the class itself, the SCOPE will sometimes
17790 be a TYPENAME_TYPE. For example, given:
17792 template <typename T>
17793 int S<T>::R::i = 3;
17795 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17796 this context, we must resolve S<T>::R to an ordinary
17797 type, rather than a typename type.
17799 The reason we normally avoid resolving TYPENAME_TYPEs
17800 is that a specialization of `S' might render
17801 `S<T>::R' not a type. However, if `S' is
17802 specialized, then this `i' will not be used, so there
17803 is no harm in resolving the types here. */
17804 tree type;
17806 /* Resolve the TYPENAME_TYPE. */
17809 /* If that failed, the declarator is invalid. */
17811 {
17814 "cannot define member of dependent typedef "
17816 else
17821 }
17823 }
17828 {
17829 tree class_type;
17834 else
17838 {
17841 {
17844 {
17848 "use %<%T::%D%> instead of %<%T::%D%> to "
17850 class_type,
17855 }
17856 else
17858 }
17859 else
17860 {
17861 /* We do not attempt to print the declarator
17862 here because we do not have enough
17863 information about its original syntactic
17864 form. */
17868 }
17869 }
17872 {
17878 for an anonymous type, even if the type
17879 got a name for linkage purposes. */
17881 /* Handle correctly (c++/19200):
17883 struct S {
17884 struct T{};
17885 friend void S(T);
17886 };
17888 and also:
17890 namespace N {
17891 void S();
17892 }
17894 struct S {
17895 friend void N::S();
17896 }; */
17897 && !(friend_p
17900 class_type))
17901 {
17904 }
17912 }
17913 }
17915 unqualified_name,
17916 sfk);
17923 }
17925 handle_declarator:;
17928 {
17929 /* Any names that appear after the declarator-id for a
17930 member are looked up in the containing scope. */
17932 {
17933 /* But declarations with qualified-ids can't appear in a
17934 function. */
17938 }
17940 }
17944 /* Default args are only allowed on function
17945 declarations. */
17947 else
17951 }
17952 /* We're done. */
17953 else
17955 }
17957 /* For an abstract declarator, we might wind up with nothing at this
17958 point. That's an error; the declarator is not optional. */
17962 /* If we entered a scope, we must exit it now. */
17970 }
17972 /* Parse a ptr-operator.
17974 ptr-operator:
17975 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17976 * cv-qualifier-seq [opt]
17977 &
17978 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17979 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17981 GNU Extension:
17983 ptr-operator:
17984 & cv-qualifier-seq [opt]
17986 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17987 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17988 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17989 filled in with the TYPE containing the member. *CV_QUALS is
17990 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17991 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17992 Note that the tree codes returned by this function have nothing
17993 to do with the types of trees that will be eventually be created
17994 to represent the pointer or reference type being parsed. They are
17995 just constants with suggestive names. */
17996 static enum tree_code
18001 {
18006 /* Assume that it's not a pointer-to-member. */
18008 /* And that there are no cv-qualifiers. */
18011 /* Peek at the next token. */
18014 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18024 {
18025 /* Consume the `*', `&' or `&&'. */
18028 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18029 `&', if we are allowing GNU extensions. (The only qualifier
18030 that can legally appear after `&' is `restrict', but that is
18031 enforced during semantic analysis. */
18039 }
18040 else
18041 {
18042 /* Try the pointer-to-member case. */
18044 /* Look for the optional `::' operator. */
18047 /* Look for the nested-name specifier. */
18054 /* If we found it, and the next token is a `*', then we are
18055 indeed looking at a pointer-to-member operator. */
18058 {
18059 /* Indicate that the `*' operator was used. */
18067 else
18068 {
18069 /* The type of which the member is a member is given by the
18070 current SCOPE. */
18072 /* The next name will not be qualified. */
18076 /* Look for optional c++11 attributes. */
18080 /* Look for the optional cv-qualifier-seq. */
18082 }
18083 }
18084 /* If that didn't work we don't have a ptr-operator. */
18087 }
18090 }
18092 /* Parse an (optional) cv-qualifier-seq.
18094 cv-qualifier-seq:
18095 cv-qualifier cv-qualifier-seq [opt]
18097 cv-qualifier:
18098 const
18099 volatile
18101 GNU Extension:
18103 cv-qualifier:
18104 __restrict__
18106 Returns a bitmask representing the cv-qualifiers. */
18108 static cp_cv_quals
18110 {
18114 {
18116 cp_cv_quals cv_qualifier;
18118 /* Peek at the next token. */
18120 /* See if it's a cv-qualifier. */
18122 {
18138 }
18144 {
18147 }
18148 else
18149 {
18152 }
18153 }
18156 }
18158 /* Parse an (optional) ref-qualifier
18160 ref-qualifier:
18161 &
18162 &&
18164 Returns cp_ref_qualifier representing ref-qualifier. */
18166 static cp_ref_qualifier
18168 {
18171 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18176 {
18181 {
18193 }
18198 {
18201 }
18202 else
18203 {
18206 }
18207 }
18210 }
18212 /* Parse an (optional) virt-specifier-seq.
18214 virt-specifier-seq:
18215 virt-specifier virt-specifier-seq [opt]
18217 virt-specifier:
18218 override
18219 final
18221 Returns a bitmask representing the virt-specifiers. */
18223 static cp_virt_specifiers
18225 {
18229 {
18231 cp_virt_specifiers virt_specifier;
18233 /* Peek at the next token. */
18235 /* See if it's a virt-specifier-qualifier. */
18239 {
18242 }
18244 {
18247 }
18249 {
18251 }
18252 else
18256 {
18259 }
18260 else
18261 {
18264 }
18265 }
18267 }
18269 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18270 is in scope even though it isn't real. */
18272 void
18274 {
18275 tree this_parm;
18278 {
18279 /* We don't clear this between NSDMIs. Is it already what we want? */
18284 }
18287 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18289 current_class_ref
18292 }
18294 /* Return true iff our current scope is a non-static data member
18295 initializer. */
18297 bool
18299 {
18300 /* We recognize NSDMI context by the context-less 'this' pointer set up
18301 by the function above. */
18305 }
18307 /* Parse a late-specified return type, if any. This is not a separate
18308 non-terminal, but part of a function declarator, which looks like
18310 -> trailing-type-specifier-seq abstract-declarator(opt)
18312 Returns the type indicated by the type-id.
18314 In addition to this this parses any queued up omp declare simd
18315 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18317 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18318 function. */
18320 static tree
18322 cp_cv_quals quals)
18323 {
18327 && declarator
18333 /* Peek at the next token. */
18335 /* A late-specified return type is indicated by an initial '->'. */
18342 {
18343 /* DR 1207: 'this' is in scope in the trailing return type. */
18345 }
18348 {
18349 /* Consume the ->. */
18353 }
18356 declarator->std_attributes
18360 declarator->std_attributes
18365 {
18368 }
18371 }
18373 /* Parse a declarator-id.
18375 declarator-id:
18376 id-expression
18377 :: [opt] nested-name-specifier [opt] type-name
18379 In the `id-expression' case, the value returned is as for
18380 cp_parser_id_expression if the id-expression was an unqualified-id.
18381 If the id-expression was a qualified-id, then a SCOPE_REF is
18382 returned. The first operand is the scope (either a NAMESPACE_DECL
18383 or TREE_TYPE), but the second is still just a representation of an
18384 unqualified-id. */
18386 static tree
18388 {
18389 tree id;
18390 /* The expression must be an id-expression. Assume that qualified
18391 names are the names of types so that:
18393 template <class T>
18394 int S<T>::R::i = 3;
18396 will work; we must treat `S<T>::R' as the name of a type.
18397 Similarly, assume that qualified names are templates, where
18398 required, so that:
18400 template <class T>
18401 int S<T>::R<T>::i = 3;
18403 will work, too. */
18409 optional_p);
18413 }
18415 /* Parse a type-id.
18417 type-id:
18418 type-specifier-seq abstract-declarator [opt]
18420 Returns the TYPE specified. */
18422 static tree
18425 {
18426 cp_decl_specifier_seq type_specifier_seq;
18429 /* Parse the type-specifier-seq. */
18431 is_trailing_return,
18436 /* There might or might not be an abstract declarator. */
18438 /* Look for the declarator. */
18439 abstract_declarator
18444 /* Check to see if there really was a declarator. */
18449 /* None of the valid uses of 'auto' in C++14 involve the type-id
18450 nonterminal, but it is valid in a trailing-return-type. */
18453 {
18454 /* A type-id with type 'auto' is only ok if the abstract declarator
18455 is a function declarator with a late-specified return type. */
18460 else
18461 {
18464 }
18465 }
18468 is_template_arg);
18469 }
18472 {
18474 }
18477 {
18478 tree r;
18480 parser->type_definition_forbidden_message
18485 {
18488 }
18490 }
18493 {
18495 }
18497 /* Parse a type-specifier-seq.
18499 type-specifier-seq:
18500 type-specifier type-specifier-seq [opt]
18502 GNU extension:
18504 type-specifier-seq:
18505 attributes type-specifier-seq [opt]
18507 If IS_DECLARATION is true, we are at the start of a "condition" or
18508 exception-declaration, so we might be followed by a declarator-id.
18510 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18511 i.e. we've just seen "->".
18513 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18515 static void
18520 {
18525 /* Clear the TYPE_SPECIFIER_SEQ. */
18528 /* In the context of a trailing return type, enum E { } is an
18529 elaborated-type-specifier followed by a function-body, not an
18530 enum-specifier. */
18534 /* Parse the type-specifiers and attributes. */
18536 {
18537 tree type_specifier;
18540 /* Check for attributes first. */
18542 {
18547 }
18549 /* record the token of the beginning of the type specifier seq,
18550 for error reporting purposes*/
18554 /* Look for the type-specifier. */
18556 flags,
18557 type_specifier_seq,
18559 NULL,
18562 {
18563 /* If the first type-specifier could not be found, this is not a
18564 type-specifier-seq at all. */
18566 {
18567 /* Set in_declarator_p to avoid skipping to the semicolon. */
18579 }
18580 /* If subsequent type-specifiers could not be found, the
18581 type-specifier-seq is complete. */
18583 }
18586 /* The standard says that a condition can be:
18588 type-specifier-seq declarator = assignment-expression
18590 However, given:
18592 struct S {};
18593 if (int S = ...)
18595 we should treat the "S" as a declarator, not as a
18596 type-specifier. The standard doesn't say that explicitly for
18597 type-specifier-seq, but it does say that for
18598 decl-specifier-seq in an ordinary declaration. Perhaps it
18599 would be clearer just to allow a decl-specifier-seq here, and
18600 then add a semantic restriction that if any decl-specifiers
18601 that are not type-specifiers appear, the program is invalid. */
18604 }
18605 }
18607 /* Return whether the function currently being declared has an associated
18608 template parameter list. */
18610 static bool
18612 {
18625 }
18627 /* Parse a parameter-declaration-clause.
18629 parameter-declaration-clause:
18630 parameter-declaration-list [opt] ... [opt]
18631 parameter-declaration-list , ...
18633 Returns a representation for the parameter declarations. A return
18634 value of NULL indicates a parameter-declaration-clause consisting
18635 only of an ellipsis. */
18637 static tree
18639 {
18640 tree parameters;
18649 parser->auto_is_implicit_function_template_parm_p
18651 }
18657 && !processing_template_parmlist
18663 /* Peek at the next token. */
18665 /* Check for trivial parameter-declaration-clauses. */
18667 {
18668 /* Consume the `...' token. */
18671 }
18673 /* There are no parameters. */
18674 {
18675 #ifndef NO_IMPLICIT_EXTERN_C
18680 else
18681 #endif
18683 }
18684 /* Check for `(void)', too, which is a special case. */
18688 {
18689 /* Consume the `void' token. */
18691 /* There are no parameters. */
18693 }
18695 /* Parse the parameter-declaration-list. */
18697 /* If a parse error occurred while parsing the
18698 parameter-declaration-list, then the entire
18699 parameter-declaration-clause is erroneous. */
18703 /* Peek at the next token. */
18705 /* If it's a `,', the clause should terminate with an ellipsis. */
18707 {
18708 /* Consume the `,'. */
18710 /* Expect an ellipsis. */
18711 ellipsis_p
18713 }
18714 /* It might also be `...' if the optional trailing `,' was
18715 omitted. */
18717 {
18718 /* Consume the `...' token. */
18720 /* And remember that we saw it. */
18722 }
18723 else
18726 /* Finish the parameter list. */
18731 }
18733 /* Parse a parameter-declaration-list.
18735 parameter-declaration-list:
18736 parameter-declaration
18737 parameter-declaration-list , parameter-declaration
18739 Returns a representation of the parameter-declaration-list, as for
18740 cp_parser_parameter_declaration_clause. However, the
18741 `void_list_node' is never appended to the list. Upon return,
18742 *IS_ERROR will be true iff an error occurred. */
18744 static tree
18746 {
18752 /* Assume all will go well. */
18754 /* The special considerations that apply to a function within an
18755 unbraced linkage specifications do not apply to the parameters
18756 to the function. */
18757 saved_in_unbraced_linkage_specification_p
18761 /* Look for more parameters. */
18763 {
18771 /* Parse the parameter. */
18772 parameter
18777 /* We don't know yet if the enclosing context is deprecated, so wait
18778 and warn in grokparms if appropriate. */
18782 {
18783 /* If a function parameter pack was specified and an implicit template
18784 parameter was introduced during cp_parser_parameter_declaration,
18785 change any implicit parameters introduced into packs. */
18789 {
18797 }
18801 PARM,
18804 }
18808 /* If a parse error occurred parsing the parameter declaration,
18809 then the entire parameter-declaration-list is erroneous. */
18811 {
18815 }
18825 {
18829 }
18831 /* Add the new parameter to the list. */
18835 /* Peek at the next token. */
18838 /* These are for Objective-C++ */
18841 /* The parameter-declaration-list is complete. */
18844 {
18847 /* Peek at the next token. */
18849 /* If it's an ellipsis, then the list is complete. */
18852 /* Otherwise, there must be more parameters. Consume the
18853 `,'. */
18855 /* When parsing something like:
18857 int i(float f, double d)
18859 we can tell after seeing the declaration for "f" that we
18860 are not looking at an initialization of a variable "i",
18861 but rather at the declaration of a function "i".
18863 Due to the fact that the parsing of template arguments
18864 (as specified to a template-id) requires backtracking we
18865 cannot use this technique when inside a template argument
18866 list. */
18870 /* However, a parameter-declaration of the form
18871 "float(f)" (which is a valid declaration of a
18872 parameter "f") can also be interpreted as an
18873 expression (the conversion of "f" to "float"). */
18876 }
18877 else
18878 {
18886 }
18887 }
18889 parser->in_unbraced_linkage_specification_p
18892 /* Reset implicit_template_scope if we are about to leave the function
18893 parameter list that introduced it. Note that for out-of-line member
18894 definitions, there will be one or more class scopes before we get to
18895 the template parameter scope. */
18899 {
18903 {
18906 }
18907 }
18910 }
18912 /* Parse a parameter declaration.
18914 parameter-declaration:
18915 decl-specifier-seq ... [opt] declarator
18916 decl-specifier-seq declarator = assignment-expression
18917 decl-specifier-seq ... [opt] abstract-declarator [opt]
18918 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18920 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18921 declares a template parameter. (In that case, a non-nested `>'
18922 token encountered during the parsing of the assignment-expression
18923 is not interpreted as a greater-than operator.)
18925 Returns a representation of the parameter, or NULL if an error
18926 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18927 true iff the declarator is of the form "(p)". */
18933 {
18935 cp_decl_specifier_seq decl_specifiers;
18937 tree default_argument;
18941 /* In a template parameter, `>' is not an operator.
18943 [temp.param]
18945 When parsing a default template-argument for a non-type
18946 template-parameter, the first non-nested `>' is taken as the end
18947 of the template parameter-list rather than a greater-than
18948 operator. */
18950 /* Type definitions may not appear in parameter types. */
18952 parser->type_definition_forbidden_message
18955 /* Parse the declaration-specifiers. */
18957 CP_PARSER_FLAGS_NONE,
18961 /* Complain about missing 'typename' or other invalid type names. */
18966 /* If an error occurred, there's no reason to attempt to parse the
18967 rest of the declaration. */
18969 {
18972 }
18974 /* Peek at the next token. */
18977 /* If the next token is a `)', `,', `=', `>', or `...', then there
18978 is no declarator. However, when variadic templates are enabled,
18979 there may be a declarator following `...'. */
18984 {
18988 }
18989 /* Otherwise, there should be a declarator. */
18990 else
18991 {
18995 /* After seeing a decl-specifier-seq, if the next token is not a
18996 "(", there is no possibility that the code is a valid
18997 expression. Therefore, if parsing tentatively, we commit at
18998 this point. */
19000 /* In an expression context, having seen:
19002 (int((char ...
19004 we cannot be sure whether we are looking at a
19005 function-type (taking a "char" as a parameter) or a cast
19006 of some object of type "char" to "int". */
19012 /* Parse the declarator. */
19015 CP_PARSER_DECLARATOR_EITHER,
19017 parenthesized_p,
19021 /* After the declarator, allow more attributes. */
19022 decl_specifiers.attributes
19025 }
19027 /* If the next token is an ellipsis, and we have not seen a
19028 declarator name, and the type of the declarator contains parameter
19029 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19030 a parameter pack expansion expression. Otherwise, leave the
19031 ellipsis for a C-style variadic function. */
19034 {
19045 {
19046 /* Consume the `...'. */
19050 /* Build a pack expansion type */
19053 else
19055 }
19056 }
19058 /* The restriction on defining new types applies only to the type
19059 of the parameter, not to the default argument. */
19062 /* If the next token is `=', then process a default argument. */
19064 {
19066 /* If we are defining a class, then the tokens that make up the
19067 default argument must be saved and processed later. */
19072 /* Outside of a class definition, we can just parse the
19073 assignment-expression. */
19074 else
19075 default_argument
19079 {
19082 else
19083 {
19085 "default arguments are only "
19088 }
19089 }
19093 {
19094 /* Find the name of the parameter pack. */
19101 template_parm_p
19107 else
19109 template_parm_p
19116 }
19117 }
19118 else
19122 declarator,
19123 default_argument);
19124 }
19126 /* Parse a default argument and return it.
19128 TEMPLATE_PARM_P is true if this is a default argument for a
19129 non-type template parameter. */
19130 static tree
19132 {
19138 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19139 set correctly. */
19142 /* Local variable names (and the `this' keyword) may not
19143 appear in a default argument. */
19146 /* Parse the assignment-expression. */
19151 /* The "this" pointer is not valid in a default argument. */
19153 {
19158 }
19159 default_argument
19161 /* Restore the "this" pointer. */
19163 {
19166 }
19175 }
19177 /* Parse a function-body.
19179 function-body:
19180 compound_statement */
19182 static void
19184 {
19186 }
19188 /* Parse a ctor-initializer-opt followed by a function-body. Return
19189 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19190 is true we are parsing a function-try-block. */
19192 static bool
19195 {
19203 /* Begin the function body. */
19205 /* Parse the optional ctor-initializer. */
19208 /* If we're parsing a constexpr constructor definition, we need
19209 to check that the constructor body is indeed empty. However,
19210 before we get to cp_parser_function_body lot of junk has been
19211 generated, so we can't just check that we have an empty block.
19212 Rather we take a snapshot of the outermost block, and check whether
19213 cp_parser_function_body changed its state. */
19215 {
19219 }
19220 /* Parse the function-body. */
19224 /* Finish the function body. */
19228 }
19230 /* Parse an initializer.
19232 initializer:
19233 = initializer-clause
19234 ( expression-list )
19236 Returns an expression representing the initializer. If no
19237 initializer is present, NULL_TREE is returned.
19239 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19240 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19241 set to TRUE if there is no initializer present. If there is an
19242 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19243 is set to true; otherwise it is set to false. */
19245 static tree
19248 {
19250 tree init;
19252 /* Peek at the next token. */
19255 /* Let our caller know whether or not this initializer was
19256 parenthesized. */
19258 /* Assume that the initializer is constant. */
19262 {
19263 /* Consume the `='. */
19265 /* Parse the initializer-clause. */
19267 }
19269 {
19274 non_constant_p);
19279 }
19281 {
19286 }
19287 else
19288 {
19289 /* Anything else is an error. */
19292 }
19295 }
19297 /* Parse an initializer-clause.
19299 initializer-clause:
19300 assignment-expression
19301 braced-init-list
19303 Returns an expression representing the initializer.
19305 If the `assignment-expression' production is used the value
19306 returned is simply a representation for the expression.
19308 Otherwise, calls cp_parser_braced_list. */
19310 static tree
19312 {
19313 tree initializer;
19315 /* Assume the expression is constant. */
19318 /* If it is not a `{', then we are looking at an
19319 assignment-expression. */
19321 {
19322 initializer
19325 non_constant_p);
19326 }
19327 else
19331 }
19333 /* Parse a brace-enclosed initializer list.
19335 braced-init-list:
19336 { initializer-list , [opt] }
19337 { }
19339 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19340 the elements of the initializer-list (or NULL, if the last
19341 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19342 NULL_TREE. There is no way to detect whether or not the optional
19343 trailing `,' was provided. NON_CONSTANT_P is as for
19344 cp_parser_initializer. */
19346 static tree
19348 {
19349 tree initializer;
19351 /* Consume the `{' token. */
19353 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19355 /* If it's not a `}', then there is a non-trivial initializer. */
19357 {
19358 /* Parse the initializer list. */
19361 /* A trailing `,' token is allowed. */
19364 }
19365 else
19367 /* Now, there should be a trailing `}'. */
19371 }
19373 /* Consume tokens up to, and including, the next non-nested closing `]'.
19374 Returns true iff we found a closing `]'. */
19376 static bool
19378 {
19382 {
19386 {
19389 /* If we've run out of tokens, then there is no closing `]'. */
19398 {
19401 }
19406 }
19408 /* Consume the token. */
19410 }
19411 }
19413 /* Return true if we are looking at an array-designator, false otherwise. */
19415 static bool
19417 {
19418 /* Consume the `['. */
19423 /* Skip tokens until the next token is a closing square bracket.
19424 If we find the closing `]', and the next token is a `=', then
19425 we are looking at an array designator. */
19426 bool array_designator_p
19430 /* Roll back the tokens we skipped. */
19434 }
19436 /* Parse an initializer-list.
19438 initializer-list:
19439 initializer-clause ... [opt]
19440 initializer-list , initializer-clause ... [opt]
19442 GNU Extension:
19444 initializer-list:
19445 designation initializer-clause ...[opt]
19446 initializer-list , designation initializer-clause ...[opt]
19448 designation:
19449 . identifier =
19450 identifier :
19451 [ constant-expression ] =
19453 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19454 for the initializer. If the INDEX of the elt is non-NULL, it is the
19455 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19456 as for cp_parser_initializer. */
19460 {
19463 /* Assume all of the expressions are constant. */
19466 /* Parse the rest of the list. */
19468 {
19470 tree designator;
19471 tree initializer;
19474 /* If the next token is an identifier and the following one is a
19475 colon, we are looking at the GNU designated-initializer
19476 syntax. */
19480 {
19481 /* Warn the user that they are using an extension. */
19484 /* Consume the identifier. */
19486 /* Consume the `:'. */
19488 }
19489 /* Also handle the C99 syntax, '. id ='. */
19494 {
19495 /* Warn the user that they are using an extension. */
19498 /* Consume the `.'. */
19500 /* Consume the identifier. */
19502 /* Consume the `='. */
19504 }
19505 /* Also handle C99 array designators, '[ const ] ='. */
19509 {
19510 /* In C++11, [ could start a lambda-introducer. */
19516 {
19519 }
19520 else
19521 {
19526 }
19532 }
19533 else
19536 /* Parse the initializer. */
19539 /* If any clause is non-constant, so is the entire initializer. */
19543 /* If we have an ellipsis, this is an initializer pack
19544 expansion. */
19546 {
19547 /* Consume the `...'. */
19550 /* Turn the initializer into an initializer expansion. */
19552 }
19554 /* Add it to the vector. */
19557 /* If the next token is not a comma, we have reached the end of
19558 the list. */
19562 /* Peek at the next token. */
19564 /* If the next token is a `}', then we're still done. An
19565 initializer-clause can have a trailing `,' after the
19566 initializer-list and before the closing `}'. */
19570 /* Consume the `,' token. */
19572 }
19575 }
19577 /* Classes [gram.class] */
19579 /* Parse a class-name.
19581 class-name:
19582 identifier
19583 template-id
19585 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19586 to indicate that names looked up in dependent types should be
19587 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19588 keyword has been used to indicate that the name that appears next
19589 is a template. TAG_TYPE indicates the explicit tag given before
19590 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19591 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19592 is the class being defined in a class-head.
19594 Returns the TYPE_DECL representing the class. */
19596 static tree
19604 {
19605 tree decl;
19606 tree scope;
19611 /* All class-names start with an identifier. */
19614 {
19617 }
19619 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19620 to a template-id, so we save it here. */
19625 /* Any name names a type if we're following the `typename' keyword
19626 in a qualified name where the enclosing scope is type-dependent. */
19629 /* Handle the common case (an identifier, but not a template-id)
19630 efficiently. */
19633 {
19637 /* Look for the identifier. */
19641 /* If the next token isn't an identifier, we are certainly not
19642 looking at a class-name. */
19645 /* If we know this is a type-name, there's no need to look it
19646 up. */
19649 else
19650 {
19651 tree ambiguous_decls;
19652 /* If we already know that this lookup is ambiguous, then
19653 we've already issued an error message; there's no reason
19654 to check again. */
19656 {
19659 }
19660 /* If the next token is a `::', then the name must be a type
19661 name.
19663 [basic.lookup.qual]
19665 During the lookup for a name preceding the :: scope
19666 resolution operator, object, function, and enumerator
19667 names are ignored. */
19670 /* Look up the name. */
19672 tag_type,
19675 check_dependency_p,
19679 {
19683 }
19684 }
19685 }
19686 else
19687 {
19688 /* Try a template-id. */
19690 check_dependency_p,
19691 tag_type,
19692 is_declaration);
19695 }
19699 /* If this is a typename, create a TYPENAME_TYPE. */
19701 {
19706 }
19710 /* Check to see that it is really the name of a class. */
19714 /* Situations like this:
19716 template <typename T> struct A {
19717 typename T::template X<int>::I i;
19718 };
19720 are problematic. Is `T::template X<int>' a class-name? The
19721 standard does not seem to be definitive, but there is no other
19722 valid interpretation of the following `::'. Therefore, those
19723 names are considered class-names. */
19724 {
19728 }
19732 /* In Objective-C 2.0, a classname followed by '.' starts a
19733 dot-syntax expression, and it's not a type-name. */
19745 }
19747 /* Parse a class-specifier.
19749 class-specifier:
19750 class-head { member-specification [opt] }
19752 Returns the TREE_TYPE representing the class. */
19754 static tree
19756 {
19757 tree type;
19771 /* Parse the class-head. */
19774 /* If the class-head was a semantic disaster, skip the entire body
19775 of the class. */
19777 {
19781 }
19783 /* Look for the `{'. */
19785 {
19788 }
19792 /* Issue an error message if type-definitions are forbidden here. */
19794 /* Remember that we are defining one more class. */
19796 /* Inside the class, surrounding template-parameter-lists do not
19797 apply. */
19798 saved_num_template_parameter_lists
19801 /* We are not in a function body. */
19804 /* Or in a loop. */
19807 /* Or in a switch. */
19810 /* We are not immediately inside an extern "lang" block. */
19811 saved_in_unbraced_linkage_specification_p
19815 /* Start the class. */
19817 {
19820 }
19824 /* If the type is erroneous, skip the entire body of the class. */
19826 else
19827 /* Parse the member-specification. */
19830 /* Look for the trailing `}'. */
19832 /* Look for trailing attributes to apply to this class. */
19840 /* We've finished a type definition. Check for the common syntax
19841 error of forgetting a semicolon after the definition. We need to
19842 be careful, as we can't just check for not-a-semicolon and be done
19843 with it; the user might have typed:
19845 class X { } c = ...;
19846 class X { } *p = ...;
19848 and so forth. Instead, enumerate all the possible tokens that
19849 might follow this production; if we don't see one of them, then
19850 complain and silently insert the semicolon. */
19851 {
19856 /* Don't try to parse c++11 attributes here. As per the
19857 grammar, that should be a task for
19858 cp_parser_decl_specifier_seq. */
19862 {
19873 /* While it's legal for type qualifiers and storage class
19874 specifiers to follow type definitions in the grammar, only
19875 compiler testsuites contain code like that. Assume that if
19876 we see such code, then what we're really seeing is a case
19877 like:
19879 class X { }
19880 const <type> var = ...;
19882 or
19884 class Y { }
19885 static <type> func (...) ...
19887 i.e. the qualifier or specifier applies to the next
19888 declaration. To do so, however, we need to look ahead one
19889 more token to see if *that* token is a type specifier.
19891 This code could be improved to handle:
19893 class Z { }
19894 static const <type> var = ...; */
19897 {
19900 /* Handling user-defined types here would be nice, but very
19901 tricky. */
19902 want_semicolon
19905 }
19909 }
19911 /* If we don't have a type, then something is very wrong and we
19912 shouldn't try to do anything clever. Likewise for not seeing the
19913 closing brace. */
19915 {
19916 cp_token_position prev
19927 else
19930 /* Unget one token and smash it to look as though we encountered
19931 a semicolon in the input stream. */
19936 }
19937 }
19939 /* If this class is not itself within the scope of another class,
19940 then we need to parse the bodies of all of the queued function
19941 definitions. Note that the queued functions defined in a class
19942 are not always processed immediately following the
19943 class-specifier for that class. Consider:
19945 struct A {
19946 struct B { void f() { sizeof (A); } };
19947 };
19949 If `f' were processed before the processing of `A' were
19950 completed, there would be no way to compute the size of `A'.
19951 Note that the nesting we are interested in here is lexical --
19952 not the semantic nesting given by TYPE_CONTEXT. In particular,
19953 for:
19955 struct A { struct B; };
19956 struct A::B { void f() { } };
19958 there is no need to delay the parsing of `A::B::f'. */
19960 {
19961 tree decl;
19968 /* In a first pass, parse default arguments to the functions.
19969 Then, in a second pass, parse the bodies of the functions.
19970 This two-phased approach handles cases like:
19972 struct S {
19973 void f() { g(); }
19974 void g(int i = 3);
19975 };
19977 */
19979 {
19981 /* If there are default arguments that have not yet been processed,
19982 take care of them now. */
19984 {
19989 }
19990 /* Make sure that any template parameters are in scope. */
19992 /* Parse the default argument expressions. */
19994 /* Remove any template parameters from the symbol table. */
19996 }
19998 /* Now parse any NSDMIs. */
20002 {
20004 {
20009 }
20012 }
20019 /* Now do some post-NSDMI bookkeeping. */
20025 /* Now parse the body of the functions. */
20027 {
20028 /* OpenMP UDRs need to be parsed before all other functions. */
20035 }
20036 else
20040 }
20041 else
20044 /* Put back any saved access checks. */
20047 /* Restore saved state. */
20051 parser->num_template_parameter_lists
20053 parser->in_unbraced_linkage_specification_p
20057 }
20059 static tree
20061 {
20062 tree ret;
20067 }
20069 /* Parse a class-head.
20071 class-head:
20072 class-key identifier [opt] base-clause [opt]
20073 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20074 class-key nested-name-specifier [opt] template-id
20075 base-clause [opt]
20077 class-virt-specifier:
20078 final
20080 GNU Extensions:
20081 class-key attributes identifier [opt] base-clause [opt]
20082 class-key attributes nested-name-specifier identifier base-clause [opt]
20083 class-key attributes nested-name-specifier [opt] template-id
20084 base-clause [opt]
20086 Upon return BASES is initialized to the list of base classes (or
20087 NULL, if there are none) in the same form returned by
20088 cp_parser_base_clause.
20090 Returns the TYPE of the indicated class. Sets
20091 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20092 involving a nested-name-specifier was used, and FALSE otherwise.
20094 Returns error_mark_node if this is not a class-head.
20096 Returns NULL_TREE if the class-head is syntactically valid, but
20097 semantically invalid in a way that means we should skip the entire
20098 body of the class. */
20100 static tree
20103 {
20104 tree nested_name_specifier;
20108 tree attributes;
20109 tree bases;
20119 /* Assume no nested-name-specifier will be present. */
20121 /* Assume no template parameter lists will be used in defining the
20122 type. */
20126 /* Look for the class-key. */
20131 /* Parse the attributes. */
20134 /* If the next token is `::', that is invalid -- but sometimes
20135 people do try to write:
20137 struct ::S {};
20139 Handle this gracefully by accepting the extra qualifier, and then
20140 issuing an error about it later if this really is a
20141 class-head. If it turns out just to be an elaborated type
20142 specifier, remain silent. */
20148 /* Determine the name of the class. Begin by looking for an
20149 optional nested-name-specifier. */
20151 nested_name_specifier
20157 /* If there was a nested-name-specifier, then there *must* be an
20158 identifier. */
20160 {
20162 /* Although the grammar says `identifier', it really means
20163 `class-name' or `template-name'. You are only allowed to
20164 define a class that has already been declared with this
20165 syntax.
20167 The proposed resolution for Core Issue 180 says that wherever
20168 you see `class T::X' you should treat `X' as a type-name.
20170 It is OK to define an inaccessible class; for example:
20172 class A { class B; };
20173 class A::B {};
20175 We do not know if we will see a class-name, or a
20176 template-name. We look for a class-name first, in case the
20177 class-name is a template-id; if we looked for the
20178 template-name first we would stop after the template-name. */
20183 class_type,
20187 /* If that didn't work, ignore the nested-name-specifier. */
20189 {
20195 }
20196 /* If we could not find a corresponding TYPE, treat this
20197 declaration like an unqualified declaration. */
20200 /* Otherwise, count the number of templates used in TYPE and its
20201 containing scopes. */
20202 else
20203 {
20204 tree scope;
20216 }
20217 }
20218 /* Otherwise, the identifier is optional. */
20219 else
20220 {
20221 /* We don't know whether what comes next is a template-id,
20222 an identifier, or nothing at all. */
20224 /* Check for a template-id. */
20229 class_key,
20231 /* If that didn't work, it could still be an identifier. */
20233 {
20235 {
20238 }
20239 else
20241 }
20242 else
20243 {
20246 }
20247 }
20252 {
20254 class_key,
20256 }
20259 /* If it's not a `:' or a `{' then we can't really be looking at a
20260 class-head, since a class-head only appears as part of a
20261 class-specifier. We have to detect this situation before calling
20262 xref_tag, since that has irreversible side-effects. */
20264 {
20268 }
20270 /* At this point, we're going ahead with the class-specifier, even
20271 if some other problem occurs. */
20274 {
20279 }
20280 /* Issue the error about the overly-qualified name now. */
20282 {
20287 }
20289 {
20294 }
20296 {
20297 tree scope;
20299 /* Reject typedef-names in class heads. */
20301 {
20304 type);
20307 }
20309 /* Figure out in what scope the declaration is being placed. */
20311 /* If that scope does not contain the scope in which the
20312 class was originally declared, the program is invalid. */
20314 {
20317 "declaration of %qD in namespace %qD which does not "
20320 else
20326 }
20327 /* [dcl.meaning]
20329 A declarator-id shall not be qualified except for the
20330 definition of a ... nested class outside of its class
20331 ... [or] the definition or explicit instantiation of a
20332 class member of a namespace outside of its namespace. */
20334 {
20339 }
20340 }
20341 /* An explicit-specialization must be preceded by "template <>". If
20342 it is not, try to recover gracefully. */
20346 {
20350 /* Take the same action that would have been taken by
20351 cp_parser_explicit_specialization. */
20354 }
20355 /* There must be no "return" statements between this point and the
20356 end of this function; set "type "to the correct return value and
20357 use "goto done;" to return. */
20358 /* Make sure that the right number of template parameters were
20359 present. */
20363 {
20364 /* If something went wrong, there is no point in even trying to
20365 process the class-definition. */
20368 }
20370 /* Look up the type. */
20372 {
20376 {
20380 }
20381 else
20382 {
20385 }
20388 }
20390 {
20391 tree class_type;
20393 /* Given:
20395 template <typename T> struct S { struct T };
20396 template <typename T> struct S<T>::T { };
20398 we will get a TYPENAME_TYPE when processing the definition of
20399 `S::T'. We need to resolve it to the actual type before we
20400 try to define it. */
20402 {
20407 else
20408 {
20411 }
20412 }
20416 {
20419 }
20422 /* Enter the scope indicated by the nested-name-specifier. */
20424 /* Get the canonical version of this type. */
20426 /* Call push_template_decl if it seems like we should be defining a
20427 template either from the template headers or the type we're
20428 defining, so that we diagnose both extra and missing headers. */
20432 {
20435 {
20438 }
20439 }
20443 }
20445 {
20446 /* If the class was unnamed, create a dummy name. */
20451 }
20453 /* Indicate whether this class was declared as a `class' or as a
20454 `struct'. */
20459 /* If this type was already complete, and we see another definition,
20460 that's an error. */
20462 {
20464 type);
20466 type);
20469 }
20474 {
20475 /* Apply attributes now, before any use of the class as a template
20476 argument in its base list. */
20479 }
20481 /* We will have entered the scope containing the class; the names of
20482 base classes should be looked up in that context. For example:
20484 struct A { struct B {}; struct C; };
20485 struct A::C : B {};
20487 is valid. */
20489 /* Get the list of base-classes, if there is one. */
20491 {
20492 /* PR59482: enter the class scope so that base-specifiers are looked
20493 up correctly. */
20497 /* PR59482: get out of the previously pushed class scope so that the
20498 subsequent pops pop the right thing. */
20501 }
20502 else
20505 /* If we're really defining a class, process the base classes.
20506 If they're invalid, fail. */
20511 done:
20512 /* Leave the scope given by the nested-name-specifier. We will
20513 enter the class scope itself while processing the members. */
20518 {
20521 }
20527 out:
20530 }
20532 /* Parse a class-key.
20534 class-key:
20535 class
20536 struct
20537 union
20539 Returns the kind of class-key specified, or none_type to indicate
20540 error. */
20542 static enum tag_types
20544 {
20548 /* Look for the class-key. */
20553 /* Check to see if the TOKEN is a class-key. */
20558 }
20560 /* Parse a type-parameter-key.
20562 type-parameter-key:
20563 class
20564 typename
20565 */
20567 static void
20569 {
20570 /* Look for the type-parameter-key. */
20574 {
20577 /* typename is not allowed in a template template parameter
20578 by the standard until C++1Z. */
20580 "ISO C++ forbids typename key in template template parameter;"
20582 }
20583 else
20587 }
20589 /* Parse an (optional) member-specification.
20591 member-specification:
20592 member-declaration member-specification [opt]
20593 access-specifier : member-specification [opt] */
20595 static void
20597 {
20599 {
20603 /* Peek at the next token. */
20605 /* If it's a `}', or EOF then we've seen all the members. */
20611 /* See if this token is a keyword. */
20614 {
20618 /* Consume the access-specifier. */
20620 /* Remember which access-specifier is active. */
20622 /* Look for the `:'. */
20627 /* Accept #pragmas at class scope. */
20629 {
20632 }
20634 /* Otherwise, the next construction must be a
20635 member-declaration. */
20637 }
20638 }
20639 }
20641 /* Parse a member-declaration.
20643 member-declaration:
20644 decl-specifier-seq [opt] member-declarator-list [opt] ;
20645 function-definition ; [opt]
20646 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20647 using-declaration
20648 template-declaration
20649 alias-declaration
20651 member-declarator-list:
20652 member-declarator
20653 member-declarator-list , member-declarator
20655 member-declarator:
20656 declarator pure-specifier [opt]
20657 declarator constant-initializer [opt]
20658 identifier [opt] : constant-expression
20660 GNU Extensions:
20662 member-declaration:
20663 __extension__ member-declaration
20665 member-declarator:
20666 declarator attributes [opt] pure-specifier [opt]
20667 declarator attributes [opt] constant-initializer [opt]
20668 identifier [opt] attributes [opt] : constant-expression
20670 C++0x Extensions:
20672 member-declaration:
20673 static_assert-declaration */
20675 static void
20677 {
20678 cp_decl_specifier_seq decl_specifiers;
20679 tree prefix_attributes;
20680 tree decl;
20689 /* Check for the `__extension__' keyword. */
20691 {
20692 /* Recurse. */
20694 /* Restore the old value of the PEDANTIC flag. */
20698 }
20700 /* Check for a template-declaration. */
20702 {
20703 /* An explicit specialization here is an error condition, and we
20704 expect the specialization handler to detect and report this. */
20708 else
20712 }
20714 /* Check for a using-declaration. */
20716 {
20718 {
20719 /* Parse the using-declaration. */
20723 }
20724 else
20725 {
20726 tree decl;
20730 /* Note that if we actually see the '=' token after the
20731 identifier, cp_parser_alias_declaration commits the
20732 tentative parse. In that case, we really expects an
20733 alias-declaration. Otherwise, we expect a using
20734 declaration. */
20735 alias_decl_expected =
20741 else
20745 }
20746 }
20748 /* Check for @defs. */
20750 {
20755 {
20760 }
20762 }
20764 /* If the next token is `static_assert' we have a static assertion. */
20766 {
20769 }
20776 /* Parse the decl-specifier-seq. */
20779 CP_PARSER_FLAGS_OPTIONAL,
20782 /* Check for an invalid type-name. */
20786 /* If there is no declarator, then the decl-specifier-seq should
20787 specify a type. */
20789 {
20790 /* If there was no decl-specifier-seq, and the next token is a
20791 `;', then we have something like:
20793 struct S { ; };
20795 [class.mem]
20797 Each member-declaration shall declare at least one member
20798 name of the class. */
20800 {
20804 }
20805 else
20806 {
20807 tree type;
20809 /* See if this declaration is a friend. */
20811 /* If there were decl-specifiers, check to see if there was
20812 a class-declaration. */
20815 /* Nested classes have already been added to the class, but
20816 a `friend' needs to be explicitly registered. */
20818 {
20819 /* If the `friend' keyword was present, the friend must
20820 be introduced with a class-key. */
20823 "in C++03 a class-key must be used "
20825 /* In this case:
20827 template <typename T> struct A {
20828 friend struct A<T>::B;
20829 };
20831 A<T>::B will be represented by a TYPENAME_TYPE, and
20832 therefore not recognized by check_tag_decl. */
20834 {
20838 }
20841 "friend declaration does not name a class or "
20843 else
20846 }
20847 /* If there is no TYPE, an error message will already have
20848 been issued. */
20850 ;
20851 /* An anonymous aggregate has to be handled specially; such
20852 a declaration really declares a data member (with a
20853 particular type), as opposed to a nested class. */
20855 {
20856 /* C++11 9.5/6. */
20859 "a storage class on an anonymous aggregate "
20862 /* Remove constructors and such from TYPE, now that we
20863 know it is an anonymous aggregate. */
20865 /* And make the corresponding data member. */
20868 /* Add it to the class. */
20870 }
20871 else
20872 cp_parser_check_access_in_redeclaration
20875 }
20876 }
20877 else
20878 {
20881 /* Clear attributes from the decl_specifiers but keep them
20882 around as prefix attributes that apply them to the entity
20883 being declared. */
20887 /* See if these declarations will be friends. */
20890 /* Keep going until we hit the `;' at the end of the
20891 declaration. */
20893 {
20895 tree first_attribute;
20897 /* Peek at the next token. */
20900 /* Check for a bitfield declaration. */
20905 {
20906 tree identifier;
20907 tree width;
20909 /* Get the name of the bitfield. Note that we cannot just
20910 check TOKEN here because it may have been invalidated by
20911 the call to cp_lexer_peek_nth_token above. */
20914 else
20917 /* Consume the `:' token. */
20919 /* Get the width of the bitfield. */
20920 width
20923 /* Look for attributes that apply to the bitfield. */
20925 /* Remember which attributes are prefix attributes and
20926 which are not. */
20928 /* Combine the attributes. */
20931 /* Create the bitfield declaration. */
20934 identifier,
20935 sfk_none)
20938 width,
20939 attributes);
20940 }
20941 else
20942 {
20944 tree initializer;
20945 tree asm_specification;
20948 /* Parse the declarator. */
20949 declarator
20954 friend_p);
20956 /* If something went wrong parsing the declarator, make sure
20957 that we at least consume some tokens. */
20959 {
20960 /* Skip to the end of the statement. */
20962 /* If the next token is not a semicolon, that is
20963 probably because we just skipped over the body of
20964 a function. So, we consume a semicolon if
20965 present, but do not issue an error message if it
20966 is not present. */
20968 CPP_SEMICOLON))
20971 }
20974 cp_parser_check_for_definition_in_return_type
20978 /* Look for an asm-specification. */
20980 /* Look for attributes that apply to the declaration. */
20982 /* Remember which attributes are prefix attributes and
20983 which are not. */
20985 /* Combine the attributes. */
20988 /* If it's an `=', then we have a constant-initializer or a
20989 pure-specifier. It is not correct to parse the
20990 initializer before registering the member declaration
20991 since the member declaration should be in scope while
20992 its initializer is processed. However, the rest of the
20993 front end does not yet provide an interface that allows
20994 us to handle this correctly. */
20996 {
20997 /* In [class.mem]:
20999 A pure-specifier shall be used only in the declaration of
21000 a virtual function.
21002 A member-declarator can contain a constant-initializer
21003 only if it declares a static member of integral or
21004 enumeration type.
21006 Therefore, if the DECLARATOR is for a function, we look
21007 for a pure-specifier; otherwise, we look for a
21008 constant-initializer. When we call `grokfield', it will
21009 perform more stringent semantics checks. */
21021 {
21023 /* Don't require a constant rvalue in C++11, since we
21024 might want a reference constant. We'll enforce
21025 constancy later. */
21027 /* Parse the initializer. */
21030 }
21031 else
21032 /* Parse the initializer. */
21034 }
21037 {
21041 else
21043 }
21044 /* Otherwise, there is no initializer. */
21045 else
21048 /* See if we are probably looking at a function
21049 definition. We are certainly not looking at a
21050 member-declarator. Calling `grokfield' has
21051 side-effects, so we must not do it unless we are sure
21052 that we are looking at a member-declarator. */
21055 {
21056 /* The grammar does not allow a pure-specifier to be
21057 used when a member function is defined. (It is
21058 possible that this fact is an oversight in the
21059 standard, since a pure function may be defined
21060 outside of the class-specifier. */
21066 declarator,
21067 attributes);
21070 /* If the member was not a friend, declare it here. */
21073 /* Peek at the next token. */
21075 /* If the next token is a semicolon, consume it. */
21079 }
21080 else
21083 /* Create the declaration. */
21088 {
21091 else
21093 }
21094 }
21098 /* Reset PREFIX_ATTRIBUTES. */
21104 /* If there is any qualification still in effect, clear it
21105 now; we will be starting fresh with the next declarator. */
21109 /* If it's a `,', then there are more declarators. */
21111 {
21114 {
21118 }
21119 }
21120 /* If the next token isn't a `;', then we have a parse error. */
21122 CPP_SEMICOLON))
21123 {
21124 /* The next token might be a ways away from where the
21125 actual semicolon is missing. Find the previous token
21126 and use that for our error position. */
21131 /* Assume that the user meant to provide a semicolon. If
21132 we were to cp_parser_skip_to_end_of_statement, we might
21133 skip to a semicolon inside a member function definition
21134 and issue nonsensical error messages. */
21136 }
21139 {
21140 /* Add DECL to the list of members. */
21142 /* Explicitly include, eg, NSDMIs, for better error
21143 recovery (c++/58650). */
21152 /* Add DECL to the queue of NSDMI to be parsed later. */
21154 }
21158 }
21159 }
21162 out:
21164 }
21166 /* Parse a pure-specifier.
21168 pure-specifier:
21169 = 0
21171 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21172 Otherwise, ERROR_MARK_NODE is returned. */
21174 static tree
21176 {
21179 /* Look for the `=' token. */
21182 /* Look for the `0' token. */
21191 /* Accept = default or = delete in c++0x mode. */
21194 {
21197 }
21199 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21201 {
21206 }
21208 {
21211 }
21214 }
21216 /* Parse a constant-initializer.
21218 constant-initializer:
21219 = constant-expression
21221 Returns a representation of the constant-expression. */
21223 static tree
21225 {
21226 /* Look for the `=' token. */
21230 /* It is invalid to write:
21232 struct S { static const int i = { 7 }; };
21234 */
21236 {
21239 /* Consume the opening brace. */
21241 /* Skip the initializer. */
21243 /* Look for the trailing `}'. */
21247 }
21250 }
21252 /* Derived classes [gram.class.derived] */
21254 /* Parse a base-clause.
21256 base-clause:
21257 : base-specifier-list
21259 base-specifier-list:
21260 base-specifier ... [opt]
21261 base-specifier-list , base-specifier ... [opt]
21263 Returns a TREE_LIST representing the base-classes, in the order in
21264 which they were declared. The representation of each node is as
21265 described by cp_parser_base_specifier.
21267 In the case that no bases are specified, this function will return
21268 NULL_TREE, not ERROR_MARK_NODE. */
21270 static tree
21272 {
21275 /* Look for the `:' that begins the list. */
21278 /* Scan the base-specifier-list. */
21280 {
21282 tree base;
21285 /* Look for the base-specifier. */
21287 /* Look for the (optional) ellipsis. */
21289 {
21290 /* Consume the `...'. */
21294 }
21296 /* Add BASE to the front of the list. */
21298 {
21300 /* Make this a pack expansion type. */
21304 {
21307 }
21308 }
21309 /* Peek at the next token. */
21311 /* If it's not a comma, then the list is complete. */
21314 /* Consume the `,'. */
21316 }
21318 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21319 base class had a qualified name. However, the next name that
21320 appears is certainly not qualified. */
21326 }
21328 /* Parse a base-specifier.
21330 base-specifier:
21331 :: [opt] nested-name-specifier [opt] class-name
21332 virtual access-specifier [opt] :: [opt] nested-name-specifier
21333 [opt] class-name
21334 access-specifier virtual [opt] :: [opt] nested-name-specifier
21335 [opt] class-name
21337 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21338 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21339 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21340 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21342 static tree
21344 {
21352 tree type;
21354 /* Process the optional `virtual' and `access-specifier'. */
21356 {
21357 /* Peek at the next token. */
21359 /* Process `virtual'. */
21361 {
21363 /* If `virtual' appears more than once, issue an error. */
21365 {
21369 }
21373 /* Consume the `virtual' token. */
21381 /* If more than one access specifier appears, issue an
21382 error. */
21385 {
21389 }
21393 /* Consume the access-specifier. */
21401 }
21402 }
21403 /* It is not uncommon to see programs mechanically, erroneously, use
21404 the 'typename' keyword to denote (dependent) qualified types
21405 as base classes. */
21407 {
21412 else
21414 "keyword %<typename%> not allowed in this context "
21417 }
21419 /* Look for the optional `::' operator. */
21421 /* Look for the nested-name-specifier. The simplest way to
21422 implement:
21424 [temp.res]
21426 The keyword `typename' is not permitted in a base-specifier or
21427 mem-initializer; in these contexts a qualified name that
21428 depends on a template-parameter is implicitly assumed to be a
21429 type name.
21431 is to pretend that we have seen the `typename' keyword at this
21432 point. */
21436 typename_type,
21438 /* If the base class is given by a qualified name, assume that names
21439 we see are type names or templates, as appropriate. */
21445 /* DR 950 allows decltype as a base-specifier. */
21447 else
21448 {
21449 /* Otherwise, look for the class-name. */
21451 class_scope_p,
21452 template_p,
21453 typename_type,
21458 }
21464 }
21466 /* Exception handling [gram.exception] */
21468 /* Parse an (optional) noexcept-specification.
21470 noexcept-specification:
21471 noexcept ( constant-expression ) [opt]
21473 If no noexcept-specification is present, returns NULL_TREE.
21474 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21475 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21476 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21477 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21478 in which case a boolean condition is returned instead. */
21480 static tree
21485 {
21489 /* Peek at the next token. */
21492 /* Is it a noexcept-specification? */
21494 {
21495 tree expr;
21499 {
21503 {
21504 /* Types may not be defined in an exception-specification. */
21506 parser->type_definition_forbidden_message
21511 /* Restore the saved message. */
21513 }
21514 else
21515 {
21518 }
21521 }
21522 else
21523 {
21527 }
21529 /* We cannot build a noexcept-spec right away because this will check
21530 that expr is a constexpr. */
21533 else
21535 }
21536 else
21538 }
21540 /* Parse an (optional) exception-specification.
21542 exception-specification:
21543 throw ( type-id-list [opt] )
21545 Returns a TREE_LIST representing the exception-specification. The
21546 TREE_VALUE of each node is a type. */
21548 static tree
21550 {
21552 tree type_id_list;
21555 /* Peek at the next token. */
21558 /* Is it a noexcept-specification? */
21564 /* If it's not `throw', then there's no exception-specification. */
21568 #if 0
21569 /* Enable this once a lot of code has transitioned to noexcept? */
21573 #endif
21575 /* Consume the `throw'. */
21578 /* Look for the `('. */
21581 /* Peek at the next token. */
21583 /* If it's not a `)', then there is a type-id-list. */
21585 {
21586 /* Types may not be defined in an exception-specification. */
21588 parser->type_definition_forbidden_message
21590 /* Parse the type-id-list. */
21592 /* Restore the saved message. */
21594 }
21595 else
21598 /* Look for the `)'. */
21602 }
21604 /* Parse an (optional) type-id-list.
21606 type-id-list:
21607 type-id ... [opt]
21608 type-id-list , type-id ... [opt]
21610 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21611 in the order that the types were presented. */
21613 static tree
21615 {
21619 {
21621 tree type;
21623 /* Get the next type-id. */
21625 /* Parse the optional ellipsis. */
21627 {
21628 /* Consume the `...'. */
21631 /* Turn the type into a pack expansion expression. */
21633 }
21634 /* Add it to the list. */
21636 /* Peek at the next token. */
21638 /* If it is not a `,', we are done. */
21641 /* Consume the `,'. */
21643 }
21646 }
21648 /* Parse a try-block.
21650 try-block:
21651 try compound-statement handler-seq */
21653 static tree
21655 {
21656 tree try_block;
21670 }
21672 /* Parse a function-try-block.
21674 function-try-block:
21675 try ctor-initializer [opt] function-body handler-seq */
21677 static bool
21679 {
21680 tree compound_stmt;
21681 tree try_block;
21684 /* Look for the `try' keyword. */
21687 /* Let the rest of the front end know where we are. */
21689 /* Parse the function-body. */
21690 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21692 /* We're done with the `try' part. */
21694 /* Parse the handlers. */
21696 /* We're done with the handlers. */
21700 }
21702 /* Parse a handler-seq.
21704 handler-seq:
21705 handler handler-seq [opt] */
21707 static void
21709 {
21711 {
21714 /* Parse the handler. */
21716 /* Peek at the next token. */
21718 /* If it's not `catch' then there are no more handlers. */
21721 }
21722 }
21724 /* Parse a handler.
21726 handler:
21727 catch ( exception-declaration ) compound-statement */
21729 static void
21731 {
21732 tree handler;
21733 tree declaration;
21743 }
21745 /* Parse an exception-declaration.
21747 exception-declaration:
21748 type-specifier-seq declarator
21749 type-specifier-seq abstract-declarator
21750 type-specifier-seq
21751 ...
21753 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21754 ellipsis variant is used. */
21756 static tree
21758 {
21759 cp_decl_specifier_seq type_specifiers;
21763 /* If it's an ellipsis, it's easy to handle. */
21765 {
21766 /* Consume the `...' token. */
21769 }
21771 /* Types may not be defined in exception-declarations. */
21773 parser->type_definition_forbidden_message
21776 /* Parse the type-specifier-seq. */
21780 /* If it's a `)', then there is no declarator. */
21783 else
21790 /* Restore the saved message. */
21797 }
21799 /* Parse a throw-expression.
21801 throw-expression:
21802 throw assignment-expression [opt]
21804 Returns a THROW_EXPR representing the throw-expression. */
21806 static tree
21808 {
21809 tree expression;
21814 /* Figure out whether or not there is an assignment-expression
21815 following the "throw" keyword. */
21823 else
21827 }
21829 /* GNU Extensions */
21831 /* Parse an (optional) asm-specification.
21833 asm-specification:
21834 asm ( string-literal )
21836 If the asm-specification is present, returns a STRING_CST
21837 corresponding to the string-literal. Otherwise, returns
21838 NULL_TREE. */
21840 static tree
21842 {
21844 tree asm_specification;
21846 /* Peek at the next token. */
21848 /* If the next token isn't the `asm' keyword, then there's no
21849 asm-specification. */
21853 /* Consume the `asm' token. */
21855 /* Look for the `('. */
21858 /* Look for the string-literal. */
21861 /* Look for the `)'. */
21865 }
21867 /* Parse an asm-operand-list.
21869 asm-operand-list:
21870 asm-operand
21871 asm-operand-list , asm-operand
21873 asm-operand:
21874 string-literal ( expression )
21875 [ string-literal ] string-literal ( expression )
21877 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21878 each node is the expression. The TREE_PURPOSE is itself a
21879 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21880 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21881 is a STRING_CST for the string literal before the parenthesis. Returns
21882 ERROR_MARK_NODE if any of the operands are invalid. */
21884 static tree
21886 {
21891 {
21892 tree string_literal;
21893 tree expression;
21894 tree name;
21897 {
21898 /* Consume the `[' token. */
21900 /* Read the operand name. */
21905 /* Look for the closing `]'. */
21907 }
21908 else
21910 /* Look for the string-literal. */
21913 /* Look for the `('. */
21915 /* Parse the expression. */
21917 /* Look for the `)'. */
21925 /* Add this operand to the list. */
21927 expression,
21928 asm_operands);
21929 /* If the next token is not a `,', there are no more
21930 operands. */
21933 /* Consume the `,'. */
21935 }
21938 }
21940 /* Parse an asm-clobber-list.
21942 asm-clobber-list:
21943 string-literal
21944 asm-clobber-list , string-literal
21946 Returns a TREE_LIST, indicating the clobbers in the order that they
21947 appeared. The TREE_VALUE of each node is a STRING_CST. */
21949 static tree
21951 {
21955 {
21956 tree string_literal;
21958 /* Look for the string literal. */
21960 /* Add it to the list. */
21962 /* If the next token is not a `,', then the list is
21963 complete. */
21966 /* Consume the `,' token. */
21968 }
21971 }
21973 /* Parse an asm-label-list.
21975 asm-label-list:
21976 identifier
21977 asm-label-list , identifier
21979 Returns a TREE_LIST, indicating the labels in the order that they
21980 appeared. The TREE_VALUE of each node is a label. */
21982 static tree
21984 {
21988 {
21991 /* Look for the identifier. */
21994 {
21997 {
22003 }
22004 }
22005 /* If the next token is not a `,', then the list is
22006 complete. */
22009 /* Consume the `,' token. */
22011 }
22014 }
22016 /* Return TRUE iff the next tokens in the stream are possibly the
22017 beginning of a GNU extension attribute. */
22019 static bool
22021 {
22023 }
22025 /* Return TRUE iff the next tokens in the stream are possibly the
22026 beginning of a standard C++-11 attribute specifier. */
22028 static bool
22030 {
22032 }
22034 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22035 beginning of a standard C++-11 attribute specifier. */
22037 static bool
22039 {
22047 }
22049 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22050 beginning of a GNU extension attribute. */
22052 static bool
22054 {
22058 }
22060 /* Return true iff the next tokens can be the beginning of either a
22061 GNU attribute list, or a standard C++11 attribute sequence. */
22063 static bool
22065 {
22068 }
22070 /* Return true iff the next Nth tokens can be the beginning of either
22071 a GNU attribute list, or a standard C++11 attribute sequence. */
22073 static bool
22075 {
22078 }
22080 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22081 of GNU attributes, or return NULL. */
22083 static tree
22085 {
22089 }
22091 #define CILK_SIMD_FN_CLAUSE_MASK \
22092 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22093 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22094 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22095 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22096 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22098 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22099 vector [(<clauses>)] */
22101 static void
22103 {
22107 {
22112 }
22115 {
22118 paren_scope++;
22119 }
22121 {
22124 paren_scope++;
22126 paren_scope--;
22127 /* Do not push the last ')' */
22130 }
22139 }
22141 /* Parse an (optional) series of attributes.
22143 attributes:
22144 attributes attribute
22146 attribute:
22147 __attribute__ (( attribute-list [opt] ))
22149 The return value is as for cp_parser_gnu_attribute_list. */
22151 static tree
22153 {
22157 {
22159 tree attribute_list;
22162 /* Peek at the next token. */
22164 /* If it's not `__attribute__', then we're done. */
22168 /* Consume the `__attribute__' keyword. */
22170 /* Look for the two `(' tokens. */
22174 /* Peek at the next token. */
22177 /* Parse the attribute-list. */
22179 else
22180 /* If the next token is a `)', then there is no attribute
22181 list. */
22184 /* Look for the two `)' tokens. */
22192 /* Add these new attributes to the list. */
22194 }
22197 }
22199 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22200 "__vector" or "__vector__." */
22204 {
22208 }
22210 /* Parse a GNU attribute-list.
22212 attribute-list:
22213 attribute
22214 attribute-list , attribute
22216 attribute:
22217 identifier
22218 identifier ( identifier )
22219 identifier ( identifier , expression-list )
22220 identifier ( expression-list )
22222 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22223 to an attribute. The TREE_PURPOSE of each node is the identifier
22224 indicating which attribute is in use. The TREE_VALUE represents
22225 the arguments, if any. */
22227 static tree
22229 {
22235 {
22237 tree identifier;
22238 tree attribute;
22240 /* Look for the identifier. We also allow keywords here; for
22241 example `__attribute__ ((const))' is legal. */
22245 {
22248 /* Consume the token, but save it since we need it for the
22249 SIMD enabled function parsing. */
22252 /* Save away the identifier that indicates which attribute
22253 this is. */
22255 /* For keywords, use the canonical spelling, not the
22256 parsed identifier. */
22262 /* Peek at the next token. */
22264 /* If it's an `(', then parse the attribute arguments. */
22266 {
22271 {
22274 }
22275 else
22276 vec = cp_parser_parenthesized_expression_list
22282 else
22283 {
22286 }
22287 /* Save the arguments away. */
22289 }
22291 {
22294 }
22297 {
22298 /* Add this attribute to the list. */
22301 }
22304 }
22305 /* Now, look for more attributes. If the next token isn't a
22306 `,', we're done. */
22310 /* Consume the comma and keep going. */
22312 }
22315 /* We built up the list in reverse order. */
22317 }
22319 /* Parse a standard C++11 attribute.
22321 The returned representation is a TREE_LIST which TREE_PURPOSE is
22322 the scoped name of the attribute, and the TREE_VALUE is its
22323 arguments list.
22325 Note that the scoped name of the attribute is itself a TREE_LIST
22326 which TREE_PURPOSE is the namespace of the attribute, and
22327 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22328 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22329 and which TREE_PURPOSE is directly the attribute name.
22331 Clients of the attribute code should use get_attribute_namespace
22332 and get_attribute_name to get the actual namespace and name of
22333 attributes, regardless of their being GNU or C++11 attributes.
22335 attribute:
22336 attribute-token attribute-argument-clause [opt]
22338 attribute-token:
22339 identifier
22340 attribute-scoped-token
22342 attribute-scoped-token:
22343 attribute-namespace :: identifier
22345 attribute-namespace:
22346 identifier
22348 attribute-argument-clause:
22349 ( balanced-token-seq )
22351 balanced-token-seq:
22352 balanced-token [opt]
22353 balanced-token-seq balanced-token
22355 balanced-token:
22356 ( balanced-token-seq )
22357 [ balanced-token-seq ]
22358 { balanced-token-seq }. */
22360 static tree
22362 {
22366 /* First, parse name of the the attribute, a.k.a
22367 attribute-token. */
22384 {
22385 /* We are seeing a scoped attribute token. */
22395 else
22396 {
22400 }
22402 NULL_TREE);
22404 }
22405 else
22406 {
22408 NULL_TREE);
22409 /* C++11 noreturn attribute is equivalent to GNU's. */
22412 /* C++14 deprecated attribute is equivalent to GNU's. */
22414 {
22417 "%<deprecated%> is a C++14 feature;"
22420 }
22421 }
22423 /* Now parse the optional argument clause of the attribute. */
22428 {
22434 /* A GNU attribute that takes an identifier in parameter. */
22437 vec = cp_parser_parenthesized_expression_list
22443 else
22444 {
22447 }
22451 else
22453 }
22456 }
22458 /* Parse a list of standard C++-11 attributes.
22460 attribute-list:
22461 attribute [opt]
22462 attribute-list , attribute[opt]
22463 attribute ...
22464 attribute-list , attribute ...
22465 */
22467 static tree
22469 {
22474 {
22479 {
22482 }
22487 }
22490 }
22492 /* Parse a standard C++-11 attribute specifier.
22494 attribute-specifier:
22495 [ [ attribute-list ] ]
22496 alignment-specifier
22498 alignment-specifier:
22499 alignas ( type-id ... [opt] )
22500 alignas ( alignment-expression ... [opt] ). */
22502 static tree
22504 {
22510 {
22519 else
22520 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22521 when we are sure that we have actually parsed them. */
22523 }
22524 else
22525 {
22526 tree alignas_expr;
22528 /* Look for an alignment-specifier. */
22540 {
22543 }
22549 {
22553 alignas_expr =
22560 }
22563 {
22566 }
22570 /* Build the C++-11 representation of an 'aligned'
22571 attribute. */
22572 attributes =
22576 }
22579 }
22581 /* Parse a standard C++-11 attribute-specifier-seq.
22583 attribute-specifier-seq:
22584 attribute-specifier-seq [opt] attribute-specifier
22585 */
22587 static tree
22589 {
22593 {
22602 }
22606 }
22608 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22609 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22610 current value of the PEDANTIC flag, regardless of whether or not
22611 the `__extension__' keyword is present. The caller is responsible
22612 for restoring the value of the PEDANTIC flag. */
22614 static bool
22616 {
22617 /* Save the old value of the PEDANTIC flag. */
22621 {
22622 /* Consume the `__extension__' token. */
22624 /* We're not being pedantic while the `__extension__' keyword is
22625 in effect. */
22629 }
22632 }
22634 /* Parse a label declaration.
22636 label-declaration:
22637 __label__ label-declarator-seq ;
22639 label-declarator-seq:
22640 identifier , label-declarator-seq
22641 identifier */
22643 static void
22645 {
22646 /* Look for the `__label__' keyword. */
22650 {
22651 tree identifier;
22653 /* Look for an identifier. */
22655 /* If we failed, stop. */
22658 /* Declare it as a label. */
22660 /* If the next token is a `;', stop. */
22663 /* Look for the `,' separating the label declarations. */
22665 }
22667 /* Look for the final `;'. */
22669 }
22671 /* Support Functions */
22673 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22674 NAME should have one of the representations used for an
22675 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22676 is returned. If PARSER->SCOPE is a dependent type, then a
22677 SCOPE_REF is returned.
22679 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22680 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22681 was formed. Abstractly, such entities should not be passed to this
22682 function, because they do not need to be looked up, but it is
22683 simpler to check for this special case here, rather than at the
22684 call-sites.
22686 In cases not explicitly covered above, this function returns a
22687 DECL, OVERLOAD, or baselink representing the result of the lookup.
22688 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22689 is returned.
22691 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22692 (e.g., "struct") that was used. In that case bindings that do not
22693 refer to types are ignored.
22695 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22696 ignored.
22698 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22699 are ignored.
22701 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22702 types.
22704 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22705 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22706 NULL_TREE otherwise. */
22708 static tree
22715 location_t name_location)
22716 {
22717 tree decl;
22720 /* Assume that the lookup will be unambiguous. */
22724 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22725 no longer valid. Note that if we are parsing tentatively, and
22726 the parse fails, OBJECT_TYPE will be automatically restored. */
22732 /* A template-id has already been resolved; there is no lookup to
22733 do. */
22737 {
22741 }
22743 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22744 it should already have been checked to make sure that the name
22745 used matches the type being destroyed. */
22747 {
22748 tree type;
22750 /* Figure out to which type this destructor applies. */
22755 else
22757 /* If that's not a class type, there is no destructor. */
22764 /* If it was a class type, return the destructor. */
22766 }
22768 /* By this point, the NAME should be an ordinary identifier. If
22769 the id-expression was a qualified name, the qualifying scope is
22770 stored in PARSER->SCOPE at this point. */
22773 /* Perform the lookup. */
22775 {
22781 /* If the SCOPE is dependent, the lookup must be deferred until
22782 the template is instantiated -- unless we are explicitly
22783 looking up names in uninstantiated templates. Even then, we
22784 cannot look up the name if the scope is not a class type; it
22785 might, for example, be a template type parameter. */
22790 /* Defer lookup. */
22792 else
22793 {
22796 /* If PARSER->SCOPE is a dependent type, then it must be a
22797 class type, and we must not be checking dependencies;
22798 otherwise, we would have processed this lookup above. So
22799 that PARSER->SCOPE is not considered a dependent base by
22800 lookup_member, we must enter the scope here. */
22804 /* If the PARSER->SCOPE is a template specialization, it
22805 may be instantiated during name lookup. In that case,
22806 errors may be issued. Even if we rollback the current
22807 tentative parse, those errors are valid. */
22812 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22813 lookup result and the nested-name-specifier nominates a class C:
22814 * if the name specified after the nested-name-specifier, when
22815 looked up in C, is the injected-class-name of C (Clause 9), or
22816 * if the name specified after the nested-name-specifier is the
22817 same as the identifier or the simple-template-id's template-
22818 name in the last component of the nested-name-specifier,
22819 the name is instead considered to name the constructor of
22820 class C. [ Note: for example, the constructor is not an
22821 acceptable lookup result in an elaborated-type-specifier so
22822 the constructor would not be used in place of the
22823 injected-class-name. --end note ] Such a constructor name
22824 shall be used only in the declarator-id of a declaration that
22825 names a constructor or in a using-declaration. */
22833 /* If we have a single function from a using decl, pull it out. */
22840 }
22842 /* If the scope is a dependent type and either we deferred lookup or
22843 we did lookup but didn't find the name, rememeber the name. */
22846 {
22848 {
22849 tree type;
22851 /* The resolution to Core Issue 180 says that `struct
22852 A::B' should be considered a type-name, even if `A'
22853 is dependent. */
22858 }
22862 CPP_CLOSE_PAREN)))
22866 else
22869 is_template);
22870 }
22873 }
22875 {
22876 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22877 OBJECT_TYPE is not a class. */
22879 /* If the OBJECT_TYPE is a template specialization, it may
22880 be instantiated during name lookup. In that case, errors
22881 may be issued. Even if we rollback the current tentative
22882 parse, those errors are valid. */
22884 name,
22887 tf_warning_or_error);
22888 else
22892 /* Look it up in the enclosing context. */
22898 }
22899 else
22900 {
22906 }
22908 /* If the lookup failed, let our caller know. */
22912 /* Pull out the template from an injected-class-name (or multiple). */
22916 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22918 {
22921 /* The error message we have to print is too complicated for
22922 cp_parser_error, so we incorporate its actions directly. */
22924 {
22926 name);
22928 }
22930 }
22938 /* If we have resolved the name of a member declaration, check to
22939 see if the declaration is accessible. When the name resolves to
22940 set of overloaded functions, accessibility is checked when
22941 overload resolution is done.
22943 During an explicit instantiation, access is not checked at all,
22944 as per [temp.explicit]. */
22951 }
22953 /* Like cp_parser_lookup_name, but for use in the typical case where
22954 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22955 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22957 static tree
22959 {
22961 none_type,
22966 location);
22967 }
22969 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22970 the current context, return the TYPE_DECL. If TAG_NAME_P is
22971 true, the DECL indicates the class being defined in a class-head,
22972 or declared in an elaborated-type-specifier.
22974 Otherwise, return DECL. */
22976 static tree
22978 {
22979 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22980 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22982 struct A {
22983 template <typename T> struct B;
22984 };
22986 template <typename T> struct A::B {};
22988 Similarly, in an elaborated-type-specifier:
22990 namespace N { struct X{}; }
22992 struct A {
22993 template <typename T> friend struct N::X;
22994 };
22996 However, if the DECL refers to a class type, and we are in
22997 the scope of the class, then the name lookup automatically
22998 finds the TYPE_DECL created by build_self_reference rather
22999 than a TEMPLATE_DECL. For example, in:
23001 template <class T> struct S {
23002 S s;
23003 };
23005 there is no need to handle such case. */
23011 }
23013 /* If too many, or too few, template-parameter lists apply to the
23014 declarator, issue an error message. Returns TRUE if all went well,
23015 and FALSE otherwise. */
23017 static bool
23020 location_t declarator_location)
23021 {
23023 {
23025 {
23033 /* If the DECLARATOR has the form `X<y>' then it uses one
23034 additional level of template parameters. */
23037 return cp_parser_check_template_parameters
23039 }
23054 }
23056 }
23058 /* NUM_TEMPLATES were used in the current declaration. If that is
23059 invalid, return FALSE and issue an error messages. Otherwise,
23060 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23061 declarator and we can print more accurate diagnostics. */
23063 static bool
23066 location_t location,
23068 {
23069 /* If there are the same number of template classes and parameter
23070 lists, that's OK. */
23073 /* If there are more, but only one more, then we are referring to a
23074 member template. That's OK too. */
23077 /* If there are more template classes than parameter lists, we have
23078 something like:
23080 template <class T> void S<T>::R<T>::f (); */
23082 {
23092 else
23095 }
23096 /* Otherwise, there are too many template parameter lists. We have
23097 something like:
23099 template <class T> template <class U> void S::f(); */
23102 }
23104 /* Parse an optional `::' token indicating that the following name is
23105 from the global namespace. If so, PARSER->SCOPE is set to the
23106 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23107 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23108 Returns the new value of PARSER->SCOPE, if the `::' token is
23109 present, and NULL_TREE otherwise. */
23111 static tree
23113 {
23116 /* Peek at the next token. */
23118 /* If we're looking at a `::' token then we're starting from the
23119 global namespace, not our current location. */
23121 {
23122 /* Consume the `::' token. */
23124 /* Set the SCOPE so that we know where to start the lookup. */
23130 }
23132 {
23136 }
23139 }
23141 /* Returns TRUE if the upcoming token sequence is the start of a
23142 constructor declarator. If FRIEND_P is true, the declarator is
23143 preceded by the `friend' specifier. */
23145 static bool
23147 {
23150 tree nested_name_specifier;
23153 /* The common case is that this is not a constructor declarator, so
23154 try to avoid doing lots of work if at all possible. It's not
23155 valid declare a constructor at function scope. */
23158 /* And only certain tokens can begin a constructor declarator. */
23166 /* Parse tentatively; we are going to roll back all of the tokens
23167 consumed here. */
23169 /* Assume that we are looking at a constructor declarator. */
23172 /* Look for the optional `::' operator. */
23175 /* Look for the nested-name-specifier. */
23176 nested_name_specifier
23187 /* Outside of a class-specifier, there must be a
23188 nested-name-specifier. */
23194 /* If we have a class scope, this is easy; DR 147 says that S::S always
23195 names the constructor, and no other qualified name could. */
23198 {
23208 }
23209 /* If we still think that this might be a constructor-declarator,
23210 look for a class-name. */
23212 {
23213 /* If we have:
23215 template <typename T> struct S {
23216 S();
23217 };
23219 we must recognize that the nested `S' names a class. */
23220 tree type_decl;
23224 none_type,
23228 /* If there was no class-name, then this is not a constructor.
23229 Otherwise, if we are in a class-specifier and we aren't
23230 handling a friend declaration, check that its type matches
23231 current_class_type (c++/38313). Note: error_mark_node
23232 is left alone for error recovery purposes. */
23234 && (outside_class_specifier_p
23239 /* If we're still considering a constructor, we have to see a `(',
23240 to begin the parameter-declaration-clause, followed by either a
23241 `)', an `...', or a decl-specifier. We need to check for a
23242 type-specifier to avoid being fooled into thinking that:
23244 S (f) (int);
23246 is a constructor. (It is actually a function named `f' that
23247 takes one parameter (of type `int') and returns a value of type
23248 `S'. */
23256 /* A parameter declaration begins with a decl-specifier,
23257 which is either the "attribute" keyword, a storage class
23258 specifier, or (usually) a type-specifier. */
23260 {
23261 tree type;
23265 /* Names appearing in the type-specifier should be looked up
23266 in the scope of the class. */
23269 else
23270 {
23273 {
23277 {
23280 }
23281 }
23283 }
23285 /* Inside the constructor parameter list, surrounding
23286 template-parameter-lists do not apply. */
23287 saved_num_template_parameter_lists
23291 /* Look for the type-specifier. */
23293 CP_PARSER_FLAGS_NONE,
23299 parser->num_template_parameter_lists
23302 /* Leave the scope of the class. */
23307 }
23308 }
23310 /* We did not really want to consume any tokens. */
23314 }
23316 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23317 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23318 they must be performed once we are in the scope of the function.
23320 Returns the function defined. */
23322 static tree
23323 cp_parser_function_definition_from_specifiers_and_declarator
23326 tree attributes,
23328 {
23329 tree fn;
23332 /* Begin the function-definition. */
23335 /* The things we're about to see are not directly qualified by any
23336 template headers we've seen thus far. */
23339 /* If there were names looked up in the decl-specifier-seq that we
23340 did not check, check them now. We must wait until we are in the
23341 scope of the function to perform the checks, since the function
23342 might be a friend. */
23346 {
23349 }
23352 {
23353 /* Skip the entire function. */
23356 }
23358 {
23359 /* Seen already, skip it. An error message has already been output. */
23363 /* If this is a function from a class, pop the nested class. */
23366 }
23367 else
23368 {
23369 timevar_id_t tv;
23372 else
23378 }
23381 }
23383 /* Parse the part of a function-definition that follows the
23384 declarator. INLINE_P is TRUE iff this function is an inline
23385 function defined within a class-specifier.
23387 Returns the function defined. */
23389 static tree
23392 {
23393 tree fn;
23399 bool fully_implicit_function_template_p
23402 tree implicit_template_parms
23405 cp_binding_level* implicit_template_scope
23411 /* If the next token is `return', then the code may be trying to
23412 make use of the "named return value" extension that G++ used to
23413 support. */
23416 {
23417 /* Consume the `return' keyword. */
23419 /* Look for the identifier that indicates what value is to be
23420 returned. */
23422 /* Issue an error message. */
23425 /* Skip tokens until we reach the start of the function body. */
23427 {
23434 }
23435 }
23436 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23437 anything declared inside `f'. */
23438 saved_in_unbraced_linkage_specification_p
23441 /* Inside the function, surrounding template-parameter-lists do not
23442 apply. */
23443 saved_num_template_parameter_lists
23449 /* If the next token is `try', `__transaction_atomic', or
23450 `__transaction_relaxed`, then we are looking at either function-try-block
23451 or function-transaction-block. Note that all of these include the
23452 function-body. */
23455 RID_TRANSACTION_ATOMIC);
23457 RID_TRANSACTION_RELAXED))
23459 RID_TRANSACTION_RELAXED);
23462 else
23463 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23468 /* Finish the function. */
23471 /* Generate code for it, if necessary. */
23473 /* Restore the saved values. */
23474 parser->in_unbraced_linkage_specification_p
23476 parser->num_template_parameter_lists
23480 parser->fully_implicit_function_template_p
23482 parser->implicit_template_parms
23484 parser->implicit_template_scope
23491 }
23493 /* Parse a template-declaration, assuming that the `export' (and
23494 `extern') keywords, if present, has already been scanned. MEMBER_P
23495 is as for cp_parser_template_declaration. */
23497 static void
23499 {
23502 tree parameter_list;
23507 /* Look for the `template' keyword. */
23512 /* And the `<'. */
23516 {
23517 /* 14.5.2.2 [temp.mem]
23519 A local class shall not have member templates. */
23524 }
23525 /* [temp]
23527 A template ... shall not have C linkage. */
23529 {
23531 /* Give it C++ linkage to avoid confusing other parts of the
23532 front end. */
23535 }
23536 else
23539 /* We cannot perform access checks on the template parameter
23540 declarations until we know what is being declared, just as we
23541 cannot check the decl-specifier list. */
23544 /* If the next token is `>', then we have an invalid
23545 specialization. Rather than complain about an invalid template
23546 parameter, issue an error message here. */
23548 {
23552 }
23553 else
23554 {
23555 /* Parse the template parameters. */
23557 }
23559 /* Get the deferred access checks from the parameter list. These
23560 will be checked once we know what is being declared, as for a
23561 member template the checks must be performed in the scope of the
23562 class containing the member. */
23565 /* Look for the `>'. */
23567 /* We just processed one more parameter list. */
23569 /* If the next token is `template', there are more template
23570 parameters. */
23572 RID_TEMPLATE))
23577 else
23578 {
23579 /* There are no access checks when parsing a template, as we do not
23580 know if a specialization will be a friend. */
23584 checks,
23585 member_p,
23590 /* If this is a member template declaration, let the front
23591 end know. */
23593 {
23598 }
23603 }
23604 /* We are done with the current parameter list. */
23609 /* Finish up. */
23612 /* Check the template arguments for a literal operator template. */
23616 {
23620 else
23621 {
23624 {
23630 }
23632 {
23640 }
23641 else
23643 }
23645 {
23648 " Expected non-type template argument pack <char...>"
23650 decl);
23651 else
23654 decl);
23655 }
23656 }
23657 /* Register member declarations. */
23660 /* For the erroneous case of a template with C linkage, we pushed an
23661 implicit C++ linkage scope; exit that scope now. */
23664 /* If DECL is a function template, we must return to parse it later.
23665 (Even though there is no definition, there might be default
23666 arguments that need handling.) */
23670 }
23672 /* Perform the deferred access checks from a template-parameter-list.
23673 CHECKS is a TREE_LIST of access checks, as returned by
23674 get_deferred_access_checks. */
23676 static void
23677 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23678 {
23682 }
23684 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23685 `function-definition' sequence that follows a template header.
23686 If MEMBER_P is true, this declaration appears in a class scope.
23688 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23689 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23691 static tree
23697 {
23700 cp_decl_specifier_seq decl_specifiers;
23704 /* This function is only used when processing a template
23705 declaration. */
23709 /* Defer access checks until we know what is being declared. */
23712 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23713 alternative. */
23716 CP_PARSER_FLAGS_OPTIONAL,
23722 /* There are no template typedefs. */
23724 {
23728 }
23730 /* Gather up the access checks that occurred the
23731 decl-specifier-seq. */
23734 /* Check for the declaration of a template class. */
23736 {
23738 {
23741 /* In this case:
23743 struct C {
23744 friend template <typename T> struct A<T>::B;
23745 };
23747 A<T>::B will be represented by a TYPENAME_TYPE, and
23748 therefore not recognized by shadow_tag. */
23750 && !decl
23757 else
23760 /* Perform access checks for template parameters. */
23762 }
23763 }
23765 /* Complain about missing 'typename' or other invalid type names. */
23768 {
23769 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23770 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23771 the rest of this declaration. */
23774 }
23776 /* If it's not a template class, try for a template function. If
23777 the next token is a `;', then this declaration does not declare
23778 anything. But, if there were errors in the decl-specifiers, then
23779 the error might well have come from an attempted class-specifier.
23780 In that case, there's no need to warn about a missing declarator. */
23784 {
23787 checks,
23789 member_p,
23790 declares_class_or_enum,
23794 /* 7.1.1-1 [dcl.stc]
23796 A storage-class-specifier shall not be specified in an explicit
23797 specialization... */
23799 && explicit_specialization_p
23801 {
23805 }
23809 }
23811 /* Look for a trailing `;' after the declaration. */
23817 out:
23820 /* Clear any current qualification; whatever comes next is the start
23821 of something new. */
23827 }
23829 /* Parse a cast-expression that is not the operand of a unary "&". */
23831 static tree
23833 {
23836 }
23838 /* Parse a functional cast to TYPE. Returns an expression
23839 representing the cast. */
23841 static tree
23843 {
23845 tree expression_list;
23846 tree cast;
23853 {
23861 tf_warning_or_error);
23862 }
23871 else
23872 {
23875 }
23878 tf_warning_or_error);
23879 /* [expr.const]/1: In an integral constant expression "only type
23880 conversions to integral or enumeration type can be used". */
23886 NIC_CONSTRUCTOR))
23889 }
23891 /* Save the tokens that make up the body of a member function defined
23892 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23893 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23894 specifiers applied to the declaration. Returns the FUNCTION_DECL
23895 for the member function. */
23897 static tree
23901 tree attributes)
23902 {
23905 tree fn;
23907 /* Create the FUNCTION_DECL. */
23910 /* If something went badly wrong, bail out now. */
23912 {
23913 /* If there's a function-body, skip it. */
23918 }
23920 /* Remember it, if there default args to post process. */
23923 /* Save away the tokens that make up the body of the
23924 function. */
23926 /* Handle function try blocks. */
23929 /* We can have braced-init-list mem-initializers before the fn body. */
23931 {
23934 {
23935 /* cache_group will stop after an un-nested { } pair, too. */
23939 /* variadic mem-inits have ... after the ')'. */
23942 }
23943 }
23945 /* Handle function try blocks. */
23950 /* Save away the inline definition; we will process it when the
23951 class is complete. */
23955 /* We need to know that this was defined in the class, so that
23956 friend templates are handled correctly. */
23959 /* Add FN to the queue of functions to be parsed later. */
23963 }
23965 /* Save the tokens that make up the in-class initializer for a non-static
23966 data member. Returns a DEFAULT_ARG. */
23968 static tree
23970 {
23972 }
23974 /* Parse a template-argument-list, as well as the trailing ">" (but
23975 not the opening "<"). See cp_parser_template_argument_list for the
23976 return value. */
23978 static tree
23980 {
23981 tree arguments;
23982 tree saved_scope;
23983 tree saved_qualifying_scope;
23984 tree saved_object_scope;
23989 /* [temp.names]
23991 When parsing a template-id, the first non-nested `>' is taken as
23992 the end of the template-argument-list rather than a greater-than
23993 operator. */
23994 saved_greater_than_is_operator_p
23997 /* Parsing the argument list may modify SCOPE, so we save it
23998 here. */
24002 /* We need to evaluate the template arguments, even though this
24003 template-id may be nested within a "sizeof". */
24008 /* Parse the template-argument-list itself. */
24012 else
24014 /* Look for the `>' that ends the template-argument-list. If we find
24015 a '>>' instead, it's probably just a typo. */
24017 {
24019 {
24020 /* In C++0x, a `>>' in a template argument list or cast
24021 expression is considered to be two separate `>'
24022 tokens. So, change the current token to a `>', but don't
24023 consume it: it will be consumed later when the outer
24024 template argument list (or cast expression) is parsed.
24025 Note that this replacement of `>' for `>>' is necessary
24026 even if we are parsing tentatively: in the tentative
24027 case, after calling
24028 cp_parser_enclosed_template_argument_list we will always
24029 throw away all of the template arguments and the first
24030 closing `>', either because the template argument list
24031 was erroneous or because we are replacing those tokens
24032 with a CPP_TEMPLATE_ID token. The second `>' (which will
24033 not have been thrown away) is needed either to close an
24034 outer template argument list or to complete a new-style
24035 cast. */
24038 }
24040 {
24041 /* If we're in a nested template argument list, the '>>' has
24042 to be a typo for '> >'. We emit the error message, but we
24043 continue parsing and we push a '>' as next token, so that
24044 the argument list will be parsed correctly. Note that the
24045 global source location is still on the token before the
24046 '>>', so we need to say explicitly where we want it. */
24052 }
24053 else
24054 {
24055 /* If this is not a nested template argument list, the '>>'
24056 is a typo for '>'. Emit an error message and continue.
24057 Same deal about the token location, but here we can get it
24058 right by consuming the '>>' before issuing the diagnostic. */
24061 "spurious %<>>%>, use %<>%> to terminate "
24063 }
24064 }
24065 else
24067 /* The `>' token might be a greater-than operator again now. */
24068 parser->greater_than_is_operator_p
24070 /* Restore the SAVED_SCOPE. */
24078 }
24080 /* MEMBER_FUNCTION is a member function, or a friend. If default
24081 arguments, or the body of the function have not yet been parsed,
24082 parse them now. */
24084 static void
24086 {
24088 /* If this member is a template, get the underlying
24089 FUNCTION_DECL. */
24093 /* There should not be any class definitions in progress at this
24094 point; the bodies of members are only parsed outside of all class
24095 definitions. */
24097 /* While we're parsing the member functions we might encounter more
24098 classes. We want to handle them right away, but we don't want
24099 them getting mixed up with functions that are currently in the
24100 queue. */
24103 /* Make sure that any template parameters are in scope. */
24106 /* If the body of the function has not yet been parsed, parse it
24107 now. */
24109 {
24110 tree function_scope;
24113 /* The function is no longer pending; we are processing it. */
24118 /* If this is a local class, enter the scope of the containing
24119 function. */
24124 /* Push the body of the function onto the lexer stack. */
24127 /* Let the front end know that we going to be defining this
24128 function. */
24132 /* Don't do access checking if it is a templated function. */
24136 /* #pragma omp declare reduction needs special parsing. */
24138 {
24143 }
24144 else
24145 /* Now, parse the body of the function. */
24152 /* Leave the scope of the containing function. */
24156 }
24158 /* Remove any template parameters from the symbol table. */
24161 /* Restore the queue. */
24164 }
24166 /* If DECL contains any default args, remember it on the unparsed
24167 functions queue. */
24169 static void
24171 {
24172 tree probe;
24175 probe;
24178 {
24182 }
24183 }
24185 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24186 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24187 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24188 from the parameter-type-list. */
24190 static tree
24193 {
24195 tree parsed_arg;
24201 /* Push the saved tokens for the default argument onto the parser's
24202 lexer stack. */
24208 /* Parse the default argument. */
24219 {
24220 /* In a non-template class, check conversions now. In a template,
24221 we'll wait and instantiate these as needed. */
24224 tf_warning_or_error);
24225 else
24227 }
24229 /* If the token stream has not been completely used up, then
24230 there was extra junk after the end of the default
24231 argument. */
24233 {
24236 else
24238 }
24240 /* Revert to the main lexer. */
24244 }
24246 /* FIELD is a non-static data member with an initializer which we saved for
24247 later; parse it now. */
24249 static void
24251 {
24252 tree def;
24259 NULL_TREE);
24265 }
24267 /* FN is a FUNCTION_DECL which may contains a parameter with an
24268 unparsed DEFAULT_ARG. Parse the default args now. This function
24269 assumes that the current scope is the scope in which the default
24270 argument should be processed. */
24272 static void
24274 {
24278 /* While we're parsing the default args, we might (due to the
24279 statement expression extension) encounter more classes. We want
24280 to handle them right away, but we don't want them getting mixed
24281 up with default args that are currently in the queue. */
24284 /* Local variable names (and the `this' keyword) may not appear
24285 in a default argument. */
24296 {
24298 tree parsed_arg;
24300 tree copy;
24307 /* This can happen for a friend declaration for a function
24308 already declared with default arguments. */
24311 parsed_arg
24313 default_arg,
24316 {
24318 }
24322 /* Update any instantiations we've already created. */
24326 }
24330 /* Make sure no default arg is missing. */
24333 /* Restore the state of local_variables_forbidden_p. */
24336 /* Restore the queue. */
24338 }
24340 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24342 sizeof ... ( identifier )
24344 where the 'sizeof' token has already been consumed. */
24346 static tree
24348 {
24349 /* Consume the `...'. */
24356 else
24364 /* The name is not qualified. */
24382 }
24384 /* Parse the operand of `sizeof' (or a similar operator). Returns
24385 either a TYPE or an expression, depending on the form of the
24386 input. The KEYWORD indicates which kind of expression we have
24387 encountered. */
24389 static tree
24391 {
24398 /* If it's a `...', then we are computing the length of a parameter
24399 pack. */
24404 /* Types cannot be defined in a `sizeof' expression. Save away the
24405 old message. */
24407 /* And create the new one. */
24413 /* The restrictions on constant-expressions do not apply inside
24414 sizeof expressions. */
24415 saved_integral_constant_expression_p
24417 saved_non_integral_constant_expression_p
24421 /* Do not actually evaluate the expression. */
24424 /* If it's a `(', then we might be looking at the type-id
24425 construction. */
24427 {
24430 /* We can't be sure yet whether we're looking at a type-id or an
24431 expression. */
24433 /* Note: as a GNU Extension, compound literals are considered
24434 postfix-expressions as they are in C99, so they are valid
24435 arguments to sizeof. See comment in cp_parser_cast_expression
24436 for details. */
24439 else
24440 {
24443 /* Look for the type-id. */
24445 /* Look for the closing `)'. */
24448 }
24450 /* If all went well, then we're done. */
24452 {
24453 cp_decl_specifier_seq decl_specs;
24455 /* Build a trivial decl-specifier-seq. */
24459 /* Call grokdeclarator to figure out what type this is. */
24462 TYPENAME,
24465 }
24466 }
24468 /* If the type-id production did not work out, then we must be
24469 looking at the unary-expression production. */
24473 /* Go back to evaluating expressions. */
24477 /* Free the message we created. */
24479 /* And restore the old one. */
24481 parser->integral_constant_expression_p
24483 parser->non_integral_constant_expression_p
24487 }
24489 /* If the current declaration has no declarator, return true. */
24491 static bool
24493 {
24494 /* If the next token is a `;' or a `,' then there is no
24495 declarator. */
24498 }
24500 /* Update the DECL_SPECS to reflect the storage class indicated by
24501 KEYWORD. */
24503 static void
24508 {
24509 cp_storage_class storage_class;
24512 {
24516 }
24518 {
24521 }
24526 {
24529 }
24532 {
24550 }
24554 /* A storage class specifier cannot be applied alongside a typedef
24555 specifier. If there is a typedef specifier present then set
24556 conflicting_specifiers_p which will trigger an error later
24557 on in grokdeclarator. */
24560 }
24562 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24563 is true, the type is a class or enum definition. */
24565 static void
24567 tree type_spec,
24570 {
24573 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24574 (with, for example, in "typedef int wchar_t;") we remember that
24575 this is what happened. In system headers, we ignore these
24576 declarations so that G++ can work with system headers that are not
24577 C++-safe. */
24579 && !type_definition_p
24589 {
24592 ds_redefined_builtin_type_spec,
24593 token);
24595 {
24599 }
24600 }
24603 else
24604 {
24609 }
24610 }
24612 /* True iff TOKEN is the GNU keyword __thread. */
24614 static bool
24616 {
24619 }
24621 /* Set the location for a declarator specifier and check if it is
24622 duplicated.
24624 DECL_SPECS is the sequence of declarator specifiers onto which to
24625 set the location.
24627 DS is the single declarator specifier to set which location is to
24628 be set onto the existing sequence of declarators.
24630 LOCATION is the location for the declarator specifier to
24631 consider. */
24633 static void
24636 {
24645 {
24649 }
24650 else
24651 {
24653 {
24657 else
24658 {
24661 OPT_Wlong_long,
24663 }
24664 }
24666 {
24671 else
24673 }
24674 else
24675 {
24691 "__complex"
24692 };
24695 }
24696 }
24697 }
24699 /* Return true iff the declarator specifier DS is present in the
24700 sequence of declarator specifiers DECL_SPECS. */
24702 bool
24704 cp_decl_spec ds)
24705 {
24712 }
24714 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24715 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24717 static bool
24719 {
24721 }
24723 /* Issue an error message indicating that TOKEN_DESC was expected.
24724 If KEYWORD is true, it indicated this function is called by
24725 cp_parser_require_keword and the required token can only be
24726 a indicated keyword. */
24728 static void
24730 required_token token_desc,
24732 {
24734 {
24803 }
24805 {
24807 {
24886 }
24887 }
24888 else
24890 }
24894 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24895 issue an error message indicating that TOKEN_DESC was expected.
24897 Returns the token consumed, if the token had the appropriate type.
24898 Otherwise, returns NULL. */
24903 required_token token_desc)
24904 {
24907 else
24908 {
24909 /* Output the MESSAGE -- unless we're parsing tentatively. */
24913 }
24914 }
24916 /* An error message is produced if the next token is not '>'.
24917 All further tokens are skipped until the desired token is
24918 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24920 static void
24922 {
24923 /* Current level of '< ... >'. */
24925 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24928 /* Are we ready, yet? If not, issue error message. */
24932 /* Skip tokens until the desired token is found. */
24934 {
24935 /* Peek at the next token. */
24937 {
24945 /* C++0x views the `>>' operator as two `>' tokens, but
24946 C++98 does not. */
24949 {
24950 /* We've hit a `>>' where the first `>' closes the
24951 template argument list, and the second `>' is
24952 spurious. Just consume the `>>' and stop; we've
24953 already produced at least one error. */
24956 }
24957 /* Fall through for C++0x, so we handle the second `>' in
24958 the `>>'. */
24962 {
24963 /* We've reached the token we want, consume it and stop. */
24966 }
24985 /* The '>' was probably forgotten, don't look further. */
24990 }
24992 /* Consume this token. */
24994 }
24995 }
24997 /* If the next token is the indicated keyword, consume it. Otherwise,
24998 issue an error message indicating that TOKEN_DESC was expected.
25000 Returns the token consumed, if the token had the appropriate type.
25001 Otherwise, returns NULL. */
25006 required_token token_desc)
25007 {
25011 {
25014 }
25017 }
25019 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25020 function-definition. */
25022 static bool
25024 {
25027 /* A ctor-initializer begins with a `:'. */
25029 /* A function-try-block begins with `try'. */
25031 /* A function-transaction-block begins with `__transaction_atomic'
25032 or `__transaction_relaxed'. */
25035 /* The named return value extension begins with `return'. */
25037 }
25039 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25040 definition. */
25042 static bool
25044 {
25051 }
25053 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25054 C++0x) ending a template-argument. */
25056 static bool
25058 {
25066 }
25068 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25069 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25071 static bool
25074 {
25080 /* Check for the sequence `<::' in the original code. It would be lexed as
25081 `[:', where `[' is a digraph, and there is no whitespace before
25082 `:'. */
25084 {
25089 }
25091 }
25093 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25094 or none_type otherwise. */
25096 static enum tag_types
25098 {
25100 {
25110 }
25111 }
25113 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25114 or none_type otherwise or if the token is null. */
25116 static enum tag_types
25118 {
25123 {
25131 }
25132 }
25134 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25136 static void
25138 {
25142 {
25146 type))
25149 }
25150 }
25152 /* Issue an error message if DECL is redeclared with different
25153 access than its original declaration [class.access.spec/3].
25154 This applies to nested classes and nested class templates.
25155 [class.mem/1]. */
25157 static void
25159 {
25168 }
25170 /* Look for the `template' keyword, as a syntactic disambiguator.
25171 Return TRUE iff it is present, in which case it will be
25172 consumed. */
25174 static bool
25176 {
25178 {
25179 /* In C++98 the `template' keyword can only be used within templates;
25180 outside templates the parser can always figure out what is a
25181 template and what is not. In C++11, per the resolution of DR 468,
25182 `template' is allowed in cases where it is not strictly necessary. */
25185 {
25188 "in C++98 %<template%> (as a disambiguator) is only "
25190 /* If this part of the token stream is rescanned, the same
25191 error message would be generated. So, we purge the token
25192 from the stream. */
25195 }
25196 else
25197 {
25198 /* Consume the `template' keyword. */
25201 }
25202 }
25204 }
25206 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25207 set PARSER->SCOPE, and perform other related actions. */
25209 static void
25211 {
25217 /* Get the stored value. */
25219 /* Perform any access checks that were deferred. */
25222 {
25227 }
25228 /* Set the scope from the stored value. */
25232 }
25234 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25235 encounter the end of a block before what we were looking for. */
25237 static bool
25241 {
25243 {
25246 /* Abort a parenthesized expression if we encounter a semicolon. */
25250 /* If we've reached the end of the file, stop. */
25256 /* We've hit the end of an enclosing block, so there's been some
25257 kind of syntax error. */
25260 /* Consume the token. */
25262 /* See if it starts a new group. */
25264 {
25266 /* In theory this should probably check end == '}', but
25267 cp_parser_save_member_function_body needs it to exit
25268 after either '}' or ')' when called with ')'. */
25271 }
25273 {
25277 }
25282 }
25283 }
25285 /* Like above, for caching a default argument or NSDMI. Both of these are
25286 terminated by a non-nested comma, but it can be unclear whether or not a
25287 comma is nested in a template argument list unless we do more parsing.
25288 In order to handle this ambiguity, when we encounter a ',' after a '<'
25289 we try to parse what follows as a parameter-declaration-list (in the
25290 case of a default argument) or a member-declarator (in the case of an
25291 NSDMI). If that succeeds, then we stop caching. */
25293 static tree
25295 {
25300 tree default_argument;
25302 /* Add tokens until we have processed the entire default
25303 argument. We add the range [first_token, token). */
25306 {
25307 /* For list-initialization, this is straightforward. */
25310 }
25312 {
25315 /* Peek at the next token. */
25317 /* What we do depends on what token we have. */
25319 {
25320 /* In valid code, a default argument must be
25321 immediately followed by a `,' `)', or `...'. */
25324 {
25325 /* If we've seen a '<', we might be in a
25326 template-argument-list. Until Core issue 325 is
25327 resolved, we don't know how this situation ought
25328 to be handled, so try to DTRT. We check whether
25329 what comes after the comma is a valid parameter
25330 declaration list. If it is, then the comma ends
25331 the default argument; otherwise the default
25332 argument continues. */
25335 /* Set ITALP so cp_parser_parameter_declaration_list
25336 doesn't decide to commit to this parse. */
25344 {
25351 }
25352 else
25353 {
25357 }
25364 }
25367 /* If we run into a non-nested `;', `}', or `]',
25368 then the code is invalid -- but the default
25369 argument is certainly over. */
25374 /* Handle correctly int n = sizeof ... ( p ); */
25377 /* Update DEPTH, if necessary. */
25392 /* This might be the comparison operator, or it might
25393 start a template argument list. */
25400 /* Fall through for C++0x, which treats the `>>'
25401 operator like two `>' tokens in certain
25402 cases. */
25406 {
25407 /* This might be an operator, or it might close a
25408 template argument list. But if a previous '<'
25409 started a template argument list, this will have
25410 closed it, so we can't be in one anymore. */
25414 }
25417 /* If we run out of tokens, issue an error message. */
25426 /* In these cases, we should look for template-ids.
25427 For example, if the default argument is
25428 `X<int, double>()', we need to do name lookup to
25429 figure out whether or not `X' is a template; if
25430 so, the `,' does not end the default argument.
25432 That is not yet done. */
25437 }
25439 /* If we've reached the end, stop. */
25443 /* Add the token to the token block. */
25445 }
25447 /* Create a DEFAULT_ARG to represent the unparsed default
25448 argument. */
25455 }
25457 /* Begin parsing tentatively. We always save tokens while parsing
25458 tentatively so that if the tentative parsing fails we can restore the
25459 tokens. */
25461 static void
25463 {
25464 /* Enter a new parsing context. */
25466 /* Begin saving tokens. */
25468 /* In order to avoid repetitive access control error messages,
25469 access checks are queued up until we are no longer parsing
25470 tentatively. */
25472 }
25474 /* Commit to the currently active tentative parse. */
25476 static void
25478 {
25482 /* Mark all of the levels as committed. */
25485 {
25492 }
25493 }
25495 /* Commit to the topmost currently active tentative parse.
25497 Note that this function shouldn't be called when there are
25498 irreversible side-effects while in a tentative state. For
25499 example, we shouldn't create a permanent entry in the symbol
25500 table, or issue an error message that might not apply if the
25501 tentative parse is aborted. */
25503 static void
25505 {
25510 {
25518 }
25519 }
25521 /* Abort the currently active tentative parse. All consumed tokens
25522 will be rolled back, and no diagnostics will be issued. */
25524 static void
25526 {
25530 /* Now, pretend that we want to see if the construct was
25531 successfully parsed. */
25533 }
25535 /* Stop parsing tentatively. If a parse error has occurred, restore the
25536 token stream. Otherwise, commit to the tokens we have consumed.
25537 Returns true if no error occurred; false otherwise. */
25539 static bool
25541 {
25545 /* Remember whether or not an error occurred, since we are about to
25546 destroy that information. */
25548 /* Remove the topmost context from the stack. */
25551 /* If no parse errors occurred, commit to the tentative parse. */
25553 {
25554 /* Commit to the tokens read tentatively, unless that was
25555 already done. */
25560 }
25561 /* Otherwise, if errors occurred, roll back our state so that things
25562 are just as they were before we began the tentative parse. */
25563 else
25564 {
25567 }
25568 /* Add the context to the front of the free list. */
25573 }
25575 /* Returns true if we are parsing tentatively and are not committed to
25576 this tentative parse. */
25578 static bool
25580 {
25583 }
25585 /* Returns nonzero iff an error has occurred during the most recent
25586 tentative parse. */
25588 static bool
25590 {
25593 }
25595 /* Returns nonzero if GNU extensions are allowed. */
25597 static bool
25599 {
25601 }
25602 \f
25603 /* Objective-C++ Productions */
25606 /* Parse an Objective-C expression, which feeds into a primary-expression
25607 above.
25609 objc-expression:
25610 objc-message-expression
25611 objc-string-literal
25612 objc-encode-expression
25613 objc-protocol-expression
25614 objc-selector-expression
25616 Returns a tree representation of the expression. */
25618 static tree
25620 {
25621 /* Try to figure out what kind of declaration is present. */
25625 {
25635 {
25647 }
25653 }
25656 }
25658 /* Parse an Objective-C message expression.
25660 objc-message-expression:
25661 [ objc-message-receiver objc-message-args ]
25663 Returns a representation of an Objective-C message. */
25665 static tree
25667 {
25676 }
25678 /* Parse an objc-message-receiver.
25680 objc-message-receiver:
25681 expression
25682 simple-type-specifier
25684 Returns a representation of the type or expression. */
25686 static tree
25688 {
25689 tree rcv;
25691 /* An Objective-C message receiver may be either (1) a type
25692 or (2) an expression. */
25696 /* If that worked out, fine. */
25703 CP_PARSER_FLAGS_NONE);
25710 }
25712 /* Parse the arguments and selectors comprising an Objective-C message.
25714 objc-message-args:
25715 objc-selector
25716 objc-selector-args
25717 objc-selector-args , objc-comma-args
25719 objc-selector-args:
25720 objc-selector [opt] : assignment-expression
25721 objc-selector-args objc-selector [opt] : assignment-expression
25723 objc-comma-args:
25724 assignment-expression
25725 objc-comma-args , assignment-expression
25727 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25728 selector arguments and TREE_VALUE containing a list of comma
25729 arguments. */
25731 static tree
25733 {
25739 {
25745 /* Detect if we have a unary selector. */
25754 sel_args
25759 }
25761 /* Handle non-selector arguments, if any. */
25763 {
25764 tree arg;
25769 addl_args
25774 }
25777 {
25780 }
25783 }
25785 /* Parse an Objective-C encode expression.
25787 objc-encode-expression:
25788 @encode objc-typename
25790 Returns an encoded representation of the type argument. */
25792 static tree
25794 {
25795 tree type;
25805 {
25809 }
25811 /* This happens if we find @encode(T) (where T is a template
25812 typename or something dependent on a template typename) when
25813 parsing a template. In that case, we can't compile it
25814 immediately, but we rather create an AT_ENCODE_EXPR which will
25815 need to be instantiated when the template is used.
25816 */
25818 {
25822 }
25825 }
25827 /* Parse an Objective-C @defs expression. */
25829 static tree
25831 {
25832 tree name;
25840 }
25842 /* Parse an Objective-C protocol expression.
25844 objc-protocol-expression:
25845 @protocol ( identifier )
25847 Returns a representation of the protocol expression. */
25849 static tree
25851 {
25852 tree proto;
25860 }
25862 /* Parse an Objective-C selector expression.
25864 objc-selector-expression:
25865 @selector ( objc-method-signature )
25867 objc-method-signature:
25868 objc-selector
25869 objc-selector-seq
25871 objc-selector-seq:
25872 objc-selector :
25873 objc-selector-seq objc-selector :
25875 Returns a representation of the method selector. */
25877 static tree
25879 {
25891 {
25900 {
25901 /* Detect if we have a unary selector. */
25903 {
25906 }
25907 else
25908 {
25910 }
25911 }
25916 {
25917 sel_seq
25920 sel_seq
25923 }
25924 else
25925 sel_seq
25930 }
25932 finish_selector:
25936 }
25938 /* Parse a list of identifiers.
25940 objc-identifier-list:
25941 identifier
25942 objc-identifier-list , identifier
25944 Returns a TREE_LIST of identifier nodes. */
25946 static tree
25948 {
25949 tree identifier;
25950 tree list;
25961 {
25968 identifier));
25970 }
25973 }
25975 /* Parse an Objective-C alias declaration.
25977 objc-alias-declaration:
25978 @compatibility_alias identifier identifier ;
25980 This function registers the alias mapping with the Objective-C front end.
25981 It returns nothing. */
25983 static void
25985 {
25993 }
25995 /* Parse an Objective-C class forward-declaration.
25997 objc-class-declaration:
25998 @class objc-identifier-list ;
26000 The function registers the forward declarations with the Objective-C
26001 front end. It returns nothing. */
26003 static void
26005 {
26008 {
26009 tree id;
26019 else
26021 }
26023 }
26025 /* Parse a list of Objective-C protocol references.
26027 objc-protocol-refs-opt:
26028 objc-protocol-refs [opt]
26030 objc-protocol-refs:
26031 < objc-identifier-list >
26033 Returns a TREE_LIST of identifiers, if any. */
26035 static tree
26037 {
26041 {
26045 }
26048 }
26050 /* Parse a Objective-C visibility specification. */
26052 static void
26054 {
26058 {
26073 }
26075 /* Eat '@private'/'@protected'/'@public'. */
26077 }
26079 /* Parse an Objective-C method type. Return 'true' if it is a class
26080 (+) method, and 'false' if it is an instance (-) method. */
26084 {
26087 else
26089 }
26091 /* Parse an Objective-C protocol qualifier. */
26093 static tree
26095 {
26108 {
26113 }
26116 }
26118 /* Parse an Objective-C typename. */
26120 static tree
26122 {
26126 {
26132 /* An ObjC type name may consist of just protocol qualifiers, in which
26133 case the type shall default to 'id'. */
26135 {
26138 /* If the type could not be parsed, an error has already
26139 been produced. For error recovery, behave as if it had
26140 not been specified, which will use the default type
26141 'id'. */
26143 {
26145 /* We need to skip to the closing parenthesis as
26146 cp_parser_type_id() does not seem to do it for
26147 us. */
26152 }
26153 }
26157 }
26160 }
26162 /* Check to see if TYPE refers to an Objective-C selector name. */
26164 static bool
26166 {
26172 }
26174 /* Parse an Objective-C selector. */
26176 static tree
26178 {
26182 {
26185 }
26187 /* C++ operator names are allowed to appear in ObjC selectors. */
26189 {
26202 }
26203 }
26205 /* Parse an Objective-C params list. */
26207 static tree
26209 {
26215 {
26225 /* Detect if we have a unary selector. */
26228 {
26231 }
26235 {
26236 /* Something went quite wrong. There should be a colon
26237 here, but there is not. Stop parsing parameters. */
26239 }
26241 /* New ObjC allows attributes on parameters too. */
26246 params
26249 type_name,
26250 identifier,
26251 parm_attr));
26254 }
26257 {
26260 }
26262 /* We allow tail attributes for the method. */
26264 {
26272 }
26275 {
26278 }
26280 }
26282 /* Parse the non-keyword Objective-C params. */
26284 static tree
26287 {
26293 {
26295 tree parm;
26301 {
26306 }
26308 /* TODO: parse attributes for tail parameters. */
26317 }
26319 /* We allow tail attributes for the method. */
26321 {
26323 {
26328 }
26329 else
26330 /* We have an error, but parse the attributes, so that we can
26331 carry on. */
26337 }
26340 }
26342 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26344 static void
26346 {
26349 /* If the next token is `extern' and the following token is a string
26350 literal, then we have a linkage specification. */
26352 && cp_parser_is_pure_string_literal
26355 /* Handle #pragma, if any. */
26358 /* Allow stray semicolons. */
26361 /* Mark methods as optional or required, when building protocols. */
26363 {
26366 }
26368 {
26371 }
26374 /* Other stray characters must generate errors. */
26376 {
26380 }
26381 /* Finally, try to parse a block-declaration, or a function-definition. */
26382 else
26384 }
26386 /* Parse a method signature. */
26388 static tree
26390 {
26406 }
26408 static bool
26410 {
26411 tree tattr;
26416 /* If the attributes are followed by a method introducer, this is not allowed.
26417 Dump the attributes and flag the situation. */
26422 /* Otherwise, the attributes introduce some interstitial code, possibly so
26423 rewind to allow that check. */
26426 }
26428 /* Parse an Objective-C method prototype list. */
26430 static void
26432 {
26436 {
26438 {
26443 else
26447 {
26451 }
26454 }
26460 OPT_Wattributes,
26462 else
26463 /* Allow for interspersed non-ObjC++ code. */
26467 }
26471 else
26475 }
26477 /* Parse an Objective-C method definition list. */
26479 static void
26481 {
26485 {
26486 tree meth;
26489 {
26495 else
26500 {
26504 }
26506 NULL_TREE);
26508 /* For historical reasons, we accept an optional semicolon. */
26515 {
26522 }
26523 }
26524 /* The following case will be removed once @synthesize is
26525 completely implemented. */
26536 else
26537 /* Allow for interspersed non-ObjC++ code. */
26541 }
26545 else
26549 }
26551 /* Parse Objective-C ivars. */
26553 static void
26555 {
26566 {
26567 cp_decl_specifier_seq declspecs;
26569 tree prefix_attributes;
26577 CP_PARSER_FLAGS_OPTIONAL,
26581 /* auto, register, static, extern, mutable. */
26583 {
26586 }
26588 /* thread_local. */
26590 {
26593 }
26595 /* typedef. */
26597 {
26600 }
26605 /* Keep going until we hit the `;' at the end of the
26606 declaration. */
26608 {
26613 /* Check for a (possibly unnamed) bitfield declaration. */
26621 {
26622 /* Get the name of the bitfield. */
26625 sfk_none);
26627 eat_colon:
26629 /* Get the width of the bitfield. */
26630 width
26632 }
26633 else
26634 {
26635 /* Parse the declarator. */
26636 declarator
26642 }
26644 /* Look for attributes that apply to the ivar. */
26646 /* Remember which attributes are prefix attributes and
26647 which are not. */
26649 /* Combine the attributes. */
26653 /* Create the bitfield declaration. */
26655 width,
26656 attributes);
26657 else
26662 /* Add the instance variable. */
26666 /* Reset PREFIX_ATTRIBUTES. */
26675 {
26678 }
26680 }
26684 }
26689 /* Do not consume the RID_AT_END, so it will be read again as terminating
26690 the @interface of @implementation. */
26694 /* For historical reasons, we accept an optional semicolon. */
26697 }
26699 /* Parse an Objective-C protocol declaration. */
26701 static void
26703 {
26709 {
26714 }
26716 /* See if we have a forward declaration or a definition. */
26719 /* Try a forward declaration first. */
26721 {
26723 {
26724 tree id;
26734 else
26736 }
26738 }
26740 /* Ok, we got a full-fledged definition (or at least should). */
26741 else
26742 {
26747 }
26748 }
26750 /* Parse an Objective-C superclass or category. */
26752 static void
26757 {
26763 {
26766 }
26768 {
26771 /* If there is no category name, and this is an @interface, we
26772 have a class extension. */
26774 {
26777 }
26778 else
26782 }
26783 }
26785 /* Parse an Objective-C class interface. */
26787 static void
26789 {
26796 {
26797 /* It's hard to recover because even if valid @interface stuff
26798 is to follow, we can't compile it (or validate it) if we
26799 don't even know which class it refers to. Let's assume this
26800 was a stray '@interface' token in the stream and skip it.
26801 */
26803 }
26808 /* We have either a class or a category on our hands. */
26811 else
26812 {
26814 /* Handle instance variable declarations, if any. */
26817 }
26820 }
26822 /* Parse an Objective-C class implementation. */
26824 static void
26826 {
26833 {
26834 /* It's hard to recover because even if valid @implementation
26835 stuff is to follow, we can't compile it (or validate it) if
26836 we don't even know which class it refers to. Let's assume
26837 this was a stray '@implementation' token in the stream and
26838 skip it.
26839 */
26841 }
26845 /* We have either a class or a category on our hands. */
26848 else
26849 {
26851 /* Handle instance variable declarations, if any. */
26854 }
26857 }
26859 /* Consume the @end token and finish off the implementation. */
26861 static void
26863 {
26866 }
26868 /* Parse an Objective-C declaration. */
26870 static void
26872 {
26873 /* Try to figure out what kind of declaration is present. */
26878 {
26894 }
26897 {
26920 }
26921 }
26923 /* Parse an Objective-C try-catch-finally statement.
26925 objc-try-catch-finally-stmt:
26926 @try compound-statement objc-catch-clause-seq [opt]
26927 objc-finally-clause [opt]
26929 objc-catch-clause-seq:
26930 objc-catch-clause objc-catch-clause-seq [opt]
26932 objc-catch-clause:
26933 @catch ( objc-exception-declaration ) compound-statement
26935 objc-finally-clause:
26936 @finally compound-statement
26938 objc-exception-declaration:
26939 parameter-declaration
26940 '...'
26942 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26944 Returns NULL_TREE.
26946 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26947 for C. Keep them in sync. */
26949 static tree
26951 {
26952 location_t location;
26953 tree stmt;
26958 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26959 node, lest it get absorbed into the surrounding block. */
26965 {
26974 {
26975 /* We have "@catch (...)" (where the '...' are literally
26976 what is in the code). Skip the '...'.
26977 parameter_declaration is set to NULL_TREE, and
26978 objc_being_catch_clauses() knows that that means
26979 '...'. */
26982 }
26983 else
26984 {
26985 /* We have "@catch (NSException *exception)" or something
26986 like that. Parse the parameter declaration. */
26990 else
26995 }
26998 else
26999 {
27000 /* If there was no open parenthesis, we are recovering from
27001 an error, and we are trying to figure out what mistake
27002 the user has made. */
27004 /* If there is an immediate closing parenthesis, the user
27005 probably forgot the opening one (ie, they typed "@catch
27006 NSException *e)". Parse the closing parenthesis and keep
27007 going. */
27011 /* If these is no immediate closing parenthesis, the user
27012 probably doesn't know that parenthesis are required at
27013 all (ie, they typed "@catch NSException *e"). So, just
27014 forget about the closing parenthesis and keep going. */
27015 }
27019 }
27021 {
27024 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27025 node, lest it get absorbed into the surrounding block. */
27029 }
27032 }
27034 /* Parse an Objective-C synchronized statement.
27036 objc-synchronized-stmt:
27037 @synchronized ( expression ) compound-statement
27039 Returns NULL_TREE. */
27041 static tree
27043 {
27044 location_t location;
27055 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27056 node, lest it get absorbed into the surrounding block. */
27061 }
27063 /* Parse an Objective-C throw statement.
27065 objc-throw-stmt:
27066 @throw assignment-expression [opt] ;
27068 Returns a constructed '@throw' statement. */
27070 static tree
27072 {
27084 }
27086 /* Parse an Objective-C statement. */
27088 static tree
27090 {
27091 /* Try to figure out what kind of declaration is present. */
27095 {
27106 }
27109 }
27111 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27112 look ahead to see if an objc keyword follows the attributes. This
27113 is to detect the use of prefix attributes on ObjC @interface and
27114 @protocol. */
27116 static bool
27118 {
27123 {
27126 }
27129 }
27131 /* This routine is a minimal replacement for
27132 c_parser_struct_declaration () used when parsing the list of
27133 types/names or ObjC++ properties. For example, when parsing the
27134 code
27136 @property (readonly) int a, b, c;
27138 this function is responsible for parsing "int a, int b, int c" and
27139 returning the declarations as CHAIN of DECLs.
27141 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27142 similar parsing. */
27143 static tree
27145 {
27147 cp_decl_specifier_seq declspecs;
27149 tree prefix_attributes;
27152 CP_PARSER_FLAGS_NONE,
27159 /* auto, register, static, extern, mutable. */
27161 {
27164 }
27166 /* thread_local. */
27168 {
27171 }
27173 /* typedef. */
27175 {
27178 }
27183 /* Keep going until we hit the `;' at the end of the declaration. */
27185 {
27190 /* Parse the declarator. */
27194 /* Look for attributes that apply to the ivar. */
27196 /* Remember which attributes are prefix attributes and
27197 which are not. */
27199 /* Combine the attributes. */
27209 /* Reset PREFIX_ATTRIBUTES. */
27220 {
27223 }
27224 else
27226 }
27228 }
27230 /* Parse an Objective-C @property declaration. The syntax is:
27232 objc-property-declaration:
27233 '@property' objc-property-attributes[opt] struct-declaration ;
27235 objc-property-attributes:
27236 '(' objc-property-attribute-list ')'
27238 objc-property-attribute-list:
27239 objc-property-attribute
27240 objc-property-attribute-list, objc-property-attribute
27242 objc-property-attribute
27243 'getter' = identifier
27244 'setter' = identifier
27245 'readonly'
27246 'readwrite'
27247 'assign'
27248 'retain'
27249 'copy'
27250 'nonatomic'
27252 For example:
27253 @property NSString *name;
27254 @property (readonly) id object;
27255 @property (retain, nonatomic, getter=getTheName) id name;
27256 @property int a, b, c;
27258 PS: This function is identical to
27259 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27260 static void
27262 {
27263 /* The following variables hold the attributes of the properties as
27264 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27265 seen. When we see an attribute, we set them to 'true' (if they
27266 are boolean properties) or to the identifier (if they have an
27267 argument, ie, for getter and setter). Note that here we only
27268 parse the list of attributes, check the syntax and accumulate the
27269 attributes that we find. objc_add_property_declaration() will
27270 then process the information. */
27280 /* 'properties' is the list of properties that we read. Usually a
27281 single one, but maybe more (eg, in "@property int a, b, c;" there
27282 are three). */
27283 tree properties;
27284 location_t loc;
27290 /* Parse the optional attribute list... */
27292 {
27293 /* Eat the '('. */
27297 {
27303 {
27306 }
27310 {
27321 {
27325 else
27330 }
27333 {
27337 }
27339 {
27341 {
27344 }
27345 else
27349 else
27351 }
27352 else
27353 {
27355 {
27358 }
27359 else
27361 }
27367 }
27374 else
27376 }
27378 /* FIXME: "@property (setter, assign);" will generate a spurious
27379 "error: expected ‘)’ before ‘,’ token". This is because
27380 cp_parser_require, unlike the C counterpart, will produce an
27381 error even if we are in error recovery. */
27383 {
27388 }
27389 }
27391 /* ... and the property declaration(s). */
27395 {
27397 /* If the next token is now a `;', consume it. */
27401 }
27405 else
27406 {
27407 /* Comma-separated properties are chained together in
27408 reverse order; add them one by one. */
27417 }
27420 }
27422 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27424 objc-synthesize-declaration:
27425 @synthesize objc-synthesize-identifier-list ;
27427 objc-synthesize-identifier-list:
27428 objc-synthesize-identifier
27429 objc-synthesize-identifier-list, objc-synthesize-identifier
27431 objc-synthesize-identifier
27432 identifier
27433 identifier = identifier
27435 For example:
27436 @synthesize MyProperty;
27437 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27439 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27440 for C. Keep them in sync.
27441 */
27442 static void
27444 {
27446 location_t loc;
27451 {
27455 {
27458 }
27460 {
27464 {
27467 }
27468 }
27469 else
27474 else
27476 }
27479 }
27481 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27483 objc-dynamic-declaration:
27484 @dynamic identifier-list ;
27486 For example:
27487 @dynamic MyProperty;
27488 @dynamic MyProperty, AnotherProperty;
27490 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27491 for C. Keep them in sync.
27492 */
27493 static void
27495 {
27497 location_t loc;
27502 {
27503 tree property;
27506 {
27509 }
27513 else
27515 }
27518 }
27520 \f
27521 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27523 /* Returns name of the next clause.
27524 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27525 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27526 returned and the token is consumed. */
27528 static pragma_omp_clause
27530 {
27544 {
27549 {
27692 }
27693 }
27699 }
27701 /* Validate that a clause of the given type does not already exist. */
27703 static void
27706 {
27707 tree c;
27711 {
27714 }
27715 }
27717 /* OpenMP 2.5:
27718 variable-list:
27719 identifier
27720 variable-list , identifier
27722 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27723 colon). An opening parenthesis will have been consumed by the caller.
27725 If KIND is nonzero, create the appropriate node and install the decl
27726 in OMP_CLAUSE_DECL and add the node to the head of the list.
27728 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27729 return the list created.
27731 COLON can be NULL if only closing parenthesis should end the list,
27732 or pointer to bool which will receive false if the list is terminated
27733 by closing parenthesis or true if the list is terminated by colon. */
27735 static tree
27738 {
27742 {
27745 }
27747 {
27764 {
27766 {
27769 {
27773 }
27774 /* FALL THROUGH. */
27780 {
27788 parser->colon_corrects_to_scope_p
27792 else
27793 {
27794 /* Look for `:'. */
27798 CPP_CLOSE_SQUARE))
27800 }
27801 /* Look for the closing `]'. */
27803 RT_CLOSE_SQUARE))
27807 {
27810 {
27814 }
27818 {
27822 }
27823 }
27826 }
27830 }
27836 }
27837 else
27840 get_comma:
27844 }
27850 {
27854 }
27857 {
27860 /* Try to resync to an unnested comma. Copied from
27861 cp_parser_parenthesized_expression_list. */
27862 skip_comma:
27871 }
27874 }
27876 /* Similarly, but expect leading and trailing parenthesis. This is a very
27877 common case for omp clauses. */
27879 static tree
27881 {
27885 }
27887 /* OpenACC 2.0:
27888 copy ( variable-list )
27889 copyin ( variable-list )
27890 copyout ( variable-list )
27891 create ( variable-list )
27892 delete ( variable-list )
27893 present ( variable-list )
27894 present_or_copy ( variable-list )
27895 pcopy ( variable-list )
27896 present_or_copyin ( variable-list )
27897 pcopyin ( variable-list )
27898 present_or_copyout ( variable-list )
27899 pcopyout ( variable-list )
27900 present_or_create ( variable-list )
27901 pcreate ( variable-list ) */
27903 static tree
27905 tree list)
27906 {
27909 {
27949 }
27957 }
27959 /* OpenACC 2.0:
27960 deviceptr ( variable-list ) */
27962 static tree
27964 {
27968 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27969 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
27970 variable-list must only allow for pointer variables. */
27973 {
27976 /* FIXME diagnostics: Ideally we should keep individual
27977 locations for all the variables in the var list to make the
27978 following errors more precise. Perhaps
27979 c_parser_omp_var_list_parens should construct a list of
27980 locations to go along with the var list. */
27985 ;
27994 }
27997 }
27999 /* OpenACC:
28000 vector_length ( expression ) */
28002 static tree
28004 {
28014 {
28017 }
28020 {
28025 }
28028 location);
28036 }
28038 /* OpenACC 2.0
28039 Parse wait clause or directive parameters. */
28041 static tree
28043 {
28053 {
28058 }
28065 {
28069 {
28072 else
28073 {
28080 }
28081 }
28082 }
28085 }
28087 /* OpenACC:
28088 wait ( int-expr-list ) */
28090 static tree
28092 {
28101 }
28103 /* OpenMP 3.0:
28104 collapse ( constant-expression ) */
28106 static tree
28108 {
28110 location_t loc;
28111 HOST_WIDE_INT n;
28131 {
28134 }
28142 }
28144 /* OpenMP 2.5:
28145 default ( shared | none ) */
28147 static tree
28149 {
28151 tree c;
28156 {
28161 {
28176 }
28179 }
28180 else
28181 {
28182 invalid_kind:
28184 }
28200 }
28202 /* OpenMP 3.1:
28203 final ( expression ) */
28205 static tree
28207 {
28228 }
28230 /* OpenMP 2.5:
28231 if ( expression ) */
28233 static tree
28235 {
28256 }
28258 /* OpenMP 3.1:
28259 mergeable */
28261 static tree
28264 {
28265 tree c;
28268 location);
28273 }
28275 /* OpenMP 2.5:
28276 nowait */
28278 static tree
28281 {
28282 tree c;
28289 }
28291 /* OpenACC:
28292 num_gangs ( expression ) */
28294 static tree
28296 {
28312 {
28315 }
28325 }
28327 /* OpenMP 2.5:
28328 num_threads ( expression ) */
28330 static tree
28332 location_t location)
28333 {
28355 }
28357 /* OpenACC:
28358 num_workers ( expression ) */
28360 static tree
28362 {
28378 {
28381 }
28384 location);
28392 }
28394 /* OpenMP 2.5:
28395 ordered */
28397 static tree
28400 {
28401 tree c;
28409 }
28411 /* OpenMP 2.5:
28412 reduction ( reduction-operator : variable-list )
28414 reduction-operator:
28415 One of: + * - & ^ | && ||
28417 OpenMP 3.1:
28419 reduction-operator:
28420 One of: + * - & ^ | && || min max
28422 OpenMP 4.0:
28424 reduction-operator:
28425 One of: + * - & ^ | && ||
28426 id-expression */
28428 static tree
28430 {
28438 {
28448 }
28452 else
28453 {
28464 {
28494 }
28495 else
28496 {
28498 resync_fail:
28503 }
28504 }
28510 NULL);
28512 {
28515 }
28518 }
28520 /* OpenMP 2.5:
28521 schedule ( schedule-kind )
28522 schedule ( schedule-kind , expression )
28524 schedule-kind:
28525 static | dynamic | guided | runtime | auto */
28527 static tree
28529 {
28538 {
28543 {
28564 }
28565 }
28570 else
28575 {
28590 else
28595 }
28603 invalid_kind:
28605 resync_fail:
28610 }
28612 /* OpenMP 3.0:
28613 untied */
28615 static tree
28618 {
28619 tree c;
28626 }
28628 /* OpenMP 4.0:
28629 inbranch
28630 notinbranch */
28632 static tree
28635 {
28640 }
28642 /* OpenMP 4.0:
28643 parallel
28644 for
28645 sections
28646 taskgroup */
28648 static tree
28652 {
28656 }
28658 /* OpenMP 4.0:
28659 num_teams ( expression ) */
28661 static tree
28663 location_t location)
28664 {
28686 }
28688 /* OpenMP 4.0:
28689 thread_limit ( expression ) */
28691 static tree
28693 location_t location)
28694 {
28716 }
28718 /* OpenMP 4.0:
28719 aligned ( variable-list )
28720 aligned ( variable-list : constant-expression ) */
28722 static tree
28724 {
28735 {
28745 }
28751 }
28753 /* OpenMP 4.0:
28754 linear ( variable-list )
28755 linear ( variable-list : expression ) */
28757 static tree
28760 {
28771 {
28775 {
28778 }
28786 }
28792 }
28794 /* OpenMP 4.0:
28795 safelen ( constant-expression ) */
28797 static tree
28799 location_t location)
28800 {
28821 }
28823 /* OpenMP 4.0:
28824 simdlen ( constant-expression ) */
28826 static tree
28828 location_t location)
28829 {
28850 }
28852 /* OpenMP 4.0:
28853 depend ( depend-kind : variable-list )
28855 depend-kind:
28856 in | out | inout */
28858 static tree
28860 {
28868 {
28878 else
28880 }
28881 else
28889 NULL);
28896 invalid_kind:
28898 resync_fail:
28903 }
28905 /* OpenMP 4.0:
28906 map ( map-kind : variable-list )
28907 map ( variable-list )
28909 map-kind:
28910 alloc | to | from | tofrom */
28912 static tree
28914 {
28923 {
28935 else
28936 {
28942 }
28945 }
28948 NULL);
28954 }
28956 /* OpenMP 4.0:
28957 device ( expression ) */
28959 static tree
28961 location_t location)
28962 {
28984 }
28986 /* OpenMP 4.0:
28987 dist_schedule ( static )
28988 dist_schedule ( static , expression ) */
28990 static tree
28992 location_t location)
28993 {
29006 {
29017 }
29022 location);
29026 invalid_kind:
29028 resync_fail:
29033 }
29035 /* OpenMP 4.0:
29036 proc_bind ( proc-bind-kind )
29038 proc-bind-kind:
29039 master | close | spread */
29041 static tree
29043 location_t location)
29044 {
29045 tree c;
29052 {
29062 else
29064 }
29065 else
29074 location);
29079 invalid_kind:
29081 resync_fail:
29086 }
29088 /* OpenACC:
29089 async [( int-expr )] */
29091 static tree
29093 {
29100 {
29109 }
29119 }
29121 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29122 is a bitmask in MASK. Return the list of clauses found. */
29124 static tree
29128 {
29133 {
29134 location_t here;
29135 pragma_omp_clause c_kind;
29146 {
29238 }
29243 {
29244 /* Remove the invalid clause(s) from the list to avoid
29245 confusing the rest of the compiler. */
29248 }
29249 }
29251 saw_error:
29258 }
29260 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29261 is a bitmask in MASK. Return the list of clauses found; the result
29262 of clause default goes in *pdefault. */
29264 static tree
29268 {
29275 {
29276 pragma_omp_clause c_kind;
29287 {
29299 clauses);
29313 clauses);
29322 clauses);
29346 clauses);
29360 clauses);
29377 OMP_CLAUSE_NOTINBRANCH,
29386 {
29387 clause_not_first:
29391 }
29416 clauses);
29421 clauses);
29426 clauses);
29489 }
29494 {
29495 /* Remove the invalid clause(s) from the list to avoid
29496 confusing the rest of the compiler. */
29499 }
29500 }
29501 saw_error:
29502 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29503 no reason to skip to the end. */
29509 }
29511 /* OpenMP 2.5:
29512 structured-block:
29513 statement
29515 In practice, we're also interested in adding the statement to an
29516 outer node. So it is convenient if we work around the fact that
29517 cp_parser_statement calls add_stmt. */
29519 static unsigned
29521 {
29524 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29525 This preserves the "not within loop or switch" style error messages
29526 for nonsense cases like
29527 void foo() {
29528 #pragma omp single
29529 break;
29530 }
29531 */
29536 }
29538 static void
29540 {
29542 }
29544 static tree
29546 {
29554 }
29556 /* OpenMP 2.5:
29557 # pragma omp atomic new-line
29558 expression-stmt
29560 expression-stmt:
29561 x binop= expr | x++ | ++x | x-- | --x
29562 binop:
29563 +, *, -, /, &, ^, |, <<, >>
29565 where x is an lvalue expression with scalar type.
29567 OpenMP 3.1:
29568 # pragma omp atomic new-line
29569 update-stmt
29571 # pragma omp atomic read new-line
29572 read-stmt
29574 # pragma omp atomic write new-line
29575 write-stmt
29577 # pragma omp atomic update new-line
29578 update-stmt
29580 # pragma omp atomic capture new-line
29581 capture-stmt
29583 # pragma omp atomic capture new-line
29584 capture-block
29586 read-stmt:
29587 v = x
29588 write-stmt:
29589 x = expr
29590 update-stmt:
29591 expression-stmt | x = x binop expr
29592 capture-stmt:
29593 v = expression-stmt
29594 capture-block:
29595 { v = x; update-stmt; } | { update-stmt; v = x; }
29597 OpenMP 4.0:
29598 update-stmt:
29599 expression-stmt | x = x binop expr | x = expr binop x
29600 capture-stmt:
29601 v = update-stmt
29602 capture-block:
29603 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29605 where x and v are lvalue expressions with scalar type. */
29607 static void
29609 {
29617 {
29622 {
29628 }
29629 }
29631 {
29643 else
29647 }
29649 {
29655 {
29660 {
29663 }
29664 }
29665 }
29669 {
29679 else
29684 {
29685 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29686 opcode. */
29691 }
29695 {
29698 }
29699 else
29700 {
29706 }
29709 }
29711 restart:
29715 {
29722 /* FALLTHROUGH */
29732 /* FALLTHROUGH */
29747 /* Undo effects of boolean_increment for post {in,de}crement. */
29749 /* FALLTHRU */
29753 {
29754 /* Undo effects of boolean_increment. */
29756 {
29757 /* This is pre or post increment. */
29762 && !structured_block
29766 }
29767 }
29768 /* FALLTHRU */
29771 {
29806 {
29810 }
29813 {
29819 {
29824 }
29826 {
29838 {
29840 {
29845 }
29846 else
29848 }
29852 }
29855 {
29862 }
29866 }
29870 {
29873 {
29881 }
29883 {
29888 }
29923 }
29934 /* FALLTHROUGH */
29939 }
29946 }
29947 stmt_done:
29949 {
29960 }
29962 {
29965 }
29966 done:
29972 saw_error:
29975 {
29979 {
29983 }
29984 }
29985 }
29988 /* OpenMP 2.5:
29989 # pragma omp barrier new-line */
29991 static void
29993 {
29996 }
29998 /* OpenMP 2.5:
29999 # pragma omp critical [(name)] new-line
30000 structured-block */
30002 static tree
30004 {
30008 {
30020 }
30025 }
30027 /* OpenMP 2.5:
30028 # pragma omp flush flush-vars[opt] new-line
30030 flush-vars:
30031 ( variable-list ) */
30033 static void
30035 {
30041 }
30043 /* Helper function, to parse omp for increment expression. */
30045 static tree
30047 {
30052 {
30055 }
30058 {
30067 /* Fall through: OpenMP disallows NE_EXPR. */
30070 }
30072 /* If decl is an iterator, preserve LHS and RHS of the relational
30073 expr until finish_omp_for. */
30083 }
30085 /* Helper function, to parse omp for increment expression. */
30087 static tree
30089 {
30093 cp_id_kind idk;
30097 {
30105 }
30113 {
30118 }
30125 {
30129 }
30141 do
30142 {
30149 {
30151 {
30154 else
30156 tf_warning_or_error);
30157 }
30158 else
30161 }
30162 }
30166 {
30170 }
30171 else
30175 }
30177 /* Parse the initialization statement of either an OpenMP for loop or
30178 a Cilk Plus for loop.
30180 Return true if the resulting construct should have an
30181 OMP_CLAUSE_PRIVATE added to it. */
30183 static bool
30191 {
30197 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30199 init-expr:
30200 var = lb
30201 integer-type var = lb
30202 random-access-iterator-type var = lb
30203 pointer-type var = lb
30204 */
30205 cp_decl_specifier_seq type_specifiers;
30207 /* First, try to parse as an initialized declaration. See
30208 cp_parser_condition, from whence the bulk of this is copied. */
30215 {
30216 /* If parsing a type specifier seq succeeded, then this
30217 MUST be a initialized declaration. */
30222 CP_PARSER_DECLARATOR_NAMED,
30233 else
30234 {
30244 {
30246 CPP_OPEN_PAREN))
30247 {
30251 else
30254 }
30255 else
30256 /* Trigger an error. */
30261 }
30265 {
30273 {
30276 auto_node);
30281 }
30284 asm_specification,
30285 LOOKUP_ONLYCONVERTING);
30287 {
30290 }
30291 else
30294 }
30295 else
30296 {
30297 /* Consume '='. */
30301 non_class:
30304 else
30307 asm_specification,
30308 LOOKUP_ONLYCONVERTING);
30309 }
30313 }
30314 }
30315 else
30316 {
30317 cp_id_kind idk;
30318 /* If parsing a type specifier sequence failed, then
30319 this MUST be a simple expression. */
30327 && decl
30330 {
30331 tree rhs;
30338 rhs,
30339 tf_warning_or_error));
30341 }
30342 else
30343 {
30348 {
30352 }
30353 }
30354 }
30356 }
30358 /* Parse the restricted form of the for statement allowed by OpenMP. */
30360 static tree
30363 {
30367 location_t loc_first;
30386 {
30389 location_t loc;
30393 {
30396 }
30399 {
30402 }
30411 add_private_clause
30418 {
30421 {
30427 }
30428 else
30430 }
30437 {
30442 {
30446 }
30449 {
30450 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30451 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30456 {
30459 }
30460 else
30461 {
30464 }
30468 }
30469 else
30470 {
30475 }
30476 }
30479 {
30480 tree c;
30482 {
30491 decl);
30495 decl);
30496 }
30498 {
30503 {
30506 }
30507 }
30508 }
30517 {
30518 /* If decl is an iterator, preserve the operator on decl
30519 until finish_omp_for. */
30521 && ((processing_template_decl
30525 else
30529 }
30544 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30545 in between the collapsed for loops to be still considered perfectly
30546 nested. Hopefully the final version clarifies this.
30547 For now handle (multiple) {'s and empty statements. */
30549 do
30550 {
30554 {
30556 bracecount++;
30557 }
30561 else
30562 {
30569 }
30570 }
30574 {
30577 }
30578 }
30580 /* Note that we saved the original contents of this flag when we entered
30581 the structured block, and so we don't need to re-save it here. */
30584 else
30587 /* Note that the grammar doesn't call for a structured block here,
30588 though the loop as a whole is a structured block. */
30595 else
30600 {
30602 {
30604 nbraces--;
30605 }
30608 else
30609 {
30611 {
30614 }
30619 }
30620 }
30627 }
30629 /* Helper function for OpenMP parsing, split clauses and call
30630 finish_omp_clauses on each of the set of clauses afterwards. */
30632 static void
30635 {
30641 }
30643 /* OpenMP 4.0:
30644 #pragma omp simd simd-clause[optseq] new-line
30645 for-loop */
30647 #define OMP_SIMD_CLAUSE_MASK \
30648 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30656 static tree
30659 {
30671 {
30674 }
30685 }
30687 /* OpenMP 2.5:
30688 #pragma omp for for-clause[optseq] new-line
30689 for-loop
30691 OpenMP 4.0:
30692 #pragma omp for simd for-simd-clause[optseq] new-line
30693 for-loop */
30695 #define OMP_FOR_CLAUSE_MASK \
30696 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30705 static tree
30708 {
30719 {
30724 {
30732 cclauses);
30736 cclauses);
30748 }
30749 }
30751 {
30754 }
30759 {
30762 }
30773 }
30775 /* OpenMP 2.5:
30776 # pragma omp master new-line
30777 structured-block */
30779 static tree
30781 {
30785 }
30787 /* OpenMP 2.5:
30788 # pragma omp ordered new-line
30789 structured-block */
30791 static tree
30793 {
30797 }
30799 /* OpenMP 2.5:
30801 section-scope:
30802 { section-sequence }
30804 section-sequence:
30805 section-directive[opt] structured-block
30806 section-sequence section-directive structured-block */
30808 static tree
30810 {
30821 {
30825 }
30828 {
30836 {
30840 }
30842 {
30845 }
30850 }
30861 }
30863 /* OpenMP 2.5:
30864 # pragma omp sections sections-clause[optseq] newline
30865 sections-scope */
30867 #define OMP_SECTIONS_CLAUSE_MASK \
30868 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30874 static tree
30877 {
30889 {
30892 }
30899 }
30901 /* OpenMP 2.5:
30902 # pragma omp parallel parallel-clause[optseq] new-line
30903 structured-block
30904 # pragma omp parallel for parallel-for-clause[optseq] new-line
30905 structured-block
30906 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30907 structured-block
30909 OpenMP 4.0:
30910 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30911 structured-block */
30913 #define OMP_PARALLEL_CLAUSE_MASK \
30914 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30924 static tree
30927 {
30936 {
30949 block);
30954 }
30956 {
30960 }
30962 {
30965 }
30967 {
30971 {
30981 block);
30984 }
30985 }
30995 }
30997 /* OpenMP 2.5:
30998 # pragma omp single single-clause[optseq] new-line
30999 structured-block */
31001 #define OMP_SINGLE_CLAUSE_MASK \
31002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31007 static tree
31009 {
31019 }
31021 /* OpenMP 3.0:
31022 # pragma omp task task-clause[optseq] new-line
31023 structured-block */
31025 #define OMP_TASK_CLAUSE_MASK \
31026 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31036 static tree
31038 {
31049 }
31051 /* OpenMP 3.0:
31052 # pragma omp taskwait new-line */
31054 static void
31056 {
31059 }
31061 /* OpenMP 3.1:
31062 # pragma omp taskyield new-line */
31064 static void
31066 {
31069 }
31071 /* OpenMP 4.0:
31072 # pragma omp taskgroup new-line
31073 structured-block */
31075 static tree
31077 {
31081 }
31084 /* OpenMP 2.5:
31085 # pragma omp threadprivate (variable-list) */
31087 static void
31089 {
31090 tree vars;
31096 }
31098 /* OpenMP 4.0:
31099 # pragma omp cancel cancel-clause[optseq] new-line */
31101 #define OMP_CANCEL_CLAUSE_MASK \
31102 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31108 static void
31110 {
31114 }
31116 /* OpenMP 4.0:
31117 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31119 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31120 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31125 static void
31127 {
31128 tree clauses;
31132 {
31137 {
31140 }
31141 }
31143 {
31147 }
31150 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31152 pragma_tok);
31154 }
31156 /* OpenMP 4.0:
31157 #pragma omp distribute distribute-clause[optseq] new-line
31158 for-loop */
31160 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31161 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31166 static tree
31169 {
31178 {
31186 else
31189 {
31195 {
31198 cclauses);
31199 else
31201 cclauses);
31202 }
31207 cclauses);
31208 else
31210 cclauses);
31222 }
31223 }
31225 {
31228 }
31233 {
31236 }
31247 }
31249 /* OpenMP 4.0:
31250 # pragma omp teams teams-clause[optseq] new-line
31251 structured-block */
31253 #define OMP_TEAMS_CLAUSE_MASK \
31254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31262 static tree
31265 {
31274 {
31278 {
31286 cclauses);
31290 cclauses);
31301 }
31302 }
31304 {
31307 }
31312 {
31315 }
31323 }
31325 /* OpenMP 4.0:
31326 # pragma omp target data target-data-clause[optseq] new-line
31327 structured-block */
31329 #define OMP_TARGET_DATA_CLAUSE_MASK \
31330 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31334 static tree
31336 {
31348 }
31350 /* OpenMP 4.0:
31351 # pragma omp target update target-update-clause[optseq] new-line */
31353 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31354 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31359 static bool
31362 {
31364 {
31366 "%<#pragma omp target update%> may only be "
31370 }
31372 tree clauses
31377 {
31379 "%<#pragma omp target update must contain at least one "
31382 }
31390 }
31392 /* OpenMP 4.0:
31393 # pragma omp target target-clause[optseq] new-line
31394 structured-block */
31396 #define OMP_TARGET_CLAUSE_MASK \
31397 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31401 static bool
31404 {
31406 {
31410 }
31413 {
31418 {
31426 {
31428 OMP_TARGET_CLAUSE_MASK,
31429 cclauses);
31431 }
31447 }
31449 {
31452 }
31454 {
31458 }
31460 {
31463 }
31464 }
31478 }
31480 /* OpenACC 2.0:
31481 # pragma acc cache (variable-list) new-line
31482 */
31484 static tree
31486 {
31501 }
31503 /* OpenACC 2.0:
31504 # pragma acc data oacc-data-clause[optseq] new-line
31505 structured-block */
31507 #define OACC_DATA_CLAUSE_MASK \
31508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31520 static tree
31522 {
31535 }
31537 /* OpenACC 2.0:
31538 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31540 or
31542 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31544 LOC is the location of the #pragma token.
31545 */
31547 #define OACC_ENTER_DATA_CLAUSE_MASK \
31548 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31556 #define OACC_EXIT_DATA_CLAUSE_MASK \
31557 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31563 static tree
31566 {
31571 {
31577 }
31582 {
31586 }
31593 else
31598 {
31602 }
31608 else
31613 }
31615 /* OpenACC 2.0:
31616 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31617 structured-block */
31619 #define OACC_KERNELS_CLAUSE_MASK \
31620 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31634 static tree
31636 {
31649 }
31651 /* OpenACC 2.0:
31652 # pragma acc loop oacc-loop-clause[optseq] new-line
31653 structured-block */
31655 #define OACC_LOOP_CLAUSE_MASK \
31656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31659 static tree
31661 {
31674 }
31676 /* OpenACC 2.0:
31677 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31678 structured-block */
31680 #define OACC_PARALLEL_CLAUSE_MASK \
31681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31699 static tree
31701 {
31714 }
31716 /* OpenACC 2.0:
31717 # pragma acc update oacc-update-clause[optseq] new-line
31718 */
31720 #define OACC_UPDATE_CLAUSE_MASK \
31721 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31728 static tree
31730 {
31737 {
31739 "%<#pragma acc update%> must contain at least one "
31742 }
31750 }
31752 /* OpenACC 2.0:
31753 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31755 LOC is the location of the #pragma token.
31756 */
31758 #define OACC_WAIT_CLAUSE_MASK \
31759 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31761 static tree
31763 {
31776 }
31778 /* OpenMP 4.0:
31779 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31781 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31789 static void
31792 {
31794 cp_omp_declare_simd_data data;
31796 {
31801 }
31812 {
31816 {
31829 }
31834 "%<#pragma omp declare simd%> not immediately followed by "
31838 }
31839 }
31841 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31842 This function is modelled similar to the late parsing of omp declare
31843 simd. */
31845 static tree
31847 {
31853 {
31859 }
31861 {
31865 }
31870 {
31877 NULL);
31891 }
31896 }
31898 /* Finalize #pragma omp declare simd clauses after direct declarator has
31899 been parsed, and put that into "omp declare simd" attribute. */
31901 static tree
31903 {
31909 {
31914 }
31919 {
31937 }
31941 }
31944 /* OpenMP 4.0:
31945 # pragma omp declare target new-line
31946 declarations and definitions
31947 # pragma omp end declare target new-line */
31949 static void
31951 {
31954 }
31956 static void
31958 {
31961 {
31964 }
31966 {
31970 {
31973 }
31976 else
31977 {
31981 }
31982 }
31983 else
31984 {
31988 }
31992 "%<#pragma omp end declare target%> without corresponding "
31994 else
31996 }
31998 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31999 expression and optional initializer clause of
32000 #pragma omp declare reduction. We store the expression(s) as
32001 either 3, 6 or 7 special statements inside of the artificial function's
32002 body. The first two statements are DECL_EXPRs for the artificial
32003 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32004 expression that uses those variables.
32005 If there was any INITIALIZER clause, this is followed by further statements,
32006 the fourth and fifth statements are DECL_EXPRs for the artificial
32007 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32008 constructor variant (first token after open paren is not omp_priv),
32009 then the sixth statement is a statement with the function call expression
32010 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32011 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32012 to initialize the OMP_PRIV artificial variable and there is seventh
32013 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32015 static bool
32017 {
32029 tree combiner;
32044 {
32047 }
32050 {
32057 {
32060 }
32076 {
32080 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32084 == CPP_CLOSE_PAREN
32087 {
32091 }
32096 }
32097 else
32098 {
32114 {
32119 }
32121 tree arg;
32134 }
32145 }
32151 }
32153 /* OpenMP 4.0
32154 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32155 initializer-clause[opt] new-line
32157 initializer-clause:
32158 initializer (omp_priv initializer)
32159 initializer (function-name (argument-list)) */
32161 static void
32164 {
32174 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32181 {
32213 }
32225 /* Types may not be defined in declare reduction type list. */
32228 parser->type_definition_forbidden_message
32234 saved_colon_doesnt_start_class_def_p
32239 {
32243 ;
32264 else
32269 else
32271 }
32273 /* Restore the saved message. */
32276 parser->colon_doesnt_start_class_def_p
32281 {
32282 fail:
32285 }
32291 {
32292 tree fntype
32295 NULL_TREE);
32314 {
32319 }
32321 {
32323 {
32332 }
32339 }
32340 else
32341 {
32344 }
32347 else
32350 {
32353 }
32355 {
32358 else
32363 }
32368 else
32369 {
32378 }
32385 }
32389 done:
32390 /* Free any declarators allocated. */
32392 }
32394 /* OpenMP 4.0
32395 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32396 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32397 initializer-clause[opt] new-line
32398 #pragma omp declare target new-line */
32400 static void
32403 {
32405 {
32410 {
32413 context);
32415 }
32418 {
32421 context);
32423 }
32425 {
32428 }
32430 {
32434 }
32435 }
32439 }
32441 /* Main entry point to OpenMP statement pragmas. */
32443 static void
32445 {
32446 tree stmt;
32451 {
32526 }
32530 }
32531 \f
32532 /* Transactional Memory parsing routines. */
32534 /* Parse a transaction attribute.
32536 txn-attribute:
32537 attribute
32538 [ [ identifier ] ]
32540 ??? Simplify this when C++0x bracket attributes are
32541 implemented properly. */
32543 static tree
32545 {
32560 {
32564 /* For keywords, use the canonical spelling,
32565 not the parsed identifier. */
32569 }
32570 else
32574 error1:
32577 }
32579 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32581 transaction-statement:
32582 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32583 compound-statement
32584 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32585 */
32587 static tree
32589 {
32604 else
32605 {
32609 }
32611 /* Parse a noexcept specification. */
32614 /* Keep track if we're in the lexical scope of an outer transaction. */
32626 }
32628 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32630 transaction-expression:
32631 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32632 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32633 */
32635 static tree
32637 {
32662 /* Set this early. This might mean that we allow transaction_cancel in
32663 an expression that we find out later actually has to be a constexpr.
32664 However, we expect that cxx_constant_value will be able to deal with
32665 this; also, if the noexcept has no constexpr, then what we parse next
32666 really is a transaction's body. */
32669 /* Parse a noexcept specification. */
32675 {
32682 }
32683 else
32684 {
32685 /* The only expression that is available got parsed for the noexcept
32686 already. noexcept is true then. */
32689 }
32698 }
32700 /* Parse a function-transaction-block.
32702 function-transaction-block:
32703 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32704 function-body
32705 __transaction_atomic txn-attribute[opt] function-try-block
32706 __transaction_relaxed ctor-initializer[opt] function-body
32707 __transaction_relaxed function-try-block
32708 */
32710 static bool
32712 {
32728 else
32729 {
32733 }
32741 else
32742 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32750 }
32752 /* Parse a __transaction_cancel statement.
32754 cancel-statement:
32755 __transaction_cancel txn-attribute[opt] ;
32756 __transaction_cancel txn-attribute[opt] throw-expression ;
32758 ??? Cancel and throw is not yet implemented. */
32760 static tree
32762 {
32768 RT_TRANSACTION_CANCEL);
32775 /* ??? Parse cancel-and-throw here. */
32780 {
32784 }
32786 {
32790 }
32792 {
32795 {
32801 }
32802 }
32804 {
32808 }
32814 }
32815 \f
32816 /* The parser. */
32820 \f
32821 /* Special handling for the first token or line in the file. The first
32822 thing in the file might be #pragma GCC pch_preprocess, which loads a
32823 PCH file, which is a GC collection point. So we need to handle this
32824 first pragma without benefit of an existing lexer structure.
32826 Always returns one token to the caller in *FIRST_TOKEN. This is
32827 either the true first token of the file, or the first token after
32828 the initial pragma. */
32830 static void
32832 {
32841 {
32848 }
32849 else
32852 /* Skip to the end of the pragma. */
32856 /* Now actually load the PCH file. */
32860 /* Read one more token to return to our caller. We have to do this
32861 after reading the PCH file in, since its pointers have to be
32862 live. */
32864 }
32866 /* Parses the grainsize pragma for the _Cilk_for statement.
32867 Syntax:
32868 #pragma cilk grainsize = <VALUE>. */
32870 static void
32872 {
32874 {
32879 {
32882 }
32884 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32887 else
32889 "%<#pragma cilk grainsize%> is not followed by "
32892 }
32894 }
32896 /* Normal parsing of a pragma token. Here we can (and must) use the
32897 regular lexer. */
32899 static bool
32901 {
32913 {
32921 {
32931 }
32936 {
32946 }
32951 {
32957 "%<#pragma omp taskwait%> may only be "
32962 }
32967 {
32973 "%<#pragma omp taskyield%> may only be "
32978 }
32983 {
32989 "%<#pragma omp cancel%> may only be "
32994 }
32999 {
33005 "%<#pragma omp cancellation point%> may only be "
33010 }
33057 "%<#pragma omp section%> may only be used in "
33062 {
33069 {
33072 }
33075 }
33079 {
33083 }
33089 {
33093 }
33095 /* Ignore the pragma if Cilk Plus is not enabled. */
33097 {
33100 }
33101 else
33102 {
33106 }
33113 bad_stmt:
33116 }
33120 }
33122 /* The interface the pragma parsers have to the lexer. */
33124 enum cpp_ttype
33126 {
33139 else
33140 {
33144 }
33147 }
33149 \f
33150 /* External interface. */
33152 /* Parse one entire translation unit. */
33154 void
33156 {
33169 }
33171 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33172 vectorlength clause:
33173 Syntax:
33174 vectorlength ( constant-expression ) */
33176 static tree
33179 {
33181 tree expr;
33182 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33183 safelen clause. Thus, vectorlength is represented as OMP 4.0
33184 safelen. For SIMD-enabled function it is represented by OMP 4.0
33185 simdlen. */
33188 loc);
33189 else
33191 loc);
33199 /* If expr == error_mark_node, then don't emit any errors nor
33200 create a clause. if any of the above functions returns
33201 error mark node then they would have emitted an error message. */
33203 ;
33211 else
33212 {
33213 tree c;
33215 {
33220 }
33221 else
33222 {
33227 }
33228 }
33233 }
33235 /* Handles the Cilk Plus #pragma simd linear clause.
33236 Syntax:
33237 linear ( simd-linear-variable-list )
33239 simd-linear-variable-list:
33240 simd-linear-variable
33241 simd-linear-variable-list , simd-linear-variable
33243 simd-linear-variable:
33244 id-expression
33245 id-expression : simd-linear-step
33247 simd-linear-step:
33248 conditional-expression */
33250 static tree
33252 {
33258 {
33262 }
33267 {
33270 {
33274 }
33281 {
33285 }
33286 else
33287 {
33291 /* If present, parse the linear step. Otherwise, assume the default
33292 value of 1. */
33294 {
33301 {
33302 /* If an error has occurred, then the whole pragma is
33303 considered ill-formed. Thus, no reason to keep
33304 parsing. */
33307 }
33315 else
33317 "step size must be an integer constant "
33319 }
33321 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33327 }
33332 else
33333 {
33338 }
33339 }
33343 }
33345 /* Returns the name of the next clause. If the clause is not
33346 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33347 token is not consumed. Otherwise, the appropriate enum from the
33348 pragma_simd_clause is returned and the token is consumed. */
33350 static pragma_omp_clause
33352 {
33353 pragma_omp_clause clause_type;
33370 else
33375 }
33377 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33379 static tree
33381 {
33386 {
33387 pragma_omp_clause c_kind;
33394 /* Use the OpenMP 4.0 equivalent function. */
33397 /* Use the OpenMP 4.0 equivalent function. */
33399 clauses);
33401 /* Use the OMP 4.0 equivalent function. */
33403 clauses);
33405 /* Use the OMP 4.0 equivalent function. */
33407 else
33408 {
33412 }
33413 }
33419 else
33421 }
33423 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33425 static void
33427 {
33434 {
33438 }
33447 }
33449 /* Main entry-point for parsing Cilk Plus _Cilk_for
33450 loops. The return value is error_mark_node
33451 when errors happen and CILK_FOR tree on success. */
33453 static tree
33455 {
33470 else
33476 }
33478 /* Create an identifier for a generic parameter type (a synthesized
33479 template parameter implied by `auto' or a concept identifier). */
33482 static tree
33484 {
33488 }
33490 /* Predicate that behaves as is_auto_or_concept but matches the parent
33491 node of the generic type rather than the generic type itself. This
33492 allows for type transformation in add_implicit_template_parms. */
33496 {
33498 }
33500 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33501 (creating a new template parameter list if necessary). Returns the newly
33502 created template type parm. */
33504 tree
33506 {
33509 /* We are either continuing a function template that already contains implicit
33510 template parameters, creating a new fully-implicit function template, or
33511 extending an existing explicit function template with implicit template
33512 parameters. */
33520 {
33524 }
33525 else
33526 {
33527 /* Roll back to the existing template parameter scope (in the case of
33528 extending an explicit function template) or introduce a new template
33529 parameter scope ahead of the function parameter scope (or class scope
33530 in the case of out-of-line member definitions). The function scope is
33531 added back after template parameter synthesis below. */
33536 {
33539 }
33541 {
33542 /* If not defining a class, then any class scope is a scope level in
33543 an out-of-line member definition. In this case simply wind back
33544 beyond the first such scope to inject the template parameter list.
33545 Otherwise wind back to the class being defined. The latter can
33546 occur in class member friend declarations such as:
33548 class A {
33549 void foo (auto);
33550 };
33551 class B {
33552 friend void A::foo (auto);
33553 };
33555 The template parameter list synthesized for the friend declaration
33556 must be injected in the scope of 'B'. This can also occur in
33557 erroneous cases such as:
33559 struct A {
33560 struct B {
33561 void foo (auto);
33562 };
33563 void B::foo (auto) {}
33564 };
33566 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33567 but, nevertheless, the template parameter list synthesized for the
33568 declarator should be injected into the scope of 'A' as if the
33569 ill-formed template was specified explicitly. */
33572 {
33575 }
33576 }
33582 {
33583 /* Introduce a new template parameter list for implicit template
33584 parameters. */
33588 parser->implicit_template_scope
33595 }
33596 else
33597 {
33598 /* Synthesize implicit template parameters at the end of the explicit
33599 template parameter list. */
33606 parser->implicit_template_parms
33608 }
33609 }
33611 /* Synthesize a new template parameter and track the current template
33612 parameter chain with implicit_template_parms. */
33616 synth_id);
33617 tree new_parm
33619 input_location,
33626 parser->implicit_template_parms
33628 else
33633 /* If creating a fully implicit function template, start the new implicit
33634 template parameter list with this synthesized type, otherwise grow the
33635 current template parameter list. */
33638 {
33645 }
33646 else
33647 {
33652 }
33657 }
33659 /* Finish the declaration of a fully implicit function template. Such a
33660 template has no explicit template parameter list so has not been through the
33661 normal template head and tail processing. synthesize_implicit_template_parm
33662 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33663 provided if the declaration is a class member such that its template
33664 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33665 form is returned. Otherwise NULL_TREE is returned. */
33667 tree
33669 {
33674 {
33678 }
33688 }