| blob | cfb512be8e745cff6c0b670d5f5edb5f64c36a52 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
65 \f
66 /* The lexer. */
68 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
69 and c-lex.c) and the C++ parser. */
72 {
74 };
76 /* The various kinds of non integral constant we encounter. */
78 NIC_NONE,
79 /* floating-point literal */
80 NIC_FLOAT,
81 /* %<this%> */
82 NIC_THIS,
83 /* %<__FUNCTION__%> */
84 NIC_FUNC_NAME,
85 /* %<__PRETTY_FUNCTION__%> */
86 NIC_PRETTY_FUNC,
87 /* %<__func__%> */
88 NIC_C99_FUNC,
89 /* "%<va_arg%> */
90 NIC_VA_ARG,
91 /* a cast */
92 NIC_CAST,
93 /* %<typeid%> operator */
94 NIC_TYPEID,
95 /* non-constant compound literals */
96 NIC_NCC,
97 /* a function call */
98 NIC_FUNC_CALL,
99 /* an increment */
100 NIC_INC,
101 /* an decrement */
102 NIC_DEC,
103 /* an array reference */
104 NIC_ARRAY_REF,
105 /* %<->%> */
106 NIC_ARROW,
107 /* %<.%> */
108 NIC_POINT,
109 /* the address of a label */
110 NIC_ADDR_LABEL,
111 /* %<*%> */
112 NIC_STAR,
113 /* %<&%> */
114 NIC_ADDR,
115 /* %<++%> */
116 NIC_PREINCREMENT,
117 /* %<--%> */
118 NIC_PREDECREMENT,
119 /* %<new%> */
120 NIC_NEW,
121 /* %<delete%> */
122 NIC_DEL,
123 /* calls to overloaded operators */
124 NIC_OVERLOADED,
125 /* an assignment */
126 NIC_ASSIGNMENT,
127 /* a comma operator */
128 NIC_COMMA,
129 /* a call to a constructor */
130 NIC_CONSTRUCTOR,
131 /* a transaction expression */
132 NIC_TRANSACTION
135 /* The various kinds of errors about name-lookup failing. */
137 /* NULL */
138 NLE_NULL,
139 /* is not a type */
140 NLE_TYPE,
141 /* is not a class or namespace */
142 NLE_CXX98,
143 /* is not a class, namespace, or enumeration */
144 NLE_NOT_CXX98
147 /* The various kinds of required token */
149 RT_NONE,
171 /* The type is CPP_KEYWORD */
200 RT_TRANSACTION_CANCEL /* __transaction_cancel */
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static tree cp_literal_operator_id
257 static void cp_parser_cilk_simd
259 static tree cp_parser_cilk_for
261 static bool cp_parser_omp_declare_reduction_exprs
263 static tree cp_parser_cilk_simd_vectorlength
266 /* Manifest constants. */
267 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
268 #define CP_SAVED_TOKEN_STACK 5
270 /* Variables. */
272 /* The stream to which debugging output should be written. */
275 /* Nonzero if we are parsing an unevaluated operand: an operand to
276 sizeof, typeof, or alignof. */
279 /* Dump up to NUM tokens in BUFFER to FILE starting with token
280 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
281 first token in BUFFER. If NUM is 0, dump all the tokens. If
282 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
283 highlighted by surrounding it in [[ ]]. */
285 static void
289 {
306 {
309 }
314 {
321 nprinted++;
331 {
341 }
342 }
345 {
348 }
351 }
354 /* Dump all tokens in BUFFER to stderr. */
356 void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
366 }
368 DEBUG_FUNCTION void
370 {
373 else
375 }
378 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
379 description for T. */
381 static void
383 {
385 {
388 }
389 }
392 /* Dump parser context C to FILE. */
394 static void
396 {
401 }
404 /* Print the stack of parsing contexts to FILE starting with FIRST. */
406 static void
408 {
414 {
417 }
418 }
421 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
423 static void
425 {
428 }
431 /* Print an unparsed function entry UF to FILE. */
433 static void
435 {
438 tree fn;
443 i++)
444 {
450 }
455 {
458 }
464 {
467 }
469 }
472 /* Print the stack of unparsed member functions S to FILE. */
474 static void
477 {
483 {
486 }
487 }
490 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
491 the given PARSER. If FILE is NULL, the output is printed on stderr. */
493 static void
495 {
507 next_token);
508 }
511 /* Dump debugging information for the given PARSER. If FILE is NULL,
512 the output is printed on stderr. */
514 void
516 {
519 expanded_location eloc;
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* Returns nonzero if debugging information should be output. */
717 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
757 }
759 /* nonzero if we are presently saving tokens. */
763 {
765 }
767 /* Store the next token from the preprocessor in *TOKEN. Return true
768 if we reach EOF. If LEXER is NULL, assume we are handling an
769 initial #pragma pch_preprocess, and thus want the lexer to return
770 processed strings. */
772 static void
774 {
777 /* Get a new token from the preprocessor. */
778 token->type
786 /* On some systems, some header files are surrounded by an
787 implicit extern "C" block. Set a flag in the token if it
788 comes from such a header. */
793 /* Check to see if this token is a keyword. */
795 {
797 {
798 /* Mark this token as a keyword. */
800 /* Record which keyword. */
802 }
803 else
804 {
808 {
809 /* Warn about the C++0x keyword (but still treat it as
810 an identifier). */
815 /* Clear out the C_RID_CODE so we don't warn about this
816 particular identifier-turned-keyword again. */
818 }
821 }
822 }
824 {
825 /* This only happens in Objective-C++; it must be a keyword. */
828 {
829 /* Replace 'class' with '@class', 'private' with '@private',
830 etc. This prevents confusion with the C++ keyword
831 'class', and makes the tokens consistent with other
832 Objective-C 'AT' keywords. For example '@class' is
833 reported as RID_AT_CLASS which is consistent with
834 '@synchronized', which is reported as
835 RID_AT_SYNCHRONIZED.
836 */
845 }
846 }
848 {
849 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if the next token is a keyword for a decl-specifier. */
935 static bool
937 {
942 {
943 /* auto specifier: storage-class-specifier in C++,
944 simple-type-specifier in C++0x. */
946 /* Storage classes. */
952 /* Elaborated type specifiers. */
958 /* Simple type specifiers. */
972 /* GNU extensions. */
975 /* C++0x extensions. */
986 }
987 }
989 /* Returns TRUE iff the token T begins a decltype type. */
991 static bool
993 {
996 }
998 /* Returns TRUE iff the next token begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Return a pointer to the Nth token in the token stream. If N is 1,
1008 then this is precisely equivalent to cp_lexer_peek_token (except
1009 that it is not inline). One would like to disallow that case, but
1010 there is one case (cp_parser_nth_token_starts_template_id) where
1011 the caller passes a variable for N and it might be 1. */
1015 {
1018 /* N is 1-based, not zero-based. */
1029 {
1032 {
1035 }
1039 }
1042 {
1045 }
1048 }
1050 /* Return the next token, and advance the lexer's next_token pointer
1051 to point to the next non-purged token. */
1055 {
1061 do
1062 {
1065 {
1068 }
1070 }
1075 /* Provide debugging output. */
1077 {
1081 }
1084 }
1086 /* Permanently remove the next token from the token stream, and
1087 advance the next_token pointer to refer to the next non-purged
1088 token. */
1090 static void
1092 {
1101 do
1102 {
1103 tok++;
1105 {
1108 }
1109 }
1112 }
1114 /* Permanently remove all tokens after TOK, up to, but not
1115 including, the token that will be returned next by
1116 cp_lexer_peek_token. */
1118 static void
1120 {
1129 {
1134 }
1135 }
1137 /* Begin saving tokens. All tokens consumed after this point will be
1138 preserved. */
1140 static void
1142 {
1143 /* Provide debugging output. */
1148 }
1150 /* Commit to the portion of the token stream most recently saved. */
1152 static void
1154 {
1155 /* Provide debugging output. */
1160 }
1162 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1163 to the token stream. Stop saving tokens. */
1165 static void
1167 {
1168 /* Provide debugging output. */
1173 }
1175 /* RAII wrapper around the above functions, with sanity checking. Creating
1176 a variable saves tokens, which are committed when the variable is
1177 destroyed unless they are explicitly rolled back by calling the rollback
1178 member function. */
1180 struct saved_token_sentinel
1181 {
1186 {
1189 }
1191 {
1194 }
1196 {
1200 }
1201 };
1203 /* Print a representation of the TOKEN on the STREAM. */
1205 static void
1207 {
1208 /* We don't use cpp_type2name here because the parser defines
1209 a few tokens of its own. */
1211 /* cpplib-defined token types */
1212 #define OP(e, s) #e,
1213 #define TK(e, s) #e,
1214 TTYPE_TABLE
1215 #undef OP
1216 #undef TK
1217 /* C++ parser token types - see "Manifest constants", above. */
1221 };
1223 /* For some tokens, print the associated data. */
1225 {
1227 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1228 For example, `struct' is mapped to an INTEGER_CST. */
1231 /* else fall through */
1249 /* If we have a name for the token, print it out. Otherwise, we
1250 simply give the numeric code. */
1253 else
1256 }
1257 }
1259 DEBUG_FUNCTION void
1261 {
1264 }
1266 DEBUG_FUNCTION void
1268 {
1271 else
1273 }
1276 /* Start emitting debugging information. */
1278 static void
1280 {
1283 }
1285 /* Stop emitting debugging information. */
1287 static void
1289 {
1292 }
1294 /* Create a new cp_token_cache, representing a range of tokens. */
1298 {
1303 }
1305 /* Diagnose if #pragma omp declare simd isn't followed immediately
1306 by function declaration or definition. */
1310 {
1312 {
1316 }
1317 }
1319 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1320 and put that into "omp declare simd" attribute. */
1324 {
1326 {
1328 {
1331 }
1333 {
1336 }
1337 }
1338 }
1339 \f
1340 /* Decl-specifiers. */
1342 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1344 static void
1346 {
1348 }
1350 /* Declarators. */
1352 /* Nothing other than the parser should be creating declarators;
1353 declarators are a semi-syntactic representation of C++ entities.
1354 Other parts of the front end that need to create entities (like
1355 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1370 /* An erroneous declarator. */
1373 /* The obstack on which declarators and related data structures are
1374 allocated. */
1377 /* Alloc BYTES from the declarator memory pool. */
1381 {
1383 }
1385 /* Allocate a declarator of the indicated KIND. Clear fields that are
1386 common to all declarators. */
1390 {
1402 }
1404 /* Make a declarator for a generalized identifier. If
1405 QUALIFYING_SCOPE is non-NULL, the identifier is
1406 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1407 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1408 is, if any. */
1412 special_function_kind sfk)
1413 {
1416 /* It is valid to write:
1418 class C { void f(); };
1419 typedef C D;
1420 void D::f();
1422 The standard is not clear about whether `typedef const C D' is
1423 legal; as of 2002-09-15 the committee is considering that
1424 question. EDG 3.0 allows that syntax. Therefore, we do as
1425 well. */
1439 }
1441 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1442 of modifiers such as const or volatile to apply to the pointer
1443 type, represented as identifiers. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1448 tree attributes)
1449 {
1457 {
1461 }
1462 else
1468 }
1470 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1471 represent the attributes that appertain to the pointer or
1472 reference. */
1474 cp_declarator *
1477 {
1485 {
1489 }
1490 else
1496 }
1498 /* Like make_pointer_declarator -- but for a pointer to a non-static
1499 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1500 appertain to the pointer or reference. */
1502 cp_declarator *
1505 tree attributes)
1506 {
1515 {
1518 }
1519 else
1525 }
1527 /* Make a declarator for the function given by TARGET, with the
1528 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1529 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1530 indicates what exceptions can be thrown. */
1532 cp_declarator *
1534 tree parms,
1535 cp_cv_quals cv_qualifiers,
1536 cp_virt_specifiers virt_specifiers,
1537 cp_ref_qualifier ref_qualifier,
1538 tree exception_specification,
1539 tree late_return_type)
1540 {
1552 {
1556 }
1557 else
1561 }
1563 /* Make a declarator for an array of BOUNDS elements, each of which is
1564 defined by ELEMENT. */
1566 cp_declarator *
1568 {
1575 {
1579 }
1580 else
1584 }
1586 /* Determine whether the declarator we've seen so far can be a
1587 parameter pack, when followed by an ellipsis. */
1588 static bool
1590 {
1591 /* Search for a declarator name, or any other declarator that goes
1592 after the point where the ellipsis could appear in a parameter
1593 pack. If we find any of these, then this declarator can not be
1594 made into a parameter pack. */
1597 {
1599 {
1611 }
1612 }
1615 }
1619 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1620 DECLARATOR and DEFAULT_ARGUMENT. */
1622 cp_parameter_declarator *
1625 tree default_argument)
1626 {
1634 else
1641 }
1643 /* Returns true iff DECLARATOR is a declaration for a function. */
1645 static bool
1647 {
1649 {
1657 }
1659 }
1661 /* The parser. */
1663 /* Overview
1664 --------
1666 A cp_parser parses the token stream as specified by the C++
1667 grammar. Its job is purely parsing, not semantic analysis. For
1668 example, the parser breaks the token stream into declarators,
1669 expressions, statements, and other similar syntactic constructs.
1670 It does not check that the types of the expressions on either side
1671 of an assignment-statement are compatible, or that a function is
1672 not declared with a parameter of type `void'.
1674 The parser invokes routines elsewhere in the compiler to perform
1675 semantic analysis and to build up the abstract syntax tree for the
1676 code processed.
1678 The parser (and the template instantiation code, which is, in a
1679 way, a close relative of parsing) are the only parts of the
1680 compiler that should be calling push_scope and pop_scope, or
1681 related functions. The parser (and template instantiation code)
1682 keeps track of what scope is presently active; everything else
1683 should simply honor that. (The code that generates static
1684 initializers may also need to set the scope, in order to check
1685 access control correctly when emitting the initializers.)
1687 Methodology
1688 -----------
1690 The parser is of the standard recursive-descent variety. Upcoming
1691 tokens in the token stream are examined in order to determine which
1692 production to use when parsing a non-terminal. Some C++ constructs
1693 require arbitrary look ahead to disambiguate. For example, it is
1694 impossible, in the general case, to tell whether a statement is an
1695 expression or declaration without scanning the entire statement.
1696 Therefore, the parser is capable of "parsing tentatively." When the
1697 parser is not sure what construct comes next, it enters this mode.
1698 Then, while we attempt to parse the construct, the parser queues up
1699 error messages, rather than issuing them immediately, and saves the
1700 tokens it consumes. If the construct is parsed successfully, the
1701 parser "commits", i.e., it issues any queued error messages and
1702 the tokens that were being preserved are permanently discarded.
1703 If, however, the construct is not parsed successfully, the parser
1704 rolls back its state completely so that it can resume parsing using
1705 a different alternative.
1707 Future Improvements
1708 -------------------
1710 The performance of the parser could probably be improved substantially.
1711 We could often eliminate the need to parse tentatively by looking ahead
1712 a little bit. In some places, this approach might not entirely eliminate
1713 the need to parse tentatively, but it might still speed up the average
1714 case. */
1716 /* Flags that are passed to some parsing functions. These values can
1717 be bitwise-ored together. */
1719 enum
1720 {
1721 /* No flags. */
1723 /* The construct is optional. If it is not present, then no error
1724 should be issued. */
1726 /* When parsing a type-specifier, treat user-defined type-names
1727 as non-type identifiers. */
1729 /* When parsing a type-specifier, do not try to parse a class-specifier
1730 or enum-specifier. */
1732 /* When parsing a decl-specifier-seq, only allow type-specifier or
1733 constexpr. */
1735 };
1737 /* This type is used for parameters and variables which hold
1738 combinations of the above flags. */
1741 /* The different kinds of declarators we want to parse. */
1744 {
1745 /* We want an abstract declarator. */
1746 CP_PARSER_DECLARATOR_ABSTRACT,
1747 /* We want a named declarator. */
1748 CP_PARSER_DECLARATOR_NAMED,
1749 /* We don't mind, but the name must be an unqualified-id. */
1750 CP_PARSER_DECLARATOR_EITHER
1753 /* The precedence values used to parse binary expressions. The minimum value
1754 of PREC must be 1, because zero is reserved to quickly discriminate
1755 binary operators from other tokens. */
1757 enum cp_parser_prec
1758 {
1759 PREC_NOT_OPERATOR,
1760 PREC_LOGICAL_OR_EXPRESSION,
1761 PREC_LOGICAL_AND_EXPRESSION,
1762 PREC_INCLUSIVE_OR_EXPRESSION,
1763 PREC_EXCLUSIVE_OR_EXPRESSION,
1764 PREC_AND_EXPRESSION,
1765 PREC_EQUALITY_EXPRESSION,
1766 PREC_RELATIONAL_EXPRESSION,
1767 PREC_SHIFT_EXPRESSION,
1768 PREC_ADDITIVE_EXPRESSION,
1769 PREC_MULTIPLICATIVE_EXPRESSION,
1770 PREC_PM_EXPRESSION,
1771 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1772 };
1774 /* A mapping from a token type to a corresponding tree node type, with a
1775 precedence value. */
1778 {
1779 /* The token type. */
1781 /* The corresponding tree code. */
1783 /* The precedence of this operator. */
1788 {
1789 /* Left hand side of the binary operation we are currently
1790 parsing. */
1791 tree lhs;
1792 /* Original tree code for left hand side, if it was a binary
1793 expression itself (used for -Wparentheses). */
1795 /* Tree code for the binary operation we are parsing. */
1797 /* Precedence of the binary operation we are parsing. */
1799 /* Location of the binary operation we are parsing. */
1800 location_t loc;
1803 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1804 entries because precedence levels on the stack are monotonically
1805 increasing. */
1809 /* Prototypes. */
1811 /* Constructors and destructors. */
1816 /* Class variables. */
1820 /* The operator-precedence table used by cp_parser_binary_expression.
1821 Transformed into an associative array (binops_by_token) by
1822 cp_parser_new. */
1855 };
1857 /* The same as binops, but initialized by cp_parser_new so that
1858 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1859 for speed. */
1862 /* Constructors and destructors. */
1864 /* Construct a new context. The context below this one on the stack
1865 is given by NEXT. */
1869 {
1872 /* Allocate the storage. */
1874 {
1875 /* Pull the first entry from the free list. */
1879 }
1880 else
1883 /* No errors have occurred yet in this context. */
1885 /* If this is not the bottommost context, copy information that we
1886 need from the previous context. */
1888 {
1889 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1890 expression, then we are parsing one in this context, too. */
1892 /* Thread the stack. */
1894 }
1897 }
1899 /* Managing the unparsed function queues. */
1901 #define unparsed_funs_with_default_args \
1902 parser->unparsed_queues->last ().funs_with_default_args
1903 #define unparsed_funs_with_definitions \
1904 parser->unparsed_queues->last ().funs_with_definitions
1905 #define unparsed_nsdmis \
1906 parser->unparsed_queues->last ().nsdmis
1907 #define unparsed_classes \
1908 parser->unparsed_queues->last ().classes
1910 static void
1912 {
1915 }
1917 static void
1919 {
1922 }
1924 /* Prototypes. */
1926 /* Constructors and destructors. */
1931 /* Routines to parse various constructs.
1933 Those that return `tree' will return the error_mark_node (rather
1934 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1935 Sometimes, they will return an ordinary node if error-recovery was
1936 attempted, even though a parse error occurred. So, to check
1937 whether or not a parse error occurred, you should always use
1938 cp_parser_error_occurred. If the construct is optional (indicated
1939 either by an `_opt' in the name of the function that does the
1940 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1941 the construct is not present. */
1943 /* Lexical conventions [gram.lex] */
1945 static tree cp_parser_identifier
1947 static tree cp_parser_string_literal
1949 static tree cp_parser_userdef_char_literal
1951 static tree cp_parser_userdef_string_literal
1953 static tree cp_parser_userdef_numeric_literal
1956 /* Basic concepts [gram.basic] */
1958 static bool cp_parser_translation_unit
1961 /* Expressions [gram.expr] */
1963 static tree cp_parser_primary_expression
1965 static tree cp_parser_id_expression
1967 static tree cp_parser_unqualified_id
1969 static tree cp_parser_nested_name_specifier_opt
1971 static tree cp_parser_nested_name_specifier
1973 static tree cp_parser_qualifying_entity
1975 static tree cp_parser_postfix_expression
1977 static tree cp_parser_postfix_open_square_expression
1979 static tree cp_parser_postfix_dot_deref_expression
1983 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1985 static void cp_parser_pseudo_destructor_name
1987 static tree cp_parser_unary_expression
1989 static enum tree_code cp_parser_unary_operator
1991 static tree cp_parser_new_expression
1995 static tree cp_parser_new_type_id
2003 static tree cp_parser_delete_expression
2005 static tree cp_parser_cast_expression
2007 static tree cp_parser_binary_expression
2009 static tree cp_parser_question_colon_clause
2011 static tree cp_parser_assignment_expression
2013 static enum tree_code cp_parser_assignment_operator_opt
2015 static tree cp_parser_expression
2017 static tree cp_parser_constant_expression
2019 static tree cp_parser_builtin_offsetof
2021 static tree cp_parser_lambda_expression
2023 static void cp_parser_lambda_introducer
2025 static bool cp_parser_lambda_declarator_opt
2027 static void cp_parser_lambda_body
2030 /* Statements [gram.stmt.stmt] */
2032 static void cp_parser_statement
2034 static void cp_parser_label_for_labeled_statement
2036 static tree cp_parser_expression_statement
2038 static tree cp_parser_compound_statement
2040 static void cp_parser_statement_seq_opt
2042 static tree cp_parser_selection_statement
2044 static tree cp_parser_condition
2046 static tree cp_parser_iteration_statement
2048 static bool cp_parser_for_init_statement
2050 static tree cp_parser_for
2052 static tree cp_parser_c_for
2054 static tree cp_parser_range_for
2056 static void do_range_for_auto_deduction
2058 static tree cp_parser_perform_range_for_lookup
2060 static tree cp_parser_range_for_member_function
2062 static tree cp_parser_jump_statement
2064 static void cp_parser_declaration_statement
2067 static tree cp_parser_implicitly_scoped_statement
2069 static void cp_parser_already_scoped_statement
2072 /* Declarations [gram.dcl.dcl] */
2074 static void cp_parser_declaration_seq_opt
2076 static void cp_parser_declaration
2078 static void cp_parser_block_declaration
2080 static void cp_parser_simple_declaration
2082 static void cp_parser_decl_specifier_seq
2084 static tree cp_parser_storage_class_specifier_opt
2086 static tree cp_parser_function_specifier_opt
2088 static tree cp_parser_type_specifier
2091 static tree cp_parser_simple_type_specifier
2093 static tree cp_parser_type_name
2095 static tree cp_parser_nonclass_name
2097 static tree cp_parser_elaborated_type_specifier
2099 static tree cp_parser_enum_specifier
2101 static void cp_parser_enumerator_list
2103 static void cp_parser_enumerator_definition
2105 static tree cp_parser_namespace_name
2107 static void cp_parser_namespace_definition
2109 static void cp_parser_namespace_body
2111 static tree cp_parser_qualified_namespace_specifier
2113 static void cp_parser_namespace_alias_definition
2115 static bool cp_parser_using_declaration
2117 static void cp_parser_using_directive
2119 static tree cp_parser_alias_declaration
2121 static void cp_parser_asm_definition
2123 static void cp_parser_linkage_specification
2125 static void cp_parser_static_assert
2127 static tree cp_parser_decltype
2130 /* Declarators [gram.dcl.decl] */
2132 static tree cp_parser_init_declarator
2139 static enum tree_code cp_parser_ptr_operator
2141 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2143 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2145 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2147 static tree cp_parser_late_return_type_opt
2149 static tree cp_parser_declarator_id
2151 static tree cp_parser_type_id
2153 static tree cp_parser_template_type_arg
2156 static tree cp_parser_type_id_1
2158 static void cp_parser_type_specifier_seq
2160 static tree cp_parser_parameter_declaration_clause
2162 static tree cp_parser_parameter_declaration_list
2166 static tree cp_parser_default_argument
2168 static void cp_parser_function_body
2170 static tree cp_parser_initializer
2172 static tree cp_parser_initializer_clause
2174 static tree cp_parser_braced_list
2179 static bool cp_parser_ctor_initializer_opt_and_function_body
2182 static tree cp_parser_late_parsing_omp_declare_simd
2185 static tree cp_parser_late_parsing_cilk_simd_fn_info
2188 static tree synthesize_implicit_template_parm
2190 static tree finish_fully_implicit_template
2193 /* Classes [gram.class] */
2195 static tree cp_parser_class_name
2197 static tree cp_parser_class_specifier
2199 static tree cp_parser_class_head
2201 static enum tag_types cp_parser_class_key
2203 static void cp_parser_type_parameter_key
2205 static void cp_parser_member_specification_opt
2207 static void cp_parser_member_declaration
2209 static tree cp_parser_pure_specifier
2211 static tree cp_parser_constant_initializer
2214 /* Derived classes [gram.class.derived] */
2216 static tree cp_parser_base_clause
2218 static tree cp_parser_base_specifier
2221 /* Special member functions [gram.special] */
2223 static tree cp_parser_conversion_function_id
2225 static tree cp_parser_conversion_type_id
2229 static bool cp_parser_ctor_initializer_opt
2231 static void cp_parser_mem_initializer_list
2233 static tree cp_parser_mem_initializer
2235 static tree cp_parser_mem_initializer_id
2238 /* Overloading [gram.over] */
2240 static tree cp_parser_operator_function_id
2242 static tree cp_parser_operator
2245 /* Templates [gram.temp] */
2247 static void cp_parser_template_declaration
2249 static tree cp_parser_template_parameter_list
2251 static tree cp_parser_template_parameter
2253 static tree cp_parser_type_parameter
2255 static tree cp_parser_template_id
2257 static tree cp_parser_template_name
2259 static tree cp_parser_template_argument_list
2261 static tree cp_parser_template_argument
2263 static void cp_parser_explicit_instantiation
2265 static void cp_parser_explicit_specialization
2268 /* Exception handling [gram.exception] */
2270 static tree cp_parser_try_block
2272 static bool cp_parser_function_try_block
2274 static void cp_parser_handler_seq
2276 static void cp_parser_handler
2278 static tree cp_parser_exception_declaration
2280 static tree cp_parser_throw_expression
2282 static tree cp_parser_exception_specification_opt
2284 static tree cp_parser_type_id_list
2287 /* GNU Extensions */
2289 static tree cp_parser_asm_specification_opt
2291 static tree cp_parser_asm_operand_list
2293 static tree cp_parser_asm_clobber_list
2295 static tree cp_parser_asm_label_list
2297 static bool cp_next_tokens_can_be_attribute_p
2299 static bool cp_next_tokens_can_be_gnu_attribute_p
2301 static bool cp_next_tokens_can_be_std_attribute_p
2303 static bool cp_nth_tokens_can_be_std_attribute_p
2305 static bool cp_nth_tokens_can_be_gnu_attribute_p
2307 static bool cp_nth_tokens_can_be_attribute_p
2309 static tree cp_parser_attributes_opt
2311 static tree cp_parser_gnu_attributes_opt
2313 static tree cp_parser_gnu_attribute_list
2315 static tree cp_parser_std_attribute
2317 static tree cp_parser_std_attribute_spec
2319 static tree cp_parser_std_attribute_spec_seq
2321 static bool cp_parser_extension_opt
2323 static void cp_parser_label_declaration
2326 /* Transactional Memory Extensions */
2328 static tree cp_parser_transaction
2330 static tree cp_parser_transaction_expression
2332 static bool cp_parser_function_transaction
2334 static tree cp_parser_transaction_cancel
2338 pragma_external,
2339 pragma_member,
2340 pragma_objc_icode,
2341 pragma_stmt,
2342 pragma_compound
2343 };
2344 static bool cp_parser_pragma
2347 /* Objective-C++ Productions */
2349 static tree cp_parser_objc_message_receiver
2351 static tree cp_parser_objc_message_args
2353 static tree cp_parser_objc_message_expression
2355 static tree cp_parser_objc_encode_expression
2357 static tree cp_parser_objc_defs_expression
2359 static tree cp_parser_objc_protocol_expression
2361 static tree cp_parser_objc_selector_expression
2363 static tree cp_parser_objc_expression
2365 static bool cp_parser_objc_selector_p
2367 static tree cp_parser_objc_selector
2369 static tree cp_parser_objc_protocol_refs_opt
2371 static void cp_parser_objc_declaration
2373 static tree cp_parser_objc_statement
2375 static bool cp_parser_objc_valid_prefix_attributes
2377 static void cp_parser_objc_at_property_declaration
2379 static void cp_parser_objc_at_synthesize_declaration
2381 static void cp_parser_objc_at_dynamic_declaration
2383 static tree cp_parser_objc_struct_declaration
2386 /* Utility Routines */
2388 static tree cp_parser_lookup_name
2390 static tree cp_parser_lookup_name_simple
2392 static tree cp_parser_maybe_treat_template_as_class
2394 static bool cp_parser_check_declarator_template_parameters
2396 static bool cp_parser_check_template_parameters
2398 static tree cp_parser_simple_cast_expression
2400 static tree cp_parser_global_scope_opt
2402 static bool cp_parser_constructor_declarator_p
2404 static tree cp_parser_function_definition_from_specifiers_and_declarator
2406 static tree cp_parser_function_definition_after_declarator
2408 static void cp_parser_template_declaration_after_export
2410 static void cp_parser_perform_template_parameter_access_checks
2412 static tree cp_parser_single_declaration
2414 static tree cp_parser_functional_cast
2416 static tree cp_parser_save_member_function_body
2418 static tree cp_parser_save_nsdmi
2420 static tree cp_parser_enclosed_template_argument_list
2422 static void cp_parser_save_default_args
2424 static void cp_parser_late_parsing_for_member
2426 static tree cp_parser_late_parse_one_default_arg
2428 static void cp_parser_late_parsing_nsdmi
2430 static void cp_parser_late_parsing_default_args
2432 static tree cp_parser_sizeof_operand
2434 static tree cp_parser_trait_expr
2436 static bool cp_parser_declares_only_class_p
2438 static void cp_parser_set_storage_class
2440 static void cp_parser_set_decl_spec_type
2442 static void set_and_check_decl_spec_loc
2445 static bool cp_parser_friend_p
2447 static void cp_parser_required_error
2453 static bool cp_parser_token_starts_function_definition_p
2455 static bool cp_parser_next_token_starts_class_definition_p
2457 static bool cp_parser_next_token_ends_template_argument_p
2459 static bool cp_parser_nth_token_starts_template_argument_list_p
2461 static enum tag_types cp_parser_token_is_class_key
2463 static enum tag_types cp_parser_token_is_type_parameter_key
2465 static void cp_parser_check_class_key
2467 static void cp_parser_check_access_in_redeclaration
2469 static bool cp_parser_optional_template_keyword
2471 static void cp_parser_pre_parsed_nested_name_specifier
2473 static bool cp_parser_cache_group
2475 static tree cp_parser_cache_defarg
2477 static void cp_parser_parse_tentatively
2479 static void cp_parser_commit_to_tentative_parse
2481 static void cp_parser_commit_to_topmost_tentative_parse
2483 static void cp_parser_abort_tentative_parse
2485 static bool cp_parser_parse_definitely
2489 static bool cp_parser_uncommitted_to_tentative_parse_p
2491 static void cp_parser_error
2493 static void cp_parser_name_lookup_error
2495 static bool cp_parser_simulate_error
2497 static bool cp_parser_check_type_definition
2499 static void cp_parser_check_for_definition_in_return_type
2501 static void cp_parser_check_for_invalid_template_id
2503 static bool cp_parser_non_integral_constant_expression
2505 static void cp_parser_diagnose_invalid_type_name
2507 static bool cp_parser_parse_and_diagnose_invalid_type_name
2509 static int cp_parser_skip_to_closing_parenthesis
2511 static void cp_parser_skip_to_end_of_statement
2513 static void cp_parser_consume_semicolon_at_end_of_statement
2515 static void cp_parser_skip_to_end_of_block_or_statement
2517 static bool cp_parser_skip_to_closing_brace
2519 static void cp_parser_skip_to_end_of_template_parameter_list
2521 static void cp_parser_skip_to_pragma_eol
2523 static bool cp_parser_error_occurred
2525 static bool cp_parser_allow_gnu_extensions_p
2527 static bool cp_parser_is_pure_string_literal
2529 static bool cp_parser_is_string_literal
2531 static bool cp_parser_is_keyword
2533 static tree cp_parser_make_typename_type
2537 static bool cp_parser_compound_literal_p
2539 static bool cp_parser_array_designator_p
2541 static bool cp_parser_skip_to_closing_square_bracket
2544 /* Returns nonzero if we are parsing tentatively. */
2548 {
2550 }
2552 /* Returns nonzero if TOKEN is a string literal. */
2554 static bool
2556 {
2562 }
2564 /* Returns nonzero if TOKEN is a string literal
2565 of a user-defined string literal. */
2567 static bool
2569 {
2576 }
2578 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2580 static bool
2582 {
2584 }
2586 /* If not parsing tentatively, issue a diagnostic of the form
2587 FILE:LINE: MESSAGE before TOKEN
2588 where TOKEN is the next token in the input stream. MESSAGE
2589 (specified by the caller) is usually of the form "expected
2590 OTHER-TOKEN". */
2592 static void
2594 {
2596 {
2598 /* This diagnostic makes more sense if it is tagged to the line
2599 of the token we just peeked at. */
2603 {
2608 }
2611 /* Because c_parser_error does not understand
2612 CPP_KEYWORD, keywords are treated like
2613 identifiers. */
2616 }
2617 }
2619 /* Issue an error about name-lookup failing. NAME is the
2620 IDENTIFIER_NODE DECL is the result of
2621 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2622 the thing that we hoped to find. */
2624 static void
2626 tree name,
2627 tree decl,
2628 name_lookup_error desired,
2629 location_t location)
2630 {
2631 /* If name lookup completely failed, tell the user that NAME was not
2632 declared. */
2634 {
2647 else
2649 }
2651 {
2653 {
2670 }
2671 }
2673 {
2675 {
2685 name);
2689 }
2690 }
2691 else
2692 {
2694 {
2707 }
2708 }
2709 }
2711 /* If we are parsing tentatively, remember that an error has occurred
2712 during this tentative parse. Returns true if the error was
2713 simulated; false if a message should be issued by the caller. */
2715 static bool
2717 {
2719 {
2722 }
2724 }
2726 /* This function is called when a type is defined. If type
2727 definitions are forbidden at this point, an error message is
2728 issued. */
2730 static bool
2732 {
2733 /* If types are forbidden here, issue a message. */
2735 {
2736 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2737 in the message need to be interpreted. */
2740 }
2742 }
2744 /* This function is called when the DECLARATOR is processed. The TYPE
2745 was a type defined in the decl-specifiers. If it is invalid to
2746 define a type in the decl-specifiers for DECLARATOR, an error is
2747 issued. TYPE_LOCATION is the location of TYPE and is used
2748 for error reporting. */
2750 static void
2753 {
2754 /* [dcl.fct] forbids type definitions in return types.
2755 Unfortunately, it's not easy to know whether or not we are
2756 processing a return type until after the fact. */
2764 {
2769 type);
2770 }
2771 }
2773 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2774 "<" in any valid C++ program. If the next token is indeed "<",
2775 issue a message warning the user about what appears to be an
2776 invalid attempt to form a template-id. LOCATION is the location
2777 of the type-specifier (TYPE) */
2779 static void
2781 tree type,
2783 location_t location)
2784 {
2788 {
2792 {
2795 else
2797 }
2798 else
2800 /* Remember the location of the invalid "<". */
2803 /* Consume the "<". */
2805 /* Parse the template arguments. */
2807 /* Permanently remove the invalid template arguments so that
2808 this error message is not issued again. */
2811 }
2812 }
2814 /* If parsing an integral constant-expression, issue an error message
2815 about the fact that THING appeared and return true. Otherwise,
2816 return false. In either case, set
2817 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2819 static bool
2821 non_integral_constant thing)
2822 {
2825 {
2827 {
2830 {
2837 "enumeration type cannot appear in a "
2928 }
2932 }
2933 }
2935 }
2937 /* Emit a diagnostic for an invalid type name. This function commits
2938 to the current active tentative parse, if any. (Otherwise, the
2939 problematic construct might be encountered again later, resulting
2940 in duplicate error messages.) LOCATION is the location of ID. */
2942 static void
2944 location_t location)
2945 {
2948 /* Try to lookup the identifier. */
2955 /* If the lookup was ambiguous, an error will already have
2956 been issued. */
2958 /* If the lookup found a template-name, it means that the user forgot
2959 to specify an argument list. Emit a useful error message. */
2961 {
2964 decl);
2966 }
2970 /* Something like 'unsigned A a;' */
2973 {
2974 /* Issue an error message. */
2976 /* If we're in a template class, it's possible that the user was
2977 referring to a type from a base class. For example:
2979 template <typename T> struct A { typedef T X; };
2980 template <typename T> struct B : public A<T> { X x; };
2982 The user should have said "typename A<T>::X". */
2996 {
2997 tree b;
3000 b;
3002 {
3006 {
3007 tree field;
3008 /* Go from a particular instantiation of the
3009 template (which will have an empty TYPE_FIELDs),
3010 to the main version. */
3013 field;
3017 {
3022 }
3025 }
3026 }
3027 }
3028 }
3029 /* Here we diagnose qualified-ids where the scope is actually correct,
3030 but the identifier does not resolve to a valid type name. */
3032 {
3034 {
3039 else
3045 }
3048 {
3049 /* A<T>::A<T>() */
3055 }
3062 {
3067 else
3073 }
3074 else
3076 }
3077 }
3079 /* Check for a common situation where a type-name should be present,
3080 but is not, and issue a sensible error message. Returns true if an
3081 invalid type-name was detected.
3083 The situation handled by this function are variable declarations of the
3084 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3085 Usually, `ID' should name a type, but if we got here it means that it
3086 does not. We try to emit the best possible error message depending on
3087 how exactly the id-expression looks like. */
3089 static bool
3091 {
3092 tree id;
3095 /* Avoid duplicate error about ambiguous lookup. */
3097 {
3101 }
3110 /* If the next token is a (, this is a function with no explicit return
3111 type, i.e. constructor, destructor or conversion op. */
3114 {
3117 }
3121 /* Emit a diagnostic for the invalid type. */
3123 out:
3124 /* If we aren't in the middle of a declarator (i.e. in a
3125 parameter-declaration-clause), skip to the end of the declaration;
3126 there's no point in trying to process it. */
3130 }
3132 /* Consume tokens up to, and including, the next non-nested closing `)'.
3133 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3134 are doing error recovery. Returns -1 if OR_COMMA is true and we
3135 found an unnested comma. */
3137 static int
3142 {
3152 {
3156 {
3159 /* If we've run out of tokens, then there is no closing `)'. */
3162 /* This is good for lambda expression capture-lists. */
3172 /* This matches the processing in skip_to_end_of_statement. */
3198 {
3202 }
3207 }
3209 /* Consume the token. */
3211 }
3212 }
3214 /* Consume tokens until we reach the end of the current statement.
3215 Normally, that will be just before consuming a `;'. However, if a
3216 non-nested `}' comes first, then we stop before consuming that. */
3218 static void
3220 {
3223 /* Unwind generic function template scope if necessary. */
3228 {
3232 {
3235 /* If we've run out of tokens, stop. */
3239 /* If the next token is a `;', we have reached the end of the
3240 statement. */
3246 /* If this is a non-nested '}', stop before consuming it.
3247 That way, when confronted with something like:
3249 { 3 + }
3251 we stop before consuming the closing '}', even though we
3252 have not yet reached a `;'. */
3256 /* If it is the closing '}' for a block that we have
3257 scanned, stop -- but only after consuming the token.
3258 That way given:
3260 void f g () { ... }
3261 typedef int I;
3263 we will stop after the body of the erroneously declared
3264 function, but before consuming the following `typedef'
3265 declaration. */
3267 {
3270 }
3278 }
3280 /* Consume the token. */
3282 }
3283 }
3285 /* This function is called at the end of a statement or declaration.
3286 If the next token is a semicolon, it is consumed; otherwise, error
3287 recovery is attempted. */
3289 static void
3291 {
3292 /* Look for the trailing `;'. */
3294 {
3295 /* If there is additional (erroneous) input, skip to the end of
3296 the statement. */
3298 /* If the next token is now a `;', consume it. */
3301 }
3302 }
3304 /* Skip tokens until we have consumed an entire block, or until we
3305 have consumed a non-nested `;'. */
3307 static void
3309 {
3312 /* Unwind generic function template scope if necessary. */
3317 {
3321 {
3324 /* If we've run out of tokens, stop. */
3328 /* Stop if this is an unnested ';'. */
3334 /* Stop if this is an unnested '}', or closes the outermost
3335 nesting level. */
3336 nesting_depth--;
3344 /* Nest. */
3345 nesting_depth++;
3350 }
3352 /* Consume the token. */
3354 }
3355 }
3357 /* Skip tokens until a non-nested closing curly brace is the next
3358 token, or there are no more tokens. Return true in the first case,
3359 false otherwise. */
3361 static bool
3363 {
3367 {
3371 {
3374 /* If we've run out of tokens, stop. */
3378 /* If the next token is a non-nested `}', then we have reached
3379 the end of the current block. */
3385 /* If it the next token is a `{', then we are entering a new
3386 block. Consume the entire block. */
3392 }
3394 /* Consume the token. */
3396 }
3397 }
3399 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3400 parameter is the PRAGMA token, allowing us to purge the entire pragma
3401 sequence. */
3403 static void
3405 {
3410 do
3414 /* Ensure that the pragma is not parsed again. */
3416 }
3418 /* Require pragma end of line, resyncing with it as necessary. The
3419 arguments are as for cp_parser_skip_to_pragma_eol. */
3421 static void
3423 {
3427 }
3429 /* This is a simple wrapper around make_typename_type. When the id is
3430 an unresolved identifier node, we can provide a superior diagnostic
3431 using cp_parser_diagnose_invalid_type_name. */
3433 static tree
3435 location_t id_location)
3436 {
3437 tree result;
3439 {
3445 }
3447 }
3449 /* This is a wrapper around the
3450 make_{pointer,ptrmem,reference}_declarator functions that decides
3451 which one to call based on the CODE and CLASS_TYPE arguments. The
3452 CODE argument should be one of the values returned by
3453 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3454 appertain to the pointer or reference. */
3458 cp_cv_quals cv_qualifiers,
3460 tree attributes)
3461 {
3468 else
3478 }
3480 /* Create a new C++ parser. */
3484 {
3489 /* cp_lexer_new_main is called before doing GC allocation because
3490 cp_lexer_new_main might load a PCH file. */
3493 /* Initialize the binops_by_token so that we can get the tree
3494 directly from the token. */
3502 /* For now, we always accept GNU extensions. */
3505 /* The `>' token is a greater-than operator, not the end of a
3506 template-id. */
3511 /* We are not parsing a constant-expression. */
3516 /* Local variable names are not forbidden. */
3519 /* We are not processing an `extern "C"' declaration. */
3522 /* We are not processing a declarator. */
3525 /* We are not processing a template-argument-list. */
3528 /* We are not in an iteration statement. */
3531 /* We are not in a switch statement. */
3534 /* We are not parsing a type-id inside an expression. */
3537 /* Declarations aren't implicitly extern "C". */
3540 /* String literals should be translated to the execution character set. */
3543 /* We are not parsing a function body. */
3546 /* We can correct until told otherwise. */
3549 /* The unparsed function queue is empty. */
3552 /* There are no classes being defined. */
3555 /* No template parameters apply. */
3558 /* Not declaring an implicit function template. */
3565 }
3567 /* Create a cp_lexer structure which will emit the tokens in CACHE
3568 and push it onto the parser's lexer stack. This is used for delayed
3569 parsing of in-class method bodies and default arguments, and should
3570 not be confused with tentative parsing. */
3571 static void
3573 {
3578 /* Move the current source position to that of the first token in the
3579 new lexer. */
3581 }
3583 /* Pop the top lexer off the parser stack. This is never used for the
3584 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3585 static void
3587 {
3592 /* Put the current source position back where it was before this
3593 lexer was pushed. */
3595 }
3597 /* Lexical conventions [gram.lex] */
3599 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3600 identifier. */
3602 static tree
3604 {
3607 /* Look for the identifier. */
3609 /* Return the value. */
3611 }
3613 /* Parse a sequence of adjacent string constants. Returns a
3614 TREE_STRING representing the combined, nul-terminated string
3615 constant. If TRANSLATE is true, translate the string to the
3616 execution character set. If WIDE_OK is true, a wide string is
3617 invalid here.
3619 C++98 [lex.string] says that if a narrow string literal token is
3620 adjacent to a wide string literal token, the behavior is undefined.
3621 However, C99 6.4.5p4 says that this results in a wide string literal.
3622 We follow C99 here, for consistency with the C front end.
3624 This code is largely lifted from lex_string() in c-lex.c.
3626 FUTURE: ObjC++ will need to handle @-strings here. */
3627 static tree
3630 {
3631 tree value;
3638 tree string_tree;
3644 {
3647 }
3650 {
3654 }
3655 else
3656 {
3659 }
3662 /* Try to avoid the overhead of creating and destroying an obstack
3663 for the common case of just one string. */
3666 {
3674 {
3678 }
3679 else
3683 }
3684 else
3685 {
3689 do
3690 {
3692 count++;
3697 {
3700 {
3703 }
3706 {
3711 }
3713 }
3714 else
3718 {
3723 "unsupported non-standard concatenation "
3725 }
3731 {
3735 }
3736 else
3737 {
3741 }
3742 }
3746 }
3749 {
3752 }
3756 {
3761 {
3776 }
3781 {
3786 else
3788 }
3789 }
3790 else
3791 /* cpp_interpret_string has issued an error. */
3798 }
3800 /* Look up a literal operator with the name and the exact arguments. */
3802 static tree
3804 {
3811 {
3817 {
3820 {
3830 }
3833 /* May be this should be sufficient_parms_p instead,
3834 depending on how exactly should user-defined literals
3835 work in presence of default arguments on the literal
3836 operator parameters. */
3839 }
3840 }
3843 }
3845 /* Parse a user-defined char constant. Returns a call to a user-defined
3846 literal operator taking the character as an argument. */
3848 static tree
3850 {
3858 /* Build up a call to the user-defined operator */
3859 /* Lookup the name we got back from the id-expression. */
3864 {
3869 }
3873 }
3875 /* A subroutine of cp_parser_userdef_numeric_literal to
3876 create a char... template parameter pack from a string node. */
3878 static tree
3880 {
3881 tree charvec;
3887 /* Fill in CHARVEC with all of the parameters. */
3892 /* Build the argument packs. */
3899 }
3901 /* A subroutine of cp_parser_userdef_numeric_literal to
3902 create a char... template parameter pack from a string node. */
3904 static tree
3906 {
3907 tree charvec;
3918 /* First template parm is character type. */
3921 /* Fill in CHARVEC with all of the parameters. */
3928 /* Build the argument packs. */
3935 }
3937 /* Parse a user-defined numeric constant. returns a call to a user-defined
3938 literal operator. */
3940 static tree
3942 {
3953 /* Look for a literal operator taking the exact type of numeric argument
3954 as the literal value. */
3959 {
3961 tf_warning_or_error);
3964 {
3967 long_long_unsigned_type_node);
3968 }
3969 else
3970 {
3974 long_double_type_node);
3978 }
3982 }
3985 /* If the numeric argument didn't work, look for a raw literal
3986 operator taking a const char* argument consisting of the number
3987 in string format. */
3992 {
3994 tf_warning_or_error);
3997 }
4000 /* If the raw literal didn't work, look for a non-type template
4001 function with parameter pack char.... Call the function with
4002 template parameter characters representing the number. */
4006 {
4010 tf_warning_or_error);
4013 }
4022 }
4024 /* Parse a user-defined string constant. Returns a call to a user-defined
4025 literal operator taking a character pointer and the length of the string
4026 as arguments. */
4028 static tree
4030 {
4039 /* Build up a call to the user-defined operator. */
4040 /* Lookup the name we got back from the id-expression. */
4047 {
4049 tf_warning_or_error);
4052 }
4055 /* Look for a template function with typename parameter CharT
4056 and parameter pack CharT... Call the function with
4057 template parameter characters representing the string. */
4061 {
4065 tf_warning_or_error);
4068 }
4074 }
4077 /* Basic concepts [gram.basic] */
4079 /* Parse a translation-unit.
4081 translation-unit:
4082 declaration-seq [opt]
4084 Returns TRUE if all went well. */
4086 static bool
4088 {
4089 /* The address of the first non-permanent object on the declarator
4090 obstack. */
4095 /* Create the declarator obstack, if necessary. */
4097 {
4099 /* Create the error declarator. */
4101 /* Create the empty parameter list. */
4103 /* Remember where the base of the declarator obstack lies. */
4105 }
4109 /* If there are no tokens left then all went well. */
4111 {
4112 /* Get rid of the token array; we don't need it any more. */
4116 /* This file might have been a context that's implicitly extern
4117 "C". If so, pop the lang context. (Only relevant for PCH.) */
4119 {
4122 }
4124 /* Finish up. */
4128 }
4129 else
4130 {
4133 }
4135 /* Make sure the declarator obstack was fully cleaned up. */
4139 /* All went well. */
4141 }
4143 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4144 decltype context. */
4148 {
4153 }
4155 /* We're about to parse a collection of statements. If we're currently
4156 parsing tentatively, set up a firewall so that any nested
4157 cp_parser_commit_to_tentative_parse won't affect the current context. */
4159 static cp_token_position
4161 {
4168 }
4170 /* We've finished parsing the collection of statements. Wrap up the
4171 firewall and replace the relevant tokens with the parsed form. */
4173 static void
4175 tree expr)
4176 {
4180 /* Finish the firewall level. */
4182 /* And remember the result of the parse for when we try again. */
4188 }
4190 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4191 enclosing parentheses. */
4193 static tree
4195 {
4198 /* Consume the '('. */
4200 /* Start the statement-expression. */
4202 /* Parse the compound-statement. */
4204 /* Finish up. */
4206 /* Consume the ')'. */
4212 }
4214 /* Expressions [gram.expr] */
4216 /* Parse a primary-expression.
4218 primary-expression:
4219 literal
4220 this
4221 ( expression )
4222 id-expression
4223 lambda-expression (C++11)
4225 GNU Extensions:
4227 primary-expression:
4228 ( compound-statement )
4229 __builtin_va_arg ( assignment-expression , type-id )
4230 __builtin_offsetof ( type-id , offsetof-expression )
4232 C++ Extensions:
4233 __has_nothrow_assign ( type-id )
4234 __has_nothrow_constructor ( type-id )
4235 __has_nothrow_copy ( type-id )
4236 __has_trivial_assign ( type-id )
4237 __has_trivial_constructor ( type-id )
4238 __has_trivial_copy ( type-id )
4239 __has_trivial_destructor ( type-id )
4240 __has_virtual_destructor ( type-id )
4241 __is_abstract ( type-id )
4242 __is_base_of ( type-id , type-id )
4243 __is_class ( type-id )
4244 __is_empty ( type-id )
4245 __is_enum ( type-id )
4246 __is_final ( type-id )
4247 __is_literal_type ( type-id )
4248 __is_pod ( type-id )
4249 __is_polymorphic ( type-id )
4250 __is_std_layout ( type-id )
4251 __is_trivial ( type-id )
4252 __is_union ( type-id )
4254 Objective-C++ Extension:
4256 primary-expression:
4257 objc-expression
4259 literal:
4260 __null
4262 ADDRESS_P is true iff this expression was immediately preceded by
4263 "&" and therefore might denote a pointer-to-member. CAST_P is true
4264 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4265 true iff this expression is a template argument.
4267 Returns a representation of the expression. Upon return, *IDK
4268 indicates what kind of id-expression (if any) was present. */
4270 static tree
4277 {
4280 /* Assume the primary expression is not an id-expression. */
4283 /* Peek at the next token. */
4286 {
4287 /* literal:
4288 integer-literal
4289 character-literal
4290 floating-literal
4291 string-literal
4292 boolean-literal
4293 pointer-literal
4294 user-defined-literal */
4305 {
4309 }
4310 /* Floating-point literals are only allowed in an integral
4311 constant expression if they are cast to an integral or
4312 enumeration type. */
4316 {
4317 /* CAST_P will be set even in invalid code like "int(2.7 +
4318 ...)". Therefore, we have to check that the next token
4319 is sure to end the cast. */
4321 {
4326 enumerator-definition. */
4328 /* The curly brace at the end of an enum-specifier. */
4330 /* The end of a statement. */
4332 /* The end of the cast-expression. */
4334 /* The end of an array bound. */
4336 /* The closing ">" in a template-argument-list. */
4339 /* C++0x only: A ">>" treated like two ">" tokens,
4340 in a template-argument-list. */
4345 }
4347 /* If we are within a cast, then the constraint that the
4348 cast is to an integral or enumeration type will be
4349 checked at that point. If we are not within a cast, then
4350 this code is invalid. */
4353 }
4372 /* ??? Should wide strings be allowed when parser->translate_strings_p
4373 is false (i.e. in attributes)? If not, we can kill the third
4374 argument to cp_parser_string_literal. */
4380 /* If we see `( { ' then we are looking at the beginning of
4381 a GNU statement-expression. */
4384 {
4385 /* Statement-expressions are not allowed by the standard. */
4389 /* And they're not allowed outside of a function-body; you
4390 cannot, for example, write:
4392 int i = ({ int j = 3; j + 1; });
4394 at class or namespace scope. */
4397 {
4399 "statement-expressions are not allowed outside "
4405 }
4406 else
4408 }
4409 /* Otherwise it's a normal parenthesized expression. */
4410 {
4411 tree expr;
4414 /* Consume the `('. */
4416 /* Within a parenthesized expression, a `>' token is always
4417 the greater-than operator. */
4418 saved_greater_than_is_operator_p
4422 /* Parse the parenthesized expression. */
4424 /* Let the front end know that this expression was
4425 enclosed in parentheses. This matters in case, for
4426 example, the expression is of the form `A::B', since
4427 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4428 not. */
4430 /* DR 705: Wrapping an unqualified name in parentheses
4431 suppresses arg-dependent lookup. We want to pass back
4432 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4433 (c++/37862), but none of the others. */
4437 /* The `>' token might be the end of a template-id or
4438 template-parameter-list now. */
4439 parser->greater_than_is_operator_p
4441 /* Consume the `)'. */
4446 }
4449 {
4451 {
4452 /* We might have an Objective-C++ message. */
4455 /* If that works out, we're done ... */
4458 /* ... else, fall though to see if it's a lambda. */
4459 }
4461 /* Don't warn about a failed tentative parse. */
4466 }
4470 /* We have an Objective-C++ string literal. */
4477 {
4478 /* These two are the boolean literals. */
4486 /* The `__null' literal. */
4491 /* The `nullptr' literal. */
4496 /* Recognize the `this' keyword. */
4500 {
4504 }
4505 /* Pointers cannot appear in constant-expressions. */
4510 /* The `operator' keyword can be the beginning of an
4511 id-expression. */
4518 {
4519 non_integral_constant name;
4521 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4522 __func__ are the names of variables -- but they are
4523 treated specially. Therefore, they are handled here,
4524 rather than relying on the generic id-expression logic
4525 below. Grammatically, these names are id-expressions.
4527 Consume the token. */
4531 {
4543 }
4548 /* Look up the name. */
4550 }
4553 {
4554 tree expression;
4555 tree type;
4556 source_location type_location;
4558 /* The `__builtin_va_arg' construct is used to handle
4559 `va_arg'. Consume the `__builtin_va_arg' token. */
4561 /* Look for the opening `('. */
4563 /* Now, parse the assignment-expression. */
4565 /* Look for the `,'. */
4568 /* Parse the type-id. */
4570 /* Look for the closing `)'. */
4572 /* Using `va_arg' in a constant-expression is not
4573 allowed. */
4575 NIC_VA_ARG))
4578 }
4608 /* Objective-C++ expressions. */
4618 {
4623 }
4627 }
4629 /* An id-expression can start with either an identifier, a
4630 `::' as the beginning of a qualified-id, or the "operator"
4631 keyword. */
4636 {
4637 tree id_expression;
4638 tree decl;
4644 id_expression:
4645 /* Parse the id-expression. */
4646 id_expression
4663 /* If we have a template-id, then no further lookup is
4664 required. If the template-id was for a template-class, we
4665 will sometimes have a TYPE_DECL at this point. */
4669 /* Look up the name. */
4670 else
4671 {
4672 tree ambiguous_decls;
4674 /* If we already know that this lookup is ambiguous, then
4675 we've already issued an error message; there's no reason
4676 to check again. */
4679 {
4682 }
4685 none_type,
4686 template_p,
4691 /* If the lookup was ambiguous, an error will already have
4692 been issued. */
4696 /* In Objective-C++, we may have an Objective-C 2.0
4697 dot-syntax for classes here. */
4702 {
4703 tree component;
4710 }
4712 /* In Objective-C++, an instance variable (ivar) may be preferred
4713 to whatever cp_parser_lookup_name() found. */
4716 /* If name lookup gives us a SCOPE_REF, then the
4717 qualifying scope was dependent. */
4719 {
4720 /* At this point, we do not know if DECL is a valid
4721 integral constant expression. We assume that it is
4722 in fact such an expression, so that code like:
4724 template <int N> struct A {
4725 int a[B<N>::i];
4726 };
4728 is accepted. At template-instantiation time, we
4729 will check that B<N>::i is actually a constant. */
4731 }
4732 /* Check to see if DECL is a local variable in a context
4733 where that is forbidden. */
4736 {
4737 /* It might be that we only found DECL because we are
4738 trying to be generous with pre-ISO scoping rules.
4739 For example, consider:
4741 int i;
4742 void g() {
4743 for (int i = 0; i < 10; ++i) {}
4744 extern void f(int j = i);
4745 }
4747 Here, name look up will originally find the out
4748 of scope `i'. We need to issue a warning message,
4749 but then use the global `i'. */
4752 {
4755 decl);
4757 }
4758 }
4759 }
4761 decl = (finish_id_expression
4763 idk,
4768 template_arg_p,
4774 }
4776 /* Anything else is an error. */
4780 }
4781 }
4789 {
4792 }
4794 /* Parse an id-expression.
4796 id-expression:
4797 unqualified-id
4798 qualified-id
4800 qualified-id:
4801 :: [opt] nested-name-specifier template [opt] unqualified-id
4802 :: identifier
4803 :: operator-function-id
4804 :: template-id
4806 Return a representation of the unqualified portion of the
4807 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4808 a `::' or nested-name-specifier.
4810 Often, if the id-expression was a qualified-id, the caller will
4811 want to make a SCOPE_REF to represent the qualified-id. This
4812 function does not do this in order to avoid wastefully creating
4813 SCOPE_REFs when they are not required.
4815 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4816 `template' keyword.
4818 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4819 uninstantiated templates.
4821 If *TEMPLATE_P is non-NULL, it is set to true iff the
4822 `template' keyword is used to explicitly indicate that the entity
4823 named is a template.
4825 If DECLARATOR_P is true, the id-expression is appearing as part of
4826 a declarator, rather than as part of an expression. */
4828 static tree
4835 {
4839 /* Assume the `template' keyword was not used. */
4843 /* Look for the optional `::' operator. */
4844 global_scope_p
4847 /* Look for the optional nested-name-specifier. */
4848 nested_name_specifier_p
4851 check_dependency_p,
4853 declarator_p)
4855 /* If there is a nested-name-specifier, then we are looking at
4856 the first qualified-id production. */
4858 {
4859 tree saved_scope;
4860 tree saved_object_scope;
4861 tree saved_qualifying_scope;
4862 tree unqualified_id;
4865 /* See if the next token is the `template' keyword. */
4869 /* Name lookup we do during the processing of the
4870 unqualified-id might obliterate SCOPE. */
4874 /* Process the final unqualified-id. */
4876 check_dependency_p,
4877 declarator_p,
4879 /* Restore the SAVED_SCOPE for our caller. */
4885 }
4886 /* Otherwise, if we are in global scope, then we are looking at one
4887 of the other qualified-id productions. */
4889 {
4891 tree id;
4893 /* Peek at the next token. */
4896 /* If it's an identifier, and the next token is not a "<", then
4897 we can avoid the template-id case. This is an optimization
4898 for this common case. */
4900 && !cp_parser_nth_token_starts_template_argument_list_p
4905 /* Try a template-id. */
4909 none_type,
4910 declarator_p);
4911 /* If that worked, we're done. */
4915 /* Peek at the next token. (Changes in the token buffer may
4916 have invalidated the pointer obtained above.) */
4920 {
4927 /* Fall through. */
4932 }
4933 }
4934 else
4937 declarator_p,
4938 optional_p);
4939 }
4941 /* Parse an unqualified-id.
4943 unqualified-id:
4944 identifier
4945 operator-function-id
4946 conversion-function-id
4947 ~ class-name
4948 template-id
4950 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4951 keyword, in a construct like `A::template ...'.
4953 Returns a representation of unqualified-id. For the `identifier'
4954 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4955 production a BIT_NOT_EXPR is returned; the operand of the
4956 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4957 other productions, see the documentation accompanying the
4958 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4959 names are looked up in uninstantiated templates. If DECLARATOR_P
4960 is true, the unqualified-id is appearing as part of a declarator,
4961 rather than as part of an expression. */
4963 static tree
4969 {
4972 /* Peek at the next token. */
4976 {
4978 {
4979 tree id;
4981 /* We don't know yet whether or not this will be a
4982 template-id. */
4984 /* Try a template-id. */
4986 check_dependency_p,
4987 none_type,
4988 declarator_p);
4989 /* If it worked, we're done. */
4992 /* Otherwise, it's an ordinary identifier. */
4994 }
4998 check_dependency_p,
4999 none_type,
5000 declarator_p);
5003 {
5004 tree type_decl;
5005 tree qualifying_scope;
5006 tree object_scope;
5007 tree scope;
5010 /* Consume the `~' token. */
5012 /* Parse the class-name. The standard, as written, seems to
5013 say that:
5015 template <typename T> struct S { ~S (); };
5016 template <typename T> S<T>::~S() {}
5018 is invalid, since `~' must be followed by a class-name, but
5019 `S<T>' is dependent, and so not known to be a class.
5020 That's not right; we need to look in uninstantiated
5021 templates. A further complication arises from:
5023 template <typename T> void f(T t) {
5024 t.T::~T();
5025 }
5027 Here, it is not possible to look up `T' in the scope of `T'
5028 itself. We must look in both the current scope, and the
5029 scope of the containing complete expression.
5031 Yet another issue is:
5033 struct S {
5034 int S;
5035 ~S();
5036 };
5038 S::~S() {}
5040 The standard does not seem to say that the `S' in `~S'
5041 should refer to the type `S' and not the data member
5042 `S::S'. */
5044 /* DR 244 says that we look up the name after the "~" in the
5045 same scope as we looked up the qualifying name. That idea
5046 isn't fully worked out; it's more complicated than that. */
5051 /* Check for invalid scopes. */
5053 {
5057 }
5059 {
5063 scope);
5068 }
5071 /* If the name is of the form "X::~X" it's OK even if X is a
5072 typedef. */
5081 {
5084 }
5086 /* ~auto means the destructor of whatever the object is. */
5088 {
5091 "%<~auto%> only available with "
5095 }
5097 /* If there was an explicit qualification (S::~T), first look
5098 in the scope given by the qualification (i.e., S).
5100 Note: in the calls to cp_parser_class_name below we pass
5101 typename_type so that lookup finds the injected-class-name
5102 rather than the constructor. */
5106 {
5111 typename_type,
5114 declarator_p);
5117 }
5118 /* In "N::S::~S", look in "N" as well. */
5120 {
5125 type_decl
5129 typename_type,
5132 declarator_p);
5135 }
5136 /* In "p->S::~T", look in the scope given by "*p" as well. */
5138 {
5143 type_decl
5147 typename_type,
5150 declarator_p);
5153 }
5154 /* Look in the surrounding context. */
5156 {
5162 type_decl
5166 typename_type,
5169 declarator_p);
5172 {
5173 /* We couldn't find a type with this name, so just accept
5174 it and check for a match at instantiation time. */
5179 }
5180 }
5181 /* If an error occurred, assume that the name of the
5182 destructor is the same as the name of the qualifying
5183 class. That allows us to keep parsing after running
5184 into ill-formed destructor names. */
5190 /* Check that destructor name and scope match. */
5192 {
5199 }
5201 /* [class.dtor]
5203 A typedef-name that names a class shall not be used as the
5204 identifier in the declarator for a destructor declaration. */
5211 type_decl);
5214 }
5218 {
5219 tree id;
5221 /* This could be a template-id, so we try that first. */
5223 /* Try a template-id. */
5226 none_type,
5227 declarator_p);
5228 /* If that worked, we're done. */
5231 /* We still don't know whether we're looking at an
5232 operator-function-id or a conversion-function-id. */
5234 /* Try an operator-function-id. */
5236 /* If that didn't work, try a conversion-function-id. */
5240 {
5241 /* 17.6.3.3.5 */
5247 }
5250 }
5251 /* Fall through. */
5258 }
5259 }
5261 /* Parse an (optional) nested-name-specifier.
5263 nested-name-specifier: [C++98]
5264 class-or-namespace-name :: nested-name-specifier [opt]
5265 class-or-namespace-name :: template nested-name-specifier [opt]
5267 nested-name-specifier: [C++0x]
5268 type-name ::
5269 namespace-name ::
5270 nested-name-specifier identifier ::
5271 nested-name-specifier template [opt] simple-template-id ::
5273 PARSER->SCOPE should be set appropriately before this function is
5274 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5275 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5276 in name lookups.
5278 Sets PARSER->SCOPE to the class (TYPE) or namespace
5279 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5280 it unchanged if there is no nested-name-specifier. Returns the new
5281 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5283 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5284 part of a declaration and/or decl-specifier. */
5286 static tree
5292 {
5297 /* Remember where the nested-name-specifier starts. */
5299 {
5302 }
5305 {
5306 tree new_scope;
5307 tree old_scope;
5308 tree saved_qualifying_scope;
5311 /* Spot cases that cannot be the beginning of a
5312 nested-name-specifier. */
5315 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5316 the already parsed nested-name-specifier. */
5318 {
5319 /* Grab the nested-name-specifier and continue the loop. */
5321 /* If we originally encountered this nested-name-specifier
5322 with IS_DECLARATION set to false, we will not have
5323 resolved TYPENAME_TYPEs, so we must do so here. */
5326 {
5331 }
5334 }
5336 /* Spot cases that cannot be the beginning of a
5337 nested-name-specifier. On the second and subsequent times
5338 through the loop, we look for the `template' keyword. */
5340 ;
5341 /* A template-id can start a nested-name-specifier. */
5343 ;
5344 /* DR 743: decltype can be used in a nested-name-specifier. */
5346 ;
5347 else
5348 {
5349 /* If the next token is not an identifier, then it is
5350 definitely not a type-name or namespace-name. */
5353 /* If the following token is neither a `<' (to begin a
5354 template-id), nor a `::', then we are not looking at a
5355 nested-name-specifier. */
5361 {
5365 }
5368 && !cp_parser_nth_token_starts_template_argument_list_p
5371 }
5373 /* The nested-name-specifier is optional, so we parse
5374 tentatively. */
5377 /* Look for the optional `template' keyword, if this isn't the
5378 first time through the loop. */
5381 else
5384 /* Save the old scope since the name lookup we are about to do
5385 might destroy it. */
5388 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5389 look up names in "X<T>::I" in order to determine that "Y" is
5390 a template. So, if we have a typename at this point, we make
5391 an effort to look through it. */
5393 && !typename_keyword_p
5398 /* Parse the qualifying entity. */
5399 new_scope
5401 typename_keyword_p,
5402 template_keyword_p,
5403 check_dependency_p,
5404 type_p,
5405 is_declaration);
5406 /* Look for the `::' token. */
5409 /* If we found what we wanted, we keep going; otherwise, we're
5410 done. */
5412 {
5415 /* Restore the OLD_SCOPE since it was valid before the
5416 failed attempt at finding the last
5417 class-or-namespace-name. */
5421 /* If the next token is a decltype, and the one after that is a
5422 `::', then the decltype has failed to resolve to a class or
5423 enumeration type. Give this error even when parsing
5424 tentatively since it can't possibly be valid--and we're going
5425 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5426 won't get another chance.*/
5430 {
5437 /* As below. */
5440 }
5444 {
5445 /* If we have a non-type template-id followed by ::, it can't
5446 possibly be valid. */
5451 {
5454 {
5460 }
5461 else
5462 {
5463 /* Variable template. */
5468 }
5475 /* As below. */
5479 }
5480 }
5484 /* If the next token is an identifier, and the one after
5485 that is a `::', then any valid interpretation would have
5486 found a class-or-namespace-name. */
5492 {
5495 {
5497 {
5498 tree decl;
5499 tree ambiguous_decls;
5502 none_type,
5511 decl);
5513 {
5514 // cp_parser_lookup_name has the same diagnostic,
5515 // thus make sure to emit it at most once.
5518 {
5523 }
5525 }
5526 else
5527 {
5529 cp_parser_name_lookup_error
5532 else
5533 cp_parser_name_lookup_error
5536 }
5537 }
5540 /* Treat this as a successful nested-name-specifier
5541 due to:
5543 [basic.lookup.qual]
5545 If the name found is not a class-name (clause
5546 _class_) or namespace-name (_namespace.def_), the
5547 program is ill-formed. */
5549 }
5551 }
5553 }
5554 /* We've found one valid nested-name-specifier. */
5556 /* Name lookup always gives us a DECL. */
5559 /* Uses of "template" must be followed by actual templates. */
5571 new_scope);
5572 /* If it is a class scope, try to complete it; we are about to
5573 be looking up names inside the class. */
5575 /* Since checking types for dependency can be expensive,
5576 avoid doing it if the type is already complete. */
5578 /* Do not try to complete dependent types. */
5580 {
5582 /* If it is a typedef to current class, use the current
5583 class instead, as the typedef won't have any names inside
5584 it yet. */
5588 }
5589 /* Make sure we look in the right scope the next time through
5590 the loop. */
5592 }
5594 /* If parsing tentatively, replace the sequence of tokens that makes
5595 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5596 token. That way, should we re-parse the token stream, we will
5597 not have to repeat the effort required to do the parse, nor will
5598 we issue duplicate error messages. */
5600 {
5604 /* Reset the contents of the START token. */
5606 /* Retrieve any deferred checks. Do not pop this access checks yet
5607 so the memory will not be reclaimed during token replacing below. */
5615 /* Purge all subsequent tokens. */
5617 }
5623 }
5625 /* Parse a nested-name-specifier. See
5626 cp_parser_nested_name_specifier_opt for details. This function
5627 behaves identically, except that it will an issue an error if no
5628 nested-name-specifier is present. */
5630 static tree
5636 {
5637 tree scope;
5639 /* Look for the nested-name-specifier. */
5641 typename_keyword_p,
5642 check_dependency_p,
5643 type_p,
5644 is_declaration);
5645 /* If it was not present, issue an error message. */
5647 {
5650 }
5653 }
5655 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5656 this is either a class-name or a namespace-name (which corresponds
5657 to the class-or-namespace-name production in the grammar). For
5658 C++0x, it can also be a type-name that refers to an enumeration
5659 type or a simple-template-id.
5661 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5662 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5663 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5664 TYPE_P is TRUE iff the next name should be taken as a class-name,
5665 even the same name is declared to be another entity in the same
5666 scope.
5668 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5669 specified by the class-or-namespace-name. If neither is found the
5670 ERROR_MARK_NODE is returned. */
5672 static tree
5679 {
5680 tree saved_scope;
5681 tree saved_qualifying_scope;
5682 tree saved_object_scope;
5683 tree scope;
5687 /* DR 743: decltype can appear in a nested-name-specifier. */
5689 {
5693 {
5696 }
5700 }
5702 /* Before we try to parse the class-name, we must save away the
5703 current PARSER->SCOPE since cp_parser_class_name will destroy
5704 it. */
5708 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5709 there is no need to look for a namespace-name. */
5710 only_class_p = template_keyword_p
5715 typename_keyword_p,
5716 template_keyword_p,
5718 check_dependency_p,
5720 is_declaration,
5723 /* If that didn't work, try for a namespace-name. */
5725 {
5726 /* Restore the saved scope. */
5730 /* If we are not looking at an identifier followed by the scope
5731 resolution operator, then this is not part of a
5732 nested-name-specifier. (Note that this function is only used
5733 to parse the components of a nested-name-specifier.) */
5738 }
5741 }
5743 /* Return true if we are looking at a compound-literal, false otherwise. */
5745 static bool
5747 {
5748 /* Consume the `('. */
5753 /* Skip tokens until the next token is a closing parenthesis.
5754 If we find the closing `)', and the next token is a `{', then
5755 we are looking at a compound-literal. */
5756 bool compound_literal_p
5761 /* Roll back the tokens we skipped. */
5765 }
5767 /* Parse a postfix-expression.
5769 postfix-expression:
5770 primary-expression
5771 postfix-expression [ expression ]
5772 postfix-expression ( expression-list [opt] )
5773 simple-type-specifier ( expression-list [opt] )
5774 typename :: [opt] nested-name-specifier identifier
5775 ( expression-list [opt] )
5776 typename :: [opt] nested-name-specifier template [opt] template-id
5777 ( expression-list [opt] )
5778 postfix-expression . template [opt] id-expression
5779 postfix-expression -> template [opt] id-expression
5780 postfix-expression . pseudo-destructor-name
5781 postfix-expression -> pseudo-destructor-name
5782 postfix-expression ++
5783 postfix-expression --
5784 dynamic_cast < type-id > ( expression )
5785 static_cast < type-id > ( expression )
5786 reinterpret_cast < type-id > ( expression )
5787 const_cast < type-id > ( expression )
5788 typeid ( expression )
5789 typeid ( type-id )
5791 GNU Extension:
5793 postfix-expression:
5794 ( type-id ) { initializer-list , [opt] }
5796 This extension is a GNU version of the C99 compound-literal
5797 construct. (The C99 grammar uses `type-name' instead of `type-id',
5798 but they are essentially the same concept.)
5800 If ADDRESS_P is true, the postfix expression is the operand of the
5801 `&' operator. CAST_P is true if this expression is the target of a
5802 cast.
5804 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5805 class member access expressions [expr.ref].
5807 Returns a representation of the expression. */
5809 static tree
5813 {
5815 location_t loc;
5822 /* Peek at the next token. */
5825 /* Some of the productions are determined by keywords. */
5828 {
5833 {
5834 tree type;
5835 tree expression;
5839 /* All of these can be handled in the same way from the point
5840 of view of parsing. Begin by consuming the token
5841 identifying the cast. */
5844 /* New types cannot be defined in the cast. */
5846 parser->type_definition_forbidden_message
5849 /* Look for the opening `<'. */
5851 /* Parse the type to which we are casting. */
5856 /* Look for the closing `>'. */
5858 /* Restore the old message. */
5861 bool saved_greater_than_is_operator_p
5865 /* And the expression which is being cast. */
5870 parser->greater_than_is_operator_p
5873 /* Only type conversions to integral or enumeration types
5874 can be used in constant-expressions. */
5880 {
5882 postfix_expression
5886 postfix_expression
5890 postfix_expression
5892 tf_warning_or_error);
5895 postfix_expression
5900 }
5901 }
5905 {
5906 tree type;
5910 /* Consume the `typeid' token. */
5912 /* Look for the `(' token. */
5914 /* Types cannot be defined in a `typeid' expression. */
5916 parser->type_definition_forbidden_message
5918 /* We can't be sure yet whether we're looking at a type-id or an
5919 expression. */
5921 /* Try a type-id first. */
5926 /* Look for the `)' token. Otherwise, we can't be sure that
5927 we're not looking at an expression: consider `typeid (int
5928 (3))', for example. */
5930 /* If all went well, simply lookup the type-id. */
5933 /* Otherwise, fall back to the expression variant. */
5934 else
5935 {
5936 tree expression;
5938 /* Look for an expression. */
5940 /* Compute its typeid. */
5942 /* Look for the `)' token. */
5944 }
5945 /* Restore the saved message. */
5947 /* `typeid' may not appear in an integral constant expression. */
5950 }
5954 {
5955 tree type;
5956 /* The syntax permitted here is the same permitted for an
5957 elaborated-type-specifier. */
5962 }
5966 {
5970 {
5975 }
5977 {
5982 }
5983 else
5984 {
5985 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5988 }
5990 postfix_expression =
5994 {
5998 }
6000 {
6005 }
6006 else
6007 {
6009 postfix_expression);
6013 }
6015 }
6018 {
6021 tree p;
6035 tf_warning_or_error);
6038 tf_warning_or_error);
6039 else
6040 {
6044 }
6046 }
6049 {
6050 tree type;
6052 /* If the next thing is a simple-type-specifier, we may be
6053 looking at a functional cast. We could also be looking at
6054 an id-expression. So, we try the functional cast, and if
6055 that doesn't work we fall back to the primary-expression. */
6057 /* Look for the simple-type-specifier. */
6060 CP_PARSER_FLAGS_NONE);
6061 /* Parse the cast itself. */
6063 postfix_expression
6065 /* If that worked, we're done. */
6069 /* If the functional-cast didn't work out, try a
6070 compound-literal. */
6073 {
6078 /* Avoid calling cp_parser_type_id pointlessly, see comment
6079 in cp_parser_cast_expression about c++/29234. */
6082 else
6083 {
6084 /* Parse the type. */
6089 /* Look for the `)'. */
6091 }
6093 /* If things aren't going well, there's no need to
6094 keep going. */
6096 {
6098 /* Parse the brace-enclosed initializer list. */
6101 }
6102 /* If that worked, we're definitely looking at a
6103 compound-literal expression. */
6105 {
6106 /* Warn the user that a compound literal is not
6107 allowed in standard C++. */
6110 /* For simplicity, we disallow compound literals in
6111 constant-expressions. We could
6112 allow compound literals of integer type, whose
6113 initializer was a constant, in constant
6114 expressions. Permitting that usage, as a further
6115 extension, would not change the meaning of any
6116 currently accepted programs. (Of course, as
6117 compound literals are not part of ISO C++, the
6118 standard has nothing to say.) */
6120 NIC_NCC))
6121 {
6124 }
6125 /* Form the representation of the compound-literal. */
6126 postfix_expression
6128 tf_warning_or_error);
6130 }
6131 }
6133 /* It must be a primary-expression. */
6134 postfix_expression
6137 decltype_p,
6139 }
6141 }
6143 /* Note that we don't need to worry about calling build_cplus_new on a
6144 class-valued CALL_EXPR in decltype when it isn't the end of the
6145 postfix-expression; unary_complex_lvalue will take care of that for
6146 all these cases. */
6148 /* Keep looping until the postfix-expression is complete. */
6150 {
6154 /* It is not a Koenig lookup function call. */
6155 postfix_expression
6158 /* Peek at the next token. */
6162 {
6165 {
6167 "two consecutive %<[%> shall "
6170 }
6171 postfix_expression
6173 postfix_expression,
6175 decltype_p);
6181 /* postfix-expression ( expression-list [opt] ) */
6182 {
6192 is_builtin_constant_p
6195 {
6196 /* The whole point of __builtin_constant_p is to allow
6197 non-constant expressions to appear as arguments. */
6198 saved_integral_constant_expression_p
6200 saved_non_integral_constant_expression_p
6203 }
6204 args = (cp_parser_parenthesized_expression_list
6210 {
6211 parser->integral_constant_expression_p
6213 parser->non_integral_constant_expression_p
6215 }
6218 {
6221 }
6223 /* Function calls are not permitted in
6224 constant-expressions. */
6227 NIC_FUNC_CALL))
6228 {
6232 }
6237 {
6239 {
6241 {
6244 postfix_expression
6246 complain);
6247 }
6248 else
6249 postfix_expression
6251 }
6252 /* We do not perform argument-dependent lookup if
6253 normal lookup finds a non-function, in accordance
6254 with the expected resolution of DR 218. */
6257 {
6261 /* Do not do argument dependent lookup if regular
6262 lookup finds a member function or a block-scope
6263 function declaration. [basic.lookup.argdep]/3 */
6266 {
6269 postfix_expression
6271 complain);
6272 }
6273 }
6274 }
6277 {
6287 "%<memset%> used with constant zero length "
6288 "parameter; this could be due to transposed "
6291 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6292 to avoid leaking those into folder and middle-end. */
6294 tree arg;
6298 }
6301 {
6311 {
6312 postfix_expression
6316 }
6319 {
6320 postfix_expression
6321 = (build_new_method_call
6327 complain));
6328 }
6329 else
6330 postfix_expression
6334 complain);
6335 }
6339 postfix_expression = (build_offset_ref_call_from_tree
6341 complain));
6343 /* A call to a static class member, or a namespace-scope
6344 function. */
6345 postfix_expression
6348 koenig_p,
6349 complain);
6350 else
6351 /* All other function calls. */
6352 postfix_expression
6355 koenig_p,
6356 complain);
6360 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6364 }
6369 /* postfix-expression . template [opt] id-expression
6370 postfix-expression . pseudo-destructor-name
6371 postfix-expression -> template [opt] id-expression
6372 postfix-expression -> pseudo-destructor-name */
6374 /* Consume the `.' or `->' operator. */
6377 postfix_expression
6379 postfix_expression,
6386 /* postfix-expression ++ */
6387 /* Consume the `++' token. */
6389 /* Generate a representation for the complete expression. */
6390 postfix_expression
6392 POSTINCREMENT_EXPR);
6393 /* Increments may not appear in constant-expressions. */
6401 /* postfix-expression -- */
6402 /* Consume the `--' token. */
6404 /* Generate a representation for the complete expression. */
6405 postfix_expression
6407 POSTDECREMENT_EXPR);
6408 /* Decrements may not appear in constant-expressions. */
6420 else
6422 }
6423 }
6425 /* We should never get here. */
6428 }
6430 /* This function parses Cilk Plus array notations. If a normal array expr. is
6431 parsed then the array index is passed back to the caller through *INIT_INDEX
6432 and the function returns a NULL_TREE. If array notation expr. is parsed,
6433 then *INIT_INDEX is ignored by the caller and the function returns
6434 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6435 error_mark_node. */
6437 static tree
6439 tree array_value)
6440 {
6444 {
6447 }
6456 {
6459 }
6461 {
6462 /* Consume the ':'. */
6465 /* If we are here, then we have a case like this A[:]. */
6467 {
6471 }
6475 }
6476 else
6477 {
6478 /* If we are here, then there are three valid possibilities:
6479 1. ARRAY [ EXP ]
6480 2. ARRAY [ EXP : EXP ]
6481 3. ARRAY [ EXP : EXP : EXP ] */
6485 {
6486 /* This indicates that we have a normal array expression. */
6489 }
6491 /* Consume the ':'. */
6495 {
6498 }
6499 }
6504 {
6508 }
6514 }
6516 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6517 by cp_parser_builtin_offsetof. We're looking for
6519 postfix-expression [ expression ]
6520 postfix-expression [ braced-init-list ] (C++11)
6522 FOR_OFFSETOF is set if we're being called in that context, which
6523 changes how we deal with integer constant expressions. */
6525 static tree
6527 tree postfix_expression,
6530 {
6535 /* Consume the `[' token. */
6541 /* Parse the index expression. */
6542 /* ??? For offsetof, there is a question of what to allow here. If
6543 offsetof is not being used in an integral constant expression context,
6544 then we *could* get the right answer by computing the value at runtime.
6545 If we are in an integral constant expression context, then we might
6546 could accept any constant expression; hard to say without analysis.
6547 Rather than open the barn door too wide right away, allow only integer
6548 constant expressions here. */
6551 else
6552 {
6554 {
6561 {
6563 "braced list index is not allowed with array "
6567 }
6568 }
6570 {
6571 /* Here are have these two options:
6572 ARRAY[EXP : EXP] - Array notation expr with default
6573 stride of 1.
6574 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6575 stride. */
6577 postfix_expression);
6580 }
6581 else
6583 }
6587 /* Look for the closing `]'. */
6590 /* Build the ARRAY_REF. */
6594 /* When not doing offsetof, array references are not permitted in
6595 constant-expressions. */
6601 }
6603 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6604 by cp_parser_builtin_offsetof. We're looking for
6606 postfix-expression . template [opt] id-expression
6607 postfix-expression . pseudo-destructor-name
6608 postfix-expression -> template [opt] id-expression
6609 postfix-expression -> pseudo-destructor-name
6611 FOR_OFFSETOF is set if we're being called in that context. That sorta
6612 limits what of the above we'll actually accept, but nevermind.
6613 TOKEN_TYPE is the "." or "->" token, which will already have been
6614 removed from the stream. */
6616 static tree
6619 tree postfix_expression,
6621 location_t location)
6622 {
6623 tree name;
6628 /* If this is a `->' operator, dereference the pointer. */
6631 tf_warning_or_error);
6632 /* Check to see whether or not the expression is type-dependent. */
6634 /* The identifier following the `->' or `.' is not qualified. */
6640 /* Enter the scope corresponding to the type of the object
6641 given by the POSTFIX_EXPRESSION. */
6643 {
6645 /* According to the standard, no expression should ever have
6646 reference type. Unfortunately, we do not currently match
6647 the standard in this respect in that our internal representation
6648 of an expression may have reference type even when the standard
6649 says it does not. Therefore, we have to manually obtain the
6650 underlying type here. */
6652 /* The type of the POSTFIX_EXPRESSION must be complete. */
6654 {
6656 postfix_expression);
6658 }
6659 /* Unlike the object expression in other contexts, *this is not
6660 required to be of complete type for purposes of class member
6661 access (5.2.5) outside the member function body. */
6665 /* Let the name lookup machinery know that we are processing a
6666 class member access expression. */
6668 /* If something went wrong, we want to be able to discern that case,
6669 as opposed to the case where there was no SCOPE due to the type
6670 of expression being dependent. */
6673 /* If the SCOPE was erroneous, make the various semantic analysis
6674 functions exit quickly -- and without issuing additional error
6675 messages. */
6678 }
6680 /* Assume this expression is not a pseudo-destructor access. */
6683 /* If the SCOPE is a scalar type, then, if this is a valid program,
6684 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6685 is type dependent, it can be pseudo-destructor-name or something else.
6686 Try to parse it as pseudo-destructor-name first. */
6688 {
6689 tree s;
6690 tree type;
6693 /* Parse the pseudo-destructor-name. */
6702 {
6704 postfix_expression
6707 }
6708 }
6711 {
6712 /* If the SCOPE is not a scalar type, we are looking at an
6713 ordinary class member access expression, rather than a
6714 pseudo-destructor-name. */
6717 /* Parse the id-expression. */
6718 name = (cp_parser_id_expression
6725 /* In general, build a SCOPE_REF if the member name is qualified.
6726 However, if the name was not dependent and has already been
6727 resolved; there is no need to build the SCOPE_REF. For example;
6729 struct X { void f(); };
6730 template <typename T> void f(T* t) { t->X::f(); }
6732 Even though "t" is dependent, "X::f" is not and has been resolved
6733 to a BASELINK; there is no need to include scope information. */
6735 /* But we do need to remember that there was an explicit scope for
6736 virtual function calls. */
6740 /* If the name is a template-id that names a type, we will get a
6741 TYPE_DECL here. That is invalid code. */
6743 {
6746 }
6747 else
6748 {
6750 {
6752 {
6756 }
6757 else
6760 name,
6761 template_p);
6765 }
6767 adjust_result_of_qualified_name_lookup
6769 postfix_expression
6771 template_p,
6772 tf_warning_or_error);
6773 }
6774 }
6776 /* We no longer need to look up names in the scope of the object on
6777 the left-hand side of the `.' or `->' operator. */
6780 /* Outside of offsetof, these operators may not appear in
6781 constant-expressions. */
6783 && (cp_parser_non_integral_constant_expression
6788 }
6790 /* Cache of LITERAL_ZERO_P constants. */
6794 /* Parse a parenthesized expression-list.
6796 expression-list:
6797 assignment-expression
6798 expression-list, assignment-expression
6800 attribute-list:
6801 expression-list
6802 identifier
6803 identifier, expression-list
6805 CAST_P is true if this expression is the target of a cast.
6807 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6808 argument pack.
6810 Returns a vector of trees. Each element is a representation of an
6811 assignment-expression. NULL is returned if the ( and or ) are
6812 missing. An empty, but allocated, vector is returned on no
6813 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6814 if we are parsing an attribute list for an attribute that wants a
6815 plain identifier argument, normal_attr for an attribute that wants
6816 an expression, or non_attr if we aren't parsing an attribute list. If
6817 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6818 not all of the expressions in the list were constant.
6819 WANT_LITERAL_ZERO_P is true if the caller is interested in
6820 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6821 immediately, this can be removed. */
6830 {
6836 /* Assume all the expressions will be constant. */
6845 /* Within a parenthesized expression, a `>' token is always
6846 the greater-than operator. */
6847 saved_greater_than_is_operator_p
6851 /* Consume expressions until there are no more. */
6854 {
6855 tree expr;
6857 /* At the beginning of attribute lists, check to see if the
6858 next token is an identifier. */
6861 {
6864 /* Consume the identifier. */
6866 /* Save the identifier. */
6868 }
6869 else
6870 {
6873 /* Parse the next assignment-expression. */
6875 {
6876 /* A braced-init-list. */
6882 }
6884 {
6885 expr = (cp_parser_constant_expression
6890 }
6891 else
6892 {
6896 {
6902 /* If a parameter is literal zero alone, remember it
6903 for -Wmemset-transposed-args warning. */
6906 && want_literal_zero_p
6908 == CPP_COMMA
6911 {
6918 else
6919 {
6924 }
6925 /* Consume the 0 token (or '\0', 0LL etc.). */
6927 }
6931 }
6934 cast_p);
6935 }
6940 /* If we have an ellipsis, then this is an expression
6941 expansion. */
6944 {
6945 /* Consume the `...'. */
6948 /* Build the argument pack. */
6950 }
6952 /* Add it to the list. We add error_mark_node
6953 expressions to the list, so that we can still tell if
6954 the correct form for a parenthesized expression-list
6955 is found. That gives better errors. */
6960 }
6962 /* After the first item, attribute lists look the same as
6963 expression lists. */
6966 get_comma:;
6967 /* If the next token isn't a `,', then we are done. */
6971 /* Otherwise, consume the `,' and keep going. */
6973 }
6976 {
6979 skip_comma:;
6980 /* We try and resync to an unnested comma, as that will give the
6981 user better diagnostics. */
6989 {
6990 parser->greater_than_is_operator_p
6993 }
6994 }
6996 parser->greater_than_is_operator_p
7003 }
7005 /* Parse a pseudo-destructor-name.
7007 pseudo-destructor-name:
7008 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7009 :: [opt] nested-name-specifier template template-id :: ~ type-name
7010 :: [opt] nested-name-specifier [opt] ~ type-name
7012 If either of the first two productions is used, sets *SCOPE to the
7013 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7014 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7015 or ERROR_MARK_NODE if the parse fails. */
7017 static void
7019 tree object,
7022 {
7025 /* Handle ~auto. */
7029 {
7032 "%<~auto%> only available with "
7039 }
7041 /* Assume that things will not work out. */
7044 /* Look for the optional `::' operator. */
7046 /* Look for the optional nested-name-specifier. */
7047 nested_name_specifier_p
7054 /* Now, if we saw a nested-name-specifier, we might be doing the
7055 second production. */
7058 {
7059 /* Consume the `template' keyword. */
7061 /* Parse the template-id. */
7065 class_type,
7067 /* Look for the `::' token. */
7069 }
7070 /* If the next token is not a `~', then there might be some
7071 additional qualification. */
7073 {
7074 /* At this point, we're looking for "type-name :: ~". The type-name
7075 must not be a class-name, since this is a pseudo-destructor. So,
7076 it must be either an enum-name, or a typedef-name -- both of which
7077 are just identifiers. So, we peek ahead to check that the "::"
7078 and "~" tokens are present; if they are not, then we can avoid
7079 calling type_name. */
7083 {
7086 }
7088 /* Look for the type-name. */
7093 /* Look for the `::' token. */
7095 }
7096 else
7099 /* Look for the `~'. */
7102 /* Once we see the ~, this has to be a pseudo-destructor. */
7106 /* Look for the type-name again. We are not responsible for
7107 checking that it matches the first type-name. */
7109 }
7111 /* Parse a unary-expression.
7113 unary-expression:
7114 postfix-expression
7115 ++ cast-expression
7116 -- cast-expression
7117 unary-operator cast-expression
7118 sizeof unary-expression
7119 sizeof ( type-id )
7120 alignof ( type-id ) [C++0x]
7121 new-expression
7122 delete-expression
7124 GNU Extensions:
7126 unary-expression:
7127 __extension__ cast-expression
7128 __alignof__ unary-expression
7129 __alignof__ ( type-id )
7130 alignof unary-expression [C++0x]
7131 __real__ cast-expression
7132 __imag__ cast-expression
7133 && identifier
7134 sizeof ( type-id ) { initializer-list , [opt] }
7135 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7136 __alignof__ ( type-id ) { initializer-list , [opt] }
7138 ADDRESS_P is true iff the unary-expression is appearing as the
7139 operand of the `&' operator. CAST_P is true if this expression is
7140 the target of a cast.
7142 Returns a representation of the expression. */
7144 static tree
7147 {
7151 /* Peek at the next token. */
7153 /* Some keywords give away the kind of expression. */
7155 {
7159 {
7162 {
7165 location_t first_loc;
7168 /* Consume the token. */
7171 /* Parse the operand. */
7176 else
7177 {
7178 /* ISO C++ defines alignof only with types, not with
7179 expressions. So pedwarn if alignof is used with a non-
7180 type expression. However, __alignof__ is ok. */
7183 "ISO C++ does not allow %<alignof%> "
7187 }
7188 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7189 SIZEOF_EXPR with the original operand. */
7191 {
7193 {
7195 {
7198 error_mark_node));
7200 }
7201 else
7205 }
7207 }
7209 }
7218 {
7219 /* The saved value of the PEDANTIC flag. */
7221 tree expr;
7223 /* Save away the PEDANTIC flag. */
7225 /* Parse the cast-expression. */
7227 /* Restore the PEDANTIC flag. */
7231 }
7235 {
7236 tree expression;
7238 /* Consume the `__real__' or `__imag__' token. */
7240 /* Parse the cast-expression. */
7242 /* Create the complete representation. */
7246 expression,
7247 tf_warning_or_error);
7248 }
7256 {
7257 tree expr;
7267 parser->type_definition_forbidden_message
7270 saved_integral_constant_expression_p
7272 saved_non_integral_constant_expression_p
7276 saved_greater_than_is_operator_p
7288 parser->greater_than_is_operator_p
7291 parser->integral_constant_expression_p
7293 parser->non_integral_constant_expression_p
7300 }
7304 }
7305 }
7307 /* Look for the `:: new' and `:: delete', which also signal the
7308 beginning of a new-expression, or delete-expression,
7309 respectively. If the next token is `::', then it might be one of
7310 these. */
7312 {
7315 /* See if the token after the `::' is one of the keywords in
7316 which we're interested. */
7318 /* If it's `new', we have a new-expression. */
7321 /* Similarly, for `delete'. */
7324 }
7326 /* Look for a unary operator. */
7328 /* The `++' and `--' operators can be handled similarly, even though
7329 they are not technically unary-operators in the grammar. */
7331 {
7336 /* Handle the GNU address-of-label extension. */
7339 {
7340 tree identifier;
7341 tree expression;
7344 /* Consume the '&&' token. */
7346 /* Look for the identifier. */
7348 /* Create an expression representing the address. */
7351 NIC_ADDR_LABEL))
7354 }
7355 }
7357 {
7358 tree cast_expression;
7364 /* Consume the operator token. */
7366 /* Parse the cast-expression. */
7367 cast_expression
7372 pidk);
7373 /* Now, build an appropriate representation. */
7375 {
7379 RO_UNARY_STAR,
7380 complain);
7385 /* Fall through. */
7388 cast_expression,
7389 complain);
7396 /* Fall through. */
7406 }
7410 non_constant_p))
7414 }
7418 decltype_p,
7419 pidk);
7420 }
7422 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7423 unary-operator, the corresponding tree code is returned. */
7425 static enum tree_code
7427 {
7429 {
7450 }
7451 }
7453 /* Parse a new-expression.
7455 new-expression:
7456 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7457 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7459 Returns a representation of the expression. */
7461 static tree
7463 {
7466 tree type;
7469 tree ret;
7471 /* Look for the optional `::' operator. */
7472 global_scope_p
7476 /* Look for the `new' operator. */
7478 /* There's no easy way to tell a new-placement from the
7479 `( type-id )' construct. */
7481 /* Look for a new-placement. */
7483 /* If that didn't work out, there's no new-placement. */
7485 {
7489 }
7491 /* If the next token is a `(', then we have a parenthesized
7492 type-id. */
7494 {
7498 /* Consume the `('. */
7501 /* Parse the type-id. */
7502 parser->type_definition_forbidden_message
7507 /* Look for the closing `)'. */
7510 /* There should not be a direct-new-declarator in this production,
7511 but GCC used to allowed this, so we check and emit a sensible error
7512 message for this case. */
7514 {
7520 }
7521 }
7522 /* Otherwise, there must be a new-type-id. */
7523 else
7526 /* If the next token is a `(' or '{', then we have a new-initializer. */
7530 else
7533 /* A new-expression may not appear in an integral constant
7534 expression. */
7537 else
7538 {
7539 /* Create a representation of the new-expression. */
7541 tf_warning_or_error);
7542 }
7550 }
7552 /* Parse a new-placement.
7554 new-placement:
7555 ( expression-list )
7557 Returns the same representation as for an expression-list. */
7561 {
7564 /* Parse the expression-list. */
7565 expression_list = (cp_parser_parenthesized_expression_list
7571 }
7573 /* Parse a new-type-id.
7575 new-type-id:
7576 type-specifier-seq new-declarator [opt]
7578 Returns the TYPE allocated. If the new-type-id indicates an array
7579 type, *NELTS is set to the number of elements in the last array
7580 bound; the TYPE will not include the last array bound. */
7582 static tree
7584 {
7585 cp_decl_specifier_seq type_specifier_seq;
7591 /* The type-specifier sequence must not contain type definitions.
7592 (It cannot contain declarations of new types either, but if they
7593 are not definitions we will catch that because they are not
7594 complete.) */
7596 parser->type_definition_forbidden_message
7598 /* Parse the type-specifier-seq. */
7602 /* Restore the old message. */
7608 /* Parse the new-declarator. */
7611 /* Determine the number of elements in the last array dimension, if
7612 any. */
7614 /* Skip down to the last array dimension. */
7619 {
7622 }
7627 {
7630 }
7633 {
7640 else
7642 }
7645 }
7647 /* Parse an (optional) new-declarator.
7649 new-declarator:
7650 ptr-operator new-declarator [opt]
7651 direct-new-declarator
7653 Returns the declarator. */
7657 {
7660 cp_cv_quals cv_quals;
7662 /* We don't know if there's a ptr-operator next, or not. */
7664 /* Look for a ptr-operator. */
7666 /* If that worked, look for more new-declarators. */
7668 {
7671 /* Parse another optional declarator. */
7674 declarator = cp_parser_make_indirect_declarator
7678 }
7680 /* If the next token is a `[', there is a direct-new-declarator. */
7685 }
7687 /* Parse a direct-new-declarator.
7689 direct-new-declarator:
7690 [ expression ]
7691 direct-new-declarator [constant-expression]
7693 */
7697 {
7701 {
7702 tree expression;
7705 /* Look for the opening `['. */
7710 /* The standard requires that the expression have integral
7711 type. DR 74 adds enumeration types. We believe that the
7712 real intent is that these expressions be handled like the
7713 expression in a `switch' condition, which also allows
7714 classes with a single conversion to integral or
7715 enumeration type. */
7717 {
7718 expression
7720 expression,
7723 {
7725 "expression in new-declarator must have integral "
7728 }
7729 }
7731 /* Look for the closing `]'. */
7734 /* Add this bound to the declarator. */
7737 /* If the next token is not a `[', then there are no more
7738 bounds. */
7741 }
7744 }
7746 /* Parse a new-initializer.
7748 new-initializer:
7749 ( expression-list [opt] )
7750 braced-init-list
7752 Returns a representation of the expression-list. */
7756 {
7760 {
7761 tree t;
7768 }
7769 else
7770 expression_list = (cp_parser_parenthesized_expression_list
7776 }
7778 /* Parse a delete-expression.
7780 delete-expression:
7781 :: [opt] delete cast-expression
7782 :: [opt] delete [ ] cast-expression
7784 Returns a representation of the expression. */
7786 static tree
7788 {
7791 tree expression;
7793 /* Look for the optional `::' operator. */
7794 global_scope_p
7798 /* Look for the `delete' keyword. */
7800 /* See if the array syntax is in use. */
7802 {
7803 /* Consume the `[' token. */
7805 /* Look for the `]' token. */
7807 /* Remember that this is the `[]' construct. */
7809 }
7810 else
7813 /* Parse the cast-expression. */
7816 /* A delete-expression may not appear in an integral constant
7817 expression. */
7822 tf_warning_or_error);
7823 }
7825 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7826 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7827 0 otherwise. */
7829 static int
7831 {
7834 {
7876 /* In ((type ()) () the last () isn't a valid cast-expression,
7877 so the whole must be parsed as postfix-expression. */
7882 /* '[' may start a primary-expression in obj-c++ and in C++11,
7883 as a lambda-expression, eg, '(void)[]{}'. */
7890 /* '++' and '--' may or may not start a cast-expression:
7892 struct T { void operator++(int); };
7893 void f() { (T())++; }
7895 vs
7897 int a;
7898 (int)++a; */
7903 }
7904 }
7906 /* Parse a cast-expression.
7908 cast-expression:
7909 unary-expression
7910 ( type-id ) cast-expression
7912 ADDRESS_P is true iff the unary-expression is appearing as the
7913 operand of the `&' operator. CAST_P is true if this expression is
7914 the target of a cast.
7916 Returns a representation of the expression. */
7918 static tree
7921 {
7922 /* If it's a `(', then we might be looking at a cast. */
7924 {
7930 /* There's no way to know yet whether or not this is a cast.
7931 For example, `(int (3))' is a unary-expression, while `(int)
7932 3' is a cast. So, we resort to parsing tentatively. */
7934 /* Types may not be defined in a cast. */
7936 parser->type_definition_forbidden_message
7938 /* Consume the `('. */
7940 /* A very tricky bit is that `(struct S) { 3 }' is a
7941 compound-literal (which we permit in C++ as an extension).
7942 But, that construct is not a cast-expression -- it is a
7943 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7944 is legal; if the compound-literal were a cast-expression,
7945 you'd need an extra set of parentheses.) But, if we parse
7946 the type-id, and it happens to be a class-specifier, then we
7947 will commit to the parse at that point, because we cannot
7948 undo the action that is done when creating a new class. So,
7949 then we cannot back up and do a postfix-expression.
7951 Another tricky case is the following (c++/29234):
7953 struct S { void operator () (); };
7955 void foo ()
7956 {
7957 ( S()() );
7958 }
7960 As a type-id we parse the parenthesized S()() as a function
7961 returning a function, groktypename complains and we cannot
7962 back up in this case either.
7964 Therefore, we scan ahead to the closing `)', and check to see
7965 if the tokens after the `)' can start a cast-expression. Otherwise
7966 we are dealing with an unary-expression, a postfix-expression
7967 or something else.
7969 Yet another tricky case, in C++11, is the following (c++/54891):
7971 (void)[]{};
7973 The issue is that usually, besides the case of lambda-expressions,
7974 the parenthesized type-id cannot be followed by '[', and, eg, we
7975 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7976 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7977 we don't commit, we try a cast-expression, then an unary-expression.
7979 Save tokens so that we can put them back. */
7982 /* We may be looking at a cast-expression. */
7985 cast_expression
7988 /* Roll back the tokens we skipped. */
7990 /* If we aren't looking at a cast-expression, simulate an error so
7991 that the call to cp_parser_error_occurred below returns true. */
7994 else
7995 {
7998 /* Look for the type-id. */
8000 /* Look for the closing `)'. */
8003 }
8005 /* Restore the saved message. */
8008 /* At this point this can only be either a cast or a
8009 parenthesized ctor such as `(T ())' that looks like a cast to
8010 function returning T. */
8012 {
8013 /* Only commit if the cast-expression doesn't start with
8014 '++', '--', or '[' in C++11. */
8022 pidk);
8025 {
8026 /* Warn about old-style casts, if so requested. */
8033 /* Only type conversions to integral or enumeration types
8034 can be used in constant-expressions. */
8037 NIC_CAST))
8040 /* Perform the cast. */
8043 }
8044 }
8045 else
8047 }
8049 /* If we get here, then it's not a cast, so it must be a
8050 unary-expression. */
8053 }
8055 /* Parse a binary expression of the general form:
8057 pm-expression:
8058 cast-expression
8059 pm-expression .* cast-expression
8060 pm-expression ->* cast-expression
8062 multiplicative-expression:
8063 pm-expression
8064 multiplicative-expression * pm-expression
8065 multiplicative-expression / pm-expression
8066 multiplicative-expression % pm-expression
8068 additive-expression:
8069 multiplicative-expression
8070 additive-expression + multiplicative-expression
8071 additive-expression - multiplicative-expression
8073 shift-expression:
8074 additive-expression
8075 shift-expression << additive-expression
8076 shift-expression >> additive-expression
8078 relational-expression:
8079 shift-expression
8080 relational-expression < shift-expression
8081 relational-expression > shift-expression
8082 relational-expression <= shift-expression
8083 relational-expression >= shift-expression
8085 GNU Extension:
8087 relational-expression:
8088 relational-expression <? shift-expression
8089 relational-expression >? shift-expression
8091 equality-expression:
8092 relational-expression
8093 equality-expression == relational-expression
8094 equality-expression != relational-expression
8096 and-expression:
8097 equality-expression
8098 and-expression & equality-expression
8100 exclusive-or-expression:
8101 and-expression
8102 exclusive-or-expression ^ and-expression
8104 inclusive-or-expression:
8105 exclusive-or-expression
8106 inclusive-or-expression | exclusive-or-expression
8108 logical-and-expression:
8109 inclusive-or-expression
8110 logical-and-expression && inclusive-or-expression
8112 logical-or-expression:
8113 logical-and-expression
8114 logical-or-expression || logical-and-expression
8116 All these are implemented with a single function like:
8118 binary-expression:
8119 simple-cast-expression
8120 binary-expression <token> binary-expression
8122 CAST_P is true if this expression is the target of a cast.
8124 The binops_by_token map is used to get the tree codes for each <token> type.
8125 binary-expressions are associated according to a precedence table. */
8127 #define TOKEN_PRECEDENCE(token) \
8128 (((token->type == CPP_GREATER \
8129 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8130 && !parser->greater_than_is_operator_p) \
8131 ? PREC_NOT_OPERATOR \
8132 : binops_by_token[token->type].prec)
8134 static tree
8140 {
8141 cp_parser_expression_stack stack;
8143 cp_parser_expression_stack_entry current;
8144 tree rhs;
8148 tree overload;
8150 /* Parse the first expression. */
8161 {
8162 /* Get an operator token. */
8168 {
8170 "%<>>%> operator is treated"
8174 }
8178 /* Popping an entry off the stack means we completed a subexpression:
8179 - either we found a token which is not an operator (`>' where it is not
8180 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8181 will happen repeatedly;
8182 - or, we found an operator which has lower priority. This is the case
8183 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8184 parsing `3 * 4'. */
8186 {
8189 else
8191 }
8193 get_rhs:
8197 /* We used the operator token. */
8200 /* For "false && x" or "true || x", x will never be executed;
8201 disable warnings while evaluating it. */
8207 /* Extract another operand. It may be the RHS of this expression
8208 or the LHS of a new, higher priority expression. */
8213 /* Get another operator token. Look up its precedence to avoid
8214 building a useless (immediately popped) stack entry for common
8215 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8219 {
8220 /* ... and prepare to parse the RHS of the new, higher priority
8221 expression. Since precedence levels on the stack are
8222 monotonically increasing, we do not have to care about
8223 stack overflows. */
8232 pop:
8234 /* If the stack is not empty, we have parsed into LHS the right side
8235 (`4' in the example above) of an expression we had suspended.
8236 We can use the information on the stack to recover the LHS (`3')
8237 from the stack together with the tree code (`MULT_EXPR'), and
8238 the precedence of the higher level subexpression
8239 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8240 which will be used to actually build the additive expression. */
8245 }
8247 /* Undo the disabling of warnings done above. */
8256 /* Avoid warning for !!x == y. */
8261 /* Avoid warning for !b == y where b is boolean. */
8265 /* Avoid warning for !!b == y where b is boolean. */
8273 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8274 ERROR_MARK for everything that is not a binary expression.
8275 This makes warn_about_parentheses miss some warnings that
8276 involve unary operators. For unary expressions we should
8277 pass the correct tree_code unless the unary expression was
8278 surrounded by parentheses.
8279 */
8285 == tcc_comparison
8288 else
8297 /* If the binary operator required the use of an overloaded operator,
8298 then this expression cannot be an integral constant-expression.
8299 An overloaded operator can be used even if both operands are
8300 otherwise permissible in an integral constant-expression if at
8301 least one of the operands is of enumeration type. */
8305 NIC_OVERLOADED))
8307 }
8310 }
8312 static tree
8317 {
8320 }
8322 /* Parse the `? expression : assignment-expression' part of a
8323 conditional-expression. The LOGICAL_OR_EXPR is the
8324 logical-or-expression that started the conditional-expression.
8325 Returns a representation of the entire conditional-expression.
8327 This routine is used by cp_parser_assignment_expression.
8329 ? expression : assignment-expression
8331 GNU Extensions:
8333 ? : assignment-expression */
8335 static tree
8337 {
8338 tree expr;
8339 tree assignment_expr;
8343 /* Consume the `?' token. */
8348 {
8351 /* Implicit true clause. */
8355 }
8356 else
8357 {
8360 /* Parse the expression. */
8363 c_inhibit_evaluation_warnings +=
8367 }
8369 /* The next token should be a `:'. */
8371 /* Parse the assignment-expression. */
8375 /* Build the conditional-expression. */
8377 expr,
8378 assignment_expr,
8379 tf_warning_or_error);
8380 }
8382 /* Parse an assignment-expression.
8384 assignment-expression:
8385 conditional-expression
8386 logical-or-expression assignment-operator assignment_expression
8387 throw-expression
8389 CAST_P is true if this expression is the target of a cast.
8390 DECLTYPE_P is true if this expression is the operand of decltype.
8392 Returns a representation for the expression. */
8394 static tree
8397 {
8398 tree expr;
8400 /* If the next token is the `throw' keyword, then we're looking at
8401 a throw-expression. */
8404 /* Otherwise, it must be that we are looking at a
8405 logical-or-expression. */
8406 else
8407 {
8408 /* Parse the binary expressions (logical-or-expression). */
8410 decltype_p,
8412 /* If the next token is a `?' then we're actually looking at a
8413 conditional-expression. */
8416 else
8417 {
8420 /* If it's an assignment-operator, we're using the second
8421 production. */
8422 enum tree_code assignment_operator
8425 {
8427 location_t saved_input_location;
8429 /* Parse the right-hand side of the assignment. */
8435 /* An assignment may not appear in a
8436 constant-expression. */
8438 NIC_ASSIGNMENT))
8440 /* Build the assignment expression. Its default
8441 location is the location of the '=' token. */
8445 assignment_operator,
8446 rhs,
8449 }
8450 }
8451 }
8454 }
8456 /* Parse an (optional) assignment-operator.
8458 assignment-operator: one of
8459 = *= /= %= += -= >>= <<= &= ^= |=
8461 GNU Extension:
8463 assignment-operator: one of
8464 <?= >?=
8466 If the next token is an assignment operator, the corresponding tree
8467 code is returned, and the token is consumed. For example, for
8468 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8469 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8470 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8471 operator, ERROR_MARK is returned. */
8473 static enum tree_code
8475 {
8479 /* Peek at the next token. */
8483 {
8529 /* Nothing else is an assignment operator. */
8531 }
8533 /* If it was an assignment operator, consume it. */
8538 }
8540 /* Parse an expression.
8542 expression:
8543 assignment-expression
8544 expression , assignment-expression
8546 CAST_P is true if this expression is the target of a cast.
8547 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8548 except possibly parenthesized or on the RHS of a comma (N3276).
8550 Returns a representation of the expression. */
8552 static tree
8555 {
8560 {
8561 tree assignment_expression;
8563 /* Parse the next assignment-expression. */
8564 assignment_expression
8567 /* We don't create a temporary for a call that is the immediate operand
8568 of decltype or on the RHS of a comma. But when we see a comma, we
8569 need to create a temporary for a call on the LHS. */
8574 assignment_expression
8578 /* If this is the first assignment-expression, we can just
8579 save it away. */
8582 else
8584 assignment_expression,
8586 /* If the next token is not a comma, then we are done with the
8587 expression. */
8590 /* Consume the `,'. */
8593 /* A comma operator cannot appear in a constant-expression. */
8596 }
8599 }
8601 /* Parse a constant-expression.
8603 constant-expression:
8604 conditional-expression
8606 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8607 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8608 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8609 is false, NON_CONSTANT_P should be NULL. */
8611 static tree
8615 {
8619 tree expression;
8621 /* It might seem that we could simply parse the
8622 conditional-expression, and then check to see if it were
8623 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8624 one that the compiler can figure out is constant, possibly after
8625 doing some simplifications or optimizations. The standard has a
8626 precise definition of constant-expression, and we must honor
8627 that, even though it is somewhat more restrictive.
8629 For example:
8631 int i[(2, 3)];
8633 is not a legal declaration, because `(2, 3)' is not a
8634 constant-expression. The `,' operator is forbidden in a
8635 constant-expression. However, GCC's constant-folding machinery
8636 will fold this operation to an INTEGER_CST for `3'. */
8638 /* Save the old settings. */
8640 saved_allow_non_integral_constant_expression_p
8643 /* We are now parsing a constant-expression. */
8645 parser->allow_non_integral_constant_expression_p
8648 /* Although the grammar says "conditional-expression", we parse an
8649 "assignment-expression", which also permits "throw-expression"
8650 and the use of assignment operators. In the case that
8651 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8652 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8653 actually essential that we look for an assignment-expression.
8654 For example, cp_parser_initializer_clauses uses this function to
8655 determine whether a particular assignment-expression is in fact
8656 constant. */
8658 /* Restore the old settings. */
8659 parser->integral_constant_expression_p
8661 parser->allow_non_integral_constant_expression_p
8664 {
8665 /* Require an rvalue constant expression here; that's what our
8666 callers expect. Reference constant expressions are handled
8667 separately in e.g. cp_parser_template_argument. */
8672 }
8675 parser->non_integral_constant_expression_p
8679 }
8681 /* Parse __builtin_offsetof.
8683 offsetof-expression:
8684 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8686 offsetof-member-designator:
8687 id-expression
8688 | offsetof-member-designator "." id-expression
8689 | offsetof-member-designator "[" expression "]"
8690 | offsetof-member-designator "->" id-expression */
8692 static tree
8694 {
8697 cp_id_kind dummy;
8700 /* We're about to accept non-integral-constant things, but will
8701 definitely yield an integral constant expression. Save and
8702 restore these values around our local parsing. */
8706 /* Consume the "__builtin_offsetof" token. */
8708 /* Consume the opening `('. */
8710 /* Parse the type-id. */
8713 /* Look for the `,'. */
8717 /* Build the (type *)null that begins the traditional offsetof macro. */
8719 tf_warning_or_error);
8721 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8725 {
8728 {
8730 /* offsetof-member-designator "[" expression "]" */
8736 /* offsetof-member-designator "->" identifier */
8739 /* FALLTHRU */
8742 /* offsetof-member-designator "." identifier */
8750 /* Consume the ")" token. */
8755 /* Error. We know the following require will fail, but
8756 that gives the proper error message. */
8761 }
8762 }
8764 success:
8767 failure:
8772 }
8774 /* Parse a trait expression.
8776 Returns a representation of the expression, the underlying type
8777 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8779 static tree
8781 {
8782 cp_trait_kind kind;
8788 {
8872 }
8874 /* Consume the token. */
8885 {
8892 }
8894 {
8896 {
8900 {
8903 }
8907 }
8908 }
8912 /* Complete the trait expression, which may mean either processing
8913 the trait expr now or saving it for template instantiation. */
8915 {
8924 }
8925 }
8927 /* Lambdas that appear in variable initializer or default argument scope
8928 get that in their mangling, so we need to record it. We might as well
8929 use the count for function and namespace scopes as well. */
8933 {
8934 tree t;
8939 static void
8941 {
8942 tree_int ti;
8944 /* Once we're inside a function, we ignore other scopes and just push
8945 the function again so that popping works properly. */
8952 {
8953 /* Don't reset the count if we're still in the same function. */
8956 }
8957 }
8959 static void
8961 {
8964 }
8966 static void
8968 {
8971 {
8974 }
8976 }
8978 /* Parse a lambda expression.
8980 lambda-expression:
8981 lambda-introducer lambda-declarator [opt] compound-statement
8983 Returns a representation of the expression. */
8985 static tree
8987 {
8989 tree type;
8997 {
8999 {
9003 }
9005 }
9007 {
9009 {
9012 }
9014 }
9016 /* We may be in the middle of deferred access check. Disable
9017 it now. */
9028 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9031 /* Now that we've started the type, add the capture fields for any
9032 explicit captures. */
9035 {
9036 /* Inside the class, surrounding template-parameter-lists do not apply. */
9037 unsigned int saved_num_template_parameter_lists
9041 bool fully_implicit_function_template_p
9045 bool auto_is_implicit_function_template_parm_p
9056 /* By virtue of defining a local class, a lambda expression has access to
9057 the private variables of enclosing classes. */
9062 {
9068 }
9070 {
9073 }
9075 /* The capture list was built up in reverse order; fix that now. */
9087 parser->fully_implicit_function_template_p
9091 parser->auto_is_implicit_function_template_parm_p
9093 }
9097 /* This field is only used during parsing of the lambda. */
9100 /* This lambda shouldn't have any proxies left at this point. */
9102 /* And now that we're done, push proxies for an enclosing lambda. */
9107 else
9113 }
9115 /* Parse the beginning of a lambda expression.
9117 lambda-introducer:
9118 [ lambda-capture [opt] ]
9120 LAMBDA_EXPR is the current representation of the lambda expression. */
9122 static void
9124 {
9125 /* Need commas after the first capture. */
9128 /* Eat the leading `['. */
9131 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9139 {
9142 }
9145 {
9147 tree capture_id;
9148 tree capture_init_expr;
9152 enum capture_kind_type
9153 {
9154 BY_COPY,
9155 BY_REFERENCE
9156 };
9160 {
9163 }
9167 else
9170 /* Possibly capture `this'. */
9172 {
9182 explicit_init_p);
9184 }
9186 /* Remember whether we want to capture as a reference or not. */
9188 {
9191 }
9193 /* Get the identifier. */
9198 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9199 delimiters, but I modified this to stop on unnested ']' as well. It
9200 was already changed to stop on unnested '}', so the
9201 "closing_parenthesis" name is no more misleading with my change. */
9202 {
9208 }
9210 /* Find the initializer for this capture. */
9214 {
9216 /* An explicit initializer exists. */
9219 "lambda capture initializers "
9225 {
9228 }
9229 }
9230 else
9231 {
9234 /* Turn the identifier into an id-expression. */
9235 capture_init_expr
9240 {
9243 }
9247 {
9250 capture_init_expr);
9253 }
9256 {
9259 capture_init_expr))
9262 }
9264 capture_init_expr
9265 = finish_id_expression
9267 capture_init_expr,
9281 {
9284 }
9285 else
9287 }
9291 {
9296 capture_id);
9300 "capture of %qD redundant with by-reference capture "
9302 }
9305 capture_id,
9306 capture_init_expr,
9308 explicit_init_p);
9309 }
9312 }
9314 /* Parse the (optional) middle of a lambda expression.
9316 lambda-declarator:
9317 < template-parameter-list [opt] >
9318 ( parameter-declaration-clause [opt] )
9319 attribute-specifier [opt]
9320 mutable [opt]
9321 exception-specification [opt]
9322 lambda-return-type-clause [opt]
9324 LAMBDA_EXPR is the current representation of the lambda expression. */
9326 static bool
9328 {
9329 /* 5.1.1.4 of the standard says:
9330 If a lambda-expression does not include a lambda-declarator, it is as if
9331 the lambda-declarator were ().
9332 This means an empty parameter list, no attributes, and no exception
9333 specification. */
9339 /* The template-parameter-list is optional, but must begin with
9340 an opening angle if present. */
9342 {
9345 "lambda templates are only available with "
9354 /* We just processed one more parameter list. */
9356 }
9358 /* The parameter-declaration-clause is optional (unless
9359 template-parameter-list was given), but must begin with an
9360 opening parenthesis if present. */
9362 {
9367 /* Parse parameters. */
9370 /* Default arguments shall not be specified in the
9371 parameter-declaration-clause of a lambda-declarator. */
9381 /* Parse optional `mutable' keyword. */
9383 {
9386 }
9388 /* Parse optional exception specification. */
9391 /* Parse optional trailing return type. */
9393 {
9397 }
9399 /* The function parameters must be in scope all the way until after the
9400 trailing-return-type in case of decltype. */
9402 }
9406 /* Create the function call operator.
9408 Messing with declarators like this is no uglier than building up the
9409 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9410 other code. */
9411 {
9412 cp_decl_specifier_seq return_type_specs;
9414 tree fco;
9421 else
9422 /* Maybe we will deduce the return type later. */
9428 sfk_none);
9433 VIRT_SPEC_UNSPECIFIED,
9434 REF_QUAL_NONE,
9435 exception_spec,
9440 declarator,
9441 attributes);
9443 {
9446 /* Give the object parameter a different name. */
9450 }
9452 {
9456 }
9465 }
9466 }
9468 /* Parse the body of a lambda expression, which is simply
9470 compound-statement
9472 but which requires special handling.
9473 LAMBDA_EXPR is the current representation of the lambda expression. */
9475 static void
9477 {
9482 else
9483 /* Still increment function_depth so that we don't GC in the
9484 middle of an expression. */
9486 /* Clear this in case we're in the middle of a default argument. */
9489 /* Finish the function call operator
9490 - class_specifier
9491 + late_parsing_for_member
9492 + function_definition_after_declarator
9493 + ctor_initializer_opt_and_function_body */
9494 {
9496 tree body;
9498 tree compound_stmt;
9499 tree cap;
9501 /* Let the front end know that we are going to be defining this
9502 function. */
9504 NULL_TREE,
9513 /* Push the proxies for any explicit captures. */
9520 /* 5.1.1.4 of the standard says:
9521 If a lambda-expression does not include a trailing-return-type, it
9522 is as if the trailing-return-type denotes the following type:
9523 * if the compound-statement is of the form
9524 { return attribute-specifier [opt] expression ; }
9525 the type of the returned expression after lvalue-to-rvalue
9526 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9527 (_conv.array_ 4.2), and function-to-pointer conversion
9528 (_conv.func_ 4.3);
9529 * otherwise, void. */
9531 /* In a lambda that has neither a lambda-return-type-clause
9532 nor a deducible form, errors should be reported for return statements
9533 in the body. Since we used void as the placeholder return type, parsing
9534 the body as usual will give such desired behavior. */
9538 {
9542 /* Parse tentatively in case there's more after the initial return
9543 statement. */
9554 {
9558 /* Will get error here if type not deduced yet. */
9562 }
9563 }
9566 {
9571 }
9575 out:
9579 /* Finish the function and generate code for it if necessary. */
9582 /* Only expand if the call op is not a template. */
9585 }
9590 else
9592 }
9594 /* Statements [gram.stmt.stmt] */
9596 /* Parse a statement.
9598 statement:
9599 labeled-statement
9600 expression-statement
9601 compound-statement
9602 selection-statement
9603 iteration-statement
9604 jump-statement
9605 declaration-statement
9606 try-block
9608 C++11:
9610 statement:
9611 labeled-statement
9612 attribute-specifier-seq (opt) expression-statement
9613 attribute-specifier-seq (opt) compound-statement
9614 attribute-specifier-seq (opt) selection-statement
9615 attribute-specifier-seq (opt) iteration-statement
9616 attribute-specifier-seq (opt) jump-statement
9617 declaration-statement
9618 attribute-specifier-seq (opt) try-block
9620 TM Extension:
9622 statement:
9623 atomic-statement
9625 IN_COMPOUND is true when the statement is nested inside a
9626 cp_parser_compound_statement; this matters for certain pragmas.
9628 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9629 is a (possibly labeled) if statement which is not enclosed in braces
9630 and has an else clause. This is used to implement -Wparentheses. */
9632 static void
9635 {
9640 restart:
9643 /* There is no statement yet. */
9649 /* In obj-c++, seeing '[[' might be the either the beginning of
9650 c++11 attributes, or a nested objc-message-expression. So
9651 let's parse the c++11 attributes tentatively. */
9655 {
9658 }
9660 /* Peek at the next token. */
9662 /* Remember the location of the first token in the statement. */
9664 /* If this is a keyword, then that will often determine what kind of
9665 statement we have. */
9667 {
9671 {
9674 /* Looks like a labeled-statement with a case label.
9675 Parse the label, and then use tail recursion to parse
9676 the statement. */
9693 {
9698 }
9699 else
9713 {
9718 }
9719 else
9720 {
9724 }
9728 /* Objective-C++ exception-handling constructs. */
9742 /* This must be a namespace alias definition. */
9755 /* It might be a keyword like `int' that can start a
9756 declaration-statement. */
9758 }
9759 }
9761 {
9762 /* If the next token is a `:', then we are looking at a
9763 labeled-statement. */
9766 {
9767 /* Looks like a labeled-statement with an ordinary label.
9768 Parse the label, and then use tail recursion to parse
9769 the statement. */
9773 }
9774 }
9775 /* Anything that starts with a `{' must be a compound-statement. */
9778 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9779 a statement all its own. */
9781 {
9782 /* Only certain OpenMP pragmas are attached to statements, and thus
9783 are considered statements themselves. All others are not. In
9784 the context of a compound, accept the pragma as a "statement" and
9785 return so that we can check for a close brace. Otherwise we
9786 require a real statement and must go back and read one. */
9792 }
9794 {
9797 }
9799 /* Everything else must be a declaration-statement or an
9800 expression-statement. Try for the declaration-statement
9801 first, unless we are looking at a `;', in which case we know that
9802 we have an expression-statement. */
9804 {
9806 {
9808 {
9809 /* Attributes should be parsed as part of the the
9810 declaration, so let's un-parse them. */
9813 }
9816 /* Try to parse the declaration-statement. */
9818 /* If that worked, we're done. */
9821 }
9822 /* Look for an expression-statement instead. */
9824 }
9826 /* Set the line number for the statement. */
9830 /* Note that for now, we don't do anything with c++11 statements
9831 parsed at this level. */
9834 OPT_Wattributes,
9836 }
9838 /* Parse the label for a labeled-statement, i.e.
9840 identifier :
9841 case constant-expression :
9842 default :
9844 GNU Extension:
9845 case constant-expression ... constant-expression : statement
9847 When a label is parsed without errors, the label is added to the
9848 parse tree by the finish_* functions, so this function doesn't
9849 have to return the label. */
9851 static void
9853 {
9858 /* The next token should be an identifier. */
9862 {
9865 }
9869 {
9871 {
9875 /* Consume the `case' token. */
9877 /* Parse the constant-expression. */
9884 {
9885 /* Consume the `...' token. */
9891 /* We don't need to emit warnings here, as the common code
9892 will do this for us. */
9893 }
9894 else
9899 else
9902 expr);
9903 }
9907 /* Consume the `default' token. */
9912 else
9917 /* Anything else must be an ordinary label. */
9920 }
9922 /* Require the `:' token. */
9925 /* An ordinary label may optionally be followed by attributes.
9926 However, this is only permitted if the attributes are then
9927 followed by a semicolon. This is because, for backward
9928 compatibility, when parsing
9929 lab: __attribute__ ((unused)) int i;
9930 we want the attribute to attach to "i", not "lab". */
9933 {
9934 tree attrs;
9941 ;
9942 else
9944 }
9950 }
9952 /* Parse an expression-statement.
9954 expression-statement:
9955 expression [opt] ;
9957 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9958 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9959 indicates whether this expression-statement is part of an
9960 expression statement. */
9962 static tree
9964 {
9968 /* If the next token is a ';', then there is no expression
9969 statement. */
9971 {
9975 {
9978 }
9979 }
9981 /* Give a helpful message for "A<T>::type t;" and the like. */
9984 {
9991 {
9992 /* A::A a; */
9997 }
9998 }
10000 /* Consume the final `;'. */
10005 /* This is the final expression statement of a statement
10006 expression. */
10012 }
10014 /* Parse a compound-statement.
10016 compound-statement:
10017 { statement-seq [opt] }
10019 GNU extension:
10021 compound-statement:
10022 { label-declaration-seq [opt] statement-seq [opt] }
10024 label-declaration-seq:
10025 label-declaration
10026 label-declaration-seq label-declaration
10028 Returns a tree representing the statement. */
10030 static tree
10033 {
10034 tree compound_stmt;
10036 /* Consume the `{'. */
10043 /* Begin the compound-statement. */
10045 /* If the next keyword is `__label__' we have a label declaration. */
10048 /* Parse an (optional) statement-seq. */
10050 /* Finish the compound-statement. */
10052 /* Consume the `}'. */
10056 }
10058 /* Parse an (optional) statement-seq.
10060 statement-seq:
10061 statement
10062 statement-seq [opt] statement */
10064 static void
10066 {
10067 /* Scan statements until there aren't any more. */
10069 {
10072 /* If we are looking at a `}', then we have run out of
10073 statements; the same is true if we have reached the end
10074 of file, or have stumbled upon a stray '@end'. */
10081 /* If we are in a compound statement and find 'else' then
10082 something went wrong. */
10084 {
10087 else
10088 {
10091 }
10092 }
10094 /* Parse the statement. */
10096 }
10097 }
10099 /* Parse a selection-statement.
10101 selection-statement:
10102 if ( condition ) statement
10103 if ( condition ) statement else statement
10104 switch ( condition ) statement
10106 Returns the new IF_STMT or SWITCH_STMT.
10108 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10109 is a (possibly labeled) if statement which is not enclosed in
10110 braces and has an else clause. This is used to implement
10111 -Wparentheses. */
10113 static tree
10115 {
10122 /* Peek at the next token. */
10125 /* See what kind of keyword it is. */
10128 {
10131 {
10132 tree statement;
10133 tree condition;
10135 /* Look for the `('. */
10137 {
10140 }
10142 /* Begin the selection-statement. */
10145 else
10148 /* Parse the condition. */
10150 /* Look for the `)'. */
10156 {
10160 /* Add the condition. */
10163 /* Parse the then-clause. */
10167 {
10175 }
10176 else
10182 /* If the next token is `else', parse the else-clause. */
10184 RID_ELSE))
10185 {
10186 /* Consume the `else' keyword. */
10189 /* Parse the else-clause. */
10191 {
10192 location_t loc;
10199 }
10200 else
10205 /* If we are currently parsing a then-clause, then
10206 IF_P will not be NULL. We set it to true to
10207 indicate that this if statement has an else clause.
10208 This may trigger the Wparentheses warning below
10209 when we get back up to the parent if statement. */
10212 }
10213 else
10214 {
10215 /* This if statement does not have an else clause. If
10216 NESTED_IF is true, then the then-clause is an if
10217 statement which does have an else clause. We warn
10218 about the potential ambiguity. */
10221 "suggest explicit braces to avoid ambiguous"
10223 }
10225 /* Now we're all done with the if-statement. */
10227 }
10228 else
10229 {
10233 /* Add the condition. */
10236 /* Parse the body of the switch-statement. */
10245 /* Now we're all done with the switch-statement. */
10247 }
10250 }
10256 }
10257 }
10259 /* Parse a condition.
10261 condition:
10262 expression
10263 type-specifier-seq declarator = initializer-clause
10264 type-specifier-seq declarator braced-init-list
10266 GNU Extension:
10268 condition:
10269 type-specifier-seq declarator asm-specification [opt]
10270 attributes [opt] = assignment-expression
10272 Returns the expression that should be tested. */
10274 static tree
10276 {
10277 cp_decl_specifier_seq type_specifiers;
10281 /* Try the declaration first. */
10283 /* New types are not allowed in the type-specifier-seq for a
10284 condition. */
10286 parser->type_definition_forbidden_message
10288 /* Parse the type-specifier-seq. */
10290 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10293 /* Restore the saved message. */
10295 /* If all is well, we might be looking at a declaration. */
10297 {
10298 tree decl;
10299 tree asm_specification;
10300 tree attributes;
10304 /* Parse the declarator. */
10310 /* Parse the attributes. */
10312 /* Parse the asm-specification. */
10314 /* If the next token is not an `=' or '{', then we might still be
10315 looking at an expression. For example:
10317 if (A(a).x)
10319 looks like a decl-specifier-seq and a declarator -- but then
10320 there is no `=', so this is an expression. */
10325 /* If we did see an `=' or '{', then we are looking at a declaration
10326 for sure. */
10328 {
10329 tree pushed_scope;
10333 /* Create the declaration. */
10339 /* Parse the initializer. */
10341 {
10345 }
10346 else
10347 {
10348 /* Consume the `='. */
10351 }
10355 /* Process the initializer. */
10358 asm_specification,
10359 flags);
10365 }
10366 }
10367 /* If we didn't even get past the declarator successfully, we are
10368 definitely not looking at a declaration. */
10369 else
10372 /* Otherwise, we are looking at an expression. */
10374 }
10376 /* Parses a for-statement or range-for-statement until the closing ')',
10377 not included. */
10379 static tree
10381 {
10385 /* Begin the for-statement. */
10388 /* Parse the initialization. */
10393 else
10395 }
10397 static tree
10399 {
10400 /* Normal for loop */
10403 tree stmt;
10406 /* The for-init-statement has already been parsed in
10407 cp_parser_for_init_statement, so no work is needed here. */
10410 /* If there's a condition, process it. */
10414 {
10418 }
10420 /* Look for the `;'. */
10423 /* If there's an expression, process it. */
10429 }
10431 /* Tries to parse a range-based for-statement:
10433 range-based-for:
10434 decl-specifier-seq declarator : expression
10436 The decl-specifier-seq declarator and the `:' are already parsed by
10437 cp_parser_for_init_statement. If processing_template_decl it returns a
10438 newly created RANGE_FOR_STMT; if not, it is converted to a
10439 regular FOR_STMT. */
10441 static tree
10444 {
10448 {
10451 }
10452 else
10455 /* If in template, STMT is converted to a normal for-statement
10456 at instantiation. If not, it is done just ahead. */
10458 {
10466 /* do_auto_deduction doesn't mess with template init-lists. */
10469 }
10470 else
10471 {
10474 }
10476 }
10478 /* Subroutine of cp_convert_range_for: given the initializer expression,
10479 builds up the range temporary. */
10481 static tree
10483 {
10486 /* Find out the type deduced by the declaration
10487 `auto &&__range = range_expr'. */
10492 /* Create the __range variable. */
10499 }
10501 /* Used by cp_parser_range_for in template context: we aren't going to
10502 do a full conversion yet, but we still need to resolve auto in the
10503 type of the for-range-declaration if present. This is basically
10504 a shortcut version of cp_convert_range_for. */
10506 static void
10508 {
10511 {
10514 iter_type = (cp_parser_perform_range_for_lookup
10517 {
10519 iter_type);
10521 tf_warning_or_error);
10524 }
10525 }
10526 }
10528 /* Converts a range-based for-statement into a normal
10529 for-statement, as per the definition.
10531 for (RANGE_DECL : RANGE_EXPR)
10532 BLOCK
10534 should be equivalent to:
10536 {
10537 auto &&__range = RANGE_EXPR;
10538 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10539 __begin != __end;
10540 ++__begin)
10541 {
10542 RANGE_DECL = *__begin;
10543 BLOCK
10544 }
10545 }
10547 If RANGE_EXPR is an array:
10548 BEGIN_EXPR = __range
10549 END_EXPR = __range + ARRAY_SIZE(__range)
10550 Else if RANGE_EXPR has a member 'begin' or 'end':
10551 BEGIN_EXPR = __range.begin()
10552 END_EXPR = __range.end()
10553 Else:
10554 BEGIN_EXPR = begin(__range)
10555 END_EXPR = end(__range);
10557 If __range has a member 'begin' but not 'end', or vice versa, we must
10558 still use the second alternative (it will surely fail, however).
10559 When calling begin()/end() in the third alternative we must use
10560 argument dependent lookup, but always considering 'std' as an associated
10561 namespace. */
10563 tree
10566 {
10572 /* If an error happened previously do nothing or else a lot of
10573 unhelpful errors would be issued. */
10575 else
10576 {
10577 tree range_temp;
10581 /* Can't bind a reference to an array of runtime bound. */
10583 else
10584 {
10589 LOOKUP_ONLYCONVERTING);
10591 }
10594 }
10596 /* The new for initialization statement. */
10604 LOOKUP_ONLYCONVERTING);
10613 LOOKUP_ONLYCONVERTING);
10617 /* The new for condition. */
10624 /* The new increment expression. */
10627 tf_warning_or_error);
10630 /* The declaration is initialized with *__begin inside the loop body. */
10633 tf_warning_or_error),
10635 LOOKUP_ONLYCONVERTING);
10638 }
10640 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10641 We need to solve both at the same time because the method used
10642 depends on the existence of members begin or end.
10643 Returns the type deduced for the iterator expression. */
10645 static tree
10647 {
10649 {
10652 }
10655 {
10660 }
10662 {
10663 /* If RANGE is an array, we will use pointer arithmetic. */
10666 range,
10670 }
10671 else
10672 {
10673 /* If it is not an array, we must do a bit of magic. */
10683 tf_warning_or_error);
10686 tf_warning_or_error);
10689 {
10690 /* Use the member functions. */
10693 else
10699 else
10702 }
10703 else
10704 {
10705 /* Use global functions with ADL. */
10712 tf_warning_or_error);
10714 tf_warning_or_error);
10716 tf_warning_or_error);
10718 tf_warning_or_error);
10721 }
10723 /* Last common checks. */
10725 {
10726 /* If one of the expressions is an error do no more checks. */
10729 }
10732 /* Can happen, when, eg, in a template context, Koenig lookup
10733 can't resolve begin/end (c++/58503). */
10735 else
10736 {
10738 /* The unqualified type of the __begin and __end temporaries should
10739 be the same, as required by the multiple auto declaration. */
10745 }
10746 }
10747 }
10749 /* Helper function for cp_parser_perform_range_for_lookup.
10750 Builds a tree for RANGE.IDENTIFIER(). */
10752 static tree
10754 {
10767 tf_warning_or_error);
10770 }
10772 /* Parse an iteration-statement.
10774 iteration-statement:
10775 while ( condition ) statement
10776 do statement while ( expression ) ;
10777 for ( for-init-statement condition [opt] ; expression [opt] )
10778 statement
10780 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10782 static tree
10784 {
10787 tree statement;
10790 /* Peek at the next token. */
10795 /* Remember whether or not we are already within an iteration
10796 statement. */
10799 /* See what kind of keyword it is. */
10802 {
10804 {
10805 tree condition;
10807 /* Begin the while-statement. */
10809 /* Look for the `('. */
10811 /* Parse the condition. */
10814 /* Look for the `)'. */
10816 /* Parse the dependent statement. */
10820 /* We're done with the while-statement. */
10822 }
10826 {
10827 tree expression;
10829 /* Begin the do-statement. */
10831 /* Parse the body of the do-statement. */
10836 /* Look for the `while' keyword. */
10838 /* Look for the `('. */
10840 /* Parse the expression. */
10842 /* We're done with the do-statement. */
10844 /* Look for the `)'. */
10846 /* Look for the `;'. */
10848 }
10852 {
10853 /* Look for the `('. */
10858 /* Look for the `)'. */
10861 /* Parse the body of the for-statement. */
10866 /* We're done with the for-statement. */
10868 }
10875 }
10878 }
10880 /* Parse a for-init-statement or the declarator of a range-based-for.
10881 Returns true if a range-based-for declaration is seen.
10883 for-init-statement:
10884 expression-statement
10885 simple-declaration */
10887 static bool
10889 {
10890 /* If the next token is a `;', then we have an empty
10891 expression-statement. Grammatically, this is also a
10892 simple-declaration, but an invalid one, because it does not
10893 declare anything. Therefore, if we did not handle this case
10894 specially, we would issue an error message about an invalid
10895 declaration. */
10897 {
10903 {
10904 /* N3994 -- for (id : init) ... */
10907 "type-specifier only available with "
10915 }
10917 /* A colon is used in range-based for. */
10920 /* We're going to speculatively look for a declaration, falling back
10921 to an expression, if necessary. */
10923 /* Parse the declaration. */
10926 decl);
10929 {
10930 /* It is a range-for, consume the ':' */
10934 {
10936 "range-based %<for%> loops only available with "
10939 }
10940 }
10941 else
10942 /* The ';' is not consumed yet because we told
10943 cp_parser_simple_declaration not to. */
10948 /* If the tentative parse failed, then we shall need to look for an
10949 expression-statement. */
10950 }
10951 /* If we are here, it is an expression-statement. */
10954 }
10956 /* Parse a jump-statement.
10958 jump-statement:
10959 break ;
10960 continue ;
10961 return expression [opt] ;
10962 return braced-init-list ;
10963 goto identifier ;
10965 GNU extension:
10967 jump-statement:
10968 goto * expression ;
10970 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10972 static tree
10974 {
10980 /* Peek at the next token. */
10985 /* See what kind of keyword it is. */
10988 {
10992 {
11012 }
11018 {
11025 /* Fall through. */
11035 }
11040 {
11041 tree expr;
11045 {
11049 }
11052 else
11053 /* If the next token is a `;', then there is no
11054 expression. */
11056 /* Build the return-statement. */
11058 /* Look for the final `;'. */
11060 }
11066 {
11069 }
11071 /* Create the goto-statement. */
11073 {
11074 /* Issue a warning about this use of a GNU extension. */
11076 /* Consume the '*' token. */
11078 /* Parse the dependent expression. */
11080 }
11081 else
11083 /* Look for the final `;'. */
11090 }
11093 }
11095 /* Parse a declaration-statement.
11097 declaration-statement:
11098 block-declaration */
11100 static void
11102 {
11105 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11108 /* Parse the block-declaration. */
11111 /* Free any declarators allocated. */
11113 }
11115 /* Some dependent statements (like `if (cond) statement'), are
11116 implicitly in their own scope. In other words, if the statement is
11117 a single statement (as opposed to a compound-statement), it is
11118 none-the-less treated as if it were enclosed in braces. Any
11119 declarations appearing in the dependent statement are out of scope
11120 after control passes that point. This function parses a statement,
11121 but ensures that is in its own scope, even if it is not a
11122 compound-statement.
11124 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11125 is a (possibly labeled) if statement which is not enclosed in
11126 braces and has an else clause. This is used to implement
11127 -Wparentheses.
11129 Returns the new statement. */
11131 static tree
11133 {
11134 tree statement;
11139 /* Mark if () ; with a special NOP_EXPR. */
11141 {
11145 }
11146 /* if a compound is opened, we simply parse the statement directly. */
11149 /* If the token is not a `{', then we must take special action. */
11150 else
11151 {
11152 /* Create a compound-statement. */
11154 /* Parse the dependent-statement. */
11156 /* Finish the dummy compound-statement. */
11158 }
11160 /* Return the statement. */
11162 }
11164 /* For some dependent statements (like `while (cond) statement'), we
11165 have already created a scope. Therefore, even if the dependent
11166 statement is a compound-statement, we do not want to create another
11167 scope. */
11169 static void
11171 {
11172 /* If the token is a `{', then we must take special action. */
11175 else
11176 {
11177 /* Avoid calling cp_parser_compound_statement, so that we
11178 don't create a new scope. Do everything else by hand. */
11180 /* If the next keyword is `__label__' we have a label declaration. */
11183 /* Parse an (optional) statement-seq. */
11186 }
11187 }
11189 /* Declarations [gram.dcl.dcl] */
11191 /* Parse an optional declaration-sequence.
11193 declaration-seq:
11194 declaration
11195 declaration-seq declaration */
11197 static void
11199 {
11201 {
11212 {
11213 /* A declaration consisting of a single semicolon is
11214 invalid. Allow it unless we're being pedantic. */
11219 }
11221 /* If we're entering or exiting a region that's implicitly
11222 extern "C", modify the lang context appropriately. */
11224 {
11227 }
11229 {
11232 }
11235 {
11236 /* A top-level declaration can consist solely of a #pragma.
11237 A nested declaration cannot, so this is done here and not
11238 in cp_parser_declaration. (A #pragma at block scope is
11239 handled in cp_parser_statement.) */
11242 }
11244 /* Parse the declaration itself. */
11246 }
11247 }
11249 /* Parse a declaration.
11251 declaration:
11252 block-declaration
11253 function-definition
11254 template-declaration
11255 explicit-instantiation
11256 explicit-specialization
11257 linkage-specification
11258 namespace-definition
11260 GNU extension:
11262 declaration:
11263 __extension__ declaration */
11265 static void
11267 {
11268 cp_token token1;
11269 cp_token token2;
11274 /* Check for the `__extension__' keyword. */
11276 {
11277 /* Parse the qualified declaration. */
11279 /* Restore the PEDANTIC flag. */
11283 }
11285 /* Try to figure out what kind of declaration is present. */
11290 else
11291 {
11294 }
11296 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11299 /* If the next token is `extern' and the following token is a string
11300 literal, then we have a linkage specification. */
11304 /* If the next token is `template', then we have either a template
11305 declaration, an explicit instantiation, or an explicit
11306 specialization. */
11308 {
11309 /* `template <>' indicates a template specialization. */
11313 /* `template <' indicates a template declaration. */
11316 /* Anything else must be an explicit instantiation. */
11317 else
11319 }
11320 /* If the next token is `export', then we have a template
11321 declaration. */
11324 /* If the next token is `extern', 'static' or 'inline' and the one
11325 after that is `template', we have a GNU extended explicit
11326 instantiation directive. */
11333 /* If the next token is `namespace', check for a named or unnamed
11334 namespace definition. */
11340 /* An unnamed namespace definition. */
11344 /* An inline (associated) namespace definition. */
11348 /* Objective-C++ declaration/definition. */
11355 /* We must have either a block declaration or a function
11356 definition. */
11357 else
11358 /* Try to parse a block-declaration, or a function-definition. */
11361 /* Free any declarators allocated. */
11363 }
11365 /* Parse a block-declaration.
11367 block-declaration:
11368 simple-declaration
11369 asm-definition
11370 namespace-alias-definition
11371 using-declaration
11372 using-directive
11374 GNU Extension:
11376 block-declaration:
11377 __extension__ block-declaration
11379 C++0x Extension:
11381 block-declaration:
11382 static_assert-declaration
11384 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11385 part of a declaration-statement. */
11387 static void
11390 {
11394 /* Check for the `__extension__' keyword. */
11396 {
11397 /* Parse the qualified declaration. */
11399 /* Restore the PEDANTIC flag. */
11403 }
11405 /* Peek at the next token to figure out which kind of declaration is
11406 present. */
11409 /* If the next keyword is `asm', we have an asm-definition. */
11411 {
11415 }
11416 /* If the next keyword is `namespace', we have a
11417 namespace-alias-definition. */
11420 /* If the next keyword is `using', we have a
11421 using-declaration, a using-directive, or an alias-declaration. */
11423 {
11428 /* If the token after `using' is `namespace', then we have a
11429 using-directive. */
11433 /* If the second token after 'using' is '=', then we have an
11434 alias-declaration. */
11440 /* Otherwise, it's a using-declaration. */
11441 else
11444 }
11445 /* If the next keyword is `__label__' we have a misplaced label
11446 declaration. */
11448 {
11452 /* If the next token is now a `;', consume it. */
11455 }
11456 /* If the next token is `static_assert' we have a static assertion. */
11459 /* Anything else must be a simple-declaration. */
11460 else
11463 }
11465 /* Parse a simple-declaration.
11467 simple-declaration:
11468 decl-specifier-seq [opt] init-declarator-list [opt] ;
11470 init-declarator-list:
11471 init-declarator
11472 init-declarator-list , init-declarator
11474 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11475 function-definition as a simple-declaration.
11477 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11478 parsed declaration if it is an uninitialized single declarator not followed
11479 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11480 if present, will not be consumed. */
11482 static void
11486 {
11487 cp_decl_specifier_seq decl_specifiers;
11496 /* Defer access checks until we know what is being declared; the
11497 checks for names appearing in the decl-specifier-seq should be
11498 done as if we were in the scope of the thing being declared. */
11501 /* Parse the decl-specifier-seq. We have to keep track of whether
11502 or not the decl-specifier-seq declares a named class or
11503 enumeration type, since that is the only case in which the
11504 init-declarator-list is allowed to be empty.
11506 [dcl.dcl]
11508 In a simple-declaration, the optional init-declarator-list can be
11509 omitted only when declaring a class or enumeration, that is when
11510 the decl-specifier-seq contains either a class-specifier, an
11511 elaborated-type-specifier, or an enum-specifier. */
11513 CP_PARSER_FLAGS_OPTIONAL,
11516 /* We no longer need to defer access checks. */
11519 /* In a block scope, a valid declaration must always have a
11520 decl-specifier-seq. By not trying to parse declarators, we can
11521 resolve the declaration/expression ambiguity more quickly. */
11524 {
11527 }
11529 /* If the next two tokens are both identifiers, the code is
11530 erroneous. The usual cause of this situation is code like:
11532 T t;
11534 where "T" should name a type -- but does not. */
11537 {
11538 /* If parsing tentatively, we should commit; we really are
11539 looking at a declaration. */
11541 /* Give up. */
11543 }
11545 /* If we have seen at least one decl-specifier, and the next token
11546 is not a parenthesis, then we must be looking at a declaration.
11547 (After "int (" we might be looking at a functional cast.) */
11554 /* Keep going until we hit the `;' at the end of the simple
11555 declaration. */
11558 CPP_SEMICOLON))
11559 {
11562 tree decl;
11565 {
11566 /* If we are processing next declarator, comma is expected */
11571 {
11575 }
11576 }
11577 else
11580 /* Parse the init-declarator. */
11583 function_definition_allowed_p,
11585 declares_class_or_enum,
11587 maybe_range_for_decl,
11589 /* If an error occurred while parsing tentatively, exit quickly.
11590 (That usually happens when in the body of a function; each
11591 statement is treated as a declaration-statement until proven
11592 otherwise.) */
11595 /* Handle function definitions specially. */
11597 {
11598 /* If the next token is a `,', then we are probably
11599 processing something like:
11601 void f() {}, *p;
11603 which is erroneous. */
11605 {
11608 "mixing"
11610 }
11611 /* Otherwise, we're done with the list of declarators. */
11612 else
11613 {
11616 }
11617 }
11620 /* The next token should be either a `,' or a `;'. */
11622 /* If it's a `,', there are more declarators to come. */
11625 /* If it's a `;', we are done. */
11628 /* Anything else is an error. */
11629 else
11630 {
11631 /* If we have already issued an error message we don't need
11632 to issue another one. */
11636 /* Skip tokens until we reach the end of the statement. */
11638 /* If the next token is now a `;', consume it. */
11642 }
11643 /* After the first time around, a function-definition is not
11644 allowed -- even if it was OK at first. For example:
11646 int i, f() {}
11648 is not valid. */
11650 }
11652 /* Issue an error message if no declarators are present, and the
11653 decl-specifier-seq does not itself declare a class or
11654 enumeration: [dcl.dcl]/3. */
11656 {
11658 {
11662 /* Ensure an error is issued anyway when finish_decltype_type,
11663 called via cp_parser_decl_specifier_seq, returns a class or
11664 an enumeration (c++/51786). */
11667 }
11668 /* Perform any deferred access checks. */
11670 }
11672 /* Consume the `;'. */
11676 {
11682 }
11684 done:
11686 }
11688 /* Parse a decl-specifier-seq.
11690 decl-specifier-seq:
11691 decl-specifier-seq [opt] decl-specifier
11692 decl-specifier attribute-specifier-seq [opt] (C++11)
11694 decl-specifier:
11695 storage-class-specifier
11696 type-specifier
11697 function-specifier
11698 friend
11699 typedef
11701 GNU Extension:
11703 decl-specifier:
11704 attributes
11706 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11708 The parser flags FLAGS is used to control type-specifier parsing.
11710 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11711 flags:
11713 1: one of the decl-specifiers is an elaborated-type-specifier
11714 (i.e., a type declaration)
11715 2: one of the decl-specifiers is an enum-specifier or a
11716 class-specifier (i.e., a type definition)
11718 */
11720 static void
11722 cp_parser_flags flags,
11725 {
11729 cp_decl_spec ds;
11731 /* Clear DECL_SPECS. */
11734 /* Assume no class or enumeration type is declared. */
11737 /* Keep reading specifiers until there are no more to read. */
11739 {
11744 /* Peek at the next token. */
11747 /* Save the first token of the decl spec list for error
11748 reporting. */
11751 /* Handle attributes. */
11753 {
11754 /* Parse the attributes. */
11757 /* In a sequence of declaration specifiers, c++11 attributes
11758 appertain to the type that precede them. In that case
11759 [dcl.spec]/1 says:
11761 The attribute-specifier-seq affects the type only for
11762 the declaration it appears in, not other declarations
11763 involving the same type.
11765 But for now let's force the user to position the
11766 attribute either at the beginning of the declaration or
11767 after the declarator-id, which would clearly mean that it
11768 applies to the declarator. */
11770 {
11772 /* The c++11 attribute is at the beginning of the
11773 declaration. It appertains to the entity being
11775 else
11776 {
11778 {
11779 /* This is an attribute following a
11780 class-specifier. */
11785 }
11786 else
11787 {
11788 decl_specs->std_attributes
11790 attrs);
11793 }
11795 }
11796 }
11798 decl_specs->attributes
11800 attrs);
11804 }
11805 /* Assume we will find a decl-specifier keyword. */
11807 /* If the next token is an appropriate keyword, we can simply
11808 add it to the list. */
11810 {
11811 /* decl-specifier:
11812 friend
11813 constexpr */
11816 {
11819 }
11820 else
11821 {
11823 /* Consume the token. */
11825 }
11833 /* function-specifier:
11834 inline
11835 virtual
11836 explicit */
11843 /* decl-specifier:
11844 typedef */
11847 /* Consume the token. */
11849 /* A constructor declarator cannot appear in a typedef. */
11851 /* The "typedef" keyword can only occur in a declaration; we
11852 may as well commit at this point. */
11859 /* storage-class-specifier:
11860 auto
11861 register
11862 static
11863 extern
11864 mutable
11866 GNU Extension:
11867 thread */
11870 {
11871 /* Consume the token. */
11874 /* Complain about `auto' as a storage specifier, if
11875 we're complaining about C++0x compatibility. */
11879 /* Set the storage class anyway. */
11881 token);
11882 }
11883 else
11884 /* C++0x auto type-specifier. */
11892 /* Consume the token. */
11895 token);
11898 /* Consume the token. */
11904 /* We did not yet find a decl-specifier yet. */
11907 }
11917 /* Constructors are a special case. The `S' in `S()' is not a
11918 decl-specifier; it is the beginning of the declarator. */
11919 constructor_p
11920 = (!found_decl_spec
11921 && constructor_possible_p
11922 && (cp_parser_constructor_declarator_p
11925 /* If we don't have a DECL_SPEC yet, then we must be looking at
11926 a type-specifier. */
11928 {
11931 tree type_spec;
11933 type_spec
11935 decl_specs,
11941 /* If this type-specifier referenced a user-defined type
11942 (a typedef, class-name, etc.), then we can't allow any
11943 more such type-specifiers henceforth.
11945 [dcl.spec]
11947 The longest sequence of decl-specifiers that could
11948 possibly be a type name is taken as the
11949 decl-specifier-seq of a declaration. The sequence shall
11950 be self-consistent as described below.
11952 [dcl.type]
11954 As a general rule, at most one type-specifier is allowed
11955 in the complete decl-specifier-seq of a declaration. The
11956 only exceptions are the following:
11958 -- const or volatile can be combined with any other
11959 type-specifier.
11961 -- signed or unsigned can be combined with char, long,
11962 short, or int.
11964 -- ..
11966 Example:
11968 typedef char* Pc;
11969 void g (const int Pc);
11971 Here, Pc is *not* part of the decl-specifier seq; it's
11972 the declarator. Therefore, once we see a type-specifier
11973 (other than a cv-qualifier), we forbid any additional
11974 user-defined types. We *do* still allow things like `int
11975 int' to be considered a decl-specifier-seq, and issue the
11976 error message later. */
11979 /* A constructor declarator cannot follow a type-specifier. */
11981 {
11986 }
11987 }
11989 /* If we still do not have a DECL_SPEC, then there are no more
11990 decl-specifiers. */
11995 /* After we see one decl-specifier, further decl-specifiers are
11996 always optional. */
11998 }
12000 /* Don't allow a friend specifier with a class definition. */
12005 }
12007 /* Parse an (optional) storage-class-specifier.
12009 storage-class-specifier:
12010 auto
12011 register
12012 static
12013 extern
12014 mutable
12016 GNU Extension:
12018 storage-class-specifier:
12019 thread
12021 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12023 static tree
12025 {
12027 {
12031 /* Fall through for C++98. */
12038 /* Consume the token. */
12043 }
12044 }
12046 /* Parse an (optional) function-specifier.
12048 function-specifier:
12049 inline
12050 virtual
12051 explicit
12053 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12054 Updates DECL_SPECS, if it is non-NULL. */
12056 static tree
12059 {
12062 {
12068 /* 14.5.2.3 [temp.mem]
12070 A member function template shall not be virtual. */
12073 else
12083 }
12085 /* Consume the token. */
12087 }
12089 /* Parse a linkage-specification.
12091 linkage-specification:
12092 extern string-literal { declaration-seq [opt] }
12093 extern string-literal declaration */
12095 static void
12097 {
12098 tree linkage;
12100 /* Look for the `extern' keyword. */
12103 /* Look for the string-literal. */
12106 /* Transform the literal into an identifier. If the literal is a
12107 wide-character string, or contains embedded NULs, then we can't
12108 handle it as the user wants. */
12111 {
12113 /* Assume C++ linkage. */
12115 }
12116 else
12119 /* We're now using the new linkage. */
12122 /* If the next token is a `{', then we're using the first
12123 production. */
12125 {
12128 /* Consume the `{' token. */
12130 /* Parse the declarations. */
12132 /* Look for the closing `}'. */
12134 }
12135 /* Otherwise, there's just one declaration. */
12136 else
12137 {
12140 saved_in_unbraced_linkage_specification_p
12144 parser->in_unbraced_linkage_specification_p
12146 }
12148 /* We're done with the linkage-specification. */
12150 }
12152 /* Parse a static_assert-declaration.
12154 static_assert-declaration:
12155 static_assert ( constant-expression , string-literal ) ;
12157 If MEMBER_P, this static_assert is a class member. */
12159 static void
12161 {
12162 tree condition;
12163 tree message;
12165 location_t saved_loc;
12168 /* Peek at the `static_assert' token so we can keep track of exactly
12169 where the static assertion started. */
12173 /* Look for the `static_assert' keyword. */
12175 RT_STATIC_ASSERT))
12178 /* We know we are in a static assertion; commit to any tentative
12179 parse. */
12183 /* Parse the `(' starting the static assertion condition. */
12186 /* Parse the constant-expression. Allow a non-constant expression
12187 here in order to give better diagnostics in finish_static_assert. */
12188 condition =
12193 /* Parse the separating `,'. */
12196 /* Parse the string-literal message. */
12201 /* A `)' completes the static assertion. */
12208 /* A semicolon terminates the declaration. */
12211 /* Complete the static assertion, which may mean either processing
12212 the static assert now or saving it for template instantiation. */
12214 }
12216 /* Parse the expression in decltype ( expression ). */
12218 static tree
12221 {
12223 tree expr;
12225 /* First, try parsing an id-expression. */
12236 {
12239 cp_id_kind idk;
12243 /* Lookup the name we got back from the id-expression. */
12253 {
12254 /* Complete lookup of the id-expression. */
12255 expr = (finish_id_expression
12268 /* We found an id-expression, but it was something that we
12269 should not have found. This is an error, not something
12270 we can recover from, so note that we found an
12271 id-expression and we'll recover as gracefully as
12272 possible. */
12274 }
12279 /* We have an id-expression. */
12281 }
12284 {
12285 /* Abort the id-expression parse. */
12288 /* Parsing tentatively, again. */
12291 /* Parse a class member access. */
12299 /* We have an id-expression. */
12301 }
12304 /* We have parsed the complete id-expression or member access. */
12306 else
12307 {
12308 /* Abort our attempt to parse an id-expression or member access
12309 expression. */
12312 /* Parse a full expression. */
12315 }
12318 }
12320 /* Parse a `decltype' type. Returns the type.
12322 simple-type-specifier:
12323 decltype ( expression )
12324 C++14 proposal:
12325 decltype ( auto ) */
12327 static tree
12329 {
12330 tree expr;
12339 {
12340 /* Already parsed. */
12343 }
12345 /* Look for the `decltype' token. */
12349 /* Parse the opening `('. */
12353 /* decltype (auto) */
12356 {
12363 }
12365 /* Types cannot be defined in a `decltype' expression. Save away the
12366 old message. */
12369 /* And create the new one. */
12370 parser->type_definition_forbidden_message
12373 /* The restrictions on constant-expressions do not apply inside
12374 decltype expressions. */
12375 saved_integral_constant_expression_p
12377 saved_non_integral_constant_expression_p
12381 /* Within a parenthesized expression, a `>' token is always
12382 the greater-than operator. */
12383 saved_greater_than_is_operator_p
12387 /* Do not actually evaluate the expression. */
12390 /* Do not warn about problems with the expression. */
12395 /* Go back to evaluating expressions. */
12399 /* The `>' token might be the end of a template-id or
12400 template-parameter-list now. */
12401 parser->greater_than_is_operator_p
12404 /* Restore the old message and the integral constant expression
12405 flags. */
12407 parser->integral_constant_expression_p
12409 parser->non_integral_constant_expression_p
12412 /* Parse to the closing `)'. */
12414 {
12418 }
12421 tf_warning_or_error);
12423 rewrite:
12424 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12425 it again. */
12432 }
12434 /* Special member functions [gram.special] */
12436 /* Parse a conversion-function-id.
12438 conversion-function-id:
12439 operator conversion-type-id
12441 Returns an IDENTIFIER_NODE representing the operator. */
12443 static tree
12445 {
12446 tree type;
12447 tree saved_scope;
12448 tree saved_qualifying_scope;
12449 tree saved_object_scope;
12452 /* Look for the `operator' token. */
12455 /* When we parse the conversion-type-id, the current scope will be
12456 reset. However, we need that information in able to look up the
12457 conversion function later, so we save it here. */
12461 /* We must enter the scope of the class so that the names of
12462 entities declared within the class are available in the
12463 conversion-type-id. For example, consider:
12465 struct S {
12466 typedef int I;
12467 operator I();
12468 };
12470 S::operator I() { ... }
12472 In order to see that `I' is a type-name in the definition, we
12473 must be in the scope of `S'. */
12476 /* Parse the conversion-type-id. */
12478 /* Leave the scope of the class, if any. */
12481 /* Restore the saved scope. */
12485 /* If the TYPE is invalid, indicate failure. */
12489 }
12491 /* Parse a conversion-type-id:
12493 conversion-type-id:
12494 type-specifier-seq conversion-declarator [opt]
12496 Returns the TYPE specified. */
12498 static tree
12500 {
12501 tree attributes;
12502 cp_decl_specifier_seq type_specifiers;
12504 tree type_specified;
12507 /* Parse the attributes. */
12511 parser->type_definition_forbidden_message
12514 /* Parse the type-specifiers. */
12521 /* If that didn't work, stop. */
12524 /* Parse the conversion-declarator. */
12532 /* Don't give this error when parsing tentatively. This happens to
12533 work because we always parse this definitively once. */
12536 {
12538 {
12541 }
12545 }
12548 }
12550 /* Parse an (optional) conversion-declarator.
12552 conversion-declarator:
12553 ptr-operator conversion-declarator [opt]
12555 */
12559 {
12562 cp_cv_quals cv_quals;
12564 /* We don't know if there's a ptr-operator next, or not. */
12566 /* Try the ptr-operator. */
12569 /* If it worked, look for more conversion-declarators. */
12571 {
12574 /* Parse another optional declarator. */
12577 declarator = cp_parser_make_indirect_declarator
12581 }
12584 }
12586 /* Parse an (optional) ctor-initializer.
12588 ctor-initializer:
12589 : mem-initializer-list
12591 Returns TRUE iff the ctor-initializer was actually present. */
12593 static bool
12595 {
12596 /* If the next token is not a `:', then there is no
12597 ctor-initializer. */
12599 {
12600 /* Do default initialization of any bases and members. */
12605 }
12607 /* Consume the `:' token. */
12609 /* And the mem-initializer-list. */
12613 }
12615 /* Parse a mem-initializer-list.
12617 mem-initializer-list:
12618 mem-initializer ... [opt]
12619 mem-initializer ... [opt] , mem-initializer-list */
12621 static void
12623 {
12628 /* Let the semantic analysis code know that we are starting the
12629 mem-initializer-list. */
12634 /* Loop through the list. */
12636 {
12637 tree mem_initializer;
12640 /* Parse the mem-initializer. */
12642 /* If the next token is a `...', we're expanding member initializers. */
12644 {
12645 /* Consume the `...'. */
12648 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12649 can be expanded but members cannot. */
12652 {
12657 }
12659 /* Construct the pack expansion type. */
12662 }
12665 {
12669 }
12670 /* Look for a target constructor. */
12674 {
12677 {
12681 }
12683 }
12684 /* Add it to the list, unless it was erroneous. */
12686 {
12689 }
12690 /* If the next token is not a `,', we're done. */
12693 /* Consume the `,' token. */
12695 }
12697 /* Perform semantic analysis. */
12700 }
12702 /* Parse a mem-initializer.
12704 mem-initializer:
12705 mem-initializer-id ( expression-list [opt] )
12706 mem-initializer-id braced-init-list
12708 GNU extension:
12710 mem-initializer:
12711 ( expression-list [opt] )
12713 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12714 class) or FIELD_DECL (for a non-static data member) to initialize;
12715 the TREE_VALUE is the expression-list. An empty initialization
12716 list is represented by void_list_node. */
12718 static tree
12720 {
12721 tree mem_initializer_id;
12722 tree expression_list;
12723 tree member;
12726 /* Find out what is being initialized. */
12728 {
12732 }
12733 else
12734 {
12738 }
12744 {
12751 }
12752 else
12753 {
12763 }
12773 }
12775 /* Parse a mem-initializer-id.
12777 mem-initializer-id:
12778 :: [opt] nested-name-specifier [opt] class-name
12779 identifier
12781 Returns a TYPE indicating the class to be initializer for the first
12782 production. Returns an IDENTIFIER_NODE indicating the data member
12783 to be initialized for the second production. */
12785 static tree
12787 {
12791 tree id;
12795 /* `typename' is not allowed in this context ([temp.res]). */
12797 {
12799 "keyword %<typename%> not allowed in this context (a qualified "
12802 }
12803 /* Look for the optional `::' operator. */
12804 global_scope_p
12808 /* Look for the optional nested-name-specifier. The simplest way to
12809 implement:
12811 [temp.res]
12813 The keyword `typename' is not permitted in a base-specifier or
12814 mem-initializer; in these contexts a qualified name that
12815 depends on a template-parameter is implicitly assumed to be a
12816 type name.
12818 is to assume that we have seen the `typename' keyword at this
12819 point. */
12820 nested_name_specifier_p
12829 /* If there is a `::' operator or a nested-name-specifier, then we
12830 are definitely looking for a class-name. */
12835 typename_type,
12839 /* Otherwise, we could also be looking for an ordinary identifier. */
12841 /* Try a class-name. */
12845 none_type,
12849 /* If we found one, we're done. */
12852 /* Otherwise, look for an ordinary identifier. */
12854 }
12856 /* Overloading [gram.over] */
12858 /* Parse an operator-function-id.
12860 operator-function-id:
12861 operator operator
12863 Returns an IDENTIFIER_NODE for the operator which is a
12864 human-readable spelling of the identifier, e.g., `operator +'. */
12866 static tree
12868 {
12869 /* Look for the `operator' keyword. */
12872 /* And then the name of the operator itself. */
12874 }
12876 /* Return an identifier node for a user-defined literal operator.
12877 The suffix identifier is chained to the operator name identifier. */
12879 static tree
12881 {
12882 tree identifier;
12889 }
12891 /* Parse an operator.
12893 operator:
12894 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12895 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12896 || ++ -- , ->* -> () []
12898 GNU Extensions:
12900 operator:
12901 <? >? <?= >?=
12903 Returns an IDENTIFIER_NODE for the operator which is a
12904 human-readable spelling of the identifier, e.g., `operator +'. */
12906 static tree
12908 {
12913 /* Peek at the next token. */
12915 /* Figure out which operator we have. */
12917 {
12919 {
12922 /* The keyword should be either `new' or `delete'. */
12927 else
12930 /* Consume the `new' or `delete' token. */
12933 /* Peek at the next token. */
12935 /* If it's a `[' token then this is the array variant of the
12936 operator. */
12938 {
12939 /* Consume the `[' token. */
12941 /* Look for the `]' token. */
12945 }
12946 /* Otherwise, we have the non-array variant. */
12947 else
12951 }
13098 /* Consume the `('. */
13100 /* Look for the matching `)'. */
13105 /* Consume the `['. */
13107 /* Look for the matching `]'. */
13122 {
13129 /* Consume the string. */
13135 {
13138 }
13139 else
13140 {
13142 /* Look for the suffix identifier. */
13147 {
13151 }
13152 else
13153 {
13156 }
13157 }
13162 {
13165 }
13168 {
13171 }
13173 {
13176 }
13178 }
13181 /* Anything else is an error. */
13183 }
13185 /* If we have selected an identifier, we need to consume the
13186 operator token. */
13189 /* Otherwise, no valid operator name was present. */
13190 else
13191 {
13194 }
13197 }
13199 /* Parse a template-declaration.
13201 template-declaration:
13202 export [opt] template < template-parameter-list > declaration
13204 If MEMBER_P is TRUE, this template-declaration occurs within a
13205 class-specifier.
13207 The grammar rule given by the standard isn't correct. What
13208 is really meant is:
13210 template-declaration:
13211 export [opt] template-parameter-list-seq
13212 decl-specifier-seq [opt] init-declarator [opt] ;
13213 export [opt] template-parameter-list-seq
13214 function-definition
13216 template-parameter-list-seq:
13217 template-parameter-list-seq [opt]
13218 template < template-parameter-list > */
13220 static void
13222 {
13223 /* Check for `export'. */
13225 {
13226 /* Consume the `export' token. */
13228 /* Warn that we do not support `export'. */
13230 }
13233 }
13235 /* Parse a template-parameter-list.
13237 template-parameter-list:
13238 template-parameter
13239 template-parameter-list , template-parameter
13241 Returns a TREE_LIST. Each node represents a template parameter.
13242 The nodes are connected via their TREE_CHAINs. */
13244 static tree
13246 {
13251 /* The loop below parses the template parms. We first need to know
13252 the total number of template parms to be able to compute proper
13253 canonical types of each dependent type. So after the loop, when
13254 we know the total number of template parms,
13255 end_template_parm_list computes the proper canonical types and
13256 fixes up the dependent types accordingly. */
13258 {
13259 tree parameter;
13262 location_t parm_loc;
13264 /* Parse the template-parameter. */
13269 /* Add it to the list. */
13272 parm_loc,
13273 parameter,
13274 is_non_type,
13275 is_parameter_pack);
13276 else
13277 {
13280 }
13282 /* If the next token is not a `,', we're done. */
13285 /* Otherwise, consume the `,' token. */
13287 }
13290 }
13292 /* Parse a template-parameter.
13294 template-parameter:
13295 type-parameter
13296 parameter-declaration
13298 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13299 the parameter. The TREE_PURPOSE is the default value, if any.
13300 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13301 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13302 set to true iff this parameter is a parameter pack. */
13304 static tree
13307 {
13311 tree parm;
13313 /* Assume it is a type parameter or a template parameter. */
13315 /* Assume it not a parameter pack. */
13317 /* Peek at the next token. */
13319 /* If it is `class' or `template', we have a type-parameter. */
13322 /* If it is `class' or `typename' we do not know yet whether it is a
13323 type parameter or a non-type parameter. Consider:
13325 template <typename T, typename T::X X> ...
13327 or:
13329 template <class C, class D*> ...
13331 Here, the first parameter is a type parameter, and the second is
13332 a non-type parameter. We can tell by looking at the token after
13333 the identifier -- if it is a `,', `=', or `>' then we have a type
13334 parameter. */
13336 {
13337 /* Peek at the token after `class' or `typename'. */
13339 /* If it's an ellipsis, we have a template type parameter
13340 pack. */
13343 /* If it's an identifier, skip it. */
13346 /* Now, see if the token looks like the end of a template
13347 parameter. */
13352 }
13354 /* Otherwise, it is a non-type parameter.
13356 [temp.param]
13358 When parsing a default template-argument for a non-type
13359 template-parameter, the first non-nested `>' is taken as the end
13360 of the template parameter-list rather than a greater-than
13361 operator. */
13363 parameter_declarator
13370 /* If the parameter declaration is marked as a parameter pack, set
13371 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13372 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13373 grokdeclarator. */
13376 {
13379 }
13382 {
13383 /* Can happen in some cases of erroneous input (c++/34892). */
13385 /* Consume the `...' for better error recovery. */
13387 }
13388 /* If the next token is an ellipsis, and we don't already have it
13389 marked as a parameter pack, then we have a parameter pack (that
13390 has no declarator). */
13393 && (declarator_can_be_parameter_pack
13395 {
13396 /* Consume the `...'. */
13401 }
13402 /* We might end up with a pack expansion as the type of the non-type
13403 template parameter, in which case this is a non-type template
13404 parameter pack. */
13407 {
13411 }
13414 {
13415 /* Parameter packs cannot have default arguments. However, a
13416 user may try to do so, so we'll parse them and give an
13417 appropriate diagnostic here. */
13421 /* Find the name of the parameter pack. */
13430 else
13434 /* Parse the default argument, but throw away the result. */
13436 }
13446 }
13448 /* Parse a type-parameter.
13450 type-parameter:
13451 class identifier [opt]
13452 class identifier [opt] = type-id
13453 typename identifier [opt]
13454 typename identifier [opt] = type-id
13455 template < template-parameter-list > class identifier [opt]
13456 template < template-parameter-list > class identifier [opt]
13457 = id-expression
13459 GNU Extension (variadic templates):
13461 type-parameter:
13462 class ... identifier [opt]
13463 typename ... identifier [opt]
13465 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13466 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13467 the declaration of the parameter.
13469 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13471 static tree
13473 {
13475 tree parameter;
13477 /* Look for a keyword to tell us what kind of parameter this is. */
13483 {
13486 {
13487 tree identifier;
13488 tree default_argument;
13490 /* If the next token is an ellipsis, we have a template
13491 argument pack. */
13493 {
13494 /* Consume the `...' token. */
13499 }
13501 /* If the next token is an identifier, then it names the
13502 parameter. */
13505 else
13508 /* Create the parameter. */
13511 /* If the next token is an `=', we have a default argument. */
13513 {
13514 /* Consume the `=' token. */
13516 /* Parse the default-argument. */
13520 /* Template parameter packs cannot have default
13521 arguments. */
13523 {
13526 "template parameter pack %qD cannot have a "
13528 else
13530 "template parameter packs cannot have "
13533 }
13537 }
13538 else
13541 /* Create the combined representation of the parameter and the
13542 default argument. */
13544 }
13548 {
13549 tree identifier;
13550 tree default_argument;
13552 /* Look for the `<'. */
13554 /* Parse the template-parameter-list. */
13556 /* Look for the `>'. */
13558 /* Look for the `class' or 'typename' keywords. */
13560 /* If the next token is an ellipsis, we have a template
13561 argument pack. */
13563 {
13564 /* Consume the `...' token. */
13569 }
13570 /* If the next token is an `=', then there is a
13571 default-argument. If the next token is a `>', we are at
13572 the end of the parameter-list. If the next token is a `,',
13573 then we are at the end of this parameter. */
13577 {
13579 /* Treat invalid names as if the parameter were nameless. */
13582 }
13583 else
13586 /* Create the template parameter. */
13588 identifier);
13590 /* If the next token is an `=', then there is a
13591 default-argument. */
13593 {
13596 /* Consume the `='. */
13598 /* Parse the id-expression. */
13600 /* save token before parsing the id-expression, for error
13601 reporting */
13603 default_argument
13611 /* If the id-expression was a template-id that refers to
13612 a template-class, we already have the declaration here,
13613 so no further lookup is needed. */
13614 ;
13615 else
13616 /* Look up the name. */
13617 default_argument
13619 none_type,
13625 /* See if the default argument is valid. */
13626 default_argument
13629 /* Template parameter packs cannot have default
13630 arguments. */
13632 {
13635 "template parameter pack %qD cannot "
13637 identifier);
13638 else
13642 }
13644 }
13645 else
13648 /* Create the combined representation of the parameter and the
13649 default argument. */
13651 }
13657 }
13660 }
13662 /* Parse a template-id.
13664 template-id:
13665 template-name < template-argument-list [opt] >
13667 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13668 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13669 returned. Otherwise, if the template-name names a function, or set
13670 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13671 names a class, returns a TYPE_DECL for the specialization.
13673 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13674 uninstantiated templates. */
13676 static tree
13682 {
13684 tree templ;
13685 tree arguments;
13686 tree template_id;
13693 /* If the next token corresponds to a template-id, there is no need
13694 to reparse it. */
13697 {
13700 /* Get the stored value. */
13702 /* Perform any access checks that were deferred. */
13705 {
13710 tf_warning_or_error);
13711 }
13712 /* Return the stored value. */
13714 }
13716 /* Avoid performing name lookup if there is no possibility of
13717 finding a template-id. */
13720 && !cp_parser_nth_token_starts_template_argument_list_p
13722 {
13725 }
13727 /* Remember where the template-id starts. */
13733 /* Parse the template-name. */
13736 check_dependency_p,
13737 is_declaration,
13738 tag_type,
13741 {
13744 }
13746 /* If we find the sequence `[:' after a template-name, it's probably
13747 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13748 parse correctly the argument list. */
13755 {
13757 /* Change `:' into `::'. */
13759 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13760 CPP_LESS. */
13763 /* Parse the arguments. */
13766 {
13767 /* If we couldn't parse an argument list, then we revert our changes
13768 and return simply an error. Maybe this is not a template-id
13769 after all. */
13774 }
13775 /* Otherwise, emit an error about the invalid digraph, but continue
13776 parsing because we got our argument list. */
13779 {
13782 "%<<:%> is an alternate spelling for %<[%>."
13785 {
13787 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13790 }
13791 }
13792 }
13793 else
13794 {
13795 /* Look for the `<' that starts the template-argument-list. */
13797 {
13800 }
13801 /* Parse the arguments. */
13803 }
13805 /* Build a representation of the specialization. */
13808 TEMPLATE_ID_EXPR,
13812 {
13814 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13815 template (rather than some instantiation thereof) only if
13816 is not nested within some other construct. For example, in
13817 "template <typename T> void f(T) { A<T>::", A<T> is just an
13818 instantiation of A. */
13821 CPP_SCOPE));
13822 template_id
13824 }
13826 {
13828 }
13829 else
13830 {
13831 /* If it's not a class-template or a template-template, it should be
13832 a function-template. */
13838 }
13840 /* If parsing tentatively, replace the sequence of tokens that makes
13841 up the template-id with a CPP_TEMPLATE_ID token. That way,
13842 should we re-parse the token stream, we will not have to repeat
13843 the effort required to do the parse, nor will we issue duplicate
13844 error messages about problems during instantiation of the
13845 template. */
13847 /* Don't do this if we had a parse error in a declarator; re-parsing
13848 might succeed if a name changes meaning (60361). */
13852 {
13855 /* Reset the contents of the START_OF_ID token. */
13857 /* Retrieve any deferred checks. Do not pop this access checks yet
13858 so the memory will not be reclaimed during token replacing below. */
13864 /* Purge all subsequent tokens. */
13867 /* ??? Can we actually assume that, if template_id ==
13868 error_mark_node, we will have issued a diagnostic to the
13869 user, as opposed to simply marking the tentative parse as
13870 failed? */
13873 }
13877 }
13879 /* Parse a template-name.
13881 template-name:
13882 identifier
13884 The standard should actually say:
13886 template-name:
13887 identifier
13888 operator-function-id
13890 A defect report has been filed about this issue.
13892 A conversion-function-id cannot be a template name because they cannot
13893 be part of a template-id. In fact, looking at this code:
13895 a.operator K<int>()
13897 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13898 It is impossible to call a templated conversion-function-id with an
13899 explicit argument list, since the only allowed template parameter is
13900 the type to which it is converting.
13902 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13903 `template' keyword, in a construction like:
13905 T::template f<3>()
13907 In that case `f' is taken to be a template-name, even though there
13908 is no way of knowing for sure.
13910 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13911 name refers to a set of overloaded functions, at least one of which
13912 is a template, or an IDENTIFIER_NODE with the name of the template,
13913 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13914 names are looked up inside uninstantiated templates. */
13916 static tree
13923 {
13924 tree identifier;
13925 tree decl;
13926 tree fns;
13929 /* If the next token is `operator', then we have either an
13930 operator-function-id or a conversion-function-id. */
13932 {
13933 /* We don't know whether we're looking at an
13934 operator-function-id or a conversion-function-id. */
13936 /* Try an operator-function-id. */
13938 /* If that didn't work, try a conversion-function-id. */
13940 {
13943 }
13944 }
13945 /* Look for the identifier. */
13946 else
13949 /* If we didn't find an identifier, we don't have a template-id. */
13953 /* If the name immediately followed the `template' keyword, then it
13954 is a template-name. However, if the next token is not `<', then
13955 we do not treat it as a template-name, since it is not being used
13956 as part of a template-id. This enables us to handle constructs
13957 like:
13959 template <typename T> struct S { S(); };
13960 template <typename T> S<T>::S();
13962 correctly. We would treat `S' as a template -- if it were `S<T>'
13963 -- but we do not if there is no `<'. */
13967 {
13968 /* In a declaration, in a dependent context, we pretend that the
13969 "template" keyword was present in order to improve error
13970 recovery. For example, given:
13972 template <typename T> void f(T::X<int>);
13974 we want to treat "X<int>" as a template-id. */
13976 && !template_keyword_p
13978 && check_dependency_p
13980 /* Do not do this for dtors (or ctors), since they never
13981 need the template keyword before their name. */
13983 {
13986 /* Explain what went wrong. */
13988 identifier);
13991 /* If parsing tentatively, find the location of the "<" token. */
13994 /* Parse the template arguments so that we can issue error
13995 messages about them. */
13998 /* Skip tokens until we find a good place from which to
13999 continue parsing. */
14004 /* If parsing tentatively, permanently remove the
14005 template argument list. That will prevent duplicate
14006 error messages from being issued about the missing
14007 "template" keyword. */
14013 }
14015 /* If the "template" keyword is present, then there is generally
14016 no point in doing name-lookup, so we just return IDENTIFIER.
14017 But, if the qualifying scope is non-dependent then we can
14018 (and must) do name-lookup normally. */
14024 }
14026 /* Look up the name. */
14028 tag_type,
14031 check_dependency_p,
14037 /* If DECL is a template, then the name was a template-name. */
14039 {
14043 }
14044 else
14045 {
14048 /* The standard does not explicitly indicate whether a name that
14049 names a set of overloaded declarations, some of which are
14050 templates, is a template-name. However, such a name should
14051 be a template-name; otherwise, there is no way to form a
14052 template-id for the overloaded templates. */
14060 {
14061 /* The name does not name a template. */
14064 }
14065 }
14067 /* If DECL is dependent, and refers to a function, then just return
14068 its name; we will look it up again during template instantiation. */
14070 {
14074 }
14077 }
14079 /* Parse a template-argument-list.
14081 template-argument-list:
14082 template-argument ... [opt]
14083 template-argument-list , template-argument ... [opt]
14085 Returns a TREE_VEC containing the arguments. */
14087 static tree
14089 {
14094 tree vec;
14101 /* Even if the template-id appears in an integral
14102 constant-expression, the contents of the argument list do
14103 not. */
14109 /* Parse the arguments. */
14110 do
14111 {
14112 tree argument;
14115 /* Consume the comma. */
14118 /* Parse the template-argument. */
14121 /* If the next token is an ellipsis, we're expanding a template
14122 argument pack. */
14124 {
14126 {
14130 }
14131 /* Consume the `...' token. */
14134 /* Make the argument into a TYPE_PACK_EXPANSION or
14135 EXPR_PACK_EXPANSION. */
14137 }
14140 {
14144 {
14147 }
14148 else
14150 }
14152 }
14165 #ifdef ENABLE_CHECKING
14167 #endif
14169 }
14171 /* Parse a template-argument.
14173 template-argument:
14174 assignment-expression
14175 type-id
14176 id-expression
14178 The representation is that of an assignment-expression, type-id, or
14179 id-expression -- except that the qualified id-expression is
14180 evaluated, so that the value returned is either a DECL or an
14181 OVERLOAD.
14183 Although the standard says "assignment-expression", it forbids
14184 throw-expressions or assignments in the template argument.
14185 Therefore, we use "conditional-expression" instead. */
14187 static tree
14189 {
14190 tree argument;
14196 cp_id_kind idk;
14198 /* There's really no way to know what we're looking at, so we just
14199 try each alternative in order.
14201 [temp.arg]
14203 In a template-argument, an ambiguity between a type-id and an
14204 expression is resolved to a type-id, regardless of the form of
14205 the corresponding template-parameter.
14207 Therefore, we try a type-id first. */
14210 /* If there was no error parsing the type-id but the next token is a
14211 '>>', our behavior depends on which dialect of C++ we're
14212 parsing. In C++98, we probably found a typo for '> >'. But there
14213 are type-id which are also valid expressions. For instance:
14215 struct X { int operator >> (int); };
14216 template <int V> struct Foo {};
14217 Foo<X () >> 5> r;
14219 Here 'X()' is a valid type-id of a function type, but the user just
14220 wanted to write the expression "X() >> 5". Thus, we remember that we
14221 found a valid type-id, but we still try to parse the argument as an
14222 expression to see what happens.
14224 In C++0x, the '>>' will be considered two separate '>'
14225 tokens. */
14229 {
14232 }
14233 else
14234 {
14235 /* If the next token isn't a `,' or a `>', then this argument wasn't
14236 really finished. This means that the argument is not a valid
14237 type-id. */
14240 /* If that worked, we're done. */
14243 }
14244 /* We're still not sure what the argument will be. */
14246 /* Try a template. */
14254 /* If the next token isn't a `,' or a `>', then this argument wasn't
14255 really finished. */
14259 {
14260 /* Figure out what is being referred to. If the id-expression
14261 was for a class template specialization, then we will have a
14262 TYPE_DECL at this point. There is no need to do name lookup
14263 at this point in that case. */
14266 none_type,
14275 }
14277 {
14281 }
14282 /* It must be a non-type argument. There permitted cases are given
14283 in [temp.arg.nontype]:
14285 -- an integral constant-expression of integral or enumeration
14286 type; or
14288 -- the name of a non-type template-parameter; or
14290 -- the name of an object or function with external linkage...
14292 -- the address of an object or function with external linkage...
14294 -- a pointer to member... */
14295 /* Look for a non-type template parameter. */
14297 {
14309 }
14311 /* If the next token is "&", the argument must be the address of an
14312 object or function with external linkage. */
14315 {
14318 }
14319 /* See if we might have an id-expression. */
14326 {
14329 address_p,
14336 else
14337 {
14338 tree probe;
14341 {
14342 /* Strip the dereference temporarily. */
14345 }
14347 /* If we're in a template, we represent a qualified-id referring
14348 to a static data member as a SCOPE_REF even if the scope isn't
14349 dependent so that we can check access control later. */
14354 {
14355 /* A variable without external linkage might still be a
14356 valid constant-expression, so no error is issued here
14357 if the external-linkage check fails. */
14360 }
14362 /* All overloaded functions are allowed; if the external
14363 linkage test does not pass, an error will be issued
14364 later. */
14365 ;
14369 /* A pointer-to-member. */
14370 ;
14372 ;
14373 else
14377 {
14380 tf_warning_or_error);
14381 else
14384 }
14385 }
14386 }
14387 /* If the argument started with "&", there are no other valid
14388 alternatives at this point. */
14390 {
14393 }
14395 /* If the argument wasn't successfully parsed as a type-id followed
14396 by '>>', the argument can only be a constant expression now.
14397 Otherwise, we try parsing the constant-expression tentatively,
14398 because the argument could really be a type-id. */
14409 /* We did our best to parse the argument as a non type-id, but that
14410 was the only alternative that matched (albeit with a '>' after
14411 it). We can assume it's just a typo from the user, and a
14412 diagnostic will then be issued. */
14414 }
14416 /* Parse an explicit-instantiation.
14418 explicit-instantiation:
14419 template declaration
14421 Although the standard says `declaration', what it really means is:
14423 explicit-instantiation:
14424 template decl-specifier-seq [opt] declarator [opt] ;
14426 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14427 supposed to be allowed. A defect report has been filed about this
14428 issue.
14430 GNU Extension:
14432 explicit-instantiation:
14433 storage-class-specifier template
14434 decl-specifier-seq [opt] declarator [opt] ;
14435 function-specifier template
14436 decl-specifier-seq [opt] declarator [opt] ; */
14438 static void
14440 {
14442 cp_decl_specifier_seq decl_specifiers;
14447 /* Look for an (optional) storage-class-specifier or
14448 function-specifier. */
14450 {
14451 extension_specifier
14454 extension_specifier
14457 }
14459 /* Look for the `template' keyword. */
14461 /* Let the front end know that we are processing an explicit
14462 instantiation. */
14464 /* [temp.explicit] says that we are supposed to ignore access
14465 control while processing explicit instantiation directives. */
14467 /* Parse a decl-specifier-seq. */
14469 CP_PARSER_FLAGS_OPTIONAL,
14472 /* If there was exactly one decl-specifier, and it declared a class,
14473 and there's no declarator, then we have an explicit type
14474 instantiation. */
14476 {
14477 tree type;
14481 /* Turn access control back on for names used during
14482 template instantiation. */
14487 }
14488 else
14489 {
14491 tree decl;
14493 /* Parse the declarator. */
14494 declarator
14505 {
14508 "explicit instantiation shall not use"
14512 "explicit instantiation shall not use"
14517 /* Turn access control back on for names used during
14518 template instantiation. */
14520 /* Do the explicit instantiation. */
14522 }
14523 else
14524 {
14526 /* Skip the body of the explicit instantiation. */
14528 }
14529 }
14530 /* We're done with the instantiation. */
14536 }
14538 /* Parse an explicit-specialization.
14540 explicit-specialization:
14541 template < > declaration
14543 Although the standard says `declaration', what it really means is:
14545 explicit-specialization:
14546 template <> decl-specifier [opt] init-declarator [opt] ;
14547 template <> function-definition
14548 template <> explicit-specialization
14549 template <> template-declaration */
14551 static void
14553 {
14557 /* Look for the `template' keyword. */
14559 /* Look for the `<'. */
14561 /* Look for the `>'. */
14563 /* We have processed another parameter list. */
14565 /* [temp]
14567 A template ... explicit specialization ... shall not have C
14568 linkage. */
14570 {
14572 /* Give it C++ linkage to avoid confusing other parts of the
14573 front end. */
14576 }
14577 else
14579 /* Let the front end know that we are beginning a specialization. */
14581 {
14584 }
14586 /* If the next keyword is `template', we need to figure out whether
14587 or not we're looking a template-declaration. */
14589 {
14594 else
14596 }
14597 else
14598 /* Parse the dependent declaration. */
14604 /* We're done with the specialization. */
14606 /* For the erroneous case of a template with C linkage, we pushed an
14607 implicit C++ linkage scope; exit that scope now. */
14610 /* We're done with this parameter list. */
14612 }
14614 /* Parse a type-specifier.
14616 type-specifier:
14617 simple-type-specifier
14618 class-specifier
14619 enum-specifier
14620 elaborated-type-specifier
14621 cv-qualifier
14623 GNU Extension:
14625 type-specifier:
14626 __complex__
14628 Returns a representation of the type-specifier. For a
14629 class-specifier, enum-specifier, or elaborated-type-specifier, a
14630 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14632 The parser flags FLAGS is used to control type-specifier parsing.
14634 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14635 in a decl-specifier-seq.
14637 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14638 class-specifier, enum-specifier, or elaborated-type-specifier, then
14639 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14640 if a type is declared; 2 if it is defined. Otherwise, it is set to
14641 zero.
14643 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14644 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14645 is set to FALSE. */
14647 static tree
14649 cp_parser_flags flags,
14654 {
14660 /* Assume this type-specifier does not declare a new type. */
14663 /* And that it does not specify a cv-qualifier. */
14666 /* Peek at the next token. */
14669 /* If we're looking at a keyword, we can use that to guide the
14670 production we choose. */
14673 {
14678 /* Look for the enum-specifier. */
14680 /* If that worked, we're done. */
14682 {
14687 type_spec,
14688 token,
14691 }
14692 else
14695 /* Any of these indicate either a class-specifier, or an
14696 elaborated-type-specifier. */
14703 /* Parse tentatively so that we can back up if we don't find a
14704 class-specifier. */
14706 /* Look for the class-specifier. */
14709 /* If that worked, we're done. */
14711 {
14716 type_spec,
14717 token,
14720 }
14722 /* Fall through. */
14723 elaborated_type_specifier:
14724 /* We're declaring (not defining) a class or enum. */
14728 /* Fall through. */
14730 /* Look for an elaborated-type-specifier. */
14731 type_spec
14732 = (cp_parser_elaborated_type_specifier
14735 is_declaration));
14738 type_spec,
14739 token,
14762 /* The `__complex__' keyword is a GNU extension. */
14768 }
14770 /* Handle simple keywords. */
14772 {
14774 {
14777 }
14779 }
14781 /* If we do not already have a type-specifier, assume we are looking
14782 at a simple-type-specifier. */
14784 decl_specs,
14785 flags);
14787 /* If we didn't find a type-specifier, and a type-specifier was not
14788 optional in this context, issue an error message. */
14790 {
14793 }
14796 }
14798 /* Parse a simple-type-specifier.
14800 simple-type-specifier:
14801 :: [opt] nested-name-specifier [opt] type-name
14802 :: [opt] nested-name-specifier template template-id
14803 char
14804 wchar_t
14805 bool
14806 short
14807 int
14808 long
14809 signed
14810 unsigned
14811 float
14812 double
14813 void
14815 C++0x Extension:
14817 simple-type-specifier:
14818 auto
14819 decltype ( expression )
14820 char16_t
14821 char32_t
14822 __underlying_type ( type-id )
14824 GNU Extension:
14826 simple-type-specifier:
14827 __int128
14828 __typeof__ unary-expression
14829 __typeof__ ( type-id )
14830 __typeof__ ( type-id ) { initializer-list , [opt] }
14832 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14833 appropriately updated. */
14835 static tree
14838 cp_parser_flags flags)
14839 {
14844 /* Peek at the next token. */
14847 /* If we're looking at a keyword, things are easy. */
14849 {
14884 {
14887 }
14916 {
14919 else
14923 {
14926 "use of %<auto%> in lambda parameter declaration "
14927 "only available with "
14929 }
14932 "use of %<auto%> in parameter declaration "
14933 "only available with "
14935 else
14937 "ISO C++ forbids use of %<auto%> in parameter "
14939 }
14940 else
14945 /* Since DR 743, decltype can either be a simple-type-specifier by
14946 itself or begin a nested-name-specifier. Parsing it will replace
14947 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14948 handling below decide what to do. */
14954 /* Consume the `typeof' token. */
14956 /* Parse the operand to `typeof'. */
14958 /* If it is not already a TYPE, take its type. */
14964 token,
14973 token,
14983 token,
14988 }
14990 /* If token is an already-parsed decltype not followed by ::,
14991 it's a simple-type-specifier. */
14994 {
14997 {
14999 token,
15001 /* Remember that we are handling a decltype in order to
15002 implement the resolution of DR 1510 when the argument
15003 isn't instantiation dependent. */
15005 }
15008 }
15010 /* If the type-specifier was for a built-in type, we're done. */
15012 {
15013 /* Record the type. */
15020 type,
15021 token,
15026 /* Consume the token. */
15032 /* There is no valid C++ program where a non-template type is
15033 followed by a "<". That usually indicates that the user thought
15034 that the type was a template. */
15039 }
15041 /* The type-specifier must be a user-defined type. */
15043 {
15047 /* Don't gobble tokens or issue error messages if this is an
15048 optional type-specifier. */
15052 /* Look for the optional `::' operator. */
15053 global_p
15057 /* Look for the nested-name specifier. */
15058 qualified_p
15066 /* If we have seen a nested-name-specifier, and the next token
15067 is `template', then we are using the template-id production. */
15070 {
15071 /* Look for the template-id. */
15075 none_type,
15077 /* If the template-id did not name a type, we are out of
15078 luck. */
15080 {
15083 }
15084 }
15085 /* Otherwise, look for a type-name. */
15086 else
15088 /* Keep track of all name-lookups performed in class scopes. */
15090 && !global_p
15091 && !qualified_p
15095 /* If it didn't work out, we don't have a TYPE. */
15101 token,
15103 }
15105 /* If we didn't get a type-name, issue an error message. */
15107 {
15110 }
15113 {
15114 /* See if TYPE is an Objective-C type, and if so, parse and
15115 accept any protocol references following it. Do this before
15116 the cp_parser_check_for_invalid_template_id() call, because
15117 Objective-C types can be followed by '<...>' which would
15118 enclose protocol names rather than template arguments, and so
15119 everything is fine. */
15122 {
15126 /* Clobber the "unqualified" type previously entered into
15127 DECL_SPECS with the new, improved protocol-qualified version. */
15132 }
15134 /* There is no valid C++ program where a non-template type is
15135 followed by a "<". That usually indicates that the user
15136 thought that the type was a template. */
15138 none_type,
15140 }
15143 }
15145 /* Parse a type-name.
15147 type-name:
15148 class-name
15149 enum-name
15150 typedef-name
15151 simple-template-id [in c++0x]
15153 enum-name:
15154 identifier
15156 typedef-name:
15157 identifier
15159 Returns a TYPE_DECL for the type. */
15161 static tree
15163 {
15164 tree type_decl;
15166 /* We can't know yet whether it is a class-name or not. */
15168 /* Try a class-name. */
15172 none_type,
15176 /* If it's not a class-name, keep looking. */
15178 {
15180 /* It must be a typedef-name or an enum-name. */
15184 /* It is either a simple-template-id representing an
15185 instantiation of an alias template... */
15189 none_type,
15191 /* Note that this must be an instantiation of an alias template
15192 because [temp.names]/6 says:
15194 A template-id that names an alias template specialization
15195 is a type-name.
15197 Whereas [temp.names]/7 says:
15199 A simple-template-id that names a class template
15200 specialization is a class-name. */
15205 else
15209 /* ... Or a typedef-name or an enum-name. */
15211 }
15214 }
15216 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15218 enum-name:
15219 identifier
15221 typedef-name:
15222 identifier
15224 Returns a TYPE_DECL for the type. */
15226 static tree
15228 {
15229 tree type_decl;
15230 tree identifier;
15237 /* Look up the type-name. */
15244 {
15245 /* See if this is an Objective-C type. */
15250 }
15252 /* Issue an error if we did not find a type-name. */
15254 /* In Objective-C, we have the complication that class names are
15255 normally type names and start declarations (eg, the
15256 "NSObject" in "NSObject *object;"), but can be used in an
15257 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15258 is an expression. So, a classname followed by a dot is not a
15259 valid type-name. */
15262 {
15267 }
15268 /* Remember that the name was used in the definition of the
15269 current class so that we can check later to see if the
15270 meaning would have been different after the class was
15271 entirely defined. */
15277 }
15279 /* Parse an elaborated-type-specifier. Note that the grammar given
15280 here incorporates the resolution to DR68.
15282 elaborated-type-specifier:
15283 class-key :: [opt] nested-name-specifier [opt] identifier
15284 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15285 enum-key :: [opt] nested-name-specifier [opt] identifier
15286 typename :: [opt] nested-name-specifier identifier
15287 typename :: [opt] nested-name-specifier template [opt]
15288 template-id
15290 GNU extension:
15292 elaborated-type-specifier:
15293 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15294 class-key attributes :: [opt] nested-name-specifier [opt]
15295 template [opt] template-id
15296 enum attributes :: [opt] nested-name-specifier [opt] identifier
15298 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15299 declared `friend'. If IS_DECLARATION is TRUE, then this
15300 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15301 something is being declared.
15303 Returns the TYPE specified. */
15305 static tree
15309 {
15311 tree identifier;
15314 tree globalscope;
15317 /* See if we're looking at the `enum' keyword. */
15319 {
15320 /* Consume the `enum' token. */
15322 /* Remember that it's an enumeration type. */
15324 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15325 enums) is used here. */
15328 {
15332 /* Consume the `struct' or `class' and parse it anyway. */
15334 }
15335 /* Parse the attributes. */
15337 }
15338 /* Or, it might be `typename'. */
15340 RID_TYPENAME))
15341 {
15342 /* Consume the `typename' token. */
15344 /* Remember that it's a `typename' type. */
15346 }
15347 /* Otherwise it must be a class-key. */
15348 else
15349 {
15353 /* Parse the attributes. */
15355 }
15357 /* Look for the `::' operator. */
15360 /* Look for the nested-name-specifier. */
15362 {
15367 is_declaration))
15369 }
15370 else
15371 /* Even though `typename' is not present, the proposed resolution
15372 to Core Issue 180 says that in `class A<T>::B', `B' should be
15373 considered a type-name, even if `A<T>' is dependent. */
15378 is_declaration);
15379 /* For everything but enumeration types, consider a template-id.
15380 For an enumeration type, consider only a plain identifier. */
15382 {
15384 tree decl;
15386 /* Allow the `template' keyword. */
15388 /* If we didn't see `template', we don't know if there's a
15389 template-id or not. */
15392 /* Parse the template-id. */
15396 tag_type,
15397 is_declaration);
15398 /* If we didn't find a template-id, look for an ordinary
15399 identifier. */
15401 ;
15402 /* We can get here when cp_parser_template_id, called by
15403 cp_parser_class_name with tag_type == none_type, succeeds
15404 and caches a BASELINK. Then, when called again here,
15405 instead of failing and returning an error_mark_node
15406 returns it (see template/typename17.C in C++11).
15407 ??? Could we diagnose this earlier? */
15409 {
15412 }
15413 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15414 in effect, then we must assume that, upon instantiation, the
15415 template will correspond to a class. */
15419 typename_type,
15421 /* If the `typename' keyword is in effect and DECL is not a type
15422 decl, then type is non existent. */
15424 ;
15430 }
15433 {
15438 {
15441 }
15443 /* For a `typename', we needn't call xref_tag. */
15449 /* Template parameter lists apply only if we are not within a
15450 function parameter list. */
15451 bool template_parm_lists_apply
15460 /* Look up a qualified name in the usual way. */
15462 {
15463 tree decl;
15464 tree ambiguous_decls;
15467 tag_type,
15474 /* If the lookup was ambiguous, an error will already have been
15475 issued. */
15479 /* If we are parsing friend declaration, DECL may be a
15480 TEMPLATE_DECL tree node here. However, we need to check
15481 whether this TEMPLATE_DECL results in valid code. Consider
15482 the following example:
15484 namespace N {
15485 template <class T> class C {};
15486 }
15487 class X {
15488 template <class T> friend class N::C; // #1, valid code
15489 };
15490 template <class T> class Y {
15491 friend class N::C; // #2, invalid code
15492 };
15494 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15495 name lookup of `N::C'. We see that friend declaration must
15496 be template for the code to be valid. Note that
15497 processing_template_decl does not work here since it is
15498 always 1 for the above two cases. */
15500 decl = (cp_parser_maybe_treat_template_as_class
15505 {
15507 identifier,
15510 }
15513 {
15517 allow_template);
15521 }
15523 /* Forward declarations of nested types, such as
15525 class C1::C2;
15526 class C1::C2::C3;
15528 are invalid unless all components preceding the final '::'
15529 are complete. If all enclosing types are complete, these
15530 declarations become merely pointless.
15532 Invalid forward declarations of nested types are errors
15533 caught elsewhere in parsing. Those that are pointless arrive
15534 here. */
15541 }
15542 else
15543 {
15544 /* An elaborated-type-specifier sometimes introduces a new type and
15545 sometimes names an existing type. Normally, the rule is that it
15546 introduces a new type only if there is not an existing type of
15547 the same name already in scope. For example, given:
15549 struct S {};
15550 void f() { struct S s; }
15552 the `struct S' in the body of `f' is the same `struct S' as in
15553 the global scope; the existing definition is used. However, if
15554 there were no global declaration, this would introduce a new
15555 local class named `S'.
15557 An exception to this rule applies to the following code:
15559 namespace N { struct S; }
15561 Here, the elaborated-type-specifier names a new type
15562 unconditionally; even if there is already an `S' in the
15563 containing scope this declaration names a new type.
15564 This exception only applies if the elaborated-type-specifier
15565 forms the complete declaration:
15567 [class.name]
15569 A declaration consisting solely of `class-key identifier ;' is
15570 either a redeclaration of the name in the current scope or a
15571 forward declaration of the identifier as a class name. It
15572 introduces the name into the current scope.
15574 We are in this situation precisely when the next token is a `;'.
15576 An exception to the exception is that a `friend' declaration does
15577 *not* name a new type; i.e., given:
15579 struct S { friend struct T; };
15581 `T' is not a new type in the scope of `S'.
15583 Also, `new struct S' or `sizeof (struct S)' never results in the
15584 definition of a new type; a new type can only be declared in a
15585 declaration context. */
15587 tag_scope ts;
15591 /* Friends have special name lookup rules. */
15595 CPP_SEMICOLON))
15596 /* This is a `class-key identifier ;' */
15598 else
15601 template_p =
15602 (template_parm_lists_apply
15605 /* An unqualified name was used to reference this type, so
15606 there were no qualifying templates. */
15614 }
15615 }
15620 /* Allow attributes on forward declarations of classes. */
15622 {
15632 else
15635 }
15638 {
15639 /* Indicate whether this class was declared as a `class' or as a
15640 `struct'. */
15644 }
15646 /* A "<" cannot follow an elaborated type specifier. If that
15647 happens, the user was probably trying to form a template-id. */
15652 }
15654 /* Parse an enum-specifier.
15656 enum-specifier:
15657 enum-head { enumerator-list [opt] }
15658 enum-head { enumerator-list , } [C++0x]
15660 enum-head:
15661 enum-key identifier [opt] enum-base [opt]
15662 enum-key nested-name-specifier identifier enum-base [opt]
15664 enum-key:
15665 enum
15666 enum class [C++0x]
15667 enum struct [C++0x]
15669 enum-base: [C++0x]
15670 : type-specifier-seq
15672 opaque-enum-specifier:
15673 enum-key identifier enum-base [opt] ;
15675 GNU Extensions:
15676 enum-key attributes[opt] identifier [opt] enum-base [opt]
15677 { enumerator-list [opt] }attributes[opt]
15678 enum-key attributes[opt] identifier [opt] enum-base [opt]
15679 { enumerator-list, }attributes[opt] [C++0x]
15681 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15682 if the token stream isn't an enum-specifier after all. */
15684 static tree
15686 {
15687 tree identifier;
15689 tree prev_scope;
15691 tree attributes;
15704 /* Parse tentatively so that we can back up if we don't find a
15705 enum-specifier. */
15708 /* Caller guarantees that the current token is 'enum', an identifier
15709 possibly follows, and the token after that is an opening brace.
15710 If we don't have an identifier, fabricate an anonymous name for
15711 the enumeration being defined. */
15714 /* Parse the "class" or "struct", which indicates a scoped
15715 enumeration type in C++0x. */
15718 {
15722 /* Consume the `struct' or `class' token. */
15726 }
15730 /* Clear the qualification. */
15735 /* Figure out in what scope the declaration is being placed. */
15741 nested_name_specifier
15749 {
15750 tree name;
15754 enum_type,
15759 input_location);
15761 {
15764 {
15765 /* Are template enums allowed in ISO? */
15769 /* ignore a typename reference, for it will be solved by name
15770 in start_enum. */
15772 }
15773 }
15776 else
15779 }
15780 else
15781 {
15784 else
15785 {
15791 }
15792 }
15795 /* Check for the `:' that denotes a specified underlying type in C++0x.
15796 Note that a ':' could also indicate a bitfield width, however. */
15798 {
15799 cp_decl_specifier_seq type_specifiers;
15801 /* Consume the `:'. */
15804 /* Parse the type-specifier-seq. */
15809 /* At this point this is surely not elaborated type specifier. */
15818 /* If that didn't work, stop. */
15820 {
15826 }
15827 }
15829 /* Look for the `{' but don't consume it yet. */
15831 {
15833 {
15836 {
15839 }
15840 }
15841 /* An opaque-enum-specifier must have a ';' here. */
15844 {
15847 {
15850 }
15851 }
15852 }
15858 {
15860 {
15864 }
15866 {
15868 }
15869 }
15871 /* Issue an error message if type-definitions are forbidden here. */
15874 else
15875 /* Create the new type. We do this before consuming the opening
15876 brace so the enum will be recorded as being on the line of its
15877 tag (or the 'enum' keyword, if there is no tag). */
15881 /* If the next token is not '{' it is an opaque-enum-specifier or an
15882 elaborated-type-specifier. */
15884 {
15888 {
15889 /* The following catches invalid code such as:
15890 enum class S<int>::E { A, B, C }; */
15898 {
15902 nested_name_specifier);
15904 }
15905 /* If that scope does not contain the scope in which the
15906 class was originally declared, the program is invalid. */
15908 nested_name_specifier))
15909 {
15912 "declaration of %qD in namespace %qD which does not "
15915 else
15917 "declaration of %qD in %qD which does not "
15921 }
15922 }
15927 /* Consume the opening brace. */
15934 {
15938 }
15939 else
15940 {
15946 }
15950 /* If the next token is not '}', then there are some enumerators. */
15952 {
15956 }
15957 else
15960 /* Consume the final '}'. */
15966 }
15967 else
15968 {
15969 /* If a ';' follows, then it is an opaque-enum-specifier
15970 and additional restrictions apply. */
15972 {
15979 }
15980 }
15982 /* Look for trailing attributes to apply to this enumeration, and
15983 apply them if appropriate. */
15985 {
15989 trailing_attr,
15991 }
15993 /* Finish up the enumeration. */
15995 {
16000 }
16003 {
16005 {
16008 }
16010 {
16012 }
16013 }
16014 out:
16017 }
16019 /* Parse an enumerator-list. The enumerators all have the indicated
16020 TYPE.
16022 enumerator-list:
16023 enumerator-definition
16024 enumerator-list , enumerator-definition */
16026 static void
16028 {
16030 {
16031 /* Parse an enumerator-definition. */
16034 /* If the next token is not a ',', we've reached the end of
16035 the list. */
16038 /* Otherwise, consume the `,' and keep going. */
16040 /* If the next token is a `}', there is a trailing comma. */
16042 {
16047 }
16048 }
16049 }
16051 /* Parse an enumerator-definition. The enumerator has the indicated
16052 TYPE.
16054 enumerator-definition:
16055 enumerator
16056 enumerator = constant-expression
16058 enumerator:
16059 identifier */
16061 static void
16063 {
16064 tree identifier;
16065 tree value;
16066 location_t loc;
16068 /* Save the input location because we are interested in the location
16069 of the identifier and not the location of the explicit value. */
16072 /* Look for the identifier. */
16077 /* If the next token is an '=', then there is an explicit value. */
16079 {
16080 /* Consume the `=' token. */
16082 /* Parse the value. */
16084 }
16085 else
16088 /* If we are processing a template, make sure the initializer of the
16089 enumerator doesn't contain any bare template parameter pack. */
16093 /* Create the enumerator. */
16095 }
16097 /* Parse a namespace-name.
16099 namespace-name:
16100 original-namespace-name
16101 namespace-alias
16103 Returns the NAMESPACE_DECL for the namespace. */
16105 static tree
16107 {
16108 tree identifier;
16109 tree namespace_decl;
16113 /* Get the name of the namespace. */
16118 /* Look up the identifier in the currently active scope. Look only
16119 for namespaces, due to:
16121 [basic.lookup.udir]
16123 When looking up a namespace-name in a using-directive or alias
16124 definition, only namespace names are considered.
16126 And:
16128 [basic.lookup.qual]
16130 During the lookup of a name preceding the :: scope resolution
16131 operator, object, function, and enumerator names are ignored.
16133 (Note that cp_parser_qualifying_entity only calls this
16134 function if the token after the name is the scope resolution
16135 operator.) */
16137 none_type,
16143 /* If it's not a namespace, issue an error. */
16146 {
16151 }
16154 }
16156 /* Parse a namespace-definition.
16158 namespace-definition:
16159 named-namespace-definition
16160 unnamed-namespace-definition
16162 named-namespace-definition:
16163 original-namespace-definition
16164 extension-namespace-definition
16166 original-namespace-definition:
16167 namespace identifier { namespace-body }
16169 extension-namespace-definition:
16170 namespace original-namespace-name { namespace-body }
16172 unnamed-namespace-definition:
16173 namespace { namespace-body } */
16175 static void
16177 {
16184 {
16188 }
16189 else
16192 /* Look for the `namespace' keyword. */
16195 /* Get the name of the namespace. We do not attempt to distinguish
16196 between an original-namespace-definition and an
16197 extension-namespace-definition at this point. The semantic
16198 analysis routines are responsible for that. */
16201 else
16204 /* Parse any specified attributes. */
16207 /* Look for the `{' to start the namespace. */
16209 /* Start the namespace. */
16212 /* "inline namespace" is equivalent to a stub namespace definition
16213 followed by a strong using directive. */
16215 {
16217 /* Set up namespace association. */
16221 /* Import the contents of the inline namespace. */
16225 }
16229 /* Parse the body of the namespace. */
16235 /* Finish the namespace. */
16237 /* Look for the final `}'. */
16239 }
16241 /* Parse a namespace-body.
16243 namespace-body:
16244 declaration-seq [opt] */
16246 static void
16248 {
16250 }
16252 /* Parse a namespace-alias-definition.
16254 namespace-alias-definition:
16255 namespace identifier = qualified-namespace-specifier ; */
16257 static void
16259 {
16260 tree identifier;
16261 tree namespace_specifier;
16265 /* Look for the `namespace' keyword. */
16267 /* Look for the identifier. */
16271 /* Look for the `=' token. */
16274 {
16276 /* Skip the definition. */
16281 }
16283 /* Look for the qualified-namespace-specifier. */
16284 namespace_specifier
16286 /* Look for the `;' token. */
16289 /* Register the alias in the symbol table. */
16291 }
16293 /* Parse a qualified-namespace-specifier.
16295 qualified-namespace-specifier:
16296 :: [opt] nested-name-specifier [opt] namespace-name
16298 Returns a NAMESPACE_DECL corresponding to the specified
16299 namespace. */
16301 static tree
16303 {
16304 /* Look for the optional `::'. */
16308 /* Look for the optional nested-name-specifier. */
16316 }
16318 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16319 access declaration.
16321 using-declaration:
16322 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16323 using :: unqualified-id ;
16325 access-declaration:
16326 qualified-id ;
16328 */
16330 static bool
16333 {
16337 tree decl;
16338 tree identifier;
16339 tree qscope;
16344 {
16347 }
16348 else
16349 {
16350 /* Look for the `using' keyword. */
16353 /* Peek at the next token. */
16355 /* See if it's `typename'. */
16357 {
16358 /* Remember that we've seen it. */
16360 /* Consume the `typename' token. */
16362 }
16363 }
16365 /* Look for the optional global scope qualification. */
16366 global_scope_p
16371 /* If we saw `typename', or didn't see `::', then there must be a
16372 nested-name-specifier present. */
16374 {
16380 {
16383 }
16384 }
16385 /* Otherwise, we could be in either of the two productions. In that
16386 case, treat the nested-name-specifier as optional. */
16387 else
16399 /* Something has already gone wrong; there's no need to parse
16400 further. Since an error has occurred, the return value of
16401 cp_parser_parse_definitely will be false, as required. */
16405 /* Parse the unqualified-id. */
16413 {
16418 }
16420 /* The function we call to handle a using-declaration is different
16421 depending on what scope we are in. */
16423 ;
16426 /* [namespace.udecl]
16428 A using declaration shall not name a template-id. */
16431 else
16432 {
16434 {
16435 /* Create the USING_DECL. */
16442 {
16445 }
16446 else
16447 /* Add it to the list of members in this class. */
16449 }
16450 else
16451 {
16453 identifier,
16460 {
16463 }
16466 else
16468 }
16469 }
16471 /* Look for the final `;'. */
16476 "access declarations are deprecated "
16477 "in favour of using-declarations; "
16481 }
16483 /* Parse an alias-declaration.
16485 alias-declaration:
16486 using identifier attribute-specifier-seq [opt] = type-id */
16488 static tree
16490 {
16492 location_t id_location;
16494 cp_decl_specifier_seq decl_specs;
16498 /* Look for the `using' keyword. */
16499 cp_token *using_token
16521 /* Now we are going to parse the type-id of the declaration. */
16523 /*
16524 [dcl.type]/3 says:
16526 "A type-specifier-seq shall not define a class or enumeration
16527 unless it appears in the type-id of an alias-declaration (7.1.3) that
16528 is not the declaration of a template-declaration."
16530 In other words, if we currently are in an alias template, the
16531 type-id should not define a type.
16533 So let's set parser->type_definition_forbidden_message in that
16534 case; cp_parser_check_type_definition (called by
16535 cp_parser_class_specifier) will then emit an error if a type is
16536 defined in the type-id. */
16538 {
16542 }
16546 /* Restore the error message if need be. */
16552 {
16555 }
16557 /* A typedef-name can also be introduced by an alias-declaration. The
16558 identifier following the using keyword becomes a typedef-name. It has
16559 the same semantics as if it were introduced by the typedef
16560 specifier. In particular, it does not define a new type and it shall
16561 not appear in the type-id. */
16566 {
16569 ds_attribute,
16570 attrs_token);
16571 }
16573 ds_typedef,
16574 using_token);
16576 ds_alias,
16577 using_token);
16586 else
16597 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16598 added into the symbol table; otherwise, return the TYPE_DECL. */
16602 {
16606 }
16609 }
16611 /* Parse a using-directive.
16613 using-directive:
16614 using namespace :: [opt] nested-name-specifier [opt]
16615 namespace-name ; */
16617 static void
16619 {
16620 tree namespace_decl;
16621 tree attribs;
16623 /* Look for the `using' keyword. */
16625 /* And the `namespace' keyword. */
16627 /* Look for the optional `::' operator. */
16629 /* And the optional nested-name-specifier. */
16635 /* Get the namespace being used. */
16637 /* And any specified attributes. */
16639 /* Update the symbol table. */
16641 /* Look for the final `;'. */
16643 }
16645 /* Parse an asm-definition.
16647 asm-definition:
16648 asm ( string-literal ) ;
16650 GNU Extension:
16652 asm-definition:
16653 asm volatile [opt] ( string-literal ) ;
16654 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16655 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16656 : asm-operand-list [opt] ) ;
16657 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16658 : asm-operand-list [opt]
16659 : asm-clobber-list [opt] ) ;
16660 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16661 : asm-clobber-list [opt]
16662 : asm-goto-list ) ; */
16664 static void
16666 {
16667 tree string;
16672 tree asm_stmt;
16680 /* Look for the `asm' keyword. */
16685 {
16688 }
16690 /* See if the next token is `volatile'. */
16693 {
16694 /* Remember that we saw the `volatile' keyword. */
16696 /* Consume the token. */
16698 }
16702 {
16703 /* Remember that we saw the `goto' keyword. */
16705 /* Consume the token. */
16707 }
16708 /* Look for the opening `('. */
16711 /* Look for the string. */
16714 {
16718 }
16720 /* If we're allowing GNU extensions, check for the extended assembly
16721 syntax. Unfortunately, the `:' tokens need not be separated by
16722 a space in C, and so, for compatibility, we tolerate that here
16723 too. Doing that means that we have to treat the `::' operator as
16724 two `:' tokens. */
16729 {
16734 /* The extended syntax was used. */
16737 /* Look for outputs. */
16739 {
16740 /* Consume the `:'. */
16742 /* Parse the output-operands. */
16744 CPP_COLON)
16746 CPP_SCOPE)
16748 CPP_CLOSE_PAREN)
16754 }
16755 /* If the next token is `::', there are no outputs, and the
16756 next token is the beginning of the inputs. */
16758 /* The inputs are coming next. */
16761 /* Look for inputs. */
16764 {
16765 /* Consume the `:' or `::'. */
16767 /* Parse the output-operands. */
16769 CPP_COLON)
16771 CPP_SCOPE)
16773 CPP_CLOSE_PAREN))
16778 }
16780 /* The clobbers are coming next. */
16783 /* Look for clobbers. */
16786 {
16788 /* Consume the `:' or `::'. */
16790 /* Parse the clobbers. */
16792 CPP_COLON)
16794 CPP_CLOSE_PAREN))
16796 }
16799 /* The labels are coming next. */
16802 /* Look for labels. */
16805 {
16807 /* Consume the `:' or `::'. */
16809 /* Parse the labels. */
16811 }
16815 }
16819 /* Look for the closing `)'. */
16827 {
16828 /* Create the ASM_EXPR. */
16830 {
16833 /* If the extended syntax was not used, mark the ASM_EXPR. */
16835 {
16841 }
16842 }
16843 else
16845 }
16846 }
16848 /* Declarators [gram.dcl.decl] */
16850 /* Parse an init-declarator.
16852 init-declarator:
16853 declarator initializer [opt]
16855 GNU Extension:
16857 init-declarator:
16858 declarator asm-specification [opt] attributes [opt] initializer [opt]
16860 function-definition:
16861 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16862 function-body
16863 decl-specifier-seq [opt] declarator function-try-block
16865 GNU Extension:
16867 function-definition:
16868 __extension__ function-definition
16870 TM Extension:
16872 function-definition:
16873 decl-specifier-seq [opt] declarator function-transaction-block
16875 The DECL_SPECIFIERS apply to this declarator. Returns a
16876 representation of the entity declared. If MEMBER_P is TRUE, then
16877 this declarator appears in a class scope. The new DECL created by
16878 this declarator is returned.
16880 The CHECKS are access checks that should be performed once we know
16881 what entity is being declared (and, therefore, what classes have
16882 befriended it).
16884 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16885 for a function-definition here as well. If the declarator is a
16886 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16887 be TRUE upon return. By that point, the function-definition will
16888 have been completely parsed.
16890 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16891 is FALSE.
16893 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16894 parsed declaration if it is an uninitialized single declarator not followed
16895 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16896 if present, will not be consumed. If returned, this declarator will be
16897 created with SD_INITIALIZED but will not call cp_finish_decl.
16899 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16900 and there is an initializer, the pointed location_t is set to the
16901 location of the '=' or `(', or '{' in C++11 token introducing the
16902 initializer. */
16904 static tree
16914 {
16918 tree prefix_attributes;
16920 tree asm_specification;
16921 tree initializer;
16923 tree scope;
16925 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16926 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16927 "(...)". */
16938 /* Gather the attributes that were provided with the
16939 decl-specifiers. */
16942 /* Assume that this is not the declarator for a function
16943 definition. */
16947 /* Default arguments are only permitted for function parameters. */
16951 /* Defer access checks while parsing the declarator; we cannot know
16952 what names are accessible until we know what is being
16953 declared. */
16956 /* Parse the declarator. */
16958 declarator
16963 /* Gather up the deferred checks. */
16968 /* If the DECLARATOR was erroneous, there's no need to go
16969 further. */
16973 /* Check that the number of template-parameter-lists is OK. */
16983 /* Figure out what scope the entity declared by the DECLARATOR is
16984 located in. `grokdeclarator' sometimes changes the scope, so
16985 we compute it now. */
16988 /* Perform any lookups in the declared type which were thought to be
16989 dependent, but are not in the scope of the declarator. */
16990 decl_specifiers->type
16993 /* If we're allowing GNU extensions, look for an
16994 asm-specification. */
16996 {
16997 /* Look for an asm-specification. */
17000 }
17001 else
17004 /* Look for attributes. */
17008 /* Peek at the next token. */
17014 {
17015 /* Check to see if the token indicates the start of a
17016 function-definition. */
17018 {
17020 {
17021 /* If a function-definition should not appear here, issue an
17022 error message. */
17026 }
17028 location_t func_brace_location
17031 /* Neither attributes nor an asm-specification are allowed
17032 on a function-definition. */
17035 "an asm-specification is not allowed "
17039 "attributes are not allowed "
17041 /* This is a function-definition. */
17044 /* Parse the function definition. */
17047 decl_specifiers,
17048 declarator,
17049 prefix_attributes);
17050 else
17051 decl =
17052 (cp_parser_function_definition_from_specifiers_and_declarator
17056 {
17057 /* This is where the prologue starts... */
17060 }
17063 }
17064 }
17066 {
17067 /* A non-template declaration involving a function parameter list
17068 containing an implicit template parameter will be made into a
17069 template. If the resulting declaration is not going to be an
17070 actual function then finish the template scope here to prevent it.
17071 An error message will be issued once we have a decl to talk about.
17073 FIXME probably we should do type deduction rather than create an
17074 implicit template, but the standard currently doesn't allow it. */
17077 }
17079 /* [dcl.dcl]
17081 Only in function declarations for constructors, destructors, and
17082 type conversions can the decl-specifier-seq be omitted.
17084 We explicitly postpone this check past the point where we handle
17085 function-definitions because we tolerate function-definitions
17086 that are missing their return types in some modes. */
17088 {
17092 }
17094 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17098 {
17109 {
17115 }
17116 }
17117 else
17118 {
17119 /* If the init-declarator isn't initialized and isn't followed by a
17120 `,' or `;', it's not a valid init-declarator. */
17123 {
17126 else
17127 {
17131 }
17132 }
17135 }
17137 /* Because start_decl has side-effects, we should only call it if we
17138 know we're going ahead. By this point, we know that we cannot
17139 possibly be looking at any other construct. */
17142 /* Enter the newly declared entry in the symbol table. If we're
17143 processing a declaration in a class-specifier, we wait until
17144 after processing the initializer. */
17146 {
17153 /* Adjust location of decl if declarator->id_loc is more appropriate:
17154 set, and decl wasn't merged with another decl, in which case its
17155 location would be different from input_location, and more accurate. */
17160 }
17162 /* Enter the SCOPE. That way unqualified names appearing in the
17163 initializer will be looked up in SCOPE. */
17166 /* Perform deferred access control checks, now that we know in which
17167 SCOPE the declared entity resides. */
17169 {
17172 /* If the entity being declared is a function, pretend that we
17173 are in its scope. If it is a `friend', it may have access to
17174 things that would not otherwise be accessible. */
17176 {
17179 }
17181 /* Perform access checks for template parameters. */
17184 /* Perform the access control checks for the declarator and the
17185 decl-specifiers. */
17188 /* Restore the saved value. */
17191 }
17193 /* Parse the initializer. */
17198 {
17200 {
17203 else
17204 {
17205 /* If the declaration was erroneous, we don't really
17206 know what the user intended, so just silently
17207 consume the initializer. */
17214 }
17215 }
17216 else
17217 {
17218 /* We want to record the extra mangling scope for in-class
17219 initializers of class members and initializers of static data
17220 member templates. The former involves deferring
17221 parsing of the initializer until end of class as with default
17222 arguments. So right here we only handle the latter. */
17232 }
17233 }
17235 /* The old parser allows attributes to appear after a parenthesized
17236 initializer. Mark Mitchell proposed removing this functionality
17237 on the GCC mailing lists on 2002-08-13. This parser accepts the
17238 attributes -- but ignores them. */
17245 /* And now complain about a non-function implicit template. */
17250 /* For an in-class declaration, use `grokfield' to create the
17251 declaration. */
17253 {
17255 {
17258 }
17266 }
17268 /* Finish processing the declaration. But, skip member
17269 declarations. */
17271 {
17274 asm_specification,
17275 /* If the initializer is in parentheses, then this is
17276 a direct-initialization, which means that an
17277 `explicit' constructor is OK. Otherwise, an
17278 `explicit' constructor cannot be used. */
17281 }
17284 /* Core issue #226 (C++0x only): A default template-argument
17285 shall not be specified in a friend class template
17286 declaration. */
17295 {
17298 else
17300 }
17303 }
17305 /* Parse a declarator.
17307 declarator:
17308 direct-declarator
17309 ptr-operator declarator
17311 abstract-declarator:
17312 ptr-operator abstract-declarator [opt]
17313 direct-abstract-declarator
17315 GNU Extensions:
17317 declarator:
17318 attributes [opt] direct-declarator
17319 attributes [opt] ptr-operator declarator
17321 abstract-declarator:
17322 attributes [opt] ptr-operator abstract-declarator [opt]
17323 attributes [opt] direct-abstract-declarator
17325 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17326 detect constructor, destructor or conversion operators. It is set
17327 to -1 if the declarator is a name, and +1 if it is a
17328 function. Otherwise it is set to zero. Usually you just want to
17329 test for >0, but internally the negative value is used.
17331 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17332 a decl-specifier-seq unless it declares a constructor, destructor,
17333 or conversion. It might seem that we could check this condition in
17334 semantic analysis, rather than parsing, but that makes it difficult
17335 to handle something like `f()'. We want to notice that there are
17336 no decl-specifiers, and therefore realize that this is an
17337 expression, not a declaration.)
17339 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17340 the declarator is a direct-declarator of the form "(...)".
17342 MEMBER_P is true iff this declarator is a member-declarator.
17344 FRIEND_P is true iff this declarator is a friend. */
17348 cp_parser_declarator_kind dcl_kind,
17352 {
17355 cp_cv_quals cv_quals;
17356 tree class_type;
17359 /* Assume this is not a constructor, destructor, or type-conversion
17360 operator. */
17367 /* Check for the ptr-operator production. */
17369 /* Parse the ptr-operator. */
17375 /* If that worked, then we have a ptr-operator. */
17377 {
17378 /* If a ptr-operator was found, then this declarator was not
17379 parenthesized. */
17382 /* The dependent declarator is optional if we are parsing an
17383 abstract-declarator. */
17387 /* Parse the dependent declarator. */
17392 friend_p);
17394 /* If we are parsing an abstract-declarator, we must handle the
17395 case where the dependent declarator is absent. */
17400 declarator = cp_parser_make_indirect_declarator
17402 }
17403 /* Everything else is a direct-declarator. */
17404 else
17405 {
17408 CPP_OPEN_PAREN);
17410 ctor_dtor_or_conv_p,
17412 }
17417 }
17419 /* Parse a direct-declarator or direct-abstract-declarator.
17421 direct-declarator:
17422 declarator-id
17423 direct-declarator ( parameter-declaration-clause )
17424 cv-qualifier-seq [opt]
17425 ref-qualifier [opt]
17426 exception-specification [opt]
17427 direct-declarator [ constant-expression [opt] ]
17428 ( declarator )
17430 direct-abstract-declarator:
17431 direct-abstract-declarator [opt]
17432 ( parameter-declaration-clause )
17433 cv-qualifier-seq [opt]
17434 ref-qualifier [opt]
17435 exception-specification [opt]
17436 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17437 ( abstract-declarator )
17439 Returns a representation of the declarator. DCL_KIND is
17440 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17441 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17442 we are parsing a direct-declarator. It is
17443 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17444 of ambiguity we prefer an abstract declarator, as per
17445 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17446 as for cp_parser_declarator. */
17450 cp_parser_declarator_kind dcl_kind,
17453 {
17463 {
17464 /* Peek at the next token. */
17467 {
17468 /* This is either a parameter-declaration-clause, or a
17469 parenthesized declarator. When we know we are parsing a
17470 named declarator, it must be a parenthesized declarator
17471 if FIRST is true. For instance, `(int)' is a
17472 parameter-declaration-clause, with an omitted
17473 direct-abstract-declarator. But `((*))', is a
17474 parenthesized abstract declarator. Finally, when T is a
17475 template parameter `(T)' is a
17476 parameter-declaration-clause, and not a parenthesized
17477 named declarator.
17479 We first try and parse a parameter-declaration-clause,
17480 and then try a nested declarator (if FIRST is true).
17482 It is not an error for it not to be a
17483 parameter-declaration-clause, even when FIRST is
17484 false. Consider,
17486 int i (int);
17487 int i (3);
17489 The first is the declaration of a function while the
17490 second is the definition of a variable, including its
17491 initializer.
17493 Having seen only the parenthesis, we cannot know which of
17494 these two alternatives should be selected. Even more
17495 complex are examples like:
17497 int i (int (a));
17498 int i (int (3));
17500 The former is a function-declaration; the latter is a
17501 variable initialization.
17503 Thus again, we try a parameter-declaration-clause, and if
17504 that fails, we back out and return. */
17507 {
17508 tree params;
17511 /* In a member-declarator, the only valid interpretation
17512 of a parenthesis is the start of a
17513 parameter-declaration-clause. (It is invalid to
17514 initialize a static data member with a parenthesized
17515 initializer; only the "=" form of initialization is
17516 permitted.) */
17520 /* Consume the `('. */
17523 {
17524 /* If this is going to be an abstract declarator, we're
17525 in a declarator and we can't have default args. */
17528 }
17532 /* Parse the parameter-declaration-clause. */
17535 /* Consume the `)'. */
17538 /* If all went well, parse the cv-qualifier-seq,
17539 ref-qualifier and the exception-specification. */
17541 {
17542 cp_cv_quals cv_quals;
17543 cp_virt_specifiers virt_specifiers;
17544 cp_ref_qualifier ref_qual;
17545 tree exception_specification;
17546 tree late_return;
17547 tree attrs;
17557 /* Parse the cv-qualifier-seq. */
17559 /* Parse the ref-qualifier. */
17561 /* And the exception-specification. */
17562 exception_specification
17567 /* In here, we handle cases where attribute is used after
17568 the function declaration. For example:
17569 void func (int x) __attribute__((vector(..))); */
17572 {
17576 CPP_SEMICOLON)
17578 CPP_OPEN_BRACE))
17581 ;
17582 else
17584 }
17585 late_return = (cp_parser_late_return_type_opt
17590 /* Parse the virt-specifier-seq. */
17593 /* Create the function-declarator. */
17595 params,
17596 cv_quals,
17597 virt_specifiers,
17598 ref_qual,
17599 exception_specification,
17600 late_return);
17602 /* Any subsequent parameter lists are to do with
17603 return type, so are not those of the declared
17604 function. */
17606 }
17608 /* Remove the function parms from scope. */
17612 /* Repeat the main loop. */
17614 }
17616 /* If this is the first, we can try a parenthesized
17617 declarator. */
17619 {
17625 /* Consume the `('. */
17627 /* Parse the nested declarator. */
17630 declarator
17636 /* Expect a `)'. */
17643 }
17644 /* Otherwise, we must be done. */
17645 else
17647 }
17651 {
17652 /* Parse an array-declarator. */
17661 /* Consume the `['. */
17663 /* Peek at the next token. */
17665 /* If the next token is `]', then there is no
17666 constant-expression. */
17668 {
17670 bounds
17680 {
17681 /* Normally, the array bound must be an integral constant
17682 expression. However, as an extension, we allow VLAs
17683 in function scopes as long as they aren't part of a
17684 parameter declaration. */
17688 }
17691 {
17692 /* Remember this wasn't a constant-expression. */
17695 }
17696 }
17697 else
17699 /* Look for the closing `]'. */
17701 {
17704 }
17709 }
17711 {
17712 {
17713 tree qualifying_scope;
17714 tree unqualified_name;
17715 tree attrs;
17716 special_function_kind sfk;
17721 /* Parse a declarator-id */
17724 {
17727 /* If we see an ellipsis, we should be looking at a
17728 parameter pack. */
17730 {
17731 /* Consume the `...' */
17735 }
17736 }
17739 unqualified_name
17743 {
17747 {
17748 /* Check whether an error occurred. */
17751 /* We already consumed the ellipsis to mark a
17752 parameter pack, but we have no way to report it,
17753 so abort the tentative parse. We will be exiting
17754 immediately anyway. */
17756 }
17757 else
17763 && (qualifying_scope
17765 {
17768 }
17769 }
17774 {
17779 }
17785 {
17786 /* In the declaration of a member of a template class
17787 outside of the class itself, the SCOPE will sometimes
17788 be a TYPENAME_TYPE. For example, given:
17790 template <typename T>
17791 int S<T>::R::i = 3;
17793 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17794 this context, we must resolve S<T>::R to an ordinary
17795 type, rather than a typename type.
17797 The reason we normally avoid resolving TYPENAME_TYPEs
17798 is that a specialization of `S' might render
17799 `S<T>::R' not a type. However, if `S' is
17800 specialized, then this `i' will not be used, so there
17801 is no harm in resolving the types here. */
17802 tree type;
17804 /* Resolve the TYPENAME_TYPE. */
17807 /* If that failed, the declarator is invalid. */
17809 {
17812 "cannot define member of dependent typedef "
17814 else
17819 }
17821 }
17826 {
17827 tree class_type;
17832 else
17836 {
17839 {
17842 {
17846 "use %<%T::%D%> instead of %<%T::%D%> to "
17848 class_type,
17853 }
17854 else
17856 }
17857 else
17858 {
17859 /* We do not attempt to print the declarator
17860 here because we do not have enough
17861 information about its original syntactic
17862 form. */
17866 }
17867 }
17870 {
17876 for an anonymous type, even if the type
17877 got a name for linkage purposes. */
17879 /* Handle correctly (c++/19200):
17881 struct S {
17882 struct T{};
17883 friend void S(T);
17884 };
17886 and also:
17888 namespace N {
17889 void S();
17890 }
17892 struct S {
17893 friend void N::S();
17894 }; */
17895 && !(friend_p
17898 class_type))
17899 {
17902 }
17910 }
17911 }
17913 unqualified_name,
17914 sfk);
17921 }
17923 handle_declarator:;
17926 {
17927 /* Any names that appear after the declarator-id for a
17928 member are looked up in the containing scope. */
17930 {
17931 /* But declarations with qualified-ids can't appear in a
17932 function. */
17936 }
17938 }
17942 /* Default args are only allowed on function
17943 declarations. */
17945 else
17949 }
17950 /* We're done. */
17951 else
17953 }
17955 /* For an abstract declarator, we might wind up with nothing at this
17956 point. That's an error; the declarator is not optional. */
17960 /* If we entered a scope, we must exit it now. */
17968 }
17970 /* Parse a ptr-operator.
17972 ptr-operator:
17973 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17974 * cv-qualifier-seq [opt]
17975 &
17976 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17977 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17979 GNU Extension:
17981 ptr-operator:
17982 & cv-qualifier-seq [opt]
17984 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17985 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17986 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17987 filled in with the TYPE containing the member. *CV_QUALS is
17988 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17989 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17990 Note that the tree codes returned by this function have nothing
17991 to do with the types of trees that will be eventually be created
17992 to represent the pointer or reference type being parsed. They are
17993 just constants with suggestive names. */
17994 static enum tree_code
17999 {
18004 /* Assume that it's not a pointer-to-member. */
18006 /* And that there are no cv-qualifiers. */
18009 /* Peek at the next token. */
18012 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18022 {
18023 /* Consume the `*', `&' or `&&'. */
18026 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18027 `&', if we are allowing GNU extensions. (The only qualifier
18028 that can legally appear after `&' is `restrict', but that is
18029 enforced during semantic analysis. */
18037 }
18038 else
18039 {
18040 /* Try the pointer-to-member case. */
18042 /* Look for the optional `::' operator. */
18045 /* Look for the nested-name specifier. */
18052 /* If we found it, and the next token is a `*', then we are
18053 indeed looking at a pointer-to-member operator. */
18056 {
18057 /* Indicate that the `*' operator was used. */
18065 else
18066 {
18067 /* The type of which the member is a member is given by the
18068 current SCOPE. */
18070 /* The next name will not be qualified. */
18074 /* Look for optional c++11 attributes. */
18078 /* Look for the optional cv-qualifier-seq. */
18080 }
18081 }
18082 /* If that didn't work we don't have a ptr-operator. */
18085 }
18088 }
18090 /* Parse an (optional) cv-qualifier-seq.
18092 cv-qualifier-seq:
18093 cv-qualifier cv-qualifier-seq [opt]
18095 cv-qualifier:
18096 const
18097 volatile
18099 GNU Extension:
18101 cv-qualifier:
18102 __restrict__
18104 Returns a bitmask representing the cv-qualifiers. */
18106 static cp_cv_quals
18108 {
18112 {
18114 cp_cv_quals cv_qualifier;
18116 /* Peek at the next token. */
18118 /* See if it's a cv-qualifier. */
18120 {
18136 }
18142 {
18145 }
18146 else
18147 {
18150 }
18151 }
18154 }
18156 /* Parse an (optional) ref-qualifier
18158 ref-qualifier:
18159 &
18160 &&
18162 Returns cp_ref_qualifier representing ref-qualifier. */
18164 static cp_ref_qualifier
18166 {
18169 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18174 {
18179 {
18191 }
18196 {
18199 }
18200 else
18201 {
18204 }
18205 }
18208 }
18210 /* Parse an (optional) virt-specifier-seq.
18212 virt-specifier-seq:
18213 virt-specifier virt-specifier-seq [opt]
18215 virt-specifier:
18216 override
18217 final
18219 Returns a bitmask representing the virt-specifiers. */
18221 static cp_virt_specifiers
18223 {
18227 {
18229 cp_virt_specifiers virt_specifier;
18231 /* Peek at the next token. */
18233 /* See if it's a virt-specifier-qualifier. */
18237 {
18240 }
18242 {
18245 }
18247 {
18249 }
18250 else
18254 {
18257 }
18258 else
18259 {
18262 }
18263 }
18265 }
18267 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18268 is in scope even though it isn't real. */
18270 void
18272 {
18273 tree this_parm;
18276 {
18277 /* We don't clear this between NSDMIs. Is it already what we want? */
18282 }
18285 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18287 current_class_ref
18290 }
18292 /* Return true iff our current scope is a non-static data member
18293 initializer. */
18295 bool
18297 {
18298 /* We recognize NSDMI context by the context-less 'this' pointer set up
18299 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. If ENUM_OK is TRUE,
19593 enum-names are also accepted.
19595 Returns the TYPE_DECL representing the class. */
19597 static tree
19606 {
19607 tree decl;
19608 tree scope;
19613 /* All class-names start with an identifier. */
19616 {
19619 }
19621 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19622 to a template-id, so we save it here. */
19627 /* Any name names a type if we're following the `typename' keyword
19628 in a qualified name where the enclosing scope is type-dependent. */
19631 /* Handle the common case (an identifier, but not a template-id)
19632 efficiently. */
19635 {
19639 /* Look for the identifier. */
19643 /* If the next token isn't an identifier, we are certainly not
19644 looking at a class-name. */
19647 /* If we know this is a type-name, there's no need to look it
19648 up. */
19651 else
19652 {
19653 tree ambiguous_decls;
19654 /* If we already know that this lookup is ambiguous, then
19655 we've already issued an error message; there's no reason
19656 to check again. */
19658 {
19661 }
19662 /* If the next token is a `::', then the name must be a type
19663 name.
19665 [basic.lookup.qual]
19667 During the lookup for a name preceding the :: scope
19668 resolution operator, object, function, and enumerator
19669 names are ignored. */
19672 /* Look up the name. */
19674 tag_type,
19677 check_dependency_p,
19681 {
19685 }
19686 }
19687 }
19688 else
19689 {
19690 /* Try a template-id. */
19692 check_dependency_p,
19693 tag_type,
19694 is_declaration);
19697 }
19701 /* If this is a typename, create a TYPENAME_TYPE. */
19703 {
19708 }
19712 /* Check to see that it is really the name of a class. */
19716 /* Situations like this:
19718 template <typename T> struct A {
19719 typename T::template X<int>::I i;
19720 };
19722 are problematic. Is `T::template X<int>' a class-name? The
19723 standard does not seem to be definitive, but there is no other
19724 valid interpretation of the following `::'. Therefore, those
19725 names are considered class-names. */
19726 {
19730 }
19735 /* In Objective-C 2.0, a classname followed by '.' starts a
19736 dot-syntax expression, and it's not a type-name. */
19748 }
19750 /* Parse a class-specifier.
19752 class-specifier:
19753 class-head { member-specification [opt] }
19755 Returns the TREE_TYPE representing the class. */
19757 static tree
19759 {
19760 tree type;
19774 /* Parse the class-head. */
19777 /* If the class-head was a semantic disaster, skip the entire body
19778 of the class. */
19780 {
19784 }
19786 /* Look for the `{'. */
19788 {
19791 }
19795 /* Issue an error message if type-definitions are forbidden here. */
19797 /* Remember that we are defining one more class. */
19799 /* Inside the class, surrounding template-parameter-lists do not
19800 apply. */
19801 saved_num_template_parameter_lists
19804 /* We are not in a function body. */
19807 /* Or in a loop. */
19810 /* Or in a switch. */
19813 /* We are not immediately inside an extern "lang" block. */
19814 saved_in_unbraced_linkage_specification_p
19818 /* Start the class. */
19820 {
19823 }
19827 /* If the type is erroneous, skip the entire body of the class. */
19829 else
19830 /* Parse the member-specification. */
19833 /* Look for the trailing `}'. */
19835 /* Look for trailing attributes to apply to this class. */
19843 /* We've finished a type definition. Check for the common syntax
19844 error of forgetting a semicolon after the definition. We need to
19845 be careful, as we can't just check for not-a-semicolon and be done
19846 with it; the user might have typed:
19848 class X { } c = ...;
19849 class X { } *p = ...;
19851 and so forth. Instead, enumerate all the possible tokens that
19852 might follow this production; if we don't see one of them, then
19853 complain and silently insert the semicolon. */
19854 {
19859 /* Don't try to parse c++11 attributes here. As per the
19860 grammar, that should be a task for
19861 cp_parser_decl_specifier_seq. */
19865 {
19876 /* While it's legal for type qualifiers and storage class
19877 specifiers to follow type definitions in the grammar, only
19878 compiler testsuites contain code like that. Assume that if
19879 we see such code, then what we're really seeing is a case
19880 like:
19882 class X { }
19883 const <type> var = ...;
19885 or
19887 class Y { }
19888 static <type> func (...) ...
19890 i.e. the qualifier or specifier applies to the next
19891 declaration. To do so, however, we need to look ahead one
19892 more token to see if *that* token is a type specifier.
19894 This code could be improved to handle:
19896 class Z { }
19897 static const <type> var = ...; */
19900 {
19903 /* Handling user-defined types here would be nice, but very
19904 tricky. */
19905 want_semicolon
19908 }
19912 }
19914 /* If we don't have a type, then something is very wrong and we
19915 shouldn't try to do anything clever. Likewise for not seeing the
19916 closing brace. */
19918 {
19919 cp_token_position prev
19930 else
19933 /* Unget one token and smash it to look as though we encountered
19934 a semicolon in the input stream. */
19939 }
19940 }
19942 /* If this class is not itself within the scope of another class,
19943 then we need to parse the bodies of all of the queued function
19944 definitions. Note that the queued functions defined in a class
19945 are not always processed immediately following the
19946 class-specifier for that class. Consider:
19948 struct A {
19949 struct B { void f() { sizeof (A); } };
19950 };
19952 If `f' were processed before the processing of `A' were
19953 completed, there would be no way to compute the size of `A'.
19954 Note that the nesting we are interested in here is lexical --
19955 not the semantic nesting given by TYPE_CONTEXT. In particular,
19956 for:
19958 struct A { struct B; };
19959 struct A::B { void f() { } };
19961 there is no need to delay the parsing of `A::B::f'. */
19963 {
19964 tree decl;
19971 /* In a first pass, parse default arguments to the functions.
19972 Then, in a second pass, parse the bodies of the functions.
19973 This two-phased approach handles cases like:
19975 struct S {
19976 void f() { g(); }
19977 void g(int i = 3);
19978 };
19980 */
19982 {
19984 /* If there are default arguments that have not yet been processed,
19985 take care of them now. */
19987 {
19992 }
19993 /* Make sure that any template parameters are in scope. */
19995 /* Parse the default argument expressions. */
19997 /* Remove any template parameters from the symbol table. */
19999 }
20001 /* Now parse any NSDMIs. */
20005 {
20007 {
20012 }
20015 }
20022 /* Now do some post-NSDMI bookkeeping. */
20028 /* Now parse the body of the functions. */
20030 {
20031 /* OpenMP UDRs need to be parsed before all other functions. */
20038 }
20039 else
20043 }
20044 else
20047 /* Put back any saved access checks. */
20050 /* Restore saved state. */
20054 parser->num_template_parameter_lists
20056 parser->in_unbraced_linkage_specification_p
20060 }
20062 static tree
20064 {
20065 tree ret;
20070 }
20072 /* Parse a class-head.
20074 class-head:
20075 class-key identifier [opt] base-clause [opt]
20076 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20077 class-key nested-name-specifier [opt] template-id
20078 base-clause [opt]
20080 class-virt-specifier:
20081 final
20083 GNU Extensions:
20084 class-key attributes identifier [opt] base-clause [opt]
20085 class-key attributes nested-name-specifier identifier base-clause [opt]
20086 class-key attributes nested-name-specifier [opt] template-id
20087 base-clause [opt]
20089 Upon return BASES is initialized to the list of base classes (or
20090 NULL, if there are none) in the same form returned by
20091 cp_parser_base_clause.
20093 Returns the TYPE of the indicated class. Sets
20094 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20095 involving a nested-name-specifier was used, and FALSE otherwise.
20097 Returns error_mark_node if this is not a class-head.
20099 Returns NULL_TREE if the class-head is syntactically valid, but
20100 semantically invalid in a way that means we should skip the entire
20101 body of the class. */
20103 static tree
20106 {
20107 tree nested_name_specifier;
20111 tree attributes;
20112 tree bases;
20122 /* Assume no nested-name-specifier will be present. */
20124 /* Assume no template parameter lists will be used in defining the
20125 type. */
20129 /* Look for the class-key. */
20134 /* Parse the attributes. */
20137 /* If the next token is `::', that is invalid -- but sometimes
20138 people do try to write:
20140 struct ::S {};
20142 Handle this gracefully by accepting the extra qualifier, and then
20143 issuing an error about it later if this really is a
20144 class-head. If it turns out just to be an elaborated type
20145 specifier, remain silent. */
20151 /* Determine the name of the class. Begin by looking for an
20152 optional nested-name-specifier. */
20154 nested_name_specifier
20160 /* If there was a nested-name-specifier, then there *must* be an
20161 identifier. */
20163 {
20165 /* Although the grammar says `identifier', it really means
20166 `class-name' or `template-name'. You are only allowed to
20167 define a class that has already been declared with this
20168 syntax.
20170 The proposed resolution for Core Issue 180 says that wherever
20171 you see `class T::X' you should treat `X' as a type-name.
20173 It is OK to define an inaccessible class; for example:
20175 class A { class B; };
20176 class A::B {};
20178 We do not know if we will see a class-name, or a
20179 template-name. We look for a class-name first, in case the
20180 class-name is a template-id; if we looked for the
20181 template-name first we would stop after the template-name. */
20186 class_type,
20190 /* If that didn't work, ignore the nested-name-specifier. */
20192 {
20198 }
20199 /* If we could not find a corresponding TYPE, treat this
20200 declaration like an unqualified declaration. */
20203 /* Otherwise, count the number of templates used in TYPE and its
20204 containing scopes. */
20205 else
20206 {
20207 tree scope;
20219 }
20220 }
20221 /* Otherwise, the identifier is optional. */
20222 else
20223 {
20224 /* We don't know whether what comes next is a template-id,
20225 an identifier, or nothing at all. */
20227 /* Check for a template-id. */
20232 class_key,
20234 /* If that didn't work, it could still be an identifier. */
20236 {
20238 {
20241 }
20242 else
20244 }
20245 else
20246 {
20249 }
20250 }
20255 {
20257 class_key,
20259 }
20262 /* If it's not a `:' or a `{' then we can't really be looking at a
20263 class-head, since a class-head only appears as part of a
20264 class-specifier. We have to detect this situation before calling
20265 xref_tag, since that has irreversible side-effects. */
20267 {
20271 }
20273 /* At this point, we're going ahead with the class-specifier, even
20274 if some other problem occurs. */
20277 {
20282 }
20283 /* Issue the error about the overly-qualified name now. */
20285 {
20290 }
20292 {
20297 }
20299 {
20300 tree scope;
20302 /* Reject typedef-names in class heads. */
20304 {
20307 type);
20310 }
20312 /* Figure out in what scope the declaration is being placed. */
20314 /* If that scope does not contain the scope in which the
20315 class was originally declared, the program is invalid. */
20317 {
20320 "declaration of %qD in namespace %qD which does not "
20323 else
20329 }
20330 /* [dcl.meaning]
20332 A declarator-id shall not be qualified except for the
20333 definition of a ... nested class outside of its class
20334 ... [or] the definition or explicit instantiation of a
20335 class member of a namespace outside of its namespace. */
20337 {
20342 }
20343 }
20344 /* An explicit-specialization must be preceded by "template <>". If
20345 it is not, try to recover gracefully. */
20349 {
20353 /* Take the same action that would have been taken by
20354 cp_parser_explicit_specialization. */
20357 }
20358 /* There must be no "return" statements between this point and the
20359 end of this function; set "type "to the correct return value and
20360 use "goto done;" to return. */
20361 /* Make sure that the right number of template parameters were
20362 present. */
20366 {
20367 /* If something went wrong, there is no point in even trying to
20368 process the class-definition. */
20371 }
20373 /* Look up the type. */
20375 {
20379 {
20383 }
20384 else
20385 {
20388 }
20391 }
20393 {
20394 tree class_type;
20396 /* Given:
20398 template <typename T> struct S { struct T };
20399 template <typename T> struct S<T>::T { };
20401 we will get a TYPENAME_TYPE when processing the definition of
20402 `S::T'. We need to resolve it to the actual type before we
20403 try to define it. */
20405 {
20410 else
20411 {
20414 }
20415 }
20419 {
20422 }
20425 /* Enter the scope indicated by the nested-name-specifier. */
20427 /* Get the canonical version of this type. */
20429 /* Call push_template_decl if it seems like we should be defining a
20430 template either from the template headers or the type we're
20431 defining, so that we diagnose both extra and missing headers. */
20435 {
20438 {
20441 }
20442 }
20446 }
20448 {
20449 /* If the class was unnamed, create a dummy name. */
20454 }
20456 /* Indicate whether this class was declared as a `class' or as a
20457 `struct'. */
20462 /* If this type was already complete, and we see another definition,
20463 that's an error. */
20465 {
20467 type);
20469 type);
20472 }
20477 {
20478 /* Apply attributes now, before any use of the class as a template
20479 argument in its base list. */
20482 }
20484 /* We will have entered the scope containing the class; the names of
20485 base classes should be looked up in that context. For example:
20487 struct A { struct B {}; struct C; };
20488 struct A::C : B {};
20490 is valid. */
20492 /* Get the list of base-classes, if there is one. */
20494 {
20495 /* PR59482: enter the class scope so that base-specifiers are looked
20496 up correctly. */
20500 /* PR59482: get out of the previously pushed class scope so that the
20501 subsequent pops pop the right thing. */
20504 }
20505 else
20508 /* If we're really defining a class, process the base classes.
20509 If they're invalid, fail. */
20514 done:
20515 /* Leave the scope given by the nested-name-specifier. We will
20516 enter the class scope itself while processing the members. */
20521 {
20524 }
20530 out:
20533 }
20535 /* Parse a class-key.
20537 class-key:
20538 class
20539 struct
20540 union
20542 Returns the kind of class-key specified, or none_type to indicate
20543 error. */
20545 static enum tag_types
20547 {
20551 /* Look for the class-key. */
20556 /* Check to see if the TOKEN is a class-key. */
20561 }
20563 /* Parse a type-parameter-key.
20565 type-parameter-key:
20566 class
20567 typename
20568 */
20570 static void
20572 {
20573 /* Look for the type-parameter-key. */
20577 {
20580 /* typename is not allowed in a template template parameter
20581 by the standard until C++1Z. */
20583 "ISO C++ forbids typename key in template template parameter;"
20585 }
20586 else
20590 }
20592 /* Parse an (optional) member-specification.
20594 member-specification:
20595 member-declaration member-specification [opt]
20596 access-specifier : member-specification [opt] */
20598 static void
20600 {
20602 {
20606 /* Peek at the next token. */
20608 /* If it's a `}', or EOF then we've seen all the members. */
20614 /* See if this token is a keyword. */
20617 {
20621 /* Consume the access-specifier. */
20623 /* Remember which access-specifier is active. */
20625 /* Look for the `:'. */
20630 /* Accept #pragmas at class scope. */
20632 {
20635 }
20637 /* Otherwise, the next construction must be a
20638 member-declaration. */
20640 }
20641 }
20642 }
20644 /* Parse a member-declaration.
20646 member-declaration:
20647 decl-specifier-seq [opt] member-declarator-list [opt] ;
20648 function-definition ; [opt]
20649 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20650 using-declaration
20651 template-declaration
20652 alias-declaration
20654 member-declarator-list:
20655 member-declarator
20656 member-declarator-list , member-declarator
20658 member-declarator:
20659 declarator pure-specifier [opt]
20660 declarator constant-initializer [opt]
20661 identifier [opt] : constant-expression
20663 GNU Extensions:
20665 member-declaration:
20666 __extension__ member-declaration
20668 member-declarator:
20669 declarator attributes [opt] pure-specifier [opt]
20670 declarator attributes [opt] constant-initializer [opt]
20671 identifier [opt] attributes [opt] : constant-expression
20673 C++0x Extensions:
20675 member-declaration:
20676 static_assert-declaration */
20678 static void
20680 {
20681 cp_decl_specifier_seq decl_specifiers;
20682 tree prefix_attributes;
20683 tree decl;
20692 /* Check for the `__extension__' keyword. */
20694 {
20695 /* Recurse. */
20697 /* Restore the old value of the PEDANTIC flag. */
20701 }
20703 /* Check for a template-declaration. */
20705 {
20706 /* An explicit specialization here is an error condition, and we
20707 expect the specialization handler to detect and report this. */
20711 else
20715 }
20717 /* Check for a using-declaration. */
20719 {
20721 {
20722 /* Parse the using-declaration. */
20726 }
20727 else
20728 {
20729 tree decl;
20733 /* Note that if we actually see the '=' token after the
20734 identifier, cp_parser_alias_declaration commits the
20735 tentative parse. In that case, we really expects an
20736 alias-declaration. Otherwise, we expect a using
20737 declaration. */
20738 alias_decl_expected =
20744 else
20748 }
20749 }
20751 /* Check for @defs. */
20753 {
20758 {
20763 }
20765 }
20767 /* If the next token is `static_assert' we have a static assertion. */
20769 {
20772 }
20779 /* Parse the decl-specifier-seq. */
20782 CP_PARSER_FLAGS_OPTIONAL,
20785 /* Check for an invalid type-name. */
20789 /* If there is no declarator, then the decl-specifier-seq should
20790 specify a type. */
20792 {
20793 /* If there was no decl-specifier-seq, and the next token is a
20794 `;', then we have something like:
20796 struct S { ; };
20798 [class.mem]
20800 Each member-declaration shall declare at least one member
20801 name of the class. */
20803 {
20807 }
20808 else
20809 {
20810 tree type;
20812 /* See if this declaration is a friend. */
20814 /* If there were decl-specifiers, check to see if there was
20815 a class-declaration. */
20818 /* Nested classes have already been added to the class, but
20819 a `friend' needs to be explicitly registered. */
20821 {
20822 /* If the `friend' keyword was present, the friend must
20823 be introduced with a class-key. */
20826 "in C++03 a class-key must be used "
20828 /* In this case:
20830 template <typename T> struct A {
20831 friend struct A<T>::B;
20832 };
20834 A<T>::B will be represented by a TYPENAME_TYPE, and
20835 therefore not recognized by check_tag_decl. */
20837 {
20841 }
20844 "friend declaration does not name a class or "
20846 else
20849 }
20850 /* If there is no TYPE, an error message will already have
20851 been issued. */
20853 ;
20854 /* An anonymous aggregate has to be handled specially; such
20855 a declaration really declares a data member (with a
20856 particular type), as opposed to a nested class. */
20858 {
20859 /* C++11 9.5/6. */
20862 "a storage class on an anonymous aggregate "
20865 /* Remove constructors and such from TYPE, now that we
20866 know it is an anonymous aggregate. */
20868 /* And make the corresponding data member. */
20871 /* Add it to the class. */
20873 }
20874 else
20875 cp_parser_check_access_in_redeclaration
20878 }
20879 }
20880 else
20881 {
20884 /* Clear attributes from the decl_specifiers but keep them
20885 around as prefix attributes that apply them to the entity
20886 being declared. */
20890 /* See if these declarations will be friends. */
20893 /* Keep going until we hit the `;' at the end of the
20894 declaration. */
20896 {
20898 tree first_attribute;
20900 /* Peek at the next token. */
20903 /* Check for a bitfield declaration. */
20908 {
20909 tree identifier;
20910 tree width;
20912 /* Get the name of the bitfield. Note that we cannot just
20913 check TOKEN here because it may have been invalidated by
20914 the call to cp_lexer_peek_nth_token above. */
20917 else
20920 /* Consume the `:' token. */
20922 /* Get the width of the bitfield. */
20923 width
20926 /* Look for attributes that apply to the bitfield. */
20928 /* Remember which attributes are prefix attributes and
20929 which are not. */
20931 /* Combine the attributes. */
20934 /* Create the bitfield declaration. */
20937 identifier,
20938 sfk_none)
20941 width,
20942 attributes);
20943 }
20944 else
20945 {
20947 tree initializer;
20948 tree asm_specification;
20951 /* Parse the declarator. */
20952 declarator
20957 friend_p);
20959 /* If something went wrong parsing the declarator, make sure
20960 that we at least consume some tokens. */
20962 {
20963 /* Skip to the end of the statement. */
20965 /* If the next token is not a semicolon, that is
20966 probably because we just skipped over the body of
20967 a function. So, we consume a semicolon if
20968 present, but do not issue an error message if it
20969 is not present. */
20971 CPP_SEMICOLON))
20974 }
20977 cp_parser_check_for_definition_in_return_type
20981 /* Look for an asm-specification. */
20983 /* Look for attributes that apply to the declaration. */
20985 /* Remember which attributes are prefix attributes and
20986 which are not. */
20988 /* Combine the attributes. */
20991 /* If it's an `=', then we have a constant-initializer or a
20992 pure-specifier. It is not correct to parse the
20993 initializer before registering the member declaration
20994 since the member declaration should be in scope while
20995 its initializer is processed. However, the rest of the
20996 front end does not yet provide an interface that allows
20997 us to handle this correctly. */
20999 {
21000 /* In [class.mem]:
21002 A pure-specifier shall be used only in the declaration of
21003 a virtual function.
21005 A member-declarator can contain a constant-initializer
21006 only if it declares a static member of integral or
21007 enumeration type.
21009 Therefore, if the DECLARATOR is for a function, we look
21010 for a pure-specifier; otherwise, we look for a
21011 constant-initializer. When we call `grokfield', it will
21012 perform more stringent semantics checks. */
21024 {
21026 /* Don't require a constant rvalue in C++11, since we
21027 might want a reference constant. We'll enforce
21028 constancy later. */
21030 /* Parse the initializer. */
21033 }
21034 else
21035 /* Parse the initializer. */
21037 }
21040 {
21044 else
21046 }
21047 /* Otherwise, there is no initializer. */
21048 else
21051 /* See if we are probably looking at a function
21052 definition. We are certainly not looking at a
21053 member-declarator. Calling `grokfield' has
21054 side-effects, so we must not do it unless we are sure
21055 that we are looking at a member-declarator. */
21058 {
21059 /* The grammar does not allow a pure-specifier to be
21060 used when a member function is defined. (It is
21061 possible that this fact is an oversight in the
21062 standard, since a pure function may be defined
21063 outside of the class-specifier. */
21069 declarator,
21070 attributes);
21073 /* If the member was not a friend, declare it here. */
21076 /* Peek at the next token. */
21078 /* If the next token is a semicolon, consume it. */
21082 }
21083 else
21086 /* Create the declaration. */
21091 {
21094 else
21096 }
21097 }
21101 /* Reset PREFIX_ATTRIBUTES. */
21107 /* If there is any qualification still in effect, clear it
21108 now; we will be starting fresh with the next declarator. */
21112 /* If it's a `,', then there are more declarators. */
21114 {
21117 {
21121 }
21122 }
21123 /* If the next token isn't a `;', then we have a parse error. */
21125 CPP_SEMICOLON))
21126 {
21127 /* The next token might be a ways away from where the
21128 actual semicolon is missing. Find the previous token
21129 and use that for our error position. */
21134 /* Assume that the user meant to provide a semicolon. If
21135 we were to cp_parser_skip_to_end_of_statement, we might
21136 skip to a semicolon inside a member function definition
21137 and issue nonsensical error messages. */
21139 }
21142 {
21143 /* Add DECL to the list of members. */
21145 /* Explicitly include, eg, NSDMIs, for better error
21146 recovery (c++/58650). */
21155 /* Add DECL to the queue of NSDMI to be parsed later. */
21157 }
21161 }
21162 }
21165 out:
21167 }
21169 /* Parse a pure-specifier.
21171 pure-specifier:
21172 = 0
21174 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21175 Otherwise, ERROR_MARK_NODE is returned. */
21177 static tree
21179 {
21182 /* Look for the `=' token. */
21185 /* Look for the `0' token. */
21194 /* Accept = default or = delete in c++0x mode. */
21197 {
21200 }
21202 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21204 {
21209 }
21211 {
21214 }
21217 }
21219 /* Parse a constant-initializer.
21221 constant-initializer:
21222 = constant-expression
21224 Returns a representation of the constant-expression. */
21226 static tree
21228 {
21229 /* Look for the `=' token. */
21233 /* It is invalid to write:
21235 struct S { static const int i = { 7 }; };
21237 */
21239 {
21242 /* Consume the opening brace. */
21244 /* Skip the initializer. */
21246 /* Look for the trailing `}'. */
21250 }
21253 }
21255 /* Derived classes [gram.class.derived] */
21257 /* Parse a base-clause.
21259 base-clause:
21260 : base-specifier-list
21262 base-specifier-list:
21263 base-specifier ... [opt]
21264 base-specifier-list , base-specifier ... [opt]
21266 Returns a TREE_LIST representing the base-classes, in the order in
21267 which they were declared. The representation of each node is as
21268 described by cp_parser_base_specifier.
21270 In the case that no bases are specified, this function will return
21271 NULL_TREE, not ERROR_MARK_NODE. */
21273 static tree
21275 {
21278 /* Look for the `:' that begins the list. */
21281 /* Scan the base-specifier-list. */
21283 {
21285 tree base;
21288 /* Look for the base-specifier. */
21290 /* Look for the (optional) ellipsis. */
21292 {
21293 /* Consume the `...'. */
21297 }
21299 /* Add BASE to the front of the list. */
21301 {
21303 /* Make this a pack expansion type. */
21307 {
21310 }
21311 }
21312 /* Peek at the next token. */
21314 /* If it's not a comma, then the list is complete. */
21317 /* Consume the `,'. */
21319 }
21321 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21322 base class had a qualified name. However, the next name that
21323 appears is certainly not qualified. */
21329 }
21331 /* Parse a base-specifier.
21333 base-specifier:
21334 :: [opt] nested-name-specifier [opt] class-name
21335 virtual access-specifier [opt] :: [opt] nested-name-specifier
21336 [opt] class-name
21337 access-specifier virtual [opt] :: [opt] nested-name-specifier
21338 [opt] class-name
21340 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21341 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21342 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21343 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21345 static tree
21347 {
21355 tree type;
21357 /* Process the optional `virtual' and `access-specifier'. */
21359 {
21360 /* Peek at the next token. */
21362 /* Process `virtual'. */
21364 {
21366 /* If `virtual' appears more than once, issue an error. */
21368 {
21372 }
21376 /* Consume the `virtual' token. */
21384 /* If more than one access specifier appears, issue an
21385 error. */
21388 {
21392 }
21396 /* Consume the access-specifier. */
21404 }
21405 }
21406 /* It is not uncommon to see programs mechanically, erroneously, use
21407 the 'typename' keyword to denote (dependent) qualified types
21408 as base classes. */
21410 {
21415 else
21417 "keyword %<typename%> not allowed in this context "
21420 }
21422 /* Look for the optional `::' operator. */
21424 /* Look for the nested-name-specifier. The simplest way to
21425 implement:
21427 [temp.res]
21429 The keyword `typename' is not permitted in a base-specifier or
21430 mem-initializer; in these contexts a qualified name that
21431 depends on a template-parameter is implicitly assumed to be a
21432 type name.
21434 is to pretend that we have seen the `typename' keyword at this
21435 point. */
21439 typename_type,
21441 /* If the base class is given by a qualified name, assume that names
21442 we see are type names or templates, as appropriate. */
21448 /* DR 950 allows decltype as a base-specifier. */
21450 else
21451 {
21452 /* Otherwise, look for the class-name. */
21454 class_scope_p,
21455 template_p,
21456 typename_type,
21461 }
21467 }
21469 /* Exception handling [gram.exception] */
21471 /* Parse an (optional) noexcept-specification.
21473 noexcept-specification:
21474 noexcept ( constant-expression ) [opt]
21476 If no noexcept-specification is present, returns NULL_TREE.
21477 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21478 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21479 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21480 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21481 in which case a boolean condition is returned instead. */
21483 static tree
21488 {
21492 /* Peek at the next token. */
21495 /* Is it a noexcept-specification? */
21497 {
21498 tree expr;
21502 {
21506 {
21507 /* Types may not be defined in an exception-specification. */
21509 parser->type_definition_forbidden_message
21514 /* Restore the saved message. */
21516 }
21517 else
21518 {
21521 }
21524 }
21525 else
21526 {
21530 }
21532 /* We cannot build a noexcept-spec right away because this will check
21533 that expr is a constexpr. */
21536 else
21538 }
21539 else
21541 }
21543 /* Parse an (optional) exception-specification.
21545 exception-specification:
21546 throw ( type-id-list [opt] )
21548 Returns a TREE_LIST representing the exception-specification. The
21549 TREE_VALUE of each node is a type. */
21551 static tree
21553 {
21555 tree type_id_list;
21558 /* Peek at the next token. */
21561 /* Is it a noexcept-specification? */
21567 /* If it's not `throw', then there's no exception-specification. */
21571 #if 0
21572 /* Enable this once a lot of code has transitioned to noexcept? */
21576 #endif
21578 /* Consume the `throw'. */
21581 /* Look for the `('. */
21584 /* Peek at the next token. */
21586 /* If it's not a `)', then there is a type-id-list. */
21588 {
21589 /* Types may not be defined in an exception-specification. */
21591 parser->type_definition_forbidden_message
21593 /* Parse the type-id-list. */
21595 /* Restore the saved message. */
21597 }
21598 else
21601 /* Look for the `)'. */
21605 }
21607 /* Parse an (optional) type-id-list.
21609 type-id-list:
21610 type-id ... [opt]
21611 type-id-list , type-id ... [opt]
21613 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21614 in the order that the types were presented. */
21616 static tree
21618 {
21622 {
21624 tree type;
21626 /* Get the next type-id. */
21628 /* Parse the optional ellipsis. */
21630 {
21631 /* Consume the `...'. */
21634 /* Turn the type into a pack expansion expression. */
21636 }
21637 /* Add it to the list. */
21639 /* Peek at the next token. */
21641 /* If it is not a `,', we are done. */
21644 /* Consume the `,'. */
21646 }
21649 }
21651 /* Parse a try-block.
21653 try-block:
21654 try compound-statement handler-seq */
21656 static tree
21658 {
21659 tree try_block;
21673 }
21675 /* Parse a function-try-block.
21677 function-try-block:
21678 try ctor-initializer [opt] function-body handler-seq */
21680 static bool
21682 {
21683 tree compound_stmt;
21684 tree try_block;
21687 /* Look for the `try' keyword. */
21690 /* Let the rest of the front end know where we are. */
21692 /* Parse the function-body. */
21693 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21695 /* We're done with the `try' part. */
21697 /* Parse the handlers. */
21699 /* We're done with the handlers. */
21703 }
21705 /* Parse a handler-seq.
21707 handler-seq:
21708 handler handler-seq [opt] */
21710 static void
21712 {
21714 {
21717 /* Parse the handler. */
21719 /* Peek at the next token. */
21721 /* If it's not `catch' then there are no more handlers. */
21724 }
21725 }
21727 /* Parse a handler.
21729 handler:
21730 catch ( exception-declaration ) compound-statement */
21732 static void
21734 {
21735 tree handler;
21736 tree declaration;
21746 }
21748 /* Parse an exception-declaration.
21750 exception-declaration:
21751 type-specifier-seq declarator
21752 type-specifier-seq abstract-declarator
21753 type-specifier-seq
21754 ...
21756 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21757 ellipsis variant is used. */
21759 static tree
21761 {
21762 cp_decl_specifier_seq type_specifiers;
21766 /* If it's an ellipsis, it's easy to handle. */
21768 {
21769 /* Consume the `...' token. */
21772 }
21774 /* Types may not be defined in exception-declarations. */
21776 parser->type_definition_forbidden_message
21779 /* Parse the type-specifier-seq. */
21783 /* If it's a `)', then there is no declarator. */
21786 else
21793 /* Restore the saved message. */
21800 }
21802 /* Parse a throw-expression.
21804 throw-expression:
21805 throw assignment-expression [opt]
21807 Returns a THROW_EXPR representing the throw-expression. */
21809 static tree
21811 {
21812 tree expression;
21817 /* Figure out whether or not there is an assignment-expression
21818 following the "throw" keyword. */
21826 else
21830 }
21832 /* GNU Extensions */
21834 /* Parse an (optional) asm-specification.
21836 asm-specification:
21837 asm ( string-literal )
21839 If the asm-specification is present, returns a STRING_CST
21840 corresponding to the string-literal. Otherwise, returns
21841 NULL_TREE. */
21843 static tree
21845 {
21847 tree asm_specification;
21849 /* Peek at the next token. */
21851 /* If the next token isn't the `asm' keyword, then there's no
21852 asm-specification. */
21856 /* Consume the `asm' token. */
21858 /* Look for the `('. */
21861 /* Look for the string-literal. */
21864 /* Look for the `)'. */
21868 }
21870 /* Parse an asm-operand-list.
21872 asm-operand-list:
21873 asm-operand
21874 asm-operand-list , asm-operand
21876 asm-operand:
21877 string-literal ( expression )
21878 [ string-literal ] string-literal ( expression )
21880 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21881 each node is the expression. The TREE_PURPOSE is itself a
21882 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21883 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21884 is a STRING_CST for the string literal before the parenthesis. Returns
21885 ERROR_MARK_NODE if any of the operands are invalid. */
21887 static tree
21889 {
21894 {
21895 tree string_literal;
21896 tree expression;
21897 tree name;
21900 {
21901 /* Consume the `[' token. */
21903 /* Read the operand name. */
21908 /* Look for the closing `]'. */
21910 }
21911 else
21913 /* Look for the string-literal. */
21916 /* Look for the `('. */
21918 /* Parse the expression. */
21920 /* Look for the `)'. */
21928 /* Add this operand to the list. */
21930 expression,
21931 asm_operands);
21932 /* If the next token is not a `,', there are no more
21933 operands. */
21936 /* Consume the `,'. */
21938 }
21941 }
21943 /* Parse an asm-clobber-list.
21945 asm-clobber-list:
21946 string-literal
21947 asm-clobber-list , string-literal
21949 Returns a TREE_LIST, indicating the clobbers in the order that they
21950 appeared. The TREE_VALUE of each node is a STRING_CST. */
21952 static tree
21954 {
21958 {
21959 tree string_literal;
21961 /* Look for the string literal. */
21963 /* Add it to the list. */
21965 /* If the next token is not a `,', then the list is
21966 complete. */
21969 /* Consume the `,' token. */
21971 }
21974 }
21976 /* Parse an asm-label-list.
21978 asm-label-list:
21979 identifier
21980 asm-label-list , identifier
21982 Returns a TREE_LIST, indicating the labels in the order that they
21983 appeared. The TREE_VALUE of each node is a label. */
21985 static tree
21987 {
21991 {
21994 /* Look for the identifier. */
21997 {
22000 {
22006 }
22007 }
22008 /* If the next token is not a `,', then the list is
22009 complete. */
22012 /* Consume the `,' token. */
22014 }
22017 }
22019 /* Return TRUE iff the next tokens in the stream are possibly the
22020 beginning of a GNU extension attribute. */
22022 static bool
22024 {
22026 }
22028 /* Return TRUE iff the next tokens in the stream are possibly the
22029 beginning of a standard C++-11 attribute specifier. */
22031 static bool
22033 {
22035 }
22037 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22038 beginning of a standard C++-11 attribute specifier. */
22040 static bool
22042 {
22050 }
22052 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22053 beginning of a GNU extension attribute. */
22055 static bool
22057 {
22061 }
22063 /* Return true iff the next tokens can be the beginning of either a
22064 GNU attribute list, or a standard C++11 attribute sequence. */
22066 static bool
22068 {
22071 }
22073 /* Return true iff the next Nth tokens can be the beginning of either
22074 a GNU attribute list, or a standard C++11 attribute sequence. */
22076 static bool
22078 {
22081 }
22083 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22084 of GNU attributes, or return NULL. */
22086 static tree
22088 {
22092 }
22094 #define CILK_SIMD_FN_CLAUSE_MASK \
22095 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22096 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22097 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22098 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22099 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22101 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22102 vector [(<clauses>)] */
22104 static void
22106 {
22110 {
22115 }
22118 {
22121 paren_scope++;
22122 }
22124 {
22127 paren_scope++;
22129 paren_scope--;
22130 /* Do not push the last ')' */
22133 }
22142 }
22144 /* Parse an (optional) series of attributes.
22146 attributes:
22147 attributes attribute
22149 attribute:
22150 __attribute__ (( attribute-list [opt] ))
22152 The return value is as for cp_parser_gnu_attribute_list. */
22154 static tree
22156 {
22160 {
22162 tree attribute_list;
22165 /* Peek at the next token. */
22167 /* If it's not `__attribute__', then we're done. */
22171 /* Consume the `__attribute__' keyword. */
22173 /* Look for the two `(' tokens. */
22177 /* Peek at the next token. */
22180 /* Parse the attribute-list. */
22182 else
22183 /* If the next token is a `)', then there is no attribute
22184 list. */
22187 /* Look for the two `)' tokens. */
22195 /* Add these new attributes to the list. */
22197 }
22200 }
22202 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22203 "__vector" or "__vector__." */
22207 {
22211 }
22213 /* Parse a GNU attribute-list.
22215 attribute-list:
22216 attribute
22217 attribute-list , attribute
22219 attribute:
22220 identifier
22221 identifier ( identifier )
22222 identifier ( identifier , expression-list )
22223 identifier ( expression-list )
22225 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22226 to an attribute. The TREE_PURPOSE of each node is the identifier
22227 indicating which attribute is in use. The TREE_VALUE represents
22228 the arguments, if any. */
22230 static tree
22232 {
22238 {
22240 tree identifier;
22241 tree attribute;
22243 /* Look for the identifier. We also allow keywords here; for
22244 example `__attribute__ ((const))' is legal. */
22248 {
22251 /* Consume the token, but save it since we need it for the
22252 SIMD enabled function parsing. */
22255 /* Save away the identifier that indicates which attribute
22256 this is. */
22258 /* For keywords, use the canonical spelling, not the
22259 parsed identifier. */
22265 /* Peek at the next token. */
22267 /* If it's an `(', then parse the attribute arguments. */
22269 {
22274 {
22277 }
22278 else
22279 vec = cp_parser_parenthesized_expression_list
22285 else
22286 {
22289 }
22290 /* Save the arguments away. */
22292 }
22294 {
22297 }
22300 {
22301 /* Add this attribute to the list. */
22304 }
22307 }
22308 /* Now, look for more attributes. If the next token isn't a
22309 `,', we're done. */
22313 /* Consume the comma and keep going. */
22315 }
22318 /* We built up the list in reverse order. */
22320 }
22322 /* Parse a standard C++11 attribute.
22324 The returned representation is a TREE_LIST which TREE_PURPOSE is
22325 the scoped name of the attribute, and the TREE_VALUE is its
22326 arguments list.
22328 Note that the scoped name of the attribute is itself a TREE_LIST
22329 which TREE_PURPOSE is the namespace of the attribute, and
22330 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22331 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22332 and which TREE_PURPOSE is directly the attribute name.
22334 Clients of the attribute code should use get_attribute_namespace
22335 and get_attribute_name to get the actual namespace and name of
22336 attributes, regardless of their being GNU or C++11 attributes.
22338 attribute:
22339 attribute-token attribute-argument-clause [opt]
22341 attribute-token:
22342 identifier
22343 attribute-scoped-token
22345 attribute-scoped-token:
22346 attribute-namespace :: identifier
22348 attribute-namespace:
22349 identifier
22351 attribute-argument-clause:
22352 ( balanced-token-seq )
22354 balanced-token-seq:
22355 balanced-token [opt]
22356 balanced-token-seq balanced-token
22358 balanced-token:
22359 ( balanced-token-seq )
22360 [ balanced-token-seq ]
22361 { balanced-token-seq }. */
22363 static tree
22365 {
22369 /* First, parse name of the the attribute, a.k.a
22370 attribute-token. */
22387 {
22388 /* We are seeing a scoped attribute token. */
22398 else
22399 {
22403 }
22405 NULL_TREE);
22407 }
22408 else
22409 {
22411 NULL_TREE);
22412 /* C++11 noreturn attribute is equivalent to GNU's. */
22415 /* C++14 deprecated attribute is equivalent to GNU's. */
22417 {
22420 "%<deprecated%> is a C++14 feature;"
22423 }
22424 }
22426 /* Now parse the optional argument clause of the attribute. */
22431 {
22437 /* A GNU attribute that takes an identifier in parameter. */
22440 vec = cp_parser_parenthesized_expression_list
22446 else
22447 {
22450 }
22454 else
22456 }
22459 }
22461 /* Parse a list of standard C++-11 attributes.
22463 attribute-list:
22464 attribute [opt]
22465 attribute-list , attribute[opt]
22466 attribute ...
22467 attribute-list , attribute ...
22468 */
22470 static tree
22472 {
22477 {
22482 {
22485 }
22490 }
22493 }
22495 /* Parse a standard C++-11 attribute specifier.
22497 attribute-specifier:
22498 [ [ attribute-list ] ]
22499 alignment-specifier
22501 alignment-specifier:
22502 alignas ( type-id ... [opt] )
22503 alignas ( alignment-expression ... [opt] ). */
22505 static tree
22507 {
22513 {
22522 else
22523 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22524 when we are sure that we have actually parsed them. */
22526 }
22527 else
22528 {
22529 tree alignas_expr;
22531 /* Look for an alignment-specifier. */
22543 {
22546 }
22552 {
22556 alignas_expr =
22563 }
22566 {
22569 }
22573 /* Build the C++-11 representation of an 'aligned'
22574 attribute. */
22575 attributes =
22579 }
22582 }
22584 /* Parse a standard C++-11 attribute-specifier-seq.
22586 attribute-specifier-seq:
22587 attribute-specifier-seq [opt] attribute-specifier
22588 */
22590 static tree
22592 {
22596 {
22605 }
22609 }
22611 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22612 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22613 current value of the PEDANTIC flag, regardless of whether or not
22614 the `__extension__' keyword is present. The caller is responsible
22615 for restoring the value of the PEDANTIC flag. */
22617 static bool
22619 {
22620 /* Save the old value of the PEDANTIC flag. */
22624 {
22625 /* Consume the `__extension__' token. */
22627 /* We're not being pedantic while the `__extension__' keyword is
22628 in effect. */
22632 }
22635 }
22637 /* Parse a label declaration.
22639 label-declaration:
22640 __label__ label-declarator-seq ;
22642 label-declarator-seq:
22643 identifier , label-declarator-seq
22644 identifier */
22646 static void
22648 {
22649 /* Look for the `__label__' keyword. */
22653 {
22654 tree identifier;
22656 /* Look for an identifier. */
22658 /* If we failed, stop. */
22661 /* Declare it as a label. */
22663 /* If the next token is a `;', stop. */
22666 /* Look for the `,' separating the label declarations. */
22668 }
22670 /* Look for the final `;'. */
22672 }
22674 /* Support Functions */
22676 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22677 NAME should have one of the representations used for an
22678 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22679 is returned. If PARSER->SCOPE is a dependent type, then a
22680 SCOPE_REF is returned.
22682 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22683 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22684 was formed. Abstractly, such entities should not be passed to this
22685 function, because they do not need to be looked up, but it is
22686 simpler to check for this special case here, rather than at the
22687 call-sites.
22689 In cases not explicitly covered above, this function returns a
22690 DECL, OVERLOAD, or baselink representing the result of the lookup.
22691 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22692 is returned.
22694 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22695 (e.g., "struct") that was used. In that case bindings that do not
22696 refer to types are ignored.
22698 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22699 ignored.
22701 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22702 are ignored.
22704 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22705 types.
22707 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22708 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22709 NULL_TREE otherwise. */
22711 static tree
22718 location_t name_location)
22719 {
22720 tree decl;
22723 /* Assume that the lookup will be unambiguous. */
22727 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22728 no longer valid. Note that if we are parsing tentatively, and
22729 the parse fails, OBJECT_TYPE will be automatically restored. */
22735 /* A template-id has already been resolved; there is no lookup to
22736 do. */
22740 {
22744 }
22746 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22747 it should already have been checked to make sure that the name
22748 used matches the type being destroyed. */
22750 {
22751 tree type;
22753 /* Figure out to which type this destructor applies. */
22758 else
22760 /* If that's not a class type, there is no destructor. */
22767 /* If it was a class type, return the destructor. */
22769 }
22771 /* By this point, the NAME should be an ordinary identifier. If
22772 the id-expression was a qualified name, the qualifying scope is
22773 stored in PARSER->SCOPE at this point. */
22776 /* Perform the lookup. */
22778 {
22784 /* If the SCOPE is dependent, the lookup must be deferred until
22785 the template is instantiated -- unless we are explicitly
22786 looking up names in uninstantiated templates. Even then, we
22787 cannot look up the name if the scope is not a class type; it
22788 might, for example, be a template type parameter. */
22793 /* Defer lookup. */
22795 else
22796 {
22799 /* If PARSER->SCOPE is a dependent type, then it must be a
22800 class type, and we must not be checking dependencies;
22801 otherwise, we would have processed this lookup above. So
22802 that PARSER->SCOPE is not considered a dependent base by
22803 lookup_member, we must enter the scope here. */
22807 /* If the PARSER->SCOPE is a template specialization, it
22808 may be instantiated during name lookup. In that case,
22809 errors may be issued. Even if we rollback the current
22810 tentative parse, those errors are valid. */
22815 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22816 lookup result and the nested-name-specifier nominates a class C:
22817 * if the name specified after the nested-name-specifier, when
22818 looked up in C, is the injected-class-name of C (Clause 9), or
22819 * if the name specified after the nested-name-specifier is the
22820 same as the identifier or the simple-template-id's template-
22821 name in the last component of the nested-name-specifier,
22822 the name is instead considered to name the constructor of
22823 class C. [ Note: for example, the constructor is not an
22824 acceptable lookup result in an elaborated-type-specifier so
22825 the constructor would not be used in place of the
22826 injected-class-name. --end note ] Such a constructor name
22827 shall be used only in the declarator-id of a declaration that
22828 names a constructor or in a using-declaration. */
22836 /* If we have a single function from a using decl, pull it out. */
22843 }
22845 /* If the scope is a dependent type and either we deferred lookup or
22846 we did lookup but didn't find the name, rememeber the name. */
22849 {
22851 {
22852 tree type;
22854 /* The resolution to Core Issue 180 says that `struct
22855 A::B' should be considered a type-name, even if `A'
22856 is dependent. */
22861 }
22865 CPP_CLOSE_PAREN)))
22869 else
22872 is_template);
22873 }
22876 }
22878 {
22879 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22880 OBJECT_TYPE is not a class. */
22882 /* If the OBJECT_TYPE is a template specialization, it may
22883 be instantiated during name lookup. In that case, errors
22884 may be issued. Even if we rollback the current tentative
22885 parse, those errors are valid. */
22887 name,
22890 tf_warning_or_error);
22891 else
22895 /* Look it up in the enclosing context. */
22901 }
22902 else
22903 {
22909 }
22911 /* If the lookup failed, let our caller know. */
22915 /* Pull out the template from an injected-class-name (or multiple). */
22919 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22921 {
22924 /* The error message we have to print is too complicated for
22925 cp_parser_error, so we incorporate its actions directly. */
22927 {
22929 name);
22931 }
22933 }
22941 /* If we have resolved the name of a member declaration, check to
22942 see if the declaration is accessible. When the name resolves to
22943 set of overloaded functions, accessibility is checked when
22944 overload resolution is done.
22946 During an explicit instantiation, access is not checked at all,
22947 as per [temp.explicit]. */
22954 }
22956 /* Like cp_parser_lookup_name, but for use in the typical case where
22957 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22958 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22960 static tree
22962 {
22964 none_type,
22969 location);
22970 }
22972 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22973 the current context, return the TYPE_DECL. If TAG_NAME_P is
22974 true, the DECL indicates the class being defined in a class-head,
22975 or declared in an elaborated-type-specifier.
22977 Otherwise, return DECL. */
22979 static tree
22981 {
22982 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22983 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22985 struct A {
22986 template <typename T> struct B;
22987 };
22989 template <typename T> struct A::B {};
22991 Similarly, in an elaborated-type-specifier:
22993 namespace N { struct X{}; }
22995 struct A {
22996 template <typename T> friend struct N::X;
22997 };
22999 However, if the DECL refers to a class type, and we are in
23000 the scope of the class, then the name lookup automatically
23001 finds the TYPE_DECL created by build_self_reference rather
23002 than a TEMPLATE_DECL. For example, in:
23004 template <class T> struct S {
23005 S s;
23006 };
23008 there is no need to handle such case. */
23014 }
23016 /* If too many, or too few, template-parameter lists apply to the
23017 declarator, issue an error message. Returns TRUE if all went well,
23018 and FALSE otherwise. */
23020 static bool
23023 location_t declarator_location)
23024 {
23026 {
23028 {
23036 /* If the DECLARATOR has the form `X<y>' then it uses one
23037 additional level of template parameters. */
23040 return cp_parser_check_template_parameters
23042 }
23057 }
23059 }
23061 /* NUM_TEMPLATES were used in the current declaration. If that is
23062 invalid, return FALSE and issue an error messages. Otherwise,
23063 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23064 declarator and we can print more accurate diagnostics. */
23066 static bool
23069 location_t location,
23071 {
23072 /* If there are the same number of template classes and parameter
23073 lists, that's OK. */
23076 /* If there are more, but only one more, then we are referring to a
23077 member template. That's OK too. */
23080 /* If there are more template classes than parameter lists, we have
23081 something like:
23083 template <class T> void S<T>::R<T>::f (); */
23085 {
23095 else
23098 }
23099 /* Otherwise, there are too many template parameter lists. We have
23100 something like:
23102 template <class T> template <class U> void S::f(); */
23105 }
23107 /* Parse an optional `::' token indicating that the following name is
23108 from the global namespace. If so, PARSER->SCOPE is set to the
23109 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23110 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23111 Returns the new value of PARSER->SCOPE, if the `::' token is
23112 present, and NULL_TREE otherwise. */
23114 static tree
23116 {
23119 /* Peek at the next token. */
23121 /* If we're looking at a `::' token then we're starting from the
23122 global namespace, not our current location. */
23124 {
23125 /* Consume the `::' token. */
23127 /* Set the SCOPE so that we know where to start the lookup. */
23133 }
23135 {
23139 }
23142 }
23144 /* Returns TRUE if the upcoming token sequence is the start of a
23145 constructor declarator. If FRIEND_P is true, the declarator is
23146 preceded by the `friend' specifier. */
23148 static bool
23150 {
23153 tree nested_name_specifier;
23156 /* The common case is that this is not a constructor declarator, so
23157 try to avoid doing lots of work if at all possible. It's not
23158 valid declare a constructor at function scope. */
23161 /* And only certain tokens can begin a constructor declarator. */
23169 /* Parse tentatively; we are going to roll back all of the tokens
23170 consumed here. */
23172 /* Assume that we are looking at a constructor declarator. */
23175 /* Look for the optional `::' operator. */
23178 /* Look for the nested-name-specifier. */
23179 nested_name_specifier
23190 /* Outside of a class-specifier, there must be a
23191 nested-name-specifier. */
23197 /* If we have a class scope, this is easy; DR 147 says that S::S always
23198 names the constructor, and no other qualified name could. */
23201 {
23211 }
23212 /* If we still think that this might be a constructor-declarator,
23213 look for a class-name. */
23215 {
23216 /* If we have:
23218 template <typename T> struct S {
23219 S();
23220 };
23222 we must recognize that the nested `S' names a class. */
23223 tree type_decl;
23227 none_type,
23231 /* If there was no class-name, then this is not a constructor.
23232 Otherwise, if we are in a class-specifier and we aren't
23233 handling a friend declaration, check that its type matches
23234 current_class_type (c++/38313). Note: error_mark_node
23235 is left alone for error recovery purposes. */
23237 && (outside_class_specifier_p
23242 /* If we're still considering a constructor, we have to see a `(',
23243 to begin the parameter-declaration-clause, followed by either a
23244 `)', an `...', or a decl-specifier. We need to check for a
23245 type-specifier to avoid being fooled into thinking that:
23247 S (f) (int);
23249 is a constructor. (It is actually a function named `f' that
23250 takes one parameter (of type `int') and returns a value of type
23251 `S'. */
23259 /* A parameter declaration begins with a decl-specifier,
23260 which is either the "attribute" keyword, a storage class
23261 specifier, or (usually) a type-specifier. */
23263 {
23264 tree type;
23268 /* Names appearing in the type-specifier should be looked up
23269 in the scope of the class. */
23272 else
23273 {
23276 {
23280 {
23283 }
23284 }
23286 }
23288 /* Inside the constructor parameter list, surrounding
23289 template-parameter-lists do not apply. */
23290 saved_num_template_parameter_lists
23294 /* Look for the type-specifier. */
23296 CP_PARSER_FLAGS_NONE,
23302 parser->num_template_parameter_lists
23305 /* Leave the scope of the class. */
23310 }
23311 }
23313 /* We did not really want to consume any tokens. */
23317 }
23319 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23320 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23321 they must be performed once we are in the scope of the function.
23323 Returns the function defined. */
23325 static tree
23326 cp_parser_function_definition_from_specifiers_and_declarator
23329 tree attributes,
23331 {
23332 tree fn;
23335 /* Begin the function-definition. */
23338 /* The things we're about to see are not directly qualified by any
23339 template headers we've seen thus far. */
23342 /* If there were names looked up in the decl-specifier-seq that we
23343 did not check, check them now. We must wait until we are in the
23344 scope of the function to perform the checks, since the function
23345 might be a friend. */
23349 {
23352 }
23355 {
23356 /* Skip the entire function. */
23359 }
23361 {
23362 /* Seen already, skip it. An error message has already been output. */
23366 /* If this is a function from a class, pop the nested class. */
23369 }
23370 else
23371 {
23372 timevar_id_t tv;
23375 else
23381 }
23384 }
23386 /* Parse the part of a function-definition that follows the
23387 declarator. INLINE_P is TRUE iff this function is an inline
23388 function defined within a class-specifier.
23390 Returns the function defined. */
23392 static tree
23395 {
23396 tree fn;
23402 bool fully_implicit_function_template_p
23405 tree implicit_template_parms
23408 cp_binding_level* implicit_template_scope
23414 /* If the next token is `return', then the code may be trying to
23415 make use of the "named return value" extension that G++ used to
23416 support. */
23419 {
23420 /* Consume the `return' keyword. */
23422 /* Look for the identifier that indicates what value is to be
23423 returned. */
23425 /* Issue an error message. */
23428 /* Skip tokens until we reach the start of the function body. */
23430 {
23437 }
23438 }
23439 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23440 anything declared inside `f'. */
23441 saved_in_unbraced_linkage_specification_p
23444 /* Inside the function, surrounding template-parameter-lists do not
23445 apply. */
23446 saved_num_template_parameter_lists
23452 /* If the next token is `try', `__transaction_atomic', or
23453 `__transaction_relaxed`, then we are looking at either function-try-block
23454 or function-transaction-block. Note that all of these include the
23455 function-body. */
23458 RID_TRANSACTION_ATOMIC);
23460 RID_TRANSACTION_RELAXED))
23462 RID_TRANSACTION_RELAXED);
23465 else
23466 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23471 /* Finish the function. */
23474 /* Generate code for it, if necessary. */
23476 /* Restore the saved values. */
23477 parser->in_unbraced_linkage_specification_p
23479 parser->num_template_parameter_lists
23483 parser->fully_implicit_function_template_p
23485 parser->implicit_template_parms
23487 parser->implicit_template_scope
23494 }
23496 /* Parse a template-declaration, assuming that the `export' (and
23497 `extern') keywords, if present, has already been scanned. MEMBER_P
23498 is as for cp_parser_template_declaration. */
23500 static void
23502 {
23505 tree parameter_list;
23510 /* Look for the `template' keyword. */
23515 /* And the `<'. */
23519 {
23520 /* 14.5.2.2 [temp.mem]
23522 A local class shall not have member templates. */
23527 }
23528 /* [temp]
23530 A template ... shall not have C linkage. */
23532 {
23534 /* Give it C++ linkage to avoid confusing other parts of the
23535 front end. */
23538 }
23539 else
23542 /* We cannot perform access checks on the template parameter
23543 declarations until we know what is being declared, just as we
23544 cannot check the decl-specifier list. */
23547 /* If the next token is `>', then we have an invalid
23548 specialization. Rather than complain about an invalid template
23549 parameter, issue an error message here. */
23551 {
23555 }
23556 else
23557 {
23558 /* Parse the template parameters. */
23560 }
23562 /* Get the deferred access checks from the parameter list. These
23563 will be checked once we know what is being declared, as for a
23564 member template the checks must be performed in the scope of the
23565 class containing the member. */
23568 /* Look for the `>'. */
23570 /* We just processed one more parameter list. */
23572 /* If the next token is `template', there are more template
23573 parameters. */
23575 RID_TEMPLATE))
23580 else
23581 {
23582 /* There are no access checks when parsing a template, as we do not
23583 know if a specialization will be a friend. */
23587 checks,
23588 member_p,
23593 /* If this is a member template declaration, let the front
23594 end know. */
23596 {
23601 }
23606 }
23607 /* We are done with the current parameter list. */
23612 /* Finish up. */
23615 /* Check the template arguments for a literal operator template. */
23619 {
23623 else
23624 {
23627 {
23633 }
23635 {
23643 }
23644 else
23646 }
23648 {
23651 " Expected non-type template argument pack <char...>"
23653 decl);
23654 else
23657 decl);
23658 }
23659 }
23660 /* Register member declarations. */
23663 /* For the erroneous case of a template with C linkage, we pushed an
23664 implicit C++ linkage scope; exit that scope now. */
23667 /* If DECL is a function template, we must return to parse it later.
23668 (Even though there is no definition, there might be default
23669 arguments that need handling.) */
23673 }
23675 /* Perform the deferred access checks from a template-parameter-list.
23676 CHECKS is a TREE_LIST of access checks, as returned by
23677 get_deferred_access_checks. */
23679 static void
23680 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23681 {
23685 }
23687 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23688 `function-definition' sequence that follows a template header.
23689 If MEMBER_P is true, this declaration appears in a class scope.
23691 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23692 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23694 static tree
23700 {
23703 cp_decl_specifier_seq decl_specifiers;
23707 /* This function is only used when processing a template
23708 declaration. */
23712 /* Defer access checks until we know what is being declared. */
23715 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23716 alternative. */
23719 CP_PARSER_FLAGS_OPTIONAL,
23725 /* There are no template typedefs. */
23727 {
23731 }
23733 /* Gather up the access checks that occurred the
23734 decl-specifier-seq. */
23737 /* Check for the declaration of a template class. */
23739 {
23741 {
23744 /* In this case:
23746 struct C {
23747 friend template <typename T> struct A<T>::B;
23748 };
23750 A<T>::B will be represented by a TYPENAME_TYPE, and
23751 therefore not recognized by shadow_tag. */
23753 && !decl
23760 else
23763 /* Perform access checks for template parameters. */
23765 }
23766 }
23768 /* Complain about missing 'typename' or other invalid type names. */
23771 {
23772 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23773 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23774 the rest of this declaration. */
23777 }
23779 /* If it's not a template class, try for a template function. If
23780 the next token is a `;', then this declaration does not declare
23781 anything. But, if there were errors in the decl-specifiers, then
23782 the error might well have come from an attempted class-specifier.
23783 In that case, there's no need to warn about a missing declarator. */
23787 {
23790 checks,
23792 member_p,
23793 declares_class_or_enum,
23797 /* 7.1.1-1 [dcl.stc]
23799 A storage-class-specifier shall not be specified in an explicit
23800 specialization... */
23802 && explicit_specialization_p
23804 {
23808 }
23812 }
23814 /* Look for a trailing `;' after the declaration. */
23820 out:
23823 /* Clear any current qualification; whatever comes next is the start
23824 of something new. */
23830 }
23832 /* Parse a cast-expression that is not the operand of a unary "&". */
23834 static tree
23836 {
23839 }
23841 /* Parse a functional cast to TYPE. Returns an expression
23842 representing the cast. */
23844 static tree
23846 {
23848 tree expression_list;
23849 tree cast;
23856 {
23864 tf_warning_or_error);
23865 }
23874 else
23875 {
23878 }
23881 tf_warning_or_error);
23882 /* [expr.const]/1: In an integral constant expression "only type
23883 conversions to integral or enumeration type can be used". */
23889 NIC_CONSTRUCTOR))
23892 }
23894 /* Save the tokens that make up the body of a member function defined
23895 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23896 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23897 specifiers applied to the declaration. Returns the FUNCTION_DECL
23898 for the member function. */
23900 static tree
23904 tree attributes)
23905 {
23908 tree fn;
23910 /* Create the FUNCTION_DECL. */
23913 /* If something went badly wrong, bail out now. */
23915 {
23916 /* If there's a function-body, skip it. */
23921 }
23923 /* Remember it, if there default args to post process. */
23926 /* Save away the tokens that make up the body of the
23927 function. */
23929 /* Handle function try blocks. */
23932 /* We can have braced-init-list mem-initializers before the fn body. */
23934 {
23937 {
23938 /* cache_group will stop after an un-nested { } pair, too. */
23942 /* variadic mem-inits have ... after the ')'. */
23945 }
23946 }
23948 /* Handle function try blocks. */
23953 /* Save away the inline definition; we will process it when the
23954 class is complete. */
23958 /* We need to know that this was defined in the class, so that
23959 friend templates are handled correctly. */
23962 /* Add FN to the queue of functions to be parsed later. */
23966 }
23968 /* Save the tokens that make up the in-class initializer for a non-static
23969 data member. Returns a DEFAULT_ARG. */
23971 static tree
23973 {
23975 }
23977 /* Parse a template-argument-list, as well as the trailing ">" (but
23978 not the opening "<"). See cp_parser_template_argument_list for the
23979 return value. */
23981 static tree
23983 {
23984 tree arguments;
23985 tree saved_scope;
23986 tree saved_qualifying_scope;
23987 tree saved_object_scope;
23992 /* [temp.names]
23994 When parsing a template-id, the first non-nested `>' is taken as
23995 the end of the template-argument-list rather than a greater-than
23996 operator. */
23997 saved_greater_than_is_operator_p
24000 /* Parsing the argument list may modify SCOPE, so we save it
24001 here. */
24005 /* We need to evaluate the template arguments, even though this
24006 template-id may be nested within a "sizeof". */
24011 /* Parse the template-argument-list itself. */
24015 else
24017 /* Look for the `>' that ends the template-argument-list. If we find
24018 a '>>' instead, it's probably just a typo. */
24020 {
24022 {
24023 /* In C++0x, a `>>' in a template argument list or cast
24024 expression is considered to be two separate `>'
24025 tokens. So, change the current token to a `>', but don't
24026 consume it: it will be consumed later when the outer
24027 template argument list (or cast expression) is parsed.
24028 Note that this replacement of `>' for `>>' is necessary
24029 even if we are parsing tentatively: in the tentative
24030 case, after calling
24031 cp_parser_enclosed_template_argument_list we will always
24032 throw away all of the template arguments and the first
24033 closing `>', either because the template argument list
24034 was erroneous or because we are replacing those tokens
24035 with a CPP_TEMPLATE_ID token. The second `>' (which will
24036 not have been thrown away) is needed either to close an
24037 outer template argument list or to complete a new-style
24038 cast. */
24041 }
24043 {
24044 /* If we're in a nested template argument list, the '>>' has
24045 to be a typo for '> >'. We emit the error message, but we
24046 continue parsing and we push a '>' as next token, so that
24047 the argument list will be parsed correctly. Note that the
24048 global source location is still on the token before the
24049 '>>', so we need to say explicitly where we want it. */
24055 }
24056 else
24057 {
24058 /* If this is not a nested template argument list, the '>>'
24059 is a typo for '>'. Emit an error message and continue.
24060 Same deal about the token location, but here we can get it
24061 right by consuming the '>>' before issuing the diagnostic. */
24064 "spurious %<>>%>, use %<>%> to terminate "
24066 }
24067 }
24068 else
24070 /* The `>' token might be a greater-than operator again now. */
24071 parser->greater_than_is_operator_p
24073 /* Restore the SAVED_SCOPE. */
24081 }
24083 /* MEMBER_FUNCTION is a member function, or a friend. If default
24084 arguments, or the body of the function have not yet been parsed,
24085 parse them now. */
24087 static void
24089 {
24091 /* If this member is a template, get the underlying
24092 FUNCTION_DECL. */
24096 /* There should not be any class definitions in progress at this
24097 point; the bodies of members are only parsed outside of all class
24098 definitions. */
24100 /* While we're parsing the member functions we might encounter more
24101 classes. We want to handle them right away, but we don't want
24102 them getting mixed up with functions that are currently in the
24103 queue. */
24106 /* Make sure that any template parameters are in scope. */
24109 /* If the body of the function has not yet been parsed, parse it
24110 now. */
24112 {
24113 tree function_scope;
24116 /* The function is no longer pending; we are processing it. */
24121 /* If this is a local class, enter the scope of the containing
24122 function. */
24127 /* Push the body of the function onto the lexer stack. */
24130 /* Let the front end know that we going to be defining this
24131 function. */
24135 /* Don't do access checking if it is a templated function. */
24139 /* #pragma omp declare reduction needs special parsing. */
24141 {
24146 }
24147 else
24148 /* Now, parse the body of the function. */
24155 /* Leave the scope of the containing function. */
24159 }
24161 /* Remove any template parameters from the symbol table. */
24164 /* Restore the queue. */
24167 }
24169 /* If DECL contains any default args, remember it on the unparsed
24170 functions queue. */
24172 static void
24174 {
24175 tree probe;
24178 probe;
24181 {
24185 }
24186 }
24188 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24189 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24190 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24191 from the parameter-type-list. */
24193 static tree
24196 {
24198 tree parsed_arg;
24204 /* Push the saved tokens for the default argument onto the parser's
24205 lexer stack. */
24211 /* Parse the default argument. */
24222 {
24223 /* In a non-template class, check conversions now. In a template,
24224 we'll wait and instantiate these as needed. */
24227 tf_warning_or_error);
24228 else
24230 }
24232 /* If the token stream has not been completely used up, then
24233 there was extra junk after the end of the default
24234 argument. */
24236 {
24239 else
24241 }
24243 /* Revert to the main lexer. */
24247 }
24249 /* FIELD is a non-static data member with an initializer which we saved for
24250 later; parse it now. */
24252 static void
24254 {
24255 tree def;
24262 NULL_TREE);
24268 }
24270 /* FN is a FUNCTION_DECL which may contains a parameter with an
24271 unparsed DEFAULT_ARG. Parse the default args now. This function
24272 assumes that the current scope is the scope in which the default
24273 argument should be processed. */
24275 static void
24277 {
24281 /* While we're parsing the default args, we might (due to the
24282 statement expression extension) encounter more classes. We want
24283 to handle them right away, but we don't want them getting mixed
24284 up with default args that are currently in the queue. */
24287 /* Local variable names (and the `this' keyword) may not appear
24288 in a default argument. */
24299 {
24301 tree parsed_arg;
24303 tree copy;
24310 /* This can happen for a friend declaration for a function
24311 already declared with default arguments. */
24314 parsed_arg
24316 default_arg,
24319 {
24321 }
24325 /* Update any instantiations we've already created. */
24329 }
24333 /* Make sure no default arg is missing. */
24336 /* Restore the state of local_variables_forbidden_p. */
24339 /* Restore the queue. */
24341 }
24343 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24345 sizeof ... ( identifier )
24347 where the 'sizeof' token has already been consumed. */
24349 static tree
24351 {
24352 /* Consume the `...'. */
24359 else
24367 /* The name is not qualified. */
24385 }
24387 /* Parse the operand of `sizeof' (or a similar operator). Returns
24388 either a TYPE or an expression, depending on the form of the
24389 input. The KEYWORD indicates which kind of expression we have
24390 encountered. */
24392 static tree
24394 {
24401 /* If it's a `...', then we are computing the length of a parameter
24402 pack. */
24407 /* Types cannot be defined in a `sizeof' expression. Save away the
24408 old message. */
24410 /* And create the new one. */
24416 /* The restrictions on constant-expressions do not apply inside
24417 sizeof expressions. */
24418 saved_integral_constant_expression_p
24420 saved_non_integral_constant_expression_p
24424 /* Do not actually evaluate the expression. */
24427 /* If it's a `(', then we might be looking at the type-id
24428 construction. */
24430 {
24433 /* We can't be sure yet whether we're looking at a type-id or an
24434 expression. */
24436 /* Note: as a GNU Extension, compound literals are considered
24437 postfix-expressions as they are in C99, so they are valid
24438 arguments to sizeof. See comment in cp_parser_cast_expression
24439 for details. */
24442 else
24443 {
24446 /* Look for the type-id. */
24448 /* Look for the closing `)'. */
24451 }
24453 /* If all went well, then we're done. */
24455 {
24456 cp_decl_specifier_seq decl_specs;
24458 /* Build a trivial decl-specifier-seq. */
24462 /* Call grokdeclarator to figure out what type this is. */
24465 TYPENAME,
24468 }
24469 }
24471 /* If the type-id production did not work out, then we must be
24472 looking at the unary-expression production. */
24476 /* Go back to evaluating expressions. */
24480 /* Free the message we created. */
24482 /* And restore the old one. */
24484 parser->integral_constant_expression_p
24486 parser->non_integral_constant_expression_p
24490 }
24492 /* If the current declaration has no declarator, return true. */
24494 static bool
24496 {
24497 /* If the next token is a `;' or a `,' then there is no
24498 declarator. */
24501 }
24503 /* Update the DECL_SPECS to reflect the storage class indicated by
24504 KEYWORD. */
24506 static void
24511 {
24512 cp_storage_class storage_class;
24515 {
24519 }
24521 {
24524 }
24529 {
24532 }
24535 {
24553 }
24557 /* A storage class specifier cannot be applied alongside a typedef
24558 specifier. If there is a typedef specifier present then set
24559 conflicting_specifiers_p which will trigger an error later
24560 on in grokdeclarator. */
24563 }
24565 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24566 is true, the type is a class or enum definition. */
24568 static void
24570 tree type_spec,
24573 {
24576 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24577 (with, for example, in "typedef int wchar_t;") we remember that
24578 this is what happened. In system headers, we ignore these
24579 declarations so that G++ can work with system headers that are not
24580 C++-safe. */
24582 && !type_definition_p
24592 {
24595 ds_redefined_builtin_type_spec,
24596 token);
24598 {
24602 }
24603 }
24606 else
24607 {
24612 }
24613 }
24615 /* True iff TOKEN is the GNU keyword __thread. */
24617 static bool
24619 {
24622 }
24624 /* Set the location for a declarator specifier and check if it is
24625 duplicated.
24627 DECL_SPECS is the sequence of declarator specifiers onto which to
24628 set the location.
24630 DS is the single declarator specifier to set which location is to
24631 be set onto the existing sequence of declarators.
24633 LOCATION is the location for the declarator specifier to
24634 consider. */
24636 static void
24639 {
24648 {
24652 }
24653 else
24654 {
24656 {
24660 else
24661 {
24664 OPT_Wlong_long,
24666 }
24667 }
24669 {
24674 else
24676 }
24677 else
24678 {
24694 "__complex"
24695 };
24698 }
24699 }
24700 }
24702 /* Return true iff the declarator specifier DS is present in the
24703 sequence of declarator specifiers DECL_SPECS. */
24705 bool
24707 cp_decl_spec ds)
24708 {
24715 }
24717 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24718 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24720 static bool
24722 {
24724 }
24726 /* Issue an error message indicating that TOKEN_DESC was expected.
24727 If KEYWORD is true, it indicated this function is called by
24728 cp_parser_require_keword and the required token can only be
24729 a indicated keyword. */
24731 static void
24733 required_token token_desc,
24735 {
24737 {
24806 }
24808 {
24810 {
24889 }
24890 }
24891 else
24893 }
24897 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24898 issue an error message indicating that TOKEN_DESC was expected.
24900 Returns the token consumed, if the token had the appropriate type.
24901 Otherwise, returns NULL. */
24906 required_token token_desc)
24907 {
24910 else
24911 {
24912 /* Output the MESSAGE -- unless we're parsing tentatively. */
24916 }
24917 }
24919 /* An error message is produced if the next token is not '>'.
24920 All further tokens are skipped until the desired token is
24921 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24923 static void
24925 {
24926 /* Current level of '< ... >'. */
24928 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24931 /* Are we ready, yet? If not, issue error message. */
24935 /* Skip tokens until the desired token is found. */
24937 {
24938 /* Peek at the next token. */
24940 {
24948 /* C++0x views the `>>' operator as two `>' tokens, but
24949 C++98 does not. */
24952 {
24953 /* We've hit a `>>' where the first `>' closes the
24954 template argument list, and the second `>' is
24955 spurious. Just consume the `>>' and stop; we've
24956 already produced at least one error. */
24959 }
24960 /* Fall through for C++0x, so we handle the second `>' in
24961 the `>>'. */
24965 {
24966 /* We've reached the token we want, consume it and stop. */
24969 }
24988 /* The '>' was probably forgotten, don't look further. */
24993 }
24995 /* Consume this token. */
24997 }
24998 }
25000 /* If the next token is the indicated keyword, consume it. Otherwise,
25001 issue an error message indicating that TOKEN_DESC was expected.
25003 Returns the token consumed, if the token had the appropriate type.
25004 Otherwise, returns NULL. */
25009 required_token token_desc)
25010 {
25014 {
25017 }
25020 }
25022 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25023 function-definition. */
25025 static bool
25027 {
25030 /* A ctor-initializer begins with a `:'. */
25032 /* A function-try-block begins with `try'. */
25034 /* A function-transaction-block begins with `__transaction_atomic'
25035 or `__transaction_relaxed'. */
25038 /* The named return value extension begins with `return'. */
25040 }
25042 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25043 definition. */
25045 static bool
25047 {
25054 }
25056 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25057 C++0x) ending a template-argument. */
25059 static bool
25061 {
25069 }
25071 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25072 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25074 static bool
25077 {
25083 /* Check for the sequence `<::' in the original code. It would be lexed as
25084 `[:', where `[' is a digraph, and there is no whitespace before
25085 `:'. */
25087 {
25092 }
25094 }
25096 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25097 or none_type otherwise. */
25099 static enum tag_types
25101 {
25103 {
25113 }
25114 }
25116 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25117 or none_type otherwise or if the token is null. */
25119 static enum tag_types
25121 {
25126 {
25134 }
25135 }
25137 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25139 static void
25141 {
25145 {
25149 type))
25152 }
25153 }
25155 /* Issue an error message if DECL is redeclared with different
25156 access than its original declaration [class.access.spec/3].
25157 This applies to nested classes and nested class templates.
25158 [class.mem/1]. */
25160 static void
25162 {
25171 }
25173 /* Look for the `template' keyword, as a syntactic disambiguator.
25174 Return TRUE iff it is present, in which case it will be
25175 consumed. */
25177 static bool
25179 {
25181 {
25182 /* In C++98 the `template' keyword can only be used within templates;
25183 outside templates the parser can always figure out what is a
25184 template and what is not. In C++11, per the resolution of DR 468,
25185 `template' is allowed in cases where it is not strictly necessary. */
25188 {
25191 "in C++98 %<template%> (as a disambiguator) is only "
25193 /* If this part of the token stream is rescanned, the same
25194 error message would be generated. So, we purge the token
25195 from the stream. */
25198 }
25199 else
25200 {
25201 /* Consume the `template' keyword. */
25204 }
25205 }
25207 }
25209 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25210 set PARSER->SCOPE, and perform other related actions. */
25212 static void
25214 {
25220 /* Get the stored value. */
25222 /* Perform any access checks that were deferred. */
25225 {
25230 }
25231 /* Set the scope from the stored value. */
25235 }
25237 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25238 encounter the end of a block before what we were looking for. */
25240 static bool
25244 {
25246 {
25249 /* Abort a parenthesized expression if we encounter a semicolon. */
25253 /* If we've reached the end of the file, stop. */
25259 /* We've hit the end of an enclosing block, so there's been some
25260 kind of syntax error. */
25263 /* Consume the token. */
25265 /* See if it starts a new group. */
25267 {
25269 /* In theory this should probably check end == '}', but
25270 cp_parser_save_member_function_body needs it to exit
25271 after either '}' or ')' when called with ')'. */
25274 }
25276 {
25280 }
25285 }
25286 }
25288 /* Like above, for caching a default argument or NSDMI. Both of these are
25289 terminated by a non-nested comma, but it can be unclear whether or not a
25290 comma is nested in a template argument list unless we do more parsing.
25291 In order to handle this ambiguity, when we encounter a ',' after a '<'
25292 we try to parse what follows as a parameter-declaration-list (in the
25293 case of a default argument) or a member-declarator (in the case of an
25294 NSDMI). If that succeeds, then we stop caching. */
25296 static tree
25298 {
25303 tree default_argument;
25305 /* Add tokens until we have processed the entire default
25306 argument. We add the range [first_token, token). */
25309 {
25310 /* For list-initialization, this is straightforward. */
25313 }
25315 {
25318 /* Peek at the next token. */
25320 /* What we do depends on what token we have. */
25322 {
25323 /* In valid code, a default argument must be
25324 immediately followed by a `,' `)', or `...'. */
25327 {
25328 /* If we've seen a '<', we might be in a
25329 template-argument-list. Until Core issue 325 is
25330 resolved, we don't know how this situation ought
25331 to be handled, so try to DTRT. We check whether
25332 what comes after the comma is a valid parameter
25333 declaration list. If it is, then the comma ends
25334 the default argument; otherwise the default
25335 argument continues. */
25338 /* Set ITALP so cp_parser_parameter_declaration_list
25339 doesn't decide to commit to this parse. */
25347 {
25354 }
25355 else
25356 {
25360 }
25367 }
25370 /* If we run into a non-nested `;', `}', or `]',
25371 then the code is invalid -- but the default
25372 argument is certainly over. */
25377 /* Handle correctly int n = sizeof ... ( p ); */
25380 /* Update DEPTH, if necessary. */
25395 /* This might be the comparison operator, or it might
25396 start a template argument list. */
25403 /* Fall through for C++0x, which treats the `>>'
25404 operator like two `>' tokens in certain
25405 cases. */
25409 {
25410 /* This might be an operator, or it might close a
25411 template argument list. But if a previous '<'
25412 started a template argument list, this will have
25413 closed it, so we can't be in one anymore. */
25417 }
25420 /* If we run out of tokens, issue an error message. */
25429 /* In these cases, we should look for template-ids.
25430 For example, if the default argument is
25431 `X<int, double>()', we need to do name lookup to
25432 figure out whether or not `X' is a template; if
25433 so, the `,' does not end the default argument.
25435 That is not yet done. */
25440 }
25442 /* If we've reached the end, stop. */
25446 /* Add the token to the token block. */
25448 }
25450 /* Create a DEFAULT_ARG to represent the unparsed default
25451 argument. */
25458 }
25460 /* Begin parsing tentatively. We always save tokens while parsing
25461 tentatively so that if the tentative parsing fails we can restore the
25462 tokens. */
25464 static void
25466 {
25467 /* Enter a new parsing context. */
25469 /* Begin saving tokens. */
25471 /* In order to avoid repetitive access control error messages,
25472 access checks are queued up until we are no longer parsing
25473 tentatively. */
25475 }
25477 /* Commit to the currently active tentative parse. */
25479 static void
25481 {
25485 /* Mark all of the levels as committed. */
25488 {
25495 }
25496 }
25498 /* Commit to the topmost currently active tentative parse.
25500 Note that this function shouldn't be called when there are
25501 irreversible side-effects while in a tentative state. For
25502 example, we shouldn't create a permanent entry in the symbol
25503 table, or issue an error message that might not apply if the
25504 tentative parse is aborted. */
25506 static void
25508 {
25513 {
25521 }
25522 }
25524 /* Abort the currently active tentative parse. All consumed tokens
25525 will be rolled back, and no diagnostics will be issued. */
25527 static void
25529 {
25533 /* Now, pretend that we want to see if the construct was
25534 successfully parsed. */
25536 }
25538 /* Stop parsing tentatively. If a parse error has occurred, restore the
25539 token stream. Otherwise, commit to the tokens we have consumed.
25540 Returns true if no error occurred; false otherwise. */
25542 static bool
25544 {
25548 /* Remember whether or not an error occurred, since we are about to
25549 destroy that information. */
25551 /* Remove the topmost context from the stack. */
25554 /* If no parse errors occurred, commit to the tentative parse. */
25556 {
25557 /* Commit to the tokens read tentatively, unless that was
25558 already done. */
25563 }
25564 /* Otherwise, if errors occurred, roll back our state so that things
25565 are just as they were before we began the tentative parse. */
25566 else
25567 {
25570 }
25571 /* Add the context to the front of the free list. */
25576 }
25578 /* Returns true if we are parsing tentatively and are not committed to
25579 this tentative parse. */
25581 static bool
25583 {
25586 }
25588 /* Returns nonzero iff an error has occurred during the most recent
25589 tentative parse. */
25591 static bool
25593 {
25596 }
25598 /* Returns nonzero if GNU extensions are allowed. */
25600 static bool
25602 {
25604 }
25605 \f
25606 /* Objective-C++ Productions */
25609 /* Parse an Objective-C expression, which feeds into a primary-expression
25610 above.
25612 objc-expression:
25613 objc-message-expression
25614 objc-string-literal
25615 objc-encode-expression
25616 objc-protocol-expression
25617 objc-selector-expression
25619 Returns a tree representation of the expression. */
25621 static tree
25623 {
25624 /* Try to figure out what kind of declaration is present. */
25628 {
25638 {
25650 }
25656 }
25659 }
25661 /* Parse an Objective-C message expression.
25663 objc-message-expression:
25664 [ objc-message-receiver objc-message-args ]
25666 Returns a representation of an Objective-C message. */
25668 static tree
25670 {
25679 }
25681 /* Parse an objc-message-receiver.
25683 objc-message-receiver:
25684 expression
25685 simple-type-specifier
25687 Returns a representation of the type or expression. */
25689 static tree
25691 {
25692 tree rcv;
25694 /* An Objective-C message receiver may be either (1) a type
25695 or (2) an expression. */
25699 /* If that worked out, fine. */
25706 CP_PARSER_FLAGS_NONE);
25713 }
25715 /* Parse the arguments and selectors comprising an Objective-C message.
25717 objc-message-args:
25718 objc-selector
25719 objc-selector-args
25720 objc-selector-args , objc-comma-args
25722 objc-selector-args:
25723 objc-selector [opt] : assignment-expression
25724 objc-selector-args objc-selector [opt] : assignment-expression
25726 objc-comma-args:
25727 assignment-expression
25728 objc-comma-args , assignment-expression
25730 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25731 selector arguments and TREE_VALUE containing a list of comma
25732 arguments. */
25734 static tree
25736 {
25742 {
25748 /* Detect if we have a unary selector. */
25757 sel_args
25762 }
25764 /* Handle non-selector arguments, if any. */
25766 {
25767 tree arg;
25772 addl_args
25777 }
25780 {
25783 }
25786 }
25788 /* Parse an Objective-C encode expression.
25790 objc-encode-expression:
25791 @encode objc-typename
25793 Returns an encoded representation of the type argument. */
25795 static tree
25797 {
25798 tree type;
25808 {
25812 }
25814 /* This happens if we find @encode(T) (where T is a template
25815 typename or something dependent on a template typename) when
25816 parsing a template. In that case, we can't compile it
25817 immediately, but we rather create an AT_ENCODE_EXPR which will
25818 need to be instantiated when the template is used.
25819 */
25821 {
25825 }
25828 }
25830 /* Parse an Objective-C @defs expression. */
25832 static tree
25834 {
25835 tree name;
25843 }
25845 /* Parse an Objective-C protocol expression.
25847 objc-protocol-expression:
25848 @protocol ( identifier )
25850 Returns a representation of the protocol expression. */
25852 static tree
25854 {
25855 tree proto;
25863 }
25865 /* Parse an Objective-C selector expression.
25867 objc-selector-expression:
25868 @selector ( objc-method-signature )
25870 objc-method-signature:
25871 objc-selector
25872 objc-selector-seq
25874 objc-selector-seq:
25875 objc-selector :
25876 objc-selector-seq objc-selector :
25878 Returns a representation of the method selector. */
25880 static tree
25882 {
25894 {
25903 {
25904 /* Detect if we have a unary selector. */
25906 {
25909 }
25910 else
25911 {
25913 }
25914 }
25919 {
25920 sel_seq
25923 sel_seq
25926 }
25927 else
25928 sel_seq
25933 }
25935 finish_selector:
25939 }
25941 /* Parse a list of identifiers.
25943 objc-identifier-list:
25944 identifier
25945 objc-identifier-list , identifier
25947 Returns a TREE_LIST of identifier nodes. */
25949 static tree
25951 {
25952 tree identifier;
25953 tree list;
25964 {
25971 identifier));
25973 }
25976 }
25978 /* Parse an Objective-C alias declaration.
25980 objc-alias-declaration:
25981 @compatibility_alias identifier identifier ;
25983 This function registers the alias mapping with the Objective-C front end.
25984 It returns nothing. */
25986 static void
25988 {
25996 }
25998 /* Parse an Objective-C class forward-declaration.
26000 objc-class-declaration:
26001 @class objc-identifier-list ;
26003 The function registers the forward declarations with the Objective-C
26004 front end. It returns nothing. */
26006 static void
26008 {
26011 {
26012 tree id;
26022 else
26024 }
26026 }
26028 /* Parse a list of Objective-C protocol references.
26030 objc-protocol-refs-opt:
26031 objc-protocol-refs [opt]
26033 objc-protocol-refs:
26034 < objc-identifier-list >
26036 Returns a TREE_LIST of identifiers, if any. */
26038 static tree
26040 {
26044 {
26048 }
26051 }
26053 /* Parse a Objective-C visibility specification. */
26055 static void
26057 {
26061 {
26076 }
26078 /* Eat '@private'/'@protected'/'@public'. */
26080 }
26082 /* Parse an Objective-C method type. Return 'true' if it is a class
26083 (+) method, and 'false' if it is an instance (-) method. */
26087 {
26090 else
26092 }
26094 /* Parse an Objective-C protocol qualifier. */
26096 static tree
26098 {
26111 {
26116 }
26119 }
26121 /* Parse an Objective-C typename. */
26123 static tree
26125 {
26129 {
26135 /* An ObjC type name may consist of just protocol qualifiers, in which
26136 case the type shall default to 'id'. */
26138 {
26141 /* If the type could not be parsed, an error has already
26142 been produced. For error recovery, behave as if it had
26143 not been specified, which will use the default type
26144 'id'. */
26146 {
26148 /* We need to skip to the closing parenthesis as
26149 cp_parser_type_id() does not seem to do it for
26150 us. */
26155 }
26156 }
26160 }
26163 }
26165 /* Check to see if TYPE refers to an Objective-C selector name. */
26167 static bool
26169 {
26175 }
26177 /* Parse an Objective-C selector. */
26179 static tree
26181 {
26185 {
26188 }
26190 /* C++ operator names are allowed to appear in ObjC selectors. */
26192 {
26205 }
26206 }
26208 /* Parse an Objective-C params list. */
26210 static tree
26212 {
26218 {
26228 /* Detect if we have a unary selector. */
26231 {
26234 }
26238 {
26239 /* Something went quite wrong. There should be a colon
26240 here, but there is not. Stop parsing parameters. */
26242 }
26244 /* New ObjC allows attributes on parameters too. */
26249 params
26252 type_name,
26253 identifier,
26254 parm_attr));
26257 }
26260 {
26263 }
26265 /* We allow tail attributes for the method. */
26267 {
26275 }
26278 {
26281 }
26283 }
26285 /* Parse the non-keyword Objective-C params. */
26287 static tree
26290 {
26296 {
26298 tree parm;
26304 {
26309 }
26311 /* TODO: parse attributes for tail parameters. */
26320 }
26322 /* We allow tail attributes for the method. */
26324 {
26326 {
26331 }
26332 else
26333 /* We have an error, but parse the attributes, so that we can
26334 carry on. */
26340 }
26343 }
26345 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26347 static void
26349 {
26352 /* If the next token is `extern' and the following token is a string
26353 literal, then we have a linkage specification. */
26355 && cp_parser_is_pure_string_literal
26358 /* Handle #pragma, if any. */
26361 /* Allow stray semicolons. */
26364 /* Mark methods as optional or required, when building protocols. */
26366 {
26369 }
26371 {
26374 }
26377 /* Other stray characters must generate errors. */
26379 {
26383 }
26384 /* Finally, try to parse a block-declaration, or a function-definition. */
26385 else
26387 }
26389 /* Parse a method signature. */
26391 static tree
26393 {
26409 }
26411 static bool
26413 {
26414 tree tattr;
26419 /* If the attributes are followed by a method introducer, this is not allowed.
26420 Dump the attributes and flag the situation. */
26425 /* Otherwise, the attributes introduce some interstitial code, possibly so
26426 rewind to allow that check. */
26429 }
26431 /* Parse an Objective-C method prototype list. */
26433 static void
26435 {
26439 {
26441 {
26446 else
26450 {
26454 }
26457 }
26463 OPT_Wattributes,
26465 else
26466 /* Allow for interspersed non-ObjC++ code. */
26470 }
26474 else
26478 }
26480 /* Parse an Objective-C method definition list. */
26482 static void
26484 {
26488 {
26489 tree meth;
26492 {
26498 else
26503 {
26507 }
26509 NULL_TREE);
26511 /* For historical reasons, we accept an optional semicolon. */
26518 {
26525 }
26526 }
26527 /* The following case will be removed once @synthesize is
26528 completely implemented. */
26539 else
26540 /* Allow for interspersed non-ObjC++ code. */
26544 }
26548 else
26552 }
26554 /* Parse Objective-C ivars. */
26556 static void
26558 {
26569 {
26570 cp_decl_specifier_seq declspecs;
26572 tree prefix_attributes;
26580 CP_PARSER_FLAGS_OPTIONAL,
26584 /* auto, register, static, extern, mutable. */
26586 {
26589 }
26591 /* thread_local. */
26593 {
26596 }
26598 /* typedef. */
26600 {
26603 }
26608 /* Keep going until we hit the `;' at the end of the
26609 declaration. */
26611 {
26616 /* Check for a (possibly unnamed) bitfield declaration. */
26624 {
26625 /* Get the name of the bitfield. */
26628 sfk_none);
26630 eat_colon:
26632 /* Get the width of the bitfield. */
26633 width
26635 }
26636 else
26637 {
26638 /* Parse the declarator. */
26639 declarator
26645 }
26647 /* Look for attributes that apply to the ivar. */
26649 /* Remember which attributes are prefix attributes and
26650 which are not. */
26652 /* Combine the attributes. */
26656 /* Create the bitfield declaration. */
26658 width,
26659 attributes);
26660 else
26665 /* Add the instance variable. */
26669 /* Reset PREFIX_ATTRIBUTES. */
26678 {
26681 }
26683 }
26687 }
26692 /* Do not consume the RID_AT_END, so it will be read again as terminating
26693 the @interface of @implementation. */
26697 /* For historical reasons, we accept an optional semicolon. */
26700 }
26702 /* Parse an Objective-C protocol declaration. */
26704 static void
26706 {
26712 {
26717 }
26719 /* See if we have a forward declaration or a definition. */
26722 /* Try a forward declaration first. */
26724 {
26726 {
26727 tree id;
26737 else
26739 }
26741 }
26743 /* Ok, we got a full-fledged definition (or at least should). */
26744 else
26745 {
26750 }
26751 }
26753 /* Parse an Objective-C superclass or category. */
26755 static void
26760 {
26766 {
26769 }
26771 {
26774 /* If there is no category name, and this is an @interface, we
26775 have a class extension. */
26777 {
26780 }
26781 else
26785 }
26786 }
26788 /* Parse an Objective-C class interface. */
26790 static void
26792 {
26799 {
26800 /* It's hard to recover because even if valid @interface stuff
26801 is to follow, we can't compile it (or validate it) if we
26802 don't even know which class it refers to. Let's assume this
26803 was a stray '@interface' token in the stream and skip it.
26804 */
26806 }
26811 /* We have either a class or a category on our hands. */
26814 else
26815 {
26817 /* Handle instance variable declarations, if any. */
26820 }
26823 }
26825 /* Parse an Objective-C class implementation. */
26827 static void
26829 {
26836 {
26837 /* It's hard to recover because even if valid @implementation
26838 stuff is to follow, we can't compile it (or validate it) if
26839 we don't even know which class it refers to. Let's assume
26840 this was a stray '@implementation' token in the stream and
26841 skip it.
26842 */
26844 }
26848 /* We have either a class or a category on our hands. */
26851 else
26852 {
26854 /* Handle instance variable declarations, if any. */
26857 }
26860 }
26862 /* Consume the @end token and finish off the implementation. */
26864 static void
26866 {
26869 }
26871 /* Parse an Objective-C declaration. */
26873 static void
26875 {
26876 /* Try to figure out what kind of declaration is present. */
26881 {
26897 }
26900 {
26923 }
26924 }
26926 /* Parse an Objective-C try-catch-finally statement.
26928 objc-try-catch-finally-stmt:
26929 @try compound-statement objc-catch-clause-seq [opt]
26930 objc-finally-clause [opt]
26932 objc-catch-clause-seq:
26933 objc-catch-clause objc-catch-clause-seq [opt]
26935 objc-catch-clause:
26936 @catch ( objc-exception-declaration ) compound-statement
26938 objc-finally-clause:
26939 @finally compound-statement
26941 objc-exception-declaration:
26942 parameter-declaration
26943 '...'
26945 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26947 Returns NULL_TREE.
26949 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26950 for C. Keep them in sync. */
26952 static tree
26954 {
26955 location_t location;
26956 tree stmt;
26961 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26962 node, lest it get absorbed into the surrounding block. */
26968 {
26977 {
26978 /* We have "@catch (...)" (where the '...' are literally
26979 what is in the code). Skip the '...'.
26980 parameter_declaration is set to NULL_TREE, and
26981 objc_being_catch_clauses() knows that that means
26982 '...'. */
26985 }
26986 else
26987 {
26988 /* We have "@catch (NSException *exception)" or something
26989 like that. Parse the parameter declaration. */
26993 else
26998 }
27001 else
27002 {
27003 /* If there was no open parenthesis, we are recovering from
27004 an error, and we are trying to figure out what mistake
27005 the user has made. */
27007 /* If there is an immediate closing parenthesis, the user
27008 probably forgot the opening one (ie, they typed "@catch
27009 NSException *e)". Parse the closing parenthesis and keep
27010 going. */
27014 /* If these is no immediate closing parenthesis, the user
27015 probably doesn't know that parenthesis are required at
27016 all (ie, they typed "@catch NSException *e"). So, just
27017 forget about the closing parenthesis and keep going. */
27018 }
27022 }
27024 {
27027 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27028 node, lest it get absorbed into the surrounding block. */
27032 }
27035 }
27037 /* Parse an Objective-C synchronized statement.
27039 objc-synchronized-stmt:
27040 @synchronized ( expression ) compound-statement
27042 Returns NULL_TREE. */
27044 static tree
27046 {
27047 location_t location;
27058 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27059 node, lest it get absorbed into the surrounding block. */
27064 }
27066 /* Parse an Objective-C throw statement.
27068 objc-throw-stmt:
27069 @throw assignment-expression [opt] ;
27071 Returns a constructed '@throw' statement. */
27073 static tree
27075 {
27087 }
27089 /* Parse an Objective-C statement. */
27091 static tree
27093 {
27094 /* Try to figure out what kind of declaration is present. */
27098 {
27109 }
27112 }
27114 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27115 look ahead to see if an objc keyword follows the attributes. This
27116 is to detect the use of prefix attributes on ObjC @interface and
27117 @protocol. */
27119 static bool
27121 {
27126 {
27129 }
27132 }
27134 /* This routine is a minimal replacement for
27135 c_parser_struct_declaration () used when parsing the list of
27136 types/names or ObjC++ properties. For example, when parsing the
27137 code
27139 @property (readonly) int a, b, c;
27141 this function is responsible for parsing "int a, int b, int c" and
27142 returning the declarations as CHAIN of DECLs.
27144 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27145 similar parsing. */
27146 static tree
27148 {
27150 cp_decl_specifier_seq declspecs;
27152 tree prefix_attributes;
27155 CP_PARSER_FLAGS_NONE,
27162 /* auto, register, static, extern, mutable. */
27164 {
27167 }
27169 /* thread_local. */
27171 {
27174 }
27176 /* typedef. */
27178 {
27181 }
27186 /* Keep going until we hit the `;' at the end of the declaration. */
27188 {
27193 /* Parse the declarator. */
27197 /* Look for attributes that apply to the ivar. */
27199 /* Remember which attributes are prefix attributes and
27200 which are not. */
27202 /* Combine the attributes. */
27212 /* Reset PREFIX_ATTRIBUTES. */
27223 {
27226 }
27227 else
27229 }
27231 }
27233 /* Parse an Objective-C @property declaration. The syntax is:
27235 objc-property-declaration:
27236 '@property' objc-property-attributes[opt] struct-declaration ;
27238 objc-property-attributes:
27239 '(' objc-property-attribute-list ')'
27241 objc-property-attribute-list:
27242 objc-property-attribute
27243 objc-property-attribute-list, objc-property-attribute
27245 objc-property-attribute
27246 'getter' = identifier
27247 'setter' = identifier
27248 'readonly'
27249 'readwrite'
27250 'assign'
27251 'retain'
27252 'copy'
27253 'nonatomic'
27255 For example:
27256 @property NSString *name;
27257 @property (readonly) id object;
27258 @property (retain, nonatomic, getter=getTheName) id name;
27259 @property int a, b, c;
27261 PS: This function is identical to
27262 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27263 static void
27265 {
27266 /* The following variables hold the attributes of the properties as
27267 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27268 seen. When we see an attribute, we set them to 'true' (if they
27269 are boolean properties) or to the identifier (if they have an
27270 argument, ie, for getter and setter). Note that here we only
27271 parse the list of attributes, check the syntax and accumulate the
27272 attributes that we find. objc_add_property_declaration() will
27273 then process the information. */
27283 /* 'properties' is the list of properties that we read. Usually a
27284 single one, but maybe more (eg, in "@property int a, b, c;" there
27285 are three). */
27286 tree properties;
27287 location_t loc;
27293 /* Parse the optional attribute list... */
27295 {
27296 /* Eat the '('. */
27300 {
27306 {
27309 }
27313 {
27324 {
27328 else
27333 }
27336 {
27340 }
27342 {
27344 {
27347 }
27348 else
27352 else
27354 }
27355 else
27356 {
27358 {
27361 }
27362 else
27364 }
27370 }
27377 else
27379 }
27381 /* FIXME: "@property (setter, assign);" will generate a spurious
27382 "error: expected ‘)’ before ‘,’ token". This is because
27383 cp_parser_require, unlike the C counterpart, will produce an
27384 error even if we are in error recovery. */
27386 {
27391 }
27392 }
27394 /* ... and the property declaration(s). */
27398 {
27400 /* If the next token is now a `;', consume it. */
27404 }
27408 else
27409 {
27410 /* Comma-separated properties are chained together in
27411 reverse order; add them one by one. */
27420 }
27423 }
27425 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27427 objc-synthesize-declaration:
27428 @synthesize objc-synthesize-identifier-list ;
27430 objc-synthesize-identifier-list:
27431 objc-synthesize-identifier
27432 objc-synthesize-identifier-list, objc-synthesize-identifier
27434 objc-synthesize-identifier
27435 identifier
27436 identifier = identifier
27438 For example:
27439 @synthesize MyProperty;
27440 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27442 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27443 for C. Keep them in sync.
27444 */
27445 static void
27447 {
27449 location_t loc;
27454 {
27458 {
27461 }
27463 {
27467 {
27470 }
27471 }
27472 else
27477 else
27479 }
27482 }
27484 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27486 objc-dynamic-declaration:
27487 @dynamic identifier-list ;
27489 For example:
27490 @dynamic MyProperty;
27491 @dynamic MyProperty, AnotherProperty;
27493 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27494 for C. Keep them in sync.
27495 */
27496 static void
27498 {
27500 location_t loc;
27505 {
27506 tree property;
27509 {
27512 }
27516 else
27518 }
27521 }
27523 \f
27524 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27526 /* Returns name of the next clause.
27527 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27528 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27529 returned and the token is consumed. */
27531 static pragma_omp_clause
27533 {
27547 {
27552 {
27695 }
27696 }
27702 }
27704 /* Validate that a clause of the given type does not already exist. */
27706 static void
27709 {
27710 tree c;
27714 {
27717 }
27718 }
27720 /* OpenMP 2.5:
27721 variable-list:
27722 identifier
27723 variable-list , identifier
27725 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27726 colon). An opening parenthesis will have been consumed by the caller.
27728 If KIND is nonzero, create the appropriate node and install the decl
27729 in OMP_CLAUSE_DECL and add the node to the head of the list.
27731 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27732 return the list created.
27734 COLON can be NULL if only closing parenthesis should end the list,
27735 or pointer to bool which will receive false if the list is terminated
27736 by closing parenthesis or true if the list is terminated by colon. */
27738 static tree
27741 {
27745 {
27748 }
27750 {
27767 {
27769 {
27772 {
27776 }
27777 /* FALL THROUGH. */
27783 {
27791 parser->colon_corrects_to_scope_p
27795 else
27796 {
27797 /* Look for `:'. */
27801 CPP_CLOSE_SQUARE))
27803 }
27804 /* Look for the closing `]'. */
27806 RT_CLOSE_SQUARE))
27810 {
27813 {
27817 }
27821 {
27825 }
27826 }
27829 }
27833 }
27839 }
27840 else
27843 get_comma:
27847 }
27853 {
27857 }
27860 {
27863 /* Try to resync to an unnested comma. Copied from
27864 cp_parser_parenthesized_expression_list. */
27865 skip_comma:
27874 }
27877 }
27879 /* Similarly, but expect leading and trailing parenthesis. This is a very
27880 common case for omp clauses. */
27882 static tree
27884 {
27888 }
27890 /* OpenACC 2.0:
27891 copy ( variable-list )
27892 copyin ( variable-list )
27893 copyout ( variable-list )
27894 create ( variable-list )
27895 delete ( variable-list )
27896 present ( variable-list )
27897 present_or_copy ( variable-list )
27898 pcopy ( variable-list )
27899 present_or_copyin ( variable-list )
27900 pcopyin ( variable-list )
27901 present_or_copyout ( variable-list )
27902 pcopyout ( variable-list )
27903 present_or_create ( variable-list )
27904 pcreate ( variable-list ) */
27906 static tree
27908 tree list)
27909 {
27912 {
27952 }
27960 }
27962 /* OpenACC 2.0:
27963 deviceptr ( variable-list ) */
27965 static tree
27967 {
27971 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27972 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
27973 variable-list must only allow for pointer variables. */
27976 {
27979 /* FIXME diagnostics: Ideally we should keep individual
27980 locations for all the variables in the var list to make the
27981 following errors more precise. Perhaps
27982 c_parser_omp_var_list_parens should construct a list of
27983 locations to go along with the var list. */
27988 ;
27997 }
28000 }
28002 /* OpenACC:
28003 vector_length ( expression ) */
28005 static tree
28007 {
28017 {
28020 }
28023 {
28028 }
28031 location);
28039 }
28041 /* OpenACC 2.0
28042 Parse wait clause or directive parameters. */
28044 static tree
28046 {
28056 {
28061 }
28068 {
28072 {
28075 else
28076 {
28083 }
28084 }
28085 }
28088 }
28090 /* OpenACC:
28091 wait ( int-expr-list ) */
28093 static tree
28095 {
28104 }
28106 /* OpenMP 3.0:
28107 collapse ( constant-expression ) */
28109 static tree
28111 {
28113 location_t loc;
28114 HOST_WIDE_INT n;
28134 {
28137 }
28145 }
28147 /* OpenMP 2.5:
28148 default ( shared | none ) */
28150 static tree
28152 {
28154 tree c;
28159 {
28164 {
28179 }
28182 }
28183 else
28184 {
28185 invalid_kind:
28187 }
28203 }
28205 /* OpenMP 3.1:
28206 final ( expression ) */
28208 static tree
28210 {
28231 }
28233 /* OpenMP 2.5:
28234 if ( expression ) */
28236 static tree
28238 {
28259 }
28261 /* OpenMP 3.1:
28262 mergeable */
28264 static tree
28267 {
28268 tree c;
28271 location);
28276 }
28278 /* OpenMP 2.5:
28279 nowait */
28281 static tree
28284 {
28285 tree c;
28292 }
28294 /* OpenACC:
28295 num_gangs ( expression ) */
28297 static tree
28299 {
28315 {
28318 }
28328 }
28330 /* OpenMP 2.5:
28331 num_threads ( expression ) */
28333 static tree
28335 location_t location)
28336 {
28358 }
28360 /* OpenACC:
28361 num_workers ( expression ) */
28363 static tree
28365 {
28381 {
28384 }
28387 location);
28395 }
28397 /* OpenMP 2.5:
28398 ordered */
28400 static tree
28403 {
28404 tree c;
28412 }
28414 /* OpenMP 2.5:
28415 reduction ( reduction-operator : variable-list )
28417 reduction-operator:
28418 One of: + * - & ^ | && ||
28420 OpenMP 3.1:
28422 reduction-operator:
28423 One of: + * - & ^ | && || min max
28425 OpenMP 4.0:
28427 reduction-operator:
28428 One of: + * - & ^ | && ||
28429 id-expression */
28431 static tree
28433 {
28441 {
28451 }
28455 else
28456 {
28467 {
28497 }
28498 else
28499 {
28501 resync_fail:
28506 }
28507 }
28513 NULL);
28515 {
28518 }
28521 }
28523 /* OpenMP 2.5:
28524 schedule ( schedule-kind )
28525 schedule ( schedule-kind , expression )
28527 schedule-kind:
28528 static | dynamic | guided | runtime | auto */
28530 static tree
28532 {
28541 {
28546 {
28567 }
28568 }
28573 else
28578 {
28593 else
28598 }
28606 invalid_kind:
28608 resync_fail:
28613 }
28615 /* OpenMP 3.0:
28616 untied */
28618 static tree
28621 {
28622 tree c;
28629 }
28631 /* OpenMP 4.0:
28632 inbranch
28633 notinbranch */
28635 static tree
28638 {
28643 }
28645 /* OpenMP 4.0:
28646 parallel
28647 for
28648 sections
28649 taskgroup */
28651 static tree
28655 {
28659 }
28661 /* OpenMP 4.0:
28662 num_teams ( expression ) */
28664 static tree
28666 location_t location)
28667 {
28689 }
28691 /* OpenMP 4.0:
28692 thread_limit ( expression ) */
28694 static tree
28696 location_t location)
28697 {
28719 }
28721 /* OpenMP 4.0:
28722 aligned ( variable-list )
28723 aligned ( variable-list : constant-expression ) */
28725 static tree
28727 {
28738 {
28748 }
28754 }
28756 /* OpenMP 4.0:
28757 linear ( variable-list )
28758 linear ( variable-list : expression ) */
28760 static tree
28763 {
28774 {
28778 {
28781 }
28789 }
28795 }
28797 /* OpenMP 4.0:
28798 safelen ( constant-expression ) */
28800 static tree
28802 location_t location)
28803 {
28824 }
28826 /* OpenMP 4.0:
28827 simdlen ( constant-expression ) */
28829 static tree
28831 location_t location)
28832 {
28853 }
28855 /* OpenMP 4.0:
28856 depend ( depend-kind : variable-list )
28858 depend-kind:
28859 in | out | inout */
28861 static tree
28863 {
28871 {
28881 else
28883 }
28884 else
28892 NULL);
28899 invalid_kind:
28901 resync_fail:
28906 }
28908 /* OpenMP 4.0:
28909 map ( map-kind : variable-list )
28910 map ( variable-list )
28912 map-kind:
28913 alloc | to | from | tofrom */
28915 static tree
28917 {
28926 {
28938 else
28939 {
28945 }
28948 }
28951 NULL);
28957 }
28959 /* OpenMP 4.0:
28960 device ( expression ) */
28962 static tree
28964 location_t location)
28965 {
28987 }
28989 /* OpenMP 4.0:
28990 dist_schedule ( static )
28991 dist_schedule ( static , expression ) */
28993 static tree
28995 location_t location)
28996 {
29009 {
29020 }
29025 location);
29029 invalid_kind:
29031 resync_fail:
29036 }
29038 /* OpenMP 4.0:
29039 proc_bind ( proc-bind-kind )
29041 proc-bind-kind:
29042 master | close | spread */
29044 static tree
29046 location_t location)
29047 {
29048 tree c;
29055 {
29065 else
29067 }
29068 else
29077 location);
29082 invalid_kind:
29084 resync_fail:
29089 }
29091 /* OpenACC:
29092 async [( int-expr )] */
29094 static tree
29096 {
29103 {
29112 }
29122 }
29124 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29125 is a bitmask in MASK. Return the list of clauses found. */
29127 static tree
29131 {
29136 {
29137 location_t here;
29138 pragma_omp_clause c_kind;
29149 {
29241 }
29246 {
29247 /* Remove the invalid clause(s) from the list to avoid
29248 confusing the rest of the compiler. */
29251 }
29252 }
29254 saw_error:
29261 }
29263 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29264 is a bitmask in MASK. Return the list of clauses found; the result
29265 of clause default goes in *pdefault. */
29267 static tree
29271 {
29278 {
29279 pragma_omp_clause c_kind;
29290 {
29302 clauses);
29316 clauses);
29325 clauses);
29349 clauses);
29363 clauses);
29380 OMP_CLAUSE_NOTINBRANCH,
29389 {
29390 clause_not_first:
29394 }
29419 clauses);
29424 clauses);
29429 clauses);
29492 }
29497 {
29498 /* Remove the invalid clause(s) from the list to avoid
29499 confusing the rest of the compiler. */
29502 }
29503 }
29504 saw_error:
29505 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29506 no reason to skip to the end. */
29512 }
29514 /* OpenMP 2.5:
29515 structured-block:
29516 statement
29518 In practice, we're also interested in adding the statement to an
29519 outer node. So it is convenient if we work around the fact that
29520 cp_parser_statement calls add_stmt. */
29522 static unsigned
29524 {
29527 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29528 This preserves the "not within loop or switch" style error messages
29529 for nonsense cases like
29530 void foo() {
29531 #pragma omp single
29532 break;
29533 }
29534 */
29539 }
29541 static void
29543 {
29545 }
29547 static tree
29549 {
29557 }
29559 /* OpenMP 2.5:
29560 # pragma omp atomic new-line
29561 expression-stmt
29563 expression-stmt:
29564 x binop= expr | x++ | ++x | x-- | --x
29565 binop:
29566 +, *, -, /, &, ^, |, <<, >>
29568 where x is an lvalue expression with scalar type.
29570 OpenMP 3.1:
29571 # pragma omp atomic new-line
29572 update-stmt
29574 # pragma omp atomic read new-line
29575 read-stmt
29577 # pragma omp atomic write new-line
29578 write-stmt
29580 # pragma omp atomic update new-line
29581 update-stmt
29583 # pragma omp atomic capture new-line
29584 capture-stmt
29586 # pragma omp atomic capture new-line
29587 capture-block
29589 read-stmt:
29590 v = x
29591 write-stmt:
29592 x = expr
29593 update-stmt:
29594 expression-stmt | x = x binop expr
29595 capture-stmt:
29596 v = expression-stmt
29597 capture-block:
29598 { v = x; update-stmt; } | { update-stmt; v = x; }
29600 OpenMP 4.0:
29601 update-stmt:
29602 expression-stmt | x = x binop expr | x = expr binop x
29603 capture-stmt:
29604 v = update-stmt
29605 capture-block:
29606 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29608 where x and v are lvalue expressions with scalar type. */
29610 static void
29612 {
29620 {
29625 {
29631 }
29632 }
29634 {
29646 else
29650 }
29652 {
29658 {
29663 {
29666 }
29667 }
29668 }
29672 {
29682 else
29687 {
29688 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29689 opcode. */
29694 }
29698 {
29701 }
29702 else
29703 {
29709 }
29712 }
29714 restart:
29718 {
29725 /* FALLTHROUGH */
29735 /* FALLTHROUGH */
29750 /* Undo effects of boolean_increment for post {in,de}crement. */
29752 /* FALLTHRU */
29756 {
29757 /* Undo effects of boolean_increment. */
29759 {
29760 /* This is pre or post increment. */
29765 && !structured_block
29769 }
29770 }
29771 /* FALLTHRU */
29774 {
29809 {
29813 }
29816 {
29822 {
29827 }
29829 {
29841 {
29843 {
29848 }
29849 else
29851 }
29855 }
29858 {
29865 }
29869 }
29873 {
29876 {
29884 }
29886 {
29891 }
29926 }
29937 /* FALLTHROUGH */
29942 }
29949 }
29950 stmt_done:
29952 {
29963 }
29965 {
29968 }
29969 done:
29975 saw_error:
29978 {
29982 {
29986 }
29987 }
29988 }
29991 /* OpenMP 2.5:
29992 # pragma omp barrier new-line */
29994 static void
29996 {
29999 }
30001 /* OpenMP 2.5:
30002 # pragma omp critical [(name)] new-line
30003 structured-block */
30005 static tree
30007 {
30011 {
30023 }
30028 }
30030 /* OpenMP 2.5:
30031 # pragma omp flush flush-vars[opt] new-line
30033 flush-vars:
30034 ( variable-list ) */
30036 static void
30038 {
30044 }
30046 /* Helper function, to parse omp for increment expression. */
30048 static tree
30050 {
30055 {
30058 }
30061 {
30070 /* Fall through: OpenMP disallows NE_EXPR. */
30073 }
30075 /* If decl is an iterator, preserve LHS and RHS of the relational
30076 expr until finish_omp_for. */
30086 }
30088 /* Helper function, to parse omp for increment expression. */
30090 static tree
30092 {
30096 cp_id_kind idk;
30100 {
30108 }
30116 {
30121 }
30128 {
30132 }
30144 do
30145 {
30152 {
30154 {
30157 else
30159 tf_warning_or_error);
30160 }
30161 else
30164 }
30165 }
30169 {
30173 }
30174 else
30178 }
30180 /* Parse the initialization statement of either an OpenMP for loop or
30181 a Cilk Plus for loop.
30183 Return true if the resulting construct should have an
30184 OMP_CLAUSE_PRIVATE added to it. */
30186 static bool
30194 {
30200 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30202 init-expr:
30203 var = lb
30204 integer-type var = lb
30205 random-access-iterator-type var = lb
30206 pointer-type var = lb
30207 */
30208 cp_decl_specifier_seq type_specifiers;
30210 /* First, try to parse as an initialized declaration. See
30211 cp_parser_condition, from whence the bulk of this is copied. */
30218 {
30219 /* If parsing a type specifier seq succeeded, then this
30220 MUST be a initialized declaration. */
30225 CP_PARSER_DECLARATOR_NAMED,
30236 else
30237 {
30247 {
30249 CPP_OPEN_PAREN))
30250 {
30254 else
30257 }
30258 else
30259 /* Trigger an error. */
30264 }
30268 {
30276 {
30279 auto_node);
30284 }
30287 asm_specification,
30288 LOOKUP_ONLYCONVERTING);
30290 {
30293 }
30294 else
30297 }
30298 else
30299 {
30300 /* Consume '='. */
30304 non_class:
30307 else
30310 asm_specification,
30311 LOOKUP_ONLYCONVERTING);
30312 }
30316 }
30317 }
30318 else
30319 {
30320 cp_id_kind idk;
30321 /* If parsing a type specifier sequence failed, then
30322 this MUST be a simple expression. */
30330 && decl
30333 {
30334 tree rhs;
30341 rhs,
30342 tf_warning_or_error));
30344 }
30345 else
30346 {
30351 {
30355 }
30356 }
30357 }
30359 }
30361 /* Parse the restricted form of the for statement allowed by OpenMP. */
30363 static tree
30366 {
30370 location_t loc_first;
30389 {
30392 location_t loc;
30396 {
30399 }
30402 {
30405 }
30414 add_private_clause
30421 {
30424 {
30430 }
30431 else
30433 }
30440 {
30445 {
30449 }
30452 {
30453 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30454 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30459 {
30462 }
30463 else
30464 {
30467 }
30471 }
30472 else
30473 {
30478 }
30479 }
30482 {
30483 tree c;
30485 {
30494 decl);
30498 decl);
30499 }
30501 {
30506 {
30509 }
30510 }
30511 }
30520 {
30521 /* If decl is an iterator, preserve the operator on decl
30522 until finish_omp_for. */
30524 && ((processing_template_decl
30528 else
30532 }
30547 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30548 in between the collapsed for loops to be still considered perfectly
30549 nested. Hopefully the final version clarifies this.
30550 For now handle (multiple) {'s and empty statements. */
30552 do
30553 {
30557 {
30559 bracecount++;
30560 }
30564 else
30565 {
30572 }
30573 }
30577 {
30580 }
30581 }
30583 /* Note that we saved the original contents of this flag when we entered
30584 the structured block, and so we don't need to re-save it here. */
30587 else
30590 /* Note that the grammar doesn't call for a structured block here,
30591 though the loop as a whole is a structured block. */
30598 else
30603 {
30605 {
30607 nbraces--;
30608 }
30611 else
30612 {
30614 {
30617 }
30622 }
30623 }
30630 }
30632 /* Helper function for OpenMP parsing, split clauses and call
30633 finish_omp_clauses on each of the set of clauses afterwards. */
30635 static void
30638 {
30644 }
30646 /* OpenMP 4.0:
30647 #pragma omp simd simd-clause[optseq] new-line
30648 for-loop */
30650 #define OMP_SIMD_CLAUSE_MASK \
30651 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30659 static tree
30662 {
30674 {
30677 }
30688 }
30690 /* OpenMP 2.5:
30691 #pragma omp for for-clause[optseq] new-line
30692 for-loop
30694 OpenMP 4.0:
30695 #pragma omp for simd for-simd-clause[optseq] new-line
30696 for-loop */
30698 #define OMP_FOR_CLAUSE_MASK \
30699 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30708 static tree
30711 {
30722 {
30727 {
30735 cclauses);
30739 cclauses);
30751 }
30752 }
30754 {
30757 }
30762 {
30765 }
30776 }
30778 /* OpenMP 2.5:
30779 # pragma omp master new-line
30780 structured-block */
30782 static tree
30784 {
30788 }
30790 /* OpenMP 2.5:
30791 # pragma omp ordered new-line
30792 structured-block */
30794 static tree
30796 {
30800 }
30802 /* OpenMP 2.5:
30804 section-scope:
30805 { section-sequence }
30807 section-sequence:
30808 section-directive[opt] structured-block
30809 section-sequence section-directive structured-block */
30811 static tree
30813 {
30824 {
30828 }
30831 {
30839 {
30843 }
30845 {
30848 }
30853 }
30864 }
30866 /* OpenMP 2.5:
30867 # pragma omp sections sections-clause[optseq] newline
30868 sections-scope */
30870 #define OMP_SECTIONS_CLAUSE_MASK \
30871 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30877 static tree
30880 {
30892 {
30895 }
30902 }
30904 /* OpenMP 2.5:
30905 # pragma omp parallel parallel-clause[optseq] new-line
30906 structured-block
30907 # pragma omp parallel for parallel-for-clause[optseq] new-line
30908 structured-block
30909 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30910 structured-block
30912 OpenMP 4.0:
30913 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30914 structured-block */
30916 #define OMP_PARALLEL_CLAUSE_MASK \
30917 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30927 static tree
30930 {
30939 {
30952 block);
30957 }
30959 {
30963 }
30965 {
30968 }
30970 {
30974 {
30984 block);
30987 }
30988 }
30998 }
31000 /* OpenMP 2.5:
31001 # pragma omp single single-clause[optseq] new-line
31002 structured-block */
31004 #define OMP_SINGLE_CLAUSE_MASK \
31005 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31010 static tree
31012 {
31022 }
31024 /* OpenMP 3.0:
31025 # pragma omp task task-clause[optseq] new-line
31026 structured-block */
31028 #define OMP_TASK_CLAUSE_MASK \
31029 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31039 static tree
31041 {
31052 }
31054 /* OpenMP 3.0:
31055 # pragma omp taskwait new-line */
31057 static void
31059 {
31062 }
31064 /* OpenMP 3.1:
31065 # pragma omp taskyield new-line */
31067 static void
31069 {
31072 }
31074 /* OpenMP 4.0:
31075 # pragma omp taskgroup new-line
31076 structured-block */
31078 static tree
31080 {
31084 }
31087 /* OpenMP 2.5:
31088 # pragma omp threadprivate (variable-list) */
31090 static void
31092 {
31093 tree vars;
31099 }
31101 /* OpenMP 4.0:
31102 # pragma omp cancel cancel-clause[optseq] new-line */
31104 #define OMP_CANCEL_CLAUSE_MASK \
31105 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31111 static void
31113 {
31117 }
31119 /* OpenMP 4.0:
31120 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31122 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31123 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31128 static void
31130 {
31131 tree clauses;
31135 {
31140 {
31143 }
31144 }
31146 {
31150 }
31153 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31155 pragma_tok);
31157 }
31159 /* OpenMP 4.0:
31160 #pragma omp distribute distribute-clause[optseq] new-line
31161 for-loop */
31163 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31164 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31169 static tree
31172 {
31181 {
31189 else
31192 {
31198 {
31201 cclauses);
31202 else
31204 cclauses);
31205 }
31210 cclauses);
31211 else
31213 cclauses);
31225 }
31226 }
31228 {
31231 }
31236 {
31239 }
31250 }
31252 /* OpenMP 4.0:
31253 # pragma omp teams teams-clause[optseq] new-line
31254 structured-block */
31256 #define OMP_TEAMS_CLAUSE_MASK \
31257 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31265 static tree
31268 {
31277 {
31281 {
31289 cclauses);
31293 cclauses);
31304 }
31305 }
31307 {
31310 }
31315 {
31318 }
31326 }
31328 /* OpenMP 4.0:
31329 # pragma omp target data target-data-clause[optseq] new-line
31330 structured-block */
31332 #define OMP_TARGET_DATA_CLAUSE_MASK \
31333 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31337 static tree
31339 {
31351 }
31353 /* OpenMP 4.0:
31354 # pragma omp target update target-update-clause[optseq] new-line */
31356 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31357 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31362 static bool
31365 {
31367 {
31369 "%<#pragma omp target update%> may only be "
31373 }
31375 tree clauses
31380 {
31382 "%<#pragma omp target update%> must contain at least one "
31385 }
31393 }
31395 /* OpenMP 4.0:
31396 # pragma omp target target-clause[optseq] new-line
31397 structured-block */
31399 #define OMP_TARGET_CLAUSE_MASK \
31400 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31404 static bool
31407 {
31409 {
31413 }
31416 {
31421 {
31429 {
31431 OMP_TARGET_CLAUSE_MASK,
31432 cclauses);
31434 }
31450 }
31452 {
31455 }
31457 {
31461 }
31463 {
31466 }
31467 }
31481 }
31483 /* OpenACC 2.0:
31484 # pragma acc cache (variable-list) new-line
31485 */
31487 static tree
31489 {
31504 }
31506 /* OpenACC 2.0:
31507 # pragma acc data oacc-data-clause[optseq] new-line
31508 structured-block */
31510 #define OACC_DATA_CLAUSE_MASK \
31511 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31523 static tree
31525 {
31538 }
31540 /* OpenACC 2.0:
31541 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31543 or
31545 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31547 LOC is the location of the #pragma token.
31548 */
31550 #define OACC_ENTER_DATA_CLAUSE_MASK \
31551 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31559 #define OACC_EXIT_DATA_CLAUSE_MASK \
31560 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31566 static tree
31569 {
31574 {
31580 }
31585 {
31589 }
31596 else
31601 {
31605 }
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 {
33064 {
33068 }
33075 {
33078 }
33081 }
33085 {
33089 }
33095 {
33099 }
33101 /* Ignore the pragma if Cilk Plus is not enabled. */
33103 {
33106 }
33107 else
33108 {
33112 }
33119 bad_stmt:
33122 }
33126 }
33128 /* The interface the pragma parsers have to the lexer. */
33130 enum cpp_ttype
33132 {
33145 else
33146 {
33150 }
33153 }
33155 \f
33156 /* External interface. */
33158 /* Parse one entire translation unit. */
33160 void
33162 {
33175 }
33177 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33178 vectorlength clause:
33179 Syntax:
33180 vectorlength ( constant-expression ) */
33182 static tree
33185 {
33187 tree expr;
33188 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33189 safelen clause. Thus, vectorlength is represented as OMP 4.0
33190 safelen. For SIMD-enabled function it is represented by OMP 4.0
33191 simdlen. */
33194 loc);
33195 else
33197 loc);
33205 /* If expr == error_mark_node, then don't emit any errors nor
33206 create a clause. if any of the above functions returns
33207 error mark node then they would have emitted an error message. */
33209 ;
33217 else
33218 {
33219 tree c;
33221 {
33226 }
33227 else
33228 {
33233 }
33234 }
33239 }
33241 /* Handles the Cilk Plus #pragma simd linear clause.
33242 Syntax:
33243 linear ( simd-linear-variable-list )
33245 simd-linear-variable-list:
33246 simd-linear-variable
33247 simd-linear-variable-list , simd-linear-variable
33249 simd-linear-variable:
33250 id-expression
33251 id-expression : simd-linear-step
33253 simd-linear-step:
33254 conditional-expression */
33256 static tree
33258 {
33264 {
33268 }
33273 {
33276 {
33280 }
33287 {
33291 }
33292 else
33293 {
33297 /* If present, parse the linear step. Otherwise, assume the default
33298 value of 1. */
33300 {
33307 {
33308 /* If an error has occurred, then the whole pragma is
33309 considered ill-formed. Thus, no reason to keep
33310 parsing. */
33313 }
33321 else
33323 "step size must be an integer constant "
33325 }
33327 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33333 }
33338 else
33339 {
33344 }
33345 }
33349 }
33351 /* Returns the name of the next clause. If the clause is not
33352 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33353 token is not consumed. Otherwise, the appropriate enum from the
33354 pragma_simd_clause is returned and the token is consumed. */
33356 static pragma_omp_clause
33358 {
33359 pragma_omp_clause clause_type;
33376 else
33381 }
33383 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33385 static tree
33387 {
33392 {
33393 pragma_omp_clause c_kind;
33400 /* Use the OpenMP 4.0 equivalent function. */
33403 /* Use the OpenMP 4.0 equivalent function. */
33405 clauses);
33407 /* Use the OMP 4.0 equivalent function. */
33409 clauses);
33411 /* Use the OMP 4.0 equivalent function. */
33413 else
33414 {
33418 }
33419 }
33425 else
33427 }
33429 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33431 static void
33433 {
33440 {
33444 }
33453 }
33455 /* Main entry-point for parsing Cilk Plus _Cilk_for
33456 loops. The return value is error_mark_node
33457 when errors happen and CILK_FOR tree on success. */
33459 static tree
33461 {
33476 else
33482 }
33484 /* Create an identifier for a generic parameter type (a synthesized
33485 template parameter implied by `auto' or a concept identifier). */
33488 static tree
33490 {
33494 }
33496 /* Predicate that behaves as is_auto_or_concept but matches the parent
33497 node of the generic type rather than the generic type itself. This
33498 allows for type transformation in add_implicit_template_parms. */
33502 {
33504 }
33506 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33507 (creating a new template parameter list if necessary). Returns the newly
33508 created template type parm. */
33510 tree
33512 {
33515 /* We are either continuing a function template that already contains implicit
33516 template parameters, creating a new fully-implicit function template, or
33517 extending an existing explicit function template with implicit template
33518 parameters. */
33526 {
33530 }
33531 else
33532 {
33533 /* Roll back to the existing template parameter scope (in the case of
33534 extending an explicit function template) or introduce a new template
33535 parameter scope ahead of the function parameter scope (or class scope
33536 in the case of out-of-line member definitions). The function scope is
33537 added back after template parameter synthesis below. */
33542 {
33545 }
33547 {
33548 /* If not defining a class, then any class scope is a scope level in
33549 an out-of-line member definition. In this case simply wind back
33550 beyond the first such scope to inject the template parameter list.
33551 Otherwise wind back to the class being defined. The latter can
33552 occur in class member friend declarations such as:
33554 class A {
33555 void foo (auto);
33556 };
33557 class B {
33558 friend void A::foo (auto);
33559 };
33561 The template parameter list synthesized for the friend declaration
33562 must be injected in the scope of 'B'. This can also occur in
33563 erroneous cases such as:
33565 struct A {
33566 struct B {
33567 void foo (auto);
33568 };
33569 void B::foo (auto) {}
33570 };
33572 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33573 but, nevertheless, the template parameter list synthesized for the
33574 declarator should be injected into the scope of 'A' as if the
33575 ill-formed template was specified explicitly. */
33578 {
33581 }
33582 }
33588 {
33589 /* Introduce a new template parameter list for implicit template
33590 parameters. */
33594 parser->implicit_template_scope
33601 }
33602 else
33603 {
33604 /* Synthesize implicit template parameters at the end of the explicit
33605 template parameter list. */
33612 parser->implicit_template_parms
33614 }
33615 }
33617 /* Synthesize a new template parameter and track the current template
33618 parameter chain with implicit_template_parms. */
33622 synth_id);
33623 tree new_parm
33625 input_location,
33632 parser->implicit_template_parms
33634 else
33639 /* If creating a fully implicit function template, start the new implicit
33640 template parameter list with this synthesized type, otherwise grow the
33641 current template parameter list. */
33644 {
33651 }
33652 else
33653 {
33658 }
33663 }
33665 /* Finish the declaration of a fully implicit function template. Such a
33666 template has no explicit template parameter list so has not been through the
33667 normal template head and tail processing. synthesize_implicit_template_parm
33668 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33669 provided if the declaration is a class member such that its template
33670 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33671 form is returned. Otherwise NULL_TREE is returned. */
33673 tree
33675 {
33680 {
33684 }
33694 }