| blob | 236c2eba01439734482f9f9130c752cb7db67643 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2014 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/>. */
60 \f
61 /* The lexer. */
63 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
64 and c-lex.c) and the C++ parser. */
67 {
69 };
71 /* The various kinds of non integral constant we encounter. */
73 NIC_NONE,
74 /* floating-point literal */
75 NIC_FLOAT,
76 /* %<this%> */
77 NIC_THIS,
78 /* %<__FUNCTION__%> */
79 NIC_FUNC_NAME,
80 /* %<__PRETTY_FUNCTION__%> */
81 NIC_PRETTY_FUNC,
82 /* %<__func__%> */
83 NIC_C99_FUNC,
84 /* "%<va_arg%> */
85 NIC_VA_ARG,
86 /* a cast */
87 NIC_CAST,
88 /* %<typeid%> operator */
89 NIC_TYPEID,
90 /* non-constant compound literals */
91 NIC_NCC,
92 /* a function call */
93 NIC_FUNC_CALL,
94 /* an increment */
95 NIC_INC,
96 /* an decrement */
97 NIC_DEC,
98 /* an array reference */
99 NIC_ARRAY_REF,
100 /* %<->%> */
101 NIC_ARROW,
102 /* %<.%> */
103 NIC_POINT,
104 /* the address of a label */
105 NIC_ADDR_LABEL,
106 /* %<*%> */
107 NIC_STAR,
108 /* %<&%> */
109 NIC_ADDR,
110 /* %<++%> */
111 NIC_PREINCREMENT,
112 /* %<--%> */
113 NIC_PREDECREMENT,
114 /* %<new%> */
115 NIC_NEW,
116 /* %<delete%> */
117 NIC_DEL,
118 /* calls to overloaded operators */
119 NIC_OVERLOADED,
120 /* an assignment */
121 NIC_ASSIGNMENT,
122 /* a comma operator */
123 NIC_COMMA,
124 /* a call to a constructor */
125 NIC_CONSTRUCTOR,
126 /* a transaction expression */
127 NIC_TRANSACTION
130 /* The various kinds of errors about name-lookup failing. */
132 /* NULL */
133 NLE_NULL,
134 /* is not a type */
135 NLE_TYPE,
136 /* is not a class or namespace */
137 NLE_CXX98,
138 /* is not a class, namespace, or enumeration */
139 NLE_NOT_CXX98
142 /* The various kinds of required token */
144 RT_NONE,
166 /* The type is CPP_KEYWORD */
195 RT_TRANSACTION_CANCEL /* __transaction_cancel */
198 /* Prototypes. */
204 static void cp_lexer_destroy
206 static int cp_lexer_saving_tokens
210 static void cp_lexer_get_preprocessor_token
218 static bool cp_lexer_next_token_is_not
220 static bool cp_lexer_next_token_is_keyword
224 static void cp_lexer_purge_token
226 static void cp_lexer_purge_tokens_after
228 static void cp_lexer_save_tokens
230 static void cp_lexer_commit_tokens
232 static void cp_lexer_rollback_tokens
234 static void cp_lexer_print_token
238 static void cp_lexer_start_debugging
240 static void cp_lexer_stop_debugging
246 static void cp_parser_initial_pragma
249 static tree cp_literal_operator_id
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
261 /* Manifest constants. */
262 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
263 #define CP_SAVED_TOKEN_STACK 5
265 /* Variables. */
267 /* The stream to which debugging output should be written. */
270 /* Nonzero if we are parsing an unevaluated operand: an operand to
271 sizeof, typeof, or alignof. */
274 /* Dump up to NUM tokens in BUFFER to FILE starting with token
275 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
276 first token in BUFFER. If NUM is 0, dump all the tokens. If
277 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
278 highlighted by surrounding it in [[ ]]. */
280 static void
284 {
301 {
304 }
309 {
316 nprinted++;
326 {
336 }
337 }
340 {
343 }
346 }
349 /* Dump all tokens in BUFFER to stderr. */
351 void
353 {
355 }
357 DEBUG_FUNCTION void
359 {
361 }
363 DEBUG_FUNCTION void
365 {
368 else
370 }
373 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
374 description for T. */
376 static void
378 {
380 {
383 }
384 }
387 /* Dump parser context C to FILE. */
389 static void
391 {
396 }
399 /* Print the stack of parsing contexts to FILE starting with FIRST. */
401 static void
403 {
409 {
412 }
413 }
416 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
418 static void
420 {
423 }
426 /* Print an unparsed function entry UF to FILE. */
428 static void
430 {
433 tree fn;
438 i++)
439 {
445 }
450 {
453 }
459 {
462 }
464 }
467 /* Print the stack of unparsed member functions S to FILE. */
469 static void
472 {
478 {
481 }
482 }
485 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
486 the given PARSER. If FILE is NULL, the output is printed on stderr. */
488 static void
490 {
502 next_token);
503 }
506 /* Dump debugging information for the given PARSER. If FILE is NULL,
507 the output is printed on stderr. */
509 void
511 {
514 expanded_location eloc;
592 }
594 DEBUG_FUNCTION void
596 {
598 }
600 DEBUG_FUNCTION void
602 {
605 else
607 }
609 /* Allocate memory for a new lexer object and return it. */
613 {
618 /* Allocate the memory. */
621 /* Initially we are not debugging. */
626 /* Create the buffer. */
630 }
633 /* Create a new main C++ lexer, the lexer that gets tokens from the
634 preprocessor. */
638 {
640 cp_token token;
642 /* It's possible that parsing the first pragma will load a PCH file,
643 which is a GC collection point. So we have to do that before
644 allocating any memory. */
649 /* Put the first token in the buffer. */
652 /* Get the remaining tokens from the preprocessor. */
654 {
657 }
666 /* Subsequent preprocessor diagnostics should use compiler
667 diagnostic functions to get the compiler source location. */
672 }
674 /* Create a new lexer whose token stream is primed with the tokens in
675 CACHE. When these tokens are exhausted, no new tokens will be read. */
679 {
684 /* We do not own the buffer. */
691 /* Initially we are not debugging. */
696 }
698 /* Frees all resources associated with LEXER. */
700 static void
702 {
706 }
708 /* Returns nonzero if debugging information should be output. */
712 {
714 }
719 {
723 }
727 {
729 }
733 {
735 }
739 {
742 else
744 }
748 {
752 }
754 /* nonzero if we are presently saving tokens. */
758 {
760 }
762 /* Store the next token from the preprocessor in *TOKEN. Return true
763 if we reach EOF. If LEXER is NULL, assume we are handling an
764 initial #pragma pch_preprocess, and thus want the lexer to return
765 processed strings. */
767 static void
769 {
772 /* Get a new token from the preprocessor. */
773 token->type
781 /* On some systems, some header files are surrounded by an
782 implicit extern "C" block. Set a flag in the token if it
783 comes from such a header. */
788 /* Check to see if this token is a keyword. */
790 {
792 {
793 /* Mark this token as a keyword. */
795 /* Record which keyword. */
797 }
798 else
799 {
803 {
804 /* Warn about the C++0x keyword (but still treat it as
805 an identifier). */
810 /* Clear out the C_RID_CODE so we don't warn about this
811 particular identifier-turned-keyword again. */
813 }
816 }
817 }
819 {
820 /* This only happens in Objective-C++; it must be a keyword. */
823 {
824 /* Replace 'class' with '@class', 'private' with '@private',
825 etc. This prevents confusion with the C++ keyword
826 'class', and makes the tokens consistent with other
827 Objective-C 'AT' keywords. For example '@class' is
828 reported as RID_AT_CLASS which is consistent with
829 '@synchronized', which is reported as
830 RID_AT_SYNCHRONIZED.
831 */
840 }
841 }
843 {
844 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
848 }
849 }
851 /* Update the globals input_location and the input file stack from TOKEN. */
854 {
856 {
858 }
859 }
861 /* Update the globals input_location and the input file stack from LEXER. */
864 {
867 }
869 /* Return a pointer to the next token in the token stream, but do not
870 consume it. */
874 {
876 {
880 }
882 }
884 /* Return true if the next token has the indicated TYPE. */
888 {
890 }
892 /* Return true if the next token does not have the indicated TYPE. */
896 {
898 }
900 /* Return true if the next token is the indicated KEYWORD. */
904 {
906 }
910 {
912 }
916 {
918 }
920 /* Return true if the next token is not the indicated KEYWORD. */
924 {
926 }
928 /* Return true if the next token is a keyword for a decl-specifier. */
930 static bool
932 {
937 {
938 /* auto specifier: storage-class-specifier in C++,
939 simple-type-specifier in C++0x. */
941 /* Storage classes. */
947 /* Elaborated type specifiers. */
953 /* Simple type specifiers. */
967 /* GNU extensions. */
970 /* C++0x extensions. */
981 }
982 }
984 /* Returns TRUE iff the token T begins a decltype type. */
986 static bool
988 {
991 }
993 /* Returns TRUE iff the next token begins a decltype type. */
995 static bool
997 {
1000 }
1002 /* Return a pointer to the Nth token in the token stream. If N is 1,
1003 then this is precisely equivalent to cp_lexer_peek_token (except
1004 that it is not inline). One would like to disallow that case, but
1005 there is one case (cp_parser_nth_token_starts_template_id) where
1006 the caller passes a variable for N and it might be 1. */
1010 {
1013 /* N is 1-based, not zero-based. */
1024 {
1027 {
1030 }
1034 }
1037 {
1040 }
1043 }
1045 /* Return the next token, and advance the lexer's next_token pointer
1046 to point to the next non-purged token. */
1050 {
1056 do
1057 {
1060 {
1063 }
1065 }
1070 /* Provide debugging output. */
1072 {
1076 }
1079 }
1081 /* Permanently remove the next token from the token stream, and
1082 advance the next_token pointer to refer to the next non-purged
1083 token. */
1085 static void
1087 {
1096 do
1097 {
1098 tok++;
1100 {
1103 }
1104 }
1107 }
1109 /* Permanently remove all tokens after TOK, up to, but not
1110 including, the token that will be returned next by
1111 cp_lexer_peek_token. */
1113 static void
1115 {
1124 {
1129 }
1130 }
1132 /* Begin saving tokens. All tokens consumed after this point will be
1133 preserved. */
1135 static void
1137 {
1138 /* Provide debugging output. */
1143 }
1145 /* Commit to the portion of the token stream most recently saved. */
1147 static void
1149 {
1150 /* Provide debugging output. */
1155 }
1157 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1158 to the token stream. Stop saving tokens. */
1160 static void
1162 {
1163 /* Provide debugging output. */
1168 }
1170 /* RAII wrapper around the above functions, with sanity checking. Creating
1171 a variable saves tokens, which are committed when the variable is
1172 destroyed unless they are explicitly rolled back by calling the rollback
1173 member function. */
1175 struct saved_token_sentinel
1176 {
1181 {
1184 }
1186 {
1189 }
1191 {
1195 }
1196 };
1198 /* Print a representation of the TOKEN on the STREAM. */
1200 static void
1202 {
1203 /* We don't use cpp_type2name here because the parser defines
1204 a few tokens of its own. */
1206 /* cpplib-defined token types */
1207 #define OP(e, s) #e,
1208 #define TK(e, s) #e,
1209 TTYPE_TABLE
1210 #undef OP
1211 #undef TK
1212 /* C++ parser token types - see "Manifest constants", above. */
1216 };
1218 /* For some tokens, print the associated data. */
1220 {
1222 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1223 For example, `struct' is mapped to an INTEGER_CST. */
1226 /* else fall through */
1244 /* If we have a name for the token, print it out. Otherwise, we
1245 simply give the numeric code. */
1248 else
1251 }
1252 }
1254 DEBUG_FUNCTION void
1256 {
1259 }
1261 DEBUG_FUNCTION void
1263 {
1266 else
1268 }
1271 /* Start emitting debugging information. */
1273 static void
1275 {
1278 }
1280 /* Stop emitting debugging information. */
1282 static void
1284 {
1287 }
1289 /* Create a new cp_token_cache, representing a range of tokens. */
1293 {
1298 }
1300 /* Diagnose if #pragma omp declare simd isn't followed immediately
1301 by function declaration or definition. */
1305 {
1307 {
1311 }
1312 }
1314 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1315 and put that into "omp declare simd" attribute. */
1319 {
1321 {
1323 {
1326 }
1328 {
1331 }
1332 }
1333 }
1334 \f
1335 /* Decl-specifiers. */
1337 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1339 static void
1341 {
1343 }
1345 /* Declarators. */
1347 /* Nothing other than the parser should be creating declarators;
1348 declarators are a semi-syntactic representation of C++ entities.
1349 Other parts of the front end that need to create entities (like
1350 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1365 /* An erroneous declarator. */
1368 /* The obstack on which declarators and related data structures are
1369 allocated. */
1372 /* Alloc BYTES from the declarator memory pool. */
1376 {
1378 }
1380 /* Allocate a declarator of the indicated KIND. Clear fields that are
1381 common to all declarators. */
1385 {
1397 }
1399 /* Make a declarator for a generalized identifier. If
1400 QUALIFYING_SCOPE is non-NULL, the identifier is
1401 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1402 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1403 is, if any. */
1407 special_function_kind sfk)
1408 {
1411 /* It is valid to write:
1413 class C { void f(); };
1414 typedef C D;
1415 void D::f();
1417 The standard is not clear about whether `typedef const C D' is
1418 legal; as of 2002-09-15 the committee is considering that
1419 question. EDG 3.0 allows that syntax. Therefore, we do as
1420 well. */
1434 }
1436 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1437 of modifiers such as const or volatile to apply to the pointer
1438 type, represented as identifiers. ATTRIBUTES represent the attributes that
1439 appertain to the pointer or reference. */
1441 cp_declarator *
1443 tree attributes)
1444 {
1452 {
1456 }
1457 else
1463 }
1465 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1466 represent the attributes that appertain to the pointer or
1467 reference. */
1469 cp_declarator *
1472 {
1480 {
1484 }
1485 else
1491 }
1493 /* Like make_pointer_declarator -- but for a pointer to a non-static
1494 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1495 appertain to the pointer or reference. */
1497 cp_declarator *
1500 tree attributes)
1501 {
1510 {
1513 }
1514 else
1520 }
1522 /* Make a declarator for the function given by TARGET, with the
1523 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1524 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1525 indicates what exceptions can be thrown. */
1527 cp_declarator *
1529 tree parms,
1530 cp_cv_quals cv_qualifiers,
1531 cp_virt_specifiers virt_specifiers,
1532 cp_ref_qualifier ref_qualifier,
1533 tree exception_specification,
1534 tree late_return_type)
1535 {
1547 {
1551 }
1552 else
1556 }
1558 /* Make a declarator for an array of BOUNDS elements, each of which is
1559 defined by ELEMENT. */
1561 cp_declarator *
1563 {
1570 {
1574 }
1575 else
1579 }
1581 /* Determine whether the declarator we've seen so far can be a
1582 parameter pack, when followed by an ellipsis. */
1583 static bool
1585 {
1586 /* Search for a declarator name, or any other declarator that goes
1587 after the point where the ellipsis could appear in a parameter
1588 pack. If we find any of these, then this declarator can not be
1589 made into a parameter pack. */
1592 {
1594 {
1606 }
1607 }
1610 }
1614 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1615 DECLARATOR and DEFAULT_ARGUMENT. */
1617 cp_parameter_declarator *
1620 tree default_argument)
1621 {
1629 else
1636 }
1638 /* Returns true iff DECLARATOR is a declaration for a function. */
1640 static bool
1642 {
1644 {
1652 }
1654 }
1656 /* The parser. */
1658 /* Overview
1659 --------
1661 A cp_parser parses the token stream as specified by the C++
1662 grammar. Its job is purely parsing, not semantic analysis. For
1663 example, the parser breaks the token stream into declarators,
1664 expressions, statements, and other similar syntactic constructs.
1665 It does not check that the types of the expressions on either side
1666 of an assignment-statement are compatible, or that a function is
1667 not declared with a parameter of type `void'.
1669 The parser invokes routines elsewhere in the compiler to perform
1670 semantic analysis and to build up the abstract syntax tree for the
1671 code processed.
1673 The parser (and the template instantiation code, which is, in a
1674 way, a close relative of parsing) are the only parts of the
1675 compiler that should be calling push_scope and pop_scope, or
1676 related functions. The parser (and template instantiation code)
1677 keeps track of what scope is presently active; everything else
1678 should simply honor that. (The code that generates static
1679 initializers may also need to set the scope, in order to check
1680 access control correctly when emitting the initializers.)
1682 Methodology
1683 -----------
1685 The parser is of the standard recursive-descent variety. Upcoming
1686 tokens in the token stream are examined in order to determine which
1687 production to use when parsing a non-terminal. Some C++ constructs
1688 require arbitrary look ahead to disambiguate. For example, it is
1689 impossible, in the general case, to tell whether a statement is an
1690 expression or declaration without scanning the entire statement.
1691 Therefore, the parser is capable of "parsing tentatively." When the
1692 parser is not sure what construct comes next, it enters this mode.
1693 Then, while we attempt to parse the construct, the parser queues up
1694 error messages, rather than issuing them immediately, and saves the
1695 tokens it consumes. If the construct is parsed successfully, the
1696 parser "commits", i.e., it issues any queued error messages and
1697 the tokens that were being preserved are permanently discarded.
1698 If, however, the construct is not parsed successfully, the parser
1699 rolls back its state completely so that it can resume parsing using
1700 a different alternative.
1702 Future Improvements
1703 -------------------
1705 The performance of the parser could probably be improved substantially.
1706 We could often eliminate the need to parse tentatively by looking ahead
1707 a little bit. In some places, this approach might not entirely eliminate
1708 the need to parse tentatively, but it might still speed up the average
1709 case. */
1711 /* Flags that are passed to some parsing functions. These values can
1712 be bitwise-ored together. */
1714 enum
1715 {
1716 /* No flags. */
1718 /* The construct is optional. If it is not present, then no error
1719 should be issued. */
1721 /* When parsing a type-specifier, treat user-defined type-names
1722 as non-type identifiers. */
1724 /* When parsing a type-specifier, do not try to parse a class-specifier
1725 or enum-specifier. */
1727 /* When parsing a decl-specifier-seq, only allow type-specifier or
1728 constexpr. */
1730 };
1732 /* This type is used for parameters and variables which hold
1733 combinations of the above flags. */
1736 /* The different kinds of declarators we want to parse. */
1739 {
1740 /* We want an abstract declarator. */
1741 CP_PARSER_DECLARATOR_ABSTRACT,
1742 /* We want a named declarator. */
1743 CP_PARSER_DECLARATOR_NAMED,
1744 /* We don't mind, but the name must be an unqualified-id. */
1745 CP_PARSER_DECLARATOR_EITHER
1748 /* The precedence values used to parse binary expressions. The minimum value
1749 of PREC must be 1, because zero is reserved to quickly discriminate
1750 binary operators from other tokens. */
1752 enum cp_parser_prec
1753 {
1754 PREC_NOT_OPERATOR,
1755 PREC_LOGICAL_OR_EXPRESSION,
1756 PREC_LOGICAL_AND_EXPRESSION,
1757 PREC_INCLUSIVE_OR_EXPRESSION,
1758 PREC_EXCLUSIVE_OR_EXPRESSION,
1759 PREC_AND_EXPRESSION,
1760 PREC_EQUALITY_EXPRESSION,
1761 PREC_RELATIONAL_EXPRESSION,
1762 PREC_SHIFT_EXPRESSION,
1763 PREC_ADDITIVE_EXPRESSION,
1764 PREC_MULTIPLICATIVE_EXPRESSION,
1765 PREC_PM_EXPRESSION,
1766 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1767 };
1769 /* A mapping from a token type to a corresponding tree node type, with a
1770 precedence value. */
1773 {
1774 /* The token type. */
1776 /* The corresponding tree code. */
1778 /* The precedence of this operator. */
1783 {
1784 /* Left hand side of the binary operation we are currently
1785 parsing. */
1786 tree lhs;
1787 /* Original tree code for left hand side, if it was a binary
1788 expression itself (used for -Wparentheses). */
1790 /* Tree code for the binary operation we are parsing. */
1792 /* Precedence of the binary operation we are parsing. */
1794 /* Location of the binary operation we are parsing. */
1795 location_t loc;
1798 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1799 entries because precedence levels on the stack are monotonically
1800 increasing. */
1804 /* Prototypes. */
1806 /* Constructors and destructors. */
1811 /* Class variables. */
1815 /* The operator-precedence table used by cp_parser_binary_expression.
1816 Transformed into an associative array (binops_by_token) by
1817 cp_parser_new. */
1850 };
1852 /* The same as binops, but initialized by cp_parser_new so that
1853 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1854 for speed. */
1857 /* Constructors and destructors. */
1859 /* Construct a new context. The context below this one on the stack
1860 is given by NEXT. */
1864 {
1867 /* Allocate the storage. */
1869 {
1870 /* Pull the first entry from the free list. */
1874 }
1875 else
1878 /* No errors have occurred yet in this context. */
1880 /* If this is not the bottommost context, copy information that we
1881 need from the previous context. */
1883 {
1884 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1885 expression, then we are parsing one in this context, too. */
1887 /* Thread the stack. */
1889 }
1892 }
1894 /* Managing the unparsed function queues. */
1896 #define unparsed_funs_with_default_args \
1897 parser->unparsed_queues->last ().funs_with_default_args
1898 #define unparsed_funs_with_definitions \
1899 parser->unparsed_queues->last ().funs_with_definitions
1900 #define unparsed_nsdmis \
1901 parser->unparsed_queues->last ().nsdmis
1902 #define unparsed_classes \
1903 parser->unparsed_queues->last ().classes
1905 static void
1907 {
1910 }
1912 static void
1914 {
1917 }
1919 /* Prototypes. */
1921 /* Constructors and destructors. */
1926 /* Routines to parse various constructs.
1928 Those that return `tree' will return the error_mark_node (rather
1929 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1930 Sometimes, they will return an ordinary node if error-recovery was
1931 attempted, even though a parse error occurred. So, to check
1932 whether or not a parse error occurred, you should always use
1933 cp_parser_error_occurred. If the construct is optional (indicated
1934 either by an `_opt' in the name of the function that does the
1935 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1936 the construct is not present. */
1938 /* Lexical conventions [gram.lex] */
1940 static tree cp_parser_identifier
1942 static tree cp_parser_string_literal
1944 static tree cp_parser_userdef_char_literal
1946 static tree cp_parser_userdef_string_literal
1948 static tree cp_parser_userdef_numeric_literal
1951 /* Basic concepts [gram.basic] */
1953 static bool cp_parser_translation_unit
1956 /* Expressions [gram.expr] */
1958 static tree cp_parser_primary_expression
1960 static tree cp_parser_id_expression
1962 static tree cp_parser_unqualified_id
1964 static tree cp_parser_nested_name_specifier_opt
1966 static tree cp_parser_nested_name_specifier
1968 static tree cp_parser_qualifying_entity
1970 static tree cp_parser_postfix_expression
1972 static tree cp_parser_postfix_open_square_expression
1974 static tree cp_parser_postfix_dot_deref_expression
1978 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1980 static void cp_parser_pseudo_destructor_name
1982 static tree cp_parser_unary_expression
1984 static enum tree_code cp_parser_unary_operator
1986 static tree cp_parser_new_expression
1990 static tree cp_parser_new_type_id
1998 static tree cp_parser_delete_expression
2000 static tree cp_parser_cast_expression
2002 static tree cp_parser_binary_expression
2004 static tree cp_parser_question_colon_clause
2006 static tree cp_parser_assignment_expression
2008 static enum tree_code cp_parser_assignment_operator_opt
2010 static tree cp_parser_expression
2012 static tree cp_parser_constant_expression
2014 static tree cp_parser_builtin_offsetof
2016 static tree cp_parser_lambda_expression
2018 static void cp_parser_lambda_introducer
2020 static bool cp_parser_lambda_declarator_opt
2022 static void cp_parser_lambda_body
2025 /* Statements [gram.stmt.stmt] */
2027 static void cp_parser_statement
2029 static void cp_parser_label_for_labeled_statement
2031 static tree cp_parser_expression_statement
2033 static tree cp_parser_compound_statement
2035 static void cp_parser_statement_seq_opt
2037 static tree cp_parser_selection_statement
2039 static tree cp_parser_condition
2041 static tree cp_parser_iteration_statement
2043 static bool cp_parser_for_init_statement
2045 static tree cp_parser_for
2047 static tree cp_parser_c_for
2049 static tree cp_parser_range_for
2051 static void do_range_for_auto_deduction
2053 static tree cp_parser_perform_range_for_lookup
2055 static tree cp_parser_range_for_member_function
2057 static tree cp_parser_jump_statement
2059 static void cp_parser_declaration_statement
2062 static tree cp_parser_implicitly_scoped_statement
2064 static void cp_parser_already_scoped_statement
2067 /* Declarations [gram.dcl.dcl] */
2069 static void cp_parser_declaration_seq_opt
2071 static void cp_parser_declaration
2073 static void cp_parser_block_declaration
2075 static void cp_parser_simple_declaration
2077 static void cp_parser_decl_specifier_seq
2079 static tree cp_parser_storage_class_specifier_opt
2081 static tree cp_parser_function_specifier_opt
2083 static tree cp_parser_type_specifier
2086 static tree cp_parser_simple_type_specifier
2088 static tree cp_parser_type_name
2090 static tree cp_parser_nonclass_name
2092 static tree cp_parser_elaborated_type_specifier
2094 static tree cp_parser_enum_specifier
2096 static void cp_parser_enumerator_list
2098 static void cp_parser_enumerator_definition
2100 static tree cp_parser_namespace_name
2102 static void cp_parser_namespace_definition
2104 static void cp_parser_namespace_body
2106 static tree cp_parser_qualified_namespace_specifier
2108 static void cp_parser_namespace_alias_definition
2110 static bool cp_parser_using_declaration
2112 static void cp_parser_using_directive
2114 static tree cp_parser_alias_declaration
2116 static void cp_parser_asm_definition
2118 static void cp_parser_linkage_specification
2120 static void cp_parser_static_assert
2122 static tree cp_parser_decltype
2125 /* Declarators [gram.dcl.decl] */
2127 static tree cp_parser_init_declarator
2128 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2133 static enum tree_code cp_parser_ptr_operator
2135 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2137 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2139 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2141 static tree cp_parser_late_return_type_opt
2143 static tree cp_parser_declarator_id
2145 static tree cp_parser_type_id
2147 static tree cp_parser_template_type_arg
2150 static tree cp_parser_type_id_1
2152 static void cp_parser_type_specifier_seq
2154 static tree cp_parser_parameter_declaration_clause
2156 static tree cp_parser_parameter_declaration_list
2160 static tree cp_parser_default_argument
2162 static void cp_parser_function_body
2164 static tree cp_parser_initializer
2166 static tree cp_parser_initializer_clause
2168 static tree cp_parser_braced_list
2173 static bool cp_parser_ctor_initializer_opt_and_function_body
2176 static tree cp_parser_late_parsing_omp_declare_simd
2179 static tree cp_parser_late_parsing_cilk_simd_fn_info
2182 static tree synthesize_implicit_template_parm
2184 static tree finish_fully_implicit_template
2187 /* Classes [gram.class] */
2189 static tree cp_parser_class_name
2191 static tree cp_parser_class_specifier
2193 static tree cp_parser_class_head
2195 static enum tag_types cp_parser_class_key
2197 static void cp_parser_type_parameter_key
2199 static void cp_parser_member_specification_opt
2201 static void cp_parser_member_declaration
2203 static tree cp_parser_pure_specifier
2205 static tree cp_parser_constant_initializer
2208 /* Derived classes [gram.class.derived] */
2210 static tree cp_parser_base_clause
2212 static tree cp_parser_base_specifier
2215 /* Special member functions [gram.special] */
2217 static tree cp_parser_conversion_function_id
2219 static tree cp_parser_conversion_type_id
2223 static bool cp_parser_ctor_initializer_opt
2225 static void cp_parser_mem_initializer_list
2227 static tree cp_parser_mem_initializer
2229 static tree cp_parser_mem_initializer_id
2232 /* Overloading [gram.over] */
2234 static tree cp_parser_operator_function_id
2236 static tree cp_parser_operator
2239 /* Templates [gram.temp] */
2241 static void cp_parser_template_declaration
2243 static tree cp_parser_template_parameter_list
2245 static tree cp_parser_template_parameter
2247 static tree cp_parser_type_parameter
2249 static tree cp_parser_template_id
2251 static tree cp_parser_template_name
2253 static tree cp_parser_template_argument_list
2255 static tree cp_parser_template_argument
2257 static void cp_parser_explicit_instantiation
2259 static void cp_parser_explicit_specialization
2262 /* Exception handling [gram.exception] */
2264 static tree cp_parser_try_block
2266 static bool cp_parser_function_try_block
2268 static void cp_parser_handler_seq
2270 static void cp_parser_handler
2272 static tree cp_parser_exception_declaration
2274 static tree cp_parser_throw_expression
2276 static tree cp_parser_exception_specification_opt
2278 static tree cp_parser_type_id_list
2281 /* GNU Extensions */
2283 static tree cp_parser_asm_specification_opt
2285 static tree cp_parser_asm_operand_list
2287 static tree cp_parser_asm_clobber_list
2289 static tree cp_parser_asm_label_list
2291 static bool cp_next_tokens_can_be_attribute_p
2293 static bool cp_next_tokens_can_be_gnu_attribute_p
2295 static bool cp_next_tokens_can_be_std_attribute_p
2297 static bool cp_nth_tokens_can_be_std_attribute_p
2299 static bool cp_nth_tokens_can_be_gnu_attribute_p
2301 static bool cp_nth_tokens_can_be_attribute_p
2303 static tree cp_parser_attributes_opt
2305 static tree cp_parser_gnu_attributes_opt
2307 static tree cp_parser_gnu_attribute_list
2309 static tree cp_parser_std_attribute
2311 static tree cp_parser_std_attribute_spec
2313 static tree cp_parser_std_attribute_spec_seq
2315 static bool cp_parser_extension_opt
2317 static void cp_parser_label_declaration
2320 /* Transactional Memory Extensions */
2322 static tree cp_parser_transaction
2324 static tree cp_parser_transaction_expression
2326 static bool cp_parser_function_transaction
2328 static tree cp_parser_transaction_cancel
2332 pragma_external,
2333 pragma_member,
2334 pragma_objc_icode,
2335 pragma_stmt,
2336 pragma_compound
2337 };
2338 static bool cp_parser_pragma
2341 /* Objective-C++ Productions */
2343 static tree cp_parser_objc_message_receiver
2345 static tree cp_parser_objc_message_args
2347 static tree cp_parser_objc_message_expression
2349 static tree cp_parser_objc_encode_expression
2351 static tree cp_parser_objc_defs_expression
2353 static tree cp_parser_objc_protocol_expression
2355 static tree cp_parser_objc_selector_expression
2357 static tree cp_parser_objc_expression
2359 static bool cp_parser_objc_selector_p
2361 static tree cp_parser_objc_selector
2363 static tree cp_parser_objc_protocol_refs_opt
2365 static void cp_parser_objc_declaration
2367 static tree cp_parser_objc_statement
2369 static bool cp_parser_objc_valid_prefix_attributes
2371 static void cp_parser_objc_at_property_declaration
2373 static void cp_parser_objc_at_synthesize_declaration
2375 static void cp_parser_objc_at_dynamic_declaration
2377 static tree cp_parser_objc_struct_declaration
2380 /* Utility Routines */
2382 static tree cp_parser_lookup_name
2384 static tree cp_parser_lookup_name_simple
2386 static tree cp_parser_maybe_treat_template_as_class
2388 static bool cp_parser_check_declarator_template_parameters
2390 static bool cp_parser_check_template_parameters
2392 static tree cp_parser_simple_cast_expression
2394 static tree cp_parser_global_scope_opt
2396 static bool cp_parser_constructor_declarator_p
2398 static tree cp_parser_function_definition_from_specifiers_and_declarator
2400 static tree cp_parser_function_definition_after_declarator
2402 static void cp_parser_template_declaration_after_export
2404 static void cp_parser_perform_template_parameter_access_checks
2406 static tree cp_parser_single_declaration
2408 static tree cp_parser_functional_cast
2410 static tree cp_parser_save_member_function_body
2412 static tree cp_parser_save_nsdmi
2414 static tree cp_parser_enclosed_template_argument_list
2416 static void cp_parser_save_default_args
2418 static void cp_parser_late_parsing_for_member
2420 static tree cp_parser_late_parse_one_default_arg
2422 static void cp_parser_late_parsing_nsdmi
2424 static void cp_parser_late_parsing_default_args
2426 static tree cp_parser_sizeof_operand
2428 static tree cp_parser_trait_expr
2430 static bool cp_parser_declares_only_class_p
2432 static void cp_parser_set_storage_class
2434 static void cp_parser_set_decl_spec_type
2436 static void set_and_check_decl_spec_loc
2439 static bool cp_parser_friend_p
2441 static void cp_parser_required_error
2447 static bool cp_parser_token_starts_function_definition_p
2449 static bool cp_parser_next_token_starts_class_definition_p
2451 static bool cp_parser_next_token_ends_template_argument_p
2453 static bool cp_parser_nth_token_starts_template_argument_list_p
2455 static enum tag_types cp_parser_token_is_class_key
2457 static enum tag_types cp_parser_token_is_type_parameter_key
2459 static void cp_parser_check_class_key
2461 static void cp_parser_check_access_in_redeclaration
2463 static bool cp_parser_optional_template_keyword
2465 static void cp_parser_pre_parsed_nested_name_specifier
2467 static bool cp_parser_cache_group
2469 static tree cp_parser_cache_defarg
2471 static void cp_parser_parse_tentatively
2473 static void cp_parser_commit_to_tentative_parse
2475 static void cp_parser_commit_to_topmost_tentative_parse
2477 static void cp_parser_abort_tentative_parse
2479 static bool cp_parser_parse_definitely
2483 static bool cp_parser_uncommitted_to_tentative_parse_p
2485 static void cp_parser_error
2487 static void cp_parser_name_lookup_error
2489 static bool cp_parser_simulate_error
2491 static bool cp_parser_check_type_definition
2493 static void cp_parser_check_for_definition_in_return_type
2495 static void cp_parser_check_for_invalid_template_id
2497 static bool cp_parser_non_integral_constant_expression
2499 static void cp_parser_diagnose_invalid_type_name
2501 static bool cp_parser_parse_and_diagnose_invalid_type_name
2503 static int cp_parser_skip_to_closing_parenthesis
2505 static void cp_parser_skip_to_end_of_statement
2507 static void cp_parser_consume_semicolon_at_end_of_statement
2509 static void cp_parser_skip_to_end_of_block_or_statement
2511 static bool cp_parser_skip_to_closing_brace
2513 static void cp_parser_skip_to_end_of_template_parameter_list
2515 static void cp_parser_skip_to_pragma_eol
2517 static bool cp_parser_error_occurred
2519 static bool cp_parser_allow_gnu_extensions_p
2521 static bool cp_parser_is_pure_string_literal
2523 static bool cp_parser_is_string_literal
2525 static bool cp_parser_is_keyword
2527 static tree cp_parser_make_typename_type
2531 static bool cp_parser_compound_literal_p
2533 static bool cp_parser_array_designator_p
2535 static bool cp_parser_skip_to_closing_square_bracket
2538 /* Returns nonzero if we are parsing tentatively. */
2542 {
2544 }
2546 /* Returns nonzero if TOKEN is a string literal. */
2548 static bool
2550 {
2556 }
2558 /* Returns nonzero if TOKEN is a string literal
2559 of a user-defined string literal. */
2561 static bool
2563 {
2570 }
2572 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2574 static bool
2576 {
2578 }
2580 /* If not parsing tentatively, issue a diagnostic of the form
2581 FILE:LINE: MESSAGE before TOKEN
2582 where TOKEN is the next token in the input stream. MESSAGE
2583 (specified by the caller) is usually of the form "expected
2584 OTHER-TOKEN". */
2586 static void
2588 {
2590 {
2592 /* This diagnostic makes more sense if it is tagged to the line
2593 of the token we just peeked at. */
2597 {
2602 }
2605 /* Because c_parser_error does not understand
2606 CPP_KEYWORD, keywords are treated like
2607 identifiers. */
2610 }
2611 }
2613 /* Issue an error about name-lookup failing. NAME is the
2614 IDENTIFIER_NODE DECL is the result of
2615 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2616 the thing that we hoped to find. */
2618 static void
2620 tree name,
2621 tree decl,
2622 name_lookup_error desired,
2623 location_t location)
2624 {
2625 /* If name lookup completely failed, tell the user that NAME was not
2626 declared. */
2628 {
2641 else
2643 }
2645 {
2647 {
2664 }
2665 }
2667 {
2669 {
2679 name);
2683 }
2684 }
2685 else
2686 {
2688 {
2701 }
2702 }
2703 }
2705 /* If we are parsing tentatively, remember that an error has occurred
2706 during this tentative parse. Returns true if the error was
2707 simulated; false if a message should be issued by the caller. */
2709 static bool
2711 {
2713 {
2716 }
2718 }
2720 /* This function is called when a type is defined. If type
2721 definitions are forbidden at this point, an error message is
2722 issued. */
2724 static bool
2726 {
2727 /* If types are forbidden here, issue a message. */
2729 {
2730 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2731 in the message need to be interpreted. */
2734 }
2736 }
2738 /* This function is called when the DECLARATOR is processed. The TYPE
2739 was a type defined in the decl-specifiers. If it is invalid to
2740 define a type in the decl-specifiers for DECLARATOR, an error is
2741 issued. TYPE_LOCATION is the location of TYPE and is used
2742 for error reporting. */
2744 static void
2747 {
2748 /* [dcl.fct] forbids type definitions in return types.
2749 Unfortunately, it's not easy to know whether or not we are
2750 processing a return type until after the fact. */
2758 {
2763 type);
2764 }
2765 }
2767 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2768 "<" in any valid C++ program. If the next token is indeed "<",
2769 issue a message warning the user about what appears to be an
2770 invalid attempt to form a template-id. LOCATION is the location
2771 of the type-specifier (TYPE) */
2773 static void
2775 tree type,
2777 location_t location)
2778 {
2782 {
2786 {
2789 else
2791 }
2792 else
2794 /* Remember the location of the invalid "<". */
2797 /* Consume the "<". */
2799 /* Parse the template arguments. */
2801 /* Permanently remove the invalid template arguments so that
2802 this error message is not issued again. */
2805 }
2806 }
2808 /* If parsing an integral constant-expression, issue an error message
2809 about the fact that THING appeared and return true. Otherwise,
2810 return false. In either case, set
2811 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2813 static bool
2815 non_integral_constant thing)
2816 {
2819 {
2821 {
2824 {
2831 "enumeration type cannot appear in a "
2922 }
2926 }
2927 }
2929 }
2931 /* Emit a diagnostic for an invalid type name. This function commits
2932 to the current active tentative parse, if any. (Otherwise, the
2933 problematic construct might be encountered again later, resulting
2934 in duplicate error messages.) LOCATION is the location of ID. */
2936 static void
2938 location_t location)
2939 {
2942 /* Try to lookup the identifier. */
2949 /* If the lookup was ambiguous, an error will already have
2950 been issued. */
2952 /* If the lookup found a template-name, it means that the user forgot
2953 to specify an argument list. Emit a useful error message. */
2957 decl);
2961 /* Something like 'unsigned A a;' */
2964 {
2965 /* Issue an error message. */
2967 /* If we're in a template class, it's possible that the user was
2968 referring to a type from a base class. For example:
2970 template <typename T> struct A { typedef T X; };
2971 template <typename T> struct B : public A<T> { X x; };
2973 The user should have said "typename A<T>::X". */
2987 {
2988 tree b;
2991 b;
2993 {
2997 {
2998 tree field;
2999 /* Go from a particular instantiation of the
3000 template (which will have an empty TYPE_FIELDs),
3001 to the main version. */
3004 field;
3008 {
3013 }
3016 }
3017 }
3018 }
3019 }
3020 /* Here we diagnose qualified-ids where the scope is actually correct,
3021 but the identifier does not resolve to a valid type name. */
3023 {
3025 {
3030 else
3034 }
3037 {
3038 /* A<T>::A<T>() */
3044 }
3051 {
3056 else
3060 }
3061 else
3063 }
3064 }
3066 /* Check for a common situation where a type-name should be present,
3067 but is not, and issue a sensible error message. Returns true if an
3068 invalid type-name was detected.
3070 The situation handled by this function are variable declarations of the
3071 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3072 Usually, `ID' should name a type, but if we got here it means that it
3073 does not. We try to emit the best possible error message depending on
3074 how exactly the id-expression looks like. */
3076 static bool
3078 {
3079 tree id;
3082 /* Avoid duplicate error about ambiguous lookup. */
3084 {
3088 }
3097 /* If the next token is a (, this is a function with no explicit return
3098 type, i.e. constructor, destructor or conversion op. */
3101 {
3104 }
3108 /* Emit a diagnostic for the invalid type. */
3110 out:
3111 /* If we aren't in the middle of a declarator (i.e. in a
3112 parameter-declaration-clause), skip to the end of the declaration;
3113 there's no point in trying to process it. */
3117 }
3119 /* Consume tokens up to, and including, the next non-nested closing `)'.
3120 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3121 are doing error recovery. Returns -1 if OR_COMMA is true and we
3122 found an unnested comma. */
3124 static int
3129 {
3139 {
3143 {
3146 /* If we've run out of tokens, then there is no closing `)'. */
3149 /* This is good for lambda expression capture-lists. */
3159 /* This matches the processing in skip_to_end_of_statement. */
3185 {
3189 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* Consume tokens until we reach the end of the current statement.
3202 Normally, that will be just before consuming a `;'. However, if a
3203 non-nested `}' comes first, then we stop before consuming that. */
3205 static void
3207 {
3210 /* Unwind generic function template scope if necessary. */
3215 {
3219 {
3222 /* If we've run out of tokens, stop. */
3226 /* If the next token is a `;', we have reached the end of the
3227 statement. */
3233 /* If this is a non-nested '}', stop before consuming it.
3234 That way, when confronted with something like:
3236 { 3 + }
3238 we stop before consuming the closing '}', even though we
3239 have not yet reached a `;'. */
3243 /* If it is the closing '}' for a block that we have
3244 scanned, stop -- but only after consuming the token.
3245 That way given:
3247 void f g () { ... }
3248 typedef int I;
3250 we will stop after the body of the erroneously declared
3251 function, but before consuming the following `typedef'
3252 declaration. */
3254 {
3257 }
3265 }
3267 /* Consume the token. */
3269 }
3270 }
3272 /* This function is called at the end of a statement or declaration.
3273 If the next token is a semicolon, it is consumed; otherwise, error
3274 recovery is attempted. */
3276 static void
3278 {
3279 /* Look for the trailing `;'. */
3281 {
3282 /* If there is additional (erroneous) input, skip to the end of
3283 the statement. */
3285 /* If the next token is now a `;', consume it. */
3288 }
3289 }
3291 /* Skip tokens until we have consumed an entire block, or until we
3292 have consumed a non-nested `;'. */
3294 static void
3296 {
3299 /* Unwind generic function template scope if necessary. */
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* Stop if this is an unnested ';'. */
3321 /* Stop if this is an unnested '}', or closes the outermost
3322 nesting level. */
3323 nesting_depth--;
3331 /* Nest. */
3332 nesting_depth++;
3337 }
3339 /* Consume the token. */
3341 }
3342 }
3344 /* Skip tokens until a non-nested closing curly brace is the next
3345 token, or there are no more tokens. Return true in the first case,
3346 false otherwise. */
3348 static bool
3350 {
3354 {
3358 {
3361 /* If we've run out of tokens, stop. */
3365 /* If the next token is a non-nested `}', then we have reached
3366 the end of the current block. */
3372 /* If it the next token is a `{', then we are entering a new
3373 block. Consume the entire block. */
3379 }
3381 /* Consume the token. */
3383 }
3384 }
3386 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3387 parameter is the PRAGMA token, allowing us to purge the entire pragma
3388 sequence. */
3390 static void
3392 {
3397 do
3401 /* Ensure that the pragma is not parsed again. */
3403 }
3405 /* Require pragma end of line, resyncing with it as necessary. The
3406 arguments are as for cp_parser_skip_to_pragma_eol. */
3408 static void
3410 {
3414 }
3416 /* This is a simple wrapper around make_typename_type. When the id is
3417 an unresolved identifier node, we can provide a superior diagnostic
3418 using cp_parser_diagnose_invalid_type_name. */
3420 static tree
3422 location_t id_location)
3423 {
3424 tree result;
3426 {
3432 }
3434 }
3436 /* This is a wrapper around the
3437 make_{pointer,ptrmem,reference}_declarator functions that decides
3438 which one to call based on the CODE and CLASS_TYPE arguments. The
3439 CODE argument should be one of the values returned by
3440 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3441 appertain to the pointer or reference. */
3445 cp_cv_quals cv_qualifiers,
3447 tree attributes)
3448 {
3455 else
3465 }
3467 /* Create a new C++ parser. */
3471 {
3476 /* cp_lexer_new_main is called before doing GC allocation because
3477 cp_lexer_new_main might load a PCH file. */
3480 /* Initialize the binops_by_token so that we can get the tree
3481 directly from the token. */
3489 /* For now, we always accept GNU extensions. */
3492 /* The `>' token is a greater-than operator, not the end of a
3493 template-id. */
3498 /* We are not parsing a constant-expression. */
3503 /* Local variable names are not forbidden. */
3506 /* We are not processing an `extern "C"' declaration. */
3509 /* We are not processing a declarator. */
3512 /* We are not processing a template-argument-list. */
3515 /* We are not in an iteration statement. */
3518 /* We are not in a switch statement. */
3521 /* We are not parsing a type-id inside an expression. */
3524 /* Declarations aren't implicitly extern "C". */
3527 /* String literals should be translated to the execution character set. */
3530 /* We are not parsing a function body. */
3533 /* We can correct until told otherwise. */
3536 /* The unparsed function queue is empty. */
3539 /* There are no classes being defined. */
3542 /* No template parameters apply. */
3545 /* Not declaring an implicit function template. */
3552 }
3554 /* Create a cp_lexer structure which will emit the tokens in CACHE
3555 and push it onto the parser's lexer stack. This is used for delayed
3556 parsing of in-class method bodies and default arguments, and should
3557 not be confused with tentative parsing. */
3558 static void
3560 {
3565 /* Move the current source position to that of the first token in the
3566 new lexer. */
3568 }
3570 /* Pop the top lexer off the parser stack. This is never used for the
3571 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3572 static void
3574 {
3579 /* Put the current source position back where it was before this
3580 lexer was pushed. */
3582 }
3584 /* Lexical conventions [gram.lex] */
3586 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3587 identifier. */
3589 static tree
3591 {
3594 /* Look for the identifier. */
3596 /* Return the value. */
3598 }
3600 /* Parse a sequence of adjacent string constants. Returns a
3601 TREE_STRING representing the combined, nul-terminated string
3602 constant. If TRANSLATE is true, translate the string to the
3603 execution character set. If WIDE_OK is true, a wide string is
3604 invalid here.
3606 C++98 [lex.string] says that if a narrow string literal token is
3607 adjacent to a wide string literal token, the behavior is undefined.
3608 However, C99 6.4.5p4 says that this results in a wide string literal.
3609 We follow C99 here, for consistency with the C front end.
3611 This code is largely lifted from lex_string() in c-lex.c.
3613 FUTURE: ObjC++ will need to handle @-strings here. */
3614 static tree
3617 {
3618 tree value;
3625 tree string_tree;
3631 {
3634 }
3637 {
3641 }
3642 else
3643 {
3646 }
3649 /* Try to avoid the overhead of creating and destroying an obstack
3650 for the common case of just one string. */
3653 {
3661 {
3665 }
3666 else
3670 }
3671 else
3672 {
3676 do
3677 {
3679 count++;
3684 {
3687 {
3690 }
3693 {
3698 }
3700 }
3701 else
3705 {
3710 "unsupported non-standard concatenation "
3712 }
3718 {
3722 }
3723 else
3724 {
3728 }
3729 }
3733 }
3736 {
3739 }
3743 {
3748 {
3763 }
3768 {
3773 else
3775 }
3776 }
3777 else
3778 /* cpp_interpret_string has issued an error. */
3785 }
3787 /* Look up a literal operator with the name and the exact arguments. */
3789 static tree
3791 {
3798 {
3804 {
3807 {
3817 }
3820 /* May be this should be sufficient_parms_p instead,
3821 depending on how exactly should user-defined literals
3822 work in presence of default arguments on the literal
3823 operator parameters. */
3826 }
3827 }
3830 }
3832 /* Parse a user-defined char constant. Returns a call to a user-defined
3833 literal operator taking the character as an argument. */
3835 static tree
3837 {
3845 /* Build up a call to the user-defined operator */
3846 /* Lookup the name we got back from the id-expression. */
3851 {
3856 }
3865 }
3867 /* A subroutine of cp_parser_userdef_numeric_literal to
3868 create a char... template parameter pack from a string node. */
3870 static tree
3872 {
3873 tree charvec;
3879 /* Fill in CHARVEC with all of the parameters. */
3884 /* Build the argument packs. */
3891 }
3893 /* A subroutine of cp_parser_userdef_numeric_literal to
3894 create a char... template parameter pack from a string node. */
3896 static tree
3898 {
3899 tree charvec;
3910 /* First template parm is character type. */
3913 /* Fill in CHARVEC with all of the parameters. */
3920 /* Build the argument packs. */
3927 }
3929 /* Parse a user-defined numeric constant. returns a call to a user-defined
3930 literal operator. */
3932 static tree
3934 {
3945 /* Look for a literal operator taking the exact type of numeric argument
3946 as the literal value. */
3951 {
3954 {
3958 long_long_unsigned_type_node);
3959 else
3960 {
3964 long_double_type_node);
3968 }
3971 }
3972 }
3975 /* If the numeric argument didn't work, look for a raw literal
3976 operator taking a const char* argument consisting of the number
3977 in string format. */
3982 {
3985 {
3988 }
3989 }
3992 /* If the raw literal didn't work, look for a non-type template
3993 function with parameter pack char.... Call the function with
3994 template parameter characters representing the number. */
3998 {
4003 {
4006 }
4007 }
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 /* Look for a template function with typename parameter CharT
4033 and parameter pack CharT... Call the function with
4034 template parameter characters representing the string. */
4038 {
4043 {
4046 }
4047 }
4050 /* Build up a call to the user-defined operator */
4051 /* Lookup the name we got back from the id-expression. */
4057 {
4061 }
4070 }
4073 /* Basic concepts [gram.basic] */
4075 /* Parse a translation-unit.
4077 translation-unit:
4078 declaration-seq [opt]
4080 Returns TRUE if all went well. */
4082 static bool
4084 {
4085 /* The address of the first non-permanent object on the declarator
4086 obstack. */
4091 /* Create the declarator obstack, if necessary. */
4093 {
4095 /* Create the error declarator. */
4097 /* Create the empty parameter list. */
4099 /* Remember where the base of the declarator obstack lies. */
4101 }
4105 /* If there are no tokens left then all went well. */
4107 {
4108 /* Get rid of the token array; we don't need it any more. */
4112 /* This file might have been a context that's implicitly extern
4113 "C". If so, pop the lang context. (Only relevant for PCH.) */
4115 {
4118 }
4120 /* Finish up. */
4124 }
4125 else
4126 {
4129 }
4131 /* Make sure the declarator obstack was fully cleaned up. */
4135 /* All went well. */
4137 }
4139 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4140 decltype context. */
4144 {
4149 }
4151 /* We're about to parse a collection of statements. If we're currently
4152 parsing tentatively, set up a firewall so that any nested
4153 cp_parser_commit_to_tentative_parse won't affect the current context. */
4155 static cp_token_position
4157 {
4164 }
4166 /* We've finished parsing the collection of statements. Wrap up the
4167 firewall and replace the relevant tokens with the parsed form. */
4169 static void
4171 tree expr)
4172 {
4176 /* Finish the firewall level. */
4178 /* And remember the result of the parse for when we try again. */
4184 }
4186 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4187 enclosing parentheses. */
4189 static tree
4191 {
4194 /* Consume the '('. */
4196 /* Start the statement-expression. */
4198 /* Parse the compound-statement. */
4200 /* Finish up. */
4202 /* Consume the ')'. */
4208 }
4210 /* Expressions [gram.expr] */
4212 /* Parse a primary-expression.
4214 primary-expression:
4215 literal
4216 this
4217 ( expression )
4218 id-expression
4219 lambda-expression (C++11)
4221 GNU Extensions:
4223 primary-expression:
4224 ( compound-statement )
4225 __builtin_va_arg ( assignment-expression , type-id )
4226 __builtin_offsetof ( type-id , offsetof-expression )
4228 C++ Extensions:
4229 __has_nothrow_assign ( type-id )
4230 __has_nothrow_constructor ( type-id )
4231 __has_nothrow_copy ( type-id )
4232 __has_trivial_assign ( type-id )
4233 __has_trivial_constructor ( type-id )
4234 __has_trivial_copy ( type-id )
4235 __has_trivial_destructor ( type-id )
4236 __has_virtual_destructor ( type-id )
4237 __is_abstract ( type-id )
4238 __is_base_of ( type-id , type-id )
4239 __is_class ( type-id )
4240 __is_empty ( type-id )
4241 __is_enum ( type-id )
4242 __is_final ( type-id )
4243 __is_literal_type ( type-id )
4244 __is_pod ( type-id )
4245 __is_polymorphic ( type-id )
4246 __is_std_layout ( type-id )
4247 __is_trivial ( type-id )
4248 __is_union ( type-id )
4250 Objective-C++ Extension:
4252 primary-expression:
4253 objc-expression
4255 literal:
4256 __null
4258 ADDRESS_P is true iff this expression was immediately preceded by
4259 "&" and therefore might denote a pointer-to-member. CAST_P is true
4260 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4261 true iff this expression is a template argument.
4263 Returns a representation of the expression. Upon return, *IDK
4264 indicates what kind of id-expression (if any) was present. */
4266 static tree
4273 {
4276 /* Assume the primary expression is not an id-expression. */
4279 /* Peek at the next token. */
4282 {
4283 /* literal:
4284 integer-literal
4285 character-literal
4286 floating-literal
4287 string-literal
4288 boolean-literal
4289 pointer-literal
4290 user-defined-literal */
4301 {
4305 }
4306 /* Floating-point literals are only allowed in an integral
4307 constant expression if they are cast to an integral or
4308 enumeration type. */
4312 {
4313 /* CAST_P will be set even in invalid code like "int(2.7 +
4314 ...)". Therefore, we have to check that the next token
4315 is sure to end the cast. */
4317 {
4322 enumerator-definition. */
4324 /* The curly brace at the end of an enum-specifier. */
4326 /* The end of a statement. */
4328 /* The end of the cast-expression. */
4330 /* The end of an array bound. */
4332 /* The closing ">" in a template-argument-list. */
4335 /* C++0x only: A ">>" treated like two ">" tokens,
4336 in a template-argument-list. */
4341 }
4343 /* If we are within a cast, then the constraint that the
4344 cast is to an integral or enumeration type will be
4345 checked at that point. If we are not within a cast, then
4346 this code is invalid. */
4349 }
4368 /* ??? Should wide strings be allowed when parser->translate_strings_p
4369 is false (i.e. in attributes)? If not, we can kill the third
4370 argument to cp_parser_string_literal. */
4376 /* If we see `( { ' then we are looking at the beginning of
4377 a GNU statement-expression. */
4380 {
4381 /* Statement-expressions are not allowed by the standard. */
4385 /* And they're not allowed outside of a function-body; you
4386 cannot, for example, write:
4388 int i = ({ int j = 3; j + 1; });
4390 at class or namespace scope. */
4393 {
4395 "statement-expressions are not allowed outside "
4401 }
4402 else
4404 }
4405 /* Otherwise it's a normal parenthesized expression. */
4406 {
4407 tree expr;
4410 /* Consume the `('. */
4412 /* Within a parenthesized expression, a `>' token is always
4413 the greater-than operator. */
4414 saved_greater_than_is_operator_p
4418 /* Parse the parenthesized expression. */
4420 /* Let the front end know that this expression was
4421 enclosed in parentheses. This matters in case, for
4422 example, the expression is of the form `A::B', since
4423 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4424 not. */
4426 /* DR 705: Wrapping an unqualified name in parentheses
4427 suppresses arg-dependent lookup. We want to pass back
4428 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4429 (c++/37862), but none of the others. */
4433 /* The `>' token might be the end of a template-id or
4434 template-parameter-list now. */
4435 parser->greater_than_is_operator_p
4437 /* Consume the `)'. */
4442 }
4446 /* We have an Objective-C++ message. */
4448 {
4450 /* Don't warn about a failed tentative parse. */
4455 }
4459 /* We have an Objective-C++ string literal. */
4466 {
4467 /* These two are the boolean literals. */
4475 /* The `__null' literal. */
4480 /* The `nullptr' literal. */
4485 /* Recognize the `this' keyword. */
4489 {
4493 }
4494 /* Pointers cannot appear in constant-expressions. */
4499 /* The `operator' keyword can be the beginning of an
4500 id-expression. */
4507 {
4508 non_integral_constant name;
4510 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4511 __func__ are the names of variables -- but they are
4512 treated specially. Therefore, they are handled here,
4513 rather than relying on the generic id-expression logic
4514 below. Grammatically, these names are id-expressions.
4516 Consume the token. */
4520 {
4532 }
4537 /* Look up the name. */
4539 }
4542 {
4543 tree expression;
4544 tree type;
4545 source_location type_location;
4547 /* The `__builtin_va_arg' construct is used to handle
4548 `va_arg'. Consume the `__builtin_va_arg' token. */
4550 /* Look for the opening `('. */
4552 /* Now, parse the assignment-expression. */
4554 /* Look for the `,'. */
4557 /* Parse the type-id. */
4559 /* Look for the closing `)'. */
4561 /* Using `va_arg' in a constant-expression is not
4562 allowed. */
4564 NIC_VA_ARG))
4567 }
4597 /* Objective-C++ expressions. */
4607 {
4612 }
4616 }
4618 /* An id-expression can start with either an identifier, a
4619 `::' as the beginning of a qualified-id, or the "operator"
4620 keyword. */
4625 {
4626 tree id_expression;
4627 tree decl;
4633 id_expression:
4634 /* Parse the id-expression. */
4635 id_expression
4652 /* If we have a template-id, then no further lookup is
4653 required. If the template-id was for a template-class, we
4654 will sometimes have a TYPE_DECL at this point. */
4658 /* Look up the name. */
4659 else
4660 {
4661 tree ambiguous_decls;
4663 /* If we already know that this lookup is ambiguous, then
4664 we've already issued an error message; there's no reason
4665 to check again. */
4668 {
4671 }
4674 none_type,
4675 template_p,
4680 /* If the lookup was ambiguous, an error will already have
4681 been issued. */
4685 /* In Objective-C++, we may have an Objective-C 2.0
4686 dot-syntax for classes here. */
4691 {
4692 tree component;
4699 }
4701 /* In Objective-C++, an instance variable (ivar) may be preferred
4702 to whatever cp_parser_lookup_name() found. */
4705 /* If name lookup gives us a SCOPE_REF, then the
4706 qualifying scope was dependent. */
4708 {
4709 /* At this point, we do not know if DECL is a valid
4710 integral constant expression. We assume that it is
4711 in fact such an expression, so that code like:
4713 template <int N> struct A {
4714 int a[B<N>::i];
4715 };
4717 is accepted. At template-instantiation time, we
4718 will check that B<N>::i is actually a constant. */
4720 }
4721 /* Check to see if DECL is a local variable in a context
4722 where that is forbidden. */
4725 {
4726 /* It might be that we only found DECL because we are
4727 trying to be generous with pre-ISO scoping rules.
4728 For example, consider:
4730 int i;
4731 void g() {
4732 for (int i = 0; i < 10; ++i) {}
4733 extern void f(int j = i);
4734 }
4736 Here, name look up will originally find the out
4737 of scope `i'. We need to issue a warning message,
4738 but then use the global `i'. */
4741 {
4744 decl);
4746 }
4747 }
4748 }
4750 decl = (finish_id_expression
4752 idk,
4757 template_arg_p,
4763 }
4765 /* Anything else is an error. */
4769 }
4770 }
4778 {
4781 }
4783 /* Parse an id-expression.
4785 id-expression:
4786 unqualified-id
4787 qualified-id
4789 qualified-id:
4790 :: [opt] nested-name-specifier template [opt] unqualified-id
4791 :: identifier
4792 :: operator-function-id
4793 :: template-id
4795 Return a representation of the unqualified portion of the
4796 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4797 a `::' or nested-name-specifier.
4799 Often, if the id-expression was a qualified-id, the caller will
4800 want to make a SCOPE_REF to represent the qualified-id. This
4801 function does not do this in order to avoid wastefully creating
4802 SCOPE_REFs when they are not required.
4804 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4805 `template' keyword.
4807 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4808 uninstantiated templates.
4810 If *TEMPLATE_P is non-NULL, it is set to true iff the
4811 `template' keyword is used to explicitly indicate that the entity
4812 named is a template.
4814 If DECLARATOR_P is true, the id-expression is appearing as part of
4815 a declarator, rather than as part of an expression. */
4817 static tree
4824 {
4828 /* Assume the `template' keyword was not used. */
4832 /* Look for the optional `::' operator. */
4833 global_scope_p
4836 /* Look for the optional nested-name-specifier. */
4837 nested_name_specifier_p
4840 check_dependency_p,
4842 declarator_p)
4844 /* If there is a nested-name-specifier, then we are looking at
4845 the first qualified-id production. */
4847 {
4848 tree saved_scope;
4849 tree saved_object_scope;
4850 tree saved_qualifying_scope;
4851 tree unqualified_id;
4854 /* See if the next token is the `template' keyword. */
4858 /* Name lookup we do during the processing of the
4859 unqualified-id might obliterate SCOPE. */
4863 /* Process the final unqualified-id. */
4865 check_dependency_p,
4866 declarator_p,
4868 /* Restore the SAVED_SCOPE for our caller. */
4874 }
4875 /* Otherwise, if we are in global scope, then we are looking at one
4876 of the other qualified-id productions. */
4878 {
4880 tree id;
4882 /* Peek at the next token. */
4885 /* If it's an identifier, and the next token is not a "<", then
4886 we can avoid the template-id case. This is an optimization
4887 for this common case. */
4889 && !cp_parser_nth_token_starts_template_argument_list_p
4894 /* Try a template-id. */
4898 none_type,
4899 declarator_p);
4900 /* If that worked, we're done. */
4904 /* Peek at the next token. (Changes in the token buffer may
4905 have invalidated the pointer obtained above.) */
4909 {
4916 /* Fall through. */
4921 }
4922 }
4923 else
4926 declarator_p,
4927 optional_p);
4928 }
4930 /* Parse an unqualified-id.
4932 unqualified-id:
4933 identifier
4934 operator-function-id
4935 conversion-function-id
4936 ~ class-name
4937 template-id
4939 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4940 keyword, in a construct like `A::template ...'.
4942 Returns a representation of unqualified-id. For the `identifier'
4943 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4944 production a BIT_NOT_EXPR is returned; the operand of the
4945 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4946 other productions, see the documentation accompanying the
4947 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4948 names are looked up in uninstantiated templates. If DECLARATOR_P
4949 is true, the unqualified-id is appearing as part of a declarator,
4950 rather than as part of an expression. */
4952 static tree
4958 {
4961 /* Peek at the next token. */
4965 {
4967 {
4968 tree id;
4970 /* We don't know yet whether or not this will be a
4971 template-id. */
4973 /* Try a template-id. */
4975 check_dependency_p,
4976 none_type,
4977 declarator_p);
4978 /* If it worked, we're done. */
4981 /* Otherwise, it's an ordinary identifier. */
4983 }
4987 check_dependency_p,
4988 none_type,
4989 declarator_p);
4992 {
4993 tree type_decl;
4994 tree qualifying_scope;
4995 tree object_scope;
4996 tree scope;
4999 /* Consume the `~' token. */
5001 /* Parse the class-name. The standard, as written, seems to
5002 say that:
5004 template <typename T> struct S { ~S (); };
5005 template <typename T> S<T>::~S() {}
5007 is invalid, since `~' must be followed by a class-name, but
5008 `S<T>' is dependent, and so not known to be a class.
5009 That's not right; we need to look in uninstantiated
5010 templates. A further complication arises from:
5012 template <typename T> void f(T t) {
5013 t.T::~T();
5014 }
5016 Here, it is not possible to look up `T' in the scope of `T'
5017 itself. We must look in both the current scope, and the
5018 scope of the containing complete expression.
5020 Yet another issue is:
5022 struct S {
5023 int S;
5024 ~S();
5025 };
5027 S::~S() {}
5029 The standard does not seem to say that the `S' in `~S'
5030 should refer to the type `S' and not the data member
5031 `S::S'. */
5033 /* DR 244 says that we look up the name after the "~" in the
5034 same scope as we looked up the qualifying name. That idea
5035 isn't fully worked out; it's more complicated than that. */
5040 /* Check for invalid scopes. */
5042 {
5046 }
5048 {
5052 scope);
5057 }
5060 /* If the name is of the form "X::~X" it's OK even if X is a
5061 typedef. */
5070 {
5073 }
5075 /* ~auto means the destructor of whatever the object is. */
5077 {
5080 "%<~auto%> only available with "
5084 }
5086 /* If there was an explicit qualification (S::~T), first look
5087 in the scope given by the qualification (i.e., S).
5089 Note: in the calls to cp_parser_class_name below we pass
5090 typename_type so that lookup finds the injected-class-name
5091 rather than the constructor. */
5095 {
5100 typename_type,
5103 declarator_p);
5106 }
5107 /* In "N::S::~S", look in "N" as well. */
5109 {
5114 type_decl
5118 typename_type,
5121 declarator_p);
5124 }
5125 /* In "p->S::~T", look in the scope given by "*p" as well. */
5127 {
5132 type_decl
5136 typename_type,
5139 declarator_p);
5142 }
5143 /* Look in the surrounding context. */
5145 {
5151 type_decl
5155 typename_type,
5158 declarator_p);
5161 {
5162 /* We couldn't find a type with this name, so just accept
5163 it and check for a match at instantiation time. */
5168 }
5169 }
5170 /* If an error occurred, assume that the name of the
5171 destructor is the same as the name of the qualifying
5172 class. That allows us to keep parsing after running
5173 into ill-formed destructor names. */
5179 /* Check that destructor name and scope match. */
5181 {
5188 }
5190 /* [class.dtor]
5192 A typedef-name that names a class shall not be used as the
5193 identifier in the declarator for a destructor declaration. */
5200 type_decl);
5203 }
5207 {
5208 tree id;
5210 /* This could be a template-id, so we try that first. */
5212 /* Try a template-id. */
5215 none_type,
5216 declarator_p);
5217 /* If that worked, we're done. */
5220 /* We still don't know whether we're looking at an
5221 operator-function-id or a conversion-function-id. */
5223 /* Try an operator-function-id. */
5225 /* If that didn't work, try a conversion-function-id. */
5229 {
5230 /* 17.6.3.3.5 */
5236 }
5239 }
5240 /* Fall through. */
5247 }
5248 }
5250 /* Parse an (optional) nested-name-specifier.
5252 nested-name-specifier: [C++98]
5253 class-or-namespace-name :: nested-name-specifier [opt]
5254 class-or-namespace-name :: template nested-name-specifier [opt]
5256 nested-name-specifier: [C++0x]
5257 type-name ::
5258 namespace-name ::
5259 nested-name-specifier identifier ::
5260 nested-name-specifier template [opt] simple-template-id ::
5262 PARSER->SCOPE should be set appropriately before this function is
5263 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5264 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5265 in name lookups.
5267 Sets PARSER->SCOPE to the class (TYPE) or namespace
5268 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5269 it unchanged if there is no nested-name-specifier. Returns the new
5270 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5272 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5273 part of a declaration and/or decl-specifier. */
5275 static tree
5281 {
5286 /* Remember where the nested-name-specifier starts. */
5288 {
5291 }
5294 {
5295 tree new_scope;
5296 tree old_scope;
5297 tree saved_qualifying_scope;
5300 /* Spot cases that cannot be the beginning of a
5301 nested-name-specifier. */
5304 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5305 the already parsed nested-name-specifier. */
5307 {
5308 /* Grab the nested-name-specifier and continue the loop. */
5310 /* If we originally encountered this nested-name-specifier
5311 with IS_DECLARATION set to false, we will not have
5312 resolved TYPENAME_TYPEs, so we must do so here. */
5315 {
5320 }
5323 }
5325 /* Spot cases that cannot be the beginning of a
5326 nested-name-specifier. On the second and subsequent times
5327 through the loop, we look for the `template' keyword. */
5329 ;
5330 /* A template-id can start a nested-name-specifier. */
5332 ;
5333 /* DR 743: decltype can be used in a nested-name-specifier. */
5335 ;
5336 else
5337 {
5338 /* If the next token is not an identifier, then it is
5339 definitely not a type-name or namespace-name. */
5342 /* If the following token is neither a `<' (to begin a
5343 template-id), nor a `::', then we are not looking at a
5344 nested-name-specifier. */
5350 {
5354 }
5357 && !cp_parser_nth_token_starts_template_argument_list_p
5360 }
5362 /* The nested-name-specifier is optional, so we parse
5363 tentatively. */
5366 /* Look for the optional `template' keyword, if this isn't the
5367 first time through the loop. */
5370 else
5373 /* Save the old scope since the name lookup we are about to do
5374 might destroy it. */
5377 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5378 look up names in "X<T>::I" in order to determine that "Y" is
5379 a template. So, if we have a typename at this point, we make
5380 an effort to look through it. */
5382 && !typename_keyword_p
5387 /* Parse the qualifying entity. */
5388 new_scope
5390 typename_keyword_p,
5391 template_keyword_p,
5392 check_dependency_p,
5393 type_p,
5394 is_declaration);
5395 /* Look for the `::' token. */
5398 /* If we found what we wanted, we keep going; otherwise, we're
5399 done. */
5401 {
5404 /* Restore the OLD_SCOPE since it was valid before the
5405 failed attempt at finding the last
5406 class-or-namespace-name. */
5410 /* If the next token is a decltype, and the one after that is a
5411 `::', then the decltype has failed to resolve to a class or
5412 enumeration type. Give this error even when parsing
5413 tentatively since it can't possibly be valid--and we're going
5414 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5415 won't get another chance.*/
5419 {
5426 /* As below. */
5429 }
5433 /* If the next token is an identifier, and the one after
5434 that is a `::', then any valid interpretation would have
5435 found a class-or-namespace-name. */
5441 {
5444 {
5446 {
5447 tree decl;
5448 tree ambiguous_decls;
5451 none_type,
5460 decl);
5462 {
5463 // cp_parser_lookup_name has the same diagnostic,
5464 // thus make sure to emit it at most once.
5467 {
5472 }
5474 }
5475 else
5476 {
5478 cp_parser_name_lookup_error
5481 else
5482 cp_parser_name_lookup_error
5485 }
5486 }
5489 /* Treat this as a successful nested-name-specifier
5490 due to:
5492 [basic.lookup.qual]
5494 If the name found is not a class-name (clause
5495 _class_) or namespace-name (_namespace.def_), the
5496 program is ill-formed. */
5498 }
5500 }
5502 }
5503 /* We've found one valid nested-name-specifier. */
5505 /* Name lookup always gives us a DECL. */
5508 /* Uses of "template" must be followed by actual templates. */
5520 new_scope);
5521 /* If it is a class scope, try to complete it; we are about to
5522 be looking up names inside the class. */
5524 /* Since checking types for dependency can be expensive,
5525 avoid doing it if the type is already complete. */
5527 /* Do not try to complete dependent types. */
5529 {
5531 /* If it is a typedef to current class, use the current
5532 class instead, as the typedef won't have any names inside
5533 it yet. */
5537 }
5538 /* Make sure we look in the right scope the next time through
5539 the loop. */
5541 }
5543 /* If parsing tentatively, replace the sequence of tokens that makes
5544 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5545 token. That way, should we re-parse the token stream, we will
5546 not have to repeat the effort required to do the parse, nor will
5547 we issue duplicate error messages. */
5549 {
5553 /* Reset the contents of the START token. */
5555 /* Retrieve any deferred checks. Do not pop this access checks yet
5556 so the memory will not be reclaimed during token replacing below. */
5564 /* Purge all subsequent tokens. */
5566 }
5572 }
5574 /* Parse a nested-name-specifier. See
5575 cp_parser_nested_name_specifier_opt for details. This function
5576 behaves identically, except that it will an issue an error if no
5577 nested-name-specifier is present. */
5579 static tree
5585 {
5586 tree scope;
5588 /* Look for the nested-name-specifier. */
5590 typename_keyword_p,
5591 check_dependency_p,
5592 type_p,
5593 is_declaration);
5594 /* If it was not present, issue an error message. */
5596 {
5599 }
5602 }
5604 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5605 this is either a class-name or a namespace-name (which corresponds
5606 to the class-or-namespace-name production in the grammar). For
5607 C++0x, it can also be a type-name that refers to an enumeration
5608 type or a simple-template-id.
5610 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5611 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5612 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5613 TYPE_P is TRUE iff the next name should be taken as a class-name,
5614 even the same name is declared to be another entity in the same
5615 scope.
5617 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5618 specified by the class-or-namespace-name. If neither is found the
5619 ERROR_MARK_NODE is returned. */
5621 static tree
5628 {
5629 tree saved_scope;
5630 tree saved_qualifying_scope;
5631 tree saved_object_scope;
5632 tree scope;
5636 /* DR 743: decltype can appear in a nested-name-specifier. */
5638 {
5642 {
5645 }
5649 }
5651 /* Before we try to parse the class-name, we must save away the
5652 current PARSER->SCOPE since cp_parser_class_name will destroy
5653 it. */
5657 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5658 there is no need to look for a namespace-name. */
5659 only_class_p = template_keyword_p
5664 typename_keyword_p,
5665 template_keyword_p,
5667 check_dependency_p,
5669 is_declaration);
5671 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5675 {
5676 /* Restore the saved scope. */
5681 /* Parse tentatively. */
5684 /* Parse a type-name */
5687 /* "If the name found does not designate a namespace or a class,
5688 enumeration, or dependent type, the program is ill-formed."
5690 We cover classes and dependent types above and namespaces below,
5691 so this code is only looking for enums. */
5697 }
5698 /* If that didn't work, try for a namespace-name. */
5700 {
5701 /* Restore the saved scope. */
5705 /* If we are not looking at an identifier followed by the scope
5706 resolution operator, then this is not part of a
5707 nested-name-specifier. (Note that this function is only used
5708 to parse the components of a nested-name-specifier.) */
5713 }
5716 }
5718 /* Return true if we are looking at a compound-literal, false otherwise. */
5720 static bool
5722 {
5723 /* Consume the `('. */
5728 /* Skip tokens until the next token is a closing parenthesis.
5729 If we find the closing `)', and the next token is a `{', then
5730 we are looking at a compound-literal. */
5731 bool compound_literal_p
5736 /* Roll back the tokens we skipped. */
5740 }
5742 /* Parse a postfix-expression.
5744 postfix-expression:
5745 primary-expression
5746 postfix-expression [ expression ]
5747 postfix-expression ( expression-list [opt] )
5748 simple-type-specifier ( expression-list [opt] )
5749 typename :: [opt] nested-name-specifier identifier
5750 ( expression-list [opt] )
5751 typename :: [opt] nested-name-specifier template [opt] template-id
5752 ( expression-list [opt] )
5753 postfix-expression . template [opt] id-expression
5754 postfix-expression -> template [opt] id-expression
5755 postfix-expression . pseudo-destructor-name
5756 postfix-expression -> pseudo-destructor-name
5757 postfix-expression ++
5758 postfix-expression --
5759 dynamic_cast < type-id > ( expression )
5760 static_cast < type-id > ( expression )
5761 reinterpret_cast < type-id > ( expression )
5762 const_cast < type-id > ( expression )
5763 typeid ( expression )
5764 typeid ( type-id )
5766 GNU Extension:
5768 postfix-expression:
5769 ( type-id ) { initializer-list , [opt] }
5771 This extension is a GNU version of the C99 compound-literal
5772 construct. (The C99 grammar uses `type-name' instead of `type-id',
5773 but they are essentially the same concept.)
5775 If ADDRESS_P is true, the postfix expression is the operand of the
5776 `&' operator. CAST_P is true if this expression is the target of a
5777 cast.
5779 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5780 class member access expressions [expr.ref].
5782 Returns a representation of the expression. */
5784 static tree
5788 {
5790 location_t loc;
5797 /* Peek at the next token. */
5800 /* Some of the productions are determined by keywords. */
5803 {
5808 {
5809 tree type;
5810 tree expression;
5814 /* All of these can be handled in the same way from the point
5815 of view of parsing. Begin by consuming the token
5816 identifying the cast. */
5819 /* New types cannot be defined in the cast. */
5821 parser->type_definition_forbidden_message
5824 /* Look for the opening `<'. */
5826 /* Parse the type to which we are casting. */
5831 /* Look for the closing `>'. */
5833 /* Restore the old message. */
5836 bool saved_greater_than_is_operator_p
5840 /* And the expression which is being cast. */
5845 parser->greater_than_is_operator_p
5848 /* Only type conversions to integral or enumeration types
5849 can be used in constant-expressions. */
5855 {
5857 postfix_expression
5861 postfix_expression
5865 postfix_expression
5867 tf_warning_or_error);
5870 postfix_expression
5875 }
5876 }
5880 {
5881 tree type;
5885 /* Consume the `typeid' token. */
5887 /* Look for the `(' token. */
5889 /* Types cannot be defined in a `typeid' expression. */
5891 parser->type_definition_forbidden_message
5893 /* We can't be sure yet whether we're looking at a type-id or an
5894 expression. */
5896 /* Try a type-id first. */
5901 /* Look for the `)' token. Otherwise, we can't be sure that
5902 we're not looking at an expression: consider `typeid (int
5903 (3))', for example. */
5905 /* If all went well, simply lookup the type-id. */
5908 /* Otherwise, fall back to the expression variant. */
5909 else
5910 {
5911 tree expression;
5913 /* Look for an expression. */
5915 /* Compute its typeid. */
5917 /* Look for the `)' token. */
5919 }
5920 /* Restore the saved message. */
5922 /* `typeid' may not appear in an integral constant expression. */
5925 }
5929 {
5930 tree type;
5931 /* The syntax permitted here is the same permitted for an
5932 elaborated-type-specifier. */
5937 }
5941 {
5945 {
5950 }
5952 {
5957 }
5958 else
5959 {
5960 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5963 }
5965 postfix_expression =
5969 {
5973 }
5975 {
5980 }
5981 else
5982 {
5984 postfix_expression);
5988 }
5990 }
5993 {
5996 tree p;
6010 tf_warning_or_error);
6013 tf_warning_or_error);
6014 else
6015 {
6019 }
6021 }
6024 {
6025 tree type;
6027 /* If the next thing is a simple-type-specifier, we may be
6028 looking at a functional cast. We could also be looking at
6029 an id-expression. So, we try the functional cast, and if
6030 that doesn't work we fall back to the primary-expression. */
6032 /* Look for the simple-type-specifier. */
6035 CP_PARSER_FLAGS_NONE);
6036 /* Parse the cast itself. */
6038 postfix_expression
6040 /* If that worked, we're done. */
6044 /* If the functional-cast didn't work out, try a
6045 compound-literal. */
6048 {
6053 /* Avoid calling cp_parser_type_id pointlessly, see comment
6054 in cp_parser_cast_expression about c++/29234. */
6057 else
6058 {
6059 /* Parse the type. */
6064 /* Look for the `)'. */
6066 }
6068 /* If things aren't going well, there's no need to
6069 keep going. */
6071 {
6073 /* Parse the brace-enclosed initializer list. */
6076 }
6077 /* If that worked, we're definitely looking at a
6078 compound-literal expression. */
6080 {
6081 /* Warn the user that a compound literal is not
6082 allowed in standard C++. */
6085 /* For simplicity, we disallow compound literals in
6086 constant-expressions. We could
6087 allow compound literals of integer type, whose
6088 initializer was a constant, in constant
6089 expressions. Permitting that usage, as a further
6090 extension, would not change the meaning of any
6091 currently accepted programs. (Of course, as
6092 compound literals are not part of ISO C++, the
6093 standard has nothing to say.) */
6095 NIC_NCC))
6096 {
6099 }
6100 /* Form the representation of the compound-literal. */
6101 postfix_expression
6103 tf_warning_or_error);
6105 }
6106 }
6108 /* It must be a primary-expression. */
6109 postfix_expression
6112 decltype_p,
6114 }
6116 }
6118 /* Note that we don't need to worry about calling build_cplus_new on a
6119 class-valued CALL_EXPR in decltype when it isn't the end of the
6120 postfix-expression; unary_complex_lvalue will take care of that for
6121 all these cases. */
6123 /* Keep looping until the postfix-expression is complete. */
6125 {
6129 /* It is not a Koenig lookup function call. */
6130 postfix_expression
6133 /* Peek at the next token. */
6137 {
6140 {
6142 "two consecutive %<[%> shall "
6145 }
6146 postfix_expression
6148 postfix_expression,
6150 decltype_p);
6156 /* postfix-expression ( expression-list [opt] ) */
6157 {
6167 is_builtin_constant_p
6170 {
6171 /* The whole point of __builtin_constant_p is to allow
6172 non-constant expressions to appear as arguments. */
6173 saved_integral_constant_expression_p
6175 saved_non_integral_constant_expression_p
6178 }
6179 args = (cp_parser_parenthesized_expression_list
6185 {
6186 parser->integral_constant_expression_p
6188 parser->non_integral_constant_expression_p
6190 }
6193 {
6196 }
6198 /* Function calls are not permitted in
6199 constant-expressions. */
6202 NIC_FUNC_CALL))
6203 {
6207 }
6212 {
6214 {
6216 {
6219 postfix_expression
6221 complain);
6222 }
6223 else
6224 postfix_expression
6226 }
6227 /* We do not perform argument-dependent lookup if
6228 normal lookup finds a non-function, in accordance
6229 with the expected resolution of DR 218. */
6232 {
6236 /* Do not do argument dependent lookup if regular
6237 lookup finds a member function or a block-scope
6238 function declaration. [basic.lookup.argdep]/3 */
6241 {
6244 postfix_expression
6246 complain);
6247 }
6248 }
6249 }
6252 {
6262 "%<memset%> used with constant zero length "
6263 "parameter; this could be due to transposed "
6266 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6267 to avoid leaking those into folder and middle-end. */
6269 tree arg;
6273 }
6276 {
6286 {
6287 postfix_expression
6291 }
6294 {
6295 postfix_expression
6296 = (build_new_method_call
6302 complain));
6303 }
6304 else
6305 postfix_expression
6309 complain);
6310 }
6314 postfix_expression = (build_offset_ref_call_from_tree
6316 complain));
6318 /* A call to a static class member, or a namespace-scope
6319 function. */
6320 postfix_expression
6323 koenig_p,
6324 complain);
6325 else
6326 /* All other function calls. */
6327 postfix_expression
6330 koenig_p,
6331 complain);
6335 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6339 }
6344 /* postfix-expression . template [opt] id-expression
6345 postfix-expression . pseudo-destructor-name
6346 postfix-expression -> template [opt] id-expression
6347 postfix-expression -> pseudo-destructor-name */
6349 /* Consume the `.' or `->' operator. */
6352 postfix_expression
6354 postfix_expression,
6361 /* postfix-expression ++ */
6362 /* Consume the `++' token. */
6364 /* Generate a representation for the complete expression. */
6365 postfix_expression
6367 POSTINCREMENT_EXPR);
6368 /* Increments may not appear in constant-expressions. */
6376 /* postfix-expression -- */
6377 /* Consume the `--' token. */
6379 /* Generate a representation for the complete expression. */
6380 postfix_expression
6382 POSTDECREMENT_EXPR);
6383 /* Decrements may not appear in constant-expressions. */
6395 else
6397 }
6398 }
6400 /* We should never get here. */
6403 }
6405 /* This function parses Cilk Plus array notations. If a normal array expr. is
6406 parsed then the array index is passed back to the caller through *INIT_INDEX
6407 and the function returns a NULL_TREE. If array notation expr. is parsed,
6408 then *INIT_INDEX is ignored by the caller and the function returns
6409 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6410 error_mark_node. */
6412 static tree
6414 tree array_value)
6415 {
6419 {
6422 }
6431 {
6434 }
6436 {
6437 /* Consume the ':'. */
6440 /* If we are here, then we have a case like this A[:]. */
6442 {
6446 }
6450 }
6451 else
6452 {
6453 /* If we are here, then there are three valid possibilities:
6454 1. ARRAY [ EXP ]
6455 2. ARRAY [ EXP : EXP ]
6456 3. ARRAY [ EXP : EXP : EXP ] */
6460 {
6461 /* This indicates that we have a normal array expression. */
6464 }
6466 /* Consume the ':'. */
6470 {
6473 }
6474 }
6479 {
6483 }
6489 }
6491 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6492 by cp_parser_builtin_offsetof. We're looking for
6494 postfix-expression [ expression ]
6495 postfix-expression [ braced-init-list ] (C++11)
6497 FOR_OFFSETOF is set if we're being called in that context, which
6498 changes how we deal with integer constant expressions. */
6500 static tree
6502 tree postfix_expression,
6505 {
6510 /* Consume the `[' token. */
6516 /* Parse the index expression. */
6517 /* ??? For offsetof, there is a question of what to allow here. If
6518 offsetof is not being used in an integral constant expression context,
6519 then we *could* get the right answer by computing the value at runtime.
6520 If we are in an integral constant expression context, then we might
6521 could accept any constant expression; hard to say without analysis.
6522 Rather than open the barn door too wide right away, allow only integer
6523 constant expressions here. */
6526 else
6527 {
6529 {
6536 {
6538 "braced list index is not allowed with array "
6542 }
6543 }
6545 {
6546 /* Here are have these two options:
6547 ARRAY[EXP : EXP] - Array notation expr with default
6548 stride of 1.
6549 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6550 stride. */
6552 postfix_expression);
6555 }
6556 else
6558 }
6562 /* Look for the closing `]'. */
6565 /* Build the ARRAY_REF. */
6569 /* When not doing offsetof, array references are not permitted in
6570 constant-expressions. */
6576 }
6578 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6579 by cp_parser_builtin_offsetof. We're looking for
6581 postfix-expression . template [opt] id-expression
6582 postfix-expression . pseudo-destructor-name
6583 postfix-expression -> template [opt] id-expression
6584 postfix-expression -> pseudo-destructor-name
6586 FOR_OFFSETOF is set if we're being called in that context. That sorta
6587 limits what of the above we'll actually accept, but nevermind.
6588 TOKEN_TYPE is the "." or "->" token, which will already have been
6589 removed from the stream. */
6591 static tree
6594 tree postfix_expression,
6596 location_t location)
6597 {
6598 tree name;
6603 /* If this is a `->' operator, dereference the pointer. */
6606 tf_warning_or_error);
6607 /* Check to see whether or not the expression is type-dependent. */
6609 /* The identifier following the `->' or `.' is not qualified. */
6615 /* Enter the scope corresponding to the type of the object
6616 given by the POSTFIX_EXPRESSION. */
6618 {
6620 /* According to the standard, no expression should ever have
6621 reference type. Unfortunately, we do not currently match
6622 the standard in this respect in that our internal representation
6623 of an expression may have reference type even when the standard
6624 says it does not. Therefore, we have to manually obtain the
6625 underlying type here. */
6627 /* The type of the POSTFIX_EXPRESSION must be complete. */
6629 {
6631 postfix_expression);
6633 }
6634 /* Unlike the object expression in other contexts, *this is not
6635 required to be of complete type for purposes of class member
6636 access (5.2.5) outside the member function body. */
6640 /* Let the name lookup machinery know that we are processing a
6641 class member access expression. */
6643 /* If something went wrong, we want to be able to discern that case,
6644 as opposed to the case where there was no SCOPE due to the type
6645 of expression being dependent. */
6648 /* If the SCOPE was erroneous, make the various semantic analysis
6649 functions exit quickly -- and without issuing additional error
6650 messages. */
6653 }
6655 /* Assume this expression is not a pseudo-destructor access. */
6658 /* If the SCOPE is a scalar type, then, if this is a valid program,
6659 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6660 is type dependent, it can be pseudo-destructor-name or something else.
6661 Try to parse it as pseudo-destructor-name first. */
6663 {
6664 tree s;
6665 tree type;
6668 /* Parse the pseudo-destructor-name. */
6677 {
6679 postfix_expression
6682 }
6683 }
6686 {
6687 /* If the SCOPE is not a scalar type, we are looking at an
6688 ordinary class member access expression, rather than a
6689 pseudo-destructor-name. */
6692 /* Parse the id-expression. */
6693 name = (cp_parser_id_expression
6700 /* In general, build a SCOPE_REF if the member name is qualified.
6701 However, if the name was not dependent and has already been
6702 resolved; there is no need to build the SCOPE_REF. For example;
6704 struct X { void f(); };
6705 template <typename T> void f(T* t) { t->X::f(); }
6707 Even though "t" is dependent, "X::f" is not and has been resolved
6708 to a BASELINK; there is no need to include scope information. */
6710 /* But we do need to remember that there was an explicit scope for
6711 virtual function calls. */
6715 /* If the name is a template-id that names a type, we will get a
6716 TYPE_DECL here. That is invalid code. */
6718 {
6721 }
6722 else
6723 {
6725 {
6727 {
6731 }
6732 else
6735 name,
6736 template_p);
6740 }
6742 adjust_result_of_qualified_name_lookup
6744 postfix_expression
6746 template_p,
6747 tf_warning_or_error);
6748 }
6749 }
6751 /* We no longer need to look up names in the scope of the object on
6752 the left-hand side of the `.' or `->' operator. */
6755 /* Outside of offsetof, these operators may not appear in
6756 constant-expressions. */
6758 && (cp_parser_non_integral_constant_expression
6763 }
6765 /* Cache of LITERAL_ZERO_P constants. */
6769 /* Parse a parenthesized expression-list.
6771 expression-list:
6772 assignment-expression
6773 expression-list, assignment-expression
6775 attribute-list:
6776 expression-list
6777 identifier
6778 identifier, expression-list
6780 CAST_P is true if this expression is the target of a cast.
6782 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6783 argument pack.
6785 Returns a vector of trees. Each element is a representation of an
6786 assignment-expression. NULL is returned if the ( and or ) are
6787 missing. An empty, but allocated, vector is returned on no
6788 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6789 if we are parsing an attribute list for an attribute that wants a
6790 plain identifier argument, normal_attr for an attribute that wants
6791 an expression, or non_attr if we aren't parsing an attribute list. If
6792 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6793 not all of the expressions in the list were constant.
6794 WANT_LITERAL_ZERO_P is true if the caller is interested in
6795 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6796 immediately, this can be removed. */
6805 {
6811 /* Assume all the expressions will be constant. */
6820 /* Within a parenthesized expression, a `>' token is always
6821 the greater-than operator. */
6822 saved_greater_than_is_operator_p
6826 /* Consume expressions until there are no more. */
6829 {
6830 tree expr;
6832 /* At the beginning of attribute lists, check to see if the
6833 next token is an identifier. */
6836 {
6839 /* Consume the identifier. */
6841 /* Save the identifier. */
6843 }
6844 else
6845 {
6848 /* Parse the next assignment-expression. */
6850 {
6851 /* A braced-init-list. */
6857 }
6859 {
6860 expr = (cp_parser_constant_expression
6865 }
6866 else
6867 {
6871 {
6877 /* If a parameter is literal zero alone, remember it
6878 for -Wmemset-transposed-args warning. */
6881 && want_literal_zero_p
6883 == CPP_COMMA
6886 {
6893 else
6894 {
6899 }
6900 /* Consume the 0 token (or '\0', 0LL etc.). */
6902 }
6906 }
6909 cast_p);
6910 }
6915 /* If we have an ellipsis, then this is an expression
6916 expansion. */
6919 {
6920 /* Consume the `...'. */
6923 /* Build the argument pack. */
6925 }
6927 /* Add it to the list. We add error_mark_node
6928 expressions to the list, so that we can still tell if
6929 the correct form for a parenthesized expression-list
6930 is found. That gives better errors. */
6935 }
6937 /* After the first item, attribute lists look the same as
6938 expression lists. */
6941 get_comma:;
6942 /* If the next token isn't a `,', then we are done. */
6946 /* Otherwise, consume the `,' and keep going. */
6948 }
6951 {
6954 skip_comma:;
6955 /* We try and resync to an unnested comma, as that will give the
6956 user better diagnostics. */
6964 {
6965 parser->greater_than_is_operator_p
6968 }
6969 }
6971 parser->greater_than_is_operator_p
6978 }
6980 /* Parse a pseudo-destructor-name.
6982 pseudo-destructor-name:
6983 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6984 :: [opt] nested-name-specifier template template-id :: ~ type-name
6985 :: [opt] nested-name-specifier [opt] ~ type-name
6987 If either of the first two productions is used, sets *SCOPE to the
6988 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6989 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6990 or ERROR_MARK_NODE if the parse fails. */
6992 static void
6994 tree object,
6997 {
7000 /* Handle ~auto. */
7004 {
7007 "%<~auto%> only available with "
7014 }
7016 /* Assume that things will not work out. */
7019 /* Look for the optional `::' operator. */
7021 /* Look for the optional nested-name-specifier. */
7022 nested_name_specifier_p
7029 /* Now, if we saw a nested-name-specifier, we might be doing the
7030 second production. */
7033 {
7034 /* Consume the `template' keyword. */
7036 /* Parse the template-id. */
7040 class_type,
7042 /* Look for the `::' token. */
7044 }
7045 /* If the next token is not a `~', then there might be some
7046 additional qualification. */
7048 {
7049 /* At this point, we're looking for "type-name :: ~". The type-name
7050 must not be a class-name, since this is a pseudo-destructor. So,
7051 it must be either an enum-name, or a typedef-name -- both of which
7052 are just identifiers. So, we peek ahead to check that the "::"
7053 and "~" tokens are present; if they are not, then we can avoid
7054 calling type_name. */
7058 {
7061 }
7063 /* Look for the type-name. */
7068 /* Look for the `::' token. */
7070 }
7071 else
7074 /* Look for the `~'. */
7077 /* Once we see the ~, this has to be a pseudo-destructor. */
7081 /* Look for the type-name again. We are not responsible for
7082 checking that it matches the first type-name. */
7084 }
7086 /* Parse a unary-expression.
7088 unary-expression:
7089 postfix-expression
7090 ++ cast-expression
7091 -- cast-expression
7092 unary-operator cast-expression
7093 sizeof unary-expression
7094 sizeof ( type-id )
7095 alignof ( type-id ) [C++0x]
7096 new-expression
7097 delete-expression
7099 GNU Extensions:
7101 unary-expression:
7102 __extension__ cast-expression
7103 __alignof__ unary-expression
7104 __alignof__ ( type-id )
7105 alignof unary-expression [C++0x]
7106 __real__ cast-expression
7107 __imag__ cast-expression
7108 && identifier
7109 sizeof ( type-id ) { initializer-list , [opt] }
7110 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7111 __alignof__ ( type-id ) { initializer-list , [opt] }
7113 ADDRESS_P is true iff the unary-expression is appearing as the
7114 operand of the `&' operator. CAST_P is true if this expression is
7115 the target of a cast.
7117 Returns a representation of the expression. */
7119 static tree
7122 {
7126 /* Peek at the next token. */
7128 /* Some keywords give away the kind of expression. */
7130 {
7134 {
7137 {
7140 location_t first_loc;
7143 /* Consume the token. */
7146 /* Parse the operand. */
7151 else
7152 {
7153 /* ISO C++ defines alignof only with types, not with
7154 expressions. So pedwarn if alignof is used with a non-
7155 type expression. However, __alignof__ is ok. */
7158 "ISO C++ does not allow %<alignof%> "
7162 }
7163 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7164 SIZEOF_EXPR with the original operand. */
7166 {
7168 {
7170 {
7173 error_mark_node));
7175 }
7176 else
7180 }
7182 }
7184 }
7193 {
7194 /* The saved value of the PEDANTIC flag. */
7196 tree expr;
7198 /* Save away the PEDANTIC flag. */
7200 /* Parse the cast-expression. */
7202 /* Restore the PEDANTIC flag. */
7206 }
7210 {
7211 tree expression;
7213 /* Consume the `__real__' or `__imag__' token. */
7215 /* Parse the cast-expression. */
7217 /* Create the complete representation. */
7221 expression,
7222 tf_warning_or_error);
7223 }
7231 {
7232 tree expr;
7242 parser->type_definition_forbidden_message
7245 saved_integral_constant_expression_p
7247 saved_non_integral_constant_expression_p
7251 saved_greater_than_is_operator_p
7263 parser->greater_than_is_operator_p
7266 parser->integral_constant_expression_p
7268 parser->non_integral_constant_expression_p
7275 }
7279 }
7280 }
7282 /* Look for the `:: new' and `:: delete', which also signal the
7283 beginning of a new-expression, or delete-expression,
7284 respectively. If the next token is `::', then it might be one of
7285 these. */
7287 {
7290 /* See if the token after the `::' is one of the keywords in
7291 which we're interested. */
7293 /* If it's `new', we have a new-expression. */
7296 /* Similarly, for `delete'. */
7299 }
7301 /* Look for a unary operator. */
7303 /* The `++' and `--' operators can be handled similarly, even though
7304 they are not technically unary-operators in the grammar. */
7306 {
7311 /* Handle the GNU address-of-label extension. */
7314 {
7315 tree identifier;
7316 tree expression;
7319 /* Consume the '&&' token. */
7321 /* Look for the identifier. */
7323 /* Create an expression representing the address. */
7326 NIC_ADDR_LABEL))
7329 }
7330 }
7332 {
7333 tree cast_expression;
7339 /* Consume the operator token. */
7341 /* Parse the cast-expression. */
7342 cast_expression
7347 pidk);
7348 /* Now, build an appropriate representation. */
7350 {
7354 RO_UNARY_STAR,
7355 complain);
7360 /* Fall through. */
7363 cast_expression,
7364 complain);
7371 /* Fall through. */
7381 }
7385 non_constant_p))
7389 }
7393 decltype_p,
7394 pidk);
7395 }
7397 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7398 unary-operator, the corresponding tree code is returned. */
7400 static enum tree_code
7402 {
7404 {
7425 }
7426 }
7428 /* Parse a new-expression.
7430 new-expression:
7431 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7432 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7434 Returns a representation of the expression. */
7436 static tree
7438 {
7441 tree type;
7444 tree ret;
7446 /* Look for the optional `::' operator. */
7447 global_scope_p
7451 /* Look for the `new' operator. */
7453 /* There's no easy way to tell a new-placement from the
7454 `( type-id )' construct. */
7456 /* Look for a new-placement. */
7458 /* If that didn't work out, there's no new-placement. */
7460 {
7464 }
7466 /* If the next token is a `(', then we have a parenthesized
7467 type-id. */
7469 {
7473 /* Consume the `('. */
7476 /* Parse the type-id. */
7477 parser->type_definition_forbidden_message
7482 /* Look for the closing `)'. */
7485 /* There should not be a direct-new-declarator in this production,
7486 but GCC used to allowed this, so we check and emit a sensible error
7487 message for this case. */
7489 {
7495 }
7496 }
7497 /* Otherwise, there must be a new-type-id. */
7498 else
7501 /* If the next token is a `(' or '{', then we have a new-initializer. */
7505 else
7508 /* A new-expression may not appear in an integral constant
7509 expression. */
7512 else
7513 {
7514 /* Create a representation of the new-expression. */
7516 tf_warning_or_error);
7517 }
7525 }
7527 /* Parse a new-placement.
7529 new-placement:
7530 ( expression-list )
7532 Returns the same representation as for an expression-list. */
7536 {
7539 /* Parse the expression-list. */
7540 expression_list = (cp_parser_parenthesized_expression_list
7546 }
7548 /* Parse a new-type-id.
7550 new-type-id:
7551 type-specifier-seq new-declarator [opt]
7553 Returns the TYPE allocated. If the new-type-id indicates an array
7554 type, *NELTS is set to the number of elements in the last array
7555 bound; the TYPE will not include the last array bound. */
7557 static tree
7559 {
7560 cp_decl_specifier_seq type_specifier_seq;
7566 /* The type-specifier sequence must not contain type definitions.
7567 (It cannot contain declarations of new types either, but if they
7568 are not definitions we will catch that because they are not
7569 complete.) */
7571 parser->type_definition_forbidden_message
7573 /* Parse the type-specifier-seq. */
7577 /* Restore the old message. */
7583 /* Parse the new-declarator. */
7586 /* Determine the number of elements in the last array dimension, if
7587 any. */
7589 /* Skip down to the last array dimension. */
7594 {
7597 }
7602 {
7605 }
7608 {
7615 else
7617 }
7620 }
7622 /* Parse an (optional) new-declarator.
7624 new-declarator:
7625 ptr-operator new-declarator [opt]
7626 direct-new-declarator
7628 Returns the declarator. */
7632 {
7635 cp_cv_quals cv_quals;
7637 /* We don't know if there's a ptr-operator next, or not. */
7639 /* Look for a ptr-operator. */
7641 /* If that worked, look for more new-declarators. */
7643 {
7646 /* Parse another optional declarator. */
7649 declarator = cp_parser_make_indirect_declarator
7653 }
7655 /* If the next token is a `[', there is a direct-new-declarator. */
7660 }
7662 /* Parse a direct-new-declarator.
7664 direct-new-declarator:
7665 [ expression ]
7666 direct-new-declarator [constant-expression]
7668 */
7672 {
7676 {
7677 tree expression;
7680 /* Look for the opening `['. */
7685 /* The standard requires that the expression have integral
7686 type. DR 74 adds enumeration types. We believe that the
7687 real intent is that these expressions be handled like the
7688 expression in a `switch' condition, which also allows
7689 classes with a single conversion to integral or
7690 enumeration type. */
7692 {
7693 expression
7695 expression,
7698 {
7700 "expression in new-declarator must have integral "
7703 }
7704 }
7706 /* Look for the closing `]'. */
7709 /* Add this bound to the declarator. */
7712 /* If the next token is not a `[', then there are no more
7713 bounds. */
7716 }
7719 }
7721 /* Parse a new-initializer.
7723 new-initializer:
7724 ( expression-list [opt] )
7725 braced-init-list
7727 Returns a representation of the expression-list. */
7731 {
7735 {
7736 tree t;
7743 }
7744 else
7745 expression_list = (cp_parser_parenthesized_expression_list
7751 }
7753 /* Parse a delete-expression.
7755 delete-expression:
7756 :: [opt] delete cast-expression
7757 :: [opt] delete [ ] cast-expression
7759 Returns a representation of the expression. */
7761 static tree
7763 {
7766 tree expression;
7768 /* Look for the optional `::' operator. */
7769 global_scope_p
7773 /* Look for the `delete' keyword. */
7775 /* See if the array syntax is in use. */
7777 {
7778 /* Consume the `[' token. */
7780 /* Look for the `]' token. */
7782 /* Remember that this is the `[]' construct. */
7784 }
7785 else
7788 /* Parse the cast-expression. */
7791 /* A delete-expression may not appear in an integral constant
7792 expression. */
7797 tf_warning_or_error);
7798 }
7800 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7801 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7802 0 otherwise. */
7804 static int
7806 {
7809 {
7851 /* In ((type ()) () the last () isn't a valid cast-expression,
7852 so the whole must be parsed as postfix-expression. */
7857 /* '[' may start a primary-expression in obj-c++ and in C++11,
7858 as a lambda-expression, eg, '(void)[]{}'. */
7865 /* '++' and '--' may or may not start a cast-expression:
7867 struct T { void operator++(int); };
7868 void f() { (T())++; }
7870 vs
7872 int a;
7873 (int)++a; */
7878 }
7879 }
7881 /* Parse a cast-expression.
7883 cast-expression:
7884 unary-expression
7885 ( type-id ) cast-expression
7887 ADDRESS_P is true iff the unary-expression is appearing as the
7888 operand of the `&' operator. CAST_P is true if this expression is
7889 the target of a cast.
7891 Returns a representation of the expression. */
7893 static tree
7896 {
7897 /* If it's a `(', then we might be looking at a cast. */
7899 {
7905 /* There's no way to know yet whether or not this is a cast.
7906 For example, `(int (3))' is a unary-expression, while `(int)
7907 3' is a cast. So, we resort to parsing tentatively. */
7909 /* Types may not be defined in a cast. */
7911 parser->type_definition_forbidden_message
7913 /* Consume the `('. */
7915 /* A very tricky bit is that `(struct S) { 3 }' is a
7916 compound-literal (which we permit in C++ as an extension).
7917 But, that construct is not a cast-expression -- it is a
7918 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7919 is legal; if the compound-literal were a cast-expression,
7920 you'd need an extra set of parentheses.) But, if we parse
7921 the type-id, and it happens to be a class-specifier, then we
7922 will commit to the parse at that point, because we cannot
7923 undo the action that is done when creating a new class. So,
7924 then we cannot back up and do a postfix-expression.
7926 Another tricky case is the following (c++/29234):
7928 struct S { void operator () (); };
7930 void foo ()
7931 {
7932 ( S()() );
7933 }
7935 As a type-id we parse the parenthesized S()() as a function
7936 returning a function, groktypename complains and we cannot
7937 back up in this case either.
7939 Therefore, we scan ahead to the closing `)', and check to see
7940 if the tokens after the `)' can start a cast-expression. Otherwise
7941 we are dealing with an unary-expression, a postfix-expression
7942 or something else.
7944 Yet another tricky case, in C++11, is the following (c++/54891):
7946 (void)[]{};
7948 The issue is that usually, besides the case of lambda-expressions,
7949 the parenthesized type-id cannot be followed by '[', and, eg, we
7950 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7951 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7952 we don't commit, we try a cast-expression, then an unary-expression.
7954 Save tokens so that we can put them back. */
7957 /* We may be looking at a cast-expression. */
7960 cast_expression
7963 /* Roll back the tokens we skipped. */
7965 /* If we aren't looking at a cast-expression, simulate an error so
7966 that the call to cp_parser_error_occurred below returns true. */
7969 else
7970 {
7973 /* Look for the type-id. */
7975 /* Look for the closing `)'. */
7978 }
7980 /* Restore the saved message. */
7983 /* At this point this can only be either a cast or a
7984 parenthesized ctor such as `(T ())' that looks like a cast to
7985 function returning T. */
7987 {
7988 /* Only commit if the cast-expression doesn't start with
7989 '++', '--', or '[' in C++11. */
7997 pidk);
8000 {
8001 /* Warn about old-style casts, if so requested. */
8008 /* Only type conversions to integral or enumeration types
8009 can be used in constant-expressions. */
8012 NIC_CAST))
8015 /* Perform the cast. */
8018 }
8019 }
8020 else
8022 }
8024 /* If we get here, then it's not a cast, so it must be a
8025 unary-expression. */
8028 }
8030 /* Parse a binary expression of the general form:
8032 pm-expression:
8033 cast-expression
8034 pm-expression .* cast-expression
8035 pm-expression ->* cast-expression
8037 multiplicative-expression:
8038 pm-expression
8039 multiplicative-expression * pm-expression
8040 multiplicative-expression / pm-expression
8041 multiplicative-expression % pm-expression
8043 additive-expression:
8044 multiplicative-expression
8045 additive-expression + multiplicative-expression
8046 additive-expression - multiplicative-expression
8048 shift-expression:
8049 additive-expression
8050 shift-expression << additive-expression
8051 shift-expression >> additive-expression
8053 relational-expression:
8054 shift-expression
8055 relational-expression < shift-expression
8056 relational-expression > shift-expression
8057 relational-expression <= shift-expression
8058 relational-expression >= shift-expression
8060 GNU Extension:
8062 relational-expression:
8063 relational-expression <? shift-expression
8064 relational-expression >? shift-expression
8066 equality-expression:
8067 relational-expression
8068 equality-expression == relational-expression
8069 equality-expression != relational-expression
8071 and-expression:
8072 equality-expression
8073 and-expression & equality-expression
8075 exclusive-or-expression:
8076 and-expression
8077 exclusive-or-expression ^ and-expression
8079 inclusive-or-expression:
8080 exclusive-or-expression
8081 inclusive-or-expression | exclusive-or-expression
8083 logical-and-expression:
8084 inclusive-or-expression
8085 logical-and-expression && inclusive-or-expression
8087 logical-or-expression:
8088 logical-and-expression
8089 logical-or-expression || logical-and-expression
8091 All these are implemented with a single function like:
8093 binary-expression:
8094 simple-cast-expression
8095 binary-expression <token> binary-expression
8097 CAST_P is true if this expression is the target of a cast.
8099 The binops_by_token map is used to get the tree codes for each <token> type.
8100 binary-expressions are associated according to a precedence table. */
8102 #define TOKEN_PRECEDENCE(token) \
8103 (((token->type == CPP_GREATER \
8104 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8105 && !parser->greater_than_is_operator_p) \
8106 ? PREC_NOT_OPERATOR \
8107 : binops_by_token[token->type].prec)
8109 static tree
8115 {
8116 cp_parser_expression_stack stack;
8118 cp_parser_expression_stack_entry current;
8119 tree rhs;
8123 tree overload;
8125 /* Parse the first expression. */
8136 {
8137 /* Get an operator token. */
8143 {
8145 "%<>>%> operator is treated"
8149 }
8153 /* Popping an entry off the stack means we completed a subexpression:
8154 - either we found a token which is not an operator (`>' where it is not
8155 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8156 will happen repeatedly;
8157 - or, we found an operator which has lower priority. This is the case
8158 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8159 parsing `3 * 4'. */
8161 {
8164 else
8166 }
8168 get_rhs:
8172 /* We used the operator token. */
8175 /* For "false && x" or "true || x", x will never be executed;
8176 disable warnings while evaluating it. */
8182 /* Extract another operand. It may be the RHS of this expression
8183 or the LHS of a new, higher priority expression. */
8188 /* Get another operator token. Look up its precedence to avoid
8189 building a useless (immediately popped) stack entry for common
8190 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8194 {
8195 /* ... and prepare to parse the RHS of the new, higher priority
8196 expression. Since precedence levels on the stack are
8197 monotonically increasing, we do not have to care about
8198 stack overflows. */
8207 pop:
8209 /* If the stack is not empty, we have parsed into LHS the right side
8210 (`4' in the example above) of an expression we had suspended.
8211 We can use the information on the stack to recover the LHS (`3')
8212 from the stack together with the tree code (`MULT_EXPR'), and
8213 the precedence of the higher level subexpression
8214 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8215 which will be used to actually build the additive expression. */
8220 }
8222 /* Undo the disabling of warnings done above. */
8233 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8234 ERROR_MARK for everything that is not a binary expression.
8235 This makes warn_about_parentheses miss some warnings that
8236 involve unary operators. For unary expressions we should
8237 pass the correct tree_code unless the unary expression was
8238 surrounded by parentheses.
8239 */
8245 == tcc_comparison
8248 else
8257 /* If the binary operator required the use of an overloaded operator,
8258 then this expression cannot be an integral constant-expression.
8259 An overloaded operator can be used even if both operands are
8260 otherwise permissible in an integral constant-expression if at
8261 least one of the operands is of enumeration type. */
8265 NIC_OVERLOADED))
8267 }
8270 }
8272 static tree
8277 {
8280 }
8282 /* Parse the `? expression : assignment-expression' part of a
8283 conditional-expression. The LOGICAL_OR_EXPR is the
8284 logical-or-expression that started the conditional-expression.
8285 Returns a representation of the entire conditional-expression.
8287 This routine is used by cp_parser_assignment_expression.
8289 ? expression : assignment-expression
8291 GNU Extensions:
8293 ? : assignment-expression */
8295 static tree
8297 {
8298 tree expr;
8299 tree assignment_expr;
8303 /* Consume the `?' token. */
8308 {
8311 /* Implicit true clause. */
8315 }
8316 else
8317 {
8320 /* Parse the expression. */
8323 c_inhibit_evaluation_warnings +=
8327 }
8329 /* The next token should be a `:'. */
8331 /* Parse the assignment-expression. */
8335 /* Build the conditional-expression. */
8337 expr,
8338 assignment_expr,
8339 tf_warning_or_error);
8340 }
8342 /* Parse an assignment-expression.
8344 assignment-expression:
8345 conditional-expression
8346 logical-or-expression assignment-operator assignment_expression
8347 throw-expression
8349 CAST_P is true if this expression is the target of a cast.
8350 DECLTYPE_P is true if this expression is the operand of decltype.
8352 Returns a representation for the expression. */
8354 static tree
8357 {
8358 tree expr;
8360 /* If the next token is the `throw' keyword, then we're looking at
8361 a throw-expression. */
8364 /* Otherwise, it must be that we are looking at a
8365 logical-or-expression. */
8366 else
8367 {
8368 /* Parse the binary expressions (logical-or-expression). */
8370 decltype_p,
8372 /* If the next token is a `?' then we're actually looking at a
8373 conditional-expression. */
8376 else
8377 {
8380 /* If it's an assignment-operator, we're using the second
8381 production. */
8382 enum tree_code assignment_operator
8385 {
8387 location_t saved_input_location;
8389 /* Parse the right-hand side of the assignment. */
8395 /* An assignment may not appear in a
8396 constant-expression. */
8398 NIC_ASSIGNMENT))
8400 /* Build the assignment expression. Its default
8401 location is the location of the '=' token. */
8405 assignment_operator,
8406 rhs,
8409 }
8410 }
8411 }
8414 }
8416 /* Parse an (optional) assignment-operator.
8418 assignment-operator: one of
8419 = *= /= %= += -= >>= <<= &= ^= |=
8421 GNU Extension:
8423 assignment-operator: one of
8424 <?= >?=
8426 If the next token is an assignment operator, the corresponding tree
8427 code is returned, and the token is consumed. For example, for
8428 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8429 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8430 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8431 operator, ERROR_MARK is returned. */
8433 static enum tree_code
8435 {
8439 /* Peek at the next token. */
8443 {
8489 /* Nothing else is an assignment operator. */
8491 }
8493 /* If it was an assignment operator, consume it. */
8498 }
8500 /* Parse an expression.
8502 expression:
8503 assignment-expression
8504 expression , assignment-expression
8506 CAST_P is true if this expression is the target of a cast.
8507 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8508 except possibly parenthesized or on the RHS of a comma (N3276).
8510 Returns a representation of the expression. */
8512 static tree
8515 {
8520 {
8521 tree assignment_expression;
8523 /* Parse the next assignment-expression. */
8524 assignment_expression
8527 /* We don't create a temporary for a call that is the immediate operand
8528 of decltype or on the RHS of a comma. But when we see a comma, we
8529 need to create a temporary for a call on the LHS. */
8534 assignment_expression
8538 /* If this is the first assignment-expression, we can just
8539 save it away. */
8542 else
8544 assignment_expression,
8546 /* If the next token is not a comma, then we are done with the
8547 expression. */
8550 /* Consume the `,'. */
8553 /* A comma operator cannot appear in a constant-expression. */
8556 }
8559 }
8561 /* Parse a constant-expression.
8563 constant-expression:
8564 conditional-expression
8566 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8567 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8568 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8569 is false, NON_CONSTANT_P should be NULL. */
8571 static tree
8575 {
8579 tree expression;
8581 /* It might seem that we could simply parse the
8582 conditional-expression, and then check to see if it were
8583 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8584 one that the compiler can figure out is constant, possibly after
8585 doing some simplifications or optimizations. The standard has a
8586 precise definition of constant-expression, and we must honor
8587 that, even though it is somewhat more restrictive.
8589 For example:
8591 int i[(2, 3)];
8593 is not a legal declaration, because `(2, 3)' is not a
8594 constant-expression. The `,' operator is forbidden in a
8595 constant-expression. However, GCC's constant-folding machinery
8596 will fold this operation to an INTEGER_CST for `3'. */
8598 /* Save the old settings. */
8600 saved_allow_non_integral_constant_expression_p
8603 /* We are now parsing a constant-expression. */
8605 parser->allow_non_integral_constant_expression_p
8608 /* Although the grammar says "conditional-expression", we parse an
8609 "assignment-expression", which also permits "throw-expression"
8610 and the use of assignment operators. In the case that
8611 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8612 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8613 actually essential that we look for an assignment-expression.
8614 For example, cp_parser_initializer_clauses uses this function to
8615 determine whether a particular assignment-expression is in fact
8616 constant. */
8618 /* Restore the old settings. */
8619 parser->integral_constant_expression_p
8621 parser->allow_non_integral_constant_expression_p
8624 {
8625 /* Require an rvalue constant expression here; that's what our
8626 callers expect. Reference constant expressions are handled
8627 separately in e.g. cp_parser_template_argument. */
8632 }
8635 parser->non_integral_constant_expression_p
8639 }
8641 /* Parse __builtin_offsetof.
8643 offsetof-expression:
8644 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8646 offsetof-member-designator:
8647 id-expression
8648 | offsetof-member-designator "." id-expression
8649 | offsetof-member-designator "[" expression "]"
8650 | offsetof-member-designator "->" id-expression */
8652 static tree
8654 {
8657 cp_id_kind dummy;
8660 /* We're about to accept non-integral-constant things, but will
8661 definitely yield an integral constant expression. Save and
8662 restore these values around our local parsing. */
8666 /* Consume the "__builtin_offsetof" token. */
8668 /* Consume the opening `('. */
8670 /* Parse the type-id. */
8673 /* Look for the `,'. */
8677 /* Build the (type *)null that begins the traditional offsetof macro. */
8679 tf_warning_or_error);
8681 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8685 {
8688 {
8690 /* offsetof-member-designator "[" expression "]" */
8696 /* offsetof-member-designator "->" identifier */
8699 /* FALLTHRU */
8702 /* offsetof-member-designator "." identifier */
8710 /* Consume the ")" token. */
8715 /* Error. We know the following require will fail, but
8716 that gives the proper error message. */
8721 }
8722 }
8724 success:
8725 /* If we're processing a template, we can't finish the semantics yet.
8726 Otherwise we can fold the entire expression now. */
8728 {
8731 }
8732 else
8735 failure:
8740 }
8742 /* Parse a trait expression.
8744 Returns a representation of the expression, the underlying type
8745 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8747 static tree
8749 {
8750 cp_trait_kind kind;
8756 {
8840 }
8842 /* Consume the token. */
8853 {
8860 }
8862 {
8864 {
8868 {
8871 }
8875 }
8876 }
8880 /* Complete the trait expression, which may mean either processing
8881 the trait expr now or saving it for template instantiation. */
8883 {
8892 }
8893 }
8895 /* Lambdas that appear in variable initializer or default argument scope
8896 get that in their mangling, so we need to record it. We might as well
8897 use the count for function and namespace scopes as well. */
8901 {
8902 tree t;
8907 static void
8909 {
8910 tree_int ti;
8912 /* Once we're inside a function, we ignore other scopes and just push
8913 the function again so that popping works properly. */
8920 {
8921 /* Don't reset the count if we're still in the same function. */
8924 }
8925 }
8927 static void
8929 {
8932 }
8934 static void
8936 {
8939 {
8942 }
8944 }
8946 /* Parse a lambda expression.
8948 lambda-expression:
8949 lambda-introducer lambda-declarator [opt] compound-statement
8951 Returns a representation of the expression. */
8953 static tree
8955 {
8957 tree type;
8965 {
8967 {
8971 }
8973 }
8975 {
8977 {
8980 }
8982 }
8984 /* We may be in the middle of deferred access check. Disable
8985 it now. */
8996 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8999 /* Now that we've started the type, add the capture fields for any
9000 explicit captures. */
9003 {
9004 /* Inside the class, surrounding template-parameter-lists do not apply. */
9005 unsigned int saved_num_template_parameter_lists
9009 bool fully_implicit_function_template_p
9013 bool auto_is_implicit_function_template_parm_p
9024 /* By virtue of defining a local class, a lambda expression has access to
9025 the private variables of enclosing classes. */
9030 {
9036 }
9038 {
9041 }
9043 /* The capture list was built up in reverse order; fix that now. */
9055 parser->fully_implicit_function_template_p
9059 parser->auto_is_implicit_function_template_parm_p
9061 }
9065 /* This field is only used during parsing of the lambda. */
9068 /* This lambda shouldn't have any proxies left at this point. */
9070 /* And now that we're done, push proxies for an enclosing lambda. */
9075 else
9081 }
9083 /* Parse the beginning of a lambda expression.
9085 lambda-introducer:
9086 [ lambda-capture [opt] ]
9088 LAMBDA_EXPR is the current representation of the lambda expression. */
9090 static void
9092 {
9093 /* Need commas after the first capture. */
9096 /* Eat the leading `['. */
9099 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9107 {
9110 }
9113 {
9115 tree capture_id;
9116 tree capture_init_expr;
9120 enum capture_kind_type
9121 {
9122 BY_COPY,
9123 BY_REFERENCE
9124 };
9128 {
9131 }
9135 else
9138 /* Possibly capture `this'. */
9140 {
9150 explicit_init_p);
9152 }
9154 /* Remember whether we want to capture as a reference or not. */
9156 {
9159 }
9161 /* Get the identifier. */
9166 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9167 delimiters, but I modified this to stop on unnested ']' as well. It
9168 was already changed to stop on unnested '}', so the
9169 "closing_parenthesis" name is no more misleading with my change. */
9170 {
9176 }
9178 /* Find the initializer for this capture. */
9182 {
9184 /* An explicit initializer exists. */
9187 "lambda capture initializers "
9193 {
9196 }
9197 }
9198 else
9199 {
9202 /* Turn the identifier into an id-expression. */
9203 capture_init_expr
9208 {
9211 }
9215 {
9218 capture_init_expr);
9221 }
9224 {
9227 capture_init_expr))
9230 }
9232 capture_init_expr
9233 = finish_id_expression
9235 capture_init_expr,
9249 {
9252 }
9253 else
9255 }
9259 {
9264 capture_id);
9268 "capture of %qD redundant with by-reference capture "
9270 }
9273 capture_id,
9274 capture_init_expr,
9276 explicit_init_p);
9277 }
9280 }
9282 /* Parse the (optional) middle of a lambda expression.
9284 lambda-declarator:
9285 < template-parameter-list [opt] >
9286 ( parameter-declaration-clause [opt] )
9287 attribute-specifier [opt]
9288 mutable [opt]
9289 exception-specification [opt]
9290 lambda-return-type-clause [opt]
9292 LAMBDA_EXPR is the current representation of the lambda expression. */
9294 static bool
9296 {
9297 /* 5.1.1.4 of the standard says:
9298 If a lambda-expression does not include a lambda-declarator, it is as if
9299 the lambda-declarator were ().
9300 This means an empty parameter list, no attributes, and no exception
9301 specification. */
9307 /* The template-parameter-list is optional, but must begin with
9308 an opening angle if present. */
9310 {
9313 "lambda templates are only available with "
9322 /* We just processed one more parameter list. */
9324 }
9326 /* The parameter-declaration-clause is optional (unless
9327 template-parameter-list was given), but must begin with an
9328 opening parenthesis if present. */
9330 {
9335 /* Parse parameters. */
9338 /* Default arguments shall not be specified in the
9339 parameter-declaration-clause of a lambda-declarator. */
9349 /* Parse optional `mutable' keyword. */
9351 {
9354 }
9356 /* Parse optional exception specification. */
9359 /* Parse optional trailing return type. */
9361 {
9365 }
9367 /* The function parameters must be in scope all the way until after the
9368 trailing-return-type in case of decltype. */
9370 }
9374 /* Create the function call operator.
9376 Messing with declarators like this is no uglier than building up the
9377 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9378 other code. */
9379 {
9380 cp_decl_specifier_seq return_type_specs;
9382 tree fco;
9389 else
9390 /* Maybe we will deduce the return type later. */
9396 sfk_none);
9401 VIRT_SPEC_UNSPECIFIED,
9402 REF_QUAL_NONE,
9403 exception_spec,
9408 declarator,
9409 attributes);
9411 {
9414 /* Give the object parameter a different name. */
9418 }
9420 {
9424 }
9433 }
9434 }
9436 /* Parse the body of a lambda expression, which is simply
9438 compound-statement
9440 but which requires special handling.
9441 LAMBDA_EXPR is the current representation of the lambda expression. */
9443 static void
9445 {
9450 else
9451 /* Still increment function_depth so that we don't GC in the
9452 middle of an expression. */
9454 /* Clear this in case we're in the middle of a default argument. */
9457 /* Finish the function call operator
9458 - class_specifier
9459 + late_parsing_for_member
9460 + function_definition_after_declarator
9461 + ctor_initializer_opt_and_function_body */
9462 {
9464 tree body;
9466 tree compound_stmt;
9467 tree cap;
9469 /* Let the front end know that we are going to be defining this
9470 function. */
9472 NULL_TREE,
9481 /* Push the proxies for any explicit captures. */
9488 /* 5.1.1.4 of the standard says:
9489 If a lambda-expression does not include a trailing-return-type, it
9490 is as if the trailing-return-type denotes the following type:
9491 * if the compound-statement is of the form
9492 { return attribute-specifier [opt] expression ; }
9493 the type of the returned expression after lvalue-to-rvalue
9494 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9495 (_conv.array_ 4.2), and function-to-pointer conversion
9496 (_conv.func_ 4.3);
9497 * otherwise, void. */
9499 /* In a lambda that has neither a lambda-return-type-clause
9500 nor a deducible form, errors should be reported for return statements
9501 in the body. Since we used void as the placeholder return type, parsing
9502 the body as usual will give such desired behavior. */
9506 {
9510 /* Parse tentatively in case there's more after the initial return
9511 statement. */
9522 {
9526 /* Will get error here if type not deduced yet. */
9530 }
9531 }
9534 {
9539 }
9543 out:
9547 /* Finish the function and generate code for it if necessary. */
9550 /* Only expand if the call op is not a template. */
9553 }
9558 else
9560 }
9562 /* Statements [gram.stmt.stmt] */
9564 /* Parse a statement.
9566 statement:
9567 labeled-statement
9568 expression-statement
9569 compound-statement
9570 selection-statement
9571 iteration-statement
9572 jump-statement
9573 declaration-statement
9574 try-block
9576 C++11:
9578 statement:
9579 labeled-statement
9580 attribute-specifier-seq (opt) expression-statement
9581 attribute-specifier-seq (opt) compound-statement
9582 attribute-specifier-seq (opt) selection-statement
9583 attribute-specifier-seq (opt) iteration-statement
9584 attribute-specifier-seq (opt) jump-statement
9585 declaration-statement
9586 attribute-specifier-seq (opt) try-block
9588 TM Extension:
9590 statement:
9591 atomic-statement
9593 IN_COMPOUND is true when the statement is nested inside a
9594 cp_parser_compound_statement; this matters for certain pragmas.
9596 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9597 is a (possibly labeled) if statement which is not enclosed in braces
9598 and has an else clause. This is used to implement -Wparentheses. */
9600 static void
9603 {
9608 restart:
9611 /* There is no statement yet. */
9617 /* In obj-c++, seeing '[[' might be the either the beginning of
9618 c++11 attributes, or a nested objc-message-expression. So
9619 let's parse the c++11 attributes tentatively. */
9623 {
9626 }
9628 /* Peek at the next token. */
9630 /* Remember the location of the first token in the statement. */
9632 /* If this is a keyword, then that will often determine what kind of
9633 statement we have. */
9635 {
9639 {
9642 /* Looks like a labeled-statement with a case label.
9643 Parse the label, and then use tail recursion to parse
9644 the statement. */
9661 {
9666 }
9667 else
9681 {
9686 }
9687 else
9688 {
9692 }
9696 /* Objective-C++ exception-handling constructs. */
9710 /* This must be a namespace alias definition. */
9723 /* It might be a keyword like `int' that can start a
9724 declaration-statement. */
9726 }
9727 }
9729 {
9730 /* If the next token is a `:', then we are looking at a
9731 labeled-statement. */
9734 {
9735 /* Looks like a labeled-statement with an ordinary label.
9736 Parse the label, and then use tail recursion to parse
9737 the statement. */
9741 }
9742 }
9743 /* Anything that starts with a `{' must be a compound-statement. */
9746 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9747 a statement all its own. */
9749 {
9750 /* Only certain OpenMP pragmas are attached to statements, and thus
9751 are considered statements themselves. All others are not. In
9752 the context of a compound, accept the pragma as a "statement" and
9753 return so that we can check for a close brace. Otherwise we
9754 require a real statement and must go back and read one. */
9760 }
9762 {
9765 }
9767 /* Everything else must be a declaration-statement or an
9768 expression-statement. Try for the declaration-statement
9769 first, unless we are looking at a `;', in which case we know that
9770 we have an expression-statement. */
9772 {
9774 {
9776 {
9777 /* Attributes should be parsed as part of the the
9778 declaration, so let's un-parse them. */
9781 }
9784 /* Try to parse the declaration-statement. */
9786 /* If that worked, we're done. */
9789 }
9790 /* Look for an expression-statement instead. */
9792 }
9794 /* Set the line number for the statement. */
9798 /* Note that for now, we don't do anything with c++11 statements
9799 parsed at this level. */
9802 OPT_Wattributes,
9804 }
9806 /* Parse the label for a labeled-statement, i.e.
9808 identifier :
9809 case constant-expression :
9810 default :
9812 GNU Extension:
9813 case constant-expression ... constant-expression : statement
9815 When a label is parsed without errors, the label is added to the
9816 parse tree by the finish_* functions, so this function doesn't
9817 have to return the label. */
9819 static void
9821 {
9826 /* The next token should be an identifier. */
9830 {
9833 }
9837 {
9839 {
9843 /* Consume the `case' token. */
9845 /* Parse the constant-expression. */
9852 {
9853 /* Consume the `...' token. */
9859 /* We don't need to emit warnings here, as the common code
9860 will do this for us. */
9861 }
9862 else
9867 else
9870 expr);
9871 }
9875 /* Consume the `default' token. */
9880 else
9885 /* Anything else must be an ordinary label. */
9888 }
9890 /* Require the `:' token. */
9893 /* An ordinary label may optionally be followed by attributes.
9894 However, this is only permitted if the attributes are then
9895 followed by a semicolon. This is because, for backward
9896 compatibility, when parsing
9897 lab: __attribute__ ((unused)) int i;
9898 we want the attribute to attach to "i", not "lab". */
9901 {
9902 tree attrs;
9909 ;
9910 else
9912 }
9918 }
9920 /* Parse an expression-statement.
9922 expression-statement:
9923 expression [opt] ;
9925 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9926 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9927 indicates whether this expression-statement is part of an
9928 expression statement. */
9930 static tree
9932 {
9936 /* If the next token is a ';', then there is no expression
9937 statement. */
9939 {
9943 {
9946 }
9947 }
9949 /* Give a helpful message for "A<T>::type t;" and the like. */
9952 {
9959 {
9960 /* A::A a; */
9965 }
9966 }
9968 /* Consume the final `;'. */
9973 /* This is the final expression statement of a statement
9974 expression. */
9980 }
9982 /* Parse a compound-statement.
9984 compound-statement:
9985 { statement-seq [opt] }
9987 GNU extension:
9989 compound-statement:
9990 { label-declaration-seq [opt] statement-seq [opt] }
9992 label-declaration-seq:
9993 label-declaration
9994 label-declaration-seq label-declaration
9996 Returns a tree representing the statement. */
9998 static tree
10001 {
10002 tree compound_stmt;
10004 /* Consume the `{'. */
10011 /* Begin the compound-statement. */
10013 /* If the next keyword is `__label__' we have a label declaration. */
10016 /* Parse an (optional) statement-seq. */
10018 /* Finish the compound-statement. */
10020 /* Consume the `}'. */
10024 }
10026 /* Parse an (optional) statement-seq.
10028 statement-seq:
10029 statement
10030 statement-seq [opt] statement */
10032 static void
10034 {
10035 /* Scan statements until there aren't any more. */
10037 {
10040 /* If we are looking at a `}', then we have run out of
10041 statements; the same is true if we have reached the end
10042 of file, or have stumbled upon a stray '@end'. */
10049 /* If we are in a compound statement and find 'else' then
10050 something went wrong. */
10052 {
10055 else
10056 {
10059 }
10060 }
10062 /* Parse the statement. */
10064 }
10065 }
10067 /* Parse a selection-statement.
10069 selection-statement:
10070 if ( condition ) statement
10071 if ( condition ) statement else statement
10072 switch ( condition ) statement
10074 Returns the new IF_STMT or SWITCH_STMT.
10076 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10077 is a (possibly labeled) if statement which is not enclosed in
10078 braces and has an else clause. This is used to implement
10079 -Wparentheses. */
10081 static tree
10083 {
10090 /* Peek at the next token. */
10093 /* See what kind of keyword it is. */
10096 {
10099 {
10100 tree statement;
10101 tree condition;
10103 /* Look for the `('. */
10105 {
10108 }
10110 /* Begin the selection-statement. */
10113 else
10116 /* Parse the condition. */
10118 /* Look for the `)'. */
10124 {
10128 /* Add the condition. */
10131 /* Parse the then-clause. */
10135 {
10143 }
10144 else
10150 /* If the next token is `else', parse the else-clause. */
10152 RID_ELSE))
10153 {
10154 /* Consume the `else' keyword. */
10157 /* Parse the else-clause. */
10159 {
10160 location_t loc;
10167 }
10168 else
10173 /* If we are currently parsing a then-clause, then
10174 IF_P will not be NULL. We set it to true to
10175 indicate that this if statement has an else clause.
10176 This may trigger the Wparentheses warning below
10177 when we get back up to the parent if statement. */
10180 }
10181 else
10182 {
10183 /* This if statement does not have an else clause. If
10184 NESTED_IF is true, then the then-clause is an if
10185 statement which does have an else clause. We warn
10186 about the potential ambiguity. */
10189 "suggest explicit braces to avoid ambiguous"
10191 }
10193 /* Now we're all done with the if-statement. */
10195 }
10196 else
10197 {
10201 /* Add the condition. */
10204 /* Parse the body of the switch-statement. */
10213 /* Now we're all done with the switch-statement. */
10215 }
10218 }
10224 }
10225 }
10227 /* Parse a condition.
10229 condition:
10230 expression
10231 type-specifier-seq declarator = initializer-clause
10232 type-specifier-seq declarator braced-init-list
10234 GNU Extension:
10236 condition:
10237 type-specifier-seq declarator asm-specification [opt]
10238 attributes [opt] = assignment-expression
10240 Returns the expression that should be tested. */
10242 static tree
10244 {
10245 cp_decl_specifier_seq type_specifiers;
10249 /* Try the declaration first. */
10251 /* New types are not allowed in the type-specifier-seq for a
10252 condition. */
10254 parser->type_definition_forbidden_message
10256 /* Parse the type-specifier-seq. */
10258 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10261 /* Restore the saved message. */
10263 /* If all is well, we might be looking at a declaration. */
10265 {
10266 tree decl;
10267 tree asm_specification;
10268 tree attributes;
10272 /* Parse the declarator. */
10278 /* Parse the attributes. */
10280 /* Parse the asm-specification. */
10282 /* If the next token is not an `=' or '{', then we might still be
10283 looking at an expression. For example:
10285 if (A(a).x)
10287 looks like a decl-specifier-seq and a declarator -- but then
10288 there is no `=', so this is an expression. */
10293 /* If we did see an `=' or '{', then we are looking at a declaration
10294 for sure. */
10296 {
10297 tree pushed_scope;
10301 /* Create the declaration. */
10307 /* Parse the initializer. */
10309 {
10313 }
10314 else
10315 {
10316 /* Consume the `='. */
10319 }
10323 /* Process the initializer. */
10326 asm_specification,
10327 flags);
10333 }
10334 }
10335 /* If we didn't even get past the declarator successfully, we are
10336 definitely not looking at a declaration. */
10337 else
10340 /* Otherwise, we are looking at an expression. */
10342 }
10344 /* Parses a for-statement or range-for-statement until the closing ')',
10345 not included. */
10347 static tree
10349 {
10353 /* Begin the for-statement. */
10356 /* Parse the initialization. */
10361 else
10363 }
10365 static tree
10367 {
10368 /* Normal for loop */
10371 tree stmt;
10374 /* The for-init-statement has already been parsed in
10375 cp_parser_for_init_statement, so no work is needed here. */
10378 /* If there's a condition, process it. */
10382 {
10386 }
10388 /* Look for the `;'. */
10391 /* If there's an expression, process it. */
10397 }
10399 /* Tries to parse a range-based for-statement:
10401 range-based-for:
10402 decl-specifier-seq declarator : expression
10404 The decl-specifier-seq declarator and the `:' are already parsed by
10405 cp_parser_for_init_statement. If processing_template_decl it returns a
10406 newly created RANGE_FOR_STMT; if not, it is converted to a
10407 regular FOR_STMT. */
10409 static tree
10412 {
10416 {
10419 }
10420 else
10423 /* If in template, STMT is converted to a normal for-statement
10424 at instantiation. If not, it is done just ahead. */
10426 {
10434 /* do_auto_deduction doesn't mess with template init-lists. */
10437 }
10438 else
10439 {
10442 }
10444 }
10446 /* Subroutine of cp_convert_range_for: given the initializer expression,
10447 builds up the range temporary. */
10449 static tree
10451 {
10454 /* Find out the type deduced by the declaration
10455 `auto &&__range = range_expr'. */
10460 /* Create the __range variable. */
10467 }
10469 /* Used by cp_parser_range_for in template context: we aren't going to
10470 do a full conversion yet, but we still need to resolve auto in the
10471 type of the for-range-declaration if present. This is basically
10472 a shortcut version of cp_convert_range_for. */
10474 static void
10476 {
10479 {
10482 iter_type = (cp_parser_perform_range_for_lookup
10485 {
10487 iter_type);
10489 tf_warning_or_error);
10492 }
10493 }
10494 }
10496 /* Converts a range-based for-statement into a normal
10497 for-statement, as per the definition.
10499 for (RANGE_DECL : RANGE_EXPR)
10500 BLOCK
10502 should be equivalent to:
10504 {
10505 auto &&__range = RANGE_EXPR;
10506 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10507 __begin != __end;
10508 ++__begin)
10509 {
10510 RANGE_DECL = *__begin;
10511 BLOCK
10512 }
10513 }
10515 If RANGE_EXPR is an array:
10516 BEGIN_EXPR = __range
10517 END_EXPR = __range + ARRAY_SIZE(__range)
10518 Else if RANGE_EXPR has a member 'begin' or 'end':
10519 BEGIN_EXPR = __range.begin()
10520 END_EXPR = __range.end()
10521 Else:
10522 BEGIN_EXPR = begin(__range)
10523 END_EXPR = end(__range);
10525 If __range has a member 'begin' but not 'end', or vice versa, we must
10526 still use the second alternative (it will surely fail, however).
10527 When calling begin()/end() in the third alternative we must use
10528 argument dependent lookup, but always considering 'std' as an associated
10529 namespace. */
10531 tree
10534 {
10540 /* If an error happened previously do nothing or else a lot of
10541 unhelpful errors would be issued. */
10543 else
10544 {
10545 tree range_temp;
10549 /* Can't bind a reference to an array of runtime bound. */
10551 else
10552 {
10557 LOOKUP_ONLYCONVERTING);
10559 }
10562 }
10564 /* The new for initialization statement. */
10572 LOOKUP_ONLYCONVERTING);
10581 LOOKUP_ONLYCONVERTING);
10585 /* The new for condition. */
10592 /* The new increment expression. */
10595 tf_warning_or_error);
10598 /* The declaration is initialized with *__begin inside the loop body. */
10601 tf_warning_or_error),
10603 LOOKUP_ONLYCONVERTING);
10606 }
10608 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10609 We need to solve both at the same time because the method used
10610 depends on the existence of members begin or end.
10611 Returns the type deduced for the iterator expression. */
10613 static tree
10615 {
10617 {
10620 }
10623 {
10628 }
10630 {
10631 /* If RANGE is an array, we will use pointer arithmetic. */
10634 range,
10638 }
10639 else
10640 {
10641 /* If it is not an array, we must do a bit of magic. */
10651 tf_warning_or_error);
10654 tf_warning_or_error);
10657 {
10658 /* Use the member functions. */
10661 else
10667 else
10670 }
10671 else
10672 {
10673 /* Use global functions with ADL. */
10680 tf_warning_or_error);
10682 tf_warning_or_error);
10684 tf_warning_or_error);
10686 tf_warning_or_error);
10689 }
10691 /* Last common checks. */
10693 {
10694 /* If one of the expressions is an error do no more checks. */
10697 }
10700 /* Can happen, when, eg, in a template context, Koenig lookup
10701 can't resolve begin/end (c++/58503). */
10703 else
10704 {
10706 /* The unqualified type of the __begin and __end temporaries should
10707 be the same, as required by the multiple auto declaration. */
10713 }
10714 }
10715 }
10717 /* Helper function for cp_parser_perform_range_for_lookup.
10718 Builds a tree for RANGE.IDENTIFIER(). */
10720 static tree
10722 {
10735 tf_warning_or_error);
10738 }
10740 /* Parse an iteration-statement.
10742 iteration-statement:
10743 while ( condition ) statement
10744 do statement while ( expression ) ;
10745 for ( for-init-statement condition [opt] ; expression [opt] )
10746 statement
10748 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10750 static tree
10752 {
10755 tree statement;
10758 /* Peek at the next token. */
10763 /* Remember whether or not we are already within an iteration
10764 statement. */
10767 /* See what kind of keyword it is. */
10770 {
10772 {
10773 tree condition;
10775 /* Begin the while-statement. */
10777 /* Look for the `('. */
10779 /* Parse the condition. */
10782 /* Look for the `)'. */
10784 /* Parse the dependent statement. */
10788 /* We're done with the while-statement. */
10790 }
10794 {
10795 tree expression;
10797 /* Begin the do-statement. */
10799 /* Parse the body of the do-statement. */
10804 /* Look for the `while' keyword. */
10806 /* Look for the `('. */
10808 /* Parse the expression. */
10810 /* We're done with the do-statement. */
10812 /* Look for the `)'. */
10814 /* Look for the `;'. */
10816 }
10820 {
10821 /* Look for the `('. */
10826 /* Look for the `)'. */
10829 /* Parse the body of the for-statement. */
10834 /* We're done with the for-statement. */
10836 }
10843 }
10846 }
10848 /* Parse a for-init-statement or the declarator of a range-based-for.
10849 Returns true if a range-based-for declaration is seen.
10851 for-init-statement:
10852 expression-statement
10853 simple-declaration */
10855 static bool
10857 {
10858 /* If the next token is a `;', then we have an empty
10859 expression-statement. Grammatically, this is also a
10860 simple-declaration, but an invalid one, because it does not
10861 declare anything. Therefore, if we did not handle this case
10862 specially, we would issue an error message about an invalid
10863 declaration. */
10865 {
10871 {
10872 /* N3994 -- for (id : init) ... */
10875 "type-specifier only available with "
10883 }
10885 /* A colon is used in range-based for. */
10888 /* We're going to speculatively look for a declaration, falling back
10889 to an expression, if necessary. */
10891 /* Parse the declaration. */
10894 decl);
10897 {
10898 /* It is a range-for, consume the ':' */
10902 {
10904 "range-based %<for%> loops only available with "
10907 }
10908 }
10909 else
10910 /* The ';' is not consumed yet because we told
10911 cp_parser_simple_declaration not to. */
10916 /* If the tentative parse failed, then we shall need to look for an
10917 expression-statement. */
10918 }
10919 /* If we are here, it is an expression-statement. */
10922 }
10924 /* Parse a jump-statement.
10926 jump-statement:
10927 break ;
10928 continue ;
10929 return expression [opt] ;
10930 return braced-init-list ;
10931 goto identifier ;
10933 GNU extension:
10935 jump-statement:
10936 goto * expression ;
10938 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10940 static tree
10942 {
10948 /* Peek at the next token. */
10953 /* See what kind of keyword it is. */
10956 {
10960 {
10980 }
10986 {
10993 /* Fall through. */
11003 }
11008 {
11009 tree expr;
11013 {
11017 }
11020 else
11021 /* If the next token is a `;', then there is no
11022 expression. */
11024 /* Build the return-statement. */
11026 /* Look for the final `;'. */
11028 }
11034 {
11037 }
11039 /* Create the goto-statement. */
11041 {
11042 /* Issue a warning about this use of a GNU extension. */
11044 /* Consume the '*' token. */
11046 /* Parse the dependent expression. */
11048 }
11049 else
11051 /* Look for the final `;'. */
11058 }
11061 }
11063 /* Parse a declaration-statement.
11065 declaration-statement:
11066 block-declaration */
11068 static void
11070 {
11073 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11076 /* Parse the block-declaration. */
11079 /* Free any declarators allocated. */
11081 }
11083 /* Some dependent statements (like `if (cond) statement'), are
11084 implicitly in their own scope. In other words, if the statement is
11085 a single statement (as opposed to a compound-statement), it is
11086 none-the-less treated as if it were enclosed in braces. Any
11087 declarations appearing in the dependent statement are out of scope
11088 after control passes that point. This function parses a statement,
11089 but ensures that is in its own scope, even if it is not a
11090 compound-statement.
11092 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11093 is a (possibly labeled) if statement which is not enclosed in
11094 braces and has an else clause. This is used to implement
11095 -Wparentheses.
11097 Returns the new statement. */
11099 static tree
11101 {
11102 tree statement;
11107 /* Mark if () ; with a special NOP_EXPR. */
11109 {
11113 }
11114 /* if a compound is opened, we simply parse the statement directly. */
11117 /* If the token is not a `{', then we must take special action. */
11118 else
11119 {
11120 /* Create a compound-statement. */
11122 /* Parse the dependent-statement. */
11124 /* Finish the dummy compound-statement. */
11126 }
11128 /* Return the statement. */
11130 }
11132 /* For some dependent statements (like `while (cond) statement'), we
11133 have already created a scope. Therefore, even if the dependent
11134 statement is a compound-statement, we do not want to create another
11135 scope. */
11137 static void
11139 {
11140 /* If the token is a `{', then we must take special action. */
11143 else
11144 {
11145 /* Avoid calling cp_parser_compound_statement, so that we
11146 don't create a new scope. Do everything else by hand. */
11148 /* If the next keyword is `__label__' we have a label declaration. */
11151 /* Parse an (optional) statement-seq. */
11154 }
11155 }
11157 /* Declarations [gram.dcl.dcl] */
11159 /* Parse an optional declaration-sequence.
11161 declaration-seq:
11162 declaration
11163 declaration-seq declaration */
11165 static void
11167 {
11169 {
11180 {
11181 /* A declaration consisting of a single semicolon is
11182 invalid. Allow it unless we're being pedantic. */
11187 }
11189 /* If we're entering or exiting a region that's implicitly
11190 extern "C", modify the lang context appropriately. */
11192 {
11195 }
11197 {
11200 }
11203 {
11204 /* A top-level declaration can consist solely of a #pragma.
11205 A nested declaration cannot, so this is done here and not
11206 in cp_parser_declaration. (A #pragma at block scope is
11207 handled in cp_parser_statement.) */
11210 }
11212 /* Parse the declaration itself. */
11214 }
11215 }
11217 /* Parse a declaration.
11219 declaration:
11220 block-declaration
11221 function-definition
11222 template-declaration
11223 explicit-instantiation
11224 explicit-specialization
11225 linkage-specification
11226 namespace-definition
11228 GNU extension:
11230 declaration:
11231 __extension__ declaration */
11233 static void
11235 {
11236 cp_token token1;
11237 cp_token token2;
11242 /* Check for the `__extension__' keyword. */
11244 {
11245 /* Parse the qualified declaration. */
11247 /* Restore the PEDANTIC flag. */
11251 }
11253 /* Try to figure out what kind of declaration is present. */
11258 else
11259 {
11262 }
11264 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11267 /* If the next token is `extern' and the following token is a string
11268 literal, then we have a linkage specification. */
11272 /* If the next token is `template', then we have either a template
11273 declaration, an explicit instantiation, or an explicit
11274 specialization. */
11276 {
11277 /* `template <>' indicates a template specialization. */
11281 /* `template <' indicates a template declaration. */
11284 /* Anything else must be an explicit instantiation. */
11285 else
11287 }
11288 /* If the next token is `export', then we have a template
11289 declaration. */
11292 /* If the next token is `extern', 'static' or 'inline' and the one
11293 after that is `template', we have a GNU extended explicit
11294 instantiation directive. */
11301 /* If the next token is `namespace', check for a named or unnamed
11302 namespace definition. */
11308 /* An unnamed namespace definition. */
11312 /* An inline (associated) namespace definition. */
11316 /* Objective-C++ declaration/definition. */
11323 /* We must have either a block declaration or a function
11324 definition. */
11325 else
11326 /* Try to parse a block-declaration, or a function-definition. */
11329 /* Free any declarators allocated. */
11331 }
11333 /* Parse a block-declaration.
11335 block-declaration:
11336 simple-declaration
11337 asm-definition
11338 namespace-alias-definition
11339 using-declaration
11340 using-directive
11342 GNU Extension:
11344 block-declaration:
11345 __extension__ block-declaration
11347 C++0x Extension:
11349 block-declaration:
11350 static_assert-declaration
11352 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11353 part of a declaration-statement. */
11355 static void
11358 {
11362 /* Check for the `__extension__' keyword. */
11364 {
11365 /* Parse the qualified declaration. */
11367 /* Restore the PEDANTIC flag. */
11371 }
11373 /* Peek at the next token to figure out which kind of declaration is
11374 present. */
11377 /* If the next keyword is `asm', we have an asm-definition. */
11379 {
11383 }
11384 /* If the next keyword is `namespace', we have a
11385 namespace-alias-definition. */
11388 /* If the next keyword is `using', we have a
11389 using-declaration, a using-directive, or an alias-declaration. */
11391 {
11396 /* If the token after `using' is `namespace', then we have a
11397 using-directive. */
11401 /* If the second token after 'using' is '=', then we have an
11402 alias-declaration. */
11408 /* Otherwise, it's a using-declaration. */
11409 else
11412 }
11413 /* If the next keyword is `__label__' we have a misplaced label
11414 declaration. */
11416 {
11420 /* If the next token is now a `;', consume it. */
11423 }
11424 /* If the next token is `static_assert' we have a static assertion. */
11427 /* Anything else must be a simple-declaration. */
11428 else
11431 }
11433 /* Parse a simple-declaration.
11435 simple-declaration:
11436 decl-specifier-seq [opt] init-declarator-list [opt] ;
11438 init-declarator-list:
11439 init-declarator
11440 init-declarator-list , init-declarator
11442 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11443 function-definition as a simple-declaration.
11445 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11446 parsed declaration if it is an uninitialized single declarator not followed
11447 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11448 if present, will not be consumed. */
11450 static void
11454 {
11455 cp_decl_specifier_seq decl_specifiers;
11462 /* Defer access checks until we know what is being declared; the
11463 checks for names appearing in the decl-specifier-seq should be
11464 done as if we were in the scope of the thing being declared. */
11467 /* Parse the decl-specifier-seq. We have to keep track of whether
11468 or not the decl-specifier-seq declares a named class or
11469 enumeration type, since that is the only case in which the
11470 init-declarator-list is allowed to be empty.
11472 [dcl.dcl]
11474 In a simple-declaration, the optional init-declarator-list can be
11475 omitted only when declaring a class or enumeration, that is when
11476 the decl-specifier-seq contains either a class-specifier, an
11477 elaborated-type-specifier, or an enum-specifier. */
11479 CP_PARSER_FLAGS_OPTIONAL,
11482 /* We no longer need to defer access checks. */
11485 /* In a block scope, a valid declaration must always have a
11486 decl-specifier-seq. By not trying to parse declarators, we can
11487 resolve the declaration/expression ambiguity more quickly. */
11490 {
11493 }
11495 /* If the next two tokens are both identifiers, the code is
11496 erroneous. The usual cause of this situation is code like:
11498 T t;
11500 where "T" should name a type -- but does not. */
11503 {
11504 /* If parsing tentatively, we should commit; we really are
11505 looking at a declaration. */
11507 /* Give up. */
11509 }
11511 /* If we have seen at least one decl-specifier, and the next token
11512 is not a parenthesis, then we must be looking at a declaration.
11513 (After "int (" we might be looking at a functional cast.) */
11520 /* Keep going until we hit the `;' at the end of the simple
11521 declaration. */
11524 CPP_SEMICOLON))
11525 {
11528 tree decl;
11531 {
11532 /* If we are processing next declarator, coma is expected */
11538 }
11539 else
11542 /* Parse the init-declarator. */
11545 function_definition_allowed_p,
11547 declares_class_or_enum,
11549 maybe_range_for_decl);
11550 /* If an error occurred while parsing tentatively, exit quickly.
11551 (That usually happens when in the body of a function; each
11552 statement is treated as a declaration-statement until proven
11553 otherwise.) */
11556 /* Handle function definitions specially. */
11558 {
11559 /* If the next token is a `,', then we are probably
11560 processing something like:
11562 void f() {}, *p;
11564 which is erroneous. */
11566 {
11569 "mixing"
11571 }
11572 /* Otherwise, we're done with the list of declarators. */
11573 else
11574 {
11577 }
11578 }
11581 /* The next token should be either a `,' or a `;'. */
11583 /* If it's a `,', there are more declarators to come. */
11586 /* If it's a `;', we are done. */
11589 /* Anything else is an error. */
11590 else
11591 {
11592 /* If we have already issued an error message we don't need
11593 to issue another one. */
11597 /* Skip tokens until we reach the end of the statement. */
11599 /* If the next token is now a `;', consume it. */
11603 }
11604 /* After the first time around, a function-definition is not
11605 allowed -- even if it was OK at first. For example:
11607 int i, f() {}
11609 is not valid. */
11611 }
11613 /* Issue an error message if no declarators are present, and the
11614 decl-specifier-seq does not itself declare a class or
11615 enumeration: [dcl.dcl]/3. */
11617 {
11619 {
11623 /* Ensure an error is issued anyway when finish_decltype_type,
11624 called via cp_parser_decl_specifier_seq, returns a class or
11625 an enumeration (c++/51786). */
11628 }
11629 /* Perform any deferred access checks. */
11631 }
11633 /* Consume the `;'. */
11637 done:
11639 }
11641 /* Parse a decl-specifier-seq.
11643 decl-specifier-seq:
11644 decl-specifier-seq [opt] decl-specifier
11645 decl-specifier attribute-specifier-seq [opt] (C++11)
11647 decl-specifier:
11648 storage-class-specifier
11649 type-specifier
11650 function-specifier
11651 friend
11652 typedef
11654 GNU Extension:
11656 decl-specifier:
11657 attributes
11659 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11661 The parser flags FLAGS is used to control type-specifier parsing.
11663 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11664 flags:
11666 1: one of the decl-specifiers is an elaborated-type-specifier
11667 (i.e., a type declaration)
11668 2: one of the decl-specifiers is an enum-specifier or a
11669 class-specifier (i.e., a type definition)
11671 */
11673 static void
11675 cp_parser_flags flags,
11678 {
11682 cp_decl_spec ds;
11684 /* Clear DECL_SPECS. */
11687 /* Assume no class or enumeration type is declared. */
11690 /* Keep reading specifiers until there are no more to read. */
11692 {
11697 /* Peek at the next token. */
11700 /* Save the first token of the decl spec list for error
11701 reporting. */
11704 /* Handle attributes. */
11706 {
11707 /* Parse the attributes. */
11710 /* In a sequence of declaration specifiers, c++11 attributes
11711 appertain to the type that precede them. In that case
11712 [dcl.spec]/1 says:
11714 The attribute-specifier-seq affects the type only for
11715 the declaration it appears in, not other declarations
11716 involving the same type.
11718 But for now let's force the user to position the
11719 attribute either at the beginning of the declaration or
11720 after the declarator-id, which would clearly mean that it
11721 applies to the declarator. */
11723 {
11725 /* The c++11 attribute is at the beginning of the
11726 declaration. It appertains to the entity being
11728 else
11729 {
11731 {
11732 /* This is an attribute following a
11733 class-specifier. */
11738 }
11739 else
11740 {
11741 decl_specs->std_attributes
11743 attrs);
11746 }
11748 }
11749 }
11751 decl_specs->attributes
11753 attrs);
11757 }
11758 /* Assume we will find a decl-specifier keyword. */
11760 /* If the next token is an appropriate keyword, we can simply
11761 add it to the list. */
11763 {
11764 /* decl-specifier:
11765 friend
11766 constexpr */
11769 {
11772 }
11773 else
11774 {
11776 /* Consume the token. */
11778 }
11786 /* function-specifier:
11787 inline
11788 virtual
11789 explicit */
11796 /* decl-specifier:
11797 typedef */
11800 /* Consume the token. */
11802 /* A constructor declarator cannot appear in a typedef. */
11804 /* The "typedef" keyword can only occur in a declaration; we
11805 may as well commit at this point. */
11812 /* storage-class-specifier:
11813 auto
11814 register
11815 static
11816 extern
11817 mutable
11819 GNU Extension:
11820 thread */
11823 {
11824 /* Consume the token. */
11827 /* Complain about `auto' as a storage specifier, if
11828 we're complaining about C++0x compatibility. */
11832 /* Set the storage class anyway. */
11834 token);
11835 }
11836 else
11837 /* C++0x auto type-specifier. */
11845 /* Consume the token. */
11848 token);
11851 /* Consume the token. */
11857 /* We did not yet find a decl-specifier yet. */
11860 }
11870 /* Constructors are a special case. The `S' in `S()' is not a
11871 decl-specifier; it is the beginning of the declarator. */
11872 constructor_p
11873 = (!found_decl_spec
11874 && constructor_possible_p
11875 && (cp_parser_constructor_declarator_p
11878 /* If we don't have a DECL_SPEC yet, then we must be looking at
11879 a type-specifier. */
11881 {
11884 tree type_spec;
11886 type_spec
11888 decl_specs,
11894 /* If this type-specifier referenced a user-defined type
11895 (a typedef, class-name, etc.), then we can't allow any
11896 more such type-specifiers henceforth.
11898 [dcl.spec]
11900 The longest sequence of decl-specifiers that could
11901 possibly be a type name is taken as the
11902 decl-specifier-seq of a declaration. The sequence shall
11903 be self-consistent as described below.
11905 [dcl.type]
11907 As a general rule, at most one type-specifier is allowed
11908 in the complete decl-specifier-seq of a declaration. The
11909 only exceptions are the following:
11911 -- const or volatile can be combined with any other
11912 type-specifier.
11914 -- signed or unsigned can be combined with char, long,
11915 short, or int.
11917 -- ..
11919 Example:
11921 typedef char* Pc;
11922 void g (const int Pc);
11924 Here, Pc is *not* part of the decl-specifier seq; it's
11925 the declarator. Therefore, once we see a type-specifier
11926 (other than a cv-qualifier), we forbid any additional
11927 user-defined types. We *do* still allow things like `int
11928 int' to be considered a decl-specifier-seq, and issue the
11929 error message later. */
11932 /* A constructor declarator cannot follow a type-specifier. */
11934 {
11939 }
11940 }
11942 /* If we still do not have a DECL_SPEC, then there are no more
11943 decl-specifiers. */
11948 /* After we see one decl-specifier, further decl-specifiers are
11949 always optional. */
11951 }
11953 /* Don't allow a friend specifier with a class definition. */
11958 }
11960 /* Parse an (optional) storage-class-specifier.
11962 storage-class-specifier:
11963 auto
11964 register
11965 static
11966 extern
11967 mutable
11969 GNU Extension:
11971 storage-class-specifier:
11972 thread
11974 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11976 static tree
11978 {
11980 {
11984 /* Fall through for C++98. */
11991 /* Consume the token. */
11996 }
11997 }
11999 /* Parse an (optional) function-specifier.
12001 function-specifier:
12002 inline
12003 virtual
12004 explicit
12006 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12007 Updates DECL_SPECS, if it is non-NULL. */
12009 static tree
12012 {
12015 {
12021 /* 14.5.2.3 [temp.mem]
12023 A member function template shall not be virtual. */
12026 else
12036 }
12038 /* Consume the token. */
12040 }
12042 /* Parse a linkage-specification.
12044 linkage-specification:
12045 extern string-literal { declaration-seq [opt] }
12046 extern string-literal declaration */
12048 static void
12050 {
12051 tree linkage;
12053 /* Look for the `extern' keyword. */
12056 /* Look for the string-literal. */
12059 /* Transform the literal into an identifier. If the literal is a
12060 wide-character string, or contains embedded NULs, then we can't
12061 handle it as the user wants. */
12064 {
12066 /* Assume C++ linkage. */
12068 }
12069 else
12072 /* We're now using the new linkage. */
12075 /* If the next token is a `{', then we're using the first
12076 production. */
12078 {
12081 /* Consume the `{' token. */
12083 /* Parse the declarations. */
12085 /* Look for the closing `}'. */
12087 }
12088 /* Otherwise, there's just one declaration. */
12089 else
12090 {
12093 saved_in_unbraced_linkage_specification_p
12097 parser->in_unbraced_linkage_specification_p
12099 }
12101 /* We're done with the linkage-specification. */
12103 }
12105 /* Parse a static_assert-declaration.
12107 static_assert-declaration:
12108 static_assert ( constant-expression , string-literal ) ;
12110 If MEMBER_P, this static_assert is a class member. */
12112 static void
12114 {
12115 tree condition;
12116 tree message;
12118 location_t saved_loc;
12121 /* Peek at the `static_assert' token so we can keep track of exactly
12122 where the static assertion started. */
12126 /* Look for the `static_assert' keyword. */
12128 RT_STATIC_ASSERT))
12131 /* We know we are in a static assertion; commit to any tentative
12132 parse. */
12136 /* Parse the `(' starting the static assertion condition. */
12139 /* Parse the constant-expression. Allow a non-constant expression
12140 here in order to give better diagnostics in finish_static_assert. */
12141 condition =
12146 /* Parse the separating `,'. */
12149 /* Parse the string-literal message. */
12154 /* A `)' completes the static assertion. */
12161 /* A semicolon terminates the declaration. */
12164 /* Complete the static assertion, which may mean either processing
12165 the static assert now or saving it for template instantiation. */
12167 }
12169 /* Parse the expression in decltype ( expression ). */
12171 static tree
12174 {
12176 tree expr;
12178 /* First, try parsing an id-expression. */
12189 {
12192 cp_id_kind idk;
12196 /* Lookup the name we got back from the id-expression. */
12206 {
12207 /* Complete lookup of the id-expression. */
12208 expr = (finish_id_expression
12221 /* We found an id-expression, but it was something that we
12222 should not have found. This is an error, not something
12223 we can recover from, so note that we found an
12224 id-expression and we'll recover as gracefully as
12225 possible. */
12227 }
12232 /* We have an id-expression. */
12234 }
12237 {
12238 /* Abort the id-expression parse. */
12241 /* Parsing tentatively, again. */
12244 /* Parse a class member access. */
12252 /* We have an id-expression. */
12254 }
12257 /* We have parsed the complete id-expression or member access. */
12259 else
12260 {
12261 /* Abort our attempt to parse an id-expression or member access
12262 expression. */
12265 /* Parse a full expression. */
12268 }
12271 }
12273 /* Parse a `decltype' type. Returns the type.
12275 simple-type-specifier:
12276 decltype ( expression )
12277 C++14 proposal:
12278 decltype ( auto ) */
12280 static tree
12282 {
12283 tree expr;
12292 {
12293 /* Already parsed. */
12296 }
12298 /* Look for the `decltype' token. */
12302 /* Parse the opening `('. */
12306 /* decltype (auto) */
12309 {
12316 }
12318 /* Types cannot be defined in a `decltype' expression. Save away the
12319 old message. */
12322 /* And create the new one. */
12323 parser->type_definition_forbidden_message
12326 /* The restrictions on constant-expressions do not apply inside
12327 decltype expressions. */
12328 saved_integral_constant_expression_p
12330 saved_non_integral_constant_expression_p
12334 /* Within a parenthesized expression, a `>' token is always
12335 the greater-than operator. */
12336 saved_greater_than_is_operator_p
12340 /* Do not actually evaluate the expression. */
12343 /* Do not warn about problems with the expression. */
12348 /* Go back to evaluating expressions. */
12352 /* The `>' token might be the end of a template-id or
12353 template-parameter-list now. */
12354 parser->greater_than_is_operator_p
12357 /* Restore the old message and the integral constant expression
12358 flags. */
12360 parser->integral_constant_expression_p
12362 parser->non_integral_constant_expression_p
12365 /* Parse to the closing `)'. */
12367 {
12371 }
12374 tf_warning_or_error);
12376 rewrite:
12377 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12378 it again. */
12385 }
12387 /* Special member functions [gram.special] */
12389 /* Parse a conversion-function-id.
12391 conversion-function-id:
12392 operator conversion-type-id
12394 Returns an IDENTIFIER_NODE representing the operator. */
12396 static tree
12398 {
12399 tree type;
12400 tree saved_scope;
12401 tree saved_qualifying_scope;
12402 tree saved_object_scope;
12405 /* Look for the `operator' token. */
12408 /* When we parse the conversion-type-id, the current scope will be
12409 reset. However, we need that information in able to look up the
12410 conversion function later, so we save it here. */
12414 /* We must enter the scope of the class so that the names of
12415 entities declared within the class are available in the
12416 conversion-type-id. For example, consider:
12418 struct S {
12419 typedef int I;
12420 operator I();
12421 };
12423 S::operator I() { ... }
12425 In order to see that `I' is a type-name in the definition, we
12426 must be in the scope of `S'. */
12429 /* Parse the conversion-type-id. */
12431 /* Leave the scope of the class, if any. */
12434 /* Restore the saved scope. */
12438 /* If the TYPE is invalid, indicate failure. */
12442 }
12444 /* Parse a conversion-type-id:
12446 conversion-type-id:
12447 type-specifier-seq conversion-declarator [opt]
12449 Returns the TYPE specified. */
12451 static tree
12453 {
12454 tree attributes;
12455 cp_decl_specifier_seq type_specifiers;
12457 tree type_specified;
12460 /* Parse the attributes. */
12464 parser->type_definition_forbidden_message
12467 /* Parse the type-specifiers. */
12474 /* If that didn't work, stop. */
12477 /* Parse the conversion-declarator. */
12485 /* Don't give this error when parsing tentatively. This happens to
12486 work because we always parse this definitively once. */
12489 {
12491 {
12494 }
12498 }
12501 }
12503 /* Parse an (optional) conversion-declarator.
12505 conversion-declarator:
12506 ptr-operator conversion-declarator [opt]
12508 */
12512 {
12515 cp_cv_quals cv_quals;
12517 /* We don't know if there's a ptr-operator next, or not. */
12519 /* Try the ptr-operator. */
12522 /* If it worked, look for more conversion-declarators. */
12524 {
12527 /* Parse another optional declarator. */
12530 declarator = cp_parser_make_indirect_declarator
12534 }
12537 }
12539 /* Parse an (optional) ctor-initializer.
12541 ctor-initializer:
12542 : mem-initializer-list
12544 Returns TRUE iff the ctor-initializer was actually present. */
12546 static bool
12548 {
12549 /* If the next token is not a `:', then there is no
12550 ctor-initializer. */
12552 {
12553 /* Do default initialization of any bases and members. */
12558 }
12560 /* Consume the `:' token. */
12562 /* And the mem-initializer-list. */
12566 }
12568 /* Parse a mem-initializer-list.
12570 mem-initializer-list:
12571 mem-initializer ... [opt]
12572 mem-initializer ... [opt] , mem-initializer-list */
12574 static void
12576 {
12581 /* Let the semantic analysis code know that we are starting the
12582 mem-initializer-list. */
12587 /* Loop through the list. */
12589 {
12590 tree mem_initializer;
12593 /* Parse the mem-initializer. */
12595 /* If the next token is a `...', we're expanding member initializers. */
12597 {
12598 /* Consume the `...'. */
12601 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12602 can be expanded but members cannot. */
12605 {
12610 }
12612 /* Construct the pack expansion type. */
12615 }
12618 {
12622 }
12623 /* Look for a target constructor. */
12627 {
12630 {
12634 }
12636 }
12637 /* Add it to the list, unless it was erroneous. */
12639 {
12642 }
12643 /* If the next token is not a `,', we're done. */
12646 /* Consume the `,' token. */
12648 }
12650 /* Perform semantic analysis. */
12653 }
12655 /* Parse a mem-initializer.
12657 mem-initializer:
12658 mem-initializer-id ( expression-list [opt] )
12659 mem-initializer-id braced-init-list
12661 GNU extension:
12663 mem-initializer:
12664 ( expression-list [opt] )
12666 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12667 class) or FIELD_DECL (for a non-static data member) to initialize;
12668 the TREE_VALUE is the expression-list. An empty initialization
12669 list is represented by void_list_node. */
12671 static tree
12673 {
12674 tree mem_initializer_id;
12675 tree expression_list;
12676 tree member;
12679 /* Find out what is being initialized. */
12681 {
12685 }
12686 else
12687 {
12691 }
12697 {
12704 }
12705 else
12706 {
12716 }
12726 }
12728 /* Parse a mem-initializer-id.
12730 mem-initializer-id:
12731 :: [opt] nested-name-specifier [opt] class-name
12732 identifier
12734 Returns a TYPE indicating the class to be initializer for the first
12735 production. Returns an IDENTIFIER_NODE indicating the data member
12736 to be initialized for the second production. */
12738 static tree
12740 {
12744 tree id;
12748 /* `typename' is not allowed in this context ([temp.res]). */
12750 {
12752 "keyword %<typename%> not allowed in this context (a qualified "
12755 }
12756 /* Look for the optional `::' operator. */
12757 global_scope_p
12761 /* Look for the optional nested-name-specifier. The simplest way to
12762 implement:
12764 [temp.res]
12766 The keyword `typename' is not permitted in a base-specifier or
12767 mem-initializer; in these contexts a qualified name that
12768 depends on a template-parameter is implicitly assumed to be a
12769 type name.
12771 is to assume that we have seen the `typename' keyword at this
12772 point. */
12773 nested_name_specifier_p
12782 /* If there is a `::' operator or a nested-name-specifier, then we
12783 are definitely looking for a class-name. */
12788 typename_type,
12792 /* Otherwise, we could also be looking for an ordinary identifier. */
12794 /* Try a class-name. */
12798 none_type,
12802 /* If we found one, we're done. */
12805 /* Otherwise, look for an ordinary identifier. */
12807 }
12809 /* Overloading [gram.over] */
12811 /* Parse an operator-function-id.
12813 operator-function-id:
12814 operator operator
12816 Returns an IDENTIFIER_NODE for the operator which is a
12817 human-readable spelling of the identifier, e.g., `operator +'. */
12819 static tree
12821 {
12822 /* Look for the `operator' keyword. */
12825 /* And then the name of the operator itself. */
12827 }
12829 /* Return an identifier node for a user-defined literal operator.
12830 The suffix identifier is chained to the operator name identifier. */
12832 static tree
12834 {
12835 tree identifier;
12842 }
12844 /* Parse an operator.
12846 operator:
12847 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12848 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12849 || ++ -- , ->* -> () []
12851 GNU Extensions:
12853 operator:
12854 <? >? <?= >?=
12856 Returns an IDENTIFIER_NODE for the operator which is a
12857 human-readable spelling of the identifier, e.g., `operator +'. */
12859 static tree
12861 {
12866 /* Peek at the next token. */
12868 /* Figure out which operator we have. */
12870 {
12872 {
12875 /* The keyword should be either `new' or `delete'. */
12880 else
12883 /* Consume the `new' or `delete' token. */
12886 /* Peek at the next token. */
12888 /* If it's a `[' token then this is the array variant of the
12889 operator. */
12891 {
12892 /* Consume the `[' token. */
12894 /* Look for the `]' token. */
12898 }
12899 /* Otherwise, we have the non-array variant. */
12900 else
12904 }
13051 /* Consume the `('. */
13053 /* Look for the matching `)'. */
13058 /* Consume the `['. */
13060 /* Look for the matching `]'. */
13075 {
13082 /* Consume the string. */
13088 {
13091 }
13092 else
13093 {
13095 /* Look for the suffix identifier. */
13100 {
13104 }
13105 else
13106 {
13109 }
13110 }
13115 {
13118 }
13121 {
13124 }
13126 {
13129 }
13131 }
13134 /* Anything else is an error. */
13136 }
13138 /* If we have selected an identifier, we need to consume the
13139 operator token. */
13142 /* Otherwise, no valid operator name was present. */
13143 else
13144 {
13147 }
13150 }
13152 /* Parse a template-declaration.
13154 template-declaration:
13155 export [opt] template < template-parameter-list > declaration
13157 If MEMBER_P is TRUE, this template-declaration occurs within a
13158 class-specifier.
13160 The grammar rule given by the standard isn't correct. What
13161 is really meant is:
13163 template-declaration:
13164 export [opt] template-parameter-list-seq
13165 decl-specifier-seq [opt] init-declarator [opt] ;
13166 export [opt] template-parameter-list-seq
13167 function-definition
13169 template-parameter-list-seq:
13170 template-parameter-list-seq [opt]
13171 template < template-parameter-list > */
13173 static void
13175 {
13176 /* Check for `export'. */
13178 {
13179 /* Consume the `export' token. */
13181 /* Warn that we do not support `export'. */
13183 }
13186 }
13188 /* Parse a template-parameter-list.
13190 template-parameter-list:
13191 template-parameter
13192 template-parameter-list , template-parameter
13194 Returns a TREE_LIST. Each node represents a template parameter.
13195 The nodes are connected via their TREE_CHAINs. */
13197 static tree
13199 {
13204 /* The loop below parses the template parms. We first need to know
13205 the total number of template parms to be able to compute proper
13206 canonical types of each dependent type. So after the loop, when
13207 we know the total number of template parms,
13208 end_template_parm_list computes the proper canonical types and
13209 fixes up the dependent types accordingly. */
13211 {
13212 tree parameter;
13215 location_t parm_loc;
13217 /* Parse the template-parameter. */
13222 /* Add it to the list. */
13225 parm_loc,
13226 parameter,
13227 is_non_type,
13228 is_parameter_pack);
13229 else
13230 {
13233 }
13235 /* If the next token is not a `,', we're done. */
13238 /* Otherwise, consume the `,' token. */
13240 }
13243 }
13245 /* Parse a template-parameter.
13247 template-parameter:
13248 type-parameter
13249 parameter-declaration
13251 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13252 the parameter. The TREE_PURPOSE is the default value, if any.
13253 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13254 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13255 set to true iff this parameter is a parameter pack. */
13257 static tree
13260 {
13264 tree parm;
13266 /* Assume it is a type parameter or a template parameter. */
13268 /* Assume it not a parameter pack. */
13270 /* Peek at the next token. */
13272 /* If it is `class' or `template', we have a type-parameter. */
13275 /* If it is `class' or `typename' we do not know yet whether it is a
13276 type parameter or a non-type parameter. Consider:
13278 template <typename T, typename T::X X> ...
13280 or:
13282 template <class C, class D*> ...
13284 Here, the first parameter is a type parameter, and the second is
13285 a non-type parameter. We can tell by looking at the token after
13286 the identifier -- if it is a `,', `=', or `>' then we have a type
13287 parameter. */
13289 {
13290 /* Peek at the token after `class' or `typename'. */
13292 /* If it's an ellipsis, we have a template type parameter
13293 pack. */
13296 /* If it's an identifier, skip it. */
13299 /* Now, see if the token looks like the end of a template
13300 parameter. */
13305 }
13307 /* Otherwise, it is a non-type parameter.
13309 [temp.param]
13311 When parsing a default template-argument for a non-type
13312 template-parameter, the first non-nested `>' is taken as the end
13313 of the template parameter-list rather than a greater-than
13314 operator. */
13316 parameter_declarator
13323 /* If the parameter declaration is marked as a parameter pack, set
13324 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13325 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13326 grokdeclarator. */
13329 {
13332 }
13335 {
13336 /* Can happen in some cases of erroneous input (c++/34892). */
13338 /* Consume the `...' for better error recovery. */
13340 }
13341 /* If the next token is an ellipsis, and we don't already have it
13342 marked as a parameter pack, then we have a parameter pack (that
13343 has no declarator). */
13346 && (declarator_can_be_parameter_pack
13348 {
13349 /* Consume the `...'. */
13354 }
13355 /* We might end up with a pack expansion as the type of the non-type
13356 template parameter, in which case this is a non-type template
13357 parameter pack. */
13360 {
13364 }
13367 {
13368 /* Parameter packs cannot have default arguments. However, a
13369 user may try to do so, so we'll parse them and give an
13370 appropriate diagnostic here. */
13374 /* Find the name of the parameter pack. */
13383 else
13387 /* Parse the default argument, but throw away the result. */
13389 }
13399 }
13401 /* Parse a type-parameter.
13403 type-parameter:
13404 class identifier [opt]
13405 class identifier [opt] = type-id
13406 typename identifier [opt]
13407 typename identifier [opt] = type-id
13408 template < template-parameter-list > class identifier [opt]
13409 template < template-parameter-list > class identifier [opt]
13410 = id-expression
13412 GNU Extension (variadic templates):
13414 type-parameter:
13415 class ... identifier [opt]
13416 typename ... identifier [opt]
13418 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13419 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13420 the declaration of the parameter.
13422 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13424 static tree
13426 {
13428 tree parameter;
13430 /* Look for a keyword to tell us what kind of parameter this is. */
13436 {
13439 {
13440 tree identifier;
13441 tree default_argument;
13443 /* If the next token is an ellipsis, we have a template
13444 argument pack. */
13446 {
13447 /* Consume the `...' token. */
13452 }
13454 /* If the next token is an identifier, then it names the
13455 parameter. */
13458 else
13461 /* Create the parameter. */
13464 /* If the next token is an `=', we have a default argument. */
13466 {
13467 /* Consume the `=' token. */
13469 /* Parse the default-argument. */
13473 /* Template parameter packs cannot have default
13474 arguments. */
13476 {
13479 "template parameter pack %qD cannot have a "
13481 else
13483 "template parameter packs cannot have "
13486 }
13488 }
13489 else
13492 /* Create the combined representation of the parameter and the
13493 default argument. */
13495 }
13499 {
13500 tree identifier;
13501 tree default_argument;
13503 /* Look for the `<'. */
13505 /* Parse the template-parameter-list. */
13507 /* Look for the `>'. */
13509 /* Look for the `class' or 'typename' keywords. */
13511 /* If the next token is an ellipsis, we have a template
13512 argument pack. */
13514 {
13515 /* Consume the `...' token. */
13520 }
13521 /* If the next token is an `=', then there is a
13522 default-argument. If the next token is a `>', we are at
13523 the end of the parameter-list. If the next token is a `,',
13524 then we are at the end of this parameter. */
13528 {
13530 /* Treat invalid names as if the parameter were nameless. */
13533 }
13534 else
13537 /* Create the template parameter. */
13539 identifier);
13541 /* If the next token is an `=', then there is a
13542 default-argument. */
13544 {
13547 /* Consume the `='. */
13549 /* Parse the id-expression. */
13551 /* save token before parsing the id-expression, for error
13552 reporting */
13554 default_argument
13562 /* If the id-expression was a template-id that refers to
13563 a template-class, we already have the declaration here,
13564 so no further lookup is needed. */
13565 ;
13566 else
13567 /* Look up the name. */
13568 default_argument
13570 none_type,
13576 /* See if the default argument is valid. */
13577 default_argument
13580 /* Template parameter packs cannot have default
13581 arguments. */
13583 {
13586 "template parameter pack %qD cannot "
13588 identifier);
13589 else
13593 }
13595 }
13596 else
13599 /* Create the combined representation of the parameter and the
13600 default argument. */
13602 }
13608 }
13611 }
13613 /* Parse a template-id.
13615 template-id:
13616 template-name < template-argument-list [opt] >
13618 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13619 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13620 returned. Otherwise, if the template-name names a function, or set
13621 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13622 names a class, returns a TYPE_DECL for the specialization.
13624 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13625 uninstantiated templates. */
13627 static tree
13633 {
13635 tree templ;
13636 tree arguments;
13637 tree template_id;
13644 /* If the next token corresponds to a template-id, there is no need
13645 to reparse it. */
13648 {
13651 /* Get the stored value. */
13653 /* Perform any access checks that were deferred. */
13656 {
13661 tf_warning_or_error);
13662 }
13663 /* Return the stored value. */
13665 }
13667 /* Avoid performing name lookup if there is no possibility of
13668 finding a template-id. */
13671 && !cp_parser_nth_token_starts_template_argument_list_p
13673 {
13676 }
13678 /* Remember where the template-id starts. */
13684 /* Parse the template-name. */
13687 check_dependency_p,
13688 is_declaration,
13689 tag_type,
13692 {
13695 }
13697 /* If we find the sequence `[:' after a template-name, it's probably
13698 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13699 parse correctly the argument list. */
13706 {
13708 /* Change `:' into `::'. */
13710 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13711 CPP_LESS. */
13714 /* Parse the arguments. */
13717 {
13718 /* If we couldn't parse an argument list, then we revert our changes
13719 and return simply an error. Maybe this is not a template-id
13720 after all. */
13725 }
13726 /* Otherwise, emit an error about the invalid digraph, but continue
13727 parsing because we got our argument list. */
13730 {
13733 "%<<:%> is an alternate spelling for %<[%>."
13736 {
13738 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13741 }
13742 }
13743 }
13744 else
13745 {
13746 /* Look for the `<' that starts the template-argument-list. */
13748 {
13751 }
13752 /* Parse the arguments. */
13754 }
13756 /* Build a representation of the specialization. */
13759 TEMPLATE_ID_EXPR,
13763 {
13765 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13766 template (rather than some instantiation thereof) only if
13767 is not nested within some other construct. For example, in
13768 "template <typename T> void f(T) { A<T>::", A<T> is just an
13769 instantiation of A. */
13772 CPP_SCOPE));
13773 template_id
13775 }
13777 {
13779 }
13780 else
13781 {
13782 /* If it's not a class-template or a template-template, it should be
13783 a function-template. */
13789 }
13791 /* If parsing tentatively, replace the sequence of tokens that makes
13792 up the template-id with a CPP_TEMPLATE_ID token. That way,
13793 should we re-parse the token stream, we will not have to repeat
13794 the effort required to do the parse, nor will we issue duplicate
13795 error messages about problems during instantiation of the
13796 template. */
13798 /* Don't do this if we had a parse error in a declarator; re-parsing
13799 might succeed if a name changes meaning (60361). */
13803 {
13806 /* Reset the contents of the START_OF_ID token. */
13808 /* Retrieve any deferred checks. Do not pop this access checks yet
13809 so the memory will not be reclaimed during token replacing below. */
13815 /* Purge all subsequent tokens. */
13818 /* ??? Can we actually assume that, if template_id ==
13819 error_mark_node, we will have issued a diagnostic to the
13820 user, as opposed to simply marking the tentative parse as
13821 failed? */
13824 }
13828 }
13830 /* Parse a template-name.
13832 template-name:
13833 identifier
13835 The standard should actually say:
13837 template-name:
13838 identifier
13839 operator-function-id
13841 A defect report has been filed about this issue.
13843 A conversion-function-id cannot be a template name because they cannot
13844 be part of a template-id. In fact, looking at this code:
13846 a.operator K<int>()
13848 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13849 It is impossible to call a templated conversion-function-id with an
13850 explicit argument list, since the only allowed template parameter is
13851 the type to which it is converting.
13853 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13854 `template' keyword, in a construction like:
13856 T::template f<3>()
13858 In that case `f' is taken to be a template-name, even though there
13859 is no way of knowing for sure.
13861 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13862 name refers to a set of overloaded functions, at least one of which
13863 is a template, or an IDENTIFIER_NODE with the name of the template,
13864 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13865 names are looked up inside uninstantiated templates. */
13867 static tree
13874 {
13875 tree identifier;
13876 tree decl;
13877 tree fns;
13880 /* If the next token is `operator', then we have either an
13881 operator-function-id or a conversion-function-id. */
13883 {
13884 /* We don't know whether we're looking at an
13885 operator-function-id or a conversion-function-id. */
13887 /* Try an operator-function-id. */
13889 /* If that didn't work, try a conversion-function-id. */
13891 {
13894 }
13895 }
13896 /* Look for the identifier. */
13897 else
13900 /* If we didn't find an identifier, we don't have a template-id. */
13904 /* If the name immediately followed the `template' keyword, then it
13905 is a template-name. However, if the next token is not `<', then
13906 we do not treat it as a template-name, since it is not being used
13907 as part of a template-id. This enables us to handle constructs
13908 like:
13910 template <typename T> struct S { S(); };
13911 template <typename T> S<T>::S();
13913 correctly. We would treat `S' as a template -- if it were `S<T>'
13914 -- but we do not if there is no `<'. */
13918 {
13919 /* In a declaration, in a dependent context, we pretend that the
13920 "template" keyword was present in order to improve error
13921 recovery. For example, given:
13923 template <typename T> void f(T::X<int>);
13925 we want to treat "X<int>" as a template-id. */
13927 && !template_keyword_p
13929 && check_dependency_p
13931 /* Do not do this for dtors (or ctors), since they never
13932 need the template keyword before their name. */
13934 {
13937 /* Explain what went wrong. */
13939 identifier);
13942 /* If parsing tentatively, find the location of the "<" token. */
13945 /* Parse the template arguments so that we can issue error
13946 messages about them. */
13949 /* Skip tokens until we find a good place from which to
13950 continue parsing. */
13955 /* If parsing tentatively, permanently remove the
13956 template argument list. That will prevent duplicate
13957 error messages from being issued about the missing
13958 "template" keyword. */
13964 }
13966 /* If the "template" keyword is present, then there is generally
13967 no point in doing name-lookup, so we just return IDENTIFIER.
13968 But, if the qualifying scope is non-dependent then we can
13969 (and must) do name-lookup normally. */
13975 }
13977 /* Look up the name. */
13979 tag_type,
13982 check_dependency_p,
13986 /* If DECL is a template, then the name was a template-name. */
13988 {
13992 }
13993 else
13994 {
13997 /* The standard does not explicitly indicate whether a name that
13998 names a set of overloaded declarations, some of which are
13999 templates, is a template-name. However, such a name should
14000 be a template-name; otherwise, there is no way to form a
14001 template-id for the overloaded templates. */
14009 {
14010 /* The name does not name a template. */
14013 }
14014 }
14016 /* If DECL is dependent, and refers to a function, then just return
14017 its name; we will look it up again during template instantiation. */
14019 {
14023 }
14026 }
14028 /* Parse a template-argument-list.
14030 template-argument-list:
14031 template-argument ... [opt]
14032 template-argument-list , template-argument ... [opt]
14034 Returns a TREE_VEC containing the arguments. */
14036 static tree
14038 {
14043 tree vec;
14050 /* Even if the template-id appears in an integral
14051 constant-expression, the contents of the argument list do
14052 not. */
14058 /* Parse the arguments. */
14059 do
14060 {
14061 tree argument;
14064 /* Consume the comma. */
14067 /* Parse the template-argument. */
14070 /* If the next token is an ellipsis, we're expanding a template
14071 argument pack. */
14073 {
14075 {
14079 }
14080 /* Consume the `...' token. */
14083 /* Make the argument into a TYPE_PACK_EXPANSION or
14084 EXPR_PACK_EXPANSION. */
14086 }
14089 {
14093 {
14096 }
14097 else
14099 }
14101 }
14114 #ifdef ENABLE_CHECKING
14116 #endif
14118 }
14120 /* Parse a template-argument.
14122 template-argument:
14123 assignment-expression
14124 type-id
14125 id-expression
14127 The representation is that of an assignment-expression, type-id, or
14128 id-expression -- except that the qualified id-expression is
14129 evaluated, so that the value returned is either a DECL or an
14130 OVERLOAD.
14132 Although the standard says "assignment-expression", it forbids
14133 throw-expressions or assignments in the template argument.
14134 Therefore, we use "conditional-expression" instead. */
14136 static tree
14138 {
14139 tree argument;
14145 cp_id_kind idk;
14147 /* There's really no way to know what we're looking at, so we just
14148 try each alternative in order.
14150 [temp.arg]
14152 In a template-argument, an ambiguity between a type-id and an
14153 expression is resolved to a type-id, regardless of the form of
14154 the corresponding template-parameter.
14156 Therefore, we try a type-id first. */
14159 /* If there was no error parsing the type-id but the next token is a
14160 '>>', our behavior depends on which dialect of C++ we're
14161 parsing. In C++98, we probably found a typo for '> >'. But there
14162 are type-id which are also valid expressions. For instance:
14164 struct X { int operator >> (int); };
14165 template <int V> struct Foo {};
14166 Foo<X () >> 5> r;
14168 Here 'X()' is a valid type-id of a function type, but the user just
14169 wanted to write the expression "X() >> 5". Thus, we remember that we
14170 found a valid type-id, but we still try to parse the argument as an
14171 expression to see what happens.
14173 In C++0x, the '>>' will be considered two separate '>'
14174 tokens. */
14178 {
14181 }
14182 else
14183 {
14184 /* If the next token isn't a `,' or a `>', then this argument wasn't
14185 really finished. This means that the argument is not a valid
14186 type-id. */
14189 /* If that worked, we're done. */
14192 }
14193 /* We're still not sure what the argument will be. */
14195 /* Try a template. */
14203 /* If the next token isn't a `,' or a `>', then this argument wasn't
14204 really finished. */
14208 {
14209 /* Figure out what is being referred to. If the id-expression
14210 was for a class template specialization, then we will have a
14211 TYPE_DECL at this point. There is no need to do name lookup
14212 at this point in that case. */
14215 none_type,
14224 }
14226 {
14230 }
14231 /* It must be a non-type argument. There permitted cases are given
14232 in [temp.arg.nontype]:
14234 -- an integral constant-expression of integral or enumeration
14235 type; or
14237 -- the name of a non-type template-parameter; or
14239 -- the name of an object or function with external linkage...
14241 -- the address of an object or function with external linkage...
14243 -- a pointer to member... */
14244 /* Look for a non-type template parameter. */
14246 {
14258 }
14260 /* If the next token is "&", the argument must be the address of an
14261 object or function with external linkage. */
14264 {
14267 }
14268 /* See if we might have an id-expression. */
14275 {
14278 address_p,
14285 else
14286 {
14287 tree probe;
14290 {
14291 /* Strip the dereference temporarily. */
14294 }
14296 /* If we're in a template, we represent a qualified-id referring
14297 to a static data member as a SCOPE_REF even if the scope isn't
14298 dependent so that we can check access control later. */
14303 {
14304 /* A variable without external linkage might still be a
14305 valid constant-expression, so no error is issued here
14306 if the external-linkage check fails. */
14309 }
14311 /* All overloaded functions are allowed; if the external
14312 linkage test does not pass, an error will be issued
14313 later. */
14314 ;
14318 /* A pointer-to-member. */
14319 ;
14321 ;
14322 else
14326 {
14329 tf_warning_or_error);
14330 else
14333 }
14334 }
14335 }
14336 /* If the argument started with "&", there are no other valid
14337 alternatives at this point. */
14339 {
14342 }
14344 /* If the argument wasn't successfully parsed as a type-id followed
14345 by '>>', the argument can only be a constant expression now.
14346 Otherwise, we try parsing the constant-expression tentatively,
14347 because the argument could really be a type-id. */
14358 /* We did our best to parse the argument as a non type-id, but that
14359 was the only alternative that matched (albeit with a '>' after
14360 it). We can assume it's just a typo from the user, and a
14361 diagnostic will then be issued. */
14363 }
14365 /* Parse an explicit-instantiation.
14367 explicit-instantiation:
14368 template declaration
14370 Although the standard says `declaration', what it really means is:
14372 explicit-instantiation:
14373 template decl-specifier-seq [opt] declarator [opt] ;
14375 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14376 supposed to be allowed. A defect report has been filed about this
14377 issue.
14379 GNU Extension:
14381 explicit-instantiation:
14382 storage-class-specifier template
14383 decl-specifier-seq [opt] declarator [opt] ;
14384 function-specifier template
14385 decl-specifier-seq [opt] declarator [opt] ; */
14387 static void
14389 {
14391 cp_decl_specifier_seq decl_specifiers;
14396 /* Look for an (optional) storage-class-specifier or
14397 function-specifier. */
14399 {
14400 extension_specifier
14403 extension_specifier
14406 }
14408 /* Look for the `template' keyword. */
14410 /* Let the front end know that we are processing an explicit
14411 instantiation. */
14413 /* [temp.explicit] says that we are supposed to ignore access
14414 control while processing explicit instantiation directives. */
14416 /* Parse a decl-specifier-seq. */
14418 CP_PARSER_FLAGS_OPTIONAL,
14421 /* If there was exactly one decl-specifier, and it declared a class,
14422 and there's no declarator, then we have an explicit type
14423 instantiation. */
14425 {
14426 tree type;
14430 /* Turn access control back on for names used during
14431 template instantiation. */
14436 }
14437 else
14438 {
14440 tree decl;
14442 /* Parse the declarator. */
14443 declarator
14454 {
14457 "explicit instantiation shall not use"
14461 "explicit instantiation shall not use"
14466 /* Turn access control back on for names used during
14467 template instantiation. */
14469 /* Do the explicit instantiation. */
14471 }
14472 else
14473 {
14475 /* Skip the body of the explicit instantiation. */
14477 }
14478 }
14479 /* We're done with the instantiation. */
14485 }
14487 /* Parse an explicit-specialization.
14489 explicit-specialization:
14490 template < > declaration
14492 Although the standard says `declaration', what it really means is:
14494 explicit-specialization:
14495 template <> decl-specifier [opt] init-declarator [opt] ;
14496 template <> function-definition
14497 template <> explicit-specialization
14498 template <> template-declaration */
14500 static void
14502 {
14506 /* Look for the `template' keyword. */
14508 /* Look for the `<'. */
14510 /* Look for the `>'. */
14512 /* We have processed another parameter list. */
14514 /* [temp]
14516 A template ... explicit specialization ... shall not have C
14517 linkage. */
14519 {
14521 /* Give it C++ linkage to avoid confusing other parts of the
14522 front end. */
14525 }
14526 else
14528 /* Let the front end know that we are beginning a specialization. */
14530 {
14533 }
14535 /* If the next keyword is `template', we need to figure out whether
14536 or not we're looking a template-declaration. */
14538 {
14543 else
14545 }
14546 else
14547 /* Parse the dependent declaration. */
14553 /* We're done with the specialization. */
14555 /* For the erroneous case of a template with C linkage, we pushed an
14556 implicit C++ linkage scope; exit that scope now. */
14559 /* We're done with this parameter list. */
14561 }
14563 /* Parse a type-specifier.
14565 type-specifier:
14566 simple-type-specifier
14567 class-specifier
14568 enum-specifier
14569 elaborated-type-specifier
14570 cv-qualifier
14572 GNU Extension:
14574 type-specifier:
14575 __complex__
14577 Returns a representation of the type-specifier. For a
14578 class-specifier, enum-specifier, or elaborated-type-specifier, a
14579 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14581 The parser flags FLAGS is used to control type-specifier parsing.
14583 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14584 in a decl-specifier-seq.
14586 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14587 class-specifier, enum-specifier, or elaborated-type-specifier, then
14588 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14589 if a type is declared; 2 if it is defined. Otherwise, it is set to
14590 zero.
14592 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14593 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14594 is set to FALSE. */
14596 static tree
14598 cp_parser_flags flags,
14603 {
14609 /* Assume this type-specifier does not declare a new type. */
14612 /* And that it does not specify a cv-qualifier. */
14615 /* Peek at the next token. */
14618 /* If we're looking at a keyword, we can use that to guide the
14619 production we choose. */
14622 {
14627 /* Look for the enum-specifier. */
14629 /* If that worked, we're done. */
14631 {
14636 type_spec,
14637 token,
14640 }
14641 else
14644 /* Any of these indicate either a class-specifier, or an
14645 elaborated-type-specifier. */
14652 /* Parse tentatively so that we can back up if we don't find a
14653 class-specifier. */
14655 /* Look for the class-specifier. */
14658 /* If that worked, we're done. */
14660 {
14665 type_spec,
14666 token,
14669 }
14671 /* Fall through. */
14672 elaborated_type_specifier:
14673 /* We're declaring (not defining) a class or enum. */
14677 /* Fall through. */
14679 /* Look for an elaborated-type-specifier. */
14680 type_spec
14681 = (cp_parser_elaborated_type_specifier
14684 is_declaration));
14687 type_spec,
14688 token,
14711 /* The `__complex__' keyword is a GNU extension. */
14717 }
14719 /* Handle simple keywords. */
14721 {
14723 {
14726 }
14728 }
14730 /* If we do not already have a type-specifier, assume we are looking
14731 at a simple-type-specifier. */
14733 decl_specs,
14734 flags);
14736 /* If we didn't find a type-specifier, and a type-specifier was not
14737 optional in this context, issue an error message. */
14739 {
14742 }
14745 }
14747 /* Parse a simple-type-specifier.
14749 simple-type-specifier:
14750 :: [opt] nested-name-specifier [opt] type-name
14751 :: [opt] nested-name-specifier template template-id
14752 char
14753 wchar_t
14754 bool
14755 short
14756 int
14757 long
14758 signed
14759 unsigned
14760 float
14761 double
14762 void
14764 C++0x Extension:
14766 simple-type-specifier:
14767 auto
14768 decltype ( expression )
14769 char16_t
14770 char32_t
14771 __underlying_type ( type-id )
14773 GNU Extension:
14775 simple-type-specifier:
14776 __int128
14777 __typeof__ unary-expression
14778 __typeof__ ( type-id )
14779 __typeof__ ( type-id ) { initializer-list , [opt] }
14781 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14782 appropriately updated. */
14784 static tree
14787 cp_parser_flags flags)
14788 {
14793 /* Peek at the next token. */
14796 /* If we're looking at a keyword, things are easy. */
14798 {
14833 {
14836 }
14865 {
14868 else
14872 {
14875 "use of %<auto%> in lambda parameter declaration "
14876 "only available with "
14878 }
14881 "use of %<auto%> in parameter declaration "
14882 "only available with "
14884 else
14886 "ISO C++ forbids use of %<auto%> in parameter "
14888 }
14889 else
14894 /* Since DR 743, decltype can either be a simple-type-specifier by
14895 itself or begin a nested-name-specifier. Parsing it will replace
14896 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14897 handling below decide what to do. */
14903 /* Consume the `typeof' token. */
14905 /* Parse the operand to `typeof'. */
14907 /* If it is not already a TYPE, take its type. */
14913 token,
14922 token,
14932 token,
14937 }
14939 /* If token is an already-parsed decltype not followed by ::,
14940 it's a simple-type-specifier. */
14943 {
14946 {
14948 token,
14950 /* Remember that we are handling a decltype in order to
14951 implement the resolution of DR 1510 when the argument
14952 isn't instantiation dependent. */
14954 }
14957 }
14959 /* If the type-specifier was for a built-in type, we're done. */
14961 {
14962 /* Record the type. */
14969 type,
14970 token,
14975 /* Consume the token. */
14981 /* There is no valid C++ program where a non-template type is
14982 followed by a "<". That usually indicates that the user thought
14983 that the type was a template. */
14988 }
14990 /* The type-specifier must be a user-defined type. */
14992 {
14996 /* Don't gobble tokens or issue error messages if this is an
14997 optional type-specifier. */
15001 /* Look for the optional `::' operator. */
15002 global_p
15006 /* Look for the nested-name specifier. */
15007 qualified_p
15015 /* If we have seen a nested-name-specifier, and the next token
15016 is `template', then we are using the template-id production. */
15019 {
15020 /* Look for the template-id. */
15024 none_type,
15026 /* If the template-id did not name a type, we are out of
15027 luck. */
15029 {
15032 }
15033 }
15034 /* Otherwise, look for a type-name. */
15035 else
15037 /* Keep track of all name-lookups performed in class scopes. */
15039 && !global_p
15040 && !qualified_p
15044 /* If it didn't work out, we don't have a TYPE. */
15050 token,
15052 }
15054 /* If we didn't get a type-name, issue an error message. */
15056 {
15059 }
15062 {
15063 /* See if TYPE is an Objective-C type, and if so, parse and
15064 accept any protocol references following it. Do this before
15065 the cp_parser_check_for_invalid_template_id() call, because
15066 Objective-C types can be followed by '<...>' which would
15067 enclose protocol names rather than template arguments, and so
15068 everything is fine. */
15071 {
15075 /* Clobber the "unqualified" type previously entered into
15076 DECL_SPECS with the new, improved protocol-qualified version. */
15081 }
15083 /* There is no valid C++ program where a non-template type is
15084 followed by a "<". That usually indicates that the user
15085 thought that the type was a template. */
15087 none_type,
15089 }
15092 }
15094 /* Parse a type-name.
15096 type-name:
15097 class-name
15098 enum-name
15099 typedef-name
15100 simple-template-id [in c++0x]
15102 enum-name:
15103 identifier
15105 typedef-name:
15106 identifier
15108 Returns a TYPE_DECL for the type. */
15110 static tree
15112 {
15113 tree type_decl;
15115 /* We can't know yet whether it is a class-name or not. */
15117 /* Try a class-name. */
15121 none_type,
15125 /* If it's not a class-name, keep looking. */
15127 {
15129 /* It must be a typedef-name or an enum-name. */
15133 /* It is either a simple-template-id representing an
15134 instantiation of an alias template... */
15138 none_type,
15140 /* Note that this must be an instantiation of an alias template
15141 because [temp.names]/6 says:
15143 A template-id that names an alias template specialization
15144 is a type-name.
15146 Whereas [temp.names]/7 says:
15148 A simple-template-id that names a class template
15149 specialization is a class-name. */
15154 else
15158 /* ... Or a typedef-name or an enum-name. */
15160 }
15163 }
15165 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15167 enum-name:
15168 identifier
15170 typedef-name:
15171 identifier
15173 Returns a TYPE_DECL for the type. */
15175 static tree
15177 {
15178 tree type_decl;
15179 tree identifier;
15186 /* Look up the type-name. */
15193 {
15194 /* See if this is an Objective-C type. */
15199 }
15201 /* Issue an error if we did not find a type-name. */
15203 /* In Objective-C, we have the complication that class names are
15204 normally type names and start declarations (eg, the
15205 "NSObject" in "NSObject *object;"), but can be used in an
15206 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15207 is an expression. So, a classname followed by a dot is not a
15208 valid type-name. */
15211 {
15216 }
15217 /* Remember that the name was used in the definition of the
15218 current class so that we can check later to see if the
15219 meaning would have been different after the class was
15220 entirely defined. */
15226 }
15228 /* Parse an elaborated-type-specifier. Note that the grammar given
15229 here incorporates the resolution to DR68.
15231 elaborated-type-specifier:
15232 class-key :: [opt] nested-name-specifier [opt] identifier
15233 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15234 enum-key :: [opt] nested-name-specifier [opt] identifier
15235 typename :: [opt] nested-name-specifier identifier
15236 typename :: [opt] nested-name-specifier template [opt]
15237 template-id
15239 GNU extension:
15241 elaborated-type-specifier:
15242 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15243 class-key attributes :: [opt] nested-name-specifier [opt]
15244 template [opt] template-id
15245 enum attributes :: [opt] nested-name-specifier [opt] identifier
15247 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15248 declared `friend'. If IS_DECLARATION is TRUE, then this
15249 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15250 something is being declared.
15252 Returns the TYPE specified. */
15254 static tree
15258 {
15260 tree identifier;
15263 tree globalscope;
15266 /* See if we're looking at the `enum' keyword. */
15268 {
15269 /* Consume the `enum' token. */
15271 /* Remember that it's an enumeration type. */
15273 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15274 enums) is used here. */
15277 {
15281 /* Consume the `struct' or `class' and parse it anyway. */
15283 }
15284 /* Parse the attributes. */
15286 }
15287 /* Or, it might be `typename'. */
15289 RID_TYPENAME))
15290 {
15291 /* Consume the `typename' token. */
15293 /* Remember that it's a `typename' type. */
15295 }
15296 /* Otherwise it must be a class-key. */
15297 else
15298 {
15302 /* Parse the attributes. */
15304 }
15306 /* Look for the `::' operator. */
15309 /* Look for the nested-name-specifier. */
15311 {
15316 is_declaration))
15318 }
15319 else
15320 /* Even though `typename' is not present, the proposed resolution
15321 to Core Issue 180 says that in `class A<T>::B', `B' should be
15322 considered a type-name, even if `A<T>' is dependent. */
15327 is_declaration);
15328 /* For everything but enumeration types, consider a template-id.
15329 For an enumeration type, consider only a plain identifier. */
15331 {
15333 tree decl;
15335 /* Allow the `template' keyword. */
15337 /* If we didn't see `template', we don't know if there's a
15338 template-id or not. */
15341 /* Parse the template-id. */
15345 tag_type,
15346 is_declaration);
15347 /* If we didn't find a template-id, look for an ordinary
15348 identifier. */
15350 ;
15351 /* We can get here when cp_parser_template_id, called by
15352 cp_parser_class_name with tag_type == none_type, succeeds
15353 and caches a BASELINK. Then, when called again here,
15354 instead of failing and returning an error_mark_node
15355 returns it (see template/typename17.C in C++11).
15356 ??? Could we diagnose this earlier? */
15358 {
15361 }
15362 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15363 in effect, then we must assume that, upon instantiation, the
15364 template will correspond to a class. */
15368 typename_type,
15370 /* If the `typename' keyword is in effect and DECL is not a type
15371 decl, then type is non existent. */
15373 ;
15379 }
15382 {
15387 {
15390 }
15392 /* For a `typename', we needn't call xref_tag. */
15398 /* Template parameter lists apply only if we are not within a
15399 function parameter list. */
15400 bool template_parm_lists_apply
15409 /* Look up a qualified name in the usual way. */
15411 {
15412 tree decl;
15413 tree ambiguous_decls;
15416 tag_type,
15423 /* If the lookup was ambiguous, an error will already have been
15424 issued. */
15428 /* If we are parsing friend declaration, DECL may be a
15429 TEMPLATE_DECL tree node here. However, we need to check
15430 whether this TEMPLATE_DECL results in valid code. Consider
15431 the following example:
15433 namespace N {
15434 template <class T> class C {};
15435 }
15436 class X {
15437 template <class T> friend class N::C; // #1, valid code
15438 };
15439 template <class T> class Y {
15440 friend class N::C; // #2, invalid code
15441 };
15443 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15444 name lookup of `N::C'. We see that friend declaration must
15445 be template for the code to be valid. Note that
15446 processing_template_decl does not work here since it is
15447 always 1 for the above two cases. */
15449 decl = (cp_parser_maybe_treat_template_as_class
15454 {
15456 identifier,
15459 }
15462 {
15466 allow_template);
15470 }
15472 /* Forward declarations of nested types, such as
15474 class C1::C2;
15475 class C1::C2::C3;
15477 are invalid unless all components preceding the final '::'
15478 are complete. If all enclosing types are complete, these
15479 declarations become merely pointless.
15481 Invalid forward declarations of nested types are errors
15482 caught elsewhere in parsing. Those that are pointless arrive
15483 here. */
15490 }
15491 else
15492 {
15493 /* An elaborated-type-specifier sometimes introduces a new type and
15494 sometimes names an existing type. Normally, the rule is that it
15495 introduces a new type only if there is not an existing type of
15496 the same name already in scope. For example, given:
15498 struct S {};
15499 void f() { struct S s; }
15501 the `struct S' in the body of `f' is the same `struct S' as in
15502 the global scope; the existing definition is used. However, if
15503 there were no global declaration, this would introduce a new
15504 local class named `S'.
15506 An exception to this rule applies to the following code:
15508 namespace N { struct S; }
15510 Here, the elaborated-type-specifier names a new type
15511 unconditionally; even if there is already an `S' in the
15512 containing scope this declaration names a new type.
15513 This exception only applies if the elaborated-type-specifier
15514 forms the complete declaration:
15516 [class.name]
15518 A declaration consisting solely of `class-key identifier ;' is
15519 either a redeclaration of the name in the current scope or a
15520 forward declaration of the identifier as a class name. It
15521 introduces the name into the current scope.
15523 We are in this situation precisely when the next token is a `;'.
15525 An exception to the exception is that a `friend' declaration does
15526 *not* name a new type; i.e., given:
15528 struct S { friend struct T; };
15530 `T' is not a new type in the scope of `S'.
15532 Also, `new struct S' or `sizeof (struct S)' never results in the
15533 definition of a new type; a new type can only be declared in a
15534 declaration context. */
15536 tag_scope ts;
15540 /* Friends have special name lookup rules. */
15544 CPP_SEMICOLON))
15545 /* This is a `class-key identifier ;' */
15547 else
15550 template_p =
15551 (template_parm_lists_apply
15554 /* An unqualified name was used to reference this type, so
15555 there were no qualifying templates. */
15563 }
15564 }
15569 /* Allow attributes on forward declarations of classes. */
15571 {
15581 else
15584 }
15587 {
15588 /* Indicate whether this class was declared as a `class' or as a
15589 `struct'. */
15593 }
15595 /* A "<" cannot follow an elaborated type specifier. If that
15596 happens, the user was probably trying to form a template-id. */
15601 }
15603 /* Parse an enum-specifier.
15605 enum-specifier:
15606 enum-head { enumerator-list [opt] }
15607 enum-head { enumerator-list , } [C++0x]
15609 enum-head:
15610 enum-key identifier [opt] enum-base [opt]
15611 enum-key nested-name-specifier identifier enum-base [opt]
15613 enum-key:
15614 enum
15615 enum class [C++0x]
15616 enum struct [C++0x]
15618 enum-base: [C++0x]
15619 : type-specifier-seq
15621 opaque-enum-specifier:
15622 enum-key identifier enum-base [opt] ;
15624 GNU Extensions:
15625 enum-key attributes[opt] identifier [opt] enum-base [opt]
15626 { enumerator-list [opt] }attributes[opt]
15627 enum-key attributes[opt] identifier [opt] enum-base [opt]
15628 { enumerator-list, }attributes[opt] [C++0x]
15630 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15631 if the token stream isn't an enum-specifier after all. */
15633 static tree
15635 {
15636 tree identifier;
15638 tree prev_scope;
15640 tree attributes;
15653 /* Parse tentatively so that we can back up if we don't find a
15654 enum-specifier. */
15657 /* Caller guarantees that the current token is 'enum', an identifier
15658 possibly follows, and the token after that is an opening brace.
15659 If we don't have an identifier, fabricate an anonymous name for
15660 the enumeration being defined. */
15663 /* Parse the "class" or "struct", which indicates a scoped
15664 enumeration type in C++0x. */
15667 {
15671 /* Consume the `struct' or `class' token. */
15675 }
15679 /* Clear the qualification. */
15684 /* Figure out in what scope the declaration is being placed. */
15690 nested_name_specifier
15698 {
15699 tree name;
15703 enum_type,
15708 input_location);
15710 {
15713 {
15714 /* Are template enums allowed in ISO? */
15718 /* ignore a typename reference, for it will be solved by name
15719 in start_enum. */
15721 }
15722 }
15725 else
15728 }
15729 else
15730 {
15733 else
15734 {
15740 }
15741 }
15744 /* Check for the `:' that denotes a specified underlying type in C++0x.
15745 Note that a ':' could also indicate a bitfield width, however. */
15747 {
15748 cp_decl_specifier_seq type_specifiers;
15750 /* Consume the `:'. */
15753 /* Parse the type-specifier-seq. */
15758 /* At this point this is surely not elaborated type specifier. */
15767 /* If that didn't work, stop. */
15769 {
15775 }
15776 }
15778 /* Look for the `{' but don't consume it yet. */
15780 {
15782 {
15785 {
15788 }
15789 }
15790 /* An opaque-enum-specifier must have a ';' here. */
15793 {
15796 {
15799 }
15800 }
15801 }
15807 {
15809 {
15813 }
15815 {
15817 }
15818 }
15820 /* Issue an error message if type-definitions are forbidden here. */
15823 else
15824 /* Create the new type. We do this before consuming the opening
15825 brace so the enum will be recorded as being on the line of its
15826 tag (or the 'enum' keyword, if there is no tag). */
15830 /* If the next token is not '{' it is an opaque-enum-specifier or an
15831 elaborated-type-specifier. */
15833 {
15837 {
15838 /* The following catches invalid code such as:
15839 enum class S<int>::E { A, B, C }; */
15847 {
15851 nested_name_specifier);
15853 }
15854 /* If that scope does not contain the scope in which the
15855 class was originally declared, the program is invalid. */
15857 nested_name_specifier))
15858 {
15861 "declaration of %qD in namespace %qD which does not "
15864 else
15866 "declaration of %qD in %qD which does not "
15870 }
15871 }
15876 /* Consume the opening brace. */
15883 {
15887 }
15888 else
15889 {
15895 }
15899 /* If the next token is not '}', then there are some enumerators. */
15901 {
15905 }
15906 else
15909 /* Consume the final '}'. */
15915 }
15916 else
15917 {
15918 /* If a ';' follows, then it is an opaque-enum-specifier
15919 and additional restrictions apply. */
15921 {
15928 }
15929 }
15931 /* Look for trailing attributes to apply to this enumeration, and
15932 apply them if appropriate. */
15934 {
15938 trailing_attr,
15940 }
15942 /* Finish up the enumeration. */
15944 {
15949 }
15952 {
15954 {
15957 }
15959 {
15961 }
15962 }
15963 out:
15966 }
15968 /* Parse an enumerator-list. The enumerators all have the indicated
15969 TYPE.
15971 enumerator-list:
15972 enumerator-definition
15973 enumerator-list , enumerator-definition */
15975 static void
15977 {
15979 {
15980 /* Parse an enumerator-definition. */
15983 /* If the next token is not a ',', we've reached the end of
15984 the list. */
15987 /* Otherwise, consume the `,' and keep going. */
15989 /* If the next token is a `}', there is a trailing comma. */
15991 {
15996 }
15997 }
15998 }
16000 /* Parse an enumerator-definition. The enumerator has the indicated
16001 TYPE.
16003 enumerator-definition:
16004 enumerator
16005 enumerator = constant-expression
16007 enumerator:
16008 identifier */
16010 static void
16012 {
16013 tree identifier;
16014 tree value;
16015 location_t loc;
16017 /* Save the input location because we are interested in the location
16018 of the identifier and not the location of the explicit value. */
16021 /* Look for the identifier. */
16026 /* If the next token is an '=', then there is an explicit value. */
16028 {
16029 /* Consume the `=' token. */
16031 /* Parse the value. */
16033 }
16034 else
16037 /* If we are processing a template, make sure the initializer of the
16038 enumerator doesn't contain any bare template parameter pack. */
16042 /* Create the enumerator. */
16044 }
16046 /* Parse a namespace-name.
16048 namespace-name:
16049 original-namespace-name
16050 namespace-alias
16052 Returns the NAMESPACE_DECL for the namespace. */
16054 static tree
16056 {
16057 tree identifier;
16058 tree namespace_decl;
16062 /* Get the name of the namespace. */
16067 /* Look up the identifier in the currently active scope. Look only
16068 for namespaces, due to:
16070 [basic.lookup.udir]
16072 When looking up a namespace-name in a using-directive or alias
16073 definition, only namespace names are considered.
16075 And:
16077 [basic.lookup.qual]
16079 During the lookup of a name preceding the :: scope resolution
16080 operator, object, function, and enumerator names are ignored.
16082 (Note that cp_parser_qualifying_entity only calls this
16083 function if the token after the name is the scope resolution
16084 operator.) */
16086 none_type,
16092 /* If it's not a namespace, issue an error. */
16095 {
16100 }
16103 }
16105 /* Parse a namespace-definition.
16107 namespace-definition:
16108 named-namespace-definition
16109 unnamed-namespace-definition
16111 named-namespace-definition:
16112 original-namespace-definition
16113 extension-namespace-definition
16115 original-namespace-definition:
16116 namespace identifier { namespace-body }
16118 extension-namespace-definition:
16119 namespace original-namespace-name { namespace-body }
16121 unnamed-namespace-definition:
16122 namespace { namespace-body } */
16124 static void
16126 {
16133 {
16137 }
16138 else
16141 /* Look for the `namespace' keyword. */
16144 /* Get the name of the namespace. We do not attempt to distinguish
16145 between an original-namespace-definition and an
16146 extension-namespace-definition at this point. The semantic
16147 analysis routines are responsible for that. */
16150 else
16153 /* Parse any specified attributes. */
16156 /* Look for the `{' to start the namespace. */
16158 /* Start the namespace. */
16161 /* "inline namespace" is equivalent to a stub namespace definition
16162 followed by a strong using directive. */
16164 {
16166 /* Set up namespace association. */
16170 /* Import the contents of the inline namespace. */
16174 }
16178 /* Parse the body of the namespace. */
16184 /* Finish the namespace. */
16186 /* Look for the final `}'. */
16188 }
16190 /* Parse a namespace-body.
16192 namespace-body:
16193 declaration-seq [opt] */
16195 static void
16197 {
16199 }
16201 /* Parse a namespace-alias-definition.
16203 namespace-alias-definition:
16204 namespace identifier = qualified-namespace-specifier ; */
16206 static void
16208 {
16209 tree identifier;
16210 tree namespace_specifier;
16214 /* Look for the `namespace' keyword. */
16216 /* Look for the identifier. */
16220 /* Look for the `=' token. */
16223 {
16225 /* Skip the definition. */
16230 }
16232 /* Look for the qualified-namespace-specifier. */
16233 namespace_specifier
16235 /* Look for the `;' token. */
16238 /* Register the alias in the symbol table. */
16240 }
16242 /* Parse a qualified-namespace-specifier.
16244 qualified-namespace-specifier:
16245 :: [opt] nested-name-specifier [opt] namespace-name
16247 Returns a NAMESPACE_DECL corresponding to the specified
16248 namespace. */
16250 static tree
16252 {
16253 /* Look for the optional `::'. */
16257 /* Look for the optional nested-name-specifier. */
16265 }
16267 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16268 access declaration.
16270 using-declaration:
16271 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16272 using :: unqualified-id ;
16274 access-declaration:
16275 qualified-id ;
16277 */
16279 static bool
16282 {
16286 tree decl;
16287 tree identifier;
16288 tree qscope;
16293 {
16296 }
16297 else
16298 {
16299 /* Look for the `using' keyword. */
16302 /* Peek at the next token. */
16304 /* See if it's `typename'. */
16306 {
16307 /* Remember that we've seen it. */
16309 /* Consume the `typename' token. */
16311 }
16312 }
16314 /* Look for the optional global scope qualification. */
16315 global_scope_p
16320 /* If we saw `typename', or didn't see `::', then there must be a
16321 nested-name-specifier present. */
16323 {
16329 {
16332 }
16333 }
16334 /* Otherwise, we could be in either of the two productions. In that
16335 case, treat the nested-name-specifier as optional. */
16336 else
16348 /* Something has already gone wrong; there's no need to parse
16349 further. Since an error has occurred, the return value of
16350 cp_parser_parse_definitely will be false, as required. */
16354 /* Parse the unqualified-id. */
16362 {
16367 }
16369 /* The function we call to handle a using-declaration is different
16370 depending on what scope we are in. */
16372 ;
16375 /* [namespace.udecl]
16377 A using declaration shall not name a template-id. */
16380 else
16381 {
16383 {
16384 /* Create the USING_DECL. */
16391 {
16394 }
16395 else
16396 /* Add it to the list of members in this class. */
16398 }
16399 else
16400 {
16402 identifier,
16409 {
16412 }
16415 else
16417 }
16418 }
16420 /* Look for the final `;'. */
16425 "access declarations are deprecated "
16426 "in favour of using-declarations; "
16430 }
16432 /* Parse an alias-declaration.
16434 alias-declaration:
16435 using identifier attribute-specifier-seq [opt] = type-id */
16437 static tree
16439 {
16441 location_t id_location;
16443 cp_decl_specifier_seq decl_specs;
16447 /* Look for the `using' keyword. */
16448 cp_token *using_token
16470 /* Now we are going to parse the type-id of the declaration. */
16472 /*
16473 [dcl.type]/3 says:
16475 "A type-specifier-seq shall not define a class or enumeration
16476 unless it appears in the type-id of an alias-declaration (7.1.3) that
16477 is not the declaration of a template-declaration."
16479 In other words, if we currently are in an alias template, the
16480 type-id should not define a type.
16482 So let's set parser->type_definition_forbidden_message in that
16483 case; cp_parser_check_type_definition (called by
16484 cp_parser_class_specifier) will then emit an error if a type is
16485 defined in the type-id. */
16487 {
16491 }
16495 /* Restore the error message if need be. */
16501 {
16504 }
16506 /* A typedef-name can also be introduced by an alias-declaration. The
16507 identifier following the using keyword becomes a typedef-name. It has
16508 the same semantics as if it were introduced by the typedef
16509 specifier. In particular, it does not define a new type and it shall
16510 not appear in the type-id. */
16515 {
16518 ds_attribute,
16519 attrs_token);
16520 }
16522 ds_typedef,
16523 using_token);
16525 ds_alias,
16526 using_token);
16535 else
16546 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16547 added into the symbol table; otherwise, return the TYPE_DECL. */
16551 {
16555 }
16558 }
16560 /* Parse a using-directive.
16562 using-directive:
16563 using namespace :: [opt] nested-name-specifier [opt]
16564 namespace-name ; */
16566 static void
16568 {
16569 tree namespace_decl;
16570 tree attribs;
16572 /* Look for the `using' keyword. */
16574 /* And the `namespace' keyword. */
16576 /* Look for the optional `::' operator. */
16578 /* And the optional nested-name-specifier. */
16584 /* Get the namespace being used. */
16586 /* And any specified attributes. */
16588 /* Update the symbol table. */
16590 /* Look for the final `;'. */
16592 }
16594 /* Parse an asm-definition.
16596 asm-definition:
16597 asm ( string-literal ) ;
16599 GNU Extension:
16601 asm-definition:
16602 asm volatile [opt] ( string-literal ) ;
16603 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16604 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16605 : asm-operand-list [opt] ) ;
16606 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16607 : asm-operand-list [opt]
16608 : asm-clobber-list [opt] ) ;
16609 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16610 : asm-clobber-list [opt]
16611 : asm-goto-list ) ; */
16613 static void
16615 {
16616 tree string;
16621 tree asm_stmt;
16629 /* Look for the `asm' keyword. */
16634 {
16637 }
16639 /* See if the next token is `volatile'. */
16642 {
16643 /* Remember that we saw the `volatile' keyword. */
16645 /* Consume the token. */
16647 }
16651 {
16652 /* Remember that we saw the `goto' keyword. */
16654 /* Consume the token. */
16656 }
16657 /* Look for the opening `('. */
16660 /* Look for the string. */
16663 {
16667 }
16669 /* If we're allowing GNU extensions, check for the extended assembly
16670 syntax. Unfortunately, the `:' tokens need not be separated by
16671 a space in C, and so, for compatibility, we tolerate that here
16672 too. Doing that means that we have to treat the `::' operator as
16673 two `:' tokens. */
16678 {
16683 /* The extended syntax was used. */
16686 /* Look for outputs. */
16688 {
16689 /* Consume the `:'. */
16691 /* Parse the output-operands. */
16693 CPP_COLON)
16695 CPP_SCOPE)
16697 CPP_CLOSE_PAREN)
16703 }
16704 /* If the next token is `::', there are no outputs, and the
16705 next token is the beginning of the inputs. */
16707 /* The inputs are coming next. */
16710 /* Look for inputs. */
16713 {
16714 /* Consume the `:' or `::'. */
16716 /* Parse the output-operands. */
16718 CPP_COLON)
16720 CPP_SCOPE)
16722 CPP_CLOSE_PAREN))
16727 }
16729 /* The clobbers are coming next. */
16732 /* Look for clobbers. */
16735 {
16737 /* Consume the `:' or `::'. */
16739 /* Parse the clobbers. */
16741 CPP_COLON)
16743 CPP_CLOSE_PAREN))
16745 }
16748 /* The labels are coming next. */
16751 /* Look for labels. */
16754 {
16756 /* Consume the `:' or `::'. */
16758 /* Parse the labels. */
16760 }
16764 }
16768 /* Look for the closing `)'. */
16776 {
16777 /* Create the ASM_EXPR. */
16779 {
16782 /* If the extended syntax was not used, mark the ASM_EXPR. */
16784 {
16790 }
16791 }
16792 else
16794 }
16795 }
16797 /* Declarators [gram.dcl.decl] */
16799 /* Parse an init-declarator.
16801 init-declarator:
16802 declarator initializer [opt]
16804 GNU Extension:
16806 init-declarator:
16807 declarator asm-specification [opt] attributes [opt] initializer [opt]
16809 function-definition:
16810 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16811 function-body
16812 decl-specifier-seq [opt] declarator function-try-block
16814 GNU Extension:
16816 function-definition:
16817 __extension__ function-definition
16819 TM Extension:
16821 function-definition:
16822 decl-specifier-seq [opt] declarator function-transaction-block
16824 The DECL_SPECIFIERS apply to this declarator. Returns a
16825 representation of the entity declared. If MEMBER_P is TRUE, then
16826 this declarator appears in a class scope. The new DECL created by
16827 this declarator is returned.
16829 The CHECKS are access checks that should be performed once we know
16830 what entity is being declared (and, therefore, what classes have
16831 befriended it).
16833 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16834 for a function-definition here as well. If the declarator is a
16835 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16836 be TRUE upon return. By that point, the function-definition will
16837 have been completely parsed.
16839 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16840 is FALSE.
16842 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16843 parsed declaration if it is an uninitialized single declarator not followed
16844 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16845 if present, will not be consumed. If returned, this declarator will be
16846 created with SD_INITIALIZED but will not call cp_finish_decl. */
16848 static tree
16857 {
16861 tree prefix_attributes;
16863 tree asm_specification;
16864 tree initializer;
16866 tree scope;
16868 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16869 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16870 "(...)". */
16880 /* Gather the attributes that were provided with the
16881 decl-specifiers. */
16884 /* Assume that this is not the declarator for a function
16885 definition. */
16889 /* Default arguments are only permitted for function parameters. */
16893 /* Defer access checks while parsing the declarator; we cannot know
16894 what names are accessible until we know what is being
16895 declared. */
16898 /* Parse the declarator. */
16900 declarator
16905 /* Gather up the deferred checks. */
16910 /* If the DECLARATOR was erroneous, there's no need to go
16911 further. */
16915 /* Check that the number of template-parameter-lists is OK. */
16925 /* Figure out what scope the entity declared by the DECLARATOR is
16926 located in. `grokdeclarator' sometimes changes the scope, so
16927 we compute it now. */
16930 /* Perform any lookups in the declared type which were thought to be
16931 dependent, but are not in the scope of the declarator. */
16932 decl_specifiers->type
16935 /* If we're allowing GNU extensions, look for an
16936 asm-specification. */
16938 {
16939 /* Look for an asm-specification. */
16942 }
16943 else
16946 /* Look for attributes. */
16950 /* Peek at the next token. */
16956 {
16957 /* Check to see if the token indicates the start of a
16958 function-definition. */
16960 {
16962 {
16963 /* If a function-definition should not appear here, issue an
16964 error message. */
16968 }
16970 location_t func_brace_location
16973 /* Neither attributes nor an asm-specification are allowed
16974 on a function-definition. */
16977 "an asm-specification is not allowed "
16981 "attributes are not allowed "
16983 /* This is a function-definition. */
16986 /* Parse the function definition. */
16989 decl_specifiers,
16990 declarator,
16991 prefix_attributes);
16992 else
16993 decl =
16994 (cp_parser_function_definition_from_specifiers_and_declarator
16998 {
16999 /* This is where the prologue starts... */
17002 }
17005 }
17006 }
17008 {
17009 /* A non-template declaration involving a function parameter list
17010 containing an implicit template parameter will be made into a
17011 template. If the resulting declaration is not going to be an
17012 actual function then finish the template scope here to prevent it.
17013 An error message will be issued once we have a decl to talk about.
17015 FIXME probably we should do type deduction rather than create an
17016 implicit template, but the standard currently doesn't allow it. */
17019 }
17021 /* [dcl.dcl]
17023 Only in function declarations for constructors, destructors, and
17024 type conversions can the decl-specifier-seq be omitted.
17026 We explicitly postpone this check past the point where we handle
17027 function-definitions because we tolerate function-definitions
17028 that are missing their return types in some modes. */
17030 {
17034 }
17036 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17040 {
17048 {
17054 }
17055 }
17056 else
17057 {
17058 /* If the init-declarator isn't initialized and isn't followed by a
17059 `,' or `;', it's not a valid init-declarator. */
17062 {
17065 else
17066 {
17069 }
17070 }
17073 }
17075 /* Because start_decl has side-effects, we should only call it if we
17076 know we're going ahead. By this point, we know that we cannot
17077 possibly be looking at any other construct. */
17080 /* Enter the newly declared entry in the symbol table. If we're
17081 processing a declaration in a class-specifier, we wait until
17082 after processing the initializer. */
17084 {
17091 /* Adjust location of decl if declarator->id_loc is more appropriate:
17092 set, and decl wasn't merged with another decl, in which case its
17093 location would be different from input_location, and more accurate. */
17098 }
17100 /* Enter the SCOPE. That way unqualified names appearing in the
17101 initializer will be looked up in SCOPE. */
17104 /* Perform deferred access control checks, now that we know in which
17105 SCOPE the declared entity resides. */
17107 {
17110 /* If the entity being declared is a function, pretend that we
17111 are in its scope. If it is a `friend', it may have access to
17112 things that would not otherwise be accessible. */
17114 {
17117 }
17119 /* Perform access checks for template parameters. */
17122 /* Perform the access control checks for the declarator and the
17123 decl-specifiers. */
17126 /* Restore the saved value. */
17129 }
17131 /* Parse the initializer. */
17136 {
17138 {
17142 else
17143 {
17144 /* If the declaration was erroneous, we don't really
17145 know what the user intended, so just silently
17146 consume the initializer. */
17154 }
17155 }
17156 else
17157 {
17158 /* We want to record the extra mangling scope for in-class
17159 initializers of class members and initializers of static data
17160 member templates. The former involves deferring
17161 parsing of the initializer until end of class as with default
17162 arguments. So right here we only handle the latter. */
17172 }
17173 }
17175 /* The old parser allows attributes to appear after a parenthesized
17176 initializer. Mark Mitchell proposed removing this functionality
17177 on the GCC mailing lists on 2002-08-13. This parser accepts the
17178 attributes -- but ignores them. */
17185 /* And now complain about a non-function implicit template. */
17190 /* For an in-class declaration, use `grokfield' to create the
17191 declaration. */
17193 {
17195 {
17198 }
17206 }
17208 /* Finish processing the declaration. But, skip member
17209 declarations. */
17211 {
17214 asm_specification,
17215 /* If the initializer is in parentheses, then this is
17216 a direct-initialization, which means that an
17217 `explicit' constructor is OK. Otherwise, an
17218 `explicit' constructor cannot be used. */
17221 }
17224 /* Core issue #226 (C++0x only): A default template-argument
17225 shall not be specified in a friend class template
17226 declaration. */
17235 {
17238 else
17240 }
17243 }
17245 /* Parse a declarator.
17247 declarator:
17248 direct-declarator
17249 ptr-operator declarator
17251 abstract-declarator:
17252 ptr-operator abstract-declarator [opt]
17253 direct-abstract-declarator
17255 GNU Extensions:
17257 declarator:
17258 attributes [opt] direct-declarator
17259 attributes [opt] ptr-operator declarator
17261 abstract-declarator:
17262 attributes [opt] ptr-operator abstract-declarator [opt]
17263 attributes [opt] direct-abstract-declarator
17265 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17266 detect constructor, destructor or conversion operators. It is set
17267 to -1 if the declarator is a name, and +1 if it is a
17268 function. Otherwise it is set to zero. Usually you just want to
17269 test for >0, but internally the negative value is used.
17271 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17272 a decl-specifier-seq unless it declares a constructor, destructor,
17273 or conversion. It might seem that we could check this condition in
17274 semantic analysis, rather than parsing, but that makes it difficult
17275 to handle something like `f()'. We want to notice that there are
17276 no decl-specifiers, and therefore realize that this is an
17277 expression, not a declaration.)
17279 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17280 the declarator is a direct-declarator of the form "(...)".
17282 MEMBER_P is true iff this declarator is a member-declarator.
17284 FRIEND_P is true iff this declarator is a friend. */
17288 cp_parser_declarator_kind dcl_kind,
17292 {
17295 cp_cv_quals cv_quals;
17296 tree class_type;
17299 /* Assume this is not a constructor, destructor, or type-conversion
17300 operator. */
17307 /* Check for the ptr-operator production. */
17309 /* Parse the ptr-operator. */
17315 /* If that worked, then we have a ptr-operator. */
17317 {
17318 /* If a ptr-operator was found, then this declarator was not
17319 parenthesized. */
17322 /* The dependent declarator is optional if we are parsing an
17323 abstract-declarator. */
17327 /* Parse the dependent declarator. */
17332 friend_p);
17334 /* If we are parsing an abstract-declarator, we must handle the
17335 case where the dependent declarator is absent. */
17340 declarator = cp_parser_make_indirect_declarator
17342 }
17343 /* Everything else is a direct-declarator. */
17344 else
17345 {
17348 CPP_OPEN_PAREN);
17350 ctor_dtor_or_conv_p,
17352 }
17357 }
17359 /* Parse a direct-declarator or direct-abstract-declarator.
17361 direct-declarator:
17362 declarator-id
17363 direct-declarator ( parameter-declaration-clause )
17364 cv-qualifier-seq [opt]
17365 ref-qualifier [opt]
17366 exception-specification [opt]
17367 direct-declarator [ constant-expression [opt] ]
17368 ( declarator )
17370 direct-abstract-declarator:
17371 direct-abstract-declarator [opt]
17372 ( parameter-declaration-clause )
17373 cv-qualifier-seq [opt]
17374 ref-qualifier [opt]
17375 exception-specification [opt]
17376 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17377 ( abstract-declarator )
17379 Returns a representation of the declarator. DCL_KIND is
17380 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17381 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17382 we are parsing a direct-declarator. It is
17383 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17384 of ambiguity we prefer an abstract declarator, as per
17385 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17386 as for cp_parser_declarator. */
17390 cp_parser_declarator_kind dcl_kind,
17393 {
17403 {
17404 /* Peek at the next token. */
17407 {
17408 /* This is either a parameter-declaration-clause, or a
17409 parenthesized declarator. When we know we are parsing a
17410 named declarator, it must be a parenthesized declarator
17411 if FIRST is true. For instance, `(int)' is a
17412 parameter-declaration-clause, with an omitted
17413 direct-abstract-declarator. But `((*))', is a
17414 parenthesized abstract declarator. Finally, when T is a
17415 template parameter `(T)' is a
17416 parameter-declaration-clause, and not a parenthesized
17417 named declarator.
17419 We first try and parse a parameter-declaration-clause,
17420 and then try a nested declarator (if FIRST is true).
17422 It is not an error for it not to be a
17423 parameter-declaration-clause, even when FIRST is
17424 false. Consider,
17426 int i (int);
17427 int i (3);
17429 The first is the declaration of a function while the
17430 second is the definition of a variable, including its
17431 initializer.
17433 Having seen only the parenthesis, we cannot know which of
17434 these two alternatives should be selected. Even more
17435 complex are examples like:
17437 int i (int (a));
17438 int i (int (3));
17440 The former is a function-declaration; the latter is a
17441 variable initialization.
17443 Thus again, we try a parameter-declaration-clause, and if
17444 that fails, we back out and return. */
17447 {
17448 tree params;
17451 /* In a member-declarator, the only valid interpretation
17452 of a parenthesis is the start of a
17453 parameter-declaration-clause. (It is invalid to
17454 initialize a static data member with a parenthesized
17455 initializer; only the "=" form of initialization is
17456 permitted.) */
17460 /* Consume the `('. */
17463 {
17464 /* If this is going to be an abstract declarator, we're
17465 in a declarator and we can't have default args. */
17468 }
17472 /* Parse the parameter-declaration-clause. */
17475 /* Consume the `)'. */
17478 /* If all went well, parse the cv-qualifier-seq,
17479 ref-qualifier and the exception-specification. */
17481 {
17482 cp_cv_quals cv_quals;
17483 cp_virt_specifiers virt_specifiers;
17484 cp_ref_qualifier ref_qual;
17485 tree exception_specification;
17486 tree late_return;
17487 tree attrs;
17497 /* Parse the cv-qualifier-seq. */
17499 /* Parse the ref-qualifier. */
17501 /* And the exception-specification. */
17502 exception_specification
17507 /* In here, we handle cases where attribute is used after
17508 the function declaration. For example:
17509 void func (int x) __attribute__((vector(..))); */
17512 {
17516 CPP_SEMICOLON)
17518 CPP_OPEN_BRACE))
17521 ;
17522 else
17524 }
17525 late_return = (cp_parser_late_return_type_opt
17530 /* Parse the virt-specifier-seq. */
17533 /* Create the function-declarator. */
17535 params,
17536 cv_quals,
17537 virt_specifiers,
17538 ref_qual,
17539 exception_specification,
17540 late_return);
17542 /* Any subsequent parameter lists are to do with
17543 return type, so are not those of the declared
17544 function. */
17546 }
17548 /* Remove the function parms from scope. */
17552 /* Repeat the main loop. */
17554 }
17556 /* If this is the first, we can try a parenthesized
17557 declarator. */
17559 {
17565 /* Consume the `('. */
17567 /* Parse the nested declarator. */
17570 declarator
17576 /* Expect a `)'. */
17583 }
17584 /* Otherwise, we must be done. */
17585 else
17587 }
17591 {
17592 /* Parse an array-declarator. */
17601 /* Consume the `['. */
17603 /* Peek at the next token. */
17605 /* If the next token is `]', then there is no
17606 constant-expression. */
17608 {
17610 bounds
17620 {
17621 /* Normally, the array bound must be an integral constant
17622 expression. However, as an extension, we allow VLAs
17623 in function scopes as long as they aren't part of a
17624 parameter declaration. */
17628 }
17631 {
17632 /* Remember this wasn't a constant-expression. */
17635 }
17636 }
17637 else
17639 /* Look for the closing `]'. */
17641 {
17644 }
17649 }
17651 {
17652 {
17653 tree qualifying_scope;
17654 tree unqualified_name;
17655 tree attrs;
17656 special_function_kind sfk;
17661 /* Parse a declarator-id */
17664 {
17667 /* If we see an ellipsis, we should be looking at a
17668 parameter pack. */
17670 {
17671 /* Consume the `...' */
17675 }
17676 }
17679 unqualified_name
17683 {
17687 {
17688 /* Check whether an error occurred. */
17691 /* We already consumed the ellipsis to mark a
17692 parameter pack, but we have no way to report it,
17693 so abort the tentative parse. We will be exiting
17694 immediately anyway. */
17696 }
17697 else
17703 && (qualifying_scope
17705 {
17708 }
17709 }
17714 {
17719 }
17725 {
17726 /* In the declaration of a member of a template class
17727 outside of the class itself, the SCOPE will sometimes
17728 be a TYPENAME_TYPE. For example, given:
17730 template <typename T>
17731 int S<T>::R::i = 3;
17733 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17734 this context, we must resolve S<T>::R to an ordinary
17735 type, rather than a typename type.
17737 The reason we normally avoid resolving TYPENAME_TYPEs
17738 is that a specialization of `S' might render
17739 `S<T>::R' not a type. However, if `S' is
17740 specialized, then this `i' will not be used, so there
17741 is no harm in resolving the types here. */
17742 tree type;
17744 /* Resolve the TYPENAME_TYPE. */
17747 /* If that failed, the declarator is invalid. */
17749 {
17752 "cannot define member of dependent typedef "
17754 else
17759 }
17761 }
17766 {
17767 tree class_type;
17772 else
17776 {
17779 {
17782 {
17786 "use %<%T::%D%> instead of %<%T::%D%> to "
17788 class_type,
17793 }
17794 else
17796 }
17797 else
17798 {
17799 /* We do not attempt to print the declarator
17800 here because we do not have enough
17801 information about its original syntactic
17802 form. */
17806 }
17807 }
17810 {
17816 for an anonymous type, even if the type
17817 got a name for linkage purposes. */
17819 /* Handle correctly (c++/19200):
17821 struct S {
17822 struct T{};
17823 friend void S(T);
17824 };
17826 and also:
17828 namespace N {
17829 void S();
17830 }
17832 struct S {
17833 friend void N::S();
17834 }; */
17835 && !(friend_p
17838 class_type))
17839 {
17842 }
17850 }
17851 }
17853 unqualified_name,
17854 sfk);
17861 }
17863 handle_declarator:;
17866 {
17867 /* Any names that appear after the declarator-id for a
17868 member are looked up in the containing scope. */
17870 {
17871 /* But declarations with qualified-ids can't appear in a
17872 function. */
17876 }
17878 }
17882 /* Default args are only allowed on function
17883 declarations. */
17885 else
17889 }
17890 /* We're done. */
17891 else
17893 }
17895 /* For an abstract declarator, we might wind up with nothing at this
17896 point. That's an error; the declarator is not optional. */
17900 /* If we entered a scope, we must exit it now. */
17908 }
17910 /* Parse a ptr-operator.
17912 ptr-operator:
17913 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17914 * cv-qualifier-seq [opt]
17915 &
17916 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17917 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17919 GNU Extension:
17921 ptr-operator:
17922 & cv-qualifier-seq [opt]
17924 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17925 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17926 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17927 filled in with the TYPE containing the member. *CV_QUALS is
17928 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17929 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17930 Note that the tree codes returned by this function have nothing
17931 to do with the types of trees that will be eventually be created
17932 to represent the pointer or reference type being parsed. They are
17933 just constants with suggestive names. */
17934 static enum tree_code
17939 {
17944 /* Assume that it's not a pointer-to-member. */
17946 /* And that there are no cv-qualifiers. */
17949 /* Peek at the next token. */
17952 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17962 {
17963 /* Consume the `*', `&' or `&&'. */
17966 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17967 `&', if we are allowing GNU extensions. (The only qualifier
17968 that can legally appear after `&' is `restrict', but that is
17969 enforced during semantic analysis. */
17977 }
17978 else
17979 {
17980 /* Try the pointer-to-member case. */
17982 /* Look for the optional `::' operator. */
17985 /* Look for the nested-name specifier. */
17992 /* If we found it, and the next token is a `*', then we are
17993 indeed looking at a pointer-to-member operator. */
17996 {
17997 /* Indicate that the `*' operator was used. */
18005 else
18006 {
18007 /* The type of which the member is a member is given by the
18008 current SCOPE. */
18010 /* The next name will not be qualified. */
18014 /* Look for optional c++11 attributes. */
18018 /* Look for the optional cv-qualifier-seq. */
18020 }
18021 }
18022 /* If that didn't work we don't have a ptr-operator. */
18025 }
18028 }
18030 /* Parse an (optional) cv-qualifier-seq.
18032 cv-qualifier-seq:
18033 cv-qualifier cv-qualifier-seq [opt]
18035 cv-qualifier:
18036 const
18037 volatile
18039 GNU Extension:
18041 cv-qualifier:
18042 __restrict__
18044 Returns a bitmask representing the cv-qualifiers. */
18046 static cp_cv_quals
18048 {
18052 {
18054 cp_cv_quals cv_qualifier;
18056 /* Peek at the next token. */
18058 /* See if it's a cv-qualifier. */
18060 {
18076 }
18082 {
18085 }
18086 else
18087 {
18090 }
18091 }
18094 }
18096 /* Parse an (optional) ref-qualifier
18098 ref-qualifier:
18099 &
18100 &&
18102 Returns cp_ref_qualifier representing ref-qualifier. */
18104 static cp_ref_qualifier
18106 {
18109 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18114 {
18119 {
18131 }
18136 {
18139 }
18140 else
18141 {
18144 }
18145 }
18148 }
18150 /* Parse an (optional) virt-specifier-seq.
18152 virt-specifier-seq:
18153 virt-specifier virt-specifier-seq [opt]
18155 virt-specifier:
18156 override
18157 final
18159 Returns a bitmask representing the virt-specifiers. */
18161 static cp_virt_specifiers
18163 {
18167 {
18169 cp_virt_specifiers virt_specifier;
18171 /* Peek at the next token. */
18173 /* See if it's a virt-specifier-qualifier. */
18177 {
18180 }
18182 {
18185 }
18187 {
18189 }
18190 else
18194 {
18197 }
18198 else
18199 {
18202 }
18203 }
18205 }
18207 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18208 is in scope even though it isn't real. */
18210 void
18212 {
18213 tree this_parm;
18216 {
18217 /* We don't clear this between NSDMIs. Is it already what we want? */
18222 }
18225 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18227 current_class_ref
18230 }
18232 /* Return true iff our current scope is a non-static data member
18233 initializer. */
18235 bool
18237 {
18238 /* We recognize NSDMI context by the context-less 'this' pointer set up
18239 by the function above. */
18243 }
18245 /* Parse a late-specified return type, if any. This is not a separate
18246 non-terminal, but part of a function declarator, which looks like
18248 -> trailing-type-specifier-seq abstract-declarator(opt)
18250 Returns the type indicated by the type-id.
18252 In addition to this this parses any queued up omp declare simd
18253 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18255 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18256 function. */
18258 static tree
18260 cp_cv_quals quals)
18261 {
18265 && declarator
18271 /* Peek at the next token. */
18273 /* A late-specified return type is indicated by an initial '->'. */
18280 {
18281 /* DR 1207: 'this' is in scope in the trailing return type. */
18283 }
18286 {
18287 /* Consume the ->. */
18291 }
18294 declarator->std_attributes
18298 declarator->std_attributes
18303 {
18306 }
18309 }
18311 /* Parse a declarator-id.
18313 declarator-id:
18314 id-expression
18315 :: [opt] nested-name-specifier [opt] type-name
18317 In the `id-expression' case, the value returned is as for
18318 cp_parser_id_expression if the id-expression was an unqualified-id.
18319 If the id-expression was a qualified-id, then a SCOPE_REF is
18320 returned. The first operand is the scope (either a NAMESPACE_DECL
18321 or TREE_TYPE), but the second is still just a representation of an
18322 unqualified-id. */
18324 static tree
18326 {
18327 tree id;
18328 /* The expression must be an id-expression. Assume that qualified
18329 names are the names of types so that:
18331 template <class T>
18332 int S<T>::R::i = 3;
18334 will work; we must treat `S<T>::R' as the name of a type.
18335 Similarly, assume that qualified names are templates, where
18336 required, so that:
18338 template <class T>
18339 int S<T>::R<T>::i = 3;
18341 will work, too. */
18347 optional_p);
18351 }
18353 /* Parse a type-id.
18355 type-id:
18356 type-specifier-seq abstract-declarator [opt]
18358 Returns the TYPE specified. */
18360 static tree
18363 {
18364 cp_decl_specifier_seq type_specifier_seq;
18367 /* Parse the type-specifier-seq. */
18369 is_trailing_return,
18374 /* There might or might not be an abstract declarator. */
18376 /* Look for the declarator. */
18377 abstract_declarator
18382 /* Check to see if there really was a declarator. */
18387 /* None of the valid uses of 'auto' in C++14 involve the type-id
18388 nonterminal, but it is valid in a trailing-return-type. */
18391 {
18392 /* A type-id with type 'auto' is only ok if the abstract declarator
18393 is a function declarator with a late-specified return type. */
18398 else
18399 {
18402 }
18403 }
18406 is_template_arg);
18407 }
18410 {
18412 }
18415 {
18416 tree r;
18418 parser->type_definition_forbidden_message
18423 {
18426 }
18428 }
18431 {
18433 }
18435 /* Parse a type-specifier-seq.
18437 type-specifier-seq:
18438 type-specifier type-specifier-seq [opt]
18440 GNU extension:
18442 type-specifier-seq:
18443 attributes type-specifier-seq [opt]
18445 If IS_DECLARATION is true, we are at the start of a "condition" or
18446 exception-declaration, so we might be followed by a declarator-id.
18448 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18449 i.e. we've just seen "->".
18451 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18453 static void
18458 {
18463 /* Clear the TYPE_SPECIFIER_SEQ. */
18466 /* In the context of a trailing return type, enum E { } is an
18467 elaborated-type-specifier followed by a function-body, not an
18468 enum-specifier. */
18472 /* Parse the type-specifiers and attributes. */
18474 {
18475 tree type_specifier;
18478 /* Check for attributes first. */
18480 {
18485 }
18487 /* record the token of the beginning of the type specifier seq,
18488 for error reporting purposes*/
18492 /* Look for the type-specifier. */
18494 flags,
18495 type_specifier_seq,
18497 NULL,
18500 {
18501 /* If the first type-specifier could not be found, this is not a
18502 type-specifier-seq at all. */
18504 {
18505 /* Set in_declarator_p to avoid skipping to the semicolon. */
18517 }
18518 /* If subsequent type-specifiers could not be found, the
18519 type-specifier-seq is complete. */
18521 }
18524 /* The standard says that a condition can be:
18526 type-specifier-seq declarator = assignment-expression
18528 However, given:
18530 struct S {};
18531 if (int S = ...)
18533 we should treat the "S" as a declarator, not as a
18534 type-specifier. The standard doesn't say that explicitly for
18535 type-specifier-seq, but it does say that for
18536 decl-specifier-seq in an ordinary declaration. Perhaps it
18537 would be clearer just to allow a decl-specifier-seq here, and
18538 then add a semantic restriction that if any decl-specifiers
18539 that are not type-specifiers appear, the program is invalid. */
18542 }
18543 }
18545 /* Return whether the function currently being declared has an associated
18546 template parameter list. */
18548 static bool
18550 {
18563 }
18565 /* Parse a parameter-declaration-clause.
18567 parameter-declaration-clause:
18568 parameter-declaration-list [opt] ... [opt]
18569 parameter-declaration-list , ...
18571 Returns a representation for the parameter declarations. A return
18572 value of NULL indicates a parameter-declaration-clause consisting
18573 only of an ellipsis. */
18575 static tree
18577 {
18578 tree parameters;
18587 parser->auto_is_implicit_function_template_parm_p
18589 }
18595 && !processing_template_parmlist
18601 /* Peek at the next token. */
18603 /* Check for trivial parameter-declaration-clauses. */
18605 {
18606 /* Consume the `...' token. */
18609 }
18611 /* There are no parameters. */
18612 {
18613 #ifndef NO_IMPLICIT_EXTERN_C
18618 else
18619 #endif
18621 }
18622 /* Check for `(void)', too, which is a special case. */
18626 {
18627 /* Consume the `void' token. */
18629 /* There are no parameters. */
18631 }
18633 /* Parse the parameter-declaration-list. */
18635 /* If a parse error occurred while parsing the
18636 parameter-declaration-list, then the entire
18637 parameter-declaration-clause is erroneous. */
18641 /* Peek at the next token. */
18643 /* If it's a `,', the clause should terminate with an ellipsis. */
18645 {
18646 /* Consume the `,'. */
18648 /* Expect an ellipsis. */
18649 ellipsis_p
18651 }
18652 /* It might also be `...' if the optional trailing `,' was
18653 omitted. */
18655 {
18656 /* Consume the `...' token. */
18658 /* And remember that we saw it. */
18660 }
18661 else
18664 /* Finish the parameter list. */
18669 }
18671 /* Parse a parameter-declaration-list.
18673 parameter-declaration-list:
18674 parameter-declaration
18675 parameter-declaration-list , parameter-declaration
18677 Returns a representation of the parameter-declaration-list, as for
18678 cp_parser_parameter_declaration_clause. However, the
18679 `void_list_node' is never appended to the list. Upon return,
18680 *IS_ERROR will be true iff an error occurred. */
18682 static tree
18684 {
18690 /* Assume all will go well. */
18692 /* The special considerations that apply to a function within an
18693 unbraced linkage specifications do not apply to the parameters
18694 to the function. */
18695 saved_in_unbraced_linkage_specification_p
18699 /* Look for more parameters. */
18701 {
18709 /* Parse the parameter. */
18710 parameter
18715 /* We don't know yet if the enclosing context is deprecated, so wait
18716 and warn in grokparms if appropriate. */
18720 {
18721 /* If a function parameter pack was specified and an implicit template
18722 parameter was introduced during cp_parser_parameter_declaration,
18723 change any implicit parameters introduced into packs. */
18727 {
18735 }
18739 PARM,
18742 }
18746 /* If a parse error occurred parsing the parameter declaration,
18747 then the entire parameter-declaration-list is erroneous. */
18749 {
18753 }
18763 {
18767 }
18769 /* Add the new parameter to the list. */
18773 /* Peek at the next token. */
18776 /* These are for Objective-C++ */
18779 /* The parameter-declaration-list is complete. */
18782 {
18785 /* Peek at the next token. */
18787 /* If it's an ellipsis, then the list is complete. */
18790 /* Otherwise, there must be more parameters. Consume the
18791 `,'. */
18793 /* When parsing something like:
18795 int i(float f, double d)
18797 we can tell after seeing the declaration for "f" that we
18798 are not looking at an initialization of a variable "i",
18799 but rather at the declaration of a function "i".
18801 Due to the fact that the parsing of template arguments
18802 (as specified to a template-id) requires backtracking we
18803 cannot use this technique when inside a template argument
18804 list. */
18808 /* However, a parameter-declaration of the form
18809 "float(f)" (which is a valid declaration of a
18810 parameter "f") can also be interpreted as an
18811 expression (the conversion of "f" to "float"). */
18814 }
18815 else
18816 {
18824 }
18825 }
18827 parser->in_unbraced_linkage_specification_p
18830 /* Reset implicit_template_scope if we are about to leave the function
18831 parameter list that introduced it. Note that for out-of-line member
18832 definitions, there will be one or more class scopes before we get to
18833 the template parameter scope. */
18837 {
18841 {
18844 }
18845 }
18848 }
18850 /* Parse a parameter declaration.
18852 parameter-declaration:
18853 decl-specifier-seq ... [opt] declarator
18854 decl-specifier-seq declarator = assignment-expression
18855 decl-specifier-seq ... [opt] abstract-declarator [opt]
18856 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18858 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18859 declares a template parameter. (In that case, a non-nested `>'
18860 token encountered during the parsing of the assignment-expression
18861 is not interpreted as a greater-than operator.)
18863 Returns a representation of the parameter, or NULL if an error
18864 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18865 true iff the declarator is of the form "(p)". */
18871 {
18873 cp_decl_specifier_seq decl_specifiers;
18875 tree default_argument;
18879 /* In a template parameter, `>' is not an operator.
18881 [temp.param]
18883 When parsing a default template-argument for a non-type
18884 template-parameter, the first non-nested `>' is taken as the end
18885 of the template parameter-list rather than a greater-than
18886 operator. */
18888 /* Type definitions may not appear in parameter types. */
18890 parser->type_definition_forbidden_message
18893 /* Parse the declaration-specifiers. */
18895 CP_PARSER_FLAGS_NONE,
18899 /* Complain about missing 'typename' or other invalid type names. */
18904 /* If an error occurred, there's no reason to attempt to parse the
18905 rest of the declaration. */
18907 {
18910 }
18912 /* Peek at the next token. */
18915 /* If the next token is a `)', `,', `=', `>', or `...', then there
18916 is no declarator. However, when variadic templates are enabled,
18917 there may be a declarator following `...'. */
18922 {
18926 }
18927 /* Otherwise, there should be a declarator. */
18928 else
18929 {
18933 /* After seeing a decl-specifier-seq, if the next token is not a
18934 "(", there is no possibility that the code is a valid
18935 expression. Therefore, if parsing tentatively, we commit at
18936 this point. */
18938 /* In an expression context, having seen:
18940 (int((char ...
18942 we cannot be sure whether we are looking at a
18943 function-type (taking a "char" as a parameter) or a cast
18944 of some object of type "char" to "int". */
18950 /* Parse the declarator. */
18953 CP_PARSER_DECLARATOR_EITHER,
18955 parenthesized_p,
18959 /* After the declarator, allow more attributes. */
18960 decl_specifiers.attributes
18963 }
18965 /* If the next token is an ellipsis, and we have not seen a
18966 declarator name, and the type of the declarator contains parameter
18967 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18968 a parameter pack expansion expression. Otherwise, leave the
18969 ellipsis for a C-style variadic function. */
18972 {
18983 {
18984 /* Consume the `...'. */
18988 /* Build a pack expansion type */
18991 else
18993 }
18994 }
18996 /* The restriction on defining new types applies only to the type
18997 of the parameter, not to the default argument. */
19000 /* If the next token is `=', then process a default argument. */
19002 {
19004 /* If we are defining a class, then the tokens that make up the
19005 default argument must be saved and processed later. */
19010 /* Outside of a class definition, we can just parse the
19011 assignment-expression. */
19012 else
19013 default_argument
19017 {
19020 else
19021 {
19023 "default arguments are only "
19026 }
19027 }
19031 {
19032 /* Find the name of the parameter pack. */
19039 template_parm_p
19045 else
19047 template_parm_p
19054 }
19055 }
19056 else
19060 declarator,
19061 default_argument);
19062 }
19064 /* Parse a default argument and return it.
19066 TEMPLATE_PARM_P is true if this is a default argument for a
19067 non-type template parameter. */
19068 static tree
19070 {
19076 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19077 set correctly. */
19080 /* Local variable names (and the `this' keyword) may not
19081 appear in a default argument. */
19084 /* Parse the assignment-expression. */
19089 /* The "this" pointer is not valid in a default argument. */
19091 {
19096 }
19097 default_argument
19099 /* Restore the "this" pointer. */
19101 {
19104 }
19113 }
19115 /* Parse a function-body.
19117 function-body:
19118 compound_statement */
19120 static void
19122 {
19124 }
19126 /* Parse a ctor-initializer-opt followed by a function-body. Return
19127 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19128 is true we are parsing a function-try-block. */
19130 static bool
19133 {
19141 /* Begin the function body. */
19143 /* Parse the optional ctor-initializer. */
19146 /* If we're parsing a constexpr constructor definition, we need
19147 to check that the constructor body is indeed empty. However,
19148 before we get to cp_parser_function_body lot of junk has been
19149 generated, so we can't just check that we have an empty block.
19150 Rather we take a snapshot of the outermost block, and check whether
19151 cp_parser_function_body changed its state. */
19153 {
19157 }
19158 /* Parse the function-body. */
19162 /* Finish the function body. */
19166 }
19168 /* Parse an initializer.
19170 initializer:
19171 = initializer-clause
19172 ( expression-list )
19174 Returns an expression representing the initializer. If no
19175 initializer is present, NULL_TREE is returned.
19177 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19178 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19179 set to TRUE if there is no initializer present. If there is an
19180 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19181 is set to true; otherwise it is set to false. */
19183 static tree
19186 {
19188 tree init;
19190 /* Peek at the next token. */
19193 /* Let our caller know whether or not this initializer was
19194 parenthesized. */
19196 /* Assume that the initializer is constant. */
19200 {
19201 /* Consume the `='. */
19203 /* Parse the initializer-clause. */
19205 }
19207 {
19212 non_constant_p);
19217 }
19219 {
19224 }
19225 else
19226 {
19227 /* Anything else is an error. */
19230 }
19233 }
19235 /* Parse an initializer-clause.
19237 initializer-clause:
19238 assignment-expression
19239 braced-init-list
19241 Returns an expression representing the initializer.
19243 If the `assignment-expression' production is used the value
19244 returned is simply a representation for the expression.
19246 Otherwise, calls cp_parser_braced_list. */
19248 static tree
19250 {
19251 tree initializer;
19253 /* Assume the expression is constant. */
19256 /* If it is not a `{', then we are looking at an
19257 assignment-expression. */
19259 {
19260 initializer
19263 non_constant_p);
19264 }
19265 else
19269 }
19271 /* Parse a brace-enclosed initializer list.
19273 braced-init-list:
19274 { initializer-list , [opt] }
19275 { }
19277 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19278 the elements of the initializer-list (or NULL, if the last
19279 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19280 NULL_TREE. There is no way to detect whether or not the optional
19281 trailing `,' was provided. NON_CONSTANT_P is as for
19282 cp_parser_initializer. */
19284 static tree
19286 {
19287 tree initializer;
19289 /* Consume the `{' token. */
19291 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19293 /* If it's not a `}', then there is a non-trivial initializer. */
19295 {
19296 /* Parse the initializer list. */
19299 /* A trailing `,' token is allowed. */
19302 }
19303 else
19305 /* Now, there should be a trailing `}'. */
19309 }
19311 /* Consume tokens up to, and including, the next non-nested closing `]'.
19312 Returns true iff we found a closing `]'. */
19314 static bool
19316 {
19320 {
19324 {
19327 /* If we've run out of tokens, then there is no closing `]'. */
19336 {
19339 }
19344 }
19346 /* Consume the token. */
19348 }
19349 }
19351 /* Return true if we are looking at an array-designator, false otherwise. */
19353 static bool
19355 {
19356 /* Consume the `['. */
19361 /* Skip tokens until the next token is a closing square bracket.
19362 If we find the closing `]', and the next token is a `=', then
19363 we are looking at an array designator. */
19364 bool array_designator_p
19368 /* Roll back the tokens we skipped. */
19372 }
19374 /* Parse an initializer-list.
19376 initializer-list:
19377 initializer-clause ... [opt]
19378 initializer-list , initializer-clause ... [opt]
19380 GNU Extension:
19382 initializer-list:
19383 designation initializer-clause ...[opt]
19384 initializer-list , designation initializer-clause ...[opt]
19386 designation:
19387 . identifier =
19388 identifier :
19389 [ constant-expression ] =
19391 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19392 for the initializer. If the INDEX of the elt is non-NULL, it is the
19393 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19394 as for cp_parser_initializer. */
19398 {
19401 /* Assume all of the expressions are constant. */
19404 /* Parse the rest of the list. */
19406 {
19408 tree designator;
19409 tree initializer;
19412 /* If the next token is an identifier and the following one is a
19413 colon, we are looking at the GNU designated-initializer
19414 syntax. */
19418 {
19419 /* Warn the user that they are using an extension. */
19422 /* Consume the identifier. */
19424 /* Consume the `:'. */
19426 }
19427 /* Also handle the C99 syntax, '. id ='. */
19432 {
19433 /* Warn the user that they are using an extension. */
19436 /* Consume the `.'. */
19438 /* Consume the identifier. */
19440 /* Consume the `='. */
19442 }
19443 /* Also handle C99 array designators, '[ const ] ='. */
19447 {
19448 /* In C++11, [ could start a lambda-introducer. */
19454 {
19457 }
19458 else
19459 {
19464 }
19470 }
19471 else
19474 /* Parse the initializer. */
19477 /* If any clause is non-constant, so is the entire initializer. */
19481 /* If we have an ellipsis, this is an initializer pack
19482 expansion. */
19484 {
19485 /* Consume the `...'. */
19488 /* Turn the initializer into an initializer expansion. */
19490 }
19492 /* Add it to the vector. */
19495 /* If the next token is not a comma, we have reached the end of
19496 the list. */
19500 /* Peek at the next token. */
19502 /* If the next token is a `}', then we're still done. An
19503 initializer-clause can have a trailing `,' after the
19504 initializer-list and before the closing `}'. */
19508 /* Consume the `,' token. */
19510 }
19513 }
19515 /* Classes [gram.class] */
19517 /* Parse a class-name.
19519 class-name:
19520 identifier
19521 template-id
19523 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19524 to indicate that names looked up in dependent types should be
19525 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19526 keyword has been used to indicate that the name that appears next
19527 is a template. TAG_TYPE indicates the explicit tag given before
19528 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19529 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19530 is the class being defined in a class-head.
19532 Returns the TYPE_DECL representing the class. */
19534 static tree
19542 {
19543 tree decl;
19544 tree scope;
19549 /* All class-names start with an identifier. */
19552 {
19555 }
19557 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19558 to a template-id, so we save it here. */
19563 /* Any name names a type if we're following the `typename' keyword
19564 in a qualified name where the enclosing scope is type-dependent. */
19567 /* Handle the common case (an identifier, but not a template-id)
19568 efficiently. */
19571 {
19575 /* Look for the identifier. */
19579 /* If the next token isn't an identifier, we are certainly not
19580 looking at a class-name. */
19583 /* If we know this is a type-name, there's no need to look it
19584 up. */
19587 else
19588 {
19589 tree ambiguous_decls;
19590 /* If we already know that this lookup is ambiguous, then
19591 we've already issued an error message; there's no reason
19592 to check again. */
19594 {
19597 }
19598 /* If the next token is a `::', then the name must be a type
19599 name.
19601 [basic.lookup.qual]
19603 During the lookup for a name preceding the :: scope
19604 resolution operator, object, function, and enumerator
19605 names are ignored. */
19608 /* Look up the name. */
19610 tag_type,
19613 check_dependency_p,
19617 {
19621 }
19622 }
19623 }
19624 else
19625 {
19626 /* Try a template-id. */
19628 check_dependency_p,
19629 tag_type,
19630 is_declaration);
19633 }
19637 /* If this is a typename, create a TYPENAME_TYPE. */
19639 {
19644 }
19648 /* Check to see that it is really the name of a class. */
19652 /* Situations like this:
19654 template <typename T> struct A {
19655 typename T::template X<int>::I i;
19656 };
19658 are problematic. Is `T::template X<int>' a class-name? The
19659 standard does not seem to be definitive, but there is no other
19660 valid interpretation of the following `::'. Therefore, those
19661 names are considered class-names. */
19662 {
19666 }
19670 /* In Objective-C 2.0, a classname followed by '.' starts a
19671 dot-syntax expression, and it's not a type-name. */
19683 }
19685 /* Parse a class-specifier.
19687 class-specifier:
19688 class-head { member-specification [opt] }
19690 Returns the TREE_TYPE representing the class. */
19692 static tree
19694 {
19695 tree type;
19709 /* Parse the class-head. */
19712 /* If the class-head was a semantic disaster, skip the entire body
19713 of the class. */
19715 {
19719 }
19721 /* Look for the `{'. */
19723 {
19726 }
19730 /* Issue an error message if type-definitions are forbidden here. */
19732 /* Remember that we are defining one more class. */
19734 /* Inside the class, surrounding template-parameter-lists do not
19735 apply. */
19736 saved_num_template_parameter_lists
19739 /* We are not in a function body. */
19742 /* Or in a loop. */
19745 /* Or in a switch. */
19748 /* We are not immediately inside an extern "lang" block. */
19749 saved_in_unbraced_linkage_specification_p
19753 /* Start the class. */
19755 {
19758 }
19762 /* If the type is erroneous, skip the entire body of the class. */
19764 else
19765 /* Parse the member-specification. */
19768 /* Look for the trailing `}'. */
19770 /* Look for trailing attributes to apply to this class. */
19778 /* We've finished a type definition. Check for the common syntax
19779 error of forgetting a semicolon after the definition. We need to
19780 be careful, as we can't just check for not-a-semicolon and be done
19781 with it; the user might have typed:
19783 class X { } c = ...;
19784 class X { } *p = ...;
19786 and so forth. Instead, enumerate all the possible tokens that
19787 might follow this production; if we don't see one of them, then
19788 complain and silently insert the semicolon. */
19789 {
19794 /* Don't try to parse c++11 attributes here. As per the
19795 grammar, that should be a task for
19796 cp_parser_decl_specifier_seq. */
19800 {
19811 /* While it's legal for type qualifiers and storage class
19812 specifiers to follow type definitions in the grammar, only
19813 compiler testsuites contain code like that. Assume that if
19814 we see such code, then what we're really seeing is a case
19815 like:
19817 class X { }
19818 const <type> var = ...;
19820 or
19822 class Y { }
19823 static <type> func (...) ...
19825 i.e. the qualifier or specifier applies to the next
19826 declaration. To do so, however, we need to look ahead one
19827 more token to see if *that* token is a type specifier.
19829 This code could be improved to handle:
19831 class Z { }
19832 static const <type> var = ...; */
19835 {
19838 /* Handling user-defined types here would be nice, but very
19839 tricky. */
19840 want_semicolon
19843 }
19847 }
19849 /* If we don't have a type, then something is very wrong and we
19850 shouldn't try to do anything clever. Likewise for not seeing the
19851 closing brace. */
19853 {
19854 cp_token_position prev
19865 else
19868 /* Unget one token and smash it to look as though we encountered
19869 a semicolon in the input stream. */
19874 }
19875 }
19877 /* If this class is not itself within the scope of another class,
19878 then we need to parse the bodies of all of the queued function
19879 definitions. Note that the queued functions defined in a class
19880 are not always processed immediately following the
19881 class-specifier for that class. Consider:
19883 struct A {
19884 struct B { void f() { sizeof (A); } };
19885 };
19887 If `f' were processed before the processing of `A' were
19888 completed, there would be no way to compute the size of `A'.
19889 Note that the nesting we are interested in here is lexical --
19890 not the semantic nesting given by TYPE_CONTEXT. In particular,
19891 for:
19893 struct A { struct B; };
19894 struct A::B { void f() { } };
19896 there is no need to delay the parsing of `A::B::f'. */
19898 {
19899 tree decl;
19906 /* In a first pass, parse default arguments to the functions.
19907 Then, in a second pass, parse the bodies of the functions.
19908 This two-phased approach handles cases like:
19910 struct S {
19911 void f() { g(); }
19912 void g(int i = 3);
19913 };
19915 */
19917 {
19919 /* If there are default arguments that have not yet been processed,
19920 take care of them now. */
19922 {
19927 }
19928 /* Make sure that any template parameters are in scope. */
19930 /* Parse the default argument expressions. */
19932 /* Remove any template parameters from the symbol table. */
19934 }
19936 /* Now parse any NSDMIs. */
19940 {
19942 {
19947 }
19950 }
19957 /* Now do some post-NSDMI bookkeeping. */
19963 /* Now parse the body of the functions. */
19965 {
19966 /* OpenMP UDRs need to be parsed before all other functions. */
19973 }
19974 else
19978 }
19979 else
19982 /* Put back any saved access checks. */
19985 /* Restore saved state. */
19989 parser->num_template_parameter_lists
19991 parser->in_unbraced_linkage_specification_p
19995 }
19997 static tree
19999 {
20000 tree ret;
20005 }
20007 /* Parse a class-head.
20009 class-head:
20010 class-key identifier [opt] base-clause [opt]
20011 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20012 class-key nested-name-specifier [opt] template-id
20013 base-clause [opt]
20015 class-virt-specifier:
20016 final
20018 GNU Extensions:
20019 class-key attributes identifier [opt] base-clause [opt]
20020 class-key attributes nested-name-specifier identifier base-clause [opt]
20021 class-key attributes nested-name-specifier [opt] template-id
20022 base-clause [opt]
20024 Upon return BASES is initialized to the list of base classes (or
20025 NULL, if there are none) in the same form returned by
20026 cp_parser_base_clause.
20028 Returns the TYPE of the indicated class. Sets
20029 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20030 involving a nested-name-specifier was used, and FALSE otherwise.
20032 Returns error_mark_node if this is not a class-head.
20034 Returns NULL_TREE if the class-head is syntactically valid, but
20035 semantically invalid in a way that means we should skip the entire
20036 body of the class. */
20038 static tree
20041 {
20042 tree nested_name_specifier;
20046 tree attributes;
20047 tree bases;
20057 /* Assume no nested-name-specifier will be present. */
20059 /* Assume no template parameter lists will be used in defining the
20060 type. */
20064 /* Look for the class-key. */
20069 /* Parse the attributes. */
20072 /* If the next token is `::', that is invalid -- but sometimes
20073 people do try to write:
20075 struct ::S {};
20077 Handle this gracefully by accepting the extra qualifier, and then
20078 issuing an error about it later if this really is a
20079 class-head. If it turns out just to be an elaborated type
20080 specifier, remain silent. */
20086 /* Determine the name of the class. Begin by looking for an
20087 optional nested-name-specifier. */
20089 nested_name_specifier
20095 /* If there was a nested-name-specifier, then there *must* be an
20096 identifier. */
20098 {
20100 /* Although the grammar says `identifier', it really means
20101 `class-name' or `template-name'. You are only allowed to
20102 define a class that has already been declared with this
20103 syntax.
20105 The proposed resolution for Core Issue 180 says that wherever
20106 you see `class T::X' you should treat `X' as a type-name.
20108 It is OK to define an inaccessible class; for example:
20110 class A { class B; };
20111 class A::B {};
20113 We do not know if we will see a class-name, or a
20114 template-name. We look for a class-name first, in case the
20115 class-name is a template-id; if we looked for the
20116 template-name first we would stop after the template-name. */
20121 class_type,
20125 /* If that didn't work, ignore the nested-name-specifier. */
20127 {
20133 }
20134 /* If we could not find a corresponding TYPE, treat this
20135 declaration like an unqualified declaration. */
20138 /* Otherwise, count the number of templates used in TYPE and its
20139 containing scopes. */
20140 else
20141 {
20142 tree scope;
20154 }
20155 }
20156 /* Otherwise, the identifier is optional. */
20157 else
20158 {
20159 /* We don't know whether what comes next is a template-id,
20160 an identifier, or nothing at all. */
20162 /* Check for a template-id. */
20167 class_key,
20169 /* If that didn't work, it could still be an identifier. */
20171 {
20173 {
20176 }
20177 else
20179 }
20180 else
20181 {
20184 }
20185 }
20190 {
20192 class_key,
20194 }
20197 /* If it's not a `:' or a `{' then we can't really be looking at a
20198 class-head, since a class-head only appears as part of a
20199 class-specifier. We have to detect this situation before calling
20200 xref_tag, since that has irreversible side-effects. */
20202 {
20206 }
20208 /* At this point, we're going ahead with the class-specifier, even
20209 if some other problem occurs. */
20212 {
20217 }
20218 /* Issue the error about the overly-qualified name now. */
20220 {
20225 }
20227 {
20232 }
20234 {
20235 tree scope;
20237 /* Reject typedef-names in class heads. */
20239 {
20242 type);
20245 }
20247 /* Figure out in what scope the declaration is being placed. */
20249 /* If that scope does not contain the scope in which the
20250 class was originally declared, the program is invalid. */
20252 {
20255 "declaration of %qD in namespace %qD which does not "
20258 else
20264 }
20265 /* [dcl.meaning]
20267 A declarator-id shall not be qualified except for the
20268 definition of a ... nested class outside of its class
20269 ... [or] the definition or explicit instantiation of a
20270 class member of a namespace outside of its namespace. */
20272 {
20277 }
20278 }
20279 /* An explicit-specialization must be preceded by "template <>". If
20280 it is not, try to recover gracefully. */
20284 {
20288 /* Take the same action that would have been taken by
20289 cp_parser_explicit_specialization. */
20292 }
20293 /* There must be no "return" statements between this point and the
20294 end of this function; set "type "to the correct return value and
20295 use "goto done;" to return. */
20296 /* Make sure that the right number of template parameters were
20297 present. */
20301 {
20302 /* If something went wrong, there is no point in even trying to
20303 process the class-definition. */
20306 }
20308 /* Look up the type. */
20310 {
20314 {
20318 }
20319 else
20320 {
20323 }
20326 }
20328 {
20329 tree class_type;
20331 /* Given:
20333 template <typename T> struct S { struct T };
20334 template <typename T> struct S<T>::T { };
20336 we will get a TYPENAME_TYPE when processing the definition of
20337 `S::T'. We need to resolve it to the actual type before we
20338 try to define it. */
20340 {
20345 else
20346 {
20349 }
20350 }
20354 {
20357 }
20360 /* Enter the scope indicated by the nested-name-specifier. */
20362 /* Get the canonical version of this type. */
20364 /* Call push_template_decl if it seems like we should be defining a
20365 template either from the template headers or the type we're
20366 defining, so that we diagnose both extra and missing headers. */
20370 {
20373 {
20376 }
20377 }
20381 }
20383 {
20384 /* If the class was unnamed, create a dummy name. */
20389 }
20391 /* Indicate whether this class was declared as a `class' or as a
20392 `struct'. */
20397 /* If this type was already complete, and we see another definition,
20398 that's an error. */
20400 {
20402 type);
20404 type);
20407 }
20412 {
20413 /* Apply attributes now, before any use of the class as a template
20414 argument in its base list. */
20417 }
20419 /* We will have entered the scope containing the class; the names of
20420 base classes should be looked up in that context. For example:
20422 struct A { struct B {}; struct C; };
20423 struct A::C : B {};
20425 is valid. */
20427 /* Get the list of base-classes, if there is one. */
20429 {
20430 /* PR59482: enter the class scope so that base-specifiers are looked
20431 up correctly. */
20435 /* PR59482: get out of the previously pushed class scope so that the
20436 subsequent pops pop the right thing. */
20439 }
20440 else
20443 /* If we're really defining a class, process the base classes.
20444 If they're invalid, fail. */
20449 done:
20450 /* Leave the scope given by the nested-name-specifier. We will
20451 enter the class scope itself while processing the members. */
20456 {
20459 }
20465 out:
20468 }
20470 /* Parse a class-key.
20472 class-key:
20473 class
20474 struct
20475 union
20477 Returns the kind of class-key specified, or none_type to indicate
20478 error. */
20480 static enum tag_types
20482 {
20486 /* Look for the class-key. */
20491 /* Check to see if the TOKEN is a class-key. */
20496 }
20498 /* Parse a type-parameter-key.
20500 type-parameter-key:
20501 class
20502 typename
20503 */
20505 static void
20507 {
20508 /* Look for the type-parameter-key. */
20512 {
20515 /* typename is not allowed in a template template parameter
20516 by the standard until C++1Z. */
20518 "ISO C++ forbids typename key in template template parameter;"
20520 }
20521 else
20525 }
20527 /* Parse an (optional) member-specification.
20529 member-specification:
20530 member-declaration member-specification [opt]
20531 access-specifier : member-specification [opt] */
20533 static void
20535 {
20537 {
20541 /* Peek at the next token. */
20543 /* If it's a `}', or EOF then we've seen all the members. */
20549 /* See if this token is a keyword. */
20552 {
20556 /* Consume the access-specifier. */
20558 /* Remember which access-specifier is active. */
20560 /* Look for the `:'. */
20565 /* Accept #pragmas at class scope. */
20567 {
20570 }
20572 /* Otherwise, the next construction must be a
20573 member-declaration. */
20575 }
20576 }
20577 }
20579 /* Parse a member-declaration.
20581 member-declaration:
20582 decl-specifier-seq [opt] member-declarator-list [opt] ;
20583 function-definition ; [opt]
20584 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20585 using-declaration
20586 template-declaration
20587 alias-declaration
20589 member-declarator-list:
20590 member-declarator
20591 member-declarator-list , member-declarator
20593 member-declarator:
20594 declarator pure-specifier [opt]
20595 declarator constant-initializer [opt]
20596 identifier [opt] : constant-expression
20598 GNU Extensions:
20600 member-declaration:
20601 __extension__ member-declaration
20603 member-declarator:
20604 declarator attributes [opt] pure-specifier [opt]
20605 declarator attributes [opt] constant-initializer [opt]
20606 identifier [opt] attributes [opt] : constant-expression
20608 C++0x Extensions:
20610 member-declaration:
20611 static_assert-declaration */
20613 static void
20615 {
20616 cp_decl_specifier_seq decl_specifiers;
20617 tree prefix_attributes;
20618 tree decl;
20627 /* Check for the `__extension__' keyword. */
20629 {
20630 /* Recurse. */
20632 /* Restore the old value of the PEDANTIC flag. */
20636 }
20638 /* Check for a template-declaration. */
20640 {
20641 /* An explicit specialization here is an error condition, and we
20642 expect the specialization handler to detect and report this. */
20646 else
20650 }
20652 /* Check for a using-declaration. */
20654 {
20656 {
20657 /* Parse the using-declaration. */
20661 }
20662 else
20663 {
20664 tree decl;
20668 /* Note that if we actually see the '=' token after the
20669 identifier, cp_parser_alias_declaration commits the
20670 tentative parse. In that case, we really expects an
20671 alias-declaration. Otherwise, we expect a using
20672 declaration. */
20673 alias_decl_expected =
20679 else
20683 }
20684 }
20686 /* Check for @defs. */
20688 {
20693 {
20698 }
20700 }
20702 /* If the next token is `static_assert' we have a static assertion. */
20704 {
20707 }
20714 /* Parse the decl-specifier-seq. */
20717 CP_PARSER_FLAGS_OPTIONAL,
20720 /* Check for an invalid type-name. */
20724 /* If there is no declarator, then the decl-specifier-seq should
20725 specify a type. */
20727 {
20728 /* If there was no decl-specifier-seq, and the next token is a
20729 `;', then we have something like:
20731 struct S { ; };
20733 [class.mem]
20735 Each member-declaration shall declare at least one member
20736 name of the class. */
20738 {
20742 }
20743 else
20744 {
20745 tree type;
20747 /* See if this declaration is a friend. */
20749 /* If there were decl-specifiers, check to see if there was
20750 a class-declaration. */
20753 /* Nested classes have already been added to the class, but
20754 a `friend' needs to be explicitly registered. */
20756 {
20757 /* If the `friend' keyword was present, the friend must
20758 be introduced with a class-key. */
20761 "in C++03 a class-key must be used "
20763 /* In this case:
20765 template <typename T> struct A {
20766 friend struct A<T>::B;
20767 };
20769 A<T>::B will be represented by a TYPENAME_TYPE, and
20770 therefore not recognized by check_tag_decl. */
20772 {
20776 }
20779 "friend declaration does not name a class or "
20781 else
20784 }
20785 /* If there is no TYPE, an error message will already have
20786 been issued. */
20788 ;
20789 /* An anonymous aggregate has to be handled specially; such
20790 a declaration really declares a data member (with a
20791 particular type), as opposed to a nested class. */
20793 {
20794 /* C++11 9.5/6. */
20797 "a storage class on an anonymous aggregate "
20800 /* Remove constructors and such from TYPE, now that we
20801 know it is an anonymous aggregate. */
20803 /* And make the corresponding data member. */
20806 /* Add it to the class. */
20808 }
20809 else
20810 cp_parser_check_access_in_redeclaration
20813 }
20814 }
20815 else
20816 {
20819 /* Clear attributes from the decl_specifiers but keep them
20820 around as prefix attributes that apply them to the entity
20821 being declared. */
20825 /* See if these declarations will be friends. */
20828 /* Keep going until we hit the `;' at the end of the
20829 declaration. */
20831 {
20833 tree first_attribute;
20835 /* Peek at the next token. */
20838 /* Check for a bitfield declaration. */
20843 {
20844 tree identifier;
20845 tree width;
20847 /* Get the name of the bitfield. Note that we cannot just
20848 check TOKEN here because it may have been invalidated by
20849 the call to cp_lexer_peek_nth_token above. */
20852 else
20855 /* Consume the `:' token. */
20857 /* Get the width of the bitfield. */
20858 width
20861 /* Look for attributes that apply to the bitfield. */
20863 /* Remember which attributes are prefix attributes and
20864 which are not. */
20866 /* Combine the attributes. */
20869 /* Create the bitfield declaration. */
20872 identifier,
20873 sfk_none)
20876 width,
20877 attributes);
20878 }
20879 else
20880 {
20882 tree initializer;
20883 tree asm_specification;
20886 /* Parse the declarator. */
20887 declarator
20892 friend_p);
20894 /* If something went wrong parsing the declarator, make sure
20895 that we at least consume some tokens. */
20897 {
20898 /* Skip to the end of the statement. */
20900 /* If the next token is not a semicolon, that is
20901 probably because we just skipped over the body of
20902 a function. So, we consume a semicolon if
20903 present, but do not issue an error message if it
20904 is not present. */
20906 CPP_SEMICOLON))
20909 }
20912 cp_parser_check_for_definition_in_return_type
20916 /* Look for an asm-specification. */
20918 /* Look for attributes that apply to the declaration. */
20920 /* Remember which attributes are prefix attributes and
20921 which are not. */
20923 /* Combine the attributes. */
20926 /* If it's an `=', then we have a constant-initializer or a
20927 pure-specifier. It is not correct to parse the
20928 initializer before registering the member declaration
20929 since the member declaration should be in scope while
20930 its initializer is processed. However, the rest of the
20931 front end does not yet provide an interface that allows
20932 us to handle this correctly. */
20934 {
20935 /* In [class.mem]:
20937 A pure-specifier shall be used only in the declaration of
20938 a virtual function.
20940 A member-declarator can contain a constant-initializer
20941 only if it declares a static member of integral or
20942 enumeration type.
20944 Therefore, if the DECLARATOR is for a function, we look
20945 for a pure-specifier; otherwise, we look for a
20946 constant-initializer. When we call `grokfield', it will
20947 perform more stringent semantics checks. */
20959 {
20961 /* Don't require a constant rvalue in C++11, since we
20962 might want a reference constant. We'll enforce
20963 constancy later. */
20965 /* Parse the initializer. */
20968 }
20969 else
20970 /* Parse the initializer. */
20972 }
20975 {
20979 else
20981 }
20982 /* Otherwise, there is no initializer. */
20983 else
20986 /* See if we are probably looking at a function
20987 definition. We are certainly not looking at a
20988 member-declarator. Calling `grokfield' has
20989 side-effects, so we must not do it unless we are sure
20990 that we are looking at a member-declarator. */
20993 {
20994 /* The grammar does not allow a pure-specifier to be
20995 used when a member function is defined. (It is
20996 possible that this fact is an oversight in the
20997 standard, since a pure function may be defined
20998 outside of the class-specifier. */
21004 declarator,
21005 attributes);
21008 /* If the member was not a friend, declare it here. */
21011 /* Peek at the next token. */
21013 /* If the next token is a semicolon, consume it. */
21017 }
21018 else
21021 /* Create the declaration. */
21026 {
21029 else
21031 }
21032 }
21036 /* Reset PREFIX_ATTRIBUTES. */
21042 /* If there is any qualification still in effect, clear it
21043 now; we will be starting fresh with the next declarator. */
21047 /* If it's a `,', then there are more declarators. */
21049 {
21052 {
21056 }
21057 }
21058 /* If the next token isn't a `;', then we have a parse error. */
21060 CPP_SEMICOLON))
21061 {
21062 /* The next token might be a ways away from where the
21063 actual semicolon is missing. Find the previous token
21064 and use that for our error position. */
21069 /* Assume that the user meant to provide a semicolon. If
21070 we were to cp_parser_skip_to_end_of_statement, we might
21071 skip to a semicolon inside a member function definition
21072 and issue nonsensical error messages. */
21074 }
21077 {
21078 /* Add DECL to the list of members. */
21080 /* Explicitly include, eg, NSDMIs, for better error
21081 recovery (c++/58650). */
21090 /* Add DECL to the queue of NSDMI to be parsed later. */
21092 }
21096 }
21097 }
21100 out:
21102 }
21104 /* Parse a pure-specifier.
21106 pure-specifier:
21107 = 0
21109 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21110 Otherwise, ERROR_MARK_NODE is returned. */
21112 static tree
21114 {
21117 /* Look for the `=' token. */
21120 /* Look for the `0' token. */
21129 /* Accept = default or = delete in c++0x mode. */
21132 {
21135 }
21137 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21139 {
21144 }
21146 {
21149 }
21152 }
21154 /* Parse a constant-initializer.
21156 constant-initializer:
21157 = constant-expression
21159 Returns a representation of the constant-expression. */
21161 static tree
21163 {
21164 /* Look for the `=' token. */
21168 /* It is invalid to write:
21170 struct S { static const int i = { 7 }; };
21172 */
21174 {
21177 /* Consume the opening brace. */
21179 /* Skip the initializer. */
21181 /* Look for the trailing `}'. */
21185 }
21188 }
21190 /* Derived classes [gram.class.derived] */
21192 /* Parse a base-clause.
21194 base-clause:
21195 : base-specifier-list
21197 base-specifier-list:
21198 base-specifier ... [opt]
21199 base-specifier-list , base-specifier ... [opt]
21201 Returns a TREE_LIST representing the base-classes, in the order in
21202 which they were declared. The representation of each node is as
21203 described by cp_parser_base_specifier.
21205 In the case that no bases are specified, this function will return
21206 NULL_TREE, not ERROR_MARK_NODE. */
21208 static tree
21210 {
21213 /* Look for the `:' that begins the list. */
21216 /* Scan the base-specifier-list. */
21218 {
21220 tree base;
21223 /* Look for the base-specifier. */
21225 /* Look for the (optional) ellipsis. */
21227 {
21228 /* Consume the `...'. */
21232 }
21234 /* Add BASE to the front of the list. */
21236 {
21238 /* Make this a pack expansion type. */
21242 {
21245 }
21246 }
21247 /* Peek at the next token. */
21249 /* If it's not a comma, then the list is complete. */
21252 /* Consume the `,'. */
21254 }
21256 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21257 base class had a qualified name. However, the next name that
21258 appears is certainly not qualified. */
21264 }
21266 /* Parse a base-specifier.
21268 base-specifier:
21269 :: [opt] nested-name-specifier [opt] class-name
21270 virtual access-specifier [opt] :: [opt] nested-name-specifier
21271 [opt] class-name
21272 access-specifier virtual [opt] :: [opt] nested-name-specifier
21273 [opt] class-name
21275 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21276 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21277 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21278 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21280 static tree
21282 {
21290 tree type;
21292 /* Process the optional `virtual' and `access-specifier'. */
21294 {
21295 /* Peek at the next token. */
21297 /* Process `virtual'. */
21299 {
21301 /* If `virtual' appears more than once, issue an error. */
21303 {
21307 }
21311 /* Consume the `virtual' token. */
21319 /* If more than one access specifier appears, issue an
21320 error. */
21323 {
21327 }
21331 /* Consume the access-specifier. */
21339 }
21340 }
21341 /* It is not uncommon to see programs mechanically, erroneously, use
21342 the 'typename' keyword to denote (dependent) qualified types
21343 as base classes. */
21345 {
21350 else
21352 "keyword %<typename%> not allowed in this context "
21355 }
21357 /* Look for the optional `::' operator. */
21359 /* Look for the nested-name-specifier. The simplest way to
21360 implement:
21362 [temp.res]
21364 The keyword `typename' is not permitted in a base-specifier or
21365 mem-initializer; in these contexts a qualified name that
21366 depends on a template-parameter is implicitly assumed to be a
21367 type name.
21369 is to pretend that we have seen the `typename' keyword at this
21370 point. */
21374 typename_type,
21376 /* If the base class is given by a qualified name, assume that names
21377 we see are type names or templates, as appropriate. */
21383 /* DR 950 allows decltype as a base-specifier. */
21385 else
21386 {
21387 /* Otherwise, look for the class-name. */
21389 class_scope_p,
21390 template_p,
21391 typename_type,
21396 }
21402 }
21404 /* Exception handling [gram.exception] */
21406 /* Parse an (optional) noexcept-specification.
21408 noexcept-specification:
21409 noexcept ( constant-expression ) [opt]
21411 If no noexcept-specification is present, returns NULL_TREE.
21412 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21413 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21414 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21415 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21416 in which case a boolean condition is returned instead. */
21418 static tree
21423 {
21427 /* Peek at the next token. */
21430 /* Is it a noexcept-specification? */
21432 {
21433 tree expr;
21437 {
21441 {
21442 /* Types may not be defined in an exception-specification. */
21444 parser->type_definition_forbidden_message
21449 /* Restore the saved message. */
21451 }
21452 else
21453 {
21456 }
21459 }
21460 else
21461 {
21465 }
21467 /* We cannot build a noexcept-spec right away because this will check
21468 that expr is a constexpr. */
21471 else
21473 }
21474 else
21476 }
21478 /* Parse an (optional) exception-specification.
21480 exception-specification:
21481 throw ( type-id-list [opt] )
21483 Returns a TREE_LIST representing the exception-specification. The
21484 TREE_VALUE of each node is a type. */
21486 static tree
21488 {
21490 tree type_id_list;
21493 /* Peek at the next token. */
21496 /* Is it a noexcept-specification? */
21502 /* If it's not `throw', then there's no exception-specification. */
21506 #if 0
21507 /* Enable this once a lot of code has transitioned to noexcept? */
21511 #endif
21513 /* Consume the `throw'. */
21516 /* Look for the `('. */
21519 /* Peek at the next token. */
21521 /* If it's not a `)', then there is a type-id-list. */
21523 {
21524 /* Types may not be defined in an exception-specification. */
21526 parser->type_definition_forbidden_message
21528 /* Parse the type-id-list. */
21530 /* Restore the saved message. */
21532 }
21533 else
21536 /* Look for the `)'. */
21540 }
21542 /* Parse an (optional) type-id-list.
21544 type-id-list:
21545 type-id ... [opt]
21546 type-id-list , type-id ... [opt]
21548 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21549 in the order that the types were presented. */
21551 static tree
21553 {
21557 {
21559 tree type;
21561 /* Get the next type-id. */
21563 /* Parse the optional ellipsis. */
21565 {
21566 /* Consume the `...'. */
21569 /* Turn the type into a pack expansion expression. */
21571 }
21572 /* Add it to the list. */
21574 /* Peek at the next token. */
21576 /* If it is not a `,', we are done. */
21579 /* Consume the `,'. */
21581 }
21584 }
21586 /* Parse a try-block.
21588 try-block:
21589 try compound-statement handler-seq */
21591 static tree
21593 {
21594 tree try_block;
21608 }
21610 /* Parse a function-try-block.
21612 function-try-block:
21613 try ctor-initializer [opt] function-body handler-seq */
21615 static bool
21617 {
21618 tree compound_stmt;
21619 tree try_block;
21622 /* Look for the `try' keyword. */
21625 /* Let the rest of the front end know where we are. */
21627 /* Parse the function-body. */
21628 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21630 /* We're done with the `try' part. */
21632 /* Parse the handlers. */
21634 /* We're done with the handlers. */
21638 }
21640 /* Parse a handler-seq.
21642 handler-seq:
21643 handler handler-seq [opt] */
21645 static void
21647 {
21649 {
21652 /* Parse the handler. */
21654 /* Peek at the next token. */
21656 /* If it's not `catch' then there are no more handlers. */
21659 }
21660 }
21662 /* Parse a handler.
21664 handler:
21665 catch ( exception-declaration ) compound-statement */
21667 static void
21669 {
21670 tree handler;
21671 tree declaration;
21681 }
21683 /* Parse an exception-declaration.
21685 exception-declaration:
21686 type-specifier-seq declarator
21687 type-specifier-seq abstract-declarator
21688 type-specifier-seq
21689 ...
21691 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21692 ellipsis variant is used. */
21694 static tree
21696 {
21697 cp_decl_specifier_seq type_specifiers;
21701 /* If it's an ellipsis, it's easy to handle. */
21703 {
21704 /* Consume the `...' token. */
21707 }
21709 /* Types may not be defined in exception-declarations. */
21711 parser->type_definition_forbidden_message
21714 /* Parse the type-specifier-seq. */
21718 /* If it's a `)', then there is no declarator. */
21721 else
21728 /* Restore the saved message. */
21735 }
21737 /* Parse a throw-expression.
21739 throw-expression:
21740 throw assignment-expression [opt]
21742 Returns a THROW_EXPR representing the throw-expression. */
21744 static tree
21746 {
21747 tree expression;
21752 /* Figure out whether or not there is an assignment-expression
21753 following the "throw" keyword. */
21761 else
21765 }
21767 /* GNU Extensions */
21769 /* Parse an (optional) asm-specification.
21771 asm-specification:
21772 asm ( string-literal )
21774 If the asm-specification is present, returns a STRING_CST
21775 corresponding to the string-literal. Otherwise, returns
21776 NULL_TREE. */
21778 static tree
21780 {
21782 tree asm_specification;
21784 /* Peek at the next token. */
21786 /* If the next token isn't the `asm' keyword, then there's no
21787 asm-specification. */
21791 /* Consume the `asm' token. */
21793 /* Look for the `('. */
21796 /* Look for the string-literal. */
21799 /* Look for the `)'. */
21803 }
21805 /* Parse an asm-operand-list.
21807 asm-operand-list:
21808 asm-operand
21809 asm-operand-list , asm-operand
21811 asm-operand:
21812 string-literal ( expression )
21813 [ string-literal ] string-literal ( expression )
21815 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21816 each node is the expression. The TREE_PURPOSE is itself a
21817 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21818 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21819 is a STRING_CST for the string literal before the parenthesis. Returns
21820 ERROR_MARK_NODE if any of the operands are invalid. */
21822 static tree
21824 {
21829 {
21830 tree string_literal;
21831 tree expression;
21832 tree name;
21835 {
21836 /* Consume the `[' token. */
21838 /* Read the operand name. */
21843 /* Look for the closing `]'. */
21845 }
21846 else
21848 /* Look for the string-literal. */
21851 /* Look for the `('. */
21853 /* Parse the expression. */
21855 /* Look for the `)'. */
21863 /* Add this operand to the list. */
21865 expression,
21866 asm_operands);
21867 /* If the next token is not a `,', there are no more
21868 operands. */
21871 /* Consume the `,'. */
21873 }
21876 }
21878 /* Parse an asm-clobber-list.
21880 asm-clobber-list:
21881 string-literal
21882 asm-clobber-list , string-literal
21884 Returns a TREE_LIST, indicating the clobbers in the order that they
21885 appeared. The TREE_VALUE of each node is a STRING_CST. */
21887 static tree
21889 {
21893 {
21894 tree string_literal;
21896 /* Look for the string literal. */
21898 /* Add it to the list. */
21900 /* If the next token is not a `,', then the list is
21901 complete. */
21904 /* Consume the `,' token. */
21906 }
21909 }
21911 /* Parse an asm-label-list.
21913 asm-label-list:
21914 identifier
21915 asm-label-list , identifier
21917 Returns a TREE_LIST, indicating the labels in the order that they
21918 appeared. The TREE_VALUE of each node is a label. */
21920 static tree
21922 {
21926 {
21929 /* Look for the identifier. */
21932 {
21935 {
21941 }
21942 }
21943 /* If the next token is not a `,', then the list is
21944 complete. */
21947 /* Consume the `,' token. */
21949 }
21952 }
21954 /* Return TRUE iff the next tokens in the stream are possibly the
21955 beginning of a GNU extension attribute. */
21957 static bool
21959 {
21961 }
21963 /* Return TRUE iff the next tokens in the stream are possibly the
21964 beginning of a standard C++-11 attribute specifier. */
21966 static bool
21968 {
21970 }
21972 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21973 beginning of a standard C++-11 attribute specifier. */
21975 static bool
21977 {
21985 }
21987 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21988 beginning of a GNU extension attribute. */
21990 static bool
21992 {
21996 }
21998 /* Return true iff the next tokens can be the beginning of either a
21999 GNU attribute list, or a standard C++11 attribute sequence. */
22001 static bool
22003 {
22006 }
22008 /* Return true iff the next Nth tokens can be the beginning of either
22009 a GNU attribute list, or a standard C++11 attribute sequence. */
22011 static bool
22013 {
22016 }
22018 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22019 of GNU attributes, or return NULL. */
22021 static tree
22023 {
22027 }
22029 #define CILK_SIMD_FN_CLAUSE_MASK \
22030 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22031 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22032 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22033 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22034 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22036 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22037 vector [(<clauses>)] */
22039 static void
22041 {
22045 {
22050 }
22053 {
22056 paren_scope++;
22057 }
22059 {
22062 paren_scope++;
22064 paren_scope--;
22065 /* Do not push the last ')' */
22068 }
22077 }
22079 /* Parse an (optional) series of attributes.
22081 attributes:
22082 attributes attribute
22084 attribute:
22085 __attribute__ (( attribute-list [opt] ))
22087 The return value is as for cp_parser_gnu_attribute_list. */
22089 static tree
22091 {
22095 {
22097 tree attribute_list;
22100 /* Peek at the next token. */
22102 /* If it's not `__attribute__', then we're done. */
22106 /* Consume the `__attribute__' keyword. */
22108 /* Look for the two `(' tokens. */
22112 /* Peek at the next token. */
22115 /* Parse the attribute-list. */
22117 else
22118 /* If the next token is a `)', then there is no attribute
22119 list. */
22122 /* Look for the two `)' tokens. */
22130 /* Add these new attributes to the list. */
22132 }
22135 }
22137 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22138 "__vector" or "__vector__." */
22142 {
22146 }
22148 /* Parse a GNU attribute-list.
22150 attribute-list:
22151 attribute
22152 attribute-list , attribute
22154 attribute:
22155 identifier
22156 identifier ( identifier )
22157 identifier ( identifier , expression-list )
22158 identifier ( expression-list )
22160 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22161 to an attribute. The TREE_PURPOSE of each node is the identifier
22162 indicating which attribute is in use. The TREE_VALUE represents
22163 the arguments, if any. */
22165 static tree
22167 {
22173 {
22175 tree identifier;
22176 tree attribute;
22178 /* Look for the identifier. We also allow keywords here; for
22179 example `__attribute__ ((const))' is legal. */
22183 {
22186 /* Consume the token, but save it since we need it for the
22187 SIMD enabled function parsing. */
22190 /* Save away the identifier that indicates which attribute
22191 this is. */
22193 /* For keywords, use the canonical spelling, not the
22194 parsed identifier. */
22200 /* Peek at the next token. */
22202 /* If it's an `(', then parse the attribute arguments. */
22204 {
22209 {
22212 }
22213 else
22214 vec = cp_parser_parenthesized_expression_list
22220 else
22221 {
22224 }
22225 /* Save the arguments away. */
22227 }
22229 {
22232 }
22235 {
22236 /* Add this attribute to the list. */
22239 }
22242 }
22243 /* Now, look for more attributes. If the next token isn't a
22244 `,', we're done. */
22248 /* Consume the comma and keep going. */
22250 }
22253 /* We built up the list in reverse order. */
22255 }
22257 /* Parse a standard C++11 attribute.
22259 The returned representation is a TREE_LIST which TREE_PURPOSE is
22260 the scoped name of the attribute, and the TREE_VALUE is its
22261 arguments list.
22263 Note that the scoped name of the attribute is itself a TREE_LIST
22264 which TREE_PURPOSE is the namespace of the attribute, and
22265 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22266 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22267 and which TREE_PURPOSE is directly the attribute name.
22269 Clients of the attribute code should use get_attribute_namespace
22270 and get_attribute_name to get the actual namespace and name of
22271 attributes, regardless of their being GNU or C++11 attributes.
22273 attribute:
22274 attribute-token attribute-argument-clause [opt]
22276 attribute-token:
22277 identifier
22278 attribute-scoped-token
22280 attribute-scoped-token:
22281 attribute-namespace :: identifier
22283 attribute-namespace:
22284 identifier
22286 attribute-argument-clause:
22287 ( balanced-token-seq )
22289 balanced-token-seq:
22290 balanced-token [opt]
22291 balanced-token-seq balanced-token
22293 balanced-token:
22294 ( balanced-token-seq )
22295 [ balanced-token-seq ]
22296 { balanced-token-seq }. */
22298 static tree
22300 {
22304 /* First, parse name of the the attribute, a.k.a
22305 attribute-token. */
22322 {
22323 /* We are seeing a scoped attribute token. */
22333 else
22334 {
22338 }
22340 NULL_TREE);
22342 }
22343 else
22344 {
22346 NULL_TREE);
22347 /* C++11 noreturn attribute is equivalent to GNU's. */
22350 /* C++14 deprecated attribute is equivalent to GNU's. */
22352 {
22355 "%<deprecated%> is a C++14 feature;"
22358 }
22359 }
22361 /* Now parse the optional argument clause of the attribute. */
22366 {
22372 /* A GNU attribute that takes an identifier in parameter. */
22375 vec = cp_parser_parenthesized_expression_list
22381 else
22382 {
22385 }
22389 else
22391 }
22394 }
22396 /* Parse a list of standard C++-11 attributes.
22398 attribute-list:
22399 attribute [opt]
22400 attribute-list , attribute[opt]
22401 attribute ...
22402 attribute-list , attribute ...
22403 */
22405 static tree
22407 {
22412 {
22417 {
22420 }
22425 }
22428 }
22430 /* Parse a standard C++-11 attribute specifier.
22432 attribute-specifier:
22433 [ [ attribute-list ] ]
22434 alignment-specifier
22436 alignment-specifier:
22437 alignas ( type-id ... [opt] )
22438 alignas ( alignment-expression ... [opt] ). */
22440 static tree
22442 {
22448 {
22457 else
22458 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22459 when we are sure that we have actually parsed them. */
22461 }
22462 else
22463 {
22464 tree alignas_expr;
22466 /* Look for an alignment-specifier. */
22478 {
22481 }
22487 {
22491 alignas_expr =
22498 }
22501 {
22504 }
22508 /* Build the C++-11 representation of an 'aligned'
22509 attribute. */
22510 attributes =
22514 }
22517 }
22519 /* Parse a standard C++-11 attribute-specifier-seq.
22521 attribute-specifier-seq:
22522 attribute-specifier-seq [opt] attribute-specifier
22523 */
22525 static tree
22527 {
22531 {
22540 }
22544 }
22546 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22547 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22548 current value of the PEDANTIC flag, regardless of whether or not
22549 the `__extension__' keyword is present. The caller is responsible
22550 for restoring the value of the PEDANTIC flag. */
22552 static bool
22554 {
22555 /* Save the old value of the PEDANTIC flag. */
22559 {
22560 /* Consume the `__extension__' token. */
22562 /* We're not being pedantic while the `__extension__' keyword is
22563 in effect. */
22567 }
22570 }
22572 /* Parse a label declaration.
22574 label-declaration:
22575 __label__ label-declarator-seq ;
22577 label-declarator-seq:
22578 identifier , label-declarator-seq
22579 identifier */
22581 static void
22583 {
22584 /* Look for the `__label__' keyword. */
22588 {
22589 tree identifier;
22591 /* Look for an identifier. */
22593 /* If we failed, stop. */
22596 /* Declare it as a label. */
22598 /* If the next token is a `;', stop. */
22601 /* Look for the `,' separating the label declarations. */
22603 }
22605 /* Look for the final `;'. */
22607 }
22609 /* Support Functions */
22611 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22612 NAME should have one of the representations used for an
22613 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22614 is returned. If PARSER->SCOPE is a dependent type, then a
22615 SCOPE_REF is returned.
22617 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22618 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22619 was formed. Abstractly, such entities should not be passed to this
22620 function, because they do not need to be looked up, but it is
22621 simpler to check for this special case here, rather than at the
22622 call-sites.
22624 In cases not explicitly covered above, this function returns a
22625 DECL, OVERLOAD, or baselink representing the result of the lookup.
22626 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22627 is returned.
22629 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22630 (e.g., "struct") that was used. In that case bindings that do not
22631 refer to types are ignored.
22633 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22634 ignored.
22636 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22637 are ignored.
22639 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22640 types.
22642 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22643 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22644 NULL_TREE otherwise. */
22646 static tree
22653 location_t name_location)
22654 {
22655 tree decl;
22658 /* Assume that the lookup will be unambiguous. */
22662 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22663 no longer valid. Note that if we are parsing tentatively, and
22664 the parse fails, OBJECT_TYPE will be automatically restored. */
22670 /* A template-id has already been resolved; there is no lookup to
22671 do. */
22675 {
22679 }
22681 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22682 it should already have been checked to make sure that the name
22683 used matches the type being destroyed. */
22685 {
22686 tree type;
22688 /* Figure out to which type this destructor applies. */
22693 else
22695 /* If that's not a class type, there is no destructor. */
22702 /* If it was a class type, return the destructor. */
22704 }
22706 /* By this point, the NAME should be an ordinary identifier. If
22707 the id-expression was a qualified name, the qualifying scope is
22708 stored in PARSER->SCOPE at this point. */
22711 /* Perform the lookup. */
22713 {
22719 /* If the SCOPE is dependent, the lookup must be deferred until
22720 the template is instantiated -- unless we are explicitly
22721 looking up names in uninstantiated templates. Even then, we
22722 cannot look up the name if the scope is not a class type; it
22723 might, for example, be a template type parameter. */
22728 /* Defer lookup. */
22730 else
22731 {
22734 /* If PARSER->SCOPE is a dependent type, then it must be a
22735 class type, and we must not be checking dependencies;
22736 otherwise, we would have processed this lookup above. So
22737 that PARSER->SCOPE is not considered a dependent base by
22738 lookup_member, we must enter the scope here. */
22742 /* If the PARSER->SCOPE is a template specialization, it
22743 may be instantiated during name lookup. In that case,
22744 errors may be issued. Even if we rollback the current
22745 tentative parse, those errors are valid. */
22750 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22751 lookup result and the nested-name-specifier nominates a class C:
22752 * if the name specified after the nested-name-specifier, when
22753 looked up in C, is the injected-class-name of C (Clause 9), or
22754 * if the name specified after the nested-name-specifier is the
22755 same as the identifier or the simple-template-id's template-
22756 name in the last component of the nested-name-specifier,
22757 the name is instead considered to name the constructor of
22758 class C. [ Note: for example, the constructor is not an
22759 acceptable lookup result in an elaborated-type-specifier so
22760 the constructor would not be used in place of the
22761 injected-class-name. --end note ] Such a constructor name
22762 shall be used only in the declarator-id of a declaration that
22763 names a constructor or in a using-declaration. */
22771 /* If we have a single function from a using decl, pull it out. */
22778 }
22780 /* If the scope is a dependent type and either we deferred lookup or
22781 we did lookup but didn't find the name, rememeber the name. */
22784 {
22786 {
22787 tree type;
22789 /* The resolution to Core Issue 180 says that `struct
22790 A::B' should be considered a type-name, even if `A'
22791 is dependent. */
22796 }
22800 CPP_CLOSE_PAREN)))
22804 else
22807 is_template);
22808 }
22811 }
22813 {
22814 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22815 OBJECT_TYPE is not a class. */
22817 /* If the OBJECT_TYPE is a template specialization, it may
22818 be instantiated during name lookup. In that case, errors
22819 may be issued. Even if we rollback the current tentative
22820 parse, those errors are valid. */
22822 name,
22825 tf_warning_or_error);
22826 else
22830 /* Look it up in the enclosing context. */
22836 }
22837 else
22838 {
22844 }
22846 /* If the lookup failed, let our caller know. */
22850 /* Pull out the template from an injected-class-name (or multiple). */
22854 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22856 {
22859 /* The error message we have to print is too complicated for
22860 cp_parser_error, so we incorporate its actions directly. */
22862 {
22864 name);
22866 }
22868 }
22876 /* If we have resolved the name of a member declaration, check to
22877 see if the declaration is accessible. When the name resolves to
22878 set of overloaded functions, accessibility is checked when
22879 overload resolution is done.
22881 During an explicit instantiation, access is not checked at all,
22882 as per [temp.explicit]. */
22889 }
22891 /* Like cp_parser_lookup_name, but for use in the typical case where
22892 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22893 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22895 static tree
22897 {
22899 none_type,
22904 location);
22905 }
22907 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22908 the current context, return the TYPE_DECL. If TAG_NAME_P is
22909 true, the DECL indicates the class being defined in a class-head,
22910 or declared in an elaborated-type-specifier.
22912 Otherwise, return DECL. */
22914 static tree
22916 {
22917 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22918 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22920 struct A {
22921 template <typename T> struct B;
22922 };
22924 template <typename T> struct A::B {};
22926 Similarly, in an elaborated-type-specifier:
22928 namespace N { struct X{}; }
22930 struct A {
22931 template <typename T> friend struct N::X;
22932 };
22934 However, if the DECL refers to a class type, and we are in
22935 the scope of the class, then the name lookup automatically
22936 finds the TYPE_DECL created by build_self_reference rather
22937 than a TEMPLATE_DECL. For example, in:
22939 template <class T> struct S {
22940 S s;
22941 };
22943 there is no need to handle such case. */
22949 }
22951 /* If too many, or too few, template-parameter lists apply to the
22952 declarator, issue an error message. Returns TRUE if all went well,
22953 and FALSE otherwise. */
22955 static bool
22958 location_t declarator_location)
22959 {
22961 {
22963 {
22971 /* If the DECLARATOR has the form `X<y>' then it uses one
22972 additional level of template parameters. */
22975 return cp_parser_check_template_parameters
22977 }
22992 }
22994 }
22996 /* NUM_TEMPLATES were used in the current declaration. If that is
22997 invalid, return FALSE and issue an error messages. Otherwise,
22998 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22999 declarator and we can print more accurate diagnostics. */
23001 static bool
23004 location_t location,
23006 {
23007 /* If there are the same number of template classes and parameter
23008 lists, that's OK. */
23011 /* If there are more, but only one more, then we are referring to a
23012 member template. That's OK too. */
23015 /* If there are more template classes than parameter lists, we have
23016 something like:
23018 template <class T> void S<T>::R<T>::f (); */
23020 {
23030 else
23033 }
23034 /* Otherwise, there are too many template parameter lists. We have
23035 something like:
23037 template <class T> template <class U> void S::f(); */
23040 }
23042 /* Parse an optional `::' token indicating that the following name is
23043 from the global namespace. If so, PARSER->SCOPE is set to the
23044 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23045 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23046 Returns the new value of PARSER->SCOPE, if the `::' token is
23047 present, and NULL_TREE otherwise. */
23049 static tree
23051 {
23054 /* Peek at the next token. */
23056 /* If we're looking at a `::' token then we're starting from the
23057 global namespace, not our current location. */
23059 {
23060 /* Consume the `::' token. */
23062 /* Set the SCOPE so that we know where to start the lookup. */
23068 }
23070 {
23074 }
23077 }
23079 /* Returns TRUE if the upcoming token sequence is the start of a
23080 constructor declarator. If FRIEND_P is true, the declarator is
23081 preceded by the `friend' specifier. */
23083 static bool
23085 {
23088 tree nested_name_specifier;
23091 /* The common case is that this is not a constructor declarator, so
23092 try to avoid doing lots of work if at all possible. It's not
23093 valid declare a constructor at function scope. */
23096 /* And only certain tokens can begin a constructor declarator. */
23104 /* Parse tentatively; we are going to roll back all of the tokens
23105 consumed here. */
23107 /* Assume that we are looking at a constructor declarator. */
23110 /* Look for the optional `::' operator. */
23113 /* Look for the nested-name-specifier. */
23114 nested_name_specifier
23125 /* Outside of a class-specifier, there must be a
23126 nested-name-specifier. */
23132 /* If we have a class scope, this is easy; DR 147 says that S::S always
23133 names the constructor, and no other qualified name could. */
23136 {
23146 }
23147 /* If we still think that this might be a constructor-declarator,
23148 look for a class-name. */
23150 {
23151 /* If we have:
23153 template <typename T> struct S {
23154 S();
23155 };
23157 we must recognize that the nested `S' names a class. */
23158 tree type_decl;
23162 none_type,
23166 /* If there was no class-name, then this is not a constructor.
23167 Otherwise, if we are in a class-specifier and we aren't
23168 handling a friend declaration, check that its type matches
23169 current_class_type (c++/38313). Note: error_mark_node
23170 is left alone for error recovery purposes. */
23172 && (outside_class_specifier_p
23177 /* If we're still considering a constructor, we have to see a `(',
23178 to begin the parameter-declaration-clause, followed by either a
23179 `)', an `...', or a decl-specifier. We need to check for a
23180 type-specifier to avoid being fooled into thinking that:
23182 S (f) (int);
23184 is a constructor. (It is actually a function named `f' that
23185 takes one parameter (of type `int') and returns a value of type
23186 `S'. */
23194 /* A parameter declaration begins with a decl-specifier,
23195 which is either the "attribute" keyword, a storage class
23196 specifier, or (usually) a type-specifier. */
23198 {
23199 tree type;
23203 /* Names appearing in the type-specifier should be looked up
23204 in the scope of the class. */
23207 else
23208 {
23211 {
23215 {
23218 }
23219 }
23221 }
23223 /* Inside the constructor parameter list, surrounding
23224 template-parameter-lists do not apply. */
23225 saved_num_template_parameter_lists
23229 /* Look for the type-specifier. */
23231 CP_PARSER_FLAGS_NONE,
23237 parser->num_template_parameter_lists
23240 /* Leave the scope of the class. */
23245 }
23246 }
23248 /* We did not really want to consume any tokens. */
23252 }
23254 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23255 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23256 they must be performed once we are in the scope of the function.
23258 Returns the function defined. */
23260 static tree
23261 cp_parser_function_definition_from_specifiers_and_declarator
23264 tree attributes,
23266 {
23267 tree fn;
23270 /* Begin the function-definition. */
23273 /* The things we're about to see are not directly qualified by any
23274 template headers we've seen thus far. */
23277 /* If there were names looked up in the decl-specifier-seq that we
23278 did not check, check them now. We must wait until we are in the
23279 scope of the function to perform the checks, since the function
23280 might be a friend. */
23284 {
23287 }
23290 {
23291 /* Skip the entire function. */
23294 }
23296 {
23297 /* Seen already, skip it. An error message has already been output. */
23301 /* If this is a function from a class, pop the nested class. */
23304 }
23305 else
23306 {
23307 timevar_id_t tv;
23310 else
23316 }
23319 }
23321 /* Parse the part of a function-definition that follows the
23322 declarator. INLINE_P is TRUE iff this function is an inline
23323 function defined within a class-specifier.
23325 Returns the function defined. */
23327 static tree
23330 {
23331 tree fn;
23337 bool fully_implicit_function_template_p
23340 tree implicit_template_parms
23343 cp_binding_level* implicit_template_scope
23349 /* If the next token is `return', then the code may be trying to
23350 make use of the "named return value" extension that G++ used to
23351 support. */
23354 {
23355 /* Consume the `return' keyword. */
23357 /* Look for the identifier that indicates what value is to be
23358 returned. */
23360 /* Issue an error message. */
23363 /* Skip tokens until we reach the start of the function body. */
23365 {
23372 }
23373 }
23374 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23375 anything declared inside `f'. */
23376 saved_in_unbraced_linkage_specification_p
23379 /* Inside the function, surrounding template-parameter-lists do not
23380 apply. */
23381 saved_num_template_parameter_lists
23387 /* If the next token is `try', `__transaction_atomic', or
23388 `__transaction_relaxed`, then we are looking at either function-try-block
23389 or function-transaction-block. Note that all of these include the
23390 function-body. */
23393 RID_TRANSACTION_ATOMIC);
23395 RID_TRANSACTION_RELAXED))
23397 RID_TRANSACTION_RELAXED);
23400 else
23401 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23406 /* Finish the function. */
23409 /* Generate code for it, if necessary. */
23411 /* Restore the saved values. */
23412 parser->in_unbraced_linkage_specification_p
23414 parser->num_template_parameter_lists
23418 parser->fully_implicit_function_template_p
23420 parser->implicit_template_parms
23422 parser->implicit_template_scope
23429 }
23431 /* Parse a template-declaration, assuming that the `export' (and
23432 `extern') keywords, if present, has already been scanned. MEMBER_P
23433 is as for cp_parser_template_declaration. */
23435 static void
23437 {
23440 tree parameter_list;
23445 /* Look for the `template' keyword. */
23450 /* And the `<'. */
23454 {
23455 /* 14.5.2.2 [temp.mem]
23457 A local class shall not have member templates. */
23462 }
23463 /* [temp]
23465 A template ... shall not have C linkage. */
23467 {
23469 /* Give it C++ linkage to avoid confusing other parts of the
23470 front end. */
23473 }
23474 else
23477 /* We cannot perform access checks on the template parameter
23478 declarations until we know what is being declared, just as we
23479 cannot check the decl-specifier list. */
23482 /* If the next token is `>', then we have an invalid
23483 specialization. Rather than complain about an invalid template
23484 parameter, issue an error message here. */
23486 {
23490 }
23491 else
23492 {
23493 /* Parse the template parameters. */
23495 }
23497 /* Get the deferred access checks from the parameter list. These
23498 will be checked once we know what is being declared, as for a
23499 member template the checks must be performed in the scope of the
23500 class containing the member. */
23503 /* Look for the `>'. */
23505 /* We just processed one more parameter list. */
23507 /* If the next token is `template', there are more template
23508 parameters. */
23510 RID_TEMPLATE))
23515 else
23516 {
23517 /* There are no access checks when parsing a template, as we do not
23518 know if a specialization will be a friend. */
23522 checks,
23523 member_p,
23528 /* If this is a member template declaration, let the front
23529 end know. */
23531 {
23536 }
23541 }
23542 /* We are done with the current parameter list. */
23547 /* Finish up. */
23550 /* Check the template arguments for a literal operator template. */
23554 {
23558 else
23559 {
23562 {
23568 }
23570 {
23578 }
23579 else
23581 }
23583 {
23586 " Expected non-type template argument pack <char...>"
23588 decl);
23589 else
23592 decl);
23593 }
23594 }
23595 /* Register member declarations. */
23598 /* For the erroneous case of a template with C linkage, we pushed an
23599 implicit C++ linkage scope; exit that scope now. */
23602 /* If DECL is a function template, we must return to parse it later.
23603 (Even though there is no definition, there might be default
23604 arguments that need handling.) */
23608 }
23610 /* Perform the deferred access checks from a template-parameter-list.
23611 CHECKS is a TREE_LIST of access checks, as returned by
23612 get_deferred_access_checks. */
23614 static void
23615 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23616 {
23620 }
23622 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23623 `function-definition' sequence that follows a template header.
23624 If MEMBER_P is true, this declaration appears in a class scope.
23626 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23627 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23629 static tree
23635 {
23638 cp_decl_specifier_seq decl_specifiers;
23642 /* This function is only used when processing a template
23643 declaration. */
23647 /* Defer access checks until we know what is being declared. */
23650 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23651 alternative. */
23654 CP_PARSER_FLAGS_OPTIONAL,
23660 /* There are no template typedefs. */
23662 {
23666 }
23668 /* Gather up the access checks that occurred the
23669 decl-specifier-seq. */
23672 /* Check for the declaration of a template class. */
23674 {
23676 {
23679 /* In this case:
23681 struct C {
23682 friend template <typename T> struct A<T>::B;
23683 };
23685 A<T>::B will be represented by a TYPENAME_TYPE, and
23686 therefore not recognized by shadow_tag. */
23688 && !decl
23695 else
23698 /* Perform access checks for template parameters. */
23700 }
23701 }
23703 /* Complain about missing 'typename' or other invalid type names. */
23706 {
23707 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23708 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23709 the rest of this declaration. */
23712 }
23714 /* If it's not a template class, try for a template function. If
23715 the next token is a `;', then this declaration does not declare
23716 anything. But, if there were errors in the decl-specifiers, then
23717 the error might well have come from an attempted class-specifier.
23718 In that case, there's no need to warn about a missing declarator. */
23722 {
23725 checks,
23727 member_p,
23728 declares_class_or_enum,
23730 NULL);
23732 /* 7.1.1-1 [dcl.stc]
23734 A storage-class-specifier shall not be specified in an explicit
23735 specialization... */
23737 && explicit_specialization_p
23739 {
23743 }
23747 }
23749 /* Look for a trailing `;' after the declaration. */
23755 out:
23758 /* Clear any current qualification; whatever comes next is the start
23759 of something new. */
23765 }
23767 /* Parse a cast-expression that is not the operand of a unary "&". */
23769 static tree
23771 {
23774 }
23776 /* Parse a functional cast to TYPE. Returns an expression
23777 representing the cast. */
23779 static tree
23781 {
23783 tree expression_list;
23784 tree cast;
23791 {
23799 tf_warning_or_error);
23800 }
23809 else
23810 {
23813 }
23816 tf_warning_or_error);
23817 /* [expr.const]/1: In an integral constant expression "only type
23818 conversions to integral or enumeration type can be used". */
23824 NIC_CONSTRUCTOR))
23827 }
23829 /* Save the tokens that make up the body of a member function defined
23830 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23831 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23832 specifiers applied to the declaration. Returns the FUNCTION_DECL
23833 for the member function. */
23835 static tree
23839 tree attributes)
23840 {
23843 tree fn;
23845 /* Create the FUNCTION_DECL. */
23848 /* If something went badly wrong, bail out now. */
23850 {
23851 /* If there's a function-body, skip it. */
23856 }
23858 /* Remember it, if there default args to post process. */
23861 /* Save away the tokens that make up the body of the
23862 function. */
23864 /* Handle function try blocks. */
23867 /* We can have braced-init-list mem-initializers before the fn body. */
23869 {
23872 {
23873 /* cache_group will stop after an un-nested { } pair, too. */
23877 /* variadic mem-inits have ... after the ')'. */
23880 }
23881 }
23883 /* Handle function try blocks. */
23888 /* Save away the inline definition; we will process it when the
23889 class is complete. */
23893 /* We need to know that this was defined in the class, so that
23894 friend templates are handled correctly. */
23897 /* Add FN to the queue of functions to be parsed later. */
23901 }
23903 /* Save the tokens that make up the in-class initializer for a non-static
23904 data member. Returns a DEFAULT_ARG. */
23906 static tree
23908 {
23910 }
23912 /* Parse a template-argument-list, as well as the trailing ">" (but
23913 not the opening "<"). See cp_parser_template_argument_list for the
23914 return value. */
23916 static tree
23918 {
23919 tree arguments;
23920 tree saved_scope;
23921 tree saved_qualifying_scope;
23922 tree saved_object_scope;
23927 /* [temp.names]
23929 When parsing a template-id, the first non-nested `>' is taken as
23930 the end of the template-argument-list rather than a greater-than
23931 operator. */
23932 saved_greater_than_is_operator_p
23935 /* Parsing the argument list may modify SCOPE, so we save it
23936 here. */
23940 /* We need to evaluate the template arguments, even though this
23941 template-id may be nested within a "sizeof". */
23946 /* Parse the template-argument-list itself. */
23950 else
23952 /* Look for the `>' that ends the template-argument-list. If we find
23953 a '>>' instead, it's probably just a typo. */
23955 {
23957 {
23958 /* In C++0x, a `>>' in a template argument list or cast
23959 expression is considered to be two separate `>'
23960 tokens. So, change the current token to a `>', but don't
23961 consume it: it will be consumed later when the outer
23962 template argument list (or cast expression) is parsed.
23963 Note that this replacement of `>' for `>>' is necessary
23964 even if we are parsing tentatively: in the tentative
23965 case, after calling
23966 cp_parser_enclosed_template_argument_list we will always
23967 throw away all of the template arguments and the first
23968 closing `>', either because the template argument list
23969 was erroneous or because we are replacing those tokens
23970 with a CPP_TEMPLATE_ID token. The second `>' (which will
23971 not have been thrown away) is needed either to close an
23972 outer template argument list or to complete a new-style
23973 cast. */
23976 }
23978 {
23979 /* If we're in a nested template argument list, the '>>' has
23980 to be a typo for '> >'. We emit the error message, but we
23981 continue parsing and we push a '>' as next token, so that
23982 the argument list will be parsed correctly. Note that the
23983 global source location is still on the token before the
23984 '>>', so we need to say explicitly where we want it. */
23990 }
23991 else
23992 {
23993 /* If this is not a nested template argument list, the '>>'
23994 is a typo for '>'. Emit an error message and continue.
23995 Same deal about the token location, but here we can get it
23996 right by consuming the '>>' before issuing the diagnostic. */
23999 "spurious %<>>%>, use %<>%> to terminate "
24001 }
24002 }
24003 else
24005 /* The `>' token might be a greater-than operator again now. */
24006 parser->greater_than_is_operator_p
24008 /* Restore the SAVED_SCOPE. */
24016 }
24018 /* MEMBER_FUNCTION is a member function, or a friend. If default
24019 arguments, or the body of the function have not yet been parsed,
24020 parse them now. */
24022 static void
24024 {
24026 /* If this member is a template, get the underlying
24027 FUNCTION_DECL. */
24031 /* There should not be any class definitions in progress at this
24032 point; the bodies of members are only parsed outside of all class
24033 definitions. */
24035 /* While we're parsing the member functions we might encounter more
24036 classes. We want to handle them right away, but we don't want
24037 them getting mixed up with functions that are currently in the
24038 queue. */
24041 /* Make sure that any template parameters are in scope. */
24044 /* If the body of the function has not yet been parsed, parse it
24045 now. */
24047 {
24048 tree function_scope;
24051 /* The function is no longer pending; we are processing it. */
24056 /* If this is a local class, enter the scope of the containing
24057 function. */
24062 /* Push the body of the function onto the lexer stack. */
24065 /* Let the front end know that we going to be defining this
24066 function. */
24070 /* Don't do access checking if it is a templated function. */
24074 /* #pragma omp declare reduction needs special parsing. */
24076 {
24081 }
24082 else
24083 /* Now, parse the body of the function. */
24090 /* Leave the scope of the containing function. */
24094 }
24096 /* Remove any template parameters from the symbol table. */
24099 /* Restore the queue. */
24102 }
24104 /* If DECL contains any default args, remember it on the unparsed
24105 functions queue. */
24107 static void
24109 {
24110 tree probe;
24113 probe;
24116 {
24120 }
24121 }
24123 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24124 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24125 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24126 from the parameter-type-list. */
24128 static tree
24131 {
24133 tree parsed_arg;
24139 /* Push the saved tokens for the default argument onto the parser's
24140 lexer stack. */
24146 /* Parse the default argument. */
24157 {
24158 /* In a non-template class, check conversions now. In a template,
24159 we'll wait and instantiate these as needed. */
24162 tf_warning_or_error);
24163 else
24165 }
24167 /* If the token stream has not been completely used up, then
24168 there was extra junk after the end of the default
24169 argument. */
24171 {
24174 else
24176 }
24178 /* Revert to the main lexer. */
24182 }
24184 /* FIELD is a non-static data member with an initializer which we saved for
24185 later; parse it now. */
24187 static void
24189 {
24190 tree def;
24197 NULL_TREE);
24203 }
24205 /* FN is a FUNCTION_DECL which may contains a parameter with an
24206 unparsed DEFAULT_ARG. Parse the default args now. This function
24207 assumes that the current scope is the scope in which the default
24208 argument should be processed. */
24210 static void
24212 {
24216 /* While we're parsing the default args, we might (due to the
24217 statement expression extension) encounter more classes. We want
24218 to handle them right away, but we don't want them getting mixed
24219 up with default args that are currently in the queue. */
24222 /* Local variable names (and the `this' keyword) may not appear
24223 in a default argument. */
24234 {
24236 tree parsed_arg;
24238 tree copy;
24245 /* This can happen for a friend declaration for a function
24246 already declared with default arguments. */
24249 parsed_arg
24251 default_arg,
24254 {
24256 }
24260 /* Update any instantiations we've already created. */
24264 }
24268 /* Make sure no default arg is missing. */
24271 /* Restore the state of local_variables_forbidden_p. */
24274 /* Restore the queue. */
24276 }
24278 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24280 sizeof ... ( identifier )
24282 where the 'sizeof' token has already been consumed. */
24284 static tree
24286 {
24287 /* Consume the `...'. */
24294 else
24302 /* The name is not qualified. */
24320 }
24322 /* Parse the operand of `sizeof' (or a similar operator). Returns
24323 either a TYPE or an expression, depending on the form of the
24324 input. The KEYWORD indicates which kind of expression we have
24325 encountered. */
24327 static tree
24329 {
24336 /* If it's a `...', then we are computing the length of a parameter
24337 pack. */
24342 /* Types cannot be defined in a `sizeof' expression. Save away the
24343 old message. */
24345 /* And create the new one. */
24351 /* The restrictions on constant-expressions do not apply inside
24352 sizeof expressions. */
24353 saved_integral_constant_expression_p
24355 saved_non_integral_constant_expression_p
24359 /* Do not actually evaluate the expression. */
24362 /* If it's a `(', then we might be looking at the type-id
24363 construction. */
24365 {
24368 /* We can't be sure yet whether we're looking at a type-id or an
24369 expression. */
24371 /* Note: as a GNU Extension, compound literals are considered
24372 postfix-expressions as they are in C99, so they are valid
24373 arguments to sizeof. See comment in cp_parser_cast_expression
24374 for details. */
24377 else
24378 {
24381 /* Look for the type-id. */
24383 /* Look for the closing `)'. */
24386 }
24388 /* If all went well, then we're done. */
24390 {
24391 cp_decl_specifier_seq decl_specs;
24393 /* Build a trivial decl-specifier-seq. */
24397 /* Call grokdeclarator to figure out what type this is. */
24400 TYPENAME,
24403 }
24404 }
24406 /* If the type-id production did not work out, then we must be
24407 looking at the unary-expression production. */
24411 /* Go back to evaluating expressions. */
24415 /* Free the message we created. */
24417 /* And restore the old one. */
24419 parser->integral_constant_expression_p
24421 parser->non_integral_constant_expression_p
24425 }
24427 /* If the current declaration has no declarator, return true. */
24429 static bool
24431 {
24432 /* If the next token is a `;' or a `,' then there is no
24433 declarator. */
24436 }
24438 /* Update the DECL_SPECS to reflect the storage class indicated by
24439 KEYWORD. */
24441 static void
24446 {
24447 cp_storage_class storage_class;
24450 {
24454 }
24456 {
24459 }
24464 {
24467 }
24470 {
24488 }
24492 /* A storage class specifier cannot be applied alongside a typedef
24493 specifier. If there is a typedef specifier present then set
24494 conflicting_specifiers_p which will trigger an error later
24495 on in grokdeclarator. */
24498 }
24500 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24501 is true, the type is a class or enum definition. */
24503 static void
24505 tree type_spec,
24508 {
24511 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24512 (with, for example, in "typedef int wchar_t;") we remember that
24513 this is what happened. In system headers, we ignore these
24514 declarations so that G++ can work with system headers that are not
24515 C++-safe. */
24517 && !type_definition_p
24527 {
24530 ds_redefined_builtin_type_spec,
24531 token);
24533 {
24537 }
24538 }
24541 else
24542 {
24547 }
24548 }
24550 /* True iff TOKEN is the GNU keyword __thread. */
24552 static bool
24554 {
24557 }
24559 /* Set the location for a declarator specifier and check if it is
24560 duplicated.
24562 DECL_SPECS is the sequence of declarator specifiers onto which to
24563 set the location.
24565 DS is the single declarator specifier to set which location is to
24566 be set onto the existing sequence of declarators.
24568 LOCATION is the location for the declarator specifier to
24569 consider. */
24571 static void
24574 {
24583 {
24587 }
24588 else
24589 {
24591 {
24595 else
24596 {
24599 OPT_Wlong_long,
24601 }
24602 }
24604 {
24609 else
24611 }
24612 else
24613 {
24629 "__complex"
24630 };
24633 }
24634 }
24635 }
24637 /* Return true iff the declarator specifier DS is present in the
24638 sequence of declarator specifiers DECL_SPECS. */
24640 bool
24642 cp_decl_spec ds)
24643 {
24650 }
24652 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24653 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24655 static bool
24657 {
24659 }
24661 /* Issue an error message indicating that TOKEN_DESC was expected.
24662 If KEYWORD is true, it indicated this function is called by
24663 cp_parser_require_keword and the required token can only be
24664 a indicated keyword. */
24666 static void
24668 required_token token_desc,
24670 {
24672 {
24741 }
24743 {
24745 {
24824 }
24825 }
24826 else
24828 }
24832 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24833 issue an error message indicating that TOKEN_DESC was expected.
24835 Returns the token consumed, if the token had the appropriate type.
24836 Otherwise, returns NULL. */
24841 required_token token_desc)
24842 {
24845 else
24846 {
24847 /* Output the MESSAGE -- unless we're parsing tentatively. */
24851 }
24852 }
24854 /* An error message is produced if the next token is not '>'.
24855 All further tokens are skipped until the desired token is
24856 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24858 static void
24860 {
24861 /* Current level of '< ... >'. */
24863 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24866 /* Are we ready, yet? If not, issue error message. */
24870 /* Skip tokens until the desired token is found. */
24872 {
24873 /* Peek at the next token. */
24875 {
24883 /* C++0x views the `>>' operator as two `>' tokens, but
24884 C++98 does not. */
24887 {
24888 /* We've hit a `>>' where the first `>' closes the
24889 template argument list, and the second `>' is
24890 spurious. Just consume the `>>' and stop; we've
24891 already produced at least one error. */
24894 }
24895 /* Fall through for C++0x, so we handle the second `>' in
24896 the `>>'. */
24900 {
24901 /* We've reached the token we want, consume it and stop. */
24904 }
24923 /* The '>' was probably forgotten, don't look further. */
24928 }
24930 /* Consume this token. */
24932 }
24933 }
24935 /* If the next token is the indicated keyword, consume it. Otherwise,
24936 issue an error message indicating that TOKEN_DESC was expected.
24938 Returns the token consumed, if the token had the appropriate type.
24939 Otherwise, returns NULL. */
24944 required_token token_desc)
24945 {
24949 {
24952 }
24955 }
24957 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24958 function-definition. */
24960 static bool
24962 {
24965 /* A ctor-initializer begins with a `:'. */
24967 /* A function-try-block begins with `try'. */
24969 /* A function-transaction-block begins with `__transaction_atomic'
24970 or `__transaction_relaxed'. */
24973 /* The named return value extension begins with `return'. */
24975 }
24977 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24978 definition. */
24980 static bool
24982 {
24989 }
24991 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24992 C++0x) ending a template-argument. */
24994 static bool
24996 {
25004 }
25006 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25007 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25009 static bool
25012 {
25018 /* Check for the sequence `<::' in the original code. It would be lexed as
25019 `[:', where `[' is a digraph, and there is no whitespace before
25020 `:'. */
25022 {
25027 }
25029 }
25031 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25032 or none_type otherwise. */
25034 static enum tag_types
25036 {
25038 {
25048 }
25049 }
25051 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25052 or none_type otherwise or if the token is null. */
25054 static enum tag_types
25056 {
25061 {
25069 }
25070 }
25072 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25074 static void
25076 {
25080 {
25084 type))
25087 }
25088 }
25090 /* Issue an error message if DECL is redeclared with different
25091 access than its original declaration [class.access.spec/3].
25092 This applies to nested classes and nested class templates.
25093 [class.mem/1]. */
25095 static void
25097 {
25106 }
25108 /* Look for the `template' keyword, as a syntactic disambiguator.
25109 Return TRUE iff it is present, in which case it will be
25110 consumed. */
25112 static bool
25114 {
25116 {
25117 /* In C++98 the `template' keyword can only be used within templates;
25118 outside templates the parser can always figure out what is a
25119 template and what is not. In C++11, per the resolution of DR 468,
25120 `template' is allowed in cases where it is not strictly necessary. */
25123 {
25126 "in C++98 %<template%> (as a disambiguator) is only "
25128 /* If this part of the token stream is rescanned, the same
25129 error message would be generated. So, we purge the token
25130 from the stream. */
25133 }
25134 else
25135 {
25136 /* Consume the `template' keyword. */
25139 }
25140 }
25142 }
25144 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25145 set PARSER->SCOPE, and perform other related actions. */
25147 static void
25149 {
25155 /* Get the stored value. */
25157 /* Perform any access checks that were deferred. */
25160 {
25165 }
25166 /* Set the scope from the stored value. */
25170 }
25172 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25173 encounter the end of a block before what we were looking for. */
25175 static bool
25179 {
25181 {
25184 /* Abort a parenthesized expression if we encounter a semicolon. */
25188 /* If we've reached the end of the file, stop. */
25194 /* We've hit the end of an enclosing block, so there's been some
25195 kind of syntax error. */
25198 /* Consume the token. */
25200 /* See if it starts a new group. */
25202 {
25204 /* In theory this should probably check end == '}', but
25205 cp_parser_save_member_function_body needs it to exit
25206 after either '}' or ')' when called with ')'. */
25209 }
25211 {
25215 }
25220 }
25221 }
25223 /* Like above, for caching a default argument or NSDMI. Both of these are
25224 terminated by a non-nested comma, but it can be unclear whether or not a
25225 comma is nested in a template argument list unless we do more parsing.
25226 In order to handle this ambiguity, when we encounter a ',' after a '<'
25227 we try to parse what follows as a parameter-declaration-list (in the
25228 case of a default argument) or a member-declarator (in the case of an
25229 NSDMI). If that succeeds, then we stop caching. */
25231 static tree
25233 {
25238 tree default_argument;
25240 /* Add tokens until we have processed the entire default
25241 argument. We add the range [first_token, token). */
25244 {
25245 /* For list-initialization, this is straightforward. */
25248 }
25250 {
25253 /* Peek at the next token. */
25255 /* What we do depends on what token we have. */
25257 {
25258 /* In valid code, a default argument must be
25259 immediately followed by a `,' `)', or `...'. */
25262 {
25263 /* If we've seen a '<', we might be in a
25264 template-argument-list. Until Core issue 325 is
25265 resolved, we don't know how this situation ought
25266 to be handled, so try to DTRT. We check whether
25267 what comes after the comma is a valid parameter
25268 declaration list. If it is, then the comma ends
25269 the default argument; otherwise the default
25270 argument continues. */
25273 /* Set ITALP so cp_parser_parameter_declaration_list
25274 doesn't decide to commit to this parse. */
25282 {
25289 }
25290 else
25291 {
25295 }
25302 }
25305 /* If we run into a non-nested `;', `}', or `]',
25306 then the code is invalid -- but the default
25307 argument is certainly over. */
25312 /* Handle correctly int n = sizeof ... ( p ); */
25315 /* Update DEPTH, if necessary. */
25330 /* This might be the comparison operator, or it might
25331 start a template argument list. */
25338 /* Fall through for C++0x, which treats the `>>'
25339 operator like two `>' tokens in certain
25340 cases. */
25344 {
25345 /* This might be an operator, or it might close a
25346 template argument list. But if a previous '<'
25347 started a template argument list, this will have
25348 closed it, so we can't be in one anymore. */
25352 }
25355 /* If we run out of tokens, issue an error message. */
25364 /* In these cases, we should look for template-ids.
25365 For example, if the default argument is
25366 `X<int, double>()', we need to do name lookup to
25367 figure out whether or not `X' is a template; if
25368 so, the `,' does not end the default argument.
25370 That is not yet done. */
25375 }
25377 /* If we've reached the end, stop. */
25381 /* Add the token to the token block. */
25383 }
25385 /* Create a DEFAULT_ARG to represent the unparsed default
25386 argument. */
25393 }
25395 /* Begin parsing tentatively. We always save tokens while parsing
25396 tentatively so that if the tentative parsing fails we can restore the
25397 tokens. */
25399 static void
25401 {
25402 /* Enter a new parsing context. */
25404 /* Begin saving tokens. */
25406 /* In order to avoid repetitive access control error messages,
25407 access checks are queued up until we are no longer parsing
25408 tentatively. */
25410 }
25412 /* Commit to the currently active tentative parse. */
25414 static void
25416 {
25420 /* Mark all of the levels as committed. */
25423 {
25430 }
25431 }
25433 /* Commit to the topmost currently active tentative parse.
25435 Note that this function shouldn't be called when there are
25436 irreversible side-effects while in a tentative state. For
25437 example, we shouldn't create a permanent entry in the symbol
25438 table, or issue an error message that might not apply if the
25439 tentative parse is aborted. */
25441 static void
25443 {
25448 {
25456 }
25457 }
25459 /* Abort the currently active tentative parse. All consumed tokens
25460 will be rolled back, and no diagnostics will be issued. */
25462 static void
25464 {
25468 /* Now, pretend that we want to see if the construct was
25469 successfully parsed. */
25471 }
25473 /* Stop parsing tentatively. If a parse error has occurred, restore the
25474 token stream. Otherwise, commit to the tokens we have consumed.
25475 Returns true if no error occurred; false otherwise. */
25477 static bool
25479 {
25483 /* Remember whether or not an error occurred, since we are about to
25484 destroy that information. */
25486 /* Remove the topmost context from the stack. */
25489 /* If no parse errors occurred, commit to the tentative parse. */
25491 {
25492 /* Commit to the tokens read tentatively, unless that was
25493 already done. */
25498 }
25499 /* Otherwise, if errors occurred, roll back our state so that things
25500 are just as they were before we began the tentative parse. */
25501 else
25502 {
25505 }
25506 /* Add the context to the front of the free list. */
25511 }
25513 /* Returns true if we are parsing tentatively and are not committed to
25514 this tentative parse. */
25516 static bool
25518 {
25521 }
25523 /* Returns nonzero iff an error has occurred during the most recent
25524 tentative parse. */
25526 static bool
25528 {
25531 }
25533 /* Returns nonzero if GNU extensions are allowed. */
25535 static bool
25537 {
25539 }
25540 \f
25541 /* Objective-C++ Productions */
25544 /* Parse an Objective-C expression, which feeds into a primary-expression
25545 above.
25547 objc-expression:
25548 objc-message-expression
25549 objc-string-literal
25550 objc-encode-expression
25551 objc-protocol-expression
25552 objc-selector-expression
25554 Returns a tree representation of the expression. */
25556 static tree
25558 {
25559 /* Try to figure out what kind of declaration is present. */
25563 {
25573 {
25585 }
25591 }
25594 }
25596 /* Parse an Objective-C message expression.
25598 objc-message-expression:
25599 [ objc-message-receiver objc-message-args ]
25601 Returns a representation of an Objective-C message. */
25603 static tree
25605 {
25614 }
25616 /* Parse an objc-message-receiver.
25618 objc-message-receiver:
25619 expression
25620 simple-type-specifier
25622 Returns a representation of the type or expression. */
25624 static tree
25626 {
25627 tree rcv;
25629 /* An Objective-C message receiver may be either (1) a type
25630 or (2) an expression. */
25639 CP_PARSER_FLAGS_NONE);
25642 }
25644 /* Parse the arguments and selectors comprising an Objective-C message.
25646 objc-message-args:
25647 objc-selector
25648 objc-selector-args
25649 objc-selector-args , objc-comma-args
25651 objc-selector-args:
25652 objc-selector [opt] : assignment-expression
25653 objc-selector-args objc-selector [opt] : assignment-expression
25655 objc-comma-args:
25656 assignment-expression
25657 objc-comma-args , assignment-expression
25659 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25660 selector arguments and TREE_VALUE containing a list of comma
25661 arguments. */
25663 static tree
25665 {
25671 {
25677 /* Detect if we have a unary selector. */
25686 sel_args
25691 }
25693 /* Handle non-selector arguments, if any. */
25695 {
25696 tree arg;
25701 addl_args
25706 }
25709 {
25712 }
25715 }
25717 /* Parse an Objective-C encode expression.
25719 objc-encode-expression:
25720 @encode objc-typename
25722 Returns an encoded representation of the type argument. */
25724 static tree
25726 {
25727 tree type;
25737 {
25741 }
25743 /* This happens if we find @encode(T) (where T is a template
25744 typename or something dependent on a template typename) when
25745 parsing a template. In that case, we can't compile it
25746 immediately, but we rather create an AT_ENCODE_EXPR which will
25747 need to be instantiated when the template is used.
25748 */
25750 {
25754 }
25757 }
25759 /* Parse an Objective-C @defs expression. */
25761 static tree
25763 {
25764 tree name;
25772 }
25774 /* Parse an Objective-C protocol expression.
25776 objc-protocol-expression:
25777 @protocol ( identifier )
25779 Returns a representation of the protocol expression. */
25781 static tree
25783 {
25784 tree proto;
25792 }
25794 /* Parse an Objective-C selector expression.
25796 objc-selector-expression:
25797 @selector ( objc-method-signature )
25799 objc-method-signature:
25800 objc-selector
25801 objc-selector-seq
25803 objc-selector-seq:
25804 objc-selector :
25805 objc-selector-seq objc-selector :
25807 Returns a representation of the method selector. */
25809 static tree
25811 {
25823 {
25832 {
25833 /* Detect if we have a unary selector. */
25835 {
25838 }
25839 else
25840 {
25842 }
25843 }
25848 {
25849 sel_seq
25852 sel_seq
25855 }
25856 else
25857 sel_seq
25862 }
25864 finish_selector:
25868 }
25870 /* Parse a list of identifiers.
25872 objc-identifier-list:
25873 identifier
25874 objc-identifier-list , identifier
25876 Returns a TREE_LIST of identifier nodes. */
25878 static tree
25880 {
25881 tree identifier;
25882 tree list;
25893 {
25900 identifier));
25902 }
25905 }
25907 /* Parse an Objective-C alias declaration.
25909 objc-alias-declaration:
25910 @compatibility_alias identifier identifier ;
25912 This function registers the alias mapping with the Objective-C front end.
25913 It returns nothing. */
25915 static void
25917 {
25925 }
25927 /* Parse an Objective-C class forward-declaration.
25929 objc-class-declaration:
25930 @class objc-identifier-list ;
25932 The function registers the forward declarations with the Objective-C
25933 front end. It returns nothing. */
25935 static void
25937 {
25940 {
25941 tree id;
25951 else
25953 }
25955 }
25957 /* Parse a list of Objective-C protocol references.
25959 objc-protocol-refs-opt:
25960 objc-protocol-refs [opt]
25962 objc-protocol-refs:
25963 < objc-identifier-list >
25965 Returns a TREE_LIST of identifiers, if any. */
25967 static tree
25969 {
25973 {
25977 }
25980 }
25982 /* Parse a Objective-C visibility specification. */
25984 static void
25986 {
25990 {
26005 }
26007 /* Eat '@private'/'@protected'/'@public'. */
26009 }
26011 /* Parse an Objective-C method type. Return 'true' if it is a class
26012 (+) method, and 'false' if it is an instance (-) method. */
26016 {
26019 else
26021 }
26023 /* Parse an Objective-C protocol qualifier. */
26025 static tree
26027 {
26040 {
26045 }
26048 }
26050 /* Parse an Objective-C typename. */
26052 static tree
26054 {
26058 {
26064 /* An ObjC type name may consist of just protocol qualifiers, in which
26065 case the type shall default to 'id'. */
26067 {
26070 /* If the type could not be parsed, an error has already
26071 been produced. For error recovery, behave as if it had
26072 not been specified, which will use the default type
26073 'id'. */
26075 {
26077 /* We need to skip to the closing parenthesis as
26078 cp_parser_type_id() does not seem to do it for
26079 us. */
26084 }
26085 }
26089 }
26092 }
26094 /* Check to see if TYPE refers to an Objective-C selector name. */
26096 static bool
26098 {
26104 }
26106 /* Parse an Objective-C selector. */
26108 static tree
26110 {
26114 {
26117 }
26119 /* C++ operator names are allowed to appear in ObjC selectors. */
26121 {
26134 }
26135 }
26137 /* Parse an Objective-C params list. */
26139 static tree
26141 {
26147 {
26157 /* Detect if we have a unary selector. */
26160 {
26163 }
26167 {
26168 /* Something went quite wrong. There should be a colon
26169 here, but there is not. Stop parsing parameters. */
26171 }
26173 /* New ObjC allows attributes on parameters too. */
26178 params
26181 type_name,
26182 identifier,
26183 parm_attr));
26186 }
26189 {
26192 }
26194 /* We allow tail attributes for the method. */
26196 {
26204 }
26207 {
26210 }
26212 }
26214 /* Parse the non-keyword Objective-C params. */
26216 static tree
26219 {
26225 {
26227 tree parm;
26233 {
26238 }
26240 /* TODO: parse attributes for tail parameters. */
26249 }
26251 /* We allow tail attributes for the method. */
26253 {
26255 {
26260 }
26261 else
26262 /* We have an error, but parse the attributes, so that we can
26263 carry on. */
26269 }
26272 }
26274 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26276 static void
26278 {
26281 /* If the next token is `extern' and the following token is a string
26282 literal, then we have a linkage specification. */
26284 && cp_parser_is_pure_string_literal
26287 /* Handle #pragma, if any. */
26290 /* Allow stray semicolons. */
26293 /* Mark methods as optional or required, when building protocols. */
26295 {
26298 }
26300 {
26303 }
26306 /* Other stray characters must generate errors. */
26308 {
26312 }
26313 /* Finally, try to parse a block-declaration, or a function-definition. */
26314 else
26316 }
26318 /* Parse a method signature. */
26320 static tree
26322 {
26338 }
26340 static bool
26342 {
26343 tree tattr;
26348 /* If the attributes are followed by a method introducer, this is not allowed.
26349 Dump the attributes and flag the situation. */
26354 /* Otherwise, the attributes introduce some interstitial code, possibly so
26355 rewind to allow that check. */
26358 }
26360 /* Parse an Objective-C method prototype list. */
26362 static void
26364 {
26368 {
26370 {
26375 else
26379 {
26383 }
26386 }
26392 OPT_Wattributes,
26394 else
26395 /* Allow for interspersed non-ObjC++ code. */
26399 }
26403 else
26407 }
26409 /* Parse an Objective-C method definition list. */
26411 static void
26413 {
26417 {
26418 tree meth;
26421 {
26427 else
26432 {
26436 }
26438 NULL_TREE);
26440 /* For historical reasons, we accept an optional semicolon. */
26447 {
26454 }
26455 }
26456 /* The following case will be removed once @synthesize is
26457 completely implemented. */
26468 else
26469 /* Allow for interspersed non-ObjC++ code. */
26473 }
26477 else
26481 }
26483 /* Parse Objective-C ivars. */
26485 static void
26487 {
26498 {
26499 cp_decl_specifier_seq declspecs;
26501 tree prefix_attributes;
26509 CP_PARSER_FLAGS_OPTIONAL,
26513 /* auto, register, static, extern, mutable. */
26515 {
26518 }
26520 /* thread_local. */
26522 {
26525 }
26527 /* typedef. */
26529 {
26532 }
26537 /* Keep going until we hit the `;' at the end of the
26538 declaration. */
26540 {
26545 /* Check for a (possibly unnamed) bitfield declaration. */
26553 {
26554 /* Get the name of the bitfield. */
26557 sfk_none);
26559 eat_colon:
26561 /* Get the width of the bitfield. */
26562 width
26564 }
26565 else
26566 {
26567 /* Parse the declarator. */
26568 declarator
26574 }
26576 /* Look for attributes that apply to the ivar. */
26578 /* Remember which attributes are prefix attributes and
26579 which are not. */
26581 /* Combine the attributes. */
26585 /* Create the bitfield declaration. */
26587 width,
26588 attributes);
26589 else
26594 /* Add the instance variable. */
26598 /* Reset PREFIX_ATTRIBUTES. */
26607 {
26610 }
26612 }
26616 }
26621 /* Do not consume the RID_AT_END, so it will be read again as terminating
26622 the @interface of @implementation. */
26626 /* For historical reasons, we accept an optional semicolon. */
26629 }
26631 /* Parse an Objective-C protocol declaration. */
26633 static void
26635 {
26641 {
26646 }
26648 /* See if we have a forward declaration or a definition. */
26651 /* Try a forward declaration first. */
26653 {
26655 {
26656 tree id;
26666 else
26668 }
26670 }
26672 /* Ok, we got a full-fledged definition (or at least should). */
26673 else
26674 {
26679 }
26680 }
26682 /* Parse an Objective-C superclass or category. */
26684 static void
26689 {
26695 {
26698 }
26700 {
26703 /* If there is no category name, and this is an @interface, we
26704 have a class extension. */
26706 {
26709 }
26710 else
26714 }
26715 }
26717 /* Parse an Objective-C class interface. */
26719 static void
26721 {
26728 {
26729 /* It's hard to recover because even if valid @interface stuff
26730 is to follow, we can't compile it (or validate it) if we
26731 don't even know which class it refers to. Let's assume this
26732 was a stray '@interface' token in the stream and skip it.
26733 */
26735 }
26740 /* We have either a class or a category on our hands. */
26743 else
26744 {
26746 /* Handle instance variable declarations, if any. */
26749 }
26752 }
26754 /* Parse an Objective-C class implementation. */
26756 static void
26758 {
26765 {
26766 /* It's hard to recover because even if valid @implementation
26767 stuff is to follow, we can't compile it (or validate it) if
26768 we don't even know which class it refers to. Let's assume
26769 this was a stray '@implementation' token in the stream and
26770 skip it.
26771 */
26773 }
26777 /* We have either a class or a category on our hands. */
26780 else
26781 {
26783 /* Handle instance variable declarations, if any. */
26786 }
26789 }
26791 /* Consume the @end token and finish off the implementation. */
26793 static void
26795 {
26798 }
26800 /* Parse an Objective-C declaration. */
26802 static void
26804 {
26805 /* Try to figure out what kind of declaration is present. */
26810 {
26826 }
26829 {
26852 }
26853 }
26855 /* Parse an Objective-C try-catch-finally statement.
26857 objc-try-catch-finally-stmt:
26858 @try compound-statement objc-catch-clause-seq [opt]
26859 objc-finally-clause [opt]
26861 objc-catch-clause-seq:
26862 objc-catch-clause objc-catch-clause-seq [opt]
26864 objc-catch-clause:
26865 @catch ( objc-exception-declaration ) compound-statement
26867 objc-finally-clause:
26868 @finally compound-statement
26870 objc-exception-declaration:
26871 parameter-declaration
26872 '...'
26874 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26876 Returns NULL_TREE.
26878 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26879 for C. Keep them in sync. */
26881 static tree
26883 {
26884 location_t location;
26885 tree stmt;
26890 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26891 node, lest it get absorbed into the surrounding block. */
26897 {
26906 {
26907 /* We have "@catch (...)" (where the '...' are literally
26908 what is in the code). Skip the '...'.
26909 parameter_declaration is set to NULL_TREE, and
26910 objc_being_catch_clauses() knows that that means
26911 '...'. */
26914 }
26915 else
26916 {
26917 /* We have "@catch (NSException *exception)" or something
26918 like that. Parse the parameter declaration. */
26922 else
26927 }
26930 else
26931 {
26932 /* If there was no open parenthesis, we are recovering from
26933 an error, and we are trying to figure out what mistake
26934 the user has made. */
26936 /* If there is an immediate closing parenthesis, the user
26937 probably forgot the opening one (ie, they typed "@catch
26938 NSException *e)". Parse the closing parenthesis and keep
26939 going. */
26943 /* If these is no immediate closing parenthesis, the user
26944 probably doesn't know that parenthesis are required at
26945 all (ie, they typed "@catch NSException *e"). So, just
26946 forget about the closing parenthesis and keep going. */
26947 }
26951 }
26953 {
26956 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26957 node, lest it get absorbed into the surrounding block. */
26961 }
26964 }
26966 /* Parse an Objective-C synchronized statement.
26968 objc-synchronized-stmt:
26969 @synchronized ( expression ) compound-statement
26971 Returns NULL_TREE. */
26973 static tree
26975 {
26976 location_t location;
26987 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26988 node, lest it get absorbed into the surrounding block. */
26993 }
26995 /* Parse an Objective-C throw statement.
26997 objc-throw-stmt:
26998 @throw assignment-expression [opt] ;
27000 Returns a constructed '@throw' statement. */
27002 static tree
27004 {
27016 }
27018 /* Parse an Objective-C statement. */
27020 static tree
27022 {
27023 /* Try to figure out what kind of declaration is present. */
27027 {
27038 }
27041 }
27043 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27044 look ahead to see if an objc keyword follows the attributes. This
27045 is to detect the use of prefix attributes on ObjC @interface and
27046 @protocol. */
27048 static bool
27050 {
27055 {
27058 }
27061 }
27063 /* This routine is a minimal replacement for
27064 c_parser_struct_declaration () used when parsing the list of
27065 types/names or ObjC++ properties. For example, when parsing the
27066 code
27068 @property (readonly) int a, b, c;
27070 this function is responsible for parsing "int a, int b, int c" and
27071 returning the declarations as CHAIN of DECLs.
27073 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27074 similar parsing. */
27075 static tree
27077 {
27079 cp_decl_specifier_seq declspecs;
27081 tree prefix_attributes;
27084 CP_PARSER_FLAGS_NONE,
27091 /* auto, register, static, extern, mutable. */
27093 {
27096 }
27098 /* thread_local. */
27100 {
27103 }
27105 /* typedef. */
27107 {
27110 }
27115 /* Keep going until we hit the `;' at the end of the declaration. */
27117 {
27122 /* Parse the declarator. */
27126 /* Look for attributes that apply to the ivar. */
27128 /* Remember which attributes are prefix attributes and
27129 which are not. */
27131 /* Combine the attributes. */
27141 /* Reset PREFIX_ATTRIBUTES. */
27152 {
27155 }
27156 else
27158 }
27160 }
27162 /* Parse an Objective-C @property declaration. The syntax is:
27164 objc-property-declaration:
27165 '@property' objc-property-attributes[opt] struct-declaration ;
27167 objc-property-attributes:
27168 '(' objc-property-attribute-list ')'
27170 objc-property-attribute-list:
27171 objc-property-attribute
27172 objc-property-attribute-list, objc-property-attribute
27174 objc-property-attribute
27175 'getter' = identifier
27176 'setter' = identifier
27177 'readonly'
27178 'readwrite'
27179 'assign'
27180 'retain'
27181 'copy'
27182 'nonatomic'
27184 For example:
27185 @property NSString *name;
27186 @property (readonly) id object;
27187 @property (retain, nonatomic, getter=getTheName) id name;
27188 @property int a, b, c;
27190 PS: This function is identical to
27191 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27192 static void
27194 {
27195 /* The following variables hold the attributes of the properties as
27196 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27197 seen. When we see an attribute, we set them to 'true' (if they
27198 are boolean properties) or to the identifier (if they have an
27199 argument, ie, for getter and setter). Note that here we only
27200 parse the list of attributes, check the syntax and accumulate the
27201 attributes that we find. objc_add_property_declaration() will
27202 then process the information. */
27212 /* 'properties' is the list of properties that we read. Usually a
27213 single one, but maybe more (eg, in "@property int a, b, c;" there
27214 are three). */
27215 tree properties;
27216 location_t loc;
27222 /* Parse the optional attribute list... */
27224 {
27225 /* Eat the '('. */
27229 {
27235 {
27238 }
27242 {
27253 {
27257 else
27262 }
27265 {
27269 }
27271 {
27273 {
27276 }
27277 else
27281 else
27283 }
27284 else
27285 {
27287 {
27290 }
27291 else
27293 }
27299 }
27306 else
27308 }
27310 /* FIXME: "@property (setter, assign);" will generate a spurious
27311 "error: expected ‘)’ before ‘,’ token". This is because
27312 cp_parser_require, unlike the C counterpart, will produce an
27313 error even if we are in error recovery. */
27315 {
27320 }
27321 }
27323 /* ... and the property declaration(s). */
27327 {
27329 /* If the next token is now a `;', consume it. */
27333 }
27337 else
27338 {
27339 /* Comma-separated properties are chained together in
27340 reverse order; add them one by one. */
27349 }
27352 }
27354 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27356 objc-synthesize-declaration:
27357 @synthesize objc-synthesize-identifier-list ;
27359 objc-synthesize-identifier-list:
27360 objc-synthesize-identifier
27361 objc-synthesize-identifier-list, objc-synthesize-identifier
27363 objc-synthesize-identifier
27364 identifier
27365 identifier = identifier
27367 For example:
27368 @synthesize MyProperty;
27369 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27371 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27372 for C. Keep them in sync.
27373 */
27374 static void
27376 {
27378 location_t loc;
27383 {
27387 {
27390 }
27392 {
27396 {
27399 }
27400 }
27401 else
27406 else
27408 }
27411 }
27413 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27415 objc-dynamic-declaration:
27416 @dynamic identifier-list ;
27418 For example:
27419 @dynamic MyProperty;
27420 @dynamic MyProperty, AnotherProperty;
27422 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27423 for C. Keep them in sync.
27424 */
27425 static void
27427 {
27429 location_t loc;
27434 {
27435 tree property;
27438 {
27441 }
27445 else
27447 }
27450 }
27452 \f
27453 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27455 /* Returns name of the next clause.
27456 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27457 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27458 returned and the token is consumed. */
27460 static pragma_omp_clause
27462 {
27476 {
27481 {
27626 }
27627 }
27633 }
27635 /* Validate that a clause of the given type does not already exist. */
27637 static void
27640 {
27641 tree c;
27645 {
27648 }
27649 }
27651 /* OpenMP 2.5:
27652 variable-list:
27653 identifier
27654 variable-list , identifier
27656 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27657 colon). An opening parenthesis will have been consumed by the caller.
27659 If KIND is nonzero, create the appropriate node and install the decl
27660 in OMP_CLAUSE_DECL and add the node to the head of the list.
27662 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27663 return the list created.
27665 COLON can be NULL if only closing parenthesis should end the list,
27666 or pointer to bool which will receive false if the list is terminated
27667 by closing parenthesis or true if the list is terminated by colon. */
27669 static tree
27672 {
27676 {
27679 }
27681 {
27698 {
27700 {
27703 {
27707 }
27708 /* FALL THROUGH. */
27714 {
27722 parser->colon_corrects_to_scope_p
27726 else
27727 {
27728 /* Look for `:'. */
27732 CPP_CLOSE_SQUARE))
27734 }
27735 /* Look for the closing `]'. */
27737 RT_CLOSE_SQUARE))
27741 {
27744 {
27748 }
27752 {
27756 }
27757 }
27760 }
27764 }
27770 }
27771 else
27774 get_comma:
27778 }
27784 {
27788 }
27791 {
27794 /* Try to resync to an unnested comma. Copied from
27795 cp_parser_parenthesized_expression_list. */
27796 skip_comma:
27805 }
27808 }
27810 /* Similarly, but expect leading and trailing parenthesis. This is a very
27811 common case for omp clauses. */
27813 static tree
27815 {
27819 }
27821 /* OpenACC 2.0:
27822 copy ( variable-list )
27823 copyin ( variable-list )
27824 copyout ( variable-list )
27825 create ( variable-list )
27826 delete ( variable-list )
27827 present ( variable-list )
27828 present_or_copy ( variable-list )
27829 pcopy ( variable-list )
27830 present_or_copyin ( variable-list )
27831 pcopyin ( variable-list )
27832 present_or_copyout ( variable-list )
27833 pcopyout ( variable-list )
27834 present_or_create ( variable-list )
27835 pcreate ( variable-list ) */
27837 static tree
27839 tree list)
27840 {
27843 {
27883 }
27891 }
27893 /* OpenACC 2.0:
27894 deviceptr ( variable-list ) */
27896 static tree
27898 {
27902 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27903 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
27904 variable-list must only allow for pointer variables. */
27907 {
27910 /* FIXME diagnostics: Ideally we should keep individual
27911 locations for all the variables in the var list to make the
27912 following errors more precise. Perhaps
27913 c_parser_omp_var_list_parens should construct a list of
27914 locations to go along with the var list. */
27919 ;
27928 }
27931 }
27933 /* OpenACC:
27934 vector_length ( expression ) */
27936 static tree
27938 {
27948 {
27951 }
27954 {
27959 }
27962 location);
27970 }
27972 /* OpenACC 2.0
27973 Parse wait clause or directive parameters. */
27975 static tree
27977 {
27987 {
27992 }
27999 {
28003 {
28006 else
28007 {
28014 }
28015 }
28016 }
28019 }
28021 /* OpenACC:
28022 wait ( int-expr-list ) */
28024 static tree
28026 {
28035 }
28037 /* OpenMP 3.0:
28038 collapse ( constant-expression ) */
28040 static tree
28042 {
28044 location_t loc;
28045 HOST_WIDE_INT n;
28065 {
28068 }
28076 }
28078 /* OpenMP 2.5:
28079 default ( shared | none ) */
28081 static tree
28083 {
28085 tree c;
28090 {
28095 {
28110 }
28113 }
28114 else
28115 {
28116 invalid_kind:
28118 }
28134 }
28136 /* OpenMP 3.1:
28137 final ( expression ) */
28139 static tree
28141 {
28162 }
28164 /* OpenMP 2.5:
28165 if ( expression ) */
28167 static tree
28169 {
28190 }
28192 /* OpenMP 3.1:
28193 mergeable */
28195 static tree
28198 {
28199 tree c;
28202 location);
28207 }
28209 /* OpenMP 2.5:
28210 nowait */
28212 static tree
28215 {
28216 tree c;
28223 }
28225 /* OpenACC:
28226 num_gangs ( expression ) */
28228 static tree
28230 {
28246 {
28249 }
28259 }
28261 /* OpenMP 2.5:
28262 num_threads ( expression ) */
28264 static tree
28266 location_t location)
28267 {
28289 }
28291 /* OpenACC:
28292 num_workers ( expression ) */
28294 static tree
28296 {
28312 {
28315 }
28318 location);
28326 }
28328 /* OpenMP 2.5:
28329 ordered */
28331 static tree
28334 {
28335 tree c;
28343 }
28345 /* OpenMP 2.5:
28346 reduction ( reduction-operator : variable-list )
28348 reduction-operator:
28349 One of: + * - & ^ | && ||
28351 OpenMP 3.1:
28353 reduction-operator:
28354 One of: + * - & ^ | && || min max
28356 OpenMP 4.0:
28358 reduction-operator:
28359 One of: + * - & ^ | && ||
28360 id-expression */
28362 static tree
28364 {
28372 {
28382 }
28386 else
28387 {
28398 {
28428 }
28429 else
28430 {
28432 resync_fail:
28437 }
28438 }
28444 NULL);
28446 {
28449 }
28452 }
28454 /* OpenMP 2.5:
28455 schedule ( schedule-kind )
28456 schedule ( schedule-kind , expression )
28458 schedule-kind:
28459 static | dynamic | guided | runtime | auto */
28461 static tree
28463 {
28472 {
28477 {
28498 }
28499 }
28504 else
28509 {
28524 else
28529 }
28537 invalid_kind:
28539 resync_fail:
28544 }
28546 /* OpenMP 3.0:
28547 untied */
28549 static tree
28552 {
28553 tree c;
28560 }
28562 /* OpenMP 4.0:
28563 inbranch
28564 notinbranch */
28566 static tree
28569 {
28574 }
28576 /* OpenMP 4.0:
28577 parallel
28578 for
28579 sections
28580 taskgroup */
28582 static tree
28586 {
28590 }
28592 /* OpenMP 4.0:
28593 num_teams ( expression ) */
28595 static tree
28597 location_t location)
28598 {
28620 }
28622 /* OpenMP 4.0:
28623 thread_limit ( expression ) */
28625 static tree
28627 location_t location)
28628 {
28650 }
28652 /* OpenMP 4.0:
28653 aligned ( variable-list )
28654 aligned ( variable-list : constant-expression ) */
28656 static tree
28658 {
28669 {
28679 }
28685 }
28687 /* OpenMP 4.0:
28688 linear ( variable-list )
28689 linear ( variable-list : expression ) */
28691 static tree
28694 {
28705 {
28709 {
28712 }
28720 }
28726 }
28728 /* OpenMP 4.0:
28729 safelen ( constant-expression ) */
28731 static tree
28733 location_t location)
28734 {
28755 }
28757 /* OpenMP 4.0:
28758 simdlen ( constant-expression ) */
28760 static tree
28762 location_t location)
28763 {
28784 }
28786 /* OpenMP 4.0:
28787 depend ( depend-kind : variable-list )
28789 depend-kind:
28790 in | out | inout */
28792 static tree
28794 {
28802 {
28812 else
28814 }
28815 else
28823 NULL);
28830 invalid_kind:
28832 resync_fail:
28837 }
28839 /* OpenMP 4.0:
28840 map ( map-kind : variable-list )
28841 map ( variable-list )
28843 map-kind:
28844 alloc | to | from | tofrom */
28846 static tree
28848 {
28857 {
28869 else
28870 {
28876 }
28879 }
28882 NULL);
28888 }
28890 /* OpenMP 4.0:
28891 device ( expression ) */
28893 static tree
28895 location_t location)
28896 {
28918 }
28920 /* OpenMP 4.0:
28921 dist_schedule ( static )
28922 dist_schedule ( static , expression ) */
28924 static tree
28926 location_t location)
28927 {
28940 {
28951 }
28956 location);
28960 invalid_kind:
28962 resync_fail:
28967 }
28969 /* OpenMP 4.0:
28970 proc_bind ( proc-bind-kind )
28972 proc-bind-kind:
28973 master | close | spread */
28975 static tree
28977 location_t location)
28978 {
28979 tree c;
28986 {
28996 else
28998 }
28999 else
29008 location);
29013 invalid_kind:
29015 resync_fail:
29020 }
29022 /* OpenACC:
29023 async [( int-expr )] */
29025 static tree
29027 {
29034 {
29043 }
29053 }
29055 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29056 is a bitmask in MASK. Return the list of clauses found. */
29058 static tree
29062 {
29067 {
29068 location_t here;
29069 pragma_omp_clause c_kind;
29080 {
29162 clauses =
29173 }
29178 {
29179 /* Remove the invalid clause(s) from the list to avoid
29180 confusing the rest of the compiler. */
29183 }
29184 }
29186 saw_error:
29193 }
29195 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29196 is a bitmask in MASK. Return the list of clauses found; the result
29197 of clause default goes in *pdefault. */
29199 static tree
29203 {
29210 {
29211 pragma_omp_clause c_kind;
29222 {
29234 clauses);
29248 clauses);
29257 clauses);
29281 clauses);
29295 clauses);
29312 OMP_CLAUSE_NOTINBRANCH,
29321 {
29322 clause_not_first:
29326 }
29351 clauses);
29356 clauses);
29361 clauses);
29424 }
29429 {
29430 /* Remove the invalid clause(s) from the list to avoid
29431 confusing the rest of the compiler. */
29434 }
29435 }
29436 saw_error:
29437 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29438 no reason to skip to the end. */
29444 }
29446 /* OpenMP 2.5:
29447 structured-block:
29448 statement
29450 In practice, we're also interested in adding the statement to an
29451 outer node. So it is convenient if we work around the fact that
29452 cp_parser_statement calls add_stmt. */
29454 static unsigned
29456 {
29459 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29460 This preserves the "not within loop or switch" style error messages
29461 for nonsense cases like
29462 void foo() {
29463 #pragma omp single
29464 break;
29465 }
29466 */
29471 }
29473 static void
29475 {
29477 }
29479 static tree
29481 {
29489 }
29491 /* OpenMP 2.5:
29492 # pragma omp atomic new-line
29493 expression-stmt
29495 expression-stmt:
29496 x binop= expr | x++ | ++x | x-- | --x
29497 binop:
29498 +, *, -, /, &, ^, |, <<, >>
29500 where x is an lvalue expression with scalar type.
29502 OpenMP 3.1:
29503 # pragma omp atomic new-line
29504 update-stmt
29506 # pragma omp atomic read new-line
29507 read-stmt
29509 # pragma omp atomic write new-line
29510 write-stmt
29512 # pragma omp atomic update new-line
29513 update-stmt
29515 # pragma omp atomic capture new-line
29516 capture-stmt
29518 # pragma omp atomic capture new-line
29519 capture-block
29521 read-stmt:
29522 v = x
29523 write-stmt:
29524 x = expr
29525 update-stmt:
29526 expression-stmt | x = x binop expr
29527 capture-stmt:
29528 v = expression-stmt
29529 capture-block:
29530 { v = x; update-stmt; } | { update-stmt; v = x; }
29532 OpenMP 4.0:
29533 update-stmt:
29534 expression-stmt | x = x binop expr | x = expr binop x
29535 capture-stmt:
29536 v = update-stmt
29537 capture-block:
29538 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29540 where x and v are lvalue expressions with scalar type. */
29542 static void
29544 {
29552 {
29557 {
29563 }
29564 }
29566 {
29578 else
29582 }
29584 {
29590 {
29595 {
29598 }
29599 }
29600 }
29604 {
29614 else
29619 {
29620 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29621 opcode. */
29626 }
29630 {
29633 }
29634 else
29635 {
29641 }
29644 }
29646 restart:
29650 {
29657 /* FALLTHROUGH */
29667 /* FALLTHROUGH */
29682 /* Undo effects of boolean_increment for post {in,de}crement. */
29684 /* FALLTHRU */
29688 {
29689 /* Undo effects of boolean_increment. */
29691 {
29692 /* This is pre or post increment. */
29697 && !structured_block
29701 }
29702 }
29703 /* FALLTHRU */
29706 {
29741 {
29745 }
29748 {
29754 {
29759 }
29761 {
29772 {
29774 {
29779 }
29780 else
29782 }
29786 }
29789 {
29796 }
29800 }
29804 {
29807 {
29815 }
29817 {
29822 }
29857 }
29868 /* FALLTHROUGH */
29873 }
29880 }
29881 stmt_done:
29883 {
29894 }
29896 {
29899 }
29900 done:
29906 saw_error:
29909 {
29913 {
29917 }
29918 }
29919 }
29922 /* OpenMP 2.5:
29923 # pragma omp barrier new-line */
29925 static void
29927 {
29930 }
29932 /* OpenMP 2.5:
29933 # pragma omp critical [(name)] new-line
29934 structured-block */
29936 static tree
29938 {
29942 {
29954 }
29959 }
29961 /* OpenMP 2.5:
29962 # pragma omp flush flush-vars[opt] new-line
29964 flush-vars:
29965 ( variable-list ) */
29967 static void
29969 {
29975 }
29977 /* Helper function, to parse omp for increment expression. */
29979 static tree
29981 {
29986 {
29989 }
29992 {
30001 /* Fall through: OpenMP disallows NE_EXPR. */
30004 }
30006 /* If decl is an iterator, preserve LHS and RHS of the relational
30007 expr until finish_omp_for. */
30017 }
30019 /* Helper function, to parse omp for increment expression. */
30021 static tree
30023 {
30027 cp_id_kind idk;
30031 {
30039 }
30047 {
30052 }
30059 {
30063 }
30075 do
30076 {
30083 {
30085 {
30088 else
30090 tf_warning_or_error);
30091 }
30092 else
30095 }
30096 }
30100 {
30104 }
30105 else
30109 }
30111 /* Parse the initialization statement of either an OpenMP for loop or
30112 a Cilk Plus for loop.
30114 Return true if the resulting construct should have an
30115 OMP_CLAUSE_PRIVATE added to it. */
30117 static bool
30125 {
30131 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30133 init-expr:
30134 var = lb
30135 integer-type var = lb
30136 random-access-iterator-type var = lb
30137 pointer-type var = lb
30138 */
30139 cp_decl_specifier_seq type_specifiers;
30141 /* First, try to parse as an initialized declaration. See
30142 cp_parser_condition, from whence the bulk of this is copied. */
30149 {
30150 /* If parsing a type specifier seq succeeded, then this
30151 MUST be a initialized declaration. */
30156 CP_PARSER_DECLARATOR_NAMED,
30167 else
30168 {
30178 {
30180 CPP_OPEN_PAREN))
30181 {
30185 else
30188 }
30189 else
30190 /* Trigger an error. */
30195 }
30199 {
30207 {
30210 auto_node);
30215 }
30218 asm_specification,
30219 LOOKUP_ONLYCONVERTING);
30221 {
30224 }
30225 else
30228 }
30229 else
30230 {
30231 /* Consume '='. */
30235 non_class:
30238 else
30241 asm_specification,
30242 LOOKUP_ONLYCONVERTING);
30243 }
30247 }
30248 }
30249 else
30250 {
30251 cp_id_kind idk;
30252 /* If parsing a type specifier sequence failed, then
30253 this MUST be a simple expression. */
30261 && decl
30264 {
30265 tree rhs;
30272 rhs,
30273 tf_warning_or_error));
30275 }
30276 else
30277 {
30282 {
30286 }
30287 }
30288 }
30290 }
30292 /* Parse the restricted form of the for statement allowed by OpenMP. */
30294 static tree
30297 {
30301 location_t loc_first;
30320 {
30323 location_t loc;
30327 {
30330 }
30333 {
30336 }
30345 add_private_clause
30352 {
30355 {
30361 }
30362 else
30364 }
30371 {
30376 {
30380 }
30383 {
30384 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30385 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30390 {
30393 }
30394 else
30395 {
30398 }
30402 }
30403 else
30404 {
30409 }
30410 }
30413 {
30414 tree c;
30416 {
30425 decl);
30429 decl);
30430 }
30432 {
30437 {
30440 }
30441 }
30442 }
30451 {
30452 /* If decl is an iterator, preserve the operator on decl
30453 until finish_omp_for. */
30455 && ((processing_template_decl
30459 else
30463 }
30478 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30479 in between the collapsed for loops to be still considered perfectly
30480 nested. Hopefully the final version clarifies this.
30481 For now handle (multiple) {'s and empty statements. */
30483 do
30484 {
30488 {
30490 bracecount++;
30491 }
30495 else
30496 {
30503 }
30504 }
30508 {
30511 }
30512 }
30514 /* Note that we saved the original contents of this flag when we entered
30515 the structured block, and so we don't need to re-save it here. */
30518 else
30521 /* Note that the grammar doesn't call for a structured block here,
30522 though the loop as a whole is a structured block. */
30529 else
30534 {
30536 {
30538 nbraces--;
30539 }
30542 else
30543 {
30545 {
30548 }
30553 }
30554 }
30561 }
30563 /* Helper function for OpenMP parsing, split clauses and call
30564 finish_omp_clauses on each of the set of clauses afterwards. */
30566 static void
30569 {
30575 }
30577 /* OpenMP 4.0:
30578 #pragma omp simd simd-clause[optseq] new-line
30579 for-loop */
30581 #define OMP_SIMD_CLAUSE_MASK \
30582 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30590 static tree
30593 {
30605 {
30608 }
30619 }
30621 /* OpenMP 2.5:
30622 #pragma omp for for-clause[optseq] new-line
30623 for-loop
30625 OpenMP 4.0:
30626 #pragma omp for simd for-simd-clause[optseq] new-line
30627 for-loop */
30629 #define OMP_FOR_CLAUSE_MASK \
30630 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30639 static tree
30642 {
30653 {
30658 {
30666 cclauses);
30670 cclauses);
30682 }
30683 }
30685 {
30688 }
30693 {
30696 }
30707 }
30709 /* OpenMP 2.5:
30710 # pragma omp master new-line
30711 structured-block */
30713 static tree
30715 {
30719 }
30721 /* OpenMP 2.5:
30722 # pragma omp ordered new-line
30723 structured-block */
30725 static tree
30727 {
30731 }
30733 /* OpenMP 2.5:
30735 section-scope:
30736 { section-sequence }
30738 section-sequence:
30739 section-directive[opt] structured-block
30740 section-sequence section-directive structured-block */
30742 static tree
30744 {
30755 {
30759 }
30762 {
30770 {
30774 }
30776 {
30779 }
30784 }
30795 }
30797 /* OpenMP 2.5:
30798 # pragma omp sections sections-clause[optseq] newline
30799 sections-scope */
30801 #define OMP_SECTIONS_CLAUSE_MASK \
30802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30808 static tree
30811 {
30823 {
30826 }
30833 }
30835 /* OpenMP 2.5:
30836 # pragma omp parallel parallel-clause[optseq] new-line
30837 structured-block
30838 # pragma omp parallel for parallel-for-clause[optseq] new-line
30839 structured-block
30840 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30841 structured-block
30843 OpenMP 4.0:
30844 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30845 structured-block */
30847 #define OMP_PARALLEL_CLAUSE_MASK \
30848 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30858 static tree
30861 {
30870 {
30883 block);
30888 }
30890 {
30894 }
30896 {
30899 }
30901 {
30905 {
30915 block);
30918 }
30919 }
30929 }
30931 /* OpenMP 2.5:
30932 # pragma omp single single-clause[optseq] new-line
30933 structured-block */
30935 #define OMP_SINGLE_CLAUSE_MASK \
30936 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30941 static tree
30943 {
30953 }
30955 /* OpenMP 3.0:
30956 # pragma omp task task-clause[optseq] new-line
30957 structured-block */
30959 #define OMP_TASK_CLAUSE_MASK \
30960 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30970 static tree
30972 {
30983 }
30985 /* OpenMP 3.0:
30986 # pragma omp taskwait new-line */
30988 static void
30990 {
30993 }
30995 /* OpenMP 3.1:
30996 # pragma omp taskyield new-line */
30998 static void
31000 {
31003 }
31005 /* OpenMP 4.0:
31006 # pragma omp taskgroup new-line
31007 structured-block */
31009 static tree
31011 {
31015 }
31018 /* OpenMP 2.5:
31019 # pragma omp threadprivate (variable-list) */
31021 static void
31023 {
31024 tree vars;
31030 }
31032 /* OpenMP 4.0:
31033 # pragma omp cancel cancel-clause[optseq] new-line */
31035 #define OMP_CANCEL_CLAUSE_MASK \
31036 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31042 static void
31044 {
31048 }
31050 /* OpenMP 4.0:
31051 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31053 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31054 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31059 static void
31061 {
31062 tree clauses;
31066 {
31071 {
31074 }
31075 }
31077 {
31081 }
31084 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31086 pragma_tok);
31088 }
31090 /* OpenMP 4.0:
31091 #pragma omp distribute distribute-clause[optseq] new-line
31092 for-loop */
31094 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31095 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31100 static tree
31103 {
31112 {
31120 else
31123 {
31129 {
31132 cclauses);
31133 else
31135 cclauses);
31136 }
31141 cclauses);
31142 else
31144 cclauses);
31156 }
31157 }
31159 {
31162 }
31167 {
31170 }
31181 }
31183 /* OpenMP 4.0:
31184 # pragma omp teams teams-clause[optseq] new-line
31185 structured-block */
31187 #define OMP_TEAMS_CLAUSE_MASK \
31188 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31196 static tree
31199 {
31208 {
31212 {
31220 cclauses);
31224 cclauses);
31235 }
31236 }
31238 {
31241 }
31246 {
31249 }
31257 }
31259 /* OpenMP 4.0:
31260 # pragma omp target data target-data-clause[optseq] new-line
31261 structured-block */
31263 #define OMP_TARGET_DATA_CLAUSE_MASK \
31264 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31268 static tree
31270 {
31282 }
31284 /* OpenMP 4.0:
31285 # pragma omp target update target-update-clause[optseq] new-line */
31287 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31288 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31293 static bool
31296 {
31298 {
31300 "%<#pragma omp target update%> may only be "
31304 }
31306 tree clauses
31311 {
31313 "%<#pragma omp target update must contain at least one "
31316 }
31324 }
31326 /* OpenMP 4.0:
31327 # pragma omp target target-clause[optseq] new-line
31328 structured-block */
31330 #define OMP_TARGET_CLAUSE_MASK \
31331 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31335 static bool
31338 {
31340 {
31344 }
31347 {
31352 {
31360 {
31362 OMP_TARGET_CLAUSE_MASK,
31363 cclauses);
31365 }
31381 }
31383 {
31386 }
31388 {
31392 }
31394 {
31397 }
31398 }
31412 }
31414 /* OpenACC 2.0:
31415 # pragma acc cache (variable-list) new-line
31416 */
31418 static tree
31420 {
31435 }
31437 /* OpenACC 2.0:
31438 # pragma acc data oacc-data-clause[optseq] new-line
31439 structured-block */
31441 #define OACC_DATA_CLAUSE_MASK \
31442 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31454 static tree
31456 {
31469 }
31471 /* OpenACC 2.0:
31472 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31474 or
31476 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31478 LOC is the location of the #pragma token.
31479 */
31481 #define OACC_ENTER_DATA_CLAUSE_MASK \
31482 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31490 #define OACC_EXIT_DATA_CLAUSE_MASK \
31491 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31497 static tree
31500 {
31505 {
31511 }
31516 {
31520 }
31527 else
31532 {
31536 }
31542 else
31547 }
31549 /* OpenACC 2.0:
31550 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31551 structured-block */
31553 #define OACC_KERNELS_CLAUSE_MASK \
31554 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31568 static tree
31570 {
31583 }
31585 /* OpenACC 2.0:
31586 # pragma acc loop oacc-loop-clause[optseq] new-line
31587 structured-block */
31589 #define OACC_LOOP_CLAUSE_MASK \
31590 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31593 static tree
31595 {
31608 }
31610 /* OpenACC 2.0:
31611 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31612 structured-block */
31614 #define OACC_PARALLEL_CLAUSE_MASK \
31615 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31633 static tree
31635 {
31648 }
31650 /* OpenACC 2.0:
31651 # pragma acc update oacc-update-clause[optseq] new-line
31652 */
31654 #define OACC_UPDATE_CLAUSE_MASK \
31655 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31662 static tree
31664 {
31671 {
31673 "%<#pragma acc update%> must contain at least one "
31676 }
31684 }
31686 /* OpenACC 2.0:
31687 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31689 LOC is the location of the #pragma token.
31690 */
31692 #define OACC_WAIT_CLAUSE_MASK \
31693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31695 static tree
31697 {
31710 }
31712 /* OpenMP 4.0:
31713 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31715 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31716 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31723 static void
31726 {
31728 cp_omp_declare_simd_data data;
31730 {
31735 }
31746 {
31750 {
31763 }
31768 "%<#pragma omp declare simd%> not immediately followed by "
31772 }
31773 }
31775 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31776 This function is modelled similar to the late parsing of omp declare
31777 simd. */
31779 static tree
31781 {
31787 {
31793 }
31795 {
31799 }
31804 {
31811 NULL);
31825 }
31830 }
31832 /* Finalize #pragma omp declare simd clauses after direct declarator has
31833 been parsed, and put that into "omp declare simd" attribute. */
31835 static tree
31837 {
31843 {
31848 }
31853 {
31871 }
31875 }
31878 /* OpenMP 4.0:
31879 # pragma omp declare target new-line
31880 declarations and definitions
31881 # pragma omp end declare target new-line */
31883 static void
31885 {
31888 }
31890 static void
31892 {
31895 {
31898 }
31900 {
31904 {
31907 }
31910 else
31911 {
31915 }
31916 }
31917 else
31918 {
31922 }
31926 "%<#pragma omp end declare target%> without corresponding "
31928 else
31930 }
31932 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31933 expression and optional initializer clause of
31934 #pragma omp declare reduction. We store the expression(s) as
31935 either 3, 6 or 7 special statements inside of the artificial function's
31936 body. The first two statements are DECL_EXPRs for the artificial
31937 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31938 expression that uses those variables.
31939 If there was any INITIALIZER clause, this is followed by further statements,
31940 the fourth and fifth statements are DECL_EXPRs for the artificial
31941 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31942 constructor variant (first token after open paren is not omp_priv),
31943 then the sixth statement is a statement with the function call expression
31944 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31945 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31946 to initialize the OMP_PRIV artificial variable and there is seventh
31947 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31949 static bool
31951 {
31963 tree combiner;
31978 {
31981 }
31984 {
31991 {
31994 }
32010 {
32014 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32018 == CPP_CLOSE_PAREN
32021 {
32025 }
32030 }
32031 else
32032 {
32048 {
32053 }
32055 tree arg;
32068 }
32079 }
32085 }
32087 /* OpenMP 4.0
32088 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32089 initializer-clause[opt] new-line
32091 initializer-clause:
32092 initializer (omp_priv initializer)
32093 initializer (function-name (argument-list)) */
32095 static void
32098 {
32108 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32115 {
32147 }
32159 /* Types may not be defined in declare reduction type list. */
32162 parser->type_definition_forbidden_message
32168 saved_colon_doesnt_start_class_def_p
32173 {
32177 ;
32198 else
32203 else
32205 }
32207 /* Restore the saved message. */
32210 parser->colon_doesnt_start_class_def_p
32215 {
32216 fail:
32219 }
32225 {
32226 tree fntype
32229 NULL_TREE);
32248 {
32253 }
32255 {
32257 {
32266 }
32273 }
32274 else
32275 {
32278 }
32281 else
32284 {
32287 }
32289 {
32292 else
32297 }
32302 else
32303 {
32312 }
32319 }
32323 done:
32324 /* Free any declarators allocated. */
32326 }
32328 /* OpenMP 4.0
32329 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32330 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32331 initializer-clause[opt] new-line
32332 #pragma omp declare target new-line */
32334 static void
32337 {
32339 {
32344 {
32347 context);
32349 }
32352 {
32355 context);
32357 }
32359 {
32362 }
32364 {
32368 }
32369 }
32373 }
32375 /* Main entry point to OpenMP statement pragmas. */
32377 static void
32379 {
32380 tree stmt;
32385 {
32460 }
32464 }
32465 \f
32466 /* Transactional Memory parsing routines. */
32468 /* Parse a transaction attribute.
32470 txn-attribute:
32471 attribute
32472 [ [ identifier ] ]
32474 ??? Simplify this when C++0x bracket attributes are
32475 implemented properly. */
32477 static tree
32479 {
32494 {
32498 /* For keywords, use the canonical spelling,
32499 not the parsed identifier. */
32503 }
32504 else
32508 error1:
32511 }
32513 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32515 transaction-statement:
32516 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32517 compound-statement
32518 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32519 */
32521 static tree
32523 {
32538 else
32539 {
32543 }
32545 /* Parse a noexcept specification. */
32548 /* Keep track if we're in the lexical scope of an outer transaction. */
32560 }
32562 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32564 transaction-expression:
32565 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32566 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32567 */
32569 static tree
32571 {
32596 /* Set this early. This might mean that we allow transaction_cancel in
32597 an expression that we find out later actually has to be a constexpr.
32598 However, we expect that cxx_constant_value will be able to deal with
32599 this; also, if the noexcept has no constexpr, then what we parse next
32600 really is a transaction's body. */
32603 /* Parse a noexcept specification. */
32609 {
32616 }
32617 else
32618 {
32619 /* The only expression that is available got parsed for the noexcept
32620 already. noexcept is true then. */
32623 }
32632 }
32634 /* Parse a function-transaction-block.
32636 function-transaction-block:
32637 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32638 function-body
32639 __transaction_atomic txn-attribute[opt] function-try-block
32640 __transaction_relaxed ctor-initializer[opt] function-body
32641 __transaction_relaxed function-try-block
32642 */
32644 static bool
32646 {
32662 else
32663 {
32667 }
32675 else
32676 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32684 }
32686 /* Parse a __transaction_cancel statement.
32688 cancel-statement:
32689 __transaction_cancel txn-attribute[opt] ;
32690 __transaction_cancel txn-attribute[opt] throw-expression ;
32692 ??? Cancel and throw is not yet implemented. */
32694 static tree
32696 {
32702 RT_TRANSACTION_CANCEL);
32709 /* ??? Parse cancel-and-throw here. */
32714 {
32718 }
32720 {
32724 }
32726 {
32729 {
32735 }
32736 }
32738 {
32742 }
32748 }
32749 \f
32750 /* The parser. */
32754 \f
32755 /* Special handling for the first token or line in the file. The first
32756 thing in the file might be #pragma GCC pch_preprocess, which loads a
32757 PCH file, which is a GC collection point. So we need to handle this
32758 first pragma without benefit of an existing lexer structure.
32760 Always returns one token to the caller in *FIRST_TOKEN. This is
32761 either the true first token of the file, or the first token after
32762 the initial pragma. */
32764 static void
32766 {
32775 {
32782 }
32783 else
32786 /* Skip to the end of the pragma. */
32790 /* Now actually load the PCH file. */
32794 /* Read one more token to return to our caller. We have to do this
32795 after reading the PCH file in, since its pointers have to be
32796 live. */
32798 }
32800 /* Parses the grainsize pragma for the _Cilk_for statement.
32801 Syntax:
32802 #pragma cilk grainsize = <VALUE>. */
32804 static void
32806 {
32808 {
32813 {
32816 }
32818 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32821 else
32823 "%<#pragma cilk grainsize%> is not followed by "
32826 }
32828 }
32830 /* Normal parsing of a pragma token. Here we can (and must) use the
32831 regular lexer. */
32833 static bool
32835 {
32847 {
32855 {
32865 }
32870 {
32880 }
32885 {
32891 "%<#pragma omp taskwait%> may only be "
32896 }
32901 {
32907 "%<#pragma omp taskyield%> may only be "
32912 }
32917 {
32923 "%<#pragma omp cancel%> may only be "
32928 }
32933 {
32939 "%<#pragma omp cancellation point%> may only be "
32944 }
32991 "%<#pragma omp section%> may only be used in "
32996 {
33003 {
33006 }
33009 }
33013 {
33017 }
33023 {
33027 }
33029 /* Ignore the pragma if Cilk Plus is not enabled. */
33031 {
33034 }
33035 else
33036 {
33040 }
33047 bad_stmt:
33050 }
33054 }
33056 /* The interface the pragma parsers have to the lexer. */
33058 enum cpp_ttype
33060 {
33073 else
33074 {
33078 }
33081 }
33083 \f
33084 /* External interface. */
33086 /* Parse one entire translation unit. */
33088 void
33090 {
33102 }
33104 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33105 vectorlength clause:
33106 Syntax:
33107 vectorlength ( constant-expression ) */
33109 static tree
33112 {
33114 tree expr;
33115 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33116 safelen clause. Thus, vectorlength is represented as OMP 4.0
33117 safelen. For SIMD-enabled function it is represented by OMP 4.0
33118 simdlen. */
33121 loc);
33122 else
33124 loc);
33132 /* If expr == error_mark_node, then don't emit any errors nor
33133 create a clause. if any of the above functions returns
33134 error mark node then they would have emitted an error message. */
33136 ;
33144 else
33145 {
33146 tree c;
33148 {
33153 }
33154 else
33155 {
33160 }
33161 }
33166 }
33168 /* Handles the Cilk Plus #pragma simd linear clause.
33169 Syntax:
33170 linear ( simd-linear-variable-list )
33172 simd-linear-variable-list:
33173 simd-linear-variable
33174 simd-linear-variable-list , simd-linear-variable
33176 simd-linear-variable:
33177 id-expression
33178 id-expression : simd-linear-step
33180 simd-linear-step:
33181 conditional-expression */
33183 static tree
33185 {
33191 {
33195 }
33200 {
33203 {
33207 }
33214 {
33218 }
33219 else
33220 {
33224 /* If present, parse the linear step. Otherwise, assume the default
33225 value of 1. */
33227 {
33234 {
33235 /* If an error has occurred, then the whole pragma is
33236 considered ill-formed. Thus, no reason to keep
33237 parsing. */
33240 }
33248 else
33250 "step size must be an integer constant "
33252 }
33254 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33260 }
33265 else
33266 {
33271 }
33272 }
33276 }
33278 /* Returns the name of the next clause. If the clause is not
33279 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33280 token is not consumed. Otherwise, the appropriate enum from the
33281 pragma_simd_clause is returned and the token is consumed. */
33283 static pragma_omp_clause
33285 {
33286 pragma_omp_clause clause_type;
33303 else
33308 }
33310 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33312 static tree
33314 {
33319 {
33320 pragma_omp_clause c_kind;
33327 /* Use the OpenMP 4.0 equivalent function. */
33330 /* Use the OpenMP 4.0 equivalent function. */
33332 clauses);
33334 /* Use the OMP 4.0 equivalent function. */
33336 clauses);
33338 /* Use the OMP 4.0 equivalent function. */
33340 else
33341 {
33345 }
33346 }
33352 else
33354 }
33356 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33358 static void
33360 {
33367 {
33371 }
33380 }
33382 /* Main entry-point for parsing Cilk Plus _Cilk_for
33383 loops. The return value is error_mark_node
33384 when errors happen and CILK_FOR tree on success. */
33386 static tree
33388 {
33403 else
33409 }
33411 /* Create an identifier for a generic parameter type (a synthesized
33412 template parameter implied by `auto' or a concept identifier). */
33415 static tree
33417 {
33421 }
33423 /* Predicate that behaves as is_auto_or_concept but matches the parent
33424 node of the generic type rather than the generic type itself. This
33425 allows for type transformation in add_implicit_template_parms. */
33429 {
33431 }
33433 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33434 (creating a new template parameter list if necessary). Returns the newly
33435 created template type parm. */
33437 tree
33439 {
33442 /* We are either continuing a function template that already contains implicit
33443 template parameters, creating a new fully-implicit function template, or
33444 extending an existing explicit function template with implicit template
33445 parameters. */
33453 {
33457 }
33458 else
33459 {
33460 /* Roll back to the existing template parameter scope (in the case of
33461 extending an explicit function template) or introduce a new template
33462 parameter scope ahead of the function parameter scope (or class scope
33463 in the case of out-of-line member definitions). The function scope is
33464 added back after template parameter synthesis below. */
33469 {
33472 }
33474 {
33475 /* If not defining a class, then any class scope is a scope level in
33476 an out-of-line member definition. In this case simply wind back
33477 beyond the first such scope to inject the template parameter list.
33478 Otherwise wind back to the class being defined. The latter can
33479 occur in class member friend declarations such as:
33481 class A {
33482 void foo (auto);
33483 };
33484 class B {
33485 friend void A::foo (auto);
33486 };
33488 The template parameter list synthesized for the friend declaration
33489 must be injected in the scope of 'B'. This can also occur in
33490 erroneous cases such as:
33492 struct A {
33493 struct B {
33494 void foo (auto);
33495 };
33496 void B::foo (auto) {}
33497 };
33499 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33500 but, nevertheless, the template parameter list synthesized for the
33501 declarator should be injected into the scope of 'A' as if the
33502 ill-formed template was specified explicitly. */
33505 {
33508 }
33509 }
33515 {
33516 /* Introduce a new template parameter list for implicit template
33517 parameters. */
33521 parser->implicit_template_scope
33528 }
33529 else
33530 {
33531 /* Synthesize implicit template parameters at the end of the explicit
33532 template parameter list. */
33539 parser->implicit_template_parms
33541 }
33542 }
33544 /* Synthesize a new template parameter and track the current template
33545 parameter chain with implicit_template_parms. */
33549 synth_id);
33550 tree new_parm
33552 input_location,
33559 parser->implicit_template_parms
33561 else
33566 /* If creating a fully implicit function template, start the new implicit
33567 template parameter list with this synthesized type, otherwise grow the
33568 current template parameter list. */
33571 {
33578 }
33579 else
33580 {
33585 }
33590 }
33592 /* Finish the declaration of a fully implicit function template. Such a
33593 template has no explicit template parameter list so has not been through the
33594 normal template head and tail processing. synthesize_implicit_template_parm
33595 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33596 provided if the declaration is a class member such that its template
33597 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33598 form is returned. Otherwise NULL_TREE is returned. */
33600 tree
33602 {
33607 {
33611 }
33621 }