| blob | 98d741f440a720182ae9887936b8906f7da2da11 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
65 \f
66 /* The lexer. */
68 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
69 and c-lex.c) and the C++ parser. */
72 {
74 };
76 /* The various kinds of non integral constant we encounter. */
78 NIC_NONE,
79 /* floating-point literal */
80 NIC_FLOAT,
81 /* %<this%> */
82 NIC_THIS,
83 /* %<__FUNCTION__%> */
84 NIC_FUNC_NAME,
85 /* %<__PRETTY_FUNCTION__%> */
86 NIC_PRETTY_FUNC,
87 /* %<__func__%> */
88 NIC_C99_FUNC,
89 /* "%<va_arg%> */
90 NIC_VA_ARG,
91 /* a cast */
92 NIC_CAST,
93 /* %<typeid%> operator */
94 NIC_TYPEID,
95 /* non-constant compound literals */
96 NIC_NCC,
97 /* a function call */
98 NIC_FUNC_CALL,
99 /* an increment */
100 NIC_INC,
101 /* an decrement */
102 NIC_DEC,
103 /* an array reference */
104 NIC_ARRAY_REF,
105 /* %<->%> */
106 NIC_ARROW,
107 /* %<.%> */
108 NIC_POINT,
109 /* the address of a label */
110 NIC_ADDR_LABEL,
111 /* %<*%> */
112 NIC_STAR,
113 /* %<&%> */
114 NIC_ADDR,
115 /* %<++%> */
116 NIC_PREINCREMENT,
117 /* %<--%> */
118 NIC_PREDECREMENT,
119 /* %<new%> */
120 NIC_NEW,
121 /* %<delete%> */
122 NIC_DEL,
123 /* calls to overloaded operators */
124 NIC_OVERLOADED,
125 /* an assignment */
126 NIC_ASSIGNMENT,
127 /* a comma operator */
128 NIC_COMMA,
129 /* a call to a constructor */
130 NIC_CONSTRUCTOR,
131 /* a transaction expression */
132 NIC_TRANSACTION
135 /* The various kinds of errors about name-lookup failing. */
137 /* NULL */
138 NLE_NULL,
139 /* is not a type */
140 NLE_TYPE,
141 /* is not a class or namespace */
142 NLE_CXX98,
143 /* is not a class, namespace, or enumeration */
144 NLE_NOT_CXX98
147 /* The various kinds of required token */
149 RT_NONE,
171 /* The type is CPP_KEYWORD */
200 RT_TRANSACTION_CANCEL /* __transaction_cancel */
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static tree cp_literal_operator_id
257 static void cp_parser_cilk_simd
259 static tree cp_parser_cilk_for
261 static bool cp_parser_omp_declare_reduction_exprs
263 static tree cp_parser_cilk_simd_vectorlength
266 /* Manifest constants. */
267 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
268 #define CP_SAVED_TOKEN_STACK 5
270 /* Variables. */
272 /* The stream to which debugging output should be written. */
275 /* Nonzero if we are parsing an unevaluated operand: an operand to
276 sizeof, typeof, or alignof. */
279 /* Dump up to NUM tokens in BUFFER to FILE starting with token
280 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
281 first token in BUFFER. If NUM is 0, dump all the tokens. If
282 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
283 highlighted by surrounding it in [[ ]]. */
285 static void
289 {
306 {
309 }
314 {
321 nprinted++;
331 {
341 }
342 }
345 {
348 }
351 }
354 /* Dump all tokens in BUFFER to stderr. */
356 void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
366 }
368 DEBUG_FUNCTION void
370 {
373 else
375 }
378 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
379 description for T. */
381 static void
383 {
385 {
388 }
389 }
392 /* Dump parser context C to FILE. */
394 static void
396 {
401 }
404 /* Print the stack of parsing contexts to FILE starting with FIRST. */
406 static void
408 {
414 {
417 }
418 }
421 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
423 static void
425 {
428 }
431 /* Print an unparsed function entry UF to FILE. */
433 static void
435 {
438 tree fn;
443 i++)
444 {
450 }
455 {
458 }
464 {
467 }
469 }
472 /* Print the stack of unparsed member functions S to FILE. */
474 static void
477 {
483 {
486 }
487 }
490 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
491 the given PARSER. If FILE is NULL, the output is printed on stderr. */
493 static void
495 {
507 next_token);
508 }
511 /* Dump debugging information for the given PARSER. If FILE is NULL,
512 the output is printed on stderr. */
514 void
516 {
519 expanded_location eloc;
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* Returns nonzero if debugging information should be output. */
717 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
757 }
759 /* nonzero if we are presently saving tokens. */
763 {
765 }
767 /* Store the next token from the preprocessor in *TOKEN. Return true
768 if we reach EOF. If LEXER is NULL, assume we are handling an
769 initial #pragma pch_preprocess, and thus want the lexer to return
770 processed strings. */
772 static void
774 {
777 /* Get a new token from the preprocessor. */
778 token->type
786 /* On some systems, some header files are surrounded by an
787 implicit extern "C" block. Set a flag in the token if it
788 comes from such a header. */
793 /* Check to see if this token is a keyword. */
795 {
797 {
798 /* Mark this token as a keyword. */
800 /* Record which keyword. */
802 }
803 else
804 {
808 {
809 /* Warn about the C++0x keyword (but still treat it as
810 an identifier). */
815 /* Clear out the C_RID_CODE so we don't warn about this
816 particular identifier-turned-keyword again. */
818 }
821 }
822 }
824 {
825 /* This only happens in Objective-C++; it must be a keyword. */
828 {
829 /* Replace 'class' with '@class', 'private' with '@private',
830 etc. This prevents confusion with the C++ keyword
831 'class', and makes the tokens consistent with other
832 Objective-C 'AT' keywords. For example '@class' is
833 reported as RID_AT_CLASS which is consistent with
834 '@synchronized', which is reported as
835 RID_AT_SYNCHRONIZED.
836 */
845 }
846 }
848 {
849 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if the next token is a keyword for a decl-specifier. */
935 static bool
937 {
942 {
943 /* auto specifier: storage-class-specifier in C++,
944 simple-type-specifier in C++0x. */
946 /* Storage classes. */
952 /* Elaborated type specifiers. */
958 /* Simple type specifiers. */
972 /* GNU extensions. */
975 /* C++0x extensions. */
986 }
987 }
989 /* Returns TRUE iff the token T begins a decltype type. */
991 static bool
993 {
996 }
998 /* Returns TRUE iff the next token begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Return a pointer to the Nth token in the token stream. If N is 1,
1008 then this is precisely equivalent to cp_lexer_peek_token (except
1009 that it is not inline). One would like to disallow that case, but
1010 there is one case (cp_parser_nth_token_starts_template_id) where
1011 the caller passes a variable for N and it might be 1. */
1015 {
1018 /* N is 1-based, not zero-based. */
1029 {
1032 {
1035 }
1039 }
1042 {
1045 }
1048 }
1050 /* Return the next token, and advance the lexer's next_token pointer
1051 to point to the next non-purged token. */
1055 {
1061 do
1062 {
1065 {
1068 }
1070 }
1075 /* Provide debugging output. */
1077 {
1081 }
1084 }
1086 /* Permanently remove the next token from the token stream, and
1087 advance the next_token pointer to refer to the next non-purged
1088 token. */
1090 static void
1092 {
1101 do
1102 {
1103 tok++;
1105 {
1108 }
1109 }
1112 }
1114 /* Permanently remove all tokens after TOK, up to, but not
1115 including, the token that will be returned next by
1116 cp_lexer_peek_token. */
1118 static void
1120 {
1129 {
1134 }
1135 }
1137 /* Begin saving tokens. All tokens consumed after this point will be
1138 preserved. */
1140 static void
1142 {
1143 /* Provide debugging output. */
1148 }
1150 /* Commit to the portion of the token stream most recently saved. */
1152 static void
1154 {
1155 /* Provide debugging output. */
1160 }
1162 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1163 to the token stream. Stop saving tokens. */
1165 static void
1167 {
1168 /* Provide debugging output. */
1173 }
1175 /* RAII wrapper around the above functions, with sanity checking. Creating
1176 a variable saves tokens, which are committed when the variable is
1177 destroyed unless they are explicitly rolled back by calling the rollback
1178 member function. */
1180 struct saved_token_sentinel
1181 {
1186 {
1189 }
1191 {
1194 }
1196 {
1200 }
1201 };
1203 /* Print a representation of the TOKEN on the STREAM. */
1205 static void
1207 {
1208 /* We don't use cpp_type2name here because the parser defines
1209 a few tokens of its own. */
1211 /* cpplib-defined token types */
1212 #define OP(e, s) #e,
1213 #define TK(e, s) #e,
1214 TTYPE_TABLE
1215 #undef OP
1216 #undef TK
1217 /* C++ parser token types - see "Manifest constants", above. */
1221 };
1223 /* For some tokens, print the associated data. */
1225 {
1227 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1228 For example, `struct' is mapped to an INTEGER_CST. */
1231 /* else fall through */
1249 /* If we have a name for the token, print it out. Otherwise, we
1250 simply give the numeric code. */
1253 else
1256 }
1257 }
1259 DEBUG_FUNCTION void
1261 {
1264 }
1266 DEBUG_FUNCTION void
1268 {
1271 else
1273 }
1276 /* Start emitting debugging information. */
1278 static void
1280 {
1283 }
1285 /* Stop emitting debugging information. */
1287 static void
1289 {
1292 }
1294 /* Create a new cp_token_cache, representing a range of tokens. */
1298 {
1303 }
1305 /* Diagnose if #pragma omp declare simd isn't followed immediately
1306 by function declaration or definition. */
1310 {
1312 {
1316 }
1317 }
1319 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1320 and put that into "omp declare simd" attribute. */
1324 {
1326 {
1328 {
1331 }
1333 {
1336 }
1337 }
1338 }
1339 \f
1340 /* Decl-specifiers. */
1342 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1344 static void
1346 {
1348 }
1350 /* Declarators. */
1352 /* Nothing other than the parser should be creating declarators;
1353 declarators are a semi-syntactic representation of C++ entities.
1354 Other parts of the front end that need to create entities (like
1355 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1370 /* An erroneous declarator. */
1373 /* The obstack on which declarators and related data structures are
1374 allocated. */
1377 /* Alloc BYTES from the declarator memory pool. */
1381 {
1383 }
1385 /* Allocate a declarator of the indicated KIND. Clear fields that are
1386 common to all declarators. */
1390 {
1402 }
1404 /* Make a declarator for a generalized identifier. If
1405 QUALIFYING_SCOPE is non-NULL, the identifier is
1406 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1407 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1408 is, if any. */
1412 special_function_kind sfk)
1413 {
1416 /* It is valid to write:
1418 class C { void f(); };
1419 typedef C D;
1420 void D::f();
1422 The standard is not clear about whether `typedef const C D' is
1423 legal; as of 2002-09-15 the committee is considering that
1424 question. EDG 3.0 allows that syntax. Therefore, we do as
1425 well. */
1439 }
1441 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1442 of modifiers such as const or volatile to apply to the pointer
1443 type, represented as identifiers. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1448 tree attributes)
1449 {
1457 {
1461 }
1462 else
1468 }
1470 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1471 represent the attributes that appertain to the pointer or
1472 reference. */
1474 cp_declarator *
1477 {
1485 {
1489 }
1490 else
1496 }
1498 /* Like make_pointer_declarator -- but for a pointer to a non-static
1499 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1500 appertain to the pointer or reference. */
1502 cp_declarator *
1505 tree attributes)
1506 {
1515 {
1518 }
1519 else
1525 }
1527 /* Make a declarator for the function given by TARGET, with the
1528 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1529 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1530 indicates what exceptions can be thrown. */
1532 cp_declarator *
1534 tree parms,
1535 cp_cv_quals cv_qualifiers,
1536 cp_virt_specifiers virt_specifiers,
1537 cp_ref_qualifier ref_qualifier,
1538 tree exception_specification,
1539 tree late_return_type)
1540 {
1552 {
1556 }
1557 else
1561 }
1563 /* Make a declarator for an array of BOUNDS elements, each of which is
1564 defined by ELEMENT. */
1566 cp_declarator *
1568 {
1575 {
1579 }
1580 else
1584 }
1586 /* Determine whether the declarator we've seen so far can be a
1587 parameter pack, when followed by an ellipsis. */
1588 static bool
1590 {
1591 /* Search for a declarator name, or any other declarator that goes
1592 after the point where the ellipsis could appear in a parameter
1593 pack. If we find any of these, then this declarator can not be
1594 made into a parameter pack. */
1597 {
1599 {
1611 }
1612 }
1615 }
1619 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1620 DECLARATOR and DEFAULT_ARGUMENT. */
1622 cp_parameter_declarator *
1625 tree default_argument)
1626 {
1634 else
1641 }
1643 /* Returns true iff DECLARATOR is a declaration for a function. */
1645 static bool
1647 {
1649 {
1657 }
1659 }
1661 /* The parser. */
1663 /* Overview
1664 --------
1666 A cp_parser parses the token stream as specified by the C++
1667 grammar. Its job is purely parsing, not semantic analysis. For
1668 example, the parser breaks the token stream into declarators,
1669 expressions, statements, and other similar syntactic constructs.
1670 It does not check that the types of the expressions on either side
1671 of an assignment-statement are compatible, or that a function is
1672 not declared with a parameter of type `void'.
1674 The parser invokes routines elsewhere in the compiler to perform
1675 semantic analysis and to build up the abstract syntax tree for the
1676 code processed.
1678 The parser (and the template instantiation code, which is, in a
1679 way, a close relative of parsing) are the only parts of the
1680 compiler that should be calling push_scope and pop_scope, or
1681 related functions. The parser (and template instantiation code)
1682 keeps track of what scope is presently active; everything else
1683 should simply honor that. (The code that generates static
1684 initializers may also need to set the scope, in order to check
1685 access control correctly when emitting the initializers.)
1687 Methodology
1688 -----------
1690 The parser is of the standard recursive-descent variety. Upcoming
1691 tokens in the token stream are examined in order to determine which
1692 production to use when parsing a non-terminal. Some C++ constructs
1693 require arbitrary look ahead to disambiguate. For example, it is
1694 impossible, in the general case, to tell whether a statement is an
1695 expression or declaration without scanning the entire statement.
1696 Therefore, the parser is capable of "parsing tentatively." When the
1697 parser is not sure what construct comes next, it enters this mode.
1698 Then, while we attempt to parse the construct, the parser queues up
1699 error messages, rather than issuing them immediately, and saves the
1700 tokens it consumes. If the construct is parsed successfully, the
1701 parser "commits", i.e., it issues any queued error messages and
1702 the tokens that were being preserved are permanently discarded.
1703 If, however, the construct is not parsed successfully, the parser
1704 rolls back its state completely so that it can resume parsing using
1705 a different alternative.
1707 Future Improvements
1708 -------------------
1710 The performance of the parser could probably be improved substantially.
1711 We could often eliminate the need to parse tentatively by looking ahead
1712 a little bit. In some places, this approach might not entirely eliminate
1713 the need to parse tentatively, but it might still speed up the average
1714 case. */
1716 /* Flags that are passed to some parsing functions. These values can
1717 be bitwise-ored together. */
1719 enum
1720 {
1721 /* No flags. */
1723 /* The construct is optional. If it is not present, then no error
1724 should be issued. */
1726 /* When parsing a type-specifier, treat user-defined type-names
1727 as non-type identifiers. */
1729 /* When parsing a type-specifier, do not try to parse a class-specifier
1730 or enum-specifier. */
1732 /* When parsing a decl-specifier-seq, only allow type-specifier or
1733 constexpr. */
1735 };
1737 /* This type is used for parameters and variables which hold
1738 combinations of the above flags. */
1741 /* The different kinds of declarators we want to parse. */
1744 {
1745 /* We want an abstract declarator. */
1746 CP_PARSER_DECLARATOR_ABSTRACT,
1747 /* We want a named declarator. */
1748 CP_PARSER_DECLARATOR_NAMED,
1749 /* We don't mind, but the name must be an unqualified-id. */
1750 CP_PARSER_DECLARATOR_EITHER
1753 /* The precedence values used to parse binary expressions. The minimum value
1754 of PREC must be 1, because zero is reserved to quickly discriminate
1755 binary operators from other tokens. */
1757 enum cp_parser_prec
1758 {
1759 PREC_NOT_OPERATOR,
1760 PREC_LOGICAL_OR_EXPRESSION,
1761 PREC_LOGICAL_AND_EXPRESSION,
1762 PREC_INCLUSIVE_OR_EXPRESSION,
1763 PREC_EXCLUSIVE_OR_EXPRESSION,
1764 PREC_AND_EXPRESSION,
1765 PREC_EQUALITY_EXPRESSION,
1766 PREC_RELATIONAL_EXPRESSION,
1767 PREC_SHIFT_EXPRESSION,
1768 PREC_ADDITIVE_EXPRESSION,
1769 PREC_MULTIPLICATIVE_EXPRESSION,
1770 PREC_PM_EXPRESSION,
1771 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1772 };
1774 /* A mapping from a token type to a corresponding tree node type, with a
1775 precedence value. */
1778 {
1779 /* The token type. */
1781 /* The corresponding tree code. */
1783 /* The precedence of this operator. */
1788 {
1789 /* Left hand side of the binary operation we are currently
1790 parsing. */
1791 tree lhs;
1792 /* Original tree code for left hand side, if it was a binary
1793 expression itself (used for -Wparentheses). */
1795 /* Tree code for the binary operation we are parsing. */
1797 /* Precedence of the binary operation we are parsing. */
1799 /* Location of the binary operation we are parsing. */
1800 location_t loc;
1803 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1804 entries because precedence levels on the stack are monotonically
1805 increasing. */
1809 /* Prototypes. */
1811 /* Constructors and destructors. */
1816 /* Class variables. */
1820 /* The operator-precedence table used by cp_parser_binary_expression.
1821 Transformed into an associative array (binops_by_token) by
1822 cp_parser_new. */
1855 };
1857 /* The same as binops, but initialized by cp_parser_new so that
1858 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1859 for speed. */
1862 /* Constructors and destructors. */
1864 /* Construct a new context. The context below this one on the stack
1865 is given by NEXT. */
1869 {
1872 /* Allocate the storage. */
1874 {
1875 /* Pull the first entry from the free list. */
1879 }
1880 else
1883 /* No errors have occurred yet in this context. */
1885 /* If this is not the bottommost context, copy information that we
1886 need from the previous context. */
1888 {
1889 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1890 expression, then we are parsing one in this context, too. */
1892 /* Thread the stack. */
1894 }
1897 }
1899 /* Managing the unparsed function queues. */
1901 #define unparsed_funs_with_default_args \
1902 parser->unparsed_queues->last ().funs_with_default_args
1903 #define unparsed_funs_with_definitions \
1904 parser->unparsed_queues->last ().funs_with_definitions
1905 #define unparsed_nsdmis \
1906 parser->unparsed_queues->last ().nsdmis
1907 #define unparsed_classes \
1908 parser->unparsed_queues->last ().classes
1910 static void
1912 {
1915 }
1917 static void
1919 {
1922 }
1924 /* Prototypes. */
1926 /* Constructors and destructors. */
1931 /* Routines to parse various constructs.
1933 Those that return `tree' will return the error_mark_node (rather
1934 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1935 Sometimes, they will return an ordinary node if error-recovery was
1936 attempted, even though a parse error occurred. So, to check
1937 whether or not a parse error occurred, you should always use
1938 cp_parser_error_occurred. If the construct is optional (indicated
1939 either by an `_opt' in the name of the function that does the
1940 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1941 the construct is not present. */
1943 /* Lexical conventions [gram.lex] */
1945 static tree cp_parser_identifier
1947 static tree cp_parser_string_literal
1949 static tree cp_parser_userdef_char_literal
1951 static tree cp_parser_userdef_string_literal
1953 static tree cp_parser_userdef_numeric_literal
1956 /* Basic concepts [gram.basic] */
1958 static bool cp_parser_translation_unit
1961 /* Expressions [gram.expr] */
1963 static tree cp_parser_primary_expression
1965 static tree cp_parser_id_expression
1967 static tree cp_parser_unqualified_id
1969 static tree cp_parser_nested_name_specifier_opt
1971 static tree cp_parser_nested_name_specifier
1973 static tree cp_parser_qualifying_entity
1975 static tree cp_parser_postfix_expression
1977 static tree cp_parser_postfix_open_square_expression
1979 static tree cp_parser_postfix_dot_deref_expression
1983 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1985 static void cp_parser_pseudo_destructor_name
1987 static tree cp_parser_unary_expression
1989 static enum tree_code cp_parser_unary_operator
1991 static tree cp_parser_new_expression
1995 static tree cp_parser_new_type_id
2003 static tree cp_parser_delete_expression
2005 static tree cp_parser_cast_expression
2007 static tree cp_parser_binary_expression
2009 static tree cp_parser_question_colon_clause
2011 static tree cp_parser_assignment_expression
2013 static enum tree_code cp_parser_assignment_operator_opt
2015 static tree cp_parser_expression
2017 static tree cp_parser_constant_expression
2019 static tree cp_parser_builtin_offsetof
2021 static tree cp_parser_lambda_expression
2023 static void cp_parser_lambda_introducer
2025 static bool cp_parser_lambda_declarator_opt
2027 static void cp_parser_lambda_body
2030 /* Statements [gram.stmt.stmt] */
2032 static void cp_parser_statement
2034 static void cp_parser_label_for_labeled_statement
2036 static tree cp_parser_expression_statement
2038 static tree cp_parser_compound_statement
2040 static void cp_parser_statement_seq_opt
2042 static tree cp_parser_selection_statement
2044 static tree cp_parser_condition
2046 static tree cp_parser_iteration_statement
2048 static bool cp_parser_for_init_statement
2050 static tree cp_parser_for
2052 static tree cp_parser_c_for
2054 static tree cp_parser_range_for
2056 static void do_range_for_auto_deduction
2058 static tree cp_parser_perform_range_for_lookup
2060 static tree cp_parser_range_for_member_function
2062 static tree cp_parser_jump_statement
2064 static void cp_parser_declaration_statement
2067 static tree cp_parser_implicitly_scoped_statement
2069 static void cp_parser_already_scoped_statement
2072 /* Declarations [gram.dcl.dcl] */
2074 static void cp_parser_declaration_seq_opt
2076 static void cp_parser_declaration
2078 static void cp_parser_block_declaration
2080 static void cp_parser_simple_declaration
2082 static void cp_parser_decl_specifier_seq
2084 static tree cp_parser_storage_class_specifier_opt
2086 static tree cp_parser_function_specifier_opt
2088 static tree cp_parser_type_specifier
2091 static tree cp_parser_simple_type_specifier
2093 static tree cp_parser_type_name
2095 static tree cp_parser_nonclass_name
2097 static tree cp_parser_elaborated_type_specifier
2099 static tree cp_parser_enum_specifier
2101 static void cp_parser_enumerator_list
2103 static void cp_parser_enumerator_definition
2105 static tree cp_parser_namespace_name
2107 static void cp_parser_namespace_definition
2109 static void cp_parser_namespace_body
2111 static tree cp_parser_qualified_namespace_specifier
2113 static void cp_parser_namespace_alias_definition
2115 static bool cp_parser_using_declaration
2117 static void cp_parser_using_directive
2119 static tree cp_parser_alias_declaration
2121 static void cp_parser_asm_definition
2123 static void cp_parser_linkage_specification
2125 static void cp_parser_static_assert
2127 static tree cp_parser_decltype
2130 /* Declarators [gram.dcl.decl] */
2132 static tree cp_parser_init_declarator
2139 static enum tree_code cp_parser_ptr_operator
2141 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2143 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2145 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2147 static tree cp_parser_late_return_type_opt
2149 static tree cp_parser_declarator_id
2151 static tree cp_parser_type_id
2153 static tree cp_parser_template_type_arg
2156 static tree cp_parser_type_id_1
2158 static void cp_parser_type_specifier_seq
2160 static tree cp_parser_parameter_declaration_clause
2162 static tree cp_parser_parameter_declaration_list
2166 static tree cp_parser_default_argument
2168 static void cp_parser_function_body
2170 static tree cp_parser_initializer
2172 static tree cp_parser_initializer_clause
2174 static tree cp_parser_braced_list
2179 static bool cp_parser_ctor_initializer_opt_and_function_body
2182 static tree cp_parser_late_parsing_omp_declare_simd
2185 static tree cp_parser_late_parsing_cilk_simd_fn_info
2188 static tree synthesize_implicit_template_parm
2190 static tree finish_fully_implicit_template
2193 /* Classes [gram.class] */
2195 static tree cp_parser_class_name
2197 static tree cp_parser_class_specifier
2199 static tree cp_parser_class_head
2201 static enum tag_types cp_parser_class_key
2203 static void cp_parser_type_parameter_key
2205 static void cp_parser_member_specification_opt
2207 static void cp_parser_member_declaration
2209 static tree cp_parser_pure_specifier
2211 static tree cp_parser_constant_initializer
2214 /* Derived classes [gram.class.derived] */
2216 static tree cp_parser_base_clause
2218 static tree cp_parser_base_specifier
2221 /* Special member functions [gram.special] */
2223 static tree cp_parser_conversion_function_id
2225 static tree cp_parser_conversion_type_id
2229 static bool cp_parser_ctor_initializer_opt
2231 static void cp_parser_mem_initializer_list
2233 static tree cp_parser_mem_initializer
2235 static tree cp_parser_mem_initializer_id
2238 /* Overloading [gram.over] */
2240 static tree cp_parser_operator_function_id
2242 static tree cp_parser_operator
2245 /* Templates [gram.temp] */
2247 static void cp_parser_template_declaration
2249 static tree cp_parser_template_parameter_list
2251 static tree cp_parser_template_parameter
2253 static tree cp_parser_type_parameter
2255 static tree cp_parser_template_id
2257 static tree cp_parser_template_name
2259 static tree cp_parser_template_argument_list
2261 static tree cp_parser_template_argument
2263 static void cp_parser_explicit_instantiation
2265 static void cp_parser_explicit_specialization
2268 /* Exception handling [gram.exception] */
2270 static tree cp_parser_try_block
2272 static bool cp_parser_function_try_block
2274 static void cp_parser_handler_seq
2276 static void cp_parser_handler
2278 static tree cp_parser_exception_declaration
2280 static tree cp_parser_throw_expression
2282 static tree cp_parser_exception_specification_opt
2284 static tree cp_parser_type_id_list
2287 /* GNU Extensions */
2289 static tree cp_parser_asm_specification_opt
2291 static tree cp_parser_asm_operand_list
2293 static tree cp_parser_asm_clobber_list
2295 static tree cp_parser_asm_label_list
2297 static bool cp_next_tokens_can_be_attribute_p
2299 static bool cp_next_tokens_can_be_gnu_attribute_p
2301 static bool cp_next_tokens_can_be_std_attribute_p
2303 static bool cp_nth_tokens_can_be_std_attribute_p
2305 static bool cp_nth_tokens_can_be_gnu_attribute_p
2307 static bool cp_nth_tokens_can_be_attribute_p
2309 static tree cp_parser_attributes_opt
2311 static tree cp_parser_gnu_attributes_opt
2313 static tree cp_parser_gnu_attribute_list
2315 static tree cp_parser_std_attribute
2317 static tree cp_parser_std_attribute_spec
2319 static tree cp_parser_std_attribute_spec_seq
2321 static bool cp_parser_extension_opt
2323 static void cp_parser_label_declaration
2326 /* Transactional Memory Extensions */
2328 static tree cp_parser_transaction
2330 static tree cp_parser_transaction_expression
2332 static bool cp_parser_function_transaction
2334 static tree cp_parser_transaction_cancel
2338 pragma_external,
2339 pragma_member,
2340 pragma_objc_icode,
2341 pragma_stmt,
2342 pragma_compound
2343 };
2344 static bool cp_parser_pragma
2347 /* Objective-C++ Productions */
2349 static tree cp_parser_objc_message_receiver
2351 static tree cp_parser_objc_message_args
2353 static tree cp_parser_objc_message_expression
2355 static tree cp_parser_objc_encode_expression
2357 static tree cp_parser_objc_defs_expression
2359 static tree cp_parser_objc_protocol_expression
2361 static tree cp_parser_objc_selector_expression
2363 static tree cp_parser_objc_expression
2365 static bool cp_parser_objc_selector_p
2367 static tree cp_parser_objc_selector
2369 static tree cp_parser_objc_protocol_refs_opt
2371 static void cp_parser_objc_declaration
2373 static tree cp_parser_objc_statement
2375 static bool cp_parser_objc_valid_prefix_attributes
2377 static void cp_parser_objc_at_property_declaration
2379 static void cp_parser_objc_at_synthesize_declaration
2381 static void cp_parser_objc_at_dynamic_declaration
2383 static tree cp_parser_objc_struct_declaration
2386 /* Utility Routines */
2388 static tree cp_parser_lookup_name
2390 static tree cp_parser_lookup_name_simple
2392 static tree cp_parser_maybe_treat_template_as_class
2394 static bool cp_parser_check_declarator_template_parameters
2396 static bool cp_parser_check_template_parameters
2398 static tree cp_parser_simple_cast_expression
2400 static tree cp_parser_global_scope_opt
2402 static bool cp_parser_constructor_declarator_p
2404 static tree cp_parser_function_definition_from_specifiers_and_declarator
2406 static tree cp_parser_function_definition_after_declarator
2408 static void cp_parser_template_declaration_after_export
2410 static void cp_parser_perform_template_parameter_access_checks
2412 static tree cp_parser_single_declaration
2414 static tree cp_parser_functional_cast
2416 static tree cp_parser_save_member_function_body
2418 static tree cp_parser_save_nsdmi
2420 static tree cp_parser_enclosed_template_argument_list
2422 static void cp_parser_save_default_args
2424 static void cp_parser_late_parsing_for_member
2426 static tree cp_parser_late_parse_one_default_arg
2428 static void cp_parser_late_parsing_nsdmi
2430 static void cp_parser_late_parsing_default_args
2432 static tree cp_parser_sizeof_operand
2434 static tree cp_parser_trait_expr
2436 static bool cp_parser_declares_only_class_p
2438 static void cp_parser_set_storage_class
2440 static void cp_parser_set_decl_spec_type
2442 static void set_and_check_decl_spec_loc
2445 static bool cp_parser_friend_p
2447 static void cp_parser_required_error
2453 static bool cp_parser_token_starts_function_definition_p
2455 static bool cp_parser_next_token_starts_class_definition_p
2457 static bool cp_parser_next_token_ends_template_argument_p
2459 static bool cp_parser_nth_token_starts_template_argument_list_p
2461 static enum tag_types cp_parser_token_is_class_key
2463 static enum tag_types cp_parser_token_is_type_parameter_key
2465 static void cp_parser_check_class_key
2467 static void cp_parser_check_access_in_redeclaration
2469 static bool cp_parser_optional_template_keyword
2471 static void cp_parser_pre_parsed_nested_name_specifier
2473 static bool cp_parser_cache_group
2475 static tree cp_parser_cache_defarg
2477 static void cp_parser_parse_tentatively
2479 static void cp_parser_commit_to_tentative_parse
2481 static void cp_parser_commit_to_topmost_tentative_parse
2483 static void cp_parser_abort_tentative_parse
2485 static bool cp_parser_parse_definitely
2489 static bool cp_parser_uncommitted_to_tentative_parse_p
2491 static void cp_parser_error
2493 static void cp_parser_name_lookup_error
2495 static bool cp_parser_simulate_error
2497 static bool cp_parser_check_type_definition
2499 static void cp_parser_check_for_definition_in_return_type
2501 static void cp_parser_check_for_invalid_template_id
2503 static bool cp_parser_non_integral_constant_expression
2505 static void cp_parser_diagnose_invalid_type_name
2507 static bool cp_parser_parse_and_diagnose_invalid_type_name
2509 static int cp_parser_skip_to_closing_parenthesis
2511 static void cp_parser_skip_to_end_of_statement
2513 static void cp_parser_consume_semicolon_at_end_of_statement
2515 static void cp_parser_skip_to_end_of_block_or_statement
2517 static bool cp_parser_skip_to_closing_brace
2519 static void cp_parser_skip_to_end_of_template_parameter_list
2521 static void cp_parser_skip_to_pragma_eol
2523 static bool cp_parser_error_occurred
2525 static bool cp_parser_allow_gnu_extensions_p
2527 static bool cp_parser_is_pure_string_literal
2529 static bool cp_parser_is_string_literal
2531 static bool cp_parser_is_keyword
2533 static tree cp_parser_make_typename_type
2537 static bool cp_parser_compound_literal_p
2539 static bool cp_parser_array_designator_p
2541 static bool cp_parser_skip_to_closing_square_bracket
2544 /* Returns nonzero if we are parsing tentatively. */
2548 {
2550 }
2552 /* Returns nonzero if TOKEN is a string literal. */
2554 static bool
2556 {
2562 }
2564 /* Returns nonzero if TOKEN is a string literal
2565 of a user-defined string literal. */
2567 static bool
2569 {
2576 }
2578 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2580 static bool
2582 {
2584 }
2586 /* If not parsing tentatively, issue a diagnostic of the form
2587 FILE:LINE: MESSAGE before TOKEN
2588 where TOKEN is the next token in the input stream. MESSAGE
2589 (specified by the caller) is usually of the form "expected
2590 OTHER-TOKEN". */
2592 static void
2594 {
2596 {
2598 /* This diagnostic makes more sense if it is tagged to the line
2599 of the token we just peeked at. */
2603 {
2608 }
2611 /* Because c_parser_error does not understand
2612 CPP_KEYWORD, keywords are treated like
2613 identifiers. */
2616 }
2617 }
2619 /* Issue an error about name-lookup failing. NAME is the
2620 IDENTIFIER_NODE DECL is the result of
2621 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2622 the thing that we hoped to find. */
2624 static void
2626 tree name,
2627 tree decl,
2628 name_lookup_error desired,
2629 location_t location)
2630 {
2631 /* If name lookup completely failed, tell the user that NAME was not
2632 declared. */
2634 {
2647 else
2649 }
2651 {
2653 {
2670 }
2671 }
2673 {
2675 {
2685 name);
2689 }
2690 }
2691 else
2692 {
2694 {
2707 }
2708 }
2709 }
2711 /* If we are parsing tentatively, remember that an error has occurred
2712 during this tentative parse. Returns true if the error was
2713 simulated; false if a message should be issued by the caller. */
2715 static bool
2717 {
2719 {
2722 }
2724 }
2726 /* This function is called when a type is defined. If type
2727 definitions are forbidden at this point, an error message is
2728 issued. */
2730 static bool
2732 {
2733 /* If types are forbidden here, issue a message. */
2735 {
2736 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2737 in the message need to be interpreted. */
2740 }
2742 }
2744 /* This function is called when the DECLARATOR is processed. The TYPE
2745 was a type defined in the decl-specifiers. If it is invalid to
2746 define a type in the decl-specifiers for DECLARATOR, an error is
2747 issued. TYPE_LOCATION is the location of TYPE and is used
2748 for error reporting. */
2750 static void
2753 {
2754 /* [dcl.fct] forbids type definitions in return types.
2755 Unfortunately, it's not easy to know whether or not we are
2756 processing a return type until after the fact. */
2764 {
2769 type);
2770 }
2771 }
2773 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2774 "<" in any valid C++ program. If the next token is indeed "<",
2775 issue a message warning the user about what appears to be an
2776 invalid attempt to form a template-id. LOCATION is the location
2777 of the type-specifier (TYPE) */
2779 static void
2781 tree type,
2783 location_t location)
2784 {
2788 {
2792 {
2795 else
2797 }
2798 else
2800 /* Remember the location of the invalid "<". */
2803 /* Consume the "<". */
2805 /* Parse the template arguments. */
2807 /* Permanently remove the invalid template arguments so that
2808 this error message is not issued again. */
2811 }
2812 }
2814 /* If parsing an integral constant-expression, issue an error message
2815 about the fact that THING appeared and return true. Otherwise,
2816 return false. In either case, set
2817 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2819 static bool
2821 non_integral_constant thing)
2822 {
2825 {
2827 {
2830 {
2837 "enumeration type cannot appear in a "
2928 }
2932 }
2933 }
2935 }
2937 /* Emit a diagnostic for an invalid type name. This function commits
2938 to the current active tentative parse, if any. (Otherwise, the
2939 problematic construct might be encountered again later, resulting
2940 in duplicate error messages.) LOCATION is the location of ID. */
2942 static void
2944 location_t location)
2945 {
2948 /* Try to lookup the identifier. */
2955 /* If the lookup was ambiguous, an error will already have
2956 been issued. */
2958 /* If the lookup found a template-name, it means that the user forgot
2959 to specify an argument list. Emit a useful error message. */
2963 decl);
2967 /* Something like 'unsigned A a;' */
2970 {
2971 /* Issue an error message. */
2973 /* If we're in a template class, it's possible that the user was
2974 referring to a type from a base class. For example:
2976 template <typename T> struct A { typedef T X; };
2977 template <typename T> struct B : public A<T> { X x; };
2979 The user should have said "typename A<T>::X". */
2993 {
2994 tree b;
2997 b;
2999 {
3003 {
3004 tree field;
3005 /* Go from a particular instantiation of the
3006 template (which will have an empty TYPE_FIELDs),
3007 to the main version. */
3010 field;
3014 {
3019 }
3022 }
3023 }
3024 }
3025 }
3026 /* Here we diagnose qualified-ids where the scope is actually correct,
3027 but the identifier does not resolve to a valid type name. */
3029 {
3031 {
3036 else
3040 }
3043 {
3044 /* A<T>::A<T>() */
3050 }
3057 {
3062 else
3066 }
3067 else
3069 }
3070 }
3072 /* Check for a common situation where a type-name should be present,
3073 but is not, and issue a sensible error message. Returns true if an
3074 invalid type-name was detected.
3076 The situation handled by this function are variable declarations of the
3077 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3078 Usually, `ID' should name a type, but if we got here it means that it
3079 does not. We try to emit the best possible error message depending on
3080 how exactly the id-expression looks like. */
3082 static bool
3084 {
3085 tree id;
3088 /* Avoid duplicate error about ambiguous lookup. */
3090 {
3094 }
3103 /* If the next token is a (, this is a function with no explicit return
3104 type, i.e. constructor, destructor or conversion op. */
3107 {
3110 }
3114 /* Emit a diagnostic for the invalid type. */
3116 out:
3117 /* If we aren't in the middle of a declarator (i.e. in a
3118 parameter-declaration-clause), skip to the end of the declaration;
3119 there's no point in trying to process it. */
3123 }
3125 /* Consume tokens up to, and including, the next non-nested closing `)'.
3126 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3127 are doing error recovery. Returns -1 if OR_COMMA is true and we
3128 found an unnested comma. */
3130 static int
3135 {
3145 {
3149 {
3152 /* If we've run out of tokens, then there is no closing `)'. */
3155 /* This is good for lambda expression capture-lists. */
3165 /* This matches the processing in skip_to_end_of_statement. */
3191 {
3195 }
3200 }
3202 /* Consume the token. */
3204 }
3205 }
3207 /* Consume tokens until we reach the end of the current statement.
3208 Normally, that will be just before consuming a `;'. However, if a
3209 non-nested `}' comes first, then we stop before consuming that. */
3211 static void
3213 {
3216 /* Unwind generic function template scope if necessary. */
3221 {
3225 {
3228 /* If we've run out of tokens, stop. */
3232 /* If the next token is a `;', we have reached the end of the
3233 statement. */
3239 /* If this is a non-nested '}', stop before consuming it.
3240 That way, when confronted with something like:
3242 { 3 + }
3244 we stop before consuming the closing '}', even though we
3245 have not yet reached a `;'. */
3249 /* If it is the closing '}' for a block that we have
3250 scanned, stop -- but only after consuming the token.
3251 That way given:
3253 void f g () { ... }
3254 typedef int I;
3256 we will stop after the body of the erroneously declared
3257 function, but before consuming the following `typedef'
3258 declaration. */
3260 {
3263 }
3271 }
3273 /* Consume the token. */
3275 }
3276 }
3278 /* This function is called at the end of a statement or declaration.
3279 If the next token is a semicolon, it is consumed; otherwise, error
3280 recovery is attempted. */
3282 static void
3284 {
3285 /* Look for the trailing `;'. */
3287 {
3288 /* If there is additional (erroneous) input, skip to the end of
3289 the statement. */
3291 /* If the next token is now a `;', consume it. */
3294 }
3295 }
3297 /* Skip tokens until we have consumed an entire block, or until we
3298 have consumed a non-nested `;'. */
3300 static void
3302 {
3305 /* Unwind generic function template scope if necessary. */
3310 {
3314 {
3317 /* If we've run out of tokens, stop. */
3321 /* Stop if this is an unnested ';'. */
3327 /* Stop if this is an unnested '}', or closes the outermost
3328 nesting level. */
3329 nesting_depth--;
3337 /* Nest. */
3338 nesting_depth++;
3343 }
3345 /* Consume the token. */
3347 }
3348 }
3350 /* Skip tokens until a non-nested closing curly brace is the next
3351 token, or there are no more tokens. Return true in the first case,
3352 false otherwise. */
3354 static bool
3356 {
3360 {
3364 {
3367 /* If we've run out of tokens, stop. */
3371 /* If the next token is a non-nested `}', then we have reached
3372 the end of the current block. */
3378 /* If it the next token is a `{', then we are entering a new
3379 block. Consume the entire block. */
3385 }
3387 /* Consume the token. */
3389 }
3390 }
3392 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3393 parameter is the PRAGMA token, allowing us to purge the entire pragma
3394 sequence. */
3396 static void
3398 {
3403 do
3407 /* Ensure that the pragma is not parsed again. */
3409 }
3411 /* Require pragma end of line, resyncing with it as necessary. The
3412 arguments are as for cp_parser_skip_to_pragma_eol. */
3414 static void
3416 {
3420 }
3422 /* This is a simple wrapper around make_typename_type. When the id is
3423 an unresolved identifier node, we can provide a superior diagnostic
3424 using cp_parser_diagnose_invalid_type_name. */
3426 static tree
3428 location_t id_location)
3429 {
3430 tree result;
3432 {
3438 }
3440 }
3442 /* This is a wrapper around the
3443 make_{pointer,ptrmem,reference}_declarator functions that decides
3444 which one to call based on the CODE and CLASS_TYPE arguments. The
3445 CODE argument should be one of the values returned by
3446 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3447 appertain to the pointer or reference. */
3451 cp_cv_quals cv_qualifiers,
3453 tree attributes)
3454 {
3461 else
3471 }
3473 /* Create a new C++ parser. */
3477 {
3482 /* cp_lexer_new_main is called before doing GC allocation because
3483 cp_lexer_new_main might load a PCH file. */
3486 /* Initialize the binops_by_token so that we can get the tree
3487 directly from the token. */
3495 /* For now, we always accept GNU extensions. */
3498 /* The `>' token is a greater-than operator, not the end of a
3499 template-id. */
3504 /* We are not parsing a constant-expression. */
3509 /* Local variable names are not forbidden. */
3512 /* We are not processing an `extern "C"' declaration. */
3515 /* We are not processing a declarator. */
3518 /* We are not processing a template-argument-list. */
3521 /* We are not in an iteration statement. */
3524 /* We are not in a switch statement. */
3527 /* We are not parsing a type-id inside an expression. */
3530 /* Declarations aren't implicitly extern "C". */
3533 /* String literals should be translated to the execution character set. */
3536 /* We are not parsing a function body. */
3539 /* We can correct until told otherwise. */
3542 /* The unparsed function queue is empty. */
3545 /* There are no classes being defined. */
3548 /* No template parameters apply. */
3551 /* Not declaring an implicit function template. */
3558 }
3560 /* Create a cp_lexer structure which will emit the tokens in CACHE
3561 and push it onto the parser's lexer stack. This is used for delayed
3562 parsing of in-class method bodies and default arguments, and should
3563 not be confused with tentative parsing. */
3564 static void
3566 {
3571 /* Move the current source position to that of the first token in the
3572 new lexer. */
3574 }
3576 /* Pop the top lexer off the parser stack. This is never used for the
3577 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3578 static void
3580 {
3585 /* Put the current source position back where it was before this
3586 lexer was pushed. */
3588 }
3590 /* Lexical conventions [gram.lex] */
3592 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3593 identifier. */
3595 static tree
3597 {
3600 /* Look for the identifier. */
3602 /* Return the value. */
3604 }
3606 /* Parse a sequence of adjacent string constants. Returns a
3607 TREE_STRING representing the combined, nul-terminated string
3608 constant. If TRANSLATE is true, translate the string to the
3609 execution character set. If WIDE_OK is true, a wide string is
3610 invalid here.
3612 C++98 [lex.string] says that if a narrow string literal token is
3613 adjacent to a wide string literal token, the behavior is undefined.
3614 However, C99 6.4.5p4 says that this results in a wide string literal.
3615 We follow C99 here, for consistency with the C front end.
3617 This code is largely lifted from lex_string() in c-lex.c.
3619 FUTURE: ObjC++ will need to handle @-strings here. */
3620 static tree
3623 {
3624 tree value;
3631 tree string_tree;
3637 {
3640 }
3643 {
3647 }
3648 else
3649 {
3652 }
3655 /* Try to avoid the overhead of creating and destroying an obstack
3656 for the common case of just one string. */
3659 {
3667 {
3671 }
3672 else
3676 }
3677 else
3678 {
3682 do
3683 {
3685 count++;
3690 {
3693 {
3696 }
3699 {
3704 }
3706 }
3707 else
3711 {
3716 "unsupported non-standard concatenation "
3718 }
3724 {
3728 }
3729 else
3730 {
3734 }
3735 }
3739 }
3742 {
3745 }
3749 {
3754 {
3769 }
3774 {
3779 else
3781 }
3782 }
3783 else
3784 /* cpp_interpret_string has issued an error. */
3791 }
3793 /* Look up a literal operator with the name and the exact arguments. */
3795 static tree
3797 {
3804 {
3810 {
3813 {
3823 }
3826 /* May be this should be sufficient_parms_p instead,
3827 depending on how exactly should user-defined literals
3828 work in presence of default arguments on the literal
3829 operator parameters. */
3832 }
3833 }
3836 }
3838 /* Parse a user-defined char constant. Returns a call to a user-defined
3839 literal operator taking the character as an argument. */
3841 static tree
3843 {
3851 /* Build up a call to the user-defined operator */
3852 /* Lookup the name we got back from the id-expression. */
3857 {
3862 }
3866 }
3868 /* A subroutine of cp_parser_userdef_numeric_literal to
3869 create a char... template parameter pack from a string node. */
3871 static tree
3873 {
3874 tree charvec;
3880 /* Fill in CHARVEC with all of the parameters. */
3885 /* Build the argument packs. */
3892 }
3894 /* A subroutine of cp_parser_userdef_numeric_literal to
3895 create a char... template parameter pack from a string node. */
3897 static tree
3899 {
3900 tree charvec;
3911 /* First template parm is character type. */
3914 /* Fill in CHARVEC with all of the parameters. */
3921 /* Build the argument packs. */
3928 }
3930 /* Parse a user-defined numeric constant. returns a call to a user-defined
3931 literal operator. */
3933 static tree
3935 {
3946 /* Look for a literal operator taking the exact type of numeric argument
3947 as the literal value. */
3952 {
3954 tf_warning_or_error);
3957 {
3960 long_long_unsigned_type_node);
3961 }
3962 else
3963 {
3967 long_double_type_node);
3971 }
3975 }
3978 /* If the numeric argument didn't work, look for a raw literal
3979 operator taking a const char* argument consisting of the number
3980 in string format. */
3985 {
3987 tf_warning_or_error);
3990 }
3993 /* If the raw literal didn't work, look for a non-type template
3994 function with parameter pack char.... Call the function with
3995 template parameter characters representing the number. */
3999 {
4003 tf_warning_or_error);
4006 }
4015 }
4017 /* Parse a user-defined string constant. Returns a call to a user-defined
4018 literal operator taking a character pointer and the length of the string
4019 as arguments. */
4021 static tree
4023 {
4032 /* Build up a call to the user-defined operator. */
4033 /* Lookup the name we got back from the id-expression. */
4040 {
4042 tf_warning_or_error);
4045 }
4048 /* Look for a template function with typename parameter CharT
4049 and parameter pack CharT... Call the function with
4050 template parameter characters representing the string. */
4054 {
4058 tf_warning_or_error);
4061 }
4067 }
4070 /* Basic concepts [gram.basic] */
4072 /* Parse a translation-unit.
4074 translation-unit:
4075 declaration-seq [opt]
4077 Returns TRUE if all went well. */
4079 static bool
4081 {
4082 /* The address of the first non-permanent object on the declarator
4083 obstack. */
4088 /* Create the declarator obstack, if necessary. */
4090 {
4092 /* Create the error declarator. */
4094 /* Create the empty parameter list. */
4096 /* Remember where the base of the declarator obstack lies. */
4098 }
4102 /* If there are no tokens left then all went well. */
4104 {
4105 /* Get rid of the token array; we don't need it any more. */
4109 /* This file might have been a context that's implicitly extern
4110 "C". If so, pop the lang context. (Only relevant for PCH.) */
4112 {
4115 }
4117 /* Finish up. */
4121 }
4122 else
4123 {
4126 }
4128 /* Make sure the declarator obstack was fully cleaned up. */
4132 /* All went well. */
4134 }
4136 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4137 decltype context. */
4141 {
4146 }
4148 /* We're about to parse a collection of statements. If we're currently
4149 parsing tentatively, set up a firewall so that any nested
4150 cp_parser_commit_to_tentative_parse won't affect the current context. */
4152 static cp_token_position
4154 {
4161 }
4163 /* We've finished parsing the collection of statements. Wrap up the
4164 firewall and replace the relevant tokens with the parsed form. */
4166 static void
4168 tree expr)
4169 {
4173 /* Finish the firewall level. */
4175 /* And remember the result of the parse for when we try again. */
4181 }
4183 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4184 enclosing parentheses. */
4186 static tree
4188 {
4191 /* Consume the '('. */
4193 /* Start the statement-expression. */
4195 /* Parse the compound-statement. */
4197 /* Finish up. */
4199 /* Consume the ')'. */
4205 }
4207 /* Expressions [gram.expr] */
4209 /* Parse a primary-expression.
4211 primary-expression:
4212 literal
4213 this
4214 ( expression )
4215 id-expression
4216 lambda-expression (C++11)
4218 GNU Extensions:
4220 primary-expression:
4221 ( compound-statement )
4222 __builtin_va_arg ( assignment-expression , type-id )
4223 __builtin_offsetof ( type-id , offsetof-expression )
4225 C++ Extensions:
4226 __has_nothrow_assign ( type-id )
4227 __has_nothrow_constructor ( type-id )
4228 __has_nothrow_copy ( type-id )
4229 __has_trivial_assign ( type-id )
4230 __has_trivial_constructor ( type-id )
4231 __has_trivial_copy ( type-id )
4232 __has_trivial_destructor ( type-id )
4233 __has_virtual_destructor ( type-id )
4234 __is_abstract ( type-id )
4235 __is_base_of ( type-id , type-id )
4236 __is_class ( type-id )
4237 __is_empty ( type-id )
4238 __is_enum ( type-id )
4239 __is_final ( type-id )
4240 __is_literal_type ( type-id )
4241 __is_pod ( type-id )
4242 __is_polymorphic ( type-id )
4243 __is_std_layout ( type-id )
4244 __is_trivial ( type-id )
4245 __is_union ( type-id )
4247 Objective-C++ Extension:
4249 primary-expression:
4250 objc-expression
4252 literal:
4253 __null
4255 ADDRESS_P is true iff this expression was immediately preceded by
4256 "&" and therefore might denote a pointer-to-member. CAST_P is true
4257 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4258 true iff this expression is a template argument.
4260 Returns a representation of the expression. Upon return, *IDK
4261 indicates what kind of id-expression (if any) was present. */
4263 static tree
4270 {
4273 /* Assume the primary expression is not an id-expression. */
4276 /* Peek at the next token. */
4279 {
4280 /* literal:
4281 integer-literal
4282 character-literal
4283 floating-literal
4284 string-literal
4285 boolean-literal
4286 pointer-literal
4287 user-defined-literal */
4298 {
4302 }
4303 /* Floating-point literals are only allowed in an integral
4304 constant expression if they are cast to an integral or
4305 enumeration type. */
4309 {
4310 /* CAST_P will be set even in invalid code like "int(2.7 +
4311 ...)". Therefore, we have to check that the next token
4312 is sure to end the cast. */
4314 {
4319 enumerator-definition. */
4321 /* The curly brace at the end of an enum-specifier. */
4323 /* The end of a statement. */
4325 /* The end of the cast-expression. */
4327 /* The end of an array bound. */
4329 /* The closing ">" in a template-argument-list. */
4332 /* C++0x only: A ">>" treated like two ">" tokens,
4333 in a template-argument-list. */
4338 }
4340 /* If we are within a cast, then the constraint that the
4341 cast is to an integral or enumeration type will be
4342 checked at that point. If we are not within a cast, then
4343 this code is invalid. */
4346 }
4365 /* ??? Should wide strings be allowed when parser->translate_strings_p
4366 is false (i.e. in attributes)? If not, we can kill the third
4367 argument to cp_parser_string_literal. */
4373 /* If we see `( { ' then we are looking at the beginning of
4374 a GNU statement-expression. */
4377 {
4378 /* Statement-expressions are not allowed by the standard. */
4382 /* And they're not allowed outside of a function-body; you
4383 cannot, for example, write:
4385 int i = ({ int j = 3; j + 1; });
4387 at class or namespace scope. */
4390 {
4392 "statement-expressions are not allowed outside "
4398 }
4399 else
4401 }
4402 /* Otherwise it's a normal parenthesized expression. */
4403 {
4404 tree expr;
4407 /* Consume the `('. */
4409 /* Within a parenthesized expression, a `>' token is always
4410 the greater-than operator. */
4411 saved_greater_than_is_operator_p
4415 /* Parse the parenthesized expression. */
4417 /* Let the front end know that this expression was
4418 enclosed in parentheses. This matters in case, for
4419 example, the expression is of the form `A::B', since
4420 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4421 not. */
4423 /* DR 705: Wrapping an unqualified name in parentheses
4424 suppresses arg-dependent lookup. We want to pass back
4425 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4426 (c++/37862), but none of the others. */
4430 /* The `>' token might be the end of a template-id or
4431 template-parameter-list now. */
4432 parser->greater_than_is_operator_p
4434 /* Consume the `)'. */
4439 }
4442 {
4444 {
4445 /* We might have an Objective-C++ message. */
4448 /* If that works out, we're done ... */
4451 /* ... else, fall though to see if it's a lambda. */
4452 }
4454 /* Don't warn about a failed tentative parse. */
4459 }
4463 /* We have an Objective-C++ string literal. */
4470 {
4471 /* These two are the boolean literals. */
4479 /* The `__null' literal. */
4484 /* The `nullptr' literal. */
4489 /* Recognize the `this' keyword. */
4493 {
4497 }
4498 /* Pointers cannot appear in constant-expressions. */
4503 /* The `operator' keyword can be the beginning of an
4504 id-expression. */
4511 {
4512 non_integral_constant name;
4514 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4515 __func__ are the names of variables -- but they are
4516 treated specially. Therefore, they are handled here,
4517 rather than relying on the generic id-expression logic
4518 below. Grammatically, these names are id-expressions.
4520 Consume the token. */
4524 {
4536 }
4541 /* Look up the name. */
4543 }
4546 {
4547 tree expression;
4548 tree type;
4549 source_location type_location;
4551 /* The `__builtin_va_arg' construct is used to handle
4552 `va_arg'. Consume the `__builtin_va_arg' token. */
4554 /* Look for the opening `('. */
4556 /* Now, parse the assignment-expression. */
4558 /* Look for the `,'. */
4561 /* Parse the type-id. */
4563 /* Look for the closing `)'. */
4565 /* Using `va_arg' in a constant-expression is not
4566 allowed. */
4568 NIC_VA_ARG))
4571 }
4601 /* Objective-C++ expressions. */
4611 {
4616 }
4620 }
4622 /* An id-expression can start with either an identifier, a
4623 `::' as the beginning of a qualified-id, or the "operator"
4624 keyword. */
4629 {
4630 tree id_expression;
4631 tree decl;
4637 id_expression:
4638 /* Parse the id-expression. */
4639 id_expression
4656 /* If we have a template-id, then no further lookup is
4657 required. If the template-id was for a template-class, we
4658 will sometimes have a TYPE_DECL at this point. */
4662 /* Look up the name. */
4663 else
4664 {
4665 tree ambiguous_decls;
4667 /* If we already know that this lookup is ambiguous, then
4668 we've already issued an error message; there's no reason
4669 to check again. */
4672 {
4675 }
4678 none_type,
4679 template_p,
4684 /* If the lookup was ambiguous, an error will already have
4685 been issued. */
4689 /* In Objective-C++, we may have an Objective-C 2.0
4690 dot-syntax for classes here. */
4695 {
4696 tree component;
4703 }
4705 /* In Objective-C++, an instance variable (ivar) may be preferred
4706 to whatever cp_parser_lookup_name() found. */
4709 /* If name lookup gives us a SCOPE_REF, then the
4710 qualifying scope was dependent. */
4712 {
4713 /* At this point, we do not know if DECL is a valid
4714 integral constant expression. We assume that it is
4715 in fact such an expression, so that code like:
4717 template <int N> struct A {
4718 int a[B<N>::i];
4719 };
4721 is accepted. At template-instantiation time, we
4722 will check that B<N>::i is actually a constant. */
4724 }
4725 /* Check to see if DECL is a local variable in a context
4726 where that is forbidden. */
4729 {
4730 /* It might be that we only found DECL because we are
4731 trying to be generous with pre-ISO scoping rules.
4732 For example, consider:
4734 int i;
4735 void g() {
4736 for (int i = 0; i < 10; ++i) {}
4737 extern void f(int j = i);
4738 }
4740 Here, name look up will originally find the out
4741 of scope `i'. We need to issue a warning message,
4742 but then use the global `i'. */
4745 {
4748 decl);
4750 }
4751 }
4752 }
4754 decl = (finish_id_expression
4756 idk,
4761 template_arg_p,
4767 }
4769 /* Anything else is an error. */
4773 }
4774 }
4782 {
4785 }
4787 /* Parse an id-expression.
4789 id-expression:
4790 unqualified-id
4791 qualified-id
4793 qualified-id:
4794 :: [opt] nested-name-specifier template [opt] unqualified-id
4795 :: identifier
4796 :: operator-function-id
4797 :: template-id
4799 Return a representation of the unqualified portion of the
4800 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4801 a `::' or nested-name-specifier.
4803 Often, if the id-expression was a qualified-id, the caller will
4804 want to make a SCOPE_REF to represent the qualified-id. This
4805 function does not do this in order to avoid wastefully creating
4806 SCOPE_REFs when they are not required.
4808 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4809 `template' keyword.
4811 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4812 uninstantiated templates.
4814 If *TEMPLATE_P is non-NULL, it is set to true iff the
4815 `template' keyword is used to explicitly indicate that the entity
4816 named is a template.
4818 If DECLARATOR_P is true, the id-expression is appearing as part of
4819 a declarator, rather than as part of an expression. */
4821 static tree
4828 {
4832 /* Assume the `template' keyword was not used. */
4836 /* Look for the optional `::' operator. */
4837 global_scope_p
4840 /* Look for the optional nested-name-specifier. */
4841 nested_name_specifier_p
4844 check_dependency_p,
4846 declarator_p)
4848 /* If there is a nested-name-specifier, then we are looking at
4849 the first qualified-id production. */
4851 {
4852 tree saved_scope;
4853 tree saved_object_scope;
4854 tree saved_qualifying_scope;
4855 tree unqualified_id;
4858 /* See if the next token is the `template' keyword. */
4862 /* Name lookup we do during the processing of the
4863 unqualified-id might obliterate SCOPE. */
4867 /* Process the final unqualified-id. */
4869 check_dependency_p,
4870 declarator_p,
4872 /* Restore the SAVED_SCOPE for our caller. */
4878 }
4879 /* Otherwise, if we are in global scope, then we are looking at one
4880 of the other qualified-id productions. */
4882 {
4884 tree id;
4886 /* Peek at the next token. */
4889 /* If it's an identifier, and the next token is not a "<", then
4890 we can avoid the template-id case. This is an optimization
4891 for this common case. */
4893 && !cp_parser_nth_token_starts_template_argument_list_p
4898 /* Try a template-id. */
4902 none_type,
4903 declarator_p);
4904 /* If that worked, we're done. */
4908 /* Peek at the next token. (Changes in the token buffer may
4909 have invalidated the pointer obtained above.) */
4913 {
4920 /* Fall through. */
4925 }
4926 }
4927 else
4930 declarator_p,
4931 optional_p);
4932 }
4934 /* Parse an unqualified-id.
4936 unqualified-id:
4937 identifier
4938 operator-function-id
4939 conversion-function-id
4940 ~ class-name
4941 template-id
4943 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4944 keyword, in a construct like `A::template ...'.
4946 Returns a representation of unqualified-id. For the `identifier'
4947 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4948 production a BIT_NOT_EXPR is returned; the operand of the
4949 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4950 other productions, see the documentation accompanying the
4951 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4952 names are looked up in uninstantiated templates. If DECLARATOR_P
4953 is true, the unqualified-id is appearing as part of a declarator,
4954 rather than as part of an expression. */
4956 static tree
4962 {
4965 /* Peek at the next token. */
4969 {
4971 {
4972 tree id;
4974 /* We don't know yet whether or not this will be a
4975 template-id. */
4977 /* Try a template-id. */
4979 check_dependency_p,
4980 none_type,
4981 declarator_p);
4982 /* If it worked, we're done. */
4985 /* Otherwise, it's an ordinary identifier. */
4987 }
4991 check_dependency_p,
4992 none_type,
4993 declarator_p);
4996 {
4997 tree type_decl;
4998 tree qualifying_scope;
4999 tree object_scope;
5000 tree scope;
5003 /* Consume the `~' token. */
5005 /* Parse the class-name. The standard, as written, seems to
5006 say that:
5008 template <typename T> struct S { ~S (); };
5009 template <typename T> S<T>::~S() {}
5011 is invalid, since `~' must be followed by a class-name, but
5012 `S<T>' is dependent, and so not known to be a class.
5013 That's not right; we need to look in uninstantiated
5014 templates. A further complication arises from:
5016 template <typename T> void f(T t) {
5017 t.T::~T();
5018 }
5020 Here, it is not possible to look up `T' in the scope of `T'
5021 itself. We must look in both the current scope, and the
5022 scope of the containing complete expression.
5024 Yet another issue is:
5026 struct S {
5027 int S;
5028 ~S();
5029 };
5031 S::~S() {}
5033 The standard does not seem to say that the `S' in `~S'
5034 should refer to the type `S' and not the data member
5035 `S::S'. */
5037 /* DR 244 says that we look up the name after the "~" in the
5038 same scope as we looked up the qualifying name. That idea
5039 isn't fully worked out; it's more complicated than that. */
5044 /* Check for invalid scopes. */
5046 {
5050 }
5052 {
5056 scope);
5061 }
5064 /* If the name is of the form "X::~X" it's OK even if X is a
5065 typedef. */
5074 {
5077 }
5079 /* ~auto means the destructor of whatever the object is. */
5081 {
5084 "%<~auto%> only available with "
5088 }
5090 /* If there was an explicit qualification (S::~T), first look
5091 in the scope given by the qualification (i.e., S).
5093 Note: in the calls to cp_parser_class_name below we pass
5094 typename_type so that lookup finds the injected-class-name
5095 rather than the constructor. */
5099 {
5104 typename_type,
5107 declarator_p);
5110 }
5111 /* In "N::S::~S", look in "N" as well. */
5113 {
5118 type_decl
5122 typename_type,
5125 declarator_p);
5128 }
5129 /* In "p->S::~T", look in the scope given by "*p" as well. */
5131 {
5136 type_decl
5140 typename_type,
5143 declarator_p);
5146 }
5147 /* Look in the surrounding context. */
5149 {
5155 type_decl
5159 typename_type,
5162 declarator_p);
5165 {
5166 /* We couldn't find a type with this name, so just accept
5167 it and check for a match at instantiation time. */
5172 }
5173 }
5174 /* If an error occurred, assume that the name of the
5175 destructor is the same as the name of the qualifying
5176 class. That allows us to keep parsing after running
5177 into ill-formed destructor names. */
5183 /* Check that destructor name and scope match. */
5185 {
5192 }
5194 /* [class.dtor]
5196 A typedef-name that names a class shall not be used as the
5197 identifier in the declarator for a destructor declaration. */
5204 type_decl);
5207 }
5211 {
5212 tree id;
5214 /* This could be a template-id, so we try that first. */
5216 /* Try a template-id. */
5219 none_type,
5220 declarator_p);
5221 /* If that worked, we're done. */
5224 /* We still don't know whether we're looking at an
5225 operator-function-id or a conversion-function-id. */
5227 /* Try an operator-function-id. */
5229 /* If that didn't work, try a conversion-function-id. */
5233 {
5234 /* 17.6.3.3.5 */
5240 }
5243 }
5244 /* Fall through. */
5251 }
5252 }
5254 /* Parse an (optional) nested-name-specifier.
5256 nested-name-specifier: [C++98]
5257 class-or-namespace-name :: nested-name-specifier [opt]
5258 class-or-namespace-name :: template nested-name-specifier [opt]
5260 nested-name-specifier: [C++0x]
5261 type-name ::
5262 namespace-name ::
5263 nested-name-specifier identifier ::
5264 nested-name-specifier template [opt] simple-template-id ::
5266 PARSER->SCOPE should be set appropriately before this function is
5267 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5268 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5269 in name lookups.
5271 Sets PARSER->SCOPE to the class (TYPE) or namespace
5272 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5273 it unchanged if there is no nested-name-specifier. Returns the new
5274 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5276 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5277 part of a declaration and/or decl-specifier. */
5279 static tree
5285 {
5290 /* Remember where the nested-name-specifier starts. */
5292 {
5295 }
5298 {
5299 tree new_scope;
5300 tree old_scope;
5301 tree saved_qualifying_scope;
5304 /* Spot cases that cannot be the beginning of a
5305 nested-name-specifier. */
5308 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5309 the already parsed nested-name-specifier. */
5311 {
5312 /* Grab the nested-name-specifier and continue the loop. */
5314 /* If we originally encountered this nested-name-specifier
5315 with IS_DECLARATION set to false, we will not have
5316 resolved TYPENAME_TYPEs, so we must do so here. */
5319 {
5324 }
5327 }
5329 /* Spot cases that cannot be the beginning of a
5330 nested-name-specifier. On the second and subsequent times
5331 through the loop, we look for the `template' keyword. */
5333 ;
5334 /* A template-id can start a nested-name-specifier. */
5336 ;
5337 /* DR 743: decltype can be used in a nested-name-specifier. */
5339 ;
5340 else
5341 {
5342 /* If the next token is not an identifier, then it is
5343 definitely not a type-name or namespace-name. */
5346 /* If the following token is neither a `<' (to begin a
5347 template-id), nor a `::', then we are not looking at a
5348 nested-name-specifier. */
5354 {
5358 }
5361 && !cp_parser_nth_token_starts_template_argument_list_p
5364 }
5366 /* The nested-name-specifier is optional, so we parse
5367 tentatively. */
5370 /* Look for the optional `template' keyword, if this isn't the
5371 first time through the loop. */
5374 else
5377 /* Save the old scope since the name lookup we are about to do
5378 might destroy it. */
5381 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5382 look up names in "X<T>::I" in order to determine that "Y" is
5383 a template. So, if we have a typename at this point, we make
5384 an effort to look through it. */
5386 && !typename_keyword_p
5391 /* Parse the qualifying entity. */
5392 new_scope
5394 typename_keyword_p,
5395 template_keyword_p,
5396 check_dependency_p,
5397 type_p,
5398 is_declaration);
5399 /* Look for the `::' token. */
5402 /* If we found what we wanted, we keep going; otherwise, we're
5403 done. */
5405 {
5408 /* Restore the OLD_SCOPE since it was valid before the
5409 failed attempt at finding the last
5410 class-or-namespace-name. */
5414 /* If the next token is a decltype, and the one after that is a
5415 `::', then the decltype has failed to resolve to a class or
5416 enumeration type. Give this error even when parsing
5417 tentatively since it can't possibly be valid--and we're going
5418 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5419 won't get another chance.*/
5423 {
5430 /* As below. */
5433 }
5437 {
5438 /* If we have a non-type template-id followed by ::, it can't
5439 possibly be valid. */
5444 {
5447 {
5453 }
5454 else
5455 {
5456 /* Variable template. */
5461 }
5468 /* As below. */
5472 }
5473 }
5477 /* If the next token is an identifier, and the one after
5478 that is a `::', then any valid interpretation would have
5479 found a class-or-namespace-name. */
5485 {
5488 {
5490 {
5491 tree decl;
5492 tree ambiguous_decls;
5495 none_type,
5504 decl);
5506 {
5507 // cp_parser_lookup_name has the same diagnostic,
5508 // thus make sure to emit it at most once.
5511 {
5516 }
5518 }
5519 else
5520 {
5522 cp_parser_name_lookup_error
5525 else
5526 cp_parser_name_lookup_error
5529 }
5530 }
5533 /* Treat this as a successful nested-name-specifier
5534 due to:
5536 [basic.lookup.qual]
5538 If the name found is not a class-name (clause
5539 _class_) or namespace-name (_namespace.def_), the
5540 program is ill-formed. */
5542 }
5544 }
5546 }
5547 /* We've found one valid nested-name-specifier. */
5549 /* Name lookup always gives us a DECL. */
5552 /* Uses of "template" must be followed by actual templates. */
5564 new_scope);
5565 /* If it is a class scope, try to complete it; we are about to
5566 be looking up names inside the class. */
5568 /* Since checking types for dependency can be expensive,
5569 avoid doing it if the type is already complete. */
5571 /* Do not try to complete dependent types. */
5573 {
5575 /* If it is a typedef to current class, use the current
5576 class instead, as the typedef won't have any names inside
5577 it yet. */
5581 }
5582 /* Make sure we look in the right scope the next time through
5583 the loop. */
5585 }
5587 /* If parsing tentatively, replace the sequence of tokens that makes
5588 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5589 token. That way, should we re-parse the token stream, we will
5590 not have to repeat the effort required to do the parse, nor will
5591 we issue duplicate error messages. */
5593 {
5597 /* Reset the contents of the START token. */
5599 /* Retrieve any deferred checks. Do not pop this access checks yet
5600 so the memory will not be reclaimed during token replacing below. */
5608 /* Purge all subsequent tokens. */
5610 }
5616 }
5618 /* Parse a nested-name-specifier. See
5619 cp_parser_nested_name_specifier_opt for details. This function
5620 behaves identically, except that it will an issue an error if no
5621 nested-name-specifier is present. */
5623 static tree
5629 {
5630 tree scope;
5632 /* Look for the nested-name-specifier. */
5634 typename_keyword_p,
5635 check_dependency_p,
5636 type_p,
5637 is_declaration);
5638 /* If it was not present, issue an error message. */
5640 {
5643 }
5646 }
5648 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5649 this is either a class-name or a namespace-name (which corresponds
5650 to the class-or-namespace-name production in the grammar). For
5651 C++0x, it can also be a type-name that refers to an enumeration
5652 type or a simple-template-id.
5654 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5655 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5656 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5657 TYPE_P is TRUE iff the next name should be taken as a class-name,
5658 even the same name is declared to be another entity in the same
5659 scope.
5661 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5662 specified by the class-or-namespace-name. If neither is found the
5663 ERROR_MARK_NODE is returned. */
5665 static tree
5672 {
5673 tree saved_scope;
5674 tree saved_qualifying_scope;
5675 tree saved_object_scope;
5676 tree scope;
5680 /* DR 743: decltype can appear in a nested-name-specifier. */
5682 {
5686 {
5689 }
5693 }
5695 /* Before we try to parse the class-name, we must save away the
5696 current PARSER->SCOPE since cp_parser_class_name will destroy
5697 it. */
5701 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5702 there is no need to look for a namespace-name. */
5703 only_class_p = template_keyword_p
5708 typename_keyword_p,
5709 template_keyword_p,
5711 check_dependency_p,
5713 is_declaration);
5715 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5719 {
5720 /* Restore the saved scope. */
5725 /* Parse tentatively. */
5728 /* Parse a type-name */
5731 /* "If the name found does not designate a namespace or a class,
5732 enumeration, or dependent type, the program is ill-formed."
5734 We cover classes and dependent types above and namespaces below,
5735 so this code is only looking for enums. */
5741 }
5742 /* If that didn't work, try for a namespace-name. */
5744 {
5745 /* Restore the saved scope. */
5749 /* If we are not looking at an identifier followed by the scope
5750 resolution operator, then this is not part of a
5751 nested-name-specifier. (Note that this function is only used
5752 to parse the components of a nested-name-specifier.) */
5757 }
5760 }
5762 /* Return true if we are looking at a compound-literal, false otherwise. */
5764 static bool
5766 {
5767 /* Consume the `('. */
5772 /* Skip tokens until the next token is a closing parenthesis.
5773 If we find the closing `)', and the next token is a `{', then
5774 we are looking at a compound-literal. */
5775 bool compound_literal_p
5780 /* Roll back the tokens we skipped. */
5784 }
5786 /* Parse a postfix-expression.
5788 postfix-expression:
5789 primary-expression
5790 postfix-expression [ expression ]
5791 postfix-expression ( expression-list [opt] )
5792 simple-type-specifier ( expression-list [opt] )
5793 typename :: [opt] nested-name-specifier identifier
5794 ( expression-list [opt] )
5795 typename :: [opt] nested-name-specifier template [opt] template-id
5796 ( expression-list [opt] )
5797 postfix-expression . template [opt] id-expression
5798 postfix-expression -> template [opt] id-expression
5799 postfix-expression . pseudo-destructor-name
5800 postfix-expression -> pseudo-destructor-name
5801 postfix-expression ++
5802 postfix-expression --
5803 dynamic_cast < type-id > ( expression )
5804 static_cast < type-id > ( expression )
5805 reinterpret_cast < type-id > ( expression )
5806 const_cast < type-id > ( expression )
5807 typeid ( expression )
5808 typeid ( type-id )
5810 GNU Extension:
5812 postfix-expression:
5813 ( type-id ) { initializer-list , [opt] }
5815 This extension is a GNU version of the C99 compound-literal
5816 construct. (The C99 grammar uses `type-name' instead of `type-id',
5817 but they are essentially the same concept.)
5819 If ADDRESS_P is true, the postfix expression is the operand of the
5820 `&' operator. CAST_P is true if this expression is the target of a
5821 cast.
5823 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5824 class member access expressions [expr.ref].
5826 Returns a representation of the expression. */
5828 static tree
5832 {
5834 location_t loc;
5841 /* Peek at the next token. */
5844 /* Some of the productions are determined by keywords. */
5847 {
5852 {
5853 tree type;
5854 tree expression;
5858 /* All of these can be handled in the same way from the point
5859 of view of parsing. Begin by consuming the token
5860 identifying the cast. */
5863 /* New types cannot be defined in the cast. */
5865 parser->type_definition_forbidden_message
5868 /* Look for the opening `<'. */
5870 /* Parse the type to which we are casting. */
5875 /* Look for the closing `>'. */
5877 /* Restore the old message. */
5880 bool saved_greater_than_is_operator_p
5884 /* And the expression which is being cast. */
5889 parser->greater_than_is_operator_p
5892 /* Only type conversions to integral or enumeration types
5893 can be used in constant-expressions. */
5899 {
5901 postfix_expression
5905 postfix_expression
5909 postfix_expression
5911 tf_warning_or_error);
5914 postfix_expression
5919 }
5920 }
5924 {
5925 tree type;
5929 /* Consume the `typeid' token. */
5931 /* Look for the `(' token. */
5933 /* Types cannot be defined in a `typeid' expression. */
5935 parser->type_definition_forbidden_message
5937 /* We can't be sure yet whether we're looking at a type-id or an
5938 expression. */
5940 /* Try a type-id first. */
5945 /* Look for the `)' token. Otherwise, we can't be sure that
5946 we're not looking at an expression: consider `typeid (int
5947 (3))', for example. */
5949 /* If all went well, simply lookup the type-id. */
5952 /* Otherwise, fall back to the expression variant. */
5953 else
5954 {
5955 tree expression;
5957 /* Look for an expression. */
5959 /* Compute its typeid. */
5961 /* Look for the `)' token. */
5963 }
5964 /* Restore the saved message. */
5966 /* `typeid' may not appear in an integral constant expression. */
5969 }
5973 {
5974 tree type;
5975 /* The syntax permitted here is the same permitted for an
5976 elaborated-type-specifier. */
5981 }
5985 {
5989 {
5994 }
5996 {
6001 }
6002 else
6003 {
6004 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6007 }
6009 postfix_expression =
6013 {
6017 }
6019 {
6024 }
6025 else
6026 {
6028 postfix_expression);
6032 }
6034 }
6037 {
6040 tree p;
6054 tf_warning_or_error);
6057 tf_warning_or_error);
6058 else
6059 {
6063 }
6065 }
6068 {
6069 tree type;
6071 /* If the next thing is a simple-type-specifier, we may be
6072 looking at a functional cast. We could also be looking at
6073 an id-expression. So, we try the functional cast, and if
6074 that doesn't work we fall back to the primary-expression. */
6076 /* Look for the simple-type-specifier. */
6079 CP_PARSER_FLAGS_NONE);
6080 /* Parse the cast itself. */
6082 postfix_expression
6084 /* If that worked, we're done. */
6088 /* If the functional-cast didn't work out, try a
6089 compound-literal. */
6092 {
6097 /* Avoid calling cp_parser_type_id pointlessly, see comment
6098 in cp_parser_cast_expression about c++/29234. */
6101 else
6102 {
6103 /* Parse the type. */
6108 /* Look for the `)'. */
6110 }
6112 /* If things aren't going well, there's no need to
6113 keep going. */
6115 {
6117 /* Parse the brace-enclosed initializer list. */
6120 }
6121 /* If that worked, we're definitely looking at a
6122 compound-literal expression. */
6124 {
6125 /* Warn the user that a compound literal is not
6126 allowed in standard C++. */
6129 /* For simplicity, we disallow compound literals in
6130 constant-expressions. We could
6131 allow compound literals of integer type, whose
6132 initializer was a constant, in constant
6133 expressions. Permitting that usage, as a further
6134 extension, would not change the meaning of any
6135 currently accepted programs. (Of course, as
6136 compound literals are not part of ISO C++, the
6137 standard has nothing to say.) */
6139 NIC_NCC))
6140 {
6143 }
6144 /* Form the representation of the compound-literal. */
6145 postfix_expression
6147 tf_warning_or_error);
6149 }
6150 }
6152 /* It must be a primary-expression. */
6153 postfix_expression
6156 decltype_p,
6158 }
6160 }
6162 /* Note that we don't need to worry about calling build_cplus_new on a
6163 class-valued CALL_EXPR in decltype when it isn't the end of the
6164 postfix-expression; unary_complex_lvalue will take care of that for
6165 all these cases. */
6167 /* Keep looping until the postfix-expression is complete. */
6169 {
6173 /* It is not a Koenig lookup function call. */
6174 postfix_expression
6177 /* Peek at the next token. */
6181 {
6184 {
6186 "two consecutive %<[%> shall "
6189 }
6190 postfix_expression
6192 postfix_expression,
6194 decltype_p);
6200 /* postfix-expression ( expression-list [opt] ) */
6201 {
6211 is_builtin_constant_p
6214 {
6215 /* The whole point of __builtin_constant_p is to allow
6216 non-constant expressions to appear as arguments. */
6217 saved_integral_constant_expression_p
6219 saved_non_integral_constant_expression_p
6222 }
6223 args = (cp_parser_parenthesized_expression_list
6229 {
6230 parser->integral_constant_expression_p
6232 parser->non_integral_constant_expression_p
6234 }
6237 {
6240 }
6242 /* Function calls are not permitted in
6243 constant-expressions. */
6246 NIC_FUNC_CALL))
6247 {
6251 }
6256 {
6258 {
6260 {
6263 postfix_expression
6265 complain);
6266 }
6267 else
6268 postfix_expression
6270 }
6271 /* We do not perform argument-dependent lookup if
6272 normal lookup finds a non-function, in accordance
6273 with the expected resolution of DR 218. */
6276 {
6280 /* Do not do argument dependent lookup if regular
6281 lookup finds a member function or a block-scope
6282 function declaration. [basic.lookup.argdep]/3 */
6285 {
6288 postfix_expression
6290 complain);
6291 }
6292 }
6293 }
6296 {
6306 "%<memset%> used with constant zero length "
6307 "parameter; this could be due to transposed "
6310 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6311 to avoid leaking those into folder and middle-end. */
6313 tree arg;
6317 }
6320 {
6330 {
6331 postfix_expression
6335 }
6338 {
6339 postfix_expression
6340 = (build_new_method_call
6346 complain));
6347 }
6348 else
6349 postfix_expression
6353 complain);
6354 }
6358 postfix_expression = (build_offset_ref_call_from_tree
6360 complain));
6362 /* A call to a static class member, or a namespace-scope
6363 function. */
6364 postfix_expression
6367 koenig_p,
6368 complain);
6369 else
6370 /* All other function calls. */
6371 postfix_expression
6374 koenig_p,
6375 complain);
6379 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6383 }
6388 /* postfix-expression . template [opt] id-expression
6389 postfix-expression . pseudo-destructor-name
6390 postfix-expression -> template [opt] id-expression
6391 postfix-expression -> pseudo-destructor-name */
6393 /* Consume the `.' or `->' operator. */
6396 postfix_expression
6398 postfix_expression,
6405 /* postfix-expression ++ */
6406 /* Consume the `++' token. */
6408 /* Generate a representation for the complete expression. */
6409 postfix_expression
6411 POSTINCREMENT_EXPR);
6412 /* Increments may not appear in constant-expressions. */
6420 /* postfix-expression -- */
6421 /* Consume the `--' token. */
6423 /* Generate a representation for the complete expression. */
6424 postfix_expression
6426 POSTDECREMENT_EXPR);
6427 /* Decrements may not appear in constant-expressions. */
6439 else
6441 }
6442 }
6444 /* We should never get here. */
6447 }
6449 /* This function parses Cilk Plus array notations. If a normal array expr. is
6450 parsed then the array index is passed back to the caller through *INIT_INDEX
6451 and the function returns a NULL_TREE. If array notation expr. is parsed,
6452 then *INIT_INDEX is ignored by the caller and the function returns
6453 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6454 error_mark_node. */
6456 static tree
6458 tree array_value)
6459 {
6463 {
6466 }
6475 {
6478 }
6480 {
6481 /* Consume the ':'. */
6484 /* If we are here, then we have a case like this A[:]. */
6486 {
6490 }
6494 }
6495 else
6496 {
6497 /* If we are here, then there are three valid possibilities:
6498 1. ARRAY [ EXP ]
6499 2. ARRAY [ EXP : EXP ]
6500 3. ARRAY [ EXP : EXP : EXP ] */
6504 {
6505 /* This indicates that we have a normal array expression. */
6508 }
6510 /* Consume the ':'. */
6514 {
6517 }
6518 }
6523 {
6527 }
6533 }
6535 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6536 by cp_parser_builtin_offsetof. We're looking for
6538 postfix-expression [ expression ]
6539 postfix-expression [ braced-init-list ] (C++11)
6541 FOR_OFFSETOF is set if we're being called in that context, which
6542 changes how we deal with integer constant expressions. */
6544 static tree
6546 tree postfix_expression,
6549 {
6554 /* Consume the `[' token. */
6560 /* Parse the index expression. */
6561 /* ??? For offsetof, there is a question of what to allow here. If
6562 offsetof is not being used in an integral constant expression context,
6563 then we *could* get the right answer by computing the value at runtime.
6564 If we are in an integral constant expression context, then we might
6565 could accept any constant expression; hard to say without analysis.
6566 Rather than open the barn door too wide right away, allow only integer
6567 constant expressions here. */
6570 else
6571 {
6573 {
6580 {
6582 "braced list index is not allowed with array "
6586 }
6587 }
6589 {
6590 /* Here are have these two options:
6591 ARRAY[EXP : EXP] - Array notation expr with default
6592 stride of 1.
6593 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6594 stride. */
6596 postfix_expression);
6599 }
6600 else
6602 }
6606 /* Look for the closing `]'. */
6609 /* Build the ARRAY_REF. */
6613 /* When not doing offsetof, array references are not permitted in
6614 constant-expressions. */
6620 }
6622 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6623 by cp_parser_builtin_offsetof. We're looking for
6625 postfix-expression . template [opt] id-expression
6626 postfix-expression . pseudo-destructor-name
6627 postfix-expression -> template [opt] id-expression
6628 postfix-expression -> pseudo-destructor-name
6630 FOR_OFFSETOF is set if we're being called in that context. That sorta
6631 limits what of the above we'll actually accept, but nevermind.
6632 TOKEN_TYPE is the "." or "->" token, which will already have been
6633 removed from the stream. */
6635 static tree
6638 tree postfix_expression,
6640 location_t location)
6641 {
6642 tree name;
6647 /* If this is a `->' operator, dereference the pointer. */
6650 tf_warning_or_error);
6651 /* Check to see whether or not the expression is type-dependent. */
6653 /* The identifier following the `->' or `.' is not qualified. */
6659 /* Enter the scope corresponding to the type of the object
6660 given by the POSTFIX_EXPRESSION. */
6662 {
6664 /* According to the standard, no expression should ever have
6665 reference type. Unfortunately, we do not currently match
6666 the standard in this respect in that our internal representation
6667 of an expression may have reference type even when the standard
6668 says it does not. Therefore, we have to manually obtain the
6669 underlying type here. */
6671 /* The type of the POSTFIX_EXPRESSION must be complete. */
6673 {
6675 postfix_expression);
6677 }
6678 /* Unlike the object expression in other contexts, *this is not
6679 required to be of complete type for purposes of class member
6680 access (5.2.5) outside the member function body. */
6684 /* Let the name lookup machinery know that we are processing a
6685 class member access expression. */
6687 /* If something went wrong, we want to be able to discern that case,
6688 as opposed to the case where there was no SCOPE due to the type
6689 of expression being dependent. */
6692 /* If the SCOPE was erroneous, make the various semantic analysis
6693 functions exit quickly -- and without issuing additional error
6694 messages. */
6697 }
6699 /* Assume this expression is not a pseudo-destructor access. */
6702 /* If the SCOPE is a scalar type, then, if this is a valid program,
6703 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6704 is type dependent, it can be pseudo-destructor-name or something else.
6705 Try to parse it as pseudo-destructor-name first. */
6707 {
6708 tree s;
6709 tree type;
6712 /* Parse the pseudo-destructor-name. */
6721 {
6723 postfix_expression
6726 }
6727 }
6730 {
6731 /* If the SCOPE is not a scalar type, we are looking at an
6732 ordinary class member access expression, rather than a
6733 pseudo-destructor-name. */
6736 /* Parse the id-expression. */
6737 name = (cp_parser_id_expression
6744 /* In general, build a SCOPE_REF if the member name is qualified.
6745 However, if the name was not dependent and has already been
6746 resolved; there is no need to build the SCOPE_REF. For example;
6748 struct X { void f(); };
6749 template <typename T> void f(T* t) { t->X::f(); }
6751 Even though "t" is dependent, "X::f" is not and has been resolved
6752 to a BASELINK; there is no need to include scope information. */
6754 /* But we do need to remember that there was an explicit scope for
6755 virtual function calls. */
6759 /* If the name is a template-id that names a type, we will get a
6760 TYPE_DECL here. That is invalid code. */
6762 {
6765 }
6766 else
6767 {
6769 {
6771 {
6775 }
6776 else
6779 name,
6780 template_p);
6784 }
6786 adjust_result_of_qualified_name_lookup
6788 postfix_expression
6790 template_p,
6791 tf_warning_or_error);
6792 }
6793 }
6795 /* We no longer need to look up names in the scope of the object on
6796 the left-hand side of the `.' or `->' operator. */
6799 /* Outside of offsetof, these operators may not appear in
6800 constant-expressions. */
6802 && (cp_parser_non_integral_constant_expression
6807 }
6809 /* Cache of LITERAL_ZERO_P constants. */
6813 /* Parse a parenthesized expression-list.
6815 expression-list:
6816 assignment-expression
6817 expression-list, assignment-expression
6819 attribute-list:
6820 expression-list
6821 identifier
6822 identifier, expression-list
6824 CAST_P is true if this expression is the target of a cast.
6826 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6827 argument pack.
6829 Returns a vector of trees. Each element is a representation of an
6830 assignment-expression. NULL is returned if the ( and or ) are
6831 missing. An empty, but allocated, vector is returned on no
6832 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6833 if we are parsing an attribute list for an attribute that wants a
6834 plain identifier argument, normal_attr for an attribute that wants
6835 an expression, or non_attr if we aren't parsing an attribute list. If
6836 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6837 not all of the expressions in the list were constant.
6838 WANT_LITERAL_ZERO_P is true if the caller is interested in
6839 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6840 immediately, this can be removed. */
6849 {
6855 /* Assume all the expressions will be constant. */
6864 /* Within a parenthesized expression, a `>' token is always
6865 the greater-than operator. */
6866 saved_greater_than_is_operator_p
6870 /* Consume expressions until there are no more. */
6873 {
6874 tree expr;
6876 /* At the beginning of attribute lists, check to see if the
6877 next token is an identifier. */
6880 {
6883 /* Consume the identifier. */
6885 /* Save the identifier. */
6887 }
6888 else
6889 {
6892 /* Parse the next assignment-expression. */
6894 {
6895 /* A braced-init-list. */
6901 }
6903 {
6904 expr = (cp_parser_constant_expression
6909 }
6910 else
6911 {
6915 {
6921 /* If a parameter is literal zero alone, remember it
6922 for -Wmemset-transposed-args warning. */
6925 && want_literal_zero_p
6927 == CPP_COMMA
6930 {
6937 else
6938 {
6943 }
6944 /* Consume the 0 token (or '\0', 0LL etc.). */
6946 }
6950 }
6953 cast_p);
6954 }
6959 /* If we have an ellipsis, then this is an expression
6960 expansion. */
6963 {
6964 /* Consume the `...'. */
6967 /* Build the argument pack. */
6969 }
6971 /* Add it to the list. We add error_mark_node
6972 expressions to the list, so that we can still tell if
6973 the correct form for a parenthesized expression-list
6974 is found. That gives better errors. */
6979 }
6981 /* After the first item, attribute lists look the same as
6982 expression lists. */
6985 get_comma:;
6986 /* If the next token isn't a `,', then we are done. */
6990 /* Otherwise, consume the `,' and keep going. */
6992 }
6995 {
6998 skip_comma:;
6999 /* We try and resync to an unnested comma, as that will give the
7000 user better diagnostics. */
7008 {
7009 parser->greater_than_is_operator_p
7012 }
7013 }
7015 parser->greater_than_is_operator_p
7022 }
7024 /* Parse a pseudo-destructor-name.
7026 pseudo-destructor-name:
7027 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7028 :: [opt] nested-name-specifier template template-id :: ~ type-name
7029 :: [opt] nested-name-specifier [opt] ~ type-name
7031 If either of the first two productions is used, sets *SCOPE to the
7032 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7033 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7034 or ERROR_MARK_NODE if the parse fails. */
7036 static void
7038 tree object,
7041 {
7044 /* Handle ~auto. */
7048 {
7051 "%<~auto%> only available with "
7058 }
7060 /* Assume that things will not work out. */
7063 /* Look for the optional `::' operator. */
7065 /* Look for the optional nested-name-specifier. */
7066 nested_name_specifier_p
7073 /* Now, if we saw a nested-name-specifier, we might be doing the
7074 second production. */
7077 {
7078 /* Consume the `template' keyword. */
7080 /* Parse the template-id. */
7084 class_type,
7086 /* Look for the `::' token. */
7088 }
7089 /* If the next token is not a `~', then there might be some
7090 additional qualification. */
7092 {
7093 /* At this point, we're looking for "type-name :: ~". The type-name
7094 must not be a class-name, since this is a pseudo-destructor. So,
7095 it must be either an enum-name, or a typedef-name -- both of which
7096 are just identifiers. So, we peek ahead to check that the "::"
7097 and "~" tokens are present; if they are not, then we can avoid
7098 calling type_name. */
7102 {
7105 }
7107 /* Look for the type-name. */
7112 /* Look for the `::' token. */
7114 }
7115 else
7118 /* Look for the `~'. */
7121 /* Once we see the ~, this has to be a pseudo-destructor. */
7125 /* Look for the type-name again. We are not responsible for
7126 checking that it matches the first type-name. */
7128 }
7130 /* Parse a unary-expression.
7132 unary-expression:
7133 postfix-expression
7134 ++ cast-expression
7135 -- cast-expression
7136 unary-operator cast-expression
7137 sizeof unary-expression
7138 sizeof ( type-id )
7139 alignof ( type-id ) [C++0x]
7140 new-expression
7141 delete-expression
7143 GNU Extensions:
7145 unary-expression:
7146 __extension__ cast-expression
7147 __alignof__ unary-expression
7148 __alignof__ ( type-id )
7149 alignof unary-expression [C++0x]
7150 __real__ cast-expression
7151 __imag__ cast-expression
7152 && identifier
7153 sizeof ( type-id ) { initializer-list , [opt] }
7154 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7155 __alignof__ ( type-id ) { initializer-list , [opt] }
7157 ADDRESS_P is true iff the unary-expression is appearing as the
7158 operand of the `&' operator. CAST_P is true if this expression is
7159 the target of a cast.
7161 Returns a representation of the expression. */
7163 static tree
7166 {
7170 /* Peek at the next token. */
7172 /* Some keywords give away the kind of expression. */
7174 {
7178 {
7181 {
7184 location_t first_loc;
7187 /* Consume the token. */
7190 /* Parse the operand. */
7195 else
7196 {
7197 /* ISO C++ defines alignof only with types, not with
7198 expressions. So pedwarn if alignof is used with a non-
7199 type expression. However, __alignof__ is ok. */
7202 "ISO C++ does not allow %<alignof%> "
7206 }
7207 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7208 SIZEOF_EXPR with the original operand. */
7210 {
7212 {
7214 {
7217 error_mark_node));
7219 }
7220 else
7224 }
7226 }
7228 }
7237 {
7238 /* The saved value of the PEDANTIC flag. */
7240 tree expr;
7242 /* Save away the PEDANTIC flag. */
7244 /* Parse the cast-expression. */
7246 /* Restore the PEDANTIC flag. */
7250 }
7254 {
7255 tree expression;
7257 /* Consume the `__real__' or `__imag__' token. */
7259 /* Parse the cast-expression. */
7261 /* Create the complete representation. */
7265 expression,
7266 tf_warning_or_error);
7267 }
7275 {
7276 tree expr;
7286 parser->type_definition_forbidden_message
7289 saved_integral_constant_expression_p
7291 saved_non_integral_constant_expression_p
7295 saved_greater_than_is_operator_p
7307 parser->greater_than_is_operator_p
7310 parser->integral_constant_expression_p
7312 parser->non_integral_constant_expression_p
7319 }
7323 }
7324 }
7326 /* Look for the `:: new' and `:: delete', which also signal the
7327 beginning of a new-expression, or delete-expression,
7328 respectively. If the next token is `::', then it might be one of
7329 these. */
7331 {
7334 /* See if the token after the `::' is one of the keywords in
7335 which we're interested. */
7337 /* If it's `new', we have a new-expression. */
7340 /* Similarly, for `delete'. */
7343 }
7345 /* Look for a unary operator. */
7347 /* The `++' and `--' operators can be handled similarly, even though
7348 they are not technically unary-operators in the grammar. */
7350 {
7355 /* Handle the GNU address-of-label extension. */
7358 {
7359 tree identifier;
7360 tree expression;
7363 /* Consume the '&&' token. */
7365 /* Look for the identifier. */
7367 /* Create an expression representing the address. */
7370 NIC_ADDR_LABEL))
7373 }
7374 }
7376 {
7377 tree cast_expression;
7383 /* Consume the operator token. */
7385 /* Parse the cast-expression. */
7386 cast_expression
7391 pidk);
7392 /* Now, build an appropriate representation. */
7394 {
7398 RO_UNARY_STAR,
7399 complain);
7404 /* Fall through. */
7407 cast_expression,
7408 complain);
7415 /* Fall through. */
7425 }
7429 non_constant_p))
7433 }
7437 decltype_p,
7438 pidk);
7439 }
7441 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7442 unary-operator, the corresponding tree code is returned. */
7444 static enum tree_code
7446 {
7448 {
7469 }
7470 }
7472 /* Parse a new-expression.
7474 new-expression:
7475 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7476 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7478 Returns a representation of the expression. */
7480 static tree
7482 {
7485 tree type;
7488 tree ret;
7490 /* Look for the optional `::' operator. */
7491 global_scope_p
7495 /* Look for the `new' operator. */
7497 /* There's no easy way to tell a new-placement from the
7498 `( type-id )' construct. */
7500 /* Look for a new-placement. */
7502 /* If that didn't work out, there's no new-placement. */
7504 {
7508 }
7510 /* If the next token is a `(', then we have a parenthesized
7511 type-id. */
7513 {
7517 /* Consume the `('. */
7520 /* Parse the type-id. */
7521 parser->type_definition_forbidden_message
7526 /* Look for the closing `)'. */
7529 /* There should not be a direct-new-declarator in this production,
7530 but GCC used to allowed this, so we check and emit a sensible error
7531 message for this case. */
7533 {
7539 }
7540 }
7541 /* Otherwise, there must be a new-type-id. */
7542 else
7545 /* If the next token is a `(' or '{', then we have a new-initializer. */
7549 else
7552 /* A new-expression may not appear in an integral constant
7553 expression. */
7556 else
7557 {
7558 /* Create a representation of the new-expression. */
7560 tf_warning_or_error);
7561 }
7569 }
7571 /* Parse a new-placement.
7573 new-placement:
7574 ( expression-list )
7576 Returns the same representation as for an expression-list. */
7580 {
7583 /* Parse the expression-list. */
7584 expression_list = (cp_parser_parenthesized_expression_list
7590 }
7592 /* Parse a new-type-id.
7594 new-type-id:
7595 type-specifier-seq new-declarator [opt]
7597 Returns the TYPE allocated. If the new-type-id indicates an array
7598 type, *NELTS is set to the number of elements in the last array
7599 bound; the TYPE will not include the last array bound. */
7601 static tree
7603 {
7604 cp_decl_specifier_seq type_specifier_seq;
7610 /* The type-specifier sequence must not contain type definitions.
7611 (It cannot contain declarations of new types either, but if they
7612 are not definitions we will catch that because they are not
7613 complete.) */
7615 parser->type_definition_forbidden_message
7617 /* Parse the type-specifier-seq. */
7621 /* Restore the old message. */
7627 /* Parse the new-declarator. */
7630 /* Determine the number of elements in the last array dimension, if
7631 any. */
7633 /* Skip down to the last array dimension. */
7638 {
7641 }
7646 {
7649 }
7652 {
7659 else
7661 }
7664 }
7666 /* Parse an (optional) new-declarator.
7668 new-declarator:
7669 ptr-operator new-declarator [opt]
7670 direct-new-declarator
7672 Returns the declarator. */
7676 {
7679 cp_cv_quals cv_quals;
7681 /* We don't know if there's a ptr-operator next, or not. */
7683 /* Look for a ptr-operator. */
7685 /* If that worked, look for more new-declarators. */
7687 {
7690 /* Parse another optional declarator. */
7693 declarator = cp_parser_make_indirect_declarator
7697 }
7699 /* If the next token is a `[', there is a direct-new-declarator. */
7704 }
7706 /* Parse a direct-new-declarator.
7708 direct-new-declarator:
7709 [ expression ]
7710 direct-new-declarator [constant-expression]
7712 */
7716 {
7720 {
7721 tree expression;
7724 /* Look for the opening `['. */
7729 /* The standard requires that the expression have integral
7730 type. DR 74 adds enumeration types. We believe that the
7731 real intent is that these expressions be handled like the
7732 expression in a `switch' condition, which also allows
7733 classes with a single conversion to integral or
7734 enumeration type. */
7736 {
7737 expression
7739 expression,
7742 {
7744 "expression in new-declarator must have integral "
7747 }
7748 }
7750 /* Look for the closing `]'. */
7753 /* Add this bound to the declarator. */
7756 /* If the next token is not a `[', then there are no more
7757 bounds. */
7760 }
7763 }
7765 /* Parse a new-initializer.
7767 new-initializer:
7768 ( expression-list [opt] )
7769 braced-init-list
7771 Returns a representation of the expression-list. */
7775 {
7779 {
7780 tree t;
7787 }
7788 else
7789 expression_list = (cp_parser_parenthesized_expression_list
7795 }
7797 /* Parse a delete-expression.
7799 delete-expression:
7800 :: [opt] delete cast-expression
7801 :: [opt] delete [ ] cast-expression
7803 Returns a representation of the expression. */
7805 static tree
7807 {
7810 tree expression;
7812 /* Look for the optional `::' operator. */
7813 global_scope_p
7817 /* Look for the `delete' keyword. */
7819 /* See if the array syntax is in use. */
7821 {
7822 /* Consume the `[' token. */
7824 /* Look for the `]' token. */
7826 /* Remember that this is the `[]' construct. */
7828 }
7829 else
7832 /* Parse the cast-expression. */
7835 /* A delete-expression may not appear in an integral constant
7836 expression. */
7841 tf_warning_or_error);
7842 }
7844 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7845 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7846 0 otherwise. */
7848 static int
7850 {
7853 {
7895 /* In ((type ()) () the last () isn't a valid cast-expression,
7896 so the whole must be parsed as postfix-expression. */
7901 /* '[' may start a primary-expression in obj-c++ and in C++11,
7902 as a lambda-expression, eg, '(void)[]{}'. */
7909 /* '++' and '--' may or may not start a cast-expression:
7911 struct T { void operator++(int); };
7912 void f() { (T())++; }
7914 vs
7916 int a;
7917 (int)++a; */
7922 }
7923 }
7925 /* Parse a cast-expression.
7927 cast-expression:
7928 unary-expression
7929 ( type-id ) cast-expression
7931 ADDRESS_P is true iff the unary-expression is appearing as the
7932 operand of the `&' operator. CAST_P is true if this expression is
7933 the target of a cast.
7935 Returns a representation of the expression. */
7937 static tree
7940 {
7941 /* If it's a `(', then we might be looking at a cast. */
7943 {
7949 /* There's no way to know yet whether or not this is a cast.
7950 For example, `(int (3))' is a unary-expression, while `(int)
7951 3' is a cast. So, we resort to parsing tentatively. */
7953 /* Types may not be defined in a cast. */
7955 parser->type_definition_forbidden_message
7957 /* Consume the `('. */
7959 /* A very tricky bit is that `(struct S) { 3 }' is a
7960 compound-literal (which we permit in C++ as an extension).
7961 But, that construct is not a cast-expression -- it is a
7962 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7963 is legal; if the compound-literal were a cast-expression,
7964 you'd need an extra set of parentheses.) But, if we parse
7965 the type-id, and it happens to be a class-specifier, then we
7966 will commit to the parse at that point, because we cannot
7967 undo the action that is done when creating a new class. So,
7968 then we cannot back up and do a postfix-expression.
7970 Another tricky case is the following (c++/29234):
7972 struct S { void operator () (); };
7974 void foo ()
7975 {
7976 ( S()() );
7977 }
7979 As a type-id we parse the parenthesized S()() as a function
7980 returning a function, groktypename complains and we cannot
7981 back up in this case either.
7983 Therefore, we scan ahead to the closing `)', and check to see
7984 if the tokens after the `)' can start a cast-expression. Otherwise
7985 we are dealing with an unary-expression, a postfix-expression
7986 or something else.
7988 Yet another tricky case, in C++11, is the following (c++/54891):
7990 (void)[]{};
7992 The issue is that usually, besides the case of lambda-expressions,
7993 the parenthesized type-id cannot be followed by '[', and, eg, we
7994 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7995 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7996 we don't commit, we try a cast-expression, then an unary-expression.
7998 Save tokens so that we can put them back. */
8001 /* We may be looking at a cast-expression. */
8004 cast_expression
8007 /* Roll back the tokens we skipped. */
8009 /* If we aren't looking at a cast-expression, simulate an error so
8010 that the call to cp_parser_error_occurred below returns true. */
8013 else
8014 {
8017 /* Look for the type-id. */
8019 /* Look for the closing `)'. */
8022 }
8024 /* Restore the saved message. */
8027 /* At this point this can only be either a cast or a
8028 parenthesized ctor such as `(T ())' that looks like a cast to
8029 function returning T. */
8031 {
8032 /* Only commit if the cast-expression doesn't start with
8033 '++', '--', or '[' in C++11. */
8041 pidk);
8044 {
8045 /* Warn about old-style casts, if so requested. */
8052 /* Only type conversions to integral or enumeration types
8053 can be used in constant-expressions. */
8056 NIC_CAST))
8059 /* Perform the cast. */
8062 }
8063 }
8064 else
8066 }
8068 /* If we get here, then it's not a cast, so it must be a
8069 unary-expression. */
8072 }
8074 /* Parse a binary expression of the general form:
8076 pm-expression:
8077 cast-expression
8078 pm-expression .* cast-expression
8079 pm-expression ->* cast-expression
8081 multiplicative-expression:
8082 pm-expression
8083 multiplicative-expression * pm-expression
8084 multiplicative-expression / pm-expression
8085 multiplicative-expression % pm-expression
8087 additive-expression:
8088 multiplicative-expression
8089 additive-expression + multiplicative-expression
8090 additive-expression - multiplicative-expression
8092 shift-expression:
8093 additive-expression
8094 shift-expression << additive-expression
8095 shift-expression >> additive-expression
8097 relational-expression:
8098 shift-expression
8099 relational-expression < shift-expression
8100 relational-expression > shift-expression
8101 relational-expression <= shift-expression
8102 relational-expression >= shift-expression
8104 GNU Extension:
8106 relational-expression:
8107 relational-expression <? shift-expression
8108 relational-expression >? shift-expression
8110 equality-expression:
8111 relational-expression
8112 equality-expression == relational-expression
8113 equality-expression != relational-expression
8115 and-expression:
8116 equality-expression
8117 and-expression & equality-expression
8119 exclusive-or-expression:
8120 and-expression
8121 exclusive-or-expression ^ and-expression
8123 inclusive-or-expression:
8124 exclusive-or-expression
8125 inclusive-or-expression | exclusive-or-expression
8127 logical-and-expression:
8128 inclusive-or-expression
8129 logical-and-expression && inclusive-or-expression
8131 logical-or-expression:
8132 logical-and-expression
8133 logical-or-expression || logical-and-expression
8135 All these are implemented with a single function like:
8137 binary-expression:
8138 simple-cast-expression
8139 binary-expression <token> binary-expression
8141 CAST_P is true if this expression is the target of a cast.
8143 The binops_by_token map is used to get the tree codes for each <token> type.
8144 binary-expressions are associated according to a precedence table. */
8146 #define TOKEN_PRECEDENCE(token) \
8147 (((token->type == CPP_GREATER \
8148 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8149 && !parser->greater_than_is_operator_p) \
8150 ? PREC_NOT_OPERATOR \
8151 : binops_by_token[token->type].prec)
8153 static tree
8159 {
8160 cp_parser_expression_stack stack;
8162 cp_parser_expression_stack_entry current;
8163 tree rhs;
8167 tree overload;
8169 /* Parse the first expression. */
8180 {
8181 /* Get an operator token. */
8187 {
8189 "%<>>%> operator is treated"
8193 }
8197 /* Popping an entry off the stack means we completed a subexpression:
8198 - either we found a token which is not an operator (`>' where it is not
8199 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8200 will happen repeatedly;
8201 - or, we found an operator which has lower priority. This is the case
8202 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8203 parsing `3 * 4'. */
8205 {
8208 else
8210 }
8212 get_rhs:
8216 /* We used the operator token. */
8219 /* For "false && x" or "true || x", x will never be executed;
8220 disable warnings while evaluating it. */
8226 /* Extract another operand. It may be the RHS of this expression
8227 or the LHS of a new, higher priority expression. */
8232 /* Get another operator token. Look up its precedence to avoid
8233 building a useless (immediately popped) stack entry for common
8234 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8238 {
8239 /* ... and prepare to parse the RHS of the new, higher priority
8240 expression. Since precedence levels on the stack are
8241 monotonically increasing, we do not have to care about
8242 stack overflows. */
8251 pop:
8253 /* If the stack is not empty, we have parsed into LHS the right side
8254 (`4' in the example above) of an expression we had suspended.
8255 We can use the information on the stack to recover the LHS (`3')
8256 from the stack together with the tree code (`MULT_EXPR'), and
8257 the precedence of the higher level subexpression
8258 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8259 which will be used to actually build the additive expression. */
8264 }
8266 /* Undo the disabling of warnings done above. */
8275 /* Avoid warning for !!x == y. */
8280 /* Avoid warning for !b == y where b is boolean. */
8284 /* Avoid warning for !!b == y where b is boolean. */
8292 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8293 ERROR_MARK for everything that is not a binary expression.
8294 This makes warn_about_parentheses miss some warnings that
8295 involve unary operators. For unary expressions we should
8296 pass the correct tree_code unless the unary expression was
8297 surrounded by parentheses.
8298 */
8304 == tcc_comparison
8307 else
8316 /* If the binary operator required the use of an overloaded operator,
8317 then this expression cannot be an integral constant-expression.
8318 An overloaded operator can be used even if both operands are
8319 otherwise permissible in an integral constant-expression if at
8320 least one of the operands is of enumeration type. */
8324 NIC_OVERLOADED))
8326 }
8329 }
8331 static tree
8336 {
8339 }
8341 /* Parse the `? expression : assignment-expression' part of a
8342 conditional-expression. The LOGICAL_OR_EXPR is the
8343 logical-or-expression that started the conditional-expression.
8344 Returns a representation of the entire conditional-expression.
8346 This routine is used by cp_parser_assignment_expression.
8348 ? expression : assignment-expression
8350 GNU Extensions:
8352 ? : assignment-expression */
8354 static tree
8356 {
8357 tree expr;
8358 tree assignment_expr;
8362 /* Consume the `?' token. */
8367 {
8370 /* Implicit true clause. */
8374 }
8375 else
8376 {
8379 /* Parse the expression. */
8382 c_inhibit_evaluation_warnings +=
8386 }
8388 /* The next token should be a `:'. */
8390 /* Parse the assignment-expression. */
8394 /* Build the conditional-expression. */
8396 expr,
8397 assignment_expr,
8398 tf_warning_or_error);
8399 }
8401 /* Parse an assignment-expression.
8403 assignment-expression:
8404 conditional-expression
8405 logical-or-expression assignment-operator assignment_expression
8406 throw-expression
8408 CAST_P is true if this expression is the target of a cast.
8409 DECLTYPE_P is true if this expression is the operand of decltype.
8411 Returns a representation for the expression. */
8413 static tree
8416 {
8417 tree expr;
8419 /* If the next token is the `throw' keyword, then we're looking at
8420 a throw-expression. */
8423 /* Otherwise, it must be that we are looking at a
8424 logical-or-expression. */
8425 else
8426 {
8427 /* Parse the binary expressions (logical-or-expression). */
8429 decltype_p,
8431 /* If the next token is a `?' then we're actually looking at a
8432 conditional-expression. */
8435 else
8436 {
8439 /* If it's an assignment-operator, we're using the second
8440 production. */
8441 enum tree_code assignment_operator
8444 {
8446 location_t saved_input_location;
8448 /* Parse the right-hand side of the assignment. */
8454 /* An assignment may not appear in a
8455 constant-expression. */
8457 NIC_ASSIGNMENT))
8459 /* Build the assignment expression. Its default
8460 location is the location of the '=' token. */
8464 assignment_operator,
8465 rhs,
8468 }
8469 }
8470 }
8473 }
8475 /* Parse an (optional) assignment-operator.
8477 assignment-operator: one of
8478 = *= /= %= += -= >>= <<= &= ^= |=
8480 GNU Extension:
8482 assignment-operator: one of
8483 <?= >?=
8485 If the next token is an assignment operator, the corresponding tree
8486 code is returned, and the token is consumed. For example, for
8487 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8488 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8489 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8490 operator, ERROR_MARK is returned. */
8492 static enum tree_code
8494 {
8498 /* Peek at the next token. */
8502 {
8548 /* Nothing else is an assignment operator. */
8550 }
8552 /* If it was an assignment operator, consume it. */
8557 }
8559 /* Parse an expression.
8561 expression:
8562 assignment-expression
8563 expression , assignment-expression
8565 CAST_P is true if this expression is the target of a cast.
8566 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8567 except possibly parenthesized or on the RHS of a comma (N3276).
8569 Returns a representation of the expression. */
8571 static tree
8574 {
8579 {
8580 tree assignment_expression;
8582 /* Parse the next assignment-expression. */
8583 assignment_expression
8586 /* We don't create a temporary for a call that is the immediate operand
8587 of decltype or on the RHS of a comma. But when we see a comma, we
8588 need to create a temporary for a call on the LHS. */
8593 assignment_expression
8597 /* If this is the first assignment-expression, we can just
8598 save it away. */
8601 else
8603 assignment_expression,
8605 /* If the next token is not a comma, then we are done with the
8606 expression. */
8609 /* Consume the `,'. */
8612 /* A comma operator cannot appear in a constant-expression. */
8615 }
8618 }
8620 /* Parse a constant-expression.
8622 constant-expression:
8623 conditional-expression
8625 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8626 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8627 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8628 is false, NON_CONSTANT_P should be NULL. */
8630 static tree
8634 {
8638 tree expression;
8640 /* It might seem that we could simply parse the
8641 conditional-expression, and then check to see if it were
8642 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8643 one that the compiler can figure out is constant, possibly after
8644 doing some simplifications or optimizations. The standard has a
8645 precise definition of constant-expression, and we must honor
8646 that, even though it is somewhat more restrictive.
8648 For example:
8650 int i[(2, 3)];
8652 is not a legal declaration, because `(2, 3)' is not a
8653 constant-expression. The `,' operator is forbidden in a
8654 constant-expression. However, GCC's constant-folding machinery
8655 will fold this operation to an INTEGER_CST for `3'. */
8657 /* Save the old settings. */
8659 saved_allow_non_integral_constant_expression_p
8662 /* We are now parsing a constant-expression. */
8664 parser->allow_non_integral_constant_expression_p
8667 /* Although the grammar says "conditional-expression", we parse an
8668 "assignment-expression", which also permits "throw-expression"
8669 and the use of assignment operators. In the case that
8670 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8671 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8672 actually essential that we look for an assignment-expression.
8673 For example, cp_parser_initializer_clauses uses this function to
8674 determine whether a particular assignment-expression is in fact
8675 constant. */
8677 /* Restore the old settings. */
8678 parser->integral_constant_expression_p
8680 parser->allow_non_integral_constant_expression_p
8683 {
8684 /* Require an rvalue constant expression here; that's what our
8685 callers expect. Reference constant expressions are handled
8686 separately in e.g. cp_parser_template_argument. */
8691 }
8694 parser->non_integral_constant_expression_p
8698 }
8700 /* Parse __builtin_offsetof.
8702 offsetof-expression:
8703 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8705 offsetof-member-designator:
8706 id-expression
8707 | offsetof-member-designator "." id-expression
8708 | offsetof-member-designator "[" expression "]"
8709 | offsetof-member-designator "->" id-expression */
8711 static tree
8713 {
8716 cp_id_kind dummy;
8719 /* We're about to accept non-integral-constant things, but will
8720 definitely yield an integral constant expression. Save and
8721 restore these values around our local parsing. */
8725 /* Consume the "__builtin_offsetof" token. */
8727 /* Consume the opening `('. */
8729 /* Parse the type-id. */
8732 /* Look for the `,'. */
8736 /* Build the (type *)null that begins the traditional offsetof macro. */
8738 tf_warning_or_error);
8740 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8744 {
8747 {
8749 /* offsetof-member-designator "[" expression "]" */
8755 /* offsetof-member-designator "->" identifier */
8758 /* FALLTHRU */
8761 /* offsetof-member-designator "." identifier */
8769 /* Consume the ")" token. */
8774 /* Error. We know the following require will fail, but
8775 that gives the proper error message. */
8780 }
8781 }
8783 success:
8786 failure:
8791 }
8793 /* Parse a trait expression.
8795 Returns a representation of the expression, the underlying type
8796 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8798 static tree
8800 {
8801 cp_trait_kind kind;
8807 {
8891 }
8893 /* Consume the token. */
8904 {
8911 }
8913 {
8915 {
8919 {
8922 }
8926 }
8927 }
8931 /* Complete the trait expression, which may mean either processing
8932 the trait expr now or saving it for template instantiation. */
8934 {
8943 }
8944 }
8946 /* Lambdas that appear in variable initializer or default argument scope
8947 get that in their mangling, so we need to record it. We might as well
8948 use the count for function and namespace scopes as well. */
8952 {
8953 tree t;
8958 static void
8960 {
8961 tree_int ti;
8963 /* Once we're inside a function, we ignore other scopes and just push
8964 the function again so that popping works properly. */
8971 {
8972 /* Don't reset the count if we're still in the same function. */
8975 }
8976 }
8978 static void
8980 {
8983 }
8985 static void
8987 {
8990 {
8993 }
8995 }
8997 /* Parse a lambda expression.
8999 lambda-expression:
9000 lambda-introducer lambda-declarator [opt] compound-statement
9002 Returns a representation of the expression. */
9004 static tree
9006 {
9008 tree type;
9016 {
9018 {
9022 }
9024 }
9026 {
9028 {
9031 }
9033 }
9035 /* We may be in the middle of deferred access check. Disable
9036 it now. */
9047 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9050 /* Now that we've started the type, add the capture fields for any
9051 explicit captures. */
9054 {
9055 /* Inside the class, surrounding template-parameter-lists do not apply. */
9056 unsigned int saved_num_template_parameter_lists
9060 bool fully_implicit_function_template_p
9064 bool auto_is_implicit_function_template_parm_p
9075 /* By virtue of defining a local class, a lambda expression has access to
9076 the private variables of enclosing classes. */
9081 {
9087 }
9089 {
9092 }
9094 /* The capture list was built up in reverse order; fix that now. */
9106 parser->fully_implicit_function_template_p
9110 parser->auto_is_implicit_function_template_parm_p
9112 }
9116 /* This field is only used during parsing of the lambda. */
9119 /* This lambda shouldn't have any proxies left at this point. */
9121 /* And now that we're done, push proxies for an enclosing lambda. */
9126 else
9132 }
9134 /* Parse the beginning of a lambda expression.
9136 lambda-introducer:
9137 [ lambda-capture [opt] ]
9139 LAMBDA_EXPR is the current representation of the lambda expression. */
9141 static void
9143 {
9144 /* Need commas after the first capture. */
9147 /* Eat the leading `['. */
9150 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9158 {
9161 }
9164 {
9166 tree capture_id;
9167 tree capture_init_expr;
9171 enum capture_kind_type
9172 {
9173 BY_COPY,
9174 BY_REFERENCE
9175 };
9179 {
9182 }
9186 else
9189 /* Possibly capture `this'. */
9191 {
9201 explicit_init_p);
9203 }
9205 /* Remember whether we want to capture as a reference or not. */
9207 {
9210 }
9212 /* Get the identifier. */
9217 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9218 delimiters, but I modified this to stop on unnested ']' as well. It
9219 was already changed to stop on unnested '}', so the
9220 "closing_parenthesis" name is no more misleading with my change. */
9221 {
9227 }
9229 /* Find the initializer for this capture. */
9233 {
9235 /* An explicit initializer exists. */
9238 "lambda capture initializers "
9244 {
9247 }
9248 }
9249 else
9250 {
9253 /* Turn the identifier into an id-expression. */
9254 capture_init_expr
9259 {
9262 }
9266 {
9269 capture_init_expr);
9272 }
9275 {
9278 capture_init_expr))
9281 }
9283 capture_init_expr
9284 = finish_id_expression
9286 capture_init_expr,
9300 {
9303 }
9304 else
9306 }
9310 {
9315 capture_id);
9319 "capture of %qD redundant with by-reference capture "
9321 }
9324 capture_id,
9325 capture_init_expr,
9327 explicit_init_p);
9328 }
9331 }
9333 /* Parse the (optional) middle of a lambda expression.
9335 lambda-declarator:
9336 < template-parameter-list [opt] >
9337 ( parameter-declaration-clause [opt] )
9338 attribute-specifier [opt]
9339 mutable [opt]
9340 exception-specification [opt]
9341 lambda-return-type-clause [opt]
9343 LAMBDA_EXPR is the current representation of the lambda expression. */
9345 static bool
9347 {
9348 /* 5.1.1.4 of the standard says:
9349 If a lambda-expression does not include a lambda-declarator, it is as if
9350 the lambda-declarator were ().
9351 This means an empty parameter list, no attributes, and no exception
9352 specification. */
9358 /* The template-parameter-list is optional, but must begin with
9359 an opening angle if present. */
9361 {
9364 "lambda templates are only available with "
9373 /* We just processed one more parameter list. */
9375 }
9377 /* The parameter-declaration-clause is optional (unless
9378 template-parameter-list was given), but must begin with an
9379 opening parenthesis if present. */
9381 {
9386 /* Parse parameters. */
9389 /* Default arguments shall not be specified in the
9390 parameter-declaration-clause of a lambda-declarator. */
9400 /* Parse optional `mutable' keyword. */
9402 {
9405 }
9407 /* Parse optional exception specification. */
9410 /* Parse optional trailing return type. */
9412 {
9416 }
9418 /* The function parameters must be in scope all the way until after the
9419 trailing-return-type in case of decltype. */
9421 }
9425 /* Create the function call operator.
9427 Messing with declarators like this is no uglier than building up the
9428 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9429 other code. */
9430 {
9431 cp_decl_specifier_seq return_type_specs;
9433 tree fco;
9440 else
9441 /* Maybe we will deduce the return type later. */
9447 sfk_none);
9452 VIRT_SPEC_UNSPECIFIED,
9453 REF_QUAL_NONE,
9454 exception_spec,
9459 declarator,
9460 attributes);
9462 {
9465 /* Give the object parameter a different name. */
9469 }
9471 {
9475 }
9484 }
9485 }
9487 /* Parse the body of a lambda expression, which is simply
9489 compound-statement
9491 but which requires special handling.
9492 LAMBDA_EXPR is the current representation of the lambda expression. */
9494 static void
9496 {
9501 else
9502 /* Still increment function_depth so that we don't GC in the
9503 middle of an expression. */
9505 /* Clear this in case we're in the middle of a default argument. */
9508 /* Finish the function call operator
9509 - class_specifier
9510 + late_parsing_for_member
9511 + function_definition_after_declarator
9512 + ctor_initializer_opt_and_function_body */
9513 {
9515 tree body;
9517 tree compound_stmt;
9518 tree cap;
9520 /* Let the front end know that we are going to be defining this
9521 function. */
9523 NULL_TREE,
9532 /* Push the proxies for any explicit captures. */
9539 /* 5.1.1.4 of the standard says:
9540 If a lambda-expression does not include a trailing-return-type, it
9541 is as if the trailing-return-type denotes the following type:
9542 * if the compound-statement is of the form
9543 { return attribute-specifier [opt] expression ; }
9544 the type of the returned expression after lvalue-to-rvalue
9545 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9546 (_conv.array_ 4.2), and function-to-pointer conversion
9547 (_conv.func_ 4.3);
9548 * otherwise, void. */
9550 /* In a lambda that has neither a lambda-return-type-clause
9551 nor a deducible form, errors should be reported for return statements
9552 in the body. Since we used void as the placeholder return type, parsing
9553 the body as usual will give such desired behavior. */
9557 {
9561 /* Parse tentatively in case there's more after the initial return
9562 statement. */
9573 {
9577 /* Will get error here if type not deduced yet. */
9581 }
9582 }
9585 {
9590 }
9594 out:
9598 /* Finish the function and generate code for it if necessary. */
9601 /* Only expand if the call op is not a template. */
9604 }
9609 else
9611 }
9613 /* Statements [gram.stmt.stmt] */
9615 /* Parse a statement.
9617 statement:
9618 labeled-statement
9619 expression-statement
9620 compound-statement
9621 selection-statement
9622 iteration-statement
9623 jump-statement
9624 declaration-statement
9625 try-block
9627 C++11:
9629 statement:
9630 labeled-statement
9631 attribute-specifier-seq (opt) expression-statement
9632 attribute-specifier-seq (opt) compound-statement
9633 attribute-specifier-seq (opt) selection-statement
9634 attribute-specifier-seq (opt) iteration-statement
9635 attribute-specifier-seq (opt) jump-statement
9636 declaration-statement
9637 attribute-specifier-seq (opt) try-block
9639 TM Extension:
9641 statement:
9642 atomic-statement
9644 IN_COMPOUND is true when the statement is nested inside a
9645 cp_parser_compound_statement; this matters for certain pragmas.
9647 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9648 is a (possibly labeled) if statement which is not enclosed in braces
9649 and has an else clause. This is used to implement -Wparentheses. */
9651 static void
9654 {
9659 restart:
9662 /* There is no statement yet. */
9668 /* In obj-c++, seeing '[[' might be the either the beginning of
9669 c++11 attributes, or a nested objc-message-expression. So
9670 let's parse the c++11 attributes tentatively. */
9674 {
9677 }
9679 /* Peek at the next token. */
9681 /* Remember the location of the first token in the statement. */
9683 /* If this is a keyword, then that will often determine what kind of
9684 statement we have. */
9686 {
9690 {
9693 /* Looks like a labeled-statement with a case label.
9694 Parse the label, and then use tail recursion to parse
9695 the statement. */
9712 {
9717 }
9718 else
9732 {
9737 }
9738 else
9739 {
9743 }
9747 /* Objective-C++ exception-handling constructs. */
9761 /* This must be a namespace alias definition. */
9774 /* It might be a keyword like `int' that can start a
9775 declaration-statement. */
9777 }
9778 }
9780 {
9781 /* If the next token is a `:', then we are looking at a
9782 labeled-statement. */
9785 {
9786 /* Looks like a labeled-statement with an ordinary label.
9787 Parse the label, and then use tail recursion to parse
9788 the statement. */
9792 }
9793 }
9794 /* Anything that starts with a `{' must be a compound-statement. */
9797 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9798 a statement all its own. */
9800 {
9801 /* Only certain OpenMP pragmas are attached to statements, and thus
9802 are considered statements themselves. All others are not. In
9803 the context of a compound, accept the pragma as a "statement" and
9804 return so that we can check for a close brace. Otherwise we
9805 require a real statement and must go back and read one. */
9811 }
9813 {
9816 }
9818 /* Everything else must be a declaration-statement or an
9819 expression-statement. Try for the declaration-statement
9820 first, unless we are looking at a `;', in which case we know that
9821 we have an expression-statement. */
9823 {
9825 {
9827 {
9828 /* Attributes should be parsed as part of the the
9829 declaration, so let's un-parse them. */
9832 }
9835 /* Try to parse the declaration-statement. */
9837 /* If that worked, we're done. */
9840 }
9841 /* Look for an expression-statement instead. */
9843 }
9845 /* Set the line number for the statement. */
9849 /* Note that for now, we don't do anything with c++11 statements
9850 parsed at this level. */
9853 OPT_Wattributes,
9855 }
9857 /* Parse the label for a labeled-statement, i.e.
9859 identifier :
9860 case constant-expression :
9861 default :
9863 GNU Extension:
9864 case constant-expression ... constant-expression : statement
9866 When a label is parsed without errors, the label is added to the
9867 parse tree by the finish_* functions, so this function doesn't
9868 have to return the label. */
9870 static void
9872 {
9877 /* The next token should be an identifier. */
9881 {
9884 }
9888 {
9890 {
9894 /* Consume the `case' token. */
9896 /* Parse the constant-expression. */
9903 {
9904 /* Consume the `...' token. */
9910 /* We don't need to emit warnings here, as the common code
9911 will do this for us. */
9912 }
9913 else
9918 else
9921 expr);
9922 }
9926 /* Consume the `default' token. */
9931 else
9936 /* Anything else must be an ordinary label. */
9939 }
9941 /* Require the `:' token. */
9944 /* An ordinary label may optionally be followed by attributes.
9945 However, this is only permitted if the attributes are then
9946 followed by a semicolon. This is because, for backward
9947 compatibility, when parsing
9948 lab: __attribute__ ((unused)) int i;
9949 we want the attribute to attach to "i", not "lab". */
9952 {
9953 tree attrs;
9960 ;
9961 else
9963 }
9969 }
9971 /* Parse an expression-statement.
9973 expression-statement:
9974 expression [opt] ;
9976 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9977 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9978 indicates whether this expression-statement is part of an
9979 expression statement. */
9981 static tree
9983 {
9987 /* If the next token is a ';', then there is no expression
9988 statement. */
9990 {
9994 {
9997 }
9998 }
10000 /* Give a helpful message for "A<T>::type t;" and the like. */
10003 {
10010 {
10011 /* A::A a; */
10016 }
10017 }
10019 /* Consume the final `;'. */
10024 /* This is the final expression statement of a statement
10025 expression. */
10031 }
10033 /* Parse a compound-statement.
10035 compound-statement:
10036 { statement-seq [opt] }
10038 GNU extension:
10040 compound-statement:
10041 { label-declaration-seq [opt] statement-seq [opt] }
10043 label-declaration-seq:
10044 label-declaration
10045 label-declaration-seq label-declaration
10047 Returns a tree representing the statement. */
10049 static tree
10052 {
10053 tree compound_stmt;
10055 /* Consume the `{'. */
10062 /* Begin the compound-statement. */
10064 /* If the next keyword is `__label__' we have a label declaration. */
10067 /* Parse an (optional) statement-seq. */
10069 /* Finish the compound-statement. */
10071 /* Consume the `}'. */
10075 }
10077 /* Parse an (optional) statement-seq.
10079 statement-seq:
10080 statement
10081 statement-seq [opt] statement */
10083 static void
10085 {
10086 /* Scan statements until there aren't any more. */
10088 {
10091 /* If we are looking at a `}', then we have run out of
10092 statements; the same is true if we have reached the end
10093 of file, or have stumbled upon a stray '@end'. */
10100 /* If we are in a compound statement and find 'else' then
10101 something went wrong. */
10103 {
10106 else
10107 {
10110 }
10111 }
10113 /* Parse the statement. */
10115 }
10116 }
10118 /* Parse a selection-statement.
10120 selection-statement:
10121 if ( condition ) statement
10122 if ( condition ) statement else statement
10123 switch ( condition ) statement
10125 Returns the new IF_STMT or SWITCH_STMT.
10127 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10128 is a (possibly labeled) if statement which is not enclosed in
10129 braces and has an else clause. This is used to implement
10130 -Wparentheses. */
10132 static tree
10134 {
10141 /* Peek at the next token. */
10144 /* See what kind of keyword it is. */
10147 {
10150 {
10151 tree statement;
10152 tree condition;
10154 /* Look for the `('. */
10156 {
10159 }
10161 /* Begin the selection-statement. */
10164 else
10167 /* Parse the condition. */
10169 /* Look for the `)'. */
10175 {
10179 /* Add the condition. */
10182 /* Parse the then-clause. */
10186 {
10194 }
10195 else
10201 /* If the next token is `else', parse the else-clause. */
10203 RID_ELSE))
10204 {
10205 /* Consume the `else' keyword. */
10208 /* Parse the else-clause. */
10210 {
10211 location_t loc;
10218 }
10219 else
10224 /* If we are currently parsing a then-clause, then
10225 IF_P will not be NULL. We set it to true to
10226 indicate that this if statement has an else clause.
10227 This may trigger the Wparentheses warning below
10228 when we get back up to the parent if statement. */
10231 }
10232 else
10233 {
10234 /* This if statement does not have an else clause. If
10235 NESTED_IF is true, then the then-clause is an if
10236 statement which does have an else clause. We warn
10237 about the potential ambiguity. */
10240 "suggest explicit braces to avoid ambiguous"
10242 }
10244 /* Now we're all done with the if-statement. */
10246 }
10247 else
10248 {
10252 /* Add the condition. */
10255 /* Parse the body of the switch-statement. */
10264 /* Now we're all done with the switch-statement. */
10266 }
10269 }
10275 }
10276 }
10278 /* Parse a condition.
10280 condition:
10281 expression
10282 type-specifier-seq declarator = initializer-clause
10283 type-specifier-seq declarator braced-init-list
10285 GNU Extension:
10287 condition:
10288 type-specifier-seq declarator asm-specification [opt]
10289 attributes [opt] = assignment-expression
10291 Returns the expression that should be tested. */
10293 static tree
10295 {
10296 cp_decl_specifier_seq type_specifiers;
10300 /* Try the declaration first. */
10302 /* New types are not allowed in the type-specifier-seq for a
10303 condition. */
10305 parser->type_definition_forbidden_message
10307 /* Parse the type-specifier-seq. */
10309 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10312 /* Restore the saved message. */
10314 /* If all is well, we might be looking at a declaration. */
10316 {
10317 tree decl;
10318 tree asm_specification;
10319 tree attributes;
10323 /* Parse the declarator. */
10329 /* Parse the attributes. */
10331 /* Parse the asm-specification. */
10333 /* If the next token is not an `=' or '{', then we might still be
10334 looking at an expression. For example:
10336 if (A(a).x)
10338 looks like a decl-specifier-seq and a declarator -- but then
10339 there is no `=', so this is an expression. */
10344 /* If we did see an `=' or '{', then we are looking at a declaration
10345 for sure. */
10347 {
10348 tree pushed_scope;
10352 /* Create the declaration. */
10358 /* Parse the initializer. */
10360 {
10364 }
10365 else
10366 {
10367 /* Consume the `='. */
10370 }
10374 /* Process the initializer. */
10377 asm_specification,
10378 flags);
10384 }
10385 }
10386 /* If we didn't even get past the declarator successfully, we are
10387 definitely not looking at a declaration. */
10388 else
10391 /* Otherwise, we are looking at an expression. */
10393 }
10395 /* Parses a for-statement or range-for-statement until the closing ')',
10396 not included. */
10398 static tree
10400 {
10404 /* Begin the for-statement. */
10407 /* Parse the initialization. */
10412 else
10414 }
10416 static tree
10418 {
10419 /* Normal for loop */
10422 tree stmt;
10425 /* The for-init-statement has already been parsed in
10426 cp_parser_for_init_statement, so no work is needed here. */
10429 /* If there's a condition, process it. */
10433 {
10437 }
10439 /* Look for the `;'. */
10442 /* If there's an expression, process it. */
10448 }
10450 /* Tries to parse a range-based for-statement:
10452 range-based-for:
10453 decl-specifier-seq declarator : expression
10455 The decl-specifier-seq declarator and the `:' are already parsed by
10456 cp_parser_for_init_statement. If processing_template_decl it returns a
10457 newly created RANGE_FOR_STMT; if not, it is converted to a
10458 regular FOR_STMT. */
10460 static tree
10463 {
10467 {
10470 }
10471 else
10474 /* If in template, STMT is converted to a normal for-statement
10475 at instantiation. If not, it is done just ahead. */
10477 {
10485 /* do_auto_deduction doesn't mess with template init-lists. */
10488 }
10489 else
10490 {
10493 }
10495 }
10497 /* Subroutine of cp_convert_range_for: given the initializer expression,
10498 builds up the range temporary. */
10500 static tree
10502 {
10505 /* Find out the type deduced by the declaration
10506 `auto &&__range = range_expr'. */
10511 /* Create the __range variable. */
10518 }
10520 /* Used by cp_parser_range_for in template context: we aren't going to
10521 do a full conversion yet, but we still need to resolve auto in the
10522 type of the for-range-declaration if present. This is basically
10523 a shortcut version of cp_convert_range_for. */
10525 static void
10527 {
10530 {
10533 iter_type = (cp_parser_perform_range_for_lookup
10536 {
10538 iter_type);
10540 tf_warning_or_error);
10543 }
10544 }
10545 }
10547 /* Converts a range-based for-statement into a normal
10548 for-statement, as per the definition.
10550 for (RANGE_DECL : RANGE_EXPR)
10551 BLOCK
10553 should be equivalent to:
10555 {
10556 auto &&__range = RANGE_EXPR;
10557 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10558 __begin != __end;
10559 ++__begin)
10560 {
10561 RANGE_DECL = *__begin;
10562 BLOCK
10563 }
10564 }
10566 If RANGE_EXPR is an array:
10567 BEGIN_EXPR = __range
10568 END_EXPR = __range + ARRAY_SIZE(__range)
10569 Else if RANGE_EXPR has a member 'begin' or 'end':
10570 BEGIN_EXPR = __range.begin()
10571 END_EXPR = __range.end()
10572 Else:
10573 BEGIN_EXPR = begin(__range)
10574 END_EXPR = end(__range);
10576 If __range has a member 'begin' but not 'end', or vice versa, we must
10577 still use the second alternative (it will surely fail, however).
10578 When calling begin()/end() in the third alternative we must use
10579 argument dependent lookup, but always considering 'std' as an associated
10580 namespace. */
10582 tree
10585 {
10591 /* If an error happened previously do nothing or else a lot of
10592 unhelpful errors would be issued. */
10594 else
10595 {
10596 tree range_temp;
10600 /* Can't bind a reference to an array of runtime bound. */
10602 else
10603 {
10608 LOOKUP_ONLYCONVERTING);
10610 }
10613 }
10615 /* The new for initialization statement. */
10623 LOOKUP_ONLYCONVERTING);
10632 LOOKUP_ONLYCONVERTING);
10636 /* The new for condition. */
10643 /* The new increment expression. */
10646 tf_warning_or_error);
10649 /* The declaration is initialized with *__begin inside the loop body. */
10652 tf_warning_or_error),
10654 LOOKUP_ONLYCONVERTING);
10657 }
10659 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10660 We need to solve both at the same time because the method used
10661 depends on the existence of members begin or end.
10662 Returns the type deduced for the iterator expression. */
10664 static tree
10666 {
10668 {
10671 }
10674 {
10679 }
10681 {
10682 /* If RANGE is an array, we will use pointer arithmetic. */
10685 range,
10689 }
10690 else
10691 {
10692 /* If it is not an array, we must do a bit of magic. */
10702 tf_warning_or_error);
10705 tf_warning_or_error);
10708 {
10709 /* Use the member functions. */
10712 else
10718 else
10721 }
10722 else
10723 {
10724 /* Use global functions with ADL. */
10731 tf_warning_or_error);
10733 tf_warning_or_error);
10735 tf_warning_or_error);
10737 tf_warning_or_error);
10740 }
10742 /* Last common checks. */
10744 {
10745 /* If one of the expressions is an error do no more checks. */
10748 }
10751 /* Can happen, when, eg, in a template context, Koenig lookup
10752 can't resolve begin/end (c++/58503). */
10754 else
10755 {
10757 /* The unqualified type of the __begin and __end temporaries should
10758 be the same, as required by the multiple auto declaration. */
10764 }
10765 }
10766 }
10768 /* Helper function for cp_parser_perform_range_for_lookup.
10769 Builds a tree for RANGE.IDENTIFIER(). */
10771 static tree
10773 {
10786 tf_warning_or_error);
10789 }
10791 /* Parse an iteration-statement.
10793 iteration-statement:
10794 while ( condition ) statement
10795 do statement while ( expression ) ;
10796 for ( for-init-statement condition [opt] ; expression [opt] )
10797 statement
10799 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10801 static tree
10803 {
10806 tree statement;
10809 /* Peek at the next token. */
10814 /* Remember whether or not we are already within an iteration
10815 statement. */
10818 /* See what kind of keyword it is. */
10821 {
10823 {
10824 tree condition;
10826 /* Begin the while-statement. */
10828 /* Look for the `('. */
10830 /* Parse the condition. */
10833 /* Look for the `)'. */
10835 /* Parse the dependent statement. */
10839 /* We're done with the while-statement. */
10841 }
10845 {
10846 tree expression;
10848 /* Begin the do-statement. */
10850 /* Parse the body of the do-statement. */
10855 /* Look for the `while' keyword. */
10857 /* Look for the `('. */
10859 /* Parse the expression. */
10861 /* We're done with the do-statement. */
10863 /* Look for the `)'. */
10865 /* Look for the `;'. */
10867 }
10871 {
10872 /* Look for the `('. */
10877 /* Look for the `)'. */
10880 /* Parse the body of the for-statement. */
10885 /* We're done with the for-statement. */
10887 }
10894 }
10897 }
10899 /* Parse a for-init-statement or the declarator of a range-based-for.
10900 Returns true if a range-based-for declaration is seen.
10902 for-init-statement:
10903 expression-statement
10904 simple-declaration */
10906 static bool
10908 {
10909 /* If the next token is a `;', then we have an empty
10910 expression-statement. Grammatically, this is also a
10911 simple-declaration, but an invalid one, because it does not
10912 declare anything. Therefore, if we did not handle this case
10913 specially, we would issue an error message about an invalid
10914 declaration. */
10916 {
10922 {
10923 /* N3994 -- for (id : init) ... */
10926 "type-specifier only available with "
10934 }
10936 /* A colon is used in range-based for. */
10939 /* We're going to speculatively look for a declaration, falling back
10940 to an expression, if necessary. */
10942 /* Parse the declaration. */
10945 decl);
10948 {
10949 /* It is a range-for, consume the ':' */
10953 {
10955 "range-based %<for%> loops only available with "
10958 }
10959 }
10960 else
10961 /* The ';' is not consumed yet because we told
10962 cp_parser_simple_declaration not to. */
10967 /* If the tentative parse failed, then we shall need to look for an
10968 expression-statement. */
10969 }
10970 /* If we are here, it is an expression-statement. */
10973 }
10975 /* Parse a jump-statement.
10977 jump-statement:
10978 break ;
10979 continue ;
10980 return expression [opt] ;
10981 return braced-init-list ;
10982 goto identifier ;
10984 GNU extension:
10986 jump-statement:
10987 goto * expression ;
10989 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10991 static tree
10993 {
10999 /* Peek at the next token. */
11004 /* See what kind of keyword it is. */
11007 {
11011 {
11031 }
11037 {
11044 /* Fall through. */
11054 }
11059 {
11060 tree expr;
11064 {
11068 }
11071 else
11072 /* If the next token is a `;', then there is no
11073 expression. */
11075 /* Build the return-statement. */
11077 /* Look for the final `;'. */
11079 }
11085 {
11088 }
11090 /* Create the goto-statement. */
11092 {
11093 /* Issue a warning about this use of a GNU extension. */
11095 /* Consume the '*' token. */
11097 /* Parse the dependent expression. */
11099 }
11100 else
11102 /* Look for the final `;'. */
11109 }
11112 }
11114 /* Parse a declaration-statement.
11116 declaration-statement:
11117 block-declaration */
11119 static void
11121 {
11124 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11127 /* Parse the block-declaration. */
11130 /* Free any declarators allocated. */
11132 }
11134 /* Some dependent statements (like `if (cond) statement'), are
11135 implicitly in their own scope. In other words, if the statement is
11136 a single statement (as opposed to a compound-statement), it is
11137 none-the-less treated as if it were enclosed in braces. Any
11138 declarations appearing in the dependent statement are out of scope
11139 after control passes that point. This function parses a statement,
11140 but ensures that is in its own scope, even if it is not a
11141 compound-statement.
11143 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11144 is a (possibly labeled) if statement which is not enclosed in
11145 braces and has an else clause. This is used to implement
11146 -Wparentheses.
11148 Returns the new statement. */
11150 static tree
11152 {
11153 tree statement;
11158 /* Mark if () ; with a special NOP_EXPR. */
11160 {
11164 }
11165 /* if a compound is opened, we simply parse the statement directly. */
11168 /* If the token is not a `{', then we must take special action. */
11169 else
11170 {
11171 /* Create a compound-statement. */
11173 /* Parse the dependent-statement. */
11175 /* Finish the dummy compound-statement. */
11177 }
11179 /* Return the statement. */
11181 }
11183 /* For some dependent statements (like `while (cond) statement'), we
11184 have already created a scope. Therefore, even if the dependent
11185 statement is a compound-statement, we do not want to create another
11186 scope. */
11188 static void
11190 {
11191 /* If the token is a `{', then we must take special action. */
11194 else
11195 {
11196 /* Avoid calling cp_parser_compound_statement, so that we
11197 don't create a new scope. Do everything else by hand. */
11199 /* If the next keyword is `__label__' we have a label declaration. */
11202 /* Parse an (optional) statement-seq. */
11205 }
11206 }
11208 /* Declarations [gram.dcl.dcl] */
11210 /* Parse an optional declaration-sequence.
11212 declaration-seq:
11213 declaration
11214 declaration-seq declaration */
11216 static void
11218 {
11220 {
11231 {
11232 /* A declaration consisting of a single semicolon is
11233 invalid. Allow it unless we're being pedantic. */
11238 }
11240 /* If we're entering or exiting a region that's implicitly
11241 extern "C", modify the lang context appropriately. */
11243 {
11246 }
11248 {
11251 }
11254 {
11255 /* A top-level declaration can consist solely of a #pragma.
11256 A nested declaration cannot, so this is done here and not
11257 in cp_parser_declaration. (A #pragma at block scope is
11258 handled in cp_parser_statement.) */
11261 }
11263 /* Parse the declaration itself. */
11265 }
11266 }
11268 /* Parse a declaration.
11270 declaration:
11271 block-declaration
11272 function-definition
11273 template-declaration
11274 explicit-instantiation
11275 explicit-specialization
11276 linkage-specification
11277 namespace-definition
11279 GNU extension:
11281 declaration:
11282 __extension__ declaration */
11284 static void
11286 {
11287 cp_token token1;
11288 cp_token token2;
11293 /* Check for the `__extension__' keyword. */
11295 {
11296 /* Parse the qualified declaration. */
11298 /* Restore the PEDANTIC flag. */
11302 }
11304 /* Try to figure out what kind of declaration is present. */
11309 else
11310 {
11313 }
11315 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11318 /* If the next token is `extern' and the following token is a string
11319 literal, then we have a linkage specification. */
11323 /* If the next token is `template', then we have either a template
11324 declaration, an explicit instantiation, or an explicit
11325 specialization. */
11327 {
11328 /* `template <>' indicates a template specialization. */
11332 /* `template <' indicates a template declaration. */
11335 /* Anything else must be an explicit instantiation. */
11336 else
11338 }
11339 /* If the next token is `export', then we have a template
11340 declaration. */
11343 /* If the next token is `extern', 'static' or 'inline' and the one
11344 after that is `template', we have a GNU extended explicit
11345 instantiation directive. */
11352 /* If the next token is `namespace', check for a named or unnamed
11353 namespace definition. */
11359 /* An unnamed namespace definition. */
11363 /* An inline (associated) namespace definition. */
11367 /* Objective-C++ declaration/definition. */
11374 /* We must have either a block declaration or a function
11375 definition. */
11376 else
11377 /* Try to parse a block-declaration, or a function-definition. */
11380 /* Free any declarators allocated. */
11382 }
11384 /* Parse a block-declaration.
11386 block-declaration:
11387 simple-declaration
11388 asm-definition
11389 namespace-alias-definition
11390 using-declaration
11391 using-directive
11393 GNU Extension:
11395 block-declaration:
11396 __extension__ block-declaration
11398 C++0x Extension:
11400 block-declaration:
11401 static_assert-declaration
11403 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11404 part of a declaration-statement. */
11406 static void
11409 {
11413 /* Check for the `__extension__' keyword. */
11415 {
11416 /* Parse the qualified declaration. */
11418 /* Restore the PEDANTIC flag. */
11422 }
11424 /* Peek at the next token to figure out which kind of declaration is
11425 present. */
11428 /* If the next keyword is `asm', we have an asm-definition. */
11430 {
11434 }
11435 /* If the next keyword is `namespace', we have a
11436 namespace-alias-definition. */
11439 /* If the next keyword is `using', we have a
11440 using-declaration, a using-directive, or an alias-declaration. */
11442 {
11447 /* If the token after `using' is `namespace', then we have a
11448 using-directive. */
11452 /* If the second token after 'using' is '=', then we have an
11453 alias-declaration. */
11459 /* Otherwise, it's a using-declaration. */
11460 else
11463 }
11464 /* If the next keyword is `__label__' we have a misplaced label
11465 declaration. */
11467 {
11471 /* If the next token is now a `;', consume it. */
11474 }
11475 /* If the next token is `static_assert' we have a static assertion. */
11478 /* Anything else must be a simple-declaration. */
11479 else
11482 }
11484 /* Parse a simple-declaration.
11486 simple-declaration:
11487 decl-specifier-seq [opt] init-declarator-list [opt] ;
11489 init-declarator-list:
11490 init-declarator
11491 init-declarator-list , init-declarator
11493 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11494 function-definition as a simple-declaration.
11496 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11497 parsed declaration if it is an uninitialized single declarator not followed
11498 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11499 if present, will not be consumed. */
11501 static void
11505 {
11506 cp_decl_specifier_seq decl_specifiers;
11515 /* Defer access checks until we know what is being declared; the
11516 checks for names appearing in the decl-specifier-seq should be
11517 done as if we were in the scope of the thing being declared. */
11520 /* Parse the decl-specifier-seq. We have to keep track of whether
11521 or not the decl-specifier-seq declares a named class or
11522 enumeration type, since that is the only case in which the
11523 init-declarator-list is allowed to be empty.
11525 [dcl.dcl]
11527 In a simple-declaration, the optional init-declarator-list can be
11528 omitted only when declaring a class or enumeration, that is when
11529 the decl-specifier-seq contains either a class-specifier, an
11530 elaborated-type-specifier, or an enum-specifier. */
11532 CP_PARSER_FLAGS_OPTIONAL,
11535 /* We no longer need to defer access checks. */
11538 /* In a block scope, a valid declaration must always have a
11539 decl-specifier-seq. By not trying to parse declarators, we can
11540 resolve the declaration/expression ambiguity more quickly. */
11543 {
11546 }
11548 /* If the next two tokens are both identifiers, the code is
11549 erroneous. The usual cause of this situation is code like:
11551 T t;
11553 where "T" should name a type -- but does not. */
11556 {
11557 /* If parsing tentatively, we should commit; we really are
11558 looking at a declaration. */
11560 /* Give up. */
11562 }
11564 /* If we have seen at least one decl-specifier, and the next token
11565 is not a parenthesis, then we must be looking at a declaration.
11566 (After "int (" we might be looking at a functional cast.) */
11573 /* Keep going until we hit the `;' at the end of the simple
11574 declaration. */
11577 CPP_SEMICOLON))
11578 {
11581 tree decl;
11584 {
11585 /* If we are processing next declarator, comma is expected */
11590 {
11594 }
11595 }
11596 else
11599 /* Parse the init-declarator. */
11602 function_definition_allowed_p,
11604 declares_class_or_enum,
11606 maybe_range_for_decl,
11608 /* If an error occurred while parsing tentatively, exit quickly.
11609 (That usually happens when in the body of a function; each
11610 statement is treated as a declaration-statement until proven
11611 otherwise.) */
11614 /* Handle function definitions specially. */
11616 {
11617 /* If the next token is a `,', then we are probably
11618 processing something like:
11620 void f() {}, *p;
11622 which is erroneous. */
11624 {
11627 "mixing"
11629 }
11630 /* Otherwise, we're done with the list of declarators. */
11631 else
11632 {
11635 }
11636 }
11639 /* The next token should be either a `,' or a `;'. */
11641 /* If it's a `,', there are more declarators to come. */
11644 /* If it's a `;', we are done. */
11647 /* Anything else is an error. */
11648 else
11649 {
11650 /* If we have already issued an error message we don't need
11651 to issue another one. */
11655 /* Skip tokens until we reach the end of the statement. */
11657 /* If the next token is now a `;', consume it. */
11661 }
11662 /* After the first time around, a function-definition is not
11663 allowed -- even if it was OK at first. For example:
11665 int i, f() {}
11667 is not valid. */
11669 }
11671 /* Issue an error message if no declarators are present, and the
11672 decl-specifier-seq does not itself declare a class or
11673 enumeration: [dcl.dcl]/3. */
11675 {
11677 {
11681 /* Ensure an error is issued anyway when finish_decltype_type,
11682 called via cp_parser_decl_specifier_seq, returns a class or
11683 an enumeration (c++/51786). */
11686 }
11687 /* Perform any deferred access checks. */
11689 }
11691 /* Consume the `;'. */
11695 {
11701 }
11703 done:
11705 }
11707 /* Parse a decl-specifier-seq.
11709 decl-specifier-seq:
11710 decl-specifier-seq [opt] decl-specifier
11711 decl-specifier attribute-specifier-seq [opt] (C++11)
11713 decl-specifier:
11714 storage-class-specifier
11715 type-specifier
11716 function-specifier
11717 friend
11718 typedef
11720 GNU Extension:
11722 decl-specifier:
11723 attributes
11725 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11727 The parser flags FLAGS is used to control type-specifier parsing.
11729 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11730 flags:
11732 1: one of the decl-specifiers is an elaborated-type-specifier
11733 (i.e., a type declaration)
11734 2: one of the decl-specifiers is an enum-specifier or a
11735 class-specifier (i.e., a type definition)
11737 */
11739 static void
11741 cp_parser_flags flags,
11744 {
11748 cp_decl_spec ds;
11750 /* Clear DECL_SPECS. */
11753 /* Assume no class or enumeration type is declared. */
11756 /* Keep reading specifiers until there are no more to read. */
11758 {
11763 /* Peek at the next token. */
11766 /* Save the first token of the decl spec list for error
11767 reporting. */
11770 /* Handle attributes. */
11772 {
11773 /* Parse the attributes. */
11776 /* In a sequence of declaration specifiers, c++11 attributes
11777 appertain to the type that precede them. In that case
11778 [dcl.spec]/1 says:
11780 The attribute-specifier-seq affects the type only for
11781 the declaration it appears in, not other declarations
11782 involving the same type.
11784 But for now let's force the user to position the
11785 attribute either at the beginning of the declaration or
11786 after the declarator-id, which would clearly mean that it
11787 applies to the declarator. */
11789 {
11791 /* The c++11 attribute is at the beginning of the
11792 declaration. It appertains to the entity being
11794 else
11795 {
11797 {
11798 /* This is an attribute following a
11799 class-specifier. */
11804 }
11805 else
11806 {
11807 decl_specs->std_attributes
11809 attrs);
11812 }
11814 }
11815 }
11817 decl_specs->attributes
11819 attrs);
11823 }
11824 /* Assume we will find a decl-specifier keyword. */
11826 /* If the next token is an appropriate keyword, we can simply
11827 add it to the list. */
11829 {
11830 /* decl-specifier:
11831 friend
11832 constexpr */
11835 {
11838 }
11839 else
11840 {
11842 /* Consume the token. */
11844 }
11852 /* function-specifier:
11853 inline
11854 virtual
11855 explicit */
11862 /* decl-specifier:
11863 typedef */
11866 /* Consume the token. */
11868 /* A constructor declarator cannot appear in a typedef. */
11870 /* The "typedef" keyword can only occur in a declaration; we
11871 may as well commit at this point. */
11878 /* storage-class-specifier:
11879 auto
11880 register
11881 static
11882 extern
11883 mutable
11885 GNU Extension:
11886 thread */
11889 {
11890 /* Consume the token. */
11893 /* Complain about `auto' as a storage specifier, if
11894 we're complaining about C++0x compatibility. */
11898 /* Set the storage class anyway. */
11900 token);
11901 }
11902 else
11903 /* C++0x auto type-specifier. */
11911 /* Consume the token. */
11914 token);
11917 /* Consume the token. */
11923 /* We did not yet find a decl-specifier yet. */
11926 }
11936 /* Constructors are a special case. The `S' in `S()' is not a
11937 decl-specifier; it is the beginning of the declarator. */
11938 constructor_p
11939 = (!found_decl_spec
11940 && constructor_possible_p
11941 && (cp_parser_constructor_declarator_p
11944 /* If we don't have a DECL_SPEC yet, then we must be looking at
11945 a type-specifier. */
11947 {
11950 tree type_spec;
11952 type_spec
11954 decl_specs,
11960 /* If this type-specifier referenced a user-defined type
11961 (a typedef, class-name, etc.), then we can't allow any
11962 more such type-specifiers henceforth.
11964 [dcl.spec]
11966 The longest sequence of decl-specifiers that could
11967 possibly be a type name is taken as the
11968 decl-specifier-seq of a declaration. The sequence shall
11969 be self-consistent as described below.
11971 [dcl.type]
11973 As a general rule, at most one type-specifier is allowed
11974 in the complete decl-specifier-seq of a declaration. The
11975 only exceptions are the following:
11977 -- const or volatile can be combined with any other
11978 type-specifier.
11980 -- signed or unsigned can be combined with char, long,
11981 short, or int.
11983 -- ..
11985 Example:
11987 typedef char* Pc;
11988 void g (const int Pc);
11990 Here, Pc is *not* part of the decl-specifier seq; it's
11991 the declarator. Therefore, once we see a type-specifier
11992 (other than a cv-qualifier), we forbid any additional
11993 user-defined types. We *do* still allow things like `int
11994 int' to be considered a decl-specifier-seq, and issue the
11995 error message later. */
11998 /* A constructor declarator cannot follow a type-specifier. */
12000 {
12005 }
12006 }
12008 /* If we still do not have a DECL_SPEC, then there are no more
12009 decl-specifiers. */
12014 /* After we see one decl-specifier, further decl-specifiers are
12015 always optional. */
12017 }
12019 /* Don't allow a friend specifier with a class definition. */
12024 }
12026 /* Parse an (optional) storage-class-specifier.
12028 storage-class-specifier:
12029 auto
12030 register
12031 static
12032 extern
12033 mutable
12035 GNU Extension:
12037 storage-class-specifier:
12038 thread
12040 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12042 static tree
12044 {
12046 {
12050 /* Fall through for C++98. */
12057 /* Consume the token. */
12062 }
12063 }
12065 /* Parse an (optional) function-specifier.
12067 function-specifier:
12068 inline
12069 virtual
12070 explicit
12072 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12073 Updates DECL_SPECS, if it is non-NULL. */
12075 static tree
12078 {
12081 {
12087 /* 14.5.2.3 [temp.mem]
12089 A member function template shall not be virtual. */
12092 else
12102 }
12104 /* Consume the token. */
12106 }
12108 /* Parse a linkage-specification.
12110 linkage-specification:
12111 extern string-literal { declaration-seq [opt] }
12112 extern string-literal declaration */
12114 static void
12116 {
12117 tree linkage;
12119 /* Look for the `extern' keyword. */
12122 /* Look for the string-literal. */
12125 /* Transform the literal into an identifier. If the literal is a
12126 wide-character string, or contains embedded NULs, then we can't
12127 handle it as the user wants. */
12130 {
12132 /* Assume C++ linkage. */
12134 }
12135 else
12138 /* We're now using the new linkage. */
12141 /* If the next token is a `{', then we're using the first
12142 production. */
12144 {
12147 /* Consume the `{' token. */
12149 /* Parse the declarations. */
12151 /* Look for the closing `}'. */
12153 }
12154 /* Otherwise, there's just one declaration. */
12155 else
12156 {
12159 saved_in_unbraced_linkage_specification_p
12163 parser->in_unbraced_linkage_specification_p
12165 }
12167 /* We're done with the linkage-specification. */
12169 }
12171 /* Parse a static_assert-declaration.
12173 static_assert-declaration:
12174 static_assert ( constant-expression , string-literal ) ;
12176 If MEMBER_P, this static_assert is a class member. */
12178 static void
12180 {
12181 tree condition;
12182 tree message;
12184 location_t saved_loc;
12187 /* Peek at the `static_assert' token so we can keep track of exactly
12188 where the static assertion started. */
12192 /* Look for the `static_assert' keyword. */
12194 RT_STATIC_ASSERT))
12197 /* We know we are in a static assertion; commit to any tentative
12198 parse. */
12202 /* Parse the `(' starting the static assertion condition. */
12205 /* Parse the constant-expression. Allow a non-constant expression
12206 here in order to give better diagnostics in finish_static_assert. */
12207 condition =
12212 /* Parse the separating `,'. */
12215 /* Parse the string-literal message. */
12220 /* A `)' completes the static assertion. */
12227 /* A semicolon terminates the declaration. */
12230 /* Complete the static assertion, which may mean either processing
12231 the static assert now or saving it for template instantiation. */
12233 }
12235 /* Parse the expression in decltype ( expression ). */
12237 static tree
12240 {
12242 tree expr;
12244 /* First, try parsing an id-expression. */
12255 {
12258 cp_id_kind idk;
12262 /* Lookup the name we got back from the id-expression. */
12272 {
12273 /* Complete lookup of the id-expression. */
12274 expr = (finish_id_expression
12287 /* We found an id-expression, but it was something that we
12288 should not have found. This is an error, not something
12289 we can recover from, so note that we found an
12290 id-expression and we'll recover as gracefully as
12291 possible. */
12293 }
12298 /* We have an id-expression. */
12300 }
12303 {
12304 /* Abort the id-expression parse. */
12307 /* Parsing tentatively, again. */
12310 /* Parse a class member access. */
12318 /* We have an id-expression. */
12320 }
12323 /* We have parsed the complete id-expression or member access. */
12325 else
12326 {
12327 /* Abort our attempt to parse an id-expression or member access
12328 expression. */
12331 /* Parse a full expression. */
12334 }
12337 }
12339 /* Parse a `decltype' type. Returns the type.
12341 simple-type-specifier:
12342 decltype ( expression )
12343 C++14 proposal:
12344 decltype ( auto ) */
12346 static tree
12348 {
12349 tree expr;
12358 {
12359 /* Already parsed. */
12362 }
12364 /* Look for the `decltype' token. */
12368 /* Parse the opening `('. */
12372 /* decltype (auto) */
12375 {
12382 }
12384 /* Types cannot be defined in a `decltype' expression. Save away the
12385 old message. */
12388 /* And create the new one. */
12389 parser->type_definition_forbidden_message
12392 /* The restrictions on constant-expressions do not apply inside
12393 decltype expressions. */
12394 saved_integral_constant_expression_p
12396 saved_non_integral_constant_expression_p
12400 /* Within a parenthesized expression, a `>' token is always
12401 the greater-than operator. */
12402 saved_greater_than_is_operator_p
12406 /* Do not actually evaluate the expression. */
12409 /* Do not warn about problems with the expression. */
12414 /* Go back to evaluating expressions. */
12418 /* The `>' token might be the end of a template-id or
12419 template-parameter-list now. */
12420 parser->greater_than_is_operator_p
12423 /* Restore the old message and the integral constant expression
12424 flags. */
12426 parser->integral_constant_expression_p
12428 parser->non_integral_constant_expression_p
12431 /* Parse to the closing `)'. */
12433 {
12437 }
12440 tf_warning_or_error);
12442 rewrite:
12443 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12444 it again. */
12451 }
12453 /* Special member functions [gram.special] */
12455 /* Parse a conversion-function-id.
12457 conversion-function-id:
12458 operator conversion-type-id
12460 Returns an IDENTIFIER_NODE representing the operator. */
12462 static tree
12464 {
12465 tree type;
12466 tree saved_scope;
12467 tree saved_qualifying_scope;
12468 tree saved_object_scope;
12471 /* Look for the `operator' token. */
12474 /* When we parse the conversion-type-id, the current scope will be
12475 reset. However, we need that information in able to look up the
12476 conversion function later, so we save it here. */
12480 /* We must enter the scope of the class so that the names of
12481 entities declared within the class are available in the
12482 conversion-type-id. For example, consider:
12484 struct S {
12485 typedef int I;
12486 operator I();
12487 };
12489 S::operator I() { ... }
12491 In order to see that `I' is a type-name in the definition, we
12492 must be in the scope of `S'. */
12495 /* Parse the conversion-type-id. */
12497 /* Leave the scope of the class, if any. */
12500 /* Restore the saved scope. */
12504 /* If the TYPE is invalid, indicate failure. */
12508 }
12510 /* Parse a conversion-type-id:
12512 conversion-type-id:
12513 type-specifier-seq conversion-declarator [opt]
12515 Returns the TYPE specified. */
12517 static tree
12519 {
12520 tree attributes;
12521 cp_decl_specifier_seq type_specifiers;
12523 tree type_specified;
12526 /* Parse the attributes. */
12530 parser->type_definition_forbidden_message
12533 /* Parse the type-specifiers. */
12540 /* If that didn't work, stop. */
12543 /* Parse the conversion-declarator. */
12551 /* Don't give this error when parsing tentatively. This happens to
12552 work because we always parse this definitively once. */
12555 {
12557 {
12560 }
12564 }
12567 }
12569 /* Parse an (optional) conversion-declarator.
12571 conversion-declarator:
12572 ptr-operator conversion-declarator [opt]
12574 */
12578 {
12581 cp_cv_quals cv_quals;
12583 /* We don't know if there's a ptr-operator next, or not. */
12585 /* Try the ptr-operator. */
12588 /* If it worked, look for more conversion-declarators. */
12590 {
12593 /* Parse another optional declarator. */
12596 declarator = cp_parser_make_indirect_declarator
12600 }
12603 }
12605 /* Parse an (optional) ctor-initializer.
12607 ctor-initializer:
12608 : mem-initializer-list
12610 Returns TRUE iff the ctor-initializer was actually present. */
12612 static bool
12614 {
12615 /* If the next token is not a `:', then there is no
12616 ctor-initializer. */
12618 {
12619 /* Do default initialization of any bases and members. */
12624 }
12626 /* Consume the `:' token. */
12628 /* And the mem-initializer-list. */
12632 }
12634 /* Parse a mem-initializer-list.
12636 mem-initializer-list:
12637 mem-initializer ... [opt]
12638 mem-initializer ... [opt] , mem-initializer-list */
12640 static void
12642 {
12647 /* Let the semantic analysis code know that we are starting the
12648 mem-initializer-list. */
12653 /* Loop through the list. */
12655 {
12656 tree mem_initializer;
12659 /* Parse the mem-initializer. */
12661 /* If the next token is a `...', we're expanding member initializers. */
12663 {
12664 /* Consume the `...'. */
12667 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12668 can be expanded but members cannot. */
12671 {
12676 }
12678 /* Construct the pack expansion type. */
12681 }
12684 {
12688 }
12689 /* Look for a target constructor. */
12693 {
12696 {
12700 }
12702 }
12703 /* Add it to the list, unless it was erroneous. */
12705 {
12708 }
12709 /* If the next token is not a `,', we're done. */
12712 /* Consume the `,' token. */
12714 }
12716 /* Perform semantic analysis. */
12719 }
12721 /* Parse a mem-initializer.
12723 mem-initializer:
12724 mem-initializer-id ( expression-list [opt] )
12725 mem-initializer-id braced-init-list
12727 GNU extension:
12729 mem-initializer:
12730 ( expression-list [opt] )
12732 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12733 class) or FIELD_DECL (for a non-static data member) to initialize;
12734 the TREE_VALUE is the expression-list. An empty initialization
12735 list is represented by void_list_node. */
12737 static tree
12739 {
12740 tree mem_initializer_id;
12741 tree expression_list;
12742 tree member;
12745 /* Find out what is being initialized. */
12747 {
12751 }
12752 else
12753 {
12757 }
12763 {
12770 }
12771 else
12772 {
12782 }
12792 }
12794 /* Parse a mem-initializer-id.
12796 mem-initializer-id:
12797 :: [opt] nested-name-specifier [opt] class-name
12798 identifier
12800 Returns a TYPE indicating the class to be initializer for the first
12801 production. Returns an IDENTIFIER_NODE indicating the data member
12802 to be initialized for the second production. */
12804 static tree
12806 {
12810 tree id;
12814 /* `typename' is not allowed in this context ([temp.res]). */
12816 {
12818 "keyword %<typename%> not allowed in this context (a qualified "
12821 }
12822 /* Look for the optional `::' operator. */
12823 global_scope_p
12827 /* Look for the optional nested-name-specifier. The simplest way to
12828 implement:
12830 [temp.res]
12832 The keyword `typename' is not permitted in a base-specifier or
12833 mem-initializer; in these contexts a qualified name that
12834 depends on a template-parameter is implicitly assumed to be a
12835 type name.
12837 is to assume that we have seen the `typename' keyword at this
12838 point. */
12839 nested_name_specifier_p
12848 /* If there is a `::' operator or a nested-name-specifier, then we
12849 are definitely looking for a class-name. */
12854 typename_type,
12858 /* Otherwise, we could also be looking for an ordinary identifier. */
12860 /* Try a class-name. */
12864 none_type,
12868 /* If we found one, we're done. */
12871 /* Otherwise, look for an ordinary identifier. */
12873 }
12875 /* Overloading [gram.over] */
12877 /* Parse an operator-function-id.
12879 operator-function-id:
12880 operator operator
12882 Returns an IDENTIFIER_NODE for the operator which is a
12883 human-readable spelling of the identifier, e.g., `operator +'. */
12885 static tree
12887 {
12888 /* Look for the `operator' keyword. */
12891 /* And then the name of the operator itself. */
12893 }
12895 /* Return an identifier node for a user-defined literal operator.
12896 The suffix identifier is chained to the operator name identifier. */
12898 static tree
12900 {
12901 tree identifier;
12908 }
12910 /* Parse an operator.
12912 operator:
12913 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12914 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12915 || ++ -- , ->* -> () []
12917 GNU Extensions:
12919 operator:
12920 <? >? <?= >?=
12922 Returns an IDENTIFIER_NODE for the operator which is a
12923 human-readable spelling of the identifier, e.g., `operator +'. */
12925 static tree
12927 {
12932 /* Peek at the next token. */
12934 /* Figure out which operator we have. */
12936 {
12938 {
12941 /* The keyword should be either `new' or `delete'. */
12946 else
12949 /* Consume the `new' or `delete' token. */
12952 /* Peek at the next token. */
12954 /* If it's a `[' token then this is the array variant of the
12955 operator. */
12957 {
12958 /* Consume the `[' token. */
12960 /* Look for the `]' token. */
12964 }
12965 /* Otherwise, we have the non-array variant. */
12966 else
12970 }
13117 /* Consume the `('. */
13119 /* Look for the matching `)'. */
13124 /* Consume the `['. */
13126 /* Look for the matching `]'. */
13141 {
13148 /* Consume the string. */
13154 {
13157 }
13158 else
13159 {
13161 /* Look for the suffix identifier. */
13166 {
13170 }
13171 else
13172 {
13175 }
13176 }
13181 {
13184 }
13187 {
13190 }
13192 {
13195 }
13197 }
13200 /* Anything else is an error. */
13202 }
13204 /* If we have selected an identifier, we need to consume the
13205 operator token. */
13208 /* Otherwise, no valid operator name was present. */
13209 else
13210 {
13213 }
13216 }
13218 /* Parse a template-declaration.
13220 template-declaration:
13221 export [opt] template < template-parameter-list > declaration
13223 If MEMBER_P is TRUE, this template-declaration occurs within a
13224 class-specifier.
13226 The grammar rule given by the standard isn't correct. What
13227 is really meant is:
13229 template-declaration:
13230 export [opt] template-parameter-list-seq
13231 decl-specifier-seq [opt] init-declarator [opt] ;
13232 export [opt] template-parameter-list-seq
13233 function-definition
13235 template-parameter-list-seq:
13236 template-parameter-list-seq [opt]
13237 template < template-parameter-list > */
13239 static void
13241 {
13242 /* Check for `export'. */
13244 {
13245 /* Consume the `export' token. */
13247 /* Warn that we do not support `export'. */
13249 }
13252 }
13254 /* Parse a template-parameter-list.
13256 template-parameter-list:
13257 template-parameter
13258 template-parameter-list , template-parameter
13260 Returns a TREE_LIST. Each node represents a template parameter.
13261 The nodes are connected via their TREE_CHAINs. */
13263 static tree
13265 {
13270 /* The loop below parses the template parms. We first need to know
13271 the total number of template parms to be able to compute proper
13272 canonical types of each dependent type. So after the loop, when
13273 we know the total number of template parms,
13274 end_template_parm_list computes the proper canonical types and
13275 fixes up the dependent types accordingly. */
13277 {
13278 tree parameter;
13281 location_t parm_loc;
13283 /* Parse the template-parameter. */
13288 /* Add it to the list. */
13291 parm_loc,
13292 parameter,
13293 is_non_type,
13294 is_parameter_pack);
13295 else
13296 {
13299 }
13301 /* If the next token is not a `,', we're done. */
13304 /* Otherwise, consume the `,' token. */
13306 }
13309 }
13311 /* Parse a template-parameter.
13313 template-parameter:
13314 type-parameter
13315 parameter-declaration
13317 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13318 the parameter. The TREE_PURPOSE is the default value, if any.
13319 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13320 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13321 set to true iff this parameter is a parameter pack. */
13323 static tree
13326 {
13330 tree parm;
13332 /* Assume it is a type parameter or a template parameter. */
13334 /* Assume it not a parameter pack. */
13336 /* Peek at the next token. */
13338 /* If it is `class' or `template', we have a type-parameter. */
13341 /* If it is `class' or `typename' we do not know yet whether it is a
13342 type parameter or a non-type parameter. Consider:
13344 template <typename T, typename T::X X> ...
13346 or:
13348 template <class C, class D*> ...
13350 Here, the first parameter is a type parameter, and the second is
13351 a non-type parameter. We can tell by looking at the token after
13352 the identifier -- if it is a `,', `=', or `>' then we have a type
13353 parameter. */
13355 {
13356 /* Peek at the token after `class' or `typename'. */
13358 /* If it's an ellipsis, we have a template type parameter
13359 pack. */
13362 /* If it's an identifier, skip it. */
13365 /* Now, see if the token looks like the end of a template
13366 parameter. */
13371 }
13373 /* Otherwise, it is a non-type parameter.
13375 [temp.param]
13377 When parsing a default template-argument for a non-type
13378 template-parameter, the first non-nested `>' is taken as the end
13379 of the template parameter-list rather than a greater-than
13380 operator. */
13382 parameter_declarator
13389 /* If the parameter declaration is marked as a parameter pack, set
13390 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13391 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13392 grokdeclarator. */
13395 {
13398 }
13401 {
13402 /* Can happen in some cases of erroneous input (c++/34892). */
13404 /* Consume the `...' for better error recovery. */
13406 }
13407 /* If the next token is an ellipsis, and we don't already have it
13408 marked as a parameter pack, then we have a parameter pack (that
13409 has no declarator). */
13412 && (declarator_can_be_parameter_pack
13414 {
13415 /* Consume the `...'. */
13420 }
13421 /* We might end up with a pack expansion as the type of the non-type
13422 template parameter, in which case this is a non-type template
13423 parameter pack. */
13426 {
13430 }
13433 {
13434 /* Parameter packs cannot have default arguments. However, a
13435 user may try to do so, so we'll parse them and give an
13436 appropriate diagnostic here. */
13440 /* Find the name of the parameter pack. */
13449 else
13453 /* Parse the default argument, but throw away the result. */
13455 }
13465 }
13467 /* Parse a type-parameter.
13469 type-parameter:
13470 class identifier [opt]
13471 class identifier [opt] = type-id
13472 typename identifier [opt]
13473 typename identifier [opt] = type-id
13474 template < template-parameter-list > class identifier [opt]
13475 template < template-parameter-list > class identifier [opt]
13476 = id-expression
13478 GNU Extension (variadic templates):
13480 type-parameter:
13481 class ... identifier [opt]
13482 typename ... identifier [opt]
13484 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13485 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13486 the declaration of the parameter.
13488 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13490 static tree
13492 {
13494 tree parameter;
13496 /* Look for a keyword to tell us what kind of parameter this is. */
13502 {
13505 {
13506 tree identifier;
13507 tree default_argument;
13509 /* If the next token is an ellipsis, we have a template
13510 argument pack. */
13512 {
13513 /* Consume the `...' token. */
13518 }
13520 /* If the next token is an identifier, then it names the
13521 parameter. */
13524 else
13527 /* Create the parameter. */
13530 /* If the next token is an `=', we have a default argument. */
13532 {
13533 /* Consume the `=' token. */
13535 /* Parse the default-argument. */
13539 /* Template parameter packs cannot have default
13540 arguments. */
13542 {
13545 "template parameter pack %qD cannot have a "
13547 else
13549 "template parameter packs cannot have "
13552 }
13556 }
13557 else
13560 /* Create the combined representation of the parameter and the
13561 default argument. */
13563 }
13567 {
13568 tree identifier;
13569 tree default_argument;
13571 /* Look for the `<'. */
13573 /* Parse the template-parameter-list. */
13575 /* Look for the `>'. */
13577 /* Look for the `class' or 'typename' keywords. */
13579 /* If the next token is an ellipsis, we have a template
13580 argument pack. */
13582 {
13583 /* Consume the `...' token. */
13588 }
13589 /* If the next token is an `=', then there is a
13590 default-argument. If the next token is a `>', we are at
13591 the end of the parameter-list. If the next token is a `,',
13592 then we are at the end of this parameter. */
13596 {
13598 /* Treat invalid names as if the parameter were nameless. */
13601 }
13602 else
13605 /* Create the template parameter. */
13607 identifier);
13609 /* If the next token is an `=', then there is a
13610 default-argument. */
13612 {
13615 /* Consume the `='. */
13617 /* Parse the id-expression. */
13619 /* save token before parsing the id-expression, for error
13620 reporting */
13622 default_argument
13630 /* If the id-expression was a template-id that refers to
13631 a template-class, we already have the declaration here,
13632 so no further lookup is needed. */
13633 ;
13634 else
13635 /* Look up the name. */
13636 default_argument
13638 none_type,
13644 /* See if the default argument is valid. */
13645 default_argument
13648 /* Template parameter packs cannot have default
13649 arguments. */
13651 {
13654 "template parameter pack %qD cannot "
13656 identifier);
13657 else
13661 }
13663 }
13664 else
13667 /* Create the combined representation of the parameter and the
13668 default argument. */
13670 }
13676 }
13679 }
13681 /* Parse a template-id.
13683 template-id:
13684 template-name < template-argument-list [opt] >
13686 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13687 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13688 returned. Otherwise, if the template-name names a function, or set
13689 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13690 names a class, returns a TYPE_DECL for the specialization.
13692 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13693 uninstantiated templates. */
13695 static tree
13701 {
13703 tree templ;
13704 tree arguments;
13705 tree template_id;
13712 /* If the next token corresponds to a template-id, there is no need
13713 to reparse it. */
13716 {
13719 /* Get the stored value. */
13721 /* Perform any access checks that were deferred. */
13724 {
13729 tf_warning_or_error);
13730 }
13731 /* Return the stored value. */
13733 }
13735 /* Avoid performing name lookup if there is no possibility of
13736 finding a template-id. */
13739 && !cp_parser_nth_token_starts_template_argument_list_p
13741 {
13744 }
13746 /* Remember where the template-id starts. */
13752 /* Parse the template-name. */
13755 check_dependency_p,
13756 is_declaration,
13757 tag_type,
13760 {
13763 }
13765 /* If we find the sequence `[:' after a template-name, it's probably
13766 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13767 parse correctly the argument list. */
13774 {
13776 /* Change `:' into `::'. */
13778 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13779 CPP_LESS. */
13782 /* Parse the arguments. */
13785 {
13786 /* If we couldn't parse an argument list, then we revert our changes
13787 and return simply an error. Maybe this is not a template-id
13788 after all. */
13793 }
13794 /* Otherwise, emit an error about the invalid digraph, but continue
13795 parsing because we got our argument list. */
13798 {
13801 "%<<:%> is an alternate spelling for %<[%>."
13804 {
13806 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13809 }
13810 }
13811 }
13812 else
13813 {
13814 /* Look for the `<' that starts the template-argument-list. */
13816 {
13819 }
13820 /* Parse the arguments. */
13822 }
13824 /* Build a representation of the specialization. */
13827 TEMPLATE_ID_EXPR,
13831 {
13833 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13834 template (rather than some instantiation thereof) only if
13835 is not nested within some other construct. For example, in
13836 "template <typename T> void f(T) { A<T>::", A<T> is just an
13837 instantiation of A. */
13840 CPP_SCOPE));
13841 template_id
13843 }
13845 {
13847 }
13848 else
13849 {
13850 /* If it's not a class-template or a template-template, it should be
13851 a function-template. */
13857 }
13859 /* If parsing tentatively, replace the sequence of tokens that makes
13860 up the template-id with a CPP_TEMPLATE_ID token. That way,
13861 should we re-parse the token stream, we will not have to repeat
13862 the effort required to do the parse, nor will we issue duplicate
13863 error messages about problems during instantiation of the
13864 template. */
13866 /* Don't do this if we had a parse error in a declarator; re-parsing
13867 might succeed if a name changes meaning (60361). */
13871 {
13874 /* Reset the contents of the START_OF_ID token. */
13876 /* Retrieve any deferred checks. Do not pop this access checks yet
13877 so the memory will not be reclaimed during token replacing below. */
13883 /* Purge all subsequent tokens. */
13886 /* ??? Can we actually assume that, if template_id ==
13887 error_mark_node, we will have issued a diagnostic to the
13888 user, as opposed to simply marking the tentative parse as
13889 failed? */
13892 }
13896 }
13898 /* Parse a template-name.
13900 template-name:
13901 identifier
13903 The standard should actually say:
13905 template-name:
13906 identifier
13907 operator-function-id
13909 A defect report has been filed about this issue.
13911 A conversion-function-id cannot be a template name because they cannot
13912 be part of a template-id. In fact, looking at this code:
13914 a.operator K<int>()
13916 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13917 It is impossible to call a templated conversion-function-id with an
13918 explicit argument list, since the only allowed template parameter is
13919 the type to which it is converting.
13921 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13922 `template' keyword, in a construction like:
13924 T::template f<3>()
13926 In that case `f' is taken to be a template-name, even though there
13927 is no way of knowing for sure.
13929 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13930 name refers to a set of overloaded functions, at least one of which
13931 is a template, or an IDENTIFIER_NODE with the name of the template,
13932 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13933 names are looked up inside uninstantiated templates. */
13935 static tree
13942 {
13943 tree identifier;
13944 tree decl;
13945 tree fns;
13948 /* If the next token is `operator', then we have either an
13949 operator-function-id or a conversion-function-id. */
13951 {
13952 /* We don't know whether we're looking at an
13953 operator-function-id or a conversion-function-id. */
13955 /* Try an operator-function-id. */
13957 /* If that didn't work, try a conversion-function-id. */
13959 {
13962 }
13963 }
13964 /* Look for the identifier. */
13965 else
13968 /* If we didn't find an identifier, we don't have a template-id. */
13972 /* If the name immediately followed the `template' keyword, then it
13973 is a template-name. However, if the next token is not `<', then
13974 we do not treat it as a template-name, since it is not being used
13975 as part of a template-id. This enables us to handle constructs
13976 like:
13978 template <typename T> struct S { S(); };
13979 template <typename T> S<T>::S();
13981 correctly. We would treat `S' as a template -- if it were `S<T>'
13982 -- but we do not if there is no `<'. */
13986 {
13987 /* In a declaration, in a dependent context, we pretend that the
13988 "template" keyword was present in order to improve error
13989 recovery. For example, given:
13991 template <typename T> void f(T::X<int>);
13993 we want to treat "X<int>" as a template-id. */
13995 && !template_keyword_p
13997 && check_dependency_p
13999 /* Do not do this for dtors (or ctors), since they never
14000 need the template keyword before their name. */
14002 {
14005 /* Explain what went wrong. */
14007 identifier);
14010 /* If parsing tentatively, find the location of the "<" token. */
14013 /* Parse the template arguments so that we can issue error
14014 messages about them. */
14017 /* Skip tokens until we find a good place from which to
14018 continue parsing. */
14023 /* If parsing tentatively, permanently remove the
14024 template argument list. That will prevent duplicate
14025 error messages from being issued about the missing
14026 "template" keyword. */
14032 }
14034 /* If the "template" keyword is present, then there is generally
14035 no point in doing name-lookup, so we just return IDENTIFIER.
14036 But, if the qualifying scope is non-dependent then we can
14037 (and must) do name-lookup normally. */
14043 }
14045 /* Look up the name. */
14047 tag_type,
14050 check_dependency_p,
14056 /* If DECL is a template, then the name was a template-name. */
14058 {
14062 }
14063 else
14064 {
14067 /* The standard does not explicitly indicate whether a name that
14068 names a set of overloaded declarations, some of which are
14069 templates, is a template-name. However, such a name should
14070 be a template-name; otherwise, there is no way to form a
14071 template-id for the overloaded templates. */
14079 {
14080 /* The name does not name a template. */
14083 }
14084 }
14086 /* If DECL is dependent, and refers to a function, then just return
14087 its name; we will look it up again during template instantiation. */
14089 {
14093 }
14096 }
14098 /* Parse a template-argument-list.
14100 template-argument-list:
14101 template-argument ... [opt]
14102 template-argument-list , template-argument ... [opt]
14104 Returns a TREE_VEC containing the arguments. */
14106 static tree
14108 {
14113 tree vec;
14120 /* Even if the template-id appears in an integral
14121 constant-expression, the contents of the argument list do
14122 not. */
14128 /* Parse the arguments. */
14129 do
14130 {
14131 tree argument;
14134 /* Consume the comma. */
14137 /* Parse the template-argument. */
14140 /* If the next token is an ellipsis, we're expanding a template
14141 argument pack. */
14143 {
14145 {
14149 }
14150 /* Consume the `...' token. */
14153 /* Make the argument into a TYPE_PACK_EXPANSION or
14154 EXPR_PACK_EXPANSION. */
14156 }
14159 {
14163 {
14166 }
14167 else
14169 }
14171 }
14184 #ifdef ENABLE_CHECKING
14186 #endif
14188 }
14190 /* Parse a template-argument.
14192 template-argument:
14193 assignment-expression
14194 type-id
14195 id-expression
14197 The representation is that of an assignment-expression, type-id, or
14198 id-expression -- except that the qualified id-expression is
14199 evaluated, so that the value returned is either a DECL or an
14200 OVERLOAD.
14202 Although the standard says "assignment-expression", it forbids
14203 throw-expressions or assignments in the template argument.
14204 Therefore, we use "conditional-expression" instead. */
14206 static tree
14208 {
14209 tree argument;
14215 cp_id_kind idk;
14217 /* There's really no way to know what we're looking at, so we just
14218 try each alternative in order.
14220 [temp.arg]
14222 In a template-argument, an ambiguity between a type-id and an
14223 expression is resolved to a type-id, regardless of the form of
14224 the corresponding template-parameter.
14226 Therefore, we try a type-id first. */
14229 /* If there was no error parsing the type-id but the next token is a
14230 '>>', our behavior depends on which dialect of C++ we're
14231 parsing. In C++98, we probably found a typo for '> >'. But there
14232 are type-id which are also valid expressions. For instance:
14234 struct X { int operator >> (int); };
14235 template <int V> struct Foo {};
14236 Foo<X () >> 5> r;
14238 Here 'X()' is a valid type-id of a function type, but the user just
14239 wanted to write the expression "X() >> 5". Thus, we remember that we
14240 found a valid type-id, but we still try to parse the argument as an
14241 expression to see what happens.
14243 In C++0x, the '>>' will be considered two separate '>'
14244 tokens. */
14248 {
14251 }
14252 else
14253 {
14254 /* If the next token isn't a `,' or a `>', then this argument wasn't
14255 really finished. This means that the argument is not a valid
14256 type-id. */
14259 /* If that worked, we're done. */
14262 }
14263 /* We're still not sure what the argument will be. */
14265 /* Try a template. */
14273 /* If the next token isn't a `,' or a `>', then this argument wasn't
14274 really finished. */
14278 {
14279 /* Figure out what is being referred to. If the id-expression
14280 was for a class template specialization, then we will have a
14281 TYPE_DECL at this point. There is no need to do name lookup
14282 at this point in that case. */
14285 none_type,
14294 }
14296 {
14300 }
14301 /* It must be a non-type argument. There permitted cases are given
14302 in [temp.arg.nontype]:
14304 -- an integral constant-expression of integral or enumeration
14305 type; or
14307 -- the name of a non-type template-parameter; or
14309 -- the name of an object or function with external linkage...
14311 -- the address of an object or function with external linkage...
14313 -- a pointer to member... */
14314 /* Look for a non-type template parameter. */
14316 {
14328 }
14330 /* If the next token is "&", the argument must be the address of an
14331 object or function with external linkage. */
14334 {
14337 }
14338 /* See if we might have an id-expression. */
14345 {
14348 address_p,
14355 else
14356 {
14357 tree probe;
14360 {
14361 /* Strip the dereference temporarily. */
14364 }
14366 /* If we're in a template, we represent a qualified-id referring
14367 to a static data member as a SCOPE_REF even if the scope isn't
14368 dependent so that we can check access control later. */
14373 {
14374 /* A variable without external linkage might still be a
14375 valid constant-expression, so no error is issued here
14376 if the external-linkage check fails. */
14379 }
14381 /* All overloaded functions are allowed; if the external
14382 linkage test does not pass, an error will be issued
14383 later. */
14384 ;
14388 /* A pointer-to-member. */
14389 ;
14391 ;
14392 else
14396 {
14399 tf_warning_or_error);
14400 else
14403 }
14404 }
14405 }
14406 /* If the argument started with "&", there are no other valid
14407 alternatives at this point. */
14409 {
14412 }
14414 /* If the argument wasn't successfully parsed as a type-id followed
14415 by '>>', the argument can only be a constant expression now.
14416 Otherwise, we try parsing the constant-expression tentatively,
14417 because the argument could really be a type-id. */
14428 /* We did our best to parse the argument as a non type-id, but that
14429 was the only alternative that matched (albeit with a '>' after
14430 it). We can assume it's just a typo from the user, and a
14431 diagnostic will then be issued. */
14433 }
14435 /* Parse an explicit-instantiation.
14437 explicit-instantiation:
14438 template declaration
14440 Although the standard says `declaration', what it really means is:
14442 explicit-instantiation:
14443 template decl-specifier-seq [opt] declarator [opt] ;
14445 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14446 supposed to be allowed. A defect report has been filed about this
14447 issue.
14449 GNU Extension:
14451 explicit-instantiation:
14452 storage-class-specifier template
14453 decl-specifier-seq [opt] declarator [opt] ;
14454 function-specifier template
14455 decl-specifier-seq [opt] declarator [opt] ; */
14457 static void
14459 {
14461 cp_decl_specifier_seq decl_specifiers;
14466 /* Look for an (optional) storage-class-specifier or
14467 function-specifier. */
14469 {
14470 extension_specifier
14473 extension_specifier
14476 }
14478 /* Look for the `template' keyword. */
14480 /* Let the front end know that we are processing an explicit
14481 instantiation. */
14483 /* [temp.explicit] says that we are supposed to ignore access
14484 control while processing explicit instantiation directives. */
14486 /* Parse a decl-specifier-seq. */
14488 CP_PARSER_FLAGS_OPTIONAL,
14491 /* If there was exactly one decl-specifier, and it declared a class,
14492 and there's no declarator, then we have an explicit type
14493 instantiation. */
14495 {
14496 tree type;
14500 /* Turn access control back on for names used during
14501 template instantiation. */
14506 }
14507 else
14508 {
14510 tree decl;
14512 /* Parse the declarator. */
14513 declarator
14524 {
14527 "explicit instantiation shall not use"
14531 "explicit instantiation shall not use"
14536 /* Turn access control back on for names used during
14537 template instantiation. */
14539 /* Do the explicit instantiation. */
14541 }
14542 else
14543 {
14545 /* Skip the body of the explicit instantiation. */
14547 }
14548 }
14549 /* We're done with the instantiation. */
14555 }
14557 /* Parse an explicit-specialization.
14559 explicit-specialization:
14560 template < > declaration
14562 Although the standard says `declaration', what it really means is:
14564 explicit-specialization:
14565 template <> decl-specifier [opt] init-declarator [opt] ;
14566 template <> function-definition
14567 template <> explicit-specialization
14568 template <> template-declaration */
14570 static void
14572 {
14576 /* Look for the `template' keyword. */
14578 /* Look for the `<'. */
14580 /* Look for the `>'. */
14582 /* We have processed another parameter list. */
14584 /* [temp]
14586 A template ... explicit specialization ... shall not have C
14587 linkage. */
14589 {
14591 /* Give it C++ linkage to avoid confusing other parts of the
14592 front end. */
14595 }
14596 else
14598 /* Let the front end know that we are beginning a specialization. */
14600 {
14603 }
14605 /* If the next keyword is `template', we need to figure out whether
14606 or not we're looking a template-declaration. */
14608 {
14613 else
14615 }
14616 else
14617 /* Parse the dependent declaration. */
14623 /* We're done with the specialization. */
14625 /* For the erroneous case of a template with C linkage, we pushed an
14626 implicit C++ linkage scope; exit that scope now. */
14629 /* We're done with this parameter list. */
14631 }
14633 /* Parse a type-specifier.
14635 type-specifier:
14636 simple-type-specifier
14637 class-specifier
14638 enum-specifier
14639 elaborated-type-specifier
14640 cv-qualifier
14642 GNU Extension:
14644 type-specifier:
14645 __complex__
14647 Returns a representation of the type-specifier. For a
14648 class-specifier, enum-specifier, or elaborated-type-specifier, a
14649 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14651 The parser flags FLAGS is used to control type-specifier parsing.
14653 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14654 in a decl-specifier-seq.
14656 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14657 class-specifier, enum-specifier, or elaborated-type-specifier, then
14658 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14659 if a type is declared; 2 if it is defined. Otherwise, it is set to
14660 zero.
14662 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14663 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14664 is set to FALSE. */
14666 static tree
14668 cp_parser_flags flags,
14673 {
14679 /* Assume this type-specifier does not declare a new type. */
14682 /* And that it does not specify a cv-qualifier. */
14685 /* Peek at the next token. */
14688 /* If we're looking at a keyword, we can use that to guide the
14689 production we choose. */
14692 {
14697 /* Look for the enum-specifier. */
14699 /* If that worked, we're done. */
14701 {
14706 type_spec,
14707 token,
14710 }
14711 else
14714 /* Any of these indicate either a class-specifier, or an
14715 elaborated-type-specifier. */
14722 /* Parse tentatively so that we can back up if we don't find a
14723 class-specifier. */
14725 /* Look for the class-specifier. */
14728 /* If that worked, we're done. */
14730 {
14735 type_spec,
14736 token,
14739 }
14741 /* Fall through. */
14742 elaborated_type_specifier:
14743 /* We're declaring (not defining) a class or enum. */
14747 /* Fall through. */
14749 /* Look for an elaborated-type-specifier. */
14750 type_spec
14751 = (cp_parser_elaborated_type_specifier
14754 is_declaration));
14757 type_spec,
14758 token,
14781 /* The `__complex__' keyword is a GNU extension. */
14787 }
14789 /* Handle simple keywords. */
14791 {
14793 {
14796 }
14798 }
14800 /* If we do not already have a type-specifier, assume we are looking
14801 at a simple-type-specifier. */
14803 decl_specs,
14804 flags);
14806 /* If we didn't find a type-specifier, and a type-specifier was not
14807 optional in this context, issue an error message. */
14809 {
14812 }
14815 }
14817 /* Parse a simple-type-specifier.
14819 simple-type-specifier:
14820 :: [opt] nested-name-specifier [opt] type-name
14821 :: [opt] nested-name-specifier template template-id
14822 char
14823 wchar_t
14824 bool
14825 short
14826 int
14827 long
14828 signed
14829 unsigned
14830 float
14831 double
14832 void
14834 C++0x Extension:
14836 simple-type-specifier:
14837 auto
14838 decltype ( expression )
14839 char16_t
14840 char32_t
14841 __underlying_type ( type-id )
14843 GNU Extension:
14845 simple-type-specifier:
14846 __int128
14847 __typeof__ unary-expression
14848 __typeof__ ( type-id )
14849 __typeof__ ( type-id ) { initializer-list , [opt] }
14851 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14852 appropriately updated. */
14854 static tree
14857 cp_parser_flags flags)
14858 {
14863 /* Peek at the next token. */
14866 /* If we're looking at a keyword, things are easy. */
14868 {
14903 {
14906 }
14935 {
14938 else
14942 {
14945 "use of %<auto%> in lambda parameter declaration "
14946 "only available with "
14948 }
14951 "use of %<auto%> in parameter declaration "
14952 "only available with "
14954 else
14956 "ISO C++ forbids use of %<auto%> in parameter "
14958 }
14959 else
14964 /* Since DR 743, decltype can either be a simple-type-specifier by
14965 itself or begin a nested-name-specifier. Parsing it will replace
14966 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14967 handling below decide what to do. */
14973 /* Consume the `typeof' token. */
14975 /* Parse the operand to `typeof'. */
14977 /* If it is not already a TYPE, take its type. */
14983 token,
14992 token,
15002 token,
15007 }
15009 /* If token is an already-parsed decltype not followed by ::,
15010 it's a simple-type-specifier. */
15013 {
15016 {
15018 token,
15020 /* Remember that we are handling a decltype in order to
15021 implement the resolution of DR 1510 when the argument
15022 isn't instantiation dependent. */
15024 }
15027 }
15029 /* If the type-specifier was for a built-in type, we're done. */
15031 {
15032 /* Record the type. */
15039 type,
15040 token,
15045 /* Consume the token. */
15051 /* There is no valid C++ program where a non-template type is
15052 followed by a "<". That usually indicates that the user thought
15053 that the type was a template. */
15058 }
15060 /* The type-specifier must be a user-defined type. */
15062 {
15066 /* Don't gobble tokens or issue error messages if this is an
15067 optional type-specifier. */
15071 /* Look for the optional `::' operator. */
15072 global_p
15076 /* Look for the nested-name specifier. */
15077 qualified_p
15085 /* If we have seen a nested-name-specifier, and the next token
15086 is `template', then we are using the template-id production. */
15089 {
15090 /* Look for the template-id. */
15094 none_type,
15096 /* If the template-id did not name a type, we are out of
15097 luck. */
15099 {
15102 }
15103 }
15104 /* Otherwise, look for a type-name. */
15105 else
15107 /* Keep track of all name-lookups performed in class scopes. */
15109 && !global_p
15110 && !qualified_p
15114 /* If it didn't work out, we don't have a TYPE. */
15120 token,
15122 }
15124 /* If we didn't get a type-name, issue an error message. */
15126 {
15129 }
15132 {
15133 /* See if TYPE is an Objective-C type, and if so, parse and
15134 accept any protocol references following it. Do this before
15135 the cp_parser_check_for_invalid_template_id() call, because
15136 Objective-C types can be followed by '<...>' which would
15137 enclose protocol names rather than template arguments, and so
15138 everything is fine. */
15141 {
15145 /* Clobber the "unqualified" type previously entered into
15146 DECL_SPECS with the new, improved protocol-qualified version. */
15151 }
15153 /* There is no valid C++ program where a non-template type is
15154 followed by a "<". That usually indicates that the user
15155 thought that the type was a template. */
15157 none_type,
15159 }
15162 }
15164 /* Parse a type-name.
15166 type-name:
15167 class-name
15168 enum-name
15169 typedef-name
15170 simple-template-id [in c++0x]
15172 enum-name:
15173 identifier
15175 typedef-name:
15176 identifier
15178 Returns a TYPE_DECL for the type. */
15180 static tree
15182 {
15183 tree type_decl;
15185 /* We can't know yet whether it is a class-name or not. */
15187 /* Try a class-name. */
15191 none_type,
15195 /* If it's not a class-name, keep looking. */
15197 {
15199 /* It must be a typedef-name or an enum-name. */
15203 /* It is either a simple-template-id representing an
15204 instantiation of an alias template... */
15208 none_type,
15210 /* Note that this must be an instantiation of an alias template
15211 because [temp.names]/6 says:
15213 A template-id that names an alias template specialization
15214 is a type-name.
15216 Whereas [temp.names]/7 says:
15218 A simple-template-id that names a class template
15219 specialization is a class-name. */
15224 else
15228 /* ... Or a typedef-name or an enum-name. */
15230 }
15233 }
15235 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15237 enum-name:
15238 identifier
15240 typedef-name:
15241 identifier
15243 Returns a TYPE_DECL for the type. */
15245 static tree
15247 {
15248 tree type_decl;
15249 tree identifier;
15256 /* Look up the type-name. */
15263 {
15264 /* See if this is an Objective-C type. */
15269 }
15271 /* Issue an error if we did not find a type-name. */
15273 /* In Objective-C, we have the complication that class names are
15274 normally type names and start declarations (eg, the
15275 "NSObject" in "NSObject *object;"), but can be used in an
15276 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15277 is an expression. So, a classname followed by a dot is not a
15278 valid type-name. */
15281 {
15286 }
15287 /* Remember that the name was used in the definition of the
15288 current class so that we can check later to see if the
15289 meaning would have been different after the class was
15290 entirely defined. */
15296 }
15298 /* Parse an elaborated-type-specifier. Note that the grammar given
15299 here incorporates the resolution to DR68.
15301 elaborated-type-specifier:
15302 class-key :: [opt] nested-name-specifier [opt] identifier
15303 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15304 enum-key :: [opt] nested-name-specifier [opt] identifier
15305 typename :: [opt] nested-name-specifier identifier
15306 typename :: [opt] nested-name-specifier template [opt]
15307 template-id
15309 GNU extension:
15311 elaborated-type-specifier:
15312 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15313 class-key attributes :: [opt] nested-name-specifier [opt]
15314 template [opt] template-id
15315 enum attributes :: [opt] nested-name-specifier [opt] identifier
15317 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15318 declared `friend'. If IS_DECLARATION is TRUE, then this
15319 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15320 something is being declared.
15322 Returns the TYPE specified. */
15324 static tree
15328 {
15330 tree identifier;
15333 tree globalscope;
15336 /* See if we're looking at the `enum' keyword. */
15338 {
15339 /* Consume the `enum' token. */
15341 /* Remember that it's an enumeration type. */
15343 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15344 enums) is used here. */
15347 {
15351 /* Consume the `struct' or `class' and parse it anyway. */
15353 }
15354 /* Parse the attributes. */
15356 }
15357 /* Or, it might be `typename'. */
15359 RID_TYPENAME))
15360 {
15361 /* Consume the `typename' token. */
15363 /* Remember that it's a `typename' type. */
15365 }
15366 /* Otherwise it must be a class-key. */
15367 else
15368 {
15372 /* Parse the attributes. */
15374 }
15376 /* Look for the `::' operator. */
15379 /* Look for the nested-name-specifier. */
15381 {
15386 is_declaration))
15388 }
15389 else
15390 /* Even though `typename' is not present, the proposed resolution
15391 to Core Issue 180 says that in `class A<T>::B', `B' should be
15392 considered a type-name, even if `A<T>' is dependent. */
15397 is_declaration);
15398 /* For everything but enumeration types, consider a template-id.
15399 For an enumeration type, consider only a plain identifier. */
15401 {
15403 tree decl;
15405 /* Allow the `template' keyword. */
15407 /* If we didn't see `template', we don't know if there's a
15408 template-id or not. */
15411 /* Parse the template-id. */
15415 tag_type,
15416 is_declaration);
15417 /* If we didn't find a template-id, look for an ordinary
15418 identifier. */
15420 ;
15421 /* We can get here when cp_parser_template_id, called by
15422 cp_parser_class_name with tag_type == none_type, succeeds
15423 and caches a BASELINK. Then, when called again here,
15424 instead of failing and returning an error_mark_node
15425 returns it (see template/typename17.C in C++11).
15426 ??? Could we diagnose this earlier? */
15428 {
15431 }
15432 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15433 in effect, then we must assume that, upon instantiation, the
15434 template will correspond to a class. */
15438 typename_type,
15440 /* If the `typename' keyword is in effect and DECL is not a type
15441 decl, then type is non existent. */
15443 ;
15449 }
15452 {
15457 {
15460 }
15462 /* For a `typename', we needn't call xref_tag. */
15468 /* Template parameter lists apply only if we are not within a
15469 function parameter list. */
15470 bool template_parm_lists_apply
15479 /* Look up a qualified name in the usual way. */
15481 {
15482 tree decl;
15483 tree ambiguous_decls;
15486 tag_type,
15493 /* If the lookup was ambiguous, an error will already have been
15494 issued. */
15498 /* If we are parsing friend declaration, DECL may be a
15499 TEMPLATE_DECL tree node here. However, we need to check
15500 whether this TEMPLATE_DECL results in valid code. Consider
15501 the following example:
15503 namespace N {
15504 template <class T> class C {};
15505 }
15506 class X {
15507 template <class T> friend class N::C; // #1, valid code
15508 };
15509 template <class T> class Y {
15510 friend class N::C; // #2, invalid code
15511 };
15513 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15514 name lookup of `N::C'. We see that friend declaration must
15515 be template for the code to be valid. Note that
15516 processing_template_decl does not work here since it is
15517 always 1 for the above two cases. */
15519 decl = (cp_parser_maybe_treat_template_as_class
15524 {
15526 identifier,
15529 }
15532 {
15536 allow_template);
15540 }
15542 /* Forward declarations of nested types, such as
15544 class C1::C2;
15545 class C1::C2::C3;
15547 are invalid unless all components preceding the final '::'
15548 are complete. If all enclosing types are complete, these
15549 declarations become merely pointless.
15551 Invalid forward declarations of nested types are errors
15552 caught elsewhere in parsing. Those that are pointless arrive
15553 here. */
15560 }
15561 else
15562 {
15563 /* An elaborated-type-specifier sometimes introduces a new type and
15564 sometimes names an existing type. Normally, the rule is that it
15565 introduces a new type only if there is not an existing type of
15566 the same name already in scope. For example, given:
15568 struct S {};
15569 void f() { struct S s; }
15571 the `struct S' in the body of `f' is the same `struct S' as in
15572 the global scope; the existing definition is used. However, if
15573 there were no global declaration, this would introduce a new
15574 local class named `S'.
15576 An exception to this rule applies to the following code:
15578 namespace N { struct S; }
15580 Here, the elaborated-type-specifier names a new type
15581 unconditionally; even if there is already an `S' in the
15582 containing scope this declaration names a new type.
15583 This exception only applies if the elaborated-type-specifier
15584 forms the complete declaration:
15586 [class.name]
15588 A declaration consisting solely of `class-key identifier ;' is
15589 either a redeclaration of the name in the current scope or a
15590 forward declaration of the identifier as a class name. It
15591 introduces the name into the current scope.
15593 We are in this situation precisely when the next token is a `;'.
15595 An exception to the exception is that a `friend' declaration does
15596 *not* name a new type; i.e., given:
15598 struct S { friend struct T; };
15600 `T' is not a new type in the scope of `S'.
15602 Also, `new struct S' or `sizeof (struct S)' never results in the
15603 definition of a new type; a new type can only be declared in a
15604 declaration context. */
15606 tag_scope ts;
15610 /* Friends have special name lookup rules. */
15614 CPP_SEMICOLON))
15615 /* This is a `class-key identifier ;' */
15617 else
15620 template_p =
15621 (template_parm_lists_apply
15624 /* An unqualified name was used to reference this type, so
15625 there were no qualifying templates. */
15633 }
15634 }
15639 /* Allow attributes on forward declarations of classes. */
15641 {
15651 else
15654 }
15657 {
15658 /* Indicate whether this class was declared as a `class' or as a
15659 `struct'. */
15663 }
15665 /* A "<" cannot follow an elaborated type specifier. If that
15666 happens, the user was probably trying to form a template-id. */
15671 }
15673 /* Parse an enum-specifier.
15675 enum-specifier:
15676 enum-head { enumerator-list [opt] }
15677 enum-head { enumerator-list , } [C++0x]
15679 enum-head:
15680 enum-key identifier [opt] enum-base [opt]
15681 enum-key nested-name-specifier identifier enum-base [opt]
15683 enum-key:
15684 enum
15685 enum class [C++0x]
15686 enum struct [C++0x]
15688 enum-base: [C++0x]
15689 : type-specifier-seq
15691 opaque-enum-specifier:
15692 enum-key identifier enum-base [opt] ;
15694 GNU Extensions:
15695 enum-key attributes[opt] identifier [opt] enum-base [opt]
15696 { enumerator-list [opt] }attributes[opt]
15697 enum-key attributes[opt] identifier [opt] enum-base [opt]
15698 { enumerator-list, }attributes[opt] [C++0x]
15700 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15701 if the token stream isn't an enum-specifier after all. */
15703 static tree
15705 {
15706 tree identifier;
15708 tree prev_scope;
15710 tree attributes;
15723 /* Parse tentatively so that we can back up if we don't find a
15724 enum-specifier. */
15727 /* Caller guarantees that the current token is 'enum', an identifier
15728 possibly follows, and the token after that is an opening brace.
15729 If we don't have an identifier, fabricate an anonymous name for
15730 the enumeration being defined. */
15733 /* Parse the "class" or "struct", which indicates a scoped
15734 enumeration type in C++0x. */
15737 {
15741 /* Consume the `struct' or `class' token. */
15745 }
15749 /* Clear the qualification. */
15754 /* Figure out in what scope the declaration is being placed. */
15760 nested_name_specifier
15768 {
15769 tree name;
15773 enum_type,
15778 input_location);
15780 {
15783 {
15784 /* Are template enums allowed in ISO? */
15788 /* ignore a typename reference, for it will be solved by name
15789 in start_enum. */
15791 }
15792 }
15795 else
15798 }
15799 else
15800 {
15803 else
15804 {
15810 }
15811 }
15814 /* Check for the `:' that denotes a specified underlying type in C++0x.
15815 Note that a ':' could also indicate a bitfield width, however. */
15817 {
15818 cp_decl_specifier_seq type_specifiers;
15820 /* Consume the `:'. */
15823 /* Parse the type-specifier-seq. */
15828 /* At this point this is surely not elaborated type specifier. */
15837 /* If that didn't work, stop. */
15839 {
15845 }
15846 }
15848 /* Look for the `{' but don't consume it yet. */
15850 {
15852 {
15855 {
15858 }
15859 }
15860 /* An opaque-enum-specifier must have a ';' here. */
15863 {
15866 {
15869 }
15870 }
15871 }
15877 {
15879 {
15883 }
15885 {
15887 }
15888 }
15890 /* Issue an error message if type-definitions are forbidden here. */
15893 else
15894 /* Create the new type. We do this before consuming the opening
15895 brace so the enum will be recorded as being on the line of its
15896 tag (or the 'enum' keyword, if there is no tag). */
15900 /* If the next token is not '{' it is an opaque-enum-specifier or an
15901 elaborated-type-specifier. */
15903 {
15907 {
15908 /* The following catches invalid code such as:
15909 enum class S<int>::E { A, B, C }; */
15917 {
15921 nested_name_specifier);
15923 }
15924 /* If that scope does not contain the scope in which the
15925 class was originally declared, the program is invalid. */
15927 nested_name_specifier))
15928 {
15931 "declaration of %qD in namespace %qD which does not "
15934 else
15936 "declaration of %qD in %qD which does not "
15940 }
15941 }
15946 /* Consume the opening brace. */
15953 {
15957 }
15958 else
15959 {
15965 }
15969 /* If the next token is not '}', then there are some enumerators. */
15971 {
15975 }
15976 else
15979 /* Consume the final '}'. */
15985 }
15986 else
15987 {
15988 /* If a ';' follows, then it is an opaque-enum-specifier
15989 and additional restrictions apply. */
15991 {
15998 }
15999 }
16001 /* Look for trailing attributes to apply to this enumeration, and
16002 apply them if appropriate. */
16004 {
16008 trailing_attr,
16010 }
16012 /* Finish up the enumeration. */
16014 {
16019 }
16022 {
16024 {
16027 }
16029 {
16031 }
16032 }
16033 out:
16036 }
16038 /* Parse an enumerator-list. The enumerators all have the indicated
16039 TYPE.
16041 enumerator-list:
16042 enumerator-definition
16043 enumerator-list , enumerator-definition */
16045 static void
16047 {
16049 {
16050 /* Parse an enumerator-definition. */
16053 /* If the next token is not a ',', we've reached the end of
16054 the list. */
16057 /* Otherwise, consume the `,' and keep going. */
16059 /* If the next token is a `}', there is a trailing comma. */
16061 {
16066 }
16067 }
16068 }
16070 /* Parse an enumerator-definition. The enumerator has the indicated
16071 TYPE.
16073 enumerator-definition:
16074 enumerator
16075 enumerator = constant-expression
16077 enumerator:
16078 identifier */
16080 static void
16082 {
16083 tree identifier;
16084 tree value;
16085 location_t loc;
16087 /* Save the input location because we are interested in the location
16088 of the identifier and not the location of the explicit value. */
16091 /* Look for the identifier. */
16096 /* If the next token is an '=', then there is an explicit value. */
16098 {
16099 /* Consume the `=' token. */
16101 /* Parse the value. */
16103 }
16104 else
16107 /* If we are processing a template, make sure the initializer of the
16108 enumerator doesn't contain any bare template parameter pack. */
16112 /* Create the enumerator. */
16114 }
16116 /* Parse a namespace-name.
16118 namespace-name:
16119 original-namespace-name
16120 namespace-alias
16122 Returns the NAMESPACE_DECL for the namespace. */
16124 static tree
16126 {
16127 tree identifier;
16128 tree namespace_decl;
16132 /* Get the name of the namespace. */
16137 /* Look up the identifier in the currently active scope. Look only
16138 for namespaces, due to:
16140 [basic.lookup.udir]
16142 When looking up a namespace-name in a using-directive or alias
16143 definition, only namespace names are considered.
16145 And:
16147 [basic.lookup.qual]
16149 During the lookup of a name preceding the :: scope resolution
16150 operator, object, function, and enumerator names are ignored.
16152 (Note that cp_parser_qualifying_entity only calls this
16153 function if the token after the name is the scope resolution
16154 operator.) */
16156 none_type,
16162 /* If it's not a namespace, issue an error. */
16165 {
16170 }
16173 }
16175 /* Parse a namespace-definition.
16177 namespace-definition:
16178 named-namespace-definition
16179 unnamed-namespace-definition
16181 named-namespace-definition:
16182 original-namespace-definition
16183 extension-namespace-definition
16185 original-namespace-definition:
16186 namespace identifier { namespace-body }
16188 extension-namespace-definition:
16189 namespace original-namespace-name { namespace-body }
16191 unnamed-namespace-definition:
16192 namespace { namespace-body } */
16194 static void
16196 {
16203 {
16207 }
16208 else
16211 /* Look for the `namespace' keyword. */
16214 /* Get the name of the namespace. We do not attempt to distinguish
16215 between an original-namespace-definition and an
16216 extension-namespace-definition at this point. The semantic
16217 analysis routines are responsible for that. */
16220 else
16223 /* Parse any specified attributes. */
16226 /* Look for the `{' to start the namespace. */
16228 /* Start the namespace. */
16231 /* "inline namespace" is equivalent to a stub namespace definition
16232 followed by a strong using directive. */
16234 {
16237 /* Set up namespace association. */
16241 /* Import the contents of the inline namespace. */
16245 }
16249 /* Parse the body of the namespace. */
16255 /* Finish the namespace. */
16257 /* Look for the final `}'. */
16259 }
16261 /* Parse a namespace-body.
16263 namespace-body:
16264 declaration-seq [opt] */
16266 static void
16268 {
16270 }
16272 /* Parse a namespace-alias-definition.
16274 namespace-alias-definition:
16275 namespace identifier = qualified-namespace-specifier ; */
16277 static void
16279 {
16280 tree identifier;
16281 tree namespace_specifier;
16285 /* Look for the `namespace' keyword. */
16287 /* Look for the identifier. */
16291 /* Look for the `=' token. */
16294 {
16296 /* Skip the definition. */
16301 }
16303 /* Look for the qualified-namespace-specifier. */
16304 namespace_specifier
16306 /* Look for the `;' token. */
16309 /* Register the alias in the symbol table. */
16311 }
16313 /* Parse a qualified-namespace-specifier.
16315 qualified-namespace-specifier:
16316 :: [opt] nested-name-specifier [opt] namespace-name
16318 Returns a NAMESPACE_DECL corresponding to the specified
16319 namespace. */
16321 static tree
16323 {
16324 /* Look for the optional `::'. */
16328 /* Look for the optional nested-name-specifier. */
16336 }
16338 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16339 access declaration.
16341 using-declaration:
16342 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16343 using :: unqualified-id ;
16345 access-declaration:
16346 qualified-id ;
16348 */
16350 static bool
16353 {
16357 tree decl;
16358 tree identifier;
16359 tree qscope;
16364 {
16367 }
16368 else
16369 {
16370 /* Look for the `using' keyword. */
16373 /* Peek at the next token. */
16375 /* See if it's `typename'. */
16377 {
16378 /* Remember that we've seen it. */
16380 /* Consume the `typename' token. */
16382 }
16383 }
16385 /* Look for the optional global scope qualification. */
16386 global_scope_p
16391 /* If we saw `typename', or didn't see `::', then there must be a
16392 nested-name-specifier present. */
16394 {
16400 {
16403 }
16404 }
16405 /* Otherwise, we could be in either of the two productions. In that
16406 case, treat the nested-name-specifier as optional. */
16407 else
16419 /* Something has already gone wrong; there's no need to parse
16420 further. Since an error has occurred, the return value of
16421 cp_parser_parse_definitely will be false, as required. */
16425 /* Parse the unqualified-id. */
16433 {
16438 }
16440 /* The function we call to handle a using-declaration is different
16441 depending on what scope we are in. */
16443 ;
16446 /* [namespace.udecl]
16448 A using declaration shall not name a template-id. */
16451 else
16452 {
16454 {
16455 /* Create the USING_DECL. */
16462 {
16465 }
16466 else
16467 /* Add it to the list of members in this class. */
16469 }
16470 else
16471 {
16473 identifier,
16480 {
16483 }
16486 else
16488 }
16489 }
16491 /* Look for the final `;'. */
16496 "access declarations are deprecated "
16497 "in favour of using-declarations; "
16501 }
16503 /* Parse an alias-declaration.
16505 alias-declaration:
16506 using identifier attribute-specifier-seq [opt] = type-id */
16508 static tree
16510 {
16512 location_t id_location;
16514 cp_decl_specifier_seq decl_specs;
16518 /* Look for the `using' keyword. */
16519 cp_token *using_token
16541 /* Now we are going to parse the type-id of the declaration. */
16543 /*
16544 [dcl.type]/3 says:
16546 "A type-specifier-seq shall not define a class or enumeration
16547 unless it appears in the type-id of an alias-declaration (7.1.3) that
16548 is not the declaration of a template-declaration."
16550 In other words, if we currently are in an alias template, the
16551 type-id should not define a type.
16553 So let's set parser->type_definition_forbidden_message in that
16554 case; cp_parser_check_type_definition (called by
16555 cp_parser_class_specifier) will then emit an error if a type is
16556 defined in the type-id. */
16558 {
16562 }
16566 /* Restore the error message if need be. */
16572 {
16575 }
16577 /* A typedef-name can also be introduced by an alias-declaration. The
16578 identifier following the using keyword becomes a typedef-name. It has
16579 the same semantics as if it were introduced by the typedef
16580 specifier. In particular, it does not define a new type and it shall
16581 not appear in the type-id. */
16586 {
16589 ds_attribute,
16590 attrs_token);
16591 }
16593 ds_typedef,
16594 using_token);
16596 ds_alias,
16597 using_token);
16606 else
16617 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16618 added into the symbol table; otherwise, return the TYPE_DECL. */
16622 {
16626 }
16629 }
16631 /* Parse a using-directive.
16633 using-directive:
16634 using namespace :: [opt] nested-name-specifier [opt]
16635 namespace-name ; */
16637 static void
16639 {
16640 tree namespace_decl;
16641 tree attribs;
16643 /* Look for the `using' keyword. */
16645 /* And the `namespace' keyword. */
16647 /* Look for the optional `::' operator. */
16649 /* And the optional nested-name-specifier. */
16655 /* Get the namespace being used. */
16657 /* And any specified attributes. */
16659 /* Update the symbol table. */
16661 /* Look for the final `;'. */
16663 }
16665 /* Parse an asm-definition.
16667 asm-definition:
16668 asm ( string-literal ) ;
16670 GNU Extension:
16672 asm-definition:
16673 asm volatile [opt] ( string-literal ) ;
16674 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16675 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16676 : asm-operand-list [opt] ) ;
16677 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16678 : asm-operand-list [opt]
16679 : asm-clobber-list [opt] ) ;
16680 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16681 : asm-clobber-list [opt]
16682 : asm-goto-list ) ; */
16684 static void
16686 {
16687 tree string;
16692 tree asm_stmt;
16700 /* Look for the `asm' keyword. */
16705 {
16708 }
16710 /* See if the next token is `volatile'. */
16713 {
16714 /* Remember that we saw the `volatile' keyword. */
16716 /* Consume the token. */
16718 }
16722 {
16723 /* Remember that we saw the `goto' keyword. */
16725 /* Consume the token. */
16727 }
16728 /* Look for the opening `('. */
16731 /* Look for the string. */
16734 {
16738 }
16740 /* If we're allowing GNU extensions, check for the extended assembly
16741 syntax. Unfortunately, the `:' tokens need not be separated by
16742 a space in C, and so, for compatibility, we tolerate that here
16743 too. Doing that means that we have to treat the `::' operator as
16744 two `:' tokens. */
16749 {
16754 /* The extended syntax was used. */
16757 /* Look for outputs. */
16759 {
16760 /* Consume the `:'. */
16762 /* Parse the output-operands. */
16764 CPP_COLON)
16766 CPP_SCOPE)
16768 CPP_CLOSE_PAREN)
16774 }
16775 /* If the next token is `::', there are no outputs, and the
16776 next token is the beginning of the inputs. */
16778 /* The inputs are coming next. */
16781 /* Look for inputs. */
16784 {
16785 /* Consume the `:' or `::'. */
16787 /* Parse the output-operands. */
16789 CPP_COLON)
16791 CPP_SCOPE)
16793 CPP_CLOSE_PAREN))
16798 }
16800 /* The clobbers are coming next. */
16803 /* Look for clobbers. */
16806 {
16808 /* Consume the `:' or `::'. */
16810 /* Parse the clobbers. */
16812 CPP_COLON)
16814 CPP_CLOSE_PAREN))
16816 }
16819 /* The labels are coming next. */
16822 /* Look for labels. */
16825 {
16827 /* Consume the `:' or `::'. */
16829 /* Parse the labels. */
16831 }
16835 }
16839 /* Look for the closing `)'. */
16847 {
16848 /* Create the ASM_EXPR. */
16850 {
16853 /* If the extended syntax was not used, mark the ASM_EXPR. */
16855 {
16861 }
16862 }
16863 else
16865 }
16866 }
16868 /* Declarators [gram.dcl.decl] */
16870 /* Parse an init-declarator.
16872 init-declarator:
16873 declarator initializer [opt]
16875 GNU Extension:
16877 init-declarator:
16878 declarator asm-specification [opt] attributes [opt] initializer [opt]
16880 function-definition:
16881 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16882 function-body
16883 decl-specifier-seq [opt] declarator function-try-block
16885 GNU Extension:
16887 function-definition:
16888 __extension__ function-definition
16890 TM Extension:
16892 function-definition:
16893 decl-specifier-seq [opt] declarator function-transaction-block
16895 The DECL_SPECIFIERS apply to this declarator. Returns a
16896 representation of the entity declared. If MEMBER_P is TRUE, then
16897 this declarator appears in a class scope. The new DECL created by
16898 this declarator is returned.
16900 The CHECKS are access checks that should be performed once we know
16901 what entity is being declared (and, therefore, what classes have
16902 befriended it).
16904 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16905 for a function-definition here as well. If the declarator is a
16906 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16907 be TRUE upon return. By that point, the function-definition will
16908 have been completely parsed.
16910 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16911 is FALSE.
16913 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16914 parsed declaration if it is an uninitialized single declarator not followed
16915 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16916 if present, will not be consumed. If returned, this declarator will be
16917 created with SD_INITIALIZED but will not call cp_finish_decl.
16919 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16920 and there is an initializer, the pointed location_t is set to the
16921 location of the '=' or `(', or '{' in C++11 token introducing the
16922 initializer. */
16924 static tree
16934 {
16938 tree prefix_attributes;
16940 tree asm_specification;
16941 tree initializer;
16943 tree scope;
16945 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16946 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16947 "(...)". */
16958 /* Gather the attributes that were provided with the
16959 decl-specifiers. */
16962 /* Assume that this is not the declarator for a function
16963 definition. */
16967 /* Default arguments are only permitted for function parameters. */
16971 /* Defer access checks while parsing the declarator; we cannot know
16972 what names are accessible until we know what is being
16973 declared. */
16976 /* Parse the declarator. */
16978 declarator
16983 /* Gather up the deferred checks. */
16988 /* If the DECLARATOR was erroneous, there's no need to go
16989 further. */
16993 /* Check that the number of template-parameter-lists is OK. */
17003 /* Figure out what scope the entity declared by the DECLARATOR is
17004 located in. `grokdeclarator' sometimes changes the scope, so
17005 we compute it now. */
17008 /* Perform any lookups in the declared type which were thought to be
17009 dependent, but are not in the scope of the declarator. */
17010 decl_specifiers->type
17013 /* If we're allowing GNU extensions, look for an
17014 asm-specification. */
17016 {
17017 /* Look for an asm-specification. */
17020 }
17021 else
17024 /* Look for attributes. */
17028 /* Peek at the next token. */
17034 {
17035 /* Check to see if the token indicates the start of a
17036 function-definition. */
17038 {
17040 {
17041 /* If a function-definition should not appear here, issue an
17042 error message. */
17046 }
17048 location_t func_brace_location
17051 /* Neither attributes nor an asm-specification are allowed
17052 on a function-definition. */
17055 "an asm-specification is not allowed "
17059 "attributes are not allowed "
17061 /* This is a function-definition. */
17064 /* Parse the function definition. */
17067 decl_specifiers,
17068 declarator,
17069 prefix_attributes);
17070 else
17071 decl =
17072 (cp_parser_function_definition_from_specifiers_and_declarator
17076 {
17077 /* This is where the prologue starts... */
17080 }
17083 }
17084 }
17086 {
17087 /* A non-template declaration involving a function parameter list
17088 containing an implicit template parameter will be made into a
17089 template. If the resulting declaration is not going to be an
17090 actual function then finish the template scope here to prevent it.
17091 An error message will be issued once we have a decl to talk about.
17093 FIXME probably we should do type deduction rather than create an
17094 implicit template, but the standard currently doesn't allow it. */
17097 }
17099 /* [dcl.dcl]
17101 Only in function declarations for constructors, destructors, and
17102 type conversions can the decl-specifier-seq be omitted.
17104 We explicitly postpone this check past the point where we handle
17105 function-definitions because we tolerate function-definitions
17106 that are missing their return types in some modes. */
17108 {
17112 }
17114 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17118 {
17129 {
17135 }
17136 }
17137 else
17138 {
17139 /* If the init-declarator isn't initialized and isn't followed by a
17140 `,' or `;', it's not a valid init-declarator. */
17143 {
17146 else
17147 {
17151 }
17152 }
17155 }
17157 /* Because start_decl has side-effects, we should only call it if we
17158 know we're going ahead. By this point, we know that we cannot
17159 possibly be looking at any other construct. */
17162 /* Enter the newly declared entry in the symbol table. If we're
17163 processing a declaration in a class-specifier, we wait until
17164 after processing the initializer. */
17166 {
17173 /* Adjust location of decl if declarator->id_loc is more appropriate:
17174 set, and decl wasn't merged with another decl, in which case its
17175 location would be different from input_location, and more accurate. */
17180 }
17182 /* Enter the SCOPE. That way unqualified names appearing in the
17183 initializer will be looked up in SCOPE. */
17186 /* Perform deferred access control checks, now that we know in which
17187 SCOPE the declared entity resides. */
17189 {
17192 /* If the entity being declared is a function, pretend that we
17193 are in its scope. If it is a `friend', it may have access to
17194 things that would not otherwise be accessible. */
17196 {
17199 }
17201 /* Perform access checks for template parameters. */
17204 /* Perform the access control checks for the declarator and the
17205 decl-specifiers. */
17208 /* Restore the saved value. */
17211 }
17213 /* Parse the initializer. */
17218 {
17220 {
17223 else
17224 {
17225 /* If the declaration was erroneous, we don't really
17226 know what the user intended, so just silently
17227 consume the initializer. */
17234 }
17235 }
17236 else
17237 {
17238 /* We want to record the extra mangling scope for in-class
17239 initializers of class members and initializers of static data
17240 member templates. The former involves deferring
17241 parsing of the initializer until end of class as with default
17242 arguments. So right here we only handle the latter. */
17252 }
17253 }
17255 /* The old parser allows attributes to appear after a parenthesized
17256 initializer. Mark Mitchell proposed removing this functionality
17257 on the GCC mailing lists on 2002-08-13. This parser accepts the
17258 attributes -- but ignores them. */
17265 /* And now complain about a non-function implicit template. */
17270 /* For an in-class declaration, use `grokfield' to create the
17271 declaration. */
17273 {
17275 {
17278 }
17286 }
17288 /* Finish processing the declaration. But, skip member
17289 declarations. */
17291 {
17294 asm_specification,
17295 /* If the initializer is in parentheses, then this is
17296 a direct-initialization, which means that an
17297 `explicit' constructor is OK. Otherwise, an
17298 `explicit' constructor cannot be used. */
17301 }
17304 /* Core issue #226 (C++0x only): A default template-argument
17305 shall not be specified in a friend class template
17306 declaration. */
17315 {
17318 else
17320 }
17323 }
17325 /* Parse a declarator.
17327 declarator:
17328 direct-declarator
17329 ptr-operator declarator
17331 abstract-declarator:
17332 ptr-operator abstract-declarator [opt]
17333 direct-abstract-declarator
17335 GNU Extensions:
17337 declarator:
17338 attributes [opt] direct-declarator
17339 attributes [opt] ptr-operator declarator
17341 abstract-declarator:
17342 attributes [opt] ptr-operator abstract-declarator [opt]
17343 attributes [opt] direct-abstract-declarator
17345 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17346 detect constructor, destructor or conversion operators. It is set
17347 to -1 if the declarator is a name, and +1 if it is a
17348 function. Otherwise it is set to zero. Usually you just want to
17349 test for >0, but internally the negative value is used.
17351 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17352 a decl-specifier-seq unless it declares a constructor, destructor,
17353 or conversion. It might seem that we could check this condition in
17354 semantic analysis, rather than parsing, but that makes it difficult
17355 to handle something like `f()'. We want to notice that there are
17356 no decl-specifiers, and therefore realize that this is an
17357 expression, not a declaration.)
17359 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17360 the declarator is a direct-declarator of the form "(...)".
17362 MEMBER_P is true iff this declarator is a member-declarator.
17364 FRIEND_P is true iff this declarator is a friend. */
17368 cp_parser_declarator_kind dcl_kind,
17372 {
17375 cp_cv_quals cv_quals;
17376 tree class_type;
17379 /* Assume this is not a constructor, destructor, or type-conversion
17380 operator. */
17387 /* Check for the ptr-operator production. */
17389 /* Parse the ptr-operator. */
17395 /* If that worked, then we have a ptr-operator. */
17397 {
17398 /* If a ptr-operator was found, then this declarator was not
17399 parenthesized. */
17402 /* The dependent declarator is optional if we are parsing an
17403 abstract-declarator. */
17407 /* Parse the dependent declarator. */
17412 friend_p);
17414 /* If we are parsing an abstract-declarator, we must handle the
17415 case where the dependent declarator is absent. */
17420 declarator = cp_parser_make_indirect_declarator
17422 }
17423 /* Everything else is a direct-declarator. */
17424 else
17425 {
17428 CPP_OPEN_PAREN);
17430 ctor_dtor_or_conv_p,
17432 }
17437 }
17439 /* Parse a direct-declarator or direct-abstract-declarator.
17441 direct-declarator:
17442 declarator-id
17443 direct-declarator ( parameter-declaration-clause )
17444 cv-qualifier-seq [opt]
17445 ref-qualifier [opt]
17446 exception-specification [opt]
17447 direct-declarator [ constant-expression [opt] ]
17448 ( declarator )
17450 direct-abstract-declarator:
17451 direct-abstract-declarator [opt]
17452 ( parameter-declaration-clause )
17453 cv-qualifier-seq [opt]
17454 ref-qualifier [opt]
17455 exception-specification [opt]
17456 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17457 ( abstract-declarator )
17459 Returns a representation of the declarator. DCL_KIND is
17460 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17461 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17462 we are parsing a direct-declarator. It is
17463 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17464 of ambiguity we prefer an abstract declarator, as per
17465 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17466 as for cp_parser_declarator. */
17470 cp_parser_declarator_kind dcl_kind,
17473 {
17483 {
17484 /* Peek at the next token. */
17487 {
17488 /* This is either a parameter-declaration-clause, or a
17489 parenthesized declarator. When we know we are parsing a
17490 named declarator, it must be a parenthesized declarator
17491 if FIRST is true. For instance, `(int)' is a
17492 parameter-declaration-clause, with an omitted
17493 direct-abstract-declarator. But `((*))', is a
17494 parenthesized abstract declarator. Finally, when T is a
17495 template parameter `(T)' is a
17496 parameter-declaration-clause, and not a parenthesized
17497 named declarator.
17499 We first try and parse a parameter-declaration-clause,
17500 and then try a nested declarator (if FIRST is true).
17502 It is not an error for it not to be a
17503 parameter-declaration-clause, even when FIRST is
17504 false. Consider,
17506 int i (int);
17507 int i (3);
17509 The first is the declaration of a function while the
17510 second is the definition of a variable, including its
17511 initializer.
17513 Having seen only the parenthesis, we cannot know which of
17514 these two alternatives should be selected. Even more
17515 complex are examples like:
17517 int i (int (a));
17518 int i (int (3));
17520 The former is a function-declaration; the latter is a
17521 variable initialization.
17523 Thus again, we try a parameter-declaration-clause, and if
17524 that fails, we back out and return. */
17527 {
17528 tree params;
17531 /* In a member-declarator, the only valid interpretation
17532 of a parenthesis is the start of a
17533 parameter-declaration-clause. (It is invalid to
17534 initialize a static data member with a parenthesized
17535 initializer; only the "=" form of initialization is
17536 permitted.) */
17540 /* Consume the `('. */
17543 {
17544 /* If this is going to be an abstract declarator, we're
17545 in a declarator and we can't have default args. */
17548 }
17552 /* Parse the parameter-declaration-clause. */
17555 /* Consume the `)'. */
17558 /* If all went well, parse the cv-qualifier-seq,
17559 ref-qualifier and the exception-specification. */
17561 {
17562 cp_cv_quals cv_quals;
17563 cp_virt_specifiers virt_specifiers;
17564 cp_ref_qualifier ref_qual;
17565 tree exception_specification;
17566 tree late_return;
17567 tree attrs;
17577 /* Parse the cv-qualifier-seq. */
17579 /* Parse the ref-qualifier. */
17581 /* And the exception-specification. */
17582 exception_specification
17587 /* In here, we handle cases where attribute is used after
17588 the function declaration. For example:
17589 void func (int x) __attribute__((vector(..))); */
17592 {
17596 CPP_SEMICOLON)
17598 CPP_OPEN_BRACE))
17601 ;
17602 else
17604 }
17605 late_return = (cp_parser_late_return_type_opt
17610 /* Parse the virt-specifier-seq. */
17613 /* Create the function-declarator. */
17615 params,
17616 cv_quals,
17617 virt_specifiers,
17618 ref_qual,
17619 exception_specification,
17620 late_return);
17622 /* Any subsequent parameter lists are to do with
17623 return type, so are not those of the declared
17624 function. */
17626 }
17628 /* Remove the function parms from scope. */
17632 /* Repeat the main loop. */
17634 }
17636 /* If this is the first, we can try a parenthesized
17637 declarator. */
17639 {
17645 /* Consume the `('. */
17647 /* Parse the nested declarator. */
17650 declarator
17656 /* Expect a `)'. */
17663 }
17664 /* Otherwise, we must be done. */
17665 else
17667 }
17671 {
17672 /* Parse an array-declarator. */
17681 /* Consume the `['. */
17683 /* Peek at the next token. */
17685 /* If the next token is `]', then there is no
17686 constant-expression. */
17688 {
17690 bounds
17700 {
17701 /* Normally, the array bound must be an integral constant
17702 expression. However, as an extension, we allow VLAs
17703 in function scopes as long as they aren't part of a
17704 parameter declaration. */
17708 }
17711 {
17712 /* Remember this wasn't a constant-expression. */
17715 }
17716 }
17717 else
17719 /* Look for the closing `]'. */
17721 {
17724 }
17729 }
17731 {
17732 {
17733 tree qualifying_scope;
17734 tree unqualified_name;
17735 tree attrs;
17736 special_function_kind sfk;
17741 /* Parse a declarator-id */
17744 {
17747 /* If we see an ellipsis, we should be looking at a
17748 parameter pack. */
17750 {
17751 /* Consume the `...' */
17755 }
17756 }
17759 unqualified_name
17763 {
17767 {
17768 /* Check whether an error occurred. */
17771 /* We already consumed the ellipsis to mark a
17772 parameter pack, but we have no way to report it,
17773 so abort the tentative parse. We will be exiting
17774 immediately anyway. */
17776 }
17777 else
17783 && (qualifying_scope
17785 {
17788 }
17789 }
17794 {
17799 }
17805 {
17806 /* In the declaration of a member of a template class
17807 outside of the class itself, the SCOPE will sometimes
17808 be a TYPENAME_TYPE. For example, given:
17810 template <typename T>
17811 int S<T>::R::i = 3;
17813 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17814 this context, we must resolve S<T>::R to an ordinary
17815 type, rather than a typename type.
17817 The reason we normally avoid resolving TYPENAME_TYPEs
17818 is that a specialization of `S' might render
17819 `S<T>::R' not a type. However, if `S' is
17820 specialized, then this `i' will not be used, so there
17821 is no harm in resolving the types here. */
17822 tree type;
17824 /* Resolve the TYPENAME_TYPE. */
17827 /* If that failed, the declarator is invalid. */
17829 {
17832 "cannot define member of dependent typedef "
17834 else
17839 }
17841 }
17846 {
17847 tree class_type;
17852 else
17856 {
17859 {
17862 {
17866 "use %<%T::%D%> instead of %<%T::%D%> to "
17868 class_type,
17873 }
17874 else
17876 }
17877 else
17878 {
17879 /* We do not attempt to print the declarator
17880 here because we do not have enough
17881 information about its original syntactic
17882 form. */
17886 }
17887 }
17890 {
17896 for an anonymous type, even if the type
17897 got a name for linkage purposes. */
17899 /* Handle correctly (c++/19200):
17901 struct S {
17902 struct T{};
17903 friend void S(T);
17904 };
17906 and also:
17908 namespace N {
17909 void S();
17910 }
17912 struct S {
17913 friend void N::S();
17914 }; */
17915 && !(friend_p
17918 class_type))
17919 {
17922 }
17930 }
17931 }
17933 unqualified_name,
17934 sfk);
17941 }
17943 handle_declarator:;
17946 {
17947 /* Any names that appear after the declarator-id for a
17948 member are looked up in the containing scope. */
17950 {
17951 /* But declarations with qualified-ids can't appear in a
17952 function. */
17956 }
17958 }
17962 /* Default args are only allowed on function
17963 declarations. */
17965 else
17969 }
17970 /* We're done. */
17971 else
17973 }
17975 /* For an abstract declarator, we might wind up with nothing at this
17976 point. That's an error; the declarator is not optional. */
17980 /* If we entered a scope, we must exit it now. */
17988 }
17990 /* Parse a ptr-operator.
17992 ptr-operator:
17993 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17994 * cv-qualifier-seq [opt]
17995 &
17996 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17997 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17999 GNU Extension:
18001 ptr-operator:
18002 & cv-qualifier-seq [opt]
18004 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18005 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18006 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18007 filled in with the TYPE containing the member. *CV_QUALS is
18008 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18009 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18010 Note that the tree codes returned by this function have nothing
18011 to do with the types of trees that will be eventually be created
18012 to represent the pointer or reference type being parsed. They are
18013 just constants with suggestive names. */
18014 static enum tree_code
18019 {
18024 /* Assume that it's not a pointer-to-member. */
18026 /* And that there are no cv-qualifiers. */
18029 /* Peek at the next token. */
18032 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18042 {
18043 /* Consume the `*', `&' or `&&'. */
18046 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18047 `&', if we are allowing GNU extensions. (The only qualifier
18048 that can legally appear after `&' is `restrict', but that is
18049 enforced during semantic analysis. */
18057 }
18058 else
18059 {
18060 /* Try the pointer-to-member case. */
18062 /* Look for the optional `::' operator. */
18065 /* Look for the nested-name specifier. */
18072 /* If we found it, and the next token is a `*', then we are
18073 indeed looking at a pointer-to-member operator. */
18076 {
18077 /* Indicate that the `*' operator was used. */
18085 else
18086 {
18087 /* The type of which the member is a member is given by the
18088 current SCOPE. */
18090 /* The next name will not be qualified. */
18094 /* Look for optional c++11 attributes. */
18098 /* Look for the optional cv-qualifier-seq. */
18100 }
18101 }
18102 /* If that didn't work we don't have a ptr-operator. */
18105 }
18108 }
18110 /* Parse an (optional) cv-qualifier-seq.
18112 cv-qualifier-seq:
18113 cv-qualifier cv-qualifier-seq [opt]
18115 cv-qualifier:
18116 const
18117 volatile
18119 GNU Extension:
18121 cv-qualifier:
18122 __restrict__
18124 Returns a bitmask representing the cv-qualifiers. */
18126 static cp_cv_quals
18128 {
18132 {
18134 cp_cv_quals cv_qualifier;
18136 /* Peek at the next token. */
18138 /* See if it's a cv-qualifier. */
18140 {
18156 }
18162 {
18165 }
18166 else
18167 {
18170 }
18171 }
18174 }
18176 /* Parse an (optional) ref-qualifier
18178 ref-qualifier:
18179 &
18180 &&
18182 Returns cp_ref_qualifier representing ref-qualifier. */
18184 static cp_ref_qualifier
18186 {
18189 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18194 {
18199 {
18211 }
18216 {
18219 }
18220 else
18221 {
18224 }
18225 }
18228 }
18230 /* Parse an (optional) virt-specifier-seq.
18232 virt-specifier-seq:
18233 virt-specifier virt-specifier-seq [opt]
18235 virt-specifier:
18236 override
18237 final
18239 Returns a bitmask representing the virt-specifiers. */
18241 static cp_virt_specifiers
18243 {
18247 {
18249 cp_virt_specifiers virt_specifier;
18251 /* Peek at the next token. */
18253 /* See if it's a virt-specifier-qualifier. */
18257 {
18260 }
18262 {
18265 }
18267 {
18269 }
18270 else
18274 {
18277 }
18278 else
18279 {
18282 }
18283 }
18285 }
18287 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18288 is in scope even though it isn't real. */
18290 void
18292 {
18293 tree this_parm;
18296 {
18297 /* We don't clear this between NSDMIs. Is it already what we want? */
18302 }
18305 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18307 current_class_ref
18310 }
18312 /* Return true iff our current scope is a non-static data member
18313 initializer. */
18315 bool
18317 {
18318 /* We recognize NSDMI context by the context-less 'this' pointer set up
18319 by the function above. */
18325 }
18327 /* Parse a late-specified return type, if any. This is not a separate
18328 non-terminal, but part of a function declarator, which looks like
18330 -> trailing-type-specifier-seq abstract-declarator(opt)
18332 Returns the type indicated by the type-id.
18334 In addition to this this parses any queued up omp declare simd
18335 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18337 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18338 function. */
18340 static tree
18342 cp_cv_quals quals)
18343 {
18347 && declarator
18353 /* Peek at the next token. */
18355 /* A late-specified return type is indicated by an initial '->'. */
18362 {
18363 /* DR 1207: 'this' is in scope in the trailing return type. */
18365 }
18368 {
18369 /* Consume the ->. */
18373 }
18376 declarator->std_attributes
18380 declarator->std_attributes
18385 {
18388 }
18391 }
18393 /* Parse a declarator-id.
18395 declarator-id:
18396 id-expression
18397 :: [opt] nested-name-specifier [opt] type-name
18399 In the `id-expression' case, the value returned is as for
18400 cp_parser_id_expression if the id-expression was an unqualified-id.
18401 If the id-expression was a qualified-id, then a SCOPE_REF is
18402 returned. The first operand is the scope (either a NAMESPACE_DECL
18403 or TREE_TYPE), but the second is still just a representation of an
18404 unqualified-id. */
18406 static tree
18408 {
18409 tree id;
18410 /* The expression must be an id-expression. Assume that qualified
18411 names are the names of types so that:
18413 template <class T>
18414 int S<T>::R::i = 3;
18416 will work; we must treat `S<T>::R' as the name of a type.
18417 Similarly, assume that qualified names are templates, where
18418 required, so that:
18420 template <class T>
18421 int S<T>::R<T>::i = 3;
18423 will work, too. */
18429 optional_p);
18433 }
18435 /* Parse a type-id.
18437 type-id:
18438 type-specifier-seq abstract-declarator [opt]
18440 Returns the TYPE specified. */
18442 static tree
18445 {
18446 cp_decl_specifier_seq type_specifier_seq;
18449 /* Parse the type-specifier-seq. */
18451 is_trailing_return,
18456 /* There might or might not be an abstract declarator. */
18458 /* Look for the declarator. */
18459 abstract_declarator
18464 /* Check to see if there really was a declarator. */
18469 /* None of the valid uses of 'auto' in C++14 involve the type-id
18470 nonterminal, but it is valid in a trailing-return-type. */
18473 {
18474 /* A type-id with type 'auto' is only ok if the abstract declarator
18475 is a function declarator with a late-specified return type. */
18480 else
18481 {
18484 }
18485 }
18488 is_template_arg);
18489 }
18492 {
18494 }
18497 {
18498 tree r;
18500 parser->type_definition_forbidden_message
18505 {
18508 }
18510 }
18513 {
18515 }
18517 /* Parse a type-specifier-seq.
18519 type-specifier-seq:
18520 type-specifier type-specifier-seq [opt]
18522 GNU extension:
18524 type-specifier-seq:
18525 attributes type-specifier-seq [opt]
18527 If IS_DECLARATION is true, we are at the start of a "condition" or
18528 exception-declaration, so we might be followed by a declarator-id.
18530 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18531 i.e. we've just seen "->".
18533 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18535 static void
18540 {
18545 /* Clear the TYPE_SPECIFIER_SEQ. */
18548 /* In the context of a trailing return type, enum E { } is an
18549 elaborated-type-specifier followed by a function-body, not an
18550 enum-specifier. */
18554 /* Parse the type-specifiers and attributes. */
18556 {
18557 tree type_specifier;
18560 /* Check for attributes first. */
18562 {
18567 }
18569 /* record the token of the beginning of the type specifier seq,
18570 for error reporting purposes*/
18574 /* Look for the type-specifier. */
18576 flags,
18577 type_specifier_seq,
18579 NULL,
18582 {
18583 /* If the first type-specifier could not be found, this is not a
18584 type-specifier-seq at all. */
18586 {
18587 /* Set in_declarator_p to avoid skipping to the semicolon. */
18599 }
18600 /* If subsequent type-specifiers could not be found, the
18601 type-specifier-seq is complete. */
18603 }
18606 /* The standard says that a condition can be:
18608 type-specifier-seq declarator = assignment-expression
18610 However, given:
18612 struct S {};
18613 if (int S = ...)
18615 we should treat the "S" as a declarator, not as a
18616 type-specifier. The standard doesn't say that explicitly for
18617 type-specifier-seq, but it does say that for
18618 decl-specifier-seq in an ordinary declaration. Perhaps it
18619 would be clearer just to allow a decl-specifier-seq here, and
18620 then add a semantic restriction that if any decl-specifiers
18621 that are not type-specifiers appear, the program is invalid. */
18624 }
18625 }
18627 /* Return whether the function currently being declared has an associated
18628 template parameter list. */
18630 static bool
18632 {
18645 }
18647 /* Parse a parameter-declaration-clause.
18649 parameter-declaration-clause:
18650 parameter-declaration-list [opt] ... [opt]
18651 parameter-declaration-list , ...
18653 Returns a representation for the parameter declarations. A return
18654 value of NULL indicates a parameter-declaration-clause consisting
18655 only of an ellipsis. */
18657 static tree
18659 {
18660 tree parameters;
18669 parser->auto_is_implicit_function_template_parm_p
18671 }
18677 && !processing_template_parmlist
18683 /* Peek at the next token. */
18685 /* Check for trivial parameter-declaration-clauses. */
18687 {
18688 /* Consume the `...' token. */
18691 }
18693 /* There are no parameters. */
18694 {
18695 #ifndef NO_IMPLICIT_EXTERN_C
18700 else
18701 #endif
18703 }
18704 /* Check for `(void)', too, which is a special case. */
18708 {
18709 /* Consume the `void' token. */
18711 /* There are no parameters. */
18713 }
18715 /* Parse the parameter-declaration-list. */
18717 /* If a parse error occurred while parsing the
18718 parameter-declaration-list, then the entire
18719 parameter-declaration-clause is erroneous. */
18723 /* Peek at the next token. */
18725 /* If it's a `,', the clause should terminate with an ellipsis. */
18727 {
18728 /* Consume the `,'. */
18730 /* Expect an ellipsis. */
18731 ellipsis_p
18733 }
18734 /* It might also be `...' if the optional trailing `,' was
18735 omitted. */
18737 {
18738 /* Consume the `...' token. */
18740 /* And remember that we saw it. */
18742 }
18743 else
18746 /* Finish the parameter list. */
18751 }
18753 /* Parse a parameter-declaration-list.
18755 parameter-declaration-list:
18756 parameter-declaration
18757 parameter-declaration-list , parameter-declaration
18759 Returns a representation of the parameter-declaration-list, as for
18760 cp_parser_parameter_declaration_clause. However, the
18761 `void_list_node' is never appended to the list. Upon return,
18762 *IS_ERROR will be true iff an error occurred. */
18764 static tree
18766 {
18772 /* Assume all will go well. */
18774 /* The special considerations that apply to a function within an
18775 unbraced linkage specifications do not apply to the parameters
18776 to the function. */
18777 saved_in_unbraced_linkage_specification_p
18781 /* Look for more parameters. */
18783 {
18791 /* Parse the parameter. */
18792 parameter
18797 /* We don't know yet if the enclosing context is deprecated, so wait
18798 and warn in grokparms if appropriate. */
18802 {
18803 /* If a function parameter pack was specified and an implicit template
18804 parameter was introduced during cp_parser_parameter_declaration,
18805 change any implicit parameters introduced into packs. */
18809 {
18817 }
18821 PARM,
18824 }
18828 /* If a parse error occurred parsing the parameter declaration,
18829 then the entire parameter-declaration-list is erroneous. */
18831 {
18835 }
18845 {
18849 }
18851 /* Add the new parameter to the list. */
18855 /* Peek at the next token. */
18858 /* These are for Objective-C++ */
18861 /* The parameter-declaration-list is complete. */
18864 {
18867 /* Peek at the next token. */
18869 /* If it's an ellipsis, then the list is complete. */
18872 /* Otherwise, there must be more parameters. Consume the
18873 `,'. */
18875 /* When parsing something like:
18877 int i(float f, double d)
18879 we can tell after seeing the declaration for "f" that we
18880 are not looking at an initialization of a variable "i",
18881 but rather at the declaration of a function "i".
18883 Due to the fact that the parsing of template arguments
18884 (as specified to a template-id) requires backtracking we
18885 cannot use this technique when inside a template argument
18886 list. */
18890 /* However, a parameter-declaration of the form
18891 "float(f)" (which is a valid declaration of a
18892 parameter "f") can also be interpreted as an
18893 expression (the conversion of "f" to "float"). */
18896 }
18897 else
18898 {
18906 }
18907 }
18909 parser->in_unbraced_linkage_specification_p
18912 /* Reset implicit_template_scope if we are about to leave the function
18913 parameter list that introduced it. Note that for out-of-line member
18914 definitions, there will be one or more class scopes before we get to
18915 the template parameter scope. */
18919 {
18923 {
18926 }
18927 }
18930 }
18932 /* Parse a parameter declaration.
18934 parameter-declaration:
18935 decl-specifier-seq ... [opt] declarator
18936 decl-specifier-seq declarator = assignment-expression
18937 decl-specifier-seq ... [opt] abstract-declarator [opt]
18938 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18940 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18941 declares a template parameter. (In that case, a non-nested `>'
18942 token encountered during the parsing of the assignment-expression
18943 is not interpreted as a greater-than operator.)
18945 Returns a representation of the parameter, or NULL if an error
18946 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18947 true iff the declarator is of the form "(p)". */
18953 {
18955 cp_decl_specifier_seq decl_specifiers;
18957 tree default_argument;
18961 /* In a template parameter, `>' is not an operator.
18963 [temp.param]
18965 When parsing a default template-argument for a non-type
18966 template-parameter, the first non-nested `>' is taken as the end
18967 of the template parameter-list rather than a greater-than
18968 operator. */
18970 /* Type definitions may not appear in parameter types. */
18972 parser->type_definition_forbidden_message
18975 /* Parse the declaration-specifiers. */
18977 CP_PARSER_FLAGS_NONE,
18981 /* Complain about missing 'typename' or other invalid type names. */
18986 /* If an error occurred, there's no reason to attempt to parse the
18987 rest of the declaration. */
18989 {
18992 }
18994 /* Peek at the next token. */
18997 /* If the next token is a `)', `,', `=', `>', or `...', then there
18998 is no declarator. However, when variadic templates are enabled,
18999 there may be a declarator following `...'. */
19004 {
19008 }
19009 /* Otherwise, there should be a declarator. */
19010 else
19011 {
19015 /* After seeing a decl-specifier-seq, if the next token is not a
19016 "(", there is no possibility that the code is a valid
19017 expression. Therefore, if parsing tentatively, we commit at
19018 this point. */
19020 /* In an expression context, having seen:
19022 (int((char ...
19024 we cannot be sure whether we are looking at a
19025 function-type (taking a "char" as a parameter) or a cast
19026 of some object of type "char" to "int". */
19032 /* Parse the declarator. */
19035 CP_PARSER_DECLARATOR_EITHER,
19037 parenthesized_p,
19041 /* After the declarator, allow more attributes. */
19042 decl_specifiers.attributes
19045 }
19047 /* If the next token is an ellipsis, and we have not seen a
19048 declarator name, and the type of the declarator contains parameter
19049 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19050 a parameter pack expansion expression. Otherwise, leave the
19051 ellipsis for a C-style variadic function. */
19054 {
19065 {
19066 /* Consume the `...'. */
19070 /* Build a pack expansion type */
19073 else
19075 }
19076 }
19078 /* The restriction on defining new types applies only to the type
19079 of the parameter, not to the default argument. */
19082 /* If the next token is `=', then process a default argument. */
19084 {
19086 /* If we are defining a class, then the tokens that make up the
19087 default argument must be saved and processed later. */
19092 /* Outside of a class definition, we can just parse the
19093 assignment-expression. */
19094 else
19095 default_argument
19099 {
19102 else
19103 {
19105 "default arguments are only "
19108 }
19109 }
19113 {
19114 /* Find the name of the parameter pack. */
19121 template_parm_p
19127 else
19129 template_parm_p
19136 }
19137 }
19138 else
19142 declarator,
19143 default_argument);
19144 }
19146 /* Parse a default argument and return it.
19148 TEMPLATE_PARM_P is true if this is a default argument for a
19149 non-type template parameter. */
19150 static tree
19152 {
19158 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19159 set correctly. */
19162 /* Local variable names (and the `this' keyword) may not
19163 appear in a default argument. */
19166 /* Parse the assignment-expression. */
19171 /* The "this" pointer is not valid in a default argument. */
19173 {
19178 }
19179 default_argument
19181 /* Restore the "this" pointer. */
19183 {
19186 }
19195 }
19197 /* Parse a function-body.
19199 function-body:
19200 compound_statement */
19202 static void
19204 {
19206 }
19208 /* Parse a ctor-initializer-opt followed by a function-body. Return
19209 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19210 is true we are parsing a function-try-block. */
19212 static bool
19215 {
19223 /* Begin the function body. */
19225 /* Parse the optional ctor-initializer. */
19228 /* If we're parsing a constexpr constructor definition, we need
19229 to check that the constructor body is indeed empty. However,
19230 before we get to cp_parser_function_body lot of junk has been
19231 generated, so we can't just check that we have an empty block.
19232 Rather we take a snapshot of the outermost block, and check whether
19233 cp_parser_function_body changed its state. */
19235 {
19239 }
19240 /* Parse the function-body. */
19244 /* Finish the function body. */
19248 }
19250 /* Parse an initializer.
19252 initializer:
19253 = initializer-clause
19254 ( expression-list )
19256 Returns an expression representing the initializer. If no
19257 initializer is present, NULL_TREE is returned.
19259 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19260 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19261 set to TRUE if there is no initializer present. If there is an
19262 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19263 is set to true; otherwise it is set to false. */
19265 static tree
19268 {
19270 tree init;
19272 /* Peek at the next token. */
19275 /* Let our caller know whether or not this initializer was
19276 parenthesized. */
19278 /* Assume that the initializer is constant. */
19282 {
19283 /* Consume the `='. */
19285 /* Parse the initializer-clause. */
19287 }
19289 {
19294 non_constant_p);
19299 }
19301 {
19306 }
19307 else
19308 {
19309 /* Anything else is an error. */
19312 }
19315 }
19317 /* Parse an initializer-clause.
19319 initializer-clause:
19320 assignment-expression
19321 braced-init-list
19323 Returns an expression representing the initializer.
19325 If the `assignment-expression' production is used the value
19326 returned is simply a representation for the expression.
19328 Otherwise, calls cp_parser_braced_list. */
19330 static tree
19332 {
19333 tree initializer;
19335 /* Assume the expression is constant. */
19338 /* If it is not a `{', then we are looking at an
19339 assignment-expression. */
19341 {
19342 initializer
19345 non_constant_p);
19346 }
19347 else
19351 }
19353 /* Parse a brace-enclosed initializer list.
19355 braced-init-list:
19356 { initializer-list , [opt] }
19357 { }
19359 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19360 the elements of the initializer-list (or NULL, if the last
19361 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19362 NULL_TREE. There is no way to detect whether or not the optional
19363 trailing `,' was provided. NON_CONSTANT_P is as for
19364 cp_parser_initializer. */
19366 static tree
19368 {
19369 tree initializer;
19371 /* Consume the `{' token. */
19373 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19375 /* If it's not a `}', then there is a non-trivial initializer. */
19377 {
19378 /* Parse the initializer list. */
19381 /* A trailing `,' token is allowed. */
19384 }
19385 else
19387 /* Now, there should be a trailing `}'. */
19391 }
19393 /* Consume tokens up to, and including, the next non-nested closing `]'.
19394 Returns true iff we found a closing `]'. */
19396 static bool
19398 {
19402 {
19406 {
19409 /* If we've run out of tokens, then there is no closing `]'. */
19418 {
19421 }
19426 }
19428 /* Consume the token. */
19430 }
19431 }
19433 /* Return true if we are looking at an array-designator, false otherwise. */
19435 static bool
19437 {
19438 /* Consume the `['. */
19443 /* Skip tokens until the next token is a closing square bracket.
19444 If we find the closing `]', and the next token is a `=', then
19445 we are looking at an array designator. */
19446 bool array_designator_p
19450 /* Roll back the tokens we skipped. */
19454 }
19456 /* Parse an initializer-list.
19458 initializer-list:
19459 initializer-clause ... [opt]
19460 initializer-list , initializer-clause ... [opt]
19462 GNU Extension:
19464 initializer-list:
19465 designation initializer-clause ...[opt]
19466 initializer-list , designation initializer-clause ...[opt]
19468 designation:
19469 . identifier =
19470 identifier :
19471 [ constant-expression ] =
19473 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19474 for the initializer. If the INDEX of the elt is non-NULL, it is the
19475 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19476 as for cp_parser_initializer. */
19480 {
19483 /* Assume all of the expressions are constant. */
19486 /* Parse the rest of the list. */
19488 {
19490 tree designator;
19491 tree initializer;
19494 /* If the next token is an identifier and the following one is a
19495 colon, we are looking at the GNU designated-initializer
19496 syntax. */
19500 {
19501 /* Warn the user that they are using an extension. */
19504 /* Consume the identifier. */
19506 /* Consume the `:'. */
19508 }
19509 /* Also handle the C99 syntax, '. id ='. */
19514 {
19515 /* Warn the user that they are using an extension. */
19518 /* Consume the `.'. */
19520 /* Consume the identifier. */
19522 /* Consume the `='. */
19524 }
19525 /* Also handle C99 array designators, '[ const ] ='. */
19529 {
19530 /* In C++11, [ could start a lambda-introducer. */
19536 {
19539 }
19540 else
19541 {
19546 }
19552 }
19553 else
19556 /* Parse the initializer. */
19559 /* If any clause is non-constant, so is the entire initializer. */
19563 /* If we have an ellipsis, this is an initializer pack
19564 expansion. */
19566 {
19567 /* Consume the `...'. */
19570 /* Turn the initializer into an initializer expansion. */
19572 }
19574 /* Add it to the vector. */
19577 /* If the next token is not a comma, we have reached the end of
19578 the list. */
19582 /* Peek at the next token. */
19584 /* If the next token is a `}', then we're still done. An
19585 initializer-clause can have a trailing `,' after the
19586 initializer-list and before the closing `}'. */
19590 /* Consume the `,' token. */
19592 }
19595 }
19597 /* Classes [gram.class] */
19599 /* Parse a class-name.
19601 class-name:
19602 identifier
19603 template-id
19605 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19606 to indicate that names looked up in dependent types should be
19607 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19608 keyword has been used to indicate that the name that appears next
19609 is a template. TAG_TYPE indicates the explicit tag given before
19610 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19611 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19612 is the class being defined in a class-head.
19614 Returns the TYPE_DECL representing the class. */
19616 static tree
19624 {
19625 tree decl;
19626 tree scope;
19631 /* All class-names start with an identifier. */
19634 {
19637 }
19639 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19640 to a template-id, so we save it here. */
19645 /* Any name names a type if we're following the `typename' keyword
19646 in a qualified name where the enclosing scope is type-dependent. */
19649 /* Handle the common case (an identifier, but not a template-id)
19650 efficiently. */
19653 {
19657 /* Look for the identifier. */
19661 /* If the next token isn't an identifier, we are certainly not
19662 looking at a class-name. */
19665 /* If we know this is a type-name, there's no need to look it
19666 up. */
19669 else
19670 {
19671 tree ambiguous_decls;
19672 /* If we already know that this lookup is ambiguous, then
19673 we've already issued an error message; there's no reason
19674 to check again. */
19676 {
19679 }
19680 /* If the next token is a `::', then the name must be a type
19681 name.
19683 [basic.lookup.qual]
19685 During the lookup for a name preceding the :: scope
19686 resolution operator, object, function, and enumerator
19687 names are ignored. */
19690 /* Look up the name. */
19692 tag_type,
19695 check_dependency_p,
19699 {
19703 }
19704 }
19705 }
19706 else
19707 {
19708 /* Try a template-id. */
19710 check_dependency_p,
19711 tag_type,
19712 is_declaration);
19715 }
19719 /* If this is a typename, create a TYPENAME_TYPE. */
19721 {
19726 }
19730 /* Check to see that it is really the name of a class. */
19734 /* Situations like this:
19736 template <typename T> struct A {
19737 typename T::template X<int>::I i;
19738 };
19740 are problematic. Is `T::template X<int>' a class-name? The
19741 standard does not seem to be definitive, but there is no other
19742 valid interpretation of the following `::'. Therefore, those
19743 names are considered class-names. */
19744 {
19748 }
19752 /* In Objective-C 2.0, a classname followed by '.' starts a
19753 dot-syntax expression, and it's not a type-name. */
19765 }
19767 /* Parse a class-specifier.
19769 class-specifier:
19770 class-head { member-specification [opt] }
19772 Returns the TREE_TYPE representing the class. */
19774 static tree
19776 {
19777 tree type;
19791 /* Parse the class-head. */
19794 /* If the class-head was a semantic disaster, skip the entire body
19795 of the class. */
19797 {
19801 }
19803 /* Look for the `{'. */
19805 {
19808 }
19812 /* Issue an error message if type-definitions are forbidden here. */
19814 /* Remember that we are defining one more class. */
19816 /* Inside the class, surrounding template-parameter-lists do not
19817 apply. */
19818 saved_num_template_parameter_lists
19821 /* We are not in a function body. */
19824 /* Or in a loop. */
19827 /* Or in a switch. */
19830 /* We are not immediately inside an extern "lang" block. */
19831 saved_in_unbraced_linkage_specification_p
19835 /* Start the class. */
19837 {
19840 }
19844 /* If the type is erroneous, skip the entire body of the class. */
19846 else
19847 /* Parse the member-specification. */
19850 /* Look for the trailing `}'. */
19852 /* Look for trailing attributes to apply to this class. */
19860 /* We've finished a type definition. Check for the common syntax
19861 error of forgetting a semicolon after the definition. We need to
19862 be careful, as we can't just check for not-a-semicolon and be done
19863 with it; the user might have typed:
19865 class X { } c = ...;
19866 class X { } *p = ...;
19868 and so forth. Instead, enumerate all the possible tokens that
19869 might follow this production; if we don't see one of them, then
19870 complain and silently insert the semicolon. */
19871 {
19876 /* Don't try to parse c++11 attributes here. As per the
19877 grammar, that should be a task for
19878 cp_parser_decl_specifier_seq. */
19882 {
19893 /* While it's legal for type qualifiers and storage class
19894 specifiers to follow type definitions in the grammar, only
19895 compiler testsuites contain code like that. Assume that if
19896 we see such code, then what we're really seeing is a case
19897 like:
19899 class X { }
19900 const <type> var = ...;
19902 or
19904 class Y { }
19905 static <type> func (...) ...
19907 i.e. the qualifier or specifier applies to the next
19908 declaration. To do so, however, we need to look ahead one
19909 more token to see if *that* token is a type specifier.
19911 This code could be improved to handle:
19913 class Z { }
19914 static const <type> var = ...; */
19917 {
19920 /* Handling user-defined types here would be nice, but very
19921 tricky. */
19922 want_semicolon
19925 }
19929 }
19931 /* If we don't have a type, then something is very wrong and we
19932 shouldn't try to do anything clever. Likewise for not seeing the
19933 closing brace. */
19935 {
19936 cp_token_position prev
19947 else
19950 /* Unget one token and smash it to look as though we encountered
19951 a semicolon in the input stream. */
19956 }
19957 }
19959 /* If this class is not itself within the scope of another class,
19960 then we need to parse the bodies of all of the queued function
19961 definitions. Note that the queued functions defined in a class
19962 are not always processed immediately following the
19963 class-specifier for that class. Consider:
19965 struct A {
19966 struct B { void f() { sizeof (A); } };
19967 };
19969 If `f' were processed before the processing of `A' were
19970 completed, there would be no way to compute the size of `A'.
19971 Note that the nesting we are interested in here is lexical --
19972 not the semantic nesting given by TYPE_CONTEXT. In particular,
19973 for:
19975 struct A { struct B; };
19976 struct A::B { void f() { } };
19978 there is no need to delay the parsing of `A::B::f'. */
19980 {
19981 tree decl;
19988 /* In a first pass, parse default arguments to the functions.
19989 Then, in a second pass, parse the bodies of the functions.
19990 This two-phased approach handles cases like:
19992 struct S {
19993 void f() { g(); }
19994 void g(int i = 3);
19995 };
19997 */
19999 {
20001 /* If there are default arguments that have not yet been processed,
20002 take care of them now. */
20004 {
20009 }
20010 /* Make sure that any template parameters are in scope. */
20012 /* Parse the default argument expressions. */
20014 /* Remove any template parameters from the symbol table. */
20016 }
20018 /* Now parse any NSDMIs. */
20022 {
20024 {
20029 }
20032 }
20039 /* Now do some post-NSDMI bookkeeping. */
20045 /* Now parse the body of the functions. */
20047 {
20048 /* OpenMP UDRs need to be parsed before all other functions. */
20055 }
20056 else
20060 }
20061 else
20064 /* Put back any saved access checks. */
20067 /* Restore saved state. */
20071 parser->num_template_parameter_lists
20073 parser->in_unbraced_linkage_specification_p
20077 }
20079 static tree
20081 {
20082 tree ret;
20087 }
20089 /* Parse a class-head.
20091 class-head:
20092 class-key identifier [opt] base-clause [opt]
20093 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20094 class-key nested-name-specifier [opt] template-id
20095 base-clause [opt]
20097 class-virt-specifier:
20098 final
20100 GNU Extensions:
20101 class-key attributes identifier [opt] base-clause [opt]
20102 class-key attributes nested-name-specifier identifier base-clause [opt]
20103 class-key attributes nested-name-specifier [opt] template-id
20104 base-clause [opt]
20106 Upon return BASES is initialized to the list of base classes (or
20107 NULL, if there are none) in the same form returned by
20108 cp_parser_base_clause.
20110 Returns the TYPE of the indicated class. Sets
20111 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20112 involving a nested-name-specifier was used, and FALSE otherwise.
20114 Returns error_mark_node if this is not a class-head.
20116 Returns NULL_TREE if the class-head is syntactically valid, but
20117 semantically invalid in a way that means we should skip the entire
20118 body of the class. */
20120 static tree
20123 {
20124 tree nested_name_specifier;
20128 tree attributes;
20129 tree bases;
20139 /* Assume no nested-name-specifier will be present. */
20141 /* Assume no template parameter lists will be used in defining the
20142 type. */
20146 /* Look for the class-key. */
20151 /* Parse the attributes. */
20154 /* If the next token is `::', that is invalid -- but sometimes
20155 people do try to write:
20157 struct ::S {};
20159 Handle this gracefully by accepting the extra qualifier, and then
20160 issuing an error about it later if this really is a
20161 class-head. If it turns out just to be an elaborated type
20162 specifier, remain silent. */
20168 /* Determine the name of the class. Begin by looking for an
20169 optional nested-name-specifier. */
20171 nested_name_specifier
20177 /* If there was a nested-name-specifier, then there *must* be an
20178 identifier. */
20180 {
20182 /* Although the grammar says `identifier', it really means
20183 `class-name' or `template-name'. You are only allowed to
20184 define a class that has already been declared with this
20185 syntax.
20187 The proposed resolution for Core Issue 180 says that wherever
20188 you see `class T::X' you should treat `X' as a type-name.
20190 It is OK to define an inaccessible class; for example:
20192 class A { class B; };
20193 class A::B {};
20195 We do not know if we will see a class-name, or a
20196 template-name. We look for a class-name first, in case the
20197 class-name is a template-id; if we looked for the
20198 template-name first we would stop after the template-name. */
20203 class_type,
20207 /* If that didn't work, ignore the nested-name-specifier. */
20209 {
20215 }
20216 /* If we could not find a corresponding TYPE, treat this
20217 declaration like an unqualified declaration. */
20220 /* Otherwise, count the number of templates used in TYPE and its
20221 containing scopes. */
20222 else
20223 {
20224 tree scope;
20236 }
20237 }
20238 /* Otherwise, the identifier is optional. */
20239 else
20240 {
20241 /* We don't know whether what comes next is a template-id,
20242 an identifier, or nothing at all. */
20244 /* Check for a template-id. */
20249 class_key,
20251 /* If that didn't work, it could still be an identifier. */
20253 {
20255 {
20258 }
20259 else
20261 }
20262 else
20263 {
20266 }
20267 }
20272 {
20274 class_key,
20276 }
20279 /* If it's not a `:' or a `{' then we can't really be looking at a
20280 class-head, since a class-head only appears as part of a
20281 class-specifier. We have to detect this situation before calling
20282 xref_tag, since that has irreversible side-effects. */
20284 {
20288 }
20290 /* At this point, we're going ahead with the class-specifier, even
20291 if some other problem occurs. */
20294 {
20299 }
20300 /* Issue the error about the overly-qualified name now. */
20302 {
20307 }
20309 {
20314 }
20316 {
20317 tree scope;
20319 /* Reject typedef-names in class heads. */
20321 {
20324 type);
20327 }
20329 /* Figure out in what scope the declaration is being placed. */
20331 /* If that scope does not contain the scope in which the
20332 class was originally declared, the program is invalid. */
20334 {
20337 "declaration of %qD in namespace %qD which does not "
20340 else
20346 }
20347 /* [dcl.meaning]
20349 A declarator-id shall not be qualified except for the
20350 definition of a ... nested class outside of its class
20351 ... [or] the definition or explicit instantiation of a
20352 class member of a namespace outside of its namespace. */
20354 {
20359 }
20360 }
20361 /* An explicit-specialization must be preceded by "template <>". If
20362 it is not, try to recover gracefully. */
20366 {
20370 /* Take the same action that would have been taken by
20371 cp_parser_explicit_specialization. */
20374 }
20375 /* There must be no "return" statements between this point and the
20376 end of this function; set "type "to the correct return value and
20377 use "goto done;" to return. */
20378 /* Make sure that the right number of template parameters were
20379 present. */
20383 {
20384 /* If something went wrong, there is no point in even trying to
20385 process the class-definition. */
20388 }
20390 /* Look up the type. */
20392 {
20396 {
20400 }
20401 else
20402 {
20405 }
20408 }
20410 {
20411 tree class_type;
20413 /* Given:
20415 template <typename T> struct S { struct T };
20416 template <typename T> struct S<T>::T { };
20418 we will get a TYPENAME_TYPE when processing the definition of
20419 `S::T'. We need to resolve it to the actual type before we
20420 try to define it. */
20422 {
20427 else
20428 {
20431 }
20432 }
20436 {
20439 }
20442 /* Enter the scope indicated by the nested-name-specifier. */
20444 /* Get the canonical version of this type. */
20446 /* Call push_template_decl if it seems like we should be defining a
20447 template either from the template headers or the type we're
20448 defining, so that we diagnose both extra and missing headers. */
20452 {
20455 {
20458 }
20459 }
20463 }
20465 {
20466 /* If the class was unnamed, create a dummy name. */
20471 }
20473 /* Indicate whether this class was declared as a `class' or as a
20474 `struct'. */
20479 /* If this type was already complete, and we see another definition,
20480 that's an error. */
20482 {
20484 type);
20486 type);
20489 }
20494 {
20495 /* Apply attributes now, before any use of the class as a template
20496 argument in its base list. */
20499 }
20501 /* We will have entered the scope containing the class; the names of
20502 base classes should be looked up in that context. For example:
20504 struct A { struct B {}; struct C; };
20505 struct A::C : B {};
20507 is valid. */
20509 /* Get the list of base-classes, if there is one. */
20511 {
20512 /* PR59482: enter the class scope so that base-specifiers are looked
20513 up correctly. */
20517 /* PR59482: get out of the previously pushed class scope so that the
20518 subsequent pops pop the right thing. */
20521 }
20522 else
20525 /* If we're really defining a class, process the base classes.
20526 If they're invalid, fail. */
20531 done:
20532 /* Leave the scope given by the nested-name-specifier. We will
20533 enter the class scope itself while processing the members. */
20538 {
20541 }
20547 out:
20550 }
20552 /* Parse a class-key.
20554 class-key:
20555 class
20556 struct
20557 union
20559 Returns the kind of class-key specified, or none_type to indicate
20560 error. */
20562 static enum tag_types
20564 {
20568 /* Look for the class-key. */
20573 /* Check to see if the TOKEN is a class-key. */
20578 }
20580 /* Parse a type-parameter-key.
20582 type-parameter-key:
20583 class
20584 typename
20585 */
20587 static void
20589 {
20590 /* Look for the type-parameter-key. */
20594 {
20597 /* typename is not allowed in a template template parameter
20598 by the standard until C++1Z. */
20600 "ISO C++ forbids typename key in template template parameter;"
20602 }
20603 else
20607 }
20609 /* Parse an (optional) member-specification.
20611 member-specification:
20612 member-declaration member-specification [opt]
20613 access-specifier : member-specification [opt] */
20615 static void
20617 {
20619 {
20623 /* Peek at the next token. */
20625 /* If it's a `}', or EOF then we've seen all the members. */
20631 /* See if this token is a keyword. */
20634 {
20638 /* Consume the access-specifier. */
20640 /* Remember which access-specifier is active. */
20642 /* Look for the `:'. */
20647 /* Accept #pragmas at class scope. */
20649 {
20652 }
20654 /* Otherwise, the next construction must be a
20655 member-declaration. */
20657 }
20658 }
20659 }
20661 /* Parse a member-declaration.
20663 member-declaration:
20664 decl-specifier-seq [opt] member-declarator-list [opt] ;
20665 function-definition ; [opt]
20666 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20667 using-declaration
20668 template-declaration
20669 alias-declaration
20671 member-declarator-list:
20672 member-declarator
20673 member-declarator-list , member-declarator
20675 member-declarator:
20676 declarator pure-specifier [opt]
20677 declarator constant-initializer [opt]
20678 identifier [opt] : constant-expression
20680 GNU Extensions:
20682 member-declaration:
20683 __extension__ member-declaration
20685 member-declarator:
20686 declarator attributes [opt] pure-specifier [opt]
20687 declarator attributes [opt] constant-initializer [opt]
20688 identifier [opt] attributes [opt] : constant-expression
20690 C++0x Extensions:
20692 member-declaration:
20693 static_assert-declaration */
20695 static void
20697 {
20698 cp_decl_specifier_seq decl_specifiers;
20699 tree prefix_attributes;
20700 tree decl;
20709 /* Check for the `__extension__' keyword. */
20711 {
20712 /* Recurse. */
20714 /* Restore the old value of the PEDANTIC flag. */
20718 }
20720 /* Check for a template-declaration. */
20722 {
20723 /* An explicit specialization here is an error condition, and we
20724 expect the specialization handler to detect and report this. */
20728 else
20732 }
20734 /* Check for a using-declaration. */
20736 {
20738 {
20739 /* Parse the using-declaration. */
20743 }
20744 else
20745 {
20746 tree decl;
20750 /* Note that if we actually see the '=' token after the
20751 identifier, cp_parser_alias_declaration commits the
20752 tentative parse. In that case, we really expects an
20753 alias-declaration. Otherwise, we expect a using
20754 declaration. */
20755 alias_decl_expected =
20761 else
20765 }
20766 }
20768 /* Check for @defs. */
20770 {
20775 {
20780 }
20782 }
20784 /* If the next token is `static_assert' we have a static assertion. */
20786 {
20789 }
20796 /* Parse the decl-specifier-seq. */
20799 CP_PARSER_FLAGS_OPTIONAL,
20802 /* Check for an invalid type-name. */
20806 /* If there is no declarator, then the decl-specifier-seq should
20807 specify a type. */
20809 {
20810 /* If there was no decl-specifier-seq, and the next token is a
20811 `;', then we have something like:
20813 struct S { ; };
20815 [class.mem]
20817 Each member-declaration shall declare at least one member
20818 name of the class. */
20820 {
20824 }
20825 else
20826 {
20827 tree type;
20829 /* See if this declaration is a friend. */
20831 /* If there were decl-specifiers, check to see if there was
20832 a class-declaration. */
20835 /* Nested classes have already been added to the class, but
20836 a `friend' needs to be explicitly registered. */
20838 {
20839 /* If the `friend' keyword was present, the friend must
20840 be introduced with a class-key. */
20843 "in C++03 a class-key must be used "
20845 /* In this case:
20847 template <typename T> struct A {
20848 friend struct A<T>::B;
20849 };
20851 A<T>::B will be represented by a TYPENAME_TYPE, and
20852 therefore not recognized by check_tag_decl. */
20854 {
20858 }
20861 "friend declaration does not name a class or "
20863 else
20866 }
20867 /* If there is no TYPE, an error message will already have
20868 been issued. */
20870 ;
20871 /* An anonymous aggregate has to be handled specially; such
20872 a declaration really declares a data member (with a
20873 particular type), as opposed to a nested class. */
20875 {
20876 /* C++11 9.5/6. */
20879 "a storage class on an anonymous aggregate "
20882 /* Remove constructors and such from TYPE, now that we
20883 know it is an anonymous aggregate. */
20885 /* And make the corresponding data member. */
20888 /* Add it to the class. */
20890 }
20891 else
20892 cp_parser_check_access_in_redeclaration
20895 }
20896 }
20897 else
20898 {
20901 /* Clear attributes from the decl_specifiers but keep them
20902 around as prefix attributes that apply them to the entity
20903 being declared. */
20907 /* See if these declarations will be friends. */
20910 /* Keep going until we hit the `;' at the end of the
20911 declaration. */
20913 {
20915 tree first_attribute;
20917 /* Peek at the next token. */
20920 /* Check for a bitfield declaration. */
20925 {
20926 tree identifier;
20927 tree width;
20929 /* Get the name of the bitfield. Note that we cannot just
20930 check TOKEN here because it may have been invalidated by
20931 the call to cp_lexer_peek_nth_token above. */
20934 else
20937 /* Consume the `:' token. */
20939 /* Get the width of the bitfield. */
20940 width
20943 /* Look for attributes that apply to the bitfield. */
20945 /* Remember which attributes are prefix attributes and
20946 which are not. */
20948 /* Combine the attributes. */
20951 /* Create the bitfield declaration. */
20954 identifier,
20955 sfk_none)
20958 width,
20959 attributes);
20960 }
20961 else
20962 {
20964 tree initializer;
20965 tree asm_specification;
20968 /* Parse the declarator. */
20969 declarator
20974 friend_p);
20976 /* If something went wrong parsing the declarator, make sure
20977 that we at least consume some tokens. */
20979 {
20980 /* Skip to the end of the statement. */
20982 /* If the next token is not a semicolon, that is
20983 probably because we just skipped over the body of
20984 a function. So, we consume a semicolon if
20985 present, but do not issue an error message if it
20986 is not present. */
20988 CPP_SEMICOLON))
20991 }
20994 cp_parser_check_for_definition_in_return_type
20998 /* Look for an asm-specification. */
21000 /* Look for attributes that apply to the declaration. */
21002 /* Remember which attributes are prefix attributes and
21003 which are not. */
21005 /* Combine the attributes. */
21008 /* If it's an `=', then we have a constant-initializer or a
21009 pure-specifier. It is not correct to parse the
21010 initializer before registering the member declaration
21011 since the member declaration should be in scope while
21012 its initializer is processed. However, the rest of the
21013 front end does not yet provide an interface that allows
21014 us to handle this correctly. */
21016 {
21017 /* In [class.mem]:
21019 A pure-specifier shall be used only in the declaration of
21020 a virtual function.
21022 A member-declarator can contain a constant-initializer
21023 only if it declares a static member of integral or
21024 enumeration type.
21026 Therefore, if the DECLARATOR is for a function, we look
21027 for a pure-specifier; otherwise, we look for a
21028 constant-initializer. When we call `grokfield', it will
21029 perform more stringent semantics checks. */
21041 {
21043 /* Don't require a constant rvalue in C++11, since we
21044 might want a reference constant. We'll enforce
21045 constancy later. */
21047 /* Parse the initializer. */
21050 }
21051 else
21052 /* Parse the initializer. */
21054 }
21057 {
21061 else
21063 }
21064 /* Otherwise, there is no initializer. */
21065 else
21068 /* See if we are probably looking at a function
21069 definition. We are certainly not looking at a
21070 member-declarator. Calling `grokfield' has
21071 side-effects, so we must not do it unless we are sure
21072 that we are looking at a member-declarator. */
21075 {
21076 /* The grammar does not allow a pure-specifier to be
21077 used when a member function is defined. (It is
21078 possible that this fact is an oversight in the
21079 standard, since a pure function may be defined
21080 outside of the class-specifier. */
21086 declarator,
21087 attributes);
21090 /* If the member was not a friend, declare it here. */
21093 /* Peek at the next token. */
21095 /* If the next token is a semicolon, consume it. */
21099 }
21100 else
21103 /* Create the declaration. */
21108 {
21111 else
21113 }
21114 }
21118 /* Reset PREFIX_ATTRIBUTES. */
21124 /* If there is any qualification still in effect, clear it
21125 now; we will be starting fresh with the next declarator. */
21129 /* If it's a `,', then there are more declarators. */
21131 {
21134 {
21138 }
21139 }
21140 /* If the next token isn't a `;', then we have a parse error. */
21142 CPP_SEMICOLON))
21143 {
21144 /* The next token might be a ways away from where the
21145 actual semicolon is missing. Find the previous token
21146 and use that for our error position. */
21151 /* Assume that the user meant to provide a semicolon. If
21152 we were to cp_parser_skip_to_end_of_statement, we might
21153 skip to a semicolon inside a member function definition
21154 and issue nonsensical error messages. */
21156 }
21159 {
21160 /* Add DECL to the list of members. */
21162 /* Explicitly include, eg, NSDMIs, for better error
21163 recovery (c++/58650). */
21172 /* Add DECL to the queue of NSDMI to be parsed later. */
21174 }
21178 }
21179 }
21182 out:
21184 }
21186 /* Parse a pure-specifier.
21188 pure-specifier:
21189 = 0
21191 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21192 Otherwise, ERROR_MARK_NODE is returned. */
21194 static tree
21196 {
21199 /* Look for the `=' token. */
21202 /* Look for the `0' token. */
21211 /* Accept = default or = delete in c++0x mode. */
21214 {
21217 }
21219 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21221 {
21226 }
21228 {
21231 }
21234 }
21236 /* Parse a constant-initializer.
21238 constant-initializer:
21239 = constant-expression
21241 Returns a representation of the constant-expression. */
21243 static tree
21245 {
21246 /* Look for the `=' token. */
21250 /* It is invalid to write:
21252 struct S { static const int i = { 7 }; };
21254 */
21256 {
21259 /* Consume the opening brace. */
21261 /* Skip the initializer. */
21263 /* Look for the trailing `}'. */
21267 }
21270 }
21272 /* Derived classes [gram.class.derived] */
21274 /* Parse a base-clause.
21276 base-clause:
21277 : base-specifier-list
21279 base-specifier-list:
21280 base-specifier ... [opt]
21281 base-specifier-list , base-specifier ... [opt]
21283 Returns a TREE_LIST representing the base-classes, in the order in
21284 which they were declared. The representation of each node is as
21285 described by cp_parser_base_specifier.
21287 In the case that no bases are specified, this function will return
21288 NULL_TREE, not ERROR_MARK_NODE. */
21290 static tree
21292 {
21295 /* Look for the `:' that begins the list. */
21298 /* Scan the base-specifier-list. */
21300 {
21302 tree base;
21305 /* Look for the base-specifier. */
21307 /* Look for the (optional) ellipsis. */
21309 {
21310 /* Consume the `...'. */
21314 }
21316 /* Add BASE to the front of the list. */
21318 {
21320 /* Make this a pack expansion type. */
21324 {
21327 }
21328 }
21329 /* Peek at the next token. */
21331 /* If it's not a comma, then the list is complete. */
21334 /* Consume the `,'. */
21336 }
21338 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21339 base class had a qualified name. However, the next name that
21340 appears is certainly not qualified. */
21346 }
21348 /* Parse a base-specifier.
21350 base-specifier:
21351 :: [opt] nested-name-specifier [opt] class-name
21352 virtual access-specifier [opt] :: [opt] nested-name-specifier
21353 [opt] class-name
21354 access-specifier virtual [opt] :: [opt] nested-name-specifier
21355 [opt] class-name
21357 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21358 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21359 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21360 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21362 static tree
21364 {
21372 tree type;
21374 /* Process the optional `virtual' and `access-specifier'. */
21376 {
21377 /* Peek at the next token. */
21379 /* Process `virtual'. */
21381 {
21383 /* If `virtual' appears more than once, issue an error. */
21385 {
21389 }
21393 /* Consume the `virtual' token. */
21401 /* If more than one access specifier appears, issue an
21402 error. */
21405 {
21409 }
21413 /* Consume the access-specifier. */
21421 }
21422 }
21423 /* It is not uncommon to see programs mechanically, erroneously, use
21424 the 'typename' keyword to denote (dependent) qualified types
21425 as base classes. */
21427 {
21432 else
21434 "keyword %<typename%> not allowed in this context "
21437 }
21439 /* Look for the optional `::' operator. */
21441 /* Look for the nested-name-specifier. The simplest way to
21442 implement:
21444 [temp.res]
21446 The keyword `typename' is not permitted in a base-specifier or
21447 mem-initializer; in these contexts a qualified name that
21448 depends on a template-parameter is implicitly assumed to be a
21449 type name.
21451 is to pretend that we have seen the `typename' keyword at this
21452 point. */
21456 typename_type,
21458 /* If the base class is given by a qualified name, assume that names
21459 we see are type names or templates, as appropriate. */
21465 /* DR 950 allows decltype as a base-specifier. */
21467 else
21468 {
21469 /* Otherwise, look for the class-name. */
21471 class_scope_p,
21472 template_p,
21473 typename_type,
21478 }
21484 }
21486 /* Exception handling [gram.exception] */
21488 /* Parse an (optional) noexcept-specification.
21490 noexcept-specification:
21491 noexcept ( constant-expression ) [opt]
21493 If no noexcept-specification is present, returns NULL_TREE.
21494 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21495 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21496 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21497 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21498 in which case a boolean condition is returned instead. */
21500 static tree
21505 {
21509 /* Peek at the next token. */
21512 /* Is it a noexcept-specification? */
21514 {
21515 tree expr;
21519 {
21523 {
21524 /* Types may not be defined in an exception-specification. */
21526 parser->type_definition_forbidden_message
21531 /* Restore the saved message. */
21533 }
21534 else
21535 {
21538 }
21541 }
21542 else
21543 {
21547 }
21549 /* We cannot build a noexcept-spec right away because this will check
21550 that expr is a constexpr. */
21553 else
21555 }
21556 else
21558 }
21560 /* Parse an (optional) exception-specification.
21562 exception-specification:
21563 throw ( type-id-list [opt] )
21565 Returns a TREE_LIST representing the exception-specification. The
21566 TREE_VALUE of each node is a type. */
21568 static tree
21570 {
21572 tree type_id_list;
21575 /* Peek at the next token. */
21578 /* Is it a noexcept-specification? */
21584 /* If it's not `throw', then there's no exception-specification. */
21588 #if 0
21589 /* Enable this once a lot of code has transitioned to noexcept? */
21593 #endif
21595 /* Consume the `throw'. */
21598 /* Look for the `('. */
21601 /* Peek at the next token. */
21603 /* If it's not a `)', then there is a type-id-list. */
21605 {
21606 /* Types may not be defined in an exception-specification. */
21608 parser->type_definition_forbidden_message
21610 /* Parse the type-id-list. */
21612 /* Restore the saved message. */
21614 }
21615 else
21618 /* Look for the `)'. */
21622 }
21624 /* Parse an (optional) type-id-list.
21626 type-id-list:
21627 type-id ... [opt]
21628 type-id-list , type-id ... [opt]
21630 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21631 in the order that the types were presented. */
21633 static tree
21635 {
21639 {
21641 tree type;
21643 /* Get the next type-id. */
21645 /* Parse the optional ellipsis. */
21647 {
21648 /* Consume the `...'. */
21651 /* Turn the type into a pack expansion expression. */
21653 }
21654 /* Add it to the list. */
21656 /* Peek at the next token. */
21658 /* If it is not a `,', we are done. */
21661 /* Consume the `,'. */
21663 }
21666 }
21668 /* Parse a try-block.
21670 try-block:
21671 try compound-statement handler-seq */
21673 static tree
21675 {
21676 tree try_block;
21690 }
21692 /* Parse a function-try-block.
21694 function-try-block:
21695 try ctor-initializer [opt] function-body handler-seq */
21697 static bool
21699 {
21700 tree compound_stmt;
21701 tree try_block;
21704 /* Look for the `try' keyword. */
21707 /* Let the rest of the front end know where we are. */
21709 /* Parse the function-body. */
21710 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21712 /* We're done with the `try' part. */
21714 /* Parse the handlers. */
21716 /* We're done with the handlers. */
21720 }
21722 /* Parse a handler-seq.
21724 handler-seq:
21725 handler handler-seq [opt] */
21727 static void
21729 {
21731 {
21734 /* Parse the handler. */
21736 /* Peek at the next token. */
21738 /* If it's not `catch' then there are no more handlers. */
21741 }
21742 }
21744 /* Parse a handler.
21746 handler:
21747 catch ( exception-declaration ) compound-statement */
21749 static void
21751 {
21752 tree handler;
21753 tree declaration;
21763 }
21765 /* Parse an exception-declaration.
21767 exception-declaration:
21768 type-specifier-seq declarator
21769 type-specifier-seq abstract-declarator
21770 type-specifier-seq
21771 ...
21773 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21774 ellipsis variant is used. */
21776 static tree
21778 {
21779 cp_decl_specifier_seq type_specifiers;
21783 /* If it's an ellipsis, it's easy to handle. */
21785 {
21786 /* Consume the `...' token. */
21789 }
21791 /* Types may not be defined in exception-declarations. */
21793 parser->type_definition_forbidden_message
21796 /* Parse the type-specifier-seq. */
21800 /* If it's a `)', then there is no declarator. */
21803 else
21810 /* Restore the saved message. */
21817 }
21819 /* Parse a throw-expression.
21821 throw-expression:
21822 throw assignment-expression [opt]
21824 Returns a THROW_EXPR representing the throw-expression. */
21826 static tree
21828 {
21829 tree expression;
21834 /* Figure out whether or not there is an assignment-expression
21835 following the "throw" keyword. */
21843 else
21847 }
21849 /* GNU Extensions */
21851 /* Parse an (optional) asm-specification.
21853 asm-specification:
21854 asm ( string-literal )
21856 If the asm-specification is present, returns a STRING_CST
21857 corresponding to the string-literal. Otherwise, returns
21858 NULL_TREE. */
21860 static tree
21862 {
21864 tree asm_specification;
21866 /* Peek at the next token. */
21868 /* If the next token isn't the `asm' keyword, then there's no
21869 asm-specification. */
21873 /* Consume the `asm' token. */
21875 /* Look for the `('. */
21878 /* Look for the string-literal. */
21881 /* Look for the `)'. */
21885 }
21887 /* Parse an asm-operand-list.
21889 asm-operand-list:
21890 asm-operand
21891 asm-operand-list , asm-operand
21893 asm-operand:
21894 string-literal ( expression )
21895 [ string-literal ] string-literal ( expression )
21897 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21898 each node is the expression. The TREE_PURPOSE is itself a
21899 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21900 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21901 is a STRING_CST for the string literal before the parenthesis. Returns
21902 ERROR_MARK_NODE if any of the operands are invalid. */
21904 static tree
21906 {
21911 {
21912 tree string_literal;
21913 tree expression;
21914 tree name;
21917 {
21918 /* Consume the `[' token. */
21920 /* Read the operand name. */
21925 /* Look for the closing `]'. */
21927 }
21928 else
21930 /* Look for the string-literal. */
21933 /* Look for the `('. */
21935 /* Parse the expression. */
21937 /* Look for the `)'. */
21945 /* Add this operand to the list. */
21947 expression,
21948 asm_operands);
21949 /* If the next token is not a `,', there are no more
21950 operands. */
21953 /* Consume the `,'. */
21955 }
21958 }
21960 /* Parse an asm-clobber-list.
21962 asm-clobber-list:
21963 string-literal
21964 asm-clobber-list , string-literal
21966 Returns a TREE_LIST, indicating the clobbers in the order that they
21967 appeared. The TREE_VALUE of each node is a STRING_CST. */
21969 static tree
21971 {
21975 {
21976 tree string_literal;
21978 /* Look for the string literal. */
21980 /* Add it to the list. */
21982 /* If the next token is not a `,', then the list is
21983 complete. */
21986 /* Consume the `,' token. */
21988 }
21991 }
21993 /* Parse an asm-label-list.
21995 asm-label-list:
21996 identifier
21997 asm-label-list , identifier
21999 Returns a TREE_LIST, indicating the labels in the order that they
22000 appeared. The TREE_VALUE of each node is a label. */
22002 static tree
22004 {
22008 {
22011 /* Look for the identifier. */
22014 {
22017 {
22023 }
22024 }
22025 /* If the next token is not a `,', then the list is
22026 complete. */
22029 /* Consume the `,' token. */
22031 }
22034 }
22036 /* Return TRUE iff the next tokens in the stream are possibly the
22037 beginning of a GNU extension attribute. */
22039 static bool
22041 {
22043 }
22045 /* Return TRUE iff the next tokens in the stream are possibly the
22046 beginning of a standard C++-11 attribute specifier. */
22048 static bool
22050 {
22052 }
22054 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22055 beginning of a standard C++-11 attribute specifier. */
22057 static bool
22059 {
22067 }
22069 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22070 beginning of a GNU extension attribute. */
22072 static bool
22074 {
22078 }
22080 /* Return true iff the next tokens can be the beginning of either a
22081 GNU attribute list, or a standard C++11 attribute sequence. */
22083 static bool
22085 {
22088 }
22090 /* Return true iff the next Nth tokens can be the beginning of either
22091 a GNU attribute list, or a standard C++11 attribute sequence. */
22093 static bool
22095 {
22098 }
22100 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22101 of GNU attributes, or return NULL. */
22103 static tree
22105 {
22109 }
22111 #define CILK_SIMD_FN_CLAUSE_MASK \
22112 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22113 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22114 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22115 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22116 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22118 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22119 vector [(<clauses>)] */
22121 static void
22123 {
22127 {
22132 }
22135 {
22138 paren_scope++;
22139 }
22141 {
22144 paren_scope++;
22146 paren_scope--;
22147 /* Do not push the last ')' */
22150 }
22159 }
22161 /* Parse an (optional) series of attributes.
22163 attributes:
22164 attributes attribute
22166 attribute:
22167 __attribute__ (( attribute-list [opt] ))
22169 The return value is as for cp_parser_gnu_attribute_list. */
22171 static tree
22173 {
22177 {
22179 tree attribute_list;
22182 /* Peek at the next token. */
22184 /* If it's not `__attribute__', then we're done. */
22188 /* Consume the `__attribute__' keyword. */
22190 /* Look for the two `(' tokens. */
22194 /* Peek at the next token. */
22197 /* Parse the attribute-list. */
22199 else
22200 /* If the next token is a `)', then there is no attribute
22201 list. */
22204 /* Look for the two `)' tokens. */
22212 /* Add these new attributes to the list. */
22214 }
22217 }
22219 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22220 "__vector" or "__vector__." */
22224 {
22228 }
22230 /* Parse a GNU attribute-list.
22232 attribute-list:
22233 attribute
22234 attribute-list , attribute
22236 attribute:
22237 identifier
22238 identifier ( identifier )
22239 identifier ( identifier , expression-list )
22240 identifier ( expression-list )
22242 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22243 to an attribute. The TREE_PURPOSE of each node is the identifier
22244 indicating which attribute is in use. The TREE_VALUE represents
22245 the arguments, if any. */
22247 static tree
22249 {
22255 {
22257 tree identifier;
22258 tree attribute;
22260 /* Look for the identifier. We also allow keywords here; for
22261 example `__attribute__ ((const))' is legal. */
22265 {
22268 /* Consume the token, but save it since we need it for the
22269 SIMD enabled function parsing. */
22272 /* Save away the identifier that indicates which attribute
22273 this is. */
22275 /* For keywords, use the canonical spelling, not the
22276 parsed identifier. */
22282 /* Peek at the next token. */
22284 /* If it's an `(', then parse the attribute arguments. */
22286 {
22291 {
22294 }
22295 else
22296 vec = cp_parser_parenthesized_expression_list
22302 else
22303 {
22306 }
22307 /* Save the arguments away. */
22309 }
22311 {
22314 }
22317 {
22318 /* Add this attribute to the list. */
22321 }
22324 }
22325 /* Now, look for more attributes. If the next token isn't a
22326 `,', we're done. */
22330 /* Consume the comma and keep going. */
22332 }
22335 /* We built up the list in reverse order. */
22337 }
22339 /* Parse a standard C++11 attribute.
22341 The returned representation is a TREE_LIST which TREE_PURPOSE is
22342 the scoped name of the attribute, and the TREE_VALUE is its
22343 arguments list.
22345 Note that the scoped name of the attribute is itself a TREE_LIST
22346 which TREE_PURPOSE is the namespace of the attribute, and
22347 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22348 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22349 and which TREE_PURPOSE is directly the attribute name.
22351 Clients of the attribute code should use get_attribute_namespace
22352 and get_attribute_name to get the actual namespace and name of
22353 attributes, regardless of their being GNU or C++11 attributes.
22355 attribute:
22356 attribute-token attribute-argument-clause [opt]
22358 attribute-token:
22359 identifier
22360 attribute-scoped-token
22362 attribute-scoped-token:
22363 attribute-namespace :: identifier
22365 attribute-namespace:
22366 identifier
22368 attribute-argument-clause:
22369 ( balanced-token-seq )
22371 balanced-token-seq:
22372 balanced-token [opt]
22373 balanced-token-seq balanced-token
22375 balanced-token:
22376 ( balanced-token-seq )
22377 [ balanced-token-seq ]
22378 { balanced-token-seq }. */
22380 static tree
22382 {
22386 /* First, parse name of the the attribute, a.k.a
22387 attribute-token. */
22404 {
22405 /* We are seeing a scoped attribute token. */
22415 else
22416 {
22420 }
22422 NULL_TREE);
22424 }
22425 else
22426 {
22428 NULL_TREE);
22429 /* C++11 noreturn attribute is equivalent to GNU's. */
22432 /* C++14 deprecated attribute is equivalent to GNU's. */
22434 {
22437 "%<deprecated%> is a C++14 feature;"
22440 }
22441 }
22443 /* Now parse the optional argument clause of the attribute. */
22448 {
22454 /* A GNU attribute that takes an identifier in parameter. */
22457 vec = cp_parser_parenthesized_expression_list
22463 else
22464 {
22467 }
22471 else
22473 }
22476 }
22478 /* Parse a list of standard C++-11 attributes.
22480 attribute-list:
22481 attribute [opt]
22482 attribute-list , attribute[opt]
22483 attribute ...
22484 attribute-list , attribute ...
22485 */
22487 static tree
22489 {
22494 {
22499 {
22502 }
22507 }
22510 }
22512 /* Parse a standard C++-11 attribute specifier.
22514 attribute-specifier:
22515 [ [ attribute-list ] ]
22516 alignment-specifier
22518 alignment-specifier:
22519 alignas ( type-id ... [opt] )
22520 alignas ( alignment-expression ... [opt] ). */
22522 static tree
22524 {
22530 {
22539 else
22540 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22541 when we are sure that we have actually parsed them. */
22543 }
22544 else
22545 {
22546 tree alignas_expr;
22548 /* Look for an alignment-specifier. */
22560 {
22563 }
22569 {
22573 alignas_expr =
22580 }
22583 {
22586 }
22590 /* Build the C++-11 representation of an 'aligned'
22591 attribute. */
22592 attributes =
22596 }
22599 }
22601 /* Parse a standard C++-11 attribute-specifier-seq.
22603 attribute-specifier-seq:
22604 attribute-specifier-seq [opt] attribute-specifier
22605 */
22607 static tree
22609 {
22613 {
22622 }
22626 }
22628 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22629 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22630 current value of the PEDANTIC flag, regardless of whether or not
22631 the `__extension__' keyword is present. The caller is responsible
22632 for restoring the value of the PEDANTIC flag. */
22634 static bool
22636 {
22637 /* Save the old value of the PEDANTIC flag. */
22641 {
22642 /* Consume the `__extension__' token. */
22644 /* We're not being pedantic while the `__extension__' keyword is
22645 in effect. */
22649 }
22652 }
22654 /* Parse a label declaration.
22656 label-declaration:
22657 __label__ label-declarator-seq ;
22659 label-declarator-seq:
22660 identifier , label-declarator-seq
22661 identifier */
22663 static void
22665 {
22666 /* Look for the `__label__' keyword. */
22670 {
22671 tree identifier;
22673 /* Look for an identifier. */
22675 /* If we failed, stop. */
22678 /* Declare it as a label. */
22680 /* If the next token is a `;', stop. */
22683 /* Look for the `,' separating the label declarations. */
22685 }
22687 /* Look for the final `;'. */
22689 }
22691 /* Support Functions */
22693 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22694 NAME should have one of the representations used for an
22695 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22696 is returned. If PARSER->SCOPE is a dependent type, then a
22697 SCOPE_REF is returned.
22699 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22700 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22701 was formed. Abstractly, such entities should not be passed to this
22702 function, because they do not need to be looked up, but it is
22703 simpler to check for this special case here, rather than at the
22704 call-sites.
22706 In cases not explicitly covered above, this function returns a
22707 DECL, OVERLOAD, or baselink representing the result of the lookup.
22708 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22709 is returned.
22711 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22712 (e.g., "struct") that was used. In that case bindings that do not
22713 refer to types are ignored.
22715 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22716 ignored.
22718 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22719 are ignored.
22721 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22722 types.
22724 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22725 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22726 NULL_TREE otherwise. */
22728 static tree
22735 location_t name_location)
22736 {
22737 tree decl;
22740 /* Assume that the lookup will be unambiguous. */
22744 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22745 no longer valid. Note that if we are parsing tentatively, and
22746 the parse fails, OBJECT_TYPE will be automatically restored. */
22752 /* A template-id has already been resolved; there is no lookup to
22753 do. */
22757 {
22761 }
22763 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22764 it should already have been checked to make sure that the name
22765 used matches the type being destroyed. */
22767 {
22768 tree type;
22770 /* Figure out to which type this destructor applies. */
22775 else
22777 /* If that's not a class type, there is no destructor. */
22784 /* If it was a class type, return the destructor. */
22786 }
22788 /* By this point, the NAME should be an ordinary identifier. If
22789 the id-expression was a qualified name, the qualifying scope is
22790 stored in PARSER->SCOPE at this point. */
22793 /* Perform the lookup. */
22795 {
22801 /* If the SCOPE is dependent, the lookup must be deferred until
22802 the template is instantiated -- unless we are explicitly
22803 looking up names in uninstantiated templates. Even then, we
22804 cannot look up the name if the scope is not a class type; it
22805 might, for example, be a template type parameter. */
22810 /* Defer lookup. */
22812 else
22813 {
22816 /* If PARSER->SCOPE is a dependent type, then it must be a
22817 class type, and we must not be checking dependencies;
22818 otherwise, we would have processed this lookup above. So
22819 that PARSER->SCOPE is not considered a dependent base by
22820 lookup_member, we must enter the scope here. */
22824 /* If the PARSER->SCOPE is a template specialization, it
22825 may be instantiated during name lookup. In that case,
22826 errors may be issued. Even if we rollback the current
22827 tentative parse, those errors are valid. */
22832 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22833 lookup result and the nested-name-specifier nominates a class C:
22834 * if the name specified after the nested-name-specifier, when
22835 looked up in C, is the injected-class-name of C (Clause 9), or
22836 * if the name specified after the nested-name-specifier is the
22837 same as the identifier or the simple-template-id's template-
22838 name in the last component of the nested-name-specifier,
22839 the name is instead considered to name the constructor of
22840 class C. [ Note: for example, the constructor is not an
22841 acceptable lookup result in an elaborated-type-specifier so
22842 the constructor would not be used in place of the
22843 injected-class-name. --end note ] Such a constructor name
22844 shall be used only in the declarator-id of a declaration that
22845 names a constructor or in a using-declaration. */
22853 /* If we have a single function from a using decl, pull it out. */
22860 }
22862 /* If the scope is a dependent type and either we deferred lookup or
22863 we did lookup but didn't find the name, rememeber the name. */
22866 {
22868 {
22869 tree type;
22871 /* The resolution to Core Issue 180 says that `struct
22872 A::B' should be considered a type-name, even if `A'
22873 is dependent. */
22878 }
22882 CPP_CLOSE_PAREN)))
22886 else
22889 is_template);
22890 }
22893 }
22895 {
22896 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22897 OBJECT_TYPE is not a class. */
22899 /* If the OBJECT_TYPE is a template specialization, it may
22900 be instantiated during name lookup. In that case, errors
22901 may be issued. Even if we rollback the current tentative
22902 parse, those errors are valid. */
22904 name,
22907 tf_warning_or_error);
22908 else
22912 /* Look it up in the enclosing context. */
22918 }
22919 else
22920 {
22926 }
22928 /* If the lookup failed, let our caller know. */
22932 /* Pull out the template from an injected-class-name (or multiple). */
22936 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22938 {
22941 /* The error message we have to print is too complicated for
22942 cp_parser_error, so we incorporate its actions directly. */
22944 {
22946 name);
22948 }
22950 }
22958 /* If we have resolved the name of a member declaration, check to
22959 see if the declaration is accessible. When the name resolves to
22960 set of overloaded functions, accessibility is checked when
22961 overload resolution is done.
22963 During an explicit instantiation, access is not checked at all,
22964 as per [temp.explicit]. */
22971 }
22973 /* Like cp_parser_lookup_name, but for use in the typical case where
22974 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22975 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22977 static tree
22979 {
22981 none_type,
22986 location);
22987 }
22989 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22990 the current context, return the TYPE_DECL. If TAG_NAME_P is
22991 true, the DECL indicates the class being defined in a class-head,
22992 or declared in an elaborated-type-specifier.
22994 Otherwise, return DECL. */
22996 static tree
22998 {
22999 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23000 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23002 struct A {
23003 template <typename T> struct B;
23004 };
23006 template <typename T> struct A::B {};
23008 Similarly, in an elaborated-type-specifier:
23010 namespace N { struct X{}; }
23012 struct A {
23013 template <typename T> friend struct N::X;
23014 };
23016 However, if the DECL refers to a class type, and we are in
23017 the scope of the class, then the name lookup automatically
23018 finds the TYPE_DECL created by build_self_reference rather
23019 than a TEMPLATE_DECL. For example, in:
23021 template <class T> struct S {
23022 S s;
23023 };
23025 there is no need to handle such case. */
23031 }
23033 /* If too many, or too few, template-parameter lists apply to the
23034 declarator, issue an error message. Returns TRUE if all went well,
23035 and FALSE otherwise. */
23037 static bool
23040 location_t declarator_location)
23041 {
23043 {
23045 {
23053 /* If the DECLARATOR has the form `X<y>' then it uses one
23054 additional level of template parameters. */
23057 return cp_parser_check_template_parameters
23059 }
23074 }
23076 }
23078 /* NUM_TEMPLATES were used in the current declaration. If that is
23079 invalid, return FALSE and issue an error messages. Otherwise,
23080 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23081 declarator and we can print more accurate diagnostics. */
23083 static bool
23086 location_t location,
23088 {
23089 /* If there are the same number of template classes and parameter
23090 lists, that's OK. */
23093 /* If there are more, but only one more, then we are referring to a
23094 member template. That's OK too. */
23097 /* If there are more template classes than parameter lists, we have
23098 something like:
23100 template <class T> void S<T>::R<T>::f (); */
23102 {
23112 else
23115 }
23116 /* Otherwise, there are too many template parameter lists. We have
23117 something like:
23119 template <class T> template <class U> void S::f(); */
23122 }
23124 /* Parse an optional `::' token indicating that the following name is
23125 from the global namespace. If so, PARSER->SCOPE is set to the
23126 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23127 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23128 Returns the new value of PARSER->SCOPE, if the `::' token is
23129 present, and NULL_TREE otherwise. */
23131 static tree
23133 {
23136 /* Peek at the next token. */
23138 /* If we're looking at a `::' token then we're starting from the
23139 global namespace, not our current location. */
23141 {
23142 /* Consume the `::' token. */
23144 /* Set the SCOPE so that we know where to start the lookup. */
23150 }
23152 {
23156 }
23159 }
23161 /* Returns TRUE if the upcoming token sequence is the start of a
23162 constructor declarator. If FRIEND_P is true, the declarator is
23163 preceded by the `friend' specifier. */
23165 static bool
23167 {
23170 tree nested_name_specifier;
23173 /* The common case is that this is not a constructor declarator, so
23174 try to avoid doing lots of work if at all possible. It's not
23175 valid declare a constructor at function scope. */
23178 /* And only certain tokens can begin a constructor declarator. */
23186 /* Parse tentatively; we are going to roll back all of the tokens
23187 consumed here. */
23189 /* Assume that we are looking at a constructor declarator. */
23192 /* Look for the optional `::' operator. */
23195 /* Look for the nested-name-specifier. */
23196 nested_name_specifier
23207 /* Outside of a class-specifier, there must be a
23208 nested-name-specifier. */
23214 /* If we have a class scope, this is easy; DR 147 says that S::S always
23215 names the constructor, and no other qualified name could. */
23218 {
23228 }
23229 /* If we still think that this might be a constructor-declarator,
23230 look for a class-name. */
23232 {
23233 /* If we have:
23235 template <typename T> struct S {
23236 S();
23237 };
23239 we must recognize that the nested `S' names a class. */
23240 tree type_decl;
23244 none_type,
23248 /* If there was no class-name, then this is not a constructor.
23249 Otherwise, if we are in a class-specifier and we aren't
23250 handling a friend declaration, check that its type matches
23251 current_class_type (c++/38313). Note: error_mark_node
23252 is left alone for error recovery purposes. */
23254 && (outside_class_specifier_p
23259 /* If we're still considering a constructor, we have to see a `(',
23260 to begin the parameter-declaration-clause, followed by either a
23261 `)', an `...', or a decl-specifier. We need to check for a
23262 type-specifier to avoid being fooled into thinking that:
23264 S (f) (int);
23266 is a constructor. (It is actually a function named `f' that
23267 takes one parameter (of type `int') and returns a value of type
23268 `S'. */
23276 /* A parameter declaration begins with a decl-specifier,
23277 which is either the "attribute" keyword, a storage class
23278 specifier, or (usually) a type-specifier. */
23280 {
23281 tree type;
23285 /* Names appearing in the type-specifier should be looked up
23286 in the scope of the class. */
23289 else
23290 {
23293 {
23297 {
23300 }
23301 }
23303 }
23305 /* Inside the constructor parameter list, surrounding
23306 template-parameter-lists do not apply. */
23307 saved_num_template_parameter_lists
23311 /* Look for the type-specifier. */
23313 CP_PARSER_FLAGS_NONE,
23319 parser->num_template_parameter_lists
23322 /* Leave the scope of the class. */
23327 }
23328 }
23330 /* We did not really want to consume any tokens. */
23334 }
23336 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23337 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23338 they must be performed once we are in the scope of the function.
23340 Returns the function defined. */
23342 static tree
23343 cp_parser_function_definition_from_specifiers_and_declarator
23346 tree attributes,
23348 {
23349 tree fn;
23352 /* Begin the function-definition. */
23355 /* The things we're about to see are not directly qualified by any
23356 template headers we've seen thus far. */
23359 /* If there were names looked up in the decl-specifier-seq that we
23360 did not check, check them now. We must wait until we are in the
23361 scope of the function to perform the checks, since the function
23362 might be a friend. */
23366 {
23369 }
23372 {
23373 /* Skip the entire function. */
23376 }
23378 {
23379 /* Seen already, skip it. An error message has already been output. */
23383 /* If this is a function from a class, pop the nested class. */
23386 }
23387 else
23388 {
23389 timevar_id_t tv;
23392 else
23398 }
23401 }
23403 /* Parse the part of a function-definition that follows the
23404 declarator. INLINE_P is TRUE iff this function is an inline
23405 function defined within a class-specifier.
23407 Returns the function defined. */
23409 static tree
23412 {
23413 tree fn;
23419 bool fully_implicit_function_template_p
23422 tree implicit_template_parms
23425 cp_binding_level* implicit_template_scope
23431 /* If the next token is `return', then the code may be trying to
23432 make use of the "named return value" extension that G++ used to
23433 support. */
23436 {
23437 /* Consume the `return' keyword. */
23439 /* Look for the identifier that indicates what value is to be
23440 returned. */
23442 /* Issue an error message. */
23445 /* Skip tokens until we reach the start of the function body. */
23447 {
23454 }
23455 }
23456 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23457 anything declared inside `f'. */
23458 saved_in_unbraced_linkage_specification_p
23461 /* Inside the function, surrounding template-parameter-lists do not
23462 apply. */
23463 saved_num_template_parameter_lists
23469 /* If the next token is `try', `__transaction_atomic', or
23470 `__transaction_relaxed`, then we are looking at either function-try-block
23471 or function-transaction-block. Note that all of these include the
23472 function-body. */
23475 RID_TRANSACTION_ATOMIC);
23477 RID_TRANSACTION_RELAXED))
23479 RID_TRANSACTION_RELAXED);
23482 else
23483 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23488 /* Finish the function. */
23491 /* Generate code for it, if necessary. */
23493 /* Restore the saved values. */
23494 parser->in_unbraced_linkage_specification_p
23496 parser->num_template_parameter_lists
23500 parser->fully_implicit_function_template_p
23502 parser->implicit_template_parms
23504 parser->implicit_template_scope
23511 }
23513 /* Parse a template-declaration, assuming that the `export' (and
23514 `extern') keywords, if present, has already been scanned. MEMBER_P
23515 is as for cp_parser_template_declaration. */
23517 static void
23519 {
23522 tree parameter_list;
23527 /* Look for the `template' keyword. */
23532 /* And the `<'. */
23536 {
23537 /* 14.5.2.2 [temp.mem]
23539 A local class shall not have member templates. */
23544 }
23545 /* [temp]
23547 A template ... shall not have C linkage. */
23549 {
23551 /* Give it C++ linkage to avoid confusing other parts of the
23552 front end. */
23555 }
23556 else
23559 /* We cannot perform access checks on the template parameter
23560 declarations until we know what is being declared, just as we
23561 cannot check the decl-specifier list. */
23564 /* If the next token is `>', then we have an invalid
23565 specialization. Rather than complain about an invalid template
23566 parameter, issue an error message here. */
23568 {
23572 }
23573 else
23574 {
23575 /* Parse the template parameters. */
23577 }
23579 /* Get the deferred access checks from the parameter list. These
23580 will be checked once we know what is being declared, as for a
23581 member template the checks must be performed in the scope of the
23582 class containing the member. */
23585 /* Look for the `>'. */
23587 /* We just processed one more parameter list. */
23589 /* If the next token is `template', there are more template
23590 parameters. */
23592 RID_TEMPLATE))
23597 else
23598 {
23599 /* There are no access checks when parsing a template, as we do not
23600 know if a specialization will be a friend. */
23604 checks,
23605 member_p,
23610 /* If this is a member template declaration, let the front
23611 end know. */
23613 {
23618 }
23623 }
23624 /* We are done with the current parameter list. */
23629 /* Finish up. */
23632 /* Check the template arguments for a literal operator template. */
23636 {
23640 else
23641 {
23644 {
23650 }
23652 {
23660 }
23661 else
23663 }
23665 {
23668 " Expected non-type template argument pack <char...>"
23670 decl);
23671 else
23674 decl);
23675 }
23676 }
23677 /* Register member declarations. */
23680 /* For the erroneous case of a template with C linkage, we pushed an
23681 implicit C++ linkage scope; exit that scope now. */
23684 /* If DECL is a function template, we must return to parse it later.
23685 (Even though there is no definition, there might be default
23686 arguments that need handling.) */
23690 }
23692 /* Perform the deferred access checks from a template-parameter-list.
23693 CHECKS is a TREE_LIST of access checks, as returned by
23694 get_deferred_access_checks. */
23696 static void
23697 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23698 {
23702 }
23704 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23705 `function-definition' sequence that follows a template header.
23706 If MEMBER_P is true, this declaration appears in a class scope.
23708 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23709 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23711 static tree
23717 {
23720 cp_decl_specifier_seq decl_specifiers;
23724 /* This function is only used when processing a template
23725 declaration. */
23729 /* Defer access checks until we know what is being declared. */
23732 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23733 alternative. */
23736 CP_PARSER_FLAGS_OPTIONAL,
23742 /* There are no template typedefs. */
23744 {
23748 }
23750 /* Gather up the access checks that occurred the
23751 decl-specifier-seq. */
23754 /* Check for the declaration of a template class. */
23756 {
23758 {
23761 /* In this case:
23763 struct C {
23764 friend template <typename T> struct A<T>::B;
23765 };
23767 A<T>::B will be represented by a TYPENAME_TYPE, and
23768 therefore not recognized by shadow_tag. */
23770 && !decl
23777 else
23780 /* Perform access checks for template parameters. */
23782 }
23783 }
23785 /* Complain about missing 'typename' or other invalid type names. */
23788 {
23789 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23790 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23791 the rest of this declaration. */
23794 }
23796 /* If it's not a template class, try for a template function. If
23797 the next token is a `;', then this declaration does not declare
23798 anything. But, if there were errors in the decl-specifiers, then
23799 the error might well have come from an attempted class-specifier.
23800 In that case, there's no need to warn about a missing declarator. */
23804 {
23807 checks,
23809 member_p,
23810 declares_class_or_enum,
23814 /* 7.1.1-1 [dcl.stc]
23816 A storage-class-specifier shall not be specified in an explicit
23817 specialization... */
23819 && explicit_specialization_p
23821 {
23825 }
23829 }
23831 /* Look for a trailing `;' after the declaration. */
23837 out:
23840 /* Clear any current qualification; whatever comes next is the start
23841 of something new. */
23847 }
23849 /* Parse a cast-expression that is not the operand of a unary "&". */
23851 static tree
23853 {
23856 }
23858 /* Parse a functional cast to TYPE. Returns an expression
23859 representing the cast. */
23861 static tree
23863 {
23865 tree expression_list;
23866 tree cast;
23873 {
23881 tf_warning_or_error);
23882 }
23891 else
23892 {
23895 }
23898 tf_warning_or_error);
23899 /* [expr.const]/1: In an integral constant expression "only type
23900 conversions to integral or enumeration type can be used". */
23906 NIC_CONSTRUCTOR))
23909 }
23911 /* Save the tokens that make up the body of a member function defined
23912 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23913 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23914 specifiers applied to the declaration. Returns the FUNCTION_DECL
23915 for the member function. */
23917 static tree
23921 tree attributes)
23922 {
23925 tree fn;
23927 /* Create the FUNCTION_DECL. */
23930 /* If something went badly wrong, bail out now. */
23932 {
23933 /* If there's a function-body, skip it. */
23938 }
23940 /* Remember it, if there default args to post process. */
23943 /* Save away the tokens that make up the body of the
23944 function. */
23946 /* Handle function try blocks. */
23949 /* We can have braced-init-list mem-initializers before the fn body. */
23951 {
23954 {
23955 /* cache_group will stop after an un-nested { } pair, too. */
23959 /* variadic mem-inits have ... after the ')'. */
23962 }
23963 }
23965 /* Handle function try blocks. */
23970 /* Save away the inline definition; we will process it when the
23971 class is complete. */
23975 /* We need to know that this was defined in the class, so that
23976 friend templates are handled correctly. */
23979 /* Add FN to the queue of functions to be parsed later. */
23983 }
23985 /* Save the tokens that make up the in-class initializer for a non-static
23986 data member. Returns a DEFAULT_ARG. */
23988 static tree
23990 {
23992 }
23994 /* Parse a template-argument-list, as well as the trailing ">" (but
23995 not the opening "<"). See cp_parser_template_argument_list for the
23996 return value. */
23998 static tree
24000 {
24001 tree arguments;
24002 tree saved_scope;
24003 tree saved_qualifying_scope;
24004 tree saved_object_scope;
24009 /* [temp.names]
24011 When parsing a template-id, the first non-nested `>' is taken as
24012 the end of the template-argument-list rather than a greater-than
24013 operator. */
24014 saved_greater_than_is_operator_p
24017 /* Parsing the argument list may modify SCOPE, so we save it
24018 here. */
24022 /* We need to evaluate the template arguments, even though this
24023 template-id may be nested within a "sizeof". */
24028 /* Parse the template-argument-list itself. */
24032 else
24034 /* Look for the `>' that ends the template-argument-list. If we find
24035 a '>>' instead, it's probably just a typo. */
24037 {
24039 {
24040 /* In C++0x, a `>>' in a template argument list or cast
24041 expression is considered to be two separate `>'
24042 tokens. So, change the current token to a `>', but don't
24043 consume it: it will be consumed later when the outer
24044 template argument list (or cast expression) is parsed.
24045 Note that this replacement of `>' for `>>' is necessary
24046 even if we are parsing tentatively: in the tentative
24047 case, after calling
24048 cp_parser_enclosed_template_argument_list we will always
24049 throw away all of the template arguments and the first
24050 closing `>', either because the template argument list
24051 was erroneous or because we are replacing those tokens
24052 with a CPP_TEMPLATE_ID token. The second `>' (which will
24053 not have been thrown away) is needed either to close an
24054 outer template argument list or to complete a new-style
24055 cast. */
24058 }
24060 {
24061 /* If we're in a nested template argument list, the '>>' has
24062 to be a typo for '> >'. We emit the error message, but we
24063 continue parsing and we push a '>' as next token, so that
24064 the argument list will be parsed correctly. Note that the
24065 global source location is still on the token before the
24066 '>>', so we need to say explicitly where we want it. */
24072 }
24073 else
24074 {
24075 /* If this is not a nested template argument list, the '>>'
24076 is a typo for '>'. Emit an error message and continue.
24077 Same deal about the token location, but here we can get it
24078 right by consuming the '>>' before issuing the diagnostic. */
24081 "spurious %<>>%>, use %<>%> to terminate "
24083 }
24084 }
24085 else
24087 /* The `>' token might be a greater-than operator again now. */
24088 parser->greater_than_is_operator_p
24090 /* Restore the SAVED_SCOPE. */
24098 }
24100 /* MEMBER_FUNCTION is a member function, or a friend. If default
24101 arguments, or the body of the function have not yet been parsed,
24102 parse them now. */
24104 static void
24106 {
24108 /* If this member is a template, get the underlying
24109 FUNCTION_DECL. */
24113 /* There should not be any class definitions in progress at this
24114 point; the bodies of members are only parsed outside of all class
24115 definitions. */
24117 /* While we're parsing the member functions we might encounter more
24118 classes. We want to handle them right away, but we don't want
24119 them getting mixed up with functions that are currently in the
24120 queue. */
24123 /* Make sure that any template parameters are in scope. */
24126 /* If the body of the function has not yet been parsed, parse it
24127 now. */
24129 {
24130 tree function_scope;
24133 /* The function is no longer pending; we are processing it. */
24138 /* If this is a local class, enter the scope of the containing
24139 function. */
24144 /* Push the body of the function onto the lexer stack. */
24147 /* Let the front end know that we going to be defining this
24148 function. */
24152 /* Don't do access checking if it is a templated function. */
24156 /* #pragma omp declare reduction needs special parsing. */
24158 {
24163 }
24164 else
24165 /* Now, parse the body of the function. */
24172 /* Leave the scope of the containing function. */
24176 }
24178 /* Remove any template parameters from the symbol table. */
24181 /* Restore the queue. */
24184 }
24186 /* If DECL contains any default args, remember it on the unparsed
24187 functions queue. */
24189 static void
24191 {
24192 tree probe;
24195 probe;
24198 {
24202 }
24203 }
24205 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24206 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24207 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24208 from the parameter-type-list. */
24210 static tree
24213 {
24215 tree parsed_arg;
24221 /* Push the saved tokens for the default argument onto the parser's
24222 lexer stack. */
24228 /* Parse the default argument. */
24239 {
24240 /* In a non-template class, check conversions now. In a template,
24241 we'll wait and instantiate these as needed. */
24244 tf_warning_or_error);
24245 else
24247 }
24249 /* If the token stream has not been completely used up, then
24250 there was extra junk after the end of the default
24251 argument. */
24253 {
24256 else
24258 }
24260 /* Revert to the main lexer. */
24264 }
24266 /* FIELD is a non-static data member with an initializer which we saved for
24267 later; parse it now. */
24269 static void
24271 {
24272 tree def;
24279 NULL_TREE);
24285 }
24287 /* FN is a FUNCTION_DECL which may contains a parameter with an
24288 unparsed DEFAULT_ARG. Parse the default args now. This function
24289 assumes that the current scope is the scope in which the default
24290 argument should be processed. */
24292 static void
24294 {
24298 /* While we're parsing the default args, we might (due to the
24299 statement expression extension) encounter more classes. We want
24300 to handle them right away, but we don't want them getting mixed
24301 up with default args that are currently in the queue. */
24304 /* Local variable names (and the `this' keyword) may not appear
24305 in a default argument. */
24316 {
24318 tree parsed_arg;
24320 tree copy;
24327 /* This can happen for a friend declaration for a function
24328 already declared with default arguments. */
24331 parsed_arg
24333 default_arg,
24336 {
24338 }
24342 /* Update any instantiations we've already created. */
24346 }
24350 /* Make sure no default arg is missing. */
24353 /* Restore the state of local_variables_forbidden_p. */
24356 /* Restore the queue. */
24358 }
24360 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24362 sizeof ... ( identifier )
24364 where the 'sizeof' token has already been consumed. */
24366 static tree
24368 {
24369 /* Consume the `...'. */
24376 else
24384 /* The name is not qualified. */
24402 }
24404 /* Parse the operand of `sizeof' (or a similar operator). Returns
24405 either a TYPE or an expression, depending on the form of the
24406 input. The KEYWORD indicates which kind of expression we have
24407 encountered. */
24409 static tree
24411 {
24418 /* If it's a `...', then we are computing the length of a parameter
24419 pack. */
24424 /* Types cannot be defined in a `sizeof' expression. Save away the
24425 old message. */
24427 /* And create the new one. */
24433 /* The restrictions on constant-expressions do not apply inside
24434 sizeof expressions. */
24435 saved_integral_constant_expression_p
24437 saved_non_integral_constant_expression_p
24441 /* Do not actually evaluate the expression. */
24444 /* If it's a `(', then we might be looking at the type-id
24445 construction. */
24447 {
24450 /* We can't be sure yet whether we're looking at a type-id or an
24451 expression. */
24453 /* Note: as a GNU Extension, compound literals are considered
24454 postfix-expressions as they are in C99, so they are valid
24455 arguments to sizeof. See comment in cp_parser_cast_expression
24456 for details. */
24459 else
24460 {
24463 /* Look for the type-id. */
24465 /* Look for the closing `)'. */
24468 }
24470 /* If all went well, then we're done. */
24472 {
24473 cp_decl_specifier_seq decl_specs;
24475 /* Build a trivial decl-specifier-seq. */
24479 /* Call grokdeclarator to figure out what type this is. */
24482 TYPENAME,
24485 }
24486 }
24488 /* If the type-id production did not work out, then we must be
24489 looking at the unary-expression production. */
24493 /* Go back to evaluating expressions. */
24497 /* Free the message we created. */
24499 /* And restore the old one. */
24501 parser->integral_constant_expression_p
24503 parser->non_integral_constant_expression_p
24507 }
24509 /* If the current declaration has no declarator, return true. */
24511 static bool
24513 {
24514 /* If the next token is a `;' or a `,' then there is no
24515 declarator. */
24518 }
24520 /* Update the DECL_SPECS to reflect the storage class indicated by
24521 KEYWORD. */
24523 static void
24528 {
24529 cp_storage_class storage_class;
24532 {
24536 }
24538 {
24541 }
24546 {
24549 }
24552 {
24570 }
24574 /* A storage class specifier cannot be applied alongside a typedef
24575 specifier. If there is a typedef specifier present then set
24576 conflicting_specifiers_p which will trigger an error later
24577 on in grokdeclarator. */
24580 }
24582 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24583 is true, the type is a class or enum definition. */
24585 static void
24587 tree type_spec,
24590 {
24593 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24594 (with, for example, in "typedef int wchar_t;") we remember that
24595 this is what happened. In system headers, we ignore these
24596 declarations so that G++ can work with system headers that are not
24597 C++-safe. */
24599 && !type_definition_p
24609 {
24612 ds_redefined_builtin_type_spec,
24613 token);
24615 {
24619 }
24620 }
24623 else
24624 {
24629 }
24630 }
24632 /* True iff TOKEN is the GNU keyword __thread. */
24634 static bool
24636 {
24639 }
24641 /* Set the location for a declarator specifier and check if it is
24642 duplicated.
24644 DECL_SPECS is the sequence of declarator specifiers onto which to
24645 set the location.
24647 DS is the single declarator specifier to set which location is to
24648 be set onto the existing sequence of declarators.
24650 LOCATION is the location for the declarator specifier to
24651 consider. */
24653 static void
24656 {
24665 {
24669 }
24670 else
24671 {
24673 {
24677 else
24678 {
24681 OPT_Wlong_long,
24683 }
24684 }
24686 {
24691 else
24693 }
24694 else
24695 {
24711 "__complex"
24712 };
24715 }
24716 }
24717 }
24719 /* Return true iff the declarator specifier DS is present in the
24720 sequence of declarator specifiers DECL_SPECS. */
24722 bool
24724 cp_decl_spec ds)
24725 {
24732 }
24734 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24735 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24737 static bool
24739 {
24741 }
24743 /* Issue an error message indicating that TOKEN_DESC was expected.
24744 If KEYWORD is true, it indicated this function is called by
24745 cp_parser_require_keword and the required token can only be
24746 a indicated keyword. */
24748 static void
24750 required_token token_desc,
24752 {
24754 {
24823 }
24825 {
24827 {
24906 }
24907 }
24908 else
24910 }
24914 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24915 issue an error message indicating that TOKEN_DESC was expected.
24917 Returns the token consumed, if the token had the appropriate type.
24918 Otherwise, returns NULL. */
24923 required_token token_desc)
24924 {
24927 else
24928 {
24929 /* Output the MESSAGE -- unless we're parsing tentatively. */
24933 }
24934 }
24936 /* An error message is produced if the next token is not '>'.
24937 All further tokens are skipped until the desired token is
24938 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24940 static void
24942 {
24943 /* Current level of '< ... >'. */
24945 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24948 /* Are we ready, yet? If not, issue error message. */
24952 /* Skip tokens until the desired token is found. */
24954 {
24955 /* Peek at the next token. */
24957 {
24965 /* C++0x views the `>>' operator as two `>' tokens, but
24966 C++98 does not. */
24969 {
24970 /* We've hit a `>>' where the first `>' closes the
24971 template argument list, and the second `>' is
24972 spurious. Just consume the `>>' and stop; we've
24973 already produced at least one error. */
24976 }
24977 /* Fall through for C++0x, so we handle the second `>' in
24978 the `>>'. */
24982 {
24983 /* We've reached the token we want, consume it and stop. */
24986 }
25005 /* The '>' was probably forgotten, don't look further. */
25010 }
25012 /* Consume this token. */
25014 }
25015 }
25017 /* If the next token is the indicated keyword, consume it. Otherwise,
25018 issue an error message indicating that TOKEN_DESC was expected.
25020 Returns the token consumed, if the token had the appropriate type.
25021 Otherwise, returns NULL. */
25026 required_token token_desc)
25027 {
25031 {
25034 }
25037 }
25039 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25040 function-definition. */
25042 static bool
25044 {
25047 /* A ctor-initializer begins with a `:'. */
25049 /* A function-try-block begins with `try'. */
25051 /* A function-transaction-block begins with `__transaction_atomic'
25052 or `__transaction_relaxed'. */
25055 /* The named return value extension begins with `return'. */
25057 }
25059 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25060 definition. */
25062 static bool
25064 {
25071 }
25073 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25074 C++0x) ending a template-argument. */
25076 static bool
25078 {
25086 }
25088 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25089 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25091 static bool
25094 {
25100 /* Check for the sequence `<::' in the original code. It would be lexed as
25101 `[:', where `[' is a digraph, and there is no whitespace before
25102 `:'. */
25104 {
25109 }
25111 }
25113 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25114 or none_type otherwise. */
25116 static enum tag_types
25118 {
25120 {
25130 }
25131 }
25133 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25134 or none_type otherwise or if the token is null. */
25136 static enum tag_types
25138 {
25143 {
25151 }
25152 }
25154 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25156 static void
25158 {
25162 {
25166 type))
25169 }
25170 }
25172 /* Issue an error message if DECL is redeclared with different
25173 access than its original declaration [class.access.spec/3].
25174 This applies to nested classes and nested class templates.
25175 [class.mem/1]. */
25177 static void
25179 {
25188 }
25190 /* Look for the `template' keyword, as a syntactic disambiguator.
25191 Return TRUE iff it is present, in which case it will be
25192 consumed. */
25194 static bool
25196 {
25198 {
25199 /* In C++98 the `template' keyword can only be used within templates;
25200 outside templates the parser can always figure out what is a
25201 template and what is not. In C++11, per the resolution of DR 468,
25202 `template' is allowed in cases where it is not strictly necessary. */
25205 {
25208 "in C++98 %<template%> (as a disambiguator) is only "
25210 /* If this part of the token stream is rescanned, the same
25211 error message would be generated. So, we purge the token
25212 from the stream. */
25215 }
25216 else
25217 {
25218 /* Consume the `template' keyword. */
25221 }
25222 }
25224 }
25226 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25227 set PARSER->SCOPE, and perform other related actions. */
25229 static void
25231 {
25237 /* Get the stored value. */
25239 /* Perform any access checks that were deferred. */
25242 {
25247 }
25248 /* Set the scope from the stored value. */
25252 }
25254 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25255 encounter the end of a block before what we were looking for. */
25257 static bool
25261 {
25263 {
25266 /* Abort a parenthesized expression if we encounter a semicolon. */
25270 /* If we've reached the end of the file, stop. */
25276 /* We've hit the end of an enclosing block, so there's been some
25277 kind of syntax error. */
25280 /* Consume the token. */
25282 /* See if it starts a new group. */
25284 {
25286 /* In theory this should probably check end == '}', but
25287 cp_parser_save_member_function_body needs it to exit
25288 after either '}' or ')' when called with ')'. */
25291 }
25293 {
25297 }
25302 }
25303 }
25305 /* Like above, for caching a default argument or NSDMI. Both of these are
25306 terminated by a non-nested comma, but it can be unclear whether or not a
25307 comma is nested in a template argument list unless we do more parsing.
25308 In order to handle this ambiguity, when we encounter a ',' after a '<'
25309 we try to parse what follows as a parameter-declaration-list (in the
25310 case of a default argument) or a member-declarator (in the case of an
25311 NSDMI). If that succeeds, then we stop caching. */
25313 static tree
25315 {
25320 tree default_argument;
25322 /* Add tokens until we have processed the entire default
25323 argument. We add the range [first_token, token). */
25326 {
25327 /* For list-initialization, this is straightforward. */
25330 }
25332 {
25335 /* Peek at the next token. */
25337 /* What we do depends on what token we have. */
25339 {
25340 /* In valid code, a default argument must be
25341 immediately followed by a `,' `)', or `...'. */
25344 {
25345 /* If we've seen a '<', we might be in a
25346 template-argument-list. Until Core issue 325 is
25347 resolved, we don't know how this situation ought
25348 to be handled, so try to DTRT. We check whether
25349 what comes after the comma is a valid parameter
25350 declaration list. If it is, then the comma ends
25351 the default argument; otherwise the default
25352 argument continues. */
25355 /* Set ITALP so cp_parser_parameter_declaration_list
25356 doesn't decide to commit to this parse. */
25364 {
25371 }
25372 else
25373 {
25377 }
25384 }
25387 /* If we run into a non-nested `;', `}', or `]',
25388 then the code is invalid -- but the default
25389 argument is certainly over. */
25394 /* Handle correctly int n = sizeof ... ( p ); */
25397 /* Update DEPTH, if necessary. */
25412 /* This might be the comparison operator, or it might
25413 start a template argument list. */
25420 /* Fall through for C++0x, which treats the `>>'
25421 operator like two `>' tokens in certain
25422 cases. */
25426 {
25427 /* This might be an operator, or it might close a
25428 template argument list. But if a previous '<'
25429 started a template argument list, this will have
25430 closed it, so we can't be in one anymore. */
25434 }
25437 /* If we run out of tokens, issue an error message. */
25446 /* In these cases, we should look for template-ids.
25447 For example, if the default argument is
25448 `X<int, double>()', we need to do name lookup to
25449 figure out whether or not `X' is a template; if
25450 so, the `,' does not end the default argument.
25452 That is not yet done. */
25457 }
25459 /* If we've reached the end, stop. */
25463 /* Add the token to the token block. */
25465 }
25467 /* Create a DEFAULT_ARG to represent the unparsed default
25468 argument. */
25475 }
25477 /* Begin parsing tentatively. We always save tokens while parsing
25478 tentatively so that if the tentative parsing fails we can restore the
25479 tokens. */
25481 static void
25483 {
25484 /* Enter a new parsing context. */
25486 /* Begin saving tokens. */
25488 /* In order to avoid repetitive access control error messages,
25489 access checks are queued up until we are no longer parsing
25490 tentatively. */
25492 }
25494 /* Commit to the currently active tentative parse. */
25496 static void
25498 {
25502 /* Mark all of the levels as committed. */
25505 {
25512 }
25513 }
25515 /* Commit to the topmost currently active tentative parse.
25517 Note that this function shouldn't be called when there are
25518 irreversible side-effects while in a tentative state. For
25519 example, we shouldn't create a permanent entry in the symbol
25520 table, or issue an error message that might not apply if the
25521 tentative parse is aborted. */
25523 static void
25525 {
25530 {
25538 }
25539 }
25541 /* Abort the currently active tentative parse. All consumed tokens
25542 will be rolled back, and no diagnostics will be issued. */
25544 static void
25546 {
25550 /* Now, pretend that we want to see if the construct was
25551 successfully parsed. */
25553 }
25555 /* Stop parsing tentatively. If a parse error has occurred, restore the
25556 token stream. Otherwise, commit to the tokens we have consumed.
25557 Returns true if no error occurred; false otherwise. */
25559 static bool
25561 {
25565 /* Remember whether or not an error occurred, since we are about to
25566 destroy that information. */
25568 /* Remove the topmost context from the stack. */
25571 /* If no parse errors occurred, commit to the tentative parse. */
25573 {
25574 /* Commit to the tokens read tentatively, unless that was
25575 already done. */
25580 }
25581 /* Otherwise, if errors occurred, roll back our state so that things
25582 are just as they were before we began the tentative parse. */
25583 else
25584 {
25587 }
25588 /* Add the context to the front of the free list. */
25593 }
25595 /* Returns true if we are parsing tentatively and are not committed to
25596 this tentative parse. */
25598 static bool
25600 {
25603 }
25605 /* Returns nonzero iff an error has occurred during the most recent
25606 tentative parse. */
25608 static bool
25610 {
25613 }
25615 /* Returns nonzero if GNU extensions are allowed. */
25617 static bool
25619 {
25621 }
25622 \f
25623 /* Objective-C++ Productions */
25626 /* Parse an Objective-C expression, which feeds into a primary-expression
25627 above.
25629 objc-expression:
25630 objc-message-expression
25631 objc-string-literal
25632 objc-encode-expression
25633 objc-protocol-expression
25634 objc-selector-expression
25636 Returns a tree representation of the expression. */
25638 static tree
25640 {
25641 /* Try to figure out what kind of declaration is present. */
25645 {
25655 {
25667 }
25673 }
25676 }
25678 /* Parse an Objective-C message expression.
25680 objc-message-expression:
25681 [ objc-message-receiver objc-message-args ]
25683 Returns a representation of an Objective-C message. */
25685 static tree
25687 {
25696 }
25698 /* Parse an objc-message-receiver.
25700 objc-message-receiver:
25701 expression
25702 simple-type-specifier
25704 Returns a representation of the type or expression. */
25706 static tree
25708 {
25709 tree rcv;
25711 /* An Objective-C message receiver may be either (1) a type
25712 or (2) an expression. */
25716 /* If that worked out, fine. */
25723 CP_PARSER_FLAGS_NONE);
25730 }
25732 /* Parse the arguments and selectors comprising an Objective-C message.
25734 objc-message-args:
25735 objc-selector
25736 objc-selector-args
25737 objc-selector-args , objc-comma-args
25739 objc-selector-args:
25740 objc-selector [opt] : assignment-expression
25741 objc-selector-args objc-selector [opt] : assignment-expression
25743 objc-comma-args:
25744 assignment-expression
25745 objc-comma-args , assignment-expression
25747 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25748 selector arguments and TREE_VALUE containing a list of comma
25749 arguments. */
25751 static tree
25753 {
25759 {
25765 /* Detect if we have a unary selector. */
25774 sel_args
25779 }
25781 /* Handle non-selector arguments, if any. */
25783 {
25784 tree arg;
25789 addl_args
25794 }
25797 {
25800 }
25803 }
25805 /* Parse an Objective-C encode expression.
25807 objc-encode-expression:
25808 @encode objc-typename
25810 Returns an encoded representation of the type argument. */
25812 static tree
25814 {
25815 tree type;
25825 {
25829 }
25831 /* This happens if we find @encode(T) (where T is a template
25832 typename or something dependent on a template typename) when
25833 parsing a template. In that case, we can't compile it
25834 immediately, but we rather create an AT_ENCODE_EXPR which will
25835 need to be instantiated when the template is used.
25836 */
25838 {
25842 }
25845 }
25847 /* Parse an Objective-C @defs expression. */
25849 static tree
25851 {
25852 tree name;
25860 }
25862 /* Parse an Objective-C protocol expression.
25864 objc-protocol-expression:
25865 @protocol ( identifier )
25867 Returns a representation of the protocol expression. */
25869 static tree
25871 {
25872 tree proto;
25880 }
25882 /* Parse an Objective-C selector expression.
25884 objc-selector-expression:
25885 @selector ( objc-method-signature )
25887 objc-method-signature:
25888 objc-selector
25889 objc-selector-seq
25891 objc-selector-seq:
25892 objc-selector :
25893 objc-selector-seq objc-selector :
25895 Returns a representation of the method selector. */
25897 static tree
25899 {
25911 {
25920 {
25921 /* Detect if we have a unary selector. */
25923 {
25926 }
25927 else
25928 {
25930 }
25931 }
25936 {
25937 sel_seq
25940 sel_seq
25943 }
25944 else
25945 sel_seq
25950 }
25952 finish_selector:
25956 }
25958 /* Parse a list of identifiers.
25960 objc-identifier-list:
25961 identifier
25962 objc-identifier-list , identifier
25964 Returns a TREE_LIST of identifier nodes. */
25966 static tree
25968 {
25969 tree identifier;
25970 tree list;
25981 {
25988 identifier));
25990 }
25993 }
25995 /* Parse an Objective-C alias declaration.
25997 objc-alias-declaration:
25998 @compatibility_alias identifier identifier ;
26000 This function registers the alias mapping with the Objective-C front end.
26001 It returns nothing. */
26003 static void
26005 {
26013 }
26015 /* Parse an Objective-C class forward-declaration.
26017 objc-class-declaration:
26018 @class objc-identifier-list ;
26020 The function registers the forward declarations with the Objective-C
26021 front end. It returns nothing. */
26023 static void
26025 {
26028 {
26029 tree id;
26039 else
26041 }
26043 }
26045 /* Parse a list of Objective-C protocol references.
26047 objc-protocol-refs-opt:
26048 objc-protocol-refs [opt]
26050 objc-protocol-refs:
26051 < objc-identifier-list >
26053 Returns a TREE_LIST of identifiers, if any. */
26055 static tree
26057 {
26061 {
26065 }
26068 }
26070 /* Parse a Objective-C visibility specification. */
26072 static void
26074 {
26078 {
26093 }
26095 /* Eat '@private'/'@protected'/'@public'. */
26097 }
26099 /* Parse an Objective-C method type. Return 'true' if it is a class
26100 (+) method, and 'false' if it is an instance (-) method. */
26104 {
26107 else
26109 }
26111 /* Parse an Objective-C protocol qualifier. */
26113 static tree
26115 {
26128 {
26133 }
26136 }
26138 /* Parse an Objective-C typename. */
26140 static tree
26142 {
26146 {
26152 /* An ObjC type name may consist of just protocol qualifiers, in which
26153 case the type shall default to 'id'. */
26155 {
26158 /* If the type could not be parsed, an error has already
26159 been produced. For error recovery, behave as if it had
26160 not been specified, which will use the default type
26161 'id'. */
26163 {
26165 /* We need to skip to the closing parenthesis as
26166 cp_parser_type_id() does not seem to do it for
26167 us. */
26172 }
26173 }
26177 }
26180 }
26182 /* Check to see if TYPE refers to an Objective-C selector name. */
26184 static bool
26186 {
26192 }
26194 /* Parse an Objective-C selector. */
26196 static tree
26198 {
26202 {
26205 }
26207 /* C++ operator names are allowed to appear in ObjC selectors. */
26209 {
26222 }
26223 }
26225 /* Parse an Objective-C params list. */
26227 static tree
26229 {
26235 {
26245 /* Detect if we have a unary selector. */
26248 {
26251 }
26255 {
26256 /* Something went quite wrong. There should be a colon
26257 here, but there is not. Stop parsing parameters. */
26259 }
26261 /* New ObjC allows attributes on parameters too. */
26266 params
26269 type_name,
26270 identifier,
26271 parm_attr));
26274 }
26277 {
26280 }
26282 /* We allow tail attributes for the method. */
26284 {
26292 }
26295 {
26298 }
26300 }
26302 /* Parse the non-keyword Objective-C params. */
26304 static tree
26307 {
26313 {
26315 tree parm;
26321 {
26326 }
26328 /* TODO: parse attributes for tail parameters. */
26337 }
26339 /* We allow tail attributes for the method. */
26341 {
26343 {
26348 }
26349 else
26350 /* We have an error, but parse the attributes, so that we can
26351 carry on. */
26357 }
26360 }
26362 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26364 static void
26366 {
26369 /* If the next token is `extern' and the following token is a string
26370 literal, then we have a linkage specification. */
26372 && cp_parser_is_pure_string_literal
26375 /* Handle #pragma, if any. */
26378 /* Allow stray semicolons. */
26381 /* Mark methods as optional or required, when building protocols. */
26383 {
26386 }
26388 {
26391 }
26394 /* Other stray characters must generate errors. */
26396 {
26400 }
26401 /* Finally, try to parse a block-declaration, or a function-definition. */
26402 else
26404 }
26406 /* Parse a method signature. */
26408 static tree
26410 {
26426 }
26428 static bool
26430 {
26431 tree tattr;
26436 /* If the attributes are followed by a method introducer, this is not allowed.
26437 Dump the attributes and flag the situation. */
26442 /* Otherwise, the attributes introduce some interstitial code, possibly so
26443 rewind to allow that check. */
26446 }
26448 /* Parse an Objective-C method prototype list. */
26450 static void
26452 {
26456 {
26458 {
26463 else
26467 {
26471 }
26474 }
26480 OPT_Wattributes,
26482 else
26483 /* Allow for interspersed non-ObjC++ code. */
26487 }
26491 else
26495 }
26497 /* Parse an Objective-C method definition list. */
26499 static void
26501 {
26505 {
26506 tree meth;
26509 {
26515 else
26520 {
26524 }
26526 NULL_TREE);
26528 /* For historical reasons, we accept an optional semicolon. */
26535 {
26542 }
26543 }
26544 /* The following case will be removed once @synthesize is
26545 completely implemented. */
26556 else
26557 /* Allow for interspersed non-ObjC++ code. */
26561 }
26565 else
26569 }
26571 /* Parse Objective-C ivars. */
26573 static void
26575 {
26586 {
26587 cp_decl_specifier_seq declspecs;
26589 tree prefix_attributes;
26597 CP_PARSER_FLAGS_OPTIONAL,
26601 /* auto, register, static, extern, mutable. */
26603 {
26606 }
26608 /* thread_local. */
26610 {
26613 }
26615 /* typedef. */
26617 {
26620 }
26625 /* Keep going until we hit the `;' at the end of the
26626 declaration. */
26628 {
26633 /* Check for a (possibly unnamed) bitfield declaration. */
26641 {
26642 /* Get the name of the bitfield. */
26645 sfk_none);
26647 eat_colon:
26649 /* Get the width of the bitfield. */
26650 width
26652 }
26653 else
26654 {
26655 /* Parse the declarator. */
26656 declarator
26662 }
26664 /* Look for attributes that apply to the ivar. */
26666 /* Remember which attributes are prefix attributes and
26667 which are not. */
26669 /* Combine the attributes. */
26673 /* Create the bitfield declaration. */
26675 width,
26676 attributes);
26677 else
26682 /* Add the instance variable. */
26686 /* Reset PREFIX_ATTRIBUTES. */
26695 {
26698 }
26700 }
26704 }
26709 /* Do not consume the RID_AT_END, so it will be read again as terminating
26710 the @interface of @implementation. */
26714 /* For historical reasons, we accept an optional semicolon. */
26717 }
26719 /* Parse an Objective-C protocol declaration. */
26721 static void
26723 {
26729 {
26734 }
26736 /* See if we have a forward declaration or a definition. */
26739 /* Try a forward declaration first. */
26741 {
26743 {
26744 tree id;
26754 else
26756 }
26758 }
26760 /* Ok, we got a full-fledged definition (or at least should). */
26761 else
26762 {
26767 }
26768 }
26770 /* Parse an Objective-C superclass or category. */
26772 static void
26777 {
26783 {
26786 }
26788 {
26791 /* If there is no category name, and this is an @interface, we
26792 have a class extension. */
26794 {
26797 }
26798 else
26802 }
26803 }
26805 /* Parse an Objective-C class interface. */
26807 static void
26809 {
26816 {
26817 /* It's hard to recover because even if valid @interface stuff
26818 is to follow, we can't compile it (or validate it) if we
26819 don't even know which class it refers to. Let's assume this
26820 was a stray '@interface' token in the stream and skip it.
26821 */
26823 }
26828 /* We have either a class or a category on our hands. */
26831 else
26832 {
26834 /* Handle instance variable declarations, if any. */
26837 }
26840 }
26842 /* Parse an Objective-C class implementation. */
26844 static void
26846 {
26853 {
26854 /* It's hard to recover because even if valid @implementation
26855 stuff is to follow, we can't compile it (or validate it) if
26856 we don't even know which class it refers to. Let's assume
26857 this was a stray '@implementation' token in the stream and
26858 skip it.
26859 */
26861 }
26865 /* We have either a class or a category on our hands. */
26868 else
26869 {
26871 /* Handle instance variable declarations, if any. */
26874 }
26877 }
26879 /* Consume the @end token and finish off the implementation. */
26881 static void
26883 {
26886 }
26888 /* Parse an Objective-C declaration. */
26890 static void
26892 {
26893 /* Try to figure out what kind of declaration is present. */
26898 {
26914 }
26917 {
26940 }
26941 }
26943 /* Parse an Objective-C try-catch-finally statement.
26945 objc-try-catch-finally-stmt:
26946 @try compound-statement objc-catch-clause-seq [opt]
26947 objc-finally-clause [opt]
26949 objc-catch-clause-seq:
26950 objc-catch-clause objc-catch-clause-seq [opt]
26952 objc-catch-clause:
26953 @catch ( objc-exception-declaration ) compound-statement
26955 objc-finally-clause:
26956 @finally compound-statement
26958 objc-exception-declaration:
26959 parameter-declaration
26960 '...'
26962 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26964 Returns NULL_TREE.
26966 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26967 for C. Keep them in sync. */
26969 static tree
26971 {
26972 location_t location;
26973 tree stmt;
26978 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26979 node, lest it get absorbed into the surrounding block. */
26985 {
26994 {
26995 /* We have "@catch (...)" (where the '...' are literally
26996 what is in the code). Skip the '...'.
26997 parameter_declaration is set to NULL_TREE, and
26998 objc_being_catch_clauses() knows that that means
26999 '...'. */
27002 }
27003 else
27004 {
27005 /* We have "@catch (NSException *exception)" or something
27006 like that. Parse the parameter declaration. */
27010 else
27015 }
27018 else
27019 {
27020 /* If there was no open parenthesis, we are recovering from
27021 an error, and we are trying to figure out what mistake
27022 the user has made. */
27024 /* If there is an immediate closing parenthesis, the user
27025 probably forgot the opening one (ie, they typed "@catch
27026 NSException *e)". Parse the closing parenthesis and keep
27027 going. */
27031 /* If these is no immediate closing parenthesis, the user
27032 probably doesn't know that parenthesis are required at
27033 all (ie, they typed "@catch NSException *e"). So, just
27034 forget about the closing parenthesis and keep going. */
27035 }
27039 }
27041 {
27044 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27045 node, lest it get absorbed into the surrounding block. */
27049 }
27052 }
27054 /* Parse an Objective-C synchronized statement.
27056 objc-synchronized-stmt:
27057 @synchronized ( expression ) compound-statement
27059 Returns NULL_TREE. */
27061 static tree
27063 {
27064 location_t location;
27075 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27076 node, lest it get absorbed into the surrounding block. */
27081 }
27083 /* Parse an Objective-C throw statement.
27085 objc-throw-stmt:
27086 @throw assignment-expression [opt] ;
27088 Returns a constructed '@throw' statement. */
27090 static tree
27092 {
27104 }
27106 /* Parse an Objective-C statement. */
27108 static tree
27110 {
27111 /* Try to figure out what kind of declaration is present. */
27115 {
27126 }
27129 }
27131 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27132 look ahead to see if an objc keyword follows the attributes. This
27133 is to detect the use of prefix attributes on ObjC @interface and
27134 @protocol. */
27136 static bool
27138 {
27143 {
27146 }
27149 }
27151 /* This routine is a minimal replacement for
27152 c_parser_struct_declaration () used when parsing the list of
27153 types/names or ObjC++ properties. For example, when parsing the
27154 code
27156 @property (readonly) int a, b, c;
27158 this function is responsible for parsing "int a, int b, int c" and
27159 returning the declarations as CHAIN of DECLs.
27161 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27162 similar parsing. */
27163 static tree
27165 {
27167 cp_decl_specifier_seq declspecs;
27169 tree prefix_attributes;
27172 CP_PARSER_FLAGS_NONE,
27179 /* auto, register, static, extern, mutable. */
27181 {
27184 }
27186 /* thread_local. */
27188 {
27191 }
27193 /* typedef. */
27195 {
27198 }
27203 /* Keep going until we hit the `;' at the end of the declaration. */
27205 {
27210 /* Parse the declarator. */
27214 /* Look for attributes that apply to the ivar. */
27216 /* Remember which attributes are prefix attributes and
27217 which are not. */
27219 /* Combine the attributes. */
27229 /* Reset PREFIX_ATTRIBUTES. */
27240 {
27243 }
27244 else
27246 }
27248 }
27250 /* Parse an Objective-C @property declaration. The syntax is:
27252 objc-property-declaration:
27253 '@property' objc-property-attributes[opt] struct-declaration ;
27255 objc-property-attributes:
27256 '(' objc-property-attribute-list ')'
27258 objc-property-attribute-list:
27259 objc-property-attribute
27260 objc-property-attribute-list, objc-property-attribute
27262 objc-property-attribute
27263 'getter' = identifier
27264 'setter' = identifier
27265 'readonly'
27266 'readwrite'
27267 'assign'
27268 'retain'
27269 'copy'
27270 'nonatomic'
27272 For example:
27273 @property NSString *name;
27274 @property (readonly) id object;
27275 @property (retain, nonatomic, getter=getTheName) id name;
27276 @property int a, b, c;
27278 PS: This function is identical to
27279 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27280 static void
27282 {
27283 /* The following variables hold the attributes of the properties as
27284 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27285 seen. When we see an attribute, we set them to 'true' (if they
27286 are boolean properties) or to the identifier (if they have an
27287 argument, ie, for getter and setter). Note that here we only
27288 parse the list of attributes, check the syntax and accumulate the
27289 attributes that we find. objc_add_property_declaration() will
27290 then process the information. */
27300 /* 'properties' is the list of properties that we read. Usually a
27301 single one, but maybe more (eg, in "@property int a, b, c;" there
27302 are three). */
27303 tree properties;
27304 location_t loc;
27310 /* Parse the optional attribute list... */
27312 {
27313 /* Eat the '('. */
27317 {
27323 {
27326 }
27330 {
27341 {
27345 else
27350 }
27353 {
27357 }
27359 {
27361 {
27364 }
27365 else
27369 else
27371 }
27372 else
27373 {
27375 {
27378 }
27379 else
27381 }
27387 }
27394 else
27396 }
27398 /* FIXME: "@property (setter, assign);" will generate a spurious
27399 "error: expected ‘)’ before ‘,’ token". This is because
27400 cp_parser_require, unlike the C counterpart, will produce an
27401 error even if we are in error recovery. */
27403 {
27408 }
27409 }
27411 /* ... and the property declaration(s). */
27415 {
27417 /* If the next token is now a `;', consume it. */
27421 }
27425 else
27426 {
27427 /* Comma-separated properties are chained together in
27428 reverse order; add them one by one. */
27437 }
27440 }
27442 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27444 objc-synthesize-declaration:
27445 @synthesize objc-synthesize-identifier-list ;
27447 objc-synthesize-identifier-list:
27448 objc-synthesize-identifier
27449 objc-synthesize-identifier-list, objc-synthesize-identifier
27451 objc-synthesize-identifier
27452 identifier
27453 identifier = identifier
27455 For example:
27456 @synthesize MyProperty;
27457 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27459 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27460 for C. Keep them in sync.
27461 */
27462 static void
27464 {
27466 location_t loc;
27471 {
27475 {
27478 }
27480 {
27484 {
27487 }
27488 }
27489 else
27494 else
27496 }
27499 }
27501 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27503 objc-dynamic-declaration:
27504 @dynamic identifier-list ;
27506 For example:
27507 @dynamic MyProperty;
27508 @dynamic MyProperty, AnotherProperty;
27510 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27511 for C. Keep them in sync.
27512 */
27513 static void
27515 {
27517 location_t loc;
27522 {
27523 tree property;
27526 {
27529 }
27533 else
27535 }
27538 }
27540 \f
27541 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27543 /* Returns name of the next clause.
27544 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27545 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27546 returned and the token is consumed. */
27548 static pragma_omp_clause
27550 {
27564 {
27569 {
27712 }
27713 }
27719 }
27721 /* Validate that a clause of the given type does not already exist. */
27723 static void
27726 {
27727 tree c;
27731 {
27734 }
27735 }
27737 /* OpenMP 2.5:
27738 variable-list:
27739 identifier
27740 variable-list , identifier
27742 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27743 colon). An opening parenthesis will have been consumed by the caller.
27745 If KIND is nonzero, create the appropriate node and install the decl
27746 in OMP_CLAUSE_DECL and add the node to the head of the list.
27748 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27749 return the list created.
27751 COLON can be NULL if only closing parenthesis should end the list,
27752 or pointer to bool which will receive false if the list is terminated
27753 by closing parenthesis or true if the list is terminated by colon. */
27755 static tree
27758 {
27762 {
27765 }
27767 {
27784 {
27786 {
27789 {
27793 }
27794 /* FALL THROUGH. */
27800 {
27808 parser->colon_corrects_to_scope_p
27812 else
27813 {
27814 /* Look for `:'. */
27818 CPP_CLOSE_SQUARE))
27820 }
27821 /* Look for the closing `]'. */
27823 RT_CLOSE_SQUARE))
27827 {
27830 {
27834 }
27838 {
27842 }
27843 }
27846 }
27850 }
27856 }
27857 else
27860 get_comma:
27864 }
27870 {
27874 }
27877 {
27880 /* Try to resync to an unnested comma. Copied from
27881 cp_parser_parenthesized_expression_list. */
27882 skip_comma:
27891 }
27894 }
27896 /* Similarly, but expect leading and trailing parenthesis. This is a very
27897 common case for omp clauses. */
27899 static tree
27901 {
27905 }
27907 /* OpenACC 2.0:
27908 copy ( variable-list )
27909 copyin ( variable-list )
27910 copyout ( variable-list )
27911 create ( variable-list )
27912 delete ( variable-list )
27913 present ( variable-list )
27914 present_or_copy ( variable-list )
27915 pcopy ( variable-list )
27916 present_or_copyin ( variable-list )
27917 pcopyin ( variable-list )
27918 present_or_copyout ( variable-list )
27919 pcopyout ( variable-list )
27920 present_or_create ( variable-list )
27921 pcreate ( variable-list ) */
27923 static tree
27925 tree list)
27926 {
27929 {
27969 }
27977 }
27979 /* OpenACC 2.0:
27980 deviceptr ( variable-list ) */
27982 static tree
27984 {
27988 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27989 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
27990 variable-list must only allow for pointer variables. */
27993 {
27996 /* FIXME diagnostics: Ideally we should keep individual
27997 locations for all the variables in the var list to make the
27998 following errors more precise. Perhaps
27999 c_parser_omp_var_list_parens should construct a list of
28000 locations to go along with the var list. */
28005 ;
28014 }
28017 }
28019 /* OpenACC:
28020 vector_length ( expression ) */
28022 static tree
28024 {
28034 {
28037 }
28040 {
28045 }
28048 location);
28056 }
28058 /* OpenACC 2.0
28059 Parse wait clause or directive parameters. */
28061 static tree
28063 {
28073 {
28078 }
28085 {
28089 {
28092 else
28093 {
28100 }
28101 }
28102 }
28105 }
28107 /* OpenACC:
28108 wait ( int-expr-list ) */
28110 static tree
28112 {
28121 }
28123 /* OpenMP 3.0:
28124 collapse ( constant-expression ) */
28126 static tree
28128 {
28130 location_t loc;
28131 HOST_WIDE_INT n;
28151 {
28154 }
28162 }
28164 /* OpenMP 2.5:
28165 default ( shared | none ) */
28167 static tree
28169 {
28171 tree c;
28176 {
28181 {
28196 }
28199 }
28200 else
28201 {
28202 invalid_kind:
28204 }
28220 }
28222 /* OpenMP 3.1:
28223 final ( expression ) */
28225 static tree
28227 {
28248 }
28250 /* OpenMP 2.5:
28251 if ( expression ) */
28253 static tree
28255 {
28276 }
28278 /* OpenMP 3.1:
28279 mergeable */
28281 static tree
28284 {
28285 tree c;
28288 location);
28293 }
28295 /* OpenMP 2.5:
28296 nowait */
28298 static tree
28301 {
28302 tree c;
28309 }
28311 /* OpenACC:
28312 num_gangs ( expression ) */
28314 static tree
28316 {
28332 {
28335 }
28345 }
28347 /* OpenMP 2.5:
28348 num_threads ( expression ) */
28350 static tree
28352 location_t location)
28353 {
28375 }
28377 /* OpenACC:
28378 num_workers ( expression ) */
28380 static tree
28382 {
28398 {
28401 }
28404 location);
28412 }
28414 /* OpenMP 2.5:
28415 ordered */
28417 static tree
28420 {
28421 tree c;
28429 }
28431 /* OpenMP 2.5:
28432 reduction ( reduction-operator : variable-list )
28434 reduction-operator:
28435 One of: + * - & ^ | && ||
28437 OpenMP 3.1:
28439 reduction-operator:
28440 One of: + * - & ^ | && || min max
28442 OpenMP 4.0:
28444 reduction-operator:
28445 One of: + * - & ^ | && ||
28446 id-expression */
28448 static tree
28450 {
28458 {
28468 }
28472 else
28473 {
28484 {
28514 }
28515 else
28516 {
28518 resync_fail:
28523 }
28524 }
28530 NULL);
28532 {
28535 }
28538 }
28540 /* OpenMP 2.5:
28541 schedule ( schedule-kind )
28542 schedule ( schedule-kind , expression )
28544 schedule-kind:
28545 static | dynamic | guided | runtime | auto */
28547 static tree
28549 {
28558 {
28563 {
28584 }
28585 }
28590 else
28595 {
28610 else
28615 }
28623 invalid_kind:
28625 resync_fail:
28630 }
28632 /* OpenMP 3.0:
28633 untied */
28635 static tree
28638 {
28639 tree c;
28646 }
28648 /* OpenMP 4.0:
28649 inbranch
28650 notinbranch */
28652 static tree
28655 {
28660 }
28662 /* OpenMP 4.0:
28663 parallel
28664 for
28665 sections
28666 taskgroup */
28668 static tree
28672 {
28676 }
28678 /* OpenMP 4.0:
28679 num_teams ( expression ) */
28681 static tree
28683 location_t location)
28684 {
28706 }
28708 /* OpenMP 4.0:
28709 thread_limit ( expression ) */
28711 static tree
28713 location_t location)
28714 {
28736 }
28738 /* OpenMP 4.0:
28739 aligned ( variable-list )
28740 aligned ( variable-list : constant-expression ) */
28742 static tree
28744 {
28755 {
28765 }
28771 }
28773 /* OpenMP 4.0:
28774 linear ( variable-list )
28775 linear ( variable-list : expression ) */
28777 static tree
28780 {
28791 {
28795 {
28798 }
28806 }
28812 }
28814 /* OpenMP 4.0:
28815 safelen ( constant-expression ) */
28817 static tree
28819 location_t location)
28820 {
28841 }
28843 /* OpenMP 4.0:
28844 simdlen ( constant-expression ) */
28846 static tree
28848 location_t location)
28849 {
28870 }
28872 /* OpenMP 4.0:
28873 depend ( depend-kind : variable-list )
28875 depend-kind:
28876 in | out | inout */
28878 static tree
28880 {
28888 {
28898 else
28900 }
28901 else
28909 NULL);
28916 invalid_kind:
28918 resync_fail:
28923 }
28925 /* OpenMP 4.0:
28926 map ( map-kind : variable-list )
28927 map ( variable-list )
28929 map-kind:
28930 alloc | to | from | tofrom */
28932 static tree
28934 {
28943 {
28955 else
28956 {
28962 }
28965 }
28968 NULL);
28974 }
28976 /* OpenMP 4.0:
28977 device ( expression ) */
28979 static tree
28981 location_t location)
28982 {
29004 }
29006 /* OpenMP 4.0:
29007 dist_schedule ( static )
29008 dist_schedule ( static , expression ) */
29010 static tree
29012 location_t location)
29013 {
29026 {
29037 }
29042 location);
29046 invalid_kind:
29048 resync_fail:
29053 }
29055 /* OpenMP 4.0:
29056 proc_bind ( proc-bind-kind )
29058 proc-bind-kind:
29059 master | close | spread */
29061 static tree
29063 location_t location)
29064 {
29065 tree c;
29072 {
29082 else
29084 }
29085 else
29094 location);
29099 invalid_kind:
29101 resync_fail:
29106 }
29108 /* OpenACC:
29109 async [( int-expr )] */
29111 static tree
29113 {
29120 {
29129 }
29139 }
29141 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29142 is a bitmask in MASK. Return the list of clauses found. */
29144 static tree
29148 {
29153 {
29154 location_t here;
29155 pragma_omp_clause c_kind;
29166 {
29258 }
29263 {
29264 /* Remove the invalid clause(s) from the list to avoid
29265 confusing the rest of the compiler. */
29268 }
29269 }
29271 saw_error:
29278 }
29280 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29281 is a bitmask in MASK. Return the list of clauses found; the result
29282 of clause default goes in *pdefault. */
29284 static tree
29288 {
29295 {
29296 pragma_omp_clause c_kind;
29307 {
29319 clauses);
29333 clauses);
29342 clauses);
29366 clauses);
29380 clauses);
29397 OMP_CLAUSE_NOTINBRANCH,
29406 {
29407 clause_not_first:
29411 }
29436 clauses);
29441 clauses);
29446 clauses);
29509 }
29514 {
29515 /* Remove the invalid clause(s) from the list to avoid
29516 confusing the rest of the compiler. */
29519 }
29520 }
29521 saw_error:
29522 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29523 no reason to skip to the end. */
29529 }
29531 /* OpenMP 2.5:
29532 structured-block:
29533 statement
29535 In practice, we're also interested in adding the statement to an
29536 outer node. So it is convenient if we work around the fact that
29537 cp_parser_statement calls add_stmt. */
29539 static unsigned
29541 {
29544 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29545 This preserves the "not within loop or switch" style error messages
29546 for nonsense cases like
29547 void foo() {
29548 #pragma omp single
29549 break;
29550 }
29551 */
29556 }
29558 static void
29560 {
29562 }
29564 static tree
29566 {
29574 }
29576 /* OpenMP 2.5:
29577 # pragma omp atomic new-line
29578 expression-stmt
29580 expression-stmt:
29581 x binop= expr | x++ | ++x | x-- | --x
29582 binop:
29583 +, *, -, /, &, ^, |, <<, >>
29585 where x is an lvalue expression with scalar type.
29587 OpenMP 3.1:
29588 # pragma omp atomic new-line
29589 update-stmt
29591 # pragma omp atomic read new-line
29592 read-stmt
29594 # pragma omp atomic write new-line
29595 write-stmt
29597 # pragma omp atomic update new-line
29598 update-stmt
29600 # pragma omp atomic capture new-line
29601 capture-stmt
29603 # pragma omp atomic capture new-line
29604 capture-block
29606 read-stmt:
29607 v = x
29608 write-stmt:
29609 x = expr
29610 update-stmt:
29611 expression-stmt | x = x binop expr
29612 capture-stmt:
29613 v = expression-stmt
29614 capture-block:
29615 { v = x; update-stmt; } | { update-stmt; v = x; }
29617 OpenMP 4.0:
29618 update-stmt:
29619 expression-stmt | x = x binop expr | x = expr binop x
29620 capture-stmt:
29621 v = update-stmt
29622 capture-block:
29623 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29625 where x and v are lvalue expressions with scalar type. */
29627 static void
29629 {
29637 {
29642 {
29648 }
29649 }
29651 {
29663 else
29667 }
29669 {
29675 {
29680 {
29683 }
29684 }
29685 }
29689 {
29699 else
29704 {
29705 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29706 opcode. */
29711 }
29715 {
29718 }
29719 else
29720 {
29726 }
29729 }
29731 restart:
29735 {
29742 /* FALLTHROUGH */
29752 /* FALLTHROUGH */
29767 /* Undo effects of boolean_increment for post {in,de}crement. */
29769 /* FALLTHRU */
29773 {
29774 /* Undo effects of boolean_increment. */
29776 {
29777 /* This is pre or post increment. */
29782 && !structured_block
29786 }
29787 }
29788 /* FALLTHRU */
29791 {
29826 {
29830 }
29833 {
29839 {
29844 }
29846 {
29858 {
29860 {
29865 }
29866 else
29868 }
29872 }
29875 {
29882 }
29886 }
29890 {
29893 {
29901 }
29903 {
29908 }
29943 }
29954 /* FALLTHROUGH */
29959 }
29966 }
29967 stmt_done:
29969 {
29980 }
29982 {
29985 }
29986 done:
29992 saw_error:
29995 {
29999 {
30003 }
30004 }
30005 }
30008 /* OpenMP 2.5:
30009 # pragma omp barrier new-line */
30011 static void
30013 {
30016 }
30018 /* OpenMP 2.5:
30019 # pragma omp critical [(name)] new-line
30020 structured-block */
30022 static tree
30024 {
30028 {
30040 }
30045 }
30047 /* OpenMP 2.5:
30048 # pragma omp flush flush-vars[opt] new-line
30050 flush-vars:
30051 ( variable-list ) */
30053 static void
30055 {
30061 }
30063 /* Helper function, to parse omp for increment expression. */
30065 static tree
30067 {
30072 {
30075 }
30078 {
30087 /* Fall through: OpenMP disallows NE_EXPR. */
30090 }
30092 /* If decl is an iterator, preserve LHS and RHS of the relational
30093 expr until finish_omp_for. */
30103 }
30105 /* Helper function, to parse omp for increment expression. */
30107 static tree
30109 {
30113 cp_id_kind idk;
30117 {
30125 }
30133 {
30138 }
30145 {
30149 }
30161 do
30162 {
30169 {
30171 {
30174 else
30176 tf_warning_or_error);
30177 }
30178 else
30181 }
30182 }
30186 {
30190 }
30191 else
30195 }
30197 /* Parse the initialization statement of either an OpenMP for loop or
30198 a Cilk Plus for loop.
30200 Return true if the resulting construct should have an
30201 OMP_CLAUSE_PRIVATE added to it. */
30203 static bool
30211 {
30217 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30219 init-expr:
30220 var = lb
30221 integer-type var = lb
30222 random-access-iterator-type var = lb
30223 pointer-type var = lb
30224 */
30225 cp_decl_specifier_seq type_specifiers;
30227 /* First, try to parse as an initialized declaration. See
30228 cp_parser_condition, from whence the bulk of this is copied. */
30235 {
30236 /* If parsing a type specifier seq succeeded, then this
30237 MUST be a initialized declaration. */
30242 CP_PARSER_DECLARATOR_NAMED,
30253 else
30254 {
30264 {
30266 CPP_OPEN_PAREN))
30267 {
30271 else
30274 }
30275 else
30276 /* Trigger an error. */
30281 }
30285 {
30293 {
30296 auto_node);
30301 }
30304 asm_specification,
30305 LOOKUP_ONLYCONVERTING);
30307 {
30310 }
30311 else
30314 }
30315 else
30316 {
30317 /* Consume '='. */
30321 non_class:
30324 else
30327 asm_specification,
30328 LOOKUP_ONLYCONVERTING);
30329 }
30333 }
30334 }
30335 else
30336 {
30337 cp_id_kind idk;
30338 /* If parsing a type specifier sequence failed, then
30339 this MUST be a simple expression. */
30347 && decl
30350 {
30351 tree rhs;
30358 rhs,
30359 tf_warning_or_error));
30361 }
30362 else
30363 {
30368 {
30372 }
30373 }
30374 }
30376 }
30378 /* Parse the restricted form of the for statement allowed by OpenMP. */
30380 static tree
30383 {
30387 location_t loc_first;
30406 {
30409 location_t loc;
30413 {
30416 }
30419 {
30422 }
30431 add_private_clause
30438 {
30441 {
30447 }
30448 else
30450 }
30457 {
30462 {
30466 }
30469 {
30470 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30471 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30476 {
30479 }
30480 else
30481 {
30484 }
30488 }
30489 else
30490 {
30495 }
30496 }
30499 {
30500 tree c;
30502 {
30511 decl);
30515 decl);
30516 }
30518 {
30523 {
30526 }
30527 }
30528 }
30537 {
30538 /* If decl is an iterator, preserve the operator on decl
30539 until finish_omp_for. */
30541 && ((processing_template_decl
30545 else
30549 }
30564 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30565 in between the collapsed for loops to be still considered perfectly
30566 nested. Hopefully the final version clarifies this.
30567 For now handle (multiple) {'s and empty statements. */
30569 do
30570 {
30574 {
30576 bracecount++;
30577 }
30581 else
30582 {
30589 }
30590 }
30594 {
30597 }
30598 }
30600 /* Note that we saved the original contents of this flag when we entered
30601 the structured block, and so we don't need to re-save it here. */
30604 else
30607 /* Note that the grammar doesn't call for a structured block here,
30608 though the loop as a whole is a structured block. */
30615 else
30620 {
30622 {
30624 nbraces--;
30625 }
30628 else
30629 {
30631 {
30634 }
30639 }
30640 }
30647 }
30649 /* Helper function for OpenMP parsing, split clauses and call
30650 finish_omp_clauses on each of the set of clauses afterwards. */
30652 static void
30655 {
30661 }
30663 /* OpenMP 4.0:
30664 #pragma omp simd simd-clause[optseq] new-line
30665 for-loop */
30667 #define OMP_SIMD_CLAUSE_MASK \
30668 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30676 static tree
30679 {
30691 {
30694 }
30705 }
30707 /* OpenMP 2.5:
30708 #pragma omp for for-clause[optseq] new-line
30709 for-loop
30711 OpenMP 4.0:
30712 #pragma omp for simd for-simd-clause[optseq] new-line
30713 for-loop */
30715 #define OMP_FOR_CLAUSE_MASK \
30716 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30725 static tree
30728 {
30739 {
30744 {
30752 cclauses);
30756 cclauses);
30768 }
30769 }
30771 {
30774 }
30779 {
30782 }
30793 }
30795 /* OpenMP 2.5:
30796 # pragma omp master new-line
30797 structured-block */
30799 static tree
30801 {
30805 }
30807 /* OpenMP 2.5:
30808 # pragma omp ordered new-line
30809 structured-block */
30811 static tree
30813 {
30817 }
30819 /* OpenMP 2.5:
30821 section-scope:
30822 { section-sequence }
30824 section-sequence:
30825 section-directive[opt] structured-block
30826 section-sequence section-directive structured-block */
30828 static tree
30830 {
30841 {
30845 }
30848 {
30856 {
30860 }
30862 {
30865 }
30870 }
30881 }
30883 /* OpenMP 2.5:
30884 # pragma omp sections sections-clause[optseq] newline
30885 sections-scope */
30887 #define OMP_SECTIONS_CLAUSE_MASK \
30888 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30894 static tree
30897 {
30909 {
30912 }
30919 }
30921 /* OpenMP 2.5:
30922 # pragma omp parallel parallel-clause[optseq] new-line
30923 structured-block
30924 # pragma omp parallel for parallel-for-clause[optseq] new-line
30925 structured-block
30926 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30927 structured-block
30929 OpenMP 4.0:
30930 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30931 structured-block */
30933 #define OMP_PARALLEL_CLAUSE_MASK \
30934 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30944 static tree
30947 {
30956 {
30969 block);
30974 }
30976 {
30980 }
30982 {
30985 }
30987 {
30991 {
31001 block);
31004 }
31005 }
31015 }
31017 /* OpenMP 2.5:
31018 # pragma omp single single-clause[optseq] new-line
31019 structured-block */
31021 #define OMP_SINGLE_CLAUSE_MASK \
31022 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31027 static tree
31029 {
31039 }
31041 /* OpenMP 3.0:
31042 # pragma omp task task-clause[optseq] new-line
31043 structured-block */
31045 #define OMP_TASK_CLAUSE_MASK \
31046 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31056 static tree
31058 {
31069 }
31071 /* OpenMP 3.0:
31072 # pragma omp taskwait new-line */
31074 static void
31076 {
31079 }
31081 /* OpenMP 3.1:
31082 # pragma omp taskyield new-line */
31084 static void
31086 {
31089 }
31091 /* OpenMP 4.0:
31092 # pragma omp taskgroup new-line
31093 structured-block */
31095 static tree
31097 {
31101 }
31104 /* OpenMP 2.5:
31105 # pragma omp threadprivate (variable-list) */
31107 static void
31109 {
31110 tree vars;
31116 }
31118 /* OpenMP 4.0:
31119 # pragma omp cancel cancel-clause[optseq] new-line */
31121 #define OMP_CANCEL_CLAUSE_MASK \
31122 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31128 static void
31130 {
31134 }
31136 /* OpenMP 4.0:
31137 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31139 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31140 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31145 static void
31147 {
31148 tree clauses;
31152 {
31157 {
31160 }
31161 }
31163 {
31167 }
31170 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31172 pragma_tok);
31174 }
31176 /* OpenMP 4.0:
31177 #pragma omp distribute distribute-clause[optseq] new-line
31178 for-loop */
31180 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31181 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31186 static tree
31189 {
31198 {
31206 else
31209 {
31215 {
31218 cclauses);
31219 else
31221 cclauses);
31222 }
31227 cclauses);
31228 else
31230 cclauses);
31242 }
31243 }
31245 {
31248 }
31253 {
31256 }
31267 }
31269 /* OpenMP 4.0:
31270 # pragma omp teams teams-clause[optseq] new-line
31271 structured-block */
31273 #define OMP_TEAMS_CLAUSE_MASK \
31274 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31282 static tree
31285 {
31294 {
31298 {
31306 cclauses);
31310 cclauses);
31321 }
31322 }
31324 {
31327 }
31332 {
31335 }
31343 }
31345 /* OpenMP 4.0:
31346 # pragma omp target data target-data-clause[optseq] new-line
31347 structured-block */
31349 #define OMP_TARGET_DATA_CLAUSE_MASK \
31350 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31354 static tree
31356 {
31368 }
31370 /* OpenMP 4.0:
31371 # pragma omp target update target-update-clause[optseq] new-line */
31373 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31374 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31379 static bool
31382 {
31384 {
31386 "%<#pragma omp target update%> may only be "
31390 }
31392 tree clauses
31397 {
31399 "%<#pragma omp target update must contain at least one "
31402 }
31410 }
31412 /* OpenMP 4.0:
31413 # pragma omp target target-clause[optseq] new-line
31414 structured-block */
31416 #define OMP_TARGET_CLAUSE_MASK \
31417 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31421 static bool
31424 {
31426 {
31430 }
31433 {
31438 {
31446 {
31448 OMP_TARGET_CLAUSE_MASK,
31449 cclauses);
31451 }
31467 }
31469 {
31472 }
31474 {
31478 }
31480 {
31483 }
31484 }
31498 }
31500 /* OpenACC 2.0:
31501 # pragma acc cache (variable-list) new-line
31502 */
31504 static tree
31506 {
31521 }
31523 /* OpenACC 2.0:
31524 # pragma acc data oacc-data-clause[optseq] new-line
31525 structured-block */
31527 #define OACC_DATA_CLAUSE_MASK \
31528 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31540 static tree
31542 {
31555 }
31557 /* OpenACC 2.0:
31558 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31560 or
31562 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31564 LOC is the location of the #pragma token.
31565 */
31567 #define OACC_ENTER_DATA_CLAUSE_MASK \
31568 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31576 #define OACC_EXIT_DATA_CLAUSE_MASK \
31577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31583 static tree
31586 {
31591 {
31597 }
31602 {
31606 }
31613 else
31618 {
31622 }
31628 else
31633 }
31635 /* OpenACC 2.0:
31636 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31637 structured-block */
31639 #define OACC_KERNELS_CLAUSE_MASK \
31640 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31654 static tree
31656 {
31669 }
31671 /* OpenACC 2.0:
31672 # pragma acc loop oacc-loop-clause[optseq] new-line
31673 structured-block */
31675 #define OACC_LOOP_CLAUSE_MASK \
31676 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31679 static tree
31681 {
31694 }
31696 /* OpenACC 2.0:
31697 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31698 structured-block */
31700 #define OACC_PARALLEL_CLAUSE_MASK \
31701 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31719 static tree
31721 {
31734 }
31736 /* OpenACC 2.0:
31737 # pragma acc update oacc-update-clause[optseq] new-line
31738 */
31740 #define OACC_UPDATE_CLAUSE_MASK \
31741 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31748 static tree
31750 {
31757 {
31759 "%<#pragma acc update%> must contain at least one "
31762 }
31770 }
31772 /* OpenACC 2.0:
31773 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31775 LOC is the location of the #pragma token.
31776 */
31778 #define OACC_WAIT_CLAUSE_MASK \
31779 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31781 static tree
31783 {
31796 }
31798 /* OpenMP 4.0:
31799 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31801 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31809 static void
31812 {
31814 cp_omp_declare_simd_data data;
31816 {
31821 }
31832 {
31836 {
31849 }
31854 "%<#pragma omp declare simd%> not immediately followed by "
31858 }
31859 }
31861 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31862 This function is modelled similar to the late parsing of omp declare
31863 simd. */
31865 static tree
31867 {
31873 {
31879 }
31881 {
31885 }
31890 {
31897 NULL);
31911 }
31916 }
31918 /* Finalize #pragma omp declare simd clauses after direct declarator has
31919 been parsed, and put that into "omp declare simd" attribute. */
31921 static tree
31923 {
31929 {
31934 }
31939 {
31957 }
31961 }
31964 /* OpenMP 4.0:
31965 # pragma omp declare target new-line
31966 declarations and definitions
31967 # pragma omp end declare target new-line */
31969 static void
31971 {
31974 }
31976 static void
31978 {
31981 {
31984 }
31986 {
31990 {
31993 }
31996 else
31997 {
32001 }
32002 }
32003 else
32004 {
32008 }
32012 "%<#pragma omp end declare target%> without corresponding "
32014 else
32016 }
32018 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32019 expression and optional initializer clause of
32020 #pragma omp declare reduction. We store the expression(s) as
32021 either 3, 6 or 7 special statements inside of the artificial function's
32022 body. The first two statements are DECL_EXPRs for the artificial
32023 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32024 expression that uses those variables.
32025 If there was any INITIALIZER clause, this is followed by further statements,
32026 the fourth and fifth statements are DECL_EXPRs for the artificial
32027 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32028 constructor variant (first token after open paren is not omp_priv),
32029 then the sixth statement is a statement with the function call expression
32030 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32031 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32032 to initialize the OMP_PRIV artificial variable and there is seventh
32033 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32035 static bool
32037 {
32049 tree combiner;
32064 {
32067 }
32070 {
32077 {
32080 }
32096 {
32100 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32104 == CPP_CLOSE_PAREN
32107 {
32111 }
32116 }
32117 else
32118 {
32134 {
32139 }
32141 tree arg;
32154 }
32165 }
32171 }
32173 /* OpenMP 4.0
32174 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32175 initializer-clause[opt] new-line
32177 initializer-clause:
32178 initializer (omp_priv initializer)
32179 initializer (function-name (argument-list)) */
32181 static void
32184 {
32194 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32201 {
32233 }
32245 /* Types may not be defined in declare reduction type list. */
32248 parser->type_definition_forbidden_message
32254 saved_colon_doesnt_start_class_def_p
32259 {
32263 ;
32284 else
32289 else
32291 }
32293 /* Restore the saved message. */
32296 parser->colon_doesnt_start_class_def_p
32301 {
32302 fail:
32305 }
32311 {
32312 tree fntype
32315 NULL_TREE);
32334 {
32339 }
32341 {
32343 {
32352 }
32359 }
32360 else
32361 {
32364 }
32367 else
32370 {
32373 }
32375 {
32378 else
32383 }
32388 else
32389 {
32398 }
32405 }
32409 done:
32410 /* Free any declarators allocated. */
32412 }
32414 /* OpenMP 4.0
32415 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32416 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32417 initializer-clause[opt] new-line
32418 #pragma omp declare target new-line */
32420 static void
32423 {
32425 {
32430 {
32433 context);
32435 }
32438 {
32441 context);
32443 }
32445 {
32448 }
32450 {
32454 }
32455 }
32459 }
32461 /* Main entry point to OpenMP statement pragmas. */
32463 static void
32465 {
32466 tree stmt;
32471 {
32546 }
32550 }
32551 \f
32552 /* Transactional Memory parsing routines. */
32554 /* Parse a transaction attribute.
32556 txn-attribute:
32557 attribute
32558 [ [ identifier ] ]
32560 ??? Simplify this when C++0x bracket attributes are
32561 implemented properly. */
32563 static tree
32565 {
32580 {
32584 /* For keywords, use the canonical spelling,
32585 not the parsed identifier. */
32589 }
32590 else
32594 error1:
32597 }
32599 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32601 transaction-statement:
32602 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32603 compound-statement
32604 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32605 */
32607 static tree
32609 {
32624 else
32625 {
32629 }
32631 /* Parse a noexcept specification. */
32634 /* Keep track if we're in the lexical scope of an outer transaction. */
32646 }
32648 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32650 transaction-expression:
32651 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32652 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32653 */
32655 static tree
32657 {
32682 /* Set this early. This might mean that we allow transaction_cancel in
32683 an expression that we find out later actually has to be a constexpr.
32684 However, we expect that cxx_constant_value will be able to deal with
32685 this; also, if the noexcept has no constexpr, then what we parse next
32686 really is a transaction's body. */
32689 /* Parse a noexcept specification. */
32695 {
32702 }
32703 else
32704 {
32705 /* The only expression that is available got parsed for the noexcept
32706 already. noexcept is true then. */
32709 }
32718 }
32720 /* Parse a function-transaction-block.
32722 function-transaction-block:
32723 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32724 function-body
32725 __transaction_atomic txn-attribute[opt] function-try-block
32726 __transaction_relaxed ctor-initializer[opt] function-body
32727 __transaction_relaxed function-try-block
32728 */
32730 static bool
32732 {
32748 else
32749 {
32753 }
32761 else
32762 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32770 }
32772 /* Parse a __transaction_cancel statement.
32774 cancel-statement:
32775 __transaction_cancel txn-attribute[opt] ;
32776 __transaction_cancel txn-attribute[opt] throw-expression ;
32778 ??? Cancel and throw is not yet implemented. */
32780 static tree
32782 {
32788 RT_TRANSACTION_CANCEL);
32795 /* ??? Parse cancel-and-throw here. */
32800 {
32804 }
32806 {
32810 }
32812 {
32815 {
32821 }
32822 }
32824 {
32828 }
32834 }
32835 \f
32836 /* The parser. */
32840 \f
32841 /* Special handling for the first token or line in the file. The first
32842 thing in the file might be #pragma GCC pch_preprocess, which loads a
32843 PCH file, which is a GC collection point. So we need to handle this
32844 first pragma without benefit of an existing lexer structure.
32846 Always returns one token to the caller in *FIRST_TOKEN. This is
32847 either the true first token of the file, or the first token after
32848 the initial pragma. */
32850 static void
32852 {
32861 {
32868 }
32869 else
32872 /* Skip to the end of the pragma. */
32876 /* Now actually load the PCH file. */
32880 /* Read one more token to return to our caller. We have to do this
32881 after reading the PCH file in, since its pointers have to be
32882 live. */
32884 }
32886 /* Parses the grainsize pragma for the _Cilk_for statement.
32887 Syntax:
32888 #pragma cilk grainsize = <VALUE>. */
32890 static void
32892 {
32894 {
32899 {
32902 }
32904 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32907 else
32909 "%<#pragma cilk grainsize%> is not followed by "
32912 }
32914 }
32916 /* Normal parsing of a pragma token. Here we can (and must) use the
32917 regular lexer. */
32919 static bool
32921 {
32933 {
32941 {
32951 }
32956 {
32966 }
32971 {
32977 "%<#pragma omp taskwait%> may only be "
32982 }
32987 {
32993 "%<#pragma omp taskyield%> may only be "
32998 }
33003 {
33009 "%<#pragma omp cancel%> may only be "
33014 }
33019 {
33025 "%<#pragma omp cancellation point%> may only be "
33030 }
33077 "%<#pragma omp section%> may only be used in "
33082 {
33084 {
33088 }
33095 {
33098 }
33101 }
33105 {
33109 }
33115 {
33119 }
33121 /* Ignore the pragma if Cilk Plus is not enabled. */
33123 {
33126 }
33127 else
33128 {
33132 }
33139 bad_stmt:
33142 }
33146 }
33148 /* The interface the pragma parsers have to the lexer. */
33150 enum cpp_ttype
33152 {
33165 else
33166 {
33170 }
33173 }
33175 \f
33176 /* External interface. */
33178 /* Parse one entire translation unit. */
33180 void
33182 {
33195 }
33197 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33198 vectorlength clause:
33199 Syntax:
33200 vectorlength ( constant-expression ) */
33202 static tree
33205 {
33207 tree expr;
33208 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33209 safelen clause. Thus, vectorlength is represented as OMP 4.0
33210 safelen. For SIMD-enabled function it is represented by OMP 4.0
33211 simdlen. */
33214 loc);
33215 else
33217 loc);
33225 /* If expr == error_mark_node, then don't emit any errors nor
33226 create a clause. if any of the above functions returns
33227 error mark node then they would have emitted an error message. */
33229 ;
33237 else
33238 {
33239 tree c;
33241 {
33246 }
33247 else
33248 {
33253 }
33254 }
33259 }
33261 /* Handles the Cilk Plus #pragma simd linear clause.
33262 Syntax:
33263 linear ( simd-linear-variable-list )
33265 simd-linear-variable-list:
33266 simd-linear-variable
33267 simd-linear-variable-list , simd-linear-variable
33269 simd-linear-variable:
33270 id-expression
33271 id-expression : simd-linear-step
33273 simd-linear-step:
33274 conditional-expression */
33276 static tree
33278 {
33284 {
33288 }
33293 {
33296 {
33300 }
33307 {
33311 }
33312 else
33313 {
33317 /* If present, parse the linear step. Otherwise, assume the default
33318 value of 1. */
33320 {
33327 {
33328 /* If an error has occurred, then the whole pragma is
33329 considered ill-formed. Thus, no reason to keep
33330 parsing. */
33333 }
33341 else
33343 "step size must be an integer constant "
33345 }
33347 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33353 }
33358 else
33359 {
33364 }
33365 }
33369 }
33371 /* Returns the name of the next clause. If the clause is not
33372 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33373 token is not consumed. Otherwise, the appropriate enum from the
33374 pragma_simd_clause is returned and the token is consumed. */
33376 static pragma_omp_clause
33378 {
33379 pragma_omp_clause clause_type;
33396 else
33401 }
33403 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33405 static tree
33407 {
33412 {
33413 pragma_omp_clause c_kind;
33420 /* Use the OpenMP 4.0 equivalent function. */
33423 /* Use the OpenMP 4.0 equivalent function. */
33425 clauses);
33427 /* Use the OMP 4.0 equivalent function. */
33429 clauses);
33431 /* Use the OMP 4.0 equivalent function. */
33433 else
33434 {
33438 }
33439 }
33445 else
33447 }
33449 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33451 static void
33453 {
33460 {
33464 }
33473 }
33475 /* Main entry-point for parsing Cilk Plus _Cilk_for
33476 loops. The return value is error_mark_node
33477 when errors happen and CILK_FOR tree on success. */
33479 static tree
33481 {
33496 else
33502 }
33504 /* Create an identifier for a generic parameter type (a synthesized
33505 template parameter implied by `auto' or a concept identifier). */
33508 static tree
33510 {
33514 }
33516 /* Predicate that behaves as is_auto_or_concept but matches the parent
33517 node of the generic type rather than the generic type itself. This
33518 allows for type transformation in add_implicit_template_parms. */
33522 {
33524 }
33526 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33527 (creating a new template parameter list if necessary). Returns the newly
33528 created template type parm. */
33530 tree
33532 {
33535 /* We are either continuing a function template that already contains implicit
33536 template parameters, creating a new fully-implicit function template, or
33537 extending an existing explicit function template with implicit template
33538 parameters. */
33546 {
33550 }
33551 else
33552 {
33553 /* Roll back to the existing template parameter scope (in the case of
33554 extending an explicit function template) or introduce a new template
33555 parameter scope ahead of the function parameter scope (or class scope
33556 in the case of out-of-line member definitions). The function scope is
33557 added back after template parameter synthesis below. */
33562 {
33565 }
33567 {
33568 /* If not defining a class, then any class scope is a scope level in
33569 an out-of-line member definition. In this case simply wind back
33570 beyond the first such scope to inject the template parameter list.
33571 Otherwise wind back to the class being defined. The latter can
33572 occur in class member friend declarations such as:
33574 class A {
33575 void foo (auto);
33576 };
33577 class B {
33578 friend void A::foo (auto);
33579 };
33581 The template parameter list synthesized for the friend declaration
33582 must be injected in the scope of 'B'. This can also occur in
33583 erroneous cases such as:
33585 struct A {
33586 struct B {
33587 void foo (auto);
33588 };
33589 void B::foo (auto) {}
33590 };
33592 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33593 but, nevertheless, the template parameter list synthesized for the
33594 declarator should be injected into the scope of 'A' as if the
33595 ill-formed template was specified explicitly. */
33598 {
33601 }
33602 }
33608 {
33609 /* Introduce a new template parameter list for implicit template
33610 parameters. */
33614 parser->implicit_template_scope
33621 }
33622 else
33623 {
33624 /* Synthesize implicit template parameters at the end of the explicit
33625 template parameter list. */
33632 parser->implicit_template_parms
33634 }
33635 }
33637 /* Synthesize a new template parameter and track the current template
33638 parameter chain with implicit_template_parms. */
33642 synth_id);
33643 tree new_parm
33645 input_location,
33652 parser->implicit_template_parms
33654 else
33659 /* If creating a fully implicit function template, start the new implicit
33660 template parameter list with this synthesized type, otherwise grow the
33661 current template parameter list. */
33664 {
33671 }
33672 else
33673 {
33678 }
33683 }
33685 /* Finish the declaration of a fully implicit function template. Such a
33686 template has no explicit template parameter list so has not been through the
33687 normal template head and tail processing. synthesize_implicit_template_parm
33688 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33689 provided if the declaration is a class member such that its template
33690 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33691 form is returned. Otherwise NULL_TREE is returned. */
33693 tree
33695 {
33700 {
33704 }
33714 }