| blob | 3e8270e1e6acb0629a494864f1d36a5f0cd1acc3 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2016 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/>. */
44 \f
45 /* The lexer. */
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
51 {
53 };
55 /* The various kinds of non integral constant we encounter. */
57 NIC_NONE,
58 /* floating-point literal */
59 NIC_FLOAT,
60 /* %<this%> */
61 NIC_THIS,
62 /* %<__FUNCTION__%> */
63 NIC_FUNC_NAME,
64 /* %<__PRETTY_FUNCTION__%> */
65 NIC_PRETTY_FUNC,
66 /* %<__func__%> */
67 NIC_C99_FUNC,
68 /* "%<va_arg%> */
69 NIC_VA_ARG,
70 /* a cast */
71 NIC_CAST,
72 /* %<typeid%> operator */
73 NIC_TYPEID,
74 /* non-constant compound literals */
75 NIC_NCC,
76 /* a function call */
77 NIC_FUNC_CALL,
78 /* an increment */
79 NIC_INC,
80 /* an decrement */
81 NIC_DEC,
82 /* an array reference */
83 NIC_ARRAY_REF,
84 /* %<->%> */
85 NIC_ARROW,
86 /* %<.%> */
87 NIC_POINT,
88 /* the address of a label */
89 NIC_ADDR_LABEL,
90 /* %<*%> */
91 NIC_STAR,
92 /* %<&%> */
93 NIC_ADDR,
94 /* %<++%> */
95 NIC_PREINCREMENT,
96 /* %<--%> */
97 NIC_PREDECREMENT,
98 /* %<new%> */
99 NIC_NEW,
100 /* %<delete%> */
101 NIC_DEL,
102 /* calls to overloaded operators */
103 NIC_OVERLOADED,
104 /* an assignment */
105 NIC_ASSIGNMENT,
106 /* a comma operator */
107 NIC_COMMA,
108 /* a call to a constructor */
109 NIC_CONSTRUCTOR,
110 /* a transaction expression */
111 NIC_TRANSACTION
112 };
114 /* The various kinds of errors about name-lookup failing. */
116 /* NULL */
117 NLE_NULL,
118 /* is not a type */
119 NLE_TYPE,
120 /* is not a class or namespace */
121 NLE_CXX98,
122 /* is not a class, namespace, or enumeration */
123 NLE_NOT_CXX98
124 };
126 /* The various kinds of required token */
128 RT_NONE,
150 /* The type is CPP_KEYWORD */
179 RT_TRANSACTION_CANCEL /* __transaction_cancel */
180 };
182 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
183 reverting it on destruction. */
185 class type_id_in_expr_sentinel
186 {
196 };
198 /* Prototypes. */
204 static void cp_lexer_destroy
206 static int cp_lexer_saving_tokens
210 static void cp_lexer_get_preprocessor_token
218 static bool cp_lexer_next_token_is_not
220 static bool cp_lexer_next_token_is_keyword
224 static void cp_lexer_purge_token
226 static void cp_lexer_purge_tokens_after
228 static void cp_lexer_save_tokens
230 static void cp_lexer_commit_tokens
232 static void cp_lexer_rollback_tokens
234 static void cp_lexer_print_token
238 static void cp_lexer_start_debugging
240 static void cp_lexer_stop_debugging
246 static void cp_parser_initial_pragma
249 static tree cp_literal_operator_id
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if the next token is a keyword for a decl-specifier. */
942 static bool
944 {
949 {
950 /* auto specifier: storage-class-specifier in C++,
951 simple-type-specifier in C++0x. */
953 /* Storage classes. */
959 /* Elaborated type specifiers. */
965 /* Simple type specifiers. */
979 /* GNU extensions. */
982 /* C++0x extensions. */
993 }
994 }
996 /* Returns TRUE iff the token T begins a decltype type. */
998 static bool
1000 {
1003 }
1005 /* Returns TRUE iff the next token begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Called when processing a token with tree_check_value; perform or defer the
1015 associated checks and return the value. */
1017 static tree
1019 {
1020 /* Perform any access checks that were deferred. */
1025 {
1031 }
1032 /* Return the stored value. */
1034 }
1036 /* Return a pointer to the Nth token in the token stream. If N is 1,
1037 then this is precisely equivalent to cp_lexer_peek_token (except
1038 that it is not inline). One would like to disallow that case, but
1039 there is one case (cp_parser_nth_token_starts_template_id) where
1040 the caller passes a variable for N and it might be 1. */
1044 {
1047 /* N is 1-based, not zero-based. */
1058 {
1061 {
1064 }
1068 }
1071 {
1074 }
1077 }
1079 /* Return the next token, and advance the lexer's next_token pointer
1080 to point to the next non-purged token. */
1084 {
1090 do
1091 {
1094 {
1097 }
1099 }
1104 /* Provide debugging output. */
1106 {
1110 }
1113 }
1115 /* Permanently remove the next token from the token stream, and
1116 advance the next_token pointer to refer to the next non-purged
1117 token. */
1119 static void
1121 {
1130 do
1131 {
1132 tok++;
1134 {
1137 }
1138 }
1141 }
1143 /* Permanently remove all tokens after TOK, up to, but not
1144 including, the token that will be returned next by
1145 cp_lexer_peek_token. */
1147 static void
1149 {
1158 {
1163 }
1164 }
1166 /* Begin saving tokens. All tokens consumed after this point will be
1167 preserved. */
1169 static void
1171 {
1172 /* Provide debugging output. */
1177 }
1179 /* Commit to the portion of the token stream most recently saved. */
1181 static void
1183 {
1184 /* Provide debugging output. */
1189 }
1191 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1192 to the token stream. Stop saving tokens. */
1194 static void
1196 {
1197 /* Provide debugging output. */
1202 }
1204 /* RAII wrapper around the above functions, with sanity checking. Creating
1205 a variable saves tokens, which are committed when the variable is
1206 destroyed unless they are explicitly rolled back by calling the rollback
1207 member function. */
1209 struct saved_token_sentinel
1210 {
1215 {
1218 }
1220 {
1223 }
1225 {
1229 }
1230 };
1232 /* Print a representation of the TOKEN on the STREAM. */
1234 static void
1236 {
1237 /* We don't use cpp_type2name here because the parser defines
1238 a few tokens of its own. */
1240 /* cpplib-defined token types */
1241 #define OP(e, s) #e,
1242 #define TK(e, s) #e,
1243 TTYPE_TABLE
1244 #undef OP
1245 #undef TK
1246 /* C++ parser token types - see "Manifest constants", above. */
1250 };
1252 /* For some tokens, print the associated data. */
1254 {
1256 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1257 For example, `struct' is mapped to an INTEGER_CST. */
1260 /* else fall through */
1278 /* If we have a name for the token, print it out. Otherwise, we
1279 simply give the numeric code. */
1282 else
1285 }
1286 }
1288 DEBUG_FUNCTION void
1290 {
1293 }
1295 DEBUG_FUNCTION void
1297 {
1300 else
1302 }
1305 /* Start emitting debugging information. */
1307 static void
1309 {
1316 }
1318 /* Stop emitting debugging information. */
1320 static void
1322 {
1329 }
1331 /* Create a new cp_token_cache, representing a range of tokens. */
1335 {
1340 }
1342 /* Diagnose if #pragma omp declare simd isn't followed immediately
1343 by function declaration or definition. */
1347 {
1349 {
1353 }
1354 }
1356 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1357 and put that into "omp declare simd" attribute. */
1361 {
1363 {
1365 {
1368 }
1370 {
1373 }
1374 }
1375 }
1377 /* Diagnose if #pragma acc routine isn't followed immediately by function
1378 declaration or definition. */
1382 {
1384 {
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1454 }
1456 /* Make a declarator for a generalized identifier. If
1457 QUALIFYING_SCOPE is non-NULL, the identifier is
1458 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1459 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1460 is, if any. */
1464 special_function_kind sfk)
1465 {
1468 /* It is valid to write:
1470 class C { void f(); };
1471 typedef C D;
1472 void D::f();
1474 The standard is not clear about whether `typedef const C D' is
1475 legal; as of 2002-09-15 the committee is considering that
1476 question. EDG 3.0 allows that syntax. Therefore, we do as
1477 well. */
1491 }
1493 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1494 of modifiers such as const or volatile to apply to the pointer
1495 type, represented as identifiers. ATTRIBUTES represent the attributes that
1496 appertain to the pointer or reference. */
1498 cp_declarator *
1500 tree attributes)
1501 {
1509 {
1513 }
1514 else
1520 }
1522 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1523 represent the attributes that appertain to the pointer or
1524 reference. */
1526 cp_declarator *
1529 {
1537 {
1541 }
1542 else
1548 }
1550 /* Like make_pointer_declarator -- but for a pointer to a non-static
1551 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1552 appertain to the pointer or reference. */
1554 cp_declarator *
1557 tree attributes)
1558 {
1567 {
1570 }
1571 else
1577 }
1579 /* Make a declarator for the function given by TARGET, with the
1580 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1581 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1582 indicates what exceptions can be thrown. */
1584 cp_declarator *
1586 tree parms,
1587 cp_cv_quals cv_qualifiers,
1588 cp_virt_specifiers virt_specifiers,
1589 cp_ref_qualifier ref_qualifier,
1590 tree tx_qualifier,
1591 tree exception_specification,
1592 tree late_return_type,
1593 tree requires_clause)
1594 {
1608 {
1612 }
1613 else
1617 }
1619 /* Make a declarator for an array of BOUNDS elements, each of which is
1620 defined by ELEMENT. */
1622 cp_declarator *
1624 {
1631 {
1635 }
1636 else
1640 }
1642 /* Determine whether the declarator we've seen so far can be a
1643 parameter pack, when followed by an ellipsis. */
1644 static bool
1646 {
1648 /* We already saw an ellipsis. */
1651 /* Search for a declarator name, or any other declarator that goes
1652 after the point where the ellipsis could appear in a parameter
1653 pack. If we find any of these, then this declarator can not be
1654 made into a parameter pack. */
1657 {
1659 {
1671 }
1672 }
1675 }
1679 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1680 DECLARATOR and DEFAULT_ARGUMENT. */
1682 cp_parameter_declarator *
1685 tree default_argument,
1687 {
1695 else
1702 }
1704 /* Returns true iff DECLARATOR is a declaration for a function. */
1706 static bool
1708 {
1710 {
1718 }
1720 }
1722 /* The parser. */
1724 /* Overview
1725 --------
1727 A cp_parser parses the token stream as specified by the C++
1728 grammar. Its job is purely parsing, not semantic analysis. For
1729 example, the parser breaks the token stream into declarators,
1730 expressions, statements, and other similar syntactic constructs.
1731 It does not check that the types of the expressions on either side
1732 of an assignment-statement are compatible, or that a function is
1733 not declared with a parameter of type `void'.
1735 The parser invokes routines elsewhere in the compiler to perform
1736 semantic analysis and to build up the abstract syntax tree for the
1737 code processed.
1739 The parser (and the template instantiation code, which is, in a
1740 way, a close relative of parsing) are the only parts of the
1741 compiler that should be calling push_scope and pop_scope, or
1742 related functions. The parser (and template instantiation code)
1743 keeps track of what scope is presently active; everything else
1744 should simply honor that. (The code that generates static
1745 initializers may also need to set the scope, in order to check
1746 access control correctly when emitting the initializers.)
1748 Methodology
1749 -----------
1751 The parser is of the standard recursive-descent variety. Upcoming
1752 tokens in the token stream are examined in order to determine which
1753 production to use when parsing a non-terminal. Some C++ constructs
1754 require arbitrary look ahead to disambiguate. For example, it is
1755 impossible, in the general case, to tell whether a statement is an
1756 expression or declaration without scanning the entire statement.
1757 Therefore, the parser is capable of "parsing tentatively." When the
1758 parser is not sure what construct comes next, it enters this mode.
1759 Then, while we attempt to parse the construct, the parser queues up
1760 error messages, rather than issuing them immediately, and saves the
1761 tokens it consumes. If the construct is parsed successfully, the
1762 parser "commits", i.e., it issues any queued error messages and
1763 the tokens that were being preserved are permanently discarded.
1764 If, however, the construct is not parsed successfully, the parser
1765 rolls back its state completely so that it can resume parsing using
1766 a different alternative.
1768 Future Improvements
1769 -------------------
1771 The performance of the parser could probably be improved substantially.
1772 We could often eliminate the need to parse tentatively by looking ahead
1773 a little bit. In some places, this approach might not entirely eliminate
1774 the need to parse tentatively, but it might still speed up the average
1775 case. */
1777 /* Flags that are passed to some parsing functions. These values can
1778 be bitwise-ored together. */
1780 enum
1781 {
1782 /* No flags. */
1784 /* The construct is optional. If it is not present, then no error
1785 should be issued. */
1787 /* When parsing a type-specifier, treat user-defined type-names
1788 as non-type identifiers. */
1790 /* When parsing a type-specifier, do not try to parse a class-specifier
1791 or enum-specifier. */
1793 /* When parsing a decl-specifier-seq, only allow type-specifier or
1794 constexpr. */
1796 };
1798 /* This type is used for parameters and variables which hold
1799 combinations of the above flags. */
1802 /* The different kinds of declarators we want to parse. */
1804 enum cp_parser_declarator_kind
1805 {
1806 /* We want an abstract declarator. */
1807 CP_PARSER_DECLARATOR_ABSTRACT,
1808 /* We want a named declarator. */
1809 CP_PARSER_DECLARATOR_NAMED,
1810 /* We don't mind, but the name must be an unqualified-id. */
1811 CP_PARSER_DECLARATOR_EITHER
1812 };
1814 /* The precedence values used to parse binary expressions. The minimum value
1815 of PREC must be 1, because zero is reserved to quickly discriminate
1816 binary operators from other tokens. */
1818 enum cp_parser_prec
1819 {
1820 PREC_NOT_OPERATOR,
1821 PREC_LOGICAL_OR_EXPRESSION,
1822 PREC_LOGICAL_AND_EXPRESSION,
1823 PREC_INCLUSIVE_OR_EXPRESSION,
1824 PREC_EXCLUSIVE_OR_EXPRESSION,
1825 PREC_AND_EXPRESSION,
1826 PREC_EQUALITY_EXPRESSION,
1827 PREC_RELATIONAL_EXPRESSION,
1828 PREC_SHIFT_EXPRESSION,
1829 PREC_ADDITIVE_EXPRESSION,
1830 PREC_MULTIPLICATIVE_EXPRESSION,
1831 PREC_PM_EXPRESSION,
1832 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1833 };
1835 /* A mapping from a token type to a corresponding tree node type, with a
1836 precedence value. */
1838 struct cp_parser_binary_operations_map_node
1839 {
1840 /* The token type. */
1842 /* The corresponding tree code. */
1844 /* The precedence of this operator. */
1846 };
1848 struct cp_parser_expression_stack_entry
1849 {
1850 /* Left hand side of the binary operation we are currently
1851 parsing. */
1852 cp_expr lhs;
1853 /* Original tree code for left hand side, if it was a binary
1854 expression itself (used for -Wparentheses). */
1856 /* Tree code for the binary operation we are parsing. */
1858 /* Precedence of the binary operation we are parsing. */
1860 /* Location of the binary operation we are parsing. */
1861 location_t loc;
1862 };
1864 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1865 entries because precedence levels on the stack are monotonically
1866 increasing. */
1870 /* Prototypes. */
1872 /* Constructors and destructors. */
1877 /* Class variables. */
1881 /* The operator-precedence table used by cp_parser_binary_expression.
1882 Transformed into an associative array (binops_by_token) by
1883 cp_parser_new. */
1916 };
1918 /* The same as binops, but initialized by cp_parser_new so that
1919 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1920 for speed. */
1923 /* Constructors and destructors. */
1925 /* Construct a new context. The context below this one on the stack
1926 is given by NEXT. */
1930 {
1933 /* Allocate the storage. */
1935 {
1936 /* Pull the first entry from the free list. */
1940 }
1941 else
1944 /* No errors have occurred yet in this context. */
1946 /* If this is not the bottommost context, copy information that we
1947 need from the previous context. */
1949 {
1950 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1951 expression, then we are parsing one in this context, too. */
1953 /* Thread the stack. */
1955 }
1958 }
1960 /* Managing the unparsed function queues. */
1962 #define unparsed_funs_with_default_args \
1963 parser->unparsed_queues->last ().funs_with_default_args
1964 #define unparsed_funs_with_definitions \
1965 parser->unparsed_queues->last ().funs_with_definitions
1966 #define unparsed_nsdmis \
1967 parser->unparsed_queues->last ().nsdmis
1968 #define unparsed_classes \
1969 parser->unparsed_queues->last ().classes
1971 static void
1973 {
1976 }
1978 static void
1980 {
1983 }
1985 /* Prototypes. */
1987 /* Constructors and destructors. */
1992 /* Routines to parse various constructs.
1994 Those that return `tree' will return the error_mark_node (rather
1995 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1996 Sometimes, they will return an ordinary node if error-recovery was
1997 attempted, even though a parse error occurred. So, to check
1998 whether or not a parse error occurred, you should always use
1999 cp_parser_error_occurred. If the construct is optional (indicated
2000 either by an `_opt' in the name of the function that does the
2001 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2002 the construct is not present. */
2004 /* Lexical conventions [gram.lex] */
2006 static cp_expr cp_parser_identifier
2008 static cp_expr cp_parser_string_literal
2010 static cp_expr cp_parser_userdef_char_literal
2012 static tree cp_parser_userdef_string_literal
2014 static cp_expr cp_parser_userdef_numeric_literal
2017 /* Basic concepts [gram.basic] */
2019 static bool cp_parser_translation_unit
2022 /* Expressions [gram.expr] */
2024 static cp_expr cp_parser_primary_expression
2026 static cp_expr cp_parser_id_expression
2028 static cp_expr cp_parser_unqualified_id
2030 static tree cp_parser_nested_name_specifier_opt
2032 static tree cp_parser_nested_name_specifier
2034 static tree cp_parser_qualifying_entity
2036 static cp_expr cp_parser_postfix_expression
2038 static tree cp_parser_postfix_open_square_expression
2040 static tree cp_parser_postfix_dot_deref_expression
2044 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2046 static void cp_parser_pseudo_destructor_name
2048 static cp_expr cp_parser_unary_expression
2050 static enum tree_code cp_parser_unary_operator
2052 static tree cp_parser_new_expression
2056 static tree cp_parser_new_type_id
2064 static tree cp_parser_delete_expression
2066 static cp_expr cp_parser_cast_expression
2068 static cp_expr cp_parser_binary_expression
2070 static tree cp_parser_question_colon_clause
2072 static cp_expr cp_parser_assignment_expression
2074 static enum tree_code cp_parser_assignment_operator_opt
2076 static cp_expr cp_parser_expression
2078 static cp_expr cp_parser_constant_expression
2080 static cp_expr cp_parser_builtin_offsetof
2082 static cp_expr cp_parser_lambda_expression
2084 static void cp_parser_lambda_introducer
2086 static bool cp_parser_lambda_declarator_opt
2088 static void cp_parser_lambda_body
2091 /* Statements [gram.stmt.stmt] */
2093 static void cp_parser_statement
2095 static void cp_parser_label_for_labeled_statement
2097 static tree cp_parser_expression_statement
2099 static tree cp_parser_compound_statement
2101 static void cp_parser_statement_seq_opt
2103 static tree cp_parser_selection_statement
2105 static tree cp_parser_condition
2107 static tree cp_parser_iteration_statement
2109 static bool cp_parser_for_init_statement
2111 static tree cp_parser_for
2113 static tree cp_parser_c_for
2115 static tree cp_parser_range_for
2117 static void do_range_for_auto_deduction
2119 static tree cp_parser_perform_range_for_lookup
2121 static tree cp_parser_range_for_member_function
2123 static tree cp_parser_jump_statement
2125 static void cp_parser_declaration_statement
2128 static tree cp_parser_implicitly_scoped_statement
2130 static void cp_parser_already_scoped_statement
2133 /* Declarations [gram.dcl.dcl] */
2135 static void cp_parser_declaration_seq_opt
2137 static void cp_parser_declaration
2139 static void cp_parser_block_declaration
2141 static void cp_parser_simple_declaration
2143 static void cp_parser_decl_specifier_seq
2145 static tree cp_parser_storage_class_specifier_opt
2147 static tree cp_parser_function_specifier_opt
2149 static tree cp_parser_type_specifier
2152 static tree cp_parser_simple_type_specifier
2154 static tree cp_parser_type_name
2156 static tree cp_parser_type_name
2158 static tree cp_parser_nonclass_name
2160 static tree cp_parser_elaborated_type_specifier
2162 static tree cp_parser_enum_specifier
2164 static void cp_parser_enumerator_list
2166 static void cp_parser_enumerator_definition
2168 static tree cp_parser_namespace_name
2170 static void cp_parser_namespace_definition
2172 static void cp_parser_namespace_body
2174 static tree cp_parser_qualified_namespace_specifier
2176 static void cp_parser_namespace_alias_definition
2178 static bool cp_parser_using_declaration
2180 static void cp_parser_using_directive
2182 static tree cp_parser_alias_declaration
2184 static void cp_parser_asm_definition
2186 static void cp_parser_linkage_specification
2188 static void cp_parser_static_assert
2190 static tree cp_parser_decltype
2193 /* Declarators [gram.dcl.decl] */
2195 static tree cp_parser_init_declarator
2202 static enum tree_code cp_parser_ptr_operator
2204 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2206 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2208 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2210 static tree cp_parser_tx_qualifier_opt
2212 static tree cp_parser_late_return_type_opt
2214 static tree cp_parser_declarator_id
2216 static tree cp_parser_type_id
2218 static tree cp_parser_template_type_arg
2221 static tree cp_parser_type_id_1
2223 static void cp_parser_type_specifier_seq
2225 static tree cp_parser_parameter_declaration_clause
2227 static tree cp_parser_parameter_declaration_list
2231 static tree cp_parser_default_argument
2233 static void cp_parser_function_body
2235 static tree cp_parser_initializer
2237 static cp_expr cp_parser_initializer_clause
2239 static cp_expr cp_parser_braced_list
2244 static bool cp_parser_ctor_initializer_opt_and_function_body
2247 static tree cp_parser_late_parsing_omp_declare_simd
2250 static tree cp_parser_late_parsing_cilk_simd_fn_info
2253 static tree cp_parser_late_parsing_oacc_routine
2256 static tree synthesize_implicit_template_parm
2258 static tree finish_fully_implicit_template
2261 /* Classes [gram.class] */
2263 static tree cp_parser_class_name
2265 static tree cp_parser_class_specifier
2267 static tree cp_parser_class_head
2269 static enum tag_types cp_parser_class_key
2271 static void cp_parser_type_parameter_key
2273 static void cp_parser_member_specification_opt
2275 static void cp_parser_member_declaration
2277 static tree cp_parser_pure_specifier
2279 static tree cp_parser_constant_initializer
2282 /* Derived classes [gram.class.derived] */
2284 static tree cp_parser_base_clause
2286 static tree cp_parser_base_specifier
2289 /* Special member functions [gram.special] */
2291 static tree cp_parser_conversion_function_id
2293 static tree cp_parser_conversion_type_id
2297 static bool cp_parser_ctor_initializer_opt
2299 static void cp_parser_mem_initializer_list
2301 static tree cp_parser_mem_initializer
2303 static tree cp_parser_mem_initializer_id
2306 /* Overloading [gram.over] */
2308 static cp_expr cp_parser_operator_function_id
2310 static cp_expr cp_parser_operator
2313 /* Templates [gram.temp] */
2315 static void cp_parser_template_declaration
2317 static tree cp_parser_template_parameter_list
2319 static tree cp_parser_template_parameter
2321 static tree cp_parser_type_parameter
2323 static tree cp_parser_template_id
2325 static tree cp_parser_template_name
2327 static tree cp_parser_template_argument_list
2329 static tree cp_parser_template_argument
2331 static void cp_parser_explicit_instantiation
2333 static void cp_parser_explicit_specialization
2336 /* Exception handling [gram.exception] */
2338 static tree cp_parser_try_block
2340 static bool cp_parser_function_try_block
2342 static void cp_parser_handler_seq
2344 static void cp_parser_handler
2346 static tree cp_parser_exception_declaration
2348 static tree cp_parser_throw_expression
2350 static tree cp_parser_exception_specification_opt
2352 static tree cp_parser_type_id_list
2355 /* GNU Extensions */
2357 static tree cp_parser_asm_specification_opt
2359 static tree cp_parser_asm_operand_list
2361 static tree cp_parser_asm_clobber_list
2363 static tree cp_parser_asm_label_list
2365 static bool cp_next_tokens_can_be_attribute_p
2367 static bool cp_next_tokens_can_be_gnu_attribute_p
2369 static bool cp_next_tokens_can_be_std_attribute_p
2371 static bool cp_nth_tokens_can_be_std_attribute_p
2373 static bool cp_nth_tokens_can_be_gnu_attribute_p
2375 static bool cp_nth_tokens_can_be_attribute_p
2377 static tree cp_parser_attributes_opt
2379 static tree cp_parser_gnu_attributes_opt
2381 static tree cp_parser_gnu_attribute_list
2383 static tree cp_parser_std_attribute
2385 static tree cp_parser_std_attribute_spec
2387 static tree cp_parser_std_attribute_spec_seq
2389 static bool cp_parser_extension_opt
2391 static void cp_parser_label_declaration
2394 /* Concept Extensions */
2396 static tree cp_parser_requires_clause
2398 static tree cp_parser_requires_clause_opt
2400 static tree cp_parser_requires_expression
2402 static tree cp_parser_requirement_parameter_list
2404 static tree cp_parser_requirement_body
2406 static tree cp_parser_requirement_list
2408 static tree cp_parser_requirement
2410 static tree cp_parser_simple_requirement
2412 static tree cp_parser_compound_requirement
2414 static tree cp_parser_type_requirement
2416 static tree cp_parser_nested_requirement
2419 /* Transactional Memory Extensions */
2421 static tree cp_parser_transaction
2423 static tree cp_parser_transaction_expression
2425 static bool cp_parser_function_transaction
2427 static tree cp_parser_transaction_cancel
2431 pragma_external,
2432 pragma_member,
2433 pragma_objc_icode,
2434 pragma_stmt,
2435 pragma_compound
2436 };
2437 static bool cp_parser_pragma
2440 /* Objective-C++ Productions */
2442 static tree cp_parser_objc_message_receiver
2444 static tree cp_parser_objc_message_args
2446 static tree cp_parser_objc_message_expression
2448 static cp_expr cp_parser_objc_encode_expression
2450 static tree cp_parser_objc_defs_expression
2452 static tree cp_parser_objc_protocol_expression
2454 static tree cp_parser_objc_selector_expression
2456 static cp_expr cp_parser_objc_expression
2458 static bool cp_parser_objc_selector_p
2460 static tree cp_parser_objc_selector
2462 static tree cp_parser_objc_protocol_refs_opt
2464 static void cp_parser_objc_declaration
2466 static tree cp_parser_objc_statement
2468 static bool cp_parser_objc_valid_prefix_attributes
2470 static void cp_parser_objc_at_property_declaration
2472 static void cp_parser_objc_at_synthesize_declaration
2474 static void cp_parser_objc_at_dynamic_declaration
2476 static tree cp_parser_objc_struct_declaration
2479 /* Utility Routines */
2481 static cp_expr cp_parser_lookup_name
2483 static tree cp_parser_lookup_name_simple
2485 static tree cp_parser_maybe_treat_template_as_class
2487 static bool cp_parser_check_declarator_template_parameters
2489 static bool cp_parser_check_template_parameters
2491 static cp_expr cp_parser_simple_cast_expression
2493 static tree cp_parser_global_scope_opt
2495 static bool cp_parser_constructor_declarator_p
2497 static tree cp_parser_function_definition_from_specifiers_and_declarator
2499 static tree cp_parser_function_definition_after_declarator
2501 static bool cp_parser_template_declaration_after_export
2503 static void cp_parser_perform_template_parameter_access_checks
2505 static tree cp_parser_single_declaration
2507 static cp_expr cp_parser_functional_cast
2509 static tree cp_parser_save_member_function_body
2511 static tree cp_parser_save_nsdmi
2513 static tree cp_parser_enclosed_template_argument_list
2515 static void cp_parser_save_default_args
2517 static void cp_parser_late_parsing_for_member
2519 static tree cp_parser_late_parse_one_default_arg
2521 static void cp_parser_late_parsing_nsdmi
2523 static void cp_parser_late_parsing_default_args
2525 static tree cp_parser_sizeof_operand
2527 static tree cp_parser_trait_expr
2529 static bool cp_parser_declares_only_class_p
2531 static void cp_parser_set_storage_class
2533 static void cp_parser_set_decl_spec_type
2535 static void set_and_check_decl_spec_loc
2538 static bool cp_parser_friend_p
2540 static void cp_parser_required_error
2546 static bool cp_parser_token_starts_function_definition_p
2548 static bool cp_parser_next_token_starts_class_definition_p
2550 static bool cp_parser_next_token_ends_template_argument_p
2552 static bool cp_parser_nth_token_starts_template_argument_list_p
2554 static enum tag_types cp_parser_token_is_class_key
2556 static enum tag_types cp_parser_token_is_type_parameter_key
2558 static void cp_parser_check_class_key
2560 static void cp_parser_check_access_in_redeclaration
2562 static bool cp_parser_optional_template_keyword
2564 static void cp_parser_pre_parsed_nested_name_specifier
2566 static bool cp_parser_cache_group
2568 static tree cp_parser_cache_defarg
2570 static void cp_parser_parse_tentatively
2572 static void cp_parser_commit_to_tentative_parse
2574 static void cp_parser_commit_to_topmost_tentative_parse
2576 static void cp_parser_abort_tentative_parse
2578 static bool cp_parser_parse_definitely
2582 static bool cp_parser_uncommitted_to_tentative_parse_p
2584 static void cp_parser_error
2586 static void cp_parser_name_lookup_error
2588 static bool cp_parser_simulate_error
2590 static bool cp_parser_check_type_definition
2592 static void cp_parser_check_for_definition_in_return_type
2594 static void cp_parser_check_for_invalid_template_id
2596 static bool cp_parser_non_integral_constant_expression
2598 static void cp_parser_diagnose_invalid_type_name
2600 static bool cp_parser_parse_and_diagnose_invalid_type_name
2602 static int cp_parser_skip_to_closing_parenthesis
2604 static void cp_parser_skip_to_end_of_statement
2606 static void cp_parser_consume_semicolon_at_end_of_statement
2608 static void cp_parser_skip_to_end_of_block_or_statement
2610 static bool cp_parser_skip_to_closing_brace
2612 static void cp_parser_skip_to_end_of_template_parameter_list
2614 static void cp_parser_skip_to_pragma_eol
2616 static bool cp_parser_error_occurred
2618 static bool cp_parser_allow_gnu_extensions_p
2620 static bool cp_parser_is_pure_string_literal
2622 static bool cp_parser_is_string_literal
2624 static bool cp_parser_is_keyword
2626 static tree cp_parser_make_typename_type
2630 static bool cp_parser_compound_literal_p
2632 static bool cp_parser_array_designator_p
2634 static bool cp_parser_skip_to_closing_square_bracket
2637 /* Concept-related syntactic transformations */
2642 // -------------------------------------------------------------------------- //
2643 // Unevaluated Operand Guard
2644 //
2645 // Implementation of an RAII helper for unevaluated operand parsing.
2647 {
2650 }
2653 {
2656 }
2658 // -------------------------------------------------------------------------- //
2659 // Tentative Parsing
2661 /* Returns nonzero if we are parsing tentatively. */
2665 {
2667 }
2669 /* Returns nonzero if TOKEN is a string literal. */
2671 static bool
2673 {
2679 }
2681 /* Returns nonzero if TOKEN is a string literal
2682 of a user-defined string literal. */
2684 static bool
2686 {
2693 }
2695 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2697 static bool
2699 {
2701 }
2703 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2704 PRAGMA_NONE. */
2706 static enum pragma_kind
2708 {
2711 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2713 }
2715 /* Helper function for cp_parser_error.
2716 Having peeked a token of kind TOK1_KIND that might signify
2717 a conflict marker, peek successor tokens to determine
2718 if we actually do have a conflict marker.
2719 Specifically, we consider a run of 7 '<', '=' or '>' characters
2720 at the start of a line as a conflict marker.
2721 These come through the lexer as three pairs and a single,
2722 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2723 If it returns true, *OUT_LOC is written to with the location/range
2724 of the marker. */
2726 static bool
2729 {
2740 /* It must be at the start of the line. */
2745 /* We have a conflict marker. Construct a location of the form:
2746 <<<<<<<
2747 ^~~~~~~
2748 with start == caret, finishing at the end of the marker. */
2753 }
2755 /* If not parsing tentatively, issue a diagnostic of the form
2756 FILE:LINE: MESSAGE before TOKEN
2757 where TOKEN is the next token in the input stream. MESSAGE
2758 (specified by the caller) is usually of the form "expected
2759 OTHER-TOKEN". */
2761 static void
2763 {
2765 {
2767 /* This diagnostic makes more sense if it is tagged to the line
2768 of the token we just peeked at. */
2772 {
2777 }
2779 /* If this is actually a conflict marker, report it as such. */
2783 {
2784 location_t loc;
2786 {
2789 }
2790 }
2793 /* Because c_parser_error does not understand
2794 CPP_KEYWORD, keywords are treated like
2795 identifiers. */
2798 }
2799 }
2801 /* Issue an error about name-lookup failing. NAME is the
2802 IDENTIFIER_NODE DECL is the result of
2803 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2804 the thing that we hoped to find. */
2806 static void
2808 tree name,
2809 tree decl,
2810 name_lookup_error desired,
2811 location_t location)
2812 {
2813 /* If name lookup completely failed, tell the user that NAME was not
2814 declared. */
2816 {
2829 else
2831 }
2833 {
2835 {
2852 }
2853 }
2855 {
2857 {
2867 name);
2871 }
2872 }
2873 else
2874 {
2876 {
2889 }
2890 }
2891 }
2893 /* If we are parsing tentatively, remember that an error has occurred
2894 during this tentative parse. Returns true if the error was
2895 simulated; false if a message should be issued by the caller. */
2897 static bool
2899 {
2901 {
2904 }
2906 }
2908 /* This function is called when a type is defined. If type
2909 definitions are forbidden at this point, an error message is
2910 issued. */
2912 static bool
2914 {
2915 /* If types are forbidden here, issue a message. */
2917 {
2918 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2919 in the message need to be interpreted. */
2922 }
2924 }
2926 /* This function is called when the DECLARATOR is processed. The TYPE
2927 was a type defined in the decl-specifiers. If it is invalid to
2928 define a type in the decl-specifiers for DECLARATOR, an error is
2929 issued. TYPE_LOCATION is the location of TYPE and is used
2930 for error reporting. */
2932 static void
2935 {
2936 /* [dcl.fct] forbids type definitions in return types.
2937 Unfortunately, it's not easy to know whether or not we are
2938 processing a return type until after the fact. */
2946 {
2951 type);
2952 }
2953 }
2955 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2956 "<" in any valid C++ program. If the next token is indeed "<",
2957 issue a message warning the user about what appears to be an
2958 invalid attempt to form a template-id. LOCATION is the location
2959 of the type-specifier (TYPE) */
2961 static void
2963 tree type,
2965 location_t location)
2966 {
2970 {
2974 {
2977 else
2979 }
2980 else
2982 /* Remember the location of the invalid "<". */
2985 /* Consume the "<". */
2987 /* Parse the template arguments. */
2989 /* Permanently remove the invalid template arguments so that
2990 this error message is not issued again. */
2993 }
2994 }
2996 /* If parsing an integral constant-expression, issue an error message
2997 about the fact that THING appeared and return true. Otherwise,
2998 return false. In either case, set
2999 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3001 static bool
3003 non_integral_constant thing)
3004 {
3007 {
3009 {
3012 {
3019 "enumeration type cannot appear in a "
3110 }
3114 }
3115 }
3117 }
3119 /* Emit a diagnostic for an invalid type name. This function commits
3120 to the current active tentative parse, if any. (Otherwise, the
3121 problematic construct might be encountered again later, resulting
3122 in duplicate error messages.) LOCATION is the location of ID. */
3124 static void
3126 location_t location)
3127 {
3130 /* Try to lookup the identifier. */
3137 /* If the lookup was ambiguous, an error will already have
3138 been issued. */
3140 /* If the lookup found a template-name, it means that the user forgot
3141 to specify an argument list. Emit a useful error message. */
3143 {
3146 decl);
3148 }
3152 /* Something like 'unsigned A a;' */
3155 {
3156 /* Issue an error message. */
3158 /* If we're in a template class, it's possible that the user was
3159 referring to a type from a base class. For example:
3161 template <typename T> struct A { typedef T X; };
3162 template <typename T> struct B : public A<T> { X x; };
3164 The user should have said "typename A<T>::X". */
3180 {
3181 tree b;
3184 b;
3186 {
3190 {
3191 tree field;
3192 /* Go from a particular instantiation of the
3193 template (which will have an empty TYPE_FIELDs),
3194 to the main version. */
3197 field;
3201 {
3206 }
3209 }
3210 }
3211 }
3212 }
3213 /* Here we diagnose qualified-ids where the scope is actually correct,
3214 but the identifier does not resolve to a valid type name. */
3216 {
3218 {
3223 else
3229 }
3232 {
3233 /* A<T>::A<T>() */
3239 }
3246 {
3251 else
3257 }
3258 else
3260 }
3261 }
3263 /* Check for a common situation where a type-name should be present,
3264 but is not, and issue a sensible error message. Returns true if an
3265 invalid type-name was detected.
3267 The situation handled by this function are variable declarations of the
3268 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3269 Usually, `ID' should name a type, but if we got here it means that it
3270 does not. We try to emit the best possible error message depending on
3271 how exactly the id-expression looks like. */
3273 static bool
3275 {
3276 tree id;
3279 /* Avoid duplicate error about ambiguous lookup. */
3281 {
3285 }
3294 /* If the next token is a (, this is a function with no explicit return
3295 type, i.e. constructor, destructor or conversion op. */
3298 {
3301 }
3305 /* Emit a diagnostic for the invalid type. */
3307 out:
3308 /* If we aren't in the middle of a declarator (i.e. in a
3309 parameter-declaration-clause), skip to the end of the declaration;
3310 there's no point in trying to process it. */
3314 }
3316 /* Consume tokens up to, and including, the next non-nested closing `)'.
3317 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3318 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3319 found an unnested token of that type. */
3321 static int
3324 cpp_ttype or_ttype,
3326 {
3336 {
3339 /* Have we found what we're looking for before the closing paren? */
3345 {
3348 /* If we've run out of tokens, then there is no closing `)'. */
3351 /* This is good for lambda expression capture-lists. */
3361 /* This matches the processing in skip_to_end_of_statement. */
3381 {
3385 }
3390 }
3392 /* Consume the token. */
3394 }
3395 }
3397 /* Consume tokens up to, and including, the next non-nested closing `)'.
3398 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3399 are doing error recovery. Returns -1 if OR_COMMA is true and we
3400 found an unnested token of that type. */
3402 static int
3407 {
3411 }
3413 /* Consume tokens until we reach the end of the current statement.
3414 Normally, that will be just before consuming a `;'. However, if a
3415 non-nested `}' comes first, then we stop before consuming that. */
3417 static void
3419 {
3422 /* Unwind generic function template scope if necessary. */
3427 {
3431 {
3434 /* If we've run out of tokens, stop. */
3438 /* If the next token is a `;', we have reached the end of the
3439 statement. */
3445 /* If this is a non-nested '}', stop before consuming it.
3446 That way, when confronted with something like:
3448 { 3 + }
3450 we stop before consuming the closing '}', even though we
3451 have not yet reached a `;'. */
3455 /* If it is the closing '}' for a block that we have
3456 scanned, stop -- but only after consuming the token.
3457 That way given:
3459 void f g () { ... }
3460 typedef int I;
3462 we will stop after the body of the erroneously declared
3463 function, but before consuming the following `typedef'
3464 declaration. */
3466 {
3469 }
3477 }
3479 /* Consume the token. */
3481 }
3482 }
3484 /* This function is called at the end of a statement or declaration.
3485 If the next token is a semicolon, it is consumed; otherwise, error
3486 recovery is attempted. */
3488 static void
3490 {
3491 /* Look for the trailing `;'. */
3493 {
3494 /* If there is additional (erroneous) input, skip to the end of
3495 the statement. */
3497 /* If the next token is now a `;', consume it. */
3500 }
3501 }
3503 /* Skip tokens until we have consumed an entire block, or until we
3504 have consumed a non-nested `;'. */
3506 static void
3508 {
3511 /* Unwind generic function template scope if necessary. */
3516 {
3520 {
3523 /* If we've run out of tokens, stop. */
3527 /* Stop if this is an unnested ';'. */
3533 /* Stop if this is an unnested '}', or closes the outermost
3534 nesting level. */
3535 nesting_depth--;
3543 /* Nest. */
3544 nesting_depth++;
3549 }
3551 /* Consume the token. */
3553 }
3554 }
3556 /* Skip tokens until a non-nested closing curly brace is the next
3557 token, or there are no more tokens. Return true in the first case,
3558 false otherwise. */
3560 static bool
3562 {
3566 {
3570 {
3573 /* If we've run out of tokens, stop. */
3577 /* If the next token is a non-nested `}', then we have reached
3578 the end of the current block. */
3584 /* If it the next token is a `{', then we are entering a new
3585 block. Consume the entire block. */
3591 }
3593 /* Consume the token. */
3595 }
3596 }
3598 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3599 parameter is the PRAGMA token, allowing us to purge the entire pragma
3600 sequence. */
3602 static void
3604 {
3609 do
3613 /* Ensure that the pragma is not parsed again. */
3615 }
3617 /* Require pragma end of line, resyncing with it as necessary. The
3618 arguments are as for cp_parser_skip_to_pragma_eol. */
3620 static void
3622 {
3626 }
3628 /* This is a simple wrapper around make_typename_type. When the id is
3629 an unresolved identifier node, we can provide a superior diagnostic
3630 using cp_parser_diagnose_invalid_type_name. */
3632 static tree
3634 location_t id_location)
3635 {
3636 tree result;
3638 {
3644 }
3646 }
3648 /* This is a wrapper around the
3649 make_{pointer,ptrmem,reference}_declarator functions that decides
3650 which one to call based on the CODE and CLASS_TYPE arguments. The
3651 CODE argument should be one of the values returned by
3652 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3653 appertain to the pointer or reference. */
3657 cp_cv_quals cv_qualifiers,
3659 tree attributes)
3660 {
3667 else
3677 }
3679 /* Create a new C++ parser. */
3683 {
3688 /* cp_lexer_new_main is called before doing GC allocation because
3689 cp_lexer_new_main might load a PCH file. */
3692 /* Initialize the binops_by_token so that we can get the tree
3693 directly from the token. */
3701 /* For now, we always accept GNU extensions. */
3704 /* The `>' token is a greater-than operator, not the end of a
3705 template-id. */
3710 /* We are not parsing a constant-expression. */
3715 /* Local variable names are not forbidden. */
3718 /* We are not processing an `extern "C"' declaration. */
3721 /* We are not processing a declarator. */
3724 /* We are not processing a template-argument-list. */
3727 /* We are not in an iteration statement. */
3730 /* We are not in a switch statement. */
3733 /* We are not parsing a type-id inside an expression. */
3736 /* Declarations aren't implicitly extern "C". */
3739 /* String literals should be translated to the execution character set. */
3742 /* We are not parsing a function body. */
3745 /* We can correct until told otherwise. */
3748 /* The unparsed function queue is empty. */
3751 /* There are no classes being defined. */
3754 /* No template parameters apply. */
3757 /* Not declaring an implicit function template. */
3763 /* Active OpenACC routine clauses. */
3766 /* Allow constrained-type-specifiers. */
3770 }
3772 /* Create a cp_lexer structure which will emit the tokens in CACHE
3773 and push it onto the parser's lexer stack. This is used for delayed
3774 parsing of in-class method bodies and default arguments, and should
3775 not be confused with tentative parsing. */
3776 static void
3778 {
3783 /* Move the current source position to that of the first token in the
3784 new lexer. */
3786 }
3788 /* Pop the top lexer off the parser stack. This is never used for the
3789 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3790 static void
3792 {
3797 /* Put the current source position back where it was before this
3798 lexer was pushed. */
3800 }
3802 /* Lexical conventions [gram.lex] */
3804 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3805 identifier. */
3807 static cp_expr
3809 {
3812 /* Look for the identifier. */
3814 /* Return the value. */
3817 else
3819 }
3821 /* Parse a sequence of adjacent string constants. Returns a
3822 TREE_STRING representing the combined, nul-terminated string
3823 constant. If TRANSLATE is true, translate the string to the
3824 execution character set. If WIDE_OK is true, a wide string is
3825 invalid here.
3827 C++98 [lex.string] says that if a narrow string literal token is
3828 adjacent to a wide string literal token, the behavior is undefined.
3829 However, C99 6.4.5p4 says that this results in a wide string literal.
3830 We follow C99 here, for consistency with the C front end.
3832 This code is largely lifted from lex_string() in c-lex.c.
3834 FUTURE: ObjC++ will need to handle @-strings here. */
3835 static cp_expr
3838 {
3839 tree value;
3846 tree string_tree;
3852 {
3855 }
3860 {
3864 }
3865 else
3866 {
3869 }
3872 /* Try to avoid the overhead of creating and destroying an obstack
3873 for the common case of just one string. */
3876 {
3884 {
3888 }
3889 else
3893 }
3894 else
3895 {
3900 do
3901 {
3903 count++;
3908 {
3911 {
3914 }
3917 {
3922 }
3924 }
3925 else
3929 {
3933 {
3937 "unsupported non-standard concatenation "
3939 }
3940 }
3948 {
3952 }
3953 else
3954 {
3958 }
3959 }
3962 /* A string literal built by concatenation has its caret=start at
3963 the start of the initial string, and its finish at the finish of
3964 the final string literal. */
3968 }
3971 {
3974 }
3978 {
3983 {
3998 }
4003 {
4008 else
4010 }
4011 }
4012 else
4013 /* cpp_interpret_string has issued an error. */
4020 }
4022 /* Look up a literal operator with the name and the exact arguments. */
4024 static tree
4026 {
4033 {
4039 {
4042 {
4052 }
4055 /* May be this should be sufficient_parms_p instead,
4056 depending on how exactly should user-defined literals
4057 work in presence of default arguments on the literal
4058 operator parameters. */
4061 }
4062 }
4065 }
4067 /* Parse a user-defined char constant. Returns a call to a user-defined
4068 literal operator taking the character as an argument. */
4070 static cp_expr
4072 {
4080 /* Build up a call to the user-defined operator */
4081 /* Lookup the name we got back from the id-expression. */
4086 {
4091 }
4095 }
4097 /* A subroutine of cp_parser_userdef_numeric_literal to
4098 create a char... template parameter pack from a string node. */
4100 static tree
4102 {
4103 tree charvec;
4109 /* Fill in CHARVEC with all of the parameters. */
4114 /* Build the argument packs. */
4121 }
4123 /* A subroutine of cp_parser_userdef_numeric_literal to
4124 create a char... template parameter pack from a string node. */
4126 static tree
4128 {
4129 tree charvec;
4140 /* First template parm is character type. */
4143 /* Fill in CHARVEC with all of the parameters. */
4150 /* Build the argument packs. */
4157 }
4159 /* Parse a user-defined numeric constant. returns a call to a user-defined
4160 literal operator. */
4162 static cp_expr
4164 {
4175 /* Look for a literal operator taking the exact type of numeric argument
4176 as the literal value. */
4181 {
4183 tf_warning_or_error);
4186 {
4189 long_long_unsigned_type_node);
4190 }
4191 else
4192 {
4196 long_double_type_node);
4200 }
4204 }
4207 /* If the numeric argument didn't work, look for a raw literal
4208 operator taking a const char* argument consisting of the number
4209 in string format. */
4214 {
4216 tf_warning_or_error);
4219 }
4222 /* If the raw literal didn't work, look for a non-type template
4223 function with parameter pack char.... Call the function with
4224 template parameter characters representing the number. */
4228 {
4232 tf_warning_or_error);
4235 }
4244 }
4246 /* Parse a user-defined string constant. Returns a call to a user-defined
4247 literal operator taking a character pointer and the length of the string
4248 as arguments. */
4250 static tree
4252 {
4261 /* Build up a call to the user-defined operator. */
4262 /* Lookup the name we got back from the id-expression. */
4269 {
4271 tf_warning_or_error);
4274 }
4277 /* Look for a template function with typename parameter CharT
4278 and parameter pack CharT... Call the function with
4279 template parameter characters representing the string. */
4283 {
4287 tf_warning_or_error);
4290 }
4296 }
4299 /* Basic concepts [gram.basic] */
4301 /* Parse a translation-unit.
4303 translation-unit:
4304 declaration-seq [opt]
4306 Returns TRUE if all went well. */
4308 static bool
4310 {
4311 /* The address of the first non-permanent object on the declarator
4312 obstack. */
4317 /* Create the declarator obstack, if necessary. */
4319 {
4321 /* Create the error declarator. */
4323 /* Create the empty parameter list. */
4325 /* Remember where the base of the declarator obstack lies. */
4327 }
4331 /* If there are no tokens left then all went well. */
4333 {
4334 /* Get rid of the token array; we don't need it any more. */
4338 /* This file might have been a context that's implicitly extern
4339 "C". If so, pop the lang context. (Only relevant for PCH.) */
4341 {
4344 }
4346 /* Finish up. */
4350 }
4351 else
4352 {
4355 }
4357 /* Make sure the declarator obstack was fully cleaned up. */
4361 /* All went well. */
4363 }
4365 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4366 decltype context. */
4370 {
4375 }
4377 /* We're about to parse a collection of statements. If we're currently
4378 parsing tentatively, set up a firewall so that any nested
4379 cp_parser_commit_to_tentative_parse won't affect the current context. */
4381 static cp_token_position
4383 {
4390 }
4392 /* We've finished parsing the collection of statements. Wrap up the
4393 firewall and replace the relevant tokens with the parsed form. */
4395 static void
4397 tree expr)
4398 {
4402 /* Finish the firewall level. */
4404 /* And remember the result of the parse for when we try again. */
4410 }
4412 /* Like the above functions, but let the user modify the tokens. Used by
4413 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4414 later parses, so it makes sense to localize the effects of
4415 cp_parser_commit_to_tentative_parse. */
4417 struct tentative_firewall
4418 {
4423 {
4424 /* If we're currently parsing tentatively, start a committed level as a
4425 firewall and then an inner tentative parse. */
4427 {
4431 }
4432 }
4435 {
4437 {
4438 /* Finish the inner tentative parse and the firewall, propagating any
4439 uncommitted error state to the outer tentative parse. */
4445 }
4446 }
4447 };
4449 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4450 enclosing parentheses. */
4452 static cp_expr
4454 {
4457 /* Consume the '('. */
4460 /* Start the statement-expression. */
4462 /* Parse the compound-statement. */
4464 /* Finish up. */
4466 /* Consume the ')'. */
4474 }
4476 /* Expressions [gram.expr] */
4478 /* Parse a fold-operator.
4480 fold-operator:
4481 - * / % ^ & | = < > << >>
4482 = -= *= /= %= ^= &= |= <<= >>=
4483 == != <= >= && || , .* ->*
4485 This returns the tree code corresponding to the matched operator
4486 as an int. When the current token matches a compound assignment
4487 opertor, the resulting tree code is the negative value of the
4488 non-assignment operator. */
4490 static int
4492 {
4494 {
4534 }
4535 }
4537 /* Returns true if CODE indicates a binary expression, which is not allowed in
4538 the LHS of a fold-expression. More codes will need to be added to use this
4539 function in other contexts. */
4541 static bool
4543 {
4545 {
4578 }
4579 }
4581 /* If the next token is a suitable fold operator, consume it and return as
4582 the function above. */
4584 static int
4586 {
4592 }
4594 /* Parse a fold-expression.
4596 fold-expression:
4597 ( ... folding-operator cast-expression)
4598 ( cast-expression folding-operator ... )
4599 ( cast-expression folding operator ... folding-operator cast-expression)
4601 Note that the '(' and ')' are matched in primary expression. */
4603 static cp_expr
4605 {
4606 cp_id_kind pidk;
4608 // Left fold.
4610 {
4614 {
4617 }
4624 }
4629 {
4632 }
4635 {
4638 }
4641 /* The operands of a fold-expression are cast-expressions, so binary or
4642 conditional expressions are not allowed. We check this here to avoid
4643 tentative parsing. */
4651 // Right fold.
4656 {
4659 }
4662 // Binary left or right fold.
4667 }
4669 /* Parse a primary-expression.
4671 primary-expression:
4672 literal
4673 this
4674 ( expression )
4675 id-expression
4676 lambda-expression (C++11)
4678 GNU Extensions:
4680 primary-expression:
4681 ( compound-statement )
4682 __builtin_va_arg ( assignment-expression , type-id )
4683 __builtin_offsetof ( type-id , offsetof-expression )
4685 C++ Extensions:
4686 __has_nothrow_assign ( type-id )
4687 __has_nothrow_constructor ( type-id )
4688 __has_nothrow_copy ( type-id )
4689 __has_trivial_assign ( type-id )
4690 __has_trivial_constructor ( type-id )
4691 __has_trivial_copy ( type-id )
4692 __has_trivial_destructor ( type-id )
4693 __has_virtual_destructor ( type-id )
4694 __is_abstract ( type-id )
4695 __is_base_of ( type-id , type-id )
4696 __is_class ( type-id )
4697 __is_empty ( type-id )
4698 __is_enum ( type-id )
4699 __is_final ( type-id )
4700 __is_literal_type ( type-id )
4701 __is_pod ( type-id )
4702 __is_polymorphic ( type-id )
4703 __is_std_layout ( type-id )
4704 __is_trivial ( type-id )
4705 __is_union ( type-id )
4707 Objective-C++ Extension:
4709 primary-expression:
4710 objc-expression
4712 literal:
4713 __null
4715 ADDRESS_P is true iff this expression was immediately preceded by
4716 "&" and therefore might denote a pointer-to-member. CAST_P is true
4717 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4718 true iff this expression is a template argument.
4720 Returns a representation of the expression. Upon return, *IDK
4721 indicates what kind of id-expression (if any) was present. */
4723 static cp_expr
4730 {
4733 /* Assume the primary expression is not an id-expression. */
4736 /* Peek at the next token. */
4739 {
4740 /* literal:
4741 integer-literal
4742 character-literal
4743 floating-literal
4744 string-literal
4745 boolean-literal
4746 pointer-literal
4747 user-defined-literal */
4759 {
4763 }
4764 /* Floating-point literals are only allowed in an integral
4765 constant expression if they are cast to an integral or
4766 enumeration type. */
4770 {
4771 /* CAST_P will be set even in invalid code like "int(2.7 +
4772 ...)". Therefore, we have to check that the next token
4773 is sure to end the cast. */
4775 {
4780 enumerator-definition. */
4782 /* The curly brace at the end of an enum-specifier. */
4784 /* The end of a statement. */
4786 /* The end of the cast-expression. */
4788 /* The end of an array bound. */
4790 /* The closing ">" in a template-argument-list. */
4793 /* C++0x only: A ">>" treated like two ">" tokens,
4794 in a template-argument-list. */
4799 }
4801 /* If we are within a cast, then the constraint that the
4802 cast is to an integral or enumeration type will be
4803 checked at that point. If we are not within a cast, then
4804 this code is invalid. */
4807 }
4827 /* ??? Should wide strings be allowed when parser->translate_strings_p
4828 is false (i.e. in attributes)? If not, we can kill the third
4829 argument to cp_parser_string_literal. */
4835 /* If we see `( { ' then we are looking at the beginning of
4836 a GNU statement-expression. */
4839 {
4840 /* Statement-expressions are not allowed by the standard. */
4844 /* And they're not allowed outside of a function-body; you
4845 cannot, for example, write:
4847 int i = ({ int j = 3; j + 1; });
4849 at class or namespace scope. */
4852 {
4854 "statement-expressions are not allowed outside "
4860 }
4861 else
4863 }
4864 /* Otherwise it's a normal parenthesized expression. */
4865 {
4866 cp_expr expr;
4871 /* Consume the `('. */
4873 /* Within a parenthesized expression, a `>' token is always
4874 the greater-than operator. */
4875 saved_greater_than_is_operator_p
4880 /* Left fold expression. */
4882 else
4883 /* Parse the parenthesized expression. */
4888 {
4895 }
4896 else
4897 /* Let the front end know that this expression was
4898 enclosed in parentheses. This matters in case, for
4899 example, the expression is of the form `A::B', since
4900 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4901 not. */
4904 /* DR 705: Wrapping an unqualified name in parentheses
4905 suppresses arg-dependent lookup. We want to pass back
4906 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4907 (c++/37862), but none of the others. */
4911 /* The `>' token might be the end of a template-id or
4912 template-parameter-list now. */
4913 parser->greater_than_is_operator_p
4916 /* Consume the `)'. */
4925 }
4928 {
4930 {
4931 /* We might have an Objective-C++ message. */
4934 /* If that works out, we're done ... */
4937 /* ... else, fall though to see if it's a lambda. */
4938 }
4940 /* Don't warn about a failed tentative parse. */
4945 }
4949 /* We have an Objective-C++ string literal. */
4956 {
4957 /* These two are the boolean literals. */
4965 /* The `__null' literal. */
4970 /* The `nullptr' literal. */
4975 /* Recognize the `this' keyword. */
4979 {
4983 }
4984 /* Pointers cannot appear in constant-expressions. */
4989 /* The `operator' keyword can be the beginning of an
4990 id-expression. */
4997 {
4998 non_integral_constant name;
5000 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5001 __func__ are the names of variables -- but they are
5002 treated specially. Therefore, they are handled here,
5003 rather than relying on the generic id-expression logic
5004 below. Grammatically, these names are id-expressions.
5006 Consume the token. */
5010 {
5022 }
5027 /* Look up the name. */
5029 }
5032 {
5033 tree expression;
5034 tree type;
5035 source_location type_location;
5036 location_t start_loc
5038 /* The `__builtin_va_arg' construct is used to handle
5039 `va_arg'. Consume the `__builtin_va_arg' token. */
5041 /* Look for the opening `('. */
5043 /* Now, parse the assignment-expression. */
5045 /* Look for the `,'. */
5048 /* Parse the type-id. */
5049 {
5052 }
5053 /* Look for the closing `)'. */
5054 location_t finish_loc
5057 /* Using `va_arg' in a constant-expression is not
5058 allowed. */
5060 NIC_VA_ARG))
5062 /* Construct a location of the form:
5063 __builtin_va_arg (v, int)
5064 ~~~~~~~~~~~~~~~~~~~~~^~~~
5065 with the caret at the type, ranging from the start of the
5066 "__builtin_va_arg" token to the close paren. */
5067 location_t combined_loc
5070 }
5101 // C++ concepts
5105 /* Objective-C++ expressions. */
5115 {
5120 }
5124 }
5126 /* An id-expression can start with either an identifier, a
5127 `::' as the beginning of a qualified-id, or the "operator"
5128 keyword. */
5133 {
5134 id_expression:
5135 cp_expr id_expression;
5136 cp_expr decl;
5142 /* Parse the id-expression. */
5143 id_expression
5160 /* If we have a template-id, then no further lookup is
5161 required. If the template-id was for a template-class, we
5162 will sometimes have a TYPE_DECL at this point. */
5166 /* Look up the name. */
5167 else
5168 {
5169 tree ambiguous_decls;
5171 /* If we already know that this lookup is ambiguous, then
5172 we've already issued an error message; there's no reason
5173 to check again. */
5176 {
5179 }
5182 none_type,
5183 template_p,
5188 /* If the lookup was ambiguous, an error will already have
5189 been issued. */
5193 /* In Objective-C++, we may have an Objective-C 2.0
5194 dot-syntax for classes here. */
5199 {
5200 tree component;
5207 component);
5208 /* Build a location of the form:
5209 expr.component
5210 ~~~~~^~~~~~~~~
5211 with caret at the start of the component name (at
5212 input_location), ranging from the start of the id_expression
5213 to the end of the component name. */
5214 location_t combined_loc
5219 }
5221 /* In Objective-C++, an instance variable (ivar) may be preferred
5222 to whatever cp_parser_lookup_name() found.
5223 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5224 rest of c-family, we have to do a little extra work to preserve
5225 any location information in cp_expr "decl". Given that
5226 objc_lookup_ivar is implemented in "c-family" and "objc", we
5227 have a trip through the pure "tree" type, rather than cp_expr.
5228 Naively copying it back to "decl" would implicitly give the
5229 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5230 store an EXPR_LOCATION. Hence we only update "decl" (and
5231 hence its location_t) if we get back a different tree node. */
5233 id_expression);
5237 /* If name lookup gives us a SCOPE_REF, then the
5238 qualifying scope was dependent. */
5240 {
5241 /* At this point, we do not know if DECL is a valid
5242 integral constant expression. We assume that it is
5243 in fact such an expression, so that code like:
5245 template <int N> struct A {
5246 int a[B<N>::i];
5247 };
5249 is accepted. At template-instantiation time, we
5250 will check that B<N>::i is actually a constant. */
5252 }
5253 /* Check to see if DECL is a local variable in a context
5254 where that is forbidden. */
5257 {
5258 /* It might be that we only found DECL because we are
5259 trying to be generous with pre-ISO scoping rules.
5260 For example, consider:
5262 int i;
5263 void g() {
5264 for (int i = 0; i < 10; ++i) {}
5265 extern void f(int j = i);
5266 }
5268 Here, name look up will originally find the out
5269 of scope `i'. We need to issue a warning message,
5270 but then use the global `i'. */
5273 {
5278 }
5279 }
5280 }
5282 decl = (finish_id_expression
5284 idk,
5289 template_arg_p,
5296 }
5298 /* Anything else is an error. */
5302 }
5303 }
5311 {
5314 }
5316 /* Parse an id-expression.
5318 id-expression:
5319 unqualified-id
5320 qualified-id
5322 qualified-id:
5323 :: [opt] nested-name-specifier template [opt] unqualified-id
5324 :: identifier
5325 :: operator-function-id
5326 :: template-id
5328 Return a representation of the unqualified portion of the
5329 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5330 a `::' or nested-name-specifier.
5332 Often, if the id-expression was a qualified-id, the caller will
5333 want to make a SCOPE_REF to represent the qualified-id. This
5334 function does not do this in order to avoid wastefully creating
5335 SCOPE_REFs when they are not required.
5337 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5338 `template' keyword.
5340 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5341 uninstantiated templates.
5343 If *TEMPLATE_P is non-NULL, it is set to true iff the
5344 `template' keyword is used to explicitly indicate that the entity
5345 named is a template.
5347 If DECLARATOR_P is true, the id-expression is appearing as part of
5348 a declarator, rather than as part of an expression. */
5350 static cp_expr
5357 {
5361 /* Assume the `template' keyword was not used. */
5365 /* Look for the optional `::' operator. */
5366 global_scope_p
5369 /* Look for the optional nested-name-specifier. */
5370 nested_name_specifier_p
5373 check_dependency_p,
5375 declarator_p)
5377 /* If there is a nested-name-specifier, then we are looking at
5378 the first qualified-id production. */
5380 {
5381 tree saved_scope;
5382 tree saved_object_scope;
5383 tree saved_qualifying_scope;
5384 tree unqualified_id;
5387 /* See if the next token is the `template' keyword. */
5391 /* Name lookup we do during the processing of the
5392 unqualified-id might obliterate SCOPE. */
5396 /* Process the final unqualified-id. */
5398 check_dependency_p,
5399 declarator_p,
5401 /* Restore the SAVED_SCOPE for our caller. */
5407 }
5408 /* Otherwise, if we are in global scope, then we are looking at one
5409 of the other qualified-id productions. */
5411 {
5413 tree id;
5415 /* Peek at the next token. */
5418 /* If it's an identifier, and the next token is not a "<", then
5419 we can avoid the template-id case. This is an optimization
5420 for this common case. */
5422 && !cp_parser_nth_token_starts_template_argument_list_p
5427 /* Try a template-id. */
5431 none_type,
5432 declarator_p);
5433 /* If that worked, we're done. */
5437 /* Peek at the next token. (Changes in the token buffer may
5438 have invalidated the pointer obtained above.) */
5442 {
5449 /* Fall through. */
5454 }
5455 }
5456 else
5459 declarator_p,
5460 optional_p);
5461 }
5463 /* Parse an unqualified-id.
5465 unqualified-id:
5466 identifier
5467 operator-function-id
5468 conversion-function-id
5469 ~ class-name
5470 template-id
5472 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5473 keyword, in a construct like `A::template ...'.
5475 Returns a representation of unqualified-id. For the `identifier'
5476 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5477 production a BIT_NOT_EXPR is returned; the operand of the
5478 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5479 other productions, see the documentation accompanying the
5480 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5481 names are looked up in uninstantiated templates. If DECLARATOR_P
5482 is true, the unqualified-id is appearing as part of a declarator,
5483 rather than as part of an expression. */
5485 static cp_expr
5491 {
5494 /* Peek at the next token. */
5498 {
5500 {
5501 tree id;
5503 /* We don't know yet whether or not this will be a
5504 template-id. */
5506 /* Try a template-id. */
5508 check_dependency_p,
5509 none_type,
5510 declarator_p);
5511 /* If it worked, we're done. */
5514 /* Otherwise, it's an ordinary identifier. */
5516 }
5520 check_dependency_p,
5521 none_type,
5522 declarator_p);
5525 {
5526 tree type_decl;
5527 tree qualifying_scope;
5528 tree object_scope;
5529 tree scope;
5532 /* Consume the `~' token. */
5534 /* Parse the class-name. The standard, as written, seems to
5535 say that:
5537 template <typename T> struct S { ~S (); };
5538 template <typename T> S<T>::~S() {}
5540 is invalid, since `~' must be followed by a class-name, but
5541 `S<T>' is dependent, and so not known to be a class.
5542 That's not right; we need to look in uninstantiated
5543 templates. A further complication arises from:
5545 template <typename T> void f(T t) {
5546 t.T::~T();
5547 }
5549 Here, it is not possible to look up `T' in the scope of `T'
5550 itself. We must look in both the current scope, and the
5551 scope of the containing complete expression.
5553 Yet another issue is:
5555 struct S {
5556 int S;
5557 ~S();
5558 };
5560 S::~S() {}
5562 The standard does not seem to say that the `S' in `~S'
5563 should refer to the type `S' and not the data member
5564 `S::S'. */
5566 /* DR 244 says that we look up the name after the "~" in the
5567 same scope as we looked up the qualifying name. That idea
5568 isn't fully worked out; it's more complicated than that. */
5573 /* Check for invalid scopes. */
5575 {
5579 }
5581 {
5585 scope);
5590 }
5593 /* If the name is of the form "X::~X" it's OK even if X is a
5594 typedef. */
5603 {
5606 }
5608 /* ~auto means the destructor of whatever the object is. */
5610 {
5613 "%<~auto%> only available with "
5617 }
5619 /* If there was an explicit qualification (S::~T), first look
5620 in the scope given by the qualification (i.e., S).
5622 Note: in the calls to cp_parser_class_name below we pass
5623 typename_type so that lookup finds the injected-class-name
5624 rather than the constructor. */
5628 {
5633 typename_type,
5636 declarator_p);
5639 }
5640 /* In "N::S::~S", look in "N" as well. */
5642 {
5647 type_decl
5651 typename_type,
5654 declarator_p);
5657 }
5658 /* In "p->S::~T", look in the scope given by "*p" as well. */
5660 {
5665 type_decl
5669 typename_type,
5672 declarator_p);
5675 }
5676 /* Look in the surrounding context. */
5678 {
5684 type_decl
5688 typename_type,
5691 declarator_p);
5694 {
5695 /* We couldn't find a type with this name. If we're parsing
5696 tentatively, fail and try something else. */
5698 {
5701 }
5702 /* Otherwise, accept it and check for a match at instantiation
5703 time. */
5708 }
5709 }
5710 /* If an error occurred, assume that the name of the
5711 destructor is the same as the name of the qualifying
5712 class. That allows us to keep parsing after running
5713 into ill-formed destructor names. */
5719 /* Check that destructor name and scope match. */
5721 {
5728 }
5730 /* [class.dtor]
5732 A typedef-name that names a class shall not be used as the
5733 identifier in the declarator for a destructor declaration. */
5740 type_decl);
5743 }
5747 {
5748 cp_expr id;
5750 /* This could be a template-id, so we try that first. */
5752 /* Try a template-id. */
5755 none_type,
5756 declarator_p);
5757 /* If that worked, we're done. */
5760 /* We still don't know whether we're looking at an
5761 operator-function-id or a conversion-function-id. */
5763 /* Try an operator-function-id. */
5765 /* If that didn't work, try a conversion-function-id. */
5769 {
5770 /* 17.6.3.3.5 */
5776 }
5779 }
5780 /* Fall through. */
5787 }
5788 }
5790 /* Parse an (optional) nested-name-specifier.
5792 nested-name-specifier: [C++98]
5793 class-or-namespace-name :: nested-name-specifier [opt]
5794 class-or-namespace-name :: template nested-name-specifier [opt]
5796 nested-name-specifier: [C++0x]
5797 type-name ::
5798 namespace-name ::
5799 nested-name-specifier identifier ::
5800 nested-name-specifier template [opt] simple-template-id ::
5802 PARSER->SCOPE should be set appropriately before this function is
5803 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5804 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5805 in name lookups.
5807 Sets PARSER->SCOPE to the class (TYPE) or namespace
5808 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5809 it unchanged if there is no nested-name-specifier. Returns the new
5810 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5812 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5813 part of a declaration and/or decl-specifier. */
5815 static tree
5821 {
5826 /* Remember where the nested-name-specifier starts. */
5828 {
5831 }
5834 {
5835 tree new_scope;
5836 tree old_scope;
5837 tree saved_qualifying_scope;
5840 /* Spot cases that cannot be the beginning of a
5841 nested-name-specifier. */
5844 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5845 the already parsed nested-name-specifier. */
5847 {
5848 /* Grab the nested-name-specifier and continue the loop. */
5850 /* If we originally encountered this nested-name-specifier
5851 with IS_DECLARATION set to false, we will not have
5852 resolved TYPENAME_TYPEs, so we must do so here. */
5855 {
5860 }
5863 }
5865 /* Spot cases that cannot be the beginning of a
5866 nested-name-specifier. On the second and subsequent times
5867 through the loop, we look for the `template' keyword. */
5869 ;
5870 /* A template-id can start a nested-name-specifier. */
5872 ;
5873 /* DR 743: decltype can be used in a nested-name-specifier. */
5875 ;
5876 else
5877 {
5878 /* If the next token is not an identifier, then it is
5879 definitely not a type-name or namespace-name. */
5882 /* If the following token is neither a `<' (to begin a
5883 template-id), nor a `::', then we are not looking at a
5884 nested-name-specifier. */
5890 {
5894 }
5897 && !cp_parser_nth_token_starts_template_argument_list_p
5900 }
5902 /* The nested-name-specifier is optional, so we parse
5903 tentatively. */
5906 /* Look for the optional `template' keyword, if this isn't the
5907 first time through the loop. */
5910 else
5913 /* Save the old scope since the name lookup we are about to do
5914 might destroy it. */
5917 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5918 look up names in "X<T>::I" in order to determine that "Y" is
5919 a template. So, if we have a typename at this point, we make
5920 an effort to look through it. */
5922 && !typename_keyword_p
5927 /* Parse the qualifying entity. */
5928 new_scope
5930 typename_keyword_p,
5931 template_keyword_p,
5932 check_dependency_p,
5933 type_p,
5934 is_declaration);
5935 /* Look for the `::' token. */
5938 /* If we found what we wanted, we keep going; otherwise, we're
5939 done. */
5941 {
5944 /* Restore the OLD_SCOPE since it was valid before the
5945 failed attempt at finding the last
5946 class-or-namespace-name. */
5950 /* If the next token is a decltype, and the one after that is a
5951 `::', then the decltype has failed to resolve to a class or
5952 enumeration type. Give this error even when parsing
5953 tentatively since it can't possibly be valid--and we're going
5954 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5955 won't get another chance.*/
5959 {
5966 /* As below. */
5969 }
5973 {
5974 /* If we have a non-type template-id followed by ::, it can't
5975 possibly be valid. */
5980 {
5983 {
5989 }
5990 else
5991 {
5992 /* Variable template. */
5997 }
6004 /* As below. */
6008 }
6009 }
6013 /* If the next token is an identifier, and the one after
6014 that is a `::', then any valid interpretation would have
6015 found a class-or-namespace-name. */
6021 {
6024 {
6026 {
6027 tree decl;
6028 tree ambiguous_decls;
6031 none_type,
6040 decl);
6042 {
6043 // cp_parser_lookup_name has the same diagnostic,
6044 // thus make sure to emit it at most once.
6047 {
6052 }
6054 }
6055 else
6056 {
6058 cp_parser_name_lookup_error
6061 else
6062 cp_parser_name_lookup_error
6065 }
6066 }
6069 /* Treat this as a successful nested-name-specifier
6070 due to:
6072 [basic.lookup.qual]
6074 If the name found is not a class-name (clause
6075 _class_) or namespace-name (_namespace.def_), the
6076 program is ill-formed. */
6078 }
6080 }
6082 }
6083 /* We've found one valid nested-name-specifier. */
6085 /* Name lookup always gives us a DECL. */
6088 /* Uses of "template" must be followed by actual templates. */
6100 new_scope);
6101 /* If it is a class scope, try to complete it; we are about to
6102 be looking up names inside the class. */
6104 /* Since checking types for dependency can be expensive,
6105 avoid doing it if the type is already complete. */
6107 /* Do not try to complete dependent types. */
6109 {
6111 /* If it is a typedef to current class, use the current
6112 class instead, as the typedef won't have any names inside
6113 it yet. */
6117 }
6118 /* Make sure we look in the right scope the next time through
6119 the loop. */
6121 }
6123 /* If parsing tentatively, replace the sequence of tokens that makes
6124 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6125 token. That way, should we re-parse the token stream, we will
6126 not have to repeat the effort required to do the parse, nor will
6127 we issue duplicate error messages. */
6129 {
6133 /* Reset the contents of the START token. */
6135 /* Retrieve any deferred checks. Do not pop this access checks yet
6136 so the memory will not be reclaimed during token replacing below. */
6144 /* Purge all subsequent tokens. */
6146 }
6152 }
6154 /* Parse a nested-name-specifier. See
6155 cp_parser_nested_name_specifier_opt for details. This function
6156 behaves identically, except that it will an issue an error if no
6157 nested-name-specifier is present. */
6159 static tree
6165 {
6166 tree scope;
6168 /* Look for the nested-name-specifier. */
6170 typename_keyword_p,
6171 check_dependency_p,
6172 type_p,
6173 is_declaration);
6174 /* If it was not present, issue an error message. */
6176 {
6179 }
6182 }
6184 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6185 this is either a class-name or a namespace-name (which corresponds
6186 to the class-or-namespace-name production in the grammar). For
6187 C++0x, it can also be a type-name that refers to an enumeration
6188 type or a simple-template-id.
6190 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6191 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6192 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6193 TYPE_P is TRUE iff the next name should be taken as a class-name,
6194 even the same name is declared to be another entity in the same
6195 scope.
6197 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6198 specified by the class-or-namespace-name. If neither is found the
6199 ERROR_MARK_NODE is returned. */
6201 static tree
6208 {
6209 tree saved_scope;
6210 tree saved_qualifying_scope;
6211 tree saved_object_scope;
6212 tree scope;
6216 /* DR 743: decltype can appear in a nested-name-specifier. */
6218 {
6222 {
6225 }
6229 }
6231 /* Before we try to parse the class-name, we must save away the
6232 current PARSER->SCOPE since cp_parser_class_name will destroy
6233 it. */
6237 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6238 there is no need to look for a namespace-name. */
6239 only_class_p = template_keyword_p
6244 typename_keyword_p,
6245 template_keyword_p,
6247 check_dependency_p,
6249 is_declaration,
6252 /* If that didn't work, try for a namespace-name. */
6254 {
6255 /* Restore the saved scope. */
6259 /* If we are not looking at an identifier followed by the scope
6260 resolution operator, then this is not part of a
6261 nested-name-specifier. (Note that this function is only used
6262 to parse the components of a nested-name-specifier.) */
6267 }
6270 }
6272 /* Return true if we are looking at a compound-literal, false otherwise. */
6274 static bool
6276 {
6277 /* Consume the `('. */
6282 /* Skip tokens until the next token is a closing parenthesis.
6283 If we find the closing `)', and the next token is a `{', then
6284 we are looking at a compound-literal. */
6285 bool compound_literal_p
6290 /* Roll back the tokens we skipped. */
6294 }
6296 /* Parse a postfix-expression.
6298 postfix-expression:
6299 primary-expression
6300 postfix-expression [ expression ]
6301 postfix-expression ( expression-list [opt] )
6302 simple-type-specifier ( expression-list [opt] )
6303 typename :: [opt] nested-name-specifier identifier
6304 ( expression-list [opt] )
6305 typename :: [opt] nested-name-specifier template [opt] template-id
6306 ( expression-list [opt] )
6307 postfix-expression . template [opt] id-expression
6308 postfix-expression -> template [opt] id-expression
6309 postfix-expression . pseudo-destructor-name
6310 postfix-expression -> pseudo-destructor-name
6311 postfix-expression ++
6312 postfix-expression --
6313 dynamic_cast < type-id > ( expression )
6314 static_cast < type-id > ( expression )
6315 reinterpret_cast < type-id > ( expression )
6316 const_cast < type-id > ( expression )
6317 typeid ( expression )
6318 typeid ( type-id )
6320 GNU Extension:
6322 postfix-expression:
6323 ( type-id ) { initializer-list , [opt] }
6325 This extension is a GNU version of the C99 compound-literal
6326 construct. (The C99 grammar uses `type-name' instead of `type-id',
6327 but they are essentially the same concept.)
6329 If ADDRESS_P is true, the postfix expression is the operand of the
6330 `&' operator. CAST_P is true if this expression is the target of a
6331 cast.
6333 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6334 class member access expressions [expr.ref].
6336 Returns a representation of the expression. */
6338 static cp_expr
6342 {
6344 location_t loc;
6351 /* Peek at the next token. */
6356 /* Some of the productions are determined by keywords. */
6359 {
6364 {
6365 tree type;
6366 cp_expr expression;
6370 /* All of these can be handled in the same way from the point
6371 of view of parsing. Begin by consuming the token
6372 identifying the cast. */
6375 /* New types cannot be defined in the cast. */
6377 parser->type_definition_forbidden_message
6380 /* Look for the opening `<'. */
6382 /* Parse the type to which we are casting. */
6387 /* Look for the closing `>'. */
6389 /* Restore the old message. */
6392 bool saved_greater_than_is_operator_p
6396 /* And the expression which is being cast. */
6400 RT_CLOSE_PAREN);
6404 parser->greater_than_is_operator_p
6407 /* Only type conversions to integral or enumeration types
6408 can be used in constant-expressions. */
6414 {
6416 postfix_expression
6420 postfix_expression
6424 postfix_expression
6426 tf_warning_or_error);
6429 postfix_expression
6434 }
6436 /* Construct a location e.g. :
6437 reinterpret_cast <int *> (expr)
6438 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6439 ranging from the start of the "*_cast" token to the final closing
6440 paren, with the caret at the start. */
6443 }
6447 {
6448 tree type;
6452 /* Consume the `typeid' token. */
6454 /* Look for the `(' token. */
6456 /* Types cannot be defined in a `typeid' expression. */
6458 parser->type_definition_forbidden_message
6460 /* We can't be sure yet whether we're looking at a type-id or an
6461 expression. */
6463 /* Try a type-id first. */
6468 /* Look for the `)' token. Otherwise, we can't be sure that
6469 we're not looking at an expression: consider `typeid (int
6470 (3))', for example. */
6472 /* If all went well, simply lookup the type-id. */
6475 /* Otherwise, fall back to the expression variant. */
6476 else
6477 {
6478 tree expression;
6480 /* Look for an expression. */
6482 /* Compute its typeid. */
6484 /* Look for the `)' token. */
6486 }
6487 /* Restore the saved message. */
6489 /* `typeid' may not appear in an integral constant expression. */
6492 }
6496 {
6497 tree type;
6498 /* The syntax permitted here is the same permitted for an
6499 elaborated-type-specifier. */
6506 }
6510 {
6511 location_t cilk_spawn_loc
6516 {
6521 }
6523 {
6528 }
6529 else
6530 {
6531 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6534 }
6536 postfix_expression =
6540 {
6544 }
6546 {
6551 }
6552 else
6553 {
6556 postfix_expression);
6557 /* Build a location of the form:
6558 _Cilk_spawn expr
6559 ~~~~~~~~~~~~^~~~
6560 with caret at the expr, ranging from the start of the
6561 _Cilk_spawn token to the end of the expression. */
6562 location_t combined_loc =
6568 }
6570 }
6573 {
6576 tree p;
6590 tf_warning_or_error);
6593 tf_warning_or_error);
6594 else
6595 {
6599 }
6601 }
6604 {
6605 tree type;
6607 /* If the next thing is a simple-type-specifier, we may be
6608 looking at a functional cast. We could also be looking at
6609 an id-expression. So, we try the functional cast, and if
6610 that doesn't work we fall back to the primary-expression. */
6612 /* Look for the simple-type-specifier. */
6616 CP_PARSER_FLAGS_NONE);
6618 /* Parse the cast itself. */
6620 postfix_expression
6622 /* If that worked, we're done. */
6626 /* If the functional-cast didn't work out, try a
6627 compound-literal. */
6630 {
6635 /* Avoid calling cp_parser_type_id pointlessly, see comment
6636 in cp_parser_cast_expression about c++/29234. */
6639 else
6640 {
6641 /* Parse the type. */
6646 /* Look for the `)'. */
6648 }
6650 /* If things aren't going well, there's no need to
6651 keep going. */
6653 {
6655 /* Parse the brace-enclosed initializer list. */
6658 }
6659 /* If that worked, we're definitely looking at a
6660 compound-literal expression. */
6662 {
6663 /* Warn the user that a compound literal is not
6664 allowed in standard C++. */
6667 /* For simplicity, we disallow compound literals in
6668 constant-expressions. We could
6669 allow compound literals of integer type, whose
6670 initializer was a constant, in constant
6671 expressions. Permitting that usage, as a further
6672 extension, would not change the meaning of any
6673 currently accepted programs. (Of course, as
6674 compound literals are not part of ISO C++, the
6675 standard has nothing to say.) */
6677 NIC_NCC))
6678 {
6681 }
6682 /* Form the representation of the compound-literal. */
6683 postfix_expression
6685 tf_warning_or_error);
6688 }
6689 }
6691 /* It must be a primary-expression. */
6692 postfix_expression
6695 decltype_p,
6697 }
6699 }
6701 /* Note that we don't need to worry about calling build_cplus_new on a
6702 class-valued CALL_EXPR in decltype when it isn't the end of the
6703 postfix-expression; unary_complex_lvalue will take care of that for
6704 all these cases. */
6706 /* Keep looping until the postfix-expression is complete. */
6708 {
6712 /* It is not a Koenig lookup function call. */
6713 postfix_expression
6716 /* Peek at the next token. */
6720 {
6723 {
6725 "two consecutive %<[%> shall "
6728 }
6729 postfix_expression
6731 postfix_expression,
6733 decltype_p);
6742 /* postfix-expression ( expression-list [opt] ) */
6743 {
6754 is_builtin_constant_p
6757 {
6758 /* The whole point of __builtin_constant_p is to allow
6759 non-constant expressions to appear as arguments. */
6760 saved_integral_constant_expression_p
6762 saved_non_integral_constant_expression_p
6765 }
6766 args = (cp_parser_parenthesized_expression_list
6772 {
6773 parser->integral_constant_expression_p
6775 parser->non_integral_constant_expression_p
6777 }
6780 {
6783 }
6785 /* Function calls are not permitted in
6786 constant-expressions. */
6789 NIC_FUNC_CALL))
6790 {
6794 }
6799 {
6801 {
6803 {
6806 postfix_expression
6808 complain);
6809 }
6810 else
6811 postfix_expression
6813 }
6814 /* We do not perform argument-dependent lookup if
6815 normal lookup finds a non-function, in accordance
6816 with the expected resolution of DR 218. */
6819 {
6823 /* Do not do argument dependent lookup if regular
6824 lookup finds a member function or a block-scope
6825 function declaration. [basic.lookup.argdep]/3 */
6828 {
6831 postfix_expression
6833 complain);
6834 }
6835 }
6836 }
6842 {
6851 }
6854 {
6864 {
6865 postfix_expression
6869 }
6872 {
6873 postfix_expression
6874 = (build_new_method_call
6880 complain));
6881 }
6882 else
6883 postfix_expression
6887 complain);
6888 }
6892 postfix_expression = (build_offset_ref_call_from_tree
6894 complain));
6896 /* A call to a static class member, or a namespace-scope
6897 function. */
6898 postfix_expression
6901 koenig_p,
6902 complain);
6903 else
6904 /* All other function calls. */
6905 postfix_expression
6908 koenig_p,
6909 complain);
6912 {
6914 start_loc,
6915 close_paren_loc);
6917 }
6919 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6923 }
6928 /* postfix-expression . template [opt] id-expression
6929 postfix-expression . pseudo-destructor-name
6930 postfix-expression -> template [opt] id-expression
6931 postfix-expression -> pseudo-destructor-name */
6933 /* Consume the `.' or `->' operator. */
6936 postfix_expression
6938 postfix_expression,
6945 /* postfix-expression ++ */
6946 /* Consume the `++' token. */
6948 /* Generate a representation for the complete expression. */
6949 postfix_expression
6951 POSTINCREMENT_EXPR);
6952 /* Increments may not appear in constant-expressions. */
6960 /* postfix-expression -- */
6961 /* Consume the `--' token. */
6963 /* Generate a representation for the complete expression. */
6964 postfix_expression
6966 POSTDECREMENT_EXPR);
6967 /* Decrements may not appear in constant-expressions. */
6978 return is_member_access
6979 ? postfix_expression
6981 else
6983 }
6984 }
6986 /* We should never get here. */
6989 }
6991 /* This function parses Cilk Plus array notations. If a normal array expr. is
6992 parsed then the array index is passed back to the caller through *INIT_INDEX
6993 and the function returns a NULL_TREE. If array notation expr. is parsed,
6994 then *INIT_INDEX is ignored by the caller and the function returns
6995 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6996 error_mark_node. */
6998 static tree
7000 tree array_value)
7001 {
7005 {
7008 }
7017 {
7020 }
7022 {
7023 /* Consume the ':'. */
7026 /* If we are here, then we have a case like this A[:]. */
7028 {
7032 }
7036 }
7037 else
7038 {
7039 /* If we are here, then there are three valid possibilities:
7040 1. ARRAY [ EXP ]
7041 2. ARRAY [ EXP : EXP ]
7042 3. ARRAY [ EXP : EXP : EXP ] */
7046 {
7047 /* This indicates that we have a normal array expression. */
7050 }
7052 /* Consume the ':'. */
7056 {
7059 }
7060 }
7065 {
7069 }
7075 }
7077 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7078 by cp_parser_builtin_offsetof. We're looking for
7080 postfix-expression [ expression ]
7081 postfix-expression [ braced-init-list ] (C++11)
7083 FOR_OFFSETOF is set if we're being called in that context, which
7084 changes how we deal with integer constant expressions. */
7086 static tree
7088 tree postfix_expression,
7091 {
7096 /* Consume the `[' token. */
7102 /* Parse the index expression. */
7103 /* ??? For offsetof, there is a question of what to allow here. If
7104 offsetof is not being used in an integral constant expression context,
7105 then we *could* get the right answer by computing the value at runtime.
7106 If we are in an integral constant expression context, then we might
7107 could accept any constant expression; hard to say without analysis.
7108 Rather than open the barn door too wide right away, allow only integer
7109 constant expressions here. */
7112 else
7113 {
7115 {
7122 {
7124 "braced list index is not allowed with array "
7128 }
7129 }
7131 {
7132 /* Here are have these two options:
7133 ARRAY[EXP : EXP] - Array notation expr with default
7134 stride of 1.
7135 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7136 stride. */
7138 postfix_expression);
7141 }
7142 else
7144 }
7148 /* Look for the closing `]'. */
7151 /* Build the ARRAY_REF. */
7155 /* When not doing offsetof, array references are not permitted in
7156 constant-expressions. */
7162 }
7164 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7165 by cp_parser_builtin_offsetof. We're looking for
7167 postfix-expression . template [opt] id-expression
7168 postfix-expression . pseudo-destructor-name
7169 postfix-expression -> template [opt] id-expression
7170 postfix-expression -> pseudo-destructor-name
7172 FOR_OFFSETOF is set if we're being called in that context. That sorta
7173 limits what of the above we'll actually accept, but nevermind.
7174 TOKEN_TYPE is the "." or "->" token, which will already have been
7175 removed from the stream. */
7177 static tree
7180 cp_expr postfix_expression,
7182 location_t location)
7183 {
7184 tree name;
7190 /* If this is a `->' operator, dereference the pointer. */
7193 tf_warning_or_error);
7194 /* Check to see whether or not the expression is type-dependent and
7195 not the current instantiation. */
7197 /* The identifier following the `->' or `.' is not qualified. */
7203 /* Enter the scope corresponding to the type of the object
7204 given by the POSTFIX_EXPRESSION. */
7206 {
7208 /* According to the standard, no expression should ever have
7209 reference type. Unfortunately, we do not currently match
7210 the standard in this respect in that our internal representation
7211 of an expression may have reference type even when the standard
7212 says it does not. Therefore, we have to manually obtain the
7213 underlying type here. */
7215 /* The type of the POSTFIX_EXPRESSION must be complete. */
7216 /* Unlike the object expression in other contexts, *this is not
7217 required to be of complete type for purposes of class member
7218 access (5.2.5) outside the member function body. */
7220 && !(processing_template_decl
7221 && current_class_type
7222 && (same_type_ignoring_top_level_qualifiers_p
7225 /* Let the name lookup machinery know that we are processing a
7226 class member access expression. */
7228 /* If something went wrong, we want to be able to discern that case,
7229 as opposed to the case where there was no SCOPE due to the type
7230 of expression being dependent. */
7233 /* If the SCOPE was erroneous, make the various semantic analysis
7234 functions exit quickly -- and without issuing additional error
7235 messages. */
7238 }
7239 else
7240 /* Tell cp_parser_lookup_name that there was an object, even though it's
7241 type-dependent. */
7244 /* Assume this expression is not a pseudo-destructor access. */
7247 /* If the SCOPE is a scalar type, then, if this is a valid program,
7248 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7249 is type dependent, it can be pseudo-destructor-name or something else.
7250 Try to parse it as pseudo-destructor-name first. */
7252 {
7253 tree s;
7254 tree type;
7257 /* Parse the pseudo-destructor-name. */
7266 {
7268 postfix_expression
7271 }
7272 }
7275 {
7276 /* If the SCOPE is not a scalar type, we are looking at an
7277 ordinary class member access expression, rather than a
7278 pseudo-destructor-name. */
7281 /* Parse the id-expression. */
7282 name = (cp_parser_id_expression
7289 /* In general, build a SCOPE_REF if the member name is qualified.
7290 However, if the name was not dependent and has already been
7291 resolved; there is no need to build the SCOPE_REF. For example;
7293 struct X { void f(); };
7294 template <typename T> void f(T* t) { t->X::f(); }
7296 Even though "t" is dependent, "X::f" is not and has been resolved
7297 to a BASELINK; there is no need to include scope information. */
7299 /* But we do need to remember that there was an explicit scope for
7300 virtual function calls. */
7304 /* If the name is a template-id that names a type, we will get a
7305 TYPE_DECL here. That is invalid code. */
7307 {
7310 }
7311 else
7312 {
7314 {
7316 {
7320 }
7321 else
7324 name,
7325 template_p);
7329 }
7331 adjust_result_of_qualified_name_lookup
7333 postfix_expression
7335 template_p,
7336 tf_warning_or_error);
7337 /* Build a location e.g.:
7338 ptr->access_expr
7339 ~~~^~~~~~~~~~~~~
7340 where the caret is at the deref token, ranging from
7341 the start of postfix_expression to the end of the access expr. */
7342 location_t end_loc
7344 location_t combined_loc
7347 }
7348 }
7350 /* We no longer need to look up names in the scope of the object on
7351 the left-hand side of the `.' or `->' operator. */
7354 /* Outside of offsetof, these operators may not appear in
7355 constant-expressions. */
7357 && (cp_parser_non_integral_constant_expression
7362 }
7364 /* Parse a parenthesized expression-list.
7366 expression-list:
7367 assignment-expression
7368 expression-list, assignment-expression
7370 attribute-list:
7371 expression-list
7372 identifier
7373 identifier, expression-list
7375 CAST_P is true if this expression is the target of a cast.
7377 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7378 argument pack.
7380 Returns a vector of trees. Each element is a representation of an
7381 assignment-expression. NULL is returned if the ( and or ) are
7382 missing. An empty, but allocated, vector is returned on no
7383 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7384 if we are parsing an attribute list for an attribute that wants a
7385 plain identifier argument, normal_attr for an attribute that wants
7386 an expression, or non_attr if we aren't parsing an attribute list. If
7387 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7388 not all of the expressions in the list were constant.
7389 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7390 will be written to with the location of the closing parenthesis. If
7391 an error occurs, it may or may not be written to. */
7400 {
7406 /* Assume all the expressions will be constant. */
7415 /* Within a parenthesized expression, a `>' token is always
7416 the greater-than operator. */
7417 saved_greater_than_is_operator_p
7421 /* Consume expressions until there are no more. */
7424 {
7425 tree expr;
7427 /* At the beginning of attribute lists, check to see if the
7428 next token is an identifier. */
7431 {
7434 /* Consume the identifier. */
7436 /* Save the identifier. */
7438 }
7439 else
7440 {
7443 /* Parse the next assignment-expression. */
7445 {
7446 /* A braced-init-list. */
7452 }
7454 {
7455 expr = (cp_parser_constant_expression
7460 }
7461 else
7463 cast_p);
7468 /* If we have an ellipsis, then this is an expression
7469 expansion. */
7472 {
7473 /* Consume the `...'. */
7476 /* Build the argument pack. */
7478 }
7480 /* Add it to the list. We add error_mark_node
7481 expressions to the list, so that we can still tell if
7482 the correct form for a parenthesized expression-list
7483 is found. That gives better errors. */
7488 }
7490 /* After the first item, attribute lists look the same as
7491 expression lists. */
7494 get_comma:;
7495 /* If the next token isn't a `,', then we are done. */
7499 /* Otherwise, consume the `,' and keep going. */
7501 }
7507 {
7510 skip_comma:;
7511 /* We try and resync to an unnested comma, as that will give the
7512 user better diagnostics. */
7520 {
7521 parser->greater_than_is_operator_p
7524 }
7525 }
7527 parser->greater_than_is_operator_p
7534 }
7536 /* Parse a pseudo-destructor-name.
7538 pseudo-destructor-name:
7539 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7540 :: [opt] nested-name-specifier template template-id :: ~ type-name
7541 :: [opt] nested-name-specifier [opt] ~ type-name
7543 If either of the first two productions is used, sets *SCOPE to the
7544 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7545 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7546 or ERROR_MARK_NODE if the parse fails. */
7548 static void
7550 tree object,
7553 {
7556 /* Handle ~auto. */
7560 {
7563 "%<~auto%> only available with "
7570 }
7572 /* Assume that things will not work out. */
7575 /* Look for the optional `::' operator. */
7577 /* Look for the optional nested-name-specifier. */
7578 nested_name_specifier_p
7585 /* Now, if we saw a nested-name-specifier, we might be doing the
7586 second production. */
7589 {
7590 /* Consume the `template' keyword. */
7592 /* Parse the template-id. */
7596 class_type,
7598 /* Look for the `::' token. */
7600 }
7601 /* If the next token is not a `~', then there might be some
7602 additional qualification. */
7604 {
7605 /* At this point, we're looking for "type-name :: ~". The type-name
7606 must not be a class-name, since this is a pseudo-destructor. So,
7607 it must be either an enum-name, or a typedef-name -- both of which
7608 are just identifiers. So, we peek ahead to check that the "::"
7609 and "~" tokens are present; if they are not, then we can avoid
7610 calling type_name. */
7614 {
7617 }
7619 /* Look for the type-name. */
7624 /* Look for the `::' token. */
7626 }
7627 else
7630 /* Look for the `~'. */
7633 /* Once we see the ~, this has to be a pseudo-destructor. */
7637 /* Look for the type-name again. We are not responsible for
7638 checking that it matches the first type-name. */
7640 }
7642 /* Parse a unary-expression.
7644 unary-expression:
7645 postfix-expression
7646 ++ cast-expression
7647 -- cast-expression
7648 unary-operator cast-expression
7649 sizeof unary-expression
7650 sizeof ( type-id )
7651 alignof ( type-id ) [C++0x]
7652 new-expression
7653 delete-expression
7655 GNU Extensions:
7657 unary-expression:
7658 __extension__ cast-expression
7659 __alignof__ unary-expression
7660 __alignof__ ( type-id )
7661 alignof unary-expression [C++0x]
7662 __real__ cast-expression
7663 __imag__ cast-expression
7664 && identifier
7665 sizeof ( type-id ) { initializer-list , [opt] }
7666 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7667 __alignof__ ( type-id ) { initializer-list , [opt] }
7669 ADDRESS_P is true iff the unary-expression is appearing as the
7670 operand of the `&' operator. CAST_P is true if this expression is
7671 the target of a cast.
7673 Returns a representation of the expression. */
7675 static cp_expr
7678 {
7682 /* Peek at the next token. */
7684 /* Some keywords give away the kind of expression. */
7686 {
7690 {
7693 {
7696 location_t first_loc;
7699 /* Consume the token. */
7702 /* Parse the operand. */
7707 else
7708 {
7709 /* ISO C++ defines alignof only with types, not with
7710 expressions. So pedwarn if alignof is used with a non-
7711 type expression. However, __alignof__ is ok. */
7714 "ISO C++ does not allow %<alignof%> "
7718 }
7719 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7720 SIZEOF_EXPR with the original operand. */
7722 {
7724 {
7726 {
7729 error_mark_node));
7731 }
7732 else
7736 }
7738 }
7740 }
7749 {
7750 /* The saved value of the PEDANTIC flag. */
7752 tree expr;
7754 /* Save away the PEDANTIC flag. */
7756 /* Parse the cast-expression. */
7758 /* Restore the PEDANTIC flag. */
7762 }
7766 {
7767 tree expression;
7769 /* Consume the `__real__' or `__imag__' token. */
7771 /* Parse the cast-expression. */
7773 /* Create the complete representation. */
7777 expression,
7778 tf_warning_or_error);
7779 }
7787 {
7788 tree expr;
7798 parser->type_definition_forbidden_message
7801 saved_integral_constant_expression_p
7803 saved_non_integral_constant_expression_p
7807 saved_greater_than_is_operator_p
7819 parser->greater_than_is_operator_p
7822 parser->integral_constant_expression_p
7824 parser->non_integral_constant_expression_p
7831 }
7835 }
7836 }
7838 /* Look for the `:: new' and `:: delete', which also signal the
7839 beginning of a new-expression, or delete-expression,
7840 respectively. If the next token is `::', then it might be one of
7841 these. */
7843 {
7846 /* See if the token after the `::' is one of the keywords in
7847 which we're interested. */
7849 /* If it's `new', we have a new-expression. */
7852 /* Similarly, for `delete'. */
7855 }
7857 /* Look for a unary operator. */
7859 /* The `++' and `--' operators can be handled similarly, even though
7860 they are not technically unary-operators in the grammar. */
7862 {
7867 /* Handle the GNU address-of-label extension. */
7870 {
7871 tree identifier;
7872 tree expression;
7875 /* Consume the '&&' token. */
7877 /* Look for the identifier. */
7878 location_t finish_loc
7881 /* Construct a location of the form:
7882 &&label
7883 ^~~~~~~
7884 with caret==start at the "&&", finish at the end of the label. */
7885 location_t combined_loc
7887 /* Create an expression representing the address. */
7890 NIC_ADDR_LABEL))
7893 }
7894 }
7896 {
7897 cp_expr cast_expression;
7903 /* Consume the operator token. */
7907 /* Parse the cast-expression. */
7908 cast_expression
7913 pidk);
7915 /* Make a location:
7916 OP_TOKEN CAST_EXPRESSION
7917 ^~~~~~~~~~~~~~~~~~~~~~~~~
7918 with start==caret at the operator token, and
7919 extending to the end of the cast_expression. */
7922 /* Now, build an appropriate representation. */
7924 {
7928 RO_UNARY_STAR,
7929 complain);
7930 /* TODO: build_x_indirect_ref does not always honor the
7931 location, so ensure it is set. */
7937 /* Fall through. */
7940 cast_expression,
7941 complain);
7942 /* TODO: build_x_unary_op does not always honor the location,
7943 so ensure it is set. */
7951 /* Fall through. */
7953 /* Immediately fold negation of a constant, unless the constant is 0
7954 (since -0 == 0) or it would overflow. */
7959 {
7962 cast_expression);
7964 {
7967 }
7968 }
7969 /* Fall through. */
7978 }
7982 non_constant_p))
7986 }
7990 decltype_p,
7991 pidk);
7992 }
7994 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7995 unary-operator, the corresponding tree code is returned. */
7997 static enum tree_code
7999 {
8001 {
8022 }
8023 }
8025 /* Parse a new-expression.
8027 new-expression:
8028 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8029 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8031 Returns a representation of the expression. */
8033 static tree
8035 {
8038 tree type;
8041 tree ret;
8045 /* Look for the optional `::' operator. */
8046 global_scope_p
8050 /* Look for the `new' operator. */
8052 /* There's no easy way to tell a new-placement from the
8053 `( type-id )' construct. */
8055 /* Look for a new-placement. */
8057 /* If that didn't work out, there's no new-placement. */
8059 {
8063 }
8065 /* If the next token is a `(', then we have a parenthesized
8066 type-id. */
8068 {
8072 /* Consume the `('. */
8075 /* Parse the type-id. */
8076 parser->type_definition_forbidden_message
8078 {
8081 }
8084 /* Look for the closing `)'. */
8087 /* There should not be a direct-new-declarator in this production,
8088 but GCC used to allowed this, so we check and emit a sensible error
8089 message for this case. */
8091 {
8097 }
8098 }
8099 /* Otherwise, there must be a new-type-id. */
8100 else
8103 /* If the next token is a `(' or '{', then we have a new-initializer. */
8108 else
8111 /* A new-expression may not appear in an integral constant
8112 expression. */
8115 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8116 of a new-type-id or type-id of a new-expression, the new-expression shall
8117 contain a new-initializer of the form ( assignment-expression )".
8118 Additionally, consistently with the spirit of DR 1467, we want to accept
8119 'new auto { 2 }' too. */
8124 {
8126 "initialization of new-expression for type %<auto%> "
8129 }
8130 else
8131 {
8132 /* Construct a location e.g.:
8133 ptr = new int[100]
8134 ^~~~~~~~~~~~
8135 with caret == start at the start of the "new" token, and the end
8136 at the end of the final token we consumed. */
8141 /* Create a representation of the new-expression. */
8143 tf_warning_or_error);
8145 }
8153 }
8155 /* Parse a new-placement.
8157 new-placement:
8158 ( expression-list )
8160 Returns the same representation as for an expression-list. */
8164 {
8167 /* Parse the expression-list. */
8168 expression_list = (cp_parser_parenthesized_expression_list
8177 }
8179 /* Parse a new-type-id.
8181 new-type-id:
8182 type-specifier-seq new-declarator [opt]
8184 Returns the TYPE allocated. If the new-type-id indicates an array
8185 type, *NELTS is set to the number of elements in the last array
8186 bound; the TYPE will not include the last array bound. */
8188 static tree
8190 {
8191 cp_decl_specifier_seq type_specifier_seq;
8197 /* The type-specifier sequence must not contain type definitions.
8198 (It cannot contain declarations of new types either, but if they
8199 are not definitions we will catch that because they are not
8200 complete.) */
8202 parser->type_definition_forbidden_message
8204 /* Parse the type-specifier-seq. */
8208 /* Restore the old message. */
8214 /* Parse the new-declarator. */
8217 /* Determine the number of elements in the last array dimension, if
8218 any. */
8220 /* Skip down to the last array dimension. */
8225 {
8228 }
8233 {
8236 }
8239 {
8246 else
8248 }
8251 }
8253 /* Parse an (optional) new-declarator.
8255 new-declarator:
8256 ptr-operator new-declarator [opt]
8257 direct-new-declarator
8259 Returns the declarator. */
8263 {
8266 cp_cv_quals cv_quals;
8268 /* We don't know if there's a ptr-operator next, or not. */
8270 /* Look for a ptr-operator. */
8272 /* If that worked, look for more new-declarators. */
8274 {
8277 /* Parse another optional declarator. */
8280 declarator = cp_parser_make_indirect_declarator
8284 }
8286 /* If the next token is a `[', there is a direct-new-declarator. */
8291 }
8293 /* Parse a direct-new-declarator.
8295 direct-new-declarator:
8296 [ expression ]
8297 direct-new-declarator [constant-expression]
8299 */
8303 {
8307 {
8308 tree expression;
8311 /* Look for the opening `['. */
8316 /* The standard requires that the expression have integral
8317 type. DR 74 adds enumeration types. We believe that the
8318 real intent is that these expressions be handled like the
8319 expression in a `switch' condition, which also allows
8320 classes with a single conversion to integral or
8321 enumeration type. */
8323 {
8324 expression
8326 expression,
8329 {
8331 "expression in new-declarator must have integral "
8334 }
8335 }
8337 /* Look for the closing `]'. */
8340 /* Add this bound to the declarator. */
8343 /* If the next token is not a `[', then there are no more
8344 bounds. */
8347 }
8350 }
8352 /* Parse a new-initializer.
8354 new-initializer:
8355 ( expression-list [opt] )
8356 braced-init-list
8358 Returns a representation of the expression-list. */
8362 {
8366 {
8367 tree t;
8374 }
8375 else
8376 expression_list = (cp_parser_parenthesized_expression_list
8382 }
8384 /* Parse a delete-expression.
8386 delete-expression:
8387 :: [opt] delete cast-expression
8388 :: [opt] delete [ ] cast-expression
8390 Returns a representation of the expression. */
8392 static tree
8394 {
8397 tree expression;
8399 /* Look for the optional `::' operator. */
8400 global_scope_p
8404 /* Look for the `delete' keyword. */
8406 /* See if the array syntax is in use. */
8408 {
8409 /* Consume the `[' token. */
8411 /* Look for the `]' token. */
8413 /* Remember that this is the `[]' construct. */
8415 }
8416 else
8419 /* Parse the cast-expression. */
8422 /* A delete-expression may not appear in an integral constant
8423 expression. */
8428 tf_warning_or_error);
8429 }
8431 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8432 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8433 0 otherwise. */
8435 static int
8437 {
8440 {
8482 /* In ((type ()) () the last () isn't a valid cast-expression,
8483 so the whole must be parsed as postfix-expression. */
8488 /* '[' may start a primary-expression in obj-c++ and in C++11,
8489 as a lambda-expression, eg, '(void)[]{}'. */
8496 /* '++' and '--' may or may not start a cast-expression:
8498 struct T { void operator++(int); };
8499 void f() { (T())++; }
8501 vs
8503 int a;
8504 (int)++a; */
8509 }
8510 }
8512 /* Parse a cast-expression.
8514 cast-expression:
8515 unary-expression
8516 ( type-id ) cast-expression
8518 ADDRESS_P is true iff the unary-expression is appearing as the
8519 operand of the `&' operator. CAST_P is true if this expression is
8520 the target of a cast.
8522 Returns a representation of the expression. */
8524 static cp_expr
8527 {
8528 /* If it's a `(', then we might be looking at a cast. */
8530 {
8536 /* There's no way to know yet whether or not this is a cast.
8537 For example, `(int (3))' is a unary-expression, while `(int)
8538 3' is a cast. So, we resort to parsing tentatively. */
8540 /* Types may not be defined in a cast. */
8542 parser->type_definition_forbidden_message
8544 /* Consume the `('. */
8548 /* A very tricky bit is that `(struct S) { 3 }' is a
8549 compound-literal (which we permit in C++ as an extension).
8550 But, that construct is not a cast-expression -- it is a
8551 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8552 is legal; if the compound-literal were a cast-expression,
8553 you'd need an extra set of parentheses.) But, if we parse
8554 the type-id, and it happens to be a class-specifier, then we
8555 will commit to the parse at that point, because we cannot
8556 undo the action that is done when creating a new class. So,
8557 then we cannot back up and do a postfix-expression.
8559 Another tricky case is the following (c++/29234):
8561 struct S { void operator () (); };
8563 void foo ()
8564 {
8565 ( S()() );
8566 }
8568 As a type-id we parse the parenthesized S()() as a function
8569 returning a function, groktypename complains and we cannot
8570 back up in this case either.
8572 Therefore, we scan ahead to the closing `)', and check to see
8573 if the tokens after the `)' can start a cast-expression. Otherwise
8574 we are dealing with an unary-expression, a postfix-expression
8575 or something else.
8577 Yet another tricky case, in C++11, is the following (c++/54891):
8579 (void)[]{};
8581 The issue is that usually, besides the case of lambda-expressions,
8582 the parenthesized type-id cannot be followed by '[', and, eg, we
8583 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8584 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8585 we don't commit, we try a cast-expression, then an unary-expression.
8587 Save tokens so that we can put them back. */
8590 /* We may be looking at a cast-expression. */
8593 cast_expression
8596 /* Roll back the tokens we skipped. */
8598 /* If we aren't looking at a cast-expression, simulate an error so
8599 that the call to cp_parser_error_occurred below returns true. */
8602 else
8603 {
8606 /* Look for the type-id. */
8608 /* Look for the closing `)'. */
8611 }
8613 /* Restore the saved message. */
8616 /* At this point this can only be either a cast or a
8617 parenthesized ctor such as `(T ())' that looks like a cast to
8618 function returning T. */
8620 {
8621 /* Only commit if the cast-expression doesn't start with
8622 '++', '--', or '[' in C++11. */
8630 pidk);
8633 {
8634 /* Warn about old-style casts, if so requested. */
8641 /* Only type conversions to integral or enumeration types
8642 can be used in constant-expressions. */
8645 NIC_CAST))
8648 /* Perform the cast. */
8649 /* Make a location:
8650 (TYPE) EXPR
8651 ^~~~~~~~~~~
8652 with start==caret at the open paren, extending to the
8653 end of "expr". */
8655 open_paren_loc,
8659 }
8660 }
8661 else
8663 }
8665 /* If we get here, then it's not a cast, so it must be a
8666 unary-expression. */
8669 }
8671 /* Parse a binary expression of the general form:
8673 pm-expression:
8674 cast-expression
8675 pm-expression .* cast-expression
8676 pm-expression ->* cast-expression
8678 multiplicative-expression:
8679 pm-expression
8680 multiplicative-expression * pm-expression
8681 multiplicative-expression / pm-expression
8682 multiplicative-expression % pm-expression
8684 additive-expression:
8685 multiplicative-expression
8686 additive-expression + multiplicative-expression
8687 additive-expression - multiplicative-expression
8689 shift-expression:
8690 additive-expression
8691 shift-expression << additive-expression
8692 shift-expression >> additive-expression
8694 relational-expression:
8695 shift-expression
8696 relational-expression < shift-expression
8697 relational-expression > shift-expression
8698 relational-expression <= shift-expression
8699 relational-expression >= shift-expression
8701 GNU Extension:
8703 relational-expression:
8704 relational-expression <? shift-expression
8705 relational-expression >? shift-expression
8707 equality-expression:
8708 relational-expression
8709 equality-expression == relational-expression
8710 equality-expression != relational-expression
8712 and-expression:
8713 equality-expression
8714 and-expression & equality-expression
8716 exclusive-or-expression:
8717 and-expression
8718 exclusive-or-expression ^ and-expression
8720 inclusive-or-expression:
8721 exclusive-or-expression
8722 inclusive-or-expression | exclusive-or-expression
8724 logical-and-expression:
8725 inclusive-or-expression
8726 logical-and-expression && inclusive-or-expression
8728 logical-or-expression:
8729 logical-and-expression
8730 logical-or-expression || logical-and-expression
8732 All these are implemented with a single function like:
8734 binary-expression:
8735 simple-cast-expression
8736 binary-expression <token> binary-expression
8738 CAST_P is true if this expression is the target of a cast.
8740 The binops_by_token map is used to get the tree codes for each <token> type.
8741 binary-expressions are associated according to a precedence table. */
8743 #define TOKEN_PRECEDENCE(token) \
8744 (((token->type == CPP_GREATER \
8745 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8746 && !parser->greater_than_is_operator_p) \
8747 ? PREC_NOT_OPERATOR \
8748 : binops_by_token[token->type].prec)
8750 static cp_expr
8756 {
8757 cp_parser_expression_stack stack;
8759 cp_parser_expression_stack_entry current;
8760 cp_expr rhs;
8764 tree overload;
8766 /* Parse the first expression. */
8777 {
8778 /* Get an operator token. */
8784 {
8786 "%<>>%> operator is treated"
8790 }
8795 /* This is a fold-expression; handle it later. */
8798 /* Popping an entry off the stack means we completed a subexpression:
8799 - either we found a token which is not an operator (`>' where it is not
8800 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8801 will happen repeatedly;
8802 - or, we found an operator which has lower priority. This is the case
8803 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8804 parsing `3 * 4'. */
8806 {
8809 else
8811 }
8813 get_rhs:
8817 /* We used the operator token. */
8820 /* For "false && x" or "true || x", x will never be executed;
8821 disable warnings while evaluating it. */
8823 c_inhibit_evaluation_warnings +=
8826 c_inhibit_evaluation_warnings +=
8829 /* Extract another operand. It may be the RHS of this expression
8830 or the LHS of a new, higher priority expression. */
8835 /* Get another operator token. Look up its precedence to avoid
8836 building a useless (immediately popped) stack entry for common
8837 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8844 {
8845 /* ... and prepare to parse the RHS of the new, higher priority
8846 expression. Since precedence levels on the stack are
8847 monotonically increasing, we do not have to care about
8848 stack overflows. */
8857 pop:
8859 /* If the stack is not empty, we have parsed into LHS the right side
8860 (`4' in the example above) of an expression we had suspended.
8861 We can use the information on the stack to recover the LHS (`3')
8862 from the stack together with the tree code (`MULT_EXPR'), and
8863 the precedence of the higher level subexpression
8864 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8865 which will be used to actually build the additive expression. */
8870 }
8872 /* Undo the disabling of warnings done above. */
8874 c_inhibit_evaluation_warnings -=
8877 c_inhibit_evaluation_warnings -=
8883 /* Avoid warning for !!x == y. */
8888 /* Avoid warning for !b == y where b is boolean. */
8892 /* Avoid warning for !!b == y where b is boolean. */
8905 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8906 ERROR_MARK for everything that is not a binary expression.
8907 This makes warn_about_parentheses miss some warnings that
8908 involve unary operators. For unary expressions we should
8909 pass the correct tree_code unless the unary expression was
8910 surrounded by parentheses.
8911 */
8918 == tcc_comparison
8921 else
8922 {
8927 /* TODO: build_x_binary_op doesn't always honor the location. */
8929 }
8932 /* If the binary operator required the use of an overloaded operator,
8933 then this expression cannot be an integral constant-expression.
8934 An overloaded operator can be used even if both operands are
8935 otherwise permissible in an integral constant-expression if at
8936 least one of the operands is of enumeration type. */
8940 NIC_OVERLOADED))
8942 }
8945 }
8947 static cp_expr
8952 {
8955 }
8957 /* Parse the `? expression : assignment-expression' part of a
8958 conditional-expression. The LOGICAL_OR_EXPR is the
8959 logical-or-expression that started the conditional-expression.
8960 Returns a representation of the entire conditional-expression.
8962 This routine is used by cp_parser_assignment_expression.
8964 ? expression : assignment-expression
8966 GNU Extensions:
8968 ? : assignment-expression */
8970 static tree
8972 {
8974 cp_expr assignment_expr;
8978 /* Consume the `?' token. */
8983 {
8986 /* Implicit true clause. */
8988 c_inhibit_evaluation_warnings +=
8991 }
8992 else
8993 {
8996 /* Parse the expression. */
8997 c_inhibit_evaluation_warnings +=
9000 c_inhibit_evaluation_warnings +=
9004 }
9006 /* The next token should be a `:'. */
9008 /* Parse the assignment-expression. */
9010 c_inhibit_evaluation_warnings -=
9013 /* Make a location:
9014 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9015 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9016 with the caret at the "?", ranging from the start of
9017 the logical_or_expr to the end of the assignment_expr. */
9022 /* Build the conditional-expression. */
9024 expr,
9025 assignment_expr,
9026 tf_warning_or_error);
9027 }
9029 /* Parse an assignment-expression.
9031 assignment-expression:
9032 conditional-expression
9033 logical-or-expression assignment-operator assignment_expression
9034 throw-expression
9036 CAST_P is true if this expression is the target of a cast.
9037 DECLTYPE_P is true if this expression is the operand of decltype.
9039 Returns a representation for the expression. */
9041 static cp_expr
9044 {
9045 cp_expr expr;
9047 /* If the next token is the `throw' keyword, then we're looking at
9048 a throw-expression. */
9051 /* Otherwise, it must be that we are looking at a
9052 logical-or-expression. */
9053 else
9054 {
9055 /* Parse the binary expressions (logical-or-expression). */
9057 decltype_p,
9059 /* If the next token is a `?' then we're actually looking at a
9060 conditional-expression. */
9063 else
9064 {
9067 /* If it's an assignment-operator, we're using the second
9068 production. */
9069 enum tree_code assignment_operator
9072 {
9075 /* Parse the right-hand side of the assignment. */
9082 /* An assignment may not appear in a
9083 constant-expression. */
9085 NIC_ASSIGNMENT))
9087 /* Build the assignment expression. Its default
9088 location:
9089 LHS = RHS
9090 ~~~~^~~~~
9091 is the location of the '=' token as the
9092 caret, ranging from the start of the lhs to the
9093 end of the rhs. */
9098 assignment_operator,
9099 rhs,
9101 /* TODO: build_x_modify_expr doesn't honor the location,
9102 so we must set it here. */
9104 }
9105 }
9106 }
9109 }
9111 /* Parse an (optional) assignment-operator.
9113 assignment-operator: one of
9114 = *= /= %= += -= >>= <<= &= ^= |=
9116 GNU Extension:
9118 assignment-operator: one of
9119 <?= >?=
9121 If the next token is an assignment operator, the corresponding tree
9122 code is returned, and the token is consumed. For example, for
9123 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9124 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9125 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9126 operator, ERROR_MARK is returned. */
9128 static enum tree_code
9130 {
9134 /* Peek at the next token. */
9138 {
9184 /* Nothing else is an assignment operator. */
9186 }
9188 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9193 /* If it was an assignment operator, consume it. */
9198 }
9200 /* Parse an expression.
9202 expression:
9203 assignment-expression
9204 expression , assignment-expression
9206 CAST_P is true if this expression is the target of a cast.
9207 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9208 except possibly parenthesized or on the RHS of a comma (N3276).
9210 Returns a representation of the expression. */
9212 static cp_expr
9215 {
9220 {
9221 cp_expr assignment_expression;
9223 /* Parse the next assignment-expression. */
9224 assignment_expression
9227 /* We don't create a temporary for a call that is the immediate operand
9228 of decltype or on the RHS of a comma. But when we see a comma, we
9229 need to create a temporary for a call on the LHS. */
9234 assignment_expression
9238 /* If this is the first assignment-expression, we can just
9239 save it away. */
9242 else
9243 {
9244 /* Create a location with caret at the comma, ranging
9245 from the start of the LHS to the end of the RHS. */
9250 assignment_expression,
9253 }
9254 /* If the next token is not a comma, or we're in a fold-expression, then
9255 we are done with the expression. */
9259 /* Consume the `,'. */
9262 /* A comma operator cannot appear in a constant-expression. */
9265 }
9268 }
9270 /* Parse a constant-expression.
9272 constant-expression:
9273 conditional-expression
9275 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9276 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9277 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9278 is false, NON_CONSTANT_P should be NULL. */
9280 static cp_expr
9284 {
9288 cp_expr expression;
9290 /* It might seem that we could simply parse the
9291 conditional-expression, and then check to see if it were
9292 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9293 one that the compiler can figure out is constant, possibly after
9294 doing some simplifications or optimizations. The standard has a
9295 precise definition of constant-expression, and we must honor
9296 that, even though it is somewhat more restrictive.
9298 For example:
9300 int i[(2, 3)];
9302 is not a legal declaration, because `(2, 3)' is not a
9303 constant-expression. The `,' operator is forbidden in a
9304 constant-expression. However, GCC's constant-folding machinery
9305 will fold this operation to an INTEGER_CST for `3'. */
9307 /* Save the old settings. */
9309 saved_allow_non_integral_constant_expression_p
9312 /* We are now parsing a constant-expression. */
9314 parser->allow_non_integral_constant_expression_p
9317 /* Although the grammar says "conditional-expression", we parse an
9318 "assignment-expression", which also permits "throw-expression"
9319 and the use of assignment operators. In the case that
9320 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9321 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9322 actually essential that we look for an assignment-expression.
9323 For example, cp_parser_initializer_clauses uses this function to
9324 determine whether a particular assignment-expression is in fact
9325 constant. */
9327 /* Restore the old settings. */
9328 parser->integral_constant_expression_p
9330 parser->allow_non_integral_constant_expression_p
9333 {
9334 /* Require an rvalue constant expression here; that's what our
9335 callers expect. Reference constant expressions are handled
9336 separately in e.g. cp_parser_template_argument. */
9341 }
9344 parser->non_integral_constant_expression_p
9348 }
9350 /* Parse __builtin_offsetof.
9352 offsetof-expression:
9353 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9355 offsetof-member-designator:
9356 id-expression
9357 | offsetof-member-designator "." id-expression
9358 | offsetof-member-designator "[" expression "]"
9359 | offsetof-member-designator "->" id-expression */
9361 static cp_expr
9363 {
9365 tree type;
9366 cp_expr expr;
9367 cp_id_kind dummy;
9369 location_t finish_loc;
9371 /* We're about to accept non-integral-constant things, but will
9372 definitely yield an integral constant expression. Save and
9373 restore these values around our local parsing. */
9379 /* Consume the "__builtin_offsetof" token. */
9381 /* Consume the opening `('. */
9383 /* Parse the type-id. */
9386 /* Look for the `,'. */
9390 /* Build the (type *)null that begins the traditional offsetof macro. */
9392 tf_warning_or_error);
9394 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9398 {
9401 {
9403 /* offsetof-member-designator "[" expression "]" */
9409 /* offsetof-member-designator "->" identifier */
9412 /* FALLTHRU */
9415 /* offsetof-member-designator "." identifier */
9423 /* Consume the ")" token. */
9429 /* Error. We know the following require will fail, but
9430 that gives the proper error message. */
9435 }
9436 }
9438 success:
9439 /* Make a location of the form:
9440 __builtin_offsetof (struct s, f)
9441 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9442 with caret at the type-id, ranging from the start of the
9443 "_builtin_offsetof" token to the close paren. */
9445 /* The result will be an INTEGER_CST, so we need to explicitly
9446 preserve the location. */
9449 failure:
9454 }
9456 /* Parse a trait expression.
9458 Returns a representation of the expression, the underlying type
9459 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9461 static tree
9463 {
9464 cp_trait_kind kind;
9470 {
9558 }
9560 /* Consume the token. */
9565 {
9568 }
9574 {
9577 {
9580 }
9584 }
9586 {
9588 {
9592 {
9595 }
9599 }
9600 }
9604 /* Complete the trait expression, which may mean either processing
9605 the trait expr now or saving it for template instantiation. */
9607 {
9616 }
9617 }
9619 /* Lambdas that appear in variable initializer or default argument scope
9620 get that in their mangling, so we need to record it. We might as well
9621 use the count for function and namespace scopes as well. */
9625 {
9626 tree t;
9628 };
9631 static void
9633 {
9634 tree_int ti;
9636 /* Once we're inside a function, we ignore other scopes and just push
9637 the function again so that popping works properly. */
9644 {
9645 /* Don't reset the count if we're still in the same function. */
9648 }
9649 }
9651 static void
9653 {
9656 }
9658 static void
9660 {
9663 {
9666 }
9668 }
9670 /* Parse a lambda expression.
9672 lambda-expression:
9673 lambda-introducer lambda-declarator [opt] compound-statement
9675 Returns a representation of the expression. */
9677 static cp_expr
9679 {
9681 tree type;
9689 {
9691 {
9695 }
9697 }
9699 {
9701 {
9704 }
9706 }
9708 /* We may be in the middle of deferred access check. Disable
9709 it now. */
9720 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9723 /* Now that we've started the type, add the capture fields for any
9724 explicit captures. */
9727 {
9728 /* Inside the class, surrounding template-parameter-lists do not apply. */
9729 unsigned int saved_num_template_parameter_lists
9733 bool fully_implicit_function_template_p
9737 bool auto_is_implicit_function_template_parm_p
9748 /* By virtue of defining a local class, a lambda expression has access to
9749 the private variables of enclosing classes. */
9754 {
9760 }
9762 {
9765 }
9767 /* The capture list was built up in reverse order; fix that now. */
9779 parser->fully_implicit_function_template_p
9783 parser->auto_is_implicit_function_template_parm_p
9785 }
9787 /* This field is only used during parsing of the lambda. */
9790 /* This lambda shouldn't have any proxies left at this point. */
9792 /* And now that we're done, push proxies for an enclosing lambda. */
9797 else
9805 }
9807 /* Parse the beginning of a lambda expression.
9809 lambda-introducer:
9810 [ lambda-capture [opt] ]
9812 LAMBDA_EXPR is the current representation of the lambda expression. */
9814 static void
9816 {
9817 /* Need commas after the first capture. */
9820 /* Eat the leading `['. */
9823 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9831 {
9834 }
9837 {
9839 tree capture_id;
9840 tree capture_init_expr;
9844 enum capture_kind_type
9845 {
9846 BY_COPY,
9847 BY_REFERENCE
9848 };
9852 {
9855 }
9859 else
9862 /* Possibly capture `this'. */
9864 {
9874 explicit_init_p);
9876 }
9878 /* Remember whether we want to capture as a reference or not. */
9880 {
9883 }
9885 /* Get the identifier. */
9890 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9891 delimiters, but I modified this to stop on unnested ']' as well. It
9892 was already changed to stop on unnested '}', so the
9893 "closing_parenthesis" name is no more misleading with my change. */
9894 {
9900 }
9902 /* Find the initializer for this capture. */
9906 {
9908 /* An explicit initializer exists. */
9911 "lambda capture initializers "
9917 {
9920 }
9921 }
9922 else
9923 {
9926 /* Turn the identifier into an id-expression. */
9927 capture_init_expr
9932 {
9935 }
9939 {
9942 capture_init_expr);
9946 }
9949 {
9952 capture_init_expr))
9956 }
9958 capture_init_expr
9959 = finish_id_expression
9961 capture_init_expr,
9975 {
9978 }
9979 else
9981 }
9985 {
9990 capture_id);
9994 "capture of %qD redundant with by-reference capture "
9996 }
9999 capture_id,
10000 capture_init_expr,
10002 explicit_init_p);
10003 }
10006 }
10008 /* Parse the (optional) middle of a lambda expression.
10010 lambda-declarator:
10011 < template-parameter-list [opt] >
10012 ( parameter-declaration-clause [opt] )
10013 attribute-specifier [opt]
10014 mutable [opt]
10015 exception-specification [opt]
10016 lambda-return-type-clause [opt]
10018 LAMBDA_EXPR is the current representation of the lambda expression. */
10020 static bool
10022 {
10023 /* 5.1.1.4 of the standard says:
10024 If a lambda-expression does not include a lambda-declarator, it is as if
10025 the lambda-declarator were ().
10026 This means an empty parameter list, no attributes, and no exception
10027 specification. */
10034 /* The template-parameter-list is optional, but must begin with
10035 an opening angle if present. */
10037 {
10040 "lambda templates are only available with "
10049 /* We just processed one more parameter list. */
10051 }
10053 /* The parameter-declaration-clause is optional (unless
10054 template-parameter-list was given), but must begin with an
10055 opening parenthesis if present. */
10057 {
10062 /* Parse parameters. */
10065 /* Default arguments shall not be specified in the
10066 parameter-declaration-clause of a lambda-declarator. */
10076 /* Parse optional `mutable' keyword. */
10078 {
10081 }
10085 /* Parse optional exception specification. */
10088 /* Parse optional trailing return type. */
10090 {
10094 }
10096 /* The function parameters must be in scope all the way until after the
10097 trailing-return-type in case of decltype. */
10099 }
10103 /* Create the function call operator.
10105 Messing with declarators like this is no uglier than building up the
10106 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10107 other code. */
10108 {
10109 cp_decl_specifier_seq return_type_specs;
10111 tree fco;
10118 else
10119 /* Maybe we will deduce the return type later. */
10125 sfk_none);
10130 VIRT_SPEC_UNSPECIFIED,
10131 REF_QUAL_NONE,
10132 tx_qual,
10133 exception_spec,
10139 declarator,
10140 attributes);
10142 {
10145 /* Give the object parameter a different name. */
10149 }
10151 {
10155 }
10164 }
10165 }
10167 /* Parse the body of a lambda expression, which is simply
10169 compound-statement
10171 but which requires special handling.
10172 LAMBDA_EXPR is the current representation of the lambda expression. */
10174 static void
10176 {
10181 else
10182 /* Still increment function_depth so that we don't GC in the
10183 middle of an expression. */
10187 /* Clear this in case we're in the middle of a default argument. */
10190 /* Finish the function call operator
10191 - class_specifier
10192 + late_parsing_for_member
10193 + function_definition_after_declarator
10194 + ctor_initializer_opt_and_function_body */
10195 {
10197 tree body;
10199 tree compound_stmt;
10200 tree cap;
10202 /* Let the front end know that we are going to be defining this
10203 function. */
10205 NULL_TREE,
10214 /* Push the proxies for any explicit captures. */
10221 /* 5.1.1.4 of the standard says:
10222 If a lambda-expression does not include a trailing-return-type, it
10223 is as if the trailing-return-type denotes the following type:
10224 * if the compound-statement is of the form
10225 { return attribute-specifier [opt] expression ; }
10226 the type of the returned expression after lvalue-to-rvalue
10227 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10228 (_conv.array_ 4.2), and function-to-pointer conversion
10229 (_conv.func_ 4.3);
10230 * otherwise, void. */
10232 /* In a lambda that has neither a lambda-return-type-clause
10233 nor a deducible form, errors should be reported for return statements
10234 in the body. Since we used void as the placeholder return type, parsing
10235 the body as usual will give such desired behavior. */
10239 {
10243 /* Parse tentatively in case there's more after the initial return
10244 statement. */
10255 {
10257 {
10262 }
10264 /* Will get error here if type not deduced yet. */
10268 }
10269 }
10272 {
10277 }
10281 out:
10285 /* Finish the function and generate code for it if necessary. */
10288 /* Only expand if the call op is not a template. */
10291 }
10297 else
10299 }
10301 /* Statements [gram.stmt.stmt] */
10303 /* Parse a statement.
10305 statement:
10306 labeled-statement
10307 expression-statement
10308 compound-statement
10309 selection-statement
10310 iteration-statement
10311 jump-statement
10312 declaration-statement
10313 try-block
10315 C++11:
10317 statement:
10318 labeled-statement
10319 attribute-specifier-seq (opt) expression-statement
10320 attribute-specifier-seq (opt) compound-statement
10321 attribute-specifier-seq (opt) selection-statement
10322 attribute-specifier-seq (opt) iteration-statement
10323 attribute-specifier-seq (opt) jump-statement
10324 declaration-statement
10325 attribute-specifier-seq (opt) try-block
10327 TM Extension:
10329 statement:
10330 atomic-statement
10332 IN_COMPOUND is true when the statement is nested inside a
10333 cp_parser_compound_statement; this matters for certain pragmas.
10335 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10336 is a (possibly labeled) if statement which is not enclosed in braces
10337 and has an else clause. This is used to implement -Wparentheses.
10339 CHAIN is a vector of if-else-if conditions. */
10341 static void
10344 {
10349 restart:
10352 /* There is no statement yet. */
10358 /* In obj-c++, seeing '[[' might be the either the beginning of
10359 c++11 attributes, or a nested objc-message-expression. So
10360 let's parse the c++11 attributes tentatively. */
10364 {
10367 }
10369 /* Peek at the next token. */
10371 /* Remember the location of the first token in the statement. */
10373 /* If this is a keyword, then that will often determine what kind of
10374 statement we have. */
10376 {
10380 {
10383 /* Looks like a labeled-statement with a case label.
10384 Parse the label, and then use tail recursion to parse
10385 the statement. */
10403 {
10408 }
10409 else
10423 {
10428 }
10429 else
10430 {
10434 }
10438 /* Objective-C++ exception-handling constructs. */
10452 /* This must be a namespace alias definition. */
10468 /* It might be a keyword like `int' that can start a
10469 declaration-statement. */
10471 }
10472 }
10474 {
10475 /* If the next token is a `:', then we are looking at a
10476 labeled-statement. */
10479 {
10480 /* Looks like a labeled-statement with an ordinary label.
10481 Parse the label, and then use tail recursion to parse
10482 the statement. */
10487 }
10488 }
10489 /* Anything that starts with a `{' must be a compound-statement. */
10492 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10493 a statement all its own. */
10495 {
10496 /* Only certain OpenMP pragmas are attached to statements, and thus
10497 are considered statements themselves. All others are not. In
10498 the context of a compound, accept the pragma as a "statement" and
10499 return so that we can check for a close brace. Otherwise we
10500 require a real statement and must go back and read one. */
10506 }
10508 {
10511 }
10513 /* Everything else must be a declaration-statement or an
10514 expression-statement. Try for the declaration-statement
10515 first, unless we are looking at a `;', in which case we know that
10516 we have an expression-statement. */
10518 {
10520 {
10522 {
10523 /* Attributes should be parsed as part of the the
10524 declaration, so let's un-parse them. */
10527 }
10530 /* Try to parse the declaration-statement. */
10532 /* If that worked, we're done. */
10535 }
10536 /* Look for an expression-statement instead. */
10538 }
10540 /* Set the line number for the statement. */
10544 /* Note that for now, we don't do anything with c++11 statements
10545 parsed at this level. */
10548 OPT_Wattributes,
10550 }
10552 /* Parse the label for a labeled-statement, i.e.
10554 identifier :
10555 case constant-expression :
10556 default :
10558 GNU Extension:
10559 case constant-expression ... constant-expression : statement
10561 When a label is parsed without errors, the label is added to the
10562 parse tree by the finish_* functions, so this function doesn't
10563 have to return the label. */
10565 static void
10567 {
10572 /* The next token should be an identifier. */
10576 {
10579 }
10583 {
10585 {
10589 /* Consume the `case' token. */
10591 /* Parse the constant-expression. */
10598 {
10599 /* Consume the `...' token. */
10605 /* We don't need to emit warnings here, as the common code
10606 will do this for us. */
10607 }
10608 else
10613 else
10616 expr);
10617 }
10621 /* Consume the `default' token. */
10626 else
10631 /* Anything else must be an ordinary label. */
10634 }
10636 /* Require the `:' token. */
10639 /* An ordinary label may optionally be followed by attributes.
10640 However, this is only permitted if the attributes are then
10641 followed by a semicolon. This is because, for backward
10642 compatibility, when parsing
10643 lab: __attribute__ ((unused)) int i;
10644 we want the attribute to attach to "i", not "lab". */
10647 {
10648 tree attrs;
10655 ;
10656 else
10658 }
10664 }
10666 /* Parse an expression-statement.
10668 expression-statement:
10669 expression [opt] ;
10671 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10672 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10673 indicates whether this expression-statement is part of an
10674 expression statement. */
10676 static tree
10678 {
10682 /* If the next token is a ';', then there is no expression
10683 statement. */
10685 {
10689 {
10692 }
10693 }
10695 /* Give a helpful message for "A<T>::type t;" and the like. */
10698 {
10705 {
10706 /* A::A a; */
10711 }
10712 }
10714 /* Consume the final `;'. */
10719 /* This is the final expression statement of a statement
10720 expression. */
10726 }
10728 /* Parse a compound-statement.
10730 compound-statement:
10731 { statement-seq [opt] }
10733 GNU extension:
10735 compound-statement:
10736 { label-declaration-seq [opt] statement-seq [opt] }
10738 label-declaration-seq:
10739 label-declaration
10740 label-declaration-seq label-declaration
10742 Returns a tree representing the statement. */
10744 static tree
10747 {
10748 tree compound_stmt;
10750 /* Consume the `{'. */
10757 /* Begin the compound-statement. */
10759 /* If the next keyword is `__label__' we have a label declaration. */
10762 /* Parse an (optional) statement-seq. */
10764 /* Finish the compound-statement. */
10766 /* Consume the `}'. */
10770 }
10772 /* Parse an (optional) statement-seq.
10774 statement-seq:
10775 statement
10776 statement-seq [opt] statement */
10778 static void
10780 {
10781 /* Scan statements until there aren't any more. */
10783 {
10786 /* If we are looking at a `}', then we have run out of
10787 statements; the same is true if we have reached the end
10788 of file, or have stumbled upon a stray '@end'. */
10795 /* If we are in a compound statement and find 'else' then
10796 something went wrong. */
10798 {
10801 else
10802 {
10805 }
10806 }
10808 /* Parse the statement. */
10810 }
10811 }
10813 /* Parse a selection-statement.
10815 selection-statement:
10816 if ( condition ) statement
10817 if ( condition ) statement else statement
10818 switch ( condition ) statement
10820 Returns the new IF_STMT or SWITCH_STMT.
10822 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10823 is a (possibly labeled) if statement which is not enclosed in
10824 braces and has an else clause. This is used to implement
10825 -Wparentheses.
10827 CHAIN is a vector of if-else-if conditions. This is used to implement
10828 -Wduplicated-cond. */
10830 static tree
10833 {
10836 token_indent_info guard_tinfo;
10841 /* Peek at the next token. */
10845 /* See what kind of keyword it is. */
10848 {
10851 {
10852 tree statement;
10853 tree condition;
10855 /* Look for the `('. */
10857 {
10860 }
10862 /* Begin the selection-statement. */
10865 else
10868 /* Parse the condition. */
10870 /* Look for the `)'. */
10876 {
10880 /* Add the condition. */
10887 /* Parse the then-clause. */
10891 guard_tinfo);
10896 /* If the next token is `else', parse the else-clause. */
10898 RID_ELSE))
10899 {
10900 guard_tinfo
10902 /* Consume the `else' keyword. */
10905 {
10907 RID_IF)
10909 {
10910 /* We've got "if (COND) else if (COND2)". Start
10911 the condition chain and add COND as the first
10912 element. */
10916 {
10917 /* Wrap it in a NOP_EXPR so that we can set the
10918 location of the condition. */
10920 condition);
10923 }
10924 }
10926 RID_IF))
10927 {
10928 /* This is if-else without subsequent if. Zap the
10929 condition chain; we would have already warned at
10930 this point. */
10933 }
10934 }
10936 /* Parse the else-clause. */
10942 /* If we are currently parsing a then-clause, then
10943 IF_P will not be NULL. We set it to true to
10944 indicate that this if statement has an else clause.
10945 This may trigger the Wparentheses warning below
10946 when we get back up to the parent if statement. */
10949 }
10950 else
10951 {
10952 /* This if statement does not have an else clause. If
10953 NESTED_IF is true, then the then-clause has an if
10954 statement which does have an else clause. We warn
10955 about the potential ambiguity. */
10958 "suggest explicit braces to avoid ambiguous"
10961 {
10962 /* We don't need the condition chain anymore. */
10965 }
10966 }
10968 /* Now we're all done with the if-statement. */
10970 }
10971 else
10972 {
10976 /* Add the condition. */
10979 /* Parse the body of the switch-statement. */
10985 guard_tinfo);
10989 /* Now we're all done with the switch-statement. */
10991 }
10994 }
11000 }
11001 }
11003 /* Parse a condition.
11005 condition:
11006 expression
11007 type-specifier-seq declarator = initializer-clause
11008 type-specifier-seq declarator braced-init-list
11010 GNU Extension:
11012 condition:
11013 type-specifier-seq declarator asm-specification [opt]
11014 attributes [opt] = assignment-expression
11016 Returns the expression that should be tested. */
11018 static tree
11020 {
11021 cp_decl_specifier_seq type_specifiers;
11025 /* Try the declaration first. */
11027 /* New types are not allowed in the type-specifier-seq for a
11028 condition. */
11030 parser->type_definition_forbidden_message
11032 /* Parse the type-specifier-seq. */
11034 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11037 /* Restore the saved message. */
11039 /* If all is well, we might be looking at a declaration. */
11041 {
11042 tree decl;
11043 tree asm_specification;
11044 tree attributes;
11048 /* Parse the declarator. */
11054 /* Parse the attributes. */
11056 /* Parse the asm-specification. */
11058 /* If the next token is not an `=' or '{', then we might still be
11059 looking at an expression. For example:
11061 if (A(a).x)
11063 looks like a decl-specifier-seq and a declarator -- but then
11064 there is no `=', so this is an expression. */
11069 /* If we did see an `=' or '{', then we are looking at a declaration
11070 for sure. */
11072 {
11073 tree pushed_scope;
11077 /* Create the declaration. */
11083 /* Parse the initializer. */
11085 {
11089 }
11090 else
11091 {
11092 /* Consume the `='. */
11095 }
11099 /* Process the initializer. */
11102 asm_specification,
11103 flags);
11109 }
11110 }
11111 /* If we didn't even get past the declarator successfully, we are
11112 definitely not looking at a declaration. */
11113 else
11116 /* Otherwise, we are looking at an expression. */
11118 }
11120 /* Parses a for-statement or range-for-statement until the closing ')',
11121 not included. */
11123 static tree
11125 {
11129 /* Begin the for-statement. */
11132 /* Parse the initialization. */
11137 else
11139 }
11141 static tree
11143 {
11144 /* Normal for loop */
11147 tree stmt;
11150 /* The for-init-statement has already been parsed in
11151 cp_parser_for_init_statement, so no work is needed here. */
11154 /* If there's a condition, process it. */
11158 {
11162 }
11164 /* Look for the `;'. */
11167 /* If there's an expression, process it. */
11173 }
11175 /* Tries to parse a range-based for-statement:
11177 range-based-for:
11178 decl-specifier-seq declarator : expression
11180 The decl-specifier-seq declarator and the `:' are already parsed by
11181 cp_parser_for_init_statement. If processing_template_decl it returns a
11182 newly created RANGE_FOR_STMT; if not, it is converted to a
11183 regular FOR_STMT. */
11185 static tree
11188 {
11191 /* Get the range declaration momentarily out of the way so that
11192 the range expression doesn't clash with it. */
11197 {
11200 }
11201 else
11204 /* Put the range declaration back into scope. */
11208 /* If in template, STMT is converted to a normal for-statement
11209 at instantiation. If not, it is done just ahead. */
11211 {
11219 /* do_auto_deduction doesn't mess with template init-lists. */
11222 }
11223 else
11224 {
11227 }
11229 }
11231 /* Subroutine of cp_convert_range_for: given the initializer expression,
11232 builds up the range temporary. */
11234 static tree
11236 {
11239 /* Find out the type deduced by the declaration
11240 `auto &&__range = range_expr'. */
11245 /* Create the __range variable. */
11252 }
11254 /* Used by cp_parser_range_for in template context: we aren't going to
11255 do a full conversion yet, but we still need to resolve auto in the
11256 type of the for-range-declaration if present. This is basically
11257 a shortcut version of cp_convert_range_for. */
11259 static void
11261 {
11264 {
11267 iter_type = (cp_parser_perform_range_for_lookup
11270 {
11272 iter_type);
11274 tf_warning_or_error);
11277 }
11278 }
11279 }
11281 /* Converts a range-based for-statement into a normal
11282 for-statement, as per the definition.
11284 for (RANGE_DECL : RANGE_EXPR)
11285 BLOCK
11287 should be equivalent to:
11289 {
11290 auto &&__range = RANGE_EXPR;
11291 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11292 __begin != __end;
11293 ++__begin)
11294 {
11295 RANGE_DECL = *__begin;
11296 BLOCK
11297 }
11298 }
11300 If RANGE_EXPR is an array:
11301 BEGIN_EXPR = __range
11302 END_EXPR = __range + ARRAY_SIZE(__range)
11303 Else if RANGE_EXPR has a member 'begin' or 'end':
11304 BEGIN_EXPR = __range.begin()
11305 END_EXPR = __range.end()
11306 Else:
11307 BEGIN_EXPR = begin(__range)
11308 END_EXPR = end(__range);
11310 If __range has a member 'begin' but not 'end', or vice versa, we must
11311 still use the second alternative (it will surely fail, however).
11312 When calling begin()/end() in the third alternative we must use
11313 argument dependent lookup, but always considering 'std' as an associated
11314 namespace. */
11316 tree
11319 {
11325 /* If an error happened previously do nothing or else a lot of
11326 unhelpful errors would be issued. */
11328 else
11329 {
11330 tree range_temp;
11334 /* Can't bind a reference to an array of runtime bound. */
11336 else
11337 {
11342 LOOKUP_ONLYCONVERTING);
11344 }
11347 }
11349 /* The new for initialization statement. */
11357 LOOKUP_ONLYCONVERTING);
11368 LOOKUP_ONLYCONVERTING);
11372 /* The new for condition. */
11379 /* The new increment expression. */
11382 tf_warning_or_error);
11385 /* The declaration is initialized with *__begin inside the loop body. */
11388 tf_warning_or_error),
11390 LOOKUP_ONLYCONVERTING);
11393 }
11395 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11396 We need to solve both at the same time because the method used
11397 depends on the existence of members begin or end.
11398 Returns the type deduced for the iterator expression. */
11400 static tree
11402 {
11404 {
11407 }
11410 {
11415 }
11417 {
11418 /* If RANGE is an array, we will use pointer arithmetic. */
11421 range,
11425 }
11426 else
11427 {
11428 /* If it is not an array, we must do a bit of magic. */
11438 tf_warning_or_error);
11441 tf_warning_or_error);
11444 {
11445 /* Use the member functions. */
11448 else
11454 else
11457 }
11458 else
11459 {
11460 /* Use global functions with ADL. */
11467 tf_warning_or_error);
11469 tf_warning_or_error);
11471 tf_warning_or_error);
11473 tf_warning_or_error);
11476 }
11478 /* Last common checks. */
11480 {
11481 /* If one of the expressions is an error do no more checks. */
11484 }
11487 /* Can happen, when, eg, in a template context, Koenig lookup
11488 can't resolve begin/end (c++/58503). */
11490 else
11491 {
11493 /* The unqualified type of the __begin and __end temporaries should
11494 be the same, as required by the multiple auto declaration. */
11496 {
11503 /* P0184R0 allows __begin and __end to have different types,
11504 but make sure they are comparable so we can give a better
11506 else
11510 }
11512 }
11513 }
11514 }
11516 /* Helper function for cp_parser_perform_range_for_lookup.
11517 Builds a tree for RANGE.IDENTIFIER(). */
11519 static tree
11521 {
11534 tf_warning_or_error);
11537 }
11539 /* Parse an iteration-statement.
11541 iteration-statement:
11542 while ( condition ) statement
11543 do statement while ( expression ) ;
11544 for ( for-init-statement condition [opt] ; expression [opt] )
11545 statement
11547 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11549 static tree
11551 {
11554 tree statement;
11556 token_indent_info guard_tinfo;
11558 /* Peek at the next token. */
11565 /* Remember whether or not we are already within an iteration
11566 statement. */
11569 /* See what kind of keyword it is. */
11572 {
11574 {
11575 tree condition;
11577 /* Begin the while-statement. */
11579 /* Look for the `('. */
11581 /* Parse the condition. */
11584 /* Look for the `)'. */
11586 /* Parse the dependent statement. */
11590 /* We're done with the while-statement. */
11592 }
11596 {
11597 tree expression;
11599 /* Begin the do-statement. */
11601 /* Parse the body of the do-statement. */
11606 /* Look for the `while' keyword. */
11608 /* Look for the `('. */
11610 /* Parse the expression. */
11612 /* We're done with the do-statement. */
11614 /* Look for the `)'. */
11616 /* Look for the `;'. */
11618 }
11622 {
11623 /* Look for the `('. */
11628 /* Look for the `)'. */
11631 /* Parse the body of the for-statement. */
11636 /* We're done with the for-statement. */
11638 }
11645 }
11648 }
11650 /* Parse a for-init-statement or the declarator of a range-based-for.
11651 Returns true if a range-based-for declaration is seen.
11653 for-init-statement:
11654 expression-statement
11655 simple-declaration */
11657 static bool
11659 {
11660 /* If the next token is a `;', then we have an empty
11661 expression-statement. Grammatically, this is also a
11662 simple-declaration, but an invalid one, because it does not
11663 declare anything. Therefore, if we did not handle this case
11664 specially, we would issue an error message about an invalid
11665 declaration. */
11667 {
11671 /* A colon is used in range-based for. */
11674 /* We're going to speculatively look for a declaration, falling back
11675 to an expression, if necessary. */
11677 /* Parse the declaration. */
11680 decl);
11683 {
11684 /* It is a range-for, consume the ':' */
11688 {
11690 "range-based %<for%> loops only available with "
11693 }
11694 }
11695 else
11696 /* The ';' is not consumed yet because we told
11697 cp_parser_simple_declaration not to. */
11702 /* If the tentative parse failed, then we shall need to look for an
11703 expression-statement. */
11704 }
11705 /* If we are here, it is an expression-statement. */
11708 }
11710 /* Parse a jump-statement.
11712 jump-statement:
11713 break ;
11714 continue ;
11715 return expression [opt] ;
11716 return braced-init-list ;
11717 goto identifier ;
11719 GNU extension:
11721 jump-statement:
11722 goto * expression ;
11724 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11726 static tree
11728 {
11734 /* Peek at the next token. */
11739 /* See what kind of keyword it is. */
11742 {
11746 {
11766 }
11772 {
11779 /* Fall through. */
11789 }
11794 {
11795 tree expr;
11799 {
11803 }
11806 else
11807 /* If the next token is a `;', then there is no
11808 expression. */
11810 /* Build the return-statement. */
11812 /* Look for the final `;'. */
11814 }
11820 {
11823 }
11825 /* Create the goto-statement. */
11827 {
11828 /* Issue a warning about this use of a GNU extension. */
11830 /* Consume the '*' token. */
11832 /* Parse the dependent expression. */
11834 }
11835 else
11837 /* Look for the final `;'. */
11844 }
11847 }
11849 /* Parse a declaration-statement.
11851 declaration-statement:
11852 block-declaration */
11854 static void
11856 {
11859 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11862 /* Parse the block-declaration. */
11865 /* Free any declarators allocated. */
11867 }
11869 /* Some dependent statements (like `if (cond) statement'), are
11870 implicitly in their own scope. In other words, if the statement is
11871 a single statement (as opposed to a compound-statement), it is
11872 none-the-less treated as if it were enclosed in braces. Any
11873 declarations appearing in the dependent statement are out of scope
11874 after control passes that point. This function parses a statement,
11875 but ensures that is in its own scope, even if it is not a
11876 compound-statement.
11878 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11879 is a (possibly labeled) if statement which is not enclosed in
11880 braces and has an else clause. This is used to implement
11881 -Wparentheses.
11883 CHAIN is a vector of if-else-if conditions. This is used to implement
11884 -Wduplicated-cond.
11886 Returns the new statement. */
11888 static tree
11892 {
11893 tree statement;
11895 token_indent_info body_tinfo
11901 /* Mark if () ; with a special NOP_EXPR. */
11903 {
11914 }
11915 /* if a compound is opened, we simply parse the statement directly. */
11918 /* If the token is not a `{', then we must take special action. */
11919 else
11920 {
11921 /* Create a compound-statement. */
11923 /* Parse the dependent-statement. */
11925 /* Finish the dummy compound-statement. */
11927 }
11929 token_indent_info next_tinfo
11933 /* Return the statement. */
11935 }
11937 /* For some dependent statements (like `while (cond) statement'), we
11938 have already created a scope. Therefore, even if the dependent
11939 statement is a compound-statement, we do not want to create another
11940 scope. */
11942 static void
11945 {
11946 /* If the token is a `{', then we must take special action. */
11948 {
11949 token_indent_info body_tinfo
11953 token_indent_info next_tinfo
11956 }
11957 else
11958 {
11959 /* Avoid calling cp_parser_compound_statement, so that we
11960 don't create a new scope. Do everything else by hand. */
11962 /* If the next keyword is `__label__' we have a label declaration. */
11965 /* Parse an (optional) statement-seq. */
11968 }
11969 }
11971 /* Declarations [gram.dcl.dcl] */
11973 /* Parse an optional declaration-sequence.
11975 declaration-seq:
11976 declaration
11977 declaration-seq declaration */
11979 static void
11981 {
11983 {
11994 {
11995 /* A declaration consisting of a single semicolon is
11996 invalid. Allow it unless we're being pedantic. */
12001 }
12003 /* If we're entering or exiting a region that's implicitly
12004 extern "C", modify the lang context appropriately. */
12006 {
12009 }
12011 {
12014 }
12017 {
12018 /* A top-level declaration can consist solely of a #pragma.
12019 A nested declaration cannot, so this is done here and not
12020 in cp_parser_declaration. (A #pragma at block scope is
12021 handled in cp_parser_statement.) */
12024 }
12026 /* Parse the declaration itself. */
12028 }
12029 }
12031 /* Parse a declaration.
12033 declaration:
12034 block-declaration
12035 function-definition
12036 template-declaration
12037 explicit-instantiation
12038 explicit-specialization
12039 linkage-specification
12040 namespace-definition
12042 GNU extension:
12044 declaration:
12045 __extension__ declaration */
12047 static void
12049 {
12050 cp_token token1;
12051 cp_token token2;
12056 /* Check for the `__extension__' keyword. */
12058 {
12059 /* Parse the qualified declaration. */
12061 /* Restore the PEDANTIC flag. */
12065 }
12067 /* Try to figure out what kind of declaration is present. */
12072 else
12073 {
12076 }
12078 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12081 /* If the next token is `extern' and the following token is a string
12082 literal, then we have a linkage specification. */
12086 /* If the next token is `template', then we have either a template
12087 declaration, an explicit instantiation, or an explicit
12088 specialization. */
12090 {
12091 /* `template <>' indicates a template specialization. */
12095 /* `template <' indicates a template declaration. */
12098 /* Anything else must be an explicit instantiation. */
12099 else
12101 }
12102 /* If the next token is `export', then we have a template
12103 declaration. */
12106 /* If the next token is `extern', 'static' or 'inline' and the one
12107 after that is `template', we have a GNU extended explicit
12108 instantiation directive. */
12115 /* If the next token is `namespace', check for a named or unnamed
12116 namespace definition. */
12125 /* An unnamed namespace definition. */
12129 /* An inline (associated) namespace definition. */
12133 /* Objective-C++ declaration/definition. */
12140 /* At this point we may have a template declared by a concept
12141 introduction. */
12146 else
12147 /* Try to parse a block-declaration, or a function-definition. */
12150 /* Free any declarators allocated. */
12152 }
12154 /* Parse a block-declaration.
12156 block-declaration:
12157 simple-declaration
12158 asm-definition
12159 namespace-alias-definition
12160 using-declaration
12161 using-directive
12163 GNU Extension:
12165 block-declaration:
12166 __extension__ block-declaration
12168 C++0x Extension:
12170 block-declaration:
12171 static_assert-declaration
12173 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12174 part of a declaration-statement. */
12176 static void
12179 {
12183 /* Check for the `__extension__' keyword. */
12185 {
12186 /* Parse the qualified declaration. */
12188 /* Restore the PEDANTIC flag. */
12192 }
12194 /* Peek at the next token to figure out which kind of declaration is
12195 present. */
12198 /* If the next keyword is `asm', we have an asm-definition. */
12200 {
12204 }
12205 /* If the next keyword is `namespace', we have a
12206 namespace-alias-definition. */
12209 /* If the next keyword is `using', we have a
12210 using-declaration, a using-directive, or an alias-declaration. */
12212 {
12217 /* If the token after `using' is `namespace', then we have a
12218 using-directive. */
12222 /* If the second token after 'using' is '=', then we have an
12223 alias-declaration. */
12229 /* Otherwise, it's a using-declaration. */
12230 else
12233 }
12234 /* If the next keyword is `__label__' we have a misplaced label
12235 declaration. */
12237 {
12241 /* If the next token is now a `;', consume it. */
12244 }
12245 /* If the next token is `static_assert' we have a static assertion. */
12248 /* Anything else must be a simple-declaration. */
12249 else
12252 }
12254 /* Parse a simple-declaration.
12256 simple-declaration:
12257 decl-specifier-seq [opt] init-declarator-list [opt] ;
12259 init-declarator-list:
12260 init-declarator
12261 init-declarator-list , init-declarator
12263 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12264 function-definition as a simple-declaration.
12266 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12267 parsed declaration if it is an uninitialized single declarator not followed
12268 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12269 if present, will not be consumed. */
12271 static void
12275 {
12276 cp_decl_specifier_seq decl_specifiers;
12285 /* Defer access checks until we know what is being declared; the
12286 checks for names appearing in the decl-specifier-seq should be
12287 done as if we were in the scope of the thing being declared. */
12290 /* Parse the decl-specifier-seq. We have to keep track of whether
12291 or not the decl-specifier-seq declares a named class or
12292 enumeration type, since that is the only case in which the
12293 init-declarator-list is allowed to be empty.
12295 [dcl.dcl]
12297 In a simple-declaration, the optional init-declarator-list can be
12298 omitted only when declaring a class or enumeration, that is when
12299 the decl-specifier-seq contains either a class-specifier, an
12300 elaborated-type-specifier, or an enum-specifier. */
12302 CP_PARSER_FLAGS_OPTIONAL,
12305 /* We no longer need to defer access checks. */
12308 /* In a block scope, a valid declaration must always have a
12309 decl-specifier-seq. By not trying to parse declarators, we can
12310 resolve the declaration/expression ambiguity more quickly. */
12313 {
12316 }
12318 /* If the next two tokens are both identifiers, the code is
12319 erroneous. The usual cause of this situation is code like:
12321 T t;
12323 where "T" should name a type -- but does not. */
12326 {
12327 /* If parsing tentatively, we should commit; we really are
12328 looking at a declaration. */
12330 /* Give up. */
12332 }
12334 /* If we have seen at least one decl-specifier, and the next token
12335 is not a parenthesis, then we must be looking at a declaration.
12336 (After "int (" we might be looking at a functional cast.) */
12343 tree last_type;
12347 /* Keep going until we hit the `;' at the end of the simple
12348 declaration. */
12351 CPP_SEMICOLON))
12352 {
12355 tree decl;
12359 {
12360 /* If we are processing next declarator, comma is expected */
12365 {
12369 }
12370 }
12371 else
12374 /* Parse the init-declarator. */
12377 function_definition_allowed_p,
12379 declares_class_or_enum,
12381 maybe_range_for_decl,
12384 /* If an error occurred while parsing tentatively, exit quickly.
12385 (That usually happens when in the body of a function; each
12386 statement is treated as a declaration-statement until proven
12387 otherwise.) */
12392 {
12395 {
12396 /* If the list of declarators contains more than one declarator,
12397 the type of each declared variable is determined as described
12398 above. If the type deduced for the template parameter U is not
12399 the same in each deduction, the program is ill-formed. */
12404 }
12405 else
12407 }
12409 /* Handle function definitions specially. */
12411 {
12412 /* If the next token is a `,', then we are probably
12413 processing something like:
12415 void f() {}, *p;
12417 which is erroneous. */
12419 {
12422 "mixing"
12424 }
12425 /* Otherwise, we're done with the list of declarators. */
12426 else
12427 {
12430 }
12431 }
12434 /* The next token should be either a `,' or a `;'. */
12436 /* If it's a `,', there are more declarators to come. */
12439 /* If it's a `;', we are done. */
12442 /* Anything else is an error. */
12443 else
12444 {
12445 /* If we have already issued an error message we don't need
12446 to issue another one. */
12451 /* Skip tokens until we reach the end of the statement. */
12453 /* If the next token is now a `;', consume it. */
12457 }
12458 /* After the first time around, a function-definition is not
12459 allowed -- even if it was OK at first. For example:
12461 int i, f() {}
12463 is not valid. */
12465 }
12467 /* Issue an error message if no declarators are present, and the
12468 decl-specifier-seq does not itself declare a class or
12469 enumeration: [dcl.dcl]/3. */
12471 {
12473 {
12477 /* Ensure an error is issued anyway when finish_decltype_type,
12478 called via cp_parser_decl_specifier_seq, returns a class or
12479 an enumeration (c++/51786). */
12482 }
12483 /* Perform any deferred access checks. */
12485 }
12487 /* Consume the `;'. */
12491 {
12497 }
12499 done:
12501 }
12503 /* Parse a decl-specifier-seq.
12505 decl-specifier-seq:
12506 decl-specifier-seq [opt] decl-specifier
12507 decl-specifier attribute-specifier-seq [opt] (C++11)
12509 decl-specifier:
12510 storage-class-specifier
12511 type-specifier
12512 function-specifier
12513 friend
12514 typedef
12516 GNU Extension:
12518 decl-specifier:
12519 attributes
12521 Concepts Extension:
12523 decl-specifier:
12524 concept
12526 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12528 The parser flags FLAGS is used to control type-specifier parsing.
12530 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12531 flags:
12533 1: one of the decl-specifiers is an elaborated-type-specifier
12534 (i.e., a type declaration)
12535 2: one of the decl-specifiers is an enum-specifier or a
12536 class-specifier (i.e., a type definition)
12538 */
12540 static void
12542 cp_parser_flags flags,
12545 {
12549 cp_decl_spec ds;
12551 /* Clear DECL_SPECS. */
12554 /* Assume no class or enumeration type is declared. */
12557 /* Keep reading specifiers until there are no more to read. */
12559 {
12564 /* Peek at the next token. */
12567 /* Save the first token of the decl spec list for error
12568 reporting. */
12571 /* Handle attributes. */
12573 {
12574 /* Parse the attributes. */
12577 /* In a sequence of declaration specifiers, c++11 attributes
12578 appertain to the type that precede them. In that case
12579 [dcl.spec]/1 says:
12581 The attribute-specifier-seq affects the type only for
12582 the declaration it appears in, not other declarations
12583 involving the same type.
12585 But for now let's force the user to position the
12586 attribute either at the beginning of the declaration or
12587 after the declarator-id, which would clearly mean that it
12588 applies to the declarator. */
12590 {
12592 /* The c++11 attribute is at the beginning of the
12593 declaration. It appertains to the entity being
12595 else
12596 {
12598 {
12599 /* This is an attribute following a
12600 class-specifier. */
12605 }
12606 else
12607 {
12608 decl_specs->std_attributes
12610 attrs);
12613 }
12615 }
12616 }
12618 decl_specs->attributes
12620 attrs);
12624 }
12625 /* Assume we will find a decl-specifier keyword. */
12627 /* If the next token is an appropriate keyword, we can simply
12628 add it to the list. */
12630 {
12631 /* decl-specifier:
12632 friend
12633 constexpr */
12636 {
12639 }
12640 else
12641 {
12643 /* Consume the token. */
12645 }
12658 /* function-specifier:
12659 inline
12660 virtual
12661 explicit */
12668 /* decl-specifier:
12669 typedef */
12672 /* Consume the token. */
12674 /* A constructor declarator cannot appear in a typedef. */
12676 /* The "typedef" keyword can only occur in a declaration; we
12677 may as well commit at this point. */
12684 /* storage-class-specifier:
12685 auto
12686 register
12687 static
12688 extern
12689 mutable
12691 GNU Extension:
12692 thread */
12695 {
12696 /* Consume the token. */
12699 /* Complain about `auto' as a storage specifier, if
12700 we're complaining about C++0x compatibility. */
12704 /* Set the storage class anyway. */
12706 token);
12707 }
12708 else
12709 /* C++0x auto type-specifier. */
12717 /* Consume the token. */
12720 token);
12723 /* Consume the token. */
12729 /* We did not yet find a decl-specifier yet. */
12732 }
12742 /* Constructors are a special case. The `S' in `S()' is not a
12743 decl-specifier; it is the beginning of the declarator. */
12744 constructor_p
12745 = (!found_decl_spec
12746 && constructor_possible_p
12747 && (cp_parser_constructor_declarator_p
12750 /* If we don't have a DECL_SPEC yet, then we must be looking at
12751 a type-specifier. */
12753 {
12756 tree type_spec;
12758 type_spec
12760 decl_specs,
12766 /* If this type-specifier referenced a user-defined type
12767 (a typedef, class-name, etc.), then we can't allow any
12768 more such type-specifiers henceforth.
12770 [dcl.spec]
12772 The longest sequence of decl-specifiers that could
12773 possibly be a type name is taken as the
12774 decl-specifier-seq of a declaration. The sequence shall
12775 be self-consistent as described below.
12777 [dcl.type]
12779 As a general rule, at most one type-specifier is allowed
12780 in the complete decl-specifier-seq of a declaration. The
12781 only exceptions are the following:
12783 -- const or volatile can be combined with any other
12784 type-specifier.
12786 -- signed or unsigned can be combined with char, long,
12787 short, or int.
12789 -- ..
12791 Example:
12793 typedef char* Pc;
12794 void g (const int Pc);
12796 Here, Pc is *not* part of the decl-specifier seq; it's
12797 the declarator. Therefore, once we see a type-specifier
12798 (other than a cv-qualifier), we forbid any additional
12799 user-defined types. We *do* still allow things like `int
12800 int' to be considered a decl-specifier-seq, and issue the
12801 error message later. */
12804 /* A constructor declarator cannot follow a type-specifier. */
12806 {
12811 }
12812 }
12814 /* If we still do not have a DECL_SPEC, then there are no more
12815 decl-specifiers. */
12820 /* After we see one decl-specifier, further decl-specifiers are
12821 always optional. */
12823 }
12825 /* Don't allow a friend specifier with a class definition. */
12830 }
12832 /* Parse an (optional) storage-class-specifier.
12834 storage-class-specifier:
12835 auto
12836 register
12837 static
12838 extern
12839 mutable
12841 GNU Extension:
12843 storage-class-specifier:
12844 thread
12846 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12848 static tree
12850 {
12852 {
12856 /* Fall through for C++98. */
12863 /* Consume the token. */
12868 }
12869 }
12871 /* Parse an (optional) function-specifier.
12873 function-specifier:
12874 inline
12875 virtual
12876 explicit
12878 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12879 Updates DECL_SPECS, if it is non-NULL. */
12881 static tree
12884 {
12887 {
12893 /* 14.5.2.3 [temp.mem]
12895 A member function template shall not be virtual. */
12899 else
12909 }
12911 /* Consume the token. */
12913 }
12915 /* Parse a linkage-specification.
12917 linkage-specification:
12918 extern string-literal { declaration-seq [opt] }
12919 extern string-literal declaration */
12921 static void
12923 {
12924 tree linkage;
12926 /* Look for the `extern' keyword. */
12929 /* Look for the string-literal. */
12932 /* Transform the literal into an identifier. If the literal is a
12933 wide-character string, or contains embedded NULs, then we can't
12934 handle it as the user wants. */
12937 {
12939 /* Assume C++ linkage. */
12941 }
12942 else
12945 /* We're now using the new linkage. */
12948 /* If the next token is a `{', then we're using the first
12949 production. */
12951 {
12955 /* Consume the `{' token. */
12957 /* Parse the declarations. */
12959 /* Look for the closing `}'. */
12961 }
12962 /* Otherwise, there's just one declaration. */
12963 else
12964 {
12967 saved_in_unbraced_linkage_specification_p
12971 parser->in_unbraced_linkage_specification_p
12973 }
12975 /* We're done with the linkage-specification. */
12977 }
12979 /* Parse a static_assert-declaration.
12981 static_assert-declaration:
12982 static_assert ( constant-expression , string-literal ) ;
12983 static_assert ( constant-expression ) ; (C++1Z)
12985 If MEMBER_P, this static_assert is a class member. */
12987 static void
12989 {
12990 tree condition;
12991 tree message;
12993 location_t saved_loc;
12996 /* Peek at the `static_assert' token so we can keep track of exactly
12997 where the static assertion started. */
13001 /* Look for the `static_assert' keyword. */
13003 RT_STATIC_ASSERT))
13006 /* We know we are in a static assertion; commit to any tentative
13007 parse. */
13011 /* Parse the `(' starting the static assertion condition. */
13014 /* Parse the constant-expression. Allow a non-constant expression
13015 here in order to give better diagnostics in finish_static_assert. */
13016 condition =
13022 {
13025 "static_assert without a message "
13027 /* Eat the ')' */
13032 }
13033 else
13034 {
13035 /* Parse the separating `,'. */
13038 /* Parse the string-literal message. */
13043 /* A `)' completes the static assertion. */
13049 }
13051 /* A semicolon terminates the declaration. */
13054 /* Complete the static assertion, which may mean either processing
13055 the static assert now or saving it for template instantiation. */
13057 }
13059 /* Parse the expression in decltype ( expression ). */
13061 static tree
13064 {
13066 tree expr;
13068 /* Since we're going to preserve any side-effects from this parse, set up a
13069 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13070 in the expression. */
13073 /* First, try parsing an id-expression. */
13084 {
13087 cp_id_kind idk;
13091 /* Lookup the name we got back from the id-expression. */
13101 {
13102 /* Complete lookup of the id-expression. */
13103 expr = (finish_id_expression
13116 /* We found an id-expression, but it was something that we
13117 should not have found. This is an error, not something
13118 we can recover from, so note that we found an
13119 id-expression and we'll recover as gracefully as
13120 possible. */
13122 }
13127 /* We have an id-expression. */
13129 }
13132 {
13133 /* Abort the id-expression parse. */
13136 /* Parsing tentatively, again. */
13139 /* Parse a class member access. */
13147 /* We have an id-expression. */
13149 }
13152 /* We have parsed the complete id-expression or member access. */
13154 else
13155 {
13156 /* Abort our attempt to parse an id-expression or member access
13157 expression. */
13160 /* Parse a full expression. */
13163 }
13166 }
13168 /* Parse a `decltype' type. Returns the type.
13170 simple-type-specifier:
13171 decltype ( expression )
13172 C++14 proposal:
13173 decltype ( auto ) */
13175 static tree
13177 {
13178 tree expr;
13187 {
13188 /* Already parsed. */
13191 }
13193 /* Look for the `decltype' token. */
13197 /* Parse the opening `('. */
13201 /* decltype (auto) */
13204 {
13211 }
13213 /* Types cannot be defined in a `decltype' expression. Save away the
13214 old message. */
13217 /* And create the new one. */
13218 parser->type_definition_forbidden_message
13221 /* The restrictions on constant-expressions do not apply inside
13222 decltype expressions. */
13223 saved_integral_constant_expression_p
13225 saved_non_integral_constant_expression_p
13229 /* Within a parenthesized expression, a `>' token is always
13230 the greater-than operator. */
13231 saved_greater_than_is_operator_p
13235 /* Do not actually evaluate the expression. */
13238 /* Do not warn about problems with the expression. */
13243 /* Go back to evaluating expressions. */
13247 /* The `>' token might be the end of a template-id or
13248 template-parameter-list now. */
13249 parser->greater_than_is_operator_p
13252 /* Restore the old message and the integral constant expression
13253 flags. */
13255 parser->integral_constant_expression_p
13257 parser->non_integral_constant_expression_p
13260 /* Parse to the closing `)'. */
13262 {
13266 }
13269 tf_warning_or_error);
13271 rewrite:
13272 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13273 it again. */
13282 }
13284 /* Special member functions [gram.special] */
13286 /* Parse a conversion-function-id.
13288 conversion-function-id:
13289 operator conversion-type-id
13291 Returns an IDENTIFIER_NODE representing the operator. */
13293 static tree
13295 {
13296 tree type;
13297 tree saved_scope;
13298 tree saved_qualifying_scope;
13299 tree saved_object_scope;
13302 /* Look for the `operator' token. */
13305 /* When we parse the conversion-type-id, the current scope will be
13306 reset. However, we need that information in able to look up the
13307 conversion function later, so we save it here. */
13311 /* We must enter the scope of the class so that the names of
13312 entities declared within the class are available in the
13313 conversion-type-id. For example, consider:
13315 struct S {
13316 typedef int I;
13317 operator I();
13318 };
13320 S::operator I() { ... }
13322 In order to see that `I' is a type-name in the definition, we
13323 must be in the scope of `S'. */
13326 /* Parse the conversion-type-id. */
13328 /* Leave the scope of the class, if any. */
13331 /* Restore the saved scope. */
13335 /* If the TYPE is invalid, indicate failure. */
13339 }
13341 /* Parse a conversion-type-id:
13343 conversion-type-id:
13344 type-specifier-seq conversion-declarator [opt]
13346 Returns the TYPE specified. */
13348 static tree
13350 {
13351 tree attributes;
13352 cp_decl_specifier_seq type_specifiers;
13354 tree type_specified;
13357 /* Parse the attributes. */
13361 parser->type_definition_forbidden_message
13364 /* Parse the type-specifiers. */
13371 /* If that didn't work, stop. */
13374 /* Parse the conversion-declarator. */
13382 /* Don't give this error when parsing tentatively. This happens to
13383 work because we always parse this definitively once. */
13386 {
13388 {
13391 }
13395 }
13398 }
13400 /* Parse an (optional) conversion-declarator.
13402 conversion-declarator:
13403 ptr-operator conversion-declarator [opt]
13405 */
13409 {
13412 cp_cv_quals cv_quals;
13414 /* We don't know if there's a ptr-operator next, or not. */
13416 /* Try the ptr-operator. */
13419 /* If it worked, look for more conversion-declarators. */
13421 {
13424 /* Parse another optional declarator. */
13427 declarator = cp_parser_make_indirect_declarator
13431 }
13434 }
13436 /* Parse an (optional) ctor-initializer.
13438 ctor-initializer:
13439 : mem-initializer-list
13441 Returns TRUE iff the ctor-initializer was actually present. */
13443 static bool
13445 {
13446 /* If the next token is not a `:', then there is no
13447 ctor-initializer. */
13449 {
13450 /* Do default initialization of any bases and members. */
13455 }
13457 /* Consume the `:' token. */
13459 /* And the mem-initializer-list. */
13463 }
13465 /* Parse a mem-initializer-list.
13467 mem-initializer-list:
13468 mem-initializer ... [opt]
13469 mem-initializer ... [opt] , mem-initializer-list */
13471 static void
13473 {
13478 /* Let the semantic analysis code know that we are starting the
13479 mem-initializer-list. */
13484 /* Loop through the list. */
13486 {
13487 tree mem_initializer;
13490 /* Parse the mem-initializer. */
13492 /* If the next token is a `...', we're expanding member initializers. */
13494 {
13495 /* Consume the `...'. */
13498 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13499 can be expanded but members cannot. */
13502 {
13507 }
13509 /* Construct the pack expansion type. */
13512 }
13515 {
13519 }
13520 /* Look for a target constructor. */
13524 {
13527 {
13531 }
13533 }
13534 /* Add it to the list, unless it was erroneous. */
13536 {
13539 }
13540 /* If the next token is not a `,', we're done. */
13543 /* Consume the `,' token. */
13545 }
13547 /* Perform semantic analysis. */
13550 }
13552 /* Parse a mem-initializer.
13554 mem-initializer:
13555 mem-initializer-id ( expression-list [opt] )
13556 mem-initializer-id braced-init-list
13558 GNU extension:
13560 mem-initializer:
13561 ( expression-list [opt] )
13563 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13564 class) or FIELD_DECL (for a non-static data member) to initialize;
13565 the TREE_VALUE is the expression-list. An empty initialization
13566 list is represented by void_list_node. */
13568 static tree
13570 {
13571 tree mem_initializer_id;
13572 tree expression_list;
13573 tree member;
13576 /* Find out what is being initialized. */
13578 {
13582 }
13583 else
13584 {
13588 }
13594 {
13601 }
13602 else
13603 {
13613 }
13623 }
13625 /* Parse a mem-initializer-id.
13627 mem-initializer-id:
13628 :: [opt] nested-name-specifier [opt] class-name
13629 decltype-specifier (C++11)
13630 identifier
13632 Returns a TYPE indicating the class to be initialized for the first
13633 production (and the second in C++11). Returns an IDENTIFIER_NODE
13634 indicating the data member to be initialized for the last production. */
13636 static tree
13638 {
13642 tree id;
13646 /* `typename' is not allowed in this context ([temp.res]). */
13648 {
13650 "keyword %<typename%> not allowed in this context (a qualified "
13653 }
13654 /* Look for the optional `::' operator. */
13655 global_scope_p
13659 /* Look for the optional nested-name-specifier. The simplest way to
13660 implement:
13662 [temp.res]
13664 The keyword `typename' is not permitted in a base-specifier or
13665 mem-initializer; in these contexts a qualified name that
13666 depends on a template-parameter is implicitly assumed to be a
13667 type name.
13669 is to assume that we have seen the `typename' keyword at this
13670 point. */
13671 nested_name_specifier_p
13680 /* If there is a `::' operator or a nested-name-specifier, then we
13681 are definitely looking for a class-name. */
13686 typename_type,
13690 /* Otherwise, we could also be looking for an ordinary identifier. */
13693 /* Try a decltype-specifier. */
13695 else
13696 /* Otherwise, try a class-name. */
13700 none_type,
13704 /* If we found one, we're done. */
13707 /* Otherwise, look for an ordinary identifier. */
13709 }
13711 /* Overloading [gram.over] */
13713 /* Parse an operator-function-id.
13715 operator-function-id:
13716 operator operator
13718 Returns an IDENTIFIER_NODE for the operator which is a
13719 human-readable spelling of the identifier, e.g., `operator +'. */
13721 static cp_expr
13723 {
13724 /* Look for the `operator' keyword. */
13727 /* And then the name of the operator itself. */
13729 }
13731 /* Return an identifier node for a user-defined literal operator.
13732 The suffix identifier is chained to the operator name identifier. */
13734 static tree
13736 {
13737 tree identifier;
13744 }
13746 /* Parse an operator.
13748 operator:
13749 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13750 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13751 || ++ -- , ->* -> () []
13753 GNU Extensions:
13755 operator:
13756 <? >? <?= >?=
13758 Returns an IDENTIFIER_NODE for the operator which is a
13759 human-readable spelling of the identifier, e.g., `operator +'. */
13761 static cp_expr
13763 {
13768 /* Peek at the next token. */
13773 /* Figure out which operator we have. */
13775 {
13777 {
13780 /* The keyword should be either `new' or `delete'. */
13785 else
13788 /* Consume the `new' or `delete' token. */
13791 /* Peek at the next token. */
13793 /* If it's a `[' token then this is the array variant of the
13794 operator. */
13796 {
13797 /* Consume the `[' token. */
13799 /* Look for the `]' token. */
13805 }
13806 /* Otherwise, we have the non-array variant. */
13807 else
13813 }
13960 /* Consume the `('. */
13962 /* Look for the matching `)'. */
13967 /* Consume the `['. */
13969 /* Look for the matching `]'. */
13984 {
13991 /* Consume the string. */
13997 {
14000 }
14001 else
14002 {
14004 /* Look for the suffix identifier. */
14009 {
14013 }
14014 else
14015 {
14018 }
14019 }
14024 {
14027 }
14030 {
14033 }
14035 {
14038 }
14040 }
14043 /* Anything else is an error. */
14045 }
14047 /* If we have selected an identifier, we need to consume the
14048 operator token. */
14051 /* Otherwise, no valid operator name was present. */
14052 else
14053 {
14056 }
14059 }
14061 /* Parse a template-declaration.
14063 template-declaration:
14064 export [opt] template < template-parameter-list > declaration
14066 If MEMBER_P is TRUE, this template-declaration occurs within a
14067 class-specifier.
14069 The grammar rule given by the standard isn't correct. What
14070 is really meant is:
14072 template-declaration:
14073 export [opt] template-parameter-list-seq
14074 decl-specifier-seq [opt] init-declarator [opt] ;
14075 export [opt] template-parameter-list-seq
14076 function-definition
14078 template-parameter-list-seq:
14079 template-parameter-list-seq [opt]
14080 template < template-parameter-list >
14082 Concept Extensions:
14084 template-parameter-list-seq:
14085 template < template-parameter-list > requires-clause [opt]
14087 requires-clause:
14088 requires logical-or-expression */
14090 static void
14092 {
14093 /* Check for `export'. */
14095 {
14096 /* Consume the `export' token. */
14098 /* Warn that we do not support `export'. */
14100 }
14103 }
14105 /* Parse a template-parameter-list.
14107 template-parameter-list:
14108 template-parameter
14109 template-parameter-list , template-parameter
14111 Returns a TREE_LIST. Each node represents a template parameter.
14112 The nodes are connected via their TREE_CHAINs. */
14114 static tree
14116 {
14121 /* The loop below parses the template parms. We first need to know
14122 the total number of template parms to be able to compute proper
14123 canonical types of each dependent type. So after the loop, when
14124 we know the total number of template parms,
14125 end_template_parm_list computes the proper canonical types and
14126 fixes up the dependent types accordingly. */
14128 {
14129 tree parameter;
14132 location_t parm_loc;
14134 /* Parse the template-parameter. */
14139 /* Add it to the list. */
14142 parm_loc,
14143 parameter,
14144 is_non_type,
14145 is_parameter_pack);
14146 else
14147 {
14150 }
14152 /* If the next token is not a `,', we're done. */
14155 /* Otherwise, consume the `,' token. */
14157 }
14160 }
14162 /* Parse a introduction-list.
14164 introduction-list:
14165 introduced-parameter
14166 introduction-list , introduced-parameter
14168 introduced-parameter:
14169 ...[opt] identifier
14171 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14172 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14173 WILDCARD_DECL will also have DECL_NAME set and token location in
14174 DECL_SOURCE_LOCATION. */
14176 static tree
14178 {
14182 {
14187 /* Build placeholder. */
14195 /* If the next token is not a `,', we're done. */
14198 /* Otherwise, consume the `,' token. */
14200 }
14202 /* Convert the vec into a TREE_VEC. */
14205 tree parm;
14211 }
14213 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14214 is an abstract declarator. */
14218 {
14223 }
14225 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14226 is an abstract declarator. */
14230 {
14234 else
14236 }
14238 /* Returns true if DECL represents a constrained-parameter. */
14242 {
14247 }
14249 /* Returns true if PARM declares a constrained-parameter. */
14253 {
14255 }
14257 /* Check that the type parameter is only a declarator-id, and that its
14258 type is not cv-qualified. */
14260 bool
14263 {
14268 {
14271 }
14273 /* Don't allow cv-qualified type parameters. */
14276 {
14279 }
14282 }
14284 /* Finish parsing/processing a template type parameter and checking
14285 various restrictions. */
14289 tree id,
14291 {
14294 else
14296 }
14298 static tree
14300 {
14301 /* FIXME: This should probably be copied, and we may need to adjust
14302 the template parameter depths. */
14312 }
14314 /* Finish parsing/processing a template template parameter by borrowing
14315 the template parameter list from the prototype parameter. */
14317 static tree
14319 tree proto,
14320 tree id,
14322 {
14326 }
14328 /* Create a new non-type template parameter from the given PARM
14329 declarator. */
14331 static tree
14334 {
14340 }
14342 /* Build a constrained template parameter based on the PARMDECL
14343 declarator. The type of PARMDECL is the constrained type, which
14344 refers to the prototype template parameter that ultimately
14345 specifies the type of the declared parameter. */
14347 static tree
14352 {
14358 /* A template parameter constrained by a variadic concept shall also
14359 be declared as a template parameter pack. */
14364 /* Build the parameter. Return an error if the declarator was invalid. */
14365 tree parm;
14370 parmdecl);
14371 else
14376 /* Finish the parameter decl and create a node attaching the
14377 default argument and constraint. */
14382 }
14384 /* Returns true if the parsed type actually represents the declaration
14385 of a type template-parameter. */
14389 {
14392 }
14395 /* Returns true if the parsed type actually represents the declaration of
14396 a template template-parameter. */
14398 static bool
14400 {
14403 }
14405 /* Parse a default argument for a type template-parameter.
14406 Note that diagnostics are handled in cp_parser_template_parameter. */
14408 static tree
14410 {
14413 /* Consume the `=' token. */
14418 /* Parse the default-argument. */
14424 {
14428 }
14431 }
14433 /* Parse a default argument for a template template-parameter. */
14435 static tree
14437 {
14442 /* Consume the `='. */
14444 /* Parse the id-expression. */
14446 /* save token before parsing the id-expression, for error
14447 reporting */
14449 tree default_argument
14457 /* If the id-expression was a template-id that refers to
14458 a template-class, we already have the declaration here,
14459 so no further lookup is needed. */
14460 ;
14461 else
14462 /* Look up the name. */
14463 default_argument
14465 none_type,
14471 /* See if the default argument is valid. */
14475 }
14477 /* Parse a template-parameter.
14479 template-parameter:
14480 type-parameter
14481 parameter-declaration
14483 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14484 the parameter. The TREE_PURPOSE is the default value, if any.
14485 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14486 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14487 set to true iff this parameter is a parameter pack. */
14489 static tree
14492 {
14495 tree parm;
14497 /* Assume it is a type parameter or a template parameter. */
14499 /* Assume it not a parameter pack. */
14501 /* Peek at the next token. */
14503 /* If it is `class' or `template', we have a type-parameter. */
14506 /* If it is `class' or `typename' we do not know yet whether it is a
14507 type parameter or a non-type parameter. Consider:
14509 template <typename T, typename T::X X> ...
14511 or:
14513 template <class C, class D*> ...
14515 Here, the first parameter is a type parameter, and the second is
14516 a non-type parameter. We can tell by looking at the token after
14517 the identifier -- if it is a `,', `=', or `>' then we have a type
14518 parameter. */
14520 {
14521 /* Peek at the token after `class' or `typename'. */
14523 /* If it's an ellipsis, we have a template type parameter
14524 pack. */
14527 /* If it's an identifier, skip it. */
14530 /* Now, see if the token looks like the end of a template
14531 parameter. */
14536 }
14538 /* Otherwise, it is a non-type parameter or a constrained parameter.
14540 [temp.param]
14542 When parsing a default template-argument for a non-type
14543 template-parameter, the first non-nested `>' is taken as the end
14544 of the template parameter-list rather than a greater-than
14545 operator. */
14546 parameter_declarator
14553 /* If the parameter declaration is marked as a parameter pack, set
14554 *IS_PARAMETER_PACK to notify the caller. */
14559 {
14560 /* Can happen in some cases of erroneous input (c++/34892). */
14562 /* Consume the `...' for better error recovery. */
14564 }
14566 // The parameter may have been constrained.
14569 parameter_declarator,
14570 is_non_type,
14571 is_parameter_pack);
14573 // Now we're sure that the parameter is a non-type parameter.
14584 }
14586 /* Parse a type-parameter.
14588 type-parameter:
14589 class identifier [opt]
14590 class identifier [opt] = type-id
14591 typename identifier [opt]
14592 typename identifier [opt] = type-id
14593 template < template-parameter-list > class identifier [opt]
14594 template < template-parameter-list > class identifier [opt]
14595 = id-expression
14597 GNU Extension (variadic templates):
14599 type-parameter:
14600 class ... identifier [opt]
14601 typename ... identifier [opt]
14603 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14604 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14605 the declaration of the parameter.
14607 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14609 static tree
14611 {
14613 tree parameter;
14615 /* Look for a keyword to tell us what kind of parameter this is. */
14621 {
14624 {
14625 tree identifier;
14626 tree default_argument;
14628 /* If the next token is an ellipsis, we have a template
14629 argument pack. */
14631 {
14632 /* Consume the `...' token. */
14637 }
14639 /* If the next token is an identifier, then it names the
14640 parameter. */
14643 else
14646 /* Create the parameter. */
14649 /* If the next token is an `=', we have a default argument. */
14651 {
14652 default_argument
14655 /* Template parameter packs cannot have default
14656 arguments. */
14658 {
14661 "template parameter pack %qD cannot have a "
14663 else
14665 "template parameter packs cannot have "
14668 }
14671 }
14672 else
14675 /* Create the combined representation of the parameter and the
14676 default argument. */
14678 }
14682 {
14683 tree identifier;
14684 tree default_argument;
14686 /* Look for the `<'. */
14688 /* Parse the template-parameter-list. */
14690 /* Look for the `>'. */
14693 // If template requirements are present, parse them.
14699 /* Look for the `class' or 'typename' keywords. */
14701 /* If the next token is an ellipsis, we have a template
14702 argument pack. */
14704 {
14705 /* Consume the `...' token. */
14710 }
14711 /* If the next token is an `=', then there is a
14712 default-argument. If the next token is a `>', we are at
14713 the end of the parameter-list. If the next token is a `,',
14714 then we are at the end of this parameter. */
14718 {
14720 /* Treat invalid names as if the parameter were nameless. */
14723 }
14724 else
14727 /* Create the template parameter. */
14729 identifier);
14731 /* If the next token is an `=', then there is a
14732 default-argument. */
14734 {
14735 default_argument
14738 /* Template parameter packs cannot have default
14739 arguments. */
14741 {
14744 "template parameter pack %qD cannot "
14746 identifier);
14747 else
14751 }
14752 }
14753 else
14756 /* Create the combined representation of the parameter and the
14757 default argument. */
14759 }
14765 }
14768 }
14770 /* Parse a template-id.
14772 template-id:
14773 template-name < template-argument-list [opt] >
14775 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14776 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14777 returned. Otherwise, if the template-name names a function, or set
14778 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14779 names a class, returns a TYPE_DECL for the specialization.
14781 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14782 uninstantiated templates. */
14784 static tree
14790 {
14791 tree templ;
14792 tree arguments;
14793 tree template_id;
14798 /* If the next token corresponds to a template-id, there is no need
14799 to reparse it. */
14802 {
14805 }
14807 /* Avoid performing name lookup if there is no possibility of
14808 finding a template-id. */
14811 && !cp_parser_nth_token_starts_template_argument_list_p
14813 {
14816 }
14818 /* Remember where the template-id starts. */
14824 /* Parse the template-name. */
14827 check_dependency_p,
14828 is_declaration,
14829 tag_type,
14832 {
14835 }
14837 /* Since we're going to preserve any side-effects from this parse, set up a
14838 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14839 in the template arguments. */
14842 /* If we find the sequence `[:' after a template-name, it's probably
14843 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14844 parse correctly the argument list. */
14851 {
14853 /* Change `:' into `::'. */
14855 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14856 CPP_LESS. */
14859 /* Parse the arguments. */
14862 {
14863 /* If we couldn't parse an argument list, then we revert our changes
14864 and return simply an error. Maybe this is not a template-id
14865 after all. */
14870 }
14871 /* Otherwise, emit an error about the invalid digraph, but continue
14872 parsing because we got our argument list. */
14875 {
14878 "%<<:%> is an alternate spelling for %<[%>."
14881 {
14883 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14886 }
14887 }
14888 }
14889 else
14890 {
14891 /* Look for the `<' that starts the template-argument-list. */
14893 {
14896 }
14897 /* Parse the arguments. */
14899 }
14901 /* Build a representation of the specialization. */
14904 TEMPLATE_ID_EXPR,
14908 {
14910 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14911 template (rather than some instantiation thereof) only if
14912 is not nested within some other construct. For example, in
14913 "template <typename T> void f(T) { A<T>::", A<T> is just an
14914 instantiation of A. */
14917 CPP_SCOPE));
14918 template_id
14920 }
14921 /* A template-like identifier may be a partial concept id. */
14927 {
14931 }
14932 else
14933 {
14934 /* If it's not a class-template or a template-template, it should be
14935 a function-template. */
14943 }
14945 /* If parsing tentatively, replace the sequence of tokens that makes
14946 up the template-id with a CPP_TEMPLATE_ID token. That way,
14947 should we re-parse the token stream, we will not have to repeat
14948 the effort required to do the parse, nor will we issue duplicate
14949 error messages about problems during instantiation of the
14950 template. */
14952 /* Don't do this if we had a parse error in a declarator; re-parsing
14953 might succeed if a name changes meaning (60361). */
14957 {
14960 /* Reset the contents of the START_OF_ID token. */
14963 /* Update the location to be of the form:
14964 template-name < template-argument-list [opt] >
14965 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14966 with caret == start at the start of the template-name,
14967 ranging until the closing '>'. */
14968 location_t finish_loc
14970 location_t combined_loc
14974 /* Retrieve any deferred checks. Do not pop this access checks yet
14975 so the memory will not be reclaimed during token replacing below. */
14981 /* Purge all subsequent tokens. */
14984 /* ??? Can we actually assume that, if template_id ==
14985 error_mark_node, we will have issued a diagnostic to the
14986 user, as opposed to simply marking the tentative parse as
14987 failed? */
14990 }
14994 }
14996 /* Parse a template-name.
14998 template-name:
14999 identifier
15001 The standard should actually say:
15003 template-name:
15004 identifier
15005 operator-function-id
15007 A defect report has been filed about this issue.
15009 A conversion-function-id cannot be a template name because they cannot
15010 be part of a template-id. In fact, looking at this code:
15012 a.operator K<int>()
15014 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15015 It is impossible to call a templated conversion-function-id with an
15016 explicit argument list, since the only allowed template parameter is
15017 the type to which it is converting.
15019 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15020 `template' keyword, in a construction like:
15022 T::template f<3>()
15024 In that case `f' is taken to be a template-name, even though there
15025 is no way of knowing for sure.
15027 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15028 name refers to a set of overloaded functions, at least one of which
15029 is a template, or an IDENTIFIER_NODE with the name of the template,
15030 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15031 names are looked up inside uninstantiated templates. */
15033 static tree
15040 {
15041 tree identifier;
15042 tree decl;
15043 tree fns;
15046 /* If the next token is `operator', then we have either an
15047 operator-function-id or a conversion-function-id. */
15049 {
15050 /* We don't know whether we're looking at an
15051 operator-function-id or a conversion-function-id. */
15053 /* Try an operator-function-id. */
15055 /* If that didn't work, try a conversion-function-id. */
15057 {
15060 }
15061 }
15062 /* Look for the identifier. */
15063 else
15066 /* If we didn't find an identifier, we don't have a template-id. */
15070 /* If the name immediately followed the `template' keyword, then it
15071 is a template-name. However, if the next token is not `<', then
15072 we do not treat it as a template-name, since it is not being used
15073 as part of a template-id. This enables us to handle constructs
15074 like:
15076 template <typename T> struct S { S(); };
15077 template <typename T> S<T>::S();
15079 correctly. We would treat `S' as a template -- if it were `S<T>'
15080 -- but we do not if there is no `<'. */
15084 {
15085 /* In a declaration, in a dependent context, we pretend that the
15086 "template" keyword was present in order to improve error
15087 recovery. For example, given:
15089 template <typename T> void f(T::X<int>);
15091 we want to treat "X<int>" as a template-id. */
15093 && !template_keyword_p
15095 && check_dependency_p
15097 /* Do not do this for dtors (or ctors), since they never
15098 need the template keyword before their name. */
15100 {
15103 /* Explain what went wrong. */
15105 identifier);
15108 /* If parsing tentatively, find the location of the "<" token. */
15111 /* Parse the template arguments so that we can issue error
15112 messages about them. */
15115 /* Skip tokens until we find a good place from which to
15116 continue parsing. */
15121 /* If parsing tentatively, permanently remove the
15122 template argument list. That will prevent duplicate
15123 error messages from being issued about the missing
15124 "template" keyword. */
15130 }
15132 /* If the "template" keyword is present, then there is generally
15133 no point in doing name-lookup, so we just return IDENTIFIER.
15134 But, if the qualifying scope is non-dependent then we can
15135 (and must) do name-lookup normally. */
15141 }
15143 /* Look up the name. */
15145 tag_type,
15148 check_dependency_p,
15154 /* If DECL is a template, then the name was a template-name. */
15156 {
15160 }
15161 else
15162 {
15165 /* The standard does not explicitly indicate whether a name that
15166 names a set of overloaded declarations, some of which are
15167 templates, is a template-name. However, such a name should
15168 be a template-name; otherwise, there is no way to form a
15169 template-id for the overloaded templates. */
15177 {
15178 /* The name does not name a template. */
15181 }
15182 }
15184 /* If DECL is dependent, and refers to a function, then just return
15185 its name; we will look it up again during template instantiation. */
15187 {
15191 }
15194 }
15196 /* Parse a template-argument-list.
15198 template-argument-list:
15199 template-argument ... [opt]
15200 template-argument-list , template-argument ... [opt]
15202 Returns a TREE_VEC containing the arguments. */
15204 static tree
15206 {
15211 tree vec;
15218 /* Even if the template-id appears in an integral
15219 constant-expression, the contents of the argument list do
15220 not. */
15226 /* Parse the arguments. */
15227 do
15228 {
15229 tree argument;
15232 /* Consume the comma. */
15235 /* Parse the template-argument. */
15238 /* If the next token is an ellipsis, we're expanding a template
15239 argument pack. */
15241 {
15243 {
15247 }
15248 /* Consume the `...' token. */
15251 /* Make the argument into a TYPE_PACK_EXPANSION or
15252 EXPR_PACK_EXPANSION. */
15254 }
15257 {
15261 {
15264 }
15265 else
15267 }
15269 }
15285 }
15287 /* Parse a template-argument.
15289 template-argument:
15290 assignment-expression
15291 type-id
15292 id-expression
15294 The representation is that of an assignment-expression, type-id, or
15295 id-expression -- except that the qualified id-expression is
15296 evaluated, so that the value returned is either a DECL or an
15297 OVERLOAD.
15299 Although the standard says "assignment-expression", it forbids
15300 throw-expressions or assignments in the template argument.
15301 Therefore, we use "conditional-expression" instead. */
15303 static tree
15305 {
15306 tree argument;
15312 cp_id_kind idk;
15314 /* There's really no way to know what we're looking at, so we just
15315 try each alternative in order.
15317 [temp.arg]
15319 In a template-argument, an ambiguity between a type-id and an
15320 expression is resolved to a type-id, regardless of the form of
15321 the corresponding template-parameter.
15323 Therefore, we try a type-id first. */
15326 /* If there was no error parsing the type-id but the next token is a
15327 '>>', our behavior depends on which dialect of C++ we're
15328 parsing. In C++98, we probably found a typo for '> >'. But there
15329 are type-id which are also valid expressions. For instance:
15331 struct X { int operator >> (int); };
15332 template <int V> struct Foo {};
15333 Foo<X () >> 5> r;
15335 Here 'X()' is a valid type-id of a function type, but the user just
15336 wanted to write the expression "X() >> 5". Thus, we remember that we
15337 found a valid type-id, but we still try to parse the argument as an
15338 expression to see what happens.
15340 In C++0x, the '>>' will be considered two separate '>'
15341 tokens. */
15345 {
15348 }
15349 else
15350 {
15351 /* If the next token isn't a `,' or a `>', then this argument wasn't
15352 really finished. This means that the argument is not a valid
15353 type-id. */
15356 /* If that worked, we're done. */
15359 }
15360 /* We're still not sure what the argument will be. */
15362 /* Try a template. */
15370 /* If the next token isn't a `,' or a `>', then this argument wasn't
15371 really finished. */
15375 {
15376 /* Figure out what is being referred to. If the id-expression
15377 was for a class template specialization, then we will have a
15378 TYPE_DECL at this point. There is no need to do name lookup
15379 at this point in that case. */
15382 none_type,
15388 /* Handle a constrained-type-specifier for a non-type template
15389 parameter. */
15395 }
15397 {
15401 }
15402 /* It must be a non-type argument. In C++17 any constant-expression is
15403 allowed. */
15407 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15409 -- an integral constant-expression of integral or enumeration
15410 type; or
15412 -- the name of a non-type template-parameter; or
15414 -- the name of an object or function with external linkage...
15416 -- the address of an object or function with external linkage...
15418 -- a pointer to member... */
15419 /* Look for a non-type template parameter. */
15421 {
15433 }
15435 /* If the next token is "&", the argument must be the address of an
15436 object or function with external linkage. */
15439 {
15442 }
15443 /* See if we might have an id-expression. */
15450 {
15453 address_p,
15460 else
15461 {
15462 tree probe;
15465 {
15466 /* Strip the dereference temporarily. */
15469 }
15471 /* If we're in a template, we represent a qualified-id referring
15472 to a static data member as a SCOPE_REF even if the scope isn't
15473 dependent so that we can check access control later. */
15478 {
15479 /* A variable without external linkage might still be a
15480 valid constant-expression, so no error is issued here
15481 if the external-linkage check fails. */
15484 }
15486 /* All overloaded functions are allowed; if the external
15487 linkage test does not pass, an error will be issued
15488 later. */
15489 ;
15493 /* A pointer-to-member. */
15494 ;
15496 ;
15497 else
15501 {
15504 tf_warning_or_error);
15505 else
15508 }
15509 }
15510 }
15511 /* If the argument started with "&", there are no other valid
15512 alternatives at this point. */
15514 {
15517 }
15519 general_expr:
15520 /* If the argument wasn't successfully parsed as a type-id followed
15521 by '>>', the argument can only be a constant expression now.
15522 Otherwise, we try parsing the constant-expression tentatively,
15523 because the argument could really be a type-id. */
15529 else
15530 {
15531 /* With C++17 generalized non-type template arguments we need to handle
15532 lvalue constant expressions, too. */
15535 }
15543 /* We did our best to parse the argument as a non type-id, but that
15544 was the only alternative that matched (albeit with a '>' after
15545 it). We can assume it's just a typo from the user, and a
15546 diagnostic will then be issued. */
15548 }
15550 /* Parse an explicit-instantiation.
15552 explicit-instantiation:
15553 template declaration
15555 Although the standard says `declaration', what it really means is:
15557 explicit-instantiation:
15558 template decl-specifier-seq [opt] declarator [opt] ;
15560 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15561 supposed to be allowed. A defect report has been filed about this
15562 issue.
15564 GNU Extension:
15566 explicit-instantiation:
15567 storage-class-specifier template
15568 decl-specifier-seq [opt] declarator [opt] ;
15569 function-specifier template
15570 decl-specifier-seq [opt] declarator [opt] ; */
15572 static void
15574 {
15576 cp_decl_specifier_seq decl_specifiers;
15581 /* Look for an (optional) storage-class-specifier or
15582 function-specifier. */
15584 {
15585 extension_specifier
15588 extension_specifier
15591 }
15593 /* Look for the `template' keyword. */
15595 /* Let the front end know that we are processing an explicit
15596 instantiation. */
15598 /* [temp.explicit] says that we are supposed to ignore access
15599 control while processing explicit instantiation directives. */
15601 /* Parse a decl-specifier-seq. */
15603 CP_PARSER_FLAGS_OPTIONAL,
15606 /* If there was exactly one decl-specifier, and it declared a class,
15607 and there's no declarator, then we have an explicit type
15608 instantiation. */
15610 {
15611 tree type;
15615 /* Turn access control back on for names used during
15616 template instantiation. */
15621 }
15622 else
15623 {
15625 tree decl;
15627 /* Parse the declarator. */
15628 declarator
15639 {
15642 "explicit instantiation shall not use"
15646 "explicit instantiation shall not use"
15651 /* Turn access control back on for names used during
15652 template instantiation. */
15654 /* Do the explicit instantiation. */
15656 }
15657 else
15658 {
15660 /* Skip the body of the explicit instantiation. */
15662 }
15663 }
15664 /* We're done with the instantiation. */
15670 }
15672 /* Parse an explicit-specialization.
15674 explicit-specialization:
15675 template < > declaration
15677 Although the standard says `declaration', what it really means is:
15679 explicit-specialization:
15680 template <> decl-specifier [opt] init-declarator [opt] ;
15681 template <> function-definition
15682 template <> explicit-specialization
15683 template <> template-declaration */
15685 static void
15687 {
15691 /* Look for the `template' keyword. */
15693 /* Look for the `<'. */
15695 /* Look for the `>'. */
15697 /* We have processed another parameter list. */
15699 /* [temp]
15701 A template ... explicit specialization ... shall not have C
15702 linkage. */
15704 {
15706 /* Give it C++ linkage to avoid confusing other parts of the
15707 front end. */
15710 }
15711 else
15713 /* Let the front end know that we are beginning a specialization. */
15715 {
15718 }
15720 /* If the next keyword is `template', we need to figure out whether
15721 or not we're looking a template-declaration. */
15723 {
15728 else
15730 }
15731 else
15732 /* Parse the dependent declaration. */
15738 /* We're done with the specialization. */
15740 /* For the erroneous case of a template with C linkage, we pushed an
15741 implicit C++ linkage scope; exit that scope now. */
15744 /* We're done with this parameter list. */
15746 }
15748 /* Parse a type-specifier.
15750 type-specifier:
15751 simple-type-specifier
15752 class-specifier
15753 enum-specifier
15754 elaborated-type-specifier
15755 cv-qualifier
15757 GNU Extension:
15759 type-specifier:
15760 __complex__
15762 Returns a representation of the type-specifier. For a
15763 class-specifier, enum-specifier, or elaborated-type-specifier, a
15764 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15766 The parser flags FLAGS is used to control type-specifier parsing.
15768 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15769 in a decl-specifier-seq.
15771 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15772 class-specifier, enum-specifier, or elaborated-type-specifier, then
15773 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15774 if a type is declared; 2 if it is defined. Otherwise, it is set to
15775 zero.
15777 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15778 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15779 is set to FALSE. */
15781 static tree
15783 cp_parser_flags flags,
15788 {
15794 /* Assume this type-specifier does not declare a new type. */
15797 /* And that it does not specify a cv-qualifier. */
15800 /* Peek at the next token. */
15803 /* If we're looking at a keyword, we can use that to guide the
15804 production we choose. */
15807 {
15812 /* Look for the enum-specifier. */
15814 /* If that worked, we're done. */
15816 {
15821 type_spec,
15822 token,
15825 }
15826 else
15829 /* Any of these indicate either a class-specifier, or an
15830 elaborated-type-specifier. */
15837 /* Parse tentatively so that we can back up if we don't find a
15838 class-specifier. */
15840 /* Look for the class-specifier. */
15843 /* If that worked, we're done. */
15845 {
15850 type_spec,
15851 token,
15854 }
15856 /* Fall through. */
15857 elaborated_type_specifier:
15858 /* We're declaring (not defining) a class or enum. */
15862 /* Fall through. */
15864 /* Look for an elaborated-type-specifier. */
15865 type_spec
15866 = (cp_parser_elaborated_type_specifier
15869 is_declaration));
15872 type_spec,
15873 token,
15896 /* The `__complex__' keyword is a GNU extension. */
15902 }
15904 /* Handle simple keywords. */
15906 {
15908 {
15911 }
15913 }
15915 /* If we do not already have a type-specifier, assume we are looking
15916 at a simple-type-specifier. */
15918 decl_specs,
15919 flags);
15921 /* If we didn't find a type-specifier, and a type-specifier was not
15922 optional in this context, issue an error message. */
15924 {
15927 }
15930 }
15932 /* Parse a simple-type-specifier.
15934 simple-type-specifier:
15935 :: [opt] nested-name-specifier [opt] type-name
15936 :: [opt] nested-name-specifier template template-id
15937 char
15938 wchar_t
15939 bool
15940 short
15941 int
15942 long
15943 signed
15944 unsigned
15945 float
15946 double
15947 void
15949 C++0x Extension:
15951 simple-type-specifier:
15952 auto
15953 decltype ( expression )
15954 char16_t
15955 char32_t
15956 __underlying_type ( type-id )
15958 GNU Extension:
15960 simple-type-specifier:
15961 __int128
15962 __typeof__ unary-expression
15963 __typeof__ ( type-id )
15964 __typeof__ ( type-id ) { initializer-list , [opt] }
15966 Concepts Extension:
15968 simple-type-specifier:
15969 constrained-type-specifier
15971 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15972 appropriately updated. */
15974 static tree
15977 cp_parser_flags flags)
15978 {
15983 /* Peek at the next token. */
15986 /* If we're looking at a keyword, things are easy. */
15988 {
16023 {
16026 }
16055 {
16056 /* The 'auto' might be the placeholder return type for a function decl
16057 with trailing return type. */
16066 {
16068 {
16075 }
16078 {
16081 }
16084 }
16088 {
16091 }
16094 {
16097 }
16098 else
16102 {
16105 "use of %<auto%> in lambda parameter declaration "
16106 "only available with "
16108 }
16111 "use of %<auto%> in parameter declaration "
16112 "only available with "
16116 "ISO C++ forbids use of %<auto%> in parameter "
16118 }
16119 else
16124 /* Since DR 743, decltype can either be a simple-type-specifier by
16125 itself or begin a nested-name-specifier. Parsing it will replace
16126 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16127 handling below decide what to do. */
16133 /* Consume the `typeof' token. */
16135 /* Parse the operand to `typeof'. */
16137 /* If it is not already a TYPE, take its type. */
16143 token,
16152 token,
16162 token,
16167 }
16169 /* If token is an already-parsed decltype not followed by ::,
16170 it's a simple-type-specifier. */
16173 {
16176 {
16178 token,
16180 /* Remember that we are handling a decltype in order to
16181 implement the resolution of DR 1510 when the argument
16182 isn't instantiation dependent. */
16184 }
16187 }
16189 /* If the type-specifier was for a built-in type, we're done. */
16191 {
16192 /* Record the type. */
16199 type,
16200 token,
16205 /* Consume the token. */
16211 /* There is no valid C++ program where a non-template type is
16212 followed by a "<". That usually indicates that the user thought
16213 that the type was a template. */
16218 }
16220 /* The type-specifier must be a user-defined type. */
16222 {
16226 /* Don't gobble tokens or issue error messages if this is an
16227 optional type-specifier. */
16231 /* Look for the optional `::' operator. */
16232 global_p
16236 /* Look for the nested-name specifier. */
16237 qualified_p
16245 /* If we have seen a nested-name-specifier, and the next token
16246 is `template', then we are using the template-id production. */
16249 {
16250 /* Look for the template-id. */
16254 none_type,
16256 /* If the template-id did not name a type, we are out of
16257 luck. */
16259 {
16262 }
16263 }
16264 /* Otherwise, look for a type-name. */
16265 else
16267 /* Keep track of all name-lookups performed in class scopes. */
16269 && !global_p
16270 && !qualified_p
16274 /* If it didn't work out, we don't have a TYPE. */
16280 token,
16282 }
16284 /* If we didn't get a type-name, issue an error message. */
16286 {
16289 }
16292 {
16293 /* See if TYPE is an Objective-C type, and if so, parse and
16294 accept any protocol references following it. Do this before
16295 the cp_parser_check_for_invalid_template_id() call, because
16296 Objective-C types can be followed by '<...>' which would
16297 enclose protocol names rather than template arguments, and so
16298 everything is fine. */
16301 {
16305 /* Clobber the "unqualified" type previously entered into
16306 DECL_SPECS with the new, improved protocol-qualified version. */
16311 }
16313 /* There is no valid C++ program where a non-template type is
16314 followed by a "<". That usually indicates that the user
16315 thought that the type was a template. */
16317 none_type,
16319 }
16322 }
16324 /* Parse a type-name.
16326 type-name:
16327 class-name
16328 enum-name
16329 typedef-name
16330 simple-template-id [in c++0x]
16332 enum-name:
16333 identifier
16335 typedef-name:
16336 identifier
16338 Concepts:
16340 type-name:
16341 concept-name
16342 partial-concept-id
16344 concept-name:
16345 identifier
16347 Returns a TYPE_DECL for the type. */
16349 static tree
16351 {
16353 }
16355 /* See above. */
16356 static tree
16358 {
16359 tree type_decl;
16361 /* We can't know yet whether it is a class-name or not. */
16363 /* Try a class-name. */
16365 typename_keyword_p,
16367 none_type,
16371 /* If it's not a class-name, keep looking. */
16373 {
16375 /* It must be a typedef-name or an enum-name. */
16379 /* It is either a simple-template-id representing an
16380 instantiation of an alias template... */
16384 none_type,
16386 /* Note that this must be an instantiation of an alias template
16387 because [temp.names]/6 says:
16389 A template-id that names an alias template specialization
16390 is a type-name.
16392 Whereas [temp.names]/7 says:
16394 A simple-template-id that names a class template
16395 specialization is a class-name.
16397 With concepts, this could also be a partial-concept-id that
16398 declares a non-type template parameter. */
16405 else
16409 /* ... Or a typedef-name or an enum-name. */
16411 }
16414 }
16416 /* Check if DECL and ARGS can form a constrained-type-specifier.
16417 If ARGS is non-null, we try to form a concept check of the
16418 form DECL<?, ARGS> where ? is a wildcard that matches any
16419 kind of template argument. If ARGS is NULL, then we try to
16420 form a concept check of the form DECL<?>. */
16422 static tree
16425 {
16428 /* If we a constrained-type-specifier cannot be deduced. */
16432 /* A constrained type specifier can only be found in an
16433 overload set or as a reference to a template declaration.
16435 FIXME: This might be masking a bug. It's possible that
16436 that the deduction below is causing template specializations
16437 to be formed with the wildcard as an argument. */
16441 /* Try to build a call expression that evaluates the
16442 concept. This can fail if the overload set refers
16443 only to non-templates. */
16449 /* Deduce the checked constraint and the prototype parameter.
16451 FIXME: In certain cases, failure to deduce should be a
16452 diagnosable error. */
16453 tree conc;
16454 tree proto;
16458 /* In template parameter scope, this results in a constrained
16459 parameter. Return a descriptor of that parm. */
16463 /* In a parameter-declaration-clause, constrained-type
16464 specifiers result in invented template parameters. */
16466 {
16469 }
16470 else
16471 {
16472 /* Otherwise, we're in a context where the constrained
16473 type name is deduced and the constraint applies
16474 after deduction. */
16476 }
16479 }
16481 /* If DECL refers to a concept, return a TYPE_DECL representing
16482 the result of using the constrained type specifier in the
16483 current context. DECL refers to a concept if
16485 - it is an overload set containing a function concept taking a single
16486 type argument, or
16488 - it is a variable concept taking a single type argument. */
16490 static tree
16492 {
16498 else
16500 }
16502 /* Check if DECL and ARGS form a partial-concept-id. If so,
16503 assign ID to the resulting constrained placeholder.
16505 Returns true if the partial-concept-id designates a placeholder
16506 and false otherwise. Note that *id is set to NULL_TREE in
16507 this case. */
16509 static tree
16511 {
16513 }
16515 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16516 or a concept-name.
16518 enum-name:
16519 identifier
16521 typedef-name:
16522 identifier
16524 concept-name:
16525 identifier
16527 Returns a TYPE_DECL for the type. */
16529 static tree
16531 {
16532 tree type_decl;
16533 tree identifier;
16540 /* Look up the type-name. */
16545 /* If we found an overload set, then it may refer to a concept-name. */
16551 {
16552 /* See if this is an Objective-C type. */
16557 }
16559 /* Issue an error if we did not find a type-name. */
16561 /* In Objective-C, we have the complication that class names are
16562 normally type names and start declarations (eg, the
16563 "NSObject" in "NSObject *object;"), but can be used in an
16564 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16565 is an expression. So, a classname followed by a dot is not a
16566 valid type-name. */
16569 {
16574 }
16575 /* Remember that the name was used in the definition of the
16576 current class so that we can check later to see if the
16577 meaning would have been different after the class was
16578 entirely defined. */
16584 }
16586 /* Parse an elaborated-type-specifier. Note that the grammar given
16587 here incorporates the resolution to DR68.
16589 elaborated-type-specifier:
16590 class-key :: [opt] nested-name-specifier [opt] identifier
16591 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16592 enum-key :: [opt] nested-name-specifier [opt] identifier
16593 typename :: [opt] nested-name-specifier identifier
16594 typename :: [opt] nested-name-specifier template [opt]
16595 template-id
16597 GNU extension:
16599 elaborated-type-specifier:
16600 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16601 class-key attributes :: [opt] nested-name-specifier [opt]
16602 template [opt] template-id
16603 enum attributes :: [opt] nested-name-specifier [opt] identifier
16605 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16606 declared `friend'. If IS_DECLARATION is TRUE, then this
16607 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16608 something is being declared.
16610 Returns the TYPE specified. */
16612 static tree
16616 {
16618 tree identifier;
16621 tree globalscope;
16624 /* See if we're looking at the `enum' keyword. */
16626 {
16627 /* Consume the `enum' token. */
16629 /* Remember that it's an enumeration type. */
16631 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16632 enums) is used here. */
16635 {
16639 /* Consume the `struct' or `class' and parse it anyway. */
16641 }
16642 /* Parse the attributes. */
16644 }
16645 /* Or, it might be `typename'. */
16647 RID_TYPENAME))
16648 {
16649 /* Consume the `typename' token. */
16651 /* Remember that it's a `typename' type. */
16653 }
16654 /* Otherwise it must be a class-key. */
16655 else
16656 {
16660 /* Parse the attributes. */
16662 }
16664 /* Look for the `::' operator. */
16667 /* Look for the nested-name-specifier. */
16669 {
16674 is_declaration))
16676 }
16677 else
16678 /* Even though `typename' is not present, the proposed resolution
16679 to Core Issue 180 says that in `class A<T>::B', `B' should be
16680 considered a type-name, even if `A<T>' is dependent. */
16685 is_declaration);
16686 /* For everything but enumeration types, consider a template-id.
16687 For an enumeration type, consider only a plain identifier. */
16689 {
16691 tree decl;
16693 /* Allow the `template' keyword. */
16695 /* If we didn't see `template', we don't know if there's a
16696 template-id or not. */
16699 /* Parse the template-id. */
16703 tag_type,
16704 is_declaration);
16705 /* If we didn't find a template-id, look for an ordinary
16706 identifier. */
16708 ;
16709 /* We can get here when cp_parser_template_id, called by
16710 cp_parser_class_name with tag_type == none_type, succeeds
16711 and caches a BASELINK. Then, when called again here,
16712 instead of failing and returning an error_mark_node
16713 returns it (see template/typename17.C in C++11).
16714 ??? Could we diagnose this earlier? */
16716 {
16719 }
16720 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16721 in effect, then we must assume that, upon instantiation, the
16722 template will correspond to a class. */
16726 typename_type,
16728 /* If the `typename' keyword is in effect and DECL is not a type
16729 decl, then type is non existent. */
16731 ;
16737 }
16740 {
16745 {
16748 }
16750 /* For a `typename', we needn't call xref_tag. */
16756 /* Template parameter lists apply only if we are not within a
16757 function parameter list. */
16758 bool template_parm_lists_apply
16767 /* Look up a qualified name in the usual way. */
16769 {
16770 tree decl;
16771 tree ambiguous_decls;
16774 tag_type,
16781 /* If the lookup was ambiguous, an error will already have been
16782 issued. */
16786 /* If we are parsing friend declaration, DECL may be a
16787 TEMPLATE_DECL tree node here. However, we need to check
16788 whether this TEMPLATE_DECL results in valid code. Consider
16789 the following example:
16791 namespace N {
16792 template <class T> class C {};
16793 }
16794 class X {
16795 template <class T> friend class N::C; // #1, valid code
16796 };
16797 template <class T> class Y {
16798 friend class N::C; // #2, invalid code
16799 };
16801 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16802 name lookup of `N::C'. We see that friend declaration must
16803 be template for the code to be valid. Note that
16804 processing_template_decl does not work here since it is
16805 always 1 for the above two cases. */
16807 decl = (cp_parser_maybe_treat_template_as_class
16812 {
16814 identifier,
16817 }
16820 {
16824 allow_template);
16828 }
16830 /* Forward declarations of nested types, such as
16832 class C1::C2;
16833 class C1::C2::C3;
16835 are invalid unless all components preceding the final '::'
16836 are complete. If all enclosing types are complete, these
16837 declarations become merely pointless.
16839 Invalid forward declarations of nested types are errors
16840 caught elsewhere in parsing. Those that are pointless arrive
16841 here. */
16848 }
16849 else
16850 {
16851 /* An elaborated-type-specifier sometimes introduces a new type and
16852 sometimes names an existing type. Normally, the rule is that it
16853 introduces a new type only if there is not an existing type of
16854 the same name already in scope. For example, given:
16856 struct S {};
16857 void f() { struct S s; }
16859 the `struct S' in the body of `f' is the same `struct S' as in
16860 the global scope; the existing definition is used. However, if
16861 there were no global declaration, this would introduce a new
16862 local class named `S'.
16864 An exception to this rule applies to the following code:
16866 namespace N { struct S; }
16868 Here, the elaborated-type-specifier names a new type
16869 unconditionally; even if there is already an `S' in the
16870 containing scope this declaration names a new type.
16871 This exception only applies if the elaborated-type-specifier
16872 forms the complete declaration:
16874 [class.name]
16876 A declaration consisting solely of `class-key identifier ;' is
16877 either a redeclaration of the name in the current scope or a
16878 forward declaration of the identifier as a class name. It
16879 introduces the name into the current scope.
16881 We are in this situation precisely when the next token is a `;'.
16883 An exception to the exception is that a `friend' declaration does
16884 *not* name a new type; i.e., given:
16886 struct S { friend struct T; };
16888 `T' is not a new type in the scope of `S'.
16890 Also, `new struct S' or `sizeof (struct S)' never results in the
16891 definition of a new type; a new type can only be declared in a
16892 declaration context. */
16894 tag_scope ts;
16898 /* Friends have special name lookup rules. */
16902 CPP_SEMICOLON))
16903 /* This is a `class-key identifier ;' */
16905 else
16908 template_p =
16909 (template_parm_lists_apply
16912 /* An unqualified name was used to reference this type, so
16913 there were no qualifying templates. */
16921 }
16922 }
16927 /* Allow attributes on forward declarations of classes. */
16929 {
16939 else
16942 }
16945 {
16946 /* Indicate whether this class was declared as a `class' or as a
16947 `struct'. */
16951 }
16953 /* A "<" cannot follow an elaborated type specifier. If that
16954 happens, the user was probably trying to form a template-id. */
16959 }
16961 /* Parse an enum-specifier.
16963 enum-specifier:
16964 enum-head { enumerator-list [opt] }
16965 enum-head { enumerator-list , } [C++0x]
16967 enum-head:
16968 enum-key identifier [opt] enum-base [opt]
16969 enum-key nested-name-specifier identifier enum-base [opt]
16971 enum-key:
16972 enum
16973 enum class [C++0x]
16974 enum struct [C++0x]
16976 enum-base: [C++0x]
16977 : type-specifier-seq
16979 opaque-enum-specifier:
16980 enum-key identifier enum-base [opt] ;
16982 GNU Extensions:
16983 enum-key attributes[opt] identifier [opt] enum-base [opt]
16984 { enumerator-list [opt] }attributes[opt]
16985 enum-key attributes[opt] identifier [opt] enum-base [opt]
16986 { enumerator-list, }attributes[opt] [C++0x]
16988 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16989 if the token stream isn't an enum-specifier after all. */
16991 static tree
16993 {
16994 tree identifier;
16996 tree prev_scope;
16998 tree attributes;
17011 /* Parse tentatively so that we can back up if we don't find a
17012 enum-specifier. */
17015 /* Caller guarantees that the current token is 'enum', an identifier
17016 possibly follows, and the token after that is an opening brace.
17017 If we don't have an identifier, fabricate an anonymous name for
17018 the enumeration being defined. */
17021 /* Parse the "class" or "struct", which indicates a scoped
17022 enumeration type in C++0x. */
17025 {
17029 /* Consume the `struct' or `class' token. */
17033 }
17037 /* Clear the qualification. */
17042 /* Figure out in what scope the declaration is being placed. */
17048 nested_name_specifier
17056 {
17057 tree name;
17061 enum_type,
17066 input_location);
17068 {
17071 {
17072 /* Are template enums allowed in ISO? */
17076 /* ignore a typename reference, for it will be solved by name
17077 in start_enum. */
17079 }
17080 }
17083 else
17084 {
17089 }
17090 }
17091 else
17092 {
17095 else
17096 {
17102 }
17103 }
17106 /* Check for the `:' that denotes a specified underlying type in C++0x.
17107 Note that a ':' could also indicate a bitfield width, however. */
17109 {
17110 cp_decl_specifier_seq type_specifiers;
17112 /* Consume the `:'. */
17115 /* Parse the type-specifier-seq. */
17120 /* At this point this is surely not elaborated type specifier. */
17129 /* If that didn't work, stop. */
17131 {
17137 }
17138 }
17140 /* Look for the `{' but don't consume it yet. */
17142 {
17144 {
17147 {
17150 }
17151 }
17152 /* An opaque-enum-specifier must have a ';' here. */
17155 {
17158 {
17161 }
17162 }
17163 }
17169 {
17171 {
17175 }
17177 {
17179 }
17180 }
17182 /* Issue an error message if type-definitions are forbidden here. */
17185 else
17186 /* Create the new type. We do this before consuming the opening
17187 brace so the enum will be recorded as being on the line of its
17188 tag (or the 'enum' keyword, if there is no tag). */
17192 /* If the next token is not '{' it is an opaque-enum-specifier or an
17193 elaborated-type-specifier. */
17195 {
17199 {
17200 /* The following catches invalid code such as:
17201 enum class S<int>::E { A, B, C }; */
17209 {
17213 nested_name_specifier);
17215 }
17218 {
17220 "%qT for enum declaration does not name a class "
17223 }
17224 /* If that scope does not contain the scope in which the
17225 class was originally declared, the program is invalid. */
17227 nested_name_specifier))
17228 {
17231 "declaration of %qD in namespace %qD which does not "
17234 else
17236 "declaration of %qD in %qD which does not "
17240 }
17241 /* If that scope is the scope where the declaration is being placed
17242 the program is invalid. */
17246 {
17250 }
17251 }
17256 /* Consume the opening brace. */
17263 {
17267 }
17268 else
17269 {
17275 }
17279 /* If the next token is not '}', then there are some enumerators. */
17281 {
17285 }
17286 else
17289 /* Consume the final '}'. */
17295 }
17296 else
17297 {
17298 /* If a ';' follows, then it is an opaque-enum-specifier
17299 and additional restrictions apply. */
17301 {
17308 }
17309 }
17311 /* Look for trailing attributes to apply to this enumeration, and
17312 apply them if appropriate. */
17314 {
17317 trailing_attr,
17319 }
17321 /* Finish up the enumeration. */
17323 {
17328 }
17331 {
17333 {
17336 }
17338 {
17340 }
17341 }
17342 out:
17345 }
17347 /* Parse an enumerator-list. The enumerators all have the indicated
17348 TYPE.
17350 enumerator-list:
17351 enumerator-definition
17352 enumerator-list , enumerator-definition */
17354 static void
17356 {
17358 {
17359 /* Parse an enumerator-definition. */
17362 /* If the next token is not a ',', we've reached the end of
17363 the list. */
17366 /* Otherwise, consume the `,' and keep going. */
17368 /* If the next token is a `}', there is a trailing comma. */
17370 {
17375 }
17376 }
17377 }
17379 /* Parse an enumerator-definition. The enumerator has the indicated
17380 TYPE.
17382 enumerator-definition:
17383 enumerator
17384 enumerator = constant-expression
17386 enumerator:
17387 identifier
17389 GNU Extensions:
17391 enumerator-definition:
17392 enumerator attributes [opt]
17393 enumerator attributes [opt] = constant-expression */
17395 static void
17397 {
17398 tree identifier;
17399 tree value;
17400 location_t loc;
17402 /* Save the input location because we are interested in the location
17403 of the identifier and not the location of the explicit value. */
17406 /* Look for the identifier. */
17411 /* Parse any specified attributes. */
17414 /* If the next token is an '=', then there is an explicit value. */
17416 {
17417 /* Consume the `=' token. */
17419 /* Parse the value. */
17421 }
17422 else
17425 /* If we are processing a template, make sure the initializer of the
17426 enumerator doesn't contain any bare template parameter pack. */
17430 /* Create the enumerator. */
17432 }
17434 /* Parse a namespace-name.
17436 namespace-name:
17437 original-namespace-name
17438 namespace-alias
17440 Returns the NAMESPACE_DECL for the namespace. */
17442 static tree
17444 {
17445 tree identifier;
17446 tree namespace_decl;
17450 /* Get the name of the namespace. */
17455 /* Look up the identifier in the currently active scope. Look only
17456 for namespaces, due to:
17458 [basic.lookup.udir]
17460 When looking up a namespace-name in a using-directive or alias
17461 definition, only namespace names are considered.
17463 And:
17465 [basic.lookup.qual]
17467 During the lookup of a name preceding the :: scope resolution
17468 operator, object, function, and enumerator names are ignored.
17470 (Note that cp_parser_qualifying_entity only calls this
17471 function if the token after the name is the scope resolution
17472 operator.) */
17474 none_type,
17480 /* If it's not a namespace, issue an error. */
17483 {
17488 }
17491 }
17493 /* Parse a namespace-definition.
17495 namespace-definition:
17496 named-namespace-definition
17497 unnamed-namespace-definition
17499 named-namespace-definition:
17500 original-namespace-definition
17501 extension-namespace-definition
17503 original-namespace-definition:
17504 namespace identifier { namespace-body }
17506 extension-namespace-definition:
17507 namespace original-namespace-name { namespace-body }
17509 unnamed-namespace-definition:
17510 namespace { namespace-body } */
17512 static void
17514 {
17524 {
17528 }
17529 else
17532 /* Look for the `namespace' keyword. */
17535 /* Parse any specified attributes before the identifier. */
17538 /* Get the name of the namespace. We do not attempt to distinguish
17539 between an original-namespace-definition and an
17540 extension-namespace-definition at this point. The semantic
17541 analysis routines are responsible for that. */
17544 else
17547 /* Parse any specified attributes after the identifier. */
17550 {
17553 else
17555 }
17557 /* Start the namespace. */
17560 /* Parse any nested namespace definition. */
17562 {
17567 "nested namespace definitions only available with "
17572 {
17576 else
17577 {
17580 }
17583 }
17584 }
17586 /* Look for the `{' to validate starting the namespace. */
17589 /* "inline namespace" is equivalent to a stub namespace definition
17590 followed by a strong using directive. */
17592 {
17594 /* Set up namespace association. */
17598 /* Import the contents of the inline namespace. */
17602 }
17608 /* Parse the body of the namespace. */
17614 /* Finish the nested namespace definitions. */
17618 /* Finish the namespace. */
17621 /* Look for the final `}'. */
17623 }
17625 /* Parse a namespace-body.
17627 namespace-body:
17628 declaration-seq [opt] */
17630 static void
17632 {
17634 }
17636 /* Parse a namespace-alias-definition.
17638 namespace-alias-definition:
17639 namespace identifier = qualified-namespace-specifier ; */
17641 static void
17643 {
17644 tree identifier;
17645 tree namespace_specifier;
17649 /* Look for the `namespace' keyword. */
17651 /* Look for the identifier. */
17655 /* Look for the `=' token. */
17658 {
17660 /* Skip the definition. */
17665 }
17667 /* Look for the qualified-namespace-specifier. */
17668 namespace_specifier
17670 /* Look for the `;' token. */
17673 /* Register the alias in the symbol table. */
17675 }
17677 /* Parse a qualified-namespace-specifier.
17679 qualified-namespace-specifier:
17680 :: [opt] nested-name-specifier [opt] namespace-name
17682 Returns a NAMESPACE_DECL corresponding to the specified
17683 namespace. */
17685 static tree
17687 {
17688 /* Look for the optional `::'. */
17692 /* Look for the optional nested-name-specifier. */
17700 }
17702 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17703 access declaration.
17705 using-declaration:
17706 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17707 using :: unqualified-id ;
17709 access-declaration:
17710 qualified-id ;
17712 */
17714 static bool
17717 {
17721 tree decl;
17722 tree identifier;
17723 tree qscope;
17728 {
17731 }
17732 else
17733 {
17734 /* Look for the `using' keyword. */
17737 /* Peek at the next token. */
17739 /* See if it's `typename'. */
17741 {
17742 /* Remember that we've seen it. */
17744 /* Consume the `typename' token. */
17746 }
17747 }
17749 /* Look for the optional global scope qualification. */
17750 global_scope_p
17755 /* If we saw `typename', or didn't see `::', then there must be a
17756 nested-name-specifier present. */
17758 {
17764 {
17767 }
17768 }
17769 /* Otherwise, we could be in either of the two productions. In that
17770 case, treat the nested-name-specifier as optional. */
17771 else
17783 /* Something has already gone wrong; there's no need to parse
17784 further. Since an error has occurred, the return value of
17785 cp_parser_parse_definitely will be false, as required. */
17789 /* Parse the unqualified-id. */
17797 {
17802 }
17804 /* The function we call to handle a using-declaration is different
17805 depending on what scope we are in. */
17807 ;
17810 /* [namespace.udecl]
17812 A using declaration shall not name a template-id. */
17815 else
17816 {
17818 {
17819 /* Create the USING_DECL. */
17826 {
17829 }
17830 else
17831 /* Add it to the list of members in this class. */
17833 }
17834 else
17835 {
17837 identifier,
17844 {
17847 }
17850 else
17852 }
17853 }
17855 /* Look for the final `;'. */
17860 "access declarations are deprecated "
17861 "in favour of using-declarations; "
17865 }
17867 /* Parse an alias-declaration.
17869 alias-declaration:
17870 using identifier attribute-specifier-seq [opt] = type-id */
17872 static tree
17874 {
17876 location_t id_location;
17878 cp_decl_specifier_seq decl_specs;
17882 /* Look for the `using' keyword. */
17883 cp_token *using_token
17905 /* Now we are going to parse the type-id of the declaration. */
17907 /*
17908 [dcl.type]/3 says:
17910 "A type-specifier-seq shall not define a class or enumeration
17911 unless it appears in the type-id of an alias-declaration (7.1.3) that
17912 is not the declaration of a template-declaration."
17914 In other words, if we currently are in an alias template, the
17915 type-id should not define a type.
17917 So let's set parser->type_definition_forbidden_message in that
17918 case; cp_parser_check_type_definition (called by
17919 cp_parser_class_specifier) will then emit an error if a type is
17920 defined in the type-id. */
17922 {
17926 }
17930 /* Restore the error message if need be. */
17936 {
17939 }
17941 /* A typedef-name can also be introduced by an alias-declaration. The
17942 identifier following the using keyword becomes a typedef-name. It has
17943 the same semantics as if it were introduced by the typedef
17944 specifier. In particular, it does not define a new type and it shall
17945 not appear in the type-id. */
17950 {
17953 ds_attribute,
17954 attrs_token);
17955 }
17957 ds_typedef,
17958 using_token);
17960 ds_alias,
17961 using_token);
17970 else
17976 // Attach constraints to the alias declaration.
17978 {
17982 }
17989 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17990 added into the symbol table; otherwise, return the TYPE_DECL. */
17994 {
17998 }
18001 }
18003 /* Parse a using-directive.
18005 using-directive:
18006 using namespace :: [opt] nested-name-specifier [opt]
18007 namespace-name ; */
18009 static void
18011 {
18012 tree namespace_decl;
18013 tree attribs;
18015 /* Look for the `using' keyword. */
18017 /* And the `namespace' keyword. */
18019 /* Look for the optional `::' operator. */
18021 /* And the optional nested-name-specifier. */
18027 /* Get the namespace being used. */
18029 /* And any specified attributes. */
18031 /* Update the symbol table. */
18033 /* Look for the final `;'. */
18035 }
18037 /* Parse an asm-definition.
18039 asm-definition:
18040 asm ( string-literal ) ;
18042 GNU Extension:
18044 asm-definition:
18045 asm volatile [opt] ( string-literal ) ;
18046 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18047 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18048 : asm-operand-list [opt] ) ;
18049 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18050 : asm-operand-list [opt]
18051 : asm-clobber-list [opt] ) ;
18052 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18053 : asm-clobber-list [opt]
18054 : asm-goto-list ) ; */
18056 static void
18058 {
18059 tree string;
18064 tree asm_stmt;
18072 /* Look for the `asm' keyword. */
18077 {
18080 }
18082 /* See if the next token is `volatile'. */
18085 {
18086 /* Remember that we saw the `volatile' keyword. */
18088 /* Consume the token. */
18090 }
18094 {
18095 /* Remember that we saw the `goto' keyword. */
18097 /* Consume the token. */
18099 }
18100 /* Look for the opening `('. */
18103 /* Look for the string. */
18106 {
18110 }
18112 /* If we're allowing GNU extensions, check for the extended assembly
18113 syntax. Unfortunately, the `:' tokens need not be separated by
18114 a space in C, and so, for compatibility, we tolerate that here
18115 too. Doing that means that we have to treat the `::' operator as
18116 two `:' tokens. */
18121 {
18126 /* The extended syntax was used. */
18129 /* Look for outputs. */
18131 {
18132 /* Consume the `:'. */
18134 /* Parse the output-operands. */
18136 CPP_COLON)
18138 CPP_SCOPE)
18140 CPP_CLOSE_PAREN)
18142 {
18146 }
18147 }
18148 /* If the next token is `::', there are no outputs, and the
18149 next token is the beginning of the inputs. */
18151 /* The inputs are coming next. */
18154 /* Look for inputs. */
18157 {
18158 /* Consume the `:' or `::'. */
18160 /* Parse the output-operands. */
18162 CPP_COLON)
18164 CPP_SCOPE)
18166 CPP_CLOSE_PAREN))
18167 {
18171 }
18172 }
18174 /* The clobbers are coming next. */
18177 /* Look for clobbers. */
18180 {
18182 /* Consume the `:' or `::'. */
18184 /* Parse the clobbers. */
18186 CPP_COLON)
18188 CPP_CLOSE_PAREN))
18190 }
18193 /* The labels are coming next. */
18196 /* Look for labels. */
18199 {
18201 /* Consume the `:' or `::'. */
18203 /* Parse the labels. */
18205 }
18209 }
18213 /* Look for the closing `)'. */
18221 {
18222 /* Create the ASM_EXPR. */
18224 {
18227 /* If the extended syntax was not used, mark the ASM_EXPR. */
18229 {
18235 }
18236 }
18237 else
18239 }
18240 }
18242 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18243 type that comes from the decl-specifier-seq. */
18245 static tree
18247 {
18250 {
18262 }
18265 }
18267 /* Declarators [gram.dcl.decl] */
18269 /* Parse an init-declarator.
18271 init-declarator:
18272 declarator initializer [opt]
18274 GNU Extension:
18276 init-declarator:
18277 declarator asm-specification [opt] attributes [opt] initializer [opt]
18279 function-definition:
18280 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18281 function-body
18282 decl-specifier-seq [opt] declarator function-try-block
18284 GNU Extension:
18286 function-definition:
18287 __extension__ function-definition
18289 TM Extension:
18291 function-definition:
18292 decl-specifier-seq [opt] declarator function-transaction-block
18294 The DECL_SPECIFIERS apply to this declarator. Returns a
18295 representation of the entity declared. If MEMBER_P is TRUE, then
18296 this declarator appears in a class scope. The new DECL created by
18297 this declarator is returned.
18299 The CHECKS are access checks that should be performed once we know
18300 what entity is being declared (and, therefore, what classes have
18301 befriended it).
18303 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18304 for a function-definition here as well. If the declarator is a
18305 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18306 be TRUE upon return. By that point, the function-definition will
18307 have been completely parsed.
18309 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18310 is FALSE.
18312 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18313 parsed declaration if it is an uninitialized single declarator not followed
18314 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18315 if present, will not be consumed. If returned, this declarator will be
18316 created with SD_INITIALIZED but will not call cp_finish_decl.
18318 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18319 and there is an initializer, the pointed location_t is set to the
18320 location of the '=' or `(', or '{' in C++11 token introducing the
18321 initializer. */
18323 static tree
18334 {
18338 tree prefix_attributes;
18340 tree asm_specification;
18341 tree initializer;
18343 tree scope;
18345 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18346 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18347 "(...)". */
18358 /* Gather the attributes that were provided with the
18359 decl-specifiers. */
18362 /* Assume that this is not the declarator for a function
18363 definition. */
18367 /* Default arguments are only permitted for function parameters. */
18371 /* Defer access checks while parsing the declarator; we cannot know
18372 what names are accessible until we know what is being
18373 declared. */
18376 /* Parse the declarator. */
18378 declarator
18383 /* Gather up the deferred checks. */
18388 /* If the DECLARATOR was erroneous, there's no need to go
18389 further. */
18393 /* Check that the number of template-parameter-lists is OK. */
18403 /* Figure out what scope the entity declared by the DECLARATOR is
18404 located in. `grokdeclarator' sometimes changes the scope, so
18405 we compute it now. */
18408 /* Perform any lookups in the declared type which were thought to be
18409 dependent, but are not in the scope of the declarator. */
18410 decl_specifiers->type
18413 /* If we're allowing GNU extensions, look for an
18414 asm-specification. */
18416 {
18417 /* Look for an asm-specification. */
18420 }
18421 else
18424 /* Look for attributes. */
18428 /* Peek at the next token. */
18434 {
18435 /* Check to see if the token indicates the start of a
18436 function-definition. */
18438 {
18440 {
18441 /* If a function-definition should not appear here, issue an
18442 error message. */
18446 }
18448 location_t func_brace_location
18451 /* Neither attributes nor an asm-specification are allowed
18452 on a function-definition. */
18455 "an asm-specification is not allowed "
18459 "attributes are not allowed "
18461 /* This is a function-definition. */
18464 /* Parse the function definition. */
18467 decl_specifiers,
18468 declarator,
18469 prefix_attributes);
18470 else
18471 decl =
18472 (cp_parser_function_definition_from_specifiers_and_declarator
18476 {
18477 /* This is where the prologue starts... */
18480 }
18483 }
18484 }
18486 {
18487 /* A non-template declaration involving a function parameter list
18488 containing an implicit template parameter will be made into a
18489 template. If the resulting declaration is not going to be an
18490 actual function then finish the template scope here to prevent it.
18491 An error message will be issued once we have a decl to talk about.
18493 FIXME probably we should do type deduction rather than create an
18494 implicit template, but the standard currently doesn't allow it. */
18497 }
18499 /* [dcl.dcl]
18501 Only in function declarations for constructors, destructors, and
18502 type conversions can the decl-specifier-seq be omitted.
18504 We explicitly postpone this check past the point where we handle
18505 function-definitions because we tolerate function-definitions
18506 that are missing their return types in some modes. */
18508 {
18512 }
18514 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18518 {
18529 {
18535 }
18536 }
18537 else
18538 {
18539 /* If the init-declarator isn't initialized and isn't followed by a
18540 `,' or `;', it's not a valid init-declarator. */
18543 {
18546 else
18547 {
18551 }
18552 }
18555 }
18557 /* Because start_decl has side-effects, we should only call it if we
18558 know we're going ahead. By this point, we know that we cannot
18559 possibly be looking at any other construct. */
18562 /* Enter the newly declared entry in the symbol table. If we're
18563 processing a declaration in a class-specifier, we wait until
18564 after processing the initializer. */
18566 {
18574 /* Adjust location of decl if declarator->id_loc is more appropriate:
18575 set, and decl wasn't merged with another decl, in which case its
18576 location would be different from input_location, and more accurate. */
18581 }
18583 /* Enter the SCOPE. That way unqualified names appearing in the
18584 initializer will be looked up in SCOPE. */
18587 /* Perform deferred access control checks, now that we know in which
18588 SCOPE the declared entity resides. */
18590 {
18593 /* If the entity being declared is a function, pretend that we
18594 are in its scope. If it is a `friend', it may have access to
18595 things that would not otherwise be accessible. */
18597 {
18600 }
18602 /* Perform access checks for template parameters. */
18605 /* Perform the access control checks for the declarator and the
18606 decl-specifiers. */
18609 /* Restore the saved value. */
18612 }
18614 /* Parse the initializer. */
18619 {
18621 {
18624 else
18625 {
18626 /* If the declaration was erroneous, we don't really
18627 know what the user intended, so just silently
18628 consume the initializer. */
18635 }
18636 }
18637 else
18638 {
18639 /* We want to record the extra mangling scope for in-class
18640 initializers of class members and initializers of static data
18641 member templates. The former involves deferring
18642 parsing of the initializer until end of class as with default
18643 arguments. So right here we only handle the latter. */
18653 }
18654 }
18656 /* The old parser allows attributes to appear after a parenthesized
18657 initializer. Mark Mitchell proposed removing this functionality
18658 on the GCC mailing lists on 2002-08-13. This parser accepts the
18659 attributes -- but ignores them. */
18666 /* And now complain about a non-function implicit template. */
18671 /* For an in-class declaration, use `grokfield' to create the
18672 declaration. */
18674 {
18676 {
18679 }
18688 }
18690 /* Finish processing the declaration. But, skip member
18691 declarations. */
18693 {
18696 asm_specification,
18697 /* If the initializer is in parentheses, then this is
18698 a direct-initialization, which means that an
18699 `explicit' constructor is OK. Otherwise, an
18700 `explicit' constructor cannot be used. */
18703 }
18706 /* Core issue #226 (C++0x only): A default template-argument
18707 shall not be specified in a friend class template
18708 declaration. */
18717 {
18720 else
18722 }
18729 }
18731 /* Parse a declarator.
18733 declarator:
18734 direct-declarator
18735 ptr-operator declarator
18737 abstract-declarator:
18738 ptr-operator abstract-declarator [opt]
18739 direct-abstract-declarator
18741 GNU Extensions:
18743 declarator:
18744 attributes [opt] direct-declarator
18745 attributes [opt] ptr-operator declarator
18747 abstract-declarator:
18748 attributes [opt] ptr-operator abstract-declarator [opt]
18749 attributes [opt] direct-abstract-declarator
18751 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18752 detect constructor, destructor or conversion operators. It is set
18753 to -1 if the declarator is a name, and +1 if it is a
18754 function. Otherwise it is set to zero. Usually you just want to
18755 test for >0, but internally the negative value is used.
18757 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18758 a decl-specifier-seq unless it declares a constructor, destructor,
18759 or conversion. It might seem that we could check this condition in
18760 semantic analysis, rather than parsing, but that makes it difficult
18761 to handle something like `f()'. We want to notice that there are
18762 no decl-specifiers, and therefore realize that this is an
18763 expression, not a declaration.)
18765 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18766 the declarator is a direct-declarator of the form "(...)".
18768 MEMBER_P is true iff this declarator is a member-declarator.
18770 FRIEND_P is true iff this declarator is a friend. */
18774 cp_parser_declarator_kind dcl_kind,
18778 {
18781 cp_cv_quals cv_quals;
18782 tree class_type;
18785 /* Assume this is not a constructor, destructor, or type-conversion
18786 operator. */
18793 /* Check for the ptr-operator production. */
18795 /* Parse the ptr-operator. */
18801 /* If that worked, then we have a ptr-operator. */
18803 {
18804 /* If a ptr-operator was found, then this declarator was not
18805 parenthesized. */
18808 /* The dependent declarator is optional if we are parsing an
18809 abstract-declarator. */
18813 /* Parse the dependent declarator. */
18818 friend_p);
18820 /* If we are parsing an abstract-declarator, we must handle the
18821 case where the dependent declarator is absent. */
18826 declarator = cp_parser_make_indirect_declarator
18828 }
18829 /* Everything else is a direct-declarator. */
18830 else
18831 {
18834 CPP_OPEN_PAREN);
18836 ctor_dtor_or_conv_p,
18838 }
18843 }
18845 /* Parse a direct-declarator or direct-abstract-declarator.
18847 direct-declarator:
18848 declarator-id
18849 direct-declarator ( parameter-declaration-clause )
18850 cv-qualifier-seq [opt]
18851 ref-qualifier [opt]
18852 exception-specification [opt]
18853 direct-declarator [ constant-expression [opt] ]
18854 ( declarator )
18856 direct-abstract-declarator:
18857 direct-abstract-declarator [opt]
18858 ( parameter-declaration-clause )
18859 cv-qualifier-seq [opt]
18860 ref-qualifier [opt]
18861 exception-specification [opt]
18862 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18863 ( abstract-declarator )
18865 Returns a representation of the declarator. DCL_KIND is
18866 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18867 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18868 we are parsing a direct-declarator. It is
18869 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18870 of ambiguity we prefer an abstract declarator, as per
18871 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18872 as for cp_parser_declarator. */
18876 cp_parser_declarator_kind dcl_kind,
18879 {
18889 {
18890 /* Peek at the next token. */
18893 {
18894 /* This is either a parameter-declaration-clause, or a
18895 parenthesized declarator. When we know we are parsing a
18896 named declarator, it must be a parenthesized declarator
18897 if FIRST is true. For instance, `(int)' is a
18898 parameter-declaration-clause, with an omitted
18899 direct-abstract-declarator. But `((*))', is a
18900 parenthesized abstract declarator. Finally, when T is a
18901 template parameter `(T)' is a
18902 parameter-declaration-clause, and not a parenthesized
18903 named declarator.
18905 We first try and parse a parameter-declaration-clause,
18906 and then try a nested declarator (if FIRST is true).
18908 It is not an error for it not to be a
18909 parameter-declaration-clause, even when FIRST is
18910 false. Consider,
18912 int i (int);
18913 int i (3);
18915 The first is the declaration of a function while the
18916 second is the definition of a variable, including its
18917 initializer.
18919 Having seen only the parenthesis, we cannot know which of
18920 these two alternatives should be selected. Even more
18921 complex are examples like:
18923 int i (int (a));
18924 int i (int (3));
18926 The former is a function-declaration; the latter is a
18927 variable initialization.
18929 Thus again, we try a parameter-declaration-clause, and if
18930 that fails, we back out and return. */
18933 {
18934 tree params;
18937 /* In a member-declarator, the only valid interpretation
18938 of a parenthesis is the start of a
18939 parameter-declaration-clause. (It is invalid to
18940 initialize a static data member with a parenthesized
18941 initializer; only the "=" form of initialization is
18942 permitted.) */
18946 /* Consume the `('. */
18949 {
18950 /* If this is going to be an abstract declarator, we're
18951 in a declarator and we can't have default args. */
18954 }
18958 /* Parse the parameter-declaration-clause. */
18961 /* Consume the `)'. */
18964 /* If all went well, parse the cv-qualifier-seq,
18965 ref-qualifier and the exception-specification. */
18967 {
18968 cp_cv_quals cv_quals;
18969 cp_virt_specifiers virt_specifiers;
18970 cp_ref_qualifier ref_qual;
18971 tree exception_specification;
18972 tree late_return;
18973 tree attrs;
18983 /* Parse the cv-qualifier-seq. */
18985 /* Parse the ref-qualifier. */
18987 /* Parse the tx-qualifier. */
18989 /* And the exception-specification. */
18990 exception_specification
18995 /* In here, we handle cases where attribute is used after
18996 the function declaration. For example:
18997 void func (int x) __attribute__((vector(..))); */
19001 {
19005 CPP_SEMICOLON)
19007 CPP_OPEN_BRACE))
19010 ;
19011 else
19013 }
19015 late_return = (cp_parser_late_return_type_opt
19019 /* Parse the virt-specifier-seq. */
19022 /* Create the function-declarator. */
19024 params,
19025 cv_quals,
19026 virt_specifiers,
19027 ref_qual,
19028 tx_qual,
19029 exception_specification,
19030 late_return,
19031 requires_clause);
19034 /* Any subsequent parameter lists are to do with
19035 return type, so are not those of the declared
19036 function. */
19038 }
19040 /* Remove the function parms from scope. */
19044 /* Repeat the main loop. */
19046 }
19048 /* If this is the first, we can try a parenthesized
19049 declarator. */
19051 {
19057 /* Consume the `('. */
19059 /* Parse the nested declarator. */
19062 declarator
19068 /* Expect a `)'. */
19075 }
19076 /* Otherwise, we must be done. */
19077 else
19079 }
19083 {
19084 /* Parse an array-declarator. */
19093 /* Consume the `['. */
19095 /* Peek at the next token. */
19097 /* If the next token is `]', then there is no
19098 constant-expression. */
19100 {
19102 bounds
19112 {
19113 /* Normally, the array bound must be an integral constant
19114 expression. However, as an extension, we allow VLAs
19115 in function scopes as long as they aren't part of a
19116 parameter declaration. */
19120 }
19123 {
19124 /* Remember this wasn't a constant-expression. */
19127 }
19128 }
19129 else
19131 /* Look for the closing `]'. */
19133 {
19136 }
19141 }
19143 {
19144 {
19145 tree qualifying_scope;
19146 tree unqualified_name;
19147 tree attrs;
19148 special_function_kind sfk;
19153 /* Parse a declarator-id */
19156 {
19159 /* If we see an ellipsis, we should be looking at a
19160 parameter pack. */
19162 {
19163 /* Consume the `...' */
19167 }
19168 }
19171 unqualified_name
19175 {
19179 {
19180 /* Check whether an error occurred. */
19183 /* We already consumed the ellipsis to mark a
19184 parameter pack, but we have no way to report it,
19185 so abort the tentative parse. We will be exiting
19186 immediately anyway. */
19188 }
19189 else
19195 && (qualifying_scope
19197 {
19200 }
19201 }
19206 {
19211 }
19217 {
19218 /* In the declaration of a member of a template class
19219 outside of the class itself, the SCOPE will sometimes
19220 be a TYPENAME_TYPE. For example, given:
19222 template <typename T>
19223 int S<T>::R::i = 3;
19225 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19226 this context, we must resolve S<T>::R to an ordinary
19227 type, rather than a typename type.
19229 The reason we normally avoid resolving TYPENAME_TYPEs
19230 is that a specialization of `S' might render
19231 `S<T>::R' not a type. However, if `S' is
19232 specialized, then this `i' will not be used, so there
19233 is no harm in resolving the types here. */
19234 tree type;
19236 /* Resolve the TYPENAME_TYPE. */
19239 /* If that failed, the declarator is invalid. */
19241 {
19244 "cannot define member of dependent typedef "
19246 else
19251 }
19253 }
19258 {
19259 tree class_type;
19264 else
19268 {
19271 {
19274 {
19278 "use %<%T::%D%> instead of %<%T::%D%> to "
19280 class_type,
19285 }
19286 else
19288 }
19289 else
19290 {
19291 /* We do not attempt to print the declarator
19292 here because we do not have enough
19293 information about its original syntactic
19294 form. */
19298 }
19299 }
19302 {
19308 for an anonymous type, even if the type
19309 got a name for linkage purposes. */
19311 /* Handle correctly (c++/19200):
19313 struct S {
19314 struct T{};
19315 friend void S(T);
19316 };
19318 and also:
19320 namespace N {
19321 void S();
19322 }
19324 struct S {
19325 friend void N::S();
19326 }; */
19327 && !(friend_p
19330 class_type))
19331 {
19334 }
19342 }
19343 }
19345 unqualified_name,
19346 sfk);
19353 }
19355 handle_declarator:;
19358 {
19359 /* Any names that appear after the declarator-id for a
19360 member are looked up in the containing scope. */
19362 {
19363 /* But declarations with qualified-ids can't appear in a
19364 function. */
19368 }
19370 }
19374 /* Default args are only allowed on function
19375 declarations. */
19377 else
19381 }
19382 /* We're done. */
19383 else
19385 }
19387 /* For an abstract declarator, we might wind up with nothing at this
19388 point. That's an error; the declarator is not optional. */
19392 /* If we entered a scope, we must exit it now. */
19400 }
19402 /* Parse a ptr-operator.
19404 ptr-operator:
19405 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19406 * cv-qualifier-seq [opt]
19407 &
19408 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19409 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19411 GNU Extension:
19413 ptr-operator:
19414 & cv-qualifier-seq [opt]
19416 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19417 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19418 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19419 filled in with the TYPE containing the member. *CV_QUALS is
19420 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19421 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19422 Note that the tree codes returned by this function have nothing
19423 to do with the types of trees that will be eventually be created
19424 to represent the pointer or reference type being parsed. They are
19425 just constants with suggestive names. */
19426 static enum tree_code
19431 {
19436 /* Assume that it's not a pointer-to-member. */
19438 /* And that there are no cv-qualifiers. */
19441 /* Peek at the next token. */
19444 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19454 {
19455 /* Consume the `*', `&' or `&&'. */
19458 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19459 `&', if we are allowing GNU extensions. (The only qualifier
19460 that can legally appear after `&' is `restrict', but that is
19461 enforced during semantic analysis. */
19469 }
19470 else
19471 {
19472 /* Try the pointer-to-member case. */
19474 /* Look for the optional `::' operator. */
19477 /* Look for the nested-name specifier. */
19484 /* If we found it, and the next token is a `*', then we are
19485 indeed looking at a pointer-to-member operator. */
19488 {
19489 /* Indicate that the `*' operator was used. */
19497 else
19498 {
19499 /* The type of which the member is a member is given by the
19500 current SCOPE. */
19502 /* The next name will not be qualified. */
19506 /* Look for optional c++11 attributes. */
19510 /* Look for the optional cv-qualifier-seq. */
19512 }
19513 }
19514 /* If that didn't work we don't have a ptr-operator. */
19517 }
19520 }
19522 /* Parse an (optional) cv-qualifier-seq.
19524 cv-qualifier-seq:
19525 cv-qualifier cv-qualifier-seq [opt]
19527 cv-qualifier:
19528 const
19529 volatile
19531 GNU Extension:
19533 cv-qualifier:
19534 __restrict__
19536 Returns a bitmask representing the cv-qualifiers. */
19538 static cp_cv_quals
19540 {
19544 {
19546 cp_cv_quals cv_qualifier;
19548 /* Peek at the next token. */
19550 /* See if it's a cv-qualifier. */
19552 {
19568 }
19574 {
19577 }
19578 else
19579 {
19582 }
19583 }
19586 }
19588 /* Parse an (optional) ref-qualifier
19590 ref-qualifier:
19591 &
19592 &&
19594 Returns cp_ref_qualifier representing ref-qualifier. */
19596 static cp_ref_qualifier
19598 {
19601 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19606 {
19611 {
19623 }
19628 {
19631 }
19632 else
19633 {
19636 }
19637 }
19640 }
19642 /* Parse an optional tx-qualifier.
19644 tx-qualifier:
19645 transaction_safe
19646 transaction_safe_dynamic */
19648 static tree
19650 {
19653 {
19658 {
19662 {
19665 {
19668 }
19669 else
19671 }
19672 }
19673 }
19675 }
19677 /* Parse an (optional) virt-specifier-seq.
19679 virt-specifier-seq:
19680 virt-specifier virt-specifier-seq [opt]
19682 virt-specifier:
19683 override
19684 final
19686 Returns a bitmask representing the virt-specifiers. */
19688 static cp_virt_specifiers
19690 {
19694 {
19696 cp_virt_specifiers virt_specifier;
19698 /* Peek at the next token. */
19700 /* See if it's a virt-specifier-qualifier. */
19704 {
19707 }
19709 {
19712 }
19714 {
19716 }
19717 else
19721 {
19724 }
19725 else
19726 {
19729 }
19730 }
19732 }
19734 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19735 is in scope even though it isn't real. */
19737 void
19739 {
19740 tree this_parm;
19743 {
19744 /* We don't clear this between NSDMIs. Is it already what we want? */
19749 }
19752 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19754 current_class_ref
19757 }
19759 /* Return true iff our current scope is a non-static data member
19760 initializer. */
19762 bool
19764 {
19765 /* We recognize NSDMI context by the context-less 'this' pointer set up
19766 by the function above. */
19772 }
19774 /* Parse a late-specified return type, if any. This is not a separate
19775 non-terminal, but part of a function declarator, which looks like
19777 -> trailing-type-specifier-seq abstract-declarator(opt)
19779 Returns the type indicated by the type-id.
19781 In addition to this, parse any queued up omp declare simd
19782 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19784 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19785 function. */
19787 static tree
19790 {
19794 && declarator
19801 && declarator
19804 /* Peek at the next token. */
19806 /* A late-specified return type is indicated by an initial '->'. */
19817 {
19818 /* DR 1207: 'this' is in scope in the trailing return type. */
19820 }
19823 {
19824 /* Consume the ->. */
19828 }
19830 /* Function declarations may be followed by a trailing
19831 requires-clause. */
19835 declarator->attributes
19839 declarator->attributes
19843 declarator->attributes
19848 {
19851 }
19854 }
19856 /* Parse a declarator-id.
19858 declarator-id:
19859 id-expression
19860 :: [opt] nested-name-specifier [opt] type-name
19862 In the `id-expression' case, the value returned is as for
19863 cp_parser_id_expression if the id-expression was an unqualified-id.
19864 If the id-expression was a qualified-id, then a SCOPE_REF is
19865 returned. The first operand is the scope (either a NAMESPACE_DECL
19866 or TREE_TYPE), but the second is still just a representation of an
19867 unqualified-id. */
19869 static tree
19871 {
19872 tree id;
19873 /* The expression must be an id-expression. Assume that qualified
19874 names are the names of types so that:
19876 template <class T>
19877 int S<T>::R::i = 3;
19879 will work; we must treat `S<T>::R' as the name of a type.
19880 Similarly, assume that qualified names are templates, where
19881 required, so that:
19883 template <class T>
19884 int S<T>::R<T>::i = 3;
19886 will work, too. */
19892 optional_p);
19896 }
19898 /* Parse a type-id.
19900 type-id:
19901 type-specifier-seq abstract-declarator [opt]
19903 Returns the TYPE specified. */
19905 static tree
19908 {
19909 cp_decl_specifier_seq type_specifier_seq;
19912 /* Parse the type-specifier-seq. */
19914 is_trailing_return,
19919 /* There might or might not be an abstract declarator. */
19921 /* Look for the declarator. */
19922 abstract_declarator
19927 /* Check to see if there really was a declarator. */
19932 /* The concepts TS allows 'auto' as a type-id. */
19934 /* None of the valid uses of 'auto' in C++14 involve the type-id
19935 nonterminal, but it is valid in a trailing-return-type. */
19938 {
19939 /* A type-id with type 'auto' is only ok if the abstract declarator
19940 is a function declarator with a late-specified return type.
19942 A type-id with 'auto' is also valid in a trailing-return-type
19943 in a compound-requirement. */
19950 else
19951 {
19954 }
19955 }
19958 is_template_arg);
19959 }
19961 static tree
19963 {
19965 }
19967 static tree
19969 {
19970 tree r;
19972 parser->type_definition_forbidden_message
19977 {
19980 }
19982 }
19984 static tree
19986 {
19988 }
19990 /* Parse a type-specifier-seq.
19992 type-specifier-seq:
19993 type-specifier type-specifier-seq [opt]
19995 GNU extension:
19997 type-specifier-seq:
19998 attributes type-specifier-seq [opt]
20000 If IS_DECLARATION is true, we are at the start of a "condition" or
20001 exception-declaration, so we might be followed by a declarator-id.
20003 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20004 i.e. we've just seen "->".
20006 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20008 static void
20013 {
20018 /* Clear the TYPE_SPECIFIER_SEQ. */
20021 /* In the context of a trailing return type, enum E { } is an
20022 elaborated-type-specifier followed by a function-body, not an
20023 enum-specifier. */
20027 /* Parse the type-specifiers and attributes. */
20029 {
20030 tree type_specifier;
20033 /* Check for attributes first. */
20035 {
20040 }
20042 /* record the token of the beginning of the type specifier seq,
20043 for error reporting purposes*/
20047 /* Look for the type-specifier. */
20049 flags,
20050 type_specifier_seq,
20052 NULL,
20055 {
20056 /* If the first type-specifier could not be found, this is not a
20057 type-specifier-seq at all. */
20059 {
20060 /* Set in_declarator_p to avoid skipping to the semicolon. */
20072 }
20073 /* If subsequent type-specifiers could not be found, the
20074 type-specifier-seq is complete. */
20076 }
20079 /* The standard says that a condition can be:
20081 type-specifier-seq declarator = assignment-expression
20083 However, given:
20085 struct S {};
20086 if (int S = ...)
20088 we should treat the "S" as a declarator, not as a
20089 type-specifier. The standard doesn't say that explicitly for
20090 type-specifier-seq, but it does say that for
20091 decl-specifier-seq in an ordinary declaration. Perhaps it
20092 would be clearer just to allow a decl-specifier-seq here, and
20093 then add a semantic restriction that if any decl-specifiers
20094 that are not type-specifiers appear, the program is invalid. */
20097 }
20098 }
20100 /* Return whether the function currently being declared has an associated
20101 template parameter list. */
20103 static bool
20105 {
20118 }
20120 /* Parse a parameter-declaration-clause.
20122 parameter-declaration-clause:
20123 parameter-declaration-list [opt] ... [opt]
20124 parameter-declaration-list , ...
20126 Returns a representation for the parameter declarations. A return
20127 value of NULL indicates a parameter-declaration-clause consisting
20128 only of an ellipsis. */
20130 static tree
20132 {
20133 tree parameters;
20142 parser->auto_is_implicit_function_template_parm_p
20144 }
20150 && !processing_template_parmlist
20156 /* Peek at the next token. */
20158 /* Check for trivial parameter-declaration-clauses. */
20160 {
20161 /* Consume the `...' token. */
20164 }
20166 /* There are no parameters. */
20167 {
20168 #ifndef NO_IMPLICIT_EXTERN_C
20173 else
20174 #endif
20176 }
20177 /* Check for `(void)', too, which is a special case. */
20181 {
20182 /* Consume the `void' token. */
20184 /* There are no parameters. */
20186 }
20188 /* Parse the parameter-declaration-list. */
20190 /* If a parse error occurred while parsing the
20191 parameter-declaration-list, then the entire
20192 parameter-declaration-clause is erroneous. */
20196 /* Peek at the next token. */
20198 /* If it's a `,', the clause should terminate with an ellipsis. */
20200 {
20201 /* Consume the `,'. */
20203 /* Expect an ellipsis. */
20204 ellipsis_p
20206 }
20207 /* It might also be `...' if the optional trailing `,' was
20208 omitted. */
20210 {
20211 /* Consume the `...' token. */
20213 /* And remember that we saw it. */
20215 }
20216 else
20219 /* Finish the parameter list. */
20224 }
20226 /* Parse a parameter-declaration-list.
20228 parameter-declaration-list:
20229 parameter-declaration
20230 parameter-declaration-list , parameter-declaration
20232 Returns a representation of the parameter-declaration-list, as for
20233 cp_parser_parameter_declaration_clause. However, the
20234 `void_list_node' is never appended to the list. Upon return,
20235 *IS_ERROR will be true iff an error occurred. */
20237 static tree
20239 {
20245 /* Assume all will go well. */
20247 /* The special considerations that apply to a function within an
20248 unbraced linkage specifications do not apply to the parameters
20249 to the function. */
20250 saved_in_unbraced_linkage_specification_p
20254 /* Look for more parameters. */
20256 {
20264 /* Parse the parameter. */
20265 parameter
20270 /* We don't know yet if the enclosing context is deprecated, so wait
20271 and warn in grokparms if appropriate. */
20275 {
20276 /* If a function parameter pack was specified and an implicit template
20277 parameter was introduced during cp_parser_parameter_declaration,
20278 change any implicit parameters introduced into packs. */
20282 {
20290 }
20294 PARM,
20297 }
20301 /* If a parse error occurred parsing the parameter declaration,
20302 then the entire parameter-declaration-list is erroneous. */
20304 {
20308 }
20318 {
20322 }
20324 /* Add the new parameter to the list. */
20328 /* Peek at the next token. */
20331 /* These are for Objective-C++ */
20334 /* The parameter-declaration-list is complete. */
20337 {
20340 /* Peek at the next token. */
20342 /* If it's an ellipsis, then the list is complete. */
20345 /* Otherwise, there must be more parameters. Consume the
20346 `,'. */
20348 /* When parsing something like:
20350 int i(float f, double d)
20352 we can tell after seeing the declaration for "f" that we
20353 are not looking at an initialization of a variable "i",
20354 but rather at the declaration of a function "i".
20356 Due to the fact that the parsing of template arguments
20357 (as specified to a template-id) requires backtracking we
20358 cannot use this technique when inside a template argument
20359 list. */
20363 /* However, a parameter-declaration of the form
20364 "float(f)" (which is a valid declaration of a
20365 parameter "f") can also be interpreted as an
20366 expression (the conversion of "f" to "float"). */
20369 }
20370 else
20371 {
20379 }
20380 }
20382 parser->in_unbraced_linkage_specification_p
20385 /* Reset implicit_template_scope if we are about to leave the function
20386 parameter list that introduced it. Note that for out-of-line member
20387 definitions, there will be one or more class scopes before we get to
20388 the template parameter scope. */
20392 {
20396 {
20399 }
20400 }
20403 }
20405 /* Parse a parameter declaration.
20407 parameter-declaration:
20408 decl-specifier-seq ... [opt] declarator
20409 decl-specifier-seq declarator = assignment-expression
20410 decl-specifier-seq ... [opt] abstract-declarator [opt]
20411 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20413 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20414 declares a template parameter. (In that case, a non-nested `>'
20415 token encountered during the parsing of the assignment-expression
20416 is not interpreted as a greater-than operator.)
20418 Returns a representation of the parameter, or NULL if an error
20419 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20420 true iff the declarator is of the form "(p)". */
20426 {
20428 cp_decl_specifier_seq decl_specifiers;
20430 tree default_argument;
20435 /* In a template parameter, `>' is not an operator.
20437 [temp.param]
20439 When parsing a default template-argument for a non-type
20440 template-parameter, the first non-nested `>' is taken as the end
20441 of the template parameter-list rather than a greater-than
20442 operator. */
20444 /* Type definitions may not appear in parameter types. */
20446 parser->type_definition_forbidden_message
20449 /* Parse the declaration-specifiers. */
20451 CP_PARSER_FLAGS_NONE,
20455 /* Complain about missing 'typename' or other invalid type names. */
20460 /* If an error occurred, there's no reason to attempt to parse the
20461 rest of the declaration. */
20463 {
20466 }
20468 /* Peek at the next token. */
20471 /* If the next token is a `)', `,', `=', `>', or `...', then there
20472 is no declarator. However, when variadic templates are enabled,
20473 there may be a declarator following `...'. */
20478 {
20482 }
20483 /* Otherwise, there should be a declarator. */
20484 else
20485 {
20489 /* After seeing a decl-specifier-seq, if the next token is not a
20490 "(", there is no possibility that the code is a valid
20491 expression. Therefore, if parsing tentatively, we commit at
20492 this point. */
20494 /* In an expression context, having seen:
20496 (int((char ...
20498 we cannot be sure whether we are looking at a
20499 function-type (taking a "char" as a parameter) or a cast
20500 of some object of type "char" to "int". */
20506 /* Parse the declarator. */
20509 CP_PARSER_DECLARATOR_EITHER,
20511 parenthesized_p,
20515 /* After the declarator, allow more attributes. */
20516 decl_specifiers.attributes
20520 /* If the declarator is a template parameter pack, remember that and
20521 clear the flag in the declarator itself so we don't get errors
20522 from grokdeclarator. */
20524 {
20527 }
20528 }
20530 /* If the next token is an ellipsis, and we have not seen a declarator
20531 name, and if either the type of the declarator contains parameter
20532 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20533 for, eg, abbreviated integral type names), then we actually have a
20534 parameter pack expansion expression. Otherwise, leave the ellipsis
20535 for a C-style variadic function. */
20538 {
20549 {
20550 /* Consume the `...'. */
20554 /* Build a pack expansion type */
20559 else
20561 }
20562 }
20564 /* The restriction on defining new types applies only to the type
20565 of the parameter, not to the default argument. */
20568 /* If the next token is `=', then process a default argument. */
20570 {
20573 /* If we are defining a class, then the tokens that make up the
20574 default argument must be saved and processed later. */
20580 // A constrained-type-specifier may declare a type template-parameter.
20582 default_argument
20585 // A constrained-type-specifier may declare a template-template-parameter.
20587 default_argument
20590 /* Outside of a class definition, we can just parse the
20591 assignment-expression. */
20592 else
20593 default_argument
20597 {
20599 "default arguments are only "
20601 }
20603 || template_parameter_pack_p
20606 {
20607 /* Find the name of the parameter pack. */
20614 template_parm_p
20620 else
20622 template_parm_p
20629 }
20630 }
20631 else
20635 declarator,
20636 default_argument,
20637 template_parameter_pack_p);
20638 }
20640 /* Parse a default argument and return it.
20642 TEMPLATE_PARM_P is true if this is a default argument for a
20643 non-type template parameter. */
20644 static tree
20646 {
20652 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20653 set correctly. */
20656 /* Local variable names (and the `this' keyword) may not
20657 appear in a default argument. */
20660 /* Parse the assignment-expression. */
20665 /* The "this" pointer is not valid in a default argument. */
20667 {
20672 }
20673 default_argument
20675 /* Restore the "this" pointer. */
20677 {
20680 }
20689 }
20691 /* Parse a function-body.
20693 function-body:
20694 compound_statement */
20696 static void
20698 {
20702 }
20704 /* Parse a ctor-initializer-opt followed by a function-body. Return
20705 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20706 is true we are parsing a function-try-block. */
20708 static bool
20711 {
20719 /* Begin the function body. */
20721 /* Parse the optional ctor-initializer. */
20724 /* If we're parsing a constexpr constructor definition, we need
20725 to check that the constructor body is indeed empty. However,
20726 before we get to cp_parser_function_body lot of junk has been
20727 generated, so we can't just check that we have an empty block.
20728 Rather we take a snapshot of the outermost block, and check whether
20729 cp_parser_function_body changed its state. */
20731 {
20735 }
20736 /* Parse the function-body. */
20740 /* Finish the function body. */
20744 }
20746 /* Parse an initializer.
20748 initializer:
20749 = initializer-clause
20750 ( expression-list )
20752 Returns an expression representing the initializer. If no
20753 initializer is present, NULL_TREE is returned.
20755 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20756 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20757 set to TRUE if there is no initializer present. If there is an
20758 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20759 is set to true; otherwise it is set to false. */
20761 static tree
20764 {
20766 tree init;
20768 /* Peek at the next token. */
20771 /* Let our caller know whether or not this initializer was
20772 parenthesized. */
20774 /* Assume that the initializer is constant. */
20778 {
20779 /* Consume the `='. */
20781 /* Parse the initializer-clause. */
20783 }
20785 {
20790 non_constant_p);
20795 }
20797 {
20802 }
20803 else
20804 {
20805 /* Anything else is an error. */
20808 }
20814 }
20816 /* Parse an initializer-clause.
20818 initializer-clause:
20819 assignment-expression
20820 braced-init-list
20822 Returns an expression representing the initializer.
20824 If the `assignment-expression' production is used the value
20825 returned is simply a representation for the expression.
20827 Otherwise, calls cp_parser_braced_list. */
20829 static cp_expr
20831 {
20832 cp_expr initializer;
20834 /* Assume the expression is constant. */
20837 /* If it is not a `{', then we are looking at an
20838 assignment-expression. */
20840 {
20841 initializer
20844 non_constant_p);
20845 }
20846 else
20850 }
20852 /* Parse a brace-enclosed initializer list.
20854 braced-init-list:
20855 { initializer-list , [opt] }
20856 { }
20858 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20859 the elements of the initializer-list (or NULL, if the last
20860 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20861 NULL_TREE. There is no way to detect whether or not the optional
20862 trailing `,' was provided. NON_CONSTANT_P is as for
20863 cp_parser_initializer. */
20865 static cp_expr
20867 {
20868 tree initializer;
20871 /* Consume the `{' token. */
20873 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20875 /* If it's not a `}', then there is a non-trivial initializer. */
20877 {
20878 /* Parse the initializer list. */
20881 /* A trailing `,' token is allowed. */
20884 }
20885 else
20887 /* Now, there should be a trailing `}'. */
20893 /* Build a location of the form:
20894 { ... }
20895 ^~~~~~~
20896 with caret==start at the open brace, finish at the close brace. */
20900 }
20902 /* Consume tokens up to, and including, the next non-nested closing `]'.
20903 Returns true iff we found a closing `]'. */
20905 static bool
20907 {
20911 {
20915 {
20918 /* If we've run out of tokens, then there is no closing `]'. */
20927 {
20930 }
20935 }
20937 /* Consume the token. */
20939 }
20940 }
20942 /* Return true if we are looking at an array-designator, false otherwise. */
20944 static bool
20946 {
20947 /* Consume the `['. */
20952 /* Skip tokens until the next token is a closing square bracket.
20953 If we find the closing `]', and the next token is a `=', then
20954 we are looking at an array designator. */
20955 bool array_designator_p
20959 /* Roll back the tokens we skipped. */
20963 }
20965 /* Parse an initializer-list.
20967 initializer-list:
20968 initializer-clause ... [opt]
20969 initializer-list , initializer-clause ... [opt]
20971 GNU Extension:
20973 initializer-list:
20974 designation initializer-clause ...[opt]
20975 initializer-list , designation initializer-clause ...[opt]
20977 designation:
20978 . identifier =
20979 identifier :
20980 [ constant-expression ] =
20982 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20983 for the initializer. If the INDEX of the elt is non-NULL, it is the
20984 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20985 as for cp_parser_initializer. */
20989 {
20992 /* Assume all of the expressions are constant. */
20995 /* Parse the rest of the list. */
20997 {
20999 tree designator;
21000 tree initializer;
21003 /* If the next token is an identifier and the following one is a
21004 colon, we are looking at the GNU designated-initializer
21005 syntax. */
21009 {
21010 /* Warn the user that they are using an extension. */
21013 /* Consume the identifier. */
21015 /* Consume the `:'. */
21017 }
21018 /* Also handle the C99 syntax, '. id ='. */
21023 {
21024 /* Warn the user that they are using an extension. */
21027 /* Consume the `.'. */
21029 /* Consume the identifier. */
21031 /* Consume the `='. */
21033 }
21034 /* Also handle C99 array designators, '[ const ] ='. */
21038 {
21039 /* In C++11, [ could start a lambda-introducer. */
21045 {
21048 }
21049 else
21050 {
21055 }
21061 }
21062 else
21065 /* Parse the initializer. */
21068 /* If any clause is non-constant, so is the entire initializer. */
21072 /* If we have an ellipsis, this is an initializer pack
21073 expansion. */
21075 {
21076 /* Consume the `...'. */
21079 /* Turn the initializer into an initializer expansion. */
21081 }
21083 /* Add it to the vector. */
21086 /* If the next token is not a comma, we have reached the end of
21087 the list. */
21091 /* Peek at the next token. */
21093 /* If the next token is a `}', then we're still done. An
21094 initializer-clause can have a trailing `,' after the
21095 initializer-list and before the closing `}'. */
21099 /* Consume the `,' token. */
21101 }
21104 }
21106 /* Classes [gram.class] */
21108 /* Parse a class-name.
21110 class-name:
21111 identifier
21112 template-id
21114 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21115 to indicate that names looked up in dependent types should be
21116 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21117 keyword has been used to indicate that the name that appears next
21118 is a template. TAG_TYPE indicates the explicit tag given before
21119 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21120 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21121 is the class being defined in a class-head. If ENUM_OK is TRUE,
21122 enum-names are also accepted.
21124 Returns the TYPE_DECL representing the class. */
21126 static tree
21135 {
21136 tree decl;
21137 tree scope;
21142 /* All class-names start with an identifier. */
21145 {
21148 }
21150 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21151 to a template-id, so we save it here. */
21156 /* Any name names a type if we're following the `typename' keyword
21157 in a qualified name where the enclosing scope is type-dependent. */
21160 /* Handle the common case (an identifier, but not a template-id)
21161 efficiently. */
21164 {
21168 /* Look for the identifier. */
21172 /* If the next token isn't an identifier, we are certainly not
21173 looking at a class-name. */
21176 /* If we know this is a type-name, there's no need to look it
21177 up. */
21180 else
21181 {
21182 tree ambiguous_decls;
21183 /* If we already know that this lookup is ambiguous, then
21184 we've already issued an error message; there's no reason
21185 to check again. */
21187 {
21190 }
21191 /* If the next token is a `::', then the name must be a type
21192 name.
21194 [basic.lookup.qual]
21196 During the lookup for a name preceding the :: scope
21197 resolution operator, object, function, and enumerator
21198 names are ignored. */
21201 /* Look up the name. */
21203 tag_type,
21206 check_dependency_p,
21210 {
21214 }
21215 }
21216 }
21217 else
21218 {
21219 /* Try a template-id. */
21221 check_dependency_p,
21222 tag_type,
21223 is_declaration);
21226 }
21230 /* If this is a typename, create a TYPENAME_TYPE. */
21232 {
21237 }
21241 /* Check to see that it is really the name of a class. */
21245 /* Situations like this:
21247 template <typename T> struct A {
21248 typename T::template X<int>::I i;
21249 };
21251 are problematic. Is `T::template X<int>' a class-name? The
21252 standard does not seem to be definitive, but there is no other
21253 valid interpretation of the following `::'. Therefore, those
21254 names are considered class-names. */
21255 {
21259 }
21264 /* In Objective-C 2.0, a classname followed by '.' starts a
21265 dot-syntax expression, and it's not a type-name. */
21277 }
21279 /* Parse a class-specifier.
21281 class-specifier:
21282 class-head { member-specification [opt] }
21284 Returns the TREE_TYPE representing the class. */
21286 static tree
21288 {
21289 tree type;
21303 /* Parse the class-head. */
21306 /* If the class-head was a semantic disaster, skip the entire body
21307 of the class. */
21309 {
21313 }
21315 /* Look for the `{'. */
21317 {
21320 }
21325 /* Issue an error message if type-definitions are forbidden here. */
21327 /* Remember that we are defining one more class. */
21329 /* Inside the class, surrounding template-parameter-lists do not
21330 apply. */
21331 saved_num_template_parameter_lists
21334 /* We are not in a function body. */
21337 /* Or in a loop. */
21340 /* Or in a switch. */
21343 /* We are not immediately inside an extern "lang" block. */
21344 saved_in_unbraced_linkage_specification_p
21348 // Associate constraints with the type.
21352 /* Start the class. */
21354 {
21357 }
21361 /* If the type is erroneous, skip the entire body of the class. */
21363 else
21364 /* Parse the member-specification. */
21367 /* Look for the trailing `}'. */
21369 /* Look for trailing attributes to apply to this class. */
21377 /* We've finished a type definition. Check for the common syntax
21378 error of forgetting a semicolon after the definition. We need to
21379 be careful, as we can't just check for not-a-semicolon and be done
21380 with it; the user might have typed:
21382 class X { } c = ...;
21383 class X { } *p = ...;
21385 and so forth. Instead, enumerate all the possible tokens that
21386 might follow this production; if we don't see one of them, then
21387 complain and silently insert the semicolon. */
21388 {
21393 /* Don't try to parse c++11 attributes here. As per the
21394 grammar, that should be a task for
21395 cp_parser_decl_specifier_seq. */
21399 {
21410 /* While it's legal for type qualifiers and storage class
21411 specifiers to follow type definitions in the grammar, only
21412 compiler testsuites contain code like that. Assume that if
21413 we see such code, then what we're really seeing is a case
21414 like:
21416 class X { }
21417 const <type> var = ...;
21419 or
21421 class Y { }
21422 static <type> func (...) ...
21424 i.e. the qualifier or specifier applies to the next
21425 declaration. To do so, however, we need to look ahead one
21426 more token to see if *that* token is a type specifier.
21428 This code could be improved to handle:
21430 class Z { }
21431 static const <type> var = ...; */
21434 {
21437 /* Handling user-defined types here would be nice, but very
21438 tricky. */
21439 want_semicolon
21442 }
21446 }
21448 /* If we don't have a type, then something is very wrong and we
21449 shouldn't try to do anything clever. Likewise for not seeing the
21450 closing brace. */
21452 {
21453 cp_token_position prev
21464 else
21467 /* Unget one token and smash it to look as though we encountered
21468 a semicolon in the input stream. */
21473 }
21474 }
21476 /* If this class is not itself within the scope of another class,
21477 then we need to parse the bodies of all of the queued function
21478 definitions. Note that the queued functions defined in a class
21479 are not always processed immediately following the
21480 class-specifier for that class. Consider:
21482 struct A {
21483 struct B { void f() { sizeof (A); } };
21484 };
21486 If `f' were processed before the processing of `A' were
21487 completed, there would be no way to compute the size of `A'.
21488 Note that the nesting we are interested in here is lexical --
21489 not the semantic nesting given by TYPE_CONTEXT. In particular,
21490 for:
21492 struct A { struct B; };
21493 struct A::B { void f() { } };
21495 there is no need to delay the parsing of `A::B::f'. */
21497 {
21498 tree decl;
21505 /* In a first pass, parse default arguments to the functions.
21506 Then, in a second pass, parse the bodies of the functions.
21507 This two-phased approach handles cases like:
21509 struct S {
21510 void f() { g(); }
21511 void g(int i = 3);
21512 };
21514 */
21516 {
21518 /* If there are default arguments that have not yet been processed,
21519 take care of them now. */
21521 {
21526 }
21527 /* Make sure that any template parameters are in scope. */
21529 /* Parse the default argument expressions. */
21531 /* Remove any template parameters from the symbol table. */
21533 }
21535 /* Now parse any NSDMIs. */
21539 {
21541 {
21546 }
21549 }
21556 /* Now do some post-NSDMI bookkeeping. */
21562 /* Now parse the body of the functions. */
21564 {
21565 /* OpenMP UDRs need to be parsed before all other functions. */
21572 }
21573 else
21577 }
21578 else
21581 /* Put back any saved access checks. */
21584 /* Restore saved state. */
21588 parser->num_template_parameter_lists
21590 parser->in_unbraced_linkage_specification_p
21594 }
21596 static tree
21598 {
21599 tree ret;
21604 }
21606 /* Parse a class-head.
21608 class-head:
21609 class-key identifier [opt] base-clause [opt]
21610 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21611 class-key nested-name-specifier [opt] template-id
21612 base-clause [opt]
21614 class-virt-specifier:
21615 final
21617 GNU Extensions:
21618 class-key attributes identifier [opt] base-clause [opt]
21619 class-key attributes nested-name-specifier identifier base-clause [opt]
21620 class-key attributes nested-name-specifier [opt] template-id
21621 base-clause [opt]
21623 Upon return BASES is initialized to the list of base classes (or
21624 NULL, if there are none) in the same form returned by
21625 cp_parser_base_clause.
21627 Returns the TYPE of the indicated class. Sets
21628 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21629 involving a nested-name-specifier was used, and FALSE otherwise.
21631 Returns error_mark_node if this is not a class-head.
21633 Returns NULL_TREE if the class-head is syntactically valid, but
21634 semantically invalid in a way that means we should skip the entire
21635 body of the class. */
21637 static tree
21640 {
21641 tree nested_name_specifier;
21645 tree attributes;
21646 tree bases;
21656 /* Assume no nested-name-specifier will be present. */
21658 /* Assume no template parameter lists will be used in defining the
21659 type. */
21663 /* Look for the class-key. */
21670 /* Parse the attributes. */
21673 /* If the next token is `::', that is invalid -- but sometimes
21674 people do try to write:
21676 struct ::S {};
21678 Handle this gracefully by accepting the extra qualifier, and then
21679 issuing an error about it later if this really is a
21680 class-head. If it turns out just to be an elaborated type
21681 specifier, remain silent. */
21687 /* Determine the name of the class. Begin by looking for an
21688 optional nested-name-specifier. */
21690 nested_name_specifier
21696 /* If there was a nested-name-specifier, then there *must* be an
21697 identifier. */
21699 {
21701 /* Although the grammar says `identifier', it really means
21702 `class-name' or `template-name'. You are only allowed to
21703 define a class that has already been declared with this
21704 syntax.
21706 The proposed resolution for Core Issue 180 says that wherever
21707 you see `class T::X' you should treat `X' as a type-name.
21709 It is OK to define an inaccessible class; for example:
21711 class A { class B; };
21712 class A::B {};
21714 We do not know if we will see a class-name, or a
21715 template-name. We look for a class-name first, in case the
21716 class-name is a template-id; if we looked for the
21717 template-name first we would stop after the template-name. */
21722 class_type,
21726 /* If that didn't work, ignore the nested-name-specifier. */
21728 {
21734 }
21735 /* If we could not find a corresponding TYPE, treat this
21736 declaration like an unqualified declaration. */
21739 /* Otherwise, count the number of templates used in TYPE and its
21740 containing scopes. */
21741 else
21742 {
21743 tree scope;
21755 }
21756 }
21757 /* Otherwise, the identifier is optional. */
21758 else
21759 {
21760 /* We don't know whether what comes next is a template-id,
21761 an identifier, or nothing at all. */
21763 /* Check for a template-id. */
21768 class_key,
21770 /* If that didn't work, it could still be an identifier. */
21772 {
21774 {
21777 }
21778 else
21780 }
21781 else
21782 {
21785 }
21786 }
21791 {
21793 class_key,
21795 }
21798 /* If it's not a `:' or a `{' then we can't really be looking at a
21799 class-head, since a class-head only appears as part of a
21800 class-specifier. We have to detect this situation before calling
21801 xref_tag, since that has irreversible side-effects. */
21803 {
21807 }
21809 /* At this point, we're going ahead with the class-specifier, even
21810 if some other problem occurs. */
21813 {
21818 }
21819 /* Issue the error about the overly-qualified name now. */
21821 {
21826 }
21828 {
21833 }
21835 {
21836 tree scope;
21838 /* Reject typedef-names in class heads. */
21840 {
21843 type);
21846 }
21848 /* Figure out in what scope the declaration is being placed. */
21850 /* If that scope does not contain the scope in which the
21851 class was originally declared, the program is invalid. */
21853 {
21856 "declaration of %qD in namespace %qD which does not "
21859 else
21865 }
21866 /* [dcl.meaning]
21868 A declarator-id shall not be qualified except for the
21869 definition of a ... nested class outside of its class
21870 ... [or] the definition or explicit instantiation of a
21871 class member of a namespace outside of its namespace. */
21873 {
21878 }
21879 }
21880 /* An explicit-specialization must be preceded by "template <>". If
21881 it is not, try to recover gracefully. */
21885 {
21886 /* Build a location of this form:
21887 struct typename <ARGS>
21888 ^~~~~~~~~~~~~~~~~~~~~~
21889 with caret==start at the start token, and
21890 finishing at the end of the type. */
21891 location_t reported_loc
21893 class_head_start_location,
21897 error_at_rich_loc
21901 /* Take the same action that would have been taken by
21902 cp_parser_explicit_specialization. */
21905 }
21906 /* There must be no "return" statements between this point and the
21907 end of this function; set "type "to the correct return value and
21908 use "goto done;" to return. */
21909 /* Make sure that the right number of template parameters were
21910 present. */
21914 {
21915 /* If something went wrong, there is no point in even trying to
21916 process the class-definition. */
21919 }
21921 /* Look up the type. */
21923 {
21927 {
21931 }
21932 else
21933 {
21936 }
21939 }
21941 {
21942 tree class_type;
21944 /* Given:
21946 template <typename T> struct S { struct T };
21947 template <typename T> struct S<T>::T { };
21949 we will get a TYPENAME_TYPE when processing the definition of
21950 `S::T'. We need to resolve it to the actual type before we
21951 try to define it. */
21953 {
21958 else
21959 {
21962 }
21963 }
21967 {
21970 }
21973 /* Enter the scope indicated by the nested-name-specifier. */
21975 /* Get the canonical version of this type. */
21977 /* Call push_template_decl if it seems like we should be defining a
21978 template either from the template headers or the type we're
21979 defining, so that we diagnose both extra and missing headers. */
21983 {
21986 {
21989 }
21990 }
21994 }
21996 {
21997 /* If the class was unnamed, create a dummy name. */
22002 }
22004 /* Indicate whether this class was declared as a `class' or as a
22005 `struct'. */
22010 /* If this type was already complete, and we see another definition,
22011 that's an error. */
22013 {
22015 type);
22017 type);
22020 }
22025 {
22026 /* Apply attributes now, before any use of the class as a template
22027 argument in its base list. */
22030 }
22032 /* We will have entered the scope containing the class; the names of
22033 base classes should be looked up in that context. For example:
22035 struct A { struct B {}; struct C; };
22036 struct A::C : B {};
22038 is valid. */
22040 /* Get the list of base-classes, if there is one. */
22042 {
22043 /* PR59482: enter the class scope so that base-specifiers are looked
22044 up correctly. */
22048 /* PR59482: get out of the previously pushed class scope so that the
22049 subsequent pops pop the right thing. */
22052 }
22053 else
22056 /* If we're really defining a class, process the base classes.
22057 If they're invalid, fail. */
22061 done:
22062 /* Leave the scope given by the nested-name-specifier. We will
22063 enter the class scope itself while processing the members. */
22068 {
22071 }
22077 out:
22080 }
22082 /* Parse a class-key.
22084 class-key:
22085 class
22086 struct
22087 union
22089 Returns the kind of class-key specified, or none_type to indicate
22090 error. */
22092 static enum tag_types
22094 {
22098 /* Look for the class-key. */
22103 /* Check to see if the TOKEN is a class-key. */
22108 }
22110 /* Parse a type-parameter-key.
22112 type-parameter-key:
22113 class
22114 typename
22115 */
22117 static void
22119 {
22120 /* Look for the type-parameter-key. */
22124 {
22127 /* typename is not allowed in a template template parameter
22128 by the standard until C++1Z. */
22130 "ISO C++ forbids typename key in template template parameter;"
22132 }
22133 else
22137 }
22139 /* Parse an (optional) member-specification.
22141 member-specification:
22142 member-declaration member-specification [opt]
22143 access-specifier : member-specification [opt] */
22145 static void
22147 {
22149 {
22153 /* Peek at the next token. */
22155 /* If it's a `}', or EOF then we've seen all the members. */
22161 /* See if this token is a keyword. */
22164 {
22168 /* Consume the access-specifier. */
22170 /* Remember which access-specifier is active. */
22172 /* Look for the `:'. */
22177 /* Accept #pragmas at class scope. */
22179 {
22182 }
22184 /* Otherwise, the next construction must be a
22185 member-declaration. */
22187 }
22188 }
22189 }
22191 /* Parse a member-declaration.
22193 member-declaration:
22194 decl-specifier-seq [opt] member-declarator-list [opt] ;
22195 function-definition ; [opt]
22196 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22197 using-declaration
22198 template-declaration
22199 alias-declaration
22201 member-declarator-list:
22202 member-declarator
22203 member-declarator-list , member-declarator
22205 member-declarator:
22206 declarator pure-specifier [opt]
22207 declarator constant-initializer [opt]
22208 identifier [opt] : constant-expression
22210 GNU Extensions:
22212 member-declaration:
22213 __extension__ member-declaration
22215 member-declarator:
22216 declarator attributes [opt] pure-specifier [opt]
22217 declarator attributes [opt] constant-initializer [opt]
22218 identifier [opt] attributes [opt] : constant-expression
22220 C++0x Extensions:
22222 member-declaration:
22223 static_assert-declaration */
22225 static void
22227 {
22228 cp_decl_specifier_seq decl_specifiers;
22229 tree prefix_attributes;
22230 tree decl;
22239 /* Check for the `__extension__' keyword. */
22241 {
22242 /* Recurse. */
22244 /* Restore the old value of the PEDANTIC flag. */
22248 }
22250 /* Check for a template-declaration. */
22252 {
22253 /* An explicit specialization here is an error condition, and we
22254 expect the specialization handler to detect and report this. */
22258 else
22262 }
22263 /* Check for a template introduction. */
22267 /* Check for a using-declaration. */
22269 {
22271 {
22272 /* Parse the using-declaration. */
22276 }
22277 else
22278 {
22279 tree decl;
22283 /* Note that if we actually see the '=' token after the
22284 identifier, cp_parser_alias_declaration commits the
22285 tentative parse. In that case, we really expect an
22286 alias-declaration. Otherwise, we expect a using
22287 declaration. */
22288 alias_decl_expected =
22294 else
22298 }
22299 }
22301 /* Check for @defs. */
22303 {
22308 {
22313 }
22315 }
22317 /* If the next token is `static_assert' we have a static assertion. */
22319 {
22322 }
22329 /* Parse the decl-specifier-seq. */
22332 CP_PARSER_FLAGS_OPTIONAL,
22335 /* Check for an invalid type-name. */
22339 /* If there is no declarator, then the decl-specifier-seq should
22340 specify a type. */
22342 {
22343 /* If there was no decl-specifier-seq, and the next token is a
22344 `;', then we have something like:
22346 struct S { ; };
22348 [class.mem]
22350 Each member-declaration shall declare at least one member
22351 name of the class. */
22353 {
22357 }
22358 else
22359 {
22360 tree type;
22362 /* See if this declaration is a friend. */
22364 /* If there were decl-specifiers, check to see if there was
22365 a class-declaration. */
22368 /* Nested classes have already been added to the class, but
22369 a `friend' needs to be explicitly registered. */
22371 {
22372 /* If the `friend' keyword was present, the friend must
22373 be introduced with a class-key. */
22376 "in C++03 a class-key must be used "
22378 /* In this case:
22380 template <typename T> struct A {
22381 friend struct A<T>::B;
22382 };
22384 A<T>::B will be represented by a TYPENAME_TYPE, and
22385 therefore not recognized by check_tag_decl. */
22387 {
22391 }
22394 "friend declaration does not name a class or "
22396 else
22399 }
22400 /* If there is no TYPE, an error message will already have
22401 been issued. */
22403 ;
22404 /* An anonymous aggregate has to be handled specially; such
22405 a declaration really declares a data member (with a
22406 particular type), as opposed to a nested class. */
22408 {
22409 /* C++11 9.5/6. */
22412 "a storage class on an anonymous aggregate "
22415 /* Remove constructors and such from TYPE, now that we
22416 know it is an anonymous aggregate. */
22418 /* And make the corresponding data member. */
22421 /* Add it to the class. */
22423 }
22424 else
22425 cp_parser_check_access_in_redeclaration
22428 }
22429 }
22430 else
22431 {
22434 /* Clear attributes from the decl_specifiers but keep them
22435 around as prefix attributes that apply them to the entity
22436 being declared. */
22440 /* See if these declarations will be friends. */
22443 /* Keep going until we hit the `;' at the end of the
22444 declaration. */
22446 {
22448 tree first_attribute;
22450 /* Peek at the next token. */
22453 /* Check for a bitfield declaration. */
22458 {
22459 tree identifier;
22460 tree width;
22462 /* Get the name of the bitfield. Note that we cannot just
22463 check TOKEN here because it may have been invalidated by
22464 the call to cp_lexer_peek_nth_token above. */
22467 else
22470 /* Consume the `:' token. */
22472 /* Get the width of the bitfield. */
22473 width
22476 /* Look for attributes that apply to the bitfield. */
22478 /* Remember which attributes are prefix attributes and
22479 which are not. */
22481 /* Combine the attributes. */
22484 /* Create the bitfield declaration. */
22487 identifier,
22488 sfk_none)
22491 width,
22492 attributes);
22493 }
22494 else
22495 {
22497 tree initializer;
22498 tree asm_specification;
22501 /* Parse the declarator. */
22502 declarator
22507 friend_p);
22509 /* If something went wrong parsing the declarator, make sure
22510 that we at least consume some tokens. */
22512 {
22513 /* Skip to the end of the statement. */
22515 /* If the next token is not a semicolon, that is
22516 probably because we just skipped over the body of
22517 a function. So, we consume a semicolon if
22518 present, but do not issue an error message if it
22519 is not present. */
22521 CPP_SEMICOLON))
22524 }
22527 cp_parser_check_for_definition_in_return_type
22531 /* Look for an asm-specification. */
22533 /* Look for attributes that apply to the declaration. */
22535 /* Remember which attributes are prefix attributes and
22536 which are not. */
22538 /* Combine the attributes. */
22541 /* If it's an `=', then we have a constant-initializer or a
22542 pure-specifier. It is not correct to parse the
22543 initializer before registering the member declaration
22544 since the member declaration should be in scope while
22545 its initializer is processed. However, the rest of the
22546 front end does not yet provide an interface that allows
22547 us to handle this correctly. */
22549 {
22550 /* In [class.mem]:
22552 A pure-specifier shall be used only in the declaration of
22553 a virtual function.
22555 A member-declarator can contain a constant-initializer
22556 only if it declares a static member of integral or
22557 enumeration type.
22559 Therefore, if the DECLARATOR is for a function, we look
22560 for a pure-specifier; otherwise, we look for a
22561 constant-initializer. When we call `grokfield', it will
22562 perform more stringent semantics checks. */
22574 {
22576 /* Don't require a constant rvalue in C++11, since we
22577 might want a reference constant. We'll enforce
22578 constancy later. */
22580 /* Parse the initializer. */
22583 }
22584 else
22585 /* Parse the initializer. */
22587 }
22590 {
22594 else
22596 }
22597 /* Otherwise, there is no initializer. */
22598 else
22601 /* See if we are probably looking at a function
22602 definition. We are certainly not looking at a
22603 member-declarator. Calling `grokfield' has
22604 side-effects, so we must not do it unless we are sure
22605 that we are looking at a member-declarator. */
22608 {
22609 /* The grammar does not allow a pure-specifier to be
22610 used when a member function is defined. (It is
22611 possible that this fact is an oversight in the
22612 standard, since a pure function may be defined
22613 outside of the class-specifier. */
22619 declarator,
22620 attributes);
22623 /* If the member was not a friend, declare it here. */
22626 /* Peek at the next token. */
22628 /* If the next token is a semicolon, consume it. */
22632 }
22633 else
22636 /* Create the declaration. */
22641 {
22644 else
22646 }
22647 }
22652 /* Reset PREFIX_ATTRIBUTES. */
22658 /* If there is any qualification still in effect, clear it
22659 now; we will be starting fresh with the next declarator. */
22663 /* If it's a `,', then there are more declarators. */
22665 {
22668 {
22672 }
22673 }
22674 /* If the next token isn't a `;', then we have a parse error. */
22676 CPP_SEMICOLON))
22677 {
22678 /* The next token might be a ways away from where the
22679 actual semicolon is missing. Find the previous token
22680 and use that for our error position. */
22685 /* Assume that the user meant to provide a semicolon. If
22686 we were to cp_parser_skip_to_end_of_statement, we might
22687 skip to a semicolon inside a member function definition
22688 and issue nonsensical error messages. */
22690 }
22693 {
22694 /* Add DECL to the list of members. */
22696 /* Explicitly include, eg, NSDMIs, for better error
22697 recovery (c++/58650). */
22706 /* Add DECL to the queue of NSDMI to be parsed later. */
22708 }
22712 }
22713 }
22716 out:
22718 }
22720 /* Parse a pure-specifier.
22722 pure-specifier:
22723 = 0
22725 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22726 Otherwise, ERROR_MARK_NODE is returned. */
22728 static tree
22730 {
22733 /* Look for the `=' token. */
22736 /* Look for the `0' token. */
22745 /* Accept = default or = delete in c++0x mode. */
22748 {
22751 }
22753 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22755 {
22760 }
22762 {
22765 }
22768 }
22770 /* Parse a constant-initializer.
22772 constant-initializer:
22773 = constant-expression
22775 Returns a representation of the constant-expression. */
22777 static tree
22779 {
22780 /* Look for the `=' token. */
22784 /* It is invalid to write:
22786 struct S { static const int i = { 7 }; };
22788 */
22790 {
22793 /* Consume the opening brace. */
22795 /* Skip the initializer. */
22797 /* Look for the trailing `}'. */
22801 }
22804 }
22806 /* Derived classes [gram.class.derived] */
22808 /* Parse a base-clause.
22810 base-clause:
22811 : base-specifier-list
22813 base-specifier-list:
22814 base-specifier ... [opt]
22815 base-specifier-list , base-specifier ... [opt]
22817 Returns a TREE_LIST representing the base-classes, in the order in
22818 which they were declared. The representation of each node is as
22819 described by cp_parser_base_specifier.
22821 In the case that no bases are specified, this function will return
22822 NULL_TREE, not ERROR_MARK_NODE. */
22824 static tree
22826 {
22829 /* Look for the `:' that begins the list. */
22832 /* Scan the base-specifier-list. */
22834 {
22836 tree base;
22839 /* Look for the base-specifier. */
22841 /* Look for the (optional) ellipsis. */
22843 {
22844 /* Consume the `...'. */
22848 }
22850 /* Add BASE to the front of the list. */
22852 {
22854 /* Make this a pack expansion type. */
22858 {
22861 }
22862 }
22863 /* Peek at the next token. */
22865 /* If it's not a comma, then the list is complete. */
22868 /* Consume the `,'. */
22870 }
22872 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22873 base class had a qualified name. However, the next name that
22874 appears is certainly not qualified. */
22880 }
22882 /* Parse a base-specifier.
22884 base-specifier:
22885 :: [opt] nested-name-specifier [opt] class-name
22886 virtual access-specifier [opt] :: [opt] nested-name-specifier
22887 [opt] class-name
22888 access-specifier virtual [opt] :: [opt] nested-name-specifier
22889 [opt] class-name
22891 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22892 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22893 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22894 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22896 static tree
22898 {
22906 tree type;
22908 /* Process the optional `virtual' and `access-specifier'. */
22910 {
22911 /* Peek at the next token. */
22913 /* Process `virtual'. */
22915 {
22917 /* If `virtual' appears more than once, issue an error. */
22919 {
22923 }
22927 /* Consume the `virtual' token. */
22935 /* If more than one access specifier appears, issue an
22936 error. */
22939 {
22943 }
22947 /* Consume the access-specifier. */
22955 }
22956 }
22957 /* It is not uncommon to see programs mechanically, erroneously, use
22958 the 'typename' keyword to denote (dependent) qualified types
22959 as base classes. */
22961 {
22966 else
22968 "keyword %<typename%> not allowed in this context "
22971 }
22973 /* Look for the optional `::' operator. */
22975 /* Look for the nested-name-specifier. The simplest way to
22976 implement:
22978 [temp.res]
22980 The keyword `typename' is not permitted in a base-specifier or
22981 mem-initializer; in these contexts a qualified name that
22982 depends on a template-parameter is implicitly assumed to be a
22983 type name.
22985 is to pretend that we have seen the `typename' keyword at this
22986 point. */
22990 typename_type,
22992 /* If the base class is given by a qualified name, assume that names
22993 we see are type names or templates, as appropriate. */
22999 /* DR 950 allows decltype as a base-specifier. */
23001 else
23002 {
23003 /* Otherwise, look for the class-name. */
23005 class_scope_p,
23006 template_p,
23007 typename_type,
23012 }
23018 }
23020 /* Exception handling [gram.exception] */
23022 /* Parse an (optional) noexcept-specification.
23024 noexcept-specification:
23025 noexcept ( constant-expression ) [opt]
23027 If no noexcept-specification is present, returns NULL_TREE.
23028 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23029 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23030 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23031 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23032 in which case a boolean condition is returned instead. */
23034 static tree
23039 {
23043 /* Peek at the next token. */
23046 /* Is it a noexcept-specification? */
23048 {
23049 tree expr;
23053 {
23057 {
23058 /* Types may not be defined in an exception-specification. */
23060 parser->type_definition_forbidden_message
23065 /* Restore the saved message. */
23067 }
23068 else
23069 {
23072 }
23075 }
23076 else
23077 {
23081 }
23083 /* We cannot build a noexcept-spec right away because this will check
23084 that expr is a constexpr. */
23087 else
23089 }
23090 else
23092 }
23094 /* Parse an (optional) exception-specification.
23096 exception-specification:
23097 throw ( type-id-list [opt] )
23099 Returns a TREE_LIST representing the exception-specification. The
23100 TREE_VALUE of each node is a type. */
23102 static tree
23104 {
23106 tree type_id_list;
23109 /* Peek at the next token. */
23112 /* Is it a noexcept-specification? */
23118 /* If it's not `throw', then there's no exception-specification. */
23122 #if 0
23123 /* Enable this once a lot of code has transitioned to noexcept? */
23127 #endif
23129 /* Consume the `throw'. */
23132 /* Look for the `('. */
23135 /* Peek at the next token. */
23137 /* If it's not a `)', then there is a type-id-list. */
23139 {
23140 /* Types may not be defined in an exception-specification. */
23142 parser->type_definition_forbidden_message
23144 /* Parse the type-id-list. */
23146 /* Restore the saved message. */
23148 }
23149 else
23152 /* Look for the `)'. */
23156 }
23158 /* Parse an (optional) type-id-list.
23160 type-id-list:
23161 type-id ... [opt]
23162 type-id-list , type-id ... [opt]
23164 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23165 in the order that the types were presented. */
23167 static tree
23169 {
23173 {
23175 tree type;
23179 /* Get the next type-id. */
23181 /* Check for invalid 'auto'. */
23183 {
23187 }
23188 /* Parse the optional ellipsis. */
23190 {
23191 /* Consume the `...'. */
23194 /* Turn the type into a pack expansion expression. */
23196 }
23197 /* Add it to the list. */
23199 /* Peek at the next token. */
23201 /* If it is not a `,', we are done. */
23204 /* Consume the `,'. */
23206 }
23209 }
23211 /* Parse a try-block.
23213 try-block:
23214 try compound-statement handler-seq */
23216 static tree
23218 {
23219 tree try_block;
23233 }
23235 /* Parse a function-try-block.
23237 function-try-block:
23238 try ctor-initializer [opt] function-body handler-seq */
23240 static bool
23242 {
23243 tree compound_stmt;
23244 tree try_block;
23247 /* Look for the `try' keyword. */
23250 /* Let the rest of the front end know where we are. */
23252 /* Parse the function-body. */
23253 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23255 /* We're done with the `try' part. */
23257 /* Parse the handlers. */
23259 /* We're done with the handlers. */
23263 }
23265 /* Parse a handler-seq.
23267 handler-seq:
23268 handler handler-seq [opt] */
23270 static void
23272 {
23274 {
23277 /* Parse the handler. */
23279 /* Peek at the next token. */
23281 /* If it's not `catch' then there are no more handlers. */
23284 }
23285 }
23287 /* Parse a handler.
23289 handler:
23290 catch ( exception-declaration ) compound-statement */
23292 static void
23294 {
23295 tree handler;
23296 tree declaration;
23306 }
23308 /* Parse an exception-declaration.
23310 exception-declaration:
23311 type-specifier-seq declarator
23312 type-specifier-seq abstract-declarator
23313 type-specifier-seq
23314 ...
23316 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23317 ellipsis variant is used. */
23319 static tree
23321 {
23322 cp_decl_specifier_seq type_specifiers;
23326 /* If it's an ellipsis, it's easy to handle. */
23328 {
23329 /* Consume the `...' token. */
23332 }
23334 /* Types may not be defined in exception-declarations. */
23336 parser->type_definition_forbidden_message
23339 /* Parse the type-specifier-seq. */
23343 /* If it's a `)', then there is no declarator. */
23346 else
23353 /* Restore the saved message. */
23360 }
23362 /* Parse a throw-expression.
23364 throw-expression:
23365 throw assignment-expression [opt]
23367 Returns a THROW_EXPR representing the throw-expression. */
23369 static tree
23371 {
23372 tree expression;
23377 /* Figure out whether or not there is an assignment-expression
23378 following the "throw" keyword. */
23386 else
23390 }
23392 /* GNU Extensions */
23394 /* Parse an (optional) asm-specification.
23396 asm-specification:
23397 asm ( string-literal )
23399 If the asm-specification is present, returns a STRING_CST
23400 corresponding to the string-literal. Otherwise, returns
23401 NULL_TREE. */
23403 static tree
23405 {
23407 tree asm_specification;
23409 /* Peek at the next token. */
23411 /* If the next token isn't the `asm' keyword, then there's no
23412 asm-specification. */
23416 /* Consume the `asm' token. */
23418 /* Look for the `('. */
23421 /* Look for the string-literal. */
23424 /* Look for the `)'. */
23428 }
23430 /* Parse an asm-operand-list.
23432 asm-operand-list:
23433 asm-operand
23434 asm-operand-list , asm-operand
23436 asm-operand:
23437 string-literal ( expression )
23438 [ string-literal ] string-literal ( expression )
23440 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23441 each node is the expression. The TREE_PURPOSE is itself a
23442 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23443 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23444 is a STRING_CST for the string literal before the parenthesis. Returns
23445 ERROR_MARK_NODE if any of the operands are invalid. */
23447 static tree
23449 {
23454 {
23455 tree string_literal;
23456 tree expression;
23457 tree name;
23460 {
23461 /* Consume the `[' token. */
23463 /* Read the operand name. */
23468 /* Look for the closing `]'. */
23470 }
23471 else
23473 /* Look for the string-literal. */
23476 /* Look for the `('. */
23478 /* Parse the expression. */
23480 /* Look for the `)'. */
23488 /* Add this operand to the list. */
23490 expression,
23491 asm_operands);
23492 /* If the next token is not a `,', there are no more
23493 operands. */
23496 /* Consume the `,'. */
23498 }
23501 }
23503 /* Parse an asm-clobber-list.
23505 asm-clobber-list:
23506 string-literal
23507 asm-clobber-list , string-literal
23509 Returns a TREE_LIST, indicating the clobbers in the order that they
23510 appeared. The TREE_VALUE of each node is a STRING_CST. */
23512 static tree
23514 {
23518 {
23519 tree string_literal;
23521 /* Look for the string literal. */
23523 /* Add it to the list. */
23525 /* If the next token is not a `,', then the list is
23526 complete. */
23529 /* Consume the `,' token. */
23531 }
23534 }
23536 /* Parse an asm-label-list.
23538 asm-label-list:
23539 identifier
23540 asm-label-list , identifier
23542 Returns a TREE_LIST, indicating the labels in the order that they
23543 appeared. The TREE_VALUE of each node is a label. */
23545 static tree
23547 {
23551 {
23554 /* Look for the identifier. */
23557 {
23560 {
23566 }
23567 }
23568 /* If the next token is not a `,', then the list is
23569 complete. */
23572 /* Consume the `,' token. */
23574 }
23577 }
23579 /* Return TRUE iff the next tokens in the stream are possibly the
23580 beginning of a GNU extension attribute. */
23582 static bool
23584 {
23586 }
23588 /* Return TRUE iff the next tokens in the stream are possibly the
23589 beginning of a standard C++-11 attribute specifier. */
23591 static bool
23593 {
23595 }
23597 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23598 beginning of a standard C++-11 attribute specifier. */
23600 static bool
23602 {
23610 }
23612 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23613 beginning of a GNU extension attribute. */
23615 static bool
23617 {
23621 }
23623 /* Return true iff the next tokens can be the beginning of either a
23624 GNU attribute list, or a standard C++11 attribute sequence. */
23626 static bool
23628 {
23631 }
23633 /* Return true iff the next Nth tokens can be the beginning of either
23634 a GNU attribute list, or a standard C++11 attribute sequence. */
23636 static bool
23638 {
23641 }
23643 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23644 of GNU attributes, or return NULL. */
23646 static tree
23648 {
23652 }
23654 #define CILK_SIMD_FN_CLAUSE_MASK \
23655 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23656 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23657 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23658 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23659 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23661 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23662 vector [(<clauses>)] */
23664 static void
23666 {
23670 {
23675 }
23678 {
23681 paren_scope++;
23682 }
23684 {
23687 paren_scope++;
23689 paren_scope--;
23690 /* Do not push the last ')' */
23693 }
23702 }
23704 /* Parse an (optional) series of attributes.
23706 attributes:
23707 attributes attribute
23709 attribute:
23710 __attribute__ (( attribute-list [opt] ))
23712 The return value is as for cp_parser_gnu_attribute_list. */
23714 static tree
23716 {
23720 {
23722 tree attribute_list;
23725 /* Peek at the next token. */
23727 /* If it's not `__attribute__', then we're done. */
23731 /* Consume the `__attribute__' keyword. */
23733 /* Look for the two `(' tokens. */
23737 /* Peek at the next token. */
23740 /* Parse the attribute-list. */
23742 else
23743 /* If the next token is a `)', then there is no attribute
23744 list. */
23747 /* Look for the two `)' tokens. */
23755 /* Add these new attributes to the list. */
23757 }
23760 }
23762 /* Parse a GNU attribute-list.
23764 attribute-list:
23765 attribute
23766 attribute-list , attribute
23768 attribute:
23769 identifier
23770 identifier ( identifier )
23771 identifier ( identifier , expression-list )
23772 identifier ( expression-list )
23774 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23775 to an attribute. The TREE_PURPOSE of each node is the identifier
23776 indicating which attribute is in use. The TREE_VALUE represents
23777 the arguments, if any. */
23779 static tree
23781 {
23787 {
23789 tree identifier;
23790 tree attribute;
23792 /* Look for the identifier. We also allow keywords here; for
23793 example `__attribute__ ((const))' is legal. */
23797 {
23800 /* Consume the token, but save it since we need it for the
23801 SIMD enabled function parsing. */
23804 /* Save away the identifier that indicates which attribute
23805 this is. */
23807 /* For keywords, use the canonical spelling, not the
23808 parsed identifier. */
23814 /* Peek at the next token. */
23816 /* If it's an `(', then parse the attribute arguments. */
23818 {
23823 {
23826 }
23827 else
23828 vec = cp_parser_parenthesized_expression_list
23834 else
23835 {
23838 }
23839 /* Save the arguments away. */
23841 }
23843 {
23846 }
23849 {
23850 /* Add this attribute to the list. */
23853 }
23856 }
23857 /* Now, look for more attributes. If the next token isn't a
23858 `,', we're done. */
23862 /* Consume the comma and keep going. */
23864 }
23867 /* We built up the list in reverse order. */
23869 }
23871 /* Parse a standard C++11 attribute.
23873 The returned representation is a TREE_LIST which TREE_PURPOSE is
23874 the scoped name of the attribute, and the TREE_VALUE is its
23875 arguments list.
23877 Note that the scoped name of the attribute is itself a TREE_LIST
23878 which TREE_PURPOSE is the namespace of the attribute, and
23879 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23880 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23881 and which TREE_PURPOSE is directly the attribute name.
23883 Clients of the attribute code should use get_attribute_namespace
23884 and get_attribute_name to get the actual namespace and name of
23885 attributes, regardless of their being GNU or C++11 attributes.
23887 attribute:
23888 attribute-token attribute-argument-clause [opt]
23890 attribute-token:
23891 identifier
23892 attribute-scoped-token
23894 attribute-scoped-token:
23895 attribute-namespace :: identifier
23897 attribute-namespace:
23898 identifier
23900 attribute-argument-clause:
23901 ( balanced-token-seq )
23903 balanced-token-seq:
23904 balanced-token [opt]
23905 balanced-token-seq balanced-token
23907 balanced-token:
23908 ( balanced-token-seq )
23909 [ balanced-token-seq ]
23910 { balanced-token-seq }. */
23912 static tree
23914 {
23918 /* First, parse name of the attribute, a.k.a attribute-token. */
23935 {
23936 /* We are seeing a scoped attribute token. */
23946 else
23947 {
23951 }
23953 NULL_TREE);
23955 }
23956 else
23957 {
23959 NULL_TREE);
23960 /* C++11 noreturn attribute is equivalent to GNU's. */
23963 /* C++14 deprecated attribute is equivalent to GNU's. */
23965 {
23968 "%<deprecated%> is a C++14 feature;"
23971 }
23972 /* Transactional Memory TS optimize_for_synchronized attribute is
23973 equivalent to GNU transaction_callable. */
23977 /* Transactional Memory attributes are GNU attributes. */
23980 }
23982 /* Now parse the optional argument clause of the attribute. */
23987 {
23993 /* A GNU attribute that takes an identifier in parameter. */
23996 vec = cp_parser_parenthesized_expression_list
24002 else
24003 {
24006 }
24010 else
24012 }
24015 }
24017 /* Check that the attribute ATTRIBUTE appears at most once in the
24018 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24019 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24020 isn't implemented yet in GCC. */
24022 static void
24024 {
24026 {
24036 }
24037 }
24039 /* Parse a list of standard C++-11 attributes.
24041 attribute-list:
24042 attribute [opt]
24043 attribute-list , attribute[opt]
24044 attribute ...
24045 attribute-list , attribute ...
24046 */
24048 static tree
24050 {
24055 {
24060 {
24064 }
24067 {
24072 }
24076 }
24079 }
24081 /* Parse a standard C++-11 attribute specifier.
24083 attribute-specifier:
24084 [ [ attribute-list ] ]
24085 alignment-specifier
24087 alignment-specifier:
24088 alignas ( type-id ... [opt] )
24089 alignas ( alignment-expression ... [opt] ). */
24091 static tree
24093 {
24099 {
24108 else
24109 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24110 when we are sure that we have actually parsed them. */
24112 }
24113 else
24114 {
24115 tree alignas_expr;
24117 /* Look for an alignment-specifier. */
24129 {
24132 }
24138 {
24142 alignas_expr =
24149 }
24155 {
24158 }
24161 {
24164 }
24166 /* Build the C++-11 representation of an 'aligned'
24167 attribute. */
24168 attributes =
24171 alignas_expr);
24172 }
24175 }
24177 /* Parse a standard C++-11 attribute-specifier-seq.
24179 attribute-specifier-seq:
24180 attribute-specifier-seq [opt] attribute-specifier
24181 */
24183 static tree
24185 {
24190 {
24199 else
24202 }
24205 }
24207 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24208 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24209 current value of the PEDANTIC flag, regardless of whether or not
24210 the `__extension__' keyword is present. The caller is responsible
24211 for restoring the value of the PEDANTIC flag. */
24213 static bool
24215 {
24216 /* Save the old value of the PEDANTIC flag. */
24220 {
24221 /* Consume the `__extension__' token. */
24223 /* We're not being pedantic while the `__extension__' keyword is
24224 in effect. */
24228 }
24231 }
24233 /* Parse a label declaration.
24235 label-declaration:
24236 __label__ label-declarator-seq ;
24238 label-declarator-seq:
24239 identifier , label-declarator-seq
24240 identifier */
24242 static void
24244 {
24245 /* Look for the `__label__' keyword. */
24249 {
24250 tree identifier;
24252 /* Look for an identifier. */
24254 /* If we failed, stop. */
24257 /* Declare it as a label. */
24259 /* If the next token is a `;', stop. */
24262 /* Look for the `,' separating the label declarations. */
24264 }
24266 /* Look for the final `;'. */
24268 }
24270 // -------------------------------------------------------------------------- //
24271 // Requires Clause
24273 // Parse a requires clause.
24274 //
24275 // requires-clause:
24276 // 'requires' logical-or-expression
24277 //
24278 // The required logical-or-expression must be a constant expression. Note
24279 // that we don't check that the expression is constepxr here. We defer until
24280 // we analyze constraints and then, we only check atomic constraints.
24281 static tree
24283 {
24284 // Parse the requires clause so that it is not automatically folded.
24292 }
24294 // Optionally parse a requires clause:
24295 static tree
24297 {
24300 {
24303 {
24306 /* Parse and discard the requires-clause. */
24309 }
24311 }
24314 }
24317 /*---------------------------------------------------------------------------
24318 Requires expressions
24319 ---------------------------------------------------------------------------*/
24321 /* Parse a requires expression
24323 requirement-expression:
24324 'requires' requirement-parameter-list [opt] requirement-body */
24325 static tree
24327 {
24331 /* A requires-expression shall appear only within a concept
24332 definition or a requires-clause.
24334 TODO: Implement this diagnostic correctly. */
24336 {
24340 }
24343 {
24344 /* Local parameters are delared as variables within the scope
24345 of the expression. They are not visible past the end of
24346 the expression. Expressions within the requires-expression
24347 are unevaluated. */
24348 struct scope_sentinel
24349 {
24351 {
24354 }
24357 {
24360 }
24363 /* Parse the optional parameter list. */
24365 {
24369 }
24370 else
24373 /* Parse the requirement body. */
24377 }
24379 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24380 the parm chain. */
24383 }
24385 /* Parse a parameterized requirement.
24387 requirement-parameter-list:
24388 '(' parameter-declaration-clause ')' */
24389 static tree
24391 {
24401 }
24403 /* Parse the body of a requirement.
24405 requirement-body:
24406 '{' requirement-list '}' */
24407 static tree
24409 {
24419 }
24421 /* Parse a list of requirements.
24423 requirement-list:
24424 requirement
24425 requirement-list ';' requirement[opt] */
24426 static tree
24428 {
24431 {
24438 /* If we see a semi-colon, consume it. */
24442 /* Stop processing at the end of the list. */
24445 }
24447 /* Reverse the order of requirements so they are analyzed in
24448 declaration order. */
24450 }
24452 /* Parse a syntactic requirement or type requirement.
24454 requirement:
24455 simple-requirement
24456 compound-requirement
24457 type-requirement
24458 nested-requirement */
24459 static tree
24461 {
24468 else
24470 }
24472 /* Parse a simple requirement.
24474 simple-requirement:
24475 expression ';' */
24476 static tree
24478 {
24487 }
24489 /* Parse a type requirement
24491 type-requirement
24492 nested-name-specifier [opt] required-type-name ';'
24494 required-type-name:
24495 type-name
24496 'template' [opt] simple-template-id */
24497 static tree
24499 {
24502 // Save the scope before parsing name specifiers.
24513 tree type;
24515 {
24524 }
24525 else
24544 }
24546 /* Parse a compound requirement
24548 compound-requirement:
24549 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24550 static tree
24552 {
24553 /* Parse an expression enclosed in '{ }'s. */
24564 /* Parse the optional noexcept. */
24567 {
24570 }
24572 /* Parse the optional trailing return type. */
24575 {
24583 }
24586 }
24588 /* Parse a nested requirement. This is the same as a requires clause.
24590 nested-requirement:
24591 requires-clause */
24592 static tree
24594 {
24600 }
24602 /* Support Functions */
24604 /* Return the appropriate prefer_type argument for lookup_name_real based on
24605 tag_type and template_mem_access. */
24609 {
24610 /* DR 141: When looking in the current enclosing context for a template-name
24611 after -> or ., only consider class templates. */
24615 {
24619 }
24620 }
24622 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24623 NAME should have one of the representations used for an
24624 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24625 is returned. If PARSER->SCOPE is a dependent type, then a
24626 SCOPE_REF is returned.
24628 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24629 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24630 was formed. Abstractly, such entities should not be passed to this
24631 function, because they do not need to be looked up, but it is
24632 simpler to check for this special case here, rather than at the
24633 call-sites.
24635 In cases not explicitly covered above, this function returns a
24636 DECL, OVERLOAD, or baselink representing the result of the lookup.
24637 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24638 is returned.
24640 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24641 (e.g., "struct") that was used. In that case bindings that do not
24642 refer to types are ignored.
24644 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24645 ignored.
24647 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24648 are ignored.
24650 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24651 types.
24653 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24654 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24655 NULL_TREE otherwise. */
24657 static cp_expr
24664 location_t name_location)
24665 {
24666 tree decl;
24669 /* Assume that the lookup will be unambiguous. */
24673 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24674 no longer valid. Note that if we are parsing tentatively, and
24675 the parse fails, OBJECT_TYPE will be automatically restored. */
24681 /* A template-id has already been resolved; there is no lookup to
24682 do. */
24686 {
24690 }
24692 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24693 it should already have been checked to make sure that the name
24694 used matches the type being destroyed. */
24696 {
24697 tree type;
24699 /* Figure out to which type this destructor applies. */
24704 else
24706 /* If that's not a class type, there is no destructor. */
24713 /* If it was a class type, return the destructor. */
24715 }
24717 /* By this point, the NAME should be an ordinary identifier. If
24718 the id-expression was a qualified name, the qualifying scope is
24719 stored in PARSER->SCOPE at this point. */
24722 /* Perform the lookup. */
24724 {
24730 /* If the SCOPE is dependent, the lookup must be deferred until
24731 the template is instantiated -- unless we are explicitly
24732 looking up names in uninstantiated templates. Even then, we
24733 cannot look up the name if the scope is not a class type; it
24734 might, for example, be a template type parameter. */
24739 /* Defer lookup. */
24741 else
24742 {
24745 /* If PARSER->SCOPE is a dependent type, then it must be a
24746 class type, and we must not be checking dependencies;
24747 otherwise, we would have processed this lookup above. So
24748 that PARSER->SCOPE is not considered a dependent base by
24749 lookup_member, we must enter the scope here. */
24753 /* If the PARSER->SCOPE is a template specialization, it
24754 may be instantiated during name lookup. In that case,
24755 errors may be issued. Even if we rollback the current
24756 tentative parse, those errors are valid. */
24761 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24762 lookup result and the nested-name-specifier nominates a class C:
24763 * if the name specified after the nested-name-specifier, when
24764 looked up in C, is the injected-class-name of C (Clause 9), or
24765 * if the name specified after the nested-name-specifier is the
24766 same as the identifier or the simple-template-id's template-
24767 name in the last component of the nested-name-specifier,
24768 the name is instead considered to name the constructor of
24769 class C. [ Note: for example, the constructor is not an
24770 acceptable lookup result in an elaborated-type-specifier so
24771 the constructor would not be used in place of the
24772 injected-class-name. --end note ] Such a constructor name
24773 shall be used only in the declarator-id of a declaration that
24774 names a constructor or in a using-declaration. */
24782 /* If we have a single function from a using decl, pull it out. */
24789 }
24791 /* If the scope is a dependent type and either we deferred lookup or
24792 we did lookup but didn't find the name, rememeber the name. */
24795 {
24797 {
24798 tree type;
24800 /* The resolution to Core Issue 180 says that `struct
24801 A::B' should be considered a type-name, even if `A'
24802 is dependent. */
24807 }
24811 CPP_CLOSE_PAREN)))
24815 else
24818 is_template);
24819 }
24822 }
24824 {
24825 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24826 OBJECT_TYPE is not a class. */
24828 /* If the OBJECT_TYPE is a template specialization, it may
24829 be instantiated during name lookup. In that case, errors
24830 may be issued. Even if we rollback the current tentative
24831 parse, those errors are valid. */
24833 name,
24836 tf_warning_or_error);
24837 else
24841 /* Look it up in the enclosing context. DR 141: When looking for a
24842 template-name after -> or ., only consider class templates. */
24847 /* The object is type-dependent, so we can't look anything up; we used
24848 this to get the DR 141 behavior. */
24852 }
24853 else
24854 {
24860 }
24862 /* If the lookup failed, let our caller know. */
24866 /* Pull out the template from an injected-class-name (or multiple). */
24870 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24872 {
24875 /* The error message we have to print is too complicated for
24876 cp_parser_error, so we incorporate its actions directly. */
24878 {
24880 name);
24882 }
24884 }
24892 /* If we have resolved the name of a member declaration, check to
24893 see if the declaration is accessible. When the name resolves to
24894 set of overloaded functions, accessibility is checked when
24895 overload resolution is done.
24897 During an explicit instantiation, access is not checked at all,
24898 as per [temp.explicit]. */
24905 }
24907 /* Like cp_parser_lookup_name, but for use in the typical case where
24908 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24909 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24911 static tree
24913 {
24915 none_type,
24920 location);
24921 }
24923 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24924 the current context, return the TYPE_DECL. If TAG_NAME_P is
24925 true, the DECL indicates the class being defined in a class-head,
24926 or declared in an elaborated-type-specifier.
24928 Otherwise, return DECL. */
24930 static tree
24932 {
24933 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24934 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24936 struct A {
24937 template <typename T> struct B;
24938 };
24940 template <typename T> struct A::B {};
24942 Similarly, in an elaborated-type-specifier:
24944 namespace N { struct X{}; }
24946 struct A {
24947 template <typename T> friend struct N::X;
24948 };
24950 However, if the DECL refers to a class type, and we are in
24951 the scope of the class, then the name lookup automatically
24952 finds the TYPE_DECL created by build_self_reference rather
24953 than a TEMPLATE_DECL. For example, in:
24955 template <class T> struct S {
24956 S s;
24957 };
24959 there is no need to handle such case. */
24965 }
24967 /* If too many, or too few, template-parameter lists apply to the
24968 declarator, issue an error message. Returns TRUE if all went well,
24969 and FALSE otherwise. */
24971 static bool
24974 location_t declarator_location)
24975 {
24977 {
24979 {
24987 /* If the DECLARATOR has the form `X<y>' then it uses one
24988 additional level of template parameters. */
24991 return cp_parser_check_template_parameters
24993 }
25008 }
25010 }
25012 /* NUM_TEMPLATES were used in the current declaration. If that is
25013 invalid, return FALSE and issue an error messages. Otherwise,
25014 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25015 declarator and we can print more accurate diagnostics. */
25017 static bool
25020 location_t location,
25022 {
25023 /* If there are the same number of template classes and parameter
25024 lists, that's OK. */
25027 /* If there are more, but only one more, then we are referring to a
25028 member template. That's OK too. */
25031 /* If there are more template classes than parameter lists, we have
25032 something like:
25034 template <class T> void S<T>::R<T>::f (); */
25036 {
25046 else
25049 }
25050 /* Otherwise, there are too many template parameter lists. We have
25051 something like:
25053 template <class T> template <class U> void S::f(); */
25056 }
25058 /* Parse an optional `::' token indicating that the following name is
25059 from the global namespace. If so, PARSER->SCOPE is set to the
25060 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25061 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25062 Returns the new value of PARSER->SCOPE, if the `::' token is
25063 present, and NULL_TREE otherwise. */
25065 static tree
25067 {
25070 /* Peek at the next token. */
25072 /* If we're looking at a `::' token then we're starting from the
25073 global namespace, not our current location. */
25075 {
25076 /* Consume the `::' token. */
25078 /* Set the SCOPE so that we know where to start the lookup. */
25084 }
25086 {
25090 }
25093 }
25095 /* Returns TRUE if the upcoming token sequence is the start of a
25096 constructor declarator. If FRIEND_P is true, the declarator is
25097 preceded by the `friend' specifier. */
25099 static bool
25101 {
25104 tree nested_name_specifier;
25107 /* The common case is that this is not a constructor declarator, so
25108 try to avoid doing lots of work if at all possible. It's not
25109 valid declare a constructor at function scope. */
25112 /* And only certain tokens can begin a constructor declarator. */
25120 /* Parse tentatively; we are going to roll back all of the tokens
25121 consumed here. */
25123 /* Assume that we are looking at a constructor declarator. */
25126 /* Look for the optional `::' operator. */
25129 /* Look for the nested-name-specifier. */
25130 nested_name_specifier
25141 /* Outside of a class-specifier, there must be a
25142 nested-name-specifier. */
25148 /* If we have a class scope, this is easy; DR 147 says that S::S always
25149 names the constructor, and no other qualified name could. */
25152 {
25162 }
25163 /* If we still think that this might be a constructor-declarator,
25164 look for a class-name. */
25166 {
25167 /* If we have:
25169 template <typename T> struct S {
25170 S();
25171 };
25173 we must recognize that the nested `S' names a class. */
25174 tree type_decl;
25178 none_type,
25182 /* If there was no class-name, then this is not a constructor.
25183 Otherwise, if we are in a class-specifier and we aren't
25184 handling a friend declaration, check that its type matches
25185 current_class_type (c++/38313). Note: error_mark_node
25186 is left alone for error recovery purposes. */
25188 && (outside_class_specifier_p
25193 /* If we're still considering a constructor, we have to see a `(',
25194 to begin the parameter-declaration-clause, followed by either a
25195 `)', an `...', or a decl-specifier. We need to check for a
25196 type-specifier to avoid being fooled into thinking that:
25198 S (f) (int);
25200 is a constructor. (It is actually a function named `f' that
25201 takes one parameter (of type `int') and returns a value of type
25202 `S'. */
25210 /* A parameter declaration begins with a decl-specifier,
25211 which is either the "attribute" keyword, a storage class
25212 specifier, or (usually) a type-specifier. */
25214 {
25215 tree type;
25219 /* Names appearing in the type-specifier should be looked up
25220 in the scope of the class. */
25223 else
25224 {
25227 {
25231 {
25234 }
25235 }
25237 }
25239 /* Inside the constructor parameter list, surrounding
25240 template-parameter-lists do not apply. */
25241 saved_num_template_parameter_lists
25245 /* Look for the type-specifier. */
25247 CP_PARSER_FLAGS_NONE,
25253 parser->num_template_parameter_lists
25256 /* Leave the scope of the class. */
25261 }
25262 }
25264 /* We did not really want to consume any tokens. */
25268 }
25270 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25271 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25272 they must be performed once we are in the scope of the function.
25274 Returns the function defined. */
25276 static tree
25277 cp_parser_function_definition_from_specifiers_and_declarator
25280 tree attributes,
25282 {
25283 tree fn;
25286 /* Begin the function-definition. */
25289 /* The things we're about to see are not directly qualified by any
25290 template headers we've seen thus far. */
25293 /* If there were names looked up in the decl-specifier-seq that we
25294 did not check, check them now. We must wait until we are in the
25295 scope of the function to perform the checks, since the function
25296 might be a friend. */
25300 {
25305 }
25308 {
25309 /* Skip the entire function. */
25312 }
25314 {
25315 /* Seen already, skip it. An error message has already been output. */
25319 /* If this is a function from a class, pop the nested class. */
25322 }
25323 else
25324 {
25325 timevar_id_t tv;
25328 else
25334 }
25337 }
25339 /* Parse the part of a function-definition that follows the
25340 declarator. INLINE_P is TRUE iff this function is an inline
25341 function defined within a class-specifier.
25343 Returns the function defined. */
25345 static tree
25348 {
25349 tree fn;
25355 bool fully_implicit_function_template_p
25358 tree implicit_template_parms
25361 cp_binding_level* implicit_template_scope
25367 /* If the next token is `return', then the code may be trying to
25368 make use of the "named return value" extension that G++ used to
25369 support. */
25372 {
25373 /* Consume the `return' keyword. */
25375 /* Look for the identifier that indicates what value is to be
25376 returned. */
25378 /* Issue an error message. */
25381 /* Skip tokens until we reach the start of the function body. */
25383 {
25390 }
25391 }
25392 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25393 anything declared inside `f'. */
25394 saved_in_unbraced_linkage_specification_p
25397 /* Inside the function, surrounding template-parameter-lists do not
25398 apply. */
25399 saved_num_template_parameter_lists
25405 /* If the next token is `try', `__transaction_atomic', or
25406 `__transaction_relaxed`, then we are looking at either function-try-block
25407 or function-transaction-block. Note that all of these include the
25408 function-body. */
25411 RID_TRANSACTION_ATOMIC);
25413 RID_TRANSACTION_RELAXED))
25415 RID_TRANSACTION_RELAXED);
25418 else
25419 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25424 /* Finish the function. */
25427 /* Generate code for it, if necessary. */
25429 /* Restore the saved values. */
25430 parser->in_unbraced_linkage_specification_p
25432 parser->num_template_parameter_lists
25436 parser->fully_implicit_function_template_p
25438 parser->implicit_template_parms
25440 parser->implicit_template_scope
25447 }
25449 /* Parse a template-declaration body (following argument list). */
25451 static void
25453 tree parameter_list,
25455 {
25459 /* We just processed one more parameter list. */
25462 /* Get the deferred access checks from the parameter list. These
25463 will be checked once we know what is being declared, as for a
25464 member template the checks must be performed in the scope of the
25465 class containing the member. */
25468 /* Tentatively parse for a new template parameter list, which can either be
25469 the template keyword or a template introduction. */
25475 else
25476 {
25477 /* There are no access checks when parsing a template, as we do not
25478 know if a specialization will be a friend. */
25482 checks,
25483 member_p,
25488 /* If this is a member template declaration, let the front
25489 end know. */
25491 {
25496 }
25501 }
25502 /* We are done with the current parameter list. */
25507 /* Finish up. */
25510 /* Check the template arguments for a literal operator template. */
25514 {
25518 else
25519 {
25522 {
25528 }
25530 {
25538 }
25539 else
25541 }
25543 {
25546 " Expected non-type template argument pack <char...>"
25548 decl);
25549 else
25552 decl);
25553 }
25554 }
25556 /* Register member declarations. */
25559 /* If DECL is a function template, we must return to parse it later.
25560 (Even though there is no definition, there might be default
25561 arguments that need handling.) */
25565 }
25567 /* Parse a template introduction header for a template-declaration. Returns
25568 false if tentative parse fails. */
25570 static bool
25572 {
25579 /* Look for the optional `::' operator. */
25582 /* Look for the nested-name-specifier. */
25592 /* Look up the concept for which we will be matching
25593 template parameters. */
25603 /* Look for opening brace for introduction. */
25611 /* Build vector of placeholder parameters and grab
25612 matching identifiers. */
25615 /* The introduction-list shall not be empty. */
25618 {
25621 }
25623 /* Look for closing brace for introduction. */
25628 {
25632 }
25634 /* Build and associate the constraint. */
25637 {
25639 member_p);
25641 }
25645 }
25647 /* Parse a normal template-declaration following the template keyword. */
25649 static void
25651 {
25652 tree parameter_list;
25656 /* Look for the `<' token. */
25660 {
25661 /* 14.5.2.2 [temp.mem]
25663 A local class shall not have member templates. */
25668 }
25669 /* [temp]
25671 A template ... shall not have C linkage. */
25673 {
25675 /* Give it C++ linkage to avoid confusing other parts of the
25676 front end. */
25679 }
25680 else
25683 /* We cannot perform access checks on the template parameter
25684 declarations until we know what is being declared, just as we
25685 cannot check the decl-specifier list. */
25688 /* If the next token is `>', then we have an invalid
25689 specialization. Rather than complain about an invalid template
25690 parameter, issue an error message here. */
25692 {
25696 }
25697 else
25698 {
25699 /* Parse the template parameters. */
25701 }
25703 /* Look for the `>'. */
25706 /* Manage template requirements */
25713 member_p);
25715 /* For the erroneous case of a template with C linkage, we pushed an
25716 implicit C++ linkage scope; exit that scope now. */
25719 }
25721 /* Parse a template-declaration, assuming that the `export' (and
25722 `extern') keywords, if present, has already been scanned. MEMBER_P
25723 is as for cp_parser_template_declaration. */
25725 static bool
25727 {
25729 {
25733 }
25738 }
25740 /* Perform the deferred access checks from a template-parameter-list.
25741 CHECKS is a TREE_LIST of access checks, as returned by
25742 get_deferred_access_checks. */
25744 static void
25745 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25746 {
25750 }
25752 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25753 `function-definition' sequence that follows a template header.
25754 If MEMBER_P is true, this declaration appears in a class scope.
25756 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25757 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25759 static tree
25765 {
25768 cp_decl_specifier_seq decl_specifiers;
25772 /* This function is only used when processing a template
25773 declaration. */
25777 /* Defer access checks until we know what is being declared. */
25780 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25781 alternative. */
25784 CP_PARSER_FLAGS_OPTIONAL,
25790 /* There are no template typedefs. */
25792 {
25796 }
25798 /* Gather up the access checks that occurred the
25799 decl-specifier-seq. */
25802 /* Check for the declaration of a template class. */
25804 {
25807 {
25808 // If this is a declaration, but not a definition, associate
25809 // any constraints with the type declaration. Constraints
25810 // are associated with definitions in cp_parser_class_specifier.
25816 /* In this case:
25818 struct C {
25819 friend template <typename T> struct A<T>::B;
25820 };
25822 A<T>::B will be represented by a TYPENAME_TYPE, and
25823 therefore not recognized by shadow_tag. */
25825 && !decl
25832 else
25835 /* Perform access checks for template parameters. */
25838 /* Give a helpful diagnostic for
25839 template <class T> struct A { } a;
25840 if we aren't already recovering from an error. */
25843 {
25845 "a class template declaration must not declare "
25849 }
25850 }
25851 }
25853 /* Complain about missing 'typename' or other invalid type names. */
25856 {
25857 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25858 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25859 the rest of this declaration. */
25862 }
25864 /* If it's not a template class, try for a template function. If
25865 the next token is a `;', then this declaration does not declare
25866 anything. But, if there were errors in the decl-specifiers, then
25867 the error might well have come from an attempted class-specifier.
25868 In that case, there's no need to warn about a missing declarator. */
25872 {
25875 checks,
25877 member_p,
25878 declares_class_or_enum,
25882 /* 7.1.1-1 [dcl.stc]
25884 A storage-class-specifier shall not be specified in an explicit
25885 specialization... */
25887 && explicit_specialization_p
25889 {
25893 }
25897 }
25899 /* Look for a trailing `;' after the declaration. */
25905 out:
25908 /* Clear any current qualification; whatever comes next is the start
25909 of something new. */
25915 }
25917 /* Parse a cast-expression that is not the operand of a unary "&". */
25919 static cp_expr
25921 {
25924 }
25926 /* Parse a functional cast to TYPE. Returns an expression
25927 representing the cast. */
25929 static cp_expr
25931 {
25933 tree expression_list;
25934 cp_expr cast;
25943 {
25952 tf_warning_or_error);
25953 /* Create a location of the form:
25954 type_name{i, f}
25955 ^~~~~~~~~~~~~~~
25956 with caret == start at the start of the type name,
25957 finishing at the closing brace. */
25958 location_t finish_loc
25961 finish_loc);
25964 }
25973 else
25974 {
25977 }
25980 tf_warning_or_error);
25981 /* [expr.const]/1: In an integral constant expression "only type
25982 conversions to integral or enumeration type can be used". */
25988 NIC_CONSTRUCTOR))
25991 /* Create a location of the form:
25992 float(i)
25993 ^~~~~~~~
25994 with caret == start at the start of the type name,
25995 finishing at the closing paren. */
25996 location_t finish_loc
26001 }
26003 /* Save the tokens that make up the body of a member function defined
26004 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26005 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26006 specifiers applied to the declaration. Returns the FUNCTION_DECL
26007 for the member function. */
26009 static tree
26013 tree attributes)
26014 {
26017 tree fn;
26019 /* Create the FUNCTION_DECL. */
26023 /* If something went badly wrong, bail out now. */
26025 {
26026 /* If there's a function-body, skip it. */
26031 }
26033 /* Remember it, if there default args to post process. */
26036 /* Save away the tokens that make up the body of the
26037 function. */
26039 /* Handle function try blocks. */
26042 /* We can have braced-init-list mem-initializers before the fn body. */
26044 {
26047 {
26048 /* cache_group will stop after an un-nested { } pair, too. */
26052 /* variadic mem-inits have ... after the ')'. */
26055 }
26056 }
26058 /* Handle function try blocks. */
26063 /* Save away the inline definition; we will process it when the
26064 class is complete. */
26068 /* We need to know that this was defined in the class, so that
26069 friend templates are handled correctly. */
26072 /* Add FN to the queue of functions to be parsed later. */
26076 }
26078 /* Save the tokens that make up the in-class initializer for a non-static
26079 data member. Returns a DEFAULT_ARG. */
26081 static tree
26083 {
26085 }
26087 /* Parse a template-argument-list, as well as the trailing ">" (but
26088 not the opening "<"). See cp_parser_template_argument_list for the
26089 return value. */
26091 static tree
26093 {
26094 tree arguments;
26095 tree saved_scope;
26096 tree saved_qualifying_scope;
26097 tree saved_object_scope;
26102 /* [temp.names]
26104 When parsing a template-id, the first non-nested `>' is taken as
26105 the end of the template-argument-list rather than a greater-than
26106 operator. */
26107 saved_greater_than_is_operator_p
26110 /* Parsing the argument list may modify SCOPE, so we save it
26111 here. */
26115 /* We need to evaluate the template arguments, even though this
26116 template-id may be nested within a "sizeof". */
26121 /* Parse the template-argument-list itself. */
26125 else
26127 /* Look for the `>' that ends the template-argument-list. If we find
26128 a '>>' instead, it's probably just a typo. */
26130 {
26132 {
26133 /* In C++0x, a `>>' in a template argument list or cast
26134 expression is considered to be two separate `>'
26135 tokens. So, change the current token to a `>', but don't
26136 consume it: it will be consumed later when the outer
26137 template argument list (or cast expression) is parsed.
26138 Note that this replacement of `>' for `>>' is necessary
26139 even if we are parsing tentatively: in the tentative
26140 case, after calling
26141 cp_parser_enclosed_template_argument_list we will always
26142 throw away all of the template arguments and the first
26143 closing `>', either because the template argument list
26144 was erroneous or because we are replacing those tokens
26145 with a CPP_TEMPLATE_ID token. The second `>' (which will
26146 not have been thrown away) is needed either to close an
26147 outer template argument list or to complete a new-style
26148 cast. */
26151 }
26153 {
26154 /* If we're in a nested template argument list, the '>>' has
26155 to be a typo for '> >'. We emit the error message, but we
26156 continue parsing and we push a '>' as next token, so that
26157 the argument list will be parsed correctly. Note that the
26158 global source location is still on the token before the
26159 '>>', so we need to say explicitly where we want it. */
26165 }
26166 else
26167 {
26168 /* If this is not a nested template argument list, the '>>'
26169 is a typo for '>'. Emit an error message and continue.
26170 Same deal about the token location, but here we can get it
26171 right by consuming the '>>' before issuing the diagnostic. */
26174 "spurious %<>>%>, use %<>%> to terminate "
26176 }
26177 }
26178 else
26180 /* The `>' token might be a greater-than operator again now. */
26181 parser->greater_than_is_operator_p
26183 /* Restore the SAVED_SCOPE. */
26191 }
26193 /* MEMBER_FUNCTION is a member function, or a friend. If default
26194 arguments, or the body of the function have not yet been parsed,
26195 parse them now. */
26197 static void
26199 {
26201 /* If this member is a template, get the underlying
26202 FUNCTION_DECL. */
26206 /* There should not be any class definitions in progress at this
26207 point; the bodies of members are only parsed outside of all class
26208 definitions. */
26210 /* While we're parsing the member functions we might encounter more
26211 classes. We want to handle them right away, but we don't want
26212 them getting mixed up with functions that are currently in the
26213 queue. */
26216 /* Make sure that any template parameters are in scope. */
26219 /* If the body of the function has not yet been parsed, parse it
26220 now. */
26222 {
26223 tree function_scope;
26226 /* The function is no longer pending; we are processing it. */
26231 /* If this is a local class, enter the scope of the containing
26232 function. */
26237 /* Push the body of the function onto the lexer stack. */
26240 /* Let the front end know that we going to be defining this
26241 function. */
26245 /* Don't do access checking if it is a templated function. */
26249 /* #pragma omp declare reduction needs special parsing. */
26251 {
26256 }
26257 else
26258 /* Now, parse the body of the function. */
26265 /* Leave the scope of the containing function. */
26269 }
26271 /* Remove any template parameters from the symbol table. */
26274 /* Restore the queue. */
26277 }
26279 /* If DECL contains any default args, remember it on the unparsed
26280 functions queue. */
26282 static void
26284 {
26285 tree probe;
26288 probe;
26291 {
26295 }
26296 }
26298 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26299 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26300 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26301 from the parameter-type-list. */
26303 static tree
26306 {
26308 tree parsed_arg;
26314 /* Push the saved tokens for the default argument onto the parser's
26315 lexer stack. */
26321 /* Parse the default argument. */
26332 {
26333 /* In a non-template class, check conversions now. In a template,
26334 we'll wait and instantiate these as needed. */
26337 tf_warning_or_error);
26338 else
26340 }
26342 /* If the token stream has not been completely used up, then
26343 there was extra junk after the end of the default
26344 argument. */
26346 {
26349 else
26351 }
26353 /* Revert to the main lexer. */
26357 }
26359 /* FIELD is a non-static data member with an initializer which we saved for
26360 later; parse it now. */
26362 static void
26364 {
26365 tree def;
26372 NULL_TREE);
26378 }
26380 /* FN is a FUNCTION_DECL which may contains a parameter with an
26381 unparsed DEFAULT_ARG. Parse the default args now. This function
26382 assumes that the current scope is the scope in which the default
26383 argument should be processed. */
26385 static void
26387 {
26391 /* While we're parsing the default args, we might (due to the
26392 statement expression extension) encounter more classes. We want
26393 to handle them right away, but we don't want them getting mixed
26394 up with default args that are currently in the queue. */
26397 /* Local variable names (and the `this' keyword) may not appear
26398 in a default argument. */
26409 {
26411 tree parsed_arg;
26413 tree copy;
26420 /* This can happen for a friend declaration for a function
26421 already declared with default arguments. */
26424 parsed_arg
26426 default_arg,
26429 {
26431 }
26435 /* Update any instantiations we've already created. */
26439 }
26443 /* Make sure no default arg is missing. */
26446 /* Restore the state of local_variables_forbidden_p. */
26449 /* Restore the queue. */
26451 }
26453 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26455 sizeof ... ( identifier )
26457 where the 'sizeof' token has already been consumed. */
26459 static tree
26461 {
26462 /* Consume the `...'. */
26469 else
26477 /* The name is not qualified. */
26496 }
26498 /* Parse the operand of `sizeof' (or a similar operator). Returns
26499 either a TYPE or an expression, depending on the form of the
26500 input. The KEYWORD indicates which kind of expression we have
26501 encountered. */
26503 static tree
26505 {
26512 /* If it's a `...', then we are computing the length of a parameter
26513 pack. */
26518 /* Types cannot be defined in a `sizeof' expression. Save away the
26519 old message. */
26521 /* And create the new one. */
26527 /* The restrictions on constant-expressions do not apply inside
26528 sizeof expressions. */
26529 saved_integral_constant_expression_p
26531 saved_non_integral_constant_expression_p
26535 /* Do not actually evaluate the expression. */
26538 /* If it's a `(', then we might be looking at the type-id
26539 construction. */
26541 {
26544 /* We can't be sure yet whether we're looking at a type-id or an
26545 expression. */
26547 /* Note: as a GNU Extension, compound literals are considered
26548 postfix-expressions as they are in C99, so they are valid
26549 arguments to sizeof. See comment in cp_parser_cast_expression
26550 for details. */
26553 else
26554 {
26557 /* Look for the type-id. */
26559 /* Look for the closing `)'. */
26562 }
26564 /* If all went well, then we're done. */
26566 {
26567 cp_decl_specifier_seq decl_specs;
26569 /* Build a trivial decl-specifier-seq. */
26573 /* Call grokdeclarator to figure out what type this is. */
26576 TYPENAME,
26579 }
26580 }
26582 /* If the type-id production did not work out, then we must be
26583 looking at the unary-expression production. */
26587 /* Go back to evaluating expressions. */
26591 /* Free the message we created. */
26593 /* And restore the old one. */
26595 parser->integral_constant_expression_p
26597 parser->non_integral_constant_expression_p
26601 }
26603 /* If the current declaration has no declarator, return true. */
26605 static bool
26607 {
26608 /* If the next token is a `;' or a `,' then there is no
26609 declarator. */
26612 }
26614 /* Update the DECL_SPECS to reflect the storage class indicated by
26615 KEYWORD. */
26617 static void
26622 {
26623 cp_storage_class storage_class;
26626 {
26630 }
26632 {
26635 }
26640 {
26643 }
26646 {
26664 }
26668 /* A storage class specifier cannot be applied alongside a typedef
26669 specifier. If there is a typedef specifier present then set
26670 conflicting_specifiers_p which will trigger an error later
26671 on in grokdeclarator. */
26674 }
26676 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26677 is true, the type is a class or enum definition. */
26679 static void
26681 tree type_spec,
26684 {
26687 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26688 (with, for example, in "typedef int wchar_t;") we remember that
26689 this is what happened. In system headers, we ignore these
26690 declarations so that G++ can work with system headers that are not
26691 C++-safe. */
26693 && !type_definition_p
26703 {
26706 ds_redefined_builtin_type_spec,
26707 token);
26709 {
26713 }
26714 }
26717 else
26718 {
26723 }
26724 }
26726 /* True iff TOKEN is the GNU keyword __thread. */
26728 static bool
26730 {
26733 }
26735 /* Set the location for a declarator specifier and check if it is
26736 duplicated.
26738 DECL_SPECS is the sequence of declarator specifiers onto which to
26739 set the location.
26741 DS is the single declarator specifier to set which location is to
26742 be set onto the existing sequence of declarators.
26744 LOCATION is the location for the declarator specifier to
26745 consider. */
26747 static void
26750 {
26759 {
26763 }
26764 else
26765 {
26767 {
26771 else
26772 {
26775 OPT_Wlong_long,
26777 }
26778 }
26780 {
26785 else
26787 }
26788 else
26789 {
26805 "__complex"
26806 };
26809 }
26810 }
26811 }
26813 /* Return true iff the declarator specifier DS is present in the
26814 sequence of declarator specifiers DECL_SPECS. */
26816 bool
26818 cp_decl_spec ds)
26819 {
26826 }
26828 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26829 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26831 static bool
26833 {
26835 }
26837 /* Issue an error message indicating that TOKEN_DESC was expected.
26838 If KEYWORD is true, it indicated this function is called by
26839 cp_parser_require_keword and the required token can only be
26840 a indicated keyword. */
26842 static void
26844 required_token token_desc,
26846 {
26848 {
26917 }
26919 {
26921 {
27000 }
27001 }
27002 else
27004 }
27008 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27009 issue an error message indicating that TOKEN_DESC was expected.
27011 Returns the token consumed, if the token had the appropriate type.
27012 Otherwise, returns NULL. */
27017 required_token token_desc)
27018 {
27021 else
27022 {
27023 /* Output the MESSAGE -- unless we're parsing tentatively. */
27027 }
27028 }
27030 /* An error message is produced if the next token is not '>'.
27031 All further tokens are skipped until the desired token is
27032 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27034 static void
27036 {
27037 /* Current level of '< ... >'. */
27039 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27042 /* Are we ready, yet? If not, issue error message. */
27046 /* Skip tokens until the desired token is found. */
27048 {
27049 /* Peek at the next token. */
27051 {
27059 /* C++0x views the `>>' operator as two `>' tokens, but
27060 C++98 does not. */
27063 {
27064 /* We've hit a `>>' where the first `>' closes the
27065 template argument list, and the second `>' is
27066 spurious. Just consume the `>>' and stop; we've
27067 already produced at least one error. */
27070 }
27071 /* Fall through for C++0x, so we handle the second `>' in
27072 the `>>'. */
27076 {
27077 /* We've reached the token we want, consume it and stop. */
27080 }
27099 /* The '>' was probably forgotten, don't look further. */
27104 }
27106 /* Consume this token. */
27108 }
27109 }
27111 /* If the next token is the indicated keyword, consume it. Otherwise,
27112 issue an error message indicating that TOKEN_DESC was expected.
27114 Returns the token consumed, if the token had the appropriate type.
27115 Otherwise, returns NULL. */
27120 required_token token_desc)
27121 {
27125 {
27128 }
27131 }
27133 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27134 function-definition. */
27136 static bool
27138 {
27141 /* A ctor-initializer begins with a `:'. */
27143 /* A function-try-block begins with `try'. */
27145 /* A function-transaction-block begins with `__transaction_atomic'
27146 or `__transaction_relaxed'. */
27149 /* The named return value extension begins with `return'. */
27151 }
27153 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27154 definition. */
27156 static bool
27158 {
27165 }
27167 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27168 C++0x) ending a template-argument. */
27170 static bool
27172 {
27180 }
27182 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27183 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27185 static bool
27188 {
27194 /* Check for the sequence `<::' in the original code. It would be lexed as
27195 `[:', where `[' is a digraph, and there is no whitespace before
27196 `:'. */
27198 {
27203 }
27205 }
27207 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27208 or none_type otherwise. */
27210 static enum tag_types
27212 {
27214 {
27224 }
27225 }
27227 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27228 or none_type otherwise or if the token is null. */
27230 static enum tag_types
27232 {
27237 {
27245 }
27246 }
27248 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27250 static void
27252 {
27256 {
27260 type))
27263 }
27264 }
27266 /* Issue an error message if DECL is redeclared with different
27267 access than its original declaration [class.access.spec/3].
27268 This applies to nested classes, nested class templates and
27269 enumerations [class.mem/1]. */
27271 static void
27273 {
27284 }
27286 /* Look for the `template' keyword, as a syntactic disambiguator.
27287 Return TRUE iff it is present, in which case it will be
27288 consumed. */
27290 static bool
27292 {
27294 {
27295 /* In C++98 the `template' keyword can only be used within templates;
27296 outside templates the parser can always figure out what is a
27297 template and what is not. In C++11, per the resolution of DR 468,
27298 `template' is allowed in cases where it is not strictly necessary. */
27301 {
27304 "in C++98 %<template%> (as a disambiguator) is only "
27306 /* If this part of the token stream is rescanned, the same
27307 error message would be generated. So, we purge the token
27308 from the stream. */
27311 }
27312 else
27313 {
27314 /* Consume the `template' keyword. */
27317 }
27318 }
27320 }
27322 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27323 set PARSER->SCOPE, and perform other related actions. */
27325 static void
27327 {
27330 /* Get the stored value. */
27332 /* Set the scope from the stored value. */
27336 }
27338 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27339 encounter the end of a block before what we were looking for. */
27341 static bool
27345 {
27347 {
27350 /* Abort a parenthesized expression if we encounter a semicolon. */
27354 /* If we've reached the end of the file, stop. */
27360 /* We've hit the end of an enclosing block, so there's been some
27361 kind of syntax error. */
27364 /* Consume the token. */
27366 /* See if it starts a new group. */
27368 {
27370 /* In theory this should probably check end == '}', but
27371 cp_parser_save_member_function_body needs it to exit
27372 after either '}' or ')' when called with ')'. */
27375 }
27377 {
27381 }
27386 }
27387 }
27389 /* Like above, for caching a default argument or NSDMI. Both of these are
27390 terminated by a non-nested comma, but it can be unclear whether or not a
27391 comma is nested in a template argument list unless we do more parsing.
27392 In order to handle this ambiguity, when we encounter a ',' after a '<'
27393 we try to parse what follows as a parameter-declaration-list (in the
27394 case of a default argument) or a member-declarator (in the case of an
27395 NSDMI). If that succeeds, then we stop caching. */
27397 static tree
27399 {
27404 tree default_argument;
27406 /* Add tokens until we have processed the entire default
27407 argument. We add the range [first_token, token). */
27410 {
27411 /* For list-initialization, this is straightforward. */
27414 }
27416 {
27419 /* Peek at the next token. */
27421 /* What we do depends on what token we have. */
27423 {
27424 /* In valid code, a default argument must be
27425 immediately followed by a `,' `)', or `...'. */
27428 {
27429 /* If we've seen a '<', we might be in a
27430 template-argument-list. Until Core issue 325 is
27431 resolved, we don't know how this situation ought
27432 to be handled, so try to DTRT. We check whether
27433 what comes after the comma is a valid parameter
27434 declaration list. If it is, then the comma ends
27435 the default argument; otherwise the default
27436 argument continues. */
27440 /* Set ITALP so cp_parser_parameter_declaration_list
27441 doesn't decide to commit to this parse. */
27448 {
27449 /* Parse declarators until we reach a non-comma or
27450 somthing that cannot be an initializer.
27451 Just checking whether we're looking at a single
27452 declarator is insufficient. Consider:
27453 int var = tuple<T,U>::x;
27454 The template parameter 'U' looks exactly like a
27455 declarator. */
27456 do
27457 {
27468 }
27470 /* If we met an '=' or ';' then the original comma
27471 was the end of the NSDMI. Otherwise assume
27472 we're still in the NSDMI. */
27475 }
27476 else
27477 {
27482 }
27489 }
27492 /* If we run into a non-nested `;', `}', or `]',
27493 then the code is invalid -- but the default
27494 argument is certainly over. */
27499 /* Handle correctly int n = sizeof ... ( p ); */
27502 /* Update DEPTH, if necessary. */
27517 /* This might be the comparison operator, or it might
27518 start a template argument list. */
27525 /* Fall through for C++0x, which treats the `>>'
27526 operator like two `>' tokens in certain
27527 cases. */
27531 {
27532 /* This might be an operator, or it might close a
27533 template argument list. But if a previous '<'
27534 started a template argument list, this will have
27535 closed it, so we can't be in one anymore. */
27539 }
27542 /* If we run out of tokens, issue an error message. */
27550 /* In these cases, we should look for template-ids.
27551 For example, if the default argument is
27552 `X<int, double>()', we need to do name lookup to
27553 figure out whether or not `X' is a template; if
27554 so, the `,' does not end the default argument.
27556 That is not yet done. */
27561 }
27563 /* If we've reached the end, stop. */
27567 /* Add the token to the token block. */
27569 }
27571 /* Create a DEFAULT_ARG to represent the unparsed default
27572 argument. */
27579 }
27581 /* Begin parsing tentatively. We always save tokens while parsing
27582 tentatively so that if the tentative parsing fails we can restore the
27583 tokens. */
27585 static void
27587 {
27588 /* Enter a new parsing context. */
27590 /* Begin saving tokens. */
27592 /* In order to avoid repetitive access control error messages,
27593 access checks are queued up until we are no longer parsing
27594 tentatively. */
27596 }
27598 /* Commit to the currently active tentative parse. */
27600 static void
27602 {
27606 /* Mark all of the levels as committed. */
27609 {
27616 }
27617 }
27619 /* Commit to the topmost currently active tentative parse.
27621 Note that this function shouldn't be called when there are
27622 irreversible side-effects while in a tentative state. For
27623 example, we shouldn't create a permanent entry in the symbol
27624 table, or issue an error message that might not apply if the
27625 tentative parse is aborted. */
27627 static void
27629 {
27634 {
27642 }
27643 }
27645 /* Abort the currently active tentative parse. All consumed tokens
27646 will be rolled back, and no diagnostics will be issued. */
27648 static void
27650 {
27654 /* Now, pretend that we want to see if the construct was
27655 successfully parsed. */
27657 }
27659 /* Stop parsing tentatively. If a parse error has occurred, restore the
27660 token stream. Otherwise, commit to the tokens we have consumed.
27661 Returns true if no error occurred; false otherwise. */
27663 static bool
27665 {
27669 /* Remember whether or not an error occurred, since we are about to
27670 destroy that information. */
27672 /* Remove the topmost context from the stack. */
27675 /* If no parse errors occurred, commit to the tentative parse. */
27677 {
27678 /* Commit to the tokens read tentatively, unless that was
27679 already done. */
27684 }
27685 /* Otherwise, if errors occurred, roll back our state so that things
27686 are just as they were before we began the tentative parse. */
27687 else
27688 {
27691 }
27692 /* Add the context to the front of the free list. */
27697 }
27699 /* Returns true if we are parsing tentatively and are not committed to
27700 this tentative parse. */
27702 static bool
27704 {
27707 }
27709 /* Returns nonzero iff an error has occurred during the most recent
27710 tentative parse. */
27712 static bool
27714 {
27717 }
27719 /* Returns nonzero if GNU extensions are allowed. */
27721 static bool
27723 {
27725 }
27726 \f
27727 /* Objective-C++ Productions */
27730 /* Parse an Objective-C expression, which feeds into a primary-expression
27731 above.
27733 objc-expression:
27734 objc-message-expression
27735 objc-string-literal
27736 objc-encode-expression
27737 objc-protocol-expression
27738 objc-selector-expression
27740 Returns a tree representation of the expression. */
27742 static cp_expr
27744 {
27745 /* Try to figure out what kind of declaration is present. */
27749 {
27759 {
27771 }
27777 }
27780 }
27782 /* Parse an Objective-C message expression.
27784 objc-message-expression:
27785 [ objc-message-receiver objc-message-args ]
27787 Returns a representation of an Objective-C message. */
27789 static tree
27791 {
27803 /* Construct a location e.g.
27804 [self func1:5]
27805 ^~~~~~~~~~~~~~
27806 ranging from the '[' to the ']', with the caret at the start. */
27811 }
27813 /* Parse an objc-message-receiver.
27815 objc-message-receiver:
27816 expression
27817 simple-type-specifier
27819 Returns a representation of the type or expression. */
27821 static tree
27823 {
27824 tree rcv;
27826 /* An Objective-C message receiver may be either (1) a type
27827 or (2) an expression. */
27831 /* If that worked out, fine. */
27838 CP_PARSER_FLAGS_NONE);
27845 }
27847 /* Parse the arguments and selectors comprising an Objective-C message.
27849 objc-message-args:
27850 objc-selector
27851 objc-selector-args
27852 objc-selector-args , objc-comma-args
27854 objc-selector-args:
27855 objc-selector [opt] : assignment-expression
27856 objc-selector-args objc-selector [opt] : assignment-expression
27858 objc-comma-args:
27859 assignment-expression
27860 objc-comma-args , assignment-expression
27862 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27863 selector arguments and TREE_VALUE containing a list of comma
27864 arguments. */
27866 static tree
27868 {
27874 {
27880 /* Detect if we have a unary selector. */
27889 sel_args
27894 }
27896 /* Handle non-selector arguments, if any. */
27898 {
27899 tree arg;
27904 addl_args
27909 }
27912 {
27915 }
27918 }
27920 /* Parse an Objective-C encode expression.
27922 objc-encode-expression:
27923 @encode objc-typename
27925 Returns an encoded representation of the type argument. */
27927 static cp_expr
27929 {
27930 tree type;
27941 {
27945 }
27947 /* This happens if we find @encode(T) (where T is a template
27948 typename or something dependent on a template typename) when
27949 parsing a template. In that case, we can't compile it
27950 immediately, but we rather create an AT_ENCODE_EXPR which will
27951 need to be instantiated when the template is used.
27952 */
27954 {
27958 }
27961 /* Build a location of the form:
27962 @encode(int)
27963 ^~~~~~~~~~~~
27964 with caret==start at the @ token, finishing at the close paren. */
27965 location_t combined_loc
27970 }
27972 /* Parse an Objective-C @defs expression. */
27974 static tree
27976 {
27977 tree name;
27985 }
27987 /* Parse an Objective-C protocol expression.
27989 objc-protocol-expression:
27990 @protocol ( identifier )
27992 Returns a representation of the protocol expression. */
27994 static tree
27996 {
27997 tree proto;
28005 /* Build a location of the form:
28006 @protocol(prot)
28007 ^~~~~~~~~~~~~~~
28008 with caret==start at the @ token, finishing at the close paren. */
28009 location_t combined_loc
28015 }
28017 /* Parse an Objective-C selector expression.
28019 objc-selector-expression:
28020 @selector ( objc-method-signature )
28022 objc-method-signature:
28023 objc-selector
28024 objc-selector-seq
28026 objc-selector-seq:
28027 objc-selector :
28028 objc-selector-seq objc-selector :
28030 Returns a representation of the method selector. */
28032 static tree
28034 {
28046 {
28055 {
28056 /* Detect if we have a unary selector. */
28058 {
28061 }
28062 else
28063 {
28065 }
28066 }
28071 {
28072 sel_seq
28075 sel_seq
28078 }
28079 else
28080 sel_seq
28085 }
28087 finish_selector:
28091 /* Build a location of the form:
28092 @selector(func)
28093 ^~~~~~~~~~~~~~~
28094 with caret==start at the @ token, finishing at the close paren. */
28095 location_t combined_loc
28099 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28102 }
28104 /* Parse a list of identifiers.
28106 objc-identifier-list:
28107 identifier
28108 objc-identifier-list , identifier
28110 Returns a TREE_LIST of identifier nodes. */
28112 static tree
28114 {
28115 tree identifier;
28116 tree list;
28127 {
28134 identifier));
28136 }
28139 }
28141 /* Parse an Objective-C alias declaration.
28143 objc-alias-declaration:
28144 @compatibility_alias identifier identifier ;
28146 This function registers the alias mapping with the Objective-C front end.
28147 It returns nothing. */
28149 static void
28151 {
28159 }
28161 /* Parse an Objective-C class forward-declaration.
28163 objc-class-declaration:
28164 @class objc-identifier-list ;
28166 The function registers the forward declarations with the Objective-C
28167 front end. It returns nothing. */
28169 static void
28171 {
28174 {
28175 tree id;
28185 else
28187 }
28189 }
28191 /* Parse a list of Objective-C protocol references.
28193 objc-protocol-refs-opt:
28194 objc-protocol-refs [opt]
28196 objc-protocol-refs:
28197 < objc-identifier-list >
28199 Returns a TREE_LIST of identifiers, if any. */
28201 static tree
28203 {
28207 {
28211 }
28214 }
28216 /* Parse a Objective-C visibility specification. */
28218 static void
28220 {
28224 {
28239 }
28241 /* Eat '@private'/'@protected'/'@public'. */
28243 }
28245 /* Parse an Objective-C method type. Return 'true' if it is a class
28246 (+) method, and 'false' if it is an instance (-) method. */
28250 {
28253 else
28255 }
28257 /* Parse an Objective-C protocol qualifier. */
28259 static tree
28261 {
28274 {
28279 }
28282 }
28284 /* Parse an Objective-C typename. */
28286 static tree
28288 {
28292 {
28298 /* An ObjC type name may consist of just protocol qualifiers, in which
28299 case the type shall default to 'id'. */
28301 {
28304 /* If the type could not be parsed, an error has already
28305 been produced. For error recovery, behave as if it had
28306 not been specified, which will use the default type
28307 'id'. */
28309 {
28311 /* We need to skip to the closing parenthesis as
28312 cp_parser_type_id() does not seem to do it for
28313 us. */
28318 }
28319 }
28323 }
28326 }
28328 /* Check to see if TYPE refers to an Objective-C selector name. */
28330 static bool
28332 {
28338 }
28340 /* Parse an Objective-C selector. */
28342 static tree
28344 {
28348 {
28351 }
28353 /* C++ operator names are allowed to appear in ObjC selectors. */
28355 {
28368 }
28369 }
28371 /* Parse an Objective-C params list. */
28373 static tree
28375 {
28381 {
28391 /* Detect if we have a unary selector. */
28394 {
28397 }
28401 {
28402 /* Something went quite wrong. There should be a colon
28403 here, but there is not. Stop parsing parameters. */
28405 }
28407 /* New ObjC allows attributes on parameters too. */
28412 params
28415 type_name,
28416 identifier,
28417 parm_attr));
28420 }
28423 {
28426 }
28428 /* We allow tail attributes for the method. */
28430 {
28438 }
28441 {
28444 }
28446 }
28448 /* Parse the non-keyword Objective-C params. */
28450 static tree
28453 {
28459 {
28461 tree parm;
28467 {
28472 }
28474 /* TODO: parse attributes for tail parameters. */
28483 }
28485 /* We allow tail attributes for the method. */
28487 {
28489 {
28494 }
28495 else
28496 /* We have an error, but parse the attributes, so that we can
28497 carry on. */
28503 }
28506 }
28508 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28510 static void
28512 {
28515 /* If the next token is `extern' and the following token is a string
28516 literal, then we have a linkage specification. */
28518 && cp_parser_is_pure_string_literal
28521 /* Handle #pragma, if any. */
28524 /* Allow stray semicolons. */
28527 /* Mark methods as optional or required, when building protocols. */
28529 {
28532 }
28534 {
28537 }
28540 /* Other stray characters must generate errors. */
28542 {
28546 }
28547 /* Finally, try to parse a block-declaration, or a function-definition. */
28548 else
28550 }
28552 /* Parse a method signature. */
28554 static tree
28556 {
28572 }
28574 static bool
28576 {
28577 tree tattr;
28582 /* If the attributes are followed by a method introducer, this is not allowed.
28583 Dump the attributes and flag the situation. */
28588 /* Otherwise, the attributes introduce some interstitial code, possibly so
28589 rewind to allow that check. */
28592 }
28594 /* Parse an Objective-C method prototype list. */
28596 static void
28598 {
28602 {
28604 {
28609 else
28613 {
28617 }
28620 }
28626 OPT_Wattributes,
28628 else
28629 /* Allow for interspersed non-ObjC++ code. */
28633 }
28637 else
28641 }
28643 /* Parse an Objective-C method definition list. */
28645 static void
28647 {
28651 {
28652 tree meth;
28655 {
28661 else
28666 {
28670 }
28672 NULL_TREE);
28674 /* For historical reasons, we accept an optional semicolon. */
28681 {
28688 }
28689 }
28690 /* The following case will be removed once @synthesize is
28691 completely implemented. */
28702 else
28703 /* Allow for interspersed non-ObjC++ code. */
28707 }
28711 else
28715 }
28717 /* Parse Objective-C ivars. */
28719 static void
28721 {
28732 {
28733 cp_decl_specifier_seq declspecs;
28735 tree prefix_attributes;
28743 CP_PARSER_FLAGS_OPTIONAL,
28747 /* auto, register, static, extern, mutable. */
28749 {
28752 }
28754 /* thread_local. */
28756 {
28759 }
28761 /* typedef. */
28763 {
28766 }
28771 /* Keep going until we hit the `;' at the end of the
28772 declaration. */
28774 {
28779 /* Check for a (possibly unnamed) bitfield declaration. */
28787 {
28788 /* Get the name of the bitfield. */
28791 sfk_none);
28793 eat_colon:
28795 /* Get the width of the bitfield. */
28796 width
28798 }
28799 else
28800 {
28801 /* Parse the declarator. */
28802 declarator
28808 }
28810 /* Look for attributes that apply to the ivar. */
28812 /* Remember which attributes are prefix attributes and
28813 which are not. */
28815 /* Combine the attributes. */
28819 /* Create the bitfield declaration. */
28821 width,
28822 attributes);
28823 else
28828 /* Add the instance variable. */
28832 /* Reset PREFIX_ATTRIBUTES. */
28841 {
28844 }
28846 }
28850 }
28855 /* Do not consume the RID_AT_END, so it will be read again as terminating
28856 the @interface of @implementation. */
28860 /* For historical reasons, we accept an optional semicolon. */
28863 }
28865 /* Parse an Objective-C protocol declaration. */
28867 static void
28869 {
28875 {
28880 }
28882 /* See if we have a forward declaration or a definition. */
28885 /* Try a forward declaration first. */
28887 {
28889 {
28890 tree id;
28900 else
28902 }
28904 }
28906 /* Ok, we got a full-fledged definition (or at least should). */
28907 else
28908 {
28913 }
28914 }
28916 /* Parse an Objective-C superclass or category. */
28918 static void
28923 {
28929 {
28932 }
28934 {
28937 /* If there is no category name, and this is an @interface, we
28938 have a class extension. */
28940 {
28943 }
28944 else
28948 }
28949 }
28951 /* Parse an Objective-C class interface. */
28953 static void
28955 {
28962 {
28963 /* It's hard to recover because even if valid @interface stuff
28964 is to follow, we can't compile it (or validate it) if we
28965 don't even know which class it refers to. Let's assume this
28966 was a stray '@interface' token in the stream and skip it.
28967 */
28969 }
28974 /* We have either a class or a category on our hands. */
28977 else
28978 {
28980 /* Handle instance variable declarations, if any. */
28983 }
28986 }
28988 /* Parse an Objective-C class implementation. */
28990 static void
28992 {
28999 {
29000 /* It's hard to recover because even if valid @implementation
29001 stuff is to follow, we can't compile it (or validate it) if
29002 we don't even know which class it refers to. Let's assume
29003 this was a stray '@implementation' token in the stream and
29004 skip it.
29005 */
29007 }
29011 /* We have either a class or a category on our hands. */
29014 else
29015 {
29017 /* Handle instance variable declarations, if any. */
29020 }
29023 }
29025 /* Consume the @end token and finish off the implementation. */
29027 static void
29029 {
29032 }
29034 /* Parse an Objective-C declaration. */
29036 static void
29038 {
29039 /* Try to figure out what kind of declaration is present. */
29044 {
29060 }
29063 {
29086 }
29087 }
29089 /* Parse an Objective-C try-catch-finally statement.
29091 objc-try-catch-finally-stmt:
29092 @try compound-statement objc-catch-clause-seq [opt]
29093 objc-finally-clause [opt]
29095 objc-catch-clause-seq:
29096 objc-catch-clause objc-catch-clause-seq [opt]
29098 objc-catch-clause:
29099 @catch ( objc-exception-declaration ) compound-statement
29101 objc-finally-clause:
29102 @finally compound-statement
29104 objc-exception-declaration:
29105 parameter-declaration
29106 '...'
29108 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29110 Returns NULL_TREE.
29112 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29113 for C. Keep them in sync. */
29115 static tree
29117 {
29118 location_t location;
29119 tree stmt;
29124 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29125 node, lest it get absorbed into the surrounding block. */
29131 {
29140 {
29141 /* We have "@catch (...)" (where the '...' are literally
29142 what is in the code). Skip the '...'.
29143 parameter_declaration is set to NULL_TREE, and
29144 objc_being_catch_clauses() knows that that means
29145 '...'. */
29148 }
29149 else
29150 {
29151 /* We have "@catch (NSException *exception)" or something
29152 like that. Parse the parameter declaration. */
29156 else
29161 }
29164 else
29165 {
29166 /* If there was no open parenthesis, we are recovering from
29167 an error, and we are trying to figure out what mistake
29168 the user has made. */
29170 /* If there is an immediate closing parenthesis, the user
29171 probably forgot the opening one (ie, they typed "@catch
29172 NSException *e)". Parse the closing parenthesis and keep
29173 going. */
29177 /* If these is no immediate closing parenthesis, the user
29178 probably doesn't know that parenthesis are required at
29179 all (ie, they typed "@catch NSException *e"). So, just
29180 forget about the closing parenthesis and keep going. */
29181 }
29185 }
29187 {
29190 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29191 node, lest it get absorbed into the surrounding block. */
29195 }
29198 }
29200 /* Parse an Objective-C synchronized statement.
29202 objc-synchronized-stmt:
29203 @synchronized ( expression ) compound-statement
29205 Returns NULL_TREE. */
29207 static tree
29209 {
29210 location_t location;
29221 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29222 node, lest it get absorbed into the surrounding block. */
29227 }
29229 /* Parse an Objective-C throw statement.
29231 objc-throw-stmt:
29232 @throw assignment-expression [opt] ;
29234 Returns a constructed '@throw' statement. */
29236 static tree
29238 {
29250 }
29252 /* Parse an Objective-C statement. */
29254 static tree
29256 {
29257 /* Try to figure out what kind of declaration is present. */
29261 {
29272 }
29275 }
29277 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29278 look ahead to see if an objc keyword follows the attributes. This
29279 is to detect the use of prefix attributes on ObjC @interface and
29280 @protocol. */
29282 static bool
29284 {
29289 {
29292 }
29295 }
29297 /* This routine is a minimal replacement for
29298 c_parser_struct_declaration () used when parsing the list of
29299 types/names or ObjC++ properties. For example, when parsing the
29300 code
29302 @property (readonly) int a, b, c;
29304 this function is responsible for parsing "int a, int b, int c" and
29305 returning the declarations as CHAIN of DECLs.
29307 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29308 similar parsing. */
29309 static tree
29311 {
29313 cp_decl_specifier_seq declspecs;
29315 tree prefix_attributes;
29318 CP_PARSER_FLAGS_NONE,
29325 /* auto, register, static, extern, mutable. */
29327 {
29330 }
29332 /* thread_local. */
29334 {
29337 }
29339 /* typedef. */
29341 {
29344 }
29349 /* Keep going until we hit the `;' at the end of the declaration. */
29351 {
29356 /* Parse the declarator. */
29360 /* Look for attributes that apply to the ivar. */
29362 /* Remember which attributes are prefix attributes and
29363 which are not. */
29365 /* Combine the attributes. */
29375 /* Reset PREFIX_ATTRIBUTES. */
29386 {
29389 }
29390 else
29392 }
29394 }
29396 /* Parse an Objective-C @property declaration. The syntax is:
29398 objc-property-declaration:
29399 '@property' objc-property-attributes[opt] struct-declaration ;
29401 objc-property-attributes:
29402 '(' objc-property-attribute-list ')'
29404 objc-property-attribute-list:
29405 objc-property-attribute
29406 objc-property-attribute-list, objc-property-attribute
29408 objc-property-attribute
29409 'getter' = identifier
29410 'setter' = identifier
29411 'readonly'
29412 'readwrite'
29413 'assign'
29414 'retain'
29415 'copy'
29416 'nonatomic'
29418 For example:
29419 @property NSString *name;
29420 @property (readonly) id object;
29421 @property (retain, nonatomic, getter=getTheName) id name;
29422 @property int a, b, c;
29424 PS: This function is identical to
29425 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29426 static void
29428 {
29429 /* The following variables hold the attributes of the properties as
29430 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29431 seen. When we see an attribute, we set them to 'true' (if they
29432 are boolean properties) or to the identifier (if they have an
29433 argument, ie, for getter and setter). Note that here we only
29434 parse the list of attributes, check the syntax and accumulate the
29435 attributes that we find. objc_add_property_declaration() will
29436 then process the information. */
29446 /* 'properties' is the list of properties that we read. Usually a
29447 single one, but maybe more (eg, in "@property int a, b, c;" there
29448 are three). */
29449 tree properties;
29450 location_t loc;
29456 /* Parse the optional attribute list... */
29458 {
29459 /* Eat the '('. */
29463 {
29469 {
29472 }
29476 {
29487 {
29491 else
29496 }
29499 {
29503 }
29505 {
29507 {
29510 }
29511 else
29515 else
29517 }
29518 else
29519 {
29521 {
29524 }
29525 else
29527 }
29533 }
29540 else
29542 }
29544 /* FIXME: "@property (setter, assign);" will generate a spurious
29545 "error: expected ‘)’ before ‘,’ token". This is because
29546 cp_parser_require, unlike the C counterpart, will produce an
29547 error even if we are in error recovery. */
29549 {
29554 }
29555 }
29557 /* ... and the property declaration(s). */
29561 {
29563 /* If the next token is now a `;', consume it. */
29567 }
29571 else
29572 {
29573 /* Comma-separated properties are chained together in
29574 reverse order; add them one by one. */
29583 }
29586 }
29588 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29590 objc-synthesize-declaration:
29591 @synthesize objc-synthesize-identifier-list ;
29593 objc-synthesize-identifier-list:
29594 objc-synthesize-identifier
29595 objc-synthesize-identifier-list, objc-synthesize-identifier
29597 objc-synthesize-identifier
29598 identifier
29599 identifier = identifier
29601 For example:
29602 @synthesize MyProperty;
29603 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29605 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29606 for C. Keep them in sync.
29607 */
29608 static void
29610 {
29612 location_t loc;
29617 {
29621 {
29624 }
29626 {
29630 {
29633 }
29634 }
29635 else
29640 else
29642 }
29645 }
29647 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29649 objc-dynamic-declaration:
29650 @dynamic identifier-list ;
29652 For example:
29653 @dynamic MyProperty;
29654 @dynamic MyProperty, AnotherProperty;
29656 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29657 for C. Keep them in sync.
29658 */
29659 static void
29661 {
29663 location_t loc;
29668 {
29669 tree property;
29672 {
29675 }
29679 else
29681 }
29684 }
29686 \f
29687 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29689 /* Returns name of the next clause.
29690 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29691 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29692 returned and the token is consumed. */
29694 static pragma_omp_clause
29696 {
29712 {
29717 {
29900 }
29901 }
29907 }
29909 /* Validate that a clause of the given type does not already exist. */
29911 static void
29914 {
29915 tree c;
29919 {
29922 }
29923 }
29925 /* OpenMP 2.5:
29926 variable-list:
29927 identifier
29928 variable-list , identifier
29930 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29931 colon). An opening parenthesis will have been consumed by the caller.
29933 If KIND is nonzero, create the appropriate node and install the decl
29934 in OMP_CLAUSE_DECL and add the node to the head of the list.
29936 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29937 return the list created.
29939 COLON can be NULL if only closing parenthesis should end the list,
29940 or pointer to bool which will receive false if the list is terminated
29941 by closing parenthesis or true if the list is terminated by colon. */
29943 static tree
29946 {
29950 {
29953 }
29955 {
29960 && current_class_ptr
29962 {
29968 }
29969 else
29970 {
29983 }
29985 ;
29987 {
29989 {
29991 /* The OpenACC cache directive explicitly only allows "array
29992 elements or subarrays". */
29994 {
29998 }
29999 /* FALLTHROUGH. */
30004 {
30005 location_t loc
30010 decl
30014 }
30015 /* FALLTHROUGH. */
30019 {
30027 parser->colon_corrects_to_scope_p
30031 else
30032 {
30033 /* Look for `:'. */
30037 CPP_CLOSE_SQUARE))
30039 }
30040 /* Look for the closing `]'. */
30042 RT_CLOSE_SQUARE))
30046 }
30050 }
30056 }
30057 else
30060 get_comma:
30064 }
30070 {
30074 }
30077 {
30080 /* Try to resync to an unnested comma. Copied from
30081 cp_parser_parenthesized_expression_list. */
30082 skip_comma:
30091 }
30094 }
30096 /* Similarly, but expect leading and trailing parenthesis. This is a very
30097 common case for omp clauses. */
30099 static tree
30101 {
30105 }
30107 /* OpenACC 2.0:
30108 copy ( variable-list )
30109 copyin ( variable-list )
30110 copyout ( variable-list )
30111 create ( variable-list )
30112 delete ( variable-list )
30113 present ( variable-list )
30114 present_or_copy ( variable-list )
30115 pcopy ( variable-list )
30116 present_or_copyin ( variable-list )
30117 pcopyin ( variable-list )
30118 present_or_copyout ( variable-list )
30119 pcopyout ( variable-list )
30120 present_or_create ( variable-list )
30121 pcreate ( variable-list ) */
30123 static tree
30125 tree list)
30126 {
30129 {
30175 }
30183 }
30185 /* OpenACC 2.0:
30186 deviceptr ( variable-list ) */
30188 static tree
30190 {
30194 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30195 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30196 variable-list must only allow for pointer variables. */
30199 {
30206 }
30209 }
30211 /* OpenACC 2.0:
30212 auto
30213 independent
30214 nohost
30215 seq */
30217 static tree
30221 {
30226 }
30228 /* OpenACC:
30229 num_gangs ( expression )
30230 num_workers ( expression )
30231 vector_length ( expression ) */
30233 static tree
30236 {
30246 {
30251 }
30259 }
30261 /* OpenACC:
30263 gang [( gang-arg-list )]
30264 worker [( [num:] int-expr )]
30265 vector [( [length:] int-expr )]
30267 where gang-arg is one of:
30269 [num:] int-expr
30270 static: size-expr
30272 and size-expr may be:
30274 *
30275 int-expr
30276 */
30278 static tree
30281 {
30291 {
30294 do
30295 {
30299 /* Gang static argument. */
30302 {
30310 {
30313 }
30315 /* Check for the '*' argument. */
30319 CPP_CLOSE_PAREN)))
30320 {
30325 {
30328 }
30330 }
30331 }
30332 /* Worker num: argument and vector length: arguments. */
30336 {
30339 }
30341 /* Now collect the actual argument. */
30343 {
30346 }
30358 {
30361 }
30363 }
30368 }
30382 cleanup_error:
30385 }
30387 /* OpenACC 2.0:
30388 tile ( size-expr-list ) */
30390 static tree
30392 {
30401 do
30402 {
30406 {
30409 }
30410 else
30420 }
30423 /* Consume the trailing ')'. */
30431 }
30433 /* OpenACC 2.0
30434 Parse wait clause or directive parameters. */
30436 static tree
30438 {
30448 {
30453 }
30460 {
30464 {
30467 else
30468 {
30475 }
30476 }
30477 }
30480 }
30482 /* OpenACC:
30483 wait ( int-expr-list ) */
30485 static tree
30487 {
30496 }
30498 /* OpenMP 3.0:
30499 collapse ( constant-expression ) */
30501 static tree
30503 {
30505 location_t loc;
30506 HOST_WIDE_INT n;
30526 {
30529 }
30537 }
30539 /* OpenMP 2.5:
30540 default ( shared | none )
30542 OpenACC 2.0
30543 default (none) */
30545 static tree
30548 {
30550 tree c;
30555 {
30560 {
30575 }
30578 }
30579 else
30580 {
30581 invalid_kind:
30584 else
30586 }
30602 }
30604 /* OpenMP 3.1:
30605 final ( expression ) */
30607 static tree
30609 {
30630 }
30632 /* OpenMP 2.5:
30633 if ( expression )
30635 OpenMP 4.5:
30636 if ( directive-name-modifier : expression )
30638 directive-name-modifier:
30639 parallel | task | taskloop | target data | target | target update
30640 | target enter data | target exit data */
30642 static tree
30645 {
30653 {
30665 {
30668 {
30681 else
30682 {
30683 location_t loc
30688 }
30691 {
30693 {
30698 }
30700 {
30701 location_t loc
30705 }
30706 }
30707 }
30708 }
30710 {
30712 {
30715 }
30716 else
30717 {
30719 {
30720 location_t loc
30723 }
30725 }
30726 }
30727 }
30739 {
30742 {
30745 {
30755 }
30757 p);
30759 }
30761 {
30764 else
30767 }
30770 {
30774 }
30775 }
30783 }
30785 /* OpenMP 3.1:
30786 mergeable */
30788 static tree
30791 {
30792 tree c;
30795 location);
30800 }
30802 /* OpenMP 2.5:
30803 nowait */
30805 static tree
30808 {
30809 tree c;
30816 }
30818 /* OpenMP 2.5:
30819 num_threads ( expression ) */
30821 static tree
30823 location_t location)
30824 {
30846 }
30848 /* OpenMP 4.5:
30849 num_tasks ( expression ) */
30851 static tree
30853 location_t location)
30854 {
30876 }
30878 /* OpenMP 4.5:
30879 grainsize ( expression ) */
30881 static tree
30883 location_t location)
30884 {
30906 }
30908 /* OpenMP 4.5:
30909 priority ( expression ) */
30911 static tree
30913 location_t location)
30914 {
30936 }
30938 /* OpenMP 4.5:
30939 hint ( expression ) */
30941 static tree
30943 location_t location)
30944 {
30965 }
30967 /* OpenMP 4.5:
30968 defaultmap ( tofrom : scalar ) */
30970 static tree
30972 location_t location)
30973 {
30981 {
30984 }
30988 {
30991 }
30997 {
31000 }
31004 {
31007 }
31013 location);
31019 out_err:
31024 }
31026 /* OpenMP 2.5:
31027 ordered
31029 OpenMP 4.5:
31030 ordered ( constant-expression ) */
31032 static tree
31035 {
31037 HOST_WIDE_INT n;
31043 {
31060 {
31062 "ordered argument needs positive constant integer "
31065 }
31066 }
31072 }
31074 /* OpenMP 2.5:
31075 reduction ( reduction-operator : variable-list )
31077 reduction-operator:
31078 One of: + * - & ^ | && ||
31080 OpenMP 3.1:
31082 reduction-operator:
31083 One of: + * - & ^ | && || min max
31085 OpenMP 4.0:
31087 reduction-operator:
31088 One of: + * - & ^ | && ||
31089 id-expression */
31091 static tree
31093 {
31101 {
31111 }
31115 else
31116 {
31127 {
31157 }
31158 else
31159 {
31161 resync_fail:
31166 }
31167 }
31173 NULL);
31175 {
31178 }
31181 }
31183 /* OpenMP 2.5:
31184 schedule ( schedule-kind )
31185 schedule ( schedule-kind , expression )
31187 schedule-kind:
31188 static | dynamic | guided | runtime | auto
31190 OpenMP 4.5:
31191 schedule ( schedule-modifier : schedule-kind )
31192 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31194 schedule-modifier:
31195 simd
31196 monotonic
31197 nonmonotonic */
31199 static tree
31201 {
31211 {
31220 else
31226 else
31227 {
31230 }
31231 }
31234 {
31239 {
31260 }
31261 }
31266 else
31272 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31274 {
31278 }
31281 {
31296 else
31301 }
31313 invalid_kind:
31315 resync_fail:
31320 }
31322 /* OpenMP 3.0:
31323 untied */
31325 static tree
31328 {
31329 tree c;
31336 }
31338 /* OpenMP 4.0:
31339 inbranch
31340 notinbranch */
31342 static tree
31345 {
31350 }
31352 /* OpenMP 4.0:
31353 parallel
31354 for
31355 sections
31356 taskgroup */
31358 static tree
31362 {
31366 }
31368 /* OpenMP 4.5:
31369 nogroup */
31371 static tree
31374 {
31379 }
31381 /* OpenMP 4.5:
31382 simd
31383 threads */
31385 static tree
31389 {
31394 }
31396 /* OpenMP 4.0:
31397 num_teams ( expression ) */
31399 static tree
31401 location_t location)
31402 {
31424 }
31426 /* OpenMP 4.0:
31427 thread_limit ( expression ) */
31429 static tree
31431 location_t location)
31432 {
31454 }
31456 /* OpenMP 4.0:
31457 aligned ( variable-list )
31458 aligned ( variable-list : constant-expression ) */
31460 static tree
31462 {
31473 {
31483 }
31489 }
31491 /* OpenMP 4.0:
31492 linear ( variable-list )
31493 linear ( variable-list : expression )
31495 OpenMP 4.5:
31496 linear ( modifier ( variable-list ) )
31497 linear ( modifier ( variable-list ) : expression ) */
31499 static tree
31502 {
31512 {
31524 else
31526 }
31531 else
31532 {
31541 }
31544 {
31549 {
31560 {
31563 }
31566 }
31571 {
31574 }
31582 }
31585 {
31588 }
31591 }
31593 /* OpenMP 4.0:
31594 safelen ( constant-expression ) */
31596 static tree
31598 location_t location)
31599 {
31620 }
31622 /* OpenMP 4.0:
31623 simdlen ( constant-expression ) */
31625 static tree
31627 location_t location)
31628 {
31649 }
31651 /* OpenMP 4.5:
31652 vec:
31653 identifier [+/- integer]
31654 vec , identifier [+/- integer]
31655 */
31657 static tree
31659 tree list)
31660 {
31664 {
31667 }
31670 {
31677 else
31678 {
31679 t = cp_parser_lookup_name_simple
31684 id_loc);
31685 }
31691 {
31694 }
31698 {
31701 }
31705 {
31708 }
31711 add_to_vector:
31713 {
31717 }
31723 }
31726 {
31732 }
31734 }
31736 /* OpenMP 4.0:
31737 depend ( depend-kind : variable-list )
31739 depend-kind:
31740 in | out | inout
31742 OpenMP 4.5:
31743 depend ( source )
31745 depend ( sink : vec ) */
31747 static tree
31749 {
31757 {
31771 else
31773 }
31774 else
31780 {
31790 }
31797 else
31798 {
31804 }
31807 invalid_kind:
31809 resync_fail:
31814 }
31816 /* OpenMP 4.0:
31817 map ( map-kind : variable-list )
31818 map ( variable-list )
31820 map-kind:
31821 alloc | to | from | tofrom
31823 OpenMP 4.5:
31824 map-kind:
31825 alloc | to | from | tofrom | release | delete
31827 map ( always [,] map-kind: variable-list ) */
31829 static tree
31831 {
31840 {
31845 {
31848 nth++;
31854 {
31859 }
31860 }
31861 }
31865 {
31879 else
31880 {
31886 }
31889 }
31892 {
31896 }
31899 NULL);
31905 }
31907 /* OpenMP 4.0:
31908 device ( expression ) */
31910 static tree
31912 location_t location)
31913 {
31935 }
31937 /* OpenMP 4.0:
31938 dist_schedule ( static )
31939 dist_schedule ( static , expression ) */
31941 static tree
31943 location_t location)
31944 {
31957 {
31968 }
31973 location);
31977 invalid_kind:
31979 resync_fail:
31984 }
31986 /* OpenMP 4.0:
31987 proc_bind ( proc-bind-kind )
31989 proc-bind-kind:
31990 master | close | spread */
31992 static tree
31994 location_t location)
31995 {
31996 tree c;
32003 {
32013 else
32015 }
32016 else
32025 location);
32030 invalid_kind:
32032 resync_fail:
32037 }
32039 /* OpenACC:
32040 async [( int-expr )] */
32042 static tree
32044 {
32051 {
32060 }
32070 }
32072 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32073 is a bitmask in MASK. Return the list of clauses found. */
32075 static tree
32079 {
32084 {
32085 location_t here;
32086 pragma_omp_clause c_kind;
32087 omp_clause_code code;
32098 {
32150 clauses);
32168 OMP_CLAUSE_INDEPENDENT,
32180 clauses);
32186 clauses);
32210 clauses);
32232 clauses);
32244 clauses);
32258 }
32263 {
32264 /* Remove the invalid clause(s) from the list to avoid
32265 confusing the rest of the compiler. */
32268 }
32269 }
32271 saw_error:
32278 }
32280 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32281 is a bitmask in MASK. Return the list of clauses found; the result
32282 of clause default goes in *pdefault. */
32284 static tree
32288 {
32294 {
32295 pragma_omp_clause c_kind;
32306 {
32318 clauses);
32332 clauses);
32352 clauses);
32357 clauses);
32367 clauses);
32401 clauses);
32415 clauses);
32432 OMP_CLAUSE_NOTINBRANCH,
32441 {
32442 clause_not_first:
32446 }
32476 clauses);
32477 else
32487 clauses);
32505 {
32513 }
32556 clauses
32562 clauses
32574 }
32579 {
32580 /* Remove the invalid clause(s) from the list to avoid
32581 confusing the rest of the compiler. */
32584 }
32585 }
32586 saw_error:
32587 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32588 no reason to skip to the end. */
32592 {
32595 else
32597 }
32599 }
32601 /* OpenMP 2.5:
32602 structured-block:
32603 statement
32605 In practice, we're also interested in adding the statement to an
32606 outer node. So it is convenient if we work around the fact that
32607 cp_parser_statement calls add_stmt. */
32609 static unsigned
32611 {
32614 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32615 This preserves the "not within loop or switch" style error messages
32616 for nonsense cases like
32617 void foo() {
32618 #pragma omp single
32619 break;
32620 }
32621 */
32626 }
32628 static void
32630 {
32632 }
32634 static tree
32636 {
32644 }
32646 /* OpenMP 2.5:
32647 # pragma omp atomic new-line
32648 expression-stmt
32650 expression-stmt:
32651 x binop= expr | x++ | ++x | x-- | --x
32652 binop:
32653 +, *, -, /, &, ^, |, <<, >>
32655 where x is an lvalue expression with scalar type.
32657 OpenMP 3.1:
32658 # pragma omp atomic new-line
32659 update-stmt
32661 # pragma omp atomic read new-line
32662 read-stmt
32664 # pragma omp atomic write new-line
32665 write-stmt
32667 # pragma omp atomic update new-line
32668 update-stmt
32670 # pragma omp atomic capture new-line
32671 capture-stmt
32673 # pragma omp atomic capture new-line
32674 capture-block
32676 read-stmt:
32677 v = x
32678 write-stmt:
32679 x = expr
32680 update-stmt:
32681 expression-stmt | x = x binop expr
32682 capture-stmt:
32683 v = expression-stmt
32684 capture-block:
32685 { v = x; update-stmt; } | { update-stmt; v = x; }
32687 OpenMP 4.0:
32688 update-stmt:
32689 expression-stmt | x = x binop expr | x = expr binop x
32690 capture-stmt:
32691 v = update-stmt
32692 capture-block:
32693 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32695 where x and v are lvalue expressions with scalar type. */
32697 static void
32699 {
32707 {
32712 {
32718 }
32719 }
32721 {
32733 else
32737 }
32739 {
32745 {
32750 {
32753 }
32754 }
32755 }
32759 {
32769 else
32774 {
32775 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32776 opcode. */
32781 }
32785 {
32788 }
32789 else
32790 {
32796 }
32799 }
32801 restart:
32805 {
32812 /* FALLTHROUGH */
32822 /* FALLTHROUGH */
32837 /* Undo effects of boolean_increment for post {in,de}crement. */
32839 /* FALLTHRU */
32843 {
32844 /* Undo effects of boolean_increment. */
32846 {
32847 /* This is pre or post increment. */
32852 && !structured_block
32856 }
32857 }
32858 /* FALLTHRU */
32861 {
32896 {
32900 }
32903 {
32909 {
32914 }
32916 {
32928 {
32930 {
32935 }
32936 else
32938 }
32942 }
32945 {
32952 }
32956 }
32960 {
32963 {
32971 }
32973 {
32978 }
33013 }
33024 /* FALLTHROUGH */
33029 }
33036 }
33037 stmt_done:
33039 {
33050 }
33052 {
33055 }
33056 done:
33062 saw_error:
33065 {
33069 {
33073 }
33074 }
33075 }
33078 /* OpenMP 2.5:
33079 # pragma omp barrier new-line */
33081 static void
33083 {
33086 }
33088 /* OpenMP 2.5:
33089 # pragma omp critical [(name)] new-line
33090 structured-block
33092 OpenMP 4.5:
33093 # pragma omp critical [(name) [hint(expression)]] new-line
33094 structured-block */
33096 #define OMP_CRITICAL_CLAUSE_MASK \
33097 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33099 static tree
33101 {
33105 {
33119 OMP_CRITICAL_CLAUSE_MASK,
33121 }
33122 else
33127 }
33129 /* OpenMP 2.5:
33130 # pragma omp flush flush-vars[opt] new-line
33132 flush-vars:
33133 ( variable-list ) */
33135 static void
33137 {
33143 }
33145 /* Helper function, to parse omp for increment expression. */
33147 static tree
33149 {
33154 {
33157 }
33160 {
33169 /* Fall through: OpenMP disallows NE_EXPR. */
33172 }
33174 /* If decl is an iterator, preserve LHS and RHS of the relational
33175 expr until finish_omp_for. */
33186 }
33188 /* Helper function, to parse omp for increment expression. */
33190 static tree
33192 {
33196 cp_id_kind idk;
33200 {
33209 }
33218 {
33223 }
33230 {
33234 }
33247 do
33248 {
33255 {
33257 {
33260 else
33262 tf_warning_or_error);
33263 }
33264 else
33267 }
33268 }
33272 {
33278 }
33279 else
33283 }
33285 /* Parse the initialization statement of either an OpenMP for loop or
33286 a Cilk Plus for loop.
33288 Return true if the resulting construct should have an
33289 OMP_CLAUSE_PRIVATE added to it. */
33291 static tree
33300 {
33306 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33308 init-expr:
33309 var = lb
33310 integer-type var = lb
33311 random-access-iterator-type var = lb
33312 pointer-type var = lb
33313 */
33314 cp_decl_specifier_seq type_specifiers;
33316 /* First, try to parse as an initialized declaration. See
33317 cp_parser_condition, from whence the bulk of this is copied. */
33324 {
33325 /* If parsing a type specifier seq succeeded, then this
33326 MUST be a initialized declaration. */
33331 CP_PARSER_DECLARATOR_NAMED,
33342 else
33343 {
33353 {
33355 CPP_OPEN_PAREN))
33356 {
33360 else
33363 }
33364 else
33365 /* Trigger an error. */
33370 }
33374 {
33382 {
33385 auto_node);
33390 }
33393 asm_specification,
33394 LOOKUP_ONLYCONVERTING);
33397 {
33400 }
33401 else
33404 }
33405 else
33406 {
33407 /* Consume '='. */
33411 non_class:
33414 else
33417 asm_specification,
33418 LOOKUP_ONLYCONVERTING);
33419 }
33423 }
33424 }
33425 else
33426 {
33427 cp_id_kind idk;
33428 /* If parsing a type specifier sequence failed, then
33429 this MUST be a simple expression. */
33438 && decl
33441 {
33452 {
33457 }
33462 }
33464 && decl
33467 {
33468 tree rhs;
33476 rhs,
33477 tf_warning_or_error));
33480 }
33481 else
33482 {
33487 {
33491 }
33492 }
33493 }
33495 }
33497 /* Parse the restricted form of the for statement allowed by OpenMP. */
33499 static tree
33502 {
33506 location_t loc_first;
33517 {
33520 }
33523 {
33529 }
33531 {
33534 {
33536 "%<linear%> clause may not be specified together "
33539 }
33540 else
33542 }
33555 {
33558 location_t loc;
33562 {
33565 }
33568 {
33571 }
33580 add_private_clause
33587 {
33590 {
33596 }
33597 else
33599 }
33606 {
33611 {
33615 }
33618 {
33619 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33623 {
33626 }
33627 else
33628 {
33631 }
33633 }
33634 else
33635 {
33640 }
33641 }
33644 {
33645 tree c;
33647 {
33656 decl);
33660 decl);
33661 }
33663 {
33668 else
33673 {
33676 /* For linear, signal that we need to fill up
33677 the so far unknown linear step. */
33680 }
33681 }
33682 }
33691 {
33692 /* If decl is an iterator, preserve the operator on decl
33693 until finish_omp_for. */
33695 && ((processing_template_decl
33700 else
33704 }
33716 {
33719 }
33724 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33725 in between the collapsed for loops to be still considered perfectly
33726 nested. Hopefully the final version clarifies this.
33727 For now handle (multiple) {'s and empty statements. */
33729 do
33730 {
33734 {
33736 bracecount++;
33737 }
33741 else
33742 {
33749 }
33750 }
33754 {
33757 }
33758 }
33763 /* Note that we saved the original contents of this flag when we entered
33764 the structured block, and so we don't need to re-save it here. */
33767 else
33770 /* Note that the grammar doesn't call for a structured block here,
33771 though the loop as a whole is a structured block. */
33778 else
33783 {
33785 {
33787 nbraces--;
33788 }
33791 else
33792 {
33794 {
33797 }
33802 }
33803 }
33810 }
33812 /* Helper function for OpenMP parsing, split clauses and call
33813 finish_omp_clauses on each of the set of clauses afterwards. */
33815 static void
33818 {
33824 }
33826 /* OpenMP 4.0:
33827 #pragma omp simd simd-clause[optseq] new-line
33828 for-loop */
33830 #define OMP_SIMD_CLAUSE_MASK \
33831 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33840 static tree
33844 {
33855 {
33859 OMP_CLAUSE_ORDERED);
33861 {
33863 "%<ordered%> clause with parameter may not be specified "
33866 }
33867 }
33878 }
33880 /* OpenMP 2.5:
33881 #pragma omp for for-clause[optseq] new-line
33882 for-loop
33884 OpenMP 4.0:
33885 #pragma omp for simd for-simd-clause[optseq] new-line
33886 for-loop */
33888 #define OMP_FOR_CLAUSE_MASK \
33889 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33899 static tree
33903 {
33910 /* parallel for{, simd} disallows nowait clause, but for
33911 target {teams distribute ,}parallel for{, simd} it should be accepted. */
33914 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33919 {
33924 {
33948 }
33949 }
33951 {
33954 }
33956 /* Composite distribute parallel for disallows linear clause. */
33963 {
33966 }
33977 }
33979 /* OpenMP 2.5:
33980 # pragma omp master new-line
33981 structured-block */
33983 static tree
33985 {
33989 }
33991 /* OpenMP 2.5:
33992 # pragma omp ordered new-line
33993 structured-block
33995 OpenMP 4.5:
33996 # pragma omp ordered ordered-clauses new-line
33997 structured-block */
33999 #define OMP_ORDERED_CLAUSE_MASK \
34000 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34003 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34004 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34006 static bool
34009 {
34013 {
34017 }
34020 {
34025 {
34027 {
34029 "%<depend%> clause may only be used in compound "
34033 }
34034 tree clauses
34036 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34040 }
34041 }
34043 tree clauses
34049 }
34051 /* OpenMP 2.5:
34053 section-scope:
34054 { section-sequence }
34056 section-sequence:
34057 section-directive[opt] structured-block
34058 section-sequence section-directive structured-block */
34060 static tree
34062 {
34074 {
34078 }
34081 {
34089 {
34093 }
34095 {
34098 }
34103 }
34114 }
34116 /* OpenMP 2.5:
34117 # pragma omp sections sections-clause[optseq] newline
34118 sections-scope */
34120 #define OMP_SECTIONS_CLAUSE_MASK \
34121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34127 static tree
34130 {
34142 {
34145 }
34152 }
34154 /* OpenMP 2.5:
34155 # pragma omp parallel parallel-clause[optseq] new-line
34156 structured-block
34157 # pragma omp parallel for parallel-for-clause[optseq] new-line
34158 structured-block
34159 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34160 structured-block
34162 OpenMP 4.0:
34163 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34164 structured-block */
34166 #define OMP_PARALLEL_CLAUSE_MASK \
34167 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34177 static tree
34181 {
34188 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34194 {
34202 if_p);
34206 if_p);
34209 block);
34214 }
34215 /* When combined with distribute, parallel has to be followed by for.
34216 #pragma omp target parallel is allowed though. */
34220 {
34224 }
34226 {
34229 }
34231 {
34235 {
34245 block);
34248 }
34249 }
34254 {
34257 }
34265 }
34267 /* OpenMP 2.5:
34268 # pragma omp single single-clause[optseq] new-line
34269 structured-block */
34271 #define OMP_SINGLE_CLAUSE_MASK \
34272 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34277 static tree
34279 {
34289 }
34291 /* OpenMP 3.0:
34292 # pragma omp task task-clause[optseq] new-line
34293 structured-block */
34295 #define OMP_TASK_CLAUSE_MASK \
34296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34307 static tree
34309 {
34320 }
34322 /* OpenMP 3.0:
34323 # pragma omp taskwait new-line */
34325 static void
34327 {
34330 }
34332 /* OpenMP 3.1:
34333 # pragma omp taskyield new-line */
34335 static void
34337 {
34340 }
34342 /* OpenMP 4.0:
34343 # pragma omp taskgroup new-line
34344 structured-block */
34346 static tree
34348 {
34352 if_p));
34353 }
34356 /* OpenMP 2.5:
34357 # pragma omp threadprivate (variable-list) */
34359 static void
34361 {
34362 tree vars;
34368 }
34370 /* OpenMP 4.0:
34371 # pragma omp cancel cancel-clause[optseq] new-line */
34373 #define OMP_CANCEL_CLAUSE_MASK \
34374 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34380 static void
34382 {
34386 }
34388 /* OpenMP 4.0:
34389 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34391 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34392 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34397 static void
34400 {
34401 tree clauses;
34405 {
34410 {
34413 }
34414 }
34416 {
34420 }
34423 {
34426 "%<#pragma omp cancellation point%> may only be used in"
34428 else
34432 }
34435 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34437 pragma_tok);
34439 }
34441 /* OpenMP 4.0:
34442 #pragma omp distribute distribute-clause[optseq] new-line
34443 for-loop */
34445 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34446 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34452 static tree
34456 {
34465 {
34473 else
34476 {
34482 {
34486 else
34489 }
34495 else
34509 }
34510 }
34512 {
34515 }
34520 {
34523 }
34534 }
34536 /* OpenMP 4.0:
34537 # pragma omp teams teams-clause[optseq] new-line
34538 structured-block */
34540 #define OMP_TEAMS_CLAUSE_MASK \
34541 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34549 static tree
34553 {
34562 {
34566 {
34590 }
34591 }
34593 {
34596 }
34601 {
34604 }
34612 }
34614 /* OpenMP 4.0:
34615 # pragma omp target data target-data-clause[optseq] new-line
34616 structured-block */
34618 #define OMP_TARGET_DATA_CLAUSE_MASK \
34619 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34624 static tree
34626 {
34627 tree clauses
34632 {
34635 {
34652 "%<#pragma omp target data%> with map-type other "
34653 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34657 }
34659 }
34662 {
34665 "%<#pragma omp target data%> must contain at least "
34668 }
34679 }
34681 /* OpenMP 4.5:
34682 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34683 structured-block */
34685 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34686 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34692 static tree
34695 {
34698 {
34703 {
34706 }
34707 }
34709 {
34713 }
34716 {
34718 "%<#pragma omp target enter data%> may only be "
34722 }
34724 tree clauses
34729 {
34732 {
34745 "%<#pragma omp target enter data%> with map-type other "
34749 }
34751 }
34754 {
34757 "%<#pragma omp target enter data%> must contain at least "
34760 }
34767 }
34769 /* OpenMP 4.5:
34770 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34771 structured-block */
34773 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34774 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34780 static tree
34783 {
34786 {
34791 {
34794 }
34795 }
34797 {
34801 }
34804 {
34806 "%<#pragma omp target exit data%> may only be "
34810 }
34812 tree clauses
34817 {
34820 {
34834 "%<#pragma omp target exit data%> with map-type other "
34835 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34839 }
34841 }
34844 {
34847 "%<#pragma omp target exit data%> must contain at least "
34850 }
34857 }
34859 /* OpenMP 4.0:
34860 # pragma omp target update target-update-clause[optseq] new-line */
34862 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34863 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34870 static bool
34873 {
34875 {
34877 "%<#pragma omp target update%> may only be "
34881 }
34883 tree clauses
34888 {
34890 "%<#pragma omp target update%> must contain at least one "
34893 }
34901 }
34903 /* OpenMP 4.0:
34904 # pragma omp target target-clause[optseq] new-line
34905 structured-block */
34907 #define OMP_TARGET_CLAUSE_MASK \
34908 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34918 static bool
34921 {
34925 {
34929 }
34932 {
34944 {
34952 {
34953 tree stmt;
34955 {
34958 OMP_TARGET_CLAUSE_MASK,
34963 OMP_TARGET_CLAUSE_MASK,
34968 OMP_TARGET_CLAUSE_MASK,
34973 }
34975 }
34980 {
34984 if_p);
34989 if_p);
34994 if_p);
34998 }
35004 {
35005 /* For combined target teams, ensure the num_teams and
35006 thread_limit clause expressions are evaluated on the host,
35007 before entering the target construct. */
35008 tree c;
35014 {
35023 OMP_CLAUSE_FIRSTPRIVATE);
35028 }
35029 }
35038 }
35040 {
35043 }
35045 {
35049 }
35051 {
35055 }
35057 {
35061 }
35063 {
35066 }
35067 }
35082 check_clauses:
35084 {
35087 {
35101 "%<#pragma omp target%> with map-type other "
35102 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35106 }
35108 }
35110 }
35112 /* OpenACC 2.0:
35113 # pragma acc cache (variable-list) new-line
35114 */
35116 static tree
35118 {
35133 }
35135 /* OpenACC 2.0:
35136 # pragma acc data oacc-data-clause[optseq] new-line
35137 structured-block */
35139 #define OACC_DATA_CLAUSE_MASK \
35140 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35152 static tree
35154 {
35167 }
35169 /* OpenACC 2.0:
35170 # pragma acc host_data <clauses> new-line
35171 structured-block */
35173 #define OACC_HOST_DATA_CLAUSE_MASK \
35174 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35176 static tree
35178 {
35191 }
35193 /* OpenACC 2.0:
35194 # pragma acc declare oacc-data-clause[optseq] new-line
35195 */
35197 #define OACC_DECLARE_CLAUSE_MASK \
35198 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35211 static tree
35213 {
35222 {
35226 }
35229 {
35233 {
35237 }
35240 {
35249 /* Generated by c_finish_omp_clauses from array sections;
35250 avoid spurious diagnostics. */
35257 {
35259 "%qD must be a global variable in"
35261 decl);
35264 }
35269 {
35273 }
35275 {
35277 "invalid use of %<extern%> variable %qD "
35281 }
35283 {
35285 "invalid use of %<global%> variable %qD "
35289 }
35291 }
35296 {
35301 }
35304 {
35305 tree id;
35309 else
35315 {
35318 {
35321 {
35325 }
35326 }
35327 }
35328 }
35329 }
35342 }
35344 /* OpenACC 2.0:
35345 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35347 or
35349 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35351 LOC is the location of the #pragma token.
35352 */
35354 #define OACC_ENTER_DATA_CLAUSE_MASK \
35355 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35363 #define OACC_EXIT_DATA_CLAUSE_MASK \
35364 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35370 static tree
35373 {
35378 {
35384 }
35389 {
35393 }
35400 else
35405 {
35409 }
35417 }
35419 /* OpenACC 2.0:
35420 # pragma acc loop oacc-loop-clause[optseq] new-line
35421 structured-block */
35423 #define OACC_LOOP_CLAUSE_MASK \
35424 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35435 static tree
35438 {
35447 {
35453 }
35462 }
35464 /* OpenACC 2.0:
35465 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35466 structured-block
35468 or
35470 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35471 structured-block
35472 */
35474 #define OACC_KERNELS_CLAUSE_MASK \
35475 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35490 #define OACC_PARALLEL_CLAUSE_MASK \
35491 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35512 static tree
35515 {
35516 omp_clause_mask mask;
35519 {
35532 }
35535 {
35539 {
35542 tree clauses;
35544 if_p);
35546 }
35547 }
35556 }
35558 /* OpenACC 2.0:
35559 # pragma acc update oacc-update-clause[optseq] new-line
35560 */
35562 #define OACC_UPDATE_CLAUSE_MASK \
35563 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35570 static tree
35572 {
35579 {
35581 "%<#pragma acc update%> must contain at least one "
35584 }
35592 }
35594 /* OpenACC 2.0:
35595 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35597 LOC is the location of the #pragma token.
35598 */
35600 #define OACC_WAIT_CLAUSE_MASK \
35601 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35603 static tree
35605 {
35619 }
35621 /* OpenMP 4.0:
35622 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35624 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35625 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35632 static void
35635 {
35637 cp_omp_declare_simd_data data;
35639 {
35644 }
35655 {
35659 {
35672 }
35677 "%<#pragma omp declare simd%> not immediately followed by "
35681 }
35682 }
35684 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35685 This function is modelled similar to the late parsing of omp declare
35686 simd. */
35688 static tree
35690 {
35697 {
35699 "used in the same function marked as a Cilk Plus SIMD-enabled "
35705 }
35707 {
35711 }
35716 {
35723 NULL);
35737 }
35743 }
35745 /* Finalize #pragma omp declare simd clauses after direct declarator has
35746 been parsed, and put that into "omp declare simd" attribute. */
35748 static tree
35750 {
35756 {
35761 }
35766 {
35784 }
35788 }
35791 /* OpenMP 4.0:
35792 # pragma omp declare target new-line
35793 declarations and definitions
35794 # pragma omp end declare target new-line
35796 OpenMP 4.5:
35797 # pragma omp declare target ( extended-list ) new-line
35799 # pragma omp declare target declare-target-clauses[seq] new-line */
35801 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35805 static void
35807 {
35810 clauses
35814 {
35816 clauses);
35819 }
35820 else
35821 {
35825 }
35828 "%<#pragma omp declare target%> with clauses in between "
35829 "%<#pragma omp declare target%> without clauses and "
35832 {
35838 {
35841 }
35842 else
35845 {
35847 "%qD specified both in declare target %<link%> and %<to%>"
35850 }
35852 {
35856 {
35859 {
35863 }
35864 }
35865 }
35866 }
35867 }
35869 static void
35871 {
35874 {
35877 }
35879 {
35883 {
35886 }
35889 else
35890 {
35894 }
35895 }
35896 else
35897 {
35901 }
35905 "%<#pragma omp end declare target%> without corresponding "
35907 else
35909 }
35911 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35912 expression and optional initializer clause of
35913 #pragma omp declare reduction. We store the expression(s) as
35914 either 3, 6 or 7 special statements inside of the artificial function's
35915 body. The first two statements are DECL_EXPRs for the artificial
35916 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35917 expression that uses those variables.
35918 If there was any INITIALIZER clause, this is followed by further statements,
35919 the fourth and fifth statements are DECL_EXPRs for the artificial
35920 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35921 constructor variant (first token after open paren is not omp_priv),
35922 then the sixth statement is a statement with the function call expression
35923 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35924 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35925 to initialize the OMP_PRIV artificial variable and there is seventh
35926 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35928 static bool
35930 {
35942 tree combiner;
35957 {
35960 }
35963 {
35970 {
35973 }
35989 {
35993 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35997 == CPP_CLOSE_PAREN
36000 {
36004 }
36009 }
36010 else
36011 {
36027 {
36032 }
36034 tree arg;
36047 }
36058 }
36064 }
36066 /* OpenMP 4.0
36067 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36068 initializer-clause[opt] new-line
36070 initializer-clause:
36071 initializer (omp_priv initializer)
36072 initializer (function-name (argument-list)) */
36074 static void
36077 {
36087 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36094 {
36126 }
36138 /* Types may not be defined in declare reduction type list. */
36141 parser->type_definition_forbidden_message
36147 saved_colon_doesnt_start_class_def_p
36152 {
36156 ;
36177 else
36182 else
36184 }
36186 /* Restore the saved message. */
36189 parser->colon_doesnt_start_class_def_p
36194 {
36195 fail:
36198 }
36204 {
36205 tree fntype
36208 NULL_TREE);
36228 {
36233 }
36235 {
36237 {
36246 }
36253 }
36254 else
36255 {
36258 }
36261 else
36264 {
36267 }
36269 {
36272 else
36277 }
36282 else
36283 {
36292 }
36299 }
36303 done:
36304 /* Free any declarators allocated. */
36306 }
36308 /* OpenMP 4.0
36309 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36310 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36311 initializer-clause[opt] new-line
36312 #pragma omp declare target new-line */
36314 static void
36317 {
36319 {
36324 {
36327 context);
36329 }
36332 {
36335 context);
36337 }
36339 {
36342 }
36344 {
36348 }
36349 }
36353 }
36355 /* OpenMP 4.5:
36356 #pragma omp taskloop taskloop-clause[optseq] new-line
36357 for-loop
36359 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36360 for-loop */
36362 #define OMP_TASKLOOP_CLAUSE_MASK \
36363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36378 static tree
36382 {
36391 {
36396 {
36420 }
36421 }
36423 {
36426 }
36431 {
36434 }
36440 if_p);
36446 }
36449 /* OpenACC 2.0:
36450 # pragma acc routine oacc-routine-clause[optseq] new-line
36451 function-definition
36453 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36454 */
36456 #define OACC_ROUTINE_CLAUSE_MASK \
36457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36463 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36464 component, which must resolve to a declared namespace-scope
36465 function. The clauses are either processed directly (for a named
36466 function), or defered until the immediatley following declaration
36467 is parsed. */
36469 static void
36472 {
36475 cp_omp_declare_simd_data data;
36477 {
36483 }
36486 /* Create a dummy claue, to record location. */
36490 {
36495 }
36497 /* Look for optional '( name )'. */
36499 {
36501 {
36510 "%<#pragma acc routine%> not followed by a "
36515 }
36520 /* We parse the name as an id-expression. If it resolves to
36521 anything other than a non-overloaded function at namespace
36522 scope, it's an error. */
36536 {
36540 }
36542 /* Build a chain of clauses. */
36547 cp_lexer_peek_token
36550 /* Force clauses to be non-null, by attaching context to it. */
36556 {
36560 }
36562 /* Perhaps we should use the same rule as declarations in different
36563 namespaces? */
36565 {
36570 }
36573 {
36578 }
36585 }
36586 else
36587 {
36606 {
36607 /* Create an empty list of clauses. */
36609 NULL_TREE);
36620 }
36621 }
36622 }
36624 /* Finalize #pragma acc routine clauses after direct declarator has
36625 been parsed, and put that into "oacc function" attribute. */
36627 static tree
36629 {
36633 location_t loc;
36639 {
36644 }
36661 /* Force clauses to be non-null, by attaching context to it. */
36666 }
36668 /* Apply any saved OpenACC routine clauses to a just-parsed
36669 declaration. */
36671 static void
36673 {
36675 {
36683 {
36686 }
36689 {
36692 }
36695 {
36697 "%<#pragma acc routine%> not followed by a function "
36700 }
36703 {
36705 fndecl);
36707 }
36710 {
36714 }
36716 /* Process for function attrib */
36720 /* Add an "omp target" attribute. */
36724 }
36725 }
36727 /* Main entry point to OpenMP statement pragmas. */
36729 static void
36731 {
36732 tree stmt;
36737 {
36760 if_p);
36765 if_p);
36782 if_p);
36787 if_p);
36795 if_p);
36804 if_p);
36818 if_p);
36823 if_p);
36827 }
36830 }
36831 \f
36832 /* Transactional Memory parsing routines. */
36834 /* Parse a transaction attribute.
36836 txn-attribute:
36837 attribute
36838 [ [ identifier ] ]
36840 We use this instead of cp_parser_attributes_opt for transactions to avoid
36841 the pedwarn in C++98 mode. */
36843 static tree
36845 {
36860 {
36864 /* For keywords, use the canonical spelling,
36865 not the parsed identifier. */
36869 }
36870 else
36874 error1:
36877 }
36879 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36881 transaction-statement:
36882 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36883 compound-statement
36884 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36885 */
36887 static tree
36889 {
36900 else
36901 {
36905 }
36907 /* Parse a noexcept specification. */
36911 {
36912 /* cancel-and-throw is unimplemented. */
36915 }
36916 else
36919 /* Keep track if we're in the lexical scope of an outer transaction. */
36931 }
36933 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36935 transaction-expression:
36936 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36937 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36938 */
36940 static tree
36942 {
36955 keyword == RID_TRANSACTION_RELAXED
36969 /* Set this early. This might mean that we allow transaction_cancel in
36970 an expression that we find out later actually has to be a constexpr.
36971 However, we expect that cxx_constant_value will be able to deal with
36972 this; also, if the noexcept has no constexpr, then what we parse next
36973 really is a transaction's body. */
36976 /* Parse a noexcept specification. */
36982 {
36989 }
36990 else
36991 {
36992 /* The only expression that is available got parsed for the noexcept
36993 already. noexcept is true then. */
36996 }
37005 }
37007 /* Parse a function-transaction-block.
37009 function-transaction-block:
37010 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37011 function-body
37012 __transaction_atomic txn-attribute[opt] function-try-block
37013 __transaction_relaxed ctor-initializer[opt] function-body
37014 __transaction_relaxed function-try-block
37015 */
37017 static bool
37019 {
37035 else
37036 {
37040 }
37048 else
37049 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37057 }
37059 /* Parse a __transaction_cancel statement.
37061 cancel-statement:
37062 __transaction_cancel txn-attribute[opt] ;
37063 __transaction_cancel txn-attribute[opt] throw-expression ;
37065 ??? Cancel and throw is not yet implemented. */
37067 static tree
37069 {
37075 RT_TRANSACTION_CANCEL);
37082 /* ??? Parse cancel-and-throw here. */
37087 {
37091 }
37093 {
37097 }
37099 {
37102 {
37108 }
37109 }
37111 {
37115 }
37121 }
37122 \f
37123 /* The parser. */
37127 \f
37128 /* Special handling for the first token or line in the file. The first
37129 thing in the file might be #pragma GCC pch_preprocess, which loads a
37130 PCH file, which is a GC collection point. So we need to handle this
37131 first pragma without benefit of an existing lexer structure.
37133 Always returns one token to the caller in *FIRST_TOKEN. This is
37134 either the true first token of the file, or the first token after
37135 the initial pragma. */
37137 static void
37139 {
37148 {
37155 }
37156 else
37159 /* Skip to the end of the pragma. */
37163 /* Now actually load the PCH file. */
37167 /* Read one more token to return to our caller. We have to do this
37168 after reading the PCH file in, since its pointers have to be
37169 live. */
37171 }
37173 /* Parses the grainsize pragma for the _Cilk_for statement.
37174 Syntax:
37175 #pragma cilk grainsize = <VALUE>. */
37177 static void
37179 {
37181 {
37186 {
37189 }
37191 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37194 else
37196 "%<#pragma cilk grainsize%> is not followed by "
37199 }
37201 }
37203 /* Normal parsing of a pragma token. Here we can (and must) use the
37204 regular lexer. */
37206 static bool
37208 {
37211 tree stmt;
37222 {
37230 {
37240 }
37245 {
37255 }
37260 {
37266 "%<#pragma omp taskwait%> may only be "
37271 }
37276 {
37282 "%<#pragma omp taskyield%> may only be "
37287 }
37292 {
37298 "%<#pragma omp cancel%> may only be "
37303 }
37375 "%<#pragma omp section%> may only be used in "
37380 {
37382 {
37386 }
37393 {
37396 }
37399 }
37403 {
37407 }
37415 {
37419 }
37421 /* Ignore the pragma if Cilk Plus is not enabled. */
37423 {
37426 }
37427 else
37428 {
37432 }
37439 bad_stmt:
37442 }
37446 }
37448 /* The interface the pragma parsers have to the lexer. */
37450 enum cpp_ttype
37452 {
37464 else
37465 {
37469 }
37472 }
37474 \f
37475 /* External interface. */
37477 /* Parse one entire translation unit. */
37479 void
37481 {
37494 }
37496 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37497 vectorlength clause:
37498 Syntax:
37499 vectorlength ( constant-expression ) */
37501 static tree
37504 {
37506 tree expr;
37507 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37508 safelen clause. Thus, vectorlength is represented as OMP 4.0
37509 safelen. For SIMD-enabled function it is represented by OMP 4.0
37510 simdlen. */
37513 loc);
37514 else
37516 loc);
37524 /* If expr == error_mark_node, then don't emit any errors nor
37525 create a clause. if any of the above functions returns
37526 error mark node then they would have emitted an error message. */
37528 ;
37536 else
37537 {
37538 tree c;
37540 {
37545 }
37546 else
37547 {
37552 }
37553 }
37558 }
37560 /* Handles the Cilk Plus #pragma simd linear clause.
37561 Syntax:
37562 linear ( simd-linear-variable-list )
37564 simd-linear-variable-list:
37565 simd-linear-variable
37566 simd-linear-variable-list , simd-linear-variable
37568 simd-linear-variable:
37569 id-expression
37570 id-expression : simd-linear-step
37572 simd-linear-step:
37573 conditional-expression */
37575 static tree
37577 {
37583 {
37587 }
37592 {
37595 {
37599 }
37606 {
37610 }
37611 else
37612 {
37616 /* If present, parse the linear step. Otherwise, assume the default
37617 value of 1. */
37619 {
37626 {
37627 /* If an error has occurred, then the whole pragma is
37628 considered ill-formed. Thus, no reason to keep
37629 parsing. */
37632 }
37640 else
37642 "step size must be an integer constant "
37644 }
37646 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37652 }
37657 else
37658 {
37663 }
37664 }
37668 }
37670 /* Returns the name of the next clause. If the clause is not
37671 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37672 token is not consumed. Otherwise, the appropriate enum from the
37673 pragma_simd_clause is returned and the token is consumed. */
37675 static pragma_omp_clause
37677 {
37678 pragma_omp_clause clause_type;
37695 else
37700 }
37702 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37704 static tree
37706 {
37711 {
37712 pragma_omp_clause c_kind;
37719 /* Use the OpenMP 4.0 equivalent function. */
37722 /* Use the OpenMP 4.0 equivalent function. */
37724 clauses);
37726 /* Use the OMP 4.0 equivalent function. */
37728 clauses);
37730 /* Use the OMP 4.0 equivalent function. */
37732 else
37733 {
37737 }
37738 }
37744 else
37746 }
37748 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37750 static void
37752 {
37759 {
37763 }
37772 }
37774 /* Main entry-point for parsing Cilk Plus _Cilk_for
37775 loops. The return value is error_mark_node
37776 when errors happen and CILK_FOR tree on success. */
37778 static tree
37780 {
37795 else
37801 }
37803 /* Create an identifier for a generic parameter type (a synthesized
37804 template parameter implied by `auto' or a concept identifier). */
37807 static tree
37809 {
37813 }
37815 /* Predicate that behaves as is_auto_or_concept but matches the parent
37816 node of the generic type rather than the generic type itself. This
37817 allows for type transformation in add_implicit_template_parms. */
37821 {
37823 }
37825 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37826 (creating a new template parameter list if necessary). Returns the newly
37827 created template type parm. */
37829 static tree
37831 {
37834 /* Before committing to modifying any scope, if we're in an
37835 implicit template scope, and we're trying to synthesize a
37836 constrained parameter, try to find a previous parameter with
37837 the same name. This is the same-type rule for abbreviated
37838 function templates. */
37840 {
37843 {
37845 {
37848 /* Return the TEMPLATE_PARM_INDEX. */
37851 }
37853 }
37854 }
37856 /* We are either continuing a function template that already contains implicit
37857 template parameters, creating a new fully-implicit function template, or
37858 extending an existing explicit function template with implicit template
37859 parameters. */
37867 {
37871 }
37872 else
37873 {
37874 /* Roll back to the existing template parameter scope (in the case of
37875 extending an explicit function template) or introduce a new template
37876 parameter scope ahead of the function parameter scope (or class scope
37877 in the case of out-of-line member definitions). The function scope is
37878 added back after template parameter synthesis below. */
37883 {
37886 }
37888 {
37889 /* If not defining a class, then any class scope is a scope level in
37890 an out-of-line member definition. In this case simply wind back
37891 beyond the first such scope to inject the template parameter list.
37892 Otherwise wind back to the class being defined. The latter can
37893 occur in class member friend declarations such as:
37895 class A {
37896 void foo (auto);
37897 };
37898 class B {
37899 friend void A::foo (auto);
37900 };
37902 The template parameter list synthesized for the friend declaration
37903 must be injected in the scope of 'B'. This can also occur in
37904 erroneous cases such as:
37906 struct A {
37907 struct B {
37908 void foo (auto);
37909 };
37910 void B::foo (auto) {}
37911 };
37913 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37914 but, nevertheless, the template parameter list synthesized for the
37915 declarator should be injected into the scope of 'A' as if the
37916 ill-formed template was specified explicitly. */
37919 {
37922 }
37923 }
37929 {
37930 /* Introduce a new template parameter list for implicit template
37931 parameters. */
37935 parser->implicit_template_scope
37942 }
37943 else
37944 {
37945 /* Synthesize implicit template parameters at the end of the explicit
37946 template parameter list. */
37953 parser->implicit_template_parms
37955 }
37956 }
37958 /* Synthesize a new template parameter and track the current template
37959 parameter chain with implicit_template_parms. */
37963 tree synth_tmpl_parm;
37967 synth_tmpl_parm
37970 synth_tmpl_parm
37972 else
37973 {
37977 }
37979 // Attach the constraint to the parm before processing.
37982 tree new_parm
37984 input_location,
37985 node,
37989 // Chain the new parameter to the list of implicit parameters.
37991 parser->implicit_template_parms
37993 else
37998 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38001 /* If creating a fully implicit function template, start the new implicit
38002 template parameter list with this synthesized type, otherwise grow the
38003 current template parameter list. */
38006 {
38013 }
38014 else
38015 {
38020 }
38022 // If the new parameter was constrained, we need to add that to the
38023 // constraints in the template parameter list.
38025 {
38029 }
38034 }
38036 /* Finish the declaration of a fully implicit function template. Such a
38037 template has no explicit template parameter list so has not been through the
38038 normal template head and tail processing. synthesize_implicit_template_parm
38039 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38040 provided if the declaration is a class member such that its template
38041 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38042 form is returned. Otherwise NULL_TREE is returned. */
38044 static tree
38046 {
38051 {
38055 }
38065 }