| blob | e6def9a2aa315620e68bb92ac7bbae71290d7f75 |
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 `)'. */
4440 }
4443 {
4445 {
4446 /* We might have an Objective-C++ message. */
4449 /* If that works out, we're done ... */
4452 /* ... else, fall though to see if it's a lambda. */
4453 }
4455 /* Don't warn about a failed tentative parse. */
4460 }
4464 /* We have an Objective-C++ string literal. */
4471 {
4472 /* These two are the boolean literals. */
4480 /* The `__null' literal. */
4485 /* The `nullptr' literal. */
4490 /* Recognize the `this' keyword. */
4494 {
4498 }
4499 /* Pointers cannot appear in constant-expressions. */
4504 /* The `operator' keyword can be the beginning of an
4505 id-expression. */
4512 {
4513 non_integral_constant name;
4515 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4516 __func__ are the names of variables -- but they are
4517 treated specially. Therefore, they are handled here,
4518 rather than relying on the generic id-expression logic
4519 below. Grammatically, these names are id-expressions.
4521 Consume the token. */
4525 {
4537 }
4542 /* Look up the name. */
4544 }
4547 {
4548 tree expression;
4549 tree type;
4550 source_location type_location;
4552 /* The `__builtin_va_arg' construct is used to handle
4553 `va_arg'. Consume the `__builtin_va_arg' token. */
4555 /* Look for the opening `('. */
4557 /* Now, parse the assignment-expression. */
4559 /* Look for the `,'. */
4562 /* Parse the type-id. */
4564 /* Look for the closing `)'. */
4566 /* Using `va_arg' in a constant-expression is not
4567 allowed. */
4569 NIC_VA_ARG))
4572 }
4602 /* Objective-C++ expressions. */
4612 {
4617 }
4621 }
4623 /* An id-expression can start with either an identifier, a
4624 `::' as the beginning of a qualified-id, or the "operator"
4625 keyword. */
4630 {
4631 tree id_expression;
4632 tree decl;
4638 id_expression:
4639 /* Parse the id-expression. */
4640 id_expression
4657 /* If we have a template-id, then no further lookup is
4658 required. If the template-id was for a template-class, we
4659 will sometimes have a TYPE_DECL at this point. */
4663 /* Look up the name. */
4664 else
4665 {
4666 tree ambiguous_decls;
4668 /* If we already know that this lookup is ambiguous, then
4669 we've already issued an error message; there's no reason
4670 to check again. */
4673 {
4676 }
4679 none_type,
4680 template_p,
4685 /* If the lookup was ambiguous, an error will already have
4686 been issued. */
4690 /* In Objective-C++, we may have an Objective-C 2.0
4691 dot-syntax for classes here. */
4696 {
4697 tree component;
4704 }
4706 /* In Objective-C++, an instance variable (ivar) may be preferred
4707 to whatever cp_parser_lookup_name() found. */
4710 /* If name lookup gives us a SCOPE_REF, then the
4711 qualifying scope was dependent. */
4713 {
4714 /* At this point, we do not know if DECL is a valid
4715 integral constant expression. We assume that it is
4716 in fact such an expression, so that code like:
4718 template <int N> struct A {
4719 int a[B<N>::i];
4720 };
4722 is accepted. At template-instantiation time, we
4723 will check that B<N>::i is actually a constant. */
4725 }
4726 /* Check to see if DECL is a local variable in a context
4727 where that is forbidden. */
4730 {
4731 /* It might be that we only found DECL because we are
4732 trying to be generous with pre-ISO scoping rules.
4733 For example, consider:
4735 int i;
4736 void g() {
4737 for (int i = 0; i < 10; ++i) {}
4738 extern void f(int j = i);
4739 }
4741 Here, name look up will originally find the out
4742 of scope `i'. We need to issue a warning message,
4743 but then use the global `i'. */
4746 {
4749 decl);
4751 }
4752 }
4753 }
4755 decl = (finish_id_expression
4757 idk,
4762 template_arg_p,
4768 }
4770 /* Anything else is an error. */
4774 }
4775 }
4783 {
4786 }
4788 /* Parse an id-expression.
4790 id-expression:
4791 unqualified-id
4792 qualified-id
4794 qualified-id:
4795 :: [opt] nested-name-specifier template [opt] unqualified-id
4796 :: identifier
4797 :: operator-function-id
4798 :: template-id
4800 Return a representation of the unqualified portion of the
4801 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4802 a `::' or nested-name-specifier.
4804 Often, if the id-expression was a qualified-id, the caller will
4805 want to make a SCOPE_REF to represent the qualified-id. This
4806 function does not do this in order to avoid wastefully creating
4807 SCOPE_REFs when they are not required.
4809 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4810 `template' keyword.
4812 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4813 uninstantiated templates.
4815 If *TEMPLATE_P is non-NULL, it is set to true iff the
4816 `template' keyword is used to explicitly indicate that the entity
4817 named is a template.
4819 If DECLARATOR_P is true, the id-expression is appearing as part of
4820 a declarator, rather than as part of an expression. */
4822 static tree
4829 {
4833 /* Assume the `template' keyword was not used. */
4837 /* Look for the optional `::' operator. */
4838 global_scope_p
4841 /* Look for the optional nested-name-specifier. */
4842 nested_name_specifier_p
4845 check_dependency_p,
4847 declarator_p)
4849 /* If there is a nested-name-specifier, then we are looking at
4850 the first qualified-id production. */
4852 {
4853 tree saved_scope;
4854 tree saved_object_scope;
4855 tree saved_qualifying_scope;
4856 tree unqualified_id;
4859 /* See if the next token is the `template' keyword. */
4863 /* Name lookup we do during the processing of the
4864 unqualified-id might obliterate SCOPE. */
4868 /* Process the final unqualified-id. */
4870 check_dependency_p,
4871 declarator_p,
4873 /* Restore the SAVED_SCOPE for our caller. */
4879 }
4880 /* Otherwise, if we are in global scope, then we are looking at one
4881 of the other qualified-id productions. */
4883 {
4885 tree id;
4887 /* Peek at the next token. */
4890 /* If it's an identifier, and the next token is not a "<", then
4891 we can avoid the template-id case. This is an optimization
4892 for this common case. */
4894 && !cp_parser_nth_token_starts_template_argument_list_p
4899 /* Try a template-id. */
4903 none_type,
4904 declarator_p);
4905 /* If that worked, we're done. */
4909 /* Peek at the next token. (Changes in the token buffer may
4910 have invalidated the pointer obtained above.) */
4914 {
4921 /* Fall through. */
4926 }
4927 }
4928 else
4931 declarator_p,
4932 optional_p);
4933 }
4935 /* Parse an unqualified-id.
4937 unqualified-id:
4938 identifier
4939 operator-function-id
4940 conversion-function-id
4941 ~ class-name
4942 template-id
4944 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4945 keyword, in a construct like `A::template ...'.
4947 Returns a representation of unqualified-id. For the `identifier'
4948 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4949 production a BIT_NOT_EXPR is returned; the operand of the
4950 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4951 other productions, see the documentation accompanying the
4952 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4953 names are looked up in uninstantiated templates. If DECLARATOR_P
4954 is true, the unqualified-id is appearing as part of a declarator,
4955 rather than as part of an expression. */
4957 static tree
4963 {
4966 /* Peek at the next token. */
4970 {
4972 {
4973 tree id;
4975 /* We don't know yet whether or not this will be a
4976 template-id. */
4978 /* Try a template-id. */
4980 check_dependency_p,
4981 none_type,
4982 declarator_p);
4983 /* If it worked, we're done. */
4986 /* Otherwise, it's an ordinary identifier. */
4988 }
4992 check_dependency_p,
4993 none_type,
4994 declarator_p);
4997 {
4998 tree type_decl;
4999 tree qualifying_scope;
5000 tree object_scope;
5001 tree scope;
5004 /* Consume the `~' token. */
5006 /* Parse the class-name. The standard, as written, seems to
5007 say that:
5009 template <typename T> struct S { ~S (); };
5010 template <typename T> S<T>::~S() {}
5012 is invalid, since `~' must be followed by a class-name, but
5013 `S<T>' is dependent, and so not known to be a class.
5014 That's not right; we need to look in uninstantiated
5015 templates. A further complication arises from:
5017 template <typename T> void f(T t) {
5018 t.T::~T();
5019 }
5021 Here, it is not possible to look up `T' in the scope of `T'
5022 itself. We must look in both the current scope, and the
5023 scope of the containing complete expression.
5025 Yet another issue is:
5027 struct S {
5028 int S;
5029 ~S();
5030 };
5032 S::~S() {}
5034 The standard does not seem to say that the `S' in `~S'
5035 should refer to the type `S' and not the data member
5036 `S::S'. */
5038 /* DR 244 says that we look up the name after the "~" in the
5039 same scope as we looked up the qualifying name. That idea
5040 isn't fully worked out; it's more complicated than that. */
5045 /* Check for invalid scopes. */
5047 {
5051 }
5053 {
5057 scope);
5062 }
5065 /* If the name is of the form "X::~X" it's OK even if X is a
5066 typedef. */
5075 {
5078 }
5080 /* ~auto means the destructor of whatever the object is. */
5082 {
5085 "%<~auto%> only available with "
5089 }
5091 /* If there was an explicit qualification (S::~T), first look
5092 in the scope given by the qualification (i.e., S).
5094 Note: in the calls to cp_parser_class_name below we pass
5095 typename_type so that lookup finds the injected-class-name
5096 rather than the constructor. */
5100 {
5105 typename_type,
5108 declarator_p);
5111 }
5112 /* In "N::S::~S", look in "N" as well. */
5114 {
5119 type_decl
5123 typename_type,
5126 declarator_p);
5129 }
5130 /* In "p->S::~T", look in the scope given by "*p" as well. */
5132 {
5137 type_decl
5141 typename_type,
5144 declarator_p);
5147 }
5148 /* Look in the surrounding context. */
5150 {
5156 type_decl
5160 typename_type,
5163 declarator_p);
5166 {
5167 /* We couldn't find a type with this name, so just accept
5168 it and check for a match at instantiation time. */
5173 }
5174 }
5175 /* If an error occurred, assume that the name of the
5176 destructor is the same as the name of the qualifying
5177 class. That allows us to keep parsing after running
5178 into ill-formed destructor names. */
5184 /* Check that destructor name and scope match. */
5186 {
5193 }
5195 /* [class.dtor]
5197 A typedef-name that names a class shall not be used as the
5198 identifier in the declarator for a destructor declaration. */
5205 type_decl);
5208 }
5212 {
5213 tree id;
5215 /* This could be a template-id, so we try that first. */
5217 /* Try a template-id. */
5220 none_type,
5221 declarator_p);
5222 /* If that worked, we're done. */
5225 /* We still don't know whether we're looking at an
5226 operator-function-id or a conversion-function-id. */
5228 /* Try an operator-function-id. */
5230 /* If that didn't work, try a conversion-function-id. */
5234 {
5235 /* 17.6.3.3.5 */
5241 }
5244 }
5245 /* Fall through. */
5252 }
5253 }
5255 /* Parse an (optional) nested-name-specifier.
5257 nested-name-specifier: [C++98]
5258 class-or-namespace-name :: nested-name-specifier [opt]
5259 class-or-namespace-name :: template nested-name-specifier [opt]
5261 nested-name-specifier: [C++0x]
5262 type-name ::
5263 namespace-name ::
5264 nested-name-specifier identifier ::
5265 nested-name-specifier template [opt] simple-template-id ::
5267 PARSER->SCOPE should be set appropriately before this function is
5268 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5269 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5270 in name lookups.
5272 Sets PARSER->SCOPE to the class (TYPE) or namespace
5273 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5274 it unchanged if there is no nested-name-specifier. Returns the new
5275 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5277 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5278 part of a declaration and/or decl-specifier. */
5280 static tree
5286 {
5291 /* Remember where the nested-name-specifier starts. */
5293 {
5296 }
5299 {
5300 tree new_scope;
5301 tree old_scope;
5302 tree saved_qualifying_scope;
5305 /* Spot cases that cannot be the beginning of a
5306 nested-name-specifier. */
5309 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5310 the already parsed nested-name-specifier. */
5312 {
5313 /* Grab the nested-name-specifier and continue the loop. */
5315 /* If we originally encountered this nested-name-specifier
5316 with IS_DECLARATION set to false, we will not have
5317 resolved TYPENAME_TYPEs, so we must do so here. */
5320 {
5325 }
5328 }
5330 /* Spot cases that cannot be the beginning of a
5331 nested-name-specifier. On the second and subsequent times
5332 through the loop, we look for the `template' keyword. */
5334 ;
5335 /* A template-id can start a nested-name-specifier. */
5337 ;
5338 /* DR 743: decltype can be used in a nested-name-specifier. */
5340 ;
5341 else
5342 {
5343 /* If the next token is not an identifier, then it is
5344 definitely not a type-name or namespace-name. */
5347 /* If the following token is neither a `<' (to begin a
5348 template-id), nor a `::', then we are not looking at a
5349 nested-name-specifier. */
5355 {
5359 }
5362 && !cp_parser_nth_token_starts_template_argument_list_p
5365 }
5367 /* The nested-name-specifier is optional, so we parse
5368 tentatively. */
5371 /* Look for the optional `template' keyword, if this isn't the
5372 first time through the loop. */
5375 else
5378 /* Save the old scope since the name lookup we are about to do
5379 might destroy it. */
5382 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5383 look up names in "X<T>::I" in order to determine that "Y" is
5384 a template. So, if we have a typename at this point, we make
5385 an effort to look through it. */
5387 && !typename_keyword_p
5392 /* Parse the qualifying entity. */
5393 new_scope
5395 typename_keyword_p,
5396 template_keyword_p,
5397 check_dependency_p,
5398 type_p,
5399 is_declaration);
5400 /* Look for the `::' token. */
5403 /* If we found what we wanted, we keep going; otherwise, we're
5404 done. */
5406 {
5409 /* Restore the OLD_SCOPE since it was valid before the
5410 failed attempt at finding the last
5411 class-or-namespace-name. */
5415 /* If the next token is a decltype, and the one after that is a
5416 `::', then the decltype has failed to resolve to a class or
5417 enumeration type. Give this error even when parsing
5418 tentatively since it can't possibly be valid--and we're going
5419 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5420 won't get another chance.*/
5424 {
5431 /* As below. */
5434 }
5438 {
5439 /* If we have a non-type template-id followed by ::, it can't
5440 possibly be valid. */
5445 {
5448 {
5454 }
5455 else
5456 {
5457 /* Variable template. */
5462 }
5469 /* As below. */
5473 }
5474 }
5478 /* If the next token is an identifier, and the one after
5479 that is a `::', then any valid interpretation would have
5480 found a class-or-namespace-name. */
5486 {
5489 {
5491 {
5492 tree decl;
5493 tree ambiguous_decls;
5496 none_type,
5505 decl);
5507 {
5508 // cp_parser_lookup_name has the same diagnostic,
5509 // thus make sure to emit it at most once.
5512 {
5517 }
5519 }
5520 else
5521 {
5523 cp_parser_name_lookup_error
5526 else
5527 cp_parser_name_lookup_error
5530 }
5531 }
5534 /* Treat this as a successful nested-name-specifier
5535 due to:
5537 [basic.lookup.qual]
5539 If the name found is not a class-name (clause
5540 _class_) or namespace-name (_namespace.def_), the
5541 program is ill-formed. */
5543 }
5545 }
5547 }
5548 /* We've found one valid nested-name-specifier. */
5550 /* Name lookup always gives us a DECL. */
5553 /* Uses of "template" must be followed by actual templates. */
5565 new_scope);
5566 /* If it is a class scope, try to complete it; we are about to
5567 be looking up names inside the class. */
5569 /* Since checking types for dependency can be expensive,
5570 avoid doing it if the type is already complete. */
5572 /* Do not try to complete dependent types. */
5574 {
5576 /* If it is a typedef to current class, use the current
5577 class instead, as the typedef won't have any names inside
5578 it yet. */
5582 }
5583 /* Make sure we look in the right scope the next time through
5584 the loop. */
5586 }
5588 /* If parsing tentatively, replace the sequence of tokens that makes
5589 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5590 token. That way, should we re-parse the token stream, we will
5591 not have to repeat the effort required to do the parse, nor will
5592 we issue duplicate error messages. */
5594 {
5598 /* Reset the contents of the START token. */
5600 /* Retrieve any deferred checks. Do not pop this access checks yet
5601 so the memory will not be reclaimed during token replacing below. */
5609 /* Purge all subsequent tokens. */
5611 }
5617 }
5619 /* Parse a nested-name-specifier. See
5620 cp_parser_nested_name_specifier_opt for details. This function
5621 behaves identically, except that it will an issue an error if no
5622 nested-name-specifier is present. */
5624 static tree
5630 {
5631 tree scope;
5633 /* Look for the nested-name-specifier. */
5635 typename_keyword_p,
5636 check_dependency_p,
5637 type_p,
5638 is_declaration);
5639 /* If it was not present, issue an error message. */
5641 {
5644 }
5647 }
5649 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5650 this is either a class-name or a namespace-name (which corresponds
5651 to the class-or-namespace-name production in the grammar). For
5652 C++0x, it can also be a type-name that refers to an enumeration
5653 type or a simple-template-id.
5655 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5656 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5657 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5658 TYPE_P is TRUE iff the next name should be taken as a class-name,
5659 even the same name is declared to be another entity in the same
5660 scope.
5662 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5663 specified by the class-or-namespace-name. If neither is found the
5664 ERROR_MARK_NODE is returned. */
5666 static tree
5673 {
5674 tree saved_scope;
5675 tree saved_qualifying_scope;
5676 tree saved_object_scope;
5677 tree scope;
5681 /* DR 743: decltype can appear in a nested-name-specifier. */
5683 {
5687 {
5690 }
5694 }
5696 /* Before we try to parse the class-name, we must save away the
5697 current PARSER->SCOPE since cp_parser_class_name will destroy
5698 it. */
5702 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5703 there is no need to look for a namespace-name. */
5704 only_class_p = template_keyword_p
5709 typename_keyword_p,
5710 template_keyword_p,
5712 check_dependency_p,
5714 is_declaration);
5716 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5720 {
5721 /* Restore the saved scope. */
5726 /* Parse tentatively. */
5729 /* Parse a type-name */
5732 /* "If the name found does not designate a namespace or a class,
5733 enumeration, or dependent type, the program is ill-formed."
5735 We cover classes and dependent types above and namespaces below,
5736 so this code is only looking for enums. */
5742 }
5743 /* If that didn't work, try for a namespace-name. */
5745 {
5746 /* Restore the saved scope. */
5750 /* If we are not looking at an identifier followed by the scope
5751 resolution operator, then this is not part of a
5752 nested-name-specifier. (Note that this function is only used
5753 to parse the components of a nested-name-specifier.) */
5758 }
5761 }
5763 /* Return true if we are looking at a compound-literal, false otherwise. */
5765 static bool
5767 {
5768 /* Consume the `('. */
5773 /* Skip tokens until the next token is a closing parenthesis.
5774 If we find the closing `)', and the next token is a `{', then
5775 we are looking at a compound-literal. */
5776 bool compound_literal_p
5781 /* Roll back the tokens we skipped. */
5785 }
5787 /* Parse a postfix-expression.
5789 postfix-expression:
5790 primary-expression
5791 postfix-expression [ expression ]
5792 postfix-expression ( expression-list [opt] )
5793 simple-type-specifier ( expression-list [opt] )
5794 typename :: [opt] nested-name-specifier identifier
5795 ( expression-list [opt] )
5796 typename :: [opt] nested-name-specifier template [opt] template-id
5797 ( expression-list [opt] )
5798 postfix-expression . template [opt] id-expression
5799 postfix-expression -> template [opt] id-expression
5800 postfix-expression . pseudo-destructor-name
5801 postfix-expression -> pseudo-destructor-name
5802 postfix-expression ++
5803 postfix-expression --
5804 dynamic_cast < type-id > ( expression )
5805 static_cast < type-id > ( expression )
5806 reinterpret_cast < type-id > ( expression )
5807 const_cast < type-id > ( expression )
5808 typeid ( expression )
5809 typeid ( type-id )
5811 GNU Extension:
5813 postfix-expression:
5814 ( type-id ) { initializer-list , [opt] }
5816 This extension is a GNU version of the C99 compound-literal
5817 construct. (The C99 grammar uses `type-name' instead of `type-id',
5818 but they are essentially the same concept.)
5820 If ADDRESS_P is true, the postfix expression is the operand of the
5821 `&' operator. CAST_P is true if this expression is the target of a
5822 cast.
5824 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5825 class member access expressions [expr.ref].
5827 Returns a representation of the expression. */
5829 static tree
5833 {
5835 location_t loc;
5842 /* Peek at the next token. */
5845 /* Some of the productions are determined by keywords. */
5848 {
5853 {
5854 tree type;
5855 tree expression;
5859 /* All of these can be handled in the same way from the point
5860 of view of parsing. Begin by consuming the token
5861 identifying the cast. */
5864 /* New types cannot be defined in the cast. */
5866 parser->type_definition_forbidden_message
5869 /* Look for the opening `<'. */
5871 /* Parse the type to which we are casting. */
5876 /* Look for the closing `>'. */
5878 /* Restore the old message. */
5881 bool saved_greater_than_is_operator_p
5885 /* And the expression which is being cast. */
5890 parser->greater_than_is_operator_p
5893 /* Only type conversions to integral or enumeration types
5894 can be used in constant-expressions. */
5900 {
5902 postfix_expression
5906 postfix_expression
5910 postfix_expression
5912 tf_warning_or_error);
5915 postfix_expression
5920 }
5921 }
5925 {
5926 tree type;
5930 /* Consume the `typeid' token. */
5932 /* Look for the `(' token. */
5934 /* Types cannot be defined in a `typeid' expression. */
5936 parser->type_definition_forbidden_message
5938 /* We can't be sure yet whether we're looking at a type-id or an
5939 expression. */
5941 /* Try a type-id first. */
5946 /* Look for the `)' token. Otherwise, we can't be sure that
5947 we're not looking at an expression: consider `typeid (int
5948 (3))', for example. */
5950 /* If all went well, simply lookup the type-id. */
5953 /* Otherwise, fall back to the expression variant. */
5954 else
5955 {
5956 tree expression;
5958 /* Look for an expression. */
5960 /* Compute its typeid. */
5962 /* Look for the `)' token. */
5964 }
5965 /* Restore the saved message. */
5967 /* `typeid' may not appear in an integral constant expression. */
5970 }
5974 {
5975 tree type;
5976 /* The syntax permitted here is the same permitted for an
5977 elaborated-type-specifier. */
5982 }
5986 {
5990 {
5995 }
5997 {
6002 }
6003 else
6004 {
6005 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6008 }
6010 postfix_expression =
6014 {
6018 }
6020 {
6025 }
6026 else
6027 {
6029 postfix_expression);
6033 }
6035 }
6038 {
6041 tree p;
6055 tf_warning_or_error);
6058 tf_warning_or_error);
6059 else
6060 {
6064 }
6066 }
6069 {
6070 tree type;
6072 /* If the next thing is a simple-type-specifier, we may be
6073 looking at a functional cast. We could also be looking at
6074 an id-expression. So, we try the functional cast, and if
6075 that doesn't work we fall back to the primary-expression. */
6077 /* Look for the simple-type-specifier. */
6080 CP_PARSER_FLAGS_NONE);
6081 /* Parse the cast itself. */
6083 postfix_expression
6085 /* If that worked, we're done. */
6089 /* If the functional-cast didn't work out, try a
6090 compound-literal. */
6093 {
6098 /* Avoid calling cp_parser_type_id pointlessly, see comment
6099 in cp_parser_cast_expression about c++/29234. */
6102 else
6103 {
6104 /* Parse the type. */
6109 /* Look for the `)'. */
6111 }
6113 /* If things aren't going well, there's no need to
6114 keep going. */
6116 {
6118 /* Parse the brace-enclosed initializer list. */
6121 }
6122 /* If that worked, we're definitely looking at a
6123 compound-literal expression. */
6125 {
6126 /* Warn the user that a compound literal is not
6127 allowed in standard C++. */
6130 /* For simplicity, we disallow compound literals in
6131 constant-expressions. We could
6132 allow compound literals of integer type, whose
6133 initializer was a constant, in constant
6134 expressions. Permitting that usage, as a further
6135 extension, would not change the meaning of any
6136 currently accepted programs. (Of course, as
6137 compound literals are not part of ISO C++, the
6138 standard has nothing to say.) */
6140 NIC_NCC))
6141 {
6144 }
6145 /* Form the representation of the compound-literal. */
6146 postfix_expression
6148 tf_warning_or_error);
6150 }
6151 }
6153 /* It must be a primary-expression. */
6154 postfix_expression
6157 decltype_p,
6159 }
6161 }
6163 /* Note that we don't need to worry about calling build_cplus_new on a
6164 class-valued CALL_EXPR in decltype when it isn't the end of the
6165 postfix-expression; unary_complex_lvalue will take care of that for
6166 all these cases. */
6168 /* Keep looping until the postfix-expression is complete. */
6170 {
6174 /* It is not a Koenig lookup function call. */
6175 postfix_expression
6178 /* Peek at the next token. */
6182 {
6185 {
6187 "two consecutive %<[%> shall "
6190 }
6191 postfix_expression
6193 postfix_expression,
6195 decltype_p);
6201 /* postfix-expression ( expression-list [opt] ) */
6202 {
6212 is_builtin_constant_p
6215 {
6216 /* The whole point of __builtin_constant_p is to allow
6217 non-constant expressions to appear as arguments. */
6218 saved_integral_constant_expression_p
6220 saved_non_integral_constant_expression_p
6223 }
6224 args = (cp_parser_parenthesized_expression_list
6230 {
6231 parser->integral_constant_expression_p
6233 parser->non_integral_constant_expression_p
6235 }
6238 {
6241 }
6243 /* Function calls are not permitted in
6244 constant-expressions. */
6247 NIC_FUNC_CALL))
6248 {
6252 }
6257 {
6259 {
6261 {
6264 postfix_expression
6266 complain);
6267 }
6268 else
6269 postfix_expression
6271 }
6272 /* We do not perform argument-dependent lookup if
6273 normal lookup finds a non-function, in accordance
6274 with the expected resolution of DR 218. */
6277 {
6281 /* Do not do argument dependent lookup if regular
6282 lookup finds a member function or a block-scope
6283 function declaration. [basic.lookup.argdep]/3 */
6286 {
6289 postfix_expression
6291 complain);
6292 }
6293 }
6294 }
6297 {
6307 "%<memset%> used with constant zero length "
6308 "parameter; this could be due to transposed "
6311 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6312 to avoid leaking those into folder and middle-end. */
6314 tree arg;
6318 }
6321 {
6331 {
6332 postfix_expression
6336 }
6339 {
6340 postfix_expression
6341 = (build_new_method_call
6347 complain));
6348 }
6349 else
6350 postfix_expression
6354 complain);
6355 }
6359 postfix_expression = (build_offset_ref_call_from_tree
6361 complain));
6363 /* A call to a static class member, or a namespace-scope
6364 function. */
6365 postfix_expression
6368 koenig_p,
6369 complain);
6370 else
6371 /* All other function calls. */
6372 postfix_expression
6375 koenig_p,
6376 complain);
6380 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6384 }
6389 /* postfix-expression . template [opt] id-expression
6390 postfix-expression . pseudo-destructor-name
6391 postfix-expression -> template [opt] id-expression
6392 postfix-expression -> pseudo-destructor-name */
6394 /* Consume the `.' or `->' operator. */
6397 postfix_expression
6399 postfix_expression,
6406 /* postfix-expression ++ */
6407 /* Consume the `++' token. */
6409 /* Generate a representation for the complete expression. */
6410 postfix_expression
6412 POSTINCREMENT_EXPR);
6413 /* Increments may not appear in constant-expressions. */
6421 /* postfix-expression -- */
6422 /* Consume the `--' token. */
6424 /* Generate a representation for the complete expression. */
6425 postfix_expression
6427 POSTDECREMENT_EXPR);
6428 /* Decrements may not appear in constant-expressions. */
6440 else
6442 }
6443 }
6445 /* We should never get here. */
6448 }
6450 /* This function parses Cilk Plus array notations. If a normal array expr. is
6451 parsed then the array index is passed back to the caller through *INIT_INDEX
6452 and the function returns a NULL_TREE. If array notation expr. is parsed,
6453 then *INIT_INDEX is ignored by the caller and the function returns
6454 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6455 error_mark_node. */
6457 static tree
6459 tree array_value)
6460 {
6464 {
6467 }
6476 {
6479 }
6481 {
6482 /* Consume the ':'. */
6485 /* If we are here, then we have a case like this A[:]. */
6487 {
6491 }
6495 }
6496 else
6497 {
6498 /* If we are here, then there are three valid possibilities:
6499 1. ARRAY [ EXP ]
6500 2. ARRAY [ EXP : EXP ]
6501 3. ARRAY [ EXP : EXP : EXP ] */
6505 {
6506 /* This indicates that we have a normal array expression. */
6509 }
6511 /* Consume the ':'. */
6515 {
6518 }
6519 }
6524 {
6528 }
6534 }
6536 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6537 by cp_parser_builtin_offsetof. We're looking for
6539 postfix-expression [ expression ]
6540 postfix-expression [ braced-init-list ] (C++11)
6542 FOR_OFFSETOF is set if we're being called in that context, which
6543 changes how we deal with integer constant expressions. */
6545 static tree
6547 tree postfix_expression,
6550 {
6555 /* Consume the `[' token. */
6561 /* Parse the index expression. */
6562 /* ??? For offsetof, there is a question of what to allow here. If
6563 offsetof is not being used in an integral constant expression context,
6564 then we *could* get the right answer by computing the value at runtime.
6565 If we are in an integral constant expression context, then we might
6566 could accept any constant expression; hard to say without analysis.
6567 Rather than open the barn door too wide right away, allow only integer
6568 constant expressions here. */
6571 else
6572 {
6574 {
6581 {
6583 "braced list index is not allowed with array "
6587 }
6588 }
6590 {
6591 /* Here are have these two options:
6592 ARRAY[EXP : EXP] - Array notation expr with default
6593 stride of 1.
6594 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6595 stride. */
6597 postfix_expression);
6600 }
6601 else
6603 }
6607 /* Look for the closing `]'. */
6610 /* Build the ARRAY_REF. */
6614 /* When not doing offsetof, array references are not permitted in
6615 constant-expressions. */
6621 }
6623 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6624 by cp_parser_builtin_offsetof. We're looking for
6626 postfix-expression . template [opt] id-expression
6627 postfix-expression . pseudo-destructor-name
6628 postfix-expression -> template [opt] id-expression
6629 postfix-expression -> pseudo-destructor-name
6631 FOR_OFFSETOF is set if we're being called in that context. That sorta
6632 limits what of the above we'll actually accept, but nevermind.
6633 TOKEN_TYPE is the "." or "->" token, which will already have been
6634 removed from the stream. */
6636 static tree
6639 tree postfix_expression,
6641 location_t location)
6642 {
6643 tree name;
6648 /* If this is a `->' operator, dereference the pointer. */
6651 tf_warning_or_error);
6652 /* Check to see whether or not the expression is type-dependent. */
6654 /* The identifier following the `->' or `.' is not qualified. */
6660 /* Enter the scope corresponding to the type of the object
6661 given by the POSTFIX_EXPRESSION. */
6663 {
6665 /* According to the standard, no expression should ever have
6666 reference type. Unfortunately, we do not currently match
6667 the standard in this respect in that our internal representation
6668 of an expression may have reference type even when the standard
6669 says it does not. Therefore, we have to manually obtain the
6670 underlying type here. */
6672 /* The type of the POSTFIX_EXPRESSION must be complete. */
6674 {
6676 postfix_expression);
6678 }
6679 /* Unlike the object expression in other contexts, *this is not
6680 required to be of complete type for purposes of class member
6681 access (5.2.5) outside the member function body. */
6685 /* Let the name lookup machinery know that we are processing a
6686 class member access expression. */
6688 /* If something went wrong, we want to be able to discern that case,
6689 as opposed to the case where there was no SCOPE due to the type
6690 of expression being dependent. */
6693 /* If the SCOPE was erroneous, make the various semantic analysis
6694 functions exit quickly -- and without issuing additional error
6695 messages. */
6698 }
6700 /* Assume this expression is not a pseudo-destructor access. */
6703 /* If the SCOPE is a scalar type, then, if this is a valid program,
6704 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6705 is type dependent, it can be pseudo-destructor-name or something else.
6706 Try to parse it as pseudo-destructor-name first. */
6708 {
6709 tree s;
6710 tree type;
6713 /* Parse the pseudo-destructor-name. */
6722 {
6724 postfix_expression
6727 }
6728 }
6731 {
6732 /* If the SCOPE is not a scalar type, we are looking at an
6733 ordinary class member access expression, rather than a
6734 pseudo-destructor-name. */
6737 /* Parse the id-expression. */
6738 name = (cp_parser_id_expression
6745 /* In general, build a SCOPE_REF if the member name is qualified.
6746 However, if the name was not dependent and has already been
6747 resolved; there is no need to build the SCOPE_REF. For example;
6749 struct X { void f(); };
6750 template <typename T> void f(T* t) { t->X::f(); }
6752 Even though "t" is dependent, "X::f" is not and has been resolved
6753 to a BASELINK; there is no need to include scope information. */
6755 /* But we do need to remember that there was an explicit scope for
6756 virtual function calls. */
6760 /* If the name is a template-id that names a type, we will get a
6761 TYPE_DECL here. That is invalid code. */
6763 {
6766 }
6767 else
6768 {
6770 {
6772 {
6776 }
6777 else
6780 name,
6781 template_p);
6785 }
6787 adjust_result_of_qualified_name_lookup
6789 postfix_expression
6791 template_p,
6792 tf_warning_or_error);
6793 }
6794 }
6796 /* We no longer need to look up names in the scope of the object on
6797 the left-hand side of the `.' or `->' operator. */
6800 /* Outside of offsetof, these operators may not appear in
6801 constant-expressions. */
6803 && (cp_parser_non_integral_constant_expression
6808 }
6810 /* Cache of LITERAL_ZERO_P constants. */
6814 /* Parse a parenthesized expression-list.
6816 expression-list:
6817 assignment-expression
6818 expression-list, assignment-expression
6820 attribute-list:
6821 expression-list
6822 identifier
6823 identifier, expression-list
6825 CAST_P is true if this expression is the target of a cast.
6827 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6828 argument pack.
6830 Returns a vector of trees. Each element is a representation of an
6831 assignment-expression. NULL is returned if the ( and or ) are
6832 missing. An empty, but allocated, vector is returned on no
6833 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6834 if we are parsing an attribute list for an attribute that wants a
6835 plain identifier argument, normal_attr for an attribute that wants
6836 an expression, or non_attr if we aren't parsing an attribute list. If
6837 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6838 not all of the expressions in the list were constant.
6839 WANT_LITERAL_ZERO_P is true if the caller is interested in
6840 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6841 immediately, this can be removed. */
6850 {
6856 /* Assume all the expressions will be constant. */
6865 /* Within a parenthesized expression, a `>' token is always
6866 the greater-than operator. */
6867 saved_greater_than_is_operator_p
6871 /* Consume expressions until there are no more. */
6874 {
6875 tree expr;
6877 /* At the beginning of attribute lists, check to see if the
6878 next token is an identifier. */
6881 {
6884 /* Consume the identifier. */
6886 /* Save the identifier. */
6888 }
6889 else
6890 {
6893 /* Parse the next assignment-expression. */
6895 {
6896 /* A braced-init-list. */
6902 }
6904 {
6905 expr = (cp_parser_constant_expression
6910 }
6911 else
6912 {
6916 {
6922 /* If a parameter is literal zero alone, remember it
6923 for -Wmemset-transposed-args warning. */
6926 && want_literal_zero_p
6928 == CPP_COMMA
6931 {
6938 else
6939 {
6944 }
6945 /* Consume the 0 token (or '\0', 0LL etc.). */
6947 }
6951 }
6954 cast_p);
6955 }
6960 /* If we have an ellipsis, then this is an expression
6961 expansion. */
6964 {
6965 /* Consume the `...'. */
6968 /* Build the argument pack. */
6970 }
6972 /* Add it to the list. We add error_mark_node
6973 expressions to the list, so that we can still tell if
6974 the correct form for a parenthesized expression-list
6975 is found. That gives better errors. */
6980 }
6982 /* After the first item, attribute lists look the same as
6983 expression lists. */
6986 get_comma:;
6987 /* If the next token isn't a `,', then we are done. */
6991 /* Otherwise, consume the `,' and keep going. */
6993 }
6996 {
6999 skip_comma:;
7000 /* We try and resync to an unnested comma, as that will give the
7001 user better diagnostics. */
7009 {
7010 parser->greater_than_is_operator_p
7013 }
7014 }
7016 parser->greater_than_is_operator_p
7023 }
7025 /* Parse a pseudo-destructor-name.
7027 pseudo-destructor-name:
7028 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7029 :: [opt] nested-name-specifier template template-id :: ~ type-name
7030 :: [opt] nested-name-specifier [opt] ~ type-name
7032 If either of the first two productions is used, sets *SCOPE to the
7033 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7034 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7035 or ERROR_MARK_NODE if the parse fails. */
7037 static void
7039 tree object,
7042 {
7045 /* Handle ~auto. */
7049 {
7052 "%<~auto%> only available with "
7059 }
7061 /* Assume that things will not work out. */
7064 /* Look for the optional `::' operator. */
7066 /* Look for the optional nested-name-specifier. */
7067 nested_name_specifier_p
7074 /* Now, if we saw a nested-name-specifier, we might be doing the
7075 second production. */
7078 {
7079 /* Consume the `template' keyword. */
7081 /* Parse the template-id. */
7085 class_type,
7087 /* Look for the `::' token. */
7089 }
7090 /* If the next token is not a `~', then there might be some
7091 additional qualification. */
7093 {
7094 /* At this point, we're looking for "type-name :: ~". The type-name
7095 must not be a class-name, since this is a pseudo-destructor. So,
7096 it must be either an enum-name, or a typedef-name -- both of which
7097 are just identifiers. So, we peek ahead to check that the "::"
7098 and "~" tokens are present; if they are not, then we can avoid
7099 calling type_name. */
7103 {
7106 }
7108 /* Look for the type-name. */
7113 /* Look for the `::' token. */
7115 }
7116 else
7119 /* Look for the `~'. */
7122 /* Once we see the ~, this has to be a pseudo-destructor. */
7126 /* Look for the type-name again. We are not responsible for
7127 checking that it matches the first type-name. */
7129 }
7131 /* Parse a unary-expression.
7133 unary-expression:
7134 postfix-expression
7135 ++ cast-expression
7136 -- cast-expression
7137 unary-operator cast-expression
7138 sizeof unary-expression
7139 sizeof ( type-id )
7140 alignof ( type-id ) [C++0x]
7141 new-expression
7142 delete-expression
7144 GNU Extensions:
7146 unary-expression:
7147 __extension__ cast-expression
7148 __alignof__ unary-expression
7149 __alignof__ ( type-id )
7150 alignof unary-expression [C++0x]
7151 __real__ cast-expression
7152 __imag__ cast-expression
7153 && identifier
7154 sizeof ( type-id ) { initializer-list , [opt] }
7155 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7156 __alignof__ ( type-id ) { initializer-list , [opt] }
7158 ADDRESS_P is true iff the unary-expression is appearing as the
7159 operand of the `&' operator. CAST_P is true if this expression is
7160 the target of a cast.
7162 Returns a representation of the expression. */
7164 static tree
7167 {
7171 /* Peek at the next token. */
7173 /* Some keywords give away the kind of expression. */
7175 {
7179 {
7182 {
7185 location_t first_loc;
7188 /* Consume the token. */
7191 /* Parse the operand. */
7196 else
7197 {
7198 /* ISO C++ defines alignof only with types, not with
7199 expressions. So pedwarn if alignof is used with a non-
7200 type expression. However, __alignof__ is ok. */
7203 "ISO C++ does not allow %<alignof%> "
7207 }
7208 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7209 SIZEOF_EXPR with the original operand. */
7211 {
7213 {
7215 {
7218 error_mark_node));
7220 }
7221 else
7225 }
7227 }
7229 }
7238 {
7239 /* The saved value of the PEDANTIC flag. */
7241 tree expr;
7243 /* Save away the PEDANTIC flag. */
7245 /* Parse the cast-expression. */
7247 /* Restore the PEDANTIC flag. */
7251 }
7255 {
7256 tree expression;
7258 /* Consume the `__real__' or `__imag__' token. */
7260 /* Parse the cast-expression. */
7262 /* Create the complete representation. */
7266 expression,
7267 tf_warning_or_error);
7268 }
7276 {
7277 tree expr;
7287 parser->type_definition_forbidden_message
7290 saved_integral_constant_expression_p
7292 saved_non_integral_constant_expression_p
7296 saved_greater_than_is_operator_p
7308 parser->greater_than_is_operator_p
7311 parser->integral_constant_expression_p
7313 parser->non_integral_constant_expression_p
7320 }
7324 }
7325 }
7327 /* Look for the `:: new' and `:: delete', which also signal the
7328 beginning of a new-expression, or delete-expression,
7329 respectively. If the next token is `::', then it might be one of
7330 these. */
7332 {
7335 /* See if the token after the `::' is one of the keywords in
7336 which we're interested. */
7338 /* If it's `new', we have a new-expression. */
7341 /* Similarly, for `delete'. */
7344 }
7346 /* Look for a unary operator. */
7348 /* The `++' and `--' operators can be handled similarly, even though
7349 they are not technically unary-operators in the grammar. */
7351 {
7356 /* Handle the GNU address-of-label extension. */
7359 {
7360 tree identifier;
7361 tree expression;
7364 /* Consume the '&&' token. */
7366 /* Look for the identifier. */
7368 /* Create an expression representing the address. */
7371 NIC_ADDR_LABEL))
7374 }
7375 }
7377 {
7378 tree cast_expression;
7384 /* Consume the operator token. */
7386 /* Parse the cast-expression. */
7387 cast_expression
7392 pidk);
7393 /* Now, build an appropriate representation. */
7395 {
7399 RO_UNARY_STAR,
7400 complain);
7405 /* Fall through. */
7408 cast_expression,
7409 complain);
7416 /* Fall through. */
7426 }
7430 non_constant_p))
7434 }
7438 decltype_p,
7439 pidk);
7440 }
7442 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7443 unary-operator, the corresponding tree code is returned. */
7445 static enum tree_code
7447 {
7449 {
7470 }
7471 }
7473 /* Parse a new-expression.
7475 new-expression:
7476 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7477 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7479 Returns a representation of the expression. */
7481 static tree
7483 {
7486 tree type;
7489 tree ret;
7491 /* Look for the optional `::' operator. */
7492 global_scope_p
7496 /* Look for the `new' operator. */
7498 /* There's no easy way to tell a new-placement from the
7499 `( type-id )' construct. */
7501 /* Look for a new-placement. */
7503 /* If that didn't work out, there's no new-placement. */
7505 {
7509 }
7511 /* If the next token is a `(', then we have a parenthesized
7512 type-id. */
7514 {
7518 /* Consume the `('. */
7521 /* Parse the type-id. */
7522 parser->type_definition_forbidden_message
7527 /* Look for the closing `)'. */
7530 /* There should not be a direct-new-declarator in this production,
7531 but GCC used to allowed this, so we check and emit a sensible error
7532 message for this case. */
7534 {
7540 }
7541 }
7542 /* Otherwise, there must be a new-type-id. */
7543 else
7546 /* If the next token is a `(' or '{', then we have a new-initializer. */
7550 else
7553 /* A new-expression may not appear in an integral constant
7554 expression. */
7557 else
7558 {
7559 /* Create a representation of the new-expression. */
7561 tf_warning_or_error);
7562 }
7570 }
7572 /* Parse a new-placement.
7574 new-placement:
7575 ( expression-list )
7577 Returns the same representation as for an expression-list. */
7581 {
7584 /* Parse the expression-list. */
7585 expression_list = (cp_parser_parenthesized_expression_list
7591 }
7593 /* Parse a new-type-id.
7595 new-type-id:
7596 type-specifier-seq new-declarator [opt]
7598 Returns the TYPE allocated. If the new-type-id indicates an array
7599 type, *NELTS is set to the number of elements in the last array
7600 bound; the TYPE will not include the last array bound. */
7602 static tree
7604 {
7605 cp_decl_specifier_seq type_specifier_seq;
7611 /* The type-specifier sequence must not contain type definitions.
7612 (It cannot contain declarations of new types either, but if they
7613 are not definitions we will catch that because they are not
7614 complete.) */
7616 parser->type_definition_forbidden_message
7618 /* Parse the type-specifier-seq. */
7622 /* Restore the old message. */
7628 /* Parse the new-declarator. */
7631 /* Determine the number of elements in the last array dimension, if
7632 any. */
7634 /* Skip down to the last array dimension. */
7639 {
7642 }
7647 {
7650 }
7653 {
7660 else
7662 }
7665 }
7667 /* Parse an (optional) new-declarator.
7669 new-declarator:
7670 ptr-operator new-declarator [opt]
7671 direct-new-declarator
7673 Returns the declarator. */
7677 {
7680 cp_cv_quals cv_quals;
7682 /* We don't know if there's a ptr-operator next, or not. */
7684 /* Look for a ptr-operator. */
7686 /* If that worked, look for more new-declarators. */
7688 {
7691 /* Parse another optional declarator. */
7694 declarator = cp_parser_make_indirect_declarator
7698 }
7700 /* If the next token is a `[', there is a direct-new-declarator. */
7705 }
7707 /* Parse a direct-new-declarator.
7709 direct-new-declarator:
7710 [ expression ]
7711 direct-new-declarator [constant-expression]
7713 */
7717 {
7721 {
7722 tree expression;
7725 /* Look for the opening `['. */
7730 /* The standard requires that the expression have integral
7731 type. DR 74 adds enumeration types. We believe that the
7732 real intent is that these expressions be handled like the
7733 expression in a `switch' condition, which also allows
7734 classes with a single conversion to integral or
7735 enumeration type. */
7737 {
7738 expression
7740 expression,
7743 {
7745 "expression in new-declarator must have integral "
7748 }
7749 }
7751 /* Look for the closing `]'. */
7754 /* Add this bound to the declarator. */
7757 /* If the next token is not a `[', then there are no more
7758 bounds. */
7761 }
7764 }
7766 /* Parse a new-initializer.
7768 new-initializer:
7769 ( expression-list [opt] )
7770 braced-init-list
7772 Returns a representation of the expression-list. */
7776 {
7780 {
7781 tree t;
7788 }
7789 else
7790 expression_list = (cp_parser_parenthesized_expression_list
7796 }
7798 /* Parse a delete-expression.
7800 delete-expression:
7801 :: [opt] delete cast-expression
7802 :: [opt] delete [ ] cast-expression
7804 Returns a representation of the expression. */
7806 static tree
7808 {
7811 tree expression;
7813 /* Look for the optional `::' operator. */
7814 global_scope_p
7818 /* Look for the `delete' keyword. */
7820 /* See if the array syntax is in use. */
7822 {
7823 /* Consume the `[' token. */
7825 /* Look for the `]' token. */
7827 /* Remember that this is the `[]' construct. */
7829 }
7830 else
7833 /* Parse the cast-expression. */
7836 /* A delete-expression may not appear in an integral constant
7837 expression. */
7842 tf_warning_or_error);
7843 }
7845 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7846 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7847 0 otherwise. */
7849 static int
7851 {
7854 {
7896 /* In ((type ()) () the last () isn't a valid cast-expression,
7897 so the whole must be parsed as postfix-expression. */
7902 /* '[' may start a primary-expression in obj-c++ and in C++11,
7903 as a lambda-expression, eg, '(void)[]{}'. */
7910 /* '++' and '--' may or may not start a cast-expression:
7912 struct T { void operator++(int); };
7913 void f() { (T())++; }
7915 vs
7917 int a;
7918 (int)++a; */
7923 }
7924 }
7926 /* Parse a cast-expression.
7928 cast-expression:
7929 unary-expression
7930 ( type-id ) cast-expression
7932 ADDRESS_P is true iff the unary-expression is appearing as the
7933 operand of the `&' operator. CAST_P is true if this expression is
7934 the target of a cast.
7936 Returns a representation of the expression. */
7938 static tree
7941 {
7942 /* If it's a `(', then we might be looking at a cast. */
7944 {
7950 /* There's no way to know yet whether or not this is a cast.
7951 For example, `(int (3))' is a unary-expression, while `(int)
7952 3' is a cast. So, we resort to parsing tentatively. */
7954 /* Types may not be defined in a cast. */
7956 parser->type_definition_forbidden_message
7958 /* Consume the `('. */
7960 /* A very tricky bit is that `(struct S) { 3 }' is a
7961 compound-literal (which we permit in C++ as an extension).
7962 But, that construct is not a cast-expression -- it is a
7963 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7964 is legal; if the compound-literal were a cast-expression,
7965 you'd need an extra set of parentheses.) But, if we parse
7966 the type-id, and it happens to be a class-specifier, then we
7967 will commit to the parse at that point, because we cannot
7968 undo the action that is done when creating a new class. So,
7969 then we cannot back up and do a postfix-expression.
7971 Another tricky case is the following (c++/29234):
7973 struct S { void operator () (); };
7975 void foo ()
7976 {
7977 ( S()() );
7978 }
7980 As a type-id we parse the parenthesized S()() as a function
7981 returning a function, groktypename complains and we cannot
7982 back up in this case either.
7984 Therefore, we scan ahead to the closing `)', and check to see
7985 if the tokens after the `)' can start a cast-expression. Otherwise
7986 we are dealing with an unary-expression, a postfix-expression
7987 or something else.
7989 Yet another tricky case, in C++11, is the following (c++/54891):
7991 (void)[]{};
7993 The issue is that usually, besides the case of lambda-expressions,
7994 the parenthesized type-id cannot be followed by '[', and, eg, we
7995 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7996 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7997 we don't commit, we try a cast-expression, then an unary-expression.
7999 Save tokens so that we can put them back. */
8002 /* We may be looking at a cast-expression. */
8005 cast_expression
8008 /* Roll back the tokens we skipped. */
8010 /* If we aren't looking at a cast-expression, simulate an error so
8011 that the call to cp_parser_error_occurred below returns true. */
8014 else
8015 {
8018 /* Look for the type-id. */
8020 /* Look for the closing `)'. */
8023 }
8025 /* Restore the saved message. */
8028 /* At this point this can only be either a cast or a
8029 parenthesized ctor such as `(T ())' that looks like a cast to
8030 function returning T. */
8032 {
8033 /* Only commit if the cast-expression doesn't start with
8034 '++', '--', or '[' in C++11. */
8042 pidk);
8045 {
8046 /* Warn about old-style casts, if so requested. */
8053 /* Only type conversions to integral or enumeration types
8054 can be used in constant-expressions. */
8057 NIC_CAST))
8060 /* Perform the cast. */
8063 }
8064 }
8065 else
8067 }
8069 /* If we get here, then it's not a cast, so it must be a
8070 unary-expression. */
8073 }
8075 /* Parse a binary expression of the general form:
8077 pm-expression:
8078 cast-expression
8079 pm-expression .* cast-expression
8080 pm-expression ->* cast-expression
8082 multiplicative-expression:
8083 pm-expression
8084 multiplicative-expression * pm-expression
8085 multiplicative-expression / pm-expression
8086 multiplicative-expression % pm-expression
8088 additive-expression:
8089 multiplicative-expression
8090 additive-expression + multiplicative-expression
8091 additive-expression - multiplicative-expression
8093 shift-expression:
8094 additive-expression
8095 shift-expression << additive-expression
8096 shift-expression >> additive-expression
8098 relational-expression:
8099 shift-expression
8100 relational-expression < shift-expression
8101 relational-expression > shift-expression
8102 relational-expression <= shift-expression
8103 relational-expression >= shift-expression
8105 GNU Extension:
8107 relational-expression:
8108 relational-expression <? shift-expression
8109 relational-expression >? shift-expression
8111 equality-expression:
8112 relational-expression
8113 equality-expression == relational-expression
8114 equality-expression != relational-expression
8116 and-expression:
8117 equality-expression
8118 and-expression & equality-expression
8120 exclusive-or-expression:
8121 and-expression
8122 exclusive-or-expression ^ and-expression
8124 inclusive-or-expression:
8125 exclusive-or-expression
8126 inclusive-or-expression | exclusive-or-expression
8128 logical-and-expression:
8129 inclusive-or-expression
8130 logical-and-expression && inclusive-or-expression
8132 logical-or-expression:
8133 logical-and-expression
8134 logical-or-expression || logical-and-expression
8136 All these are implemented with a single function like:
8138 binary-expression:
8139 simple-cast-expression
8140 binary-expression <token> binary-expression
8142 CAST_P is true if this expression is the target of a cast.
8144 The binops_by_token map is used to get the tree codes for each <token> type.
8145 binary-expressions are associated according to a precedence table. */
8147 #define TOKEN_PRECEDENCE(token) \
8148 (((token->type == CPP_GREATER \
8149 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8150 && !parser->greater_than_is_operator_p) \
8151 ? PREC_NOT_OPERATOR \
8152 : binops_by_token[token->type].prec)
8154 static tree
8160 {
8161 cp_parser_expression_stack stack;
8163 cp_parser_expression_stack_entry current;
8164 tree rhs;
8168 tree overload;
8170 /* Parse the first expression. */
8181 {
8182 /* Get an operator token. */
8188 {
8190 "%<>>%> operator is treated"
8194 }
8198 /* Popping an entry off the stack means we completed a subexpression:
8199 - either we found a token which is not an operator (`>' where it is not
8200 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8201 will happen repeatedly;
8202 - or, we found an operator which has lower priority. This is the case
8203 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8204 parsing `3 * 4'. */
8206 {
8209 else
8211 }
8213 get_rhs:
8217 /* We used the operator token. */
8220 /* For "false && x" or "true || x", x will never be executed;
8221 disable warnings while evaluating it. */
8227 /* Extract another operand. It may be the RHS of this expression
8228 or the LHS of a new, higher priority expression. */
8233 /* Get another operator token. Look up its precedence to avoid
8234 building a useless (immediately popped) stack entry for common
8235 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8239 {
8240 /* ... and prepare to parse the RHS of the new, higher priority
8241 expression. Since precedence levels on the stack are
8242 monotonically increasing, we do not have to care about
8243 stack overflows. */
8252 pop:
8254 /* If the stack is not empty, we have parsed into LHS the right side
8255 (`4' in the example above) of an expression we had suspended.
8256 We can use the information on the stack to recover the LHS (`3')
8257 from the stack together with the tree code (`MULT_EXPR'), and
8258 the precedence of the higher level subexpression
8259 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8260 which will be used to actually build the additive expression. */
8265 }
8267 /* Undo the disabling of warnings done above. */
8276 /* Avoid warning for !!x == y. */
8281 /* Avoid warning for !b == y where b is boolean. */
8285 /* Avoid warning for !!b == y where b is boolean. */
8293 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8294 ERROR_MARK for everything that is not a binary expression.
8295 This makes warn_about_parentheses miss some warnings that
8296 involve unary operators. For unary expressions we should
8297 pass the correct tree_code unless the unary expression was
8298 surrounded by parentheses.
8299 */
8305 == tcc_comparison
8308 else
8317 /* If the binary operator required the use of an overloaded operator,
8318 then this expression cannot be an integral constant-expression.
8319 An overloaded operator can be used even if both operands are
8320 otherwise permissible in an integral constant-expression if at
8321 least one of the operands is of enumeration type. */
8325 NIC_OVERLOADED))
8327 }
8330 }
8332 static tree
8337 {
8340 }
8342 /* Parse the `? expression : assignment-expression' part of a
8343 conditional-expression. The LOGICAL_OR_EXPR is the
8344 logical-or-expression that started the conditional-expression.
8345 Returns a representation of the entire conditional-expression.
8347 This routine is used by cp_parser_assignment_expression.
8349 ? expression : assignment-expression
8351 GNU Extensions:
8353 ? : assignment-expression */
8355 static tree
8357 {
8358 tree expr;
8359 tree assignment_expr;
8363 /* Consume the `?' token. */
8368 {
8371 /* Implicit true clause. */
8375 }
8376 else
8377 {
8380 /* Parse the expression. */
8383 c_inhibit_evaluation_warnings +=
8387 }
8389 /* The next token should be a `:'. */
8391 /* Parse the assignment-expression. */
8395 /* Build the conditional-expression. */
8397 expr,
8398 assignment_expr,
8399 tf_warning_or_error);
8400 }
8402 /* Parse an assignment-expression.
8404 assignment-expression:
8405 conditional-expression
8406 logical-or-expression assignment-operator assignment_expression
8407 throw-expression
8409 CAST_P is true if this expression is the target of a cast.
8410 DECLTYPE_P is true if this expression is the operand of decltype.
8412 Returns a representation for the expression. */
8414 static tree
8417 {
8418 tree expr;
8420 /* If the next token is the `throw' keyword, then we're looking at
8421 a throw-expression. */
8424 /* Otherwise, it must be that we are looking at a
8425 logical-or-expression. */
8426 else
8427 {
8428 /* Parse the binary expressions (logical-or-expression). */
8430 decltype_p,
8432 /* If the next token is a `?' then we're actually looking at a
8433 conditional-expression. */
8436 else
8437 {
8440 /* If it's an assignment-operator, we're using the second
8441 production. */
8442 enum tree_code assignment_operator
8445 {
8447 location_t saved_input_location;
8449 /* Parse the right-hand side of the assignment. */
8455 /* An assignment may not appear in a
8456 constant-expression. */
8458 NIC_ASSIGNMENT))
8460 /* Build the assignment expression. Its default
8461 location is the location of the '=' token. */
8465 assignment_operator,
8466 rhs,
8469 }
8470 }
8471 }
8474 }
8476 /* Parse an (optional) assignment-operator.
8478 assignment-operator: one of
8479 = *= /= %= += -= >>= <<= &= ^= |=
8481 GNU Extension:
8483 assignment-operator: one of
8484 <?= >?=
8486 If the next token is an assignment operator, the corresponding tree
8487 code is returned, and the token is consumed. For example, for
8488 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8489 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8490 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8491 operator, ERROR_MARK is returned. */
8493 static enum tree_code
8495 {
8499 /* Peek at the next token. */
8503 {
8549 /* Nothing else is an assignment operator. */
8551 }
8553 /* If it was an assignment operator, consume it. */
8558 }
8560 /* Parse an expression.
8562 expression:
8563 assignment-expression
8564 expression , assignment-expression
8566 CAST_P is true if this expression is the target of a cast.
8567 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8568 except possibly parenthesized or on the RHS of a comma (N3276).
8570 Returns a representation of the expression. */
8572 static tree
8575 {
8580 {
8581 tree assignment_expression;
8583 /* Parse the next assignment-expression. */
8584 assignment_expression
8587 /* We don't create a temporary for a call that is the immediate operand
8588 of decltype or on the RHS of a comma. But when we see a comma, we
8589 need to create a temporary for a call on the LHS. */
8594 assignment_expression
8598 /* If this is the first assignment-expression, we can just
8599 save it away. */
8602 else
8604 assignment_expression,
8606 /* If the next token is not a comma, then we are done with the
8607 expression. */
8610 /* Consume the `,'. */
8613 /* A comma operator cannot appear in a constant-expression. */
8616 }
8619 }
8621 /* Parse a constant-expression.
8623 constant-expression:
8624 conditional-expression
8626 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8627 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8628 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8629 is false, NON_CONSTANT_P should be NULL. */
8631 static tree
8635 {
8639 tree expression;
8641 /* It might seem that we could simply parse the
8642 conditional-expression, and then check to see if it were
8643 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8644 one that the compiler can figure out is constant, possibly after
8645 doing some simplifications or optimizations. The standard has a
8646 precise definition of constant-expression, and we must honor
8647 that, even though it is somewhat more restrictive.
8649 For example:
8651 int i[(2, 3)];
8653 is not a legal declaration, because `(2, 3)' is not a
8654 constant-expression. The `,' operator is forbidden in a
8655 constant-expression. However, GCC's constant-folding machinery
8656 will fold this operation to an INTEGER_CST for `3'. */
8658 /* Save the old settings. */
8660 saved_allow_non_integral_constant_expression_p
8663 /* We are now parsing a constant-expression. */
8665 parser->allow_non_integral_constant_expression_p
8668 /* Although the grammar says "conditional-expression", we parse an
8669 "assignment-expression", which also permits "throw-expression"
8670 and the use of assignment operators. In the case that
8671 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8672 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8673 actually essential that we look for an assignment-expression.
8674 For example, cp_parser_initializer_clauses uses this function to
8675 determine whether a particular assignment-expression is in fact
8676 constant. */
8678 /* Restore the old settings. */
8679 parser->integral_constant_expression_p
8681 parser->allow_non_integral_constant_expression_p
8684 {
8685 /* Require an rvalue constant expression here; that's what our
8686 callers expect. Reference constant expressions are handled
8687 separately in e.g. cp_parser_template_argument. */
8692 }
8695 parser->non_integral_constant_expression_p
8699 }
8701 /* Parse __builtin_offsetof.
8703 offsetof-expression:
8704 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8706 offsetof-member-designator:
8707 id-expression
8708 | offsetof-member-designator "." id-expression
8709 | offsetof-member-designator "[" expression "]"
8710 | offsetof-member-designator "->" id-expression */
8712 static tree
8714 {
8717 cp_id_kind dummy;
8720 /* We're about to accept non-integral-constant things, but will
8721 definitely yield an integral constant expression. Save and
8722 restore these values around our local parsing. */
8726 /* Consume the "__builtin_offsetof" token. */
8728 /* Consume the opening `('. */
8730 /* Parse the type-id. */
8733 /* Look for the `,'. */
8737 /* Build the (type *)null that begins the traditional offsetof macro. */
8739 tf_warning_or_error);
8741 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8745 {
8748 {
8750 /* offsetof-member-designator "[" expression "]" */
8756 /* offsetof-member-designator "->" identifier */
8759 /* FALLTHRU */
8762 /* offsetof-member-designator "." identifier */
8770 /* Consume the ")" token. */
8775 /* Error. We know the following require will fail, but
8776 that gives the proper error message. */
8781 }
8782 }
8784 success:
8787 failure:
8792 }
8794 /* Parse a trait expression.
8796 Returns a representation of the expression, the underlying type
8797 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8799 static tree
8801 {
8802 cp_trait_kind kind;
8808 {
8892 }
8894 /* Consume the token. */
8905 {
8912 }
8914 {
8916 {
8920 {
8923 }
8927 }
8928 }
8932 /* Complete the trait expression, which may mean either processing
8933 the trait expr now or saving it for template instantiation. */
8935 {
8944 }
8945 }
8947 /* Lambdas that appear in variable initializer or default argument scope
8948 get that in their mangling, so we need to record it. We might as well
8949 use the count for function and namespace scopes as well. */
8953 {
8954 tree t;
8959 static void
8961 {
8962 tree_int ti;
8964 /* Once we're inside a function, we ignore other scopes and just push
8965 the function again so that popping works properly. */
8972 {
8973 /* Don't reset the count if we're still in the same function. */
8976 }
8977 }
8979 static void
8981 {
8984 }
8986 static void
8988 {
8991 {
8994 }
8996 }
8998 /* Parse a lambda expression.
9000 lambda-expression:
9001 lambda-introducer lambda-declarator [opt] compound-statement
9003 Returns a representation of the expression. */
9005 static tree
9007 {
9009 tree type;
9017 {
9019 {
9023 }
9025 }
9027 {
9029 {
9032 }
9034 }
9036 /* We may be in the middle of deferred access check. Disable
9037 it now. */
9048 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9051 /* Now that we've started the type, add the capture fields for any
9052 explicit captures. */
9055 {
9056 /* Inside the class, surrounding template-parameter-lists do not apply. */
9057 unsigned int saved_num_template_parameter_lists
9061 bool fully_implicit_function_template_p
9065 bool auto_is_implicit_function_template_parm_p
9076 /* By virtue of defining a local class, a lambda expression has access to
9077 the private variables of enclosing classes. */
9082 {
9088 }
9090 {
9093 }
9095 /* The capture list was built up in reverse order; fix that now. */
9107 parser->fully_implicit_function_template_p
9111 parser->auto_is_implicit_function_template_parm_p
9113 }
9117 /* This field is only used during parsing of the lambda. */
9120 /* This lambda shouldn't have any proxies left at this point. */
9122 /* And now that we're done, push proxies for an enclosing lambda. */
9127 else
9133 }
9135 /* Parse the beginning of a lambda expression.
9137 lambda-introducer:
9138 [ lambda-capture [opt] ]
9140 LAMBDA_EXPR is the current representation of the lambda expression. */
9142 static void
9144 {
9145 /* Need commas after the first capture. */
9148 /* Eat the leading `['. */
9151 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9159 {
9162 }
9165 {
9167 tree capture_id;
9168 tree capture_init_expr;
9172 enum capture_kind_type
9173 {
9174 BY_COPY,
9175 BY_REFERENCE
9176 };
9180 {
9183 }
9187 else
9190 /* Possibly capture `this'. */
9192 {
9202 explicit_init_p);
9204 }
9206 /* Remember whether we want to capture as a reference or not. */
9208 {
9211 }
9213 /* Get the identifier. */
9218 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9219 delimiters, but I modified this to stop on unnested ']' as well. It
9220 was already changed to stop on unnested '}', so the
9221 "closing_parenthesis" name is no more misleading with my change. */
9222 {
9228 }
9230 /* Find the initializer for this capture. */
9234 {
9236 /* An explicit initializer exists. */
9239 "lambda capture initializers "
9245 {
9248 }
9249 }
9250 else
9251 {
9254 /* Turn the identifier into an id-expression. */
9255 capture_init_expr
9260 {
9263 }
9267 {
9270 capture_init_expr);
9273 }
9276 {
9279 capture_init_expr))
9282 }
9284 capture_init_expr
9285 = finish_id_expression
9287 capture_init_expr,
9301 {
9304 }
9305 else
9307 }
9311 {
9316 capture_id);
9320 "capture of %qD redundant with by-reference capture "
9322 }
9325 capture_id,
9326 capture_init_expr,
9328 explicit_init_p);
9329 }
9332 }
9334 /* Parse the (optional) middle of a lambda expression.
9336 lambda-declarator:
9337 < template-parameter-list [opt] >
9338 ( parameter-declaration-clause [opt] )
9339 attribute-specifier [opt]
9340 mutable [opt]
9341 exception-specification [opt]
9342 lambda-return-type-clause [opt]
9344 LAMBDA_EXPR is the current representation of the lambda expression. */
9346 static bool
9348 {
9349 /* 5.1.1.4 of the standard says:
9350 If a lambda-expression does not include a lambda-declarator, it is as if
9351 the lambda-declarator were ().
9352 This means an empty parameter list, no attributes, and no exception
9353 specification. */
9359 /* The template-parameter-list is optional, but must begin with
9360 an opening angle if present. */
9362 {
9365 "lambda templates are only available with "
9374 /* We just processed one more parameter list. */
9376 }
9378 /* The parameter-declaration-clause is optional (unless
9379 template-parameter-list was given), but must begin with an
9380 opening parenthesis if present. */
9382 {
9387 /* Parse parameters. */
9390 /* Default arguments shall not be specified in the
9391 parameter-declaration-clause of a lambda-declarator. */
9401 /* Parse optional `mutable' keyword. */
9403 {
9406 }
9408 /* Parse optional exception specification. */
9411 /* Parse optional trailing return type. */
9413 {
9417 }
9419 /* The function parameters must be in scope all the way until after the
9420 trailing-return-type in case of decltype. */
9422 }
9426 /* Create the function call operator.
9428 Messing with declarators like this is no uglier than building up the
9429 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9430 other code. */
9431 {
9432 cp_decl_specifier_seq return_type_specs;
9434 tree fco;
9441 else
9442 /* Maybe we will deduce the return type later. */
9448 sfk_none);
9453 VIRT_SPEC_UNSPECIFIED,
9454 REF_QUAL_NONE,
9455 exception_spec,
9460 declarator,
9461 attributes);
9463 {
9466 /* Give the object parameter a different name. */
9470 }
9472 {
9476 }
9485 }
9486 }
9488 /* Parse the body of a lambda expression, which is simply
9490 compound-statement
9492 but which requires special handling.
9493 LAMBDA_EXPR is the current representation of the lambda expression. */
9495 static void
9497 {
9502 else
9503 /* Still increment function_depth so that we don't GC in the
9504 middle of an expression. */
9506 /* Clear this in case we're in the middle of a default argument. */
9509 /* Finish the function call operator
9510 - class_specifier
9511 + late_parsing_for_member
9512 + function_definition_after_declarator
9513 + ctor_initializer_opt_and_function_body */
9514 {
9516 tree body;
9518 tree compound_stmt;
9519 tree cap;
9521 /* Let the front end know that we are going to be defining this
9522 function. */
9524 NULL_TREE,
9533 /* Push the proxies for any explicit captures. */
9540 /* 5.1.1.4 of the standard says:
9541 If a lambda-expression does not include a trailing-return-type, it
9542 is as if the trailing-return-type denotes the following type:
9543 * if the compound-statement is of the form
9544 { return attribute-specifier [opt] expression ; }
9545 the type of the returned expression after lvalue-to-rvalue
9546 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9547 (_conv.array_ 4.2), and function-to-pointer conversion
9548 (_conv.func_ 4.3);
9549 * otherwise, void. */
9551 /* In a lambda that has neither a lambda-return-type-clause
9552 nor a deducible form, errors should be reported for return statements
9553 in the body. Since we used void as the placeholder return type, parsing
9554 the body as usual will give such desired behavior. */
9558 {
9562 /* Parse tentatively in case there's more after the initial return
9563 statement. */
9574 {
9578 /* Will get error here if type not deduced yet. */
9582 }
9583 }
9586 {
9591 }
9595 out:
9599 /* Finish the function and generate code for it if necessary. */
9602 /* Only expand if the call op is not a template. */
9605 }
9610 else
9612 }
9614 /* Statements [gram.stmt.stmt] */
9616 /* Parse a statement.
9618 statement:
9619 labeled-statement
9620 expression-statement
9621 compound-statement
9622 selection-statement
9623 iteration-statement
9624 jump-statement
9625 declaration-statement
9626 try-block
9628 C++11:
9630 statement:
9631 labeled-statement
9632 attribute-specifier-seq (opt) expression-statement
9633 attribute-specifier-seq (opt) compound-statement
9634 attribute-specifier-seq (opt) selection-statement
9635 attribute-specifier-seq (opt) iteration-statement
9636 attribute-specifier-seq (opt) jump-statement
9637 declaration-statement
9638 attribute-specifier-seq (opt) try-block
9640 TM Extension:
9642 statement:
9643 atomic-statement
9645 IN_COMPOUND is true when the statement is nested inside a
9646 cp_parser_compound_statement; this matters for certain pragmas.
9648 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9649 is a (possibly labeled) if statement which is not enclosed in braces
9650 and has an else clause. This is used to implement -Wparentheses. */
9652 static void
9655 {
9660 restart:
9663 /* There is no statement yet. */
9669 /* In obj-c++, seeing '[[' might be the either the beginning of
9670 c++11 attributes, or a nested objc-message-expression. So
9671 let's parse the c++11 attributes tentatively. */
9675 {
9678 }
9680 /* Peek at the next token. */
9682 /* Remember the location of the first token in the statement. */
9684 /* If this is a keyword, then that will often determine what kind of
9685 statement we have. */
9687 {
9691 {
9694 /* Looks like a labeled-statement with a case label.
9695 Parse the label, and then use tail recursion to parse
9696 the statement. */
9713 {
9718 }
9719 else
9733 {
9738 }
9739 else
9740 {
9744 }
9748 /* Objective-C++ exception-handling constructs. */
9762 /* This must be a namespace alias definition. */
9775 /* It might be a keyword like `int' that can start a
9776 declaration-statement. */
9778 }
9779 }
9781 {
9782 /* If the next token is a `:', then we are looking at a
9783 labeled-statement. */
9786 {
9787 /* Looks like a labeled-statement with an ordinary label.
9788 Parse the label, and then use tail recursion to parse
9789 the statement. */
9793 }
9794 }
9795 /* Anything that starts with a `{' must be a compound-statement. */
9798 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9799 a statement all its own. */
9801 {
9802 /* Only certain OpenMP pragmas are attached to statements, and thus
9803 are considered statements themselves. All others are not. In
9804 the context of a compound, accept the pragma as a "statement" and
9805 return so that we can check for a close brace. Otherwise we
9806 require a real statement and must go back and read one. */
9812 }
9814 {
9817 }
9819 /* Everything else must be a declaration-statement or an
9820 expression-statement. Try for the declaration-statement
9821 first, unless we are looking at a `;', in which case we know that
9822 we have an expression-statement. */
9824 {
9826 {
9828 {
9829 /* Attributes should be parsed as part of the the
9830 declaration, so let's un-parse them. */
9833 }
9836 /* Try to parse the declaration-statement. */
9838 /* If that worked, we're done. */
9841 }
9842 /* Look for an expression-statement instead. */
9844 }
9846 /* Set the line number for the statement. */
9850 /* Note that for now, we don't do anything with c++11 statements
9851 parsed at this level. */
9854 OPT_Wattributes,
9856 }
9858 /* Parse the label for a labeled-statement, i.e.
9860 identifier :
9861 case constant-expression :
9862 default :
9864 GNU Extension:
9865 case constant-expression ... constant-expression : statement
9867 When a label is parsed without errors, the label is added to the
9868 parse tree by the finish_* functions, so this function doesn't
9869 have to return the label. */
9871 static void
9873 {
9878 /* The next token should be an identifier. */
9882 {
9885 }
9889 {
9891 {
9895 /* Consume the `case' token. */
9897 /* Parse the constant-expression. */
9904 {
9905 /* Consume the `...' token. */
9911 /* We don't need to emit warnings here, as the common code
9912 will do this for us. */
9913 }
9914 else
9919 else
9922 expr);
9923 }
9927 /* Consume the `default' token. */
9932 else
9937 /* Anything else must be an ordinary label. */
9940 }
9942 /* Require the `:' token. */
9945 /* An ordinary label may optionally be followed by attributes.
9946 However, this is only permitted if the attributes are then
9947 followed by a semicolon. This is because, for backward
9948 compatibility, when parsing
9949 lab: __attribute__ ((unused)) int i;
9950 we want the attribute to attach to "i", not "lab". */
9953 {
9954 tree attrs;
9961 ;
9962 else
9964 }
9970 }
9972 /* Parse an expression-statement.
9974 expression-statement:
9975 expression [opt] ;
9977 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9978 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9979 indicates whether this expression-statement is part of an
9980 expression statement. */
9982 static tree
9984 {
9988 /* If the next token is a ';', then there is no expression
9989 statement. */
9991 {
9995 {
9998 }
9999 }
10001 /* Give a helpful message for "A<T>::type t;" and the like. */
10004 {
10011 {
10012 /* A::A a; */
10017 }
10018 }
10020 /* Consume the final `;'. */
10025 /* This is the final expression statement of a statement
10026 expression. */
10032 }
10034 /* Parse a compound-statement.
10036 compound-statement:
10037 { statement-seq [opt] }
10039 GNU extension:
10041 compound-statement:
10042 { label-declaration-seq [opt] statement-seq [opt] }
10044 label-declaration-seq:
10045 label-declaration
10046 label-declaration-seq label-declaration
10048 Returns a tree representing the statement. */
10050 static tree
10053 {
10054 tree compound_stmt;
10056 /* Consume the `{'. */
10063 /* Begin the compound-statement. */
10065 /* If the next keyword is `__label__' we have a label declaration. */
10068 /* Parse an (optional) statement-seq. */
10070 /* Finish the compound-statement. */
10072 /* Consume the `}'. */
10076 }
10078 /* Parse an (optional) statement-seq.
10080 statement-seq:
10081 statement
10082 statement-seq [opt] statement */
10084 static void
10086 {
10087 /* Scan statements until there aren't any more. */
10089 {
10092 /* If we are looking at a `}', then we have run out of
10093 statements; the same is true if we have reached the end
10094 of file, or have stumbled upon a stray '@end'. */
10101 /* If we are in a compound statement and find 'else' then
10102 something went wrong. */
10104 {
10107 else
10108 {
10111 }
10112 }
10114 /* Parse the statement. */
10116 }
10117 }
10119 /* Parse a selection-statement.
10121 selection-statement:
10122 if ( condition ) statement
10123 if ( condition ) statement else statement
10124 switch ( condition ) statement
10126 Returns the new IF_STMT or SWITCH_STMT.
10128 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10129 is a (possibly labeled) if statement which is not enclosed in
10130 braces and has an else clause. This is used to implement
10131 -Wparentheses. */
10133 static tree
10135 {
10142 /* Peek at the next token. */
10145 /* See what kind of keyword it is. */
10148 {
10151 {
10152 tree statement;
10153 tree condition;
10155 /* Look for the `('. */
10157 {
10160 }
10162 /* Begin the selection-statement. */
10165 else
10168 /* Parse the condition. */
10170 /* Look for the `)'. */
10176 {
10180 /* Add the condition. */
10183 /* Parse the then-clause. */
10187 {
10195 }
10196 else
10202 /* If the next token is `else', parse the else-clause. */
10204 RID_ELSE))
10205 {
10206 /* Consume the `else' keyword. */
10209 /* Parse the else-clause. */
10211 {
10212 location_t loc;
10219 }
10220 else
10225 /* If we are currently parsing a then-clause, then
10226 IF_P will not be NULL. We set it to true to
10227 indicate that this if statement has an else clause.
10228 This may trigger the Wparentheses warning below
10229 when we get back up to the parent if statement. */
10232 }
10233 else
10234 {
10235 /* This if statement does not have an else clause. If
10236 NESTED_IF is true, then the then-clause is an if
10237 statement which does have an else clause. We warn
10238 about the potential ambiguity. */
10241 "suggest explicit braces to avoid ambiguous"
10243 }
10245 /* Now we're all done with the if-statement. */
10247 }
10248 else
10249 {
10253 /* Add the condition. */
10256 /* Parse the body of the switch-statement. */
10265 /* Now we're all done with the switch-statement. */
10267 }
10270 }
10276 }
10277 }
10279 /* Parse a condition.
10281 condition:
10282 expression
10283 type-specifier-seq declarator = initializer-clause
10284 type-specifier-seq declarator braced-init-list
10286 GNU Extension:
10288 condition:
10289 type-specifier-seq declarator asm-specification [opt]
10290 attributes [opt] = assignment-expression
10292 Returns the expression that should be tested. */
10294 static tree
10296 {
10297 cp_decl_specifier_seq type_specifiers;
10301 /* Try the declaration first. */
10303 /* New types are not allowed in the type-specifier-seq for a
10304 condition. */
10306 parser->type_definition_forbidden_message
10308 /* Parse the type-specifier-seq. */
10310 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10313 /* Restore the saved message. */
10315 /* If all is well, we might be looking at a declaration. */
10317 {
10318 tree decl;
10319 tree asm_specification;
10320 tree attributes;
10324 /* Parse the declarator. */
10330 /* Parse the attributes. */
10332 /* Parse the asm-specification. */
10334 /* If the next token is not an `=' or '{', then we might still be
10335 looking at an expression. For example:
10337 if (A(a).x)
10339 looks like a decl-specifier-seq and a declarator -- but then
10340 there is no `=', so this is an expression. */
10345 /* If we did see an `=' or '{', then we are looking at a declaration
10346 for sure. */
10348 {
10349 tree pushed_scope;
10353 /* Create the declaration. */
10359 /* Parse the initializer. */
10361 {
10365 }
10366 else
10367 {
10368 /* Consume the `='. */
10371 }
10375 /* Process the initializer. */
10378 asm_specification,
10379 flags);
10385 }
10386 }
10387 /* If we didn't even get past the declarator successfully, we are
10388 definitely not looking at a declaration. */
10389 else
10392 /* Otherwise, we are looking at an expression. */
10394 }
10396 /* Parses a for-statement or range-for-statement until the closing ')',
10397 not included. */
10399 static tree
10401 {
10405 /* Begin the for-statement. */
10408 /* Parse the initialization. */
10413 else
10415 }
10417 static tree
10419 {
10420 /* Normal for loop */
10423 tree stmt;
10426 /* The for-init-statement has already been parsed in
10427 cp_parser_for_init_statement, so no work is needed here. */
10430 /* If there's a condition, process it. */
10434 {
10438 }
10440 /* Look for the `;'. */
10443 /* If there's an expression, process it. */
10449 }
10451 /* Tries to parse a range-based for-statement:
10453 range-based-for:
10454 decl-specifier-seq declarator : expression
10456 The decl-specifier-seq declarator and the `:' are already parsed by
10457 cp_parser_for_init_statement. If processing_template_decl it returns a
10458 newly created RANGE_FOR_STMT; if not, it is converted to a
10459 regular FOR_STMT. */
10461 static tree
10464 {
10468 {
10471 }
10472 else
10475 /* If in template, STMT is converted to a normal for-statement
10476 at instantiation. If not, it is done just ahead. */
10478 {
10486 /* do_auto_deduction doesn't mess with template init-lists. */
10489 }
10490 else
10491 {
10494 }
10496 }
10498 /* Subroutine of cp_convert_range_for: given the initializer expression,
10499 builds up the range temporary. */
10501 static tree
10503 {
10506 /* Find out the type deduced by the declaration
10507 `auto &&__range = range_expr'. */
10512 /* Create the __range variable. */
10519 }
10521 /* Used by cp_parser_range_for in template context: we aren't going to
10522 do a full conversion yet, but we still need to resolve auto in the
10523 type of the for-range-declaration if present. This is basically
10524 a shortcut version of cp_convert_range_for. */
10526 static void
10528 {
10531 {
10534 iter_type = (cp_parser_perform_range_for_lookup
10537 {
10539 iter_type);
10541 tf_warning_or_error);
10544 }
10545 }
10546 }
10548 /* Converts a range-based for-statement into a normal
10549 for-statement, as per the definition.
10551 for (RANGE_DECL : RANGE_EXPR)
10552 BLOCK
10554 should be equivalent to:
10556 {
10557 auto &&__range = RANGE_EXPR;
10558 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10559 __begin != __end;
10560 ++__begin)
10561 {
10562 RANGE_DECL = *__begin;
10563 BLOCK
10564 }
10565 }
10567 If RANGE_EXPR is an array:
10568 BEGIN_EXPR = __range
10569 END_EXPR = __range + ARRAY_SIZE(__range)
10570 Else if RANGE_EXPR has a member 'begin' or 'end':
10571 BEGIN_EXPR = __range.begin()
10572 END_EXPR = __range.end()
10573 Else:
10574 BEGIN_EXPR = begin(__range)
10575 END_EXPR = end(__range);
10577 If __range has a member 'begin' but not 'end', or vice versa, we must
10578 still use the second alternative (it will surely fail, however).
10579 When calling begin()/end() in the third alternative we must use
10580 argument dependent lookup, but always considering 'std' as an associated
10581 namespace. */
10583 tree
10586 {
10592 /* If an error happened previously do nothing or else a lot of
10593 unhelpful errors would be issued. */
10595 else
10596 {
10597 tree range_temp;
10601 /* Can't bind a reference to an array of runtime bound. */
10603 else
10604 {
10609 LOOKUP_ONLYCONVERTING);
10611 }
10614 }
10616 /* The new for initialization statement. */
10624 LOOKUP_ONLYCONVERTING);
10633 LOOKUP_ONLYCONVERTING);
10637 /* The new for condition. */
10644 /* The new increment expression. */
10647 tf_warning_or_error);
10650 /* The declaration is initialized with *__begin inside the loop body. */
10653 tf_warning_or_error),
10655 LOOKUP_ONLYCONVERTING);
10658 }
10660 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10661 We need to solve both at the same time because the method used
10662 depends on the existence of members begin or end.
10663 Returns the type deduced for the iterator expression. */
10665 static tree
10667 {
10669 {
10672 }
10675 {
10680 }
10682 {
10683 /* If RANGE is an array, we will use pointer arithmetic. */
10686 range,
10690 }
10691 else
10692 {
10693 /* If it is not an array, we must do a bit of magic. */
10703 tf_warning_or_error);
10706 tf_warning_or_error);
10709 {
10710 /* Use the member functions. */
10713 else
10719 else
10722 }
10723 else
10724 {
10725 /* Use global functions with ADL. */
10732 tf_warning_or_error);
10734 tf_warning_or_error);
10736 tf_warning_or_error);
10738 tf_warning_or_error);
10741 }
10743 /* Last common checks. */
10745 {
10746 /* If one of the expressions is an error do no more checks. */
10749 }
10752 /* Can happen, when, eg, in a template context, Koenig lookup
10753 can't resolve begin/end (c++/58503). */
10755 else
10756 {
10758 /* The unqualified type of the __begin and __end temporaries should
10759 be the same, as required by the multiple auto declaration. */
10765 }
10766 }
10767 }
10769 /* Helper function for cp_parser_perform_range_for_lookup.
10770 Builds a tree for RANGE.IDENTIFIER(). */
10772 static tree
10774 {
10787 tf_warning_or_error);
10790 }
10792 /* Parse an iteration-statement.
10794 iteration-statement:
10795 while ( condition ) statement
10796 do statement while ( expression ) ;
10797 for ( for-init-statement condition [opt] ; expression [opt] )
10798 statement
10800 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10802 static tree
10804 {
10807 tree statement;
10810 /* Peek at the next token. */
10815 /* Remember whether or not we are already within an iteration
10816 statement. */
10819 /* See what kind of keyword it is. */
10822 {
10824 {
10825 tree condition;
10827 /* Begin the while-statement. */
10829 /* Look for the `('. */
10831 /* Parse the condition. */
10834 /* Look for the `)'. */
10836 /* Parse the dependent statement. */
10840 /* We're done with the while-statement. */
10842 }
10846 {
10847 tree expression;
10849 /* Begin the do-statement. */
10851 /* Parse the body of the do-statement. */
10856 /* Look for the `while' keyword. */
10858 /* Look for the `('. */
10860 /* Parse the expression. */
10862 /* We're done with the do-statement. */
10864 /* Look for the `)'. */
10866 /* Look for the `;'. */
10868 }
10872 {
10873 /* Look for the `('. */
10878 /* Look for the `)'. */
10881 /* Parse the body of the for-statement. */
10886 /* We're done with the for-statement. */
10888 }
10895 }
10898 }
10900 /* Parse a for-init-statement or the declarator of a range-based-for.
10901 Returns true if a range-based-for declaration is seen.
10903 for-init-statement:
10904 expression-statement
10905 simple-declaration */
10907 static bool
10909 {
10910 /* If the next token is a `;', then we have an empty
10911 expression-statement. Grammatically, this is also a
10912 simple-declaration, but an invalid one, because it does not
10913 declare anything. Therefore, if we did not handle this case
10914 specially, we would issue an error message about an invalid
10915 declaration. */
10917 {
10923 {
10924 /* N3994 -- for (id : init) ... */
10927 "type-specifier only available with "
10935 }
10937 /* A colon is used in range-based for. */
10940 /* We're going to speculatively look for a declaration, falling back
10941 to an expression, if necessary. */
10943 /* Parse the declaration. */
10946 decl);
10949 {
10950 /* It is a range-for, consume the ':' */
10954 {
10956 "range-based %<for%> loops only available with "
10959 }
10960 }
10961 else
10962 /* The ';' is not consumed yet because we told
10963 cp_parser_simple_declaration not to. */
10968 /* If the tentative parse failed, then we shall need to look for an
10969 expression-statement. */
10970 }
10971 /* If we are here, it is an expression-statement. */
10974 }
10976 /* Parse a jump-statement.
10978 jump-statement:
10979 break ;
10980 continue ;
10981 return expression [opt] ;
10982 return braced-init-list ;
10983 goto identifier ;
10985 GNU extension:
10987 jump-statement:
10988 goto * expression ;
10990 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10992 static tree
10994 {
11000 /* Peek at the next token. */
11005 /* See what kind of keyword it is. */
11008 {
11012 {
11032 }
11038 {
11045 /* Fall through. */
11055 }
11060 {
11061 tree expr;
11065 {
11069 }
11072 else
11073 /* If the next token is a `;', then there is no
11074 expression. */
11076 /* Build the return-statement. */
11078 /* Look for the final `;'. */
11080 }
11086 {
11089 }
11091 /* Create the goto-statement. */
11093 {
11094 /* Issue a warning about this use of a GNU extension. */
11096 /* Consume the '*' token. */
11098 /* Parse the dependent expression. */
11100 }
11101 else
11103 /* Look for the final `;'. */
11110 }
11113 }
11115 /* Parse a declaration-statement.
11117 declaration-statement:
11118 block-declaration */
11120 static void
11122 {
11125 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11128 /* Parse the block-declaration. */
11131 /* Free any declarators allocated. */
11133 }
11135 /* Some dependent statements (like `if (cond) statement'), are
11136 implicitly in their own scope. In other words, if the statement is
11137 a single statement (as opposed to a compound-statement), it is
11138 none-the-less treated as if it were enclosed in braces. Any
11139 declarations appearing in the dependent statement are out of scope
11140 after control passes that point. This function parses a statement,
11141 but ensures that is in its own scope, even if it is not a
11142 compound-statement.
11144 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11145 is a (possibly labeled) if statement which is not enclosed in
11146 braces and has an else clause. This is used to implement
11147 -Wparentheses.
11149 Returns the new statement. */
11151 static tree
11153 {
11154 tree statement;
11159 /* Mark if () ; with a special NOP_EXPR. */
11161 {
11165 }
11166 /* if a compound is opened, we simply parse the statement directly. */
11169 /* If the token is not a `{', then we must take special action. */
11170 else
11171 {
11172 /* Create a compound-statement. */
11174 /* Parse the dependent-statement. */
11176 /* Finish the dummy compound-statement. */
11178 }
11180 /* Return the statement. */
11182 }
11184 /* For some dependent statements (like `while (cond) statement'), we
11185 have already created a scope. Therefore, even if the dependent
11186 statement is a compound-statement, we do not want to create another
11187 scope. */
11189 static void
11191 {
11192 /* If the token is a `{', then we must take special action. */
11195 else
11196 {
11197 /* Avoid calling cp_parser_compound_statement, so that we
11198 don't create a new scope. Do everything else by hand. */
11200 /* If the next keyword is `__label__' we have a label declaration. */
11203 /* Parse an (optional) statement-seq. */
11206 }
11207 }
11209 /* Declarations [gram.dcl.dcl] */
11211 /* Parse an optional declaration-sequence.
11213 declaration-seq:
11214 declaration
11215 declaration-seq declaration */
11217 static void
11219 {
11221 {
11232 {
11233 /* A declaration consisting of a single semicolon is
11234 invalid. Allow it unless we're being pedantic. */
11239 }
11241 /* If we're entering or exiting a region that's implicitly
11242 extern "C", modify the lang context appropriately. */
11244 {
11247 }
11249 {
11252 }
11255 {
11256 /* A top-level declaration can consist solely of a #pragma.
11257 A nested declaration cannot, so this is done here and not
11258 in cp_parser_declaration. (A #pragma at block scope is
11259 handled in cp_parser_statement.) */
11262 }
11264 /* Parse the declaration itself. */
11266 }
11267 }
11269 /* Parse a declaration.
11271 declaration:
11272 block-declaration
11273 function-definition
11274 template-declaration
11275 explicit-instantiation
11276 explicit-specialization
11277 linkage-specification
11278 namespace-definition
11280 GNU extension:
11282 declaration:
11283 __extension__ declaration */
11285 static void
11287 {
11288 cp_token token1;
11289 cp_token token2;
11294 /* Check for the `__extension__' keyword. */
11296 {
11297 /* Parse the qualified declaration. */
11299 /* Restore the PEDANTIC flag. */
11303 }
11305 /* Try to figure out what kind of declaration is present. */
11310 else
11311 {
11314 }
11316 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11319 /* If the next token is `extern' and the following token is a string
11320 literal, then we have a linkage specification. */
11324 /* If the next token is `template', then we have either a template
11325 declaration, an explicit instantiation, or an explicit
11326 specialization. */
11328 {
11329 /* `template <>' indicates a template specialization. */
11333 /* `template <' indicates a template declaration. */
11336 /* Anything else must be an explicit instantiation. */
11337 else
11339 }
11340 /* If the next token is `export', then we have a template
11341 declaration. */
11344 /* If the next token is `extern', 'static' or 'inline' and the one
11345 after that is `template', we have a GNU extended explicit
11346 instantiation directive. */
11353 /* If the next token is `namespace', check for a named or unnamed
11354 namespace definition. */
11360 /* An unnamed namespace definition. */
11364 /* An inline (associated) namespace definition. */
11368 /* Objective-C++ declaration/definition. */
11375 /* We must have either a block declaration or a function
11376 definition. */
11377 else
11378 /* Try to parse a block-declaration, or a function-definition. */
11381 /* Free any declarators allocated. */
11383 }
11385 /* Parse a block-declaration.
11387 block-declaration:
11388 simple-declaration
11389 asm-definition
11390 namespace-alias-definition
11391 using-declaration
11392 using-directive
11394 GNU Extension:
11396 block-declaration:
11397 __extension__ block-declaration
11399 C++0x Extension:
11401 block-declaration:
11402 static_assert-declaration
11404 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11405 part of a declaration-statement. */
11407 static void
11410 {
11414 /* Check for the `__extension__' keyword. */
11416 {
11417 /* Parse the qualified declaration. */
11419 /* Restore the PEDANTIC flag. */
11423 }
11425 /* Peek at the next token to figure out which kind of declaration is
11426 present. */
11429 /* If the next keyword is `asm', we have an asm-definition. */
11431 {
11435 }
11436 /* If the next keyword is `namespace', we have a
11437 namespace-alias-definition. */
11440 /* If the next keyword is `using', we have a
11441 using-declaration, a using-directive, or an alias-declaration. */
11443 {
11448 /* If the token after `using' is `namespace', then we have a
11449 using-directive. */
11453 /* If the second token after 'using' is '=', then we have an
11454 alias-declaration. */
11460 /* Otherwise, it's a using-declaration. */
11461 else
11464 }
11465 /* If the next keyword is `__label__' we have a misplaced label
11466 declaration. */
11468 {
11472 /* If the next token is now a `;', consume it. */
11475 }
11476 /* If the next token is `static_assert' we have a static assertion. */
11479 /* Anything else must be a simple-declaration. */
11480 else
11483 }
11485 /* Parse a simple-declaration.
11487 simple-declaration:
11488 decl-specifier-seq [opt] init-declarator-list [opt] ;
11490 init-declarator-list:
11491 init-declarator
11492 init-declarator-list , init-declarator
11494 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11495 function-definition as a simple-declaration.
11497 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11498 parsed declaration if it is an uninitialized single declarator not followed
11499 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11500 if present, will not be consumed. */
11502 static void
11506 {
11507 cp_decl_specifier_seq decl_specifiers;
11516 /* Defer access checks until we know what is being declared; the
11517 checks for names appearing in the decl-specifier-seq should be
11518 done as if we were in the scope of the thing being declared. */
11521 /* Parse the decl-specifier-seq. We have to keep track of whether
11522 or not the decl-specifier-seq declares a named class or
11523 enumeration type, since that is the only case in which the
11524 init-declarator-list is allowed to be empty.
11526 [dcl.dcl]
11528 In a simple-declaration, the optional init-declarator-list can be
11529 omitted only when declaring a class or enumeration, that is when
11530 the decl-specifier-seq contains either a class-specifier, an
11531 elaborated-type-specifier, or an enum-specifier. */
11533 CP_PARSER_FLAGS_OPTIONAL,
11536 /* We no longer need to defer access checks. */
11539 /* In a block scope, a valid declaration must always have a
11540 decl-specifier-seq. By not trying to parse declarators, we can
11541 resolve the declaration/expression ambiguity more quickly. */
11544 {
11547 }
11549 /* If the next two tokens are both identifiers, the code is
11550 erroneous. The usual cause of this situation is code like:
11552 T t;
11554 where "T" should name a type -- but does not. */
11557 {
11558 /* If parsing tentatively, we should commit; we really are
11559 looking at a declaration. */
11561 /* Give up. */
11563 }
11565 /* If we have seen at least one decl-specifier, and the next token
11566 is not a parenthesis, then we must be looking at a declaration.
11567 (After "int (" we might be looking at a functional cast.) */
11574 /* Keep going until we hit the `;' at the end of the simple
11575 declaration. */
11578 CPP_SEMICOLON))
11579 {
11582 tree decl;
11585 {
11586 /* If we are processing next declarator, comma is expected */
11591 {
11595 }
11596 }
11597 else
11600 /* Parse the init-declarator. */
11603 function_definition_allowed_p,
11605 declares_class_or_enum,
11607 maybe_range_for_decl,
11609 /* If an error occurred while parsing tentatively, exit quickly.
11610 (That usually happens when in the body of a function; each
11611 statement is treated as a declaration-statement until proven
11612 otherwise.) */
11615 /* Handle function definitions specially. */
11617 {
11618 /* If the next token is a `,', then we are probably
11619 processing something like:
11621 void f() {}, *p;
11623 which is erroneous. */
11625 {
11628 "mixing"
11630 }
11631 /* Otherwise, we're done with the list of declarators. */
11632 else
11633 {
11636 }
11637 }
11640 /* The next token should be either a `,' or a `;'. */
11642 /* If it's a `,', there are more declarators to come. */
11645 /* If it's a `;', we are done. */
11648 /* Anything else is an error. */
11649 else
11650 {
11651 /* If we have already issued an error message we don't need
11652 to issue another one. */
11656 /* Skip tokens until we reach the end of the statement. */
11658 /* If the next token is now a `;', consume it. */
11662 }
11663 /* After the first time around, a function-definition is not
11664 allowed -- even if it was OK at first. For example:
11666 int i, f() {}
11668 is not valid. */
11670 }
11672 /* Issue an error message if no declarators are present, and the
11673 decl-specifier-seq does not itself declare a class or
11674 enumeration: [dcl.dcl]/3. */
11676 {
11678 {
11682 /* Ensure an error is issued anyway when finish_decltype_type,
11683 called via cp_parser_decl_specifier_seq, returns a class or
11684 an enumeration (c++/51786). */
11687 }
11688 /* Perform any deferred access checks. */
11690 }
11692 /* Consume the `;'. */
11696 {
11702 }
11704 done:
11706 }
11708 /* Parse a decl-specifier-seq.
11710 decl-specifier-seq:
11711 decl-specifier-seq [opt] decl-specifier
11712 decl-specifier attribute-specifier-seq [opt] (C++11)
11714 decl-specifier:
11715 storage-class-specifier
11716 type-specifier
11717 function-specifier
11718 friend
11719 typedef
11721 GNU Extension:
11723 decl-specifier:
11724 attributes
11726 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11728 The parser flags FLAGS is used to control type-specifier parsing.
11730 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11731 flags:
11733 1: one of the decl-specifiers is an elaborated-type-specifier
11734 (i.e., a type declaration)
11735 2: one of the decl-specifiers is an enum-specifier or a
11736 class-specifier (i.e., a type definition)
11738 */
11740 static void
11742 cp_parser_flags flags,
11745 {
11749 cp_decl_spec ds;
11751 /* Clear DECL_SPECS. */
11754 /* Assume no class or enumeration type is declared. */
11757 /* Keep reading specifiers until there are no more to read. */
11759 {
11764 /* Peek at the next token. */
11767 /* Save the first token of the decl spec list for error
11768 reporting. */
11771 /* Handle attributes. */
11773 {
11774 /* Parse the attributes. */
11777 /* In a sequence of declaration specifiers, c++11 attributes
11778 appertain to the type that precede them. In that case
11779 [dcl.spec]/1 says:
11781 The attribute-specifier-seq affects the type only for
11782 the declaration it appears in, not other declarations
11783 involving the same type.
11785 But for now let's force the user to position the
11786 attribute either at the beginning of the declaration or
11787 after the declarator-id, which would clearly mean that it
11788 applies to the declarator. */
11790 {
11792 /* The c++11 attribute is at the beginning of the
11793 declaration. It appertains to the entity being
11795 else
11796 {
11798 {
11799 /* This is an attribute following a
11800 class-specifier. */
11805 }
11806 else
11807 {
11808 decl_specs->std_attributes
11810 attrs);
11813 }
11815 }
11816 }
11818 decl_specs->attributes
11820 attrs);
11824 }
11825 /* Assume we will find a decl-specifier keyword. */
11827 /* If the next token is an appropriate keyword, we can simply
11828 add it to the list. */
11830 {
11831 /* decl-specifier:
11832 friend
11833 constexpr */
11836 {
11839 }
11840 else
11841 {
11843 /* Consume the token. */
11845 }
11853 /* function-specifier:
11854 inline
11855 virtual
11856 explicit */
11863 /* decl-specifier:
11864 typedef */
11867 /* Consume the token. */
11869 /* A constructor declarator cannot appear in a typedef. */
11871 /* The "typedef" keyword can only occur in a declaration; we
11872 may as well commit at this point. */
11879 /* storage-class-specifier:
11880 auto
11881 register
11882 static
11883 extern
11884 mutable
11886 GNU Extension:
11887 thread */
11890 {
11891 /* Consume the token. */
11894 /* Complain about `auto' as a storage specifier, if
11895 we're complaining about C++0x compatibility. */
11899 /* Set the storage class anyway. */
11901 token);
11902 }
11903 else
11904 /* C++0x auto type-specifier. */
11912 /* Consume the token. */
11915 token);
11918 /* Consume the token. */
11924 /* We did not yet find a decl-specifier yet. */
11927 }
11937 /* Constructors are a special case. The `S' in `S()' is not a
11938 decl-specifier; it is the beginning of the declarator. */
11939 constructor_p
11940 = (!found_decl_spec
11941 && constructor_possible_p
11942 && (cp_parser_constructor_declarator_p
11945 /* If we don't have a DECL_SPEC yet, then we must be looking at
11946 a type-specifier. */
11948 {
11951 tree type_spec;
11953 type_spec
11955 decl_specs,
11961 /* If this type-specifier referenced a user-defined type
11962 (a typedef, class-name, etc.), then we can't allow any
11963 more such type-specifiers henceforth.
11965 [dcl.spec]
11967 The longest sequence of decl-specifiers that could
11968 possibly be a type name is taken as the
11969 decl-specifier-seq of a declaration. The sequence shall
11970 be self-consistent as described below.
11972 [dcl.type]
11974 As a general rule, at most one type-specifier is allowed
11975 in the complete decl-specifier-seq of a declaration. The
11976 only exceptions are the following:
11978 -- const or volatile can be combined with any other
11979 type-specifier.
11981 -- signed or unsigned can be combined with char, long,
11982 short, or int.
11984 -- ..
11986 Example:
11988 typedef char* Pc;
11989 void g (const int Pc);
11991 Here, Pc is *not* part of the decl-specifier seq; it's
11992 the declarator. Therefore, once we see a type-specifier
11993 (other than a cv-qualifier), we forbid any additional
11994 user-defined types. We *do* still allow things like `int
11995 int' to be considered a decl-specifier-seq, and issue the
11996 error message later. */
11999 /* A constructor declarator cannot follow a type-specifier. */
12001 {
12006 }
12007 }
12009 /* If we still do not have a DECL_SPEC, then there are no more
12010 decl-specifiers. */
12015 /* After we see one decl-specifier, further decl-specifiers are
12016 always optional. */
12018 }
12020 /* Don't allow a friend specifier with a class definition. */
12025 }
12027 /* Parse an (optional) storage-class-specifier.
12029 storage-class-specifier:
12030 auto
12031 register
12032 static
12033 extern
12034 mutable
12036 GNU Extension:
12038 storage-class-specifier:
12039 thread
12041 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12043 static tree
12045 {
12047 {
12051 /* Fall through for C++98. */
12058 /* Consume the token. */
12063 }
12064 }
12066 /* Parse an (optional) function-specifier.
12068 function-specifier:
12069 inline
12070 virtual
12071 explicit
12073 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12074 Updates DECL_SPECS, if it is non-NULL. */
12076 static tree
12079 {
12082 {
12088 /* 14.5.2.3 [temp.mem]
12090 A member function template shall not be virtual. */
12093 else
12103 }
12105 /* Consume the token. */
12107 }
12109 /* Parse a linkage-specification.
12111 linkage-specification:
12112 extern string-literal { declaration-seq [opt] }
12113 extern string-literal declaration */
12115 static void
12117 {
12118 tree linkage;
12120 /* Look for the `extern' keyword. */
12123 /* Look for the string-literal. */
12126 /* Transform the literal into an identifier. If the literal is a
12127 wide-character string, or contains embedded NULs, then we can't
12128 handle it as the user wants. */
12131 {
12133 /* Assume C++ linkage. */
12135 }
12136 else
12139 /* We're now using the new linkage. */
12142 /* If the next token is a `{', then we're using the first
12143 production. */
12145 {
12148 /* Consume the `{' token. */
12150 /* Parse the declarations. */
12152 /* Look for the closing `}'. */
12154 }
12155 /* Otherwise, there's just one declaration. */
12156 else
12157 {
12160 saved_in_unbraced_linkage_specification_p
12164 parser->in_unbraced_linkage_specification_p
12166 }
12168 /* We're done with the linkage-specification. */
12170 }
12172 /* Parse a static_assert-declaration.
12174 static_assert-declaration:
12175 static_assert ( constant-expression , string-literal ) ;
12177 If MEMBER_P, this static_assert is a class member. */
12179 static void
12181 {
12182 tree condition;
12183 tree message;
12185 location_t saved_loc;
12188 /* Peek at the `static_assert' token so we can keep track of exactly
12189 where the static assertion started. */
12193 /* Look for the `static_assert' keyword. */
12195 RT_STATIC_ASSERT))
12198 /* We know we are in a static assertion; commit to any tentative
12199 parse. */
12203 /* Parse the `(' starting the static assertion condition. */
12206 /* Parse the constant-expression. Allow a non-constant expression
12207 here in order to give better diagnostics in finish_static_assert. */
12208 condition =
12213 /* Parse the separating `,'. */
12216 /* Parse the string-literal message. */
12221 /* A `)' completes the static assertion. */
12228 /* A semicolon terminates the declaration. */
12231 /* Complete the static assertion, which may mean either processing
12232 the static assert now or saving it for template instantiation. */
12234 }
12236 /* Parse the expression in decltype ( expression ). */
12238 static tree
12241 {
12243 tree expr;
12245 /* First, try parsing an id-expression. */
12256 {
12259 cp_id_kind idk;
12263 /* Lookup the name we got back from the id-expression. */
12273 {
12274 /* Complete lookup of the id-expression. */
12275 expr = (finish_id_expression
12288 /* We found an id-expression, but it was something that we
12289 should not have found. This is an error, not something
12290 we can recover from, so note that we found an
12291 id-expression and we'll recover as gracefully as
12292 possible. */
12294 }
12299 /* We have an id-expression. */
12301 }
12304 {
12305 /* Abort the id-expression parse. */
12308 /* Parsing tentatively, again. */
12311 /* Parse a class member access. */
12319 /* We have an id-expression. */
12321 }
12324 /* We have parsed the complete id-expression or member access. */
12326 else
12327 {
12328 /* Abort our attempt to parse an id-expression or member access
12329 expression. */
12332 /* Parse a full expression. */
12335 }
12338 }
12340 /* Parse a `decltype' type. Returns the type.
12342 simple-type-specifier:
12343 decltype ( expression )
12344 C++14 proposal:
12345 decltype ( auto ) */
12347 static tree
12349 {
12350 tree expr;
12359 {
12360 /* Already parsed. */
12363 }
12365 /* Look for the `decltype' token. */
12369 /* Parse the opening `('. */
12373 /* decltype (auto) */
12376 {
12383 }
12385 /* Types cannot be defined in a `decltype' expression. Save away the
12386 old message. */
12389 /* And create the new one. */
12390 parser->type_definition_forbidden_message
12393 /* The restrictions on constant-expressions do not apply inside
12394 decltype expressions. */
12395 saved_integral_constant_expression_p
12397 saved_non_integral_constant_expression_p
12401 /* Within a parenthesized expression, a `>' token is always
12402 the greater-than operator. */
12403 saved_greater_than_is_operator_p
12407 /* Do not actually evaluate the expression. */
12410 /* Do not warn about problems with the expression. */
12415 /* Go back to evaluating expressions. */
12419 /* The `>' token might be the end of a template-id or
12420 template-parameter-list now. */
12421 parser->greater_than_is_operator_p
12424 /* Restore the old message and the integral constant expression
12425 flags. */
12427 parser->integral_constant_expression_p
12429 parser->non_integral_constant_expression_p
12432 /* Parse to the closing `)'. */
12434 {
12438 }
12441 tf_warning_or_error);
12443 rewrite:
12444 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12445 it again. */
12452 }
12454 /* Special member functions [gram.special] */
12456 /* Parse a conversion-function-id.
12458 conversion-function-id:
12459 operator conversion-type-id
12461 Returns an IDENTIFIER_NODE representing the operator. */
12463 static tree
12465 {
12466 tree type;
12467 tree saved_scope;
12468 tree saved_qualifying_scope;
12469 tree saved_object_scope;
12472 /* Look for the `operator' token. */
12475 /* When we parse the conversion-type-id, the current scope will be
12476 reset. However, we need that information in able to look up the
12477 conversion function later, so we save it here. */
12481 /* We must enter the scope of the class so that the names of
12482 entities declared within the class are available in the
12483 conversion-type-id. For example, consider:
12485 struct S {
12486 typedef int I;
12487 operator I();
12488 };
12490 S::operator I() { ... }
12492 In order to see that `I' is a type-name in the definition, we
12493 must be in the scope of `S'. */
12496 /* Parse the conversion-type-id. */
12498 /* Leave the scope of the class, if any. */
12501 /* Restore the saved scope. */
12505 /* If the TYPE is invalid, indicate failure. */
12509 }
12511 /* Parse a conversion-type-id:
12513 conversion-type-id:
12514 type-specifier-seq conversion-declarator [opt]
12516 Returns the TYPE specified. */
12518 static tree
12520 {
12521 tree attributes;
12522 cp_decl_specifier_seq type_specifiers;
12524 tree type_specified;
12527 /* Parse the attributes. */
12531 parser->type_definition_forbidden_message
12534 /* Parse the type-specifiers. */
12541 /* If that didn't work, stop. */
12544 /* Parse the conversion-declarator. */
12552 /* Don't give this error when parsing tentatively. This happens to
12553 work because we always parse this definitively once. */
12556 {
12558 {
12561 }
12565 }
12568 }
12570 /* Parse an (optional) conversion-declarator.
12572 conversion-declarator:
12573 ptr-operator conversion-declarator [opt]
12575 */
12579 {
12582 cp_cv_quals cv_quals;
12584 /* We don't know if there's a ptr-operator next, or not. */
12586 /* Try the ptr-operator. */
12589 /* If it worked, look for more conversion-declarators. */
12591 {
12594 /* Parse another optional declarator. */
12597 declarator = cp_parser_make_indirect_declarator
12601 }
12604 }
12606 /* Parse an (optional) ctor-initializer.
12608 ctor-initializer:
12609 : mem-initializer-list
12611 Returns TRUE iff the ctor-initializer was actually present. */
12613 static bool
12615 {
12616 /* If the next token is not a `:', then there is no
12617 ctor-initializer. */
12619 {
12620 /* Do default initialization of any bases and members. */
12625 }
12627 /* Consume the `:' token. */
12629 /* And the mem-initializer-list. */
12633 }
12635 /* Parse a mem-initializer-list.
12637 mem-initializer-list:
12638 mem-initializer ... [opt]
12639 mem-initializer ... [opt] , mem-initializer-list */
12641 static void
12643 {
12648 /* Let the semantic analysis code know that we are starting the
12649 mem-initializer-list. */
12654 /* Loop through the list. */
12656 {
12657 tree mem_initializer;
12660 /* Parse the mem-initializer. */
12662 /* If the next token is a `...', we're expanding member initializers. */
12664 {
12665 /* Consume the `...'. */
12668 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12669 can be expanded but members cannot. */
12672 {
12677 }
12679 /* Construct the pack expansion type. */
12682 }
12685 {
12689 }
12690 /* Look for a target constructor. */
12694 {
12697 {
12701 }
12703 }
12704 /* Add it to the list, unless it was erroneous. */
12706 {
12709 }
12710 /* If the next token is not a `,', we're done. */
12713 /* Consume the `,' token. */
12715 }
12717 /* Perform semantic analysis. */
12720 }
12722 /* Parse a mem-initializer.
12724 mem-initializer:
12725 mem-initializer-id ( expression-list [opt] )
12726 mem-initializer-id braced-init-list
12728 GNU extension:
12730 mem-initializer:
12731 ( expression-list [opt] )
12733 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12734 class) or FIELD_DECL (for a non-static data member) to initialize;
12735 the TREE_VALUE is the expression-list. An empty initialization
12736 list is represented by void_list_node. */
12738 static tree
12740 {
12741 tree mem_initializer_id;
12742 tree expression_list;
12743 tree member;
12746 /* Find out what is being initialized. */
12748 {
12752 }
12753 else
12754 {
12758 }
12764 {
12771 }
12772 else
12773 {
12783 }
12793 }
12795 /* Parse a mem-initializer-id.
12797 mem-initializer-id:
12798 :: [opt] nested-name-specifier [opt] class-name
12799 identifier
12801 Returns a TYPE indicating the class to be initializer for the first
12802 production. Returns an IDENTIFIER_NODE indicating the data member
12803 to be initialized for the second production. */
12805 static tree
12807 {
12811 tree id;
12815 /* `typename' is not allowed in this context ([temp.res]). */
12817 {
12819 "keyword %<typename%> not allowed in this context (a qualified "
12822 }
12823 /* Look for the optional `::' operator. */
12824 global_scope_p
12828 /* Look for the optional nested-name-specifier. The simplest way to
12829 implement:
12831 [temp.res]
12833 The keyword `typename' is not permitted in a base-specifier or
12834 mem-initializer; in these contexts a qualified name that
12835 depends on a template-parameter is implicitly assumed to be a
12836 type name.
12838 is to assume that we have seen the `typename' keyword at this
12839 point. */
12840 nested_name_specifier_p
12849 /* If there is a `::' operator or a nested-name-specifier, then we
12850 are definitely looking for a class-name. */
12855 typename_type,
12859 /* Otherwise, we could also be looking for an ordinary identifier. */
12861 /* Try a class-name. */
12865 none_type,
12869 /* If we found one, we're done. */
12872 /* Otherwise, look for an ordinary identifier. */
12874 }
12876 /* Overloading [gram.over] */
12878 /* Parse an operator-function-id.
12880 operator-function-id:
12881 operator operator
12883 Returns an IDENTIFIER_NODE for the operator which is a
12884 human-readable spelling of the identifier, e.g., `operator +'. */
12886 static tree
12888 {
12889 /* Look for the `operator' keyword. */
12892 /* And then the name of the operator itself. */
12894 }
12896 /* Return an identifier node for a user-defined literal operator.
12897 The suffix identifier is chained to the operator name identifier. */
12899 static tree
12901 {
12902 tree identifier;
12909 }
12911 /* Parse an operator.
12913 operator:
12914 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12915 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12916 || ++ -- , ->* -> () []
12918 GNU Extensions:
12920 operator:
12921 <? >? <?= >?=
12923 Returns an IDENTIFIER_NODE for the operator which is a
12924 human-readable spelling of the identifier, e.g., `operator +'. */
12926 static tree
12928 {
12933 /* Peek at the next token. */
12935 /* Figure out which operator we have. */
12937 {
12939 {
12942 /* The keyword should be either `new' or `delete'. */
12947 else
12950 /* Consume the `new' or `delete' token. */
12953 /* Peek at the next token. */
12955 /* If it's a `[' token then this is the array variant of the
12956 operator. */
12958 {
12959 /* Consume the `[' token. */
12961 /* Look for the `]' token. */
12965 }
12966 /* Otherwise, we have the non-array variant. */
12967 else
12971 }
13118 /* Consume the `('. */
13120 /* Look for the matching `)'. */
13125 /* Consume the `['. */
13127 /* Look for the matching `]'. */
13142 {
13149 /* Consume the string. */
13155 {
13158 }
13159 else
13160 {
13162 /* Look for the suffix identifier. */
13167 {
13171 }
13172 else
13173 {
13176 }
13177 }
13182 {
13185 }
13188 {
13191 }
13193 {
13196 }
13198 }
13201 /* Anything else is an error. */
13203 }
13205 /* If we have selected an identifier, we need to consume the
13206 operator token. */
13209 /* Otherwise, no valid operator name was present. */
13210 else
13211 {
13214 }
13217 }
13219 /* Parse a template-declaration.
13221 template-declaration:
13222 export [opt] template < template-parameter-list > declaration
13224 If MEMBER_P is TRUE, this template-declaration occurs within a
13225 class-specifier.
13227 The grammar rule given by the standard isn't correct. What
13228 is really meant is:
13230 template-declaration:
13231 export [opt] template-parameter-list-seq
13232 decl-specifier-seq [opt] init-declarator [opt] ;
13233 export [opt] template-parameter-list-seq
13234 function-definition
13236 template-parameter-list-seq:
13237 template-parameter-list-seq [opt]
13238 template < template-parameter-list > */
13240 static void
13242 {
13243 /* Check for `export'. */
13245 {
13246 /* Consume the `export' token. */
13248 /* Warn that we do not support `export'. */
13250 }
13253 }
13255 /* Parse a template-parameter-list.
13257 template-parameter-list:
13258 template-parameter
13259 template-parameter-list , template-parameter
13261 Returns a TREE_LIST. Each node represents a template parameter.
13262 The nodes are connected via their TREE_CHAINs. */
13264 static tree
13266 {
13271 /* The loop below parses the template parms. We first need to know
13272 the total number of template parms to be able to compute proper
13273 canonical types of each dependent type. So after the loop, when
13274 we know the total number of template parms,
13275 end_template_parm_list computes the proper canonical types and
13276 fixes up the dependent types accordingly. */
13278 {
13279 tree parameter;
13282 location_t parm_loc;
13284 /* Parse the template-parameter. */
13289 /* Add it to the list. */
13292 parm_loc,
13293 parameter,
13294 is_non_type,
13295 is_parameter_pack);
13296 else
13297 {
13300 }
13302 /* If the next token is not a `,', we're done. */
13305 /* Otherwise, consume the `,' token. */
13307 }
13310 }
13312 /* Parse a template-parameter.
13314 template-parameter:
13315 type-parameter
13316 parameter-declaration
13318 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13319 the parameter. The TREE_PURPOSE is the default value, if any.
13320 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13321 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13322 set to true iff this parameter is a parameter pack. */
13324 static tree
13327 {
13331 tree parm;
13333 /* Assume it is a type parameter or a template parameter. */
13335 /* Assume it not a parameter pack. */
13337 /* Peek at the next token. */
13339 /* If it is `class' or `template', we have a type-parameter. */
13342 /* If it is `class' or `typename' we do not know yet whether it is a
13343 type parameter or a non-type parameter. Consider:
13345 template <typename T, typename T::X X> ...
13347 or:
13349 template <class C, class D*> ...
13351 Here, the first parameter is a type parameter, and the second is
13352 a non-type parameter. We can tell by looking at the token after
13353 the identifier -- if it is a `,', `=', or `>' then we have a type
13354 parameter. */
13356 {
13357 /* Peek at the token after `class' or `typename'. */
13359 /* If it's an ellipsis, we have a template type parameter
13360 pack. */
13363 /* If it's an identifier, skip it. */
13366 /* Now, see if the token looks like the end of a template
13367 parameter. */
13372 }
13374 /* Otherwise, it is a non-type parameter.
13376 [temp.param]
13378 When parsing a default template-argument for a non-type
13379 template-parameter, the first non-nested `>' is taken as the end
13380 of the template parameter-list rather than a greater-than
13381 operator. */
13383 parameter_declarator
13390 /* If the parameter declaration is marked as a parameter pack, set
13391 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13392 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13393 grokdeclarator. */
13396 {
13399 }
13402 {
13403 /* Can happen in some cases of erroneous input (c++/34892). */
13405 /* Consume the `...' for better error recovery. */
13407 }
13408 /* If the next token is an ellipsis, and we don't already have it
13409 marked as a parameter pack, then we have a parameter pack (that
13410 has no declarator). */
13413 && (declarator_can_be_parameter_pack
13415 {
13416 /* Consume the `...'. */
13421 }
13422 /* We might end up with a pack expansion as the type of the non-type
13423 template parameter, in which case this is a non-type template
13424 parameter pack. */
13427 {
13431 }
13434 {
13435 /* Parameter packs cannot have default arguments. However, a
13436 user may try to do so, so we'll parse them and give an
13437 appropriate diagnostic here. */
13441 /* Find the name of the parameter pack. */
13450 else
13454 /* Parse the default argument, but throw away the result. */
13456 }
13466 }
13468 /* Parse a type-parameter.
13470 type-parameter:
13471 class identifier [opt]
13472 class identifier [opt] = type-id
13473 typename identifier [opt]
13474 typename identifier [opt] = type-id
13475 template < template-parameter-list > class identifier [opt]
13476 template < template-parameter-list > class identifier [opt]
13477 = id-expression
13479 GNU Extension (variadic templates):
13481 type-parameter:
13482 class ... identifier [opt]
13483 typename ... identifier [opt]
13485 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13486 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13487 the declaration of the parameter.
13489 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13491 static tree
13493 {
13495 tree parameter;
13497 /* Look for a keyword to tell us what kind of parameter this is. */
13503 {
13506 {
13507 tree identifier;
13508 tree default_argument;
13510 /* If the next token is an ellipsis, we have a template
13511 argument pack. */
13513 {
13514 /* Consume the `...' token. */
13519 }
13521 /* If the next token is an identifier, then it names the
13522 parameter. */
13525 else
13528 /* Create the parameter. */
13531 /* If the next token is an `=', we have a default argument. */
13533 {
13534 /* Consume the `=' token. */
13536 /* Parse the default-argument. */
13540 /* Template parameter packs cannot have default
13541 arguments. */
13543 {
13546 "template parameter pack %qD cannot have a "
13548 else
13550 "template parameter packs cannot have "
13553 }
13557 }
13558 else
13561 /* Create the combined representation of the parameter and the
13562 default argument. */
13564 }
13568 {
13569 tree identifier;
13570 tree default_argument;
13572 /* Look for the `<'. */
13574 /* Parse the template-parameter-list. */
13576 /* Look for the `>'. */
13578 /* Look for the `class' or 'typename' keywords. */
13580 /* If the next token is an ellipsis, we have a template
13581 argument pack. */
13583 {
13584 /* Consume the `...' token. */
13589 }
13590 /* If the next token is an `=', then there is a
13591 default-argument. If the next token is a `>', we are at
13592 the end of the parameter-list. If the next token is a `,',
13593 then we are at the end of this parameter. */
13597 {
13599 /* Treat invalid names as if the parameter were nameless. */
13602 }
13603 else
13606 /* Create the template parameter. */
13608 identifier);
13610 /* If the next token is an `=', then there is a
13611 default-argument. */
13613 {
13616 /* Consume the `='. */
13618 /* Parse the id-expression. */
13620 /* save token before parsing the id-expression, for error
13621 reporting */
13623 default_argument
13631 /* If the id-expression was a template-id that refers to
13632 a template-class, we already have the declaration here,
13633 so no further lookup is needed. */
13634 ;
13635 else
13636 /* Look up the name. */
13637 default_argument
13639 none_type,
13645 /* See if the default argument is valid. */
13646 default_argument
13649 /* Template parameter packs cannot have default
13650 arguments. */
13652 {
13655 "template parameter pack %qD cannot "
13657 identifier);
13658 else
13662 }
13664 }
13665 else
13668 /* Create the combined representation of the parameter and the
13669 default argument. */
13671 }
13677 }
13680 }
13682 /* Parse a template-id.
13684 template-id:
13685 template-name < template-argument-list [opt] >
13687 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13688 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13689 returned. Otherwise, if the template-name names a function, or set
13690 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13691 names a class, returns a TYPE_DECL for the specialization.
13693 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13694 uninstantiated templates. */
13696 static tree
13702 {
13704 tree templ;
13705 tree arguments;
13706 tree template_id;
13713 /* If the next token corresponds to a template-id, there is no need
13714 to reparse it. */
13717 {
13720 /* Get the stored value. */
13722 /* Perform any access checks that were deferred. */
13725 {
13730 tf_warning_or_error);
13731 }
13732 /* Return the stored value. */
13734 }
13736 /* Avoid performing name lookup if there is no possibility of
13737 finding a template-id. */
13740 && !cp_parser_nth_token_starts_template_argument_list_p
13742 {
13745 }
13747 /* Remember where the template-id starts. */
13753 /* Parse the template-name. */
13756 check_dependency_p,
13757 is_declaration,
13758 tag_type,
13761 {
13764 }
13766 /* If we find the sequence `[:' after a template-name, it's probably
13767 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13768 parse correctly the argument list. */
13775 {
13777 /* Change `:' into `::'. */
13779 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13780 CPP_LESS. */
13783 /* Parse the arguments. */
13786 {
13787 /* If we couldn't parse an argument list, then we revert our changes
13788 and return simply an error. Maybe this is not a template-id
13789 after all. */
13794 }
13795 /* Otherwise, emit an error about the invalid digraph, but continue
13796 parsing because we got our argument list. */
13799 {
13802 "%<<:%> is an alternate spelling for %<[%>."
13805 {
13807 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13810 }
13811 }
13812 }
13813 else
13814 {
13815 /* Look for the `<' that starts the template-argument-list. */
13817 {
13820 }
13821 /* Parse the arguments. */
13823 }
13825 /* Build a representation of the specialization. */
13828 TEMPLATE_ID_EXPR,
13832 {
13834 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13835 template (rather than some instantiation thereof) only if
13836 is not nested within some other construct. For example, in
13837 "template <typename T> void f(T) { A<T>::", A<T> is just an
13838 instantiation of A. */
13841 CPP_SCOPE));
13842 template_id
13844 }
13846 {
13848 }
13849 else
13850 {
13851 /* If it's not a class-template or a template-template, it should be
13852 a function-template. */
13858 }
13860 /* If parsing tentatively, replace the sequence of tokens that makes
13861 up the template-id with a CPP_TEMPLATE_ID token. That way,
13862 should we re-parse the token stream, we will not have to repeat
13863 the effort required to do the parse, nor will we issue duplicate
13864 error messages about problems during instantiation of the
13865 template. */
13867 /* Don't do this if we had a parse error in a declarator; re-parsing
13868 might succeed if a name changes meaning (60361). */
13872 {
13875 /* Reset the contents of the START_OF_ID token. */
13877 /* Retrieve any deferred checks. Do not pop this access checks yet
13878 so the memory will not be reclaimed during token replacing below. */
13884 /* Purge all subsequent tokens. */
13887 /* ??? Can we actually assume that, if template_id ==
13888 error_mark_node, we will have issued a diagnostic to the
13889 user, as opposed to simply marking the tentative parse as
13890 failed? */
13893 }
13897 }
13899 /* Parse a template-name.
13901 template-name:
13902 identifier
13904 The standard should actually say:
13906 template-name:
13907 identifier
13908 operator-function-id
13910 A defect report has been filed about this issue.
13912 A conversion-function-id cannot be a template name because they cannot
13913 be part of a template-id. In fact, looking at this code:
13915 a.operator K<int>()
13917 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13918 It is impossible to call a templated conversion-function-id with an
13919 explicit argument list, since the only allowed template parameter is
13920 the type to which it is converting.
13922 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13923 `template' keyword, in a construction like:
13925 T::template f<3>()
13927 In that case `f' is taken to be a template-name, even though there
13928 is no way of knowing for sure.
13930 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13931 name refers to a set of overloaded functions, at least one of which
13932 is a template, or an IDENTIFIER_NODE with the name of the template,
13933 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13934 names are looked up inside uninstantiated templates. */
13936 static tree
13943 {
13944 tree identifier;
13945 tree decl;
13946 tree fns;
13949 /* If the next token is `operator', then we have either an
13950 operator-function-id or a conversion-function-id. */
13952 {
13953 /* We don't know whether we're looking at an
13954 operator-function-id or a conversion-function-id. */
13956 /* Try an operator-function-id. */
13958 /* If that didn't work, try a conversion-function-id. */
13960 {
13963 }
13964 }
13965 /* Look for the identifier. */
13966 else
13969 /* If we didn't find an identifier, we don't have a template-id. */
13973 /* If the name immediately followed the `template' keyword, then it
13974 is a template-name. However, if the next token is not `<', then
13975 we do not treat it as a template-name, since it is not being used
13976 as part of a template-id. This enables us to handle constructs
13977 like:
13979 template <typename T> struct S { S(); };
13980 template <typename T> S<T>::S();
13982 correctly. We would treat `S' as a template -- if it were `S<T>'
13983 -- but we do not if there is no `<'. */
13987 {
13988 /* In a declaration, in a dependent context, we pretend that the
13989 "template" keyword was present in order to improve error
13990 recovery. For example, given:
13992 template <typename T> void f(T::X<int>);
13994 we want to treat "X<int>" as a template-id. */
13996 && !template_keyword_p
13998 && check_dependency_p
14000 /* Do not do this for dtors (or ctors), since they never
14001 need the template keyword before their name. */
14003 {
14006 /* Explain what went wrong. */
14008 identifier);
14011 /* If parsing tentatively, find the location of the "<" token. */
14014 /* Parse the template arguments so that we can issue error
14015 messages about them. */
14018 /* Skip tokens until we find a good place from which to
14019 continue parsing. */
14024 /* If parsing tentatively, permanently remove the
14025 template argument list. That will prevent duplicate
14026 error messages from being issued about the missing
14027 "template" keyword. */
14033 }
14035 /* If the "template" keyword is present, then there is generally
14036 no point in doing name-lookup, so we just return IDENTIFIER.
14037 But, if the qualifying scope is non-dependent then we can
14038 (and must) do name-lookup normally. */
14044 }
14046 /* Look up the name. */
14048 tag_type,
14051 check_dependency_p,
14057 /* If DECL is a template, then the name was a template-name. */
14059 {
14063 }
14064 else
14065 {
14068 /* The standard does not explicitly indicate whether a name that
14069 names a set of overloaded declarations, some of which are
14070 templates, is a template-name. However, such a name should
14071 be a template-name; otherwise, there is no way to form a
14072 template-id for the overloaded templates. */
14080 {
14081 /* The name does not name a template. */
14084 }
14085 }
14087 /* If DECL is dependent, and refers to a function, then just return
14088 its name; we will look it up again during template instantiation. */
14090 {
14094 }
14097 }
14099 /* Parse a template-argument-list.
14101 template-argument-list:
14102 template-argument ... [opt]
14103 template-argument-list , template-argument ... [opt]
14105 Returns a TREE_VEC containing the arguments. */
14107 static tree
14109 {
14114 tree vec;
14121 /* Even if the template-id appears in an integral
14122 constant-expression, the contents of the argument list do
14123 not. */
14129 /* Parse the arguments. */
14130 do
14131 {
14132 tree argument;
14135 /* Consume the comma. */
14138 /* Parse the template-argument. */
14141 /* If the next token is an ellipsis, we're expanding a template
14142 argument pack. */
14144 {
14146 {
14150 }
14151 /* Consume the `...' token. */
14154 /* Make the argument into a TYPE_PACK_EXPANSION or
14155 EXPR_PACK_EXPANSION. */
14157 }
14160 {
14164 {
14167 }
14168 else
14170 }
14172 }
14185 #ifdef ENABLE_CHECKING
14187 #endif
14189 }
14191 /* Parse a template-argument.
14193 template-argument:
14194 assignment-expression
14195 type-id
14196 id-expression
14198 The representation is that of an assignment-expression, type-id, or
14199 id-expression -- except that the qualified id-expression is
14200 evaluated, so that the value returned is either a DECL or an
14201 OVERLOAD.
14203 Although the standard says "assignment-expression", it forbids
14204 throw-expressions or assignments in the template argument.
14205 Therefore, we use "conditional-expression" instead. */
14207 static tree
14209 {
14210 tree argument;
14216 cp_id_kind idk;
14218 /* There's really no way to know what we're looking at, so we just
14219 try each alternative in order.
14221 [temp.arg]
14223 In a template-argument, an ambiguity between a type-id and an
14224 expression is resolved to a type-id, regardless of the form of
14225 the corresponding template-parameter.
14227 Therefore, we try a type-id first. */
14230 /* If there was no error parsing the type-id but the next token is a
14231 '>>', our behavior depends on which dialect of C++ we're
14232 parsing. In C++98, we probably found a typo for '> >'. But there
14233 are type-id which are also valid expressions. For instance:
14235 struct X { int operator >> (int); };
14236 template <int V> struct Foo {};
14237 Foo<X () >> 5> r;
14239 Here 'X()' is a valid type-id of a function type, but the user just
14240 wanted to write the expression "X() >> 5". Thus, we remember that we
14241 found a valid type-id, but we still try to parse the argument as an
14242 expression to see what happens.
14244 In C++0x, the '>>' will be considered two separate '>'
14245 tokens. */
14249 {
14252 }
14253 else
14254 {
14255 /* If the next token isn't a `,' or a `>', then this argument wasn't
14256 really finished. This means that the argument is not a valid
14257 type-id. */
14260 /* If that worked, we're done. */
14263 }
14264 /* We're still not sure what the argument will be. */
14266 /* Try a template. */
14274 /* If the next token isn't a `,' or a `>', then this argument wasn't
14275 really finished. */
14279 {
14280 /* Figure out what is being referred to. If the id-expression
14281 was for a class template specialization, then we will have a
14282 TYPE_DECL at this point. There is no need to do name lookup
14283 at this point in that case. */
14286 none_type,
14295 }
14297 {
14301 }
14302 /* It must be a non-type argument. There permitted cases are given
14303 in [temp.arg.nontype]:
14305 -- an integral constant-expression of integral or enumeration
14306 type; or
14308 -- the name of a non-type template-parameter; or
14310 -- the name of an object or function with external linkage...
14312 -- the address of an object or function with external linkage...
14314 -- a pointer to member... */
14315 /* Look for a non-type template parameter. */
14317 {
14329 }
14331 /* If the next token is "&", the argument must be the address of an
14332 object or function with external linkage. */
14335 {
14338 }
14339 /* See if we might have an id-expression. */
14346 {
14349 address_p,
14356 else
14357 {
14358 tree probe;
14361 {
14362 /* Strip the dereference temporarily. */
14365 }
14367 /* If we're in a template, we represent a qualified-id referring
14368 to a static data member as a SCOPE_REF even if the scope isn't
14369 dependent so that we can check access control later. */
14374 {
14375 /* A variable without external linkage might still be a
14376 valid constant-expression, so no error is issued here
14377 if the external-linkage check fails. */
14380 }
14382 /* All overloaded functions are allowed; if the external
14383 linkage test does not pass, an error will be issued
14384 later. */
14385 ;
14389 /* A pointer-to-member. */
14390 ;
14392 ;
14393 else
14397 {
14400 tf_warning_or_error);
14401 else
14404 }
14405 }
14406 }
14407 /* If the argument started with "&", there are no other valid
14408 alternatives at this point. */
14410 {
14413 }
14415 /* If the argument wasn't successfully parsed as a type-id followed
14416 by '>>', the argument can only be a constant expression now.
14417 Otherwise, we try parsing the constant-expression tentatively,
14418 because the argument could really be a type-id. */
14429 /* We did our best to parse the argument as a non type-id, but that
14430 was the only alternative that matched (albeit with a '>' after
14431 it). We can assume it's just a typo from the user, and a
14432 diagnostic will then be issued. */
14434 }
14436 /* Parse an explicit-instantiation.
14438 explicit-instantiation:
14439 template declaration
14441 Although the standard says `declaration', what it really means is:
14443 explicit-instantiation:
14444 template decl-specifier-seq [opt] declarator [opt] ;
14446 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14447 supposed to be allowed. A defect report has been filed about this
14448 issue.
14450 GNU Extension:
14452 explicit-instantiation:
14453 storage-class-specifier template
14454 decl-specifier-seq [opt] declarator [opt] ;
14455 function-specifier template
14456 decl-specifier-seq [opt] declarator [opt] ; */
14458 static void
14460 {
14462 cp_decl_specifier_seq decl_specifiers;
14467 /* Look for an (optional) storage-class-specifier or
14468 function-specifier. */
14470 {
14471 extension_specifier
14474 extension_specifier
14477 }
14479 /* Look for the `template' keyword. */
14481 /* Let the front end know that we are processing an explicit
14482 instantiation. */
14484 /* [temp.explicit] says that we are supposed to ignore access
14485 control while processing explicit instantiation directives. */
14487 /* Parse a decl-specifier-seq. */
14489 CP_PARSER_FLAGS_OPTIONAL,
14492 /* If there was exactly one decl-specifier, and it declared a class,
14493 and there's no declarator, then we have an explicit type
14494 instantiation. */
14496 {
14497 tree type;
14501 /* Turn access control back on for names used during
14502 template instantiation. */
14507 }
14508 else
14509 {
14511 tree decl;
14513 /* Parse the declarator. */
14514 declarator
14525 {
14528 "explicit instantiation shall not use"
14532 "explicit instantiation shall not use"
14537 /* Turn access control back on for names used during
14538 template instantiation. */
14540 /* Do the explicit instantiation. */
14542 }
14543 else
14544 {
14546 /* Skip the body of the explicit instantiation. */
14548 }
14549 }
14550 /* We're done with the instantiation. */
14556 }
14558 /* Parse an explicit-specialization.
14560 explicit-specialization:
14561 template < > declaration
14563 Although the standard says `declaration', what it really means is:
14565 explicit-specialization:
14566 template <> decl-specifier [opt] init-declarator [opt] ;
14567 template <> function-definition
14568 template <> explicit-specialization
14569 template <> template-declaration */
14571 static void
14573 {
14577 /* Look for the `template' keyword. */
14579 /* Look for the `<'. */
14581 /* Look for the `>'. */
14583 /* We have processed another parameter list. */
14585 /* [temp]
14587 A template ... explicit specialization ... shall not have C
14588 linkage. */
14590 {
14592 /* Give it C++ linkage to avoid confusing other parts of the
14593 front end. */
14596 }
14597 else
14599 /* Let the front end know that we are beginning a specialization. */
14601 {
14604 }
14606 /* If the next keyword is `template', we need to figure out whether
14607 or not we're looking a template-declaration. */
14609 {
14614 else
14616 }
14617 else
14618 /* Parse the dependent declaration. */
14624 /* We're done with the specialization. */
14626 /* For the erroneous case of a template with C linkage, we pushed an
14627 implicit C++ linkage scope; exit that scope now. */
14630 /* We're done with this parameter list. */
14632 }
14634 /* Parse a type-specifier.
14636 type-specifier:
14637 simple-type-specifier
14638 class-specifier
14639 enum-specifier
14640 elaborated-type-specifier
14641 cv-qualifier
14643 GNU Extension:
14645 type-specifier:
14646 __complex__
14648 Returns a representation of the type-specifier. For a
14649 class-specifier, enum-specifier, or elaborated-type-specifier, a
14650 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14652 The parser flags FLAGS is used to control type-specifier parsing.
14654 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14655 in a decl-specifier-seq.
14657 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14658 class-specifier, enum-specifier, or elaborated-type-specifier, then
14659 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14660 if a type is declared; 2 if it is defined. Otherwise, it is set to
14661 zero.
14663 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14664 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14665 is set to FALSE. */
14667 static tree
14669 cp_parser_flags flags,
14674 {
14680 /* Assume this type-specifier does not declare a new type. */
14683 /* And that it does not specify a cv-qualifier. */
14686 /* Peek at the next token. */
14689 /* If we're looking at a keyword, we can use that to guide the
14690 production we choose. */
14693 {
14698 /* Look for the enum-specifier. */
14700 /* If that worked, we're done. */
14702 {
14707 type_spec,
14708 token,
14711 }
14712 else
14715 /* Any of these indicate either a class-specifier, or an
14716 elaborated-type-specifier. */
14723 /* Parse tentatively so that we can back up if we don't find a
14724 class-specifier. */
14726 /* Look for the class-specifier. */
14729 /* If that worked, we're done. */
14731 {
14736 type_spec,
14737 token,
14740 }
14742 /* Fall through. */
14743 elaborated_type_specifier:
14744 /* We're declaring (not defining) a class or enum. */
14748 /* Fall through. */
14750 /* Look for an elaborated-type-specifier. */
14751 type_spec
14752 = (cp_parser_elaborated_type_specifier
14755 is_declaration));
14758 type_spec,
14759 token,
14782 /* The `__complex__' keyword is a GNU extension. */
14788 }
14790 /* Handle simple keywords. */
14792 {
14794 {
14797 }
14799 }
14801 /* If we do not already have a type-specifier, assume we are looking
14802 at a simple-type-specifier. */
14804 decl_specs,
14805 flags);
14807 /* If we didn't find a type-specifier, and a type-specifier was not
14808 optional in this context, issue an error message. */
14810 {
14813 }
14816 }
14818 /* Parse a simple-type-specifier.
14820 simple-type-specifier:
14821 :: [opt] nested-name-specifier [opt] type-name
14822 :: [opt] nested-name-specifier template template-id
14823 char
14824 wchar_t
14825 bool
14826 short
14827 int
14828 long
14829 signed
14830 unsigned
14831 float
14832 double
14833 void
14835 C++0x Extension:
14837 simple-type-specifier:
14838 auto
14839 decltype ( expression )
14840 char16_t
14841 char32_t
14842 __underlying_type ( type-id )
14844 GNU Extension:
14846 simple-type-specifier:
14847 __int128
14848 __typeof__ unary-expression
14849 __typeof__ ( type-id )
14850 __typeof__ ( type-id ) { initializer-list , [opt] }
14852 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14853 appropriately updated. */
14855 static tree
14858 cp_parser_flags flags)
14859 {
14864 /* Peek at the next token. */
14867 /* If we're looking at a keyword, things are easy. */
14869 {
14904 {
14907 }
14936 {
14937 /* The 'auto' might be the placeholder return type for a function decl
14938 with trailing return type. */
14942 {
14950 have_trailing_return_fn_decl
14953 }
14956 {
14959 }
14963 else
14967 {
14970 "use of %<auto%> in lambda parameter declaration "
14971 "only available with "
14973 }
14976 "use of %<auto%> in parameter declaration "
14977 "only available with "
14979 else
14981 "ISO C++ forbids use of %<auto%> in parameter "
14983 }
14984 else
14989 /* Since DR 743, decltype can either be a simple-type-specifier by
14990 itself or begin a nested-name-specifier. Parsing it will replace
14991 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14992 handling below decide what to do. */
14998 /* Consume the `typeof' token. */
15000 /* Parse the operand to `typeof'. */
15002 /* If it is not already a TYPE, take its type. */
15008 token,
15017 token,
15027 token,
15032 }
15034 /* If token is an already-parsed decltype not followed by ::,
15035 it's a simple-type-specifier. */
15038 {
15041 {
15043 token,
15045 /* Remember that we are handling a decltype in order to
15046 implement the resolution of DR 1510 when the argument
15047 isn't instantiation dependent. */
15049 }
15052 }
15054 /* If the type-specifier was for a built-in type, we're done. */
15056 {
15057 /* Record the type. */
15064 type,
15065 token,
15070 /* Consume the token. */
15076 /* There is no valid C++ program where a non-template type is
15077 followed by a "<". That usually indicates that the user thought
15078 that the type was a template. */
15083 }
15085 /* The type-specifier must be a user-defined type. */
15087 {
15091 /* Don't gobble tokens or issue error messages if this is an
15092 optional type-specifier. */
15096 /* Look for the optional `::' operator. */
15097 global_p
15101 /* Look for the nested-name specifier. */
15102 qualified_p
15110 /* If we have seen a nested-name-specifier, and the next token
15111 is `template', then we are using the template-id production. */
15114 {
15115 /* Look for the template-id. */
15119 none_type,
15121 /* If the template-id did not name a type, we are out of
15122 luck. */
15124 {
15127 }
15128 }
15129 /* Otherwise, look for a type-name. */
15130 else
15132 /* Keep track of all name-lookups performed in class scopes. */
15134 && !global_p
15135 && !qualified_p
15139 /* If it didn't work out, we don't have a TYPE. */
15145 token,
15147 }
15149 /* If we didn't get a type-name, issue an error message. */
15151 {
15154 }
15157 {
15158 /* See if TYPE is an Objective-C type, and if so, parse and
15159 accept any protocol references following it. Do this before
15160 the cp_parser_check_for_invalid_template_id() call, because
15161 Objective-C types can be followed by '<...>' which would
15162 enclose protocol names rather than template arguments, and so
15163 everything is fine. */
15166 {
15170 /* Clobber the "unqualified" type previously entered into
15171 DECL_SPECS with the new, improved protocol-qualified version. */
15176 }
15178 /* There is no valid C++ program where a non-template type is
15179 followed by a "<". That usually indicates that the user
15180 thought that the type was a template. */
15182 none_type,
15184 }
15187 }
15189 /* Parse a type-name.
15191 type-name:
15192 class-name
15193 enum-name
15194 typedef-name
15195 simple-template-id [in c++0x]
15197 enum-name:
15198 identifier
15200 typedef-name:
15201 identifier
15203 Returns a TYPE_DECL for the type. */
15205 static tree
15207 {
15208 tree type_decl;
15210 /* We can't know yet whether it is a class-name or not. */
15212 /* Try a class-name. */
15216 none_type,
15220 /* If it's not a class-name, keep looking. */
15222 {
15224 /* It must be a typedef-name or an enum-name. */
15228 /* It is either a simple-template-id representing an
15229 instantiation of an alias template... */
15233 none_type,
15235 /* Note that this must be an instantiation of an alias template
15236 because [temp.names]/6 says:
15238 A template-id that names an alias template specialization
15239 is a type-name.
15241 Whereas [temp.names]/7 says:
15243 A simple-template-id that names a class template
15244 specialization is a class-name. */
15249 else
15253 /* ... Or a typedef-name or an enum-name. */
15255 }
15258 }
15260 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15262 enum-name:
15263 identifier
15265 typedef-name:
15266 identifier
15268 Returns a TYPE_DECL for the type. */
15270 static tree
15272 {
15273 tree type_decl;
15274 tree identifier;
15281 /* Look up the type-name. */
15288 {
15289 /* See if this is an Objective-C type. */
15294 }
15296 /* Issue an error if we did not find a type-name. */
15298 /* In Objective-C, we have the complication that class names are
15299 normally type names and start declarations (eg, the
15300 "NSObject" in "NSObject *object;"), but can be used in an
15301 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15302 is an expression. So, a classname followed by a dot is not a
15303 valid type-name. */
15306 {
15311 }
15312 /* Remember that the name was used in the definition of the
15313 current class so that we can check later to see if the
15314 meaning would have been different after the class was
15315 entirely defined. */
15321 }
15323 /* Parse an elaborated-type-specifier. Note that the grammar given
15324 here incorporates the resolution to DR68.
15326 elaborated-type-specifier:
15327 class-key :: [opt] nested-name-specifier [opt] identifier
15328 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15329 enum-key :: [opt] nested-name-specifier [opt] identifier
15330 typename :: [opt] nested-name-specifier identifier
15331 typename :: [opt] nested-name-specifier template [opt]
15332 template-id
15334 GNU extension:
15336 elaborated-type-specifier:
15337 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15338 class-key attributes :: [opt] nested-name-specifier [opt]
15339 template [opt] template-id
15340 enum attributes :: [opt] nested-name-specifier [opt] identifier
15342 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15343 declared `friend'. If IS_DECLARATION is TRUE, then this
15344 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15345 something is being declared.
15347 Returns the TYPE specified. */
15349 static tree
15353 {
15355 tree identifier;
15358 tree globalscope;
15361 /* See if we're looking at the `enum' keyword. */
15363 {
15364 /* Consume the `enum' token. */
15366 /* Remember that it's an enumeration type. */
15368 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15369 enums) is used here. */
15372 {
15376 /* Consume the `struct' or `class' and parse it anyway. */
15378 }
15379 /* Parse the attributes. */
15381 }
15382 /* Or, it might be `typename'. */
15384 RID_TYPENAME))
15385 {
15386 /* Consume the `typename' token. */
15388 /* Remember that it's a `typename' type. */
15390 }
15391 /* Otherwise it must be a class-key. */
15392 else
15393 {
15397 /* Parse the attributes. */
15399 }
15401 /* Look for the `::' operator. */
15404 /* Look for the nested-name-specifier. */
15406 {
15411 is_declaration))
15413 }
15414 else
15415 /* Even though `typename' is not present, the proposed resolution
15416 to Core Issue 180 says that in `class A<T>::B', `B' should be
15417 considered a type-name, even if `A<T>' is dependent. */
15422 is_declaration);
15423 /* For everything but enumeration types, consider a template-id.
15424 For an enumeration type, consider only a plain identifier. */
15426 {
15428 tree decl;
15430 /* Allow the `template' keyword. */
15432 /* If we didn't see `template', we don't know if there's a
15433 template-id or not. */
15436 /* Parse the template-id. */
15440 tag_type,
15441 is_declaration);
15442 /* If we didn't find a template-id, look for an ordinary
15443 identifier. */
15445 ;
15446 /* We can get here when cp_parser_template_id, called by
15447 cp_parser_class_name with tag_type == none_type, succeeds
15448 and caches a BASELINK. Then, when called again here,
15449 instead of failing and returning an error_mark_node
15450 returns it (see template/typename17.C in C++11).
15451 ??? Could we diagnose this earlier? */
15453 {
15456 }
15457 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15458 in effect, then we must assume that, upon instantiation, the
15459 template will correspond to a class. */
15463 typename_type,
15465 /* If the `typename' keyword is in effect and DECL is not a type
15466 decl, then type is non existent. */
15468 ;
15474 }
15477 {
15482 {
15485 }
15487 /* For a `typename', we needn't call xref_tag. */
15493 /* Template parameter lists apply only if we are not within a
15494 function parameter list. */
15495 bool template_parm_lists_apply
15504 /* Look up a qualified name in the usual way. */
15506 {
15507 tree decl;
15508 tree ambiguous_decls;
15511 tag_type,
15518 /* If the lookup was ambiguous, an error will already have been
15519 issued. */
15523 /* If we are parsing friend declaration, DECL may be a
15524 TEMPLATE_DECL tree node here. However, we need to check
15525 whether this TEMPLATE_DECL results in valid code. Consider
15526 the following example:
15528 namespace N {
15529 template <class T> class C {};
15530 }
15531 class X {
15532 template <class T> friend class N::C; // #1, valid code
15533 };
15534 template <class T> class Y {
15535 friend class N::C; // #2, invalid code
15536 };
15538 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15539 name lookup of `N::C'. We see that friend declaration must
15540 be template for the code to be valid. Note that
15541 processing_template_decl does not work here since it is
15542 always 1 for the above two cases. */
15544 decl = (cp_parser_maybe_treat_template_as_class
15549 {
15551 identifier,
15554 }
15557 {
15561 allow_template);
15565 }
15567 /* Forward declarations of nested types, such as
15569 class C1::C2;
15570 class C1::C2::C3;
15572 are invalid unless all components preceding the final '::'
15573 are complete. If all enclosing types are complete, these
15574 declarations become merely pointless.
15576 Invalid forward declarations of nested types are errors
15577 caught elsewhere in parsing. Those that are pointless arrive
15578 here. */
15585 }
15586 else
15587 {
15588 /* An elaborated-type-specifier sometimes introduces a new type and
15589 sometimes names an existing type. Normally, the rule is that it
15590 introduces a new type only if there is not an existing type of
15591 the same name already in scope. For example, given:
15593 struct S {};
15594 void f() { struct S s; }
15596 the `struct S' in the body of `f' is the same `struct S' as in
15597 the global scope; the existing definition is used. However, if
15598 there were no global declaration, this would introduce a new
15599 local class named `S'.
15601 An exception to this rule applies to the following code:
15603 namespace N { struct S; }
15605 Here, the elaborated-type-specifier names a new type
15606 unconditionally; even if there is already an `S' in the
15607 containing scope this declaration names a new type.
15608 This exception only applies if the elaborated-type-specifier
15609 forms the complete declaration:
15611 [class.name]
15613 A declaration consisting solely of `class-key identifier ;' is
15614 either a redeclaration of the name in the current scope or a
15615 forward declaration of the identifier as a class name. It
15616 introduces the name into the current scope.
15618 We are in this situation precisely when the next token is a `;'.
15620 An exception to the exception is that a `friend' declaration does
15621 *not* name a new type; i.e., given:
15623 struct S { friend struct T; };
15625 `T' is not a new type in the scope of `S'.
15627 Also, `new struct S' or `sizeof (struct S)' never results in the
15628 definition of a new type; a new type can only be declared in a
15629 declaration context. */
15631 tag_scope ts;
15635 /* Friends have special name lookup rules. */
15639 CPP_SEMICOLON))
15640 /* This is a `class-key identifier ;' */
15642 else
15645 template_p =
15646 (template_parm_lists_apply
15649 /* An unqualified name was used to reference this type, so
15650 there were no qualifying templates. */
15658 }
15659 }
15664 /* Allow attributes on forward declarations of classes. */
15666 {
15676 else
15679 }
15682 {
15683 /* Indicate whether this class was declared as a `class' or as a
15684 `struct'. */
15688 }
15690 /* A "<" cannot follow an elaborated type specifier. If that
15691 happens, the user was probably trying to form a template-id. */
15696 }
15698 /* Parse an enum-specifier.
15700 enum-specifier:
15701 enum-head { enumerator-list [opt] }
15702 enum-head { enumerator-list , } [C++0x]
15704 enum-head:
15705 enum-key identifier [opt] enum-base [opt]
15706 enum-key nested-name-specifier identifier enum-base [opt]
15708 enum-key:
15709 enum
15710 enum class [C++0x]
15711 enum struct [C++0x]
15713 enum-base: [C++0x]
15714 : type-specifier-seq
15716 opaque-enum-specifier:
15717 enum-key identifier enum-base [opt] ;
15719 GNU Extensions:
15720 enum-key attributes[opt] identifier [opt] enum-base [opt]
15721 { enumerator-list [opt] }attributes[opt]
15722 enum-key attributes[opt] identifier [opt] enum-base [opt]
15723 { enumerator-list, }attributes[opt] [C++0x]
15725 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15726 if the token stream isn't an enum-specifier after all. */
15728 static tree
15730 {
15731 tree identifier;
15733 tree prev_scope;
15735 tree attributes;
15748 /* Parse tentatively so that we can back up if we don't find a
15749 enum-specifier. */
15752 /* Caller guarantees that the current token is 'enum', an identifier
15753 possibly follows, and the token after that is an opening brace.
15754 If we don't have an identifier, fabricate an anonymous name for
15755 the enumeration being defined. */
15758 /* Parse the "class" or "struct", which indicates a scoped
15759 enumeration type in C++0x. */
15762 {
15766 /* Consume the `struct' or `class' token. */
15770 }
15774 /* Clear the qualification. */
15779 /* Figure out in what scope the declaration is being placed. */
15785 nested_name_specifier
15793 {
15794 tree name;
15798 enum_type,
15803 input_location);
15805 {
15808 {
15809 /* Are template enums allowed in ISO? */
15813 /* ignore a typename reference, for it will be solved by name
15814 in start_enum. */
15816 }
15817 }
15820 else
15823 }
15824 else
15825 {
15828 else
15829 {
15835 }
15836 }
15839 /* Check for the `:' that denotes a specified underlying type in C++0x.
15840 Note that a ':' could also indicate a bitfield width, however. */
15842 {
15843 cp_decl_specifier_seq type_specifiers;
15845 /* Consume the `:'. */
15848 /* Parse the type-specifier-seq. */
15853 /* At this point this is surely not elaborated type specifier. */
15862 /* If that didn't work, stop. */
15864 {
15870 }
15871 }
15873 /* Look for the `{' but don't consume it yet. */
15875 {
15877 {
15880 {
15883 }
15884 }
15885 /* An opaque-enum-specifier must have a ';' here. */
15888 {
15891 {
15894 }
15895 }
15896 }
15902 {
15904 {
15908 }
15910 {
15912 }
15913 }
15915 /* Issue an error message if type-definitions are forbidden here. */
15918 else
15919 /* Create the new type. We do this before consuming the opening
15920 brace so the enum will be recorded as being on the line of its
15921 tag (or the 'enum' keyword, if there is no tag). */
15925 /* If the next token is not '{' it is an opaque-enum-specifier or an
15926 elaborated-type-specifier. */
15928 {
15932 {
15933 /* The following catches invalid code such as:
15934 enum class S<int>::E { A, B, C }; */
15942 {
15946 nested_name_specifier);
15948 }
15949 /* If that scope does not contain the scope in which the
15950 class was originally declared, the program is invalid. */
15952 nested_name_specifier))
15953 {
15956 "declaration of %qD in namespace %qD which does not "
15959 else
15961 "declaration of %qD in %qD which does not "
15965 }
15966 }
15971 /* Consume the opening brace. */
15978 {
15982 }
15983 else
15984 {
15990 }
15994 /* If the next token is not '}', then there are some enumerators. */
15996 {
16000 }
16001 else
16004 /* Consume the final '}'. */
16010 }
16011 else
16012 {
16013 /* If a ';' follows, then it is an opaque-enum-specifier
16014 and additional restrictions apply. */
16016 {
16023 }
16024 }
16026 /* Look for trailing attributes to apply to this enumeration, and
16027 apply them if appropriate. */
16029 {
16033 trailing_attr,
16035 }
16037 /* Finish up the enumeration. */
16039 {
16044 }
16047 {
16049 {
16052 }
16054 {
16056 }
16057 }
16058 out:
16061 }
16063 /* Parse an enumerator-list. The enumerators all have the indicated
16064 TYPE.
16066 enumerator-list:
16067 enumerator-definition
16068 enumerator-list , enumerator-definition */
16070 static void
16072 {
16074 {
16075 /* Parse an enumerator-definition. */
16078 /* If the next token is not a ',', we've reached the end of
16079 the list. */
16082 /* Otherwise, consume the `,' and keep going. */
16084 /* If the next token is a `}', there is a trailing comma. */
16086 {
16091 }
16092 }
16093 }
16095 /* Parse an enumerator-definition. The enumerator has the indicated
16096 TYPE.
16098 enumerator-definition:
16099 enumerator
16100 enumerator = constant-expression
16102 enumerator:
16103 identifier */
16105 static void
16107 {
16108 tree identifier;
16109 tree value;
16110 location_t loc;
16112 /* Save the input location because we are interested in the location
16113 of the identifier and not the location of the explicit value. */
16116 /* Look for the identifier. */
16121 /* If the next token is an '=', then there is an explicit value. */
16123 {
16124 /* Consume the `=' token. */
16126 /* Parse the value. */
16128 }
16129 else
16132 /* If we are processing a template, make sure the initializer of the
16133 enumerator doesn't contain any bare template parameter pack. */
16137 /* Create the enumerator. */
16139 }
16141 /* Parse a namespace-name.
16143 namespace-name:
16144 original-namespace-name
16145 namespace-alias
16147 Returns the NAMESPACE_DECL for the namespace. */
16149 static tree
16151 {
16152 tree identifier;
16153 tree namespace_decl;
16157 /* Get the name of the namespace. */
16162 /* Look up the identifier in the currently active scope. Look only
16163 for namespaces, due to:
16165 [basic.lookup.udir]
16167 When looking up a namespace-name in a using-directive or alias
16168 definition, only namespace names are considered.
16170 And:
16172 [basic.lookup.qual]
16174 During the lookup of a name preceding the :: scope resolution
16175 operator, object, function, and enumerator names are ignored.
16177 (Note that cp_parser_qualifying_entity only calls this
16178 function if the token after the name is the scope resolution
16179 operator.) */
16181 none_type,
16187 /* If it's not a namespace, issue an error. */
16190 {
16195 }
16198 }
16200 /* Parse a namespace-definition.
16202 namespace-definition:
16203 named-namespace-definition
16204 unnamed-namespace-definition
16206 named-namespace-definition:
16207 original-namespace-definition
16208 extension-namespace-definition
16210 original-namespace-definition:
16211 namespace identifier { namespace-body }
16213 extension-namespace-definition:
16214 namespace original-namespace-name { namespace-body }
16216 unnamed-namespace-definition:
16217 namespace { namespace-body } */
16219 static void
16221 {
16228 {
16232 }
16233 else
16236 /* Look for the `namespace' keyword. */
16239 /* Get the name of the namespace. We do not attempt to distinguish
16240 between an original-namespace-definition and an
16241 extension-namespace-definition at this point. The semantic
16242 analysis routines are responsible for that. */
16245 else
16248 /* Parse any specified attributes. */
16251 /* Look for the `{' to start the namespace. */
16253 /* Start the namespace. */
16256 /* "inline namespace" is equivalent to a stub namespace definition
16257 followed by a strong using directive. */
16259 {
16261 /* Set up namespace association. */
16265 /* Import the contents of the inline namespace. */
16269 }
16273 /* Parse the body of the namespace. */
16279 /* Finish the namespace. */
16281 /* Look for the final `}'. */
16283 }
16285 /* Parse a namespace-body.
16287 namespace-body:
16288 declaration-seq [opt] */
16290 static void
16292 {
16294 }
16296 /* Parse a namespace-alias-definition.
16298 namespace-alias-definition:
16299 namespace identifier = qualified-namespace-specifier ; */
16301 static void
16303 {
16304 tree identifier;
16305 tree namespace_specifier;
16309 /* Look for the `namespace' keyword. */
16311 /* Look for the identifier. */
16315 /* Look for the `=' token. */
16318 {
16320 /* Skip the definition. */
16325 }
16327 /* Look for the qualified-namespace-specifier. */
16328 namespace_specifier
16330 /* Look for the `;' token. */
16333 /* Register the alias in the symbol table. */
16335 }
16337 /* Parse a qualified-namespace-specifier.
16339 qualified-namespace-specifier:
16340 :: [opt] nested-name-specifier [opt] namespace-name
16342 Returns a NAMESPACE_DECL corresponding to the specified
16343 namespace. */
16345 static tree
16347 {
16348 /* Look for the optional `::'. */
16352 /* Look for the optional nested-name-specifier. */
16360 }
16362 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16363 access declaration.
16365 using-declaration:
16366 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16367 using :: unqualified-id ;
16369 access-declaration:
16370 qualified-id ;
16372 */
16374 static bool
16377 {
16381 tree decl;
16382 tree identifier;
16383 tree qscope;
16388 {
16391 }
16392 else
16393 {
16394 /* Look for the `using' keyword. */
16397 /* Peek at the next token. */
16399 /* See if it's `typename'. */
16401 {
16402 /* Remember that we've seen it. */
16404 /* Consume the `typename' token. */
16406 }
16407 }
16409 /* Look for the optional global scope qualification. */
16410 global_scope_p
16415 /* If we saw `typename', or didn't see `::', then there must be a
16416 nested-name-specifier present. */
16418 {
16424 {
16427 }
16428 }
16429 /* Otherwise, we could be in either of the two productions. In that
16430 case, treat the nested-name-specifier as optional. */
16431 else
16443 /* Something has already gone wrong; there's no need to parse
16444 further. Since an error has occurred, the return value of
16445 cp_parser_parse_definitely will be false, as required. */
16449 /* Parse the unqualified-id. */
16457 {
16462 }
16464 /* The function we call to handle a using-declaration is different
16465 depending on what scope we are in. */
16467 ;
16470 /* [namespace.udecl]
16472 A using declaration shall not name a template-id. */
16475 else
16476 {
16478 {
16479 /* Create the USING_DECL. */
16486 {
16489 }
16490 else
16491 /* Add it to the list of members in this class. */
16493 }
16494 else
16495 {
16497 identifier,
16504 {
16507 }
16510 else
16512 }
16513 }
16515 /* Look for the final `;'. */
16520 "access declarations are deprecated "
16521 "in favour of using-declarations; "
16525 }
16527 /* Parse an alias-declaration.
16529 alias-declaration:
16530 using identifier attribute-specifier-seq [opt] = type-id */
16532 static tree
16534 {
16536 location_t id_location;
16538 cp_decl_specifier_seq decl_specs;
16542 /* Look for the `using' keyword. */
16543 cp_token *using_token
16565 /* Now we are going to parse the type-id of the declaration. */
16567 /*
16568 [dcl.type]/3 says:
16570 "A type-specifier-seq shall not define a class or enumeration
16571 unless it appears in the type-id of an alias-declaration (7.1.3) that
16572 is not the declaration of a template-declaration."
16574 In other words, if we currently are in an alias template, the
16575 type-id should not define a type.
16577 So let's set parser->type_definition_forbidden_message in that
16578 case; cp_parser_check_type_definition (called by
16579 cp_parser_class_specifier) will then emit an error if a type is
16580 defined in the type-id. */
16582 {
16586 }
16590 /* Restore the error message if need be. */
16596 {
16599 }
16601 /* A typedef-name can also be introduced by an alias-declaration. The
16602 identifier following the using keyword becomes a typedef-name. It has
16603 the same semantics as if it were introduced by the typedef
16604 specifier. In particular, it does not define a new type and it shall
16605 not appear in the type-id. */
16610 {
16613 ds_attribute,
16614 attrs_token);
16615 }
16617 ds_typedef,
16618 using_token);
16620 ds_alias,
16621 using_token);
16630 else
16641 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16642 added into the symbol table; otherwise, return the TYPE_DECL. */
16646 {
16650 }
16653 }
16655 /* Parse a using-directive.
16657 using-directive:
16658 using namespace :: [opt] nested-name-specifier [opt]
16659 namespace-name ; */
16661 static void
16663 {
16664 tree namespace_decl;
16665 tree attribs;
16667 /* Look for the `using' keyword. */
16669 /* And the `namespace' keyword. */
16671 /* Look for the optional `::' operator. */
16673 /* And the optional nested-name-specifier. */
16679 /* Get the namespace being used. */
16681 /* And any specified attributes. */
16683 /* Update the symbol table. */
16685 /* Look for the final `;'. */
16687 }
16689 /* Parse an asm-definition.
16691 asm-definition:
16692 asm ( string-literal ) ;
16694 GNU Extension:
16696 asm-definition:
16697 asm volatile [opt] ( string-literal ) ;
16698 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16699 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16700 : asm-operand-list [opt] ) ;
16701 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16702 : asm-operand-list [opt]
16703 : asm-clobber-list [opt] ) ;
16704 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16705 : asm-clobber-list [opt]
16706 : asm-goto-list ) ; */
16708 static void
16710 {
16711 tree string;
16716 tree asm_stmt;
16724 /* Look for the `asm' keyword. */
16729 {
16732 }
16734 /* See if the next token is `volatile'. */
16737 {
16738 /* Remember that we saw the `volatile' keyword. */
16740 /* Consume the token. */
16742 }
16746 {
16747 /* Remember that we saw the `goto' keyword. */
16749 /* Consume the token. */
16751 }
16752 /* Look for the opening `('. */
16755 /* Look for the string. */
16758 {
16762 }
16764 /* If we're allowing GNU extensions, check for the extended assembly
16765 syntax. Unfortunately, the `:' tokens need not be separated by
16766 a space in C, and so, for compatibility, we tolerate that here
16767 too. Doing that means that we have to treat the `::' operator as
16768 two `:' tokens. */
16773 {
16778 /* The extended syntax was used. */
16781 /* Look for outputs. */
16783 {
16784 /* Consume the `:'. */
16786 /* Parse the output-operands. */
16788 CPP_COLON)
16790 CPP_SCOPE)
16792 CPP_CLOSE_PAREN)
16798 }
16799 /* If the next token is `::', there are no outputs, and the
16800 next token is the beginning of the inputs. */
16802 /* The inputs are coming next. */
16805 /* Look for inputs. */
16808 {
16809 /* Consume the `:' or `::'. */
16811 /* Parse the output-operands. */
16813 CPP_COLON)
16815 CPP_SCOPE)
16817 CPP_CLOSE_PAREN))
16822 }
16824 /* The clobbers are coming next. */
16827 /* Look for clobbers. */
16830 {
16832 /* Consume the `:' or `::'. */
16834 /* Parse the clobbers. */
16836 CPP_COLON)
16838 CPP_CLOSE_PAREN))
16840 }
16843 /* The labels are coming next. */
16846 /* Look for labels. */
16849 {
16851 /* Consume the `:' or `::'. */
16853 /* Parse the labels. */
16855 }
16859 }
16863 /* Look for the closing `)'. */
16871 {
16872 /* Create the ASM_EXPR. */
16874 {
16877 /* If the extended syntax was not used, mark the ASM_EXPR. */
16879 {
16885 }
16886 }
16887 else
16889 }
16890 }
16892 /* Declarators [gram.dcl.decl] */
16894 /* Parse an init-declarator.
16896 init-declarator:
16897 declarator initializer [opt]
16899 GNU Extension:
16901 init-declarator:
16902 declarator asm-specification [opt] attributes [opt] initializer [opt]
16904 function-definition:
16905 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16906 function-body
16907 decl-specifier-seq [opt] declarator function-try-block
16909 GNU Extension:
16911 function-definition:
16912 __extension__ function-definition
16914 TM Extension:
16916 function-definition:
16917 decl-specifier-seq [opt] declarator function-transaction-block
16919 The DECL_SPECIFIERS apply to this declarator. Returns a
16920 representation of the entity declared. If MEMBER_P is TRUE, then
16921 this declarator appears in a class scope. The new DECL created by
16922 this declarator is returned.
16924 The CHECKS are access checks that should be performed once we know
16925 what entity is being declared (and, therefore, what classes have
16926 befriended it).
16928 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16929 for a function-definition here as well. If the declarator is a
16930 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16931 be TRUE upon return. By that point, the function-definition will
16932 have been completely parsed.
16934 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16935 is FALSE.
16937 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16938 parsed declaration if it is an uninitialized single declarator not followed
16939 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16940 if present, will not be consumed. If returned, this declarator will be
16941 created with SD_INITIALIZED but will not call cp_finish_decl.
16943 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16944 and there is an initializer, the pointed location_t is set to the
16945 location of the '=' or `(', or '{' in C++11 token introducing the
16946 initializer. */
16948 static tree
16958 {
16962 tree prefix_attributes;
16964 tree asm_specification;
16965 tree initializer;
16967 tree scope;
16969 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16970 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16971 "(...)". */
16982 /* Gather the attributes that were provided with the
16983 decl-specifiers. */
16986 /* Assume that this is not the declarator for a function
16987 definition. */
16991 /* Default arguments are only permitted for function parameters. */
16995 /* Defer access checks while parsing the declarator; we cannot know
16996 what names are accessible until we know what is being
16997 declared. */
17000 /* Parse the declarator. */
17002 declarator
17007 /* Gather up the deferred checks. */
17012 /* If the DECLARATOR was erroneous, there's no need to go
17013 further. */
17017 /* Check that the number of template-parameter-lists is OK. */
17027 /* Figure out what scope the entity declared by the DECLARATOR is
17028 located in. `grokdeclarator' sometimes changes the scope, so
17029 we compute it now. */
17032 /* Perform any lookups in the declared type which were thought to be
17033 dependent, but are not in the scope of the declarator. */
17034 decl_specifiers->type
17037 /* If we're allowing GNU extensions, look for an
17038 asm-specification. */
17040 {
17041 /* Look for an asm-specification. */
17044 }
17045 else
17048 /* Look for attributes. */
17052 /* Peek at the next token. */
17058 {
17059 /* Check to see if the token indicates the start of a
17060 function-definition. */
17062 {
17064 {
17065 /* If a function-definition should not appear here, issue an
17066 error message. */
17070 }
17072 location_t func_brace_location
17075 /* Neither attributes nor an asm-specification are allowed
17076 on a function-definition. */
17079 "an asm-specification is not allowed "
17083 "attributes are not allowed "
17085 /* This is a function-definition. */
17088 /* Parse the function definition. */
17091 decl_specifiers,
17092 declarator,
17093 prefix_attributes);
17094 else
17095 decl =
17096 (cp_parser_function_definition_from_specifiers_and_declarator
17100 {
17101 /* This is where the prologue starts... */
17104 }
17107 }
17108 }
17110 {
17111 /* A non-template declaration involving a function parameter list
17112 containing an implicit template parameter will be made into a
17113 template. If the resulting declaration is not going to be an
17114 actual function then finish the template scope here to prevent it.
17115 An error message will be issued once we have a decl to talk about.
17117 FIXME probably we should do type deduction rather than create an
17118 implicit template, but the standard currently doesn't allow it. */
17121 }
17123 /* [dcl.dcl]
17125 Only in function declarations for constructors, destructors, and
17126 type conversions can the decl-specifier-seq be omitted.
17128 We explicitly postpone this check past the point where we handle
17129 function-definitions because we tolerate function-definitions
17130 that are missing their return types in some modes. */
17132 {
17136 }
17138 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17142 {
17153 {
17159 }
17160 }
17161 else
17162 {
17163 /* If the init-declarator isn't initialized and isn't followed by a
17164 `,' or `;', it's not a valid init-declarator. */
17167 {
17170 else
17171 {
17175 }
17176 }
17179 }
17181 /* Because start_decl has side-effects, we should only call it if we
17182 know we're going ahead. By this point, we know that we cannot
17183 possibly be looking at any other construct. */
17186 /* Enter the newly declared entry in the symbol table. If we're
17187 processing a declaration in a class-specifier, we wait until
17188 after processing the initializer. */
17190 {
17197 /* Adjust location of decl if declarator->id_loc is more appropriate:
17198 set, and decl wasn't merged with another decl, in which case its
17199 location would be different from input_location, and more accurate. */
17204 }
17206 /* Enter the SCOPE. That way unqualified names appearing in the
17207 initializer will be looked up in SCOPE. */
17210 /* Perform deferred access control checks, now that we know in which
17211 SCOPE the declared entity resides. */
17213 {
17216 /* If the entity being declared is a function, pretend that we
17217 are in its scope. If it is a `friend', it may have access to
17218 things that would not otherwise be accessible. */
17220 {
17223 }
17225 /* Perform access checks for template parameters. */
17228 /* Perform the access control checks for the declarator and the
17229 decl-specifiers. */
17232 /* Restore the saved value. */
17235 }
17237 /* Parse the initializer. */
17242 {
17244 {
17247 else
17248 {
17249 /* If the declaration was erroneous, we don't really
17250 know what the user intended, so just silently
17251 consume the initializer. */
17258 }
17259 }
17260 else
17261 {
17262 /* We want to record the extra mangling scope for in-class
17263 initializers of class members and initializers of static data
17264 member templates. The former involves deferring
17265 parsing of the initializer until end of class as with default
17266 arguments. So right here we only handle the latter. */
17276 }
17277 }
17279 /* The old parser allows attributes to appear after a parenthesized
17280 initializer. Mark Mitchell proposed removing this functionality
17281 on the GCC mailing lists on 2002-08-13. This parser accepts the
17282 attributes -- but ignores them. */
17289 /* And now complain about a non-function implicit template. */
17294 /* For an in-class declaration, use `grokfield' to create the
17295 declaration. */
17297 {
17299 {
17302 }
17310 }
17312 /* Finish processing the declaration. But, skip member
17313 declarations. */
17315 {
17318 asm_specification,
17319 /* If the initializer is in parentheses, then this is
17320 a direct-initialization, which means that an
17321 `explicit' constructor is OK. Otherwise, an
17322 `explicit' constructor cannot be used. */
17325 }
17328 /* Core issue #226 (C++0x only): A default template-argument
17329 shall not be specified in a friend class template
17330 declaration. */
17339 {
17342 else
17344 }
17347 }
17349 /* Parse a declarator.
17351 declarator:
17352 direct-declarator
17353 ptr-operator declarator
17355 abstract-declarator:
17356 ptr-operator abstract-declarator [opt]
17357 direct-abstract-declarator
17359 GNU Extensions:
17361 declarator:
17362 attributes [opt] direct-declarator
17363 attributes [opt] ptr-operator declarator
17365 abstract-declarator:
17366 attributes [opt] ptr-operator abstract-declarator [opt]
17367 attributes [opt] direct-abstract-declarator
17369 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17370 detect constructor, destructor or conversion operators. It is set
17371 to -1 if the declarator is a name, and +1 if it is a
17372 function. Otherwise it is set to zero. Usually you just want to
17373 test for >0, but internally the negative value is used.
17375 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17376 a decl-specifier-seq unless it declares a constructor, destructor,
17377 or conversion. It might seem that we could check this condition in
17378 semantic analysis, rather than parsing, but that makes it difficult
17379 to handle something like `f()'. We want to notice that there are
17380 no decl-specifiers, and therefore realize that this is an
17381 expression, not a declaration.)
17383 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17384 the declarator is a direct-declarator of the form "(...)".
17386 MEMBER_P is true iff this declarator is a member-declarator.
17388 FRIEND_P is true iff this declarator is a friend. */
17392 cp_parser_declarator_kind dcl_kind,
17396 {
17399 cp_cv_quals cv_quals;
17400 tree class_type;
17403 /* Assume this is not a constructor, destructor, or type-conversion
17404 operator. */
17411 /* Check for the ptr-operator production. */
17413 /* Parse the ptr-operator. */
17419 /* If that worked, then we have a ptr-operator. */
17421 {
17422 /* If a ptr-operator was found, then this declarator was not
17423 parenthesized. */
17426 /* The dependent declarator is optional if we are parsing an
17427 abstract-declarator. */
17431 /* Parse the dependent declarator. */
17436 friend_p);
17438 /* If we are parsing an abstract-declarator, we must handle the
17439 case where the dependent declarator is absent. */
17444 declarator = cp_parser_make_indirect_declarator
17446 }
17447 /* Everything else is a direct-declarator. */
17448 else
17449 {
17452 CPP_OPEN_PAREN);
17454 ctor_dtor_or_conv_p,
17456 }
17461 }
17463 /* Parse a direct-declarator or direct-abstract-declarator.
17465 direct-declarator:
17466 declarator-id
17467 direct-declarator ( parameter-declaration-clause )
17468 cv-qualifier-seq [opt]
17469 ref-qualifier [opt]
17470 exception-specification [opt]
17471 direct-declarator [ constant-expression [opt] ]
17472 ( declarator )
17474 direct-abstract-declarator:
17475 direct-abstract-declarator [opt]
17476 ( parameter-declaration-clause )
17477 cv-qualifier-seq [opt]
17478 ref-qualifier [opt]
17479 exception-specification [opt]
17480 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17481 ( abstract-declarator )
17483 Returns a representation of the declarator. DCL_KIND is
17484 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17485 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17486 we are parsing a direct-declarator. It is
17487 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17488 of ambiguity we prefer an abstract declarator, as per
17489 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17490 as for cp_parser_declarator. */
17494 cp_parser_declarator_kind dcl_kind,
17497 {
17507 {
17508 /* Peek at the next token. */
17511 {
17512 /* This is either a parameter-declaration-clause, or a
17513 parenthesized declarator. When we know we are parsing a
17514 named declarator, it must be a parenthesized declarator
17515 if FIRST is true. For instance, `(int)' is a
17516 parameter-declaration-clause, with an omitted
17517 direct-abstract-declarator. But `((*))', is a
17518 parenthesized abstract declarator. Finally, when T is a
17519 template parameter `(T)' is a
17520 parameter-declaration-clause, and not a parenthesized
17521 named declarator.
17523 We first try and parse a parameter-declaration-clause,
17524 and then try a nested declarator (if FIRST is true).
17526 It is not an error for it not to be a
17527 parameter-declaration-clause, even when FIRST is
17528 false. Consider,
17530 int i (int);
17531 int i (3);
17533 The first is the declaration of a function while the
17534 second is the definition of a variable, including its
17535 initializer.
17537 Having seen only the parenthesis, we cannot know which of
17538 these two alternatives should be selected. Even more
17539 complex are examples like:
17541 int i (int (a));
17542 int i (int (3));
17544 The former is a function-declaration; the latter is a
17545 variable initialization.
17547 Thus again, we try a parameter-declaration-clause, and if
17548 that fails, we back out and return. */
17551 {
17552 tree params;
17555 /* In a member-declarator, the only valid interpretation
17556 of a parenthesis is the start of a
17557 parameter-declaration-clause. (It is invalid to
17558 initialize a static data member with a parenthesized
17559 initializer; only the "=" form of initialization is
17560 permitted.) */
17564 /* Consume the `('. */
17567 {
17568 /* If this is going to be an abstract declarator, we're
17569 in a declarator and we can't have default args. */
17572 }
17576 /* Parse the parameter-declaration-clause. */
17579 /* Consume the `)'. */
17582 /* If all went well, parse the cv-qualifier-seq,
17583 ref-qualifier and the exception-specification. */
17585 {
17586 cp_cv_quals cv_quals;
17587 cp_virt_specifiers virt_specifiers;
17588 cp_ref_qualifier ref_qual;
17589 tree exception_specification;
17590 tree late_return;
17591 tree attrs;
17601 /* Parse the cv-qualifier-seq. */
17603 /* Parse the ref-qualifier. */
17605 /* And the exception-specification. */
17606 exception_specification
17611 /* In here, we handle cases where attribute is used after
17612 the function declaration. For example:
17613 void func (int x) __attribute__((vector(..))); */
17616 {
17620 CPP_SEMICOLON)
17622 CPP_OPEN_BRACE))
17625 ;
17626 else
17628 }
17629 late_return = (cp_parser_late_return_type_opt
17634 /* Parse the virt-specifier-seq. */
17637 /* Create the function-declarator. */
17639 params,
17640 cv_quals,
17641 virt_specifiers,
17642 ref_qual,
17643 exception_specification,
17644 late_return);
17646 /* Any subsequent parameter lists are to do with
17647 return type, so are not those of the declared
17648 function. */
17650 }
17652 /* Remove the function parms from scope. */
17656 /* Repeat the main loop. */
17658 }
17660 /* If this is the first, we can try a parenthesized
17661 declarator. */
17663 {
17669 /* Consume the `('. */
17671 /* Parse the nested declarator. */
17674 declarator
17680 /* Expect a `)'. */
17687 }
17688 /* Otherwise, we must be done. */
17689 else
17691 }
17695 {
17696 /* Parse an array-declarator. */
17705 /* Consume the `['. */
17707 /* Peek at the next token. */
17709 /* If the next token is `]', then there is no
17710 constant-expression. */
17712 {
17714 bounds
17724 {
17725 /* Normally, the array bound must be an integral constant
17726 expression. However, as an extension, we allow VLAs
17727 in function scopes as long as they aren't part of a
17728 parameter declaration. */
17732 }
17735 {
17736 /* Remember this wasn't a constant-expression. */
17739 }
17740 }
17741 else
17743 /* Look for the closing `]'. */
17745 {
17748 }
17753 }
17755 {
17756 {
17757 tree qualifying_scope;
17758 tree unqualified_name;
17759 tree attrs;
17760 special_function_kind sfk;
17765 /* Parse a declarator-id */
17768 {
17771 /* If we see an ellipsis, we should be looking at a
17772 parameter pack. */
17774 {
17775 /* Consume the `...' */
17779 }
17780 }
17783 unqualified_name
17787 {
17791 {
17792 /* Check whether an error occurred. */
17795 /* We already consumed the ellipsis to mark a
17796 parameter pack, but we have no way to report it,
17797 so abort the tentative parse. We will be exiting
17798 immediately anyway. */
17800 }
17801 else
17807 && (qualifying_scope
17809 {
17812 }
17813 }
17818 {
17823 }
17829 {
17830 /* In the declaration of a member of a template class
17831 outside of the class itself, the SCOPE will sometimes
17832 be a TYPENAME_TYPE. For example, given:
17834 template <typename T>
17835 int S<T>::R::i = 3;
17837 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17838 this context, we must resolve S<T>::R to an ordinary
17839 type, rather than a typename type.
17841 The reason we normally avoid resolving TYPENAME_TYPEs
17842 is that a specialization of `S' might render
17843 `S<T>::R' not a type. However, if `S' is
17844 specialized, then this `i' will not be used, so there
17845 is no harm in resolving the types here. */
17846 tree type;
17848 /* Resolve the TYPENAME_TYPE. */
17851 /* If that failed, the declarator is invalid. */
17853 {
17856 "cannot define member of dependent typedef "
17858 else
17863 }
17865 }
17870 {
17871 tree class_type;
17876 else
17880 {
17883 {
17886 {
17890 "use %<%T::%D%> instead of %<%T::%D%> to "
17892 class_type,
17897 }
17898 else
17900 }
17901 else
17902 {
17903 /* We do not attempt to print the declarator
17904 here because we do not have enough
17905 information about its original syntactic
17906 form. */
17910 }
17911 }
17914 {
17920 for an anonymous type, even if the type
17921 got a name for linkage purposes. */
17923 /* Handle correctly (c++/19200):
17925 struct S {
17926 struct T{};
17927 friend void S(T);
17928 };
17930 and also:
17932 namespace N {
17933 void S();
17934 }
17936 struct S {
17937 friend void N::S();
17938 }; */
17939 && !(friend_p
17942 class_type))
17943 {
17946 }
17954 }
17955 }
17957 unqualified_name,
17958 sfk);
17965 }
17967 handle_declarator:;
17970 {
17971 /* Any names that appear after the declarator-id for a
17972 member are looked up in the containing scope. */
17974 {
17975 /* But declarations with qualified-ids can't appear in a
17976 function. */
17980 }
17982 }
17986 /* Default args are only allowed on function
17987 declarations. */
17989 else
17993 }
17994 /* We're done. */
17995 else
17997 }
17999 /* For an abstract declarator, we might wind up with nothing at this
18000 point. That's an error; the declarator is not optional. */
18004 /* If we entered a scope, we must exit it now. */
18012 }
18014 /* Parse a ptr-operator.
18016 ptr-operator:
18017 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18018 * cv-qualifier-seq [opt]
18019 &
18020 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18021 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18023 GNU Extension:
18025 ptr-operator:
18026 & cv-qualifier-seq [opt]
18028 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18029 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18030 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18031 filled in with the TYPE containing the member. *CV_QUALS is
18032 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18033 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18034 Note that the tree codes returned by this function have nothing
18035 to do with the types of trees that will be eventually be created
18036 to represent the pointer or reference type being parsed. They are
18037 just constants with suggestive names. */
18038 static enum tree_code
18043 {
18048 /* Assume that it's not a pointer-to-member. */
18050 /* And that there are no cv-qualifiers. */
18053 /* Peek at the next token. */
18056 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18066 {
18067 /* Consume the `*', `&' or `&&'. */
18070 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18071 `&', if we are allowing GNU extensions. (The only qualifier
18072 that can legally appear after `&' is `restrict', but that is
18073 enforced during semantic analysis. */
18081 }
18082 else
18083 {
18084 /* Try the pointer-to-member case. */
18086 /* Look for the optional `::' operator. */
18089 /* Look for the nested-name specifier. */
18096 /* If we found it, and the next token is a `*', then we are
18097 indeed looking at a pointer-to-member operator. */
18100 {
18101 /* Indicate that the `*' operator was used. */
18109 else
18110 {
18111 /* The type of which the member is a member is given by the
18112 current SCOPE. */
18114 /* The next name will not be qualified. */
18118 /* Look for optional c++11 attributes. */
18122 /* Look for the optional cv-qualifier-seq. */
18124 }
18125 }
18126 /* If that didn't work we don't have a ptr-operator. */
18129 }
18132 }
18134 /* Parse an (optional) cv-qualifier-seq.
18136 cv-qualifier-seq:
18137 cv-qualifier cv-qualifier-seq [opt]
18139 cv-qualifier:
18140 const
18141 volatile
18143 GNU Extension:
18145 cv-qualifier:
18146 __restrict__
18148 Returns a bitmask representing the cv-qualifiers. */
18150 static cp_cv_quals
18152 {
18156 {
18158 cp_cv_quals cv_qualifier;
18160 /* Peek at the next token. */
18162 /* See if it's a cv-qualifier. */
18164 {
18180 }
18186 {
18189 }
18190 else
18191 {
18194 }
18195 }
18198 }
18200 /* Parse an (optional) ref-qualifier
18202 ref-qualifier:
18203 &
18204 &&
18206 Returns cp_ref_qualifier representing ref-qualifier. */
18208 static cp_ref_qualifier
18210 {
18213 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18218 {
18223 {
18235 }
18240 {
18243 }
18244 else
18245 {
18248 }
18249 }
18252 }
18254 /* Parse an (optional) virt-specifier-seq.
18256 virt-specifier-seq:
18257 virt-specifier virt-specifier-seq [opt]
18259 virt-specifier:
18260 override
18261 final
18263 Returns a bitmask representing the virt-specifiers. */
18265 static cp_virt_specifiers
18267 {
18271 {
18273 cp_virt_specifiers virt_specifier;
18275 /* Peek at the next token. */
18277 /* See if it's a virt-specifier-qualifier. */
18281 {
18284 }
18286 {
18289 }
18291 {
18293 }
18294 else
18298 {
18301 }
18302 else
18303 {
18306 }
18307 }
18309 }
18311 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18312 is in scope even though it isn't real. */
18314 void
18316 {
18317 tree this_parm;
18320 {
18321 /* We don't clear this between NSDMIs. Is it already what we want? */
18326 }
18329 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18331 current_class_ref
18334 }
18336 /* Return true iff our current scope is a non-static data member
18337 initializer. */
18339 bool
18341 {
18342 /* We recognize NSDMI context by the context-less 'this' pointer set up
18343 by the function above. */
18349 }
18351 /* Parse a late-specified return type, if any. This is not a separate
18352 non-terminal, but part of a function declarator, which looks like
18354 -> trailing-type-specifier-seq abstract-declarator(opt)
18356 Returns the type indicated by the type-id.
18358 In addition to this this parses any queued up omp declare simd
18359 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18361 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18362 function. */
18364 static tree
18366 cp_cv_quals quals)
18367 {
18371 && declarator
18377 /* Peek at the next token. */
18379 /* A late-specified return type is indicated by an initial '->'. */
18386 {
18387 /* DR 1207: 'this' is in scope in the trailing return type. */
18389 }
18392 {
18393 /* Consume the ->. */
18397 }
18400 declarator->std_attributes
18404 declarator->std_attributes
18409 {
18412 }
18415 }
18417 /* Parse a declarator-id.
18419 declarator-id:
18420 id-expression
18421 :: [opt] nested-name-specifier [opt] type-name
18423 In the `id-expression' case, the value returned is as for
18424 cp_parser_id_expression if the id-expression was an unqualified-id.
18425 If the id-expression was a qualified-id, then a SCOPE_REF is
18426 returned. The first operand is the scope (either a NAMESPACE_DECL
18427 or TREE_TYPE), but the second is still just a representation of an
18428 unqualified-id. */
18430 static tree
18432 {
18433 tree id;
18434 /* The expression must be an id-expression. Assume that qualified
18435 names are the names of types so that:
18437 template <class T>
18438 int S<T>::R::i = 3;
18440 will work; we must treat `S<T>::R' as the name of a type.
18441 Similarly, assume that qualified names are templates, where
18442 required, so that:
18444 template <class T>
18445 int S<T>::R<T>::i = 3;
18447 will work, too. */
18453 optional_p);
18457 }
18459 /* Parse a type-id.
18461 type-id:
18462 type-specifier-seq abstract-declarator [opt]
18464 Returns the TYPE specified. */
18466 static tree
18469 {
18470 cp_decl_specifier_seq type_specifier_seq;
18473 /* Parse the type-specifier-seq. */
18475 is_trailing_return,
18480 /* There might or might not be an abstract declarator. */
18482 /* Look for the declarator. */
18483 abstract_declarator
18488 /* Check to see if there really was a declarator. */
18493 /* None of the valid uses of 'auto' in C++14 involve the type-id
18494 nonterminal, but it is valid in a trailing-return-type. */
18497 {
18498 /* A type-id with type 'auto' is only ok if the abstract declarator
18499 is a function declarator with a late-specified return type. */
18504 else
18505 {
18508 }
18509 }
18512 is_template_arg);
18513 }
18516 {
18518 }
18521 {
18522 tree r;
18524 parser->type_definition_forbidden_message
18529 {
18532 }
18534 }
18537 {
18539 }
18541 /* Parse a type-specifier-seq.
18543 type-specifier-seq:
18544 type-specifier type-specifier-seq [opt]
18546 GNU extension:
18548 type-specifier-seq:
18549 attributes type-specifier-seq [opt]
18551 If IS_DECLARATION is true, we are at the start of a "condition" or
18552 exception-declaration, so we might be followed by a declarator-id.
18554 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18555 i.e. we've just seen "->".
18557 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18559 static void
18564 {
18569 /* Clear the TYPE_SPECIFIER_SEQ. */
18572 /* In the context of a trailing return type, enum E { } is an
18573 elaborated-type-specifier followed by a function-body, not an
18574 enum-specifier. */
18578 /* Parse the type-specifiers and attributes. */
18580 {
18581 tree type_specifier;
18584 /* Check for attributes first. */
18586 {
18591 }
18593 /* record the token of the beginning of the type specifier seq,
18594 for error reporting purposes*/
18598 /* Look for the type-specifier. */
18600 flags,
18601 type_specifier_seq,
18603 NULL,
18606 {
18607 /* If the first type-specifier could not be found, this is not a
18608 type-specifier-seq at all. */
18610 {
18611 /* Set in_declarator_p to avoid skipping to the semicolon. */
18623 }
18624 /* If subsequent type-specifiers could not be found, the
18625 type-specifier-seq is complete. */
18627 }
18630 /* The standard says that a condition can be:
18632 type-specifier-seq declarator = assignment-expression
18634 However, given:
18636 struct S {};
18637 if (int S = ...)
18639 we should treat the "S" as a declarator, not as a
18640 type-specifier. The standard doesn't say that explicitly for
18641 type-specifier-seq, but it does say that for
18642 decl-specifier-seq in an ordinary declaration. Perhaps it
18643 would be clearer just to allow a decl-specifier-seq here, and
18644 then add a semantic restriction that if any decl-specifiers
18645 that are not type-specifiers appear, the program is invalid. */
18648 }
18649 }
18651 /* Return whether the function currently being declared has an associated
18652 template parameter list. */
18654 static bool
18656 {
18669 }
18671 /* Parse a parameter-declaration-clause.
18673 parameter-declaration-clause:
18674 parameter-declaration-list [opt] ... [opt]
18675 parameter-declaration-list , ...
18677 Returns a representation for the parameter declarations. A return
18678 value of NULL indicates a parameter-declaration-clause consisting
18679 only of an ellipsis. */
18681 static tree
18683 {
18684 tree parameters;
18693 parser->auto_is_implicit_function_template_parm_p
18695 }
18701 && !processing_template_parmlist
18707 /* Peek at the next token. */
18709 /* Check for trivial parameter-declaration-clauses. */
18711 {
18712 /* Consume the `...' token. */
18715 }
18717 /* There are no parameters. */
18718 {
18719 #ifndef NO_IMPLICIT_EXTERN_C
18724 else
18725 #endif
18727 }
18728 /* Check for `(void)', too, which is a special case. */
18732 {
18733 /* Consume the `void' token. */
18735 /* There are no parameters. */
18737 }
18739 /* Parse the parameter-declaration-list. */
18741 /* If a parse error occurred while parsing the
18742 parameter-declaration-list, then the entire
18743 parameter-declaration-clause is erroneous. */
18747 /* Peek at the next token. */
18749 /* If it's a `,', the clause should terminate with an ellipsis. */
18751 {
18752 /* Consume the `,'. */
18754 /* Expect an ellipsis. */
18755 ellipsis_p
18757 }
18758 /* It might also be `...' if the optional trailing `,' was
18759 omitted. */
18761 {
18762 /* Consume the `...' token. */
18764 /* And remember that we saw it. */
18766 }
18767 else
18770 /* Finish the parameter list. */
18775 }
18777 /* Parse a parameter-declaration-list.
18779 parameter-declaration-list:
18780 parameter-declaration
18781 parameter-declaration-list , parameter-declaration
18783 Returns a representation of the parameter-declaration-list, as for
18784 cp_parser_parameter_declaration_clause. However, the
18785 `void_list_node' is never appended to the list. Upon return,
18786 *IS_ERROR will be true iff an error occurred. */
18788 static tree
18790 {
18796 /* Assume all will go well. */
18798 /* The special considerations that apply to a function within an
18799 unbraced linkage specifications do not apply to the parameters
18800 to the function. */
18801 saved_in_unbraced_linkage_specification_p
18805 /* Look for more parameters. */
18807 {
18815 /* Parse the parameter. */
18816 parameter
18821 /* We don't know yet if the enclosing context is deprecated, so wait
18822 and warn in grokparms if appropriate. */
18826 {
18827 /* If a function parameter pack was specified and an implicit template
18828 parameter was introduced during cp_parser_parameter_declaration,
18829 change any implicit parameters introduced into packs. */
18833 {
18841 }
18845 PARM,
18848 }
18852 /* If a parse error occurred parsing the parameter declaration,
18853 then the entire parameter-declaration-list is erroneous. */
18855 {
18859 }
18869 {
18873 }
18875 /* Add the new parameter to the list. */
18879 /* Peek at the next token. */
18882 /* These are for Objective-C++ */
18885 /* The parameter-declaration-list is complete. */
18888 {
18891 /* Peek at the next token. */
18893 /* If it's an ellipsis, then the list is complete. */
18896 /* Otherwise, there must be more parameters. Consume the
18897 `,'. */
18899 /* When parsing something like:
18901 int i(float f, double d)
18903 we can tell after seeing the declaration for "f" that we
18904 are not looking at an initialization of a variable "i",
18905 but rather at the declaration of a function "i".
18907 Due to the fact that the parsing of template arguments
18908 (as specified to a template-id) requires backtracking we
18909 cannot use this technique when inside a template argument
18910 list. */
18914 /* However, a parameter-declaration of the form
18915 "float(f)" (which is a valid declaration of a
18916 parameter "f") can also be interpreted as an
18917 expression (the conversion of "f" to "float"). */
18920 }
18921 else
18922 {
18930 }
18931 }
18933 parser->in_unbraced_linkage_specification_p
18936 /* Reset implicit_template_scope if we are about to leave the function
18937 parameter list that introduced it. Note that for out-of-line member
18938 definitions, there will be one or more class scopes before we get to
18939 the template parameter scope. */
18943 {
18947 {
18950 }
18951 }
18954 }
18956 /* Parse a parameter declaration.
18958 parameter-declaration:
18959 decl-specifier-seq ... [opt] declarator
18960 decl-specifier-seq declarator = assignment-expression
18961 decl-specifier-seq ... [opt] abstract-declarator [opt]
18962 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18964 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18965 declares a template parameter. (In that case, a non-nested `>'
18966 token encountered during the parsing of the assignment-expression
18967 is not interpreted as a greater-than operator.)
18969 Returns a representation of the parameter, or NULL if an error
18970 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18971 true iff the declarator is of the form "(p)". */
18977 {
18979 cp_decl_specifier_seq decl_specifiers;
18981 tree default_argument;
18985 /* In a template parameter, `>' is not an operator.
18987 [temp.param]
18989 When parsing a default template-argument for a non-type
18990 template-parameter, the first non-nested `>' is taken as the end
18991 of the template parameter-list rather than a greater-than
18992 operator. */
18994 /* Type definitions may not appear in parameter types. */
18996 parser->type_definition_forbidden_message
18999 /* Parse the declaration-specifiers. */
19001 CP_PARSER_FLAGS_NONE,
19005 /* Complain about missing 'typename' or other invalid type names. */
19010 /* If an error occurred, there's no reason to attempt to parse the
19011 rest of the declaration. */
19013 {
19016 }
19018 /* Peek at the next token. */
19021 /* If the next token is a `)', `,', `=', `>', or `...', then there
19022 is no declarator. However, when variadic templates are enabled,
19023 there may be a declarator following `...'. */
19028 {
19032 }
19033 /* Otherwise, there should be a declarator. */
19034 else
19035 {
19039 /* After seeing a decl-specifier-seq, if the next token is not a
19040 "(", there is no possibility that the code is a valid
19041 expression. Therefore, if parsing tentatively, we commit at
19042 this point. */
19044 /* In an expression context, having seen:
19046 (int((char ...
19048 we cannot be sure whether we are looking at a
19049 function-type (taking a "char" as a parameter) or a cast
19050 of some object of type "char" to "int". */
19056 /* Parse the declarator. */
19059 CP_PARSER_DECLARATOR_EITHER,
19061 parenthesized_p,
19065 /* After the declarator, allow more attributes. */
19066 decl_specifiers.attributes
19069 }
19071 /* If the next token is an ellipsis, and we have not seen a
19072 declarator name, and the type of the declarator contains parameter
19073 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19074 a parameter pack expansion expression. Otherwise, leave the
19075 ellipsis for a C-style variadic function. */
19078 {
19089 {
19090 /* Consume the `...'. */
19094 /* Build a pack expansion type */
19097 else
19099 }
19100 }
19102 /* The restriction on defining new types applies only to the type
19103 of the parameter, not to the default argument. */
19106 /* If the next token is `=', then process a default argument. */
19108 {
19110 /* If we are defining a class, then the tokens that make up the
19111 default argument must be saved and processed later. */
19116 /* Outside of a class definition, we can just parse the
19117 assignment-expression. */
19118 else
19119 default_argument
19123 {
19126 else
19127 {
19129 "default arguments are only "
19132 }
19133 }
19137 {
19138 /* Find the name of the parameter pack. */
19145 template_parm_p
19151 else
19153 template_parm_p
19160 }
19161 }
19162 else
19166 declarator,
19167 default_argument);
19168 }
19170 /* Parse a default argument and return it.
19172 TEMPLATE_PARM_P is true if this is a default argument for a
19173 non-type template parameter. */
19174 static tree
19176 {
19182 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19183 set correctly. */
19186 /* Local variable names (and the `this' keyword) may not
19187 appear in a default argument. */
19190 /* Parse the assignment-expression. */
19195 /* The "this" pointer is not valid in a default argument. */
19197 {
19202 }
19203 default_argument
19205 /* Restore the "this" pointer. */
19207 {
19210 }
19219 }
19221 /* Parse a function-body.
19223 function-body:
19224 compound_statement */
19226 static void
19228 {
19230 }
19232 /* Parse a ctor-initializer-opt followed by a function-body. Return
19233 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19234 is true we are parsing a function-try-block. */
19236 static bool
19239 {
19247 /* Begin the function body. */
19249 /* Parse the optional ctor-initializer. */
19252 /* If we're parsing a constexpr constructor definition, we need
19253 to check that the constructor body is indeed empty. However,
19254 before we get to cp_parser_function_body lot of junk has been
19255 generated, so we can't just check that we have an empty block.
19256 Rather we take a snapshot of the outermost block, and check whether
19257 cp_parser_function_body changed its state. */
19259 {
19263 }
19264 /* Parse the function-body. */
19268 /* Finish the function body. */
19272 }
19274 /* Parse an initializer.
19276 initializer:
19277 = initializer-clause
19278 ( expression-list )
19280 Returns an expression representing the initializer. If no
19281 initializer is present, NULL_TREE is returned.
19283 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19284 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19285 set to TRUE if there is no initializer present. If there is an
19286 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19287 is set to true; otherwise it is set to false. */
19289 static tree
19292 {
19294 tree init;
19296 /* Peek at the next token. */
19299 /* Let our caller know whether or not this initializer was
19300 parenthesized. */
19302 /* Assume that the initializer is constant. */
19306 {
19307 /* Consume the `='. */
19309 /* Parse the initializer-clause. */
19311 }
19313 {
19318 non_constant_p);
19323 }
19325 {
19330 }
19331 else
19332 {
19333 /* Anything else is an error. */
19336 }
19339 }
19341 /* Parse an initializer-clause.
19343 initializer-clause:
19344 assignment-expression
19345 braced-init-list
19347 Returns an expression representing the initializer.
19349 If the `assignment-expression' production is used the value
19350 returned is simply a representation for the expression.
19352 Otherwise, calls cp_parser_braced_list. */
19354 static tree
19356 {
19357 tree initializer;
19359 /* Assume the expression is constant. */
19362 /* If it is not a `{', then we are looking at an
19363 assignment-expression. */
19365 {
19366 initializer
19369 non_constant_p);
19370 }
19371 else
19375 }
19377 /* Parse a brace-enclosed initializer list.
19379 braced-init-list:
19380 { initializer-list , [opt] }
19381 { }
19383 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19384 the elements of the initializer-list (or NULL, if the last
19385 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19386 NULL_TREE. There is no way to detect whether or not the optional
19387 trailing `,' was provided. NON_CONSTANT_P is as for
19388 cp_parser_initializer. */
19390 static tree
19392 {
19393 tree initializer;
19395 /* Consume the `{' token. */
19397 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19399 /* If it's not a `}', then there is a non-trivial initializer. */
19401 {
19402 /* Parse the initializer list. */
19405 /* A trailing `,' token is allowed. */
19408 }
19409 else
19411 /* Now, there should be a trailing `}'. */
19415 }
19417 /* Consume tokens up to, and including, the next non-nested closing `]'.
19418 Returns true iff we found a closing `]'. */
19420 static bool
19422 {
19426 {
19430 {
19433 /* If we've run out of tokens, then there is no closing `]'. */
19442 {
19445 }
19450 }
19452 /* Consume the token. */
19454 }
19455 }
19457 /* Return true if we are looking at an array-designator, false otherwise. */
19459 static bool
19461 {
19462 /* Consume the `['. */
19467 /* Skip tokens until the next token is a closing square bracket.
19468 If we find the closing `]', and the next token is a `=', then
19469 we are looking at an array designator. */
19470 bool array_designator_p
19474 /* Roll back the tokens we skipped. */
19478 }
19480 /* Parse an initializer-list.
19482 initializer-list:
19483 initializer-clause ... [opt]
19484 initializer-list , initializer-clause ... [opt]
19486 GNU Extension:
19488 initializer-list:
19489 designation initializer-clause ...[opt]
19490 initializer-list , designation initializer-clause ...[opt]
19492 designation:
19493 . identifier =
19494 identifier :
19495 [ constant-expression ] =
19497 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19498 for the initializer. If the INDEX of the elt is non-NULL, it is the
19499 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19500 as for cp_parser_initializer. */
19504 {
19507 /* Assume all of the expressions are constant. */
19510 /* Parse the rest of the list. */
19512 {
19514 tree designator;
19515 tree initializer;
19518 /* If the next token is an identifier and the following one is a
19519 colon, we are looking at the GNU designated-initializer
19520 syntax. */
19524 {
19525 /* Warn the user that they are using an extension. */
19528 /* Consume the identifier. */
19530 /* Consume the `:'. */
19532 }
19533 /* Also handle the C99 syntax, '. id ='. */
19538 {
19539 /* Warn the user that they are using an extension. */
19542 /* Consume the `.'. */
19544 /* Consume the identifier. */
19546 /* Consume the `='. */
19548 }
19549 /* Also handle C99 array designators, '[ const ] ='. */
19553 {
19554 /* In C++11, [ could start a lambda-introducer. */
19560 {
19563 }
19564 else
19565 {
19570 }
19576 }
19577 else
19580 /* Parse the initializer. */
19583 /* If any clause is non-constant, so is the entire initializer. */
19587 /* If we have an ellipsis, this is an initializer pack
19588 expansion. */
19590 {
19591 /* Consume the `...'. */
19594 /* Turn the initializer into an initializer expansion. */
19596 }
19598 /* Add it to the vector. */
19601 /* If the next token is not a comma, we have reached the end of
19602 the list. */
19606 /* Peek at the next token. */
19608 /* If the next token is a `}', then we're still done. An
19609 initializer-clause can have a trailing `,' after the
19610 initializer-list and before the closing `}'. */
19614 /* Consume the `,' token. */
19616 }
19619 }
19621 /* Classes [gram.class] */
19623 /* Parse a class-name.
19625 class-name:
19626 identifier
19627 template-id
19629 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19630 to indicate that names looked up in dependent types should be
19631 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19632 keyword has been used to indicate that the name that appears next
19633 is a template. TAG_TYPE indicates the explicit tag given before
19634 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19635 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19636 is the class being defined in a class-head.
19638 Returns the TYPE_DECL representing the class. */
19640 static tree
19648 {
19649 tree decl;
19650 tree scope;
19655 /* All class-names start with an identifier. */
19658 {
19661 }
19663 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19664 to a template-id, so we save it here. */
19669 /* Any name names a type if we're following the `typename' keyword
19670 in a qualified name where the enclosing scope is type-dependent. */
19673 /* Handle the common case (an identifier, but not a template-id)
19674 efficiently. */
19677 {
19681 /* Look for the identifier. */
19685 /* If the next token isn't an identifier, we are certainly not
19686 looking at a class-name. */
19689 /* If we know this is a type-name, there's no need to look it
19690 up. */
19693 else
19694 {
19695 tree ambiguous_decls;
19696 /* If we already know that this lookup is ambiguous, then
19697 we've already issued an error message; there's no reason
19698 to check again. */
19700 {
19703 }
19704 /* If the next token is a `::', then the name must be a type
19705 name.
19707 [basic.lookup.qual]
19709 During the lookup for a name preceding the :: scope
19710 resolution operator, object, function, and enumerator
19711 names are ignored. */
19714 /* Look up the name. */
19716 tag_type,
19719 check_dependency_p,
19723 {
19727 }
19728 }
19729 }
19730 else
19731 {
19732 /* Try a template-id. */
19734 check_dependency_p,
19735 tag_type,
19736 is_declaration);
19739 }
19743 /* If this is a typename, create a TYPENAME_TYPE. */
19745 {
19750 }
19754 /* Check to see that it is really the name of a class. */
19758 /* Situations like this:
19760 template <typename T> struct A {
19761 typename T::template X<int>::I i;
19762 };
19764 are problematic. Is `T::template X<int>' a class-name? The
19765 standard does not seem to be definitive, but there is no other
19766 valid interpretation of the following `::'. Therefore, those
19767 names are considered class-names. */
19768 {
19772 }
19776 /* In Objective-C 2.0, a classname followed by '.' starts a
19777 dot-syntax expression, and it's not a type-name. */
19789 }
19791 /* Parse a class-specifier.
19793 class-specifier:
19794 class-head { member-specification [opt] }
19796 Returns the TREE_TYPE representing the class. */
19798 static tree
19800 {
19801 tree type;
19815 /* Parse the class-head. */
19818 /* If the class-head was a semantic disaster, skip the entire body
19819 of the class. */
19821 {
19825 }
19827 /* Look for the `{'. */
19829 {
19832 }
19836 /* Issue an error message if type-definitions are forbidden here. */
19838 /* Remember that we are defining one more class. */
19840 /* Inside the class, surrounding template-parameter-lists do not
19841 apply. */
19842 saved_num_template_parameter_lists
19845 /* We are not in a function body. */
19848 /* Or in a loop. */
19851 /* Or in a switch. */
19854 /* We are not immediately inside an extern "lang" block. */
19855 saved_in_unbraced_linkage_specification_p
19859 /* Start the class. */
19861 {
19864 }
19868 /* If the type is erroneous, skip the entire body of the class. */
19870 else
19871 /* Parse the member-specification. */
19874 /* Look for the trailing `}'. */
19876 /* Look for trailing attributes to apply to this class. */
19884 /* We've finished a type definition. Check for the common syntax
19885 error of forgetting a semicolon after the definition. We need to
19886 be careful, as we can't just check for not-a-semicolon and be done
19887 with it; the user might have typed:
19889 class X { } c = ...;
19890 class X { } *p = ...;
19892 and so forth. Instead, enumerate all the possible tokens that
19893 might follow this production; if we don't see one of them, then
19894 complain and silently insert the semicolon. */
19895 {
19900 /* Don't try to parse c++11 attributes here. As per the
19901 grammar, that should be a task for
19902 cp_parser_decl_specifier_seq. */
19906 {
19917 /* While it's legal for type qualifiers and storage class
19918 specifiers to follow type definitions in the grammar, only
19919 compiler testsuites contain code like that. Assume that if
19920 we see such code, then what we're really seeing is a case
19921 like:
19923 class X { }
19924 const <type> var = ...;
19926 or
19928 class Y { }
19929 static <type> func (...) ...
19931 i.e. the qualifier or specifier applies to the next
19932 declaration. To do so, however, we need to look ahead one
19933 more token to see if *that* token is a type specifier.
19935 This code could be improved to handle:
19937 class Z { }
19938 static const <type> var = ...; */
19941 {
19944 /* Handling user-defined types here would be nice, but very
19945 tricky. */
19946 want_semicolon
19949 }
19953 }
19955 /* If we don't have a type, then something is very wrong and we
19956 shouldn't try to do anything clever. Likewise for not seeing the
19957 closing brace. */
19959 {
19960 cp_token_position prev
19971 else
19974 /* Unget one token and smash it to look as though we encountered
19975 a semicolon in the input stream. */
19980 }
19981 }
19983 /* If this class is not itself within the scope of another class,
19984 then we need to parse the bodies of all of the queued function
19985 definitions. Note that the queued functions defined in a class
19986 are not always processed immediately following the
19987 class-specifier for that class. Consider:
19989 struct A {
19990 struct B { void f() { sizeof (A); } };
19991 };
19993 If `f' were processed before the processing of `A' were
19994 completed, there would be no way to compute the size of `A'.
19995 Note that the nesting we are interested in here is lexical --
19996 not the semantic nesting given by TYPE_CONTEXT. In particular,
19997 for:
19999 struct A { struct B; };
20000 struct A::B { void f() { } };
20002 there is no need to delay the parsing of `A::B::f'. */
20004 {
20005 tree decl;
20012 /* In a first pass, parse default arguments to the functions.
20013 Then, in a second pass, parse the bodies of the functions.
20014 This two-phased approach handles cases like:
20016 struct S {
20017 void f() { g(); }
20018 void g(int i = 3);
20019 };
20021 */
20023 {
20025 /* If there are default arguments that have not yet been processed,
20026 take care of them now. */
20028 {
20033 }
20034 /* Make sure that any template parameters are in scope. */
20036 /* Parse the default argument expressions. */
20038 /* Remove any template parameters from the symbol table. */
20040 }
20042 /* Now parse any NSDMIs. */
20046 {
20048 {
20053 }
20056 }
20063 /* Now do some post-NSDMI bookkeeping. */
20069 /* Now parse the body of the functions. */
20071 {
20072 /* OpenMP UDRs need to be parsed before all other functions. */
20079 }
20080 else
20084 }
20085 else
20088 /* Put back any saved access checks. */
20091 /* Restore saved state. */
20095 parser->num_template_parameter_lists
20097 parser->in_unbraced_linkage_specification_p
20101 }
20103 static tree
20105 {
20106 tree ret;
20111 }
20113 /* Parse a class-head.
20115 class-head:
20116 class-key identifier [opt] base-clause [opt]
20117 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20118 class-key nested-name-specifier [opt] template-id
20119 base-clause [opt]
20121 class-virt-specifier:
20122 final
20124 GNU Extensions:
20125 class-key attributes identifier [opt] base-clause [opt]
20126 class-key attributes nested-name-specifier identifier base-clause [opt]
20127 class-key attributes nested-name-specifier [opt] template-id
20128 base-clause [opt]
20130 Upon return BASES is initialized to the list of base classes (or
20131 NULL, if there are none) in the same form returned by
20132 cp_parser_base_clause.
20134 Returns the TYPE of the indicated class. Sets
20135 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20136 involving a nested-name-specifier was used, and FALSE otherwise.
20138 Returns error_mark_node if this is not a class-head.
20140 Returns NULL_TREE if the class-head is syntactically valid, but
20141 semantically invalid in a way that means we should skip the entire
20142 body of the class. */
20144 static tree
20147 {
20148 tree nested_name_specifier;
20152 tree attributes;
20153 tree bases;
20163 /* Assume no nested-name-specifier will be present. */
20165 /* Assume no template parameter lists will be used in defining the
20166 type. */
20170 /* Look for the class-key. */
20175 /* Parse the attributes. */
20178 /* If the next token is `::', that is invalid -- but sometimes
20179 people do try to write:
20181 struct ::S {};
20183 Handle this gracefully by accepting the extra qualifier, and then
20184 issuing an error about it later if this really is a
20185 class-head. If it turns out just to be an elaborated type
20186 specifier, remain silent. */
20192 /* Determine the name of the class. Begin by looking for an
20193 optional nested-name-specifier. */
20195 nested_name_specifier
20201 /* If there was a nested-name-specifier, then there *must* be an
20202 identifier. */
20204 {
20206 /* Although the grammar says `identifier', it really means
20207 `class-name' or `template-name'. You are only allowed to
20208 define a class that has already been declared with this
20209 syntax.
20211 The proposed resolution for Core Issue 180 says that wherever
20212 you see `class T::X' you should treat `X' as a type-name.
20214 It is OK to define an inaccessible class; for example:
20216 class A { class B; };
20217 class A::B {};
20219 We do not know if we will see a class-name, or a
20220 template-name. We look for a class-name first, in case the
20221 class-name is a template-id; if we looked for the
20222 template-name first we would stop after the template-name. */
20227 class_type,
20231 /* If that didn't work, ignore the nested-name-specifier. */
20233 {
20239 }
20240 /* If we could not find a corresponding TYPE, treat this
20241 declaration like an unqualified declaration. */
20244 /* Otherwise, count the number of templates used in TYPE and its
20245 containing scopes. */
20246 else
20247 {
20248 tree scope;
20260 }
20261 }
20262 /* Otherwise, the identifier is optional. */
20263 else
20264 {
20265 /* We don't know whether what comes next is a template-id,
20266 an identifier, or nothing at all. */
20268 /* Check for a template-id. */
20273 class_key,
20275 /* If that didn't work, it could still be an identifier. */
20277 {
20279 {
20282 }
20283 else
20285 }
20286 else
20287 {
20290 }
20291 }
20296 {
20298 class_key,
20300 }
20303 /* If it's not a `:' or a `{' then we can't really be looking at a
20304 class-head, since a class-head only appears as part of a
20305 class-specifier. We have to detect this situation before calling
20306 xref_tag, since that has irreversible side-effects. */
20308 {
20312 }
20314 /* At this point, we're going ahead with the class-specifier, even
20315 if some other problem occurs. */
20318 {
20323 }
20324 /* Issue the error about the overly-qualified name now. */
20326 {
20331 }
20333 {
20338 }
20340 {
20341 tree scope;
20343 /* Reject typedef-names in class heads. */
20345 {
20348 type);
20351 }
20353 /* Figure out in what scope the declaration is being placed. */
20355 /* If that scope does not contain the scope in which the
20356 class was originally declared, the program is invalid. */
20358 {
20361 "declaration of %qD in namespace %qD which does not "
20364 else
20370 }
20371 /* [dcl.meaning]
20373 A declarator-id shall not be qualified except for the
20374 definition of a ... nested class outside of its class
20375 ... [or] the definition or explicit instantiation of a
20376 class member of a namespace outside of its namespace. */
20378 {
20383 }
20384 }
20385 /* An explicit-specialization must be preceded by "template <>". If
20386 it is not, try to recover gracefully. */
20390 {
20394 /* Take the same action that would have been taken by
20395 cp_parser_explicit_specialization. */
20398 }
20399 /* There must be no "return" statements between this point and the
20400 end of this function; set "type "to the correct return value and
20401 use "goto done;" to return. */
20402 /* Make sure that the right number of template parameters were
20403 present. */
20407 {
20408 /* If something went wrong, there is no point in even trying to
20409 process the class-definition. */
20412 }
20414 /* Look up the type. */
20416 {
20420 {
20424 }
20425 else
20426 {
20429 }
20432 }
20434 {
20435 tree class_type;
20437 /* Given:
20439 template <typename T> struct S { struct T };
20440 template <typename T> struct S<T>::T { };
20442 we will get a TYPENAME_TYPE when processing the definition of
20443 `S::T'. We need to resolve it to the actual type before we
20444 try to define it. */
20446 {
20451 else
20452 {
20455 }
20456 }
20460 {
20463 }
20466 /* Enter the scope indicated by the nested-name-specifier. */
20468 /* Get the canonical version of this type. */
20470 /* Call push_template_decl if it seems like we should be defining a
20471 template either from the template headers or the type we're
20472 defining, so that we diagnose both extra and missing headers. */
20476 {
20479 {
20482 }
20483 }
20487 }
20489 {
20490 /* If the class was unnamed, create a dummy name. */
20495 }
20497 /* Indicate whether this class was declared as a `class' or as a
20498 `struct'. */
20503 /* If this type was already complete, and we see another definition,
20504 that's an error. */
20506 {
20508 type);
20510 type);
20513 }
20518 {
20519 /* Apply attributes now, before any use of the class as a template
20520 argument in its base list. */
20523 }
20525 /* We will have entered the scope containing the class; the names of
20526 base classes should be looked up in that context. For example:
20528 struct A { struct B {}; struct C; };
20529 struct A::C : B {};
20531 is valid. */
20533 /* Get the list of base-classes, if there is one. */
20535 {
20536 /* PR59482: enter the class scope so that base-specifiers are looked
20537 up correctly. */
20541 /* PR59482: get out of the previously pushed class scope so that the
20542 subsequent pops pop the right thing. */
20545 }
20546 else
20549 /* If we're really defining a class, process the base classes.
20550 If they're invalid, fail. */
20555 done:
20556 /* Leave the scope given by the nested-name-specifier. We will
20557 enter the class scope itself while processing the members. */
20562 {
20565 }
20571 out:
20574 }
20576 /* Parse a class-key.
20578 class-key:
20579 class
20580 struct
20581 union
20583 Returns the kind of class-key specified, or none_type to indicate
20584 error. */
20586 static enum tag_types
20588 {
20592 /* Look for the class-key. */
20597 /* Check to see if the TOKEN is a class-key. */
20602 }
20604 /* Parse a type-parameter-key.
20606 type-parameter-key:
20607 class
20608 typename
20609 */
20611 static void
20613 {
20614 /* Look for the type-parameter-key. */
20618 {
20621 /* typename is not allowed in a template template parameter
20622 by the standard until C++1Z. */
20624 "ISO C++ forbids typename key in template template parameter;"
20626 }
20627 else
20631 }
20633 /* Parse an (optional) member-specification.
20635 member-specification:
20636 member-declaration member-specification [opt]
20637 access-specifier : member-specification [opt] */
20639 static void
20641 {
20643 {
20647 /* Peek at the next token. */
20649 /* If it's a `}', or EOF then we've seen all the members. */
20655 /* See if this token is a keyword. */
20658 {
20662 /* Consume the access-specifier. */
20664 /* Remember which access-specifier is active. */
20666 /* Look for the `:'. */
20671 /* Accept #pragmas at class scope. */
20673 {
20676 }
20678 /* Otherwise, the next construction must be a
20679 member-declaration. */
20681 }
20682 }
20683 }
20685 /* Parse a member-declaration.
20687 member-declaration:
20688 decl-specifier-seq [opt] member-declarator-list [opt] ;
20689 function-definition ; [opt]
20690 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20691 using-declaration
20692 template-declaration
20693 alias-declaration
20695 member-declarator-list:
20696 member-declarator
20697 member-declarator-list , member-declarator
20699 member-declarator:
20700 declarator pure-specifier [opt]
20701 declarator constant-initializer [opt]
20702 identifier [opt] : constant-expression
20704 GNU Extensions:
20706 member-declaration:
20707 __extension__ member-declaration
20709 member-declarator:
20710 declarator attributes [opt] pure-specifier [opt]
20711 declarator attributes [opt] constant-initializer [opt]
20712 identifier [opt] attributes [opt] : constant-expression
20714 C++0x Extensions:
20716 member-declaration:
20717 static_assert-declaration */
20719 static void
20721 {
20722 cp_decl_specifier_seq decl_specifiers;
20723 tree prefix_attributes;
20724 tree decl;
20733 /* Check for the `__extension__' keyword. */
20735 {
20736 /* Recurse. */
20738 /* Restore the old value of the PEDANTIC flag. */
20742 }
20744 /* Check for a template-declaration. */
20746 {
20747 /* An explicit specialization here is an error condition, and we
20748 expect the specialization handler to detect and report this. */
20752 else
20756 }
20758 /* Check for a using-declaration. */
20760 {
20762 {
20763 /* Parse the using-declaration. */
20767 }
20768 else
20769 {
20770 tree decl;
20774 /* Note that if we actually see the '=' token after the
20775 identifier, cp_parser_alias_declaration commits the
20776 tentative parse. In that case, we really expects an
20777 alias-declaration. Otherwise, we expect a using
20778 declaration. */
20779 alias_decl_expected =
20785 else
20789 }
20790 }
20792 /* Check for @defs. */
20794 {
20799 {
20804 }
20806 }
20808 /* If the next token is `static_assert' we have a static assertion. */
20810 {
20813 }
20820 /* Parse the decl-specifier-seq. */
20823 CP_PARSER_FLAGS_OPTIONAL,
20826 /* Check for an invalid type-name. */
20830 /* If there is no declarator, then the decl-specifier-seq should
20831 specify a type. */
20833 {
20834 /* If there was no decl-specifier-seq, and the next token is a
20835 `;', then we have something like:
20837 struct S { ; };
20839 [class.mem]
20841 Each member-declaration shall declare at least one member
20842 name of the class. */
20844 {
20848 }
20849 else
20850 {
20851 tree type;
20853 /* See if this declaration is a friend. */
20855 /* If there were decl-specifiers, check to see if there was
20856 a class-declaration. */
20859 /* Nested classes have already been added to the class, but
20860 a `friend' needs to be explicitly registered. */
20862 {
20863 /* If the `friend' keyword was present, the friend must
20864 be introduced with a class-key. */
20867 "in C++03 a class-key must be used "
20869 /* In this case:
20871 template <typename T> struct A {
20872 friend struct A<T>::B;
20873 };
20875 A<T>::B will be represented by a TYPENAME_TYPE, and
20876 therefore not recognized by check_tag_decl. */
20878 {
20882 }
20885 "friend declaration does not name a class or "
20887 else
20890 }
20891 /* If there is no TYPE, an error message will already have
20892 been issued. */
20894 ;
20895 /* An anonymous aggregate has to be handled specially; such
20896 a declaration really declares a data member (with a
20897 particular type), as opposed to a nested class. */
20899 {
20900 /* C++11 9.5/6. */
20903 "a storage class on an anonymous aggregate "
20906 /* Remove constructors and such from TYPE, now that we
20907 know it is an anonymous aggregate. */
20909 /* And make the corresponding data member. */
20912 /* Add it to the class. */
20914 }
20915 else
20916 cp_parser_check_access_in_redeclaration
20919 }
20920 }
20921 else
20922 {
20925 /* Clear attributes from the decl_specifiers but keep them
20926 around as prefix attributes that apply them to the entity
20927 being declared. */
20931 /* See if these declarations will be friends. */
20934 /* Keep going until we hit the `;' at the end of the
20935 declaration. */
20937 {
20939 tree first_attribute;
20941 /* Peek at the next token. */
20944 /* Check for a bitfield declaration. */
20949 {
20950 tree identifier;
20951 tree width;
20953 /* Get the name of the bitfield. Note that we cannot just
20954 check TOKEN here because it may have been invalidated by
20955 the call to cp_lexer_peek_nth_token above. */
20958 else
20961 /* Consume the `:' token. */
20963 /* Get the width of the bitfield. */
20964 width
20967 /* Look for attributes that apply to the bitfield. */
20969 /* Remember which attributes are prefix attributes and
20970 which are not. */
20972 /* Combine the attributes. */
20975 /* Create the bitfield declaration. */
20978 identifier,
20979 sfk_none)
20982 width,
20983 attributes);
20984 }
20985 else
20986 {
20988 tree initializer;
20989 tree asm_specification;
20992 /* Parse the declarator. */
20993 declarator
20998 friend_p);
21000 /* If something went wrong parsing the declarator, make sure
21001 that we at least consume some tokens. */
21003 {
21004 /* Skip to the end of the statement. */
21006 /* If the next token is not a semicolon, that is
21007 probably because we just skipped over the body of
21008 a function. So, we consume a semicolon if
21009 present, but do not issue an error message if it
21010 is not present. */
21012 CPP_SEMICOLON))
21015 }
21018 cp_parser_check_for_definition_in_return_type
21022 /* Look for an asm-specification. */
21024 /* Look for attributes that apply to the declaration. */
21026 /* Remember which attributes are prefix attributes and
21027 which are not. */
21029 /* Combine the attributes. */
21032 /* If it's an `=', then we have a constant-initializer or a
21033 pure-specifier. It is not correct to parse the
21034 initializer before registering the member declaration
21035 since the member declaration should be in scope while
21036 its initializer is processed. However, the rest of the
21037 front end does not yet provide an interface that allows
21038 us to handle this correctly. */
21040 {
21041 /* In [class.mem]:
21043 A pure-specifier shall be used only in the declaration of
21044 a virtual function.
21046 A member-declarator can contain a constant-initializer
21047 only if it declares a static member of integral or
21048 enumeration type.
21050 Therefore, if the DECLARATOR is for a function, we look
21051 for a pure-specifier; otherwise, we look for a
21052 constant-initializer. When we call `grokfield', it will
21053 perform more stringent semantics checks. */
21065 {
21067 /* Don't require a constant rvalue in C++11, since we
21068 might want a reference constant. We'll enforce
21069 constancy later. */
21071 /* Parse the initializer. */
21074 }
21075 else
21076 /* Parse the initializer. */
21078 }
21081 {
21085 else
21087 }
21088 /* Otherwise, there is no initializer. */
21089 else
21092 /* See if we are probably looking at a function
21093 definition. We are certainly not looking at a
21094 member-declarator. Calling `grokfield' has
21095 side-effects, so we must not do it unless we are sure
21096 that we are looking at a member-declarator. */
21099 {
21100 /* The grammar does not allow a pure-specifier to be
21101 used when a member function is defined. (It is
21102 possible that this fact is an oversight in the
21103 standard, since a pure function may be defined
21104 outside of the class-specifier. */
21110 declarator,
21111 attributes);
21114 /* If the member was not a friend, declare it here. */
21117 /* Peek at the next token. */
21119 /* If the next token is a semicolon, consume it. */
21123 }
21124 else
21127 /* Create the declaration. */
21132 {
21135 else
21137 }
21138 }
21142 /* Reset PREFIX_ATTRIBUTES. */
21148 /* If there is any qualification still in effect, clear it
21149 now; we will be starting fresh with the next declarator. */
21153 /* If it's a `,', then there are more declarators. */
21155 {
21158 {
21162 }
21163 }
21164 /* If the next token isn't a `;', then we have a parse error. */
21166 CPP_SEMICOLON))
21167 {
21168 /* The next token might be a ways away from where the
21169 actual semicolon is missing. Find the previous token
21170 and use that for our error position. */
21175 /* Assume that the user meant to provide a semicolon. If
21176 we were to cp_parser_skip_to_end_of_statement, we might
21177 skip to a semicolon inside a member function definition
21178 and issue nonsensical error messages. */
21180 }
21183 {
21184 /* Add DECL to the list of members. */
21186 /* Explicitly include, eg, NSDMIs, for better error
21187 recovery (c++/58650). */
21196 /* Add DECL to the queue of NSDMI to be parsed later. */
21198 }
21202 }
21203 }
21206 out:
21208 }
21210 /* Parse a pure-specifier.
21212 pure-specifier:
21213 = 0
21215 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21216 Otherwise, ERROR_MARK_NODE is returned. */
21218 static tree
21220 {
21223 /* Look for the `=' token. */
21226 /* Look for the `0' token. */
21235 /* Accept = default or = delete in c++0x mode. */
21238 {
21241 }
21243 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21245 {
21250 }
21252 {
21255 }
21258 }
21260 /* Parse a constant-initializer.
21262 constant-initializer:
21263 = constant-expression
21265 Returns a representation of the constant-expression. */
21267 static tree
21269 {
21270 /* Look for the `=' token. */
21274 /* It is invalid to write:
21276 struct S { static const int i = { 7 }; };
21278 */
21280 {
21283 /* Consume the opening brace. */
21285 /* Skip the initializer. */
21287 /* Look for the trailing `}'. */
21291 }
21294 }
21296 /* Derived classes [gram.class.derived] */
21298 /* Parse a base-clause.
21300 base-clause:
21301 : base-specifier-list
21303 base-specifier-list:
21304 base-specifier ... [opt]
21305 base-specifier-list , base-specifier ... [opt]
21307 Returns a TREE_LIST representing the base-classes, in the order in
21308 which they were declared. The representation of each node is as
21309 described by cp_parser_base_specifier.
21311 In the case that no bases are specified, this function will return
21312 NULL_TREE, not ERROR_MARK_NODE. */
21314 static tree
21316 {
21319 /* Look for the `:' that begins the list. */
21322 /* Scan the base-specifier-list. */
21324 {
21326 tree base;
21329 /* Look for the base-specifier. */
21331 /* Look for the (optional) ellipsis. */
21333 {
21334 /* Consume the `...'. */
21338 }
21340 /* Add BASE to the front of the list. */
21342 {
21344 /* Make this a pack expansion type. */
21348 {
21351 }
21352 }
21353 /* Peek at the next token. */
21355 /* If it's not a comma, then the list is complete. */
21358 /* Consume the `,'. */
21360 }
21362 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21363 base class had a qualified name. However, the next name that
21364 appears is certainly not qualified. */
21370 }
21372 /* Parse a base-specifier.
21374 base-specifier:
21375 :: [opt] nested-name-specifier [opt] class-name
21376 virtual access-specifier [opt] :: [opt] nested-name-specifier
21377 [opt] class-name
21378 access-specifier virtual [opt] :: [opt] nested-name-specifier
21379 [opt] class-name
21381 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21382 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21383 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21384 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21386 static tree
21388 {
21396 tree type;
21398 /* Process the optional `virtual' and `access-specifier'. */
21400 {
21401 /* Peek at the next token. */
21403 /* Process `virtual'. */
21405 {
21407 /* If `virtual' appears more than once, issue an error. */
21409 {
21413 }
21417 /* Consume the `virtual' token. */
21425 /* If more than one access specifier appears, issue an
21426 error. */
21429 {
21433 }
21437 /* Consume the access-specifier. */
21445 }
21446 }
21447 /* It is not uncommon to see programs mechanically, erroneously, use
21448 the 'typename' keyword to denote (dependent) qualified types
21449 as base classes. */
21451 {
21456 else
21458 "keyword %<typename%> not allowed in this context "
21461 }
21463 /* Look for the optional `::' operator. */
21465 /* Look for the nested-name-specifier. The simplest way to
21466 implement:
21468 [temp.res]
21470 The keyword `typename' is not permitted in a base-specifier or
21471 mem-initializer; in these contexts a qualified name that
21472 depends on a template-parameter is implicitly assumed to be a
21473 type name.
21475 is to pretend that we have seen the `typename' keyword at this
21476 point. */
21480 typename_type,
21482 /* If the base class is given by a qualified name, assume that names
21483 we see are type names or templates, as appropriate. */
21489 /* DR 950 allows decltype as a base-specifier. */
21491 else
21492 {
21493 /* Otherwise, look for the class-name. */
21495 class_scope_p,
21496 template_p,
21497 typename_type,
21502 }
21508 }
21510 /* Exception handling [gram.exception] */
21512 /* Parse an (optional) noexcept-specification.
21514 noexcept-specification:
21515 noexcept ( constant-expression ) [opt]
21517 If no noexcept-specification is present, returns NULL_TREE.
21518 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21519 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21520 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21521 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21522 in which case a boolean condition is returned instead. */
21524 static tree
21529 {
21533 /* Peek at the next token. */
21536 /* Is it a noexcept-specification? */
21538 {
21539 tree expr;
21543 {
21547 {
21548 /* Types may not be defined in an exception-specification. */
21550 parser->type_definition_forbidden_message
21555 /* Restore the saved message. */
21557 }
21558 else
21559 {
21562 }
21565 }
21566 else
21567 {
21571 }
21573 /* We cannot build a noexcept-spec right away because this will check
21574 that expr is a constexpr. */
21577 else
21579 }
21580 else
21582 }
21584 /* Parse an (optional) exception-specification.
21586 exception-specification:
21587 throw ( type-id-list [opt] )
21589 Returns a TREE_LIST representing the exception-specification. The
21590 TREE_VALUE of each node is a type. */
21592 static tree
21594 {
21596 tree type_id_list;
21599 /* Peek at the next token. */
21602 /* Is it a noexcept-specification? */
21608 /* If it's not `throw', then there's no exception-specification. */
21612 #if 0
21613 /* Enable this once a lot of code has transitioned to noexcept? */
21617 #endif
21619 /* Consume the `throw'. */
21622 /* Look for the `('. */
21625 /* Peek at the next token. */
21627 /* If it's not a `)', then there is a type-id-list. */
21629 {
21630 /* Types may not be defined in an exception-specification. */
21632 parser->type_definition_forbidden_message
21634 /* Parse the type-id-list. */
21636 /* Restore the saved message. */
21638 }
21639 else
21642 /* Look for the `)'. */
21646 }
21648 /* Parse an (optional) type-id-list.
21650 type-id-list:
21651 type-id ... [opt]
21652 type-id-list , type-id ... [opt]
21654 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21655 in the order that the types were presented. */
21657 static tree
21659 {
21663 {
21665 tree type;
21667 /* Get the next type-id. */
21669 /* Parse the optional ellipsis. */
21671 {
21672 /* Consume the `...'. */
21675 /* Turn the type into a pack expansion expression. */
21677 }
21678 /* Add it to the list. */
21680 /* Peek at the next token. */
21682 /* If it is not a `,', we are done. */
21685 /* Consume the `,'. */
21687 }
21690 }
21692 /* Parse a try-block.
21694 try-block:
21695 try compound-statement handler-seq */
21697 static tree
21699 {
21700 tree try_block;
21714 }
21716 /* Parse a function-try-block.
21718 function-try-block:
21719 try ctor-initializer [opt] function-body handler-seq */
21721 static bool
21723 {
21724 tree compound_stmt;
21725 tree try_block;
21728 /* Look for the `try' keyword. */
21731 /* Let the rest of the front end know where we are. */
21733 /* Parse the function-body. */
21734 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21736 /* We're done with the `try' part. */
21738 /* Parse the handlers. */
21740 /* We're done with the handlers. */
21744 }
21746 /* Parse a handler-seq.
21748 handler-seq:
21749 handler handler-seq [opt] */
21751 static void
21753 {
21755 {
21758 /* Parse the handler. */
21760 /* Peek at the next token. */
21762 /* If it's not `catch' then there are no more handlers. */
21765 }
21766 }
21768 /* Parse a handler.
21770 handler:
21771 catch ( exception-declaration ) compound-statement */
21773 static void
21775 {
21776 tree handler;
21777 tree declaration;
21787 }
21789 /* Parse an exception-declaration.
21791 exception-declaration:
21792 type-specifier-seq declarator
21793 type-specifier-seq abstract-declarator
21794 type-specifier-seq
21795 ...
21797 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21798 ellipsis variant is used. */
21800 static tree
21802 {
21803 cp_decl_specifier_seq type_specifiers;
21807 /* If it's an ellipsis, it's easy to handle. */
21809 {
21810 /* Consume the `...' token. */
21813 }
21815 /* Types may not be defined in exception-declarations. */
21817 parser->type_definition_forbidden_message
21820 /* Parse the type-specifier-seq. */
21824 /* If it's a `)', then there is no declarator. */
21827 else
21834 /* Restore the saved message. */
21841 }
21843 /* Parse a throw-expression.
21845 throw-expression:
21846 throw assignment-expression [opt]
21848 Returns a THROW_EXPR representing the throw-expression. */
21850 static tree
21852 {
21853 tree expression;
21858 /* Figure out whether or not there is an assignment-expression
21859 following the "throw" keyword. */
21867 else
21871 }
21873 /* GNU Extensions */
21875 /* Parse an (optional) asm-specification.
21877 asm-specification:
21878 asm ( string-literal )
21880 If the asm-specification is present, returns a STRING_CST
21881 corresponding to the string-literal. Otherwise, returns
21882 NULL_TREE. */
21884 static tree
21886 {
21888 tree asm_specification;
21890 /* Peek at the next token. */
21892 /* If the next token isn't the `asm' keyword, then there's no
21893 asm-specification. */
21897 /* Consume the `asm' token. */
21899 /* Look for the `('. */
21902 /* Look for the string-literal. */
21905 /* Look for the `)'. */
21909 }
21911 /* Parse an asm-operand-list.
21913 asm-operand-list:
21914 asm-operand
21915 asm-operand-list , asm-operand
21917 asm-operand:
21918 string-literal ( expression )
21919 [ string-literal ] string-literal ( expression )
21921 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21922 each node is the expression. The TREE_PURPOSE is itself a
21923 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21924 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21925 is a STRING_CST for the string literal before the parenthesis. Returns
21926 ERROR_MARK_NODE if any of the operands are invalid. */
21928 static tree
21930 {
21935 {
21936 tree string_literal;
21937 tree expression;
21938 tree name;
21941 {
21942 /* Consume the `[' token. */
21944 /* Read the operand name. */
21949 /* Look for the closing `]'. */
21951 }
21952 else
21954 /* Look for the string-literal. */
21957 /* Look for the `('. */
21959 /* Parse the expression. */
21961 /* Look for the `)'. */
21969 /* Add this operand to the list. */
21971 expression,
21972 asm_operands);
21973 /* If the next token is not a `,', there are no more
21974 operands. */
21977 /* Consume the `,'. */
21979 }
21982 }
21984 /* Parse an asm-clobber-list.
21986 asm-clobber-list:
21987 string-literal
21988 asm-clobber-list , string-literal
21990 Returns a TREE_LIST, indicating the clobbers in the order that they
21991 appeared. The TREE_VALUE of each node is a STRING_CST. */
21993 static tree
21995 {
21999 {
22000 tree string_literal;
22002 /* Look for the string literal. */
22004 /* Add it to the list. */
22006 /* If the next token is not a `,', then the list is
22007 complete. */
22010 /* Consume the `,' token. */
22012 }
22015 }
22017 /* Parse an asm-label-list.
22019 asm-label-list:
22020 identifier
22021 asm-label-list , identifier
22023 Returns a TREE_LIST, indicating the labels in the order that they
22024 appeared. The TREE_VALUE of each node is a label. */
22026 static tree
22028 {
22032 {
22035 /* Look for the identifier. */
22038 {
22041 {
22047 }
22048 }
22049 /* If the next token is not a `,', then the list is
22050 complete. */
22053 /* Consume the `,' token. */
22055 }
22058 }
22060 /* Return TRUE iff the next tokens in the stream are possibly the
22061 beginning of a GNU extension attribute. */
22063 static bool
22065 {
22067 }
22069 /* Return TRUE iff the next tokens in the stream are possibly the
22070 beginning of a standard C++-11 attribute specifier. */
22072 static bool
22074 {
22076 }
22078 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22079 beginning of a standard C++-11 attribute specifier. */
22081 static bool
22083 {
22091 }
22093 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22094 beginning of a GNU extension attribute. */
22096 static bool
22098 {
22102 }
22104 /* Return true iff the next tokens can be the beginning of either a
22105 GNU attribute list, or a standard C++11 attribute sequence. */
22107 static bool
22109 {
22112 }
22114 /* Return true iff the next Nth tokens can be the beginning of either
22115 a GNU attribute list, or a standard C++11 attribute sequence. */
22117 static bool
22119 {
22122 }
22124 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22125 of GNU attributes, or return NULL. */
22127 static tree
22129 {
22133 }
22135 #define CILK_SIMD_FN_CLAUSE_MASK \
22136 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22137 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22138 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22139 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22140 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22142 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22143 vector [(<clauses>)] */
22145 static void
22147 {
22151 {
22156 }
22159 {
22162 paren_scope++;
22163 }
22165 {
22168 paren_scope++;
22170 paren_scope--;
22171 /* Do not push the last ')' */
22174 }
22183 }
22185 /* Parse an (optional) series of attributes.
22187 attributes:
22188 attributes attribute
22190 attribute:
22191 __attribute__ (( attribute-list [opt] ))
22193 The return value is as for cp_parser_gnu_attribute_list. */
22195 static tree
22197 {
22201 {
22203 tree attribute_list;
22206 /* Peek at the next token. */
22208 /* If it's not `__attribute__', then we're done. */
22212 /* Consume the `__attribute__' keyword. */
22214 /* Look for the two `(' tokens. */
22218 /* Peek at the next token. */
22221 /* Parse the attribute-list. */
22223 else
22224 /* If the next token is a `)', then there is no attribute
22225 list. */
22228 /* Look for the two `)' tokens. */
22236 /* Add these new attributes to the list. */
22238 }
22241 }
22243 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22244 "__vector" or "__vector__." */
22248 {
22252 }
22254 /* Parse a GNU attribute-list.
22256 attribute-list:
22257 attribute
22258 attribute-list , attribute
22260 attribute:
22261 identifier
22262 identifier ( identifier )
22263 identifier ( identifier , expression-list )
22264 identifier ( expression-list )
22266 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22267 to an attribute. The TREE_PURPOSE of each node is the identifier
22268 indicating which attribute is in use. The TREE_VALUE represents
22269 the arguments, if any. */
22271 static tree
22273 {
22279 {
22281 tree identifier;
22282 tree attribute;
22284 /* Look for the identifier. We also allow keywords here; for
22285 example `__attribute__ ((const))' is legal. */
22289 {
22292 /* Consume the token, but save it since we need it for the
22293 SIMD enabled function parsing. */
22296 /* Save away the identifier that indicates which attribute
22297 this is. */
22299 /* For keywords, use the canonical spelling, not the
22300 parsed identifier. */
22306 /* Peek at the next token. */
22308 /* If it's an `(', then parse the attribute arguments. */
22310 {
22315 {
22318 }
22319 else
22320 vec = cp_parser_parenthesized_expression_list
22326 else
22327 {
22330 }
22331 /* Save the arguments away. */
22333 }
22335 {
22338 }
22341 {
22342 /* Add this attribute to the list. */
22345 }
22348 }
22349 /* Now, look for more attributes. If the next token isn't a
22350 `,', we're done. */
22354 /* Consume the comma and keep going. */
22356 }
22359 /* We built up the list in reverse order. */
22361 }
22363 /* Parse a standard C++11 attribute.
22365 The returned representation is a TREE_LIST which TREE_PURPOSE is
22366 the scoped name of the attribute, and the TREE_VALUE is its
22367 arguments list.
22369 Note that the scoped name of the attribute is itself a TREE_LIST
22370 which TREE_PURPOSE is the namespace of the attribute, and
22371 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22372 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22373 and which TREE_PURPOSE is directly the attribute name.
22375 Clients of the attribute code should use get_attribute_namespace
22376 and get_attribute_name to get the actual namespace and name of
22377 attributes, regardless of their being GNU or C++11 attributes.
22379 attribute:
22380 attribute-token attribute-argument-clause [opt]
22382 attribute-token:
22383 identifier
22384 attribute-scoped-token
22386 attribute-scoped-token:
22387 attribute-namespace :: identifier
22389 attribute-namespace:
22390 identifier
22392 attribute-argument-clause:
22393 ( balanced-token-seq )
22395 balanced-token-seq:
22396 balanced-token [opt]
22397 balanced-token-seq balanced-token
22399 balanced-token:
22400 ( balanced-token-seq )
22401 [ balanced-token-seq ]
22402 { balanced-token-seq }. */
22404 static tree
22406 {
22410 /* First, parse name of the the attribute, a.k.a
22411 attribute-token. */
22428 {
22429 /* We are seeing a scoped attribute token. */
22439 else
22440 {
22444 }
22446 NULL_TREE);
22448 }
22449 else
22450 {
22452 NULL_TREE);
22453 /* C++11 noreturn attribute is equivalent to GNU's. */
22456 /* C++14 deprecated attribute is equivalent to GNU's. */
22458 {
22461 "%<deprecated%> is a C++14 feature;"
22464 }
22465 }
22467 /* Now parse the optional argument clause of the attribute. */
22472 {
22478 /* A GNU attribute that takes an identifier in parameter. */
22481 vec = cp_parser_parenthesized_expression_list
22487 else
22488 {
22491 }
22495 else
22497 }
22500 }
22502 /* Parse a list of standard C++-11 attributes.
22504 attribute-list:
22505 attribute [opt]
22506 attribute-list , attribute[opt]
22507 attribute ...
22508 attribute-list , attribute ...
22509 */
22511 static tree
22513 {
22518 {
22523 {
22526 }
22529 {
22534 }
22538 }
22541 }
22543 /* Parse a standard C++-11 attribute specifier.
22545 attribute-specifier:
22546 [ [ attribute-list ] ]
22547 alignment-specifier
22549 alignment-specifier:
22550 alignas ( type-id ... [opt] )
22551 alignas ( alignment-expression ... [opt] ). */
22553 static tree
22555 {
22561 {
22570 else
22571 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22572 when we are sure that we have actually parsed them. */
22574 }
22575 else
22576 {
22577 tree alignas_expr;
22579 /* Look for an alignment-specifier. */
22591 {
22594 }
22600 {
22604 alignas_expr =
22611 }
22617 {
22620 }
22623 {
22626 }
22628 /* Build the C++-11 representation of an 'aligned'
22629 attribute. */
22630 attributes =
22633 alignas_expr);
22634 }
22637 }
22639 /* Parse a standard C++-11 attribute-specifier-seq.
22641 attribute-specifier-seq:
22642 attribute-specifier-seq [opt] attribute-specifier
22643 */
22645 static tree
22647 {
22651 {
22660 }
22664 }
22666 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22667 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22668 current value of the PEDANTIC flag, regardless of whether or not
22669 the `__extension__' keyword is present. The caller is responsible
22670 for restoring the value of the PEDANTIC flag. */
22672 static bool
22674 {
22675 /* Save the old value of the PEDANTIC flag. */
22679 {
22680 /* Consume the `__extension__' token. */
22682 /* We're not being pedantic while the `__extension__' keyword is
22683 in effect. */
22687 }
22690 }
22692 /* Parse a label declaration.
22694 label-declaration:
22695 __label__ label-declarator-seq ;
22697 label-declarator-seq:
22698 identifier , label-declarator-seq
22699 identifier */
22701 static void
22703 {
22704 /* Look for the `__label__' keyword. */
22708 {
22709 tree identifier;
22711 /* Look for an identifier. */
22713 /* If we failed, stop. */
22716 /* Declare it as a label. */
22718 /* If the next token is a `;', stop. */
22721 /* Look for the `,' separating the label declarations. */
22723 }
22725 /* Look for the final `;'. */
22727 }
22729 /* Support Functions */
22731 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22732 NAME should have one of the representations used for an
22733 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22734 is returned. If PARSER->SCOPE is a dependent type, then a
22735 SCOPE_REF is returned.
22737 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22738 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22739 was formed. Abstractly, such entities should not be passed to this
22740 function, because they do not need to be looked up, but it is
22741 simpler to check for this special case here, rather than at the
22742 call-sites.
22744 In cases not explicitly covered above, this function returns a
22745 DECL, OVERLOAD, or baselink representing the result of the lookup.
22746 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22747 is returned.
22749 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22750 (e.g., "struct") that was used. In that case bindings that do not
22751 refer to types are ignored.
22753 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22754 ignored.
22756 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22757 are ignored.
22759 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22760 types.
22762 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22763 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22764 NULL_TREE otherwise. */
22766 static tree
22773 location_t name_location)
22774 {
22775 tree decl;
22778 /* Assume that the lookup will be unambiguous. */
22782 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22783 no longer valid. Note that if we are parsing tentatively, and
22784 the parse fails, OBJECT_TYPE will be automatically restored. */
22790 /* A template-id has already been resolved; there is no lookup to
22791 do. */
22795 {
22799 }
22801 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22802 it should already have been checked to make sure that the name
22803 used matches the type being destroyed. */
22805 {
22806 tree type;
22808 /* Figure out to which type this destructor applies. */
22813 else
22815 /* If that's not a class type, there is no destructor. */
22822 /* If it was a class type, return the destructor. */
22824 }
22826 /* By this point, the NAME should be an ordinary identifier. If
22827 the id-expression was a qualified name, the qualifying scope is
22828 stored in PARSER->SCOPE at this point. */
22831 /* Perform the lookup. */
22833 {
22839 /* If the SCOPE is dependent, the lookup must be deferred until
22840 the template is instantiated -- unless we are explicitly
22841 looking up names in uninstantiated templates. Even then, we
22842 cannot look up the name if the scope is not a class type; it
22843 might, for example, be a template type parameter. */
22848 /* Defer lookup. */
22850 else
22851 {
22854 /* If PARSER->SCOPE is a dependent type, then it must be a
22855 class type, and we must not be checking dependencies;
22856 otherwise, we would have processed this lookup above. So
22857 that PARSER->SCOPE is not considered a dependent base by
22858 lookup_member, we must enter the scope here. */
22862 /* If the PARSER->SCOPE is a template specialization, it
22863 may be instantiated during name lookup. In that case,
22864 errors may be issued. Even if we rollback the current
22865 tentative parse, those errors are valid. */
22870 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22871 lookup result and the nested-name-specifier nominates a class C:
22872 * if the name specified after the nested-name-specifier, when
22873 looked up in C, is the injected-class-name of C (Clause 9), or
22874 * if the name specified after the nested-name-specifier is the
22875 same as the identifier or the simple-template-id's template-
22876 name in the last component of the nested-name-specifier,
22877 the name is instead considered to name the constructor of
22878 class C. [ Note: for example, the constructor is not an
22879 acceptable lookup result in an elaborated-type-specifier so
22880 the constructor would not be used in place of the
22881 injected-class-name. --end note ] Such a constructor name
22882 shall be used only in the declarator-id of a declaration that
22883 names a constructor or in a using-declaration. */
22891 /* If we have a single function from a using decl, pull it out. */
22898 }
22900 /* If the scope is a dependent type and either we deferred lookup or
22901 we did lookup but didn't find the name, rememeber the name. */
22904 {
22906 {
22907 tree type;
22909 /* The resolution to Core Issue 180 says that `struct
22910 A::B' should be considered a type-name, even if `A'
22911 is dependent. */
22916 }
22920 CPP_CLOSE_PAREN)))
22924 else
22927 is_template);
22928 }
22931 }
22933 {
22934 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22935 OBJECT_TYPE is not a class. */
22937 /* If the OBJECT_TYPE is a template specialization, it may
22938 be instantiated during name lookup. In that case, errors
22939 may be issued. Even if we rollback the current tentative
22940 parse, those errors are valid. */
22942 name,
22945 tf_warning_or_error);
22946 else
22950 /* Look it up in the enclosing context. */
22956 }
22957 else
22958 {
22964 }
22966 /* If the lookup failed, let our caller know. */
22970 /* Pull out the template from an injected-class-name (or multiple). */
22974 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22976 {
22979 /* The error message we have to print is too complicated for
22980 cp_parser_error, so we incorporate its actions directly. */
22982 {
22984 name);
22986 }
22988 }
22996 /* If we have resolved the name of a member declaration, check to
22997 see if the declaration is accessible. When the name resolves to
22998 set of overloaded functions, accessibility is checked when
22999 overload resolution is done.
23001 During an explicit instantiation, access is not checked at all,
23002 as per [temp.explicit]. */
23009 }
23011 /* Like cp_parser_lookup_name, but for use in the typical case where
23012 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23013 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23015 static tree
23017 {
23019 none_type,
23024 location);
23025 }
23027 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23028 the current context, return the TYPE_DECL. If TAG_NAME_P is
23029 true, the DECL indicates the class being defined in a class-head,
23030 or declared in an elaborated-type-specifier.
23032 Otherwise, return DECL. */
23034 static tree
23036 {
23037 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23038 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23040 struct A {
23041 template <typename T> struct B;
23042 };
23044 template <typename T> struct A::B {};
23046 Similarly, in an elaborated-type-specifier:
23048 namespace N { struct X{}; }
23050 struct A {
23051 template <typename T> friend struct N::X;
23052 };
23054 However, if the DECL refers to a class type, and we are in
23055 the scope of the class, then the name lookup automatically
23056 finds the TYPE_DECL created by build_self_reference rather
23057 than a TEMPLATE_DECL. For example, in:
23059 template <class T> struct S {
23060 S s;
23061 };
23063 there is no need to handle such case. */
23069 }
23071 /* If too many, or too few, template-parameter lists apply to the
23072 declarator, issue an error message. Returns TRUE if all went well,
23073 and FALSE otherwise. */
23075 static bool
23078 location_t declarator_location)
23079 {
23081 {
23083 {
23091 /* If the DECLARATOR has the form `X<y>' then it uses one
23092 additional level of template parameters. */
23095 return cp_parser_check_template_parameters
23097 }
23112 }
23114 }
23116 /* NUM_TEMPLATES were used in the current declaration. If that is
23117 invalid, return FALSE and issue an error messages. Otherwise,
23118 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23119 declarator and we can print more accurate diagnostics. */
23121 static bool
23124 location_t location,
23126 {
23127 /* If there are the same number of template classes and parameter
23128 lists, that's OK. */
23131 /* If there are more, but only one more, then we are referring to a
23132 member template. That's OK too. */
23135 /* If there are more template classes than parameter lists, we have
23136 something like:
23138 template <class T> void S<T>::R<T>::f (); */
23140 {
23150 else
23153 }
23154 /* Otherwise, there are too many template parameter lists. We have
23155 something like:
23157 template <class T> template <class U> void S::f(); */
23160 }
23162 /* Parse an optional `::' token indicating that the following name is
23163 from the global namespace. If so, PARSER->SCOPE is set to the
23164 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23165 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23166 Returns the new value of PARSER->SCOPE, if the `::' token is
23167 present, and NULL_TREE otherwise. */
23169 static tree
23171 {
23174 /* Peek at the next token. */
23176 /* If we're looking at a `::' token then we're starting from the
23177 global namespace, not our current location. */
23179 {
23180 /* Consume the `::' token. */
23182 /* Set the SCOPE so that we know where to start the lookup. */
23188 }
23190 {
23194 }
23197 }
23199 /* Returns TRUE if the upcoming token sequence is the start of a
23200 constructor declarator. If FRIEND_P is true, the declarator is
23201 preceded by the `friend' specifier. */
23203 static bool
23205 {
23208 tree nested_name_specifier;
23211 /* The common case is that this is not a constructor declarator, so
23212 try to avoid doing lots of work if at all possible. It's not
23213 valid declare a constructor at function scope. */
23216 /* And only certain tokens can begin a constructor declarator. */
23224 /* Parse tentatively; we are going to roll back all of the tokens
23225 consumed here. */
23227 /* Assume that we are looking at a constructor declarator. */
23230 /* Look for the optional `::' operator. */
23233 /* Look for the nested-name-specifier. */
23234 nested_name_specifier
23245 /* Outside of a class-specifier, there must be a
23246 nested-name-specifier. */
23252 /* If we have a class scope, this is easy; DR 147 says that S::S always
23253 names the constructor, and no other qualified name could. */
23256 {
23266 }
23267 /* If we still think that this might be a constructor-declarator,
23268 look for a class-name. */
23270 {
23271 /* If we have:
23273 template <typename T> struct S {
23274 S();
23275 };
23277 we must recognize that the nested `S' names a class. */
23278 tree type_decl;
23282 none_type,
23286 /* If there was no class-name, then this is not a constructor.
23287 Otherwise, if we are in a class-specifier and we aren't
23288 handling a friend declaration, check that its type matches
23289 current_class_type (c++/38313). Note: error_mark_node
23290 is left alone for error recovery purposes. */
23292 && (outside_class_specifier_p
23297 /* If we're still considering a constructor, we have to see a `(',
23298 to begin the parameter-declaration-clause, followed by either a
23299 `)', an `...', or a decl-specifier. We need to check for a
23300 type-specifier to avoid being fooled into thinking that:
23302 S (f) (int);
23304 is a constructor. (It is actually a function named `f' that
23305 takes one parameter (of type `int') and returns a value of type
23306 `S'. */
23314 /* A parameter declaration begins with a decl-specifier,
23315 which is either the "attribute" keyword, a storage class
23316 specifier, or (usually) a type-specifier. */
23318 {
23319 tree type;
23323 /* Names appearing in the type-specifier should be looked up
23324 in the scope of the class. */
23327 else
23328 {
23331 {
23335 {
23338 }
23339 }
23341 }
23343 /* Inside the constructor parameter list, surrounding
23344 template-parameter-lists do not apply. */
23345 saved_num_template_parameter_lists
23349 /* Look for the type-specifier. */
23351 CP_PARSER_FLAGS_NONE,
23357 parser->num_template_parameter_lists
23360 /* Leave the scope of the class. */
23365 }
23366 }
23368 /* We did not really want to consume any tokens. */
23372 }
23374 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23375 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23376 they must be performed once we are in the scope of the function.
23378 Returns the function defined. */
23380 static tree
23381 cp_parser_function_definition_from_specifiers_and_declarator
23384 tree attributes,
23386 {
23387 tree fn;
23390 /* Begin the function-definition. */
23393 /* The things we're about to see are not directly qualified by any
23394 template headers we've seen thus far. */
23397 /* If there were names looked up in the decl-specifier-seq that we
23398 did not check, check them now. We must wait until we are in the
23399 scope of the function to perform the checks, since the function
23400 might be a friend. */
23404 {
23407 }
23410 {
23411 /* Skip the entire function. */
23414 }
23416 {
23417 /* Seen already, skip it. An error message has already been output. */
23421 /* If this is a function from a class, pop the nested class. */
23424 }
23425 else
23426 {
23427 timevar_id_t tv;
23430 else
23436 }
23439 }
23441 /* Parse the part of a function-definition that follows the
23442 declarator. INLINE_P is TRUE iff this function is an inline
23443 function defined within a class-specifier.
23445 Returns the function defined. */
23447 static tree
23450 {
23451 tree fn;
23457 bool fully_implicit_function_template_p
23460 tree implicit_template_parms
23463 cp_binding_level* implicit_template_scope
23469 /* If the next token is `return', then the code may be trying to
23470 make use of the "named return value" extension that G++ used to
23471 support. */
23474 {
23475 /* Consume the `return' keyword. */
23477 /* Look for the identifier that indicates what value is to be
23478 returned. */
23480 /* Issue an error message. */
23483 /* Skip tokens until we reach the start of the function body. */
23485 {
23492 }
23493 }
23494 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23495 anything declared inside `f'. */
23496 saved_in_unbraced_linkage_specification_p
23499 /* Inside the function, surrounding template-parameter-lists do not
23500 apply. */
23501 saved_num_template_parameter_lists
23507 /* If the next token is `try', `__transaction_atomic', or
23508 `__transaction_relaxed`, then we are looking at either function-try-block
23509 or function-transaction-block. Note that all of these include the
23510 function-body. */
23513 RID_TRANSACTION_ATOMIC);
23515 RID_TRANSACTION_RELAXED))
23517 RID_TRANSACTION_RELAXED);
23520 else
23521 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23526 /* Finish the function. */
23529 /* Generate code for it, if necessary. */
23531 /* Restore the saved values. */
23532 parser->in_unbraced_linkage_specification_p
23534 parser->num_template_parameter_lists
23538 parser->fully_implicit_function_template_p
23540 parser->implicit_template_parms
23542 parser->implicit_template_scope
23549 }
23551 /* Parse a template-declaration, assuming that the `export' (and
23552 `extern') keywords, if present, has already been scanned. MEMBER_P
23553 is as for cp_parser_template_declaration. */
23555 static void
23557 {
23560 tree parameter_list;
23565 /* Look for the `template' keyword. */
23570 /* And the `<'. */
23574 {
23575 /* 14.5.2.2 [temp.mem]
23577 A local class shall not have member templates. */
23582 }
23583 /* [temp]
23585 A template ... shall not have C linkage. */
23587 {
23589 /* Give it C++ linkage to avoid confusing other parts of the
23590 front end. */
23593 }
23594 else
23597 /* We cannot perform access checks on the template parameter
23598 declarations until we know what is being declared, just as we
23599 cannot check the decl-specifier list. */
23602 /* If the next token is `>', then we have an invalid
23603 specialization. Rather than complain about an invalid template
23604 parameter, issue an error message here. */
23606 {
23610 }
23611 else
23612 {
23613 /* Parse the template parameters. */
23615 }
23617 /* Get the deferred access checks from the parameter list. These
23618 will be checked once we know what is being declared, as for a
23619 member template the checks must be performed in the scope of the
23620 class containing the member. */
23623 /* Look for the `>'. */
23625 /* We just processed one more parameter list. */
23627 /* If the next token is `template', there are more template
23628 parameters. */
23630 RID_TEMPLATE))
23635 else
23636 {
23637 /* There are no access checks when parsing a template, as we do not
23638 know if a specialization will be a friend. */
23642 checks,
23643 member_p,
23648 /* If this is a member template declaration, let the front
23649 end know. */
23651 {
23656 }
23661 }
23662 /* We are done with the current parameter list. */
23667 /* Finish up. */
23670 /* Check the template arguments for a literal operator template. */
23674 {
23678 else
23679 {
23682 {
23688 }
23690 {
23698 }
23699 else
23701 }
23703 {
23706 " Expected non-type template argument pack <char...>"
23708 decl);
23709 else
23712 decl);
23713 }
23714 }
23715 /* Register member declarations. */
23718 /* For the erroneous case of a template with C linkage, we pushed an
23719 implicit C++ linkage scope; exit that scope now. */
23722 /* If DECL is a function template, we must return to parse it later.
23723 (Even though there is no definition, there might be default
23724 arguments that need handling.) */
23728 }
23730 /* Perform the deferred access checks from a template-parameter-list.
23731 CHECKS is a TREE_LIST of access checks, as returned by
23732 get_deferred_access_checks. */
23734 static void
23735 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23736 {
23740 }
23742 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23743 `function-definition' sequence that follows a template header.
23744 If MEMBER_P is true, this declaration appears in a class scope.
23746 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23747 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23749 static tree
23755 {
23758 cp_decl_specifier_seq decl_specifiers;
23762 /* This function is only used when processing a template
23763 declaration. */
23767 /* Defer access checks until we know what is being declared. */
23770 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23771 alternative. */
23774 CP_PARSER_FLAGS_OPTIONAL,
23780 /* There are no template typedefs. */
23782 {
23786 }
23788 /* Gather up the access checks that occurred the
23789 decl-specifier-seq. */
23792 /* Check for the declaration of a template class. */
23794 {
23796 {
23799 /* In this case:
23801 struct C {
23802 friend template <typename T> struct A<T>::B;
23803 };
23805 A<T>::B will be represented by a TYPENAME_TYPE, and
23806 therefore not recognized by shadow_tag. */
23808 && !decl
23815 else
23818 /* Perform access checks for template parameters. */
23820 }
23821 }
23823 /* Complain about missing 'typename' or other invalid type names. */
23826 {
23827 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23828 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23829 the rest of this declaration. */
23832 }
23834 /* If it's not a template class, try for a template function. If
23835 the next token is a `;', then this declaration does not declare
23836 anything. But, if there were errors in the decl-specifiers, then
23837 the error might well have come from an attempted class-specifier.
23838 In that case, there's no need to warn about a missing declarator. */
23842 {
23845 checks,
23847 member_p,
23848 declares_class_or_enum,
23852 /* 7.1.1-1 [dcl.stc]
23854 A storage-class-specifier shall not be specified in an explicit
23855 specialization... */
23857 && explicit_specialization_p
23859 {
23863 }
23867 }
23869 /* Look for a trailing `;' after the declaration. */
23875 out:
23878 /* Clear any current qualification; whatever comes next is the start
23879 of something new. */
23885 }
23887 /* Parse a cast-expression that is not the operand of a unary "&". */
23889 static tree
23891 {
23894 }
23896 /* Parse a functional cast to TYPE. Returns an expression
23897 representing the cast. */
23899 static tree
23901 {
23903 tree expression_list;
23904 tree cast;
23911 {
23919 tf_warning_or_error);
23920 }
23929 else
23930 {
23933 }
23936 tf_warning_or_error);
23937 /* [expr.const]/1: In an integral constant expression "only type
23938 conversions to integral or enumeration type can be used". */
23944 NIC_CONSTRUCTOR))
23947 }
23949 /* Save the tokens that make up the body of a member function defined
23950 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23951 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23952 specifiers applied to the declaration. Returns the FUNCTION_DECL
23953 for the member function. */
23955 static tree
23959 tree attributes)
23960 {
23963 tree fn;
23965 /* Create the FUNCTION_DECL. */
23968 /* If something went badly wrong, bail out now. */
23970 {
23971 /* If there's a function-body, skip it. */
23976 }
23978 /* Remember it, if there default args to post process. */
23981 /* Save away the tokens that make up the body of the
23982 function. */
23984 /* Handle function try blocks. */
23987 /* We can have braced-init-list mem-initializers before the fn body. */
23989 {
23992 {
23993 /* cache_group will stop after an un-nested { } pair, too. */
23997 /* variadic mem-inits have ... after the ')'. */
24000 }
24001 }
24003 /* Handle function try blocks. */
24008 /* Save away the inline definition; we will process it when the
24009 class is complete. */
24013 /* We need to know that this was defined in the class, so that
24014 friend templates are handled correctly. */
24017 /* Add FN to the queue of functions to be parsed later. */
24021 }
24023 /* Save the tokens that make up the in-class initializer for a non-static
24024 data member. Returns a DEFAULT_ARG. */
24026 static tree
24028 {
24030 }
24032 /* Parse a template-argument-list, as well as the trailing ">" (but
24033 not the opening "<"). See cp_parser_template_argument_list for the
24034 return value. */
24036 static tree
24038 {
24039 tree arguments;
24040 tree saved_scope;
24041 tree saved_qualifying_scope;
24042 tree saved_object_scope;
24047 /* [temp.names]
24049 When parsing a template-id, the first non-nested `>' is taken as
24050 the end of the template-argument-list rather than a greater-than
24051 operator. */
24052 saved_greater_than_is_operator_p
24055 /* Parsing the argument list may modify SCOPE, so we save it
24056 here. */
24060 /* We need to evaluate the template arguments, even though this
24061 template-id may be nested within a "sizeof". */
24066 /* Parse the template-argument-list itself. */
24070 else
24072 /* Look for the `>' that ends the template-argument-list. If we find
24073 a '>>' instead, it's probably just a typo. */
24075 {
24077 {
24078 /* In C++0x, a `>>' in a template argument list or cast
24079 expression is considered to be two separate `>'
24080 tokens. So, change the current token to a `>', but don't
24081 consume it: it will be consumed later when the outer
24082 template argument list (or cast expression) is parsed.
24083 Note that this replacement of `>' for `>>' is necessary
24084 even if we are parsing tentatively: in the tentative
24085 case, after calling
24086 cp_parser_enclosed_template_argument_list we will always
24087 throw away all of the template arguments and the first
24088 closing `>', either because the template argument list
24089 was erroneous or because we are replacing those tokens
24090 with a CPP_TEMPLATE_ID token. The second `>' (which will
24091 not have been thrown away) is needed either to close an
24092 outer template argument list or to complete a new-style
24093 cast. */
24096 }
24098 {
24099 /* If we're in a nested template argument list, the '>>' has
24100 to be a typo for '> >'. We emit the error message, but we
24101 continue parsing and we push a '>' as next token, so that
24102 the argument list will be parsed correctly. Note that the
24103 global source location is still on the token before the
24104 '>>', so we need to say explicitly where we want it. */
24110 }
24111 else
24112 {
24113 /* If this is not a nested template argument list, the '>>'
24114 is a typo for '>'. Emit an error message and continue.
24115 Same deal about the token location, but here we can get it
24116 right by consuming the '>>' before issuing the diagnostic. */
24119 "spurious %<>>%>, use %<>%> to terminate "
24121 }
24122 }
24123 else
24125 /* The `>' token might be a greater-than operator again now. */
24126 parser->greater_than_is_operator_p
24128 /* Restore the SAVED_SCOPE. */
24136 }
24138 /* MEMBER_FUNCTION is a member function, or a friend. If default
24139 arguments, or the body of the function have not yet been parsed,
24140 parse them now. */
24142 static void
24144 {
24146 /* If this member is a template, get the underlying
24147 FUNCTION_DECL. */
24151 /* There should not be any class definitions in progress at this
24152 point; the bodies of members are only parsed outside of all class
24153 definitions. */
24155 /* While we're parsing the member functions we might encounter more
24156 classes. We want to handle them right away, but we don't want
24157 them getting mixed up with functions that are currently in the
24158 queue. */
24161 /* Make sure that any template parameters are in scope. */
24164 /* If the body of the function has not yet been parsed, parse it
24165 now. */
24167 {
24168 tree function_scope;
24171 /* The function is no longer pending; we are processing it. */
24176 /* If this is a local class, enter the scope of the containing
24177 function. */
24182 /* Push the body of the function onto the lexer stack. */
24185 /* Let the front end know that we going to be defining this
24186 function. */
24190 /* Don't do access checking if it is a templated function. */
24194 /* #pragma omp declare reduction needs special parsing. */
24196 {
24201 }
24202 else
24203 /* Now, parse the body of the function. */
24210 /* Leave the scope of the containing function. */
24214 }
24216 /* Remove any template parameters from the symbol table. */
24219 /* Restore the queue. */
24222 }
24224 /* If DECL contains any default args, remember it on the unparsed
24225 functions queue. */
24227 static void
24229 {
24230 tree probe;
24233 probe;
24236 {
24240 }
24241 }
24243 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24244 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24245 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24246 from the parameter-type-list. */
24248 static tree
24251 {
24253 tree parsed_arg;
24259 /* Push the saved tokens for the default argument onto the parser's
24260 lexer stack. */
24266 /* Parse the default argument. */
24277 {
24278 /* In a non-template class, check conversions now. In a template,
24279 we'll wait and instantiate these as needed. */
24282 tf_warning_or_error);
24283 else
24285 }
24287 /* If the token stream has not been completely used up, then
24288 there was extra junk after the end of the default
24289 argument. */
24291 {
24294 else
24296 }
24298 /* Revert to the main lexer. */
24302 }
24304 /* FIELD is a non-static data member with an initializer which we saved for
24305 later; parse it now. */
24307 static void
24309 {
24310 tree def;
24317 NULL_TREE);
24323 }
24325 /* FN is a FUNCTION_DECL which may contains a parameter with an
24326 unparsed DEFAULT_ARG. Parse the default args now. This function
24327 assumes that the current scope is the scope in which the default
24328 argument should be processed. */
24330 static void
24332 {
24336 /* While we're parsing the default args, we might (due to the
24337 statement expression extension) encounter more classes. We want
24338 to handle them right away, but we don't want them getting mixed
24339 up with default args that are currently in the queue. */
24342 /* Local variable names (and the `this' keyword) may not appear
24343 in a default argument. */
24354 {
24356 tree parsed_arg;
24358 tree copy;
24365 /* This can happen for a friend declaration for a function
24366 already declared with default arguments. */
24369 parsed_arg
24371 default_arg,
24374 {
24376 }
24380 /* Update any instantiations we've already created. */
24384 }
24388 /* Make sure no default arg is missing. */
24391 /* Restore the state of local_variables_forbidden_p. */
24394 /* Restore the queue. */
24396 }
24398 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24400 sizeof ... ( identifier )
24402 where the 'sizeof' token has already been consumed. */
24404 static tree
24406 {
24407 /* Consume the `...'. */
24414 else
24422 /* The name is not qualified. */
24441 }
24443 /* Parse the operand of `sizeof' (or a similar operator). Returns
24444 either a TYPE or an expression, depending on the form of the
24445 input. The KEYWORD indicates which kind of expression we have
24446 encountered. */
24448 static tree
24450 {
24457 /* If it's a `...', then we are computing the length of a parameter
24458 pack. */
24463 /* Types cannot be defined in a `sizeof' expression. Save away the
24464 old message. */
24466 /* And create the new one. */
24472 /* The restrictions on constant-expressions do not apply inside
24473 sizeof expressions. */
24474 saved_integral_constant_expression_p
24476 saved_non_integral_constant_expression_p
24480 /* Do not actually evaluate the expression. */
24483 /* If it's a `(', then we might be looking at the type-id
24484 construction. */
24486 {
24489 /* We can't be sure yet whether we're looking at a type-id or an
24490 expression. */
24492 /* Note: as a GNU Extension, compound literals are considered
24493 postfix-expressions as they are in C99, so they are valid
24494 arguments to sizeof. See comment in cp_parser_cast_expression
24495 for details. */
24498 else
24499 {
24502 /* Look for the type-id. */
24504 /* Look for the closing `)'. */
24507 }
24509 /* If all went well, then we're done. */
24511 {
24512 cp_decl_specifier_seq decl_specs;
24514 /* Build a trivial decl-specifier-seq. */
24518 /* Call grokdeclarator to figure out what type this is. */
24521 TYPENAME,
24524 }
24525 }
24527 /* If the type-id production did not work out, then we must be
24528 looking at the unary-expression production. */
24532 /* Go back to evaluating expressions. */
24536 /* Free the message we created. */
24538 /* And restore the old one. */
24540 parser->integral_constant_expression_p
24542 parser->non_integral_constant_expression_p
24546 }
24548 /* If the current declaration has no declarator, return true. */
24550 static bool
24552 {
24553 /* If the next token is a `;' or a `,' then there is no
24554 declarator. */
24557 }
24559 /* Update the DECL_SPECS to reflect the storage class indicated by
24560 KEYWORD. */
24562 static void
24567 {
24568 cp_storage_class storage_class;
24571 {
24575 }
24577 {
24580 }
24585 {
24588 }
24591 {
24609 }
24613 /* A storage class specifier cannot be applied alongside a typedef
24614 specifier. If there is a typedef specifier present then set
24615 conflicting_specifiers_p which will trigger an error later
24616 on in grokdeclarator. */
24619 }
24621 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24622 is true, the type is a class or enum definition. */
24624 static void
24626 tree type_spec,
24629 {
24632 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24633 (with, for example, in "typedef int wchar_t;") we remember that
24634 this is what happened. In system headers, we ignore these
24635 declarations so that G++ can work with system headers that are not
24636 C++-safe. */
24638 && !type_definition_p
24648 {
24651 ds_redefined_builtin_type_spec,
24652 token);
24654 {
24658 }
24659 }
24662 else
24663 {
24668 }
24669 }
24671 /* True iff TOKEN is the GNU keyword __thread. */
24673 static bool
24675 {
24678 }
24680 /* Set the location for a declarator specifier and check if it is
24681 duplicated.
24683 DECL_SPECS is the sequence of declarator specifiers onto which to
24684 set the location.
24686 DS is the single declarator specifier to set which location is to
24687 be set onto the existing sequence of declarators.
24689 LOCATION is the location for the declarator specifier to
24690 consider. */
24692 static void
24695 {
24704 {
24708 }
24709 else
24710 {
24712 {
24716 else
24717 {
24720 OPT_Wlong_long,
24722 }
24723 }
24725 {
24730 else
24732 }
24733 else
24734 {
24750 "__complex"
24751 };
24754 }
24755 }
24756 }
24758 /* Return true iff the declarator specifier DS is present in the
24759 sequence of declarator specifiers DECL_SPECS. */
24761 bool
24763 cp_decl_spec ds)
24764 {
24771 }
24773 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24774 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24776 static bool
24778 {
24780 }
24782 /* Issue an error message indicating that TOKEN_DESC was expected.
24783 If KEYWORD is true, it indicated this function is called by
24784 cp_parser_require_keword and the required token can only be
24785 a indicated keyword. */
24787 static void
24789 required_token token_desc,
24791 {
24793 {
24862 }
24864 {
24866 {
24945 }
24946 }
24947 else
24949 }
24953 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24954 issue an error message indicating that TOKEN_DESC was expected.
24956 Returns the token consumed, if the token had the appropriate type.
24957 Otherwise, returns NULL. */
24962 required_token token_desc)
24963 {
24966 else
24967 {
24968 /* Output the MESSAGE -- unless we're parsing tentatively. */
24972 }
24973 }
24975 /* An error message is produced if the next token is not '>'.
24976 All further tokens are skipped until the desired token is
24977 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24979 static void
24981 {
24982 /* Current level of '< ... >'. */
24984 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24987 /* Are we ready, yet? If not, issue error message. */
24991 /* Skip tokens until the desired token is found. */
24993 {
24994 /* Peek at the next token. */
24996 {
25004 /* C++0x views the `>>' operator as two `>' tokens, but
25005 C++98 does not. */
25008 {
25009 /* We've hit a `>>' where the first `>' closes the
25010 template argument list, and the second `>' is
25011 spurious. Just consume the `>>' and stop; we've
25012 already produced at least one error. */
25015 }
25016 /* Fall through for C++0x, so we handle the second `>' in
25017 the `>>'. */
25021 {
25022 /* We've reached the token we want, consume it and stop. */
25025 }
25044 /* The '>' was probably forgotten, don't look further. */
25049 }
25051 /* Consume this token. */
25053 }
25054 }
25056 /* If the next token is the indicated keyword, consume it. Otherwise,
25057 issue an error message indicating that TOKEN_DESC was expected.
25059 Returns the token consumed, if the token had the appropriate type.
25060 Otherwise, returns NULL. */
25065 required_token token_desc)
25066 {
25070 {
25073 }
25076 }
25078 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25079 function-definition. */
25081 static bool
25083 {
25086 /* A ctor-initializer begins with a `:'. */
25088 /* A function-try-block begins with `try'. */
25090 /* A function-transaction-block begins with `__transaction_atomic'
25091 or `__transaction_relaxed'. */
25094 /* The named return value extension begins with `return'. */
25096 }
25098 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25099 definition. */
25101 static bool
25103 {
25110 }
25112 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25113 C++0x) ending a template-argument. */
25115 static bool
25117 {
25125 }
25127 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25128 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25130 static bool
25133 {
25139 /* Check for the sequence `<::' in the original code. It would be lexed as
25140 `[:', where `[' is a digraph, and there is no whitespace before
25141 `:'. */
25143 {
25148 }
25150 }
25152 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25153 or none_type otherwise. */
25155 static enum tag_types
25157 {
25159 {
25169 }
25170 }
25172 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25173 or none_type otherwise or if the token is null. */
25175 static enum tag_types
25177 {
25182 {
25190 }
25191 }
25193 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25195 static void
25197 {
25201 {
25205 type))
25208 }
25209 }
25211 /* Issue an error message if DECL is redeclared with different
25212 access than its original declaration [class.access.spec/3].
25213 This applies to nested classes and nested class templates.
25214 [class.mem/1]. */
25216 static void
25218 {
25227 }
25229 /* Look for the `template' keyword, as a syntactic disambiguator.
25230 Return TRUE iff it is present, in which case it will be
25231 consumed. */
25233 static bool
25235 {
25237 {
25238 /* In C++98 the `template' keyword can only be used within templates;
25239 outside templates the parser can always figure out what is a
25240 template and what is not. In C++11, per the resolution of DR 468,
25241 `template' is allowed in cases where it is not strictly necessary. */
25244 {
25247 "in C++98 %<template%> (as a disambiguator) is only "
25249 /* If this part of the token stream is rescanned, the same
25250 error message would be generated. So, we purge the token
25251 from the stream. */
25254 }
25255 else
25256 {
25257 /* Consume the `template' keyword. */
25260 }
25261 }
25263 }
25265 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25266 set PARSER->SCOPE, and perform other related actions. */
25268 static void
25270 {
25276 /* Get the stored value. */
25278 /* Perform any access checks that were deferred. */
25281 {
25286 }
25287 /* Set the scope from the stored value. */
25291 }
25293 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25294 encounter the end of a block before what we were looking for. */
25296 static bool
25300 {
25302 {
25305 /* Abort a parenthesized expression if we encounter a semicolon. */
25309 /* If we've reached the end of the file, stop. */
25315 /* We've hit the end of an enclosing block, so there's been some
25316 kind of syntax error. */
25319 /* Consume the token. */
25321 /* See if it starts a new group. */
25323 {
25325 /* In theory this should probably check end == '}', but
25326 cp_parser_save_member_function_body needs it to exit
25327 after either '}' or ')' when called with ')'. */
25330 }
25332 {
25336 }
25341 }
25342 }
25344 /* Like above, for caching a default argument or NSDMI. Both of these are
25345 terminated by a non-nested comma, but it can be unclear whether or not a
25346 comma is nested in a template argument list unless we do more parsing.
25347 In order to handle this ambiguity, when we encounter a ',' after a '<'
25348 we try to parse what follows as a parameter-declaration-list (in the
25349 case of a default argument) or a member-declarator (in the case of an
25350 NSDMI). If that succeeds, then we stop caching. */
25352 static tree
25354 {
25359 tree default_argument;
25361 /* Add tokens until we have processed the entire default
25362 argument. We add the range [first_token, token). */
25365 {
25366 /* For list-initialization, this is straightforward. */
25369 }
25371 {
25374 /* Peek at the next token. */
25376 /* What we do depends on what token we have. */
25378 {
25379 /* In valid code, a default argument must be
25380 immediately followed by a `,' `)', or `...'. */
25383 {
25384 /* If we've seen a '<', we might be in a
25385 template-argument-list. Until Core issue 325 is
25386 resolved, we don't know how this situation ought
25387 to be handled, so try to DTRT. We check whether
25388 what comes after the comma is a valid parameter
25389 declaration list. If it is, then the comma ends
25390 the default argument; otherwise the default
25391 argument continues. */
25394 /* Set ITALP so cp_parser_parameter_declaration_list
25395 doesn't decide to commit to this parse. */
25403 {
25410 }
25411 else
25412 {
25416 }
25423 }
25426 /* If we run into a non-nested `;', `}', or `]',
25427 then the code is invalid -- but the default
25428 argument is certainly over. */
25433 /* Handle correctly int n = sizeof ... ( p ); */
25436 /* Update DEPTH, if necessary. */
25451 /* This might be the comparison operator, or it might
25452 start a template argument list. */
25459 /* Fall through for C++0x, which treats the `>>'
25460 operator like two `>' tokens in certain
25461 cases. */
25465 {
25466 /* This might be an operator, or it might close a
25467 template argument list. But if a previous '<'
25468 started a template argument list, this will have
25469 closed it, so we can't be in one anymore. */
25473 }
25476 /* If we run out of tokens, issue an error message. */
25485 /* In these cases, we should look for template-ids.
25486 For example, if the default argument is
25487 `X<int, double>()', we need to do name lookup to
25488 figure out whether or not `X' is a template; if
25489 so, the `,' does not end the default argument.
25491 That is not yet done. */
25496 }
25498 /* If we've reached the end, stop. */
25502 /* Add the token to the token block. */
25504 }
25506 /* Create a DEFAULT_ARG to represent the unparsed default
25507 argument. */
25514 }
25516 /* Begin parsing tentatively. We always save tokens while parsing
25517 tentatively so that if the tentative parsing fails we can restore the
25518 tokens. */
25520 static void
25522 {
25523 /* Enter a new parsing context. */
25525 /* Begin saving tokens. */
25527 /* In order to avoid repetitive access control error messages,
25528 access checks are queued up until we are no longer parsing
25529 tentatively. */
25531 }
25533 /* Commit to the currently active tentative parse. */
25535 static void
25537 {
25541 /* Mark all of the levels as committed. */
25544 {
25551 }
25552 }
25554 /* Commit to the topmost currently active tentative parse.
25556 Note that this function shouldn't be called when there are
25557 irreversible side-effects while in a tentative state. For
25558 example, we shouldn't create a permanent entry in the symbol
25559 table, or issue an error message that might not apply if the
25560 tentative parse is aborted. */
25562 static void
25564 {
25569 {
25577 }
25578 }
25580 /* Abort the currently active tentative parse. All consumed tokens
25581 will be rolled back, and no diagnostics will be issued. */
25583 static void
25585 {
25589 /* Now, pretend that we want to see if the construct was
25590 successfully parsed. */
25592 }
25594 /* Stop parsing tentatively. If a parse error has occurred, restore the
25595 token stream. Otherwise, commit to the tokens we have consumed.
25596 Returns true if no error occurred; false otherwise. */
25598 static bool
25600 {
25604 /* Remember whether or not an error occurred, since we are about to
25605 destroy that information. */
25607 /* Remove the topmost context from the stack. */
25610 /* If no parse errors occurred, commit to the tentative parse. */
25612 {
25613 /* Commit to the tokens read tentatively, unless that was
25614 already done. */
25619 }
25620 /* Otherwise, if errors occurred, roll back our state so that things
25621 are just as they were before we began the tentative parse. */
25622 else
25623 {
25626 }
25627 /* Add the context to the front of the free list. */
25632 }
25634 /* Returns true if we are parsing tentatively and are not committed to
25635 this tentative parse. */
25637 static bool
25639 {
25642 }
25644 /* Returns nonzero iff an error has occurred during the most recent
25645 tentative parse. */
25647 static bool
25649 {
25652 }
25654 /* Returns nonzero if GNU extensions are allowed. */
25656 static bool
25658 {
25660 }
25661 \f
25662 /* Objective-C++ Productions */
25665 /* Parse an Objective-C expression, which feeds into a primary-expression
25666 above.
25668 objc-expression:
25669 objc-message-expression
25670 objc-string-literal
25671 objc-encode-expression
25672 objc-protocol-expression
25673 objc-selector-expression
25675 Returns a tree representation of the expression. */
25677 static tree
25679 {
25680 /* Try to figure out what kind of declaration is present. */
25684 {
25694 {
25706 }
25712 }
25715 }
25717 /* Parse an Objective-C message expression.
25719 objc-message-expression:
25720 [ objc-message-receiver objc-message-args ]
25722 Returns a representation of an Objective-C message. */
25724 static tree
25726 {
25735 }
25737 /* Parse an objc-message-receiver.
25739 objc-message-receiver:
25740 expression
25741 simple-type-specifier
25743 Returns a representation of the type or expression. */
25745 static tree
25747 {
25748 tree rcv;
25750 /* An Objective-C message receiver may be either (1) a type
25751 or (2) an expression. */
25755 /* If that worked out, fine. */
25762 CP_PARSER_FLAGS_NONE);
25769 }
25771 /* Parse the arguments and selectors comprising an Objective-C message.
25773 objc-message-args:
25774 objc-selector
25775 objc-selector-args
25776 objc-selector-args , objc-comma-args
25778 objc-selector-args:
25779 objc-selector [opt] : assignment-expression
25780 objc-selector-args objc-selector [opt] : assignment-expression
25782 objc-comma-args:
25783 assignment-expression
25784 objc-comma-args , assignment-expression
25786 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25787 selector arguments and TREE_VALUE containing a list of comma
25788 arguments. */
25790 static tree
25792 {
25798 {
25804 /* Detect if we have a unary selector. */
25813 sel_args
25818 }
25820 /* Handle non-selector arguments, if any. */
25822 {
25823 tree arg;
25828 addl_args
25833 }
25836 {
25839 }
25842 }
25844 /* Parse an Objective-C encode expression.
25846 objc-encode-expression:
25847 @encode objc-typename
25849 Returns an encoded representation of the type argument. */
25851 static tree
25853 {
25854 tree type;
25864 {
25868 }
25870 /* This happens if we find @encode(T) (where T is a template
25871 typename or something dependent on a template typename) when
25872 parsing a template. In that case, we can't compile it
25873 immediately, but we rather create an AT_ENCODE_EXPR which will
25874 need to be instantiated when the template is used.
25875 */
25877 {
25881 }
25884 }
25886 /* Parse an Objective-C @defs expression. */
25888 static tree
25890 {
25891 tree name;
25899 }
25901 /* Parse an Objective-C protocol expression.
25903 objc-protocol-expression:
25904 @protocol ( identifier )
25906 Returns a representation of the protocol expression. */
25908 static tree
25910 {
25911 tree proto;
25919 }
25921 /* Parse an Objective-C selector expression.
25923 objc-selector-expression:
25924 @selector ( objc-method-signature )
25926 objc-method-signature:
25927 objc-selector
25928 objc-selector-seq
25930 objc-selector-seq:
25931 objc-selector :
25932 objc-selector-seq objc-selector :
25934 Returns a representation of the method selector. */
25936 static tree
25938 {
25950 {
25959 {
25960 /* Detect if we have a unary selector. */
25962 {
25965 }
25966 else
25967 {
25969 }
25970 }
25975 {
25976 sel_seq
25979 sel_seq
25982 }
25983 else
25984 sel_seq
25989 }
25991 finish_selector:
25995 }
25997 /* Parse a list of identifiers.
25999 objc-identifier-list:
26000 identifier
26001 objc-identifier-list , identifier
26003 Returns a TREE_LIST of identifier nodes. */
26005 static tree
26007 {
26008 tree identifier;
26009 tree list;
26020 {
26027 identifier));
26029 }
26032 }
26034 /* Parse an Objective-C alias declaration.
26036 objc-alias-declaration:
26037 @compatibility_alias identifier identifier ;
26039 This function registers the alias mapping with the Objective-C front end.
26040 It returns nothing. */
26042 static void
26044 {
26052 }
26054 /* Parse an Objective-C class forward-declaration.
26056 objc-class-declaration:
26057 @class objc-identifier-list ;
26059 The function registers the forward declarations with the Objective-C
26060 front end. It returns nothing. */
26062 static void
26064 {
26067 {
26068 tree id;
26078 else
26080 }
26082 }
26084 /* Parse a list of Objective-C protocol references.
26086 objc-protocol-refs-opt:
26087 objc-protocol-refs [opt]
26089 objc-protocol-refs:
26090 < objc-identifier-list >
26092 Returns a TREE_LIST of identifiers, if any. */
26094 static tree
26096 {
26100 {
26104 }
26107 }
26109 /* Parse a Objective-C visibility specification. */
26111 static void
26113 {
26117 {
26132 }
26134 /* Eat '@private'/'@protected'/'@public'. */
26136 }
26138 /* Parse an Objective-C method type. Return 'true' if it is a class
26139 (+) method, and 'false' if it is an instance (-) method. */
26143 {
26146 else
26148 }
26150 /* Parse an Objective-C protocol qualifier. */
26152 static tree
26154 {
26167 {
26172 }
26175 }
26177 /* Parse an Objective-C typename. */
26179 static tree
26181 {
26185 {
26191 /* An ObjC type name may consist of just protocol qualifiers, in which
26192 case the type shall default to 'id'. */
26194 {
26197 /* If the type could not be parsed, an error has already
26198 been produced. For error recovery, behave as if it had
26199 not been specified, which will use the default type
26200 'id'. */
26202 {
26204 /* We need to skip to the closing parenthesis as
26205 cp_parser_type_id() does not seem to do it for
26206 us. */
26211 }
26212 }
26216 }
26219 }
26221 /* Check to see if TYPE refers to an Objective-C selector name. */
26223 static bool
26225 {
26231 }
26233 /* Parse an Objective-C selector. */
26235 static tree
26237 {
26241 {
26244 }
26246 /* C++ operator names are allowed to appear in ObjC selectors. */
26248 {
26261 }
26262 }
26264 /* Parse an Objective-C params list. */
26266 static tree
26268 {
26274 {
26284 /* Detect if we have a unary selector. */
26287 {
26290 }
26294 {
26295 /* Something went quite wrong. There should be a colon
26296 here, but there is not. Stop parsing parameters. */
26298 }
26300 /* New ObjC allows attributes on parameters too. */
26305 params
26308 type_name,
26309 identifier,
26310 parm_attr));
26313 }
26316 {
26319 }
26321 /* We allow tail attributes for the method. */
26323 {
26331 }
26334 {
26337 }
26339 }
26341 /* Parse the non-keyword Objective-C params. */
26343 static tree
26346 {
26352 {
26354 tree parm;
26360 {
26365 }
26367 /* TODO: parse attributes for tail parameters. */
26376 }
26378 /* We allow tail attributes for the method. */
26380 {
26382 {
26387 }
26388 else
26389 /* We have an error, but parse the attributes, so that we can
26390 carry on. */
26396 }
26399 }
26401 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26403 static void
26405 {
26408 /* If the next token is `extern' and the following token is a string
26409 literal, then we have a linkage specification. */
26411 && cp_parser_is_pure_string_literal
26414 /* Handle #pragma, if any. */
26417 /* Allow stray semicolons. */
26420 /* Mark methods as optional or required, when building protocols. */
26422 {
26425 }
26427 {
26430 }
26433 /* Other stray characters must generate errors. */
26435 {
26439 }
26440 /* Finally, try to parse a block-declaration, or a function-definition. */
26441 else
26443 }
26445 /* Parse a method signature. */
26447 static tree
26449 {
26465 }
26467 static bool
26469 {
26470 tree tattr;
26475 /* If the attributes are followed by a method introducer, this is not allowed.
26476 Dump the attributes and flag the situation. */
26481 /* Otherwise, the attributes introduce some interstitial code, possibly so
26482 rewind to allow that check. */
26485 }
26487 /* Parse an Objective-C method prototype list. */
26489 static void
26491 {
26495 {
26497 {
26502 else
26506 {
26510 }
26513 }
26519 OPT_Wattributes,
26521 else
26522 /* Allow for interspersed non-ObjC++ code. */
26526 }
26530 else
26534 }
26536 /* Parse an Objective-C method definition list. */
26538 static void
26540 {
26544 {
26545 tree meth;
26548 {
26554 else
26559 {
26563 }
26565 NULL_TREE);
26567 /* For historical reasons, we accept an optional semicolon. */
26574 {
26581 }
26582 }
26583 /* The following case will be removed once @synthesize is
26584 completely implemented. */
26595 else
26596 /* Allow for interspersed non-ObjC++ code. */
26600 }
26604 else
26608 }
26610 /* Parse Objective-C ivars. */
26612 static void
26614 {
26625 {
26626 cp_decl_specifier_seq declspecs;
26628 tree prefix_attributes;
26636 CP_PARSER_FLAGS_OPTIONAL,
26640 /* auto, register, static, extern, mutable. */
26642 {
26645 }
26647 /* thread_local. */
26649 {
26652 }
26654 /* typedef. */
26656 {
26659 }
26664 /* Keep going until we hit the `;' at the end of the
26665 declaration. */
26667 {
26672 /* Check for a (possibly unnamed) bitfield declaration. */
26680 {
26681 /* Get the name of the bitfield. */
26684 sfk_none);
26686 eat_colon:
26688 /* Get the width of the bitfield. */
26689 width
26691 }
26692 else
26693 {
26694 /* Parse the declarator. */
26695 declarator
26701 }
26703 /* Look for attributes that apply to the ivar. */
26705 /* Remember which attributes are prefix attributes and
26706 which are not. */
26708 /* Combine the attributes. */
26712 /* Create the bitfield declaration. */
26714 width,
26715 attributes);
26716 else
26721 /* Add the instance variable. */
26725 /* Reset PREFIX_ATTRIBUTES. */
26734 {
26737 }
26739 }
26743 }
26748 /* Do not consume the RID_AT_END, so it will be read again as terminating
26749 the @interface of @implementation. */
26753 /* For historical reasons, we accept an optional semicolon. */
26756 }
26758 /* Parse an Objective-C protocol declaration. */
26760 static void
26762 {
26768 {
26773 }
26775 /* See if we have a forward declaration or a definition. */
26778 /* Try a forward declaration first. */
26780 {
26782 {
26783 tree id;
26793 else
26795 }
26797 }
26799 /* Ok, we got a full-fledged definition (or at least should). */
26800 else
26801 {
26806 }
26807 }
26809 /* Parse an Objective-C superclass or category. */
26811 static void
26816 {
26822 {
26825 }
26827 {
26830 /* If there is no category name, and this is an @interface, we
26831 have a class extension. */
26833 {
26836 }
26837 else
26841 }
26842 }
26844 /* Parse an Objective-C class interface. */
26846 static void
26848 {
26855 {
26856 /* It's hard to recover because even if valid @interface stuff
26857 is to follow, we can't compile it (or validate it) if we
26858 don't even know which class it refers to. Let's assume this
26859 was a stray '@interface' token in the stream and skip it.
26860 */
26862 }
26867 /* We have either a class or a category on our hands. */
26870 else
26871 {
26873 /* Handle instance variable declarations, if any. */
26876 }
26879 }
26881 /* Parse an Objective-C class implementation. */
26883 static void
26885 {
26892 {
26893 /* It's hard to recover because even if valid @implementation
26894 stuff is to follow, we can't compile it (or validate it) if
26895 we don't even know which class it refers to. Let's assume
26896 this was a stray '@implementation' token in the stream and
26897 skip it.
26898 */
26900 }
26904 /* We have either a class or a category on our hands. */
26907 else
26908 {
26910 /* Handle instance variable declarations, if any. */
26913 }
26916 }
26918 /* Consume the @end token and finish off the implementation. */
26920 static void
26922 {
26925 }
26927 /* Parse an Objective-C declaration. */
26929 static void
26931 {
26932 /* Try to figure out what kind of declaration is present. */
26937 {
26953 }
26956 {
26979 }
26980 }
26982 /* Parse an Objective-C try-catch-finally statement.
26984 objc-try-catch-finally-stmt:
26985 @try compound-statement objc-catch-clause-seq [opt]
26986 objc-finally-clause [opt]
26988 objc-catch-clause-seq:
26989 objc-catch-clause objc-catch-clause-seq [opt]
26991 objc-catch-clause:
26992 @catch ( objc-exception-declaration ) compound-statement
26994 objc-finally-clause:
26995 @finally compound-statement
26997 objc-exception-declaration:
26998 parameter-declaration
26999 '...'
27001 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27003 Returns NULL_TREE.
27005 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27006 for C. Keep them in sync. */
27008 static tree
27010 {
27011 location_t location;
27012 tree stmt;
27017 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27018 node, lest it get absorbed into the surrounding block. */
27024 {
27033 {
27034 /* We have "@catch (...)" (where the '...' are literally
27035 what is in the code). Skip the '...'.
27036 parameter_declaration is set to NULL_TREE, and
27037 objc_being_catch_clauses() knows that that means
27038 '...'. */
27041 }
27042 else
27043 {
27044 /* We have "@catch (NSException *exception)" or something
27045 like that. Parse the parameter declaration. */
27049 else
27054 }
27057 else
27058 {
27059 /* If there was no open parenthesis, we are recovering from
27060 an error, and we are trying to figure out what mistake
27061 the user has made. */
27063 /* If there is an immediate closing parenthesis, the user
27064 probably forgot the opening one (ie, they typed "@catch
27065 NSException *e)". Parse the closing parenthesis and keep
27066 going. */
27070 /* If these is no immediate closing parenthesis, the user
27071 probably doesn't know that parenthesis are required at
27072 all (ie, they typed "@catch NSException *e"). So, just
27073 forget about the closing parenthesis and keep going. */
27074 }
27078 }
27080 {
27083 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27084 node, lest it get absorbed into the surrounding block. */
27088 }
27091 }
27093 /* Parse an Objective-C synchronized statement.
27095 objc-synchronized-stmt:
27096 @synchronized ( expression ) compound-statement
27098 Returns NULL_TREE. */
27100 static tree
27102 {
27103 location_t location;
27114 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27115 node, lest it get absorbed into the surrounding block. */
27120 }
27122 /* Parse an Objective-C throw statement.
27124 objc-throw-stmt:
27125 @throw assignment-expression [opt] ;
27127 Returns a constructed '@throw' statement. */
27129 static tree
27131 {
27143 }
27145 /* Parse an Objective-C statement. */
27147 static tree
27149 {
27150 /* Try to figure out what kind of declaration is present. */
27154 {
27165 }
27168 }
27170 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27171 look ahead to see if an objc keyword follows the attributes. This
27172 is to detect the use of prefix attributes on ObjC @interface and
27173 @protocol. */
27175 static bool
27177 {
27182 {
27185 }
27188 }
27190 /* This routine is a minimal replacement for
27191 c_parser_struct_declaration () used when parsing the list of
27192 types/names or ObjC++ properties. For example, when parsing the
27193 code
27195 @property (readonly) int a, b, c;
27197 this function is responsible for parsing "int a, int b, int c" and
27198 returning the declarations as CHAIN of DECLs.
27200 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27201 similar parsing. */
27202 static tree
27204 {
27206 cp_decl_specifier_seq declspecs;
27208 tree prefix_attributes;
27211 CP_PARSER_FLAGS_NONE,
27218 /* auto, register, static, extern, mutable. */
27220 {
27223 }
27225 /* thread_local. */
27227 {
27230 }
27232 /* typedef. */
27234 {
27237 }
27242 /* Keep going until we hit the `;' at the end of the declaration. */
27244 {
27249 /* Parse the declarator. */
27253 /* Look for attributes that apply to the ivar. */
27255 /* Remember which attributes are prefix attributes and
27256 which are not. */
27258 /* Combine the attributes. */
27268 /* Reset PREFIX_ATTRIBUTES. */
27279 {
27282 }
27283 else
27285 }
27287 }
27289 /* Parse an Objective-C @property declaration. The syntax is:
27291 objc-property-declaration:
27292 '@property' objc-property-attributes[opt] struct-declaration ;
27294 objc-property-attributes:
27295 '(' objc-property-attribute-list ')'
27297 objc-property-attribute-list:
27298 objc-property-attribute
27299 objc-property-attribute-list, objc-property-attribute
27301 objc-property-attribute
27302 'getter' = identifier
27303 'setter' = identifier
27304 'readonly'
27305 'readwrite'
27306 'assign'
27307 'retain'
27308 'copy'
27309 'nonatomic'
27311 For example:
27312 @property NSString *name;
27313 @property (readonly) id object;
27314 @property (retain, nonatomic, getter=getTheName) id name;
27315 @property int a, b, c;
27317 PS: This function is identical to
27318 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27319 static void
27321 {
27322 /* The following variables hold the attributes of the properties as
27323 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27324 seen. When we see an attribute, we set them to 'true' (if they
27325 are boolean properties) or to the identifier (if they have an
27326 argument, ie, for getter and setter). Note that here we only
27327 parse the list of attributes, check the syntax and accumulate the
27328 attributes that we find. objc_add_property_declaration() will
27329 then process the information. */
27339 /* 'properties' is the list of properties that we read. Usually a
27340 single one, but maybe more (eg, in "@property int a, b, c;" there
27341 are three). */
27342 tree properties;
27343 location_t loc;
27349 /* Parse the optional attribute list... */
27351 {
27352 /* Eat the '('. */
27356 {
27362 {
27365 }
27369 {
27380 {
27384 else
27389 }
27392 {
27396 }
27398 {
27400 {
27403 }
27404 else
27408 else
27410 }
27411 else
27412 {
27414 {
27417 }
27418 else
27420 }
27426 }
27433 else
27435 }
27437 /* FIXME: "@property (setter, assign);" will generate a spurious
27438 "error: expected ‘)’ before ‘,’ token". This is because
27439 cp_parser_require, unlike the C counterpart, will produce an
27440 error even if we are in error recovery. */
27442 {
27447 }
27448 }
27450 /* ... and the property declaration(s). */
27454 {
27456 /* If the next token is now a `;', consume it. */
27460 }
27464 else
27465 {
27466 /* Comma-separated properties are chained together in
27467 reverse order; add them one by one. */
27476 }
27479 }
27481 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27483 objc-synthesize-declaration:
27484 @synthesize objc-synthesize-identifier-list ;
27486 objc-synthesize-identifier-list:
27487 objc-synthesize-identifier
27488 objc-synthesize-identifier-list, objc-synthesize-identifier
27490 objc-synthesize-identifier
27491 identifier
27492 identifier = identifier
27494 For example:
27495 @synthesize MyProperty;
27496 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27498 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27499 for C. Keep them in sync.
27500 */
27501 static void
27503 {
27505 location_t loc;
27510 {
27514 {
27517 }
27519 {
27523 {
27526 }
27527 }
27528 else
27533 else
27535 }
27538 }
27540 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27542 objc-dynamic-declaration:
27543 @dynamic identifier-list ;
27545 For example:
27546 @dynamic MyProperty;
27547 @dynamic MyProperty, AnotherProperty;
27549 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27550 for C. Keep them in sync.
27551 */
27552 static void
27554 {
27556 location_t loc;
27561 {
27562 tree property;
27565 {
27568 }
27572 else
27574 }
27577 }
27579 \f
27580 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27582 /* Returns name of the next clause.
27583 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27584 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27585 returned and the token is consumed. */
27587 static pragma_omp_clause
27589 {
27603 {
27608 {
27751 }
27752 }
27758 }
27760 /* Validate that a clause of the given type does not already exist. */
27762 static void
27765 {
27766 tree c;
27770 {
27773 }
27774 }
27776 /* OpenMP 2.5:
27777 variable-list:
27778 identifier
27779 variable-list , identifier
27781 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27782 colon). An opening parenthesis will have been consumed by the caller.
27784 If KIND is nonzero, create the appropriate node and install the decl
27785 in OMP_CLAUSE_DECL and add the node to the head of the list.
27787 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27788 return the list created.
27790 COLON can be NULL if only closing parenthesis should end the list,
27791 or pointer to bool which will receive false if the list is terminated
27792 by closing parenthesis or true if the list is terminated by colon. */
27794 static tree
27797 {
27801 {
27804 }
27806 {
27823 {
27825 {
27828 {
27832 }
27833 /* FALL THROUGH. */
27839 {
27847 parser->colon_corrects_to_scope_p
27851 else
27852 {
27853 /* Look for `:'. */
27857 CPP_CLOSE_SQUARE))
27859 }
27860 /* Look for the closing `]'. */
27862 RT_CLOSE_SQUARE))
27866 {
27869 {
27873 }
27877 {
27881 }
27882 }
27885 }
27889 }
27895 }
27896 else
27899 get_comma:
27903 }
27909 {
27913 }
27916 {
27919 /* Try to resync to an unnested comma. Copied from
27920 cp_parser_parenthesized_expression_list. */
27921 skip_comma:
27930 }
27933 }
27935 /* Similarly, but expect leading and trailing parenthesis. This is a very
27936 common case for omp clauses. */
27938 static tree
27940 {
27944 }
27946 /* OpenACC 2.0:
27947 copy ( variable-list )
27948 copyin ( variable-list )
27949 copyout ( variable-list )
27950 create ( variable-list )
27951 delete ( variable-list )
27952 present ( variable-list )
27953 present_or_copy ( variable-list )
27954 pcopy ( variable-list )
27955 present_or_copyin ( variable-list )
27956 pcopyin ( variable-list )
27957 present_or_copyout ( variable-list )
27958 pcopyout ( variable-list )
27959 present_or_create ( variable-list )
27960 pcreate ( variable-list ) */
27962 static tree
27964 tree list)
27965 {
27968 {
28008 }
28016 }
28018 /* OpenACC 2.0:
28019 deviceptr ( variable-list ) */
28021 static tree
28023 {
28027 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28028 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28029 variable-list must only allow for pointer variables. */
28032 {
28035 /* FIXME diagnostics: Ideally we should keep individual
28036 locations for all the variables in the var list to make the
28037 following errors more precise. Perhaps
28038 c_parser_omp_var_list_parens should construct a list of
28039 locations to go along with the var list. */
28044 ;
28053 }
28056 }
28058 /* OpenACC:
28059 vector_length ( expression ) */
28061 static tree
28063 {
28073 {
28076 }
28079 {
28084 }
28087 location);
28095 }
28097 /* OpenACC 2.0
28098 Parse wait clause or directive parameters. */
28100 static tree
28102 {
28112 {
28117 }
28124 {
28128 {
28131 else
28132 {
28139 }
28140 }
28141 }
28144 }
28146 /* OpenACC:
28147 wait ( int-expr-list ) */
28149 static tree
28151 {
28160 }
28162 /* OpenMP 3.0:
28163 collapse ( constant-expression ) */
28165 static tree
28167 {
28169 location_t loc;
28170 HOST_WIDE_INT n;
28190 {
28193 }
28201 }
28203 /* OpenMP 2.5:
28204 default ( shared | none ) */
28206 static tree
28208 {
28210 tree c;
28215 {
28220 {
28235 }
28238 }
28239 else
28240 {
28241 invalid_kind:
28243 }
28259 }
28261 /* OpenMP 3.1:
28262 final ( expression ) */
28264 static tree
28266 {
28287 }
28289 /* OpenMP 2.5:
28290 if ( expression ) */
28292 static tree
28294 {
28315 }
28317 /* OpenMP 3.1:
28318 mergeable */
28320 static tree
28323 {
28324 tree c;
28327 location);
28332 }
28334 /* OpenMP 2.5:
28335 nowait */
28337 static tree
28340 {
28341 tree c;
28348 }
28350 /* OpenACC:
28351 num_gangs ( expression ) */
28353 static tree
28355 {
28371 {
28374 }
28384 }
28386 /* OpenMP 2.5:
28387 num_threads ( expression ) */
28389 static tree
28391 location_t location)
28392 {
28414 }
28416 /* OpenACC:
28417 num_workers ( expression ) */
28419 static tree
28421 {
28437 {
28440 }
28443 location);
28451 }
28453 /* OpenMP 2.5:
28454 ordered */
28456 static tree
28459 {
28460 tree c;
28468 }
28470 /* OpenMP 2.5:
28471 reduction ( reduction-operator : variable-list )
28473 reduction-operator:
28474 One of: + * - & ^ | && ||
28476 OpenMP 3.1:
28478 reduction-operator:
28479 One of: + * - & ^ | && || min max
28481 OpenMP 4.0:
28483 reduction-operator:
28484 One of: + * - & ^ | && ||
28485 id-expression */
28487 static tree
28489 {
28497 {
28507 }
28511 else
28512 {
28523 {
28553 }
28554 else
28555 {
28557 resync_fail:
28562 }
28563 }
28569 NULL);
28571 {
28574 }
28577 }
28579 /* OpenMP 2.5:
28580 schedule ( schedule-kind )
28581 schedule ( schedule-kind , expression )
28583 schedule-kind:
28584 static | dynamic | guided | runtime | auto */
28586 static tree
28588 {
28597 {
28602 {
28623 }
28624 }
28629 else
28634 {
28649 else
28654 }
28662 invalid_kind:
28664 resync_fail:
28669 }
28671 /* OpenMP 3.0:
28672 untied */
28674 static tree
28677 {
28678 tree c;
28685 }
28687 /* OpenMP 4.0:
28688 inbranch
28689 notinbranch */
28691 static tree
28694 {
28699 }
28701 /* OpenMP 4.0:
28702 parallel
28703 for
28704 sections
28705 taskgroup */
28707 static tree
28711 {
28715 }
28717 /* OpenMP 4.0:
28718 num_teams ( expression ) */
28720 static tree
28722 location_t location)
28723 {
28745 }
28747 /* OpenMP 4.0:
28748 thread_limit ( expression ) */
28750 static tree
28752 location_t location)
28753 {
28775 }
28777 /* OpenMP 4.0:
28778 aligned ( variable-list )
28779 aligned ( variable-list : constant-expression ) */
28781 static tree
28783 {
28794 {
28804 }
28810 }
28812 /* OpenMP 4.0:
28813 linear ( variable-list )
28814 linear ( variable-list : expression ) */
28816 static tree
28819 {
28830 {
28834 {
28837 }
28845 }
28851 }
28853 /* OpenMP 4.0:
28854 safelen ( constant-expression ) */
28856 static tree
28858 location_t location)
28859 {
28880 }
28882 /* OpenMP 4.0:
28883 simdlen ( constant-expression ) */
28885 static tree
28887 location_t location)
28888 {
28909 }
28911 /* OpenMP 4.0:
28912 depend ( depend-kind : variable-list )
28914 depend-kind:
28915 in | out | inout */
28917 static tree
28919 {
28927 {
28937 else
28939 }
28940 else
28948 NULL);
28955 invalid_kind:
28957 resync_fail:
28962 }
28964 /* OpenMP 4.0:
28965 map ( map-kind : variable-list )
28966 map ( variable-list )
28968 map-kind:
28969 alloc | to | from | tofrom */
28971 static tree
28973 {
28982 {
28994 else
28995 {
29001 }
29004 }
29007 NULL);
29013 }
29015 /* OpenMP 4.0:
29016 device ( expression ) */
29018 static tree
29020 location_t location)
29021 {
29043 }
29045 /* OpenMP 4.0:
29046 dist_schedule ( static )
29047 dist_schedule ( static , expression ) */
29049 static tree
29051 location_t location)
29052 {
29065 {
29076 }
29081 location);
29085 invalid_kind:
29087 resync_fail:
29092 }
29094 /* OpenMP 4.0:
29095 proc_bind ( proc-bind-kind )
29097 proc-bind-kind:
29098 master | close | spread */
29100 static tree
29102 location_t location)
29103 {
29104 tree c;
29111 {
29121 else
29123 }
29124 else
29133 location);
29138 invalid_kind:
29140 resync_fail:
29145 }
29147 /* OpenACC:
29148 async [( int-expr )] */
29150 static tree
29152 {
29159 {
29168 }
29178 }
29180 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29181 is a bitmask in MASK. Return the list of clauses found. */
29183 static tree
29187 {
29192 {
29193 location_t here;
29194 pragma_omp_clause c_kind;
29205 {
29297 }
29302 {
29303 /* Remove the invalid clause(s) from the list to avoid
29304 confusing the rest of the compiler. */
29307 }
29308 }
29310 saw_error:
29317 }
29319 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29320 is a bitmask in MASK. Return the list of clauses found; the result
29321 of clause default goes in *pdefault. */
29323 static tree
29327 {
29334 {
29335 pragma_omp_clause c_kind;
29346 {
29358 clauses);
29372 clauses);
29381 clauses);
29405 clauses);
29419 clauses);
29436 OMP_CLAUSE_NOTINBRANCH,
29445 {
29446 clause_not_first:
29450 }
29475 clauses);
29480 clauses);
29485 clauses);
29548 }
29553 {
29554 /* Remove the invalid clause(s) from the list to avoid
29555 confusing the rest of the compiler. */
29558 }
29559 }
29560 saw_error:
29561 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29562 no reason to skip to the end. */
29568 }
29570 /* OpenMP 2.5:
29571 structured-block:
29572 statement
29574 In practice, we're also interested in adding the statement to an
29575 outer node. So it is convenient if we work around the fact that
29576 cp_parser_statement calls add_stmt. */
29578 static unsigned
29580 {
29583 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29584 This preserves the "not within loop or switch" style error messages
29585 for nonsense cases like
29586 void foo() {
29587 #pragma omp single
29588 break;
29589 }
29590 */
29595 }
29597 static void
29599 {
29601 }
29603 static tree
29605 {
29613 }
29615 /* OpenMP 2.5:
29616 # pragma omp atomic new-line
29617 expression-stmt
29619 expression-stmt:
29620 x binop= expr | x++ | ++x | x-- | --x
29621 binop:
29622 +, *, -, /, &, ^, |, <<, >>
29624 where x is an lvalue expression with scalar type.
29626 OpenMP 3.1:
29627 # pragma omp atomic new-line
29628 update-stmt
29630 # pragma omp atomic read new-line
29631 read-stmt
29633 # pragma omp atomic write new-line
29634 write-stmt
29636 # pragma omp atomic update new-line
29637 update-stmt
29639 # pragma omp atomic capture new-line
29640 capture-stmt
29642 # pragma omp atomic capture new-line
29643 capture-block
29645 read-stmt:
29646 v = x
29647 write-stmt:
29648 x = expr
29649 update-stmt:
29650 expression-stmt | x = x binop expr
29651 capture-stmt:
29652 v = expression-stmt
29653 capture-block:
29654 { v = x; update-stmt; } | { update-stmt; v = x; }
29656 OpenMP 4.0:
29657 update-stmt:
29658 expression-stmt | x = x binop expr | x = expr binop x
29659 capture-stmt:
29660 v = update-stmt
29661 capture-block:
29662 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29664 where x and v are lvalue expressions with scalar type. */
29666 static void
29668 {
29676 {
29681 {
29687 }
29688 }
29690 {
29702 else
29706 }
29708 {
29714 {
29719 {
29722 }
29723 }
29724 }
29728 {
29738 else
29743 {
29744 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29745 opcode. */
29750 }
29754 {
29757 }
29758 else
29759 {
29765 }
29768 }
29770 restart:
29774 {
29781 /* FALLTHROUGH */
29791 /* FALLTHROUGH */
29806 /* Undo effects of boolean_increment for post {in,de}crement. */
29808 /* FALLTHRU */
29812 {
29813 /* Undo effects of boolean_increment. */
29815 {
29816 /* This is pre or post increment. */
29821 && !structured_block
29825 }
29826 }
29827 /* FALLTHRU */
29830 {
29865 {
29869 }
29872 {
29878 {
29883 }
29885 {
29897 {
29899 {
29904 }
29905 else
29907 }
29911 }
29914 {
29921 }
29925 }
29929 {
29932 {
29940 }
29942 {
29947 }
29982 }
29993 /* FALLTHROUGH */
29998 }
30005 }
30006 stmt_done:
30008 {
30019 }
30021 {
30024 }
30025 done:
30031 saw_error:
30034 {
30038 {
30042 }
30043 }
30044 }
30047 /* OpenMP 2.5:
30048 # pragma omp barrier new-line */
30050 static void
30052 {
30055 }
30057 /* OpenMP 2.5:
30058 # pragma omp critical [(name)] new-line
30059 structured-block */
30061 static tree
30063 {
30067 {
30079 }
30084 }
30086 /* OpenMP 2.5:
30087 # pragma omp flush flush-vars[opt] new-line
30089 flush-vars:
30090 ( variable-list ) */
30092 static void
30094 {
30100 }
30102 /* Helper function, to parse omp for increment expression. */
30104 static tree
30106 {
30111 {
30114 }
30117 {
30126 /* Fall through: OpenMP disallows NE_EXPR. */
30129 }
30131 /* If decl is an iterator, preserve LHS and RHS of the relational
30132 expr until finish_omp_for. */
30142 }
30144 /* Helper function, to parse omp for increment expression. */
30146 static tree
30148 {
30152 cp_id_kind idk;
30156 {
30164 }
30172 {
30177 }
30184 {
30188 }
30200 do
30201 {
30208 {
30210 {
30213 else
30215 tf_warning_or_error);
30216 }
30217 else
30220 }
30221 }
30225 {
30229 }
30230 else
30234 }
30236 /* Parse the initialization statement of either an OpenMP for loop or
30237 a Cilk Plus for loop.
30239 Return true if the resulting construct should have an
30240 OMP_CLAUSE_PRIVATE added to it. */
30242 static bool
30250 {
30256 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30258 init-expr:
30259 var = lb
30260 integer-type var = lb
30261 random-access-iterator-type var = lb
30262 pointer-type var = lb
30263 */
30264 cp_decl_specifier_seq type_specifiers;
30266 /* First, try to parse as an initialized declaration. See
30267 cp_parser_condition, from whence the bulk of this is copied. */
30274 {
30275 /* If parsing a type specifier seq succeeded, then this
30276 MUST be a initialized declaration. */
30281 CP_PARSER_DECLARATOR_NAMED,
30292 else
30293 {
30303 {
30305 CPP_OPEN_PAREN))
30306 {
30310 else
30313 }
30314 else
30315 /* Trigger an error. */
30320 }
30324 {
30332 {
30335 auto_node);
30340 }
30343 asm_specification,
30344 LOOKUP_ONLYCONVERTING);
30346 {
30349 }
30350 else
30353 }
30354 else
30355 {
30356 /* Consume '='. */
30360 non_class:
30363 else
30366 asm_specification,
30367 LOOKUP_ONLYCONVERTING);
30368 }
30372 }
30373 }
30374 else
30375 {
30376 cp_id_kind idk;
30377 /* If parsing a type specifier sequence failed, then
30378 this MUST be a simple expression. */
30386 && decl
30389 {
30390 tree rhs;
30397 rhs,
30398 tf_warning_or_error));
30400 }
30401 else
30402 {
30407 {
30411 }
30412 }
30413 }
30415 }
30417 /* Parse the restricted form of the for statement allowed by OpenMP. */
30419 static tree
30422 {
30426 location_t loc_first;
30445 {
30448 location_t loc;
30452 {
30455 }
30458 {
30461 }
30470 add_private_clause
30477 {
30480 {
30486 }
30487 else
30489 }
30496 {
30501 {
30505 }
30508 {
30509 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
30513 {
30516 }
30517 else
30518 {
30521 }
30523 }
30524 else
30525 {
30530 }
30531 }
30534 {
30535 tree c;
30537 {
30546 decl);
30550 decl);
30551 }
30553 {
30558 {
30561 }
30562 }
30563 }
30572 {
30573 /* If decl is an iterator, preserve the operator on decl
30574 until finish_omp_for. */
30576 && ((processing_template_decl
30580 else
30584 }
30599 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30600 in between the collapsed for loops to be still considered perfectly
30601 nested. Hopefully the final version clarifies this.
30602 For now handle (multiple) {'s and empty statements. */
30604 do
30605 {
30609 {
30611 bracecount++;
30612 }
30616 else
30617 {
30624 }
30625 }
30629 {
30632 }
30633 }
30635 /* Note that we saved the original contents of this flag when we entered
30636 the structured block, and so we don't need to re-save it here. */
30639 else
30642 /* Note that the grammar doesn't call for a structured block here,
30643 though the loop as a whole is a structured block. */
30650 else
30655 {
30657 {
30659 nbraces--;
30660 }
30663 else
30664 {
30666 {
30669 }
30674 }
30675 }
30682 }
30684 /* Helper function for OpenMP parsing, split clauses and call
30685 finish_omp_clauses on each of the set of clauses afterwards. */
30687 static void
30690 {
30696 }
30698 /* OpenMP 4.0:
30699 #pragma omp simd simd-clause[optseq] new-line
30700 for-loop */
30702 #define OMP_SIMD_CLAUSE_MASK \
30703 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30711 static tree
30714 {
30726 {
30729 }
30740 }
30742 /* OpenMP 2.5:
30743 #pragma omp for for-clause[optseq] new-line
30744 for-loop
30746 OpenMP 4.0:
30747 #pragma omp for simd for-simd-clause[optseq] new-line
30748 for-loop */
30750 #define OMP_FOR_CLAUSE_MASK \
30751 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30760 static tree
30763 {
30774 {
30779 {
30787 cclauses);
30791 cclauses);
30803 }
30804 }
30806 {
30809 }
30814 {
30817 }
30828 }
30830 /* OpenMP 2.5:
30831 # pragma omp master new-line
30832 structured-block */
30834 static tree
30836 {
30840 }
30842 /* OpenMP 2.5:
30843 # pragma omp ordered new-line
30844 structured-block */
30846 static tree
30848 {
30852 }
30854 /* OpenMP 2.5:
30856 section-scope:
30857 { section-sequence }
30859 section-sequence:
30860 section-directive[opt] structured-block
30861 section-sequence section-directive structured-block */
30863 static tree
30865 {
30876 {
30880 }
30883 {
30891 {
30895 }
30897 {
30900 }
30905 }
30916 }
30918 /* OpenMP 2.5:
30919 # pragma omp sections sections-clause[optseq] newline
30920 sections-scope */
30922 #define OMP_SECTIONS_CLAUSE_MASK \
30923 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30929 static tree
30932 {
30944 {
30947 }
30954 }
30956 /* OpenMP 2.5:
30957 # pragma omp parallel parallel-clause[optseq] new-line
30958 structured-block
30959 # pragma omp parallel for parallel-for-clause[optseq] new-line
30960 structured-block
30961 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30962 structured-block
30964 OpenMP 4.0:
30965 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30966 structured-block */
30968 #define OMP_PARALLEL_CLAUSE_MASK \
30969 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30979 static tree
30982 {
30991 {
31004 block);
31009 }
31011 {
31015 }
31017 {
31020 }
31022 {
31026 {
31036 block);
31039 }
31040 }
31050 }
31052 /* OpenMP 2.5:
31053 # pragma omp single single-clause[optseq] new-line
31054 structured-block */
31056 #define OMP_SINGLE_CLAUSE_MASK \
31057 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31062 static tree
31064 {
31074 }
31076 /* OpenMP 3.0:
31077 # pragma omp task task-clause[optseq] new-line
31078 structured-block */
31080 #define OMP_TASK_CLAUSE_MASK \
31081 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31091 static tree
31093 {
31104 }
31106 /* OpenMP 3.0:
31107 # pragma omp taskwait new-line */
31109 static void
31111 {
31114 }
31116 /* OpenMP 3.1:
31117 # pragma omp taskyield new-line */
31119 static void
31121 {
31124 }
31126 /* OpenMP 4.0:
31127 # pragma omp taskgroup new-line
31128 structured-block */
31130 static tree
31132 {
31136 }
31139 /* OpenMP 2.5:
31140 # pragma omp threadprivate (variable-list) */
31142 static void
31144 {
31145 tree vars;
31151 }
31153 /* OpenMP 4.0:
31154 # pragma omp cancel cancel-clause[optseq] new-line */
31156 #define OMP_CANCEL_CLAUSE_MASK \
31157 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31163 static void
31165 {
31169 }
31171 /* OpenMP 4.0:
31172 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31174 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31175 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31180 static void
31182 {
31183 tree clauses;
31187 {
31192 {
31195 }
31196 }
31198 {
31202 }
31205 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31207 pragma_tok);
31209 }
31211 /* OpenMP 4.0:
31212 #pragma omp distribute distribute-clause[optseq] new-line
31213 for-loop */
31215 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31216 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31221 static tree
31224 {
31233 {
31241 else
31244 {
31250 {
31253 cclauses);
31254 else
31256 cclauses);
31257 }
31262 cclauses);
31263 else
31265 cclauses);
31277 }
31278 }
31280 {
31283 }
31288 {
31291 }
31302 }
31304 /* OpenMP 4.0:
31305 # pragma omp teams teams-clause[optseq] new-line
31306 structured-block */
31308 #define OMP_TEAMS_CLAUSE_MASK \
31309 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31314 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31317 static tree
31320 {
31329 {
31333 {
31341 cclauses);
31345 cclauses);
31357 }
31358 }
31360 {
31363 }
31368 {
31371 }
31379 }
31381 /* OpenMP 4.0:
31382 # pragma omp target data target-data-clause[optseq] new-line
31383 structured-block */
31385 #define OMP_TARGET_DATA_CLAUSE_MASK \
31386 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31390 static tree
31392 {
31404 }
31406 /* OpenMP 4.0:
31407 # pragma omp target update target-update-clause[optseq] new-line */
31409 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31410 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31415 static bool
31418 {
31420 {
31422 "%<#pragma omp target update%> may only be "
31426 }
31428 tree clauses
31433 {
31435 "%<#pragma omp target update%> must contain at least one "
31438 }
31446 }
31448 /* OpenMP 4.0:
31449 # pragma omp target target-clause[optseq] new-line
31450 structured-block */
31452 #define OMP_TARGET_CLAUSE_MASK \
31453 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31457 static bool
31460 {
31462 {
31466 }
31469 {
31474 {
31482 {
31484 OMP_TARGET_CLAUSE_MASK,
31485 cclauses);
31487 }
31503 }
31505 {
31508 }
31510 {
31514 }
31516 {
31519 }
31520 }
31534 }
31536 /* OpenACC 2.0:
31537 # pragma acc cache (variable-list) new-line
31538 */
31540 static tree
31542 {
31557 }
31559 /* OpenACC 2.0:
31560 # pragma acc data oacc-data-clause[optseq] new-line
31561 structured-block */
31563 #define OACC_DATA_CLAUSE_MASK \
31564 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31576 static tree
31578 {
31591 }
31593 /* OpenACC 2.0:
31594 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31596 or
31598 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31600 LOC is the location of the #pragma token.
31601 */
31603 #define OACC_ENTER_DATA_CLAUSE_MASK \
31604 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31612 #define OACC_EXIT_DATA_CLAUSE_MASK \
31613 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31619 static tree
31622 {
31627 {
31633 }
31638 {
31642 }
31649 else
31654 {
31658 }
31664 else
31669 }
31671 /* OpenACC 2.0:
31672 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31673 structured-block */
31675 #define OACC_KERNELS_CLAUSE_MASK \
31676 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31690 static tree
31692 {
31705 }
31707 /* OpenACC 2.0:
31708 # pragma acc loop oacc-loop-clause[optseq] new-line
31709 structured-block */
31711 #define OACC_LOOP_CLAUSE_MASK \
31712 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31715 static tree
31717 {
31730 }
31732 /* OpenACC 2.0:
31733 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31734 structured-block */
31736 #define OACC_PARALLEL_CLAUSE_MASK \
31737 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31755 static tree
31757 {
31770 }
31772 /* OpenACC 2.0:
31773 # pragma acc update oacc-update-clause[optseq] new-line
31774 */
31776 #define OACC_UPDATE_CLAUSE_MASK \
31777 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31784 static tree
31786 {
31793 {
31795 "%<#pragma acc update%> must contain at least one "
31798 }
31806 }
31808 /* OpenACC 2.0:
31809 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31811 LOC is the location of the #pragma token.
31812 */
31814 #define OACC_WAIT_CLAUSE_MASK \
31815 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31817 static tree
31819 {
31832 }
31834 /* OpenMP 4.0:
31835 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31837 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31845 static void
31848 {
31850 cp_omp_declare_simd_data data;
31852 {
31857 }
31868 {
31872 {
31885 }
31890 "%<#pragma omp declare simd%> not immediately followed by "
31894 }
31895 }
31897 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31898 This function is modelled similar to the late parsing of omp declare
31899 simd. */
31901 static tree
31903 {
31909 {
31915 }
31917 {
31921 }
31926 {
31933 NULL);
31947 }
31952 }
31954 /* Finalize #pragma omp declare simd clauses after direct declarator has
31955 been parsed, and put that into "omp declare simd" attribute. */
31957 static tree
31959 {
31965 {
31970 }
31975 {
31993 }
31997 }
32000 /* OpenMP 4.0:
32001 # pragma omp declare target new-line
32002 declarations and definitions
32003 # pragma omp end declare target new-line */
32005 static void
32007 {
32010 }
32012 static void
32014 {
32017 {
32020 }
32022 {
32026 {
32029 }
32032 else
32033 {
32037 }
32038 }
32039 else
32040 {
32044 }
32048 "%<#pragma omp end declare target%> without corresponding "
32050 else
32052 }
32054 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32055 expression and optional initializer clause of
32056 #pragma omp declare reduction. We store the expression(s) as
32057 either 3, 6 or 7 special statements inside of the artificial function's
32058 body. The first two statements are DECL_EXPRs for the artificial
32059 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32060 expression that uses those variables.
32061 If there was any INITIALIZER clause, this is followed by further statements,
32062 the fourth and fifth statements are DECL_EXPRs for the artificial
32063 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32064 constructor variant (first token after open paren is not omp_priv),
32065 then the sixth statement is a statement with the function call expression
32066 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32067 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32068 to initialize the OMP_PRIV artificial variable and there is seventh
32069 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32071 static bool
32073 {
32085 tree combiner;
32100 {
32103 }
32106 {
32113 {
32116 }
32132 {
32136 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32140 == CPP_CLOSE_PAREN
32143 {
32147 }
32152 }
32153 else
32154 {
32170 {
32175 }
32177 tree arg;
32190 }
32201 }
32207 }
32209 /* OpenMP 4.0
32210 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32211 initializer-clause[opt] new-line
32213 initializer-clause:
32214 initializer (omp_priv initializer)
32215 initializer (function-name (argument-list)) */
32217 static void
32220 {
32230 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32237 {
32269 }
32281 /* Types may not be defined in declare reduction type list. */
32284 parser->type_definition_forbidden_message
32290 saved_colon_doesnt_start_class_def_p
32295 {
32299 ;
32320 else
32325 else
32327 }
32329 /* Restore the saved message. */
32332 parser->colon_doesnt_start_class_def_p
32337 {
32338 fail:
32341 }
32347 {
32348 tree fntype
32351 NULL_TREE);
32370 {
32375 }
32377 {
32379 {
32388 }
32395 }
32396 else
32397 {
32400 }
32403 else
32406 {
32409 }
32411 {
32414 else
32419 }
32424 else
32425 {
32434 }
32441 }
32445 done:
32446 /* Free any declarators allocated. */
32448 }
32450 /* OpenMP 4.0
32451 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32452 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32453 initializer-clause[opt] new-line
32454 #pragma omp declare target new-line */
32456 static void
32459 {
32461 {
32466 {
32469 context);
32471 }
32474 {
32477 context);
32479 }
32481 {
32484 }
32486 {
32490 }
32491 }
32495 }
32497 /* Main entry point to OpenMP statement pragmas. */
32499 static void
32501 {
32502 tree stmt;
32507 {
32582 }
32586 }
32587 \f
32588 /* Transactional Memory parsing routines. */
32590 /* Parse a transaction attribute.
32592 txn-attribute:
32593 attribute
32594 [ [ identifier ] ]
32596 ??? Simplify this when C++0x bracket attributes are
32597 implemented properly. */
32599 static tree
32601 {
32616 {
32620 /* For keywords, use the canonical spelling,
32621 not the parsed identifier. */
32625 }
32626 else
32630 error1:
32633 }
32635 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32637 transaction-statement:
32638 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32639 compound-statement
32640 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32641 */
32643 static tree
32645 {
32660 else
32661 {
32665 }
32667 /* Parse a noexcept specification. */
32670 /* Keep track if we're in the lexical scope of an outer transaction. */
32682 }
32684 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32686 transaction-expression:
32687 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32688 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32689 */
32691 static tree
32693 {
32718 /* Set this early. This might mean that we allow transaction_cancel in
32719 an expression that we find out later actually has to be a constexpr.
32720 However, we expect that cxx_constant_value will be able to deal with
32721 this; also, if the noexcept has no constexpr, then what we parse next
32722 really is a transaction's body. */
32725 /* Parse a noexcept specification. */
32731 {
32738 }
32739 else
32740 {
32741 /* The only expression that is available got parsed for the noexcept
32742 already. noexcept is true then. */
32745 }
32754 }
32756 /* Parse a function-transaction-block.
32758 function-transaction-block:
32759 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32760 function-body
32761 __transaction_atomic txn-attribute[opt] function-try-block
32762 __transaction_relaxed ctor-initializer[opt] function-body
32763 __transaction_relaxed function-try-block
32764 */
32766 static bool
32768 {
32784 else
32785 {
32789 }
32797 else
32798 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32806 }
32808 /* Parse a __transaction_cancel statement.
32810 cancel-statement:
32811 __transaction_cancel txn-attribute[opt] ;
32812 __transaction_cancel txn-attribute[opt] throw-expression ;
32814 ??? Cancel and throw is not yet implemented. */
32816 static tree
32818 {
32824 RT_TRANSACTION_CANCEL);
32831 /* ??? Parse cancel-and-throw here. */
32836 {
32840 }
32842 {
32846 }
32848 {
32851 {
32857 }
32858 }
32860 {
32864 }
32870 }
32871 \f
32872 /* The parser. */
32876 \f
32877 /* Special handling for the first token or line in the file. The first
32878 thing in the file might be #pragma GCC pch_preprocess, which loads a
32879 PCH file, which is a GC collection point. So we need to handle this
32880 first pragma without benefit of an existing lexer structure.
32882 Always returns one token to the caller in *FIRST_TOKEN. This is
32883 either the true first token of the file, or the first token after
32884 the initial pragma. */
32886 static void
32888 {
32897 {
32904 }
32905 else
32908 /* Skip to the end of the pragma. */
32912 /* Now actually load the PCH file. */
32916 /* Read one more token to return to our caller. We have to do this
32917 after reading the PCH file in, since its pointers have to be
32918 live. */
32920 }
32922 /* Parses the grainsize pragma for the _Cilk_for statement.
32923 Syntax:
32924 #pragma cilk grainsize = <VALUE>. */
32926 static void
32928 {
32930 {
32935 {
32938 }
32940 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32943 else
32945 "%<#pragma cilk grainsize%> is not followed by "
32948 }
32950 }
32952 /* Normal parsing of a pragma token. Here we can (and must) use the
32953 regular lexer. */
32955 static bool
32957 {
32969 {
32977 {
32987 }
32992 {
33002 }
33007 {
33013 "%<#pragma omp taskwait%> may only be "
33018 }
33023 {
33029 "%<#pragma omp taskyield%> may only be "
33034 }
33039 {
33045 "%<#pragma omp cancel%> may only be "
33050 }
33055 {
33061 "%<#pragma omp cancellation point%> may only be "
33066 }
33113 "%<#pragma omp section%> may only be used in "
33118 {
33120 {
33124 }
33131 {
33134 }
33137 }
33141 {
33145 }
33151 {
33155 }
33157 /* Ignore the pragma if Cilk Plus is not enabled. */
33159 {
33162 }
33163 else
33164 {
33168 }
33175 bad_stmt:
33178 }
33182 }
33184 /* The interface the pragma parsers have to the lexer. */
33186 enum cpp_ttype
33188 {
33201 else
33202 {
33206 }
33209 }
33211 \f
33212 /* External interface. */
33214 /* Parse one entire translation unit. */
33216 void
33218 {
33231 }
33233 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33234 vectorlength clause:
33235 Syntax:
33236 vectorlength ( constant-expression ) */
33238 static tree
33241 {
33243 tree expr;
33244 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33245 safelen clause. Thus, vectorlength is represented as OMP 4.0
33246 safelen. For SIMD-enabled function it is represented by OMP 4.0
33247 simdlen. */
33250 loc);
33251 else
33253 loc);
33261 /* If expr == error_mark_node, then don't emit any errors nor
33262 create a clause. if any of the above functions returns
33263 error mark node then they would have emitted an error message. */
33265 ;
33273 else
33274 {
33275 tree c;
33277 {
33282 }
33283 else
33284 {
33289 }
33290 }
33295 }
33297 /* Handles the Cilk Plus #pragma simd linear clause.
33298 Syntax:
33299 linear ( simd-linear-variable-list )
33301 simd-linear-variable-list:
33302 simd-linear-variable
33303 simd-linear-variable-list , simd-linear-variable
33305 simd-linear-variable:
33306 id-expression
33307 id-expression : simd-linear-step
33309 simd-linear-step:
33310 conditional-expression */
33312 static tree
33314 {
33320 {
33324 }
33329 {
33332 {
33336 }
33343 {
33347 }
33348 else
33349 {
33353 /* If present, parse the linear step. Otherwise, assume the default
33354 value of 1. */
33356 {
33363 {
33364 /* If an error has occurred, then the whole pragma is
33365 considered ill-formed. Thus, no reason to keep
33366 parsing. */
33369 }
33377 else
33379 "step size must be an integer constant "
33381 }
33383 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33389 }
33394 else
33395 {
33400 }
33401 }
33405 }
33407 /* Returns the name of the next clause. If the clause is not
33408 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33409 token is not consumed. Otherwise, the appropriate enum from the
33410 pragma_simd_clause is returned and the token is consumed. */
33412 static pragma_omp_clause
33414 {
33415 pragma_omp_clause clause_type;
33432 else
33437 }
33439 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33441 static tree
33443 {
33448 {
33449 pragma_omp_clause c_kind;
33456 /* Use the OpenMP 4.0 equivalent function. */
33459 /* Use the OpenMP 4.0 equivalent function. */
33461 clauses);
33463 /* Use the OMP 4.0 equivalent function. */
33465 clauses);
33467 /* Use the OMP 4.0 equivalent function. */
33469 else
33470 {
33474 }
33475 }
33481 else
33483 }
33485 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33487 static void
33489 {
33496 {
33500 }
33509 }
33511 /* Main entry-point for parsing Cilk Plus _Cilk_for
33512 loops. The return value is error_mark_node
33513 when errors happen and CILK_FOR tree on success. */
33515 static tree
33517 {
33532 else
33538 }
33540 /* Create an identifier for a generic parameter type (a synthesized
33541 template parameter implied by `auto' or a concept identifier). */
33544 static tree
33546 {
33550 }
33552 /* Predicate that behaves as is_auto_or_concept but matches the parent
33553 node of the generic type rather than the generic type itself. This
33554 allows for type transformation in add_implicit_template_parms. */
33558 {
33560 }
33562 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33563 (creating a new template parameter list if necessary). Returns the newly
33564 created template type parm. */
33566 tree
33568 {
33571 /* We are either continuing a function template that already contains implicit
33572 template parameters, creating a new fully-implicit function template, or
33573 extending an existing explicit function template with implicit template
33574 parameters. */
33582 {
33586 }
33587 else
33588 {
33589 /* Roll back to the existing template parameter scope (in the case of
33590 extending an explicit function template) or introduce a new template
33591 parameter scope ahead of the function parameter scope (or class scope
33592 in the case of out-of-line member definitions). The function scope is
33593 added back after template parameter synthesis below. */
33598 {
33601 }
33603 {
33604 /* If not defining a class, then any class scope is a scope level in
33605 an out-of-line member definition. In this case simply wind back
33606 beyond the first such scope to inject the template parameter list.
33607 Otherwise wind back to the class being defined. The latter can
33608 occur in class member friend declarations such as:
33610 class A {
33611 void foo (auto);
33612 };
33613 class B {
33614 friend void A::foo (auto);
33615 };
33617 The template parameter list synthesized for the friend declaration
33618 must be injected in the scope of 'B'. This can also occur in
33619 erroneous cases such as:
33621 struct A {
33622 struct B {
33623 void foo (auto);
33624 };
33625 void B::foo (auto) {}
33626 };
33628 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33629 but, nevertheless, the template parameter list synthesized for the
33630 declarator should be injected into the scope of 'A' as if the
33631 ill-formed template was specified explicitly. */
33634 {
33637 }
33638 }
33644 {
33645 /* Introduce a new template parameter list for implicit template
33646 parameters. */
33650 parser->implicit_template_scope
33657 }
33658 else
33659 {
33660 /* Synthesize implicit template parameters at the end of the explicit
33661 template parameter list. */
33668 parser->implicit_template_parms
33670 }
33671 }
33673 /* Synthesize a new template parameter and track the current template
33674 parameter chain with implicit_template_parms. */
33678 synth_id);
33679 tree new_parm
33681 input_location,
33688 parser->implicit_template_parms
33690 else
33695 /* If creating a fully implicit function template, start the new implicit
33696 template parameter list with this synthesized type, otherwise grow the
33697 current template parameter list. */
33700 {
33707 }
33708 else
33709 {
33714 }
33719 }
33721 /* Finish the declaration of a fully implicit function template. Such a
33722 template has no explicit template parameter list so has not been through the
33723 normal template head and tail processing. synthesize_implicit_template_parm
33724 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33725 provided if the declaration is a class member such that its template
33726 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33727 form is returned. Otherwise NULL_TREE is returned. */
33729 tree
33731 {
33736 {
33740 }
33750 }