| blob | eaa6eeea81de0d3cffcd9a14f6b1e68e236c3eb5 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
65 \f
66 /* The lexer. */
68 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
69 and c-lex.c) and the C++ parser. */
72 {
74 };
76 /* The various kinds of non integral constant we encounter. */
78 NIC_NONE,
79 /* floating-point literal */
80 NIC_FLOAT,
81 /* %<this%> */
82 NIC_THIS,
83 /* %<__FUNCTION__%> */
84 NIC_FUNC_NAME,
85 /* %<__PRETTY_FUNCTION__%> */
86 NIC_PRETTY_FUNC,
87 /* %<__func__%> */
88 NIC_C99_FUNC,
89 /* "%<va_arg%> */
90 NIC_VA_ARG,
91 /* a cast */
92 NIC_CAST,
93 /* %<typeid%> operator */
94 NIC_TYPEID,
95 /* non-constant compound literals */
96 NIC_NCC,
97 /* a function call */
98 NIC_FUNC_CALL,
99 /* an increment */
100 NIC_INC,
101 /* an decrement */
102 NIC_DEC,
103 /* an array reference */
104 NIC_ARRAY_REF,
105 /* %<->%> */
106 NIC_ARROW,
107 /* %<.%> */
108 NIC_POINT,
109 /* the address of a label */
110 NIC_ADDR_LABEL,
111 /* %<*%> */
112 NIC_STAR,
113 /* %<&%> */
114 NIC_ADDR,
115 /* %<++%> */
116 NIC_PREINCREMENT,
117 /* %<--%> */
118 NIC_PREDECREMENT,
119 /* %<new%> */
120 NIC_NEW,
121 /* %<delete%> */
122 NIC_DEL,
123 /* calls to overloaded operators */
124 NIC_OVERLOADED,
125 /* an assignment */
126 NIC_ASSIGNMENT,
127 /* a comma operator */
128 NIC_COMMA,
129 /* a call to a constructor */
130 NIC_CONSTRUCTOR,
131 /* a transaction expression */
132 NIC_TRANSACTION
135 /* The various kinds of errors about name-lookup failing. */
137 /* NULL */
138 NLE_NULL,
139 /* is not a type */
140 NLE_TYPE,
141 /* is not a class or namespace */
142 NLE_CXX98,
143 /* is not a class, namespace, or enumeration */
144 NLE_NOT_CXX98
147 /* The various kinds of required token */
149 RT_NONE,
171 /* The type is CPP_KEYWORD */
200 RT_TRANSACTION_CANCEL /* __transaction_cancel */
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static tree cp_literal_operator_id
257 static void cp_parser_cilk_simd
259 static tree cp_parser_cilk_for
261 static bool cp_parser_omp_declare_reduction_exprs
263 static tree cp_parser_cilk_simd_vectorlength
266 /* Manifest constants. */
267 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
268 #define CP_SAVED_TOKEN_STACK 5
270 /* Variables. */
272 /* The stream to which debugging output should be written. */
275 /* Nonzero if we are parsing an unevaluated operand: an operand to
276 sizeof, typeof, or alignof. */
279 /* Dump up to NUM tokens in BUFFER to FILE starting with token
280 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
281 first token in BUFFER. If NUM is 0, dump all the tokens. If
282 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
283 highlighted by surrounding it in [[ ]]. */
285 static void
289 {
306 {
309 }
314 {
321 nprinted++;
331 {
341 }
342 }
345 {
348 }
351 }
354 /* Dump all tokens in BUFFER to stderr. */
356 void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
366 }
368 DEBUG_FUNCTION void
370 {
373 else
375 }
378 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
379 description for T. */
381 static void
383 {
385 {
388 }
389 }
392 /* Dump parser context C to FILE. */
394 static void
396 {
401 }
404 /* Print the stack of parsing contexts to FILE starting with FIRST. */
406 static void
408 {
414 {
417 }
418 }
421 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
423 static void
425 {
428 }
431 /* Print an unparsed function entry UF to FILE. */
433 static void
435 {
438 tree fn;
443 i++)
444 {
450 }
455 {
458 }
464 {
467 }
469 }
472 /* Print the stack of unparsed member functions S to FILE. */
474 static void
477 {
483 {
486 }
487 }
490 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
491 the given PARSER. If FILE is NULL, the output is printed on stderr. */
493 static void
495 {
507 next_token);
508 }
511 /* Dump debugging information for the given PARSER. If FILE is NULL,
512 the output is printed on stderr. */
514 void
516 {
519 expanded_location eloc;
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* Returns nonzero if debugging information should be output. */
717 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
757 }
759 /* nonzero if we are presently saving tokens. */
763 {
765 }
767 /* Store the next token from the preprocessor in *TOKEN. Return true
768 if we reach EOF. If LEXER is NULL, assume we are handling an
769 initial #pragma pch_preprocess, and thus want the lexer to return
770 processed strings. */
772 static void
774 {
777 /* Get a new token from the preprocessor. */
778 token->type
786 /* On some systems, some header files are surrounded by an
787 implicit extern "C" block. Set a flag in the token if it
788 comes from such a header. */
793 /* Check to see if this token is a keyword. */
795 {
797 {
798 /* Mark this token as a keyword. */
800 /* Record which keyword. */
802 }
803 else
804 {
808 {
809 /* Warn about the C++0x keyword (but still treat it as
810 an identifier). */
815 /* Clear out the C_RID_CODE so we don't warn about this
816 particular identifier-turned-keyword again. */
818 }
821 }
822 }
824 {
825 /* This only happens in Objective-C++; it must be a keyword. */
828 {
829 /* Replace 'class' with '@class', 'private' with '@private',
830 etc. This prevents confusion with the C++ keyword
831 'class', and makes the tokens consistent with other
832 Objective-C 'AT' keywords. For example '@class' is
833 reported as RID_AT_CLASS which is consistent with
834 '@synchronized', which is reported as
835 RID_AT_SYNCHRONIZED.
836 */
845 }
846 }
848 {
849 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if the next token is a keyword for a decl-specifier. */
935 static bool
937 {
942 {
943 /* auto specifier: storage-class-specifier in C++,
944 simple-type-specifier in C++0x. */
946 /* Storage classes. */
952 /* Elaborated type specifiers. */
958 /* Simple type specifiers. */
972 /* GNU extensions. */
975 /* C++0x extensions. */
986 }
987 }
989 /* Returns TRUE iff the token T begins a decltype type. */
991 static bool
993 {
996 }
998 /* Returns TRUE iff the next token begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Return a pointer to the Nth token in the token stream. If N is 1,
1008 then this is precisely equivalent to cp_lexer_peek_token (except
1009 that it is not inline). One would like to disallow that case, but
1010 there is one case (cp_parser_nth_token_starts_template_id) where
1011 the caller passes a variable for N and it might be 1. */
1015 {
1018 /* N is 1-based, not zero-based. */
1029 {
1032 {
1035 }
1039 }
1042 {
1045 }
1048 }
1050 /* Return the next token, and advance the lexer's next_token pointer
1051 to point to the next non-purged token. */
1055 {
1061 do
1062 {
1065 {
1068 }
1070 }
1075 /* Provide debugging output. */
1077 {
1081 }
1084 }
1086 /* Permanently remove the next token from the token stream, and
1087 advance the next_token pointer to refer to the next non-purged
1088 token. */
1090 static void
1092 {
1101 do
1102 {
1103 tok++;
1105 {
1108 }
1109 }
1112 }
1114 /* Permanently remove all tokens after TOK, up to, but not
1115 including, the token that will be returned next by
1116 cp_lexer_peek_token. */
1118 static void
1120 {
1129 {
1134 }
1135 }
1137 /* Begin saving tokens. All tokens consumed after this point will be
1138 preserved. */
1140 static void
1142 {
1143 /* Provide debugging output. */
1148 }
1150 /* Commit to the portion of the token stream most recently saved. */
1152 static void
1154 {
1155 /* Provide debugging output. */
1160 }
1162 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1163 to the token stream. Stop saving tokens. */
1165 static void
1167 {
1168 /* Provide debugging output. */
1173 }
1175 /* RAII wrapper around the above functions, with sanity checking. Creating
1176 a variable saves tokens, which are committed when the variable is
1177 destroyed unless they are explicitly rolled back by calling the rollback
1178 member function. */
1180 struct saved_token_sentinel
1181 {
1186 {
1189 }
1191 {
1194 }
1196 {
1200 }
1201 };
1203 /* Print a representation of the TOKEN on the STREAM. */
1205 static void
1207 {
1208 /* We don't use cpp_type2name here because the parser defines
1209 a few tokens of its own. */
1211 /* cpplib-defined token types */
1212 #define OP(e, s) #e,
1213 #define TK(e, s) #e,
1214 TTYPE_TABLE
1215 #undef OP
1216 #undef TK
1217 /* C++ parser token types - see "Manifest constants", above. */
1221 };
1223 /* For some tokens, print the associated data. */
1225 {
1227 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1228 For example, `struct' is mapped to an INTEGER_CST. */
1231 /* else fall through */
1249 /* If we have a name for the token, print it out. Otherwise, we
1250 simply give the numeric code. */
1253 else
1256 }
1257 }
1259 DEBUG_FUNCTION void
1261 {
1264 }
1266 DEBUG_FUNCTION void
1268 {
1271 else
1273 }
1276 /* Start emitting debugging information. */
1278 static void
1280 {
1283 }
1285 /* Stop emitting debugging information. */
1287 static void
1289 {
1292 }
1294 /* Create a new cp_token_cache, representing a range of tokens. */
1298 {
1303 }
1305 /* Diagnose if #pragma omp declare simd isn't followed immediately
1306 by function declaration or definition. */
1310 {
1312 {
1316 }
1317 }
1319 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1320 and put that into "omp declare simd" attribute. */
1324 {
1326 {
1328 {
1331 }
1333 {
1336 }
1337 }
1338 }
1339 \f
1340 /* Decl-specifiers. */
1342 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1344 static void
1346 {
1348 }
1350 /* Declarators. */
1352 /* Nothing other than the parser should be creating declarators;
1353 declarators are a semi-syntactic representation of C++ entities.
1354 Other parts of the front end that need to create entities (like
1355 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1370 /* An erroneous declarator. */
1373 /* The obstack on which declarators and related data structures are
1374 allocated. */
1377 /* Alloc BYTES from the declarator memory pool. */
1381 {
1383 }
1385 /* Allocate a declarator of the indicated KIND. Clear fields that are
1386 common to all declarators. */
1390 {
1402 }
1404 /* Make a declarator for a generalized identifier. If
1405 QUALIFYING_SCOPE is non-NULL, the identifier is
1406 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1407 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1408 is, if any. */
1412 special_function_kind sfk)
1413 {
1416 /* It is valid to write:
1418 class C { void f(); };
1419 typedef C D;
1420 void D::f();
1422 The standard is not clear about whether `typedef const C D' is
1423 legal; as of 2002-09-15 the committee is considering that
1424 question. EDG 3.0 allows that syntax. Therefore, we do as
1425 well. */
1439 }
1441 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1442 of modifiers such as const or volatile to apply to the pointer
1443 type, represented as identifiers. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1448 tree attributes)
1449 {
1457 {
1461 }
1462 else
1468 }
1470 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1471 represent the attributes that appertain to the pointer or
1472 reference. */
1474 cp_declarator *
1477 {
1485 {
1489 }
1490 else
1496 }
1498 /* Like make_pointer_declarator -- but for a pointer to a non-static
1499 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1500 appertain to the pointer or reference. */
1502 cp_declarator *
1505 tree attributes)
1506 {
1515 {
1518 }
1519 else
1525 }
1527 /* Make a declarator for the function given by TARGET, with the
1528 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1529 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1530 indicates what exceptions can be thrown. */
1532 cp_declarator *
1534 tree parms,
1535 cp_cv_quals cv_qualifiers,
1536 cp_virt_specifiers virt_specifiers,
1537 cp_ref_qualifier ref_qualifier,
1538 tree exception_specification,
1539 tree late_return_type)
1540 {
1552 {
1556 }
1557 else
1561 }
1563 /* Make a declarator for an array of BOUNDS elements, each of which is
1564 defined by ELEMENT. */
1566 cp_declarator *
1568 {
1575 {
1579 }
1580 else
1584 }
1586 /* Determine whether the declarator we've seen so far can be a
1587 parameter pack, when followed by an ellipsis. */
1588 static bool
1590 {
1591 /* Search for a declarator name, or any other declarator that goes
1592 after the point where the ellipsis could appear in a parameter
1593 pack. If we find any of these, then this declarator can not be
1594 made into a parameter pack. */
1597 {
1599 {
1611 }
1612 }
1615 }
1619 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1620 DECLARATOR and DEFAULT_ARGUMENT. */
1622 cp_parameter_declarator *
1625 tree default_argument)
1626 {
1634 else
1641 }
1643 /* Returns true iff DECLARATOR is a declaration for a function. */
1645 static bool
1647 {
1649 {
1657 }
1659 }
1661 /* The parser. */
1663 /* Overview
1664 --------
1666 A cp_parser parses the token stream as specified by the C++
1667 grammar. Its job is purely parsing, not semantic analysis. For
1668 example, the parser breaks the token stream into declarators,
1669 expressions, statements, and other similar syntactic constructs.
1670 It does not check that the types of the expressions on either side
1671 of an assignment-statement are compatible, or that a function is
1672 not declared with a parameter of type `void'.
1674 The parser invokes routines elsewhere in the compiler to perform
1675 semantic analysis and to build up the abstract syntax tree for the
1676 code processed.
1678 The parser (and the template instantiation code, which is, in a
1679 way, a close relative of parsing) are the only parts of the
1680 compiler that should be calling push_scope and pop_scope, or
1681 related functions. The parser (and template instantiation code)
1682 keeps track of what scope is presently active; everything else
1683 should simply honor that. (The code that generates static
1684 initializers may also need to set the scope, in order to check
1685 access control correctly when emitting the initializers.)
1687 Methodology
1688 -----------
1690 The parser is of the standard recursive-descent variety. Upcoming
1691 tokens in the token stream are examined in order to determine which
1692 production to use when parsing a non-terminal. Some C++ constructs
1693 require arbitrary look ahead to disambiguate. For example, it is
1694 impossible, in the general case, to tell whether a statement is an
1695 expression or declaration without scanning the entire statement.
1696 Therefore, the parser is capable of "parsing tentatively." When the
1697 parser is not sure what construct comes next, it enters this mode.
1698 Then, while we attempt to parse the construct, the parser queues up
1699 error messages, rather than issuing them immediately, and saves the
1700 tokens it consumes. If the construct is parsed successfully, the
1701 parser "commits", i.e., it issues any queued error messages and
1702 the tokens that were being preserved are permanently discarded.
1703 If, however, the construct is not parsed successfully, the parser
1704 rolls back its state completely so that it can resume parsing using
1705 a different alternative.
1707 Future Improvements
1708 -------------------
1710 The performance of the parser could probably be improved substantially.
1711 We could often eliminate the need to parse tentatively by looking ahead
1712 a little bit. In some places, this approach might not entirely eliminate
1713 the need to parse tentatively, but it might still speed up the average
1714 case. */
1716 /* Flags that are passed to some parsing functions. These values can
1717 be bitwise-ored together. */
1719 enum
1720 {
1721 /* No flags. */
1723 /* The construct is optional. If it is not present, then no error
1724 should be issued. */
1726 /* When parsing a type-specifier, treat user-defined type-names
1727 as non-type identifiers. */
1729 /* When parsing a type-specifier, do not try to parse a class-specifier
1730 or enum-specifier. */
1732 /* When parsing a decl-specifier-seq, only allow type-specifier or
1733 constexpr. */
1735 };
1737 /* This type is used for parameters and variables which hold
1738 combinations of the above flags. */
1741 /* The different kinds of declarators we want to parse. */
1744 {
1745 /* We want an abstract declarator. */
1746 CP_PARSER_DECLARATOR_ABSTRACT,
1747 /* We want a named declarator. */
1748 CP_PARSER_DECLARATOR_NAMED,
1749 /* We don't mind, but the name must be an unqualified-id. */
1750 CP_PARSER_DECLARATOR_EITHER
1753 /* The precedence values used to parse binary expressions. The minimum value
1754 of PREC must be 1, because zero is reserved to quickly discriminate
1755 binary operators from other tokens. */
1757 enum cp_parser_prec
1758 {
1759 PREC_NOT_OPERATOR,
1760 PREC_LOGICAL_OR_EXPRESSION,
1761 PREC_LOGICAL_AND_EXPRESSION,
1762 PREC_INCLUSIVE_OR_EXPRESSION,
1763 PREC_EXCLUSIVE_OR_EXPRESSION,
1764 PREC_AND_EXPRESSION,
1765 PREC_EQUALITY_EXPRESSION,
1766 PREC_RELATIONAL_EXPRESSION,
1767 PREC_SHIFT_EXPRESSION,
1768 PREC_ADDITIVE_EXPRESSION,
1769 PREC_MULTIPLICATIVE_EXPRESSION,
1770 PREC_PM_EXPRESSION,
1771 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1772 };
1774 /* A mapping from a token type to a corresponding tree node type, with a
1775 precedence value. */
1778 {
1779 /* The token type. */
1781 /* The corresponding tree code. */
1783 /* The precedence of this operator. */
1788 {
1789 /* Left hand side of the binary operation we are currently
1790 parsing. */
1791 tree lhs;
1792 /* Original tree code for left hand side, if it was a binary
1793 expression itself (used for -Wparentheses). */
1795 /* Tree code for the binary operation we are parsing. */
1797 /* Precedence of the binary operation we are parsing. */
1799 /* Location of the binary operation we are parsing. */
1800 location_t loc;
1803 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1804 entries because precedence levels on the stack are monotonically
1805 increasing. */
1809 /* Prototypes. */
1811 /* Constructors and destructors. */
1816 /* Class variables. */
1820 /* The operator-precedence table used by cp_parser_binary_expression.
1821 Transformed into an associative array (binops_by_token) by
1822 cp_parser_new. */
1855 };
1857 /* The same as binops, but initialized by cp_parser_new so that
1858 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1859 for speed. */
1862 /* Constructors and destructors. */
1864 /* Construct a new context. The context below this one on the stack
1865 is given by NEXT. */
1869 {
1872 /* Allocate the storage. */
1874 {
1875 /* Pull the first entry from the free list. */
1879 }
1880 else
1883 /* No errors have occurred yet in this context. */
1885 /* If this is not the bottommost context, copy information that we
1886 need from the previous context. */
1888 {
1889 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1890 expression, then we are parsing one in this context, too. */
1892 /* Thread the stack. */
1894 }
1897 }
1899 /* Managing the unparsed function queues. */
1901 #define unparsed_funs_with_default_args \
1902 parser->unparsed_queues->last ().funs_with_default_args
1903 #define unparsed_funs_with_definitions \
1904 parser->unparsed_queues->last ().funs_with_definitions
1905 #define unparsed_nsdmis \
1906 parser->unparsed_queues->last ().nsdmis
1907 #define unparsed_classes \
1908 parser->unparsed_queues->last ().classes
1910 static void
1912 {
1915 }
1917 static void
1919 {
1922 }
1924 /* Prototypes. */
1926 /* Constructors and destructors. */
1931 /* Routines to parse various constructs.
1933 Those that return `tree' will return the error_mark_node (rather
1934 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1935 Sometimes, they will return an ordinary node if error-recovery was
1936 attempted, even though a parse error occurred. So, to check
1937 whether or not a parse error occurred, you should always use
1938 cp_parser_error_occurred. If the construct is optional (indicated
1939 either by an `_opt' in the name of the function that does the
1940 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1941 the construct is not present. */
1943 /* Lexical conventions [gram.lex] */
1945 static tree cp_parser_identifier
1947 static tree cp_parser_string_literal
1949 static tree cp_parser_userdef_char_literal
1951 static tree cp_parser_userdef_string_literal
1953 static tree cp_parser_userdef_numeric_literal
1956 /* Basic concepts [gram.basic] */
1958 static bool cp_parser_translation_unit
1961 /* Expressions [gram.expr] */
1963 static tree cp_parser_primary_expression
1965 static tree cp_parser_id_expression
1967 static tree cp_parser_unqualified_id
1969 static tree cp_parser_nested_name_specifier_opt
1971 static tree cp_parser_nested_name_specifier
1973 static tree cp_parser_qualifying_entity
1975 static tree cp_parser_postfix_expression
1977 static tree cp_parser_postfix_open_square_expression
1979 static tree cp_parser_postfix_dot_deref_expression
1983 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1985 static void cp_parser_pseudo_destructor_name
1987 static tree cp_parser_unary_expression
1989 static enum tree_code cp_parser_unary_operator
1991 static tree cp_parser_new_expression
1995 static tree cp_parser_new_type_id
2003 static tree cp_parser_delete_expression
2005 static tree cp_parser_cast_expression
2007 static tree cp_parser_binary_expression
2009 static tree cp_parser_question_colon_clause
2011 static tree cp_parser_assignment_expression
2013 static enum tree_code cp_parser_assignment_operator_opt
2015 static tree cp_parser_expression
2017 static tree cp_parser_constant_expression
2019 static tree cp_parser_builtin_offsetof
2021 static tree cp_parser_lambda_expression
2023 static void cp_parser_lambda_introducer
2025 static bool cp_parser_lambda_declarator_opt
2027 static void cp_parser_lambda_body
2030 /* Statements [gram.stmt.stmt] */
2032 static void cp_parser_statement
2034 static void cp_parser_label_for_labeled_statement
2036 static tree cp_parser_expression_statement
2038 static tree cp_parser_compound_statement
2040 static void cp_parser_statement_seq_opt
2042 static tree cp_parser_selection_statement
2044 static tree cp_parser_condition
2046 static tree cp_parser_iteration_statement
2048 static bool cp_parser_for_init_statement
2050 static tree cp_parser_for
2052 static tree cp_parser_c_for
2054 static tree cp_parser_range_for
2056 static void do_range_for_auto_deduction
2058 static tree cp_parser_perform_range_for_lookup
2060 static tree cp_parser_range_for_member_function
2062 static tree cp_parser_jump_statement
2064 static void cp_parser_declaration_statement
2067 static tree cp_parser_implicitly_scoped_statement
2069 static void cp_parser_already_scoped_statement
2072 /* Declarations [gram.dcl.dcl] */
2074 static void cp_parser_declaration_seq_opt
2076 static void cp_parser_declaration
2078 static void cp_parser_block_declaration
2080 static void cp_parser_simple_declaration
2082 static void cp_parser_decl_specifier_seq
2084 static tree cp_parser_storage_class_specifier_opt
2086 static tree cp_parser_function_specifier_opt
2088 static tree cp_parser_type_specifier
2091 static tree cp_parser_simple_type_specifier
2093 static tree cp_parser_type_name
2095 static tree cp_parser_nonclass_name
2097 static tree cp_parser_elaborated_type_specifier
2099 static tree cp_parser_enum_specifier
2101 static void cp_parser_enumerator_list
2103 static void cp_parser_enumerator_definition
2105 static tree cp_parser_namespace_name
2107 static void cp_parser_namespace_definition
2109 static void cp_parser_namespace_body
2111 static tree cp_parser_qualified_namespace_specifier
2113 static void cp_parser_namespace_alias_definition
2115 static bool cp_parser_using_declaration
2117 static void cp_parser_using_directive
2119 static tree cp_parser_alias_declaration
2121 static void cp_parser_asm_definition
2123 static void cp_parser_linkage_specification
2125 static void cp_parser_static_assert
2127 static tree cp_parser_decltype
2130 /* Declarators [gram.dcl.decl] */
2132 static tree cp_parser_init_declarator
2139 static enum tree_code cp_parser_ptr_operator
2141 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2143 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2145 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2147 static tree cp_parser_late_return_type_opt
2149 static tree cp_parser_declarator_id
2151 static tree cp_parser_type_id
2153 static tree cp_parser_template_type_arg
2156 static tree cp_parser_type_id_1
2158 static void cp_parser_type_specifier_seq
2160 static tree cp_parser_parameter_declaration_clause
2162 static tree cp_parser_parameter_declaration_list
2166 static tree cp_parser_default_argument
2168 static void cp_parser_function_body
2170 static tree cp_parser_initializer
2172 static tree cp_parser_initializer_clause
2174 static tree cp_parser_braced_list
2179 static bool cp_parser_ctor_initializer_opt_and_function_body
2182 static tree cp_parser_late_parsing_omp_declare_simd
2185 static tree cp_parser_late_parsing_cilk_simd_fn_info
2188 static tree synthesize_implicit_template_parm
2190 static tree finish_fully_implicit_template
2193 /* Classes [gram.class] */
2195 static tree cp_parser_class_name
2197 static tree cp_parser_class_specifier
2199 static tree cp_parser_class_head
2201 static enum tag_types cp_parser_class_key
2203 static void cp_parser_type_parameter_key
2205 static void cp_parser_member_specification_opt
2207 static void cp_parser_member_declaration
2209 static tree cp_parser_pure_specifier
2211 static tree cp_parser_constant_initializer
2214 /* Derived classes [gram.class.derived] */
2216 static tree cp_parser_base_clause
2218 static tree cp_parser_base_specifier
2221 /* Special member functions [gram.special] */
2223 static tree cp_parser_conversion_function_id
2225 static tree cp_parser_conversion_type_id
2229 static bool cp_parser_ctor_initializer_opt
2231 static void cp_parser_mem_initializer_list
2233 static tree cp_parser_mem_initializer
2235 static tree cp_parser_mem_initializer_id
2238 /* Overloading [gram.over] */
2240 static tree cp_parser_operator_function_id
2242 static tree cp_parser_operator
2245 /* Templates [gram.temp] */
2247 static void cp_parser_template_declaration
2249 static tree cp_parser_template_parameter_list
2251 static tree cp_parser_template_parameter
2253 static tree cp_parser_type_parameter
2255 static tree cp_parser_template_id
2257 static tree cp_parser_template_name
2259 static tree cp_parser_template_argument_list
2261 static tree cp_parser_template_argument
2263 static void cp_parser_explicit_instantiation
2265 static void cp_parser_explicit_specialization
2268 /* Exception handling [gram.exception] */
2270 static tree cp_parser_try_block
2272 static bool cp_parser_function_try_block
2274 static void cp_parser_handler_seq
2276 static void cp_parser_handler
2278 static tree cp_parser_exception_declaration
2280 static tree cp_parser_throw_expression
2282 static tree cp_parser_exception_specification_opt
2284 static tree cp_parser_type_id_list
2287 /* GNU Extensions */
2289 static tree cp_parser_asm_specification_opt
2291 static tree cp_parser_asm_operand_list
2293 static tree cp_parser_asm_clobber_list
2295 static tree cp_parser_asm_label_list
2297 static bool cp_next_tokens_can_be_attribute_p
2299 static bool cp_next_tokens_can_be_gnu_attribute_p
2301 static bool cp_next_tokens_can_be_std_attribute_p
2303 static bool cp_nth_tokens_can_be_std_attribute_p
2305 static bool cp_nth_tokens_can_be_gnu_attribute_p
2307 static bool cp_nth_tokens_can_be_attribute_p
2309 static tree cp_parser_attributes_opt
2311 static tree cp_parser_gnu_attributes_opt
2313 static tree cp_parser_gnu_attribute_list
2315 static tree cp_parser_std_attribute
2317 static tree cp_parser_std_attribute_spec
2319 static tree cp_parser_std_attribute_spec_seq
2321 static bool cp_parser_extension_opt
2323 static void cp_parser_label_declaration
2326 /* Transactional Memory Extensions */
2328 static tree cp_parser_transaction
2330 static tree cp_parser_transaction_expression
2332 static bool cp_parser_function_transaction
2334 static tree cp_parser_transaction_cancel
2338 pragma_external,
2339 pragma_member,
2340 pragma_objc_icode,
2341 pragma_stmt,
2342 pragma_compound
2343 };
2344 static bool cp_parser_pragma
2347 /* Objective-C++ Productions */
2349 static tree cp_parser_objc_message_receiver
2351 static tree cp_parser_objc_message_args
2353 static tree cp_parser_objc_message_expression
2355 static tree cp_parser_objc_encode_expression
2357 static tree cp_parser_objc_defs_expression
2359 static tree cp_parser_objc_protocol_expression
2361 static tree cp_parser_objc_selector_expression
2363 static tree cp_parser_objc_expression
2365 static bool cp_parser_objc_selector_p
2367 static tree cp_parser_objc_selector
2369 static tree cp_parser_objc_protocol_refs_opt
2371 static void cp_parser_objc_declaration
2373 static tree cp_parser_objc_statement
2375 static bool cp_parser_objc_valid_prefix_attributes
2377 static void cp_parser_objc_at_property_declaration
2379 static void cp_parser_objc_at_synthesize_declaration
2381 static void cp_parser_objc_at_dynamic_declaration
2383 static tree cp_parser_objc_struct_declaration
2386 /* Utility Routines */
2388 static tree cp_parser_lookup_name
2390 static tree cp_parser_lookup_name_simple
2392 static tree cp_parser_maybe_treat_template_as_class
2394 static bool cp_parser_check_declarator_template_parameters
2396 static bool cp_parser_check_template_parameters
2398 static tree cp_parser_simple_cast_expression
2400 static tree cp_parser_global_scope_opt
2402 static bool cp_parser_constructor_declarator_p
2404 static tree cp_parser_function_definition_from_specifiers_and_declarator
2406 static tree cp_parser_function_definition_after_declarator
2408 static void cp_parser_template_declaration_after_export
2410 static void cp_parser_perform_template_parameter_access_checks
2412 static tree cp_parser_single_declaration
2414 static tree cp_parser_functional_cast
2416 static tree cp_parser_save_member_function_body
2418 static tree cp_parser_save_nsdmi
2420 static tree cp_parser_enclosed_template_argument_list
2422 static void cp_parser_save_default_args
2424 static void cp_parser_late_parsing_for_member
2426 static tree cp_parser_late_parse_one_default_arg
2428 static void cp_parser_late_parsing_nsdmi
2430 static void cp_parser_late_parsing_default_args
2432 static tree cp_parser_sizeof_operand
2434 static tree cp_parser_trait_expr
2436 static bool cp_parser_declares_only_class_p
2438 static void cp_parser_set_storage_class
2440 static void cp_parser_set_decl_spec_type
2442 static void set_and_check_decl_spec_loc
2445 static bool cp_parser_friend_p
2447 static void cp_parser_required_error
2453 static bool cp_parser_token_starts_function_definition_p
2455 static bool cp_parser_next_token_starts_class_definition_p
2457 static bool cp_parser_next_token_ends_template_argument_p
2459 static bool cp_parser_nth_token_starts_template_argument_list_p
2461 static enum tag_types cp_parser_token_is_class_key
2463 static enum tag_types cp_parser_token_is_type_parameter_key
2465 static void cp_parser_check_class_key
2467 static void cp_parser_check_access_in_redeclaration
2469 static bool cp_parser_optional_template_keyword
2471 static void cp_parser_pre_parsed_nested_name_specifier
2473 static bool cp_parser_cache_group
2475 static tree cp_parser_cache_defarg
2477 static void cp_parser_parse_tentatively
2479 static void cp_parser_commit_to_tentative_parse
2481 static void cp_parser_commit_to_topmost_tentative_parse
2483 static void cp_parser_abort_tentative_parse
2485 static bool cp_parser_parse_definitely
2489 static bool cp_parser_uncommitted_to_tentative_parse_p
2491 static void cp_parser_error
2493 static void cp_parser_name_lookup_error
2495 static bool cp_parser_simulate_error
2497 static bool cp_parser_check_type_definition
2499 static void cp_parser_check_for_definition_in_return_type
2501 static void cp_parser_check_for_invalid_template_id
2503 static bool cp_parser_non_integral_constant_expression
2505 static void cp_parser_diagnose_invalid_type_name
2507 static bool cp_parser_parse_and_diagnose_invalid_type_name
2509 static int cp_parser_skip_to_closing_parenthesis
2511 static void cp_parser_skip_to_end_of_statement
2513 static void cp_parser_consume_semicolon_at_end_of_statement
2515 static void cp_parser_skip_to_end_of_block_or_statement
2517 static bool cp_parser_skip_to_closing_brace
2519 static void cp_parser_skip_to_end_of_template_parameter_list
2521 static void cp_parser_skip_to_pragma_eol
2523 static bool cp_parser_error_occurred
2525 static bool cp_parser_allow_gnu_extensions_p
2527 static bool cp_parser_is_pure_string_literal
2529 static bool cp_parser_is_string_literal
2531 static bool cp_parser_is_keyword
2533 static tree cp_parser_make_typename_type
2537 static bool cp_parser_compound_literal_p
2539 static bool cp_parser_array_designator_p
2541 static bool cp_parser_skip_to_closing_square_bracket
2544 /* Returns nonzero if we are parsing tentatively. */
2548 {
2550 }
2552 /* Returns nonzero if TOKEN is a string literal. */
2554 static bool
2556 {
2562 }
2564 /* Returns nonzero if TOKEN is a string literal
2565 of a user-defined string literal. */
2567 static bool
2569 {
2576 }
2578 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2580 static bool
2582 {
2584 }
2586 /* If not parsing tentatively, issue a diagnostic of the form
2587 FILE:LINE: MESSAGE before TOKEN
2588 where TOKEN is the next token in the input stream. MESSAGE
2589 (specified by the caller) is usually of the form "expected
2590 OTHER-TOKEN". */
2592 static void
2594 {
2596 {
2598 /* This diagnostic makes more sense if it is tagged to the line
2599 of the token we just peeked at. */
2603 {
2608 }
2611 /* Because c_parser_error does not understand
2612 CPP_KEYWORD, keywords are treated like
2613 identifiers. */
2616 }
2617 }
2619 /* Issue an error about name-lookup failing. NAME is the
2620 IDENTIFIER_NODE DECL is the result of
2621 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2622 the thing that we hoped to find. */
2624 static void
2626 tree name,
2627 tree decl,
2628 name_lookup_error desired,
2629 location_t location)
2630 {
2631 /* If name lookup completely failed, tell the user that NAME was not
2632 declared. */
2634 {
2647 else
2649 }
2651 {
2653 {
2670 }
2671 }
2673 {
2675 {
2685 name);
2689 }
2690 }
2691 else
2692 {
2694 {
2707 }
2708 }
2709 }
2711 /* If we are parsing tentatively, remember that an error has occurred
2712 during this tentative parse. Returns true if the error was
2713 simulated; false if a message should be issued by the caller. */
2715 static bool
2717 {
2719 {
2722 }
2724 }
2726 /* This function is called when a type is defined. If type
2727 definitions are forbidden at this point, an error message is
2728 issued. */
2730 static bool
2732 {
2733 /* If types are forbidden here, issue a message. */
2735 {
2736 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2737 in the message need to be interpreted. */
2740 }
2742 }
2744 /* This function is called when the DECLARATOR is processed. The TYPE
2745 was a type defined in the decl-specifiers. If it is invalid to
2746 define a type in the decl-specifiers for DECLARATOR, an error is
2747 issued. TYPE_LOCATION is the location of TYPE and is used
2748 for error reporting. */
2750 static void
2753 {
2754 /* [dcl.fct] forbids type definitions in return types.
2755 Unfortunately, it's not easy to know whether or not we are
2756 processing a return type until after the fact. */
2764 {
2769 type);
2770 }
2771 }
2773 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2774 "<" in any valid C++ program. If the next token is indeed "<",
2775 issue a message warning the user about what appears to be an
2776 invalid attempt to form a template-id. LOCATION is the location
2777 of the type-specifier (TYPE) */
2779 static void
2781 tree type,
2783 location_t location)
2784 {
2788 {
2792 {
2795 else
2797 }
2798 else
2800 /* Remember the location of the invalid "<". */
2803 /* Consume the "<". */
2805 /* Parse the template arguments. */
2807 /* Permanently remove the invalid template arguments so that
2808 this error message is not issued again. */
2811 }
2812 }
2814 /* If parsing an integral constant-expression, issue an error message
2815 about the fact that THING appeared and return true. Otherwise,
2816 return false. In either case, set
2817 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2819 static bool
2821 non_integral_constant thing)
2822 {
2825 {
2827 {
2830 {
2837 "enumeration type cannot appear in a "
2928 }
2932 }
2933 }
2935 }
2937 /* Emit a diagnostic for an invalid type name. This function commits
2938 to the current active tentative parse, if any. (Otherwise, the
2939 problematic construct might be encountered again later, resulting
2940 in duplicate error messages.) LOCATION is the location of ID. */
2942 static void
2944 location_t location)
2945 {
2948 /* Try to lookup the identifier. */
2955 /* If the lookup was ambiguous, an error will already have
2956 been issued. */
2958 /* If the lookup found a template-name, it means that the user forgot
2959 to specify an argument list. Emit a useful error message. */
2963 decl);
2967 /* Something like 'unsigned A a;' */
2970 {
2971 /* Issue an error message. */
2973 /* If we're in a template class, it's possible that the user was
2974 referring to a type from a base class. For example:
2976 template <typename T> struct A { typedef T X; };
2977 template <typename T> struct B : public A<T> { X x; };
2979 The user should have said "typename A<T>::X". */
2993 {
2994 tree b;
2997 b;
2999 {
3003 {
3004 tree field;
3005 /* Go from a particular instantiation of the
3006 template (which will have an empty TYPE_FIELDs),
3007 to the main version. */
3010 field;
3014 {
3019 }
3022 }
3023 }
3024 }
3025 }
3026 /* Here we diagnose qualified-ids where the scope is actually correct,
3027 but the identifier does not resolve to a valid type name. */
3029 {
3031 {
3036 else
3040 }
3043 {
3044 /* A<T>::A<T>() */
3050 }
3057 {
3062 else
3066 }
3067 else
3069 }
3070 }
3072 /* Check for a common situation where a type-name should be present,
3073 but is not, and issue a sensible error message. Returns true if an
3074 invalid type-name was detected.
3076 The situation handled by this function are variable declarations of the
3077 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3078 Usually, `ID' should name a type, but if we got here it means that it
3079 does not. We try to emit the best possible error message depending on
3080 how exactly the id-expression looks like. */
3082 static bool
3084 {
3085 tree id;
3088 /* Avoid duplicate error about ambiguous lookup. */
3090 {
3094 }
3103 /* If the next token is a (, this is a function with no explicit return
3104 type, i.e. constructor, destructor or conversion op. */
3107 {
3110 }
3114 /* Emit a diagnostic for the invalid type. */
3116 out:
3117 /* If we aren't in the middle of a declarator (i.e. in a
3118 parameter-declaration-clause), skip to the end of the declaration;
3119 there's no point in trying to process it. */
3123 }
3125 /* Consume tokens up to, and including, the next non-nested closing `)'.
3126 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3127 are doing error recovery. Returns -1 if OR_COMMA is true and we
3128 found an unnested comma. */
3130 static int
3135 {
3145 {
3149 {
3152 /* If we've run out of tokens, then there is no closing `)'. */
3155 /* This is good for lambda expression capture-lists. */
3165 /* This matches the processing in skip_to_end_of_statement. */
3191 {
3195 }
3200 }
3202 /* Consume the token. */
3204 }
3205 }
3207 /* Consume tokens until we reach the end of the current statement.
3208 Normally, that will be just before consuming a `;'. However, if a
3209 non-nested `}' comes first, then we stop before consuming that. */
3211 static void
3213 {
3216 /* Unwind generic function template scope if necessary. */
3221 {
3225 {
3228 /* If we've run out of tokens, stop. */
3232 /* If the next token is a `;', we have reached the end of the
3233 statement. */
3239 /* If this is a non-nested '}', stop before consuming it.
3240 That way, when confronted with something like:
3242 { 3 + }
3244 we stop before consuming the closing '}', even though we
3245 have not yet reached a `;'. */
3249 /* If it is the closing '}' for a block that we have
3250 scanned, stop -- but only after consuming the token.
3251 That way given:
3253 void f g () { ... }
3254 typedef int I;
3256 we will stop after the body of the erroneously declared
3257 function, but before consuming the following `typedef'
3258 declaration. */
3260 {
3263 }
3271 }
3273 /* Consume the token. */
3275 }
3276 }
3278 /* This function is called at the end of a statement or declaration.
3279 If the next token is a semicolon, it is consumed; otherwise, error
3280 recovery is attempted. */
3282 static void
3284 {
3285 /* Look for the trailing `;'. */
3287 {
3288 /* If there is additional (erroneous) input, skip to the end of
3289 the statement. */
3291 /* If the next token is now a `;', consume it. */
3294 }
3295 }
3297 /* Skip tokens until we have consumed an entire block, or until we
3298 have consumed a non-nested `;'. */
3300 static void
3302 {
3305 /* Unwind generic function template scope if necessary. */
3310 {
3314 {
3317 /* If we've run out of tokens, stop. */
3321 /* Stop if this is an unnested ';'. */
3327 /* Stop if this is an unnested '}', or closes the outermost
3328 nesting level. */
3329 nesting_depth--;
3337 /* Nest. */
3338 nesting_depth++;
3343 }
3345 /* Consume the token. */
3347 }
3348 }
3350 /* Skip tokens until a non-nested closing curly brace is the next
3351 token, or there are no more tokens. Return true in the first case,
3352 false otherwise. */
3354 static bool
3356 {
3360 {
3364 {
3367 /* If we've run out of tokens, stop. */
3371 /* If the next token is a non-nested `}', then we have reached
3372 the end of the current block. */
3378 /* If it the next token is a `{', then we are entering a new
3379 block. Consume the entire block. */
3385 }
3387 /* Consume the token. */
3389 }
3390 }
3392 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3393 parameter is the PRAGMA token, allowing us to purge the entire pragma
3394 sequence. */
3396 static void
3398 {
3403 do
3407 /* Ensure that the pragma is not parsed again. */
3409 }
3411 /* Require pragma end of line, resyncing with it as necessary. The
3412 arguments are as for cp_parser_skip_to_pragma_eol. */
3414 static void
3416 {
3420 }
3422 /* This is a simple wrapper around make_typename_type. When the id is
3423 an unresolved identifier node, we can provide a superior diagnostic
3424 using cp_parser_diagnose_invalid_type_name. */
3426 static tree
3428 location_t id_location)
3429 {
3430 tree result;
3432 {
3438 }
3440 }
3442 /* This is a wrapper around the
3443 make_{pointer,ptrmem,reference}_declarator functions that decides
3444 which one to call based on the CODE and CLASS_TYPE arguments. The
3445 CODE argument should be one of the values returned by
3446 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3447 appertain to the pointer or reference. */
3451 cp_cv_quals cv_qualifiers,
3453 tree attributes)
3454 {
3461 else
3471 }
3473 /* Create a new C++ parser. */
3477 {
3482 /* cp_lexer_new_main is called before doing GC allocation because
3483 cp_lexer_new_main might load a PCH file. */
3486 /* Initialize the binops_by_token so that we can get the tree
3487 directly from the token. */
3495 /* For now, we always accept GNU extensions. */
3498 /* The `>' token is a greater-than operator, not the end of a
3499 template-id. */
3504 /* We are not parsing a constant-expression. */
3509 /* Local variable names are not forbidden. */
3512 /* We are not processing an `extern "C"' declaration. */
3515 /* We are not processing a declarator. */
3518 /* We are not processing a template-argument-list. */
3521 /* We are not in an iteration statement. */
3524 /* We are not in a switch statement. */
3527 /* We are not parsing a type-id inside an expression. */
3530 /* Declarations aren't implicitly extern "C". */
3533 /* String literals should be translated to the execution character set. */
3536 /* We are not parsing a function body. */
3539 /* We can correct until told otherwise. */
3542 /* The unparsed function queue is empty. */
3545 /* There are no classes being defined. */
3548 /* No template parameters apply. */
3551 /* Not declaring an implicit function template. */
3558 }
3560 /* Create a cp_lexer structure which will emit the tokens in CACHE
3561 and push it onto the parser's lexer stack. This is used for delayed
3562 parsing of in-class method bodies and default arguments, and should
3563 not be confused with tentative parsing. */
3564 static void
3566 {
3571 /* Move the current source position to that of the first token in the
3572 new lexer. */
3574 }
3576 /* Pop the top lexer off the parser stack. This is never used for the
3577 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3578 static void
3580 {
3585 /* Put the current source position back where it was before this
3586 lexer was pushed. */
3588 }
3590 /* Lexical conventions [gram.lex] */
3592 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3593 identifier. */
3595 static tree
3597 {
3600 /* Look for the identifier. */
3602 /* Return the value. */
3604 }
3606 /* Parse a sequence of adjacent string constants. Returns a
3607 TREE_STRING representing the combined, nul-terminated string
3608 constant. If TRANSLATE is true, translate the string to the
3609 execution character set. If WIDE_OK is true, a wide string is
3610 invalid here.
3612 C++98 [lex.string] says that if a narrow string literal token is
3613 adjacent to a wide string literal token, the behavior is undefined.
3614 However, C99 6.4.5p4 says that this results in a wide string literal.
3615 We follow C99 here, for consistency with the C front end.
3617 This code is largely lifted from lex_string() in c-lex.c.
3619 FUTURE: ObjC++ will need to handle @-strings here. */
3620 static tree
3623 {
3624 tree value;
3631 tree string_tree;
3637 {
3640 }
3643 {
3647 }
3648 else
3649 {
3652 }
3655 /* Try to avoid the overhead of creating and destroying an obstack
3656 for the common case of just one string. */
3659 {
3667 {
3671 }
3672 else
3676 }
3677 else
3678 {
3682 do
3683 {
3685 count++;
3690 {
3693 {
3696 }
3699 {
3704 }
3706 }
3707 else
3711 {
3716 "unsupported non-standard concatenation "
3718 }
3724 {
3728 }
3729 else
3730 {
3734 }
3735 }
3739 }
3742 {
3745 }
3749 {
3754 {
3769 }
3774 {
3779 else
3781 }
3782 }
3783 else
3784 /* cpp_interpret_string has issued an error. */
3791 }
3793 /* Look up a literal operator with the name and the exact arguments. */
3795 static tree
3797 {
3804 {
3810 {
3813 {
3823 }
3826 /* May be this should be sufficient_parms_p instead,
3827 depending on how exactly should user-defined literals
3828 work in presence of default arguments on the literal
3829 operator parameters. */
3832 }
3833 }
3836 }
3838 /* Parse a user-defined char constant. Returns a call to a user-defined
3839 literal operator taking the character as an argument. */
3841 static tree
3843 {
3851 /* Build up a call to the user-defined operator */
3852 /* Lookup the name we got back from the id-expression. */
3857 {
3862 }
3871 }
3873 /* A subroutine of cp_parser_userdef_numeric_literal to
3874 create a char... template parameter pack from a string node. */
3876 static tree
3878 {
3879 tree charvec;
3885 /* Fill in CHARVEC with all of the parameters. */
3890 /* Build the argument packs. */
3897 }
3899 /* A subroutine of cp_parser_userdef_numeric_literal to
3900 create a char... template parameter pack from a string node. */
3902 static tree
3904 {
3905 tree charvec;
3916 /* First template parm is character type. */
3919 /* Fill in CHARVEC with all of the parameters. */
3926 /* Build the argument packs. */
3933 }
3935 /* Parse a user-defined numeric constant. returns a call to a user-defined
3936 literal operator. */
3938 static tree
3940 {
3951 /* Look for a literal operator taking the exact type of numeric argument
3952 as the literal value. */
3957 {
3960 {
3964 long_long_unsigned_type_node);
3965 else
3966 {
3970 long_double_type_node);
3974 }
3977 }
3978 }
3981 /* If the numeric argument didn't work, look for a raw literal
3982 operator taking a const char* argument consisting of the number
3983 in string format. */
3988 {
3991 {
3994 }
3995 }
3998 /* If the raw literal didn't work, look for a non-type template
3999 function with parameter pack char.... Call the function with
4000 template parameter characters representing the number. */
4004 {
4009 {
4012 }
4013 }
4021 }
4023 /* Parse a user-defined string constant. Returns a call to a user-defined
4024 literal operator taking a character pointer and the length of the string
4025 as arguments. */
4027 static tree
4029 {
4038 /* Look for a template function with typename parameter CharT
4039 and parameter pack CharT... Call the function with
4040 template parameter characters representing the string. */
4044 {
4049 {
4052 }
4053 }
4056 /* Build up a call to the user-defined operator */
4057 /* Lookup the name we got back from the id-expression. */
4063 {
4067 }
4076 }
4079 /* Basic concepts [gram.basic] */
4081 /* Parse a translation-unit.
4083 translation-unit:
4084 declaration-seq [opt]
4086 Returns TRUE if all went well. */
4088 static bool
4090 {
4091 /* The address of the first non-permanent object on the declarator
4092 obstack. */
4097 /* Create the declarator obstack, if necessary. */
4099 {
4101 /* Create the error declarator. */
4103 /* Create the empty parameter list. */
4105 /* Remember where the base of the declarator obstack lies. */
4107 }
4111 /* If there are no tokens left then all went well. */
4113 {
4114 /* Get rid of the token array; we don't need it any more. */
4118 /* This file might have been a context that's implicitly extern
4119 "C". If so, pop the lang context. (Only relevant for PCH.) */
4121 {
4124 }
4126 /* Finish up. */
4130 }
4131 else
4132 {
4135 }
4137 /* Make sure the declarator obstack was fully cleaned up. */
4141 /* All went well. */
4143 }
4145 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4146 decltype context. */
4150 {
4155 }
4157 /* We're about to parse a collection of statements. If we're currently
4158 parsing tentatively, set up a firewall so that any nested
4159 cp_parser_commit_to_tentative_parse won't affect the current context. */
4161 static cp_token_position
4163 {
4170 }
4172 /* We've finished parsing the collection of statements. Wrap up the
4173 firewall and replace the relevant tokens with the parsed form. */
4175 static void
4177 tree expr)
4178 {
4182 /* Finish the firewall level. */
4184 /* And remember the result of the parse for when we try again. */
4190 }
4192 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4193 enclosing parentheses. */
4195 static tree
4197 {
4200 /* Consume the '('. */
4202 /* Start the statement-expression. */
4204 /* Parse the compound-statement. */
4206 /* Finish up. */
4208 /* Consume the ')'. */
4214 }
4216 /* Expressions [gram.expr] */
4218 /* Parse a primary-expression.
4220 primary-expression:
4221 literal
4222 this
4223 ( expression )
4224 id-expression
4225 lambda-expression (C++11)
4227 GNU Extensions:
4229 primary-expression:
4230 ( compound-statement )
4231 __builtin_va_arg ( assignment-expression , type-id )
4232 __builtin_offsetof ( type-id , offsetof-expression )
4234 C++ Extensions:
4235 __has_nothrow_assign ( type-id )
4236 __has_nothrow_constructor ( type-id )
4237 __has_nothrow_copy ( type-id )
4238 __has_trivial_assign ( type-id )
4239 __has_trivial_constructor ( type-id )
4240 __has_trivial_copy ( type-id )
4241 __has_trivial_destructor ( type-id )
4242 __has_virtual_destructor ( type-id )
4243 __is_abstract ( type-id )
4244 __is_base_of ( type-id , type-id )
4245 __is_class ( type-id )
4246 __is_empty ( type-id )
4247 __is_enum ( type-id )
4248 __is_final ( type-id )
4249 __is_literal_type ( type-id )
4250 __is_pod ( type-id )
4251 __is_polymorphic ( type-id )
4252 __is_std_layout ( type-id )
4253 __is_trivial ( type-id )
4254 __is_union ( type-id )
4256 Objective-C++ Extension:
4258 primary-expression:
4259 objc-expression
4261 literal:
4262 __null
4264 ADDRESS_P is true iff this expression was immediately preceded by
4265 "&" and therefore might denote a pointer-to-member. CAST_P is true
4266 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4267 true iff this expression is a template argument.
4269 Returns a representation of the expression. Upon return, *IDK
4270 indicates what kind of id-expression (if any) was present. */
4272 static tree
4279 {
4282 /* Assume the primary expression is not an id-expression. */
4285 /* Peek at the next token. */
4288 {
4289 /* literal:
4290 integer-literal
4291 character-literal
4292 floating-literal
4293 string-literal
4294 boolean-literal
4295 pointer-literal
4296 user-defined-literal */
4307 {
4311 }
4312 /* Floating-point literals are only allowed in an integral
4313 constant expression if they are cast to an integral or
4314 enumeration type. */
4318 {
4319 /* CAST_P will be set even in invalid code like "int(2.7 +
4320 ...)". Therefore, we have to check that the next token
4321 is sure to end the cast. */
4323 {
4328 enumerator-definition. */
4330 /* The curly brace at the end of an enum-specifier. */
4332 /* The end of a statement. */
4334 /* The end of the cast-expression. */
4336 /* The end of an array bound. */
4338 /* The closing ">" in a template-argument-list. */
4341 /* C++0x only: A ">>" treated like two ">" tokens,
4342 in a template-argument-list. */
4347 }
4349 /* If we are within a cast, then the constraint that the
4350 cast is to an integral or enumeration type will be
4351 checked at that point. If we are not within a cast, then
4352 this code is invalid. */
4355 }
4374 /* ??? Should wide strings be allowed when parser->translate_strings_p
4375 is false (i.e. in attributes)? If not, we can kill the third
4376 argument to cp_parser_string_literal. */
4382 /* If we see `( { ' then we are looking at the beginning of
4383 a GNU statement-expression. */
4386 {
4387 /* Statement-expressions are not allowed by the standard. */
4391 /* And they're not allowed outside of a function-body; you
4392 cannot, for example, write:
4394 int i = ({ int j = 3; j + 1; });
4396 at class or namespace scope. */
4399 {
4401 "statement-expressions are not allowed outside "
4407 }
4408 else
4410 }
4411 /* Otherwise it's a normal parenthesized expression. */
4412 {
4413 tree expr;
4416 /* Consume the `('. */
4418 /* Within a parenthesized expression, a `>' token is always
4419 the greater-than operator. */
4420 saved_greater_than_is_operator_p
4424 /* Parse the parenthesized expression. */
4426 /* Let the front end know that this expression was
4427 enclosed in parentheses. This matters in case, for
4428 example, the expression is of the form `A::B', since
4429 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4430 not. */
4432 /* DR 705: Wrapping an unqualified name in parentheses
4433 suppresses arg-dependent lookup. We want to pass back
4434 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4435 (c++/37862), but none of the others. */
4439 /* The `>' token might be the end of a template-id or
4440 template-parameter-list now. */
4441 parser->greater_than_is_operator_p
4443 /* Consume the `)'. */
4448 }
4451 {
4453 {
4454 /* We might have an Objective-C++ message. */
4457 /* If that works out, we're done ... */
4460 /* ... else, fall though to see if it's a lambda. */
4461 }
4463 /* Don't warn about a failed tentative parse. */
4468 }
4472 /* We have an Objective-C++ string literal. */
4479 {
4480 /* These two are the boolean literals. */
4488 /* The `__null' literal. */
4493 /* The `nullptr' literal. */
4498 /* Recognize the `this' keyword. */
4502 {
4506 }
4507 /* Pointers cannot appear in constant-expressions. */
4512 /* The `operator' keyword can be the beginning of an
4513 id-expression. */
4520 {
4521 non_integral_constant name;
4523 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4524 __func__ are the names of variables -- but they are
4525 treated specially. Therefore, they are handled here,
4526 rather than relying on the generic id-expression logic
4527 below. Grammatically, these names are id-expressions.
4529 Consume the token. */
4533 {
4545 }
4550 /* Look up the name. */
4552 }
4555 {
4556 tree expression;
4557 tree type;
4558 source_location type_location;
4560 /* The `__builtin_va_arg' construct is used to handle
4561 `va_arg'. Consume the `__builtin_va_arg' token. */
4563 /* Look for the opening `('. */
4565 /* Now, parse the assignment-expression. */
4567 /* Look for the `,'. */
4570 /* Parse the type-id. */
4572 /* Look for the closing `)'. */
4574 /* Using `va_arg' in a constant-expression is not
4575 allowed. */
4577 NIC_VA_ARG))
4580 }
4610 /* Objective-C++ expressions. */
4620 {
4625 }
4629 }
4631 /* An id-expression can start with either an identifier, a
4632 `::' as the beginning of a qualified-id, or the "operator"
4633 keyword. */
4638 {
4639 tree id_expression;
4640 tree decl;
4646 id_expression:
4647 /* Parse the id-expression. */
4648 id_expression
4665 /* If we have a template-id, then no further lookup is
4666 required. If the template-id was for a template-class, we
4667 will sometimes have a TYPE_DECL at this point. */
4671 /* Look up the name. */
4672 else
4673 {
4674 tree ambiguous_decls;
4676 /* If we already know that this lookup is ambiguous, then
4677 we've already issued an error message; there's no reason
4678 to check again. */
4681 {
4684 }
4687 none_type,
4688 template_p,
4693 /* If the lookup was ambiguous, an error will already have
4694 been issued. */
4698 /* In Objective-C++, we may have an Objective-C 2.0
4699 dot-syntax for classes here. */
4704 {
4705 tree component;
4712 }
4714 /* In Objective-C++, an instance variable (ivar) may be preferred
4715 to whatever cp_parser_lookup_name() found. */
4718 /* If name lookup gives us a SCOPE_REF, then the
4719 qualifying scope was dependent. */
4721 {
4722 /* At this point, we do not know if DECL is a valid
4723 integral constant expression. We assume that it is
4724 in fact such an expression, so that code like:
4726 template <int N> struct A {
4727 int a[B<N>::i];
4728 };
4730 is accepted. At template-instantiation time, we
4731 will check that B<N>::i is actually a constant. */
4733 }
4734 /* Check to see if DECL is a local variable in a context
4735 where that is forbidden. */
4738 {
4739 /* It might be that we only found DECL because we are
4740 trying to be generous with pre-ISO scoping rules.
4741 For example, consider:
4743 int i;
4744 void g() {
4745 for (int i = 0; i < 10; ++i) {}
4746 extern void f(int j = i);
4747 }
4749 Here, name look up will originally find the out
4750 of scope `i'. We need to issue a warning message,
4751 but then use the global `i'. */
4754 {
4757 decl);
4759 }
4760 }
4761 }
4763 decl = (finish_id_expression
4765 idk,
4770 template_arg_p,
4776 }
4778 /* Anything else is an error. */
4782 }
4783 }
4791 {
4794 }
4796 /* Parse an id-expression.
4798 id-expression:
4799 unqualified-id
4800 qualified-id
4802 qualified-id:
4803 :: [opt] nested-name-specifier template [opt] unqualified-id
4804 :: identifier
4805 :: operator-function-id
4806 :: template-id
4808 Return a representation of the unqualified portion of the
4809 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4810 a `::' or nested-name-specifier.
4812 Often, if the id-expression was a qualified-id, the caller will
4813 want to make a SCOPE_REF to represent the qualified-id. This
4814 function does not do this in order to avoid wastefully creating
4815 SCOPE_REFs when they are not required.
4817 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4818 `template' keyword.
4820 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4821 uninstantiated templates.
4823 If *TEMPLATE_P is non-NULL, it is set to true iff the
4824 `template' keyword is used to explicitly indicate that the entity
4825 named is a template.
4827 If DECLARATOR_P is true, the id-expression is appearing as part of
4828 a declarator, rather than as part of an expression. */
4830 static tree
4837 {
4841 /* Assume the `template' keyword was not used. */
4845 /* Look for the optional `::' operator. */
4846 global_scope_p
4849 /* Look for the optional nested-name-specifier. */
4850 nested_name_specifier_p
4853 check_dependency_p,
4855 declarator_p)
4857 /* If there is a nested-name-specifier, then we are looking at
4858 the first qualified-id production. */
4860 {
4861 tree saved_scope;
4862 tree saved_object_scope;
4863 tree saved_qualifying_scope;
4864 tree unqualified_id;
4867 /* See if the next token is the `template' keyword. */
4871 /* Name lookup we do during the processing of the
4872 unqualified-id might obliterate SCOPE. */
4876 /* Process the final unqualified-id. */
4878 check_dependency_p,
4879 declarator_p,
4881 /* Restore the SAVED_SCOPE for our caller. */
4887 }
4888 /* Otherwise, if we are in global scope, then we are looking at one
4889 of the other qualified-id productions. */
4891 {
4893 tree id;
4895 /* Peek at the next token. */
4898 /* If it's an identifier, and the next token is not a "<", then
4899 we can avoid the template-id case. This is an optimization
4900 for this common case. */
4902 && !cp_parser_nth_token_starts_template_argument_list_p
4907 /* Try a template-id. */
4911 none_type,
4912 declarator_p);
4913 /* If that worked, we're done. */
4917 /* Peek at the next token. (Changes in the token buffer may
4918 have invalidated the pointer obtained above.) */
4922 {
4929 /* Fall through. */
4934 }
4935 }
4936 else
4939 declarator_p,
4940 optional_p);
4941 }
4943 /* Parse an unqualified-id.
4945 unqualified-id:
4946 identifier
4947 operator-function-id
4948 conversion-function-id
4949 ~ class-name
4950 template-id
4952 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4953 keyword, in a construct like `A::template ...'.
4955 Returns a representation of unqualified-id. For the `identifier'
4956 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4957 production a BIT_NOT_EXPR is returned; the operand of the
4958 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4959 other productions, see the documentation accompanying the
4960 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4961 names are looked up in uninstantiated templates. If DECLARATOR_P
4962 is true, the unqualified-id is appearing as part of a declarator,
4963 rather than as part of an expression. */
4965 static tree
4971 {
4974 /* Peek at the next token. */
4978 {
4980 {
4981 tree id;
4983 /* We don't know yet whether or not this will be a
4984 template-id. */
4986 /* Try a template-id. */
4988 check_dependency_p,
4989 none_type,
4990 declarator_p);
4991 /* If it worked, we're done. */
4994 /* Otherwise, it's an ordinary identifier. */
4996 }
5000 check_dependency_p,
5001 none_type,
5002 declarator_p);
5005 {
5006 tree type_decl;
5007 tree qualifying_scope;
5008 tree object_scope;
5009 tree scope;
5012 /* Consume the `~' token. */
5014 /* Parse the class-name. The standard, as written, seems to
5015 say that:
5017 template <typename T> struct S { ~S (); };
5018 template <typename T> S<T>::~S() {}
5020 is invalid, since `~' must be followed by a class-name, but
5021 `S<T>' is dependent, and so not known to be a class.
5022 That's not right; we need to look in uninstantiated
5023 templates. A further complication arises from:
5025 template <typename T> void f(T t) {
5026 t.T::~T();
5027 }
5029 Here, it is not possible to look up `T' in the scope of `T'
5030 itself. We must look in both the current scope, and the
5031 scope of the containing complete expression.
5033 Yet another issue is:
5035 struct S {
5036 int S;
5037 ~S();
5038 };
5040 S::~S() {}
5042 The standard does not seem to say that the `S' in `~S'
5043 should refer to the type `S' and not the data member
5044 `S::S'. */
5046 /* DR 244 says that we look up the name after the "~" in the
5047 same scope as we looked up the qualifying name. That idea
5048 isn't fully worked out; it's more complicated than that. */
5053 /* Check for invalid scopes. */
5055 {
5059 }
5061 {
5065 scope);
5070 }
5073 /* If the name is of the form "X::~X" it's OK even if X is a
5074 typedef. */
5083 {
5086 }
5088 /* ~auto means the destructor of whatever the object is. */
5090 {
5093 "%<~auto%> only available with "
5097 }
5099 /* If there was an explicit qualification (S::~T), first look
5100 in the scope given by the qualification (i.e., S).
5102 Note: in the calls to cp_parser_class_name below we pass
5103 typename_type so that lookup finds the injected-class-name
5104 rather than the constructor. */
5108 {
5113 typename_type,
5116 declarator_p);
5119 }
5120 /* In "N::S::~S", look in "N" as well. */
5122 {
5127 type_decl
5131 typename_type,
5134 declarator_p);
5137 }
5138 /* In "p->S::~T", look in the scope given by "*p" as well. */
5140 {
5145 type_decl
5149 typename_type,
5152 declarator_p);
5155 }
5156 /* Look in the surrounding context. */
5158 {
5164 type_decl
5168 typename_type,
5171 declarator_p);
5174 {
5175 /* We couldn't find a type with this name, so just accept
5176 it and check for a match at instantiation time. */
5181 }
5182 }
5183 /* If an error occurred, assume that the name of the
5184 destructor is the same as the name of the qualifying
5185 class. That allows us to keep parsing after running
5186 into ill-formed destructor names. */
5192 /* Check that destructor name and scope match. */
5194 {
5201 }
5203 /* [class.dtor]
5205 A typedef-name that names a class shall not be used as the
5206 identifier in the declarator for a destructor declaration. */
5213 type_decl);
5216 }
5220 {
5221 tree id;
5223 /* This could be a template-id, so we try that first. */
5225 /* Try a template-id. */
5228 none_type,
5229 declarator_p);
5230 /* If that worked, we're done. */
5233 /* We still don't know whether we're looking at an
5234 operator-function-id or a conversion-function-id. */
5236 /* Try an operator-function-id. */
5238 /* If that didn't work, try a conversion-function-id. */
5242 {
5243 /* 17.6.3.3.5 */
5249 }
5252 }
5253 /* Fall through. */
5260 }
5261 }
5263 /* Parse an (optional) nested-name-specifier.
5265 nested-name-specifier: [C++98]
5266 class-or-namespace-name :: nested-name-specifier [opt]
5267 class-or-namespace-name :: template nested-name-specifier [opt]
5269 nested-name-specifier: [C++0x]
5270 type-name ::
5271 namespace-name ::
5272 nested-name-specifier identifier ::
5273 nested-name-specifier template [opt] simple-template-id ::
5275 PARSER->SCOPE should be set appropriately before this function is
5276 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5277 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5278 in name lookups.
5280 Sets PARSER->SCOPE to the class (TYPE) or namespace
5281 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5282 it unchanged if there is no nested-name-specifier. Returns the new
5283 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5285 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5286 part of a declaration and/or decl-specifier. */
5288 static tree
5294 {
5299 /* Remember where the nested-name-specifier starts. */
5301 {
5304 }
5307 {
5308 tree new_scope;
5309 tree old_scope;
5310 tree saved_qualifying_scope;
5313 /* Spot cases that cannot be the beginning of a
5314 nested-name-specifier. */
5317 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5318 the already parsed nested-name-specifier. */
5320 {
5321 /* Grab the nested-name-specifier and continue the loop. */
5323 /* If we originally encountered this nested-name-specifier
5324 with IS_DECLARATION set to false, we will not have
5325 resolved TYPENAME_TYPEs, so we must do so here. */
5328 {
5333 }
5336 }
5338 /* Spot cases that cannot be the beginning of a
5339 nested-name-specifier. On the second and subsequent times
5340 through the loop, we look for the `template' keyword. */
5342 ;
5343 /* A template-id can start a nested-name-specifier. */
5345 ;
5346 /* DR 743: decltype can be used in a nested-name-specifier. */
5348 ;
5349 else
5350 {
5351 /* If the next token is not an identifier, then it is
5352 definitely not a type-name or namespace-name. */
5355 /* If the following token is neither a `<' (to begin a
5356 template-id), nor a `::', then we are not looking at a
5357 nested-name-specifier. */
5363 {
5367 }
5370 && !cp_parser_nth_token_starts_template_argument_list_p
5373 }
5375 /* The nested-name-specifier is optional, so we parse
5376 tentatively. */
5379 /* Look for the optional `template' keyword, if this isn't the
5380 first time through the loop. */
5383 else
5386 /* Save the old scope since the name lookup we are about to do
5387 might destroy it. */
5390 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5391 look up names in "X<T>::I" in order to determine that "Y" is
5392 a template. So, if we have a typename at this point, we make
5393 an effort to look through it. */
5395 && !typename_keyword_p
5400 /* Parse the qualifying entity. */
5401 new_scope
5403 typename_keyword_p,
5404 template_keyword_p,
5405 check_dependency_p,
5406 type_p,
5407 is_declaration);
5408 /* Look for the `::' token. */
5411 /* If we found what we wanted, we keep going; otherwise, we're
5412 done. */
5414 {
5417 /* Restore the OLD_SCOPE since it was valid before the
5418 failed attempt at finding the last
5419 class-or-namespace-name. */
5423 /* If the next token is a decltype, and the one after that is a
5424 `::', then the decltype has failed to resolve to a class or
5425 enumeration type. Give this error even when parsing
5426 tentatively since it can't possibly be valid--and we're going
5427 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5428 won't get another chance.*/
5432 {
5439 /* As below. */
5442 }
5446 {
5447 /* If we have a non-type template-id followed by ::, it can't
5448 possibly be valid. */
5453 {
5456 {
5462 }
5463 else
5464 {
5465 /* Variable template. */
5470 }
5477 /* As below. */
5481 }
5482 }
5486 /* If the next token is an identifier, and the one after
5487 that is a `::', then any valid interpretation would have
5488 found a class-or-namespace-name. */
5494 {
5497 {
5499 {
5500 tree decl;
5501 tree ambiguous_decls;
5504 none_type,
5513 decl);
5515 {
5516 // cp_parser_lookup_name has the same diagnostic,
5517 // thus make sure to emit it at most once.
5520 {
5525 }
5527 }
5528 else
5529 {
5531 cp_parser_name_lookup_error
5534 else
5535 cp_parser_name_lookup_error
5538 }
5539 }
5542 /* Treat this as a successful nested-name-specifier
5543 due to:
5545 [basic.lookup.qual]
5547 If the name found is not a class-name (clause
5548 _class_) or namespace-name (_namespace.def_), the
5549 program is ill-formed. */
5551 }
5553 }
5555 }
5556 /* We've found one valid nested-name-specifier. */
5558 /* Name lookup always gives us a DECL. */
5561 /* Uses of "template" must be followed by actual templates. */
5573 new_scope);
5574 /* If it is a class scope, try to complete it; we are about to
5575 be looking up names inside the class. */
5577 /* Since checking types for dependency can be expensive,
5578 avoid doing it if the type is already complete. */
5580 /* Do not try to complete dependent types. */
5582 {
5584 /* If it is a typedef to current class, use the current
5585 class instead, as the typedef won't have any names inside
5586 it yet. */
5590 }
5591 /* Make sure we look in the right scope the next time through
5592 the loop. */
5594 }
5596 /* If parsing tentatively, replace the sequence of tokens that makes
5597 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5598 token. That way, should we re-parse the token stream, we will
5599 not have to repeat the effort required to do the parse, nor will
5600 we issue duplicate error messages. */
5602 {
5606 /* Reset the contents of the START token. */
5608 /* Retrieve any deferred checks. Do not pop this access checks yet
5609 so the memory will not be reclaimed during token replacing below. */
5617 /* Purge all subsequent tokens. */
5619 }
5625 }
5627 /* Parse a nested-name-specifier. See
5628 cp_parser_nested_name_specifier_opt for details. This function
5629 behaves identically, except that it will an issue an error if no
5630 nested-name-specifier is present. */
5632 static tree
5638 {
5639 tree scope;
5641 /* Look for the nested-name-specifier. */
5643 typename_keyword_p,
5644 check_dependency_p,
5645 type_p,
5646 is_declaration);
5647 /* If it was not present, issue an error message. */
5649 {
5652 }
5655 }
5657 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5658 this is either a class-name or a namespace-name (which corresponds
5659 to the class-or-namespace-name production in the grammar). For
5660 C++0x, it can also be a type-name that refers to an enumeration
5661 type or a simple-template-id.
5663 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5664 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5665 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5666 TYPE_P is TRUE iff the next name should be taken as a class-name,
5667 even the same name is declared to be another entity in the same
5668 scope.
5670 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5671 specified by the class-or-namespace-name. If neither is found the
5672 ERROR_MARK_NODE is returned. */
5674 static tree
5681 {
5682 tree saved_scope;
5683 tree saved_qualifying_scope;
5684 tree saved_object_scope;
5685 tree scope;
5689 /* DR 743: decltype can appear in a nested-name-specifier. */
5691 {
5695 {
5698 }
5702 }
5704 /* Before we try to parse the class-name, we must save away the
5705 current PARSER->SCOPE since cp_parser_class_name will destroy
5706 it. */
5710 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5711 there is no need to look for a namespace-name. */
5712 only_class_p = template_keyword_p
5717 typename_keyword_p,
5718 template_keyword_p,
5720 check_dependency_p,
5722 is_declaration);
5724 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5728 {
5729 /* Restore the saved scope. */
5734 /* Parse tentatively. */
5737 /* Parse a type-name */
5740 /* "If the name found does not designate a namespace or a class,
5741 enumeration, or dependent type, the program is ill-formed."
5743 We cover classes and dependent types above and namespaces below,
5744 so this code is only looking for enums. */
5750 }
5751 /* If that didn't work, try for a namespace-name. */
5753 {
5754 /* Restore the saved scope. */
5758 /* If we are not looking at an identifier followed by the scope
5759 resolution operator, then this is not part of a
5760 nested-name-specifier. (Note that this function is only used
5761 to parse the components of a nested-name-specifier.) */
5766 }
5769 }
5771 /* Return true if we are looking at a compound-literal, false otherwise. */
5773 static bool
5775 {
5776 /* Consume the `('. */
5781 /* Skip tokens until the next token is a closing parenthesis.
5782 If we find the closing `)', and the next token is a `{', then
5783 we are looking at a compound-literal. */
5784 bool compound_literal_p
5789 /* Roll back the tokens we skipped. */
5793 }
5795 /* Parse a postfix-expression.
5797 postfix-expression:
5798 primary-expression
5799 postfix-expression [ expression ]
5800 postfix-expression ( expression-list [opt] )
5801 simple-type-specifier ( expression-list [opt] )
5802 typename :: [opt] nested-name-specifier identifier
5803 ( expression-list [opt] )
5804 typename :: [opt] nested-name-specifier template [opt] template-id
5805 ( expression-list [opt] )
5806 postfix-expression . template [opt] id-expression
5807 postfix-expression -> template [opt] id-expression
5808 postfix-expression . pseudo-destructor-name
5809 postfix-expression -> pseudo-destructor-name
5810 postfix-expression ++
5811 postfix-expression --
5812 dynamic_cast < type-id > ( expression )
5813 static_cast < type-id > ( expression )
5814 reinterpret_cast < type-id > ( expression )
5815 const_cast < type-id > ( expression )
5816 typeid ( expression )
5817 typeid ( type-id )
5819 GNU Extension:
5821 postfix-expression:
5822 ( type-id ) { initializer-list , [opt] }
5824 This extension is a GNU version of the C99 compound-literal
5825 construct. (The C99 grammar uses `type-name' instead of `type-id',
5826 but they are essentially the same concept.)
5828 If ADDRESS_P is true, the postfix expression is the operand of the
5829 `&' operator. CAST_P is true if this expression is the target of a
5830 cast.
5832 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5833 class member access expressions [expr.ref].
5835 Returns a representation of the expression. */
5837 static tree
5841 {
5843 location_t loc;
5850 /* Peek at the next token. */
5853 /* Some of the productions are determined by keywords. */
5856 {
5861 {
5862 tree type;
5863 tree expression;
5867 /* All of these can be handled in the same way from the point
5868 of view of parsing. Begin by consuming the token
5869 identifying the cast. */
5872 /* New types cannot be defined in the cast. */
5874 parser->type_definition_forbidden_message
5877 /* Look for the opening `<'. */
5879 /* Parse the type to which we are casting. */
5884 /* Look for the closing `>'. */
5886 /* Restore the old message. */
5889 bool saved_greater_than_is_operator_p
5893 /* And the expression which is being cast. */
5898 parser->greater_than_is_operator_p
5901 /* Only type conversions to integral or enumeration types
5902 can be used in constant-expressions. */
5908 {
5910 postfix_expression
5914 postfix_expression
5918 postfix_expression
5920 tf_warning_or_error);
5923 postfix_expression
5928 }
5929 }
5933 {
5934 tree type;
5938 /* Consume the `typeid' token. */
5940 /* Look for the `(' token. */
5942 /* Types cannot be defined in a `typeid' expression. */
5944 parser->type_definition_forbidden_message
5946 /* We can't be sure yet whether we're looking at a type-id or an
5947 expression. */
5949 /* Try a type-id first. */
5954 /* Look for the `)' token. Otherwise, we can't be sure that
5955 we're not looking at an expression: consider `typeid (int
5956 (3))', for example. */
5958 /* If all went well, simply lookup the type-id. */
5961 /* Otherwise, fall back to the expression variant. */
5962 else
5963 {
5964 tree expression;
5966 /* Look for an expression. */
5968 /* Compute its typeid. */
5970 /* Look for the `)' token. */
5972 }
5973 /* Restore the saved message. */
5975 /* `typeid' may not appear in an integral constant expression. */
5978 }
5982 {
5983 tree type;
5984 /* The syntax permitted here is the same permitted for an
5985 elaborated-type-specifier. */
5990 }
5994 {
5998 {
6003 }
6005 {
6010 }
6011 else
6012 {
6013 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6016 }
6018 postfix_expression =
6022 {
6026 }
6028 {
6033 }
6034 else
6035 {
6037 postfix_expression);
6041 }
6043 }
6046 {
6049 tree p;
6063 tf_warning_or_error);
6066 tf_warning_or_error);
6067 else
6068 {
6072 }
6074 }
6077 {
6078 tree type;
6080 /* If the next thing is a simple-type-specifier, we may be
6081 looking at a functional cast. We could also be looking at
6082 an id-expression. So, we try the functional cast, and if
6083 that doesn't work we fall back to the primary-expression. */
6085 /* Look for the simple-type-specifier. */
6088 CP_PARSER_FLAGS_NONE);
6089 /* Parse the cast itself. */
6091 postfix_expression
6093 /* If that worked, we're done. */
6097 /* If the functional-cast didn't work out, try a
6098 compound-literal. */
6101 {
6106 /* Avoid calling cp_parser_type_id pointlessly, see comment
6107 in cp_parser_cast_expression about c++/29234. */
6110 else
6111 {
6112 /* Parse the type. */
6117 /* Look for the `)'. */
6119 }
6121 /* If things aren't going well, there's no need to
6122 keep going. */
6124 {
6126 /* Parse the brace-enclosed initializer list. */
6129 }
6130 /* If that worked, we're definitely looking at a
6131 compound-literal expression. */
6133 {
6134 /* Warn the user that a compound literal is not
6135 allowed in standard C++. */
6138 /* For simplicity, we disallow compound literals in
6139 constant-expressions. We could
6140 allow compound literals of integer type, whose
6141 initializer was a constant, in constant
6142 expressions. Permitting that usage, as a further
6143 extension, would not change the meaning of any
6144 currently accepted programs. (Of course, as
6145 compound literals are not part of ISO C++, the
6146 standard has nothing to say.) */
6148 NIC_NCC))
6149 {
6152 }
6153 /* Form the representation of the compound-literal. */
6154 postfix_expression
6156 tf_warning_or_error);
6158 }
6159 }
6161 /* It must be a primary-expression. */
6162 postfix_expression
6165 decltype_p,
6167 }
6169 }
6171 /* Note that we don't need to worry about calling build_cplus_new on a
6172 class-valued CALL_EXPR in decltype when it isn't the end of the
6173 postfix-expression; unary_complex_lvalue will take care of that for
6174 all these cases. */
6176 /* Keep looping until the postfix-expression is complete. */
6178 {
6182 /* It is not a Koenig lookup function call. */
6183 postfix_expression
6186 /* Peek at the next token. */
6190 {
6193 {
6195 "two consecutive %<[%> shall "
6198 }
6199 postfix_expression
6201 postfix_expression,
6203 decltype_p);
6209 /* postfix-expression ( expression-list [opt] ) */
6210 {
6220 is_builtin_constant_p
6223 {
6224 /* The whole point of __builtin_constant_p is to allow
6225 non-constant expressions to appear as arguments. */
6226 saved_integral_constant_expression_p
6228 saved_non_integral_constant_expression_p
6231 }
6232 args = (cp_parser_parenthesized_expression_list
6238 {
6239 parser->integral_constant_expression_p
6241 parser->non_integral_constant_expression_p
6243 }
6246 {
6249 }
6251 /* Function calls are not permitted in
6252 constant-expressions. */
6255 NIC_FUNC_CALL))
6256 {
6260 }
6265 {
6267 {
6269 {
6272 postfix_expression
6274 complain);
6275 }
6276 else
6277 postfix_expression
6279 }
6280 /* We do not perform argument-dependent lookup if
6281 normal lookup finds a non-function, in accordance
6282 with the expected resolution of DR 218. */
6285 {
6289 /* Do not do argument dependent lookup if regular
6290 lookup finds a member function or a block-scope
6291 function declaration. [basic.lookup.argdep]/3 */
6294 {
6297 postfix_expression
6299 complain);
6300 }
6301 }
6302 }
6305 {
6315 "%<memset%> used with constant zero length "
6316 "parameter; this could be due to transposed "
6319 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6320 to avoid leaking those into folder and middle-end. */
6322 tree arg;
6326 }
6329 {
6339 {
6340 postfix_expression
6344 }
6347 {
6348 postfix_expression
6349 = (build_new_method_call
6355 complain));
6356 }
6357 else
6358 postfix_expression
6362 complain);
6363 }
6367 postfix_expression = (build_offset_ref_call_from_tree
6369 complain));
6371 /* A call to a static class member, or a namespace-scope
6372 function. */
6373 postfix_expression
6376 koenig_p,
6377 complain);
6378 else
6379 /* All other function calls. */
6380 postfix_expression
6383 koenig_p,
6384 complain);
6388 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6392 }
6397 /* postfix-expression . template [opt] id-expression
6398 postfix-expression . pseudo-destructor-name
6399 postfix-expression -> template [opt] id-expression
6400 postfix-expression -> pseudo-destructor-name */
6402 /* Consume the `.' or `->' operator. */
6405 postfix_expression
6407 postfix_expression,
6414 /* postfix-expression ++ */
6415 /* Consume the `++' token. */
6417 /* Generate a representation for the complete expression. */
6418 postfix_expression
6420 POSTINCREMENT_EXPR);
6421 /* Increments may not appear in constant-expressions. */
6429 /* postfix-expression -- */
6430 /* Consume the `--' token. */
6432 /* Generate a representation for the complete expression. */
6433 postfix_expression
6435 POSTDECREMENT_EXPR);
6436 /* Decrements may not appear in constant-expressions. */
6448 else
6450 }
6451 }
6453 /* We should never get here. */
6456 }
6458 /* This function parses Cilk Plus array notations. If a normal array expr. is
6459 parsed then the array index is passed back to the caller through *INIT_INDEX
6460 and the function returns a NULL_TREE. If array notation expr. is parsed,
6461 then *INIT_INDEX is ignored by the caller and the function returns
6462 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6463 error_mark_node. */
6465 static tree
6467 tree array_value)
6468 {
6472 {
6475 }
6484 {
6487 }
6489 {
6490 /* Consume the ':'. */
6493 /* If we are here, then we have a case like this A[:]. */
6495 {
6499 }
6503 }
6504 else
6505 {
6506 /* If we are here, then there are three valid possibilities:
6507 1. ARRAY [ EXP ]
6508 2. ARRAY [ EXP : EXP ]
6509 3. ARRAY [ EXP : EXP : EXP ] */
6513 {
6514 /* This indicates that we have a normal array expression. */
6517 }
6519 /* Consume the ':'. */
6523 {
6526 }
6527 }
6532 {
6536 }
6542 }
6544 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6545 by cp_parser_builtin_offsetof. We're looking for
6547 postfix-expression [ expression ]
6548 postfix-expression [ braced-init-list ] (C++11)
6550 FOR_OFFSETOF is set if we're being called in that context, which
6551 changes how we deal with integer constant expressions. */
6553 static tree
6555 tree postfix_expression,
6558 {
6563 /* Consume the `[' token. */
6569 /* Parse the index expression. */
6570 /* ??? For offsetof, there is a question of what to allow here. If
6571 offsetof is not being used in an integral constant expression context,
6572 then we *could* get the right answer by computing the value at runtime.
6573 If we are in an integral constant expression context, then we might
6574 could accept any constant expression; hard to say without analysis.
6575 Rather than open the barn door too wide right away, allow only integer
6576 constant expressions here. */
6579 else
6580 {
6582 {
6589 {
6591 "braced list index is not allowed with array "
6595 }
6596 }
6598 {
6599 /* Here are have these two options:
6600 ARRAY[EXP : EXP] - Array notation expr with default
6601 stride of 1.
6602 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6603 stride. */
6605 postfix_expression);
6608 }
6609 else
6611 }
6615 /* Look for the closing `]'. */
6618 /* Build the ARRAY_REF. */
6622 /* When not doing offsetof, array references are not permitted in
6623 constant-expressions. */
6629 }
6631 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6632 by cp_parser_builtin_offsetof. We're looking for
6634 postfix-expression . template [opt] id-expression
6635 postfix-expression . pseudo-destructor-name
6636 postfix-expression -> template [opt] id-expression
6637 postfix-expression -> pseudo-destructor-name
6639 FOR_OFFSETOF is set if we're being called in that context. That sorta
6640 limits what of the above we'll actually accept, but nevermind.
6641 TOKEN_TYPE is the "." or "->" token, which will already have been
6642 removed from the stream. */
6644 static tree
6647 tree postfix_expression,
6649 location_t location)
6650 {
6651 tree name;
6656 /* If this is a `->' operator, dereference the pointer. */
6659 tf_warning_or_error);
6660 /* Check to see whether or not the expression is type-dependent. */
6662 /* The identifier following the `->' or `.' is not qualified. */
6668 /* Enter the scope corresponding to the type of the object
6669 given by the POSTFIX_EXPRESSION. */
6671 {
6673 /* According to the standard, no expression should ever have
6674 reference type. Unfortunately, we do not currently match
6675 the standard in this respect in that our internal representation
6676 of an expression may have reference type even when the standard
6677 says it does not. Therefore, we have to manually obtain the
6678 underlying type here. */
6680 /* The type of the POSTFIX_EXPRESSION must be complete. */
6682 {
6684 postfix_expression);
6686 }
6687 /* Unlike the object expression in other contexts, *this is not
6688 required to be of complete type for purposes of class member
6689 access (5.2.5) outside the member function body. */
6693 /* Let the name lookup machinery know that we are processing a
6694 class member access expression. */
6696 /* If something went wrong, we want to be able to discern that case,
6697 as opposed to the case where there was no SCOPE due to the type
6698 of expression being dependent. */
6701 /* If the SCOPE was erroneous, make the various semantic analysis
6702 functions exit quickly -- and without issuing additional error
6703 messages. */
6706 }
6708 /* Assume this expression is not a pseudo-destructor access. */
6711 /* If the SCOPE is a scalar type, then, if this is a valid program,
6712 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6713 is type dependent, it can be pseudo-destructor-name or something else.
6714 Try to parse it as pseudo-destructor-name first. */
6716 {
6717 tree s;
6718 tree type;
6721 /* Parse the pseudo-destructor-name. */
6730 {
6732 postfix_expression
6735 }
6736 }
6739 {
6740 /* If the SCOPE is not a scalar type, we are looking at an
6741 ordinary class member access expression, rather than a
6742 pseudo-destructor-name. */
6745 /* Parse the id-expression. */
6746 name = (cp_parser_id_expression
6753 /* In general, build a SCOPE_REF if the member name is qualified.
6754 However, if the name was not dependent and has already been
6755 resolved; there is no need to build the SCOPE_REF. For example;
6757 struct X { void f(); };
6758 template <typename T> void f(T* t) { t->X::f(); }
6760 Even though "t" is dependent, "X::f" is not and has been resolved
6761 to a BASELINK; there is no need to include scope information. */
6763 /* But we do need to remember that there was an explicit scope for
6764 virtual function calls. */
6768 /* If the name is a template-id that names a type, we will get a
6769 TYPE_DECL here. That is invalid code. */
6771 {
6774 }
6775 else
6776 {
6778 {
6780 {
6784 }
6785 else
6788 name,
6789 template_p);
6793 }
6795 adjust_result_of_qualified_name_lookup
6797 postfix_expression
6799 template_p,
6800 tf_warning_or_error);
6801 }
6802 }
6804 /* We no longer need to look up names in the scope of the object on
6805 the left-hand side of the `.' or `->' operator. */
6808 /* Outside of offsetof, these operators may not appear in
6809 constant-expressions. */
6811 && (cp_parser_non_integral_constant_expression
6816 }
6818 /* Cache of LITERAL_ZERO_P constants. */
6822 /* Parse a parenthesized expression-list.
6824 expression-list:
6825 assignment-expression
6826 expression-list, assignment-expression
6828 attribute-list:
6829 expression-list
6830 identifier
6831 identifier, expression-list
6833 CAST_P is true if this expression is the target of a cast.
6835 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6836 argument pack.
6838 Returns a vector of trees. Each element is a representation of an
6839 assignment-expression. NULL is returned if the ( and or ) are
6840 missing. An empty, but allocated, vector is returned on no
6841 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6842 if we are parsing an attribute list for an attribute that wants a
6843 plain identifier argument, normal_attr for an attribute that wants
6844 an expression, or non_attr if we aren't parsing an attribute list. If
6845 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6846 not all of the expressions in the list were constant.
6847 WANT_LITERAL_ZERO_P is true if the caller is interested in
6848 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6849 immediately, this can be removed. */
6858 {
6864 /* Assume all the expressions will be constant. */
6873 /* Within a parenthesized expression, a `>' token is always
6874 the greater-than operator. */
6875 saved_greater_than_is_operator_p
6879 /* Consume expressions until there are no more. */
6882 {
6883 tree expr;
6885 /* At the beginning of attribute lists, check to see if the
6886 next token is an identifier. */
6889 {
6892 /* Consume the identifier. */
6894 /* Save the identifier. */
6896 }
6897 else
6898 {
6901 /* Parse the next assignment-expression. */
6903 {
6904 /* A braced-init-list. */
6910 }
6912 {
6913 expr = (cp_parser_constant_expression
6918 }
6919 else
6920 {
6924 {
6930 /* If a parameter is literal zero alone, remember it
6931 for -Wmemset-transposed-args warning. */
6934 && want_literal_zero_p
6936 == CPP_COMMA
6939 {
6946 else
6947 {
6952 }
6953 /* Consume the 0 token (or '\0', 0LL etc.). */
6955 }
6959 }
6962 cast_p);
6963 }
6968 /* If we have an ellipsis, then this is an expression
6969 expansion. */
6972 {
6973 /* Consume the `...'. */
6976 /* Build the argument pack. */
6978 }
6980 /* Add it to the list. We add error_mark_node
6981 expressions to the list, so that we can still tell if
6982 the correct form for a parenthesized expression-list
6983 is found. That gives better errors. */
6988 }
6990 /* After the first item, attribute lists look the same as
6991 expression lists. */
6994 get_comma:;
6995 /* If the next token isn't a `,', then we are done. */
6999 /* Otherwise, consume the `,' and keep going. */
7001 }
7004 {
7007 skip_comma:;
7008 /* We try and resync to an unnested comma, as that will give the
7009 user better diagnostics. */
7017 {
7018 parser->greater_than_is_operator_p
7021 }
7022 }
7024 parser->greater_than_is_operator_p
7031 }
7033 /* Parse a pseudo-destructor-name.
7035 pseudo-destructor-name:
7036 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7037 :: [opt] nested-name-specifier template template-id :: ~ type-name
7038 :: [opt] nested-name-specifier [opt] ~ type-name
7040 If either of the first two productions is used, sets *SCOPE to the
7041 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7042 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7043 or ERROR_MARK_NODE if the parse fails. */
7045 static void
7047 tree object,
7050 {
7053 /* Handle ~auto. */
7057 {
7060 "%<~auto%> only available with "
7067 }
7069 /* Assume that things will not work out. */
7072 /* Look for the optional `::' operator. */
7074 /* Look for the optional nested-name-specifier. */
7075 nested_name_specifier_p
7082 /* Now, if we saw a nested-name-specifier, we might be doing the
7083 second production. */
7086 {
7087 /* Consume the `template' keyword. */
7089 /* Parse the template-id. */
7093 class_type,
7095 /* Look for the `::' token. */
7097 }
7098 /* If the next token is not a `~', then there might be some
7099 additional qualification. */
7101 {
7102 /* At this point, we're looking for "type-name :: ~". The type-name
7103 must not be a class-name, since this is a pseudo-destructor. So,
7104 it must be either an enum-name, or a typedef-name -- both of which
7105 are just identifiers. So, we peek ahead to check that the "::"
7106 and "~" tokens are present; if they are not, then we can avoid
7107 calling type_name. */
7111 {
7114 }
7116 /* Look for the type-name. */
7121 /* Look for the `::' token. */
7123 }
7124 else
7127 /* Look for the `~'. */
7130 /* Once we see the ~, this has to be a pseudo-destructor. */
7134 /* Look for the type-name again. We are not responsible for
7135 checking that it matches the first type-name. */
7137 }
7139 /* Parse a unary-expression.
7141 unary-expression:
7142 postfix-expression
7143 ++ cast-expression
7144 -- cast-expression
7145 unary-operator cast-expression
7146 sizeof unary-expression
7147 sizeof ( type-id )
7148 alignof ( type-id ) [C++0x]
7149 new-expression
7150 delete-expression
7152 GNU Extensions:
7154 unary-expression:
7155 __extension__ cast-expression
7156 __alignof__ unary-expression
7157 __alignof__ ( type-id )
7158 alignof unary-expression [C++0x]
7159 __real__ cast-expression
7160 __imag__ cast-expression
7161 && identifier
7162 sizeof ( type-id ) { initializer-list , [opt] }
7163 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7164 __alignof__ ( type-id ) { initializer-list , [opt] }
7166 ADDRESS_P is true iff the unary-expression is appearing as the
7167 operand of the `&' operator. CAST_P is true if this expression is
7168 the target of a cast.
7170 Returns a representation of the expression. */
7172 static tree
7175 {
7179 /* Peek at the next token. */
7181 /* Some keywords give away the kind of expression. */
7183 {
7187 {
7190 {
7193 location_t first_loc;
7196 /* Consume the token. */
7199 /* Parse the operand. */
7204 else
7205 {
7206 /* ISO C++ defines alignof only with types, not with
7207 expressions. So pedwarn if alignof is used with a non-
7208 type expression. However, __alignof__ is ok. */
7211 "ISO C++ does not allow %<alignof%> "
7215 }
7216 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7217 SIZEOF_EXPR with the original operand. */
7219 {
7221 {
7223 {
7226 error_mark_node));
7228 }
7229 else
7233 }
7235 }
7237 }
7246 {
7247 /* The saved value of the PEDANTIC flag. */
7249 tree expr;
7251 /* Save away the PEDANTIC flag. */
7253 /* Parse the cast-expression. */
7255 /* Restore the PEDANTIC flag. */
7259 }
7263 {
7264 tree expression;
7266 /* Consume the `__real__' or `__imag__' token. */
7268 /* Parse the cast-expression. */
7270 /* Create the complete representation. */
7274 expression,
7275 tf_warning_or_error);
7276 }
7284 {
7285 tree expr;
7295 parser->type_definition_forbidden_message
7298 saved_integral_constant_expression_p
7300 saved_non_integral_constant_expression_p
7304 saved_greater_than_is_operator_p
7316 parser->greater_than_is_operator_p
7319 parser->integral_constant_expression_p
7321 parser->non_integral_constant_expression_p
7328 }
7332 }
7333 }
7335 /* Look for the `:: new' and `:: delete', which also signal the
7336 beginning of a new-expression, or delete-expression,
7337 respectively. If the next token is `::', then it might be one of
7338 these. */
7340 {
7343 /* See if the token after the `::' is one of the keywords in
7344 which we're interested. */
7346 /* If it's `new', we have a new-expression. */
7349 /* Similarly, for `delete'. */
7352 }
7354 /* Look for a unary operator. */
7356 /* The `++' and `--' operators can be handled similarly, even though
7357 they are not technically unary-operators in the grammar. */
7359 {
7364 /* Handle the GNU address-of-label extension. */
7367 {
7368 tree identifier;
7369 tree expression;
7372 /* Consume the '&&' token. */
7374 /* Look for the identifier. */
7376 /* Create an expression representing the address. */
7379 NIC_ADDR_LABEL))
7382 }
7383 }
7385 {
7386 tree cast_expression;
7392 /* Consume the operator token. */
7394 /* Parse the cast-expression. */
7395 cast_expression
7400 pidk);
7401 /* Now, build an appropriate representation. */
7403 {
7407 RO_UNARY_STAR,
7408 complain);
7413 /* Fall through. */
7416 cast_expression,
7417 complain);
7424 /* Fall through. */
7434 }
7438 non_constant_p))
7442 }
7446 decltype_p,
7447 pidk);
7448 }
7450 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7451 unary-operator, the corresponding tree code is returned. */
7453 static enum tree_code
7455 {
7457 {
7478 }
7479 }
7481 /* Parse a new-expression.
7483 new-expression:
7484 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7485 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7487 Returns a representation of the expression. */
7489 static tree
7491 {
7494 tree type;
7497 tree ret;
7499 /* Look for the optional `::' operator. */
7500 global_scope_p
7504 /* Look for the `new' operator. */
7506 /* There's no easy way to tell a new-placement from the
7507 `( type-id )' construct. */
7509 /* Look for a new-placement. */
7511 /* If that didn't work out, there's no new-placement. */
7513 {
7517 }
7519 /* If the next token is a `(', then we have a parenthesized
7520 type-id. */
7522 {
7526 /* Consume the `('. */
7529 /* Parse the type-id. */
7530 parser->type_definition_forbidden_message
7535 /* Look for the closing `)'. */
7538 /* There should not be a direct-new-declarator in this production,
7539 but GCC used to allowed this, so we check and emit a sensible error
7540 message for this case. */
7542 {
7548 }
7549 }
7550 /* Otherwise, there must be a new-type-id. */
7551 else
7554 /* If the next token is a `(' or '{', then we have a new-initializer. */
7558 else
7561 /* A new-expression may not appear in an integral constant
7562 expression. */
7565 else
7566 {
7567 /* Create a representation of the new-expression. */
7569 tf_warning_or_error);
7570 }
7578 }
7580 /* Parse a new-placement.
7582 new-placement:
7583 ( expression-list )
7585 Returns the same representation as for an expression-list. */
7589 {
7592 /* Parse the expression-list. */
7593 expression_list = (cp_parser_parenthesized_expression_list
7599 }
7601 /* Parse a new-type-id.
7603 new-type-id:
7604 type-specifier-seq new-declarator [opt]
7606 Returns the TYPE allocated. If the new-type-id indicates an array
7607 type, *NELTS is set to the number of elements in the last array
7608 bound; the TYPE will not include the last array bound. */
7610 static tree
7612 {
7613 cp_decl_specifier_seq type_specifier_seq;
7619 /* The type-specifier sequence must not contain type definitions.
7620 (It cannot contain declarations of new types either, but if they
7621 are not definitions we will catch that because they are not
7622 complete.) */
7624 parser->type_definition_forbidden_message
7626 /* Parse the type-specifier-seq. */
7630 /* Restore the old message. */
7636 /* Parse the new-declarator. */
7639 /* Determine the number of elements in the last array dimension, if
7640 any. */
7642 /* Skip down to the last array dimension. */
7647 {
7650 }
7655 {
7658 }
7661 {
7668 else
7670 }
7673 }
7675 /* Parse an (optional) new-declarator.
7677 new-declarator:
7678 ptr-operator new-declarator [opt]
7679 direct-new-declarator
7681 Returns the declarator. */
7685 {
7688 cp_cv_quals cv_quals;
7690 /* We don't know if there's a ptr-operator next, or not. */
7692 /* Look for a ptr-operator. */
7694 /* If that worked, look for more new-declarators. */
7696 {
7699 /* Parse another optional declarator. */
7702 declarator = cp_parser_make_indirect_declarator
7706 }
7708 /* If the next token is a `[', there is a direct-new-declarator. */
7713 }
7715 /* Parse a direct-new-declarator.
7717 direct-new-declarator:
7718 [ expression ]
7719 direct-new-declarator [constant-expression]
7721 */
7725 {
7729 {
7730 tree expression;
7733 /* Look for the opening `['. */
7738 /* The standard requires that the expression have integral
7739 type. DR 74 adds enumeration types. We believe that the
7740 real intent is that these expressions be handled like the
7741 expression in a `switch' condition, which also allows
7742 classes with a single conversion to integral or
7743 enumeration type. */
7745 {
7746 expression
7748 expression,
7751 {
7753 "expression in new-declarator must have integral "
7756 }
7757 }
7759 /* Look for the closing `]'. */
7762 /* Add this bound to the declarator. */
7765 /* If the next token is not a `[', then there are no more
7766 bounds. */
7769 }
7772 }
7774 /* Parse a new-initializer.
7776 new-initializer:
7777 ( expression-list [opt] )
7778 braced-init-list
7780 Returns a representation of the expression-list. */
7784 {
7788 {
7789 tree t;
7796 }
7797 else
7798 expression_list = (cp_parser_parenthesized_expression_list
7804 }
7806 /* Parse a delete-expression.
7808 delete-expression:
7809 :: [opt] delete cast-expression
7810 :: [opt] delete [ ] cast-expression
7812 Returns a representation of the expression. */
7814 static tree
7816 {
7819 tree expression;
7821 /* Look for the optional `::' operator. */
7822 global_scope_p
7826 /* Look for the `delete' keyword. */
7828 /* See if the array syntax is in use. */
7830 {
7831 /* Consume the `[' token. */
7833 /* Look for the `]' token. */
7835 /* Remember that this is the `[]' construct. */
7837 }
7838 else
7841 /* Parse the cast-expression. */
7844 /* A delete-expression may not appear in an integral constant
7845 expression. */
7850 tf_warning_or_error);
7851 }
7853 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7854 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7855 0 otherwise. */
7857 static int
7859 {
7862 {
7904 /* In ((type ()) () the last () isn't a valid cast-expression,
7905 so the whole must be parsed as postfix-expression. */
7910 /* '[' may start a primary-expression in obj-c++ and in C++11,
7911 as a lambda-expression, eg, '(void)[]{}'. */
7918 /* '++' and '--' may or may not start a cast-expression:
7920 struct T { void operator++(int); };
7921 void f() { (T())++; }
7923 vs
7925 int a;
7926 (int)++a; */
7931 }
7932 }
7934 /* Parse a cast-expression.
7936 cast-expression:
7937 unary-expression
7938 ( type-id ) cast-expression
7940 ADDRESS_P is true iff the unary-expression is appearing as the
7941 operand of the `&' operator. CAST_P is true if this expression is
7942 the target of a cast.
7944 Returns a representation of the expression. */
7946 static tree
7949 {
7950 /* If it's a `(', then we might be looking at a cast. */
7952 {
7958 /* There's no way to know yet whether or not this is a cast.
7959 For example, `(int (3))' is a unary-expression, while `(int)
7960 3' is a cast. So, we resort to parsing tentatively. */
7962 /* Types may not be defined in a cast. */
7964 parser->type_definition_forbidden_message
7966 /* Consume the `('. */
7968 /* A very tricky bit is that `(struct S) { 3 }' is a
7969 compound-literal (which we permit in C++ as an extension).
7970 But, that construct is not a cast-expression -- it is a
7971 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7972 is legal; if the compound-literal were a cast-expression,
7973 you'd need an extra set of parentheses.) But, if we parse
7974 the type-id, and it happens to be a class-specifier, then we
7975 will commit to the parse at that point, because we cannot
7976 undo the action that is done when creating a new class. So,
7977 then we cannot back up and do a postfix-expression.
7979 Another tricky case is the following (c++/29234):
7981 struct S { void operator () (); };
7983 void foo ()
7984 {
7985 ( S()() );
7986 }
7988 As a type-id we parse the parenthesized S()() as a function
7989 returning a function, groktypename complains and we cannot
7990 back up in this case either.
7992 Therefore, we scan ahead to the closing `)', and check to see
7993 if the tokens after the `)' can start a cast-expression. Otherwise
7994 we are dealing with an unary-expression, a postfix-expression
7995 or something else.
7997 Yet another tricky case, in C++11, is the following (c++/54891):
7999 (void)[]{};
8001 The issue is that usually, besides the case of lambda-expressions,
8002 the parenthesized type-id cannot be followed by '[', and, eg, we
8003 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8004 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8005 we don't commit, we try a cast-expression, then an unary-expression.
8007 Save tokens so that we can put them back. */
8010 /* We may be looking at a cast-expression. */
8013 cast_expression
8016 /* Roll back the tokens we skipped. */
8018 /* If we aren't looking at a cast-expression, simulate an error so
8019 that the call to cp_parser_error_occurred below returns true. */
8022 else
8023 {
8026 /* Look for the type-id. */
8028 /* Look for the closing `)'. */
8031 }
8033 /* Restore the saved message. */
8036 /* At this point this can only be either a cast or a
8037 parenthesized ctor such as `(T ())' that looks like a cast to
8038 function returning T. */
8040 {
8041 /* Only commit if the cast-expression doesn't start with
8042 '++', '--', or '[' in C++11. */
8050 pidk);
8053 {
8054 /* Warn about old-style casts, if so requested. */
8061 /* Only type conversions to integral or enumeration types
8062 can be used in constant-expressions. */
8065 NIC_CAST))
8068 /* Perform the cast. */
8071 }
8072 }
8073 else
8075 }
8077 /* If we get here, then it's not a cast, so it must be a
8078 unary-expression. */
8081 }
8083 /* Parse a binary expression of the general form:
8085 pm-expression:
8086 cast-expression
8087 pm-expression .* cast-expression
8088 pm-expression ->* cast-expression
8090 multiplicative-expression:
8091 pm-expression
8092 multiplicative-expression * pm-expression
8093 multiplicative-expression / pm-expression
8094 multiplicative-expression % pm-expression
8096 additive-expression:
8097 multiplicative-expression
8098 additive-expression + multiplicative-expression
8099 additive-expression - multiplicative-expression
8101 shift-expression:
8102 additive-expression
8103 shift-expression << additive-expression
8104 shift-expression >> additive-expression
8106 relational-expression:
8107 shift-expression
8108 relational-expression < shift-expression
8109 relational-expression > shift-expression
8110 relational-expression <= shift-expression
8111 relational-expression >= shift-expression
8113 GNU Extension:
8115 relational-expression:
8116 relational-expression <? shift-expression
8117 relational-expression >? shift-expression
8119 equality-expression:
8120 relational-expression
8121 equality-expression == relational-expression
8122 equality-expression != relational-expression
8124 and-expression:
8125 equality-expression
8126 and-expression & equality-expression
8128 exclusive-or-expression:
8129 and-expression
8130 exclusive-or-expression ^ and-expression
8132 inclusive-or-expression:
8133 exclusive-or-expression
8134 inclusive-or-expression | exclusive-or-expression
8136 logical-and-expression:
8137 inclusive-or-expression
8138 logical-and-expression && inclusive-or-expression
8140 logical-or-expression:
8141 logical-and-expression
8142 logical-or-expression || logical-and-expression
8144 All these are implemented with a single function like:
8146 binary-expression:
8147 simple-cast-expression
8148 binary-expression <token> binary-expression
8150 CAST_P is true if this expression is the target of a cast.
8152 The binops_by_token map is used to get the tree codes for each <token> type.
8153 binary-expressions are associated according to a precedence table. */
8155 #define TOKEN_PRECEDENCE(token) \
8156 (((token->type == CPP_GREATER \
8157 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8158 && !parser->greater_than_is_operator_p) \
8159 ? PREC_NOT_OPERATOR \
8160 : binops_by_token[token->type].prec)
8162 static tree
8168 {
8169 cp_parser_expression_stack stack;
8171 cp_parser_expression_stack_entry current;
8172 tree rhs;
8176 tree overload;
8178 /* Parse the first expression. */
8189 {
8190 /* Get an operator token. */
8196 {
8198 "%<>>%> operator is treated"
8202 }
8206 /* Popping an entry off the stack means we completed a subexpression:
8207 - either we found a token which is not an operator (`>' where it is not
8208 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8209 will happen repeatedly;
8210 - or, we found an operator which has lower priority. This is the case
8211 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8212 parsing `3 * 4'. */
8214 {
8217 else
8219 }
8221 get_rhs:
8225 /* We used the operator token. */
8228 /* For "false && x" or "true || x", x will never be executed;
8229 disable warnings while evaluating it. */
8235 /* Extract another operand. It may be the RHS of this expression
8236 or the LHS of a new, higher priority expression. */
8241 /* Get another operator token. Look up its precedence to avoid
8242 building a useless (immediately popped) stack entry for common
8243 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8247 {
8248 /* ... and prepare to parse the RHS of the new, higher priority
8249 expression. Since precedence levels on the stack are
8250 monotonically increasing, we do not have to care about
8251 stack overflows. */
8260 pop:
8262 /* If the stack is not empty, we have parsed into LHS the right side
8263 (`4' in the example above) of an expression we had suspended.
8264 We can use the information on the stack to recover the LHS (`3')
8265 from the stack together with the tree code (`MULT_EXPR'), and
8266 the precedence of the higher level subexpression
8267 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8268 which will be used to actually build the additive expression. */
8273 }
8275 /* Undo the disabling of warnings done above. */
8286 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8287 ERROR_MARK for everything that is not a binary expression.
8288 This makes warn_about_parentheses miss some warnings that
8289 involve unary operators. For unary expressions we should
8290 pass the correct tree_code unless the unary expression was
8291 surrounded by parentheses.
8292 */
8298 == tcc_comparison
8301 else
8310 /* If the binary operator required the use of an overloaded operator,
8311 then this expression cannot be an integral constant-expression.
8312 An overloaded operator can be used even if both operands are
8313 otherwise permissible in an integral constant-expression if at
8314 least one of the operands is of enumeration type. */
8318 NIC_OVERLOADED))
8320 }
8323 }
8325 static tree
8330 {
8333 }
8335 /* Parse the `? expression : assignment-expression' part of a
8336 conditional-expression. The LOGICAL_OR_EXPR is the
8337 logical-or-expression that started the conditional-expression.
8338 Returns a representation of the entire conditional-expression.
8340 This routine is used by cp_parser_assignment_expression.
8342 ? expression : assignment-expression
8344 GNU Extensions:
8346 ? : assignment-expression */
8348 static tree
8350 {
8351 tree expr;
8352 tree assignment_expr;
8356 /* Consume the `?' token. */
8361 {
8364 /* Implicit true clause. */
8368 }
8369 else
8370 {
8373 /* Parse the expression. */
8376 c_inhibit_evaluation_warnings +=
8380 }
8382 /* The next token should be a `:'. */
8384 /* Parse the assignment-expression. */
8388 /* Build the conditional-expression. */
8390 expr,
8391 assignment_expr,
8392 tf_warning_or_error);
8393 }
8395 /* Parse an assignment-expression.
8397 assignment-expression:
8398 conditional-expression
8399 logical-or-expression assignment-operator assignment_expression
8400 throw-expression
8402 CAST_P is true if this expression is the target of a cast.
8403 DECLTYPE_P is true if this expression is the operand of decltype.
8405 Returns a representation for the expression. */
8407 static tree
8410 {
8411 tree expr;
8413 /* If the next token is the `throw' keyword, then we're looking at
8414 a throw-expression. */
8417 /* Otherwise, it must be that we are looking at a
8418 logical-or-expression. */
8419 else
8420 {
8421 /* Parse the binary expressions (logical-or-expression). */
8423 decltype_p,
8425 /* If the next token is a `?' then we're actually looking at a
8426 conditional-expression. */
8429 else
8430 {
8433 /* If it's an assignment-operator, we're using the second
8434 production. */
8435 enum tree_code assignment_operator
8438 {
8440 location_t saved_input_location;
8442 /* Parse the right-hand side of the assignment. */
8448 /* An assignment may not appear in a
8449 constant-expression. */
8451 NIC_ASSIGNMENT))
8453 /* Build the assignment expression. Its default
8454 location is the location of the '=' token. */
8458 assignment_operator,
8459 rhs,
8462 }
8463 }
8464 }
8467 }
8469 /* Parse an (optional) assignment-operator.
8471 assignment-operator: one of
8472 = *= /= %= += -= >>= <<= &= ^= |=
8474 GNU Extension:
8476 assignment-operator: one of
8477 <?= >?=
8479 If the next token is an assignment operator, the corresponding tree
8480 code is returned, and the token is consumed. For example, for
8481 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8482 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8483 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8484 operator, ERROR_MARK is returned. */
8486 static enum tree_code
8488 {
8492 /* Peek at the next token. */
8496 {
8542 /* Nothing else is an assignment operator. */
8544 }
8546 /* If it was an assignment operator, consume it. */
8551 }
8553 /* Parse an expression.
8555 expression:
8556 assignment-expression
8557 expression , assignment-expression
8559 CAST_P is true if this expression is the target of a cast.
8560 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8561 except possibly parenthesized or on the RHS of a comma (N3276).
8563 Returns a representation of the expression. */
8565 static tree
8568 {
8573 {
8574 tree assignment_expression;
8576 /* Parse the next assignment-expression. */
8577 assignment_expression
8580 /* We don't create a temporary for a call that is the immediate operand
8581 of decltype or on the RHS of a comma. But when we see a comma, we
8582 need to create a temporary for a call on the LHS. */
8587 assignment_expression
8591 /* If this is the first assignment-expression, we can just
8592 save it away. */
8595 else
8597 assignment_expression,
8599 /* If the next token is not a comma, then we are done with the
8600 expression. */
8603 /* Consume the `,'. */
8606 /* A comma operator cannot appear in a constant-expression. */
8609 }
8612 }
8614 /* Parse a constant-expression.
8616 constant-expression:
8617 conditional-expression
8619 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8620 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8621 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8622 is false, NON_CONSTANT_P should be NULL. */
8624 static tree
8628 {
8632 tree expression;
8634 /* It might seem that we could simply parse the
8635 conditional-expression, and then check to see if it were
8636 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8637 one that the compiler can figure out is constant, possibly after
8638 doing some simplifications or optimizations. The standard has a
8639 precise definition of constant-expression, and we must honor
8640 that, even though it is somewhat more restrictive.
8642 For example:
8644 int i[(2, 3)];
8646 is not a legal declaration, because `(2, 3)' is not a
8647 constant-expression. The `,' operator is forbidden in a
8648 constant-expression. However, GCC's constant-folding machinery
8649 will fold this operation to an INTEGER_CST for `3'. */
8651 /* Save the old settings. */
8653 saved_allow_non_integral_constant_expression_p
8656 /* We are now parsing a constant-expression. */
8658 parser->allow_non_integral_constant_expression_p
8661 /* Although the grammar says "conditional-expression", we parse an
8662 "assignment-expression", which also permits "throw-expression"
8663 and the use of assignment operators. In the case that
8664 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8665 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8666 actually essential that we look for an assignment-expression.
8667 For example, cp_parser_initializer_clauses uses this function to
8668 determine whether a particular assignment-expression is in fact
8669 constant. */
8671 /* Restore the old settings. */
8672 parser->integral_constant_expression_p
8674 parser->allow_non_integral_constant_expression_p
8677 {
8678 /* Require an rvalue constant expression here; that's what our
8679 callers expect. Reference constant expressions are handled
8680 separately in e.g. cp_parser_template_argument. */
8685 }
8688 parser->non_integral_constant_expression_p
8692 }
8694 /* Parse __builtin_offsetof.
8696 offsetof-expression:
8697 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8699 offsetof-member-designator:
8700 id-expression
8701 | offsetof-member-designator "." id-expression
8702 | offsetof-member-designator "[" expression "]"
8703 | offsetof-member-designator "->" id-expression */
8705 static tree
8707 {
8710 cp_id_kind dummy;
8713 /* We're about to accept non-integral-constant things, but will
8714 definitely yield an integral constant expression. Save and
8715 restore these values around our local parsing. */
8719 /* Consume the "__builtin_offsetof" token. */
8721 /* Consume the opening `('. */
8723 /* Parse the type-id. */
8726 /* Look for the `,'. */
8730 /* Build the (type *)null that begins the traditional offsetof macro. */
8732 tf_warning_or_error);
8734 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8738 {
8741 {
8743 /* offsetof-member-designator "[" expression "]" */
8749 /* offsetof-member-designator "->" identifier */
8752 /* FALLTHRU */
8755 /* offsetof-member-designator "." identifier */
8763 /* Consume the ")" token. */
8768 /* Error. We know the following require will fail, but
8769 that gives the proper error message. */
8774 }
8775 }
8777 success:
8780 failure:
8785 }
8787 /* Parse a trait expression.
8789 Returns a representation of the expression, the underlying type
8790 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8792 static tree
8794 {
8795 cp_trait_kind kind;
8801 {
8885 }
8887 /* Consume the token. */
8898 {
8905 }
8907 {
8909 {
8913 {
8916 }
8920 }
8921 }
8925 /* Complete the trait expression, which may mean either processing
8926 the trait expr now or saving it for template instantiation. */
8928 {
8937 }
8938 }
8940 /* Lambdas that appear in variable initializer or default argument scope
8941 get that in their mangling, so we need to record it. We might as well
8942 use the count for function and namespace scopes as well. */
8946 {
8947 tree t;
8952 static void
8954 {
8955 tree_int ti;
8957 /* Once we're inside a function, we ignore other scopes and just push
8958 the function again so that popping works properly. */
8965 {
8966 /* Don't reset the count if we're still in the same function. */
8969 }
8970 }
8972 static void
8974 {
8977 }
8979 static void
8981 {
8984 {
8987 }
8989 }
8991 /* Parse a lambda expression.
8993 lambda-expression:
8994 lambda-introducer lambda-declarator [opt] compound-statement
8996 Returns a representation of the expression. */
8998 static tree
9000 {
9002 tree type;
9010 {
9012 {
9016 }
9018 }
9020 {
9022 {
9025 }
9027 }
9029 /* We may be in the middle of deferred access check. Disable
9030 it now. */
9041 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9044 /* Now that we've started the type, add the capture fields for any
9045 explicit captures. */
9048 {
9049 /* Inside the class, surrounding template-parameter-lists do not apply. */
9050 unsigned int saved_num_template_parameter_lists
9054 bool fully_implicit_function_template_p
9058 bool auto_is_implicit_function_template_parm_p
9069 /* By virtue of defining a local class, a lambda expression has access to
9070 the private variables of enclosing classes. */
9075 {
9081 }
9083 {
9086 }
9088 /* The capture list was built up in reverse order; fix that now. */
9100 parser->fully_implicit_function_template_p
9104 parser->auto_is_implicit_function_template_parm_p
9106 }
9110 /* This field is only used during parsing of the lambda. */
9113 /* This lambda shouldn't have any proxies left at this point. */
9115 /* And now that we're done, push proxies for an enclosing lambda. */
9120 else
9126 }
9128 /* Parse the beginning of a lambda expression.
9130 lambda-introducer:
9131 [ lambda-capture [opt] ]
9133 LAMBDA_EXPR is the current representation of the lambda expression. */
9135 static void
9137 {
9138 /* Need commas after the first capture. */
9141 /* Eat the leading `['. */
9144 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9152 {
9155 }
9158 {
9160 tree capture_id;
9161 tree capture_init_expr;
9165 enum capture_kind_type
9166 {
9167 BY_COPY,
9168 BY_REFERENCE
9169 };
9173 {
9176 }
9180 else
9183 /* Possibly capture `this'. */
9185 {
9195 explicit_init_p);
9197 }
9199 /* Remember whether we want to capture as a reference or not. */
9201 {
9204 }
9206 /* Get the identifier. */
9211 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9212 delimiters, but I modified this to stop on unnested ']' as well. It
9213 was already changed to stop on unnested '}', so the
9214 "closing_parenthesis" name is no more misleading with my change. */
9215 {
9221 }
9223 /* Find the initializer for this capture. */
9227 {
9229 /* An explicit initializer exists. */
9232 "lambda capture initializers "
9238 {
9241 }
9242 }
9243 else
9244 {
9247 /* Turn the identifier into an id-expression. */
9248 capture_init_expr
9253 {
9256 }
9260 {
9263 capture_init_expr);
9266 }
9269 {
9272 capture_init_expr))
9275 }
9277 capture_init_expr
9278 = finish_id_expression
9280 capture_init_expr,
9294 {
9297 }
9298 else
9300 }
9304 {
9309 capture_id);
9313 "capture of %qD redundant with by-reference capture "
9315 }
9318 capture_id,
9319 capture_init_expr,
9321 explicit_init_p);
9322 }
9325 }
9327 /* Parse the (optional) middle of a lambda expression.
9329 lambda-declarator:
9330 < template-parameter-list [opt] >
9331 ( parameter-declaration-clause [opt] )
9332 attribute-specifier [opt]
9333 mutable [opt]
9334 exception-specification [opt]
9335 lambda-return-type-clause [opt]
9337 LAMBDA_EXPR is the current representation of the lambda expression. */
9339 static bool
9341 {
9342 /* 5.1.1.4 of the standard says:
9343 If a lambda-expression does not include a lambda-declarator, it is as if
9344 the lambda-declarator were ().
9345 This means an empty parameter list, no attributes, and no exception
9346 specification. */
9352 /* The template-parameter-list is optional, but must begin with
9353 an opening angle if present. */
9355 {
9358 "lambda templates are only available with "
9367 /* We just processed one more parameter list. */
9369 }
9371 /* The parameter-declaration-clause is optional (unless
9372 template-parameter-list was given), but must begin with an
9373 opening parenthesis if present. */
9375 {
9380 /* Parse parameters. */
9383 /* Default arguments shall not be specified in the
9384 parameter-declaration-clause of a lambda-declarator. */
9394 /* Parse optional `mutable' keyword. */
9396 {
9399 }
9401 /* Parse optional exception specification. */
9404 /* Parse optional trailing return type. */
9406 {
9410 }
9412 /* The function parameters must be in scope all the way until after the
9413 trailing-return-type in case of decltype. */
9415 }
9419 /* Create the function call operator.
9421 Messing with declarators like this is no uglier than building up the
9422 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9423 other code. */
9424 {
9425 cp_decl_specifier_seq return_type_specs;
9427 tree fco;
9434 else
9435 /* Maybe we will deduce the return type later. */
9441 sfk_none);
9446 VIRT_SPEC_UNSPECIFIED,
9447 REF_QUAL_NONE,
9448 exception_spec,
9453 declarator,
9454 attributes);
9456 {
9459 /* Give the object parameter a different name. */
9463 }
9465 {
9469 }
9478 }
9479 }
9481 /* Parse the body of a lambda expression, which is simply
9483 compound-statement
9485 but which requires special handling.
9486 LAMBDA_EXPR is the current representation of the lambda expression. */
9488 static void
9490 {
9495 else
9496 /* Still increment function_depth so that we don't GC in the
9497 middle of an expression. */
9499 /* Clear this in case we're in the middle of a default argument. */
9502 /* Finish the function call operator
9503 - class_specifier
9504 + late_parsing_for_member
9505 + function_definition_after_declarator
9506 + ctor_initializer_opt_and_function_body */
9507 {
9509 tree body;
9511 tree compound_stmt;
9512 tree cap;
9514 /* Let the front end know that we are going to be defining this
9515 function. */
9517 NULL_TREE,
9526 /* Push the proxies for any explicit captures. */
9533 /* 5.1.1.4 of the standard says:
9534 If a lambda-expression does not include a trailing-return-type, it
9535 is as if the trailing-return-type denotes the following type:
9536 * if the compound-statement is of the form
9537 { return attribute-specifier [opt] expression ; }
9538 the type of the returned expression after lvalue-to-rvalue
9539 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9540 (_conv.array_ 4.2), and function-to-pointer conversion
9541 (_conv.func_ 4.3);
9542 * otherwise, void. */
9544 /* In a lambda that has neither a lambda-return-type-clause
9545 nor a deducible form, errors should be reported for return statements
9546 in the body. Since we used void as the placeholder return type, parsing
9547 the body as usual will give such desired behavior. */
9551 {
9555 /* Parse tentatively in case there's more after the initial return
9556 statement. */
9567 {
9571 /* Will get error here if type not deduced yet. */
9575 }
9576 }
9579 {
9584 }
9588 out:
9592 /* Finish the function and generate code for it if necessary. */
9595 /* Only expand if the call op is not a template. */
9598 }
9603 else
9605 }
9607 /* Statements [gram.stmt.stmt] */
9609 /* Parse a statement.
9611 statement:
9612 labeled-statement
9613 expression-statement
9614 compound-statement
9615 selection-statement
9616 iteration-statement
9617 jump-statement
9618 declaration-statement
9619 try-block
9621 C++11:
9623 statement:
9624 labeled-statement
9625 attribute-specifier-seq (opt) expression-statement
9626 attribute-specifier-seq (opt) compound-statement
9627 attribute-specifier-seq (opt) selection-statement
9628 attribute-specifier-seq (opt) iteration-statement
9629 attribute-specifier-seq (opt) jump-statement
9630 declaration-statement
9631 attribute-specifier-seq (opt) try-block
9633 TM Extension:
9635 statement:
9636 atomic-statement
9638 IN_COMPOUND is true when the statement is nested inside a
9639 cp_parser_compound_statement; this matters for certain pragmas.
9641 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9642 is a (possibly labeled) if statement which is not enclosed in braces
9643 and has an else clause. This is used to implement -Wparentheses. */
9645 static void
9648 {
9653 restart:
9656 /* There is no statement yet. */
9662 /* In obj-c++, seeing '[[' might be the either the beginning of
9663 c++11 attributes, or a nested objc-message-expression. So
9664 let's parse the c++11 attributes tentatively. */
9668 {
9671 }
9673 /* Peek at the next token. */
9675 /* Remember the location of the first token in the statement. */
9677 /* If this is a keyword, then that will often determine what kind of
9678 statement we have. */
9680 {
9684 {
9687 /* Looks like a labeled-statement with a case label.
9688 Parse the label, and then use tail recursion to parse
9689 the statement. */
9706 {
9711 }
9712 else
9726 {
9731 }
9732 else
9733 {
9737 }
9741 /* Objective-C++ exception-handling constructs. */
9755 /* This must be a namespace alias definition. */
9768 /* It might be a keyword like `int' that can start a
9769 declaration-statement. */
9771 }
9772 }
9774 {
9775 /* If the next token is a `:', then we are looking at a
9776 labeled-statement. */
9779 {
9780 /* Looks like a labeled-statement with an ordinary label.
9781 Parse the label, and then use tail recursion to parse
9782 the statement. */
9786 }
9787 }
9788 /* Anything that starts with a `{' must be a compound-statement. */
9791 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9792 a statement all its own. */
9794 {
9795 /* Only certain OpenMP pragmas are attached to statements, and thus
9796 are considered statements themselves. All others are not. In
9797 the context of a compound, accept the pragma as a "statement" and
9798 return so that we can check for a close brace. Otherwise we
9799 require a real statement and must go back and read one. */
9805 }
9807 {
9810 }
9812 /* Everything else must be a declaration-statement or an
9813 expression-statement. Try for the declaration-statement
9814 first, unless we are looking at a `;', in which case we know that
9815 we have an expression-statement. */
9817 {
9819 {
9821 {
9822 /* Attributes should be parsed as part of the the
9823 declaration, so let's un-parse them. */
9826 }
9829 /* Try to parse the declaration-statement. */
9831 /* If that worked, we're done. */
9834 }
9835 /* Look for an expression-statement instead. */
9837 }
9839 /* Set the line number for the statement. */
9843 /* Note that for now, we don't do anything with c++11 statements
9844 parsed at this level. */
9847 OPT_Wattributes,
9849 }
9851 /* Parse the label for a labeled-statement, i.e.
9853 identifier :
9854 case constant-expression :
9855 default :
9857 GNU Extension:
9858 case constant-expression ... constant-expression : statement
9860 When a label is parsed without errors, the label is added to the
9861 parse tree by the finish_* functions, so this function doesn't
9862 have to return the label. */
9864 static void
9866 {
9871 /* The next token should be an identifier. */
9875 {
9878 }
9882 {
9884 {
9888 /* Consume the `case' token. */
9890 /* Parse the constant-expression. */
9897 {
9898 /* Consume the `...' token. */
9904 /* We don't need to emit warnings here, as the common code
9905 will do this for us. */
9906 }
9907 else
9912 else
9915 expr);
9916 }
9920 /* Consume the `default' token. */
9925 else
9930 /* Anything else must be an ordinary label. */
9933 }
9935 /* Require the `:' token. */
9938 /* An ordinary label may optionally be followed by attributes.
9939 However, this is only permitted if the attributes are then
9940 followed by a semicolon. This is because, for backward
9941 compatibility, when parsing
9942 lab: __attribute__ ((unused)) int i;
9943 we want the attribute to attach to "i", not "lab". */
9946 {
9947 tree attrs;
9954 ;
9955 else
9957 }
9963 }
9965 /* Parse an expression-statement.
9967 expression-statement:
9968 expression [opt] ;
9970 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9971 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9972 indicates whether this expression-statement is part of an
9973 expression statement. */
9975 static tree
9977 {
9981 /* If the next token is a ';', then there is no expression
9982 statement. */
9984 {
9988 {
9991 }
9992 }
9994 /* Give a helpful message for "A<T>::type t;" and the like. */
9997 {
10004 {
10005 /* A::A a; */
10010 }
10011 }
10013 /* Consume the final `;'. */
10018 /* This is the final expression statement of a statement
10019 expression. */
10025 }
10027 /* Parse a compound-statement.
10029 compound-statement:
10030 { statement-seq [opt] }
10032 GNU extension:
10034 compound-statement:
10035 { label-declaration-seq [opt] statement-seq [opt] }
10037 label-declaration-seq:
10038 label-declaration
10039 label-declaration-seq label-declaration
10041 Returns a tree representing the statement. */
10043 static tree
10046 {
10047 tree compound_stmt;
10049 /* Consume the `{'. */
10056 /* Begin the compound-statement. */
10058 /* If the next keyword is `__label__' we have a label declaration. */
10061 /* Parse an (optional) statement-seq. */
10063 /* Finish the compound-statement. */
10065 /* Consume the `}'. */
10069 }
10071 /* Parse an (optional) statement-seq.
10073 statement-seq:
10074 statement
10075 statement-seq [opt] statement */
10077 static void
10079 {
10080 /* Scan statements until there aren't any more. */
10082 {
10085 /* If we are looking at a `}', then we have run out of
10086 statements; the same is true if we have reached the end
10087 of file, or have stumbled upon a stray '@end'. */
10094 /* If we are in a compound statement and find 'else' then
10095 something went wrong. */
10097 {
10100 else
10101 {
10104 }
10105 }
10107 /* Parse the statement. */
10109 }
10110 }
10112 /* Parse a selection-statement.
10114 selection-statement:
10115 if ( condition ) statement
10116 if ( condition ) statement else statement
10117 switch ( condition ) statement
10119 Returns the new IF_STMT or SWITCH_STMT.
10121 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10122 is a (possibly labeled) if statement which is not enclosed in
10123 braces and has an else clause. This is used to implement
10124 -Wparentheses. */
10126 static tree
10128 {
10135 /* Peek at the next token. */
10138 /* See what kind of keyword it is. */
10141 {
10144 {
10145 tree statement;
10146 tree condition;
10148 /* Look for the `('. */
10150 {
10153 }
10155 /* Begin the selection-statement. */
10158 else
10161 /* Parse the condition. */
10163 /* Look for the `)'. */
10169 {
10173 /* Add the condition. */
10176 /* Parse the then-clause. */
10180 {
10188 }
10189 else
10195 /* If the next token is `else', parse the else-clause. */
10197 RID_ELSE))
10198 {
10199 /* Consume the `else' keyword. */
10202 /* Parse the else-clause. */
10204 {
10205 location_t loc;
10212 }
10213 else
10218 /* If we are currently parsing a then-clause, then
10219 IF_P will not be NULL. We set it to true to
10220 indicate that this if statement has an else clause.
10221 This may trigger the Wparentheses warning below
10222 when we get back up to the parent if statement. */
10225 }
10226 else
10227 {
10228 /* This if statement does not have an else clause. If
10229 NESTED_IF is true, then the then-clause is an if
10230 statement which does have an else clause. We warn
10231 about the potential ambiguity. */
10234 "suggest explicit braces to avoid ambiguous"
10236 }
10238 /* Now we're all done with the if-statement. */
10240 }
10241 else
10242 {
10246 /* Add the condition. */
10249 /* Parse the body of the switch-statement. */
10258 /* Now we're all done with the switch-statement. */
10260 }
10263 }
10269 }
10270 }
10272 /* Parse a condition.
10274 condition:
10275 expression
10276 type-specifier-seq declarator = initializer-clause
10277 type-specifier-seq declarator braced-init-list
10279 GNU Extension:
10281 condition:
10282 type-specifier-seq declarator asm-specification [opt]
10283 attributes [opt] = assignment-expression
10285 Returns the expression that should be tested. */
10287 static tree
10289 {
10290 cp_decl_specifier_seq type_specifiers;
10294 /* Try the declaration first. */
10296 /* New types are not allowed in the type-specifier-seq for a
10297 condition. */
10299 parser->type_definition_forbidden_message
10301 /* Parse the type-specifier-seq. */
10303 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10306 /* Restore the saved message. */
10308 /* If all is well, we might be looking at a declaration. */
10310 {
10311 tree decl;
10312 tree asm_specification;
10313 tree attributes;
10317 /* Parse the declarator. */
10323 /* Parse the attributes. */
10325 /* Parse the asm-specification. */
10327 /* If the next token is not an `=' or '{', then we might still be
10328 looking at an expression. For example:
10330 if (A(a).x)
10332 looks like a decl-specifier-seq and a declarator -- but then
10333 there is no `=', so this is an expression. */
10338 /* If we did see an `=' or '{', then we are looking at a declaration
10339 for sure. */
10341 {
10342 tree pushed_scope;
10346 /* Create the declaration. */
10352 /* Parse the initializer. */
10354 {
10358 }
10359 else
10360 {
10361 /* Consume the `='. */
10364 }
10368 /* Process the initializer. */
10371 asm_specification,
10372 flags);
10378 }
10379 }
10380 /* If we didn't even get past the declarator successfully, we are
10381 definitely not looking at a declaration. */
10382 else
10385 /* Otherwise, we are looking at an expression. */
10387 }
10389 /* Parses a for-statement or range-for-statement until the closing ')',
10390 not included. */
10392 static tree
10394 {
10398 /* Begin the for-statement. */
10401 /* Parse the initialization. */
10406 else
10408 }
10410 static tree
10412 {
10413 /* Normal for loop */
10416 tree stmt;
10419 /* The for-init-statement has already been parsed in
10420 cp_parser_for_init_statement, so no work is needed here. */
10423 /* If there's a condition, process it. */
10427 {
10431 }
10433 /* Look for the `;'. */
10436 /* If there's an expression, process it. */
10442 }
10444 /* Tries to parse a range-based for-statement:
10446 range-based-for:
10447 decl-specifier-seq declarator : expression
10449 The decl-specifier-seq declarator and the `:' are already parsed by
10450 cp_parser_for_init_statement. If processing_template_decl it returns a
10451 newly created RANGE_FOR_STMT; if not, it is converted to a
10452 regular FOR_STMT. */
10454 static tree
10457 {
10461 {
10464 }
10465 else
10468 /* If in template, STMT is converted to a normal for-statement
10469 at instantiation. If not, it is done just ahead. */
10471 {
10479 /* do_auto_deduction doesn't mess with template init-lists. */
10482 }
10483 else
10484 {
10487 }
10489 }
10491 /* Subroutine of cp_convert_range_for: given the initializer expression,
10492 builds up the range temporary. */
10494 static tree
10496 {
10499 /* Find out the type deduced by the declaration
10500 `auto &&__range = range_expr'. */
10505 /* Create the __range variable. */
10512 }
10514 /* Used by cp_parser_range_for in template context: we aren't going to
10515 do a full conversion yet, but we still need to resolve auto in the
10516 type of the for-range-declaration if present. This is basically
10517 a shortcut version of cp_convert_range_for. */
10519 static void
10521 {
10524 {
10527 iter_type = (cp_parser_perform_range_for_lookup
10530 {
10532 iter_type);
10534 tf_warning_or_error);
10537 }
10538 }
10539 }
10541 /* Converts a range-based for-statement into a normal
10542 for-statement, as per the definition.
10544 for (RANGE_DECL : RANGE_EXPR)
10545 BLOCK
10547 should be equivalent to:
10549 {
10550 auto &&__range = RANGE_EXPR;
10551 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10552 __begin != __end;
10553 ++__begin)
10554 {
10555 RANGE_DECL = *__begin;
10556 BLOCK
10557 }
10558 }
10560 If RANGE_EXPR is an array:
10561 BEGIN_EXPR = __range
10562 END_EXPR = __range + ARRAY_SIZE(__range)
10563 Else if RANGE_EXPR has a member 'begin' or 'end':
10564 BEGIN_EXPR = __range.begin()
10565 END_EXPR = __range.end()
10566 Else:
10567 BEGIN_EXPR = begin(__range)
10568 END_EXPR = end(__range);
10570 If __range has a member 'begin' but not 'end', or vice versa, we must
10571 still use the second alternative (it will surely fail, however).
10572 When calling begin()/end() in the third alternative we must use
10573 argument dependent lookup, but always considering 'std' as an associated
10574 namespace. */
10576 tree
10579 {
10585 /* If an error happened previously do nothing or else a lot of
10586 unhelpful errors would be issued. */
10588 else
10589 {
10590 tree range_temp;
10594 /* Can't bind a reference to an array of runtime bound. */
10596 else
10597 {
10602 LOOKUP_ONLYCONVERTING);
10604 }
10607 }
10609 /* The new for initialization statement. */
10617 LOOKUP_ONLYCONVERTING);
10626 LOOKUP_ONLYCONVERTING);
10630 /* The new for condition. */
10637 /* The new increment expression. */
10640 tf_warning_or_error);
10643 /* The declaration is initialized with *__begin inside the loop body. */
10646 tf_warning_or_error),
10648 LOOKUP_ONLYCONVERTING);
10651 }
10653 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10654 We need to solve both at the same time because the method used
10655 depends on the existence of members begin or end.
10656 Returns the type deduced for the iterator expression. */
10658 static tree
10660 {
10662 {
10665 }
10668 {
10673 }
10675 {
10676 /* If RANGE is an array, we will use pointer arithmetic. */
10679 range,
10683 }
10684 else
10685 {
10686 /* If it is not an array, we must do a bit of magic. */
10696 tf_warning_or_error);
10699 tf_warning_or_error);
10702 {
10703 /* Use the member functions. */
10706 else
10712 else
10715 }
10716 else
10717 {
10718 /* Use global functions with ADL. */
10725 tf_warning_or_error);
10727 tf_warning_or_error);
10729 tf_warning_or_error);
10731 tf_warning_or_error);
10734 }
10736 /* Last common checks. */
10738 {
10739 /* If one of the expressions is an error do no more checks. */
10742 }
10745 /* Can happen, when, eg, in a template context, Koenig lookup
10746 can't resolve begin/end (c++/58503). */
10748 else
10749 {
10751 /* The unqualified type of the __begin and __end temporaries should
10752 be the same, as required by the multiple auto declaration. */
10758 }
10759 }
10760 }
10762 /* Helper function for cp_parser_perform_range_for_lookup.
10763 Builds a tree for RANGE.IDENTIFIER(). */
10765 static tree
10767 {
10780 tf_warning_or_error);
10783 }
10785 /* Parse an iteration-statement.
10787 iteration-statement:
10788 while ( condition ) statement
10789 do statement while ( expression ) ;
10790 for ( for-init-statement condition [opt] ; expression [opt] )
10791 statement
10793 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10795 static tree
10797 {
10800 tree statement;
10803 /* Peek at the next token. */
10808 /* Remember whether or not we are already within an iteration
10809 statement. */
10812 /* See what kind of keyword it is. */
10815 {
10817 {
10818 tree condition;
10820 /* Begin the while-statement. */
10822 /* Look for the `('. */
10824 /* Parse the condition. */
10827 /* Look for the `)'. */
10829 /* Parse the dependent statement. */
10833 /* We're done with the while-statement. */
10835 }
10839 {
10840 tree expression;
10842 /* Begin the do-statement. */
10844 /* Parse the body of the do-statement. */
10849 /* Look for the `while' keyword. */
10851 /* Look for the `('. */
10853 /* Parse the expression. */
10855 /* We're done with the do-statement. */
10857 /* Look for the `)'. */
10859 /* Look for the `;'. */
10861 }
10865 {
10866 /* Look for the `('. */
10871 /* Look for the `)'. */
10874 /* Parse the body of the for-statement. */
10879 /* We're done with the for-statement. */
10881 }
10888 }
10891 }
10893 /* Parse a for-init-statement or the declarator of a range-based-for.
10894 Returns true if a range-based-for declaration is seen.
10896 for-init-statement:
10897 expression-statement
10898 simple-declaration */
10900 static bool
10902 {
10903 /* If the next token is a `;', then we have an empty
10904 expression-statement. Grammatically, this is also a
10905 simple-declaration, but an invalid one, because it does not
10906 declare anything. Therefore, if we did not handle this case
10907 specially, we would issue an error message about an invalid
10908 declaration. */
10910 {
10916 {
10917 /* N3994 -- for (id : init) ... */
10920 "type-specifier only available with "
10928 }
10930 /* A colon is used in range-based for. */
10933 /* We're going to speculatively look for a declaration, falling back
10934 to an expression, if necessary. */
10936 /* Parse the declaration. */
10939 decl);
10942 {
10943 /* It is a range-for, consume the ':' */
10947 {
10949 "range-based %<for%> loops only available with "
10952 }
10953 }
10954 else
10955 /* The ';' is not consumed yet because we told
10956 cp_parser_simple_declaration not to. */
10961 /* If the tentative parse failed, then we shall need to look for an
10962 expression-statement. */
10963 }
10964 /* If we are here, it is an expression-statement. */
10967 }
10969 /* Parse a jump-statement.
10971 jump-statement:
10972 break ;
10973 continue ;
10974 return expression [opt] ;
10975 return braced-init-list ;
10976 goto identifier ;
10978 GNU extension:
10980 jump-statement:
10981 goto * expression ;
10983 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10985 static tree
10987 {
10993 /* Peek at the next token. */
10998 /* See what kind of keyword it is. */
11001 {
11005 {
11025 }
11031 {
11038 /* Fall through. */
11048 }
11053 {
11054 tree expr;
11058 {
11062 }
11065 else
11066 /* If the next token is a `;', then there is no
11067 expression. */
11069 /* Build the return-statement. */
11071 /* Look for the final `;'. */
11073 }
11079 {
11082 }
11084 /* Create the goto-statement. */
11086 {
11087 /* Issue a warning about this use of a GNU extension. */
11089 /* Consume the '*' token. */
11091 /* Parse the dependent expression. */
11093 }
11094 else
11096 /* Look for the final `;'. */
11103 }
11106 }
11108 /* Parse a declaration-statement.
11110 declaration-statement:
11111 block-declaration */
11113 static void
11115 {
11118 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11121 /* Parse the block-declaration. */
11124 /* Free any declarators allocated. */
11126 }
11128 /* Some dependent statements (like `if (cond) statement'), are
11129 implicitly in their own scope. In other words, if the statement is
11130 a single statement (as opposed to a compound-statement), it is
11131 none-the-less treated as if it were enclosed in braces. Any
11132 declarations appearing in the dependent statement are out of scope
11133 after control passes that point. This function parses a statement,
11134 but ensures that is in its own scope, even if it is not a
11135 compound-statement.
11137 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11138 is a (possibly labeled) if statement which is not enclosed in
11139 braces and has an else clause. This is used to implement
11140 -Wparentheses.
11142 Returns the new statement. */
11144 static tree
11146 {
11147 tree statement;
11152 /* Mark if () ; with a special NOP_EXPR. */
11154 {
11158 }
11159 /* if a compound is opened, we simply parse the statement directly. */
11162 /* If the token is not a `{', then we must take special action. */
11163 else
11164 {
11165 /* Create a compound-statement. */
11167 /* Parse the dependent-statement. */
11169 /* Finish the dummy compound-statement. */
11171 }
11173 /* Return the statement. */
11175 }
11177 /* For some dependent statements (like `while (cond) statement'), we
11178 have already created a scope. Therefore, even if the dependent
11179 statement is a compound-statement, we do not want to create another
11180 scope. */
11182 static void
11184 {
11185 /* If the token is a `{', then we must take special action. */
11188 else
11189 {
11190 /* Avoid calling cp_parser_compound_statement, so that we
11191 don't create a new scope. Do everything else by hand. */
11193 /* If the next keyword is `__label__' we have a label declaration. */
11196 /* Parse an (optional) statement-seq. */
11199 }
11200 }
11202 /* Declarations [gram.dcl.dcl] */
11204 /* Parse an optional declaration-sequence.
11206 declaration-seq:
11207 declaration
11208 declaration-seq declaration */
11210 static void
11212 {
11214 {
11225 {
11226 /* A declaration consisting of a single semicolon is
11227 invalid. Allow it unless we're being pedantic. */
11232 }
11234 /* If we're entering or exiting a region that's implicitly
11235 extern "C", modify the lang context appropriately. */
11237 {
11240 }
11242 {
11245 }
11248 {
11249 /* A top-level declaration can consist solely of a #pragma.
11250 A nested declaration cannot, so this is done here and not
11251 in cp_parser_declaration. (A #pragma at block scope is
11252 handled in cp_parser_statement.) */
11255 }
11257 /* Parse the declaration itself. */
11259 }
11260 }
11262 /* Parse a declaration.
11264 declaration:
11265 block-declaration
11266 function-definition
11267 template-declaration
11268 explicit-instantiation
11269 explicit-specialization
11270 linkage-specification
11271 namespace-definition
11273 GNU extension:
11275 declaration:
11276 __extension__ declaration */
11278 static void
11280 {
11281 cp_token token1;
11282 cp_token token2;
11287 /* Check for the `__extension__' keyword. */
11289 {
11290 /* Parse the qualified declaration. */
11292 /* Restore the PEDANTIC flag. */
11296 }
11298 /* Try to figure out what kind of declaration is present. */
11303 else
11304 {
11307 }
11309 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11312 /* If the next token is `extern' and the following token is a string
11313 literal, then we have a linkage specification. */
11317 /* If the next token is `template', then we have either a template
11318 declaration, an explicit instantiation, or an explicit
11319 specialization. */
11321 {
11322 /* `template <>' indicates a template specialization. */
11326 /* `template <' indicates a template declaration. */
11329 /* Anything else must be an explicit instantiation. */
11330 else
11332 }
11333 /* If the next token is `export', then we have a template
11334 declaration. */
11337 /* If the next token is `extern', 'static' or 'inline' and the one
11338 after that is `template', we have a GNU extended explicit
11339 instantiation directive. */
11346 /* If the next token is `namespace', check for a named or unnamed
11347 namespace definition. */
11353 /* An unnamed namespace definition. */
11357 /* An inline (associated) namespace definition. */
11361 /* Objective-C++ declaration/definition. */
11368 /* We must have either a block declaration or a function
11369 definition. */
11370 else
11371 /* Try to parse a block-declaration, or a function-definition. */
11374 /* Free any declarators allocated. */
11376 }
11378 /* Parse a block-declaration.
11380 block-declaration:
11381 simple-declaration
11382 asm-definition
11383 namespace-alias-definition
11384 using-declaration
11385 using-directive
11387 GNU Extension:
11389 block-declaration:
11390 __extension__ block-declaration
11392 C++0x Extension:
11394 block-declaration:
11395 static_assert-declaration
11397 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11398 part of a declaration-statement. */
11400 static void
11403 {
11407 /* Check for the `__extension__' keyword. */
11409 {
11410 /* Parse the qualified declaration. */
11412 /* Restore the PEDANTIC flag. */
11416 }
11418 /* Peek at the next token to figure out which kind of declaration is
11419 present. */
11422 /* If the next keyword is `asm', we have an asm-definition. */
11424 {
11428 }
11429 /* If the next keyword is `namespace', we have a
11430 namespace-alias-definition. */
11433 /* If the next keyword is `using', we have a
11434 using-declaration, a using-directive, or an alias-declaration. */
11436 {
11441 /* If the token after `using' is `namespace', then we have a
11442 using-directive. */
11446 /* If the second token after 'using' is '=', then we have an
11447 alias-declaration. */
11453 /* Otherwise, it's a using-declaration. */
11454 else
11457 }
11458 /* If the next keyword is `__label__' we have a misplaced label
11459 declaration. */
11461 {
11465 /* If the next token is now a `;', consume it. */
11468 }
11469 /* If the next token is `static_assert' we have a static assertion. */
11472 /* Anything else must be a simple-declaration. */
11473 else
11476 }
11478 /* Parse a simple-declaration.
11480 simple-declaration:
11481 decl-specifier-seq [opt] init-declarator-list [opt] ;
11483 init-declarator-list:
11484 init-declarator
11485 init-declarator-list , init-declarator
11487 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11488 function-definition as a simple-declaration.
11490 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11491 parsed declaration if it is an uninitialized single declarator not followed
11492 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11493 if present, will not be consumed. */
11495 static void
11499 {
11500 cp_decl_specifier_seq decl_specifiers;
11509 /* Defer access checks until we know what is being declared; the
11510 checks for names appearing in the decl-specifier-seq should be
11511 done as if we were in the scope of the thing being declared. */
11514 /* Parse the decl-specifier-seq. We have to keep track of whether
11515 or not the decl-specifier-seq declares a named class or
11516 enumeration type, since that is the only case in which the
11517 init-declarator-list is allowed to be empty.
11519 [dcl.dcl]
11521 In a simple-declaration, the optional init-declarator-list can be
11522 omitted only when declaring a class or enumeration, that is when
11523 the decl-specifier-seq contains either a class-specifier, an
11524 elaborated-type-specifier, or an enum-specifier. */
11526 CP_PARSER_FLAGS_OPTIONAL,
11529 /* We no longer need to defer access checks. */
11532 /* In a block scope, a valid declaration must always have a
11533 decl-specifier-seq. By not trying to parse declarators, we can
11534 resolve the declaration/expression ambiguity more quickly. */
11537 {
11540 }
11542 /* If the next two tokens are both identifiers, the code is
11543 erroneous. The usual cause of this situation is code like:
11545 T t;
11547 where "T" should name a type -- but does not. */
11550 {
11551 /* If parsing tentatively, we should commit; we really are
11552 looking at a declaration. */
11554 /* Give up. */
11556 }
11558 /* If we have seen at least one decl-specifier, and the next token
11559 is not a parenthesis, then we must be looking at a declaration.
11560 (After "int (" we might be looking at a functional cast.) */
11567 /* Keep going until we hit the `;' at the end of the simple
11568 declaration. */
11571 CPP_SEMICOLON))
11572 {
11575 tree decl;
11578 {
11579 /* If we are processing next declarator, comma is expected */
11584 {
11588 }
11589 }
11590 else
11593 /* Parse the init-declarator. */
11596 function_definition_allowed_p,
11598 declares_class_or_enum,
11600 maybe_range_for_decl,
11602 /* If an error occurred while parsing tentatively, exit quickly.
11603 (That usually happens when in the body of a function; each
11604 statement is treated as a declaration-statement until proven
11605 otherwise.) */
11608 /* Handle function definitions specially. */
11610 {
11611 /* If the next token is a `,', then we are probably
11612 processing something like:
11614 void f() {}, *p;
11616 which is erroneous. */
11618 {
11621 "mixing"
11623 }
11624 /* Otherwise, we're done with the list of declarators. */
11625 else
11626 {
11629 }
11630 }
11633 /* The next token should be either a `,' or a `;'. */
11635 /* If it's a `,', there are more declarators to come. */
11638 /* If it's a `;', we are done. */
11641 /* Anything else is an error. */
11642 else
11643 {
11644 /* If we have already issued an error message we don't need
11645 to issue another one. */
11649 /* Skip tokens until we reach the end of the statement. */
11651 /* If the next token is now a `;', consume it. */
11655 }
11656 /* After the first time around, a function-definition is not
11657 allowed -- even if it was OK at first. For example:
11659 int i, f() {}
11661 is not valid. */
11663 }
11665 /* Issue an error message if no declarators are present, and the
11666 decl-specifier-seq does not itself declare a class or
11667 enumeration: [dcl.dcl]/3. */
11669 {
11671 {
11675 /* Ensure an error is issued anyway when finish_decltype_type,
11676 called via cp_parser_decl_specifier_seq, returns a class or
11677 an enumeration (c++/51786). */
11680 }
11681 /* Perform any deferred access checks. */
11683 }
11685 /* Consume the `;'. */
11689 {
11695 }
11697 done:
11699 }
11701 /* Parse a decl-specifier-seq.
11703 decl-specifier-seq:
11704 decl-specifier-seq [opt] decl-specifier
11705 decl-specifier attribute-specifier-seq [opt] (C++11)
11707 decl-specifier:
11708 storage-class-specifier
11709 type-specifier
11710 function-specifier
11711 friend
11712 typedef
11714 GNU Extension:
11716 decl-specifier:
11717 attributes
11719 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11721 The parser flags FLAGS is used to control type-specifier parsing.
11723 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11724 flags:
11726 1: one of the decl-specifiers is an elaborated-type-specifier
11727 (i.e., a type declaration)
11728 2: one of the decl-specifiers is an enum-specifier or a
11729 class-specifier (i.e., a type definition)
11731 */
11733 static void
11735 cp_parser_flags flags,
11738 {
11742 cp_decl_spec ds;
11744 /* Clear DECL_SPECS. */
11747 /* Assume no class or enumeration type is declared. */
11750 /* Keep reading specifiers until there are no more to read. */
11752 {
11757 /* Peek at the next token. */
11760 /* Save the first token of the decl spec list for error
11761 reporting. */
11764 /* Handle attributes. */
11766 {
11767 /* Parse the attributes. */
11770 /* In a sequence of declaration specifiers, c++11 attributes
11771 appertain to the type that precede them. In that case
11772 [dcl.spec]/1 says:
11774 The attribute-specifier-seq affects the type only for
11775 the declaration it appears in, not other declarations
11776 involving the same type.
11778 But for now let's force the user to position the
11779 attribute either at the beginning of the declaration or
11780 after the declarator-id, which would clearly mean that it
11781 applies to the declarator. */
11783 {
11785 /* The c++11 attribute is at the beginning of the
11786 declaration. It appertains to the entity being
11788 else
11789 {
11791 {
11792 /* This is an attribute following a
11793 class-specifier. */
11798 }
11799 else
11800 {
11801 decl_specs->std_attributes
11803 attrs);
11806 }
11808 }
11809 }
11811 decl_specs->attributes
11813 attrs);
11817 }
11818 /* Assume we will find a decl-specifier keyword. */
11820 /* If the next token is an appropriate keyword, we can simply
11821 add it to the list. */
11823 {
11824 /* decl-specifier:
11825 friend
11826 constexpr */
11829 {
11832 }
11833 else
11834 {
11836 /* Consume the token. */
11838 }
11846 /* function-specifier:
11847 inline
11848 virtual
11849 explicit */
11856 /* decl-specifier:
11857 typedef */
11860 /* Consume the token. */
11862 /* A constructor declarator cannot appear in a typedef. */
11864 /* The "typedef" keyword can only occur in a declaration; we
11865 may as well commit at this point. */
11872 /* storage-class-specifier:
11873 auto
11874 register
11875 static
11876 extern
11877 mutable
11879 GNU Extension:
11880 thread */
11883 {
11884 /* Consume the token. */
11887 /* Complain about `auto' as a storage specifier, if
11888 we're complaining about C++0x compatibility. */
11892 /* Set the storage class anyway. */
11894 token);
11895 }
11896 else
11897 /* C++0x auto type-specifier. */
11905 /* Consume the token. */
11908 token);
11911 /* Consume the token. */
11917 /* We did not yet find a decl-specifier yet. */
11920 }
11930 /* Constructors are a special case. The `S' in `S()' is not a
11931 decl-specifier; it is the beginning of the declarator. */
11932 constructor_p
11933 = (!found_decl_spec
11934 && constructor_possible_p
11935 && (cp_parser_constructor_declarator_p
11938 /* If we don't have a DECL_SPEC yet, then we must be looking at
11939 a type-specifier. */
11941 {
11944 tree type_spec;
11946 type_spec
11948 decl_specs,
11954 /* If this type-specifier referenced a user-defined type
11955 (a typedef, class-name, etc.), then we can't allow any
11956 more such type-specifiers henceforth.
11958 [dcl.spec]
11960 The longest sequence of decl-specifiers that could
11961 possibly be a type name is taken as the
11962 decl-specifier-seq of a declaration. The sequence shall
11963 be self-consistent as described below.
11965 [dcl.type]
11967 As a general rule, at most one type-specifier is allowed
11968 in the complete decl-specifier-seq of a declaration. The
11969 only exceptions are the following:
11971 -- const or volatile can be combined with any other
11972 type-specifier.
11974 -- signed or unsigned can be combined with char, long,
11975 short, or int.
11977 -- ..
11979 Example:
11981 typedef char* Pc;
11982 void g (const int Pc);
11984 Here, Pc is *not* part of the decl-specifier seq; it's
11985 the declarator. Therefore, once we see a type-specifier
11986 (other than a cv-qualifier), we forbid any additional
11987 user-defined types. We *do* still allow things like `int
11988 int' to be considered a decl-specifier-seq, and issue the
11989 error message later. */
11992 /* A constructor declarator cannot follow a type-specifier. */
11994 {
11999 }
12000 }
12002 /* If we still do not have a DECL_SPEC, then there are no more
12003 decl-specifiers. */
12008 /* After we see one decl-specifier, further decl-specifiers are
12009 always optional. */
12011 }
12013 /* Don't allow a friend specifier with a class definition. */
12018 }
12020 /* Parse an (optional) storage-class-specifier.
12022 storage-class-specifier:
12023 auto
12024 register
12025 static
12026 extern
12027 mutable
12029 GNU Extension:
12031 storage-class-specifier:
12032 thread
12034 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12036 static tree
12038 {
12040 {
12044 /* Fall through for C++98. */
12051 /* Consume the token. */
12056 }
12057 }
12059 /* Parse an (optional) function-specifier.
12061 function-specifier:
12062 inline
12063 virtual
12064 explicit
12066 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12067 Updates DECL_SPECS, if it is non-NULL. */
12069 static tree
12072 {
12075 {
12081 /* 14.5.2.3 [temp.mem]
12083 A member function template shall not be virtual. */
12086 else
12096 }
12098 /* Consume the token. */
12100 }
12102 /* Parse a linkage-specification.
12104 linkage-specification:
12105 extern string-literal { declaration-seq [opt] }
12106 extern string-literal declaration */
12108 static void
12110 {
12111 tree linkage;
12113 /* Look for the `extern' keyword. */
12116 /* Look for the string-literal. */
12119 /* Transform the literal into an identifier. If the literal is a
12120 wide-character string, or contains embedded NULs, then we can't
12121 handle it as the user wants. */
12124 {
12126 /* Assume C++ linkage. */
12128 }
12129 else
12132 /* We're now using the new linkage. */
12135 /* If the next token is a `{', then we're using the first
12136 production. */
12138 {
12141 /* Consume the `{' token. */
12143 /* Parse the declarations. */
12145 /* Look for the closing `}'. */
12147 }
12148 /* Otherwise, there's just one declaration. */
12149 else
12150 {
12153 saved_in_unbraced_linkage_specification_p
12157 parser->in_unbraced_linkage_specification_p
12159 }
12161 /* We're done with the linkage-specification. */
12163 }
12165 /* Parse a static_assert-declaration.
12167 static_assert-declaration:
12168 static_assert ( constant-expression , string-literal ) ;
12170 If MEMBER_P, this static_assert is a class member. */
12172 static void
12174 {
12175 tree condition;
12176 tree message;
12178 location_t saved_loc;
12181 /* Peek at the `static_assert' token so we can keep track of exactly
12182 where the static assertion started. */
12186 /* Look for the `static_assert' keyword. */
12188 RT_STATIC_ASSERT))
12191 /* We know we are in a static assertion; commit to any tentative
12192 parse. */
12196 /* Parse the `(' starting the static assertion condition. */
12199 /* Parse the constant-expression. Allow a non-constant expression
12200 here in order to give better diagnostics in finish_static_assert. */
12201 condition =
12206 /* Parse the separating `,'. */
12209 /* Parse the string-literal message. */
12214 /* A `)' completes the static assertion. */
12221 /* A semicolon terminates the declaration. */
12224 /* Complete the static assertion, which may mean either processing
12225 the static assert now or saving it for template instantiation. */
12227 }
12229 /* Parse the expression in decltype ( expression ). */
12231 static tree
12234 {
12236 tree expr;
12238 /* First, try parsing an id-expression. */
12249 {
12252 cp_id_kind idk;
12256 /* Lookup the name we got back from the id-expression. */
12266 {
12267 /* Complete lookup of the id-expression. */
12268 expr = (finish_id_expression
12281 /* We found an id-expression, but it was something that we
12282 should not have found. This is an error, not something
12283 we can recover from, so note that we found an
12284 id-expression and we'll recover as gracefully as
12285 possible. */
12287 }
12292 /* We have an id-expression. */
12294 }
12297 {
12298 /* Abort the id-expression parse. */
12301 /* Parsing tentatively, again. */
12304 /* Parse a class member access. */
12312 /* We have an id-expression. */
12314 }
12317 /* We have parsed the complete id-expression or member access. */
12319 else
12320 {
12321 /* Abort our attempt to parse an id-expression or member access
12322 expression. */
12325 /* Parse a full expression. */
12328 }
12331 }
12333 /* Parse a `decltype' type. Returns the type.
12335 simple-type-specifier:
12336 decltype ( expression )
12337 C++14 proposal:
12338 decltype ( auto ) */
12340 static tree
12342 {
12343 tree expr;
12352 {
12353 /* Already parsed. */
12356 }
12358 /* Look for the `decltype' token. */
12362 /* Parse the opening `('. */
12366 /* decltype (auto) */
12369 {
12376 }
12378 /* Types cannot be defined in a `decltype' expression. Save away the
12379 old message. */
12382 /* And create the new one. */
12383 parser->type_definition_forbidden_message
12386 /* The restrictions on constant-expressions do not apply inside
12387 decltype expressions. */
12388 saved_integral_constant_expression_p
12390 saved_non_integral_constant_expression_p
12394 /* Within a parenthesized expression, a `>' token is always
12395 the greater-than operator. */
12396 saved_greater_than_is_operator_p
12400 /* Do not actually evaluate the expression. */
12403 /* Do not warn about problems with the expression. */
12408 /* Go back to evaluating expressions. */
12412 /* The `>' token might be the end of a template-id or
12413 template-parameter-list now. */
12414 parser->greater_than_is_operator_p
12417 /* Restore the old message and the integral constant expression
12418 flags. */
12420 parser->integral_constant_expression_p
12422 parser->non_integral_constant_expression_p
12425 /* Parse to the closing `)'. */
12427 {
12431 }
12434 tf_warning_or_error);
12436 rewrite:
12437 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12438 it again. */
12445 }
12447 /* Special member functions [gram.special] */
12449 /* Parse a conversion-function-id.
12451 conversion-function-id:
12452 operator conversion-type-id
12454 Returns an IDENTIFIER_NODE representing the operator. */
12456 static tree
12458 {
12459 tree type;
12460 tree saved_scope;
12461 tree saved_qualifying_scope;
12462 tree saved_object_scope;
12465 /* Look for the `operator' token. */
12468 /* When we parse the conversion-type-id, the current scope will be
12469 reset. However, we need that information in able to look up the
12470 conversion function later, so we save it here. */
12474 /* We must enter the scope of the class so that the names of
12475 entities declared within the class are available in the
12476 conversion-type-id. For example, consider:
12478 struct S {
12479 typedef int I;
12480 operator I();
12481 };
12483 S::operator I() { ... }
12485 In order to see that `I' is a type-name in the definition, we
12486 must be in the scope of `S'. */
12489 /* Parse the conversion-type-id. */
12491 /* Leave the scope of the class, if any. */
12494 /* Restore the saved scope. */
12498 /* If the TYPE is invalid, indicate failure. */
12502 }
12504 /* Parse a conversion-type-id:
12506 conversion-type-id:
12507 type-specifier-seq conversion-declarator [opt]
12509 Returns the TYPE specified. */
12511 static tree
12513 {
12514 tree attributes;
12515 cp_decl_specifier_seq type_specifiers;
12517 tree type_specified;
12520 /* Parse the attributes. */
12524 parser->type_definition_forbidden_message
12527 /* Parse the type-specifiers. */
12534 /* If that didn't work, stop. */
12537 /* Parse the conversion-declarator. */
12545 /* Don't give this error when parsing tentatively. This happens to
12546 work because we always parse this definitively once. */
12549 {
12551 {
12554 }
12558 }
12561 }
12563 /* Parse an (optional) conversion-declarator.
12565 conversion-declarator:
12566 ptr-operator conversion-declarator [opt]
12568 */
12572 {
12575 cp_cv_quals cv_quals;
12577 /* We don't know if there's a ptr-operator next, or not. */
12579 /* Try the ptr-operator. */
12582 /* If it worked, look for more conversion-declarators. */
12584 {
12587 /* Parse another optional declarator. */
12590 declarator = cp_parser_make_indirect_declarator
12594 }
12597 }
12599 /* Parse an (optional) ctor-initializer.
12601 ctor-initializer:
12602 : mem-initializer-list
12604 Returns TRUE iff the ctor-initializer was actually present. */
12606 static bool
12608 {
12609 /* If the next token is not a `:', then there is no
12610 ctor-initializer. */
12612 {
12613 /* Do default initialization of any bases and members. */
12618 }
12620 /* Consume the `:' token. */
12622 /* And the mem-initializer-list. */
12626 }
12628 /* Parse a mem-initializer-list.
12630 mem-initializer-list:
12631 mem-initializer ... [opt]
12632 mem-initializer ... [opt] , mem-initializer-list */
12634 static void
12636 {
12641 /* Let the semantic analysis code know that we are starting the
12642 mem-initializer-list. */
12647 /* Loop through the list. */
12649 {
12650 tree mem_initializer;
12653 /* Parse the mem-initializer. */
12655 /* If the next token is a `...', we're expanding member initializers. */
12657 {
12658 /* Consume the `...'. */
12661 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12662 can be expanded but members cannot. */
12665 {
12670 }
12672 /* Construct the pack expansion type. */
12675 }
12678 {
12682 }
12683 /* Look for a target constructor. */
12687 {
12690 {
12694 }
12696 }
12697 /* Add it to the list, unless it was erroneous. */
12699 {
12702 }
12703 /* If the next token is not a `,', we're done. */
12706 /* Consume the `,' token. */
12708 }
12710 /* Perform semantic analysis. */
12713 }
12715 /* Parse a mem-initializer.
12717 mem-initializer:
12718 mem-initializer-id ( expression-list [opt] )
12719 mem-initializer-id braced-init-list
12721 GNU extension:
12723 mem-initializer:
12724 ( expression-list [opt] )
12726 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12727 class) or FIELD_DECL (for a non-static data member) to initialize;
12728 the TREE_VALUE is the expression-list. An empty initialization
12729 list is represented by void_list_node. */
12731 static tree
12733 {
12734 tree mem_initializer_id;
12735 tree expression_list;
12736 tree member;
12739 /* Find out what is being initialized. */
12741 {
12745 }
12746 else
12747 {
12751 }
12757 {
12764 }
12765 else
12766 {
12776 }
12786 }
12788 /* Parse a mem-initializer-id.
12790 mem-initializer-id:
12791 :: [opt] nested-name-specifier [opt] class-name
12792 identifier
12794 Returns a TYPE indicating the class to be initializer for the first
12795 production. Returns an IDENTIFIER_NODE indicating the data member
12796 to be initialized for the second production. */
12798 static tree
12800 {
12804 tree id;
12808 /* `typename' is not allowed in this context ([temp.res]). */
12810 {
12812 "keyword %<typename%> not allowed in this context (a qualified "
12815 }
12816 /* Look for the optional `::' operator. */
12817 global_scope_p
12821 /* Look for the optional nested-name-specifier. The simplest way to
12822 implement:
12824 [temp.res]
12826 The keyword `typename' is not permitted in a base-specifier or
12827 mem-initializer; in these contexts a qualified name that
12828 depends on a template-parameter is implicitly assumed to be a
12829 type name.
12831 is to assume that we have seen the `typename' keyword at this
12832 point. */
12833 nested_name_specifier_p
12842 /* If there is a `::' operator or a nested-name-specifier, then we
12843 are definitely looking for a class-name. */
12848 typename_type,
12852 /* Otherwise, we could also be looking for an ordinary identifier. */
12854 /* Try a class-name. */
12858 none_type,
12862 /* If we found one, we're done. */
12865 /* Otherwise, look for an ordinary identifier. */
12867 }
12869 /* Overloading [gram.over] */
12871 /* Parse an operator-function-id.
12873 operator-function-id:
12874 operator operator
12876 Returns an IDENTIFIER_NODE for the operator which is a
12877 human-readable spelling of the identifier, e.g., `operator +'. */
12879 static tree
12881 {
12882 /* Look for the `operator' keyword. */
12885 /* And then the name of the operator itself. */
12887 }
12889 /* Return an identifier node for a user-defined literal operator.
12890 The suffix identifier is chained to the operator name identifier. */
12892 static tree
12894 {
12895 tree identifier;
12902 }
12904 /* Parse an operator.
12906 operator:
12907 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12908 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12909 || ++ -- , ->* -> () []
12911 GNU Extensions:
12913 operator:
12914 <? >? <?= >?=
12916 Returns an IDENTIFIER_NODE for the operator which is a
12917 human-readable spelling of the identifier, e.g., `operator +'. */
12919 static tree
12921 {
12926 /* Peek at the next token. */
12928 /* Figure out which operator we have. */
12930 {
12932 {
12935 /* The keyword should be either `new' or `delete'. */
12940 else
12943 /* Consume the `new' or `delete' token. */
12946 /* Peek at the next token. */
12948 /* If it's a `[' token then this is the array variant of the
12949 operator. */
12951 {
12952 /* Consume the `[' token. */
12954 /* Look for the `]' token. */
12958 }
12959 /* Otherwise, we have the non-array variant. */
12960 else
12964 }
13111 /* Consume the `('. */
13113 /* Look for the matching `)'. */
13118 /* Consume the `['. */
13120 /* Look for the matching `]'. */
13135 {
13142 /* Consume the string. */
13148 {
13151 }
13152 else
13153 {
13155 /* Look for the suffix identifier. */
13160 {
13164 }
13165 else
13166 {
13169 }
13170 }
13175 {
13178 }
13181 {
13184 }
13186 {
13189 }
13191 }
13194 /* Anything else is an error. */
13196 }
13198 /* If we have selected an identifier, we need to consume the
13199 operator token. */
13202 /* Otherwise, no valid operator name was present. */
13203 else
13204 {
13207 }
13210 }
13212 /* Parse a template-declaration.
13214 template-declaration:
13215 export [opt] template < template-parameter-list > declaration
13217 If MEMBER_P is TRUE, this template-declaration occurs within a
13218 class-specifier.
13220 The grammar rule given by the standard isn't correct. What
13221 is really meant is:
13223 template-declaration:
13224 export [opt] template-parameter-list-seq
13225 decl-specifier-seq [opt] init-declarator [opt] ;
13226 export [opt] template-parameter-list-seq
13227 function-definition
13229 template-parameter-list-seq:
13230 template-parameter-list-seq [opt]
13231 template < template-parameter-list > */
13233 static void
13235 {
13236 /* Check for `export'. */
13238 {
13239 /* Consume the `export' token. */
13241 /* Warn that we do not support `export'. */
13243 }
13246 }
13248 /* Parse a template-parameter-list.
13250 template-parameter-list:
13251 template-parameter
13252 template-parameter-list , template-parameter
13254 Returns a TREE_LIST. Each node represents a template parameter.
13255 The nodes are connected via their TREE_CHAINs. */
13257 static tree
13259 {
13264 /* The loop below parses the template parms. We first need to know
13265 the total number of template parms to be able to compute proper
13266 canonical types of each dependent type. So after the loop, when
13267 we know the total number of template parms,
13268 end_template_parm_list computes the proper canonical types and
13269 fixes up the dependent types accordingly. */
13271 {
13272 tree parameter;
13275 location_t parm_loc;
13277 /* Parse the template-parameter. */
13282 /* Add it to the list. */
13285 parm_loc,
13286 parameter,
13287 is_non_type,
13288 is_parameter_pack);
13289 else
13290 {
13293 }
13295 /* If the next token is not a `,', we're done. */
13298 /* Otherwise, consume the `,' token. */
13300 }
13303 }
13305 /* Parse a template-parameter.
13307 template-parameter:
13308 type-parameter
13309 parameter-declaration
13311 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13312 the parameter. The TREE_PURPOSE is the default value, if any.
13313 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13314 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13315 set to true iff this parameter is a parameter pack. */
13317 static tree
13320 {
13324 tree parm;
13326 /* Assume it is a type parameter or a template parameter. */
13328 /* Assume it not a parameter pack. */
13330 /* Peek at the next token. */
13332 /* If it is `class' or `template', we have a type-parameter. */
13335 /* If it is `class' or `typename' we do not know yet whether it is a
13336 type parameter or a non-type parameter. Consider:
13338 template <typename T, typename T::X X> ...
13340 or:
13342 template <class C, class D*> ...
13344 Here, the first parameter is a type parameter, and the second is
13345 a non-type parameter. We can tell by looking at the token after
13346 the identifier -- if it is a `,', `=', or `>' then we have a type
13347 parameter. */
13349 {
13350 /* Peek at the token after `class' or `typename'. */
13352 /* If it's an ellipsis, we have a template type parameter
13353 pack. */
13356 /* If it's an identifier, skip it. */
13359 /* Now, see if the token looks like the end of a template
13360 parameter. */
13365 }
13367 /* Otherwise, it is a non-type parameter.
13369 [temp.param]
13371 When parsing a default template-argument for a non-type
13372 template-parameter, the first non-nested `>' is taken as the end
13373 of the template parameter-list rather than a greater-than
13374 operator. */
13376 parameter_declarator
13383 /* If the parameter declaration is marked as a parameter pack, set
13384 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13385 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13386 grokdeclarator. */
13389 {
13392 }
13395 {
13396 /* Can happen in some cases of erroneous input (c++/34892). */
13398 /* Consume the `...' for better error recovery. */
13400 }
13401 /* If the next token is an ellipsis, and we don't already have it
13402 marked as a parameter pack, then we have a parameter pack (that
13403 has no declarator). */
13406 && (declarator_can_be_parameter_pack
13408 {
13409 /* Consume the `...'. */
13414 }
13415 /* We might end up with a pack expansion as the type of the non-type
13416 template parameter, in which case this is a non-type template
13417 parameter pack. */
13420 {
13424 }
13427 {
13428 /* Parameter packs cannot have default arguments. However, a
13429 user may try to do so, so we'll parse them and give an
13430 appropriate diagnostic here. */
13434 /* Find the name of the parameter pack. */
13443 else
13447 /* Parse the default argument, but throw away the result. */
13449 }
13459 }
13461 /* Parse a type-parameter.
13463 type-parameter:
13464 class identifier [opt]
13465 class identifier [opt] = type-id
13466 typename identifier [opt]
13467 typename identifier [opt] = type-id
13468 template < template-parameter-list > class identifier [opt]
13469 template < template-parameter-list > class identifier [opt]
13470 = id-expression
13472 GNU Extension (variadic templates):
13474 type-parameter:
13475 class ... identifier [opt]
13476 typename ... identifier [opt]
13478 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13479 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13480 the declaration of the parameter.
13482 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13484 static tree
13486 {
13488 tree parameter;
13490 /* Look for a keyword to tell us what kind of parameter this is. */
13496 {
13499 {
13500 tree identifier;
13501 tree default_argument;
13503 /* If the next token is an ellipsis, we have a template
13504 argument pack. */
13506 {
13507 /* Consume the `...' token. */
13512 }
13514 /* If the next token is an identifier, then it names the
13515 parameter. */
13518 else
13521 /* Create the parameter. */
13524 /* If the next token is an `=', we have a default argument. */
13526 {
13527 /* Consume the `=' token. */
13529 /* Parse the default-argument. */
13533 /* Template parameter packs cannot have default
13534 arguments. */
13536 {
13539 "template parameter pack %qD cannot have a "
13541 else
13543 "template parameter packs cannot have "
13546 }
13550 }
13551 else
13554 /* Create the combined representation of the parameter and the
13555 default argument. */
13557 }
13561 {
13562 tree identifier;
13563 tree default_argument;
13565 /* Look for the `<'. */
13567 /* Parse the template-parameter-list. */
13569 /* Look for the `>'. */
13571 /* Look for the `class' or 'typename' keywords. */
13573 /* If the next token is an ellipsis, we have a template
13574 argument pack. */
13576 {
13577 /* Consume the `...' token. */
13582 }
13583 /* If the next token is an `=', then there is a
13584 default-argument. If the next token is a `>', we are at
13585 the end of the parameter-list. If the next token is a `,',
13586 then we are at the end of this parameter. */
13590 {
13592 /* Treat invalid names as if the parameter were nameless. */
13595 }
13596 else
13599 /* Create the template parameter. */
13601 identifier);
13603 /* If the next token is an `=', then there is a
13604 default-argument. */
13606 {
13609 /* Consume the `='. */
13611 /* Parse the id-expression. */
13613 /* save token before parsing the id-expression, for error
13614 reporting */
13616 default_argument
13624 /* If the id-expression was a template-id that refers to
13625 a template-class, we already have the declaration here,
13626 so no further lookup is needed. */
13627 ;
13628 else
13629 /* Look up the name. */
13630 default_argument
13632 none_type,
13638 /* See if the default argument is valid. */
13639 default_argument
13642 /* Template parameter packs cannot have default
13643 arguments. */
13645 {
13648 "template parameter pack %qD cannot "
13650 identifier);
13651 else
13655 }
13657 }
13658 else
13661 /* Create the combined representation of the parameter and the
13662 default argument. */
13664 }
13670 }
13673 }
13675 /* Parse a template-id.
13677 template-id:
13678 template-name < template-argument-list [opt] >
13680 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13681 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13682 returned. Otherwise, if the template-name names a function, or set
13683 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13684 names a class, returns a TYPE_DECL for the specialization.
13686 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13687 uninstantiated templates. */
13689 static tree
13695 {
13697 tree templ;
13698 tree arguments;
13699 tree template_id;
13706 /* If the next token corresponds to a template-id, there is no need
13707 to reparse it. */
13710 {
13713 /* Get the stored value. */
13715 /* Perform any access checks that were deferred. */
13718 {
13723 tf_warning_or_error);
13724 }
13725 /* Return the stored value. */
13727 }
13729 /* Avoid performing name lookup if there is no possibility of
13730 finding a template-id. */
13733 && !cp_parser_nth_token_starts_template_argument_list_p
13735 {
13738 }
13740 /* Remember where the template-id starts. */
13746 /* Parse the template-name. */
13749 check_dependency_p,
13750 is_declaration,
13751 tag_type,
13754 {
13757 }
13759 /* If we find the sequence `[:' after a template-name, it's probably
13760 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13761 parse correctly the argument list. */
13768 {
13770 /* Change `:' into `::'. */
13772 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13773 CPP_LESS. */
13776 /* Parse the arguments. */
13779 {
13780 /* If we couldn't parse an argument list, then we revert our changes
13781 and return simply an error. Maybe this is not a template-id
13782 after all. */
13787 }
13788 /* Otherwise, emit an error about the invalid digraph, but continue
13789 parsing because we got our argument list. */
13792 {
13795 "%<<:%> is an alternate spelling for %<[%>."
13798 {
13800 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13803 }
13804 }
13805 }
13806 else
13807 {
13808 /* Look for the `<' that starts the template-argument-list. */
13810 {
13813 }
13814 /* Parse the arguments. */
13816 }
13818 /* Build a representation of the specialization. */
13821 TEMPLATE_ID_EXPR,
13825 {
13827 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13828 template (rather than some instantiation thereof) only if
13829 is not nested within some other construct. For example, in
13830 "template <typename T> void f(T) { A<T>::", A<T> is just an
13831 instantiation of A. */
13834 CPP_SCOPE));
13835 template_id
13837 }
13839 {
13841 }
13842 else
13843 {
13844 /* If it's not a class-template or a template-template, it should be
13845 a function-template. */
13851 }
13853 /* If parsing tentatively, replace the sequence of tokens that makes
13854 up the template-id with a CPP_TEMPLATE_ID token. That way,
13855 should we re-parse the token stream, we will not have to repeat
13856 the effort required to do the parse, nor will we issue duplicate
13857 error messages about problems during instantiation of the
13858 template. */
13860 /* Don't do this if we had a parse error in a declarator; re-parsing
13861 might succeed if a name changes meaning (60361). */
13865 {
13868 /* Reset the contents of the START_OF_ID token. */
13870 /* Retrieve any deferred checks. Do not pop this access checks yet
13871 so the memory will not be reclaimed during token replacing below. */
13877 /* Purge all subsequent tokens. */
13880 /* ??? Can we actually assume that, if template_id ==
13881 error_mark_node, we will have issued a diagnostic to the
13882 user, as opposed to simply marking the tentative parse as
13883 failed? */
13886 }
13890 }
13892 /* Parse a template-name.
13894 template-name:
13895 identifier
13897 The standard should actually say:
13899 template-name:
13900 identifier
13901 operator-function-id
13903 A defect report has been filed about this issue.
13905 A conversion-function-id cannot be a template name because they cannot
13906 be part of a template-id. In fact, looking at this code:
13908 a.operator K<int>()
13910 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13911 It is impossible to call a templated conversion-function-id with an
13912 explicit argument list, since the only allowed template parameter is
13913 the type to which it is converting.
13915 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13916 `template' keyword, in a construction like:
13918 T::template f<3>()
13920 In that case `f' is taken to be a template-name, even though there
13921 is no way of knowing for sure.
13923 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13924 name refers to a set of overloaded functions, at least one of which
13925 is a template, or an IDENTIFIER_NODE with the name of the template,
13926 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13927 names are looked up inside uninstantiated templates. */
13929 static tree
13936 {
13937 tree identifier;
13938 tree decl;
13939 tree fns;
13942 /* If the next token is `operator', then we have either an
13943 operator-function-id or a conversion-function-id. */
13945 {
13946 /* We don't know whether we're looking at an
13947 operator-function-id or a conversion-function-id. */
13949 /* Try an operator-function-id. */
13951 /* If that didn't work, try a conversion-function-id. */
13953 {
13956 }
13957 }
13958 /* Look for the identifier. */
13959 else
13962 /* If we didn't find an identifier, we don't have a template-id. */
13966 /* If the name immediately followed the `template' keyword, then it
13967 is a template-name. However, if the next token is not `<', then
13968 we do not treat it as a template-name, since it is not being used
13969 as part of a template-id. This enables us to handle constructs
13970 like:
13972 template <typename T> struct S { S(); };
13973 template <typename T> S<T>::S();
13975 correctly. We would treat `S' as a template -- if it were `S<T>'
13976 -- but we do not if there is no `<'. */
13980 {
13981 /* In a declaration, in a dependent context, we pretend that the
13982 "template" keyword was present in order to improve error
13983 recovery. For example, given:
13985 template <typename T> void f(T::X<int>);
13987 we want to treat "X<int>" as a template-id. */
13989 && !template_keyword_p
13991 && check_dependency_p
13993 /* Do not do this for dtors (or ctors), since they never
13994 need the template keyword before their name. */
13996 {
13999 /* Explain what went wrong. */
14001 identifier);
14004 /* If parsing tentatively, find the location of the "<" token. */
14007 /* Parse the template arguments so that we can issue error
14008 messages about them. */
14011 /* Skip tokens until we find a good place from which to
14012 continue parsing. */
14017 /* If parsing tentatively, permanently remove the
14018 template argument list. That will prevent duplicate
14019 error messages from being issued about the missing
14020 "template" keyword. */
14026 }
14028 /* If the "template" keyword is present, then there is generally
14029 no point in doing name-lookup, so we just return IDENTIFIER.
14030 But, if the qualifying scope is non-dependent then we can
14031 (and must) do name-lookup normally. */
14037 }
14039 /* Look up the name. */
14041 tag_type,
14044 check_dependency_p,
14048 /* If DECL is a template, then the name was a template-name. */
14050 {
14054 }
14055 else
14056 {
14059 /* The standard does not explicitly indicate whether a name that
14060 names a set of overloaded declarations, some of which are
14061 templates, is a template-name. However, such a name should
14062 be a template-name; otherwise, there is no way to form a
14063 template-id for the overloaded templates. */
14071 {
14072 /* The name does not name a template. */
14075 }
14076 }
14078 /* If DECL is dependent, and refers to a function, then just return
14079 its name; we will look it up again during template instantiation. */
14081 {
14085 }
14088 }
14090 /* Parse a template-argument-list.
14092 template-argument-list:
14093 template-argument ... [opt]
14094 template-argument-list , template-argument ... [opt]
14096 Returns a TREE_VEC containing the arguments. */
14098 static tree
14100 {
14105 tree vec;
14112 /* Even if the template-id appears in an integral
14113 constant-expression, the contents of the argument list do
14114 not. */
14120 /* Parse the arguments. */
14121 do
14122 {
14123 tree argument;
14126 /* Consume the comma. */
14129 /* Parse the template-argument. */
14132 /* If the next token is an ellipsis, we're expanding a template
14133 argument pack. */
14135 {
14137 {
14141 }
14142 /* Consume the `...' token. */
14145 /* Make the argument into a TYPE_PACK_EXPANSION or
14146 EXPR_PACK_EXPANSION. */
14148 }
14151 {
14155 {
14158 }
14159 else
14161 }
14163 }
14176 #ifdef ENABLE_CHECKING
14178 #endif
14180 }
14182 /* Parse a template-argument.
14184 template-argument:
14185 assignment-expression
14186 type-id
14187 id-expression
14189 The representation is that of an assignment-expression, type-id, or
14190 id-expression -- except that the qualified id-expression is
14191 evaluated, so that the value returned is either a DECL or an
14192 OVERLOAD.
14194 Although the standard says "assignment-expression", it forbids
14195 throw-expressions or assignments in the template argument.
14196 Therefore, we use "conditional-expression" instead. */
14198 static tree
14200 {
14201 tree argument;
14207 cp_id_kind idk;
14209 /* There's really no way to know what we're looking at, so we just
14210 try each alternative in order.
14212 [temp.arg]
14214 In a template-argument, an ambiguity between a type-id and an
14215 expression is resolved to a type-id, regardless of the form of
14216 the corresponding template-parameter.
14218 Therefore, we try a type-id first. */
14221 /* If there was no error parsing the type-id but the next token is a
14222 '>>', our behavior depends on which dialect of C++ we're
14223 parsing. In C++98, we probably found a typo for '> >'. But there
14224 are type-id which are also valid expressions. For instance:
14226 struct X { int operator >> (int); };
14227 template <int V> struct Foo {};
14228 Foo<X () >> 5> r;
14230 Here 'X()' is a valid type-id of a function type, but the user just
14231 wanted to write the expression "X() >> 5". Thus, we remember that we
14232 found a valid type-id, but we still try to parse the argument as an
14233 expression to see what happens.
14235 In C++0x, the '>>' will be considered two separate '>'
14236 tokens. */
14240 {
14243 }
14244 else
14245 {
14246 /* If the next token isn't a `,' or a `>', then this argument wasn't
14247 really finished. This means that the argument is not a valid
14248 type-id. */
14251 /* If that worked, we're done. */
14254 }
14255 /* We're still not sure what the argument will be. */
14257 /* Try a template. */
14265 /* If the next token isn't a `,' or a `>', then this argument wasn't
14266 really finished. */
14270 {
14271 /* Figure out what is being referred to. If the id-expression
14272 was for a class template specialization, then we will have a
14273 TYPE_DECL at this point. There is no need to do name lookup
14274 at this point in that case. */
14277 none_type,
14286 }
14288 {
14292 }
14293 /* It must be a non-type argument. There permitted cases are given
14294 in [temp.arg.nontype]:
14296 -- an integral constant-expression of integral or enumeration
14297 type; or
14299 -- the name of a non-type template-parameter; or
14301 -- the name of an object or function with external linkage...
14303 -- the address of an object or function with external linkage...
14305 -- a pointer to member... */
14306 /* Look for a non-type template parameter. */
14308 {
14320 }
14322 /* If the next token is "&", the argument must be the address of an
14323 object or function with external linkage. */
14326 {
14329 }
14330 /* See if we might have an id-expression. */
14337 {
14340 address_p,
14347 else
14348 {
14349 tree probe;
14352 {
14353 /* Strip the dereference temporarily. */
14356 }
14358 /* If we're in a template, we represent a qualified-id referring
14359 to a static data member as a SCOPE_REF even if the scope isn't
14360 dependent so that we can check access control later. */
14365 {
14366 /* A variable without external linkage might still be a
14367 valid constant-expression, so no error is issued here
14368 if the external-linkage check fails. */
14371 }
14373 /* All overloaded functions are allowed; if the external
14374 linkage test does not pass, an error will be issued
14375 later. */
14376 ;
14380 /* A pointer-to-member. */
14381 ;
14383 ;
14384 else
14388 {
14391 tf_warning_or_error);
14392 else
14395 }
14396 }
14397 }
14398 /* If the argument started with "&", there are no other valid
14399 alternatives at this point. */
14401 {
14404 }
14406 /* If the argument wasn't successfully parsed as a type-id followed
14407 by '>>', the argument can only be a constant expression now.
14408 Otherwise, we try parsing the constant-expression tentatively,
14409 because the argument could really be a type-id. */
14420 /* We did our best to parse the argument as a non type-id, but that
14421 was the only alternative that matched (albeit with a '>' after
14422 it). We can assume it's just a typo from the user, and a
14423 diagnostic will then be issued. */
14425 }
14427 /* Parse an explicit-instantiation.
14429 explicit-instantiation:
14430 template declaration
14432 Although the standard says `declaration', what it really means is:
14434 explicit-instantiation:
14435 template decl-specifier-seq [opt] declarator [opt] ;
14437 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14438 supposed to be allowed. A defect report has been filed about this
14439 issue.
14441 GNU Extension:
14443 explicit-instantiation:
14444 storage-class-specifier template
14445 decl-specifier-seq [opt] declarator [opt] ;
14446 function-specifier template
14447 decl-specifier-seq [opt] declarator [opt] ; */
14449 static void
14451 {
14453 cp_decl_specifier_seq decl_specifiers;
14458 /* Look for an (optional) storage-class-specifier or
14459 function-specifier. */
14461 {
14462 extension_specifier
14465 extension_specifier
14468 }
14470 /* Look for the `template' keyword. */
14472 /* Let the front end know that we are processing an explicit
14473 instantiation. */
14475 /* [temp.explicit] says that we are supposed to ignore access
14476 control while processing explicit instantiation directives. */
14478 /* Parse a decl-specifier-seq. */
14480 CP_PARSER_FLAGS_OPTIONAL,
14483 /* If there was exactly one decl-specifier, and it declared a class,
14484 and there's no declarator, then we have an explicit type
14485 instantiation. */
14487 {
14488 tree type;
14492 /* Turn access control back on for names used during
14493 template instantiation. */
14498 }
14499 else
14500 {
14502 tree decl;
14504 /* Parse the declarator. */
14505 declarator
14516 {
14519 "explicit instantiation shall not use"
14523 "explicit instantiation shall not use"
14528 /* Turn access control back on for names used during
14529 template instantiation. */
14531 /* Do the explicit instantiation. */
14533 }
14534 else
14535 {
14537 /* Skip the body of the explicit instantiation. */
14539 }
14540 }
14541 /* We're done with the instantiation. */
14547 }
14549 /* Parse an explicit-specialization.
14551 explicit-specialization:
14552 template < > declaration
14554 Although the standard says `declaration', what it really means is:
14556 explicit-specialization:
14557 template <> decl-specifier [opt] init-declarator [opt] ;
14558 template <> function-definition
14559 template <> explicit-specialization
14560 template <> template-declaration */
14562 static void
14564 {
14568 /* Look for the `template' keyword. */
14570 /* Look for the `<'. */
14572 /* Look for the `>'. */
14574 /* We have processed another parameter list. */
14576 /* [temp]
14578 A template ... explicit specialization ... shall not have C
14579 linkage. */
14581 {
14583 /* Give it C++ linkage to avoid confusing other parts of the
14584 front end. */
14587 }
14588 else
14590 /* Let the front end know that we are beginning a specialization. */
14592 {
14595 }
14597 /* If the next keyword is `template', we need to figure out whether
14598 or not we're looking a template-declaration. */
14600 {
14605 else
14607 }
14608 else
14609 /* Parse the dependent declaration. */
14615 /* We're done with the specialization. */
14617 /* For the erroneous case of a template with C linkage, we pushed an
14618 implicit C++ linkage scope; exit that scope now. */
14621 /* We're done with this parameter list. */
14623 }
14625 /* Parse a type-specifier.
14627 type-specifier:
14628 simple-type-specifier
14629 class-specifier
14630 enum-specifier
14631 elaborated-type-specifier
14632 cv-qualifier
14634 GNU Extension:
14636 type-specifier:
14637 __complex__
14639 Returns a representation of the type-specifier. For a
14640 class-specifier, enum-specifier, or elaborated-type-specifier, a
14641 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14643 The parser flags FLAGS is used to control type-specifier parsing.
14645 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14646 in a decl-specifier-seq.
14648 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14649 class-specifier, enum-specifier, or elaborated-type-specifier, then
14650 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14651 if a type is declared; 2 if it is defined. Otherwise, it is set to
14652 zero.
14654 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14655 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14656 is set to FALSE. */
14658 static tree
14660 cp_parser_flags flags,
14665 {
14671 /* Assume this type-specifier does not declare a new type. */
14674 /* And that it does not specify a cv-qualifier. */
14677 /* Peek at the next token. */
14680 /* If we're looking at a keyword, we can use that to guide the
14681 production we choose. */
14684 {
14689 /* Look for the enum-specifier. */
14691 /* If that worked, we're done. */
14693 {
14698 type_spec,
14699 token,
14702 }
14703 else
14706 /* Any of these indicate either a class-specifier, or an
14707 elaborated-type-specifier. */
14714 /* Parse tentatively so that we can back up if we don't find a
14715 class-specifier. */
14717 /* Look for the class-specifier. */
14720 /* If that worked, we're done. */
14722 {
14727 type_spec,
14728 token,
14731 }
14733 /* Fall through. */
14734 elaborated_type_specifier:
14735 /* We're declaring (not defining) a class or enum. */
14739 /* Fall through. */
14741 /* Look for an elaborated-type-specifier. */
14742 type_spec
14743 = (cp_parser_elaborated_type_specifier
14746 is_declaration));
14749 type_spec,
14750 token,
14773 /* The `__complex__' keyword is a GNU extension. */
14779 }
14781 /* Handle simple keywords. */
14783 {
14785 {
14788 }
14790 }
14792 /* If we do not already have a type-specifier, assume we are looking
14793 at a simple-type-specifier. */
14795 decl_specs,
14796 flags);
14798 /* If we didn't find a type-specifier, and a type-specifier was not
14799 optional in this context, issue an error message. */
14801 {
14804 }
14807 }
14809 /* Parse a simple-type-specifier.
14811 simple-type-specifier:
14812 :: [opt] nested-name-specifier [opt] type-name
14813 :: [opt] nested-name-specifier template template-id
14814 char
14815 wchar_t
14816 bool
14817 short
14818 int
14819 long
14820 signed
14821 unsigned
14822 float
14823 double
14824 void
14826 C++0x Extension:
14828 simple-type-specifier:
14829 auto
14830 decltype ( expression )
14831 char16_t
14832 char32_t
14833 __underlying_type ( type-id )
14835 GNU Extension:
14837 simple-type-specifier:
14838 __int128
14839 __typeof__ unary-expression
14840 __typeof__ ( type-id )
14841 __typeof__ ( type-id ) { initializer-list , [opt] }
14843 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14844 appropriately updated. */
14846 static tree
14849 cp_parser_flags flags)
14850 {
14855 /* Peek at the next token. */
14858 /* If we're looking at a keyword, things are easy. */
14860 {
14895 {
14898 }
14927 {
14930 else
14934 {
14937 "use of %<auto%> in lambda parameter declaration "
14938 "only available with "
14940 }
14943 "use of %<auto%> in parameter declaration "
14944 "only available with "
14946 else
14948 "ISO C++ forbids use of %<auto%> in parameter "
14950 }
14951 else
14956 /* Since DR 743, decltype can either be a simple-type-specifier by
14957 itself or begin a nested-name-specifier. Parsing it will replace
14958 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14959 handling below decide what to do. */
14965 /* Consume the `typeof' token. */
14967 /* Parse the operand to `typeof'. */
14969 /* If it is not already a TYPE, take its type. */
14975 token,
14984 token,
14994 token,
14999 }
15001 /* If token is an already-parsed decltype not followed by ::,
15002 it's a simple-type-specifier. */
15005 {
15008 {
15010 token,
15012 /* Remember that we are handling a decltype in order to
15013 implement the resolution of DR 1510 when the argument
15014 isn't instantiation dependent. */
15016 }
15019 }
15021 /* If the type-specifier was for a built-in type, we're done. */
15023 {
15024 /* Record the type. */
15031 type,
15032 token,
15037 /* Consume the token. */
15043 /* There is no valid C++ program where a non-template type is
15044 followed by a "<". That usually indicates that the user thought
15045 that the type was a template. */
15050 }
15052 /* The type-specifier must be a user-defined type. */
15054 {
15058 /* Don't gobble tokens or issue error messages if this is an
15059 optional type-specifier. */
15063 /* Look for the optional `::' operator. */
15064 global_p
15068 /* Look for the nested-name specifier. */
15069 qualified_p
15077 /* If we have seen a nested-name-specifier, and the next token
15078 is `template', then we are using the template-id production. */
15081 {
15082 /* Look for the template-id. */
15086 none_type,
15088 /* If the template-id did not name a type, we are out of
15089 luck. */
15091 {
15094 }
15095 }
15096 /* Otherwise, look for a type-name. */
15097 else
15099 /* Keep track of all name-lookups performed in class scopes. */
15101 && !global_p
15102 && !qualified_p
15106 /* If it didn't work out, we don't have a TYPE. */
15112 token,
15114 }
15116 /* If we didn't get a type-name, issue an error message. */
15118 {
15121 }
15124 {
15125 /* See if TYPE is an Objective-C type, and if so, parse and
15126 accept any protocol references following it. Do this before
15127 the cp_parser_check_for_invalid_template_id() call, because
15128 Objective-C types can be followed by '<...>' which would
15129 enclose protocol names rather than template arguments, and so
15130 everything is fine. */
15133 {
15137 /* Clobber the "unqualified" type previously entered into
15138 DECL_SPECS with the new, improved protocol-qualified version. */
15143 }
15145 /* There is no valid C++ program where a non-template type is
15146 followed by a "<". That usually indicates that the user
15147 thought that the type was a template. */
15149 none_type,
15151 }
15154 }
15156 /* Parse a type-name.
15158 type-name:
15159 class-name
15160 enum-name
15161 typedef-name
15162 simple-template-id [in c++0x]
15164 enum-name:
15165 identifier
15167 typedef-name:
15168 identifier
15170 Returns a TYPE_DECL for the type. */
15172 static tree
15174 {
15175 tree type_decl;
15177 /* We can't know yet whether it is a class-name or not. */
15179 /* Try a class-name. */
15183 none_type,
15187 /* If it's not a class-name, keep looking. */
15189 {
15191 /* It must be a typedef-name or an enum-name. */
15195 /* It is either a simple-template-id representing an
15196 instantiation of an alias template... */
15200 none_type,
15202 /* Note that this must be an instantiation of an alias template
15203 because [temp.names]/6 says:
15205 A template-id that names an alias template specialization
15206 is a type-name.
15208 Whereas [temp.names]/7 says:
15210 A simple-template-id that names a class template
15211 specialization is a class-name. */
15216 else
15220 /* ... Or a typedef-name or an enum-name. */
15222 }
15225 }
15227 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15229 enum-name:
15230 identifier
15232 typedef-name:
15233 identifier
15235 Returns a TYPE_DECL for the type. */
15237 static tree
15239 {
15240 tree type_decl;
15241 tree identifier;
15248 /* Look up the type-name. */
15255 {
15256 /* See if this is an Objective-C type. */
15261 }
15263 /* Issue an error if we did not find a type-name. */
15265 /* In Objective-C, we have the complication that class names are
15266 normally type names and start declarations (eg, the
15267 "NSObject" in "NSObject *object;"), but can be used in an
15268 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15269 is an expression. So, a classname followed by a dot is not a
15270 valid type-name. */
15273 {
15278 }
15279 /* Remember that the name was used in the definition of the
15280 current class so that we can check later to see if the
15281 meaning would have been different after the class was
15282 entirely defined. */
15288 }
15290 /* Parse an elaborated-type-specifier. Note that the grammar given
15291 here incorporates the resolution to DR68.
15293 elaborated-type-specifier:
15294 class-key :: [opt] nested-name-specifier [opt] identifier
15295 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15296 enum-key :: [opt] nested-name-specifier [opt] identifier
15297 typename :: [opt] nested-name-specifier identifier
15298 typename :: [opt] nested-name-specifier template [opt]
15299 template-id
15301 GNU extension:
15303 elaborated-type-specifier:
15304 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15305 class-key attributes :: [opt] nested-name-specifier [opt]
15306 template [opt] template-id
15307 enum attributes :: [opt] nested-name-specifier [opt] identifier
15309 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15310 declared `friend'. If IS_DECLARATION is TRUE, then this
15311 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15312 something is being declared.
15314 Returns the TYPE specified. */
15316 static tree
15320 {
15322 tree identifier;
15325 tree globalscope;
15328 /* See if we're looking at the `enum' keyword. */
15330 {
15331 /* Consume the `enum' token. */
15333 /* Remember that it's an enumeration type. */
15335 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15336 enums) is used here. */
15339 {
15343 /* Consume the `struct' or `class' and parse it anyway. */
15345 }
15346 /* Parse the attributes. */
15348 }
15349 /* Or, it might be `typename'. */
15351 RID_TYPENAME))
15352 {
15353 /* Consume the `typename' token. */
15355 /* Remember that it's a `typename' type. */
15357 }
15358 /* Otherwise it must be a class-key. */
15359 else
15360 {
15364 /* Parse the attributes. */
15366 }
15368 /* Look for the `::' operator. */
15371 /* Look for the nested-name-specifier. */
15373 {
15378 is_declaration))
15380 }
15381 else
15382 /* Even though `typename' is not present, the proposed resolution
15383 to Core Issue 180 says that in `class A<T>::B', `B' should be
15384 considered a type-name, even if `A<T>' is dependent. */
15389 is_declaration);
15390 /* For everything but enumeration types, consider a template-id.
15391 For an enumeration type, consider only a plain identifier. */
15393 {
15395 tree decl;
15397 /* Allow the `template' keyword. */
15399 /* If we didn't see `template', we don't know if there's a
15400 template-id or not. */
15403 /* Parse the template-id. */
15407 tag_type,
15408 is_declaration);
15409 /* If we didn't find a template-id, look for an ordinary
15410 identifier. */
15412 ;
15413 /* We can get here when cp_parser_template_id, called by
15414 cp_parser_class_name with tag_type == none_type, succeeds
15415 and caches a BASELINK. Then, when called again here,
15416 instead of failing and returning an error_mark_node
15417 returns it (see template/typename17.C in C++11).
15418 ??? Could we diagnose this earlier? */
15420 {
15423 }
15424 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15425 in effect, then we must assume that, upon instantiation, the
15426 template will correspond to a class. */
15430 typename_type,
15432 /* If the `typename' keyword is in effect and DECL is not a type
15433 decl, then type is non existent. */
15435 ;
15441 }
15444 {
15449 {
15452 }
15454 /* For a `typename', we needn't call xref_tag. */
15460 /* Template parameter lists apply only if we are not within a
15461 function parameter list. */
15462 bool template_parm_lists_apply
15471 /* Look up a qualified name in the usual way. */
15473 {
15474 tree decl;
15475 tree ambiguous_decls;
15478 tag_type,
15485 /* If the lookup was ambiguous, an error will already have been
15486 issued. */
15490 /* If we are parsing friend declaration, DECL may be a
15491 TEMPLATE_DECL tree node here. However, we need to check
15492 whether this TEMPLATE_DECL results in valid code. Consider
15493 the following example:
15495 namespace N {
15496 template <class T> class C {};
15497 }
15498 class X {
15499 template <class T> friend class N::C; // #1, valid code
15500 };
15501 template <class T> class Y {
15502 friend class N::C; // #2, invalid code
15503 };
15505 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15506 name lookup of `N::C'. We see that friend declaration must
15507 be template for the code to be valid. Note that
15508 processing_template_decl does not work here since it is
15509 always 1 for the above two cases. */
15511 decl = (cp_parser_maybe_treat_template_as_class
15516 {
15518 identifier,
15521 }
15524 {
15528 allow_template);
15532 }
15534 /* Forward declarations of nested types, such as
15536 class C1::C2;
15537 class C1::C2::C3;
15539 are invalid unless all components preceding the final '::'
15540 are complete. If all enclosing types are complete, these
15541 declarations become merely pointless.
15543 Invalid forward declarations of nested types are errors
15544 caught elsewhere in parsing. Those that are pointless arrive
15545 here. */
15552 }
15553 else
15554 {
15555 /* An elaborated-type-specifier sometimes introduces a new type and
15556 sometimes names an existing type. Normally, the rule is that it
15557 introduces a new type only if there is not an existing type of
15558 the same name already in scope. For example, given:
15560 struct S {};
15561 void f() { struct S s; }
15563 the `struct S' in the body of `f' is the same `struct S' as in
15564 the global scope; the existing definition is used. However, if
15565 there were no global declaration, this would introduce a new
15566 local class named `S'.
15568 An exception to this rule applies to the following code:
15570 namespace N { struct S; }
15572 Here, the elaborated-type-specifier names a new type
15573 unconditionally; even if there is already an `S' in the
15574 containing scope this declaration names a new type.
15575 This exception only applies if the elaborated-type-specifier
15576 forms the complete declaration:
15578 [class.name]
15580 A declaration consisting solely of `class-key identifier ;' is
15581 either a redeclaration of the name in the current scope or a
15582 forward declaration of the identifier as a class name. It
15583 introduces the name into the current scope.
15585 We are in this situation precisely when the next token is a `;'.
15587 An exception to the exception is that a `friend' declaration does
15588 *not* name a new type; i.e., given:
15590 struct S { friend struct T; };
15592 `T' is not a new type in the scope of `S'.
15594 Also, `new struct S' or `sizeof (struct S)' never results in the
15595 definition of a new type; a new type can only be declared in a
15596 declaration context. */
15598 tag_scope ts;
15602 /* Friends have special name lookup rules. */
15606 CPP_SEMICOLON))
15607 /* This is a `class-key identifier ;' */
15609 else
15612 template_p =
15613 (template_parm_lists_apply
15616 /* An unqualified name was used to reference this type, so
15617 there were no qualifying templates. */
15625 }
15626 }
15631 /* Allow attributes on forward declarations of classes. */
15633 {
15643 else
15646 }
15649 {
15650 /* Indicate whether this class was declared as a `class' or as a
15651 `struct'. */
15655 }
15657 /* A "<" cannot follow an elaborated type specifier. If that
15658 happens, the user was probably trying to form a template-id. */
15663 }
15665 /* Parse an enum-specifier.
15667 enum-specifier:
15668 enum-head { enumerator-list [opt] }
15669 enum-head { enumerator-list , } [C++0x]
15671 enum-head:
15672 enum-key identifier [opt] enum-base [opt]
15673 enum-key nested-name-specifier identifier enum-base [opt]
15675 enum-key:
15676 enum
15677 enum class [C++0x]
15678 enum struct [C++0x]
15680 enum-base: [C++0x]
15681 : type-specifier-seq
15683 opaque-enum-specifier:
15684 enum-key identifier enum-base [opt] ;
15686 GNU Extensions:
15687 enum-key attributes[opt] identifier [opt] enum-base [opt]
15688 { enumerator-list [opt] }attributes[opt]
15689 enum-key attributes[opt] identifier [opt] enum-base [opt]
15690 { enumerator-list, }attributes[opt] [C++0x]
15692 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15693 if the token stream isn't an enum-specifier after all. */
15695 static tree
15697 {
15698 tree identifier;
15700 tree prev_scope;
15702 tree attributes;
15715 /* Parse tentatively so that we can back up if we don't find a
15716 enum-specifier. */
15719 /* Caller guarantees that the current token is 'enum', an identifier
15720 possibly follows, and the token after that is an opening brace.
15721 If we don't have an identifier, fabricate an anonymous name for
15722 the enumeration being defined. */
15725 /* Parse the "class" or "struct", which indicates a scoped
15726 enumeration type in C++0x. */
15729 {
15733 /* Consume the `struct' or `class' token. */
15737 }
15741 /* Clear the qualification. */
15746 /* Figure out in what scope the declaration is being placed. */
15752 nested_name_specifier
15760 {
15761 tree name;
15765 enum_type,
15770 input_location);
15772 {
15775 {
15776 /* Are template enums allowed in ISO? */
15780 /* ignore a typename reference, for it will be solved by name
15781 in start_enum. */
15783 }
15784 }
15787 else
15790 }
15791 else
15792 {
15795 else
15796 {
15802 }
15803 }
15806 /* Check for the `:' that denotes a specified underlying type in C++0x.
15807 Note that a ':' could also indicate a bitfield width, however. */
15809 {
15810 cp_decl_specifier_seq type_specifiers;
15812 /* Consume the `:'. */
15815 /* Parse the type-specifier-seq. */
15820 /* At this point this is surely not elaborated type specifier. */
15829 /* If that didn't work, stop. */
15831 {
15837 }
15838 }
15840 /* Look for the `{' but don't consume it yet. */
15842 {
15844 {
15847 {
15850 }
15851 }
15852 /* An opaque-enum-specifier must have a ';' here. */
15855 {
15858 {
15861 }
15862 }
15863 }
15869 {
15871 {
15875 }
15877 {
15879 }
15880 }
15882 /* Issue an error message if type-definitions are forbidden here. */
15885 else
15886 /* Create the new type. We do this before consuming the opening
15887 brace so the enum will be recorded as being on the line of its
15888 tag (or the 'enum' keyword, if there is no tag). */
15892 /* If the next token is not '{' it is an opaque-enum-specifier or an
15893 elaborated-type-specifier. */
15895 {
15899 {
15900 /* The following catches invalid code such as:
15901 enum class S<int>::E { A, B, C }; */
15909 {
15913 nested_name_specifier);
15915 }
15916 /* If that scope does not contain the scope in which the
15917 class was originally declared, the program is invalid. */
15919 nested_name_specifier))
15920 {
15923 "declaration of %qD in namespace %qD which does not "
15926 else
15928 "declaration of %qD in %qD which does not "
15932 }
15933 }
15938 /* Consume the opening brace. */
15945 {
15949 }
15950 else
15951 {
15957 }
15961 /* If the next token is not '}', then there are some enumerators. */
15963 {
15967 }
15968 else
15971 /* Consume the final '}'. */
15977 }
15978 else
15979 {
15980 /* If a ';' follows, then it is an opaque-enum-specifier
15981 and additional restrictions apply. */
15983 {
15990 }
15991 }
15993 /* Look for trailing attributes to apply to this enumeration, and
15994 apply them if appropriate. */
15996 {
16000 trailing_attr,
16002 }
16004 /* Finish up the enumeration. */
16006 {
16011 }
16014 {
16016 {
16019 }
16021 {
16023 }
16024 }
16025 out:
16028 }
16030 /* Parse an enumerator-list. The enumerators all have the indicated
16031 TYPE.
16033 enumerator-list:
16034 enumerator-definition
16035 enumerator-list , enumerator-definition */
16037 static void
16039 {
16041 {
16042 /* Parse an enumerator-definition. */
16045 /* If the next token is not a ',', we've reached the end of
16046 the list. */
16049 /* Otherwise, consume the `,' and keep going. */
16051 /* If the next token is a `}', there is a trailing comma. */
16053 {
16058 }
16059 }
16060 }
16062 /* Parse an enumerator-definition. The enumerator has the indicated
16063 TYPE.
16065 enumerator-definition:
16066 enumerator
16067 enumerator = constant-expression
16069 enumerator:
16070 identifier */
16072 static void
16074 {
16075 tree identifier;
16076 tree value;
16077 location_t loc;
16079 /* Save the input location because we are interested in the location
16080 of the identifier and not the location of the explicit value. */
16083 /* Look for the identifier. */
16088 /* If the next token is an '=', then there is an explicit value. */
16090 {
16091 /* Consume the `=' token. */
16093 /* Parse the value. */
16095 }
16096 else
16099 /* If we are processing a template, make sure the initializer of the
16100 enumerator doesn't contain any bare template parameter pack. */
16104 /* Create the enumerator. */
16106 }
16108 /* Parse a namespace-name.
16110 namespace-name:
16111 original-namespace-name
16112 namespace-alias
16114 Returns the NAMESPACE_DECL for the namespace. */
16116 static tree
16118 {
16119 tree identifier;
16120 tree namespace_decl;
16124 /* Get the name of the namespace. */
16129 /* Look up the identifier in the currently active scope. Look only
16130 for namespaces, due to:
16132 [basic.lookup.udir]
16134 When looking up a namespace-name in a using-directive or alias
16135 definition, only namespace names are considered.
16137 And:
16139 [basic.lookup.qual]
16141 During the lookup of a name preceding the :: scope resolution
16142 operator, object, function, and enumerator names are ignored.
16144 (Note that cp_parser_qualifying_entity only calls this
16145 function if the token after the name is the scope resolution
16146 operator.) */
16148 none_type,
16154 /* If it's not a namespace, issue an error. */
16157 {
16162 }
16165 }
16167 /* Parse a namespace-definition.
16169 namespace-definition:
16170 named-namespace-definition
16171 unnamed-namespace-definition
16173 named-namespace-definition:
16174 original-namespace-definition
16175 extension-namespace-definition
16177 original-namespace-definition:
16178 namespace identifier { namespace-body }
16180 extension-namespace-definition:
16181 namespace original-namespace-name { namespace-body }
16183 unnamed-namespace-definition:
16184 namespace { namespace-body } */
16186 static void
16188 {
16195 {
16199 }
16200 else
16203 /* Look for the `namespace' keyword. */
16206 /* Get the name of the namespace. We do not attempt to distinguish
16207 between an original-namespace-definition and an
16208 extension-namespace-definition at this point. The semantic
16209 analysis routines are responsible for that. */
16212 else
16215 /* Parse any specified attributes. */
16218 /* Look for the `{' to start the namespace. */
16220 /* Start the namespace. */
16223 /* "inline namespace" is equivalent to a stub namespace definition
16224 followed by a strong using directive. */
16226 {
16228 /* Set up namespace association. */
16232 /* Import the contents of the inline namespace. */
16236 }
16240 /* Parse the body of the namespace. */
16246 /* Finish the namespace. */
16248 /* Look for the final `}'. */
16250 }
16252 /* Parse a namespace-body.
16254 namespace-body:
16255 declaration-seq [opt] */
16257 static void
16259 {
16261 }
16263 /* Parse a namespace-alias-definition.
16265 namespace-alias-definition:
16266 namespace identifier = qualified-namespace-specifier ; */
16268 static void
16270 {
16271 tree identifier;
16272 tree namespace_specifier;
16276 /* Look for the `namespace' keyword. */
16278 /* Look for the identifier. */
16282 /* Look for the `=' token. */
16285 {
16287 /* Skip the definition. */
16292 }
16294 /* Look for the qualified-namespace-specifier. */
16295 namespace_specifier
16297 /* Look for the `;' token. */
16300 /* Register the alias in the symbol table. */
16302 }
16304 /* Parse a qualified-namespace-specifier.
16306 qualified-namespace-specifier:
16307 :: [opt] nested-name-specifier [opt] namespace-name
16309 Returns a NAMESPACE_DECL corresponding to the specified
16310 namespace. */
16312 static tree
16314 {
16315 /* Look for the optional `::'. */
16319 /* Look for the optional nested-name-specifier. */
16327 }
16329 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16330 access declaration.
16332 using-declaration:
16333 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16334 using :: unqualified-id ;
16336 access-declaration:
16337 qualified-id ;
16339 */
16341 static bool
16344 {
16348 tree decl;
16349 tree identifier;
16350 tree qscope;
16355 {
16358 }
16359 else
16360 {
16361 /* Look for the `using' keyword. */
16364 /* Peek at the next token. */
16366 /* See if it's `typename'. */
16368 {
16369 /* Remember that we've seen it. */
16371 /* Consume the `typename' token. */
16373 }
16374 }
16376 /* Look for the optional global scope qualification. */
16377 global_scope_p
16382 /* If we saw `typename', or didn't see `::', then there must be a
16383 nested-name-specifier present. */
16385 {
16391 {
16394 }
16395 }
16396 /* Otherwise, we could be in either of the two productions. In that
16397 case, treat the nested-name-specifier as optional. */
16398 else
16410 /* Something has already gone wrong; there's no need to parse
16411 further. Since an error has occurred, the return value of
16412 cp_parser_parse_definitely will be false, as required. */
16416 /* Parse the unqualified-id. */
16424 {
16429 }
16431 /* The function we call to handle a using-declaration is different
16432 depending on what scope we are in. */
16434 ;
16437 /* [namespace.udecl]
16439 A using declaration shall not name a template-id. */
16442 else
16443 {
16445 {
16446 /* Create the USING_DECL. */
16453 {
16456 }
16457 else
16458 /* Add it to the list of members in this class. */
16460 }
16461 else
16462 {
16464 identifier,
16471 {
16474 }
16477 else
16479 }
16480 }
16482 /* Look for the final `;'. */
16487 "access declarations are deprecated "
16488 "in favour of using-declarations; "
16492 }
16494 /* Parse an alias-declaration.
16496 alias-declaration:
16497 using identifier attribute-specifier-seq [opt] = type-id */
16499 static tree
16501 {
16503 location_t id_location;
16505 cp_decl_specifier_seq decl_specs;
16509 /* Look for the `using' keyword. */
16510 cp_token *using_token
16532 /* Now we are going to parse the type-id of the declaration. */
16534 /*
16535 [dcl.type]/3 says:
16537 "A type-specifier-seq shall not define a class or enumeration
16538 unless it appears in the type-id of an alias-declaration (7.1.3) that
16539 is not the declaration of a template-declaration."
16541 In other words, if we currently are in an alias template, the
16542 type-id should not define a type.
16544 So let's set parser->type_definition_forbidden_message in that
16545 case; cp_parser_check_type_definition (called by
16546 cp_parser_class_specifier) will then emit an error if a type is
16547 defined in the type-id. */
16549 {
16553 }
16557 /* Restore the error message if need be. */
16563 {
16566 }
16568 /* A typedef-name can also be introduced by an alias-declaration. The
16569 identifier following the using keyword becomes a typedef-name. It has
16570 the same semantics as if it were introduced by the typedef
16571 specifier. In particular, it does not define a new type and it shall
16572 not appear in the type-id. */
16577 {
16580 ds_attribute,
16581 attrs_token);
16582 }
16584 ds_typedef,
16585 using_token);
16587 ds_alias,
16588 using_token);
16597 else
16608 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16609 added into the symbol table; otherwise, return the TYPE_DECL. */
16613 {
16617 }
16620 }
16622 /* Parse a using-directive.
16624 using-directive:
16625 using namespace :: [opt] nested-name-specifier [opt]
16626 namespace-name ; */
16628 static void
16630 {
16631 tree namespace_decl;
16632 tree attribs;
16634 /* Look for the `using' keyword. */
16636 /* And the `namespace' keyword. */
16638 /* Look for the optional `::' operator. */
16640 /* And the optional nested-name-specifier. */
16646 /* Get the namespace being used. */
16648 /* And any specified attributes. */
16650 /* Update the symbol table. */
16652 /* Look for the final `;'. */
16654 }
16656 /* Parse an asm-definition.
16658 asm-definition:
16659 asm ( string-literal ) ;
16661 GNU Extension:
16663 asm-definition:
16664 asm volatile [opt] ( string-literal ) ;
16665 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16666 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16667 : asm-operand-list [opt] ) ;
16668 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16669 : asm-operand-list [opt]
16670 : asm-clobber-list [opt] ) ;
16671 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16672 : asm-clobber-list [opt]
16673 : asm-goto-list ) ; */
16675 static void
16677 {
16678 tree string;
16683 tree asm_stmt;
16691 /* Look for the `asm' keyword. */
16696 {
16699 }
16701 /* See if the next token is `volatile'. */
16704 {
16705 /* Remember that we saw the `volatile' keyword. */
16707 /* Consume the token. */
16709 }
16713 {
16714 /* Remember that we saw the `goto' keyword. */
16716 /* Consume the token. */
16718 }
16719 /* Look for the opening `('. */
16722 /* Look for the string. */
16725 {
16729 }
16731 /* If we're allowing GNU extensions, check for the extended assembly
16732 syntax. Unfortunately, the `:' tokens need not be separated by
16733 a space in C, and so, for compatibility, we tolerate that here
16734 too. Doing that means that we have to treat the `::' operator as
16735 two `:' tokens. */
16740 {
16745 /* The extended syntax was used. */
16748 /* Look for outputs. */
16750 {
16751 /* Consume the `:'. */
16753 /* Parse the output-operands. */
16755 CPP_COLON)
16757 CPP_SCOPE)
16759 CPP_CLOSE_PAREN)
16765 }
16766 /* If the next token is `::', there are no outputs, and the
16767 next token is the beginning of the inputs. */
16769 /* The inputs are coming next. */
16772 /* Look for inputs. */
16775 {
16776 /* Consume the `:' or `::'. */
16778 /* Parse the output-operands. */
16780 CPP_COLON)
16782 CPP_SCOPE)
16784 CPP_CLOSE_PAREN))
16789 }
16791 /* The clobbers are coming next. */
16794 /* Look for clobbers. */
16797 {
16799 /* Consume the `:' or `::'. */
16801 /* Parse the clobbers. */
16803 CPP_COLON)
16805 CPP_CLOSE_PAREN))
16807 }
16810 /* The labels are coming next. */
16813 /* Look for labels. */
16816 {
16818 /* Consume the `:' or `::'. */
16820 /* Parse the labels. */
16822 }
16826 }
16830 /* Look for the closing `)'. */
16838 {
16839 /* Create the ASM_EXPR. */
16841 {
16844 /* If the extended syntax was not used, mark the ASM_EXPR. */
16846 {
16852 }
16853 }
16854 else
16856 }
16857 }
16859 /* Declarators [gram.dcl.decl] */
16861 /* Parse an init-declarator.
16863 init-declarator:
16864 declarator initializer [opt]
16866 GNU Extension:
16868 init-declarator:
16869 declarator asm-specification [opt] attributes [opt] initializer [opt]
16871 function-definition:
16872 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16873 function-body
16874 decl-specifier-seq [opt] declarator function-try-block
16876 GNU Extension:
16878 function-definition:
16879 __extension__ function-definition
16881 TM Extension:
16883 function-definition:
16884 decl-specifier-seq [opt] declarator function-transaction-block
16886 The DECL_SPECIFIERS apply to this declarator. Returns a
16887 representation of the entity declared. If MEMBER_P is TRUE, then
16888 this declarator appears in a class scope. The new DECL created by
16889 this declarator is returned.
16891 The CHECKS are access checks that should be performed once we know
16892 what entity is being declared (and, therefore, what classes have
16893 befriended it).
16895 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16896 for a function-definition here as well. If the declarator is a
16897 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16898 be TRUE upon return. By that point, the function-definition will
16899 have been completely parsed.
16901 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16902 is FALSE.
16904 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16905 parsed declaration if it is an uninitialized single declarator not followed
16906 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16907 if present, will not be consumed. If returned, this declarator will be
16908 created with SD_INITIALIZED but will not call cp_finish_decl.
16910 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16911 and there is an initializer, the pointed location_t is set to the
16912 location of the '=' or `(', or '{' in C++11 token introducing the
16913 initializer. */
16915 static tree
16925 {
16929 tree prefix_attributes;
16931 tree asm_specification;
16932 tree initializer;
16934 tree scope;
16936 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16937 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16938 "(...)". */
16949 /* Gather the attributes that were provided with the
16950 decl-specifiers. */
16953 /* Assume that this is not the declarator for a function
16954 definition. */
16958 /* Default arguments are only permitted for function parameters. */
16962 /* Defer access checks while parsing the declarator; we cannot know
16963 what names are accessible until we know what is being
16964 declared. */
16967 /* Parse the declarator. */
16969 declarator
16974 /* Gather up the deferred checks. */
16979 /* If the DECLARATOR was erroneous, there's no need to go
16980 further. */
16984 /* Check that the number of template-parameter-lists is OK. */
16994 /* Figure out what scope the entity declared by the DECLARATOR is
16995 located in. `grokdeclarator' sometimes changes the scope, so
16996 we compute it now. */
16999 /* Perform any lookups in the declared type which were thought to be
17000 dependent, but are not in the scope of the declarator. */
17001 decl_specifiers->type
17004 /* If we're allowing GNU extensions, look for an
17005 asm-specification. */
17007 {
17008 /* Look for an asm-specification. */
17011 }
17012 else
17015 /* Look for attributes. */
17019 /* Peek at the next token. */
17025 {
17026 /* Check to see if the token indicates the start of a
17027 function-definition. */
17029 {
17031 {
17032 /* If a function-definition should not appear here, issue an
17033 error message. */
17037 }
17039 location_t func_brace_location
17042 /* Neither attributes nor an asm-specification are allowed
17043 on a function-definition. */
17046 "an asm-specification is not allowed "
17050 "attributes are not allowed "
17052 /* This is a function-definition. */
17055 /* Parse the function definition. */
17058 decl_specifiers,
17059 declarator,
17060 prefix_attributes);
17061 else
17062 decl =
17063 (cp_parser_function_definition_from_specifiers_and_declarator
17067 {
17068 /* This is where the prologue starts... */
17071 }
17074 }
17075 }
17077 {
17078 /* A non-template declaration involving a function parameter list
17079 containing an implicit template parameter will be made into a
17080 template. If the resulting declaration is not going to be an
17081 actual function then finish the template scope here to prevent it.
17082 An error message will be issued once we have a decl to talk about.
17084 FIXME probably we should do type deduction rather than create an
17085 implicit template, but the standard currently doesn't allow it. */
17088 }
17090 /* [dcl.dcl]
17092 Only in function declarations for constructors, destructors, and
17093 type conversions can the decl-specifier-seq be omitted.
17095 We explicitly postpone this check past the point where we handle
17096 function-definitions because we tolerate function-definitions
17097 that are missing their return types in some modes. */
17099 {
17103 }
17105 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17109 {
17120 {
17126 }
17127 }
17128 else
17129 {
17130 /* If the init-declarator isn't initialized and isn't followed by a
17131 `,' or `;', it's not a valid init-declarator. */
17134 {
17137 else
17138 {
17142 }
17143 }
17146 }
17148 /* Because start_decl has side-effects, we should only call it if we
17149 know we're going ahead. By this point, we know that we cannot
17150 possibly be looking at any other construct. */
17153 /* Enter the newly declared entry in the symbol table. If we're
17154 processing a declaration in a class-specifier, we wait until
17155 after processing the initializer. */
17157 {
17164 /* Adjust location of decl if declarator->id_loc is more appropriate:
17165 set, and decl wasn't merged with another decl, in which case its
17166 location would be different from input_location, and more accurate. */
17171 }
17173 /* Enter the SCOPE. That way unqualified names appearing in the
17174 initializer will be looked up in SCOPE. */
17177 /* Perform deferred access control checks, now that we know in which
17178 SCOPE the declared entity resides. */
17180 {
17183 /* If the entity being declared is a function, pretend that we
17184 are in its scope. If it is a `friend', it may have access to
17185 things that would not otherwise be accessible. */
17187 {
17190 }
17192 /* Perform access checks for template parameters. */
17195 /* Perform the access control checks for the declarator and the
17196 decl-specifiers. */
17199 /* Restore the saved value. */
17202 }
17204 /* Parse the initializer. */
17209 {
17211 {
17214 else
17215 {
17216 /* If the declaration was erroneous, we don't really
17217 know what the user intended, so just silently
17218 consume the initializer. */
17225 }
17226 }
17227 else
17228 {
17229 /* We want to record the extra mangling scope for in-class
17230 initializers of class members and initializers of static data
17231 member templates. The former involves deferring
17232 parsing of the initializer until end of class as with default
17233 arguments. So right here we only handle the latter. */
17243 }
17244 }
17246 /* The old parser allows attributes to appear after a parenthesized
17247 initializer. Mark Mitchell proposed removing this functionality
17248 on the GCC mailing lists on 2002-08-13. This parser accepts the
17249 attributes -- but ignores them. */
17256 /* And now complain about a non-function implicit template. */
17261 /* For an in-class declaration, use `grokfield' to create the
17262 declaration. */
17264 {
17266 {
17269 }
17277 }
17279 /* Finish processing the declaration. But, skip member
17280 declarations. */
17282 {
17285 asm_specification,
17286 /* If the initializer is in parentheses, then this is
17287 a direct-initialization, which means that an
17288 `explicit' constructor is OK. Otherwise, an
17289 `explicit' constructor cannot be used. */
17292 }
17295 /* Core issue #226 (C++0x only): A default template-argument
17296 shall not be specified in a friend class template
17297 declaration. */
17306 {
17309 else
17311 }
17314 }
17316 /* Parse a declarator.
17318 declarator:
17319 direct-declarator
17320 ptr-operator declarator
17322 abstract-declarator:
17323 ptr-operator abstract-declarator [opt]
17324 direct-abstract-declarator
17326 GNU Extensions:
17328 declarator:
17329 attributes [opt] direct-declarator
17330 attributes [opt] ptr-operator declarator
17332 abstract-declarator:
17333 attributes [opt] ptr-operator abstract-declarator [opt]
17334 attributes [opt] direct-abstract-declarator
17336 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17337 detect constructor, destructor or conversion operators. It is set
17338 to -1 if the declarator is a name, and +1 if it is a
17339 function. Otherwise it is set to zero. Usually you just want to
17340 test for >0, but internally the negative value is used.
17342 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17343 a decl-specifier-seq unless it declares a constructor, destructor,
17344 or conversion. It might seem that we could check this condition in
17345 semantic analysis, rather than parsing, but that makes it difficult
17346 to handle something like `f()'. We want to notice that there are
17347 no decl-specifiers, and therefore realize that this is an
17348 expression, not a declaration.)
17350 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17351 the declarator is a direct-declarator of the form "(...)".
17353 MEMBER_P is true iff this declarator is a member-declarator.
17355 FRIEND_P is true iff this declarator is a friend. */
17359 cp_parser_declarator_kind dcl_kind,
17363 {
17366 cp_cv_quals cv_quals;
17367 tree class_type;
17370 /* Assume this is not a constructor, destructor, or type-conversion
17371 operator. */
17378 /* Check for the ptr-operator production. */
17380 /* Parse the ptr-operator. */
17386 /* If that worked, then we have a ptr-operator. */
17388 {
17389 /* If a ptr-operator was found, then this declarator was not
17390 parenthesized. */
17393 /* The dependent declarator is optional if we are parsing an
17394 abstract-declarator. */
17398 /* Parse the dependent declarator. */
17403 friend_p);
17405 /* If we are parsing an abstract-declarator, we must handle the
17406 case where the dependent declarator is absent. */
17411 declarator = cp_parser_make_indirect_declarator
17413 }
17414 /* Everything else is a direct-declarator. */
17415 else
17416 {
17419 CPP_OPEN_PAREN);
17421 ctor_dtor_or_conv_p,
17423 }
17428 }
17430 /* Parse a direct-declarator or direct-abstract-declarator.
17432 direct-declarator:
17433 declarator-id
17434 direct-declarator ( parameter-declaration-clause )
17435 cv-qualifier-seq [opt]
17436 ref-qualifier [opt]
17437 exception-specification [opt]
17438 direct-declarator [ constant-expression [opt] ]
17439 ( declarator )
17441 direct-abstract-declarator:
17442 direct-abstract-declarator [opt]
17443 ( parameter-declaration-clause )
17444 cv-qualifier-seq [opt]
17445 ref-qualifier [opt]
17446 exception-specification [opt]
17447 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17448 ( abstract-declarator )
17450 Returns a representation of the declarator. DCL_KIND is
17451 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17452 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17453 we are parsing a direct-declarator. It is
17454 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17455 of ambiguity we prefer an abstract declarator, as per
17456 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17457 as for cp_parser_declarator. */
17461 cp_parser_declarator_kind dcl_kind,
17464 {
17474 {
17475 /* Peek at the next token. */
17478 {
17479 /* This is either a parameter-declaration-clause, or a
17480 parenthesized declarator. When we know we are parsing a
17481 named declarator, it must be a parenthesized declarator
17482 if FIRST is true. For instance, `(int)' is a
17483 parameter-declaration-clause, with an omitted
17484 direct-abstract-declarator. But `((*))', is a
17485 parenthesized abstract declarator. Finally, when T is a
17486 template parameter `(T)' is a
17487 parameter-declaration-clause, and not a parenthesized
17488 named declarator.
17490 We first try and parse a parameter-declaration-clause,
17491 and then try a nested declarator (if FIRST is true).
17493 It is not an error for it not to be a
17494 parameter-declaration-clause, even when FIRST is
17495 false. Consider,
17497 int i (int);
17498 int i (3);
17500 The first is the declaration of a function while the
17501 second is the definition of a variable, including its
17502 initializer.
17504 Having seen only the parenthesis, we cannot know which of
17505 these two alternatives should be selected. Even more
17506 complex are examples like:
17508 int i (int (a));
17509 int i (int (3));
17511 The former is a function-declaration; the latter is a
17512 variable initialization.
17514 Thus again, we try a parameter-declaration-clause, and if
17515 that fails, we back out and return. */
17518 {
17519 tree params;
17522 /* In a member-declarator, the only valid interpretation
17523 of a parenthesis is the start of a
17524 parameter-declaration-clause. (It is invalid to
17525 initialize a static data member with a parenthesized
17526 initializer; only the "=" form of initialization is
17527 permitted.) */
17531 /* Consume the `('. */
17534 {
17535 /* If this is going to be an abstract declarator, we're
17536 in a declarator and we can't have default args. */
17539 }
17543 /* Parse the parameter-declaration-clause. */
17546 /* Consume the `)'. */
17549 /* If all went well, parse the cv-qualifier-seq,
17550 ref-qualifier and the exception-specification. */
17552 {
17553 cp_cv_quals cv_quals;
17554 cp_virt_specifiers virt_specifiers;
17555 cp_ref_qualifier ref_qual;
17556 tree exception_specification;
17557 tree late_return;
17558 tree attrs;
17568 /* Parse the cv-qualifier-seq. */
17570 /* Parse the ref-qualifier. */
17572 /* And the exception-specification. */
17573 exception_specification
17578 /* In here, we handle cases where attribute is used after
17579 the function declaration. For example:
17580 void func (int x) __attribute__((vector(..))); */
17583 {
17587 CPP_SEMICOLON)
17589 CPP_OPEN_BRACE))
17592 ;
17593 else
17595 }
17596 late_return = (cp_parser_late_return_type_opt
17601 /* Parse the virt-specifier-seq. */
17604 /* Create the function-declarator. */
17606 params,
17607 cv_quals,
17608 virt_specifiers,
17609 ref_qual,
17610 exception_specification,
17611 late_return);
17613 /* Any subsequent parameter lists are to do with
17614 return type, so are not those of the declared
17615 function. */
17617 }
17619 /* Remove the function parms from scope. */
17623 /* Repeat the main loop. */
17625 }
17627 /* If this is the first, we can try a parenthesized
17628 declarator. */
17630 {
17636 /* Consume the `('. */
17638 /* Parse the nested declarator. */
17641 declarator
17647 /* Expect a `)'. */
17654 }
17655 /* Otherwise, we must be done. */
17656 else
17658 }
17662 {
17663 /* Parse an array-declarator. */
17672 /* Consume the `['. */
17674 /* Peek at the next token. */
17676 /* If the next token is `]', then there is no
17677 constant-expression. */
17679 {
17681 bounds
17691 {
17692 /* Normally, the array bound must be an integral constant
17693 expression. However, as an extension, we allow VLAs
17694 in function scopes as long as they aren't part of a
17695 parameter declaration. */
17699 }
17702 {
17703 /* Remember this wasn't a constant-expression. */
17706 }
17707 }
17708 else
17710 /* Look for the closing `]'. */
17712 {
17715 }
17720 }
17722 {
17723 {
17724 tree qualifying_scope;
17725 tree unqualified_name;
17726 tree attrs;
17727 special_function_kind sfk;
17732 /* Parse a declarator-id */
17735 {
17738 /* If we see an ellipsis, we should be looking at a
17739 parameter pack. */
17741 {
17742 /* Consume the `...' */
17746 }
17747 }
17750 unqualified_name
17754 {
17758 {
17759 /* Check whether an error occurred. */
17762 /* We already consumed the ellipsis to mark a
17763 parameter pack, but we have no way to report it,
17764 so abort the tentative parse. We will be exiting
17765 immediately anyway. */
17767 }
17768 else
17774 && (qualifying_scope
17776 {
17779 }
17780 }
17785 {
17790 }
17796 {
17797 /* In the declaration of a member of a template class
17798 outside of the class itself, the SCOPE will sometimes
17799 be a TYPENAME_TYPE. For example, given:
17801 template <typename T>
17802 int S<T>::R::i = 3;
17804 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17805 this context, we must resolve S<T>::R to an ordinary
17806 type, rather than a typename type.
17808 The reason we normally avoid resolving TYPENAME_TYPEs
17809 is that a specialization of `S' might render
17810 `S<T>::R' not a type. However, if `S' is
17811 specialized, then this `i' will not be used, so there
17812 is no harm in resolving the types here. */
17813 tree type;
17815 /* Resolve the TYPENAME_TYPE. */
17818 /* If that failed, the declarator is invalid. */
17820 {
17823 "cannot define member of dependent typedef "
17825 else
17830 }
17832 }
17837 {
17838 tree class_type;
17843 else
17847 {
17850 {
17853 {
17857 "use %<%T::%D%> instead of %<%T::%D%> to "
17859 class_type,
17864 }
17865 else
17867 }
17868 else
17869 {
17870 /* We do not attempt to print the declarator
17871 here because we do not have enough
17872 information about its original syntactic
17873 form. */
17877 }
17878 }
17881 {
17887 for an anonymous type, even if the type
17888 got a name for linkage purposes. */
17890 /* Handle correctly (c++/19200):
17892 struct S {
17893 struct T{};
17894 friend void S(T);
17895 };
17897 and also:
17899 namespace N {
17900 void S();
17901 }
17903 struct S {
17904 friend void N::S();
17905 }; */
17906 && !(friend_p
17909 class_type))
17910 {
17913 }
17921 }
17922 }
17924 unqualified_name,
17925 sfk);
17932 }
17934 handle_declarator:;
17937 {
17938 /* Any names that appear after the declarator-id for a
17939 member are looked up in the containing scope. */
17941 {
17942 /* But declarations with qualified-ids can't appear in a
17943 function. */
17947 }
17949 }
17953 /* Default args are only allowed on function
17954 declarations. */
17956 else
17960 }
17961 /* We're done. */
17962 else
17964 }
17966 /* For an abstract declarator, we might wind up with nothing at this
17967 point. That's an error; the declarator is not optional. */
17971 /* If we entered a scope, we must exit it now. */
17979 }
17981 /* Parse a ptr-operator.
17983 ptr-operator:
17984 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17985 * cv-qualifier-seq [opt]
17986 &
17987 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17988 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17990 GNU Extension:
17992 ptr-operator:
17993 & cv-qualifier-seq [opt]
17995 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17996 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17997 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17998 filled in with the TYPE containing the member. *CV_QUALS is
17999 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18000 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18001 Note that the tree codes returned by this function have nothing
18002 to do with the types of trees that will be eventually be created
18003 to represent the pointer or reference type being parsed. They are
18004 just constants with suggestive names. */
18005 static enum tree_code
18010 {
18015 /* Assume that it's not a pointer-to-member. */
18017 /* And that there are no cv-qualifiers. */
18020 /* Peek at the next token. */
18023 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18033 {
18034 /* Consume the `*', `&' or `&&'. */
18037 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18038 `&', if we are allowing GNU extensions. (The only qualifier
18039 that can legally appear after `&' is `restrict', but that is
18040 enforced during semantic analysis. */
18048 }
18049 else
18050 {
18051 /* Try the pointer-to-member case. */
18053 /* Look for the optional `::' operator. */
18056 /* Look for the nested-name specifier. */
18063 /* If we found it, and the next token is a `*', then we are
18064 indeed looking at a pointer-to-member operator. */
18067 {
18068 /* Indicate that the `*' operator was used. */
18076 else
18077 {
18078 /* The type of which the member is a member is given by the
18079 current SCOPE. */
18081 /* The next name will not be qualified. */
18085 /* Look for optional c++11 attributes. */
18089 /* Look for the optional cv-qualifier-seq. */
18091 }
18092 }
18093 /* If that didn't work we don't have a ptr-operator. */
18096 }
18099 }
18101 /* Parse an (optional) cv-qualifier-seq.
18103 cv-qualifier-seq:
18104 cv-qualifier cv-qualifier-seq [opt]
18106 cv-qualifier:
18107 const
18108 volatile
18110 GNU Extension:
18112 cv-qualifier:
18113 __restrict__
18115 Returns a bitmask representing the cv-qualifiers. */
18117 static cp_cv_quals
18119 {
18123 {
18125 cp_cv_quals cv_qualifier;
18127 /* Peek at the next token. */
18129 /* See if it's a cv-qualifier. */
18131 {
18147 }
18153 {
18156 }
18157 else
18158 {
18161 }
18162 }
18165 }
18167 /* Parse an (optional) ref-qualifier
18169 ref-qualifier:
18170 &
18171 &&
18173 Returns cp_ref_qualifier representing ref-qualifier. */
18175 static cp_ref_qualifier
18177 {
18180 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18185 {
18190 {
18202 }
18207 {
18210 }
18211 else
18212 {
18215 }
18216 }
18219 }
18221 /* Parse an (optional) virt-specifier-seq.
18223 virt-specifier-seq:
18224 virt-specifier virt-specifier-seq [opt]
18226 virt-specifier:
18227 override
18228 final
18230 Returns a bitmask representing the virt-specifiers. */
18232 static cp_virt_specifiers
18234 {
18238 {
18240 cp_virt_specifiers virt_specifier;
18242 /* Peek at the next token. */
18244 /* See if it's a virt-specifier-qualifier. */
18248 {
18251 }
18253 {
18256 }
18258 {
18260 }
18261 else
18265 {
18268 }
18269 else
18270 {
18273 }
18274 }
18276 }
18278 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18279 is in scope even though it isn't real. */
18281 void
18283 {
18284 tree this_parm;
18287 {
18288 /* We don't clear this between NSDMIs. Is it already what we want? */
18293 }
18296 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18298 current_class_ref
18301 }
18303 /* Return true iff our current scope is a non-static data member
18304 initializer. */
18306 bool
18308 {
18309 /* We recognize NSDMI context by the context-less 'this' pointer set up
18310 by the function above. */
18314 }
18316 /* Parse a late-specified return type, if any. This is not a separate
18317 non-terminal, but part of a function declarator, which looks like
18319 -> trailing-type-specifier-seq abstract-declarator(opt)
18321 Returns the type indicated by the type-id.
18323 In addition to this this parses any queued up omp declare simd
18324 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18326 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18327 function. */
18329 static tree
18331 cp_cv_quals quals)
18332 {
18336 && declarator
18342 /* Peek at the next token. */
18344 /* A late-specified return type is indicated by an initial '->'. */
18351 {
18352 /* DR 1207: 'this' is in scope in the trailing return type. */
18354 }
18357 {
18358 /* Consume the ->. */
18362 }
18365 declarator->std_attributes
18369 declarator->std_attributes
18374 {
18377 }
18380 }
18382 /* Parse a declarator-id.
18384 declarator-id:
18385 id-expression
18386 :: [opt] nested-name-specifier [opt] type-name
18388 In the `id-expression' case, the value returned is as for
18389 cp_parser_id_expression if the id-expression was an unqualified-id.
18390 If the id-expression was a qualified-id, then a SCOPE_REF is
18391 returned. The first operand is the scope (either a NAMESPACE_DECL
18392 or TREE_TYPE), but the second is still just a representation of an
18393 unqualified-id. */
18395 static tree
18397 {
18398 tree id;
18399 /* The expression must be an id-expression. Assume that qualified
18400 names are the names of types so that:
18402 template <class T>
18403 int S<T>::R::i = 3;
18405 will work; we must treat `S<T>::R' as the name of a type.
18406 Similarly, assume that qualified names are templates, where
18407 required, so that:
18409 template <class T>
18410 int S<T>::R<T>::i = 3;
18412 will work, too. */
18418 optional_p);
18422 }
18424 /* Parse a type-id.
18426 type-id:
18427 type-specifier-seq abstract-declarator [opt]
18429 Returns the TYPE specified. */
18431 static tree
18434 {
18435 cp_decl_specifier_seq type_specifier_seq;
18438 /* Parse the type-specifier-seq. */
18440 is_trailing_return,
18445 /* There might or might not be an abstract declarator. */
18447 /* Look for the declarator. */
18448 abstract_declarator
18453 /* Check to see if there really was a declarator. */
18458 /* None of the valid uses of 'auto' in C++14 involve the type-id
18459 nonterminal, but it is valid in a trailing-return-type. */
18462 {
18463 /* A type-id with type 'auto' is only ok if the abstract declarator
18464 is a function declarator with a late-specified return type. */
18469 else
18470 {
18473 }
18474 }
18477 is_template_arg);
18478 }
18481 {
18483 }
18486 {
18487 tree r;
18489 parser->type_definition_forbidden_message
18494 {
18497 }
18499 }
18502 {
18504 }
18506 /* Parse a type-specifier-seq.
18508 type-specifier-seq:
18509 type-specifier type-specifier-seq [opt]
18511 GNU extension:
18513 type-specifier-seq:
18514 attributes type-specifier-seq [opt]
18516 If IS_DECLARATION is true, we are at the start of a "condition" or
18517 exception-declaration, so we might be followed by a declarator-id.
18519 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18520 i.e. we've just seen "->".
18522 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18524 static void
18529 {
18534 /* Clear the TYPE_SPECIFIER_SEQ. */
18537 /* In the context of a trailing return type, enum E { } is an
18538 elaborated-type-specifier followed by a function-body, not an
18539 enum-specifier. */
18543 /* Parse the type-specifiers and attributes. */
18545 {
18546 tree type_specifier;
18549 /* Check for attributes first. */
18551 {
18556 }
18558 /* record the token of the beginning of the type specifier seq,
18559 for error reporting purposes*/
18563 /* Look for the type-specifier. */
18565 flags,
18566 type_specifier_seq,
18568 NULL,
18571 {
18572 /* If the first type-specifier could not be found, this is not a
18573 type-specifier-seq at all. */
18575 {
18576 /* Set in_declarator_p to avoid skipping to the semicolon. */
18588 }
18589 /* If subsequent type-specifiers could not be found, the
18590 type-specifier-seq is complete. */
18592 }
18595 /* The standard says that a condition can be:
18597 type-specifier-seq declarator = assignment-expression
18599 However, given:
18601 struct S {};
18602 if (int S = ...)
18604 we should treat the "S" as a declarator, not as a
18605 type-specifier. The standard doesn't say that explicitly for
18606 type-specifier-seq, but it does say that for
18607 decl-specifier-seq in an ordinary declaration. Perhaps it
18608 would be clearer just to allow a decl-specifier-seq here, and
18609 then add a semantic restriction that if any decl-specifiers
18610 that are not type-specifiers appear, the program is invalid. */
18613 }
18614 }
18616 /* Return whether the function currently being declared has an associated
18617 template parameter list. */
18619 static bool
18621 {
18634 }
18636 /* Parse a parameter-declaration-clause.
18638 parameter-declaration-clause:
18639 parameter-declaration-list [opt] ... [opt]
18640 parameter-declaration-list , ...
18642 Returns a representation for the parameter declarations. A return
18643 value of NULL indicates a parameter-declaration-clause consisting
18644 only of an ellipsis. */
18646 static tree
18648 {
18649 tree parameters;
18658 parser->auto_is_implicit_function_template_parm_p
18660 }
18666 && !processing_template_parmlist
18672 /* Peek at the next token. */
18674 /* Check for trivial parameter-declaration-clauses. */
18676 {
18677 /* Consume the `...' token. */
18680 }
18682 /* There are no parameters. */
18683 {
18684 #ifndef NO_IMPLICIT_EXTERN_C
18689 else
18690 #endif
18692 }
18693 /* Check for `(void)', too, which is a special case. */
18697 {
18698 /* Consume the `void' token. */
18700 /* There are no parameters. */
18702 }
18704 /* Parse the parameter-declaration-list. */
18706 /* If a parse error occurred while parsing the
18707 parameter-declaration-list, then the entire
18708 parameter-declaration-clause is erroneous. */
18712 /* Peek at the next token. */
18714 /* If it's a `,', the clause should terminate with an ellipsis. */
18716 {
18717 /* Consume the `,'. */
18719 /* Expect an ellipsis. */
18720 ellipsis_p
18722 }
18723 /* It might also be `...' if the optional trailing `,' was
18724 omitted. */
18726 {
18727 /* Consume the `...' token. */
18729 /* And remember that we saw it. */
18731 }
18732 else
18735 /* Finish the parameter list. */
18740 }
18742 /* Parse a parameter-declaration-list.
18744 parameter-declaration-list:
18745 parameter-declaration
18746 parameter-declaration-list , parameter-declaration
18748 Returns a representation of the parameter-declaration-list, as for
18749 cp_parser_parameter_declaration_clause. However, the
18750 `void_list_node' is never appended to the list. Upon return,
18751 *IS_ERROR will be true iff an error occurred. */
18753 static tree
18755 {
18761 /* Assume all will go well. */
18763 /* The special considerations that apply to a function within an
18764 unbraced linkage specifications do not apply to the parameters
18765 to the function. */
18766 saved_in_unbraced_linkage_specification_p
18770 /* Look for more parameters. */
18772 {
18780 /* Parse the parameter. */
18781 parameter
18786 /* We don't know yet if the enclosing context is deprecated, so wait
18787 and warn in grokparms if appropriate. */
18791 {
18792 /* If a function parameter pack was specified and an implicit template
18793 parameter was introduced during cp_parser_parameter_declaration,
18794 change any implicit parameters introduced into packs. */
18798 {
18806 }
18810 PARM,
18813 }
18817 /* If a parse error occurred parsing the parameter declaration,
18818 then the entire parameter-declaration-list is erroneous. */
18820 {
18824 }
18834 {
18838 }
18840 /* Add the new parameter to the list. */
18844 /* Peek at the next token. */
18847 /* These are for Objective-C++ */
18850 /* The parameter-declaration-list is complete. */
18853 {
18856 /* Peek at the next token. */
18858 /* If it's an ellipsis, then the list is complete. */
18861 /* Otherwise, there must be more parameters. Consume the
18862 `,'. */
18864 /* When parsing something like:
18866 int i(float f, double d)
18868 we can tell after seeing the declaration for "f" that we
18869 are not looking at an initialization of a variable "i",
18870 but rather at the declaration of a function "i".
18872 Due to the fact that the parsing of template arguments
18873 (as specified to a template-id) requires backtracking we
18874 cannot use this technique when inside a template argument
18875 list. */
18879 /* However, a parameter-declaration of the form
18880 "float(f)" (which is a valid declaration of a
18881 parameter "f") can also be interpreted as an
18882 expression (the conversion of "f" to "float"). */
18885 }
18886 else
18887 {
18895 }
18896 }
18898 parser->in_unbraced_linkage_specification_p
18901 /* Reset implicit_template_scope if we are about to leave the function
18902 parameter list that introduced it. Note that for out-of-line member
18903 definitions, there will be one or more class scopes before we get to
18904 the template parameter scope. */
18908 {
18912 {
18915 }
18916 }
18919 }
18921 /* Parse a parameter declaration.
18923 parameter-declaration:
18924 decl-specifier-seq ... [opt] declarator
18925 decl-specifier-seq declarator = assignment-expression
18926 decl-specifier-seq ... [opt] abstract-declarator [opt]
18927 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18929 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18930 declares a template parameter. (In that case, a non-nested `>'
18931 token encountered during the parsing of the assignment-expression
18932 is not interpreted as a greater-than operator.)
18934 Returns a representation of the parameter, or NULL if an error
18935 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18936 true iff the declarator is of the form "(p)". */
18942 {
18944 cp_decl_specifier_seq decl_specifiers;
18946 tree default_argument;
18950 /* In a template parameter, `>' is not an operator.
18952 [temp.param]
18954 When parsing a default template-argument for a non-type
18955 template-parameter, the first non-nested `>' is taken as the end
18956 of the template parameter-list rather than a greater-than
18957 operator. */
18959 /* Type definitions may not appear in parameter types. */
18961 parser->type_definition_forbidden_message
18964 /* Parse the declaration-specifiers. */
18966 CP_PARSER_FLAGS_NONE,
18970 /* Complain about missing 'typename' or other invalid type names. */
18975 /* If an error occurred, there's no reason to attempt to parse the
18976 rest of the declaration. */
18978 {
18981 }
18983 /* Peek at the next token. */
18986 /* If the next token is a `)', `,', `=', `>', or `...', then there
18987 is no declarator. However, when variadic templates are enabled,
18988 there may be a declarator following `...'. */
18993 {
18997 }
18998 /* Otherwise, there should be a declarator. */
18999 else
19000 {
19004 /* After seeing a decl-specifier-seq, if the next token is not a
19005 "(", there is no possibility that the code is a valid
19006 expression. Therefore, if parsing tentatively, we commit at
19007 this point. */
19009 /* In an expression context, having seen:
19011 (int((char ...
19013 we cannot be sure whether we are looking at a
19014 function-type (taking a "char" as a parameter) or a cast
19015 of some object of type "char" to "int". */
19021 /* Parse the declarator. */
19024 CP_PARSER_DECLARATOR_EITHER,
19026 parenthesized_p,
19030 /* After the declarator, allow more attributes. */
19031 decl_specifiers.attributes
19034 }
19036 /* If the next token is an ellipsis, and we have not seen a
19037 declarator name, and the type of the declarator contains parameter
19038 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19039 a parameter pack expansion expression. Otherwise, leave the
19040 ellipsis for a C-style variadic function. */
19043 {
19054 {
19055 /* Consume the `...'. */
19059 /* Build a pack expansion type */
19062 else
19064 }
19065 }
19067 /* The restriction on defining new types applies only to the type
19068 of the parameter, not to the default argument. */
19071 /* If the next token is `=', then process a default argument. */
19073 {
19075 /* If we are defining a class, then the tokens that make up the
19076 default argument must be saved and processed later. */
19081 /* Outside of a class definition, we can just parse the
19082 assignment-expression. */
19083 else
19084 default_argument
19088 {
19091 else
19092 {
19094 "default arguments are only "
19097 }
19098 }
19102 {
19103 /* Find the name of the parameter pack. */
19110 template_parm_p
19116 else
19118 template_parm_p
19125 }
19126 }
19127 else
19131 declarator,
19132 default_argument);
19133 }
19135 /* Parse a default argument and return it.
19137 TEMPLATE_PARM_P is true if this is a default argument for a
19138 non-type template parameter. */
19139 static tree
19141 {
19147 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19148 set correctly. */
19151 /* Local variable names (and the `this' keyword) may not
19152 appear in a default argument. */
19155 /* Parse the assignment-expression. */
19160 /* The "this" pointer is not valid in a default argument. */
19162 {
19167 }
19168 default_argument
19170 /* Restore the "this" pointer. */
19172 {
19175 }
19184 }
19186 /* Parse a function-body.
19188 function-body:
19189 compound_statement */
19191 static void
19193 {
19195 }
19197 /* Parse a ctor-initializer-opt followed by a function-body. Return
19198 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19199 is true we are parsing a function-try-block. */
19201 static bool
19204 {
19212 /* Begin the function body. */
19214 /* Parse the optional ctor-initializer. */
19217 /* If we're parsing a constexpr constructor definition, we need
19218 to check that the constructor body is indeed empty. However,
19219 before we get to cp_parser_function_body lot of junk has been
19220 generated, so we can't just check that we have an empty block.
19221 Rather we take a snapshot of the outermost block, and check whether
19222 cp_parser_function_body changed its state. */
19224 {
19228 }
19229 /* Parse the function-body. */
19233 /* Finish the function body. */
19237 }
19239 /* Parse an initializer.
19241 initializer:
19242 = initializer-clause
19243 ( expression-list )
19245 Returns an expression representing the initializer. If no
19246 initializer is present, NULL_TREE is returned.
19248 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19249 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19250 set to TRUE if there is no initializer present. If there is an
19251 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19252 is set to true; otherwise it is set to false. */
19254 static tree
19257 {
19259 tree init;
19261 /* Peek at the next token. */
19264 /* Let our caller know whether or not this initializer was
19265 parenthesized. */
19267 /* Assume that the initializer is constant. */
19271 {
19272 /* Consume the `='. */
19274 /* Parse the initializer-clause. */
19276 }
19278 {
19283 non_constant_p);
19288 }
19290 {
19295 }
19296 else
19297 {
19298 /* Anything else is an error. */
19301 }
19304 }
19306 /* Parse an initializer-clause.
19308 initializer-clause:
19309 assignment-expression
19310 braced-init-list
19312 Returns an expression representing the initializer.
19314 If the `assignment-expression' production is used the value
19315 returned is simply a representation for the expression.
19317 Otherwise, calls cp_parser_braced_list. */
19319 static tree
19321 {
19322 tree initializer;
19324 /* Assume the expression is constant. */
19327 /* If it is not a `{', then we are looking at an
19328 assignment-expression. */
19330 {
19331 initializer
19334 non_constant_p);
19335 }
19336 else
19340 }
19342 /* Parse a brace-enclosed initializer list.
19344 braced-init-list:
19345 { initializer-list , [opt] }
19346 { }
19348 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19349 the elements of the initializer-list (or NULL, if the last
19350 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19351 NULL_TREE. There is no way to detect whether or not the optional
19352 trailing `,' was provided. NON_CONSTANT_P is as for
19353 cp_parser_initializer. */
19355 static tree
19357 {
19358 tree initializer;
19360 /* Consume the `{' token. */
19362 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19364 /* If it's not a `}', then there is a non-trivial initializer. */
19366 {
19367 /* Parse the initializer list. */
19370 /* A trailing `,' token is allowed. */
19373 }
19374 else
19376 /* Now, there should be a trailing `}'. */
19380 }
19382 /* Consume tokens up to, and including, the next non-nested closing `]'.
19383 Returns true iff we found a closing `]'. */
19385 static bool
19387 {
19391 {
19395 {
19398 /* If we've run out of tokens, then there is no closing `]'. */
19407 {
19410 }
19415 }
19417 /* Consume the token. */
19419 }
19420 }
19422 /* Return true if we are looking at an array-designator, false otherwise. */
19424 static bool
19426 {
19427 /* Consume the `['. */
19432 /* Skip tokens until the next token is a closing square bracket.
19433 If we find the closing `]', and the next token is a `=', then
19434 we are looking at an array designator. */
19435 bool array_designator_p
19439 /* Roll back the tokens we skipped. */
19443 }
19445 /* Parse an initializer-list.
19447 initializer-list:
19448 initializer-clause ... [opt]
19449 initializer-list , initializer-clause ... [opt]
19451 GNU Extension:
19453 initializer-list:
19454 designation initializer-clause ...[opt]
19455 initializer-list , designation initializer-clause ...[opt]
19457 designation:
19458 . identifier =
19459 identifier :
19460 [ constant-expression ] =
19462 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19463 for the initializer. If the INDEX of the elt is non-NULL, it is the
19464 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19465 as for cp_parser_initializer. */
19469 {
19472 /* Assume all of the expressions are constant. */
19475 /* Parse the rest of the list. */
19477 {
19479 tree designator;
19480 tree initializer;
19483 /* If the next token is an identifier and the following one is a
19484 colon, we are looking at the GNU designated-initializer
19485 syntax. */
19489 {
19490 /* Warn the user that they are using an extension. */
19493 /* Consume the identifier. */
19495 /* Consume the `:'. */
19497 }
19498 /* Also handle the C99 syntax, '. id ='. */
19503 {
19504 /* Warn the user that they are using an extension. */
19507 /* Consume the `.'. */
19509 /* Consume the identifier. */
19511 /* Consume the `='. */
19513 }
19514 /* Also handle C99 array designators, '[ const ] ='. */
19518 {
19519 /* In C++11, [ could start a lambda-introducer. */
19525 {
19528 }
19529 else
19530 {
19535 }
19541 }
19542 else
19545 /* Parse the initializer. */
19548 /* If any clause is non-constant, so is the entire initializer. */
19552 /* If we have an ellipsis, this is an initializer pack
19553 expansion. */
19555 {
19556 /* Consume the `...'. */
19559 /* Turn the initializer into an initializer expansion. */
19561 }
19563 /* Add it to the vector. */
19566 /* If the next token is not a comma, we have reached the end of
19567 the list. */
19571 /* Peek at the next token. */
19573 /* If the next token is a `}', then we're still done. An
19574 initializer-clause can have a trailing `,' after the
19575 initializer-list and before the closing `}'. */
19579 /* Consume the `,' token. */
19581 }
19584 }
19586 /* Classes [gram.class] */
19588 /* Parse a class-name.
19590 class-name:
19591 identifier
19592 template-id
19594 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19595 to indicate that names looked up in dependent types should be
19596 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19597 keyword has been used to indicate that the name that appears next
19598 is a template. TAG_TYPE indicates the explicit tag given before
19599 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19600 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19601 is the class being defined in a class-head.
19603 Returns the TYPE_DECL representing the class. */
19605 static tree
19613 {
19614 tree decl;
19615 tree scope;
19620 /* All class-names start with an identifier. */
19623 {
19626 }
19628 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19629 to a template-id, so we save it here. */
19634 /* Any name names a type if we're following the `typename' keyword
19635 in a qualified name where the enclosing scope is type-dependent. */
19638 /* Handle the common case (an identifier, but not a template-id)
19639 efficiently. */
19642 {
19646 /* Look for the identifier. */
19650 /* If the next token isn't an identifier, we are certainly not
19651 looking at a class-name. */
19654 /* If we know this is a type-name, there's no need to look it
19655 up. */
19658 else
19659 {
19660 tree ambiguous_decls;
19661 /* If we already know that this lookup is ambiguous, then
19662 we've already issued an error message; there's no reason
19663 to check again. */
19665 {
19668 }
19669 /* If the next token is a `::', then the name must be a type
19670 name.
19672 [basic.lookup.qual]
19674 During the lookup for a name preceding the :: scope
19675 resolution operator, object, function, and enumerator
19676 names are ignored. */
19679 /* Look up the name. */
19681 tag_type,
19684 check_dependency_p,
19688 {
19692 }
19693 }
19694 }
19695 else
19696 {
19697 /* Try a template-id. */
19699 check_dependency_p,
19700 tag_type,
19701 is_declaration);
19704 }
19708 /* If this is a typename, create a TYPENAME_TYPE. */
19710 {
19715 }
19719 /* Check to see that it is really the name of a class. */
19723 /* Situations like this:
19725 template <typename T> struct A {
19726 typename T::template X<int>::I i;
19727 };
19729 are problematic. Is `T::template X<int>' a class-name? The
19730 standard does not seem to be definitive, but there is no other
19731 valid interpretation of the following `::'. Therefore, those
19732 names are considered class-names. */
19733 {
19737 }
19741 /* In Objective-C 2.0, a classname followed by '.' starts a
19742 dot-syntax expression, and it's not a type-name. */
19754 }
19756 /* Parse a class-specifier.
19758 class-specifier:
19759 class-head { member-specification [opt] }
19761 Returns the TREE_TYPE representing the class. */
19763 static tree
19765 {
19766 tree type;
19780 /* Parse the class-head. */
19783 /* If the class-head was a semantic disaster, skip the entire body
19784 of the class. */
19786 {
19790 }
19792 /* Look for the `{'. */
19794 {
19797 }
19801 /* Issue an error message if type-definitions are forbidden here. */
19803 /* Remember that we are defining one more class. */
19805 /* Inside the class, surrounding template-parameter-lists do not
19806 apply. */
19807 saved_num_template_parameter_lists
19810 /* We are not in a function body. */
19813 /* Or in a loop. */
19816 /* Or in a switch. */
19819 /* We are not immediately inside an extern "lang" block. */
19820 saved_in_unbraced_linkage_specification_p
19824 /* Start the class. */
19826 {
19829 }
19833 /* If the type is erroneous, skip the entire body of the class. */
19835 else
19836 /* Parse the member-specification. */
19839 /* Look for the trailing `}'. */
19841 /* Look for trailing attributes to apply to this class. */
19849 /* We've finished a type definition. Check for the common syntax
19850 error of forgetting a semicolon after the definition. We need to
19851 be careful, as we can't just check for not-a-semicolon and be done
19852 with it; the user might have typed:
19854 class X { } c = ...;
19855 class X { } *p = ...;
19857 and so forth. Instead, enumerate all the possible tokens that
19858 might follow this production; if we don't see one of them, then
19859 complain and silently insert the semicolon. */
19860 {
19865 /* Don't try to parse c++11 attributes here. As per the
19866 grammar, that should be a task for
19867 cp_parser_decl_specifier_seq. */
19871 {
19882 /* While it's legal for type qualifiers and storage class
19883 specifiers to follow type definitions in the grammar, only
19884 compiler testsuites contain code like that. Assume that if
19885 we see such code, then what we're really seeing is a case
19886 like:
19888 class X { }
19889 const <type> var = ...;
19891 or
19893 class Y { }
19894 static <type> func (...) ...
19896 i.e. the qualifier or specifier applies to the next
19897 declaration. To do so, however, we need to look ahead one
19898 more token to see if *that* token is a type specifier.
19900 This code could be improved to handle:
19902 class Z { }
19903 static const <type> var = ...; */
19906 {
19909 /* Handling user-defined types here would be nice, but very
19910 tricky. */
19911 want_semicolon
19914 }
19918 }
19920 /* If we don't have a type, then something is very wrong and we
19921 shouldn't try to do anything clever. Likewise for not seeing the
19922 closing brace. */
19924 {
19925 cp_token_position prev
19936 else
19939 /* Unget one token and smash it to look as though we encountered
19940 a semicolon in the input stream. */
19945 }
19946 }
19948 /* If this class is not itself within the scope of another class,
19949 then we need to parse the bodies of all of the queued function
19950 definitions. Note that the queued functions defined in a class
19951 are not always processed immediately following the
19952 class-specifier for that class. Consider:
19954 struct A {
19955 struct B { void f() { sizeof (A); } };
19956 };
19958 If `f' were processed before the processing of `A' were
19959 completed, there would be no way to compute the size of `A'.
19960 Note that the nesting we are interested in here is lexical --
19961 not the semantic nesting given by TYPE_CONTEXT. In particular,
19962 for:
19964 struct A { struct B; };
19965 struct A::B { void f() { } };
19967 there is no need to delay the parsing of `A::B::f'. */
19969 {
19970 tree decl;
19977 /* In a first pass, parse default arguments to the functions.
19978 Then, in a second pass, parse the bodies of the functions.
19979 This two-phased approach handles cases like:
19981 struct S {
19982 void f() { g(); }
19983 void g(int i = 3);
19984 };
19986 */
19988 {
19990 /* If there are default arguments that have not yet been processed,
19991 take care of them now. */
19993 {
19998 }
19999 /* Make sure that any template parameters are in scope. */
20001 /* Parse the default argument expressions. */
20003 /* Remove any template parameters from the symbol table. */
20005 }
20007 /* Now parse any NSDMIs. */
20011 {
20013 {
20018 }
20021 }
20028 /* Now do some post-NSDMI bookkeeping. */
20034 /* Now parse the body of the functions. */
20036 {
20037 /* OpenMP UDRs need to be parsed before all other functions. */
20044 }
20045 else
20049 }
20050 else
20053 /* Put back any saved access checks. */
20056 /* Restore saved state. */
20060 parser->num_template_parameter_lists
20062 parser->in_unbraced_linkage_specification_p
20066 }
20068 static tree
20070 {
20071 tree ret;
20076 }
20078 /* Parse a class-head.
20080 class-head:
20081 class-key identifier [opt] base-clause [opt]
20082 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20083 class-key nested-name-specifier [opt] template-id
20084 base-clause [opt]
20086 class-virt-specifier:
20087 final
20089 GNU Extensions:
20090 class-key attributes identifier [opt] base-clause [opt]
20091 class-key attributes nested-name-specifier identifier base-clause [opt]
20092 class-key attributes nested-name-specifier [opt] template-id
20093 base-clause [opt]
20095 Upon return BASES is initialized to the list of base classes (or
20096 NULL, if there are none) in the same form returned by
20097 cp_parser_base_clause.
20099 Returns the TYPE of the indicated class. Sets
20100 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20101 involving a nested-name-specifier was used, and FALSE otherwise.
20103 Returns error_mark_node if this is not a class-head.
20105 Returns NULL_TREE if the class-head is syntactically valid, but
20106 semantically invalid in a way that means we should skip the entire
20107 body of the class. */
20109 static tree
20112 {
20113 tree nested_name_specifier;
20117 tree attributes;
20118 tree bases;
20128 /* Assume no nested-name-specifier will be present. */
20130 /* Assume no template parameter lists will be used in defining the
20131 type. */
20135 /* Look for the class-key. */
20140 /* Parse the attributes. */
20143 /* If the next token is `::', that is invalid -- but sometimes
20144 people do try to write:
20146 struct ::S {};
20148 Handle this gracefully by accepting the extra qualifier, and then
20149 issuing an error about it later if this really is a
20150 class-head. If it turns out just to be an elaborated type
20151 specifier, remain silent. */
20157 /* Determine the name of the class. Begin by looking for an
20158 optional nested-name-specifier. */
20160 nested_name_specifier
20166 /* If there was a nested-name-specifier, then there *must* be an
20167 identifier. */
20169 {
20171 /* Although the grammar says `identifier', it really means
20172 `class-name' or `template-name'. You are only allowed to
20173 define a class that has already been declared with this
20174 syntax.
20176 The proposed resolution for Core Issue 180 says that wherever
20177 you see `class T::X' you should treat `X' as a type-name.
20179 It is OK to define an inaccessible class; for example:
20181 class A { class B; };
20182 class A::B {};
20184 We do not know if we will see a class-name, or a
20185 template-name. We look for a class-name first, in case the
20186 class-name is a template-id; if we looked for the
20187 template-name first we would stop after the template-name. */
20192 class_type,
20196 /* If that didn't work, ignore the nested-name-specifier. */
20198 {
20204 }
20205 /* If we could not find a corresponding TYPE, treat this
20206 declaration like an unqualified declaration. */
20209 /* Otherwise, count the number of templates used in TYPE and its
20210 containing scopes. */
20211 else
20212 {
20213 tree scope;
20225 }
20226 }
20227 /* Otherwise, the identifier is optional. */
20228 else
20229 {
20230 /* We don't know whether what comes next is a template-id,
20231 an identifier, or nothing at all. */
20233 /* Check for a template-id. */
20238 class_key,
20240 /* If that didn't work, it could still be an identifier. */
20242 {
20244 {
20247 }
20248 else
20250 }
20251 else
20252 {
20255 }
20256 }
20261 {
20263 class_key,
20265 }
20268 /* If it's not a `:' or a `{' then we can't really be looking at a
20269 class-head, since a class-head only appears as part of a
20270 class-specifier. We have to detect this situation before calling
20271 xref_tag, since that has irreversible side-effects. */
20273 {
20277 }
20279 /* At this point, we're going ahead with the class-specifier, even
20280 if some other problem occurs. */
20283 {
20288 }
20289 /* Issue the error about the overly-qualified name now. */
20291 {
20296 }
20298 {
20303 }
20305 {
20306 tree scope;
20308 /* Reject typedef-names in class heads. */
20310 {
20313 type);
20316 }
20318 /* Figure out in what scope the declaration is being placed. */
20320 /* If that scope does not contain the scope in which the
20321 class was originally declared, the program is invalid. */
20323 {
20326 "declaration of %qD in namespace %qD which does not "
20329 else
20335 }
20336 /* [dcl.meaning]
20338 A declarator-id shall not be qualified except for the
20339 definition of a ... nested class outside of its class
20340 ... [or] the definition or explicit instantiation of a
20341 class member of a namespace outside of its namespace. */
20343 {
20348 }
20349 }
20350 /* An explicit-specialization must be preceded by "template <>". If
20351 it is not, try to recover gracefully. */
20355 {
20359 /* Take the same action that would have been taken by
20360 cp_parser_explicit_specialization. */
20363 }
20364 /* There must be no "return" statements between this point and the
20365 end of this function; set "type "to the correct return value and
20366 use "goto done;" to return. */
20367 /* Make sure that the right number of template parameters were
20368 present. */
20372 {
20373 /* If something went wrong, there is no point in even trying to
20374 process the class-definition. */
20377 }
20379 /* Look up the type. */
20381 {
20385 {
20389 }
20390 else
20391 {
20394 }
20397 }
20399 {
20400 tree class_type;
20402 /* Given:
20404 template <typename T> struct S { struct T };
20405 template <typename T> struct S<T>::T { };
20407 we will get a TYPENAME_TYPE when processing the definition of
20408 `S::T'. We need to resolve it to the actual type before we
20409 try to define it. */
20411 {
20416 else
20417 {
20420 }
20421 }
20425 {
20428 }
20431 /* Enter the scope indicated by the nested-name-specifier. */
20433 /* Get the canonical version of this type. */
20435 /* Call push_template_decl if it seems like we should be defining a
20436 template either from the template headers or the type we're
20437 defining, so that we diagnose both extra and missing headers. */
20441 {
20444 {
20447 }
20448 }
20452 }
20454 {
20455 /* If the class was unnamed, create a dummy name. */
20460 }
20462 /* Indicate whether this class was declared as a `class' or as a
20463 `struct'. */
20468 /* If this type was already complete, and we see another definition,
20469 that's an error. */
20471 {
20473 type);
20475 type);
20478 }
20483 {
20484 /* Apply attributes now, before any use of the class as a template
20485 argument in its base list. */
20488 }
20490 /* We will have entered the scope containing the class; the names of
20491 base classes should be looked up in that context. For example:
20493 struct A { struct B {}; struct C; };
20494 struct A::C : B {};
20496 is valid. */
20498 /* Get the list of base-classes, if there is one. */
20500 {
20501 /* PR59482: enter the class scope so that base-specifiers are looked
20502 up correctly. */
20506 /* PR59482: get out of the previously pushed class scope so that the
20507 subsequent pops pop the right thing. */
20510 }
20511 else
20514 /* If we're really defining a class, process the base classes.
20515 If they're invalid, fail. */
20520 done:
20521 /* Leave the scope given by the nested-name-specifier. We will
20522 enter the class scope itself while processing the members. */
20527 {
20530 }
20536 out:
20539 }
20541 /* Parse a class-key.
20543 class-key:
20544 class
20545 struct
20546 union
20548 Returns the kind of class-key specified, or none_type to indicate
20549 error. */
20551 static enum tag_types
20553 {
20557 /* Look for the class-key. */
20562 /* Check to see if the TOKEN is a class-key. */
20567 }
20569 /* Parse a type-parameter-key.
20571 type-parameter-key:
20572 class
20573 typename
20574 */
20576 static void
20578 {
20579 /* Look for the type-parameter-key. */
20583 {
20586 /* typename is not allowed in a template template parameter
20587 by the standard until C++1Z. */
20589 "ISO C++ forbids typename key in template template parameter;"
20591 }
20592 else
20596 }
20598 /* Parse an (optional) member-specification.
20600 member-specification:
20601 member-declaration member-specification [opt]
20602 access-specifier : member-specification [opt] */
20604 static void
20606 {
20608 {
20612 /* Peek at the next token. */
20614 /* If it's a `}', or EOF then we've seen all the members. */
20620 /* See if this token is a keyword. */
20623 {
20627 /* Consume the access-specifier. */
20629 /* Remember which access-specifier is active. */
20631 /* Look for the `:'. */
20636 /* Accept #pragmas at class scope. */
20638 {
20641 }
20643 /* Otherwise, the next construction must be a
20644 member-declaration. */
20646 }
20647 }
20648 }
20650 /* Parse a member-declaration.
20652 member-declaration:
20653 decl-specifier-seq [opt] member-declarator-list [opt] ;
20654 function-definition ; [opt]
20655 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20656 using-declaration
20657 template-declaration
20658 alias-declaration
20660 member-declarator-list:
20661 member-declarator
20662 member-declarator-list , member-declarator
20664 member-declarator:
20665 declarator pure-specifier [opt]
20666 declarator constant-initializer [opt]
20667 identifier [opt] : constant-expression
20669 GNU Extensions:
20671 member-declaration:
20672 __extension__ member-declaration
20674 member-declarator:
20675 declarator attributes [opt] pure-specifier [opt]
20676 declarator attributes [opt] constant-initializer [opt]
20677 identifier [opt] attributes [opt] : constant-expression
20679 C++0x Extensions:
20681 member-declaration:
20682 static_assert-declaration */
20684 static void
20686 {
20687 cp_decl_specifier_seq decl_specifiers;
20688 tree prefix_attributes;
20689 tree decl;
20698 /* Check for the `__extension__' keyword. */
20700 {
20701 /* Recurse. */
20703 /* Restore the old value of the PEDANTIC flag. */
20707 }
20709 /* Check for a template-declaration. */
20711 {
20712 /* An explicit specialization here is an error condition, and we
20713 expect the specialization handler to detect and report this. */
20717 else
20721 }
20723 /* Check for a using-declaration. */
20725 {
20727 {
20728 /* Parse the using-declaration. */
20732 }
20733 else
20734 {
20735 tree decl;
20739 /* Note that if we actually see the '=' token after the
20740 identifier, cp_parser_alias_declaration commits the
20741 tentative parse. In that case, we really expects an
20742 alias-declaration. Otherwise, we expect a using
20743 declaration. */
20744 alias_decl_expected =
20750 else
20754 }
20755 }
20757 /* Check for @defs. */
20759 {
20764 {
20769 }
20771 }
20773 /* If the next token is `static_assert' we have a static assertion. */
20775 {
20778 }
20785 /* Parse the decl-specifier-seq. */
20788 CP_PARSER_FLAGS_OPTIONAL,
20791 /* Check for an invalid type-name. */
20795 /* If there is no declarator, then the decl-specifier-seq should
20796 specify a type. */
20798 {
20799 /* If there was no decl-specifier-seq, and the next token is a
20800 `;', then we have something like:
20802 struct S { ; };
20804 [class.mem]
20806 Each member-declaration shall declare at least one member
20807 name of the class. */
20809 {
20813 }
20814 else
20815 {
20816 tree type;
20818 /* See if this declaration is a friend. */
20820 /* If there were decl-specifiers, check to see if there was
20821 a class-declaration. */
20824 /* Nested classes have already been added to the class, but
20825 a `friend' needs to be explicitly registered. */
20827 {
20828 /* If the `friend' keyword was present, the friend must
20829 be introduced with a class-key. */
20832 "in C++03 a class-key must be used "
20834 /* In this case:
20836 template <typename T> struct A {
20837 friend struct A<T>::B;
20838 };
20840 A<T>::B will be represented by a TYPENAME_TYPE, and
20841 therefore not recognized by check_tag_decl. */
20843 {
20847 }
20850 "friend declaration does not name a class or "
20852 else
20855 }
20856 /* If there is no TYPE, an error message will already have
20857 been issued. */
20859 ;
20860 /* An anonymous aggregate has to be handled specially; such
20861 a declaration really declares a data member (with a
20862 particular type), as opposed to a nested class. */
20864 {
20865 /* C++11 9.5/6. */
20868 "a storage class on an anonymous aggregate "
20871 /* Remove constructors and such from TYPE, now that we
20872 know it is an anonymous aggregate. */
20874 /* And make the corresponding data member. */
20877 /* Add it to the class. */
20879 }
20880 else
20881 cp_parser_check_access_in_redeclaration
20884 }
20885 }
20886 else
20887 {
20890 /* Clear attributes from the decl_specifiers but keep them
20891 around as prefix attributes that apply them to the entity
20892 being declared. */
20896 /* See if these declarations will be friends. */
20899 /* Keep going until we hit the `;' at the end of the
20900 declaration. */
20902 {
20904 tree first_attribute;
20906 /* Peek at the next token. */
20909 /* Check for a bitfield declaration. */
20914 {
20915 tree identifier;
20916 tree width;
20918 /* Get the name of the bitfield. Note that we cannot just
20919 check TOKEN here because it may have been invalidated by
20920 the call to cp_lexer_peek_nth_token above. */
20923 else
20926 /* Consume the `:' token. */
20928 /* Get the width of the bitfield. */
20929 width
20932 /* Look for attributes that apply to the bitfield. */
20934 /* Remember which attributes are prefix attributes and
20935 which are not. */
20937 /* Combine the attributes. */
20940 /* Create the bitfield declaration. */
20943 identifier,
20944 sfk_none)
20947 width,
20948 attributes);
20949 }
20950 else
20951 {
20953 tree initializer;
20954 tree asm_specification;
20957 /* Parse the declarator. */
20958 declarator
20963 friend_p);
20965 /* If something went wrong parsing the declarator, make sure
20966 that we at least consume some tokens. */
20968 {
20969 /* Skip to the end of the statement. */
20971 /* If the next token is not a semicolon, that is
20972 probably because we just skipped over the body of
20973 a function. So, we consume a semicolon if
20974 present, but do not issue an error message if it
20975 is not present. */
20977 CPP_SEMICOLON))
20980 }
20983 cp_parser_check_for_definition_in_return_type
20987 /* Look for an asm-specification. */
20989 /* Look for attributes that apply to the declaration. */
20991 /* Remember which attributes are prefix attributes and
20992 which are not. */
20994 /* Combine the attributes. */
20997 /* If it's an `=', then we have a constant-initializer or a
20998 pure-specifier. It is not correct to parse the
20999 initializer before registering the member declaration
21000 since the member declaration should be in scope while
21001 its initializer is processed. However, the rest of the
21002 front end does not yet provide an interface that allows
21003 us to handle this correctly. */
21005 {
21006 /* In [class.mem]:
21008 A pure-specifier shall be used only in the declaration of
21009 a virtual function.
21011 A member-declarator can contain a constant-initializer
21012 only if it declares a static member of integral or
21013 enumeration type.
21015 Therefore, if the DECLARATOR is for a function, we look
21016 for a pure-specifier; otherwise, we look for a
21017 constant-initializer. When we call `grokfield', it will
21018 perform more stringent semantics checks. */
21030 {
21032 /* Don't require a constant rvalue in C++11, since we
21033 might want a reference constant. We'll enforce
21034 constancy later. */
21036 /* Parse the initializer. */
21039 }
21040 else
21041 /* Parse the initializer. */
21043 }
21046 {
21050 else
21052 }
21053 /* Otherwise, there is no initializer. */
21054 else
21057 /* See if we are probably looking at a function
21058 definition. We are certainly not looking at a
21059 member-declarator. Calling `grokfield' has
21060 side-effects, so we must not do it unless we are sure
21061 that we are looking at a member-declarator. */
21064 {
21065 /* The grammar does not allow a pure-specifier to be
21066 used when a member function is defined. (It is
21067 possible that this fact is an oversight in the
21068 standard, since a pure function may be defined
21069 outside of the class-specifier. */
21075 declarator,
21076 attributes);
21079 /* If the member was not a friend, declare it here. */
21082 /* Peek at the next token. */
21084 /* If the next token is a semicolon, consume it. */
21088 }
21089 else
21092 /* Create the declaration. */
21097 {
21100 else
21102 }
21103 }
21107 /* Reset PREFIX_ATTRIBUTES. */
21113 /* If there is any qualification still in effect, clear it
21114 now; we will be starting fresh with the next declarator. */
21118 /* If it's a `,', then there are more declarators. */
21120 {
21123 {
21127 }
21128 }
21129 /* If the next token isn't a `;', then we have a parse error. */
21131 CPP_SEMICOLON))
21132 {
21133 /* The next token might be a ways away from where the
21134 actual semicolon is missing. Find the previous token
21135 and use that for our error position. */
21140 /* Assume that the user meant to provide a semicolon. If
21141 we were to cp_parser_skip_to_end_of_statement, we might
21142 skip to a semicolon inside a member function definition
21143 and issue nonsensical error messages. */
21145 }
21148 {
21149 /* Add DECL to the list of members. */
21151 /* Explicitly include, eg, NSDMIs, for better error
21152 recovery (c++/58650). */
21161 /* Add DECL to the queue of NSDMI to be parsed later. */
21163 }
21167 }
21168 }
21171 out:
21173 }
21175 /* Parse a pure-specifier.
21177 pure-specifier:
21178 = 0
21180 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21181 Otherwise, ERROR_MARK_NODE is returned. */
21183 static tree
21185 {
21188 /* Look for the `=' token. */
21191 /* Look for the `0' token. */
21200 /* Accept = default or = delete in c++0x mode. */
21203 {
21206 }
21208 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21210 {
21215 }
21217 {
21220 }
21223 }
21225 /* Parse a constant-initializer.
21227 constant-initializer:
21228 = constant-expression
21230 Returns a representation of the constant-expression. */
21232 static tree
21234 {
21235 /* Look for the `=' token. */
21239 /* It is invalid to write:
21241 struct S { static const int i = { 7 }; };
21243 */
21245 {
21248 /* Consume the opening brace. */
21250 /* Skip the initializer. */
21252 /* Look for the trailing `}'. */
21256 }
21259 }
21261 /* Derived classes [gram.class.derived] */
21263 /* Parse a base-clause.
21265 base-clause:
21266 : base-specifier-list
21268 base-specifier-list:
21269 base-specifier ... [opt]
21270 base-specifier-list , base-specifier ... [opt]
21272 Returns a TREE_LIST representing the base-classes, in the order in
21273 which they were declared. The representation of each node is as
21274 described by cp_parser_base_specifier.
21276 In the case that no bases are specified, this function will return
21277 NULL_TREE, not ERROR_MARK_NODE. */
21279 static tree
21281 {
21284 /* Look for the `:' that begins the list. */
21287 /* Scan the base-specifier-list. */
21289 {
21291 tree base;
21294 /* Look for the base-specifier. */
21296 /* Look for the (optional) ellipsis. */
21298 {
21299 /* Consume the `...'. */
21303 }
21305 /* Add BASE to the front of the list. */
21307 {
21309 /* Make this a pack expansion type. */
21313 {
21316 }
21317 }
21318 /* Peek at the next token. */
21320 /* If it's not a comma, then the list is complete. */
21323 /* Consume the `,'. */
21325 }
21327 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21328 base class had a qualified name. However, the next name that
21329 appears is certainly not qualified. */
21335 }
21337 /* Parse a base-specifier.
21339 base-specifier:
21340 :: [opt] nested-name-specifier [opt] class-name
21341 virtual access-specifier [opt] :: [opt] nested-name-specifier
21342 [opt] class-name
21343 access-specifier virtual [opt] :: [opt] nested-name-specifier
21344 [opt] class-name
21346 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21347 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21348 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21349 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21351 static tree
21353 {
21361 tree type;
21363 /* Process the optional `virtual' and `access-specifier'. */
21365 {
21366 /* Peek at the next token. */
21368 /* Process `virtual'. */
21370 {
21372 /* If `virtual' appears more than once, issue an error. */
21374 {
21378 }
21382 /* Consume the `virtual' token. */
21390 /* If more than one access specifier appears, issue an
21391 error. */
21394 {
21398 }
21402 /* Consume the access-specifier. */
21410 }
21411 }
21412 /* It is not uncommon to see programs mechanically, erroneously, use
21413 the 'typename' keyword to denote (dependent) qualified types
21414 as base classes. */
21416 {
21421 else
21423 "keyword %<typename%> not allowed in this context "
21426 }
21428 /* Look for the optional `::' operator. */
21430 /* Look for the nested-name-specifier. The simplest way to
21431 implement:
21433 [temp.res]
21435 The keyword `typename' is not permitted in a base-specifier or
21436 mem-initializer; in these contexts a qualified name that
21437 depends on a template-parameter is implicitly assumed to be a
21438 type name.
21440 is to pretend that we have seen the `typename' keyword at this
21441 point. */
21445 typename_type,
21447 /* If the base class is given by a qualified name, assume that names
21448 we see are type names or templates, as appropriate. */
21454 /* DR 950 allows decltype as a base-specifier. */
21456 else
21457 {
21458 /* Otherwise, look for the class-name. */
21460 class_scope_p,
21461 template_p,
21462 typename_type,
21467 }
21473 }
21475 /* Exception handling [gram.exception] */
21477 /* Parse an (optional) noexcept-specification.
21479 noexcept-specification:
21480 noexcept ( constant-expression ) [opt]
21482 If no noexcept-specification is present, returns NULL_TREE.
21483 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21484 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21485 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21486 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21487 in which case a boolean condition is returned instead. */
21489 static tree
21494 {
21498 /* Peek at the next token. */
21501 /* Is it a noexcept-specification? */
21503 {
21504 tree expr;
21508 {
21512 {
21513 /* Types may not be defined in an exception-specification. */
21515 parser->type_definition_forbidden_message
21520 /* Restore the saved message. */
21522 }
21523 else
21524 {
21527 }
21530 }
21531 else
21532 {
21536 }
21538 /* We cannot build a noexcept-spec right away because this will check
21539 that expr is a constexpr. */
21542 else
21544 }
21545 else
21547 }
21549 /* Parse an (optional) exception-specification.
21551 exception-specification:
21552 throw ( type-id-list [opt] )
21554 Returns a TREE_LIST representing the exception-specification. The
21555 TREE_VALUE of each node is a type. */
21557 static tree
21559 {
21561 tree type_id_list;
21564 /* Peek at the next token. */
21567 /* Is it a noexcept-specification? */
21573 /* If it's not `throw', then there's no exception-specification. */
21577 #if 0
21578 /* Enable this once a lot of code has transitioned to noexcept? */
21582 #endif
21584 /* Consume the `throw'. */
21587 /* Look for the `('. */
21590 /* Peek at the next token. */
21592 /* If it's not a `)', then there is a type-id-list. */
21594 {
21595 /* Types may not be defined in an exception-specification. */
21597 parser->type_definition_forbidden_message
21599 /* Parse the type-id-list. */
21601 /* Restore the saved message. */
21603 }
21604 else
21607 /* Look for the `)'. */
21611 }
21613 /* Parse an (optional) type-id-list.
21615 type-id-list:
21616 type-id ... [opt]
21617 type-id-list , type-id ... [opt]
21619 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21620 in the order that the types were presented. */
21622 static tree
21624 {
21628 {
21630 tree type;
21632 /* Get the next type-id. */
21634 /* Parse the optional ellipsis. */
21636 {
21637 /* Consume the `...'. */
21640 /* Turn the type into a pack expansion expression. */
21642 }
21643 /* Add it to the list. */
21645 /* Peek at the next token. */
21647 /* If it is not a `,', we are done. */
21650 /* Consume the `,'. */
21652 }
21655 }
21657 /* Parse a try-block.
21659 try-block:
21660 try compound-statement handler-seq */
21662 static tree
21664 {
21665 tree try_block;
21679 }
21681 /* Parse a function-try-block.
21683 function-try-block:
21684 try ctor-initializer [opt] function-body handler-seq */
21686 static bool
21688 {
21689 tree compound_stmt;
21690 tree try_block;
21693 /* Look for the `try' keyword. */
21696 /* Let the rest of the front end know where we are. */
21698 /* Parse the function-body. */
21699 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21701 /* We're done with the `try' part. */
21703 /* Parse the handlers. */
21705 /* We're done with the handlers. */
21709 }
21711 /* Parse a handler-seq.
21713 handler-seq:
21714 handler handler-seq [opt] */
21716 static void
21718 {
21720 {
21723 /* Parse the handler. */
21725 /* Peek at the next token. */
21727 /* If it's not `catch' then there are no more handlers. */
21730 }
21731 }
21733 /* Parse a handler.
21735 handler:
21736 catch ( exception-declaration ) compound-statement */
21738 static void
21740 {
21741 tree handler;
21742 tree declaration;
21752 }
21754 /* Parse an exception-declaration.
21756 exception-declaration:
21757 type-specifier-seq declarator
21758 type-specifier-seq abstract-declarator
21759 type-specifier-seq
21760 ...
21762 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21763 ellipsis variant is used. */
21765 static tree
21767 {
21768 cp_decl_specifier_seq type_specifiers;
21772 /* If it's an ellipsis, it's easy to handle. */
21774 {
21775 /* Consume the `...' token. */
21778 }
21780 /* Types may not be defined in exception-declarations. */
21782 parser->type_definition_forbidden_message
21785 /* Parse the type-specifier-seq. */
21789 /* If it's a `)', then there is no declarator. */
21792 else
21799 /* Restore the saved message. */
21806 }
21808 /* Parse a throw-expression.
21810 throw-expression:
21811 throw assignment-expression [opt]
21813 Returns a THROW_EXPR representing the throw-expression. */
21815 static tree
21817 {
21818 tree expression;
21823 /* Figure out whether or not there is an assignment-expression
21824 following the "throw" keyword. */
21832 else
21836 }
21838 /* GNU Extensions */
21840 /* Parse an (optional) asm-specification.
21842 asm-specification:
21843 asm ( string-literal )
21845 If the asm-specification is present, returns a STRING_CST
21846 corresponding to the string-literal. Otherwise, returns
21847 NULL_TREE. */
21849 static tree
21851 {
21853 tree asm_specification;
21855 /* Peek at the next token. */
21857 /* If the next token isn't the `asm' keyword, then there's no
21858 asm-specification. */
21862 /* Consume the `asm' token. */
21864 /* Look for the `('. */
21867 /* Look for the string-literal. */
21870 /* Look for the `)'. */
21874 }
21876 /* Parse an asm-operand-list.
21878 asm-operand-list:
21879 asm-operand
21880 asm-operand-list , asm-operand
21882 asm-operand:
21883 string-literal ( expression )
21884 [ string-literal ] string-literal ( expression )
21886 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21887 each node is the expression. The TREE_PURPOSE is itself a
21888 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21889 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21890 is a STRING_CST for the string literal before the parenthesis. Returns
21891 ERROR_MARK_NODE if any of the operands are invalid. */
21893 static tree
21895 {
21900 {
21901 tree string_literal;
21902 tree expression;
21903 tree name;
21906 {
21907 /* Consume the `[' token. */
21909 /* Read the operand name. */
21914 /* Look for the closing `]'. */
21916 }
21917 else
21919 /* Look for the string-literal. */
21922 /* Look for the `('. */
21924 /* Parse the expression. */
21926 /* Look for the `)'. */
21934 /* Add this operand to the list. */
21936 expression,
21937 asm_operands);
21938 /* If the next token is not a `,', there are no more
21939 operands. */
21942 /* Consume the `,'. */
21944 }
21947 }
21949 /* Parse an asm-clobber-list.
21951 asm-clobber-list:
21952 string-literal
21953 asm-clobber-list , string-literal
21955 Returns a TREE_LIST, indicating the clobbers in the order that they
21956 appeared. The TREE_VALUE of each node is a STRING_CST. */
21958 static tree
21960 {
21964 {
21965 tree string_literal;
21967 /* Look for the string literal. */
21969 /* Add it to the list. */
21971 /* If the next token is not a `,', then the list is
21972 complete. */
21975 /* Consume the `,' token. */
21977 }
21980 }
21982 /* Parse an asm-label-list.
21984 asm-label-list:
21985 identifier
21986 asm-label-list , identifier
21988 Returns a TREE_LIST, indicating the labels in the order that they
21989 appeared. The TREE_VALUE of each node is a label. */
21991 static tree
21993 {
21997 {
22000 /* Look for the identifier. */
22003 {
22006 {
22012 }
22013 }
22014 /* If the next token is not a `,', then the list is
22015 complete. */
22018 /* Consume the `,' token. */
22020 }
22023 }
22025 /* Return TRUE iff the next tokens in the stream are possibly the
22026 beginning of a GNU extension attribute. */
22028 static bool
22030 {
22032 }
22034 /* Return TRUE iff the next tokens in the stream are possibly the
22035 beginning of a standard C++-11 attribute specifier. */
22037 static bool
22039 {
22041 }
22043 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22044 beginning of a standard C++-11 attribute specifier. */
22046 static bool
22048 {
22056 }
22058 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22059 beginning of a GNU extension attribute. */
22061 static bool
22063 {
22067 }
22069 /* Return true iff the next tokens can be the beginning of either a
22070 GNU attribute list, or a standard C++11 attribute sequence. */
22072 static bool
22074 {
22077 }
22079 /* Return true iff the next Nth tokens can be the beginning of either
22080 a GNU attribute list, or a standard C++11 attribute sequence. */
22082 static bool
22084 {
22087 }
22089 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22090 of GNU attributes, or return NULL. */
22092 static tree
22094 {
22098 }
22100 #define CILK_SIMD_FN_CLAUSE_MASK \
22101 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22102 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22103 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22104 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22105 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22107 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22108 vector [(<clauses>)] */
22110 static void
22112 {
22116 {
22121 }
22124 {
22127 paren_scope++;
22128 }
22130 {
22133 paren_scope++;
22135 paren_scope--;
22136 /* Do not push the last ')' */
22139 }
22148 }
22150 /* Parse an (optional) series of attributes.
22152 attributes:
22153 attributes attribute
22155 attribute:
22156 __attribute__ (( attribute-list [opt] ))
22158 The return value is as for cp_parser_gnu_attribute_list. */
22160 static tree
22162 {
22166 {
22168 tree attribute_list;
22171 /* Peek at the next token. */
22173 /* If it's not `__attribute__', then we're done. */
22177 /* Consume the `__attribute__' keyword. */
22179 /* Look for the two `(' tokens. */
22183 /* Peek at the next token. */
22186 /* Parse the attribute-list. */
22188 else
22189 /* If the next token is a `)', then there is no attribute
22190 list. */
22193 /* Look for the two `)' tokens. */
22201 /* Add these new attributes to the list. */
22203 }
22206 }
22208 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22209 "__vector" or "__vector__." */
22213 {
22217 }
22219 /* Parse a GNU attribute-list.
22221 attribute-list:
22222 attribute
22223 attribute-list , attribute
22225 attribute:
22226 identifier
22227 identifier ( identifier )
22228 identifier ( identifier , expression-list )
22229 identifier ( expression-list )
22231 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22232 to an attribute. The TREE_PURPOSE of each node is the identifier
22233 indicating which attribute is in use. The TREE_VALUE represents
22234 the arguments, if any. */
22236 static tree
22238 {
22244 {
22246 tree identifier;
22247 tree attribute;
22249 /* Look for the identifier. We also allow keywords here; for
22250 example `__attribute__ ((const))' is legal. */
22254 {
22257 /* Consume the token, but save it since we need it for the
22258 SIMD enabled function parsing. */
22261 /* Save away the identifier that indicates which attribute
22262 this is. */
22264 /* For keywords, use the canonical spelling, not the
22265 parsed identifier. */
22271 /* Peek at the next token. */
22273 /* If it's an `(', then parse the attribute arguments. */
22275 {
22280 {
22283 }
22284 else
22285 vec = cp_parser_parenthesized_expression_list
22291 else
22292 {
22295 }
22296 /* Save the arguments away. */
22298 }
22300 {
22303 }
22306 {
22307 /* Add this attribute to the list. */
22310 }
22313 }
22314 /* Now, look for more attributes. If the next token isn't a
22315 `,', we're done. */
22319 /* Consume the comma and keep going. */
22321 }
22324 /* We built up the list in reverse order. */
22326 }
22328 /* Parse a standard C++11 attribute.
22330 The returned representation is a TREE_LIST which TREE_PURPOSE is
22331 the scoped name of the attribute, and the TREE_VALUE is its
22332 arguments list.
22334 Note that the scoped name of the attribute is itself a TREE_LIST
22335 which TREE_PURPOSE is the namespace of the attribute, and
22336 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22337 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22338 and which TREE_PURPOSE is directly the attribute name.
22340 Clients of the attribute code should use get_attribute_namespace
22341 and get_attribute_name to get the actual namespace and name of
22342 attributes, regardless of their being GNU or C++11 attributes.
22344 attribute:
22345 attribute-token attribute-argument-clause [opt]
22347 attribute-token:
22348 identifier
22349 attribute-scoped-token
22351 attribute-scoped-token:
22352 attribute-namespace :: identifier
22354 attribute-namespace:
22355 identifier
22357 attribute-argument-clause:
22358 ( balanced-token-seq )
22360 balanced-token-seq:
22361 balanced-token [opt]
22362 balanced-token-seq balanced-token
22364 balanced-token:
22365 ( balanced-token-seq )
22366 [ balanced-token-seq ]
22367 { balanced-token-seq }. */
22369 static tree
22371 {
22375 /* First, parse name of the the attribute, a.k.a
22376 attribute-token. */
22393 {
22394 /* We are seeing a scoped attribute token. */
22404 else
22405 {
22409 }
22411 NULL_TREE);
22413 }
22414 else
22415 {
22417 NULL_TREE);
22418 /* C++11 noreturn attribute is equivalent to GNU's. */
22421 /* C++14 deprecated attribute is equivalent to GNU's. */
22423 {
22426 "%<deprecated%> is a C++14 feature;"
22429 }
22430 }
22432 /* Now parse the optional argument clause of the attribute. */
22437 {
22443 /* A GNU attribute that takes an identifier in parameter. */
22446 vec = cp_parser_parenthesized_expression_list
22452 else
22453 {
22456 }
22460 else
22462 }
22465 }
22467 /* Parse a list of standard C++-11 attributes.
22469 attribute-list:
22470 attribute [opt]
22471 attribute-list , attribute[opt]
22472 attribute ...
22473 attribute-list , attribute ...
22474 */
22476 static tree
22478 {
22483 {
22488 {
22491 }
22496 }
22499 }
22501 /* Parse a standard C++-11 attribute specifier.
22503 attribute-specifier:
22504 [ [ attribute-list ] ]
22505 alignment-specifier
22507 alignment-specifier:
22508 alignas ( type-id ... [opt] )
22509 alignas ( alignment-expression ... [opt] ). */
22511 static tree
22513 {
22519 {
22528 else
22529 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22530 when we are sure that we have actually parsed them. */
22532 }
22533 else
22534 {
22535 tree alignas_expr;
22537 /* Look for an alignment-specifier. */
22549 {
22552 }
22558 {
22562 alignas_expr =
22569 }
22572 {
22575 }
22579 /* Build the C++-11 representation of an 'aligned'
22580 attribute. */
22581 attributes =
22585 }
22588 }
22590 /* Parse a standard C++-11 attribute-specifier-seq.
22592 attribute-specifier-seq:
22593 attribute-specifier-seq [opt] attribute-specifier
22594 */
22596 static tree
22598 {
22602 {
22611 }
22615 }
22617 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22618 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22619 current value of the PEDANTIC flag, regardless of whether or not
22620 the `__extension__' keyword is present. The caller is responsible
22621 for restoring the value of the PEDANTIC flag. */
22623 static bool
22625 {
22626 /* Save the old value of the PEDANTIC flag. */
22630 {
22631 /* Consume the `__extension__' token. */
22633 /* We're not being pedantic while the `__extension__' keyword is
22634 in effect. */
22638 }
22641 }
22643 /* Parse a label declaration.
22645 label-declaration:
22646 __label__ label-declarator-seq ;
22648 label-declarator-seq:
22649 identifier , label-declarator-seq
22650 identifier */
22652 static void
22654 {
22655 /* Look for the `__label__' keyword. */
22659 {
22660 tree identifier;
22662 /* Look for an identifier. */
22664 /* If we failed, stop. */
22667 /* Declare it as a label. */
22669 /* If the next token is a `;', stop. */
22672 /* Look for the `,' separating the label declarations. */
22674 }
22676 /* Look for the final `;'. */
22678 }
22680 /* Support Functions */
22682 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22683 NAME should have one of the representations used for an
22684 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22685 is returned. If PARSER->SCOPE is a dependent type, then a
22686 SCOPE_REF is returned.
22688 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22689 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22690 was formed. Abstractly, such entities should not be passed to this
22691 function, because they do not need to be looked up, but it is
22692 simpler to check for this special case here, rather than at the
22693 call-sites.
22695 In cases not explicitly covered above, this function returns a
22696 DECL, OVERLOAD, or baselink representing the result of the lookup.
22697 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22698 is returned.
22700 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22701 (e.g., "struct") that was used. In that case bindings that do not
22702 refer to types are ignored.
22704 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22705 ignored.
22707 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22708 are ignored.
22710 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22711 types.
22713 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22714 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22715 NULL_TREE otherwise. */
22717 static tree
22724 location_t name_location)
22725 {
22726 tree decl;
22729 /* Assume that the lookup will be unambiguous. */
22733 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22734 no longer valid. Note that if we are parsing tentatively, and
22735 the parse fails, OBJECT_TYPE will be automatically restored. */
22741 /* A template-id has already been resolved; there is no lookup to
22742 do. */
22746 {
22750 }
22752 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22753 it should already have been checked to make sure that the name
22754 used matches the type being destroyed. */
22756 {
22757 tree type;
22759 /* Figure out to which type this destructor applies. */
22764 else
22766 /* If that's not a class type, there is no destructor. */
22773 /* If it was a class type, return the destructor. */
22775 }
22777 /* By this point, the NAME should be an ordinary identifier. If
22778 the id-expression was a qualified name, the qualifying scope is
22779 stored in PARSER->SCOPE at this point. */
22782 /* Perform the lookup. */
22784 {
22790 /* If the SCOPE is dependent, the lookup must be deferred until
22791 the template is instantiated -- unless we are explicitly
22792 looking up names in uninstantiated templates. Even then, we
22793 cannot look up the name if the scope is not a class type; it
22794 might, for example, be a template type parameter. */
22799 /* Defer lookup. */
22801 else
22802 {
22805 /* If PARSER->SCOPE is a dependent type, then it must be a
22806 class type, and we must not be checking dependencies;
22807 otherwise, we would have processed this lookup above. So
22808 that PARSER->SCOPE is not considered a dependent base by
22809 lookup_member, we must enter the scope here. */
22813 /* If the PARSER->SCOPE is a template specialization, it
22814 may be instantiated during name lookup. In that case,
22815 errors may be issued. Even if we rollback the current
22816 tentative parse, those errors are valid. */
22821 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22822 lookup result and the nested-name-specifier nominates a class C:
22823 * if the name specified after the nested-name-specifier, when
22824 looked up in C, is the injected-class-name of C (Clause 9), or
22825 * if the name specified after the nested-name-specifier is the
22826 same as the identifier or the simple-template-id's template-
22827 name in the last component of the nested-name-specifier,
22828 the name is instead considered to name the constructor of
22829 class C. [ Note: for example, the constructor is not an
22830 acceptable lookup result in an elaborated-type-specifier so
22831 the constructor would not be used in place of the
22832 injected-class-name. --end note ] Such a constructor name
22833 shall be used only in the declarator-id of a declaration that
22834 names a constructor or in a using-declaration. */
22842 /* If we have a single function from a using decl, pull it out. */
22849 }
22851 /* If the scope is a dependent type and either we deferred lookup or
22852 we did lookup but didn't find the name, rememeber the name. */
22855 {
22857 {
22858 tree type;
22860 /* The resolution to Core Issue 180 says that `struct
22861 A::B' should be considered a type-name, even if `A'
22862 is dependent. */
22867 }
22871 CPP_CLOSE_PAREN)))
22875 else
22878 is_template);
22879 }
22882 }
22884 {
22885 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22886 OBJECT_TYPE is not a class. */
22888 /* If the OBJECT_TYPE is a template specialization, it may
22889 be instantiated during name lookup. In that case, errors
22890 may be issued. Even if we rollback the current tentative
22891 parse, those errors are valid. */
22893 name,
22896 tf_warning_or_error);
22897 else
22901 /* Look it up in the enclosing context. */
22907 }
22908 else
22909 {
22915 }
22917 /* If the lookup failed, let our caller know. */
22921 /* Pull out the template from an injected-class-name (or multiple). */
22925 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22927 {
22930 /* The error message we have to print is too complicated for
22931 cp_parser_error, so we incorporate its actions directly. */
22933 {
22935 name);
22937 }
22939 }
22947 /* If we have resolved the name of a member declaration, check to
22948 see if the declaration is accessible. When the name resolves to
22949 set of overloaded functions, accessibility is checked when
22950 overload resolution is done.
22952 During an explicit instantiation, access is not checked at all,
22953 as per [temp.explicit]. */
22960 }
22962 /* Like cp_parser_lookup_name, but for use in the typical case where
22963 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22964 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22966 static tree
22968 {
22970 none_type,
22975 location);
22976 }
22978 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22979 the current context, return the TYPE_DECL. If TAG_NAME_P is
22980 true, the DECL indicates the class being defined in a class-head,
22981 or declared in an elaborated-type-specifier.
22983 Otherwise, return DECL. */
22985 static tree
22987 {
22988 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22989 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22991 struct A {
22992 template <typename T> struct B;
22993 };
22995 template <typename T> struct A::B {};
22997 Similarly, in an elaborated-type-specifier:
22999 namespace N { struct X{}; }
23001 struct A {
23002 template <typename T> friend struct N::X;
23003 };
23005 However, if the DECL refers to a class type, and we are in
23006 the scope of the class, then the name lookup automatically
23007 finds the TYPE_DECL created by build_self_reference rather
23008 than a TEMPLATE_DECL. For example, in:
23010 template <class T> struct S {
23011 S s;
23012 };
23014 there is no need to handle such case. */
23020 }
23022 /* If too many, or too few, template-parameter lists apply to the
23023 declarator, issue an error message. Returns TRUE if all went well,
23024 and FALSE otherwise. */
23026 static bool
23029 location_t declarator_location)
23030 {
23032 {
23034 {
23042 /* If the DECLARATOR has the form `X<y>' then it uses one
23043 additional level of template parameters. */
23046 return cp_parser_check_template_parameters
23048 }
23063 }
23065 }
23067 /* NUM_TEMPLATES were used in the current declaration. If that is
23068 invalid, return FALSE and issue an error messages. Otherwise,
23069 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23070 declarator and we can print more accurate diagnostics. */
23072 static bool
23075 location_t location,
23077 {
23078 /* If there are the same number of template classes and parameter
23079 lists, that's OK. */
23082 /* If there are more, but only one more, then we are referring to a
23083 member template. That's OK too. */
23086 /* If there are more template classes than parameter lists, we have
23087 something like:
23089 template <class T> void S<T>::R<T>::f (); */
23091 {
23101 else
23104 }
23105 /* Otherwise, there are too many template parameter lists. We have
23106 something like:
23108 template <class T> template <class U> void S::f(); */
23111 }
23113 /* Parse an optional `::' token indicating that the following name is
23114 from the global namespace. If so, PARSER->SCOPE is set to the
23115 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23116 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23117 Returns the new value of PARSER->SCOPE, if the `::' token is
23118 present, and NULL_TREE otherwise. */
23120 static tree
23122 {
23125 /* Peek at the next token. */
23127 /* If we're looking at a `::' token then we're starting from the
23128 global namespace, not our current location. */
23130 {
23131 /* Consume the `::' token. */
23133 /* Set the SCOPE so that we know where to start the lookup. */
23139 }
23141 {
23145 }
23148 }
23150 /* Returns TRUE if the upcoming token sequence is the start of a
23151 constructor declarator. If FRIEND_P is true, the declarator is
23152 preceded by the `friend' specifier. */
23154 static bool
23156 {
23159 tree nested_name_specifier;
23162 /* The common case is that this is not a constructor declarator, so
23163 try to avoid doing lots of work if at all possible. It's not
23164 valid declare a constructor at function scope. */
23167 /* And only certain tokens can begin a constructor declarator. */
23175 /* Parse tentatively; we are going to roll back all of the tokens
23176 consumed here. */
23178 /* Assume that we are looking at a constructor declarator. */
23181 /* Look for the optional `::' operator. */
23184 /* Look for the nested-name-specifier. */
23185 nested_name_specifier
23196 /* Outside of a class-specifier, there must be a
23197 nested-name-specifier. */
23203 /* If we have a class scope, this is easy; DR 147 says that S::S always
23204 names the constructor, and no other qualified name could. */
23207 {
23217 }
23218 /* If we still think that this might be a constructor-declarator,
23219 look for a class-name. */
23221 {
23222 /* If we have:
23224 template <typename T> struct S {
23225 S();
23226 };
23228 we must recognize that the nested `S' names a class. */
23229 tree type_decl;
23233 none_type,
23237 /* If there was no class-name, then this is not a constructor.
23238 Otherwise, if we are in a class-specifier and we aren't
23239 handling a friend declaration, check that its type matches
23240 current_class_type (c++/38313). Note: error_mark_node
23241 is left alone for error recovery purposes. */
23243 && (outside_class_specifier_p
23248 /* If we're still considering a constructor, we have to see a `(',
23249 to begin the parameter-declaration-clause, followed by either a
23250 `)', an `...', or a decl-specifier. We need to check for a
23251 type-specifier to avoid being fooled into thinking that:
23253 S (f) (int);
23255 is a constructor. (It is actually a function named `f' that
23256 takes one parameter (of type `int') and returns a value of type
23257 `S'. */
23265 /* A parameter declaration begins with a decl-specifier,
23266 which is either the "attribute" keyword, a storage class
23267 specifier, or (usually) a type-specifier. */
23269 {
23270 tree type;
23274 /* Names appearing in the type-specifier should be looked up
23275 in the scope of the class. */
23278 else
23279 {
23282 {
23286 {
23289 }
23290 }
23292 }
23294 /* Inside the constructor parameter list, surrounding
23295 template-parameter-lists do not apply. */
23296 saved_num_template_parameter_lists
23300 /* Look for the type-specifier. */
23302 CP_PARSER_FLAGS_NONE,
23308 parser->num_template_parameter_lists
23311 /* Leave the scope of the class. */
23316 }
23317 }
23319 /* We did not really want to consume any tokens. */
23323 }
23325 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23326 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23327 they must be performed once we are in the scope of the function.
23329 Returns the function defined. */
23331 static tree
23332 cp_parser_function_definition_from_specifiers_and_declarator
23335 tree attributes,
23337 {
23338 tree fn;
23341 /* Begin the function-definition. */
23344 /* The things we're about to see are not directly qualified by any
23345 template headers we've seen thus far. */
23348 /* If there were names looked up in the decl-specifier-seq that we
23349 did not check, check them now. We must wait until we are in the
23350 scope of the function to perform the checks, since the function
23351 might be a friend. */
23355 {
23358 }
23361 {
23362 /* Skip the entire function. */
23365 }
23367 {
23368 /* Seen already, skip it. An error message has already been output. */
23372 /* If this is a function from a class, pop the nested class. */
23375 }
23376 else
23377 {
23378 timevar_id_t tv;
23381 else
23387 }
23390 }
23392 /* Parse the part of a function-definition that follows the
23393 declarator. INLINE_P is TRUE iff this function is an inline
23394 function defined within a class-specifier.
23396 Returns the function defined. */
23398 static tree
23401 {
23402 tree fn;
23408 bool fully_implicit_function_template_p
23411 tree implicit_template_parms
23414 cp_binding_level* implicit_template_scope
23420 /* If the next token is `return', then the code may be trying to
23421 make use of the "named return value" extension that G++ used to
23422 support. */
23425 {
23426 /* Consume the `return' keyword. */
23428 /* Look for the identifier that indicates what value is to be
23429 returned. */
23431 /* Issue an error message. */
23434 /* Skip tokens until we reach the start of the function body. */
23436 {
23443 }
23444 }
23445 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23446 anything declared inside `f'. */
23447 saved_in_unbraced_linkage_specification_p
23450 /* Inside the function, surrounding template-parameter-lists do not
23451 apply. */
23452 saved_num_template_parameter_lists
23458 /* If the next token is `try', `__transaction_atomic', or
23459 `__transaction_relaxed`, then we are looking at either function-try-block
23460 or function-transaction-block. Note that all of these include the
23461 function-body. */
23464 RID_TRANSACTION_ATOMIC);
23466 RID_TRANSACTION_RELAXED))
23468 RID_TRANSACTION_RELAXED);
23471 else
23472 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23477 /* Finish the function. */
23480 /* Generate code for it, if necessary. */
23482 /* Restore the saved values. */
23483 parser->in_unbraced_linkage_specification_p
23485 parser->num_template_parameter_lists
23489 parser->fully_implicit_function_template_p
23491 parser->implicit_template_parms
23493 parser->implicit_template_scope
23500 }
23502 /* Parse a template-declaration, assuming that the `export' (and
23503 `extern') keywords, if present, has already been scanned. MEMBER_P
23504 is as for cp_parser_template_declaration. */
23506 static void
23508 {
23511 tree parameter_list;
23516 /* Look for the `template' keyword. */
23521 /* And the `<'. */
23525 {
23526 /* 14.5.2.2 [temp.mem]
23528 A local class shall not have member templates. */
23533 }
23534 /* [temp]
23536 A template ... shall not have C linkage. */
23538 {
23540 /* Give it C++ linkage to avoid confusing other parts of the
23541 front end. */
23544 }
23545 else
23548 /* We cannot perform access checks on the template parameter
23549 declarations until we know what is being declared, just as we
23550 cannot check the decl-specifier list. */
23553 /* If the next token is `>', then we have an invalid
23554 specialization. Rather than complain about an invalid template
23555 parameter, issue an error message here. */
23557 {
23561 }
23562 else
23563 {
23564 /* Parse the template parameters. */
23566 }
23568 /* Get the deferred access checks from the parameter list. These
23569 will be checked once we know what is being declared, as for a
23570 member template the checks must be performed in the scope of the
23571 class containing the member. */
23574 /* Look for the `>'. */
23576 /* We just processed one more parameter list. */
23578 /* If the next token is `template', there are more template
23579 parameters. */
23581 RID_TEMPLATE))
23586 else
23587 {
23588 /* There are no access checks when parsing a template, as we do not
23589 know if a specialization will be a friend. */
23593 checks,
23594 member_p,
23599 /* If this is a member template declaration, let the front
23600 end know. */
23602 {
23607 }
23612 }
23613 /* We are done with the current parameter list. */
23618 /* Finish up. */
23621 /* Check the template arguments for a literal operator template. */
23625 {
23629 else
23630 {
23633 {
23639 }
23641 {
23649 }
23650 else
23652 }
23654 {
23657 " Expected non-type template argument pack <char...>"
23659 decl);
23660 else
23663 decl);
23664 }
23665 }
23666 /* Register member declarations. */
23669 /* For the erroneous case of a template with C linkage, we pushed an
23670 implicit C++ linkage scope; exit that scope now. */
23673 /* If DECL is a function template, we must return to parse it later.
23674 (Even though there is no definition, there might be default
23675 arguments that need handling.) */
23679 }
23681 /* Perform the deferred access checks from a template-parameter-list.
23682 CHECKS is a TREE_LIST of access checks, as returned by
23683 get_deferred_access_checks. */
23685 static void
23686 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23687 {
23691 }
23693 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23694 `function-definition' sequence that follows a template header.
23695 If MEMBER_P is true, this declaration appears in a class scope.
23697 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23698 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23700 static tree
23706 {
23709 cp_decl_specifier_seq decl_specifiers;
23713 /* This function is only used when processing a template
23714 declaration. */
23718 /* Defer access checks until we know what is being declared. */
23721 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23722 alternative. */
23725 CP_PARSER_FLAGS_OPTIONAL,
23731 /* There are no template typedefs. */
23733 {
23737 }
23739 /* Gather up the access checks that occurred the
23740 decl-specifier-seq. */
23743 /* Check for the declaration of a template class. */
23745 {
23747 {
23750 /* In this case:
23752 struct C {
23753 friend template <typename T> struct A<T>::B;
23754 };
23756 A<T>::B will be represented by a TYPENAME_TYPE, and
23757 therefore not recognized by shadow_tag. */
23759 && !decl
23766 else
23769 /* Perform access checks for template parameters. */
23771 }
23772 }
23774 /* Complain about missing 'typename' or other invalid type names. */
23777 {
23778 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23779 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23780 the rest of this declaration. */
23783 }
23785 /* If it's not a template class, try for a template function. If
23786 the next token is a `;', then this declaration does not declare
23787 anything. But, if there were errors in the decl-specifiers, then
23788 the error might well have come from an attempted class-specifier.
23789 In that case, there's no need to warn about a missing declarator. */
23793 {
23796 checks,
23798 member_p,
23799 declares_class_or_enum,
23803 /* 7.1.1-1 [dcl.stc]
23805 A storage-class-specifier shall not be specified in an explicit
23806 specialization... */
23808 && explicit_specialization_p
23810 {
23814 }
23818 }
23820 /* Look for a trailing `;' after the declaration. */
23826 out:
23829 /* Clear any current qualification; whatever comes next is the start
23830 of something new. */
23836 }
23838 /* Parse a cast-expression that is not the operand of a unary "&". */
23840 static tree
23842 {
23845 }
23847 /* Parse a functional cast to TYPE. Returns an expression
23848 representing the cast. */
23850 static tree
23852 {
23854 tree expression_list;
23855 tree cast;
23862 {
23870 tf_warning_or_error);
23871 }
23880 else
23881 {
23884 }
23887 tf_warning_or_error);
23888 /* [expr.const]/1: In an integral constant expression "only type
23889 conversions to integral or enumeration type can be used". */
23895 NIC_CONSTRUCTOR))
23898 }
23900 /* Save the tokens that make up the body of a member function defined
23901 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23902 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23903 specifiers applied to the declaration. Returns the FUNCTION_DECL
23904 for the member function. */
23906 static tree
23910 tree attributes)
23911 {
23914 tree fn;
23916 /* Create the FUNCTION_DECL. */
23919 /* If something went badly wrong, bail out now. */
23921 {
23922 /* If there's a function-body, skip it. */
23927 }
23929 /* Remember it, if there default args to post process. */
23932 /* Save away the tokens that make up the body of the
23933 function. */
23935 /* Handle function try blocks. */
23938 /* We can have braced-init-list mem-initializers before the fn body. */
23940 {
23943 {
23944 /* cache_group will stop after an un-nested { } pair, too. */
23948 /* variadic mem-inits have ... after the ')'. */
23951 }
23952 }
23954 /* Handle function try blocks. */
23959 /* Save away the inline definition; we will process it when the
23960 class is complete. */
23964 /* We need to know that this was defined in the class, so that
23965 friend templates are handled correctly. */
23968 /* Add FN to the queue of functions to be parsed later. */
23972 }
23974 /* Save the tokens that make up the in-class initializer for a non-static
23975 data member. Returns a DEFAULT_ARG. */
23977 static tree
23979 {
23981 }
23983 /* Parse a template-argument-list, as well as the trailing ">" (but
23984 not the opening "<"). See cp_parser_template_argument_list for the
23985 return value. */
23987 static tree
23989 {
23990 tree arguments;
23991 tree saved_scope;
23992 tree saved_qualifying_scope;
23993 tree saved_object_scope;
23998 /* [temp.names]
24000 When parsing a template-id, the first non-nested `>' is taken as
24001 the end of the template-argument-list rather than a greater-than
24002 operator. */
24003 saved_greater_than_is_operator_p
24006 /* Parsing the argument list may modify SCOPE, so we save it
24007 here. */
24011 /* We need to evaluate the template arguments, even though this
24012 template-id may be nested within a "sizeof". */
24017 /* Parse the template-argument-list itself. */
24021 else
24023 /* Look for the `>' that ends the template-argument-list. If we find
24024 a '>>' instead, it's probably just a typo. */
24026 {
24028 {
24029 /* In C++0x, a `>>' in a template argument list or cast
24030 expression is considered to be two separate `>'
24031 tokens. So, change the current token to a `>', but don't
24032 consume it: it will be consumed later when the outer
24033 template argument list (or cast expression) is parsed.
24034 Note that this replacement of `>' for `>>' is necessary
24035 even if we are parsing tentatively: in the tentative
24036 case, after calling
24037 cp_parser_enclosed_template_argument_list we will always
24038 throw away all of the template arguments and the first
24039 closing `>', either because the template argument list
24040 was erroneous or because we are replacing those tokens
24041 with a CPP_TEMPLATE_ID token. The second `>' (which will
24042 not have been thrown away) is needed either to close an
24043 outer template argument list or to complete a new-style
24044 cast. */
24047 }
24049 {
24050 /* If we're in a nested template argument list, the '>>' has
24051 to be a typo for '> >'. We emit the error message, but we
24052 continue parsing and we push a '>' as next token, so that
24053 the argument list will be parsed correctly. Note that the
24054 global source location is still on the token before the
24055 '>>', so we need to say explicitly where we want it. */
24061 }
24062 else
24063 {
24064 /* If this is not a nested template argument list, the '>>'
24065 is a typo for '>'. Emit an error message and continue.
24066 Same deal about the token location, but here we can get it
24067 right by consuming the '>>' before issuing the diagnostic. */
24070 "spurious %<>>%>, use %<>%> to terminate "
24072 }
24073 }
24074 else
24076 /* The `>' token might be a greater-than operator again now. */
24077 parser->greater_than_is_operator_p
24079 /* Restore the SAVED_SCOPE. */
24087 }
24089 /* MEMBER_FUNCTION is a member function, or a friend. If default
24090 arguments, or the body of the function have not yet been parsed,
24091 parse them now. */
24093 static void
24095 {
24097 /* If this member is a template, get the underlying
24098 FUNCTION_DECL. */
24102 /* There should not be any class definitions in progress at this
24103 point; the bodies of members are only parsed outside of all class
24104 definitions. */
24106 /* While we're parsing the member functions we might encounter more
24107 classes. We want to handle them right away, but we don't want
24108 them getting mixed up with functions that are currently in the
24109 queue. */
24112 /* Make sure that any template parameters are in scope. */
24115 /* If the body of the function has not yet been parsed, parse it
24116 now. */
24118 {
24119 tree function_scope;
24122 /* The function is no longer pending; we are processing it. */
24127 /* If this is a local class, enter the scope of the containing
24128 function. */
24133 /* Push the body of the function onto the lexer stack. */
24136 /* Let the front end know that we going to be defining this
24137 function. */
24141 /* Don't do access checking if it is a templated function. */
24145 /* #pragma omp declare reduction needs special parsing. */
24147 {
24152 }
24153 else
24154 /* Now, parse the body of the function. */
24161 /* Leave the scope of the containing function. */
24165 }
24167 /* Remove any template parameters from the symbol table. */
24170 /* Restore the queue. */
24173 }
24175 /* If DECL contains any default args, remember it on the unparsed
24176 functions queue. */
24178 static void
24180 {
24181 tree probe;
24184 probe;
24187 {
24191 }
24192 }
24194 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24195 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24196 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24197 from the parameter-type-list. */
24199 static tree
24202 {
24204 tree parsed_arg;
24210 /* Push the saved tokens for the default argument onto the parser's
24211 lexer stack. */
24217 /* Parse the default argument. */
24228 {
24229 /* In a non-template class, check conversions now. In a template,
24230 we'll wait and instantiate these as needed. */
24233 tf_warning_or_error);
24234 else
24236 }
24238 /* If the token stream has not been completely used up, then
24239 there was extra junk after the end of the default
24240 argument. */
24242 {
24245 else
24247 }
24249 /* Revert to the main lexer. */
24253 }
24255 /* FIELD is a non-static data member with an initializer which we saved for
24256 later; parse it now. */
24258 static void
24260 {
24261 tree def;
24268 NULL_TREE);
24274 }
24276 /* FN is a FUNCTION_DECL which may contains a parameter with an
24277 unparsed DEFAULT_ARG. Parse the default args now. This function
24278 assumes that the current scope is the scope in which the default
24279 argument should be processed. */
24281 static void
24283 {
24287 /* While we're parsing the default args, we might (due to the
24288 statement expression extension) encounter more classes. We want
24289 to handle them right away, but we don't want them getting mixed
24290 up with default args that are currently in the queue. */
24293 /* Local variable names (and the `this' keyword) may not appear
24294 in a default argument. */
24305 {
24307 tree parsed_arg;
24309 tree copy;
24316 /* This can happen for a friend declaration for a function
24317 already declared with default arguments. */
24320 parsed_arg
24322 default_arg,
24325 {
24327 }
24331 /* Update any instantiations we've already created. */
24335 }
24339 /* Make sure no default arg is missing. */
24342 /* Restore the state of local_variables_forbidden_p. */
24345 /* Restore the queue. */
24347 }
24349 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24351 sizeof ... ( identifier )
24353 where the 'sizeof' token has already been consumed. */
24355 static tree
24357 {
24358 /* Consume the `...'. */
24365 else
24373 /* The name is not qualified. */
24391 }
24393 /* Parse the operand of `sizeof' (or a similar operator). Returns
24394 either a TYPE or an expression, depending on the form of the
24395 input. The KEYWORD indicates which kind of expression we have
24396 encountered. */
24398 static tree
24400 {
24407 /* If it's a `...', then we are computing the length of a parameter
24408 pack. */
24413 /* Types cannot be defined in a `sizeof' expression. Save away the
24414 old message. */
24416 /* And create the new one. */
24422 /* The restrictions on constant-expressions do not apply inside
24423 sizeof expressions. */
24424 saved_integral_constant_expression_p
24426 saved_non_integral_constant_expression_p
24430 /* Do not actually evaluate the expression. */
24433 /* If it's a `(', then we might be looking at the type-id
24434 construction. */
24436 {
24439 /* We can't be sure yet whether we're looking at a type-id or an
24440 expression. */
24442 /* Note: as a GNU Extension, compound literals are considered
24443 postfix-expressions as they are in C99, so they are valid
24444 arguments to sizeof. See comment in cp_parser_cast_expression
24445 for details. */
24448 else
24449 {
24452 /* Look for the type-id. */
24454 /* Look for the closing `)'. */
24457 }
24459 /* If all went well, then we're done. */
24461 {
24462 cp_decl_specifier_seq decl_specs;
24464 /* Build a trivial decl-specifier-seq. */
24468 /* Call grokdeclarator to figure out what type this is. */
24471 TYPENAME,
24474 }
24475 }
24477 /* If the type-id production did not work out, then we must be
24478 looking at the unary-expression production. */
24482 /* Go back to evaluating expressions. */
24486 /* Free the message we created. */
24488 /* And restore the old one. */
24490 parser->integral_constant_expression_p
24492 parser->non_integral_constant_expression_p
24496 }
24498 /* If the current declaration has no declarator, return true. */
24500 static bool
24502 {
24503 /* If the next token is a `;' or a `,' then there is no
24504 declarator. */
24507 }
24509 /* Update the DECL_SPECS to reflect the storage class indicated by
24510 KEYWORD. */
24512 static void
24517 {
24518 cp_storage_class storage_class;
24521 {
24525 }
24527 {
24530 }
24535 {
24538 }
24541 {
24559 }
24563 /* A storage class specifier cannot be applied alongside a typedef
24564 specifier. If there is a typedef specifier present then set
24565 conflicting_specifiers_p which will trigger an error later
24566 on in grokdeclarator. */
24569 }
24571 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24572 is true, the type is a class or enum definition. */
24574 static void
24576 tree type_spec,
24579 {
24582 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24583 (with, for example, in "typedef int wchar_t;") we remember that
24584 this is what happened. In system headers, we ignore these
24585 declarations so that G++ can work with system headers that are not
24586 C++-safe. */
24588 && !type_definition_p
24598 {
24601 ds_redefined_builtin_type_spec,
24602 token);
24604 {
24608 }
24609 }
24612 else
24613 {
24618 }
24619 }
24621 /* True iff TOKEN is the GNU keyword __thread. */
24623 static bool
24625 {
24628 }
24630 /* Set the location for a declarator specifier and check if it is
24631 duplicated.
24633 DECL_SPECS is the sequence of declarator specifiers onto which to
24634 set the location.
24636 DS is the single declarator specifier to set which location is to
24637 be set onto the existing sequence of declarators.
24639 LOCATION is the location for the declarator specifier to
24640 consider. */
24642 static void
24645 {
24654 {
24658 }
24659 else
24660 {
24662 {
24666 else
24667 {
24670 OPT_Wlong_long,
24672 }
24673 }
24675 {
24680 else
24682 }
24683 else
24684 {
24700 "__complex"
24701 };
24704 }
24705 }
24706 }
24708 /* Return true iff the declarator specifier DS is present in the
24709 sequence of declarator specifiers DECL_SPECS. */
24711 bool
24713 cp_decl_spec ds)
24714 {
24721 }
24723 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24724 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24726 static bool
24728 {
24730 }
24732 /* Issue an error message indicating that TOKEN_DESC was expected.
24733 If KEYWORD is true, it indicated this function is called by
24734 cp_parser_require_keword and the required token can only be
24735 a indicated keyword. */
24737 static void
24739 required_token token_desc,
24741 {
24743 {
24812 }
24814 {
24816 {
24895 }
24896 }
24897 else
24899 }
24903 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24904 issue an error message indicating that TOKEN_DESC was expected.
24906 Returns the token consumed, if the token had the appropriate type.
24907 Otherwise, returns NULL. */
24912 required_token token_desc)
24913 {
24916 else
24917 {
24918 /* Output the MESSAGE -- unless we're parsing tentatively. */
24922 }
24923 }
24925 /* An error message is produced if the next token is not '>'.
24926 All further tokens are skipped until the desired token is
24927 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24929 static void
24931 {
24932 /* Current level of '< ... >'. */
24934 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24937 /* Are we ready, yet? If not, issue error message. */
24941 /* Skip tokens until the desired token is found. */
24943 {
24944 /* Peek at the next token. */
24946 {
24954 /* C++0x views the `>>' operator as two `>' tokens, but
24955 C++98 does not. */
24958 {
24959 /* We've hit a `>>' where the first `>' closes the
24960 template argument list, and the second `>' is
24961 spurious. Just consume the `>>' and stop; we've
24962 already produced at least one error. */
24965 }
24966 /* Fall through for C++0x, so we handle the second `>' in
24967 the `>>'. */
24971 {
24972 /* We've reached the token we want, consume it and stop. */
24975 }
24994 /* The '>' was probably forgotten, don't look further. */
24999 }
25001 /* Consume this token. */
25003 }
25004 }
25006 /* If the next token is the indicated keyword, consume it. Otherwise,
25007 issue an error message indicating that TOKEN_DESC was expected.
25009 Returns the token consumed, if the token had the appropriate type.
25010 Otherwise, returns NULL. */
25015 required_token token_desc)
25016 {
25020 {
25023 }
25026 }
25028 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25029 function-definition. */
25031 static bool
25033 {
25036 /* A ctor-initializer begins with a `:'. */
25038 /* A function-try-block begins with `try'. */
25040 /* A function-transaction-block begins with `__transaction_atomic'
25041 or `__transaction_relaxed'. */
25044 /* The named return value extension begins with `return'. */
25046 }
25048 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25049 definition. */
25051 static bool
25053 {
25060 }
25062 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25063 C++0x) ending a template-argument. */
25065 static bool
25067 {
25075 }
25077 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25078 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25080 static bool
25083 {
25089 /* Check for the sequence `<::' in the original code. It would be lexed as
25090 `[:', where `[' is a digraph, and there is no whitespace before
25091 `:'. */
25093 {
25098 }
25100 }
25102 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25103 or none_type otherwise. */
25105 static enum tag_types
25107 {
25109 {
25119 }
25120 }
25122 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25123 or none_type otherwise or if the token is null. */
25125 static enum tag_types
25127 {
25132 {
25140 }
25141 }
25143 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25145 static void
25147 {
25151 {
25155 type))
25158 }
25159 }
25161 /* Issue an error message if DECL is redeclared with different
25162 access than its original declaration [class.access.spec/3].
25163 This applies to nested classes and nested class templates.
25164 [class.mem/1]. */
25166 static void
25168 {
25177 }
25179 /* Look for the `template' keyword, as a syntactic disambiguator.
25180 Return TRUE iff it is present, in which case it will be
25181 consumed. */
25183 static bool
25185 {
25187 {
25188 /* In C++98 the `template' keyword can only be used within templates;
25189 outside templates the parser can always figure out what is a
25190 template and what is not. In C++11, per the resolution of DR 468,
25191 `template' is allowed in cases where it is not strictly necessary. */
25194 {
25197 "in C++98 %<template%> (as a disambiguator) is only "
25199 /* If this part of the token stream is rescanned, the same
25200 error message would be generated. So, we purge the token
25201 from the stream. */
25204 }
25205 else
25206 {
25207 /* Consume the `template' keyword. */
25210 }
25211 }
25213 }
25215 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25216 set PARSER->SCOPE, and perform other related actions. */
25218 static void
25220 {
25226 /* Get the stored value. */
25228 /* Perform any access checks that were deferred. */
25231 {
25236 }
25237 /* Set the scope from the stored value. */
25241 }
25243 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25244 encounter the end of a block before what we were looking for. */
25246 static bool
25250 {
25252 {
25255 /* Abort a parenthesized expression if we encounter a semicolon. */
25259 /* If we've reached the end of the file, stop. */
25265 /* We've hit the end of an enclosing block, so there's been some
25266 kind of syntax error. */
25269 /* Consume the token. */
25271 /* See if it starts a new group. */
25273 {
25275 /* In theory this should probably check end == '}', but
25276 cp_parser_save_member_function_body needs it to exit
25277 after either '}' or ')' when called with ')'. */
25280 }
25282 {
25286 }
25291 }
25292 }
25294 /* Like above, for caching a default argument or NSDMI. Both of these are
25295 terminated by a non-nested comma, but it can be unclear whether or not a
25296 comma is nested in a template argument list unless we do more parsing.
25297 In order to handle this ambiguity, when we encounter a ',' after a '<'
25298 we try to parse what follows as a parameter-declaration-list (in the
25299 case of a default argument) or a member-declarator (in the case of an
25300 NSDMI). If that succeeds, then we stop caching. */
25302 static tree
25304 {
25309 tree default_argument;
25311 /* Add tokens until we have processed the entire default
25312 argument. We add the range [first_token, token). */
25315 {
25316 /* For list-initialization, this is straightforward. */
25319 }
25321 {
25324 /* Peek at the next token. */
25326 /* What we do depends on what token we have. */
25328 {
25329 /* In valid code, a default argument must be
25330 immediately followed by a `,' `)', or `...'. */
25333 {
25334 /* If we've seen a '<', we might be in a
25335 template-argument-list. Until Core issue 325 is
25336 resolved, we don't know how this situation ought
25337 to be handled, so try to DTRT. We check whether
25338 what comes after the comma is a valid parameter
25339 declaration list. If it is, then the comma ends
25340 the default argument; otherwise the default
25341 argument continues. */
25344 /* Set ITALP so cp_parser_parameter_declaration_list
25345 doesn't decide to commit to this parse. */
25353 {
25360 }
25361 else
25362 {
25366 }
25373 }
25376 /* If we run into a non-nested `;', `}', or `]',
25377 then the code is invalid -- but the default
25378 argument is certainly over. */
25383 /* Handle correctly int n = sizeof ... ( p ); */
25386 /* Update DEPTH, if necessary. */
25401 /* This might be the comparison operator, or it might
25402 start a template argument list. */
25409 /* Fall through for C++0x, which treats the `>>'
25410 operator like two `>' tokens in certain
25411 cases. */
25415 {
25416 /* This might be an operator, or it might close a
25417 template argument list. But if a previous '<'
25418 started a template argument list, this will have
25419 closed it, so we can't be in one anymore. */
25423 }
25426 /* If we run out of tokens, issue an error message. */
25435 /* In these cases, we should look for template-ids.
25436 For example, if the default argument is
25437 `X<int, double>()', we need to do name lookup to
25438 figure out whether or not `X' is a template; if
25439 so, the `,' does not end the default argument.
25441 That is not yet done. */
25446 }
25448 /* If we've reached the end, stop. */
25452 /* Add the token to the token block. */
25454 }
25456 /* Create a DEFAULT_ARG to represent the unparsed default
25457 argument. */
25464 }
25466 /* Begin parsing tentatively. We always save tokens while parsing
25467 tentatively so that if the tentative parsing fails we can restore the
25468 tokens. */
25470 static void
25472 {
25473 /* Enter a new parsing context. */
25475 /* Begin saving tokens. */
25477 /* In order to avoid repetitive access control error messages,
25478 access checks are queued up until we are no longer parsing
25479 tentatively. */
25481 }
25483 /* Commit to the currently active tentative parse. */
25485 static void
25487 {
25491 /* Mark all of the levels as committed. */
25494 {
25501 }
25502 }
25504 /* Commit to the topmost currently active tentative parse.
25506 Note that this function shouldn't be called when there are
25507 irreversible side-effects while in a tentative state. For
25508 example, we shouldn't create a permanent entry in the symbol
25509 table, or issue an error message that might not apply if the
25510 tentative parse is aborted. */
25512 static void
25514 {
25519 {
25527 }
25528 }
25530 /* Abort the currently active tentative parse. All consumed tokens
25531 will be rolled back, and no diagnostics will be issued. */
25533 static void
25535 {
25539 /* Now, pretend that we want to see if the construct was
25540 successfully parsed. */
25542 }
25544 /* Stop parsing tentatively. If a parse error has occurred, restore the
25545 token stream. Otherwise, commit to the tokens we have consumed.
25546 Returns true if no error occurred; false otherwise. */
25548 static bool
25550 {
25554 /* Remember whether or not an error occurred, since we are about to
25555 destroy that information. */
25557 /* Remove the topmost context from the stack. */
25560 /* If no parse errors occurred, commit to the tentative parse. */
25562 {
25563 /* Commit to the tokens read tentatively, unless that was
25564 already done. */
25569 }
25570 /* Otherwise, if errors occurred, roll back our state so that things
25571 are just as they were before we began the tentative parse. */
25572 else
25573 {
25576 }
25577 /* Add the context to the front of the free list. */
25582 }
25584 /* Returns true if we are parsing tentatively and are not committed to
25585 this tentative parse. */
25587 static bool
25589 {
25592 }
25594 /* Returns nonzero iff an error has occurred during the most recent
25595 tentative parse. */
25597 static bool
25599 {
25602 }
25604 /* Returns nonzero if GNU extensions are allowed. */
25606 static bool
25608 {
25610 }
25611 \f
25612 /* Objective-C++ Productions */
25615 /* Parse an Objective-C expression, which feeds into a primary-expression
25616 above.
25618 objc-expression:
25619 objc-message-expression
25620 objc-string-literal
25621 objc-encode-expression
25622 objc-protocol-expression
25623 objc-selector-expression
25625 Returns a tree representation of the expression. */
25627 static tree
25629 {
25630 /* Try to figure out what kind of declaration is present. */
25634 {
25644 {
25656 }
25662 }
25665 }
25667 /* Parse an Objective-C message expression.
25669 objc-message-expression:
25670 [ objc-message-receiver objc-message-args ]
25672 Returns a representation of an Objective-C message. */
25674 static tree
25676 {
25685 }
25687 /* Parse an objc-message-receiver.
25689 objc-message-receiver:
25690 expression
25691 simple-type-specifier
25693 Returns a representation of the type or expression. */
25695 static tree
25697 {
25698 tree rcv;
25700 /* An Objective-C message receiver may be either (1) a type
25701 or (2) an expression. */
25705 /* If that worked out, fine. */
25712 CP_PARSER_FLAGS_NONE);
25719 }
25721 /* Parse the arguments and selectors comprising an Objective-C message.
25723 objc-message-args:
25724 objc-selector
25725 objc-selector-args
25726 objc-selector-args , objc-comma-args
25728 objc-selector-args:
25729 objc-selector [opt] : assignment-expression
25730 objc-selector-args objc-selector [opt] : assignment-expression
25732 objc-comma-args:
25733 assignment-expression
25734 objc-comma-args , assignment-expression
25736 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25737 selector arguments and TREE_VALUE containing a list of comma
25738 arguments. */
25740 static tree
25742 {
25748 {
25754 /* Detect if we have a unary selector. */
25763 sel_args
25768 }
25770 /* Handle non-selector arguments, if any. */
25772 {
25773 tree arg;
25778 addl_args
25783 }
25786 {
25789 }
25792 }
25794 /* Parse an Objective-C encode expression.
25796 objc-encode-expression:
25797 @encode objc-typename
25799 Returns an encoded representation of the type argument. */
25801 static tree
25803 {
25804 tree type;
25814 {
25818 }
25820 /* This happens if we find @encode(T) (where T is a template
25821 typename or something dependent on a template typename) when
25822 parsing a template. In that case, we can't compile it
25823 immediately, but we rather create an AT_ENCODE_EXPR which will
25824 need to be instantiated when the template is used.
25825 */
25827 {
25831 }
25834 }
25836 /* Parse an Objective-C @defs expression. */
25838 static tree
25840 {
25841 tree name;
25849 }
25851 /* Parse an Objective-C protocol expression.
25853 objc-protocol-expression:
25854 @protocol ( identifier )
25856 Returns a representation of the protocol expression. */
25858 static tree
25860 {
25861 tree proto;
25869 }
25871 /* Parse an Objective-C selector expression.
25873 objc-selector-expression:
25874 @selector ( objc-method-signature )
25876 objc-method-signature:
25877 objc-selector
25878 objc-selector-seq
25880 objc-selector-seq:
25881 objc-selector :
25882 objc-selector-seq objc-selector :
25884 Returns a representation of the method selector. */
25886 static tree
25888 {
25900 {
25909 {
25910 /* Detect if we have a unary selector. */
25912 {
25915 }
25916 else
25917 {
25919 }
25920 }
25925 {
25926 sel_seq
25929 sel_seq
25932 }
25933 else
25934 sel_seq
25939 }
25941 finish_selector:
25945 }
25947 /* Parse a list of identifiers.
25949 objc-identifier-list:
25950 identifier
25951 objc-identifier-list , identifier
25953 Returns a TREE_LIST of identifier nodes. */
25955 static tree
25957 {
25958 tree identifier;
25959 tree list;
25970 {
25977 identifier));
25979 }
25982 }
25984 /* Parse an Objective-C alias declaration.
25986 objc-alias-declaration:
25987 @compatibility_alias identifier identifier ;
25989 This function registers the alias mapping with the Objective-C front end.
25990 It returns nothing. */
25992 static void
25994 {
26002 }
26004 /* Parse an Objective-C class forward-declaration.
26006 objc-class-declaration:
26007 @class objc-identifier-list ;
26009 The function registers the forward declarations with the Objective-C
26010 front end. It returns nothing. */
26012 static void
26014 {
26017 {
26018 tree id;
26028 else
26030 }
26032 }
26034 /* Parse a list of Objective-C protocol references.
26036 objc-protocol-refs-opt:
26037 objc-protocol-refs [opt]
26039 objc-protocol-refs:
26040 < objc-identifier-list >
26042 Returns a TREE_LIST of identifiers, if any. */
26044 static tree
26046 {
26050 {
26054 }
26057 }
26059 /* Parse a Objective-C visibility specification. */
26061 static void
26063 {
26067 {
26082 }
26084 /* Eat '@private'/'@protected'/'@public'. */
26086 }
26088 /* Parse an Objective-C method type. Return 'true' if it is a class
26089 (+) method, and 'false' if it is an instance (-) method. */
26093 {
26096 else
26098 }
26100 /* Parse an Objective-C protocol qualifier. */
26102 static tree
26104 {
26117 {
26122 }
26125 }
26127 /* Parse an Objective-C typename. */
26129 static tree
26131 {
26135 {
26141 /* An ObjC type name may consist of just protocol qualifiers, in which
26142 case the type shall default to 'id'. */
26144 {
26147 /* If the type could not be parsed, an error has already
26148 been produced. For error recovery, behave as if it had
26149 not been specified, which will use the default type
26150 'id'. */
26152 {
26154 /* We need to skip to the closing parenthesis as
26155 cp_parser_type_id() does not seem to do it for
26156 us. */
26161 }
26162 }
26166 }
26169 }
26171 /* Check to see if TYPE refers to an Objective-C selector name. */
26173 static bool
26175 {
26181 }
26183 /* Parse an Objective-C selector. */
26185 static tree
26187 {
26191 {
26194 }
26196 /* C++ operator names are allowed to appear in ObjC selectors. */
26198 {
26211 }
26212 }
26214 /* Parse an Objective-C params list. */
26216 static tree
26218 {
26224 {
26234 /* Detect if we have a unary selector. */
26237 {
26240 }
26244 {
26245 /* Something went quite wrong. There should be a colon
26246 here, but there is not. Stop parsing parameters. */
26248 }
26250 /* New ObjC allows attributes on parameters too. */
26255 params
26258 type_name,
26259 identifier,
26260 parm_attr));
26263 }
26266 {
26269 }
26271 /* We allow tail attributes for the method. */
26273 {
26281 }
26284 {
26287 }
26289 }
26291 /* Parse the non-keyword Objective-C params. */
26293 static tree
26296 {
26302 {
26304 tree parm;
26310 {
26315 }
26317 /* TODO: parse attributes for tail parameters. */
26326 }
26328 /* We allow tail attributes for the method. */
26330 {
26332 {
26337 }
26338 else
26339 /* We have an error, but parse the attributes, so that we can
26340 carry on. */
26346 }
26349 }
26351 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26353 static void
26355 {
26358 /* If the next token is `extern' and the following token is a string
26359 literal, then we have a linkage specification. */
26361 && cp_parser_is_pure_string_literal
26364 /* Handle #pragma, if any. */
26367 /* Allow stray semicolons. */
26370 /* Mark methods as optional or required, when building protocols. */
26372 {
26375 }
26377 {
26380 }
26383 /* Other stray characters must generate errors. */
26385 {
26389 }
26390 /* Finally, try to parse a block-declaration, or a function-definition. */
26391 else
26393 }
26395 /* Parse a method signature. */
26397 static tree
26399 {
26415 }
26417 static bool
26419 {
26420 tree tattr;
26425 /* If the attributes are followed by a method introducer, this is not allowed.
26426 Dump the attributes and flag the situation. */
26431 /* Otherwise, the attributes introduce some interstitial code, possibly so
26432 rewind to allow that check. */
26435 }
26437 /* Parse an Objective-C method prototype list. */
26439 static void
26441 {
26445 {
26447 {
26452 else
26456 {
26460 }
26463 }
26469 OPT_Wattributes,
26471 else
26472 /* Allow for interspersed non-ObjC++ code. */
26476 }
26480 else
26484 }
26486 /* Parse an Objective-C method definition list. */
26488 static void
26490 {
26494 {
26495 tree meth;
26498 {
26504 else
26509 {
26513 }
26515 NULL_TREE);
26517 /* For historical reasons, we accept an optional semicolon. */
26524 {
26531 }
26532 }
26533 /* The following case will be removed once @synthesize is
26534 completely implemented. */
26545 else
26546 /* Allow for interspersed non-ObjC++ code. */
26550 }
26554 else
26558 }
26560 /* Parse Objective-C ivars. */
26562 static void
26564 {
26575 {
26576 cp_decl_specifier_seq declspecs;
26578 tree prefix_attributes;
26586 CP_PARSER_FLAGS_OPTIONAL,
26590 /* auto, register, static, extern, mutable. */
26592 {
26595 }
26597 /* thread_local. */
26599 {
26602 }
26604 /* typedef. */
26606 {
26609 }
26614 /* Keep going until we hit the `;' at the end of the
26615 declaration. */
26617 {
26622 /* Check for a (possibly unnamed) bitfield declaration. */
26630 {
26631 /* Get the name of the bitfield. */
26634 sfk_none);
26636 eat_colon:
26638 /* Get the width of the bitfield. */
26639 width
26641 }
26642 else
26643 {
26644 /* Parse the declarator. */
26645 declarator
26651 }
26653 /* Look for attributes that apply to the ivar. */
26655 /* Remember which attributes are prefix attributes and
26656 which are not. */
26658 /* Combine the attributes. */
26662 /* Create the bitfield declaration. */
26664 width,
26665 attributes);
26666 else
26671 /* Add the instance variable. */
26675 /* Reset PREFIX_ATTRIBUTES. */
26684 {
26687 }
26689 }
26693 }
26698 /* Do not consume the RID_AT_END, so it will be read again as terminating
26699 the @interface of @implementation. */
26703 /* For historical reasons, we accept an optional semicolon. */
26706 }
26708 /* Parse an Objective-C protocol declaration. */
26710 static void
26712 {
26718 {
26723 }
26725 /* See if we have a forward declaration or a definition. */
26728 /* Try a forward declaration first. */
26730 {
26732 {
26733 tree id;
26743 else
26745 }
26747 }
26749 /* Ok, we got a full-fledged definition (or at least should). */
26750 else
26751 {
26756 }
26757 }
26759 /* Parse an Objective-C superclass or category. */
26761 static void
26766 {
26772 {
26775 }
26777 {
26780 /* If there is no category name, and this is an @interface, we
26781 have a class extension. */
26783 {
26786 }
26787 else
26791 }
26792 }
26794 /* Parse an Objective-C class interface. */
26796 static void
26798 {
26805 {
26806 /* It's hard to recover because even if valid @interface stuff
26807 is to follow, we can't compile it (or validate it) if we
26808 don't even know which class it refers to. Let's assume this
26809 was a stray '@interface' token in the stream and skip it.
26810 */
26812 }
26817 /* We have either a class or a category on our hands. */
26820 else
26821 {
26823 /* Handle instance variable declarations, if any. */
26826 }
26829 }
26831 /* Parse an Objective-C class implementation. */
26833 static void
26835 {
26842 {
26843 /* It's hard to recover because even if valid @implementation
26844 stuff is to follow, we can't compile it (or validate it) if
26845 we don't even know which class it refers to. Let's assume
26846 this was a stray '@implementation' token in the stream and
26847 skip it.
26848 */
26850 }
26854 /* We have either a class or a category on our hands. */
26857 else
26858 {
26860 /* Handle instance variable declarations, if any. */
26863 }
26866 }
26868 /* Consume the @end token and finish off the implementation. */
26870 static void
26872 {
26875 }
26877 /* Parse an Objective-C declaration. */
26879 static void
26881 {
26882 /* Try to figure out what kind of declaration is present. */
26887 {
26903 }
26906 {
26929 }
26930 }
26932 /* Parse an Objective-C try-catch-finally statement.
26934 objc-try-catch-finally-stmt:
26935 @try compound-statement objc-catch-clause-seq [opt]
26936 objc-finally-clause [opt]
26938 objc-catch-clause-seq:
26939 objc-catch-clause objc-catch-clause-seq [opt]
26941 objc-catch-clause:
26942 @catch ( objc-exception-declaration ) compound-statement
26944 objc-finally-clause:
26945 @finally compound-statement
26947 objc-exception-declaration:
26948 parameter-declaration
26949 '...'
26951 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26953 Returns NULL_TREE.
26955 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26956 for C. Keep them in sync. */
26958 static tree
26960 {
26961 location_t location;
26962 tree stmt;
26967 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26968 node, lest it get absorbed into the surrounding block. */
26974 {
26983 {
26984 /* We have "@catch (...)" (where the '...' are literally
26985 what is in the code). Skip the '...'.
26986 parameter_declaration is set to NULL_TREE, and
26987 objc_being_catch_clauses() knows that that means
26988 '...'. */
26991 }
26992 else
26993 {
26994 /* We have "@catch (NSException *exception)" or something
26995 like that. Parse the parameter declaration. */
26999 else
27004 }
27007 else
27008 {
27009 /* If there was no open parenthesis, we are recovering from
27010 an error, and we are trying to figure out what mistake
27011 the user has made. */
27013 /* If there is an immediate closing parenthesis, the user
27014 probably forgot the opening one (ie, they typed "@catch
27015 NSException *e)". Parse the closing parenthesis and keep
27016 going. */
27020 /* If these is no immediate closing parenthesis, the user
27021 probably doesn't know that parenthesis are required at
27022 all (ie, they typed "@catch NSException *e"). So, just
27023 forget about the closing parenthesis and keep going. */
27024 }
27028 }
27030 {
27033 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27034 node, lest it get absorbed into the surrounding block. */
27038 }
27041 }
27043 /* Parse an Objective-C synchronized statement.
27045 objc-synchronized-stmt:
27046 @synchronized ( expression ) compound-statement
27048 Returns NULL_TREE. */
27050 static tree
27052 {
27053 location_t location;
27064 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27065 node, lest it get absorbed into the surrounding block. */
27070 }
27072 /* Parse an Objective-C throw statement.
27074 objc-throw-stmt:
27075 @throw assignment-expression [opt] ;
27077 Returns a constructed '@throw' statement. */
27079 static tree
27081 {
27093 }
27095 /* Parse an Objective-C statement. */
27097 static tree
27099 {
27100 /* Try to figure out what kind of declaration is present. */
27104 {
27115 }
27118 }
27120 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27121 look ahead to see if an objc keyword follows the attributes. This
27122 is to detect the use of prefix attributes on ObjC @interface and
27123 @protocol. */
27125 static bool
27127 {
27132 {
27135 }
27138 }
27140 /* This routine is a minimal replacement for
27141 c_parser_struct_declaration () used when parsing the list of
27142 types/names or ObjC++ properties. For example, when parsing the
27143 code
27145 @property (readonly) int a, b, c;
27147 this function is responsible for parsing "int a, int b, int c" and
27148 returning the declarations as CHAIN of DECLs.
27150 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27151 similar parsing. */
27152 static tree
27154 {
27156 cp_decl_specifier_seq declspecs;
27158 tree prefix_attributes;
27161 CP_PARSER_FLAGS_NONE,
27168 /* auto, register, static, extern, mutable. */
27170 {
27173 }
27175 /* thread_local. */
27177 {
27180 }
27182 /* typedef. */
27184 {
27187 }
27192 /* Keep going until we hit the `;' at the end of the declaration. */
27194 {
27199 /* Parse the declarator. */
27203 /* Look for attributes that apply to the ivar. */
27205 /* Remember which attributes are prefix attributes and
27206 which are not. */
27208 /* Combine the attributes. */
27218 /* Reset PREFIX_ATTRIBUTES. */
27229 {
27232 }
27233 else
27235 }
27237 }
27239 /* Parse an Objective-C @property declaration. The syntax is:
27241 objc-property-declaration:
27242 '@property' objc-property-attributes[opt] struct-declaration ;
27244 objc-property-attributes:
27245 '(' objc-property-attribute-list ')'
27247 objc-property-attribute-list:
27248 objc-property-attribute
27249 objc-property-attribute-list, objc-property-attribute
27251 objc-property-attribute
27252 'getter' = identifier
27253 'setter' = identifier
27254 'readonly'
27255 'readwrite'
27256 'assign'
27257 'retain'
27258 'copy'
27259 'nonatomic'
27261 For example:
27262 @property NSString *name;
27263 @property (readonly) id object;
27264 @property (retain, nonatomic, getter=getTheName) id name;
27265 @property int a, b, c;
27267 PS: This function is identical to
27268 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27269 static void
27271 {
27272 /* The following variables hold the attributes of the properties as
27273 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27274 seen. When we see an attribute, we set them to 'true' (if they
27275 are boolean properties) or to the identifier (if they have an
27276 argument, ie, for getter and setter). Note that here we only
27277 parse the list of attributes, check the syntax and accumulate the
27278 attributes that we find. objc_add_property_declaration() will
27279 then process the information. */
27289 /* 'properties' is the list of properties that we read. Usually a
27290 single one, but maybe more (eg, in "@property int a, b, c;" there
27291 are three). */
27292 tree properties;
27293 location_t loc;
27299 /* Parse the optional attribute list... */
27301 {
27302 /* Eat the '('. */
27306 {
27312 {
27315 }
27319 {
27330 {
27334 else
27339 }
27342 {
27346 }
27348 {
27350 {
27353 }
27354 else
27358 else
27360 }
27361 else
27362 {
27364 {
27367 }
27368 else
27370 }
27376 }
27383 else
27385 }
27387 /* FIXME: "@property (setter, assign);" will generate a spurious
27388 "error: expected ‘)’ before ‘,’ token". This is because
27389 cp_parser_require, unlike the C counterpart, will produce an
27390 error even if we are in error recovery. */
27392 {
27397 }
27398 }
27400 /* ... and the property declaration(s). */
27404 {
27406 /* If the next token is now a `;', consume it. */
27410 }
27414 else
27415 {
27416 /* Comma-separated properties are chained together in
27417 reverse order; add them one by one. */
27426 }
27429 }
27431 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27433 objc-synthesize-declaration:
27434 @synthesize objc-synthesize-identifier-list ;
27436 objc-synthesize-identifier-list:
27437 objc-synthesize-identifier
27438 objc-synthesize-identifier-list, objc-synthesize-identifier
27440 objc-synthesize-identifier
27441 identifier
27442 identifier = identifier
27444 For example:
27445 @synthesize MyProperty;
27446 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27448 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27449 for C. Keep them in sync.
27450 */
27451 static void
27453 {
27455 location_t loc;
27460 {
27464 {
27467 }
27469 {
27473 {
27476 }
27477 }
27478 else
27483 else
27485 }
27488 }
27490 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27492 objc-dynamic-declaration:
27493 @dynamic identifier-list ;
27495 For example:
27496 @dynamic MyProperty;
27497 @dynamic MyProperty, AnotherProperty;
27499 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27500 for C. Keep them in sync.
27501 */
27502 static void
27504 {
27506 location_t loc;
27511 {
27512 tree property;
27515 {
27518 }
27522 else
27524 }
27527 }
27529 \f
27530 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27532 /* Returns name of the next clause.
27533 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27534 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27535 returned and the token is consumed. */
27537 static pragma_omp_clause
27539 {
27553 {
27558 {
27703 }
27704 }
27710 }
27712 /* Validate that a clause of the given type does not already exist. */
27714 static void
27717 {
27718 tree c;
27722 {
27725 }
27726 }
27728 /* OpenMP 2.5:
27729 variable-list:
27730 identifier
27731 variable-list , identifier
27733 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27734 colon). An opening parenthesis will have been consumed by the caller.
27736 If KIND is nonzero, create the appropriate node and install the decl
27737 in OMP_CLAUSE_DECL and add the node to the head of the list.
27739 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27740 return the list created.
27742 COLON can be NULL if only closing parenthesis should end the list,
27743 or pointer to bool which will receive false if the list is terminated
27744 by closing parenthesis or true if the list is terminated by colon. */
27746 static tree
27749 {
27753 {
27756 }
27758 {
27775 {
27777 {
27780 {
27784 }
27785 /* FALL THROUGH. */
27791 {
27799 parser->colon_corrects_to_scope_p
27803 else
27804 {
27805 /* Look for `:'. */
27809 CPP_CLOSE_SQUARE))
27811 }
27812 /* Look for the closing `]'. */
27814 RT_CLOSE_SQUARE))
27818 {
27821 {
27825 }
27829 {
27833 }
27834 }
27837 }
27841 }
27847 }
27848 else
27851 get_comma:
27855 }
27861 {
27865 }
27868 {
27871 /* Try to resync to an unnested comma. Copied from
27872 cp_parser_parenthesized_expression_list. */
27873 skip_comma:
27882 }
27885 }
27887 /* Similarly, but expect leading and trailing parenthesis. This is a very
27888 common case for omp clauses. */
27890 static tree
27892 {
27896 }
27898 /* OpenACC 2.0:
27899 copy ( variable-list )
27900 copyin ( variable-list )
27901 copyout ( variable-list )
27902 create ( variable-list )
27903 delete ( variable-list )
27904 present ( variable-list )
27905 present_or_copy ( variable-list )
27906 pcopy ( variable-list )
27907 present_or_copyin ( variable-list )
27908 pcopyin ( variable-list )
27909 present_or_copyout ( variable-list )
27910 pcopyout ( variable-list )
27911 present_or_create ( variable-list )
27912 pcreate ( variable-list ) */
27914 static tree
27916 tree list)
27917 {
27920 {
27960 }
27968 }
27970 /* OpenACC 2.0:
27971 deviceptr ( variable-list ) */
27973 static tree
27975 {
27979 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
27980 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
27981 variable-list must only allow for pointer variables. */
27984 {
27987 /* FIXME diagnostics: Ideally we should keep individual
27988 locations for all the variables in the var list to make the
27989 following errors more precise. Perhaps
27990 c_parser_omp_var_list_parens should construct a list of
27991 locations to go along with the var list. */
27996 ;
28005 }
28008 }
28010 /* OpenACC:
28011 vector_length ( expression ) */
28013 static tree
28015 {
28025 {
28028 }
28031 {
28036 }
28039 location);
28047 }
28049 /* OpenACC 2.0
28050 Parse wait clause or directive parameters. */
28052 static tree
28054 {
28064 {
28069 }
28076 {
28080 {
28083 else
28084 {
28091 }
28092 }
28093 }
28096 }
28098 /* OpenACC:
28099 wait ( int-expr-list ) */
28101 static tree
28103 {
28112 }
28114 /* OpenMP 3.0:
28115 collapse ( constant-expression ) */
28117 static tree
28119 {
28121 location_t loc;
28122 HOST_WIDE_INT n;
28142 {
28145 }
28153 }
28155 /* OpenMP 2.5:
28156 default ( shared | none ) */
28158 static tree
28160 {
28162 tree c;
28167 {
28172 {
28187 }
28190 }
28191 else
28192 {
28193 invalid_kind:
28195 }
28211 }
28213 /* OpenMP 3.1:
28214 final ( expression ) */
28216 static tree
28218 {
28239 }
28241 /* OpenMP 2.5:
28242 if ( expression ) */
28244 static tree
28246 {
28267 }
28269 /* OpenMP 3.1:
28270 mergeable */
28272 static tree
28275 {
28276 tree c;
28279 location);
28284 }
28286 /* OpenMP 2.5:
28287 nowait */
28289 static tree
28292 {
28293 tree c;
28300 }
28302 /* OpenACC:
28303 num_gangs ( expression ) */
28305 static tree
28307 {
28323 {
28326 }
28336 }
28338 /* OpenMP 2.5:
28339 num_threads ( expression ) */
28341 static tree
28343 location_t location)
28344 {
28366 }
28368 /* OpenACC:
28369 num_workers ( expression ) */
28371 static tree
28373 {
28389 {
28392 }
28395 location);
28403 }
28405 /* OpenMP 2.5:
28406 ordered */
28408 static tree
28411 {
28412 tree c;
28420 }
28422 /* OpenMP 2.5:
28423 reduction ( reduction-operator : variable-list )
28425 reduction-operator:
28426 One of: + * - & ^ | && ||
28428 OpenMP 3.1:
28430 reduction-operator:
28431 One of: + * - & ^ | && || min max
28433 OpenMP 4.0:
28435 reduction-operator:
28436 One of: + * - & ^ | && ||
28437 id-expression */
28439 static tree
28441 {
28449 {
28459 }
28463 else
28464 {
28475 {
28505 }
28506 else
28507 {
28509 resync_fail:
28514 }
28515 }
28521 NULL);
28523 {
28526 }
28529 }
28531 /* OpenMP 2.5:
28532 schedule ( schedule-kind )
28533 schedule ( schedule-kind , expression )
28535 schedule-kind:
28536 static | dynamic | guided | runtime | auto */
28538 static tree
28540 {
28549 {
28554 {
28575 }
28576 }
28581 else
28586 {
28601 else
28606 }
28614 invalid_kind:
28616 resync_fail:
28621 }
28623 /* OpenMP 3.0:
28624 untied */
28626 static tree
28629 {
28630 tree c;
28637 }
28639 /* OpenMP 4.0:
28640 inbranch
28641 notinbranch */
28643 static tree
28646 {
28651 }
28653 /* OpenMP 4.0:
28654 parallel
28655 for
28656 sections
28657 taskgroup */
28659 static tree
28663 {
28667 }
28669 /* OpenMP 4.0:
28670 num_teams ( expression ) */
28672 static tree
28674 location_t location)
28675 {
28697 }
28699 /* OpenMP 4.0:
28700 thread_limit ( expression ) */
28702 static tree
28704 location_t location)
28705 {
28727 }
28729 /* OpenMP 4.0:
28730 aligned ( variable-list )
28731 aligned ( variable-list : constant-expression ) */
28733 static tree
28735 {
28746 {
28756 }
28762 }
28764 /* OpenMP 4.0:
28765 linear ( variable-list )
28766 linear ( variable-list : expression ) */
28768 static tree
28771 {
28782 {
28786 {
28789 }
28797 }
28803 }
28805 /* OpenMP 4.0:
28806 safelen ( constant-expression ) */
28808 static tree
28810 location_t location)
28811 {
28832 }
28834 /* OpenMP 4.0:
28835 simdlen ( constant-expression ) */
28837 static tree
28839 location_t location)
28840 {
28861 }
28863 /* OpenMP 4.0:
28864 depend ( depend-kind : variable-list )
28866 depend-kind:
28867 in | out | inout */
28869 static tree
28871 {
28879 {
28889 else
28891 }
28892 else
28900 NULL);
28907 invalid_kind:
28909 resync_fail:
28914 }
28916 /* OpenMP 4.0:
28917 map ( map-kind : variable-list )
28918 map ( variable-list )
28920 map-kind:
28921 alloc | to | from | tofrom */
28923 static tree
28925 {
28934 {
28946 else
28947 {
28953 }
28956 }
28959 NULL);
28965 }
28967 /* OpenMP 4.0:
28968 device ( expression ) */
28970 static tree
28972 location_t location)
28973 {
28995 }
28997 /* OpenMP 4.0:
28998 dist_schedule ( static )
28999 dist_schedule ( static , expression ) */
29001 static tree
29003 location_t location)
29004 {
29017 {
29028 }
29033 location);
29037 invalid_kind:
29039 resync_fail:
29044 }
29046 /* OpenMP 4.0:
29047 proc_bind ( proc-bind-kind )
29049 proc-bind-kind:
29050 master | close | spread */
29052 static tree
29054 location_t location)
29055 {
29056 tree c;
29063 {
29073 else
29075 }
29076 else
29085 location);
29090 invalid_kind:
29092 resync_fail:
29097 }
29099 /* OpenACC:
29100 async [( int-expr )] */
29102 static tree
29104 {
29111 {
29120 }
29130 }
29132 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29133 is a bitmask in MASK. Return the list of clauses found. */
29135 static tree
29139 {
29144 {
29145 location_t here;
29146 pragma_omp_clause c_kind;
29157 {
29239 clauses =
29250 }
29255 {
29256 /* Remove the invalid clause(s) from the list to avoid
29257 confusing the rest of the compiler. */
29260 }
29261 }
29263 saw_error:
29270 }
29272 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29273 is a bitmask in MASK. Return the list of clauses found; the result
29274 of clause default goes in *pdefault. */
29276 static tree
29280 {
29287 {
29288 pragma_omp_clause c_kind;
29299 {
29311 clauses);
29325 clauses);
29334 clauses);
29358 clauses);
29372 clauses);
29389 OMP_CLAUSE_NOTINBRANCH,
29398 {
29399 clause_not_first:
29403 }
29428 clauses);
29433 clauses);
29438 clauses);
29501 }
29506 {
29507 /* Remove the invalid clause(s) from the list to avoid
29508 confusing the rest of the compiler. */
29511 }
29512 }
29513 saw_error:
29514 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29515 no reason to skip to the end. */
29521 }
29523 /* OpenMP 2.5:
29524 structured-block:
29525 statement
29527 In practice, we're also interested in adding the statement to an
29528 outer node. So it is convenient if we work around the fact that
29529 cp_parser_statement calls add_stmt. */
29531 static unsigned
29533 {
29536 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29537 This preserves the "not within loop or switch" style error messages
29538 for nonsense cases like
29539 void foo() {
29540 #pragma omp single
29541 break;
29542 }
29543 */
29548 }
29550 static void
29552 {
29554 }
29556 static tree
29558 {
29566 }
29568 /* OpenMP 2.5:
29569 # pragma omp atomic new-line
29570 expression-stmt
29572 expression-stmt:
29573 x binop= expr | x++ | ++x | x-- | --x
29574 binop:
29575 +, *, -, /, &, ^, |, <<, >>
29577 where x is an lvalue expression with scalar type.
29579 OpenMP 3.1:
29580 # pragma omp atomic new-line
29581 update-stmt
29583 # pragma omp atomic read new-line
29584 read-stmt
29586 # pragma omp atomic write new-line
29587 write-stmt
29589 # pragma omp atomic update new-line
29590 update-stmt
29592 # pragma omp atomic capture new-line
29593 capture-stmt
29595 # pragma omp atomic capture new-line
29596 capture-block
29598 read-stmt:
29599 v = x
29600 write-stmt:
29601 x = expr
29602 update-stmt:
29603 expression-stmt | x = x binop expr
29604 capture-stmt:
29605 v = expression-stmt
29606 capture-block:
29607 { v = x; update-stmt; } | { update-stmt; v = x; }
29609 OpenMP 4.0:
29610 update-stmt:
29611 expression-stmt | x = x binop expr | x = expr binop x
29612 capture-stmt:
29613 v = update-stmt
29614 capture-block:
29615 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29617 where x and v are lvalue expressions with scalar type. */
29619 static void
29621 {
29629 {
29634 {
29640 }
29641 }
29643 {
29655 else
29659 }
29661 {
29667 {
29672 {
29675 }
29676 }
29677 }
29681 {
29691 else
29696 {
29697 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29698 opcode. */
29703 }
29707 {
29710 }
29711 else
29712 {
29718 }
29721 }
29723 restart:
29727 {
29734 /* FALLTHROUGH */
29744 /* FALLTHROUGH */
29759 /* Undo effects of boolean_increment for post {in,de}crement. */
29761 /* FALLTHRU */
29765 {
29766 /* Undo effects of boolean_increment. */
29768 {
29769 /* This is pre or post increment. */
29774 && !structured_block
29778 }
29779 }
29780 /* FALLTHRU */
29783 {
29818 {
29822 }
29825 {
29831 {
29836 }
29838 {
29849 {
29851 {
29856 }
29857 else
29859 }
29863 }
29866 {
29873 }
29877 }
29881 {
29884 {
29892 }
29894 {
29899 }
29934 }
29945 /* FALLTHROUGH */
29950 }
29957 }
29958 stmt_done:
29960 {
29971 }
29973 {
29976 }
29977 done:
29983 saw_error:
29986 {
29990 {
29994 }
29995 }
29996 }
29999 /* OpenMP 2.5:
30000 # pragma omp barrier new-line */
30002 static void
30004 {
30007 }
30009 /* OpenMP 2.5:
30010 # pragma omp critical [(name)] new-line
30011 structured-block */
30013 static tree
30015 {
30019 {
30031 }
30036 }
30038 /* OpenMP 2.5:
30039 # pragma omp flush flush-vars[opt] new-line
30041 flush-vars:
30042 ( variable-list ) */
30044 static void
30046 {
30052 }
30054 /* Helper function, to parse omp for increment expression. */
30056 static tree
30058 {
30063 {
30066 }
30069 {
30078 /* Fall through: OpenMP disallows NE_EXPR. */
30081 }
30083 /* If decl is an iterator, preserve LHS and RHS of the relational
30084 expr until finish_omp_for. */
30094 }
30096 /* Helper function, to parse omp for increment expression. */
30098 static tree
30100 {
30104 cp_id_kind idk;
30108 {
30116 }
30124 {
30129 }
30136 {
30140 }
30152 do
30153 {
30160 {
30162 {
30165 else
30167 tf_warning_or_error);
30168 }
30169 else
30172 }
30173 }
30177 {
30181 }
30182 else
30186 }
30188 /* Parse the initialization statement of either an OpenMP for loop or
30189 a Cilk Plus for loop.
30191 Return true if the resulting construct should have an
30192 OMP_CLAUSE_PRIVATE added to it. */
30194 static bool
30202 {
30208 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30210 init-expr:
30211 var = lb
30212 integer-type var = lb
30213 random-access-iterator-type var = lb
30214 pointer-type var = lb
30215 */
30216 cp_decl_specifier_seq type_specifiers;
30218 /* First, try to parse as an initialized declaration. See
30219 cp_parser_condition, from whence the bulk of this is copied. */
30226 {
30227 /* If parsing a type specifier seq succeeded, then this
30228 MUST be a initialized declaration. */
30233 CP_PARSER_DECLARATOR_NAMED,
30244 else
30245 {
30255 {
30257 CPP_OPEN_PAREN))
30258 {
30262 else
30265 }
30266 else
30267 /* Trigger an error. */
30272 }
30276 {
30284 {
30287 auto_node);
30292 }
30295 asm_specification,
30296 LOOKUP_ONLYCONVERTING);
30298 {
30301 }
30302 else
30305 }
30306 else
30307 {
30308 /* Consume '='. */
30312 non_class:
30315 else
30318 asm_specification,
30319 LOOKUP_ONLYCONVERTING);
30320 }
30324 }
30325 }
30326 else
30327 {
30328 cp_id_kind idk;
30329 /* If parsing a type specifier sequence failed, then
30330 this MUST be a simple expression. */
30338 && decl
30341 {
30342 tree rhs;
30349 rhs,
30350 tf_warning_or_error));
30352 }
30353 else
30354 {
30359 {
30363 }
30364 }
30365 }
30367 }
30369 /* Parse the restricted form of the for statement allowed by OpenMP. */
30371 static tree
30374 {
30378 location_t loc_first;
30397 {
30400 location_t loc;
30404 {
30407 }
30410 {
30413 }
30422 add_private_clause
30429 {
30432 {
30438 }
30439 else
30441 }
30448 {
30453 {
30457 }
30460 {
30461 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
30462 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
30467 {
30470 }
30471 else
30472 {
30475 }
30479 }
30480 else
30481 {
30486 }
30487 }
30490 {
30491 tree c;
30493 {
30502 decl);
30506 decl);
30507 }
30509 {
30514 {
30517 }
30518 }
30519 }
30528 {
30529 /* If decl is an iterator, preserve the operator on decl
30530 until finish_omp_for. */
30532 && ((processing_template_decl
30536 else
30540 }
30555 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30556 in between the collapsed for loops to be still considered perfectly
30557 nested. Hopefully the final version clarifies this.
30558 For now handle (multiple) {'s and empty statements. */
30560 do
30561 {
30565 {
30567 bracecount++;
30568 }
30572 else
30573 {
30580 }
30581 }
30585 {
30588 }
30589 }
30591 /* Note that we saved the original contents of this flag when we entered
30592 the structured block, and so we don't need to re-save it here. */
30595 else
30598 /* Note that the grammar doesn't call for a structured block here,
30599 though the loop as a whole is a structured block. */
30606 else
30611 {
30613 {
30615 nbraces--;
30616 }
30619 else
30620 {
30622 {
30625 }
30630 }
30631 }
30638 }
30640 /* Helper function for OpenMP parsing, split clauses and call
30641 finish_omp_clauses on each of the set of clauses afterwards. */
30643 static void
30646 {
30652 }
30654 /* OpenMP 4.0:
30655 #pragma omp simd simd-clause[optseq] new-line
30656 for-loop */
30658 #define OMP_SIMD_CLAUSE_MASK \
30659 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30667 static tree
30670 {
30682 {
30685 }
30696 }
30698 /* OpenMP 2.5:
30699 #pragma omp for for-clause[optseq] new-line
30700 for-loop
30702 OpenMP 4.0:
30703 #pragma omp for simd for-simd-clause[optseq] new-line
30704 for-loop */
30706 #define OMP_FOR_CLAUSE_MASK \
30707 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30716 static tree
30719 {
30730 {
30735 {
30743 cclauses);
30747 cclauses);
30759 }
30760 }
30762 {
30765 }
30770 {
30773 }
30784 }
30786 /* OpenMP 2.5:
30787 # pragma omp master new-line
30788 structured-block */
30790 static tree
30792 {
30796 }
30798 /* OpenMP 2.5:
30799 # pragma omp ordered new-line
30800 structured-block */
30802 static tree
30804 {
30808 }
30810 /* OpenMP 2.5:
30812 section-scope:
30813 { section-sequence }
30815 section-sequence:
30816 section-directive[opt] structured-block
30817 section-sequence section-directive structured-block */
30819 static tree
30821 {
30832 {
30836 }
30839 {
30847 {
30851 }
30853 {
30856 }
30861 }
30872 }
30874 /* OpenMP 2.5:
30875 # pragma omp sections sections-clause[optseq] newline
30876 sections-scope */
30878 #define OMP_SECTIONS_CLAUSE_MASK \
30879 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30885 static tree
30888 {
30900 {
30903 }
30910 }
30912 /* OpenMP 2.5:
30913 # pragma omp parallel parallel-clause[optseq] new-line
30914 structured-block
30915 # pragma omp parallel for parallel-for-clause[optseq] new-line
30916 structured-block
30917 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30918 structured-block
30920 OpenMP 4.0:
30921 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30922 structured-block */
30924 #define OMP_PARALLEL_CLAUSE_MASK \
30925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30935 static tree
30938 {
30947 {
30960 block);
30965 }
30967 {
30971 }
30973 {
30976 }
30978 {
30982 {
30992 block);
30995 }
30996 }
31006 }
31008 /* OpenMP 2.5:
31009 # pragma omp single single-clause[optseq] new-line
31010 structured-block */
31012 #define OMP_SINGLE_CLAUSE_MASK \
31013 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31018 static tree
31020 {
31030 }
31032 /* OpenMP 3.0:
31033 # pragma omp task task-clause[optseq] new-line
31034 structured-block */
31036 #define OMP_TASK_CLAUSE_MASK \
31037 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31047 static tree
31049 {
31060 }
31062 /* OpenMP 3.0:
31063 # pragma omp taskwait new-line */
31065 static void
31067 {
31070 }
31072 /* OpenMP 3.1:
31073 # pragma omp taskyield new-line */
31075 static void
31077 {
31080 }
31082 /* OpenMP 4.0:
31083 # pragma omp taskgroup new-line
31084 structured-block */
31086 static tree
31088 {
31092 }
31095 /* OpenMP 2.5:
31096 # pragma omp threadprivate (variable-list) */
31098 static void
31100 {
31101 tree vars;
31107 }
31109 /* OpenMP 4.0:
31110 # pragma omp cancel cancel-clause[optseq] new-line */
31112 #define OMP_CANCEL_CLAUSE_MASK \
31113 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31119 static void
31121 {
31125 }
31127 /* OpenMP 4.0:
31128 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31130 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31131 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31136 static void
31138 {
31139 tree clauses;
31143 {
31148 {
31151 }
31152 }
31154 {
31158 }
31161 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31163 pragma_tok);
31165 }
31167 /* OpenMP 4.0:
31168 #pragma omp distribute distribute-clause[optseq] new-line
31169 for-loop */
31171 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31172 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31177 static tree
31180 {
31189 {
31197 else
31200 {
31206 {
31209 cclauses);
31210 else
31212 cclauses);
31213 }
31218 cclauses);
31219 else
31221 cclauses);
31233 }
31234 }
31236 {
31239 }
31244 {
31247 }
31258 }
31260 /* OpenMP 4.0:
31261 # pragma omp teams teams-clause[optseq] new-line
31262 structured-block */
31264 #define OMP_TEAMS_CLAUSE_MASK \
31265 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31273 static tree
31276 {
31285 {
31289 {
31297 cclauses);
31301 cclauses);
31312 }
31313 }
31315 {
31318 }
31323 {
31326 }
31334 }
31336 /* OpenMP 4.0:
31337 # pragma omp target data target-data-clause[optseq] new-line
31338 structured-block */
31340 #define OMP_TARGET_DATA_CLAUSE_MASK \
31341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31345 static tree
31347 {
31359 }
31361 /* OpenMP 4.0:
31362 # pragma omp target update target-update-clause[optseq] new-line */
31364 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31365 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31370 static bool
31373 {
31375 {
31377 "%<#pragma omp target update%> may only be "
31381 }
31383 tree clauses
31388 {
31390 "%<#pragma omp target update must contain at least one "
31393 }
31401 }
31403 /* OpenMP 4.0:
31404 # pragma omp target target-clause[optseq] new-line
31405 structured-block */
31407 #define OMP_TARGET_CLAUSE_MASK \
31408 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31412 static bool
31415 {
31417 {
31421 }
31424 {
31429 {
31437 {
31439 OMP_TARGET_CLAUSE_MASK,
31440 cclauses);
31442 }
31458 }
31460 {
31463 }
31465 {
31469 }
31471 {
31474 }
31475 }
31489 }
31491 /* OpenACC 2.0:
31492 # pragma acc cache (variable-list) new-line
31493 */
31495 static tree
31497 {
31512 }
31514 /* OpenACC 2.0:
31515 # pragma acc data oacc-data-clause[optseq] new-line
31516 structured-block */
31518 #define OACC_DATA_CLAUSE_MASK \
31519 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31531 static tree
31533 {
31546 }
31548 /* OpenACC 2.0:
31549 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31551 or
31553 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31555 LOC is the location of the #pragma token.
31556 */
31558 #define OACC_ENTER_DATA_CLAUSE_MASK \
31559 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31567 #define OACC_EXIT_DATA_CLAUSE_MASK \
31568 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31574 static tree
31577 {
31582 {
31588 }
31593 {
31597 }
31604 else
31609 {
31613 }
31619 else
31624 }
31626 /* OpenACC 2.0:
31627 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31628 structured-block */
31630 #define OACC_KERNELS_CLAUSE_MASK \
31631 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31645 static tree
31647 {
31660 }
31662 /* OpenACC 2.0:
31663 # pragma acc loop oacc-loop-clause[optseq] new-line
31664 structured-block */
31666 #define OACC_LOOP_CLAUSE_MASK \
31667 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31670 static tree
31672 {
31685 }
31687 /* OpenACC 2.0:
31688 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31689 structured-block */
31691 #define OACC_PARALLEL_CLAUSE_MASK \
31692 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31710 static tree
31712 {
31725 }
31727 /* OpenACC 2.0:
31728 # pragma acc update oacc-update-clause[optseq] new-line
31729 */
31731 #define OACC_UPDATE_CLAUSE_MASK \
31732 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31739 static tree
31741 {
31748 {
31750 "%<#pragma acc update%> must contain at least one "
31753 }
31761 }
31763 /* OpenACC 2.0:
31764 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31766 LOC is the location of the #pragma token.
31767 */
31769 #define OACC_WAIT_CLAUSE_MASK \
31770 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31772 static tree
31774 {
31787 }
31789 /* OpenMP 4.0:
31790 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31792 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31800 static void
31803 {
31805 cp_omp_declare_simd_data data;
31807 {
31812 }
31823 {
31827 {
31840 }
31845 "%<#pragma omp declare simd%> not immediately followed by "
31849 }
31850 }
31852 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31853 This function is modelled similar to the late parsing of omp declare
31854 simd. */
31856 static tree
31858 {
31864 {
31870 }
31872 {
31876 }
31881 {
31888 NULL);
31902 }
31907 }
31909 /* Finalize #pragma omp declare simd clauses after direct declarator has
31910 been parsed, and put that into "omp declare simd" attribute. */
31912 static tree
31914 {
31920 {
31925 }
31930 {
31948 }
31952 }
31955 /* OpenMP 4.0:
31956 # pragma omp declare target new-line
31957 declarations and definitions
31958 # pragma omp end declare target new-line */
31960 static void
31962 {
31965 }
31967 static void
31969 {
31972 {
31975 }
31977 {
31981 {
31984 }
31987 else
31988 {
31992 }
31993 }
31994 else
31995 {
31999 }
32003 "%<#pragma omp end declare target%> without corresponding "
32005 else
32007 }
32009 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32010 expression and optional initializer clause of
32011 #pragma omp declare reduction. We store the expression(s) as
32012 either 3, 6 or 7 special statements inside of the artificial function's
32013 body. The first two statements are DECL_EXPRs for the artificial
32014 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32015 expression that uses those variables.
32016 If there was any INITIALIZER clause, this is followed by further statements,
32017 the fourth and fifth statements are DECL_EXPRs for the artificial
32018 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32019 constructor variant (first token after open paren is not omp_priv),
32020 then the sixth statement is a statement with the function call expression
32021 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32022 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32023 to initialize the OMP_PRIV artificial variable and there is seventh
32024 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32026 static bool
32028 {
32040 tree combiner;
32055 {
32058 }
32061 {
32068 {
32071 }
32087 {
32091 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32095 == CPP_CLOSE_PAREN
32098 {
32102 }
32107 }
32108 else
32109 {
32125 {
32130 }
32132 tree arg;
32145 }
32156 }
32162 }
32164 /* OpenMP 4.0
32165 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32166 initializer-clause[opt] new-line
32168 initializer-clause:
32169 initializer (omp_priv initializer)
32170 initializer (function-name (argument-list)) */
32172 static void
32175 {
32185 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32192 {
32224 }
32236 /* Types may not be defined in declare reduction type list. */
32239 parser->type_definition_forbidden_message
32245 saved_colon_doesnt_start_class_def_p
32250 {
32254 ;
32275 else
32280 else
32282 }
32284 /* Restore the saved message. */
32287 parser->colon_doesnt_start_class_def_p
32292 {
32293 fail:
32296 }
32302 {
32303 tree fntype
32306 NULL_TREE);
32325 {
32330 }
32332 {
32334 {
32343 }
32350 }
32351 else
32352 {
32355 }
32358 else
32361 {
32364 }
32366 {
32369 else
32374 }
32379 else
32380 {
32389 }
32396 }
32400 done:
32401 /* Free any declarators allocated. */
32403 }
32405 /* OpenMP 4.0
32406 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32407 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32408 initializer-clause[opt] new-line
32409 #pragma omp declare target new-line */
32411 static void
32414 {
32416 {
32421 {
32424 context);
32426 }
32429 {
32432 context);
32434 }
32436 {
32439 }
32441 {
32445 }
32446 }
32450 }
32452 /* Main entry point to OpenMP statement pragmas. */
32454 static void
32456 {
32457 tree stmt;
32462 {
32537 }
32541 }
32542 \f
32543 /* Transactional Memory parsing routines. */
32545 /* Parse a transaction attribute.
32547 txn-attribute:
32548 attribute
32549 [ [ identifier ] ]
32551 ??? Simplify this when C++0x bracket attributes are
32552 implemented properly. */
32554 static tree
32556 {
32571 {
32575 /* For keywords, use the canonical spelling,
32576 not the parsed identifier. */
32580 }
32581 else
32585 error1:
32588 }
32590 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32592 transaction-statement:
32593 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32594 compound-statement
32595 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32596 */
32598 static tree
32600 {
32615 else
32616 {
32620 }
32622 /* Parse a noexcept specification. */
32625 /* Keep track if we're in the lexical scope of an outer transaction. */
32637 }
32639 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32641 transaction-expression:
32642 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32643 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32644 */
32646 static tree
32648 {
32673 /* Set this early. This might mean that we allow transaction_cancel in
32674 an expression that we find out later actually has to be a constexpr.
32675 However, we expect that cxx_constant_value will be able to deal with
32676 this; also, if the noexcept has no constexpr, then what we parse next
32677 really is a transaction's body. */
32680 /* Parse a noexcept specification. */
32686 {
32693 }
32694 else
32695 {
32696 /* The only expression that is available got parsed for the noexcept
32697 already. noexcept is true then. */
32700 }
32709 }
32711 /* Parse a function-transaction-block.
32713 function-transaction-block:
32714 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32715 function-body
32716 __transaction_atomic txn-attribute[opt] function-try-block
32717 __transaction_relaxed ctor-initializer[opt] function-body
32718 __transaction_relaxed function-try-block
32719 */
32721 static bool
32723 {
32739 else
32740 {
32744 }
32752 else
32753 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32761 }
32763 /* Parse a __transaction_cancel statement.
32765 cancel-statement:
32766 __transaction_cancel txn-attribute[opt] ;
32767 __transaction_cancel txn-attribute[opt] throw-expression ;
32769 ??? Cancel and throw is not yet implemented. */
32771 static tree
32773 {
32779 RT_TRANSACTION_CANCEL);
32786 /* ??? Parse cancel-and-throw here. */
32791 {
32795 }
32797 {
32801 }
32803 {
32806 {
32812 }
32813 }
32815 {
32819 }
32825 }
32826 \f
32827 /* The parser. */
32831 \f
32832 /* Special handling for the first token or line in the file. The first
32833 thing in the file might be #pragma GCC pch_preprocess, which loads a
32834 PCH file, which is a GC collection point. So we need to handle this
32835 first pragma without benefit of an existing lexer structure.
32837 Always returns one token to the caller in *FIRST_TOKEN. This is
32838 either the true first token of the file, or the first token after
32839 the initial pragma. */
32841 static void
32843 {
32852 {
32859 }
32860 else
32863 /* Skip to the end of the pragma. */
32867 /* Now actually load the PCH file. */
32871 /* Read one more token to return to our caller. We have to do this
32872 after reading the PCH file in, since its pointers have to be
32873 live. */
32875 }
32877 /* Parses the grainsize pragma for the _Cilk_for statement.
32878 Syntax:
32879 #pragma cilk grainsize = <VALUE>. */
32881 static void
32883 {
32885 {
32890 {
32893 }
32895 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
32898 else
32900 "%<#pragma cilk grainsize%> is not followed by "
32903 }
32905 }
32907 /* Normal parsing of a pragma token. Here we can (and must) use the
32908 regular lexer. */
32910 static bool
32912 {
32924 {
32932 {
32942 }
32947 {
32957 }
32962 {
32968 "%<#pragma omp taskwait%> may only be "
32973 }
32978 {
32984 "%<#pragma omp taskyield%> may only be "
32989 }
32994 {
33000 "%<#pragma omp cancel%> may only be "
33005 }
33010 {
33016 "%<#pragma omp cancellation point%> may only be "
33021 }
33068 "%<#pragma omp section%> may only be used in "
33073 {
33080 {
33083 }
33086 }
33090 {
33094 }
33100 {
33104 }
33106 /* Ignore the pragma if Cilk Plus is not enabled. */
33108 {
33111 }
33112 else
33113 {
33117 }
33124 bad_stmt:
33127 }
33131 }
33133 /* The interface the pragma parsers have to the lexer. */
33135 enum cpp_ttype
33137 {
33150 else
33151 {
33155 }
33158 }
33160 \f
33161 /* External interface. */
33163 /* Parse one entire translation unit. */
33165 void
33167 {
33179 }
33181 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33182 vectorlength clause:
33183 Syntax:
33184 vectorlength ( constant-expression ) */
33186 static tree
33189 {
33191 tree expr;
33192 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33193 safelen clause. Thus, vectorlength is represented as OMP 4.0
33194 safelen. For SIMD-enabled function it is represented by OMP 4.0
33195 simdlen. */
33198 loc);
33199 else
33201 loc);
33209 /* If expr == error_mark_node, then don't emit any errors nor
33210 create a clause. if any of the above functions returns
33211 error mark node then they would have emitted an error message. */
33213 ;
33221 else
33222 {
33223 tree c;
33225 {
33230 }
33231 else
33232 {
33237 }
33238 }
33243 }
33245 /* Handles the Cilk Plus #pragma simd linear clause.
33246 Syntax:
33247 linear ( simd-linear-variable-list )
33249 simd-linear-variable-list:
33250 simd-linear-variable
33251 simd-linear-variable-list , simd-linear-variable
33253 simd-linear-variable:
33254 id-expression
33255 id-expression : simd-linear-step
33257 simd-linear-step:
33258 conditional-expression */
33260 static tree
33262 {
33268 {
33272 }
33277 {
33280 {
33284 }
33291 {
33295 }
33296 else
33297 {
33301 /* If present, parse the linear step. Otherwise, assume the default
33302 value of 1. */
33304 {
33311 {
33312 /* If an error has occurred, then the whole pragma is
33313 considered ill-formed. Thus, no reason to keep
33314 parsing. */
33317 }
33325 else
33327 "step size must be an integer constant "
33329 }
33331 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33337 }
33342 else
33343 {
33348 }
33349 }
33353 }
33355 /* Returns the name of the next clause. If the clause is not
33356 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33357 token is not consumed. Otherwise, the appropriate enum from the
33358 pragma_simd_clause is returned and the token is consumed. */
33360 static pragma_omp_clause
33362 {
33363 pragma_omp_clause clause_type;
33380 else
33385 }
33387 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33389 static tree
33391 {
33396 {
33397 pragma_omp_clause c_kind;
33404 /* Use the OpenMP 4.0 equivalent function. */
33407 /* Use the OpenMP 4.0 equivalent function. */
33409 clauses);
33411 /* Use the OMP 4.0 equivalent function. */
33413 clauses);
33415 /* Use the OMP 4.0 equivalent function. */
33417 else
33418 {
33422 }
33423 }
33429 else
33431 }
33433 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33435 static void
33437 {
33444 {
33448 }
33457 }
33459 /* Main entry-point for parsing Cilk Plus _Cilk_for
33460 loops. The return value is error_mark_node
33461 when errors happen and CILK_FOR tree on success. */
33463 static tree
33465 {
33480 else
33486 }
33488 /* Create an identifier for a generic parameter type (a synthesized
33489 template parameter implied by `auto' or a concept identifier). */
33492 static tree
33494 {
33498 }
33500 /* Predicate that behaves as is_auto_or_concept but matches the parent
33501 node of the generic type rather than the generic type itself. This
33502 allows for type transformation in add_implicit_template_parms. */
33506 {
33508 }
33510 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33511 (creating a new template parameter list if necessary). Returns the newly
33512 created template type parm. */
33514 tree
33516 {
33519 /* We are either continuing a function template that already contains implicit
33520 template parameters, creating a new fully-implicit function template, or
33521 extending an existing explicit function template with implicit template
33522 parameters. */
33530 {
33534 }
33535 else
33536 {
33537 /* Roll back to the existing template parameter scope (in the case of
33538 extending an explicit function template) or introduce a new template
33539 parameter scope ahead of the function parameter scope (or class scope
33540 in the case of out-of-line member definitions). The function scope is
33541 added back after template parameter synthesis below. */
33546 {
33549 }
33551 {
33552 /* If not defining a class, then any class scope is a scope level in
33553 an out-of-line member definition. In this case simply wind back
33554 beyond the first such scope to inject the template parameter list.
33555 Otherwise wind back to the class being defined. The latter can
33556 occur in class member friend declarations such as:
33558 class A {
33559 void foo (auto);
33560 };
33561 class B {
33562 friend void A::foo (auto);
33563 };
33565 The template parameter list synthesized for the friend declaration
33566 must be injected in the scope of 'B'. This can also occur in
33567 erroneous cases such as:
33569 struct A {
33570 struct B {
33571 void foo (auto);
33572 };
33573 void B::foo (auto) {}
33574 };
33576 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33577 but, nevertheless, the template parameter list synthesized for the
33578 declarator should be injected into the scope of 'A' as if the
33579 ill-formed template was specified explicitly. */
33582 {
33585 }
33586 }
33592 {
33593 /* Introduce a new template parameter list for implicit template
33594 parameters. */
33598 parser->implicit_template_scope
33605 }
33606 else
33607 {
33608 /* Synthesize implicit template parameters at the end of the explicit
33609 template parameter list. */
33616 parser->implicit_template_parms
33618 }
33619 }
33621 /* Synthesize a new template parameter and track the current template
33622 parameter chain with implicit_template_parms. */
33626 synth_id);
33627 tree new_parm
33629 input_location,
33636 parser->implicit_template_parms
33638 else
33643 /* If creating a fully implicit function template, start the new implicit
33644 template parameter list with this synthesized type, otherwise grow the
33645 current template parameter list. */
33648 {
33655 }
33656 else
33657 {
33662 }
33667 }
33669 /* Finish the declaration of a fully implicit function template. Such a
33670 template has no explicit template parameter list so has not been through the
33671 normal template head and tail processing. synthesize_implicit_template_parm
33672 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33673 provided if the declaration is a class member such that its template
33674 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33675 form is returned. Otherwise NULL_TREE is returned. */
33677 tree
33679 {
33684 {
33688 }
33698 }