| blob | 2a46d6fbde7f3fcda5e2fe916f0dc036f3b49521 |
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 {
3896 location_t last_tok_loc;
3900 do
3901 {
3904 count++;
3909 {
3912 {
3915 }
3918 {
3923 }
3925 }
3926 else
3930 {
3935 "unsupported non-standard concatenation "
3937 }
3943 {
3947 }
3948 else
3949 {
3953 }
3954 }
3957 /* A string literal built by concatenation has its caret=start at
3958 the start of the initial string, and its finish at the finish of
3959 the final string literal. */
3963 }
3966 {
3969 }
3973 {
3978 {
3993 }
3998 {
4003 else
4005 }
4006 }
4007 else
4008 /* cpp_interpret_string has issued an error. */
4015 }
4017 /* Look up a literal operator with the name and the exact arguments. */
4019 static tree
4021 {
4028 {
4034 {
4037 {
4047 }
4050 /* May be this should be sufficient_parms_p instead,
4051 depending on how exactly should user-defined literals
4052 work in presence of default arguments on the literal
4053 operator parameters. */
4056 }
4057 }
4060 }
4062 /* Parse a user-defined char constant. Returns a call to a user-defined
4063 literal operator taking the character as an argument. */
4065 static cp_expr
4067 {
4075 /* Build up a call to the user-defined operator */
4076 /* Lookup the name we got back from the id-expression. */
4081 {
4086 }
4090 }
4092 /* A subroutine of cp_parser_userdef_numeric_literal to
4093 create a char... template parameter pack from a string node. */
4095 static tree
4097 {
4098 tree charvec;
4104 /* Fill in CHARVEC with all of the parameters. */
4109 /* Build the argument packs. */
4116 }
4118 /* A subroutine of cp_parser_userdef_numeric_literal to
4119 create a char... template parameter pack from a string node. */
4121 static tree
4123 {
4124 tree charvec;
4135 /* First template parm is character type. */
4138 /* Fill in CHARVEC with all of the parameters. */
4145 /* Build the argument packs. */
4152 }
4154 /* Parse a user-defined numeric constant. returns a call to a user-defined
4155 literal operator. */
4157 static cp_expr
4159 {
4170 /* Look for a literal operator taking the exact type of numeric argument
4171 as the literal value. */
4176 {
4178 tf_warning_or_error);
4181 {
4184 long_long_unsigned_type_node);
4185 }
4186 else
4187 {
4191 long_double_type_node);
4195 }
4199 }
4202 /* If the numeric argument didn't work, look for a raw literal
4203 operator taking a const char* argument consisting of the number
4204 in string format. */
4209 {
4211 tf_warning_or_error);
4214 }
4217 /* If the raw literal didn't work, look for a non-type template
4218 function with parameter pack char.... Call the function with
4219 template parameter characters representing the number. */
4223 {
4227 tf_warning_or_error);
4230 }
4239 }
4241 /* Parse a user-defined string constant. Returns a call to a user-defined
4242 literal operator taking a character pointer and the length of the string
4243 as arguments. */
4245 static tree
4247 {
4256 /* Build up a call to the user-defined operator. */
4257 /* Lookup the name we got back from the id-expression. */
4264 {
4266 tf_warning_or_error);
4269 }
4272 /* Look for a template function with typename parameter CharT
4273 and parameter pack CharT... Call the function with
4274 template parameter characters representing the string. */
4278 {
4282 tf_warning_or_error);
4285 }
4291 }
4294 /* Basic concepts [gram.basic] */
4296 /* Parse a translation-unit.
4298 translation-unit:
4299 declaration-seq [opt]
4301 Returns TRUE if all went well. */
4303 static bool
4305 {
4306 /* The address of the first non-permanent object on the declarator
4307 obstack. */
4312 /* Create the declarator obstack, if necessary. */
4314 {
4316 /* Create the error declarator. */
4318 /* Create the empty parameter list. */
4320 /* Remember where the base of the declarator obstack lies. */
4322 }
4326 /* If there are no tokens left then all went well. */
4328 {
4329 /* Get rid of the token array; we don't need it any more. */
4333 /* This file might have been a context that's implicitly extern
4334 "C". If so, pop the lang context. (Only relevant for PCH.) */
4336 {
4339 }
4341 /* Finish up. */
4345 }
4346 else
4347 {
4350 }
4352 /* Make sure the declarator obstack was fully cleaned up. */
4356 /* All went well. */
4358 }
4360 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4361 decltype context. */
4365 {
4370 }
4372 /* We're about to parse a collection of statements. If we're currently
4373 parsing tentatively, set up a firewall so that any nested
4374 cp_parser_commit_to_tentative_parse won't affect the current context. */
4376 static cp_token_position
4378 {
4385 }
4387 /* We've finished parsing the collection of statements. Wrap up the
4388 firewall and replace the relevant tokens with the parsed form. */
4390 static void
4392 tree expr)
4393 {
4397 /* Finish the firewall level. */
4399 /* And remember the result of the parse for when we try again. */
4405 }
4407 /* Like the above functions, but let the user modify the tokens. Used by
4408 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4409 later parses, so it makes sense to localize the effects of
4410 cp_parser_commit_to_tentative_parse. */
4412 struct tentative_firewall
4413 {
4418 {
4419 /* If we're currently parsing tentatively, start a committed level as a
4420 firewall and then an inner tentative parse. */
4422 {
4426 }
4427 }
4430 {
4432 {
4433 /* Finish the inner tentative parse and the firewall, propagating any
4434 uncommitted error state to the outer tentative parse. */
4440 }
4441 }
4442 };
4444 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4445 enclosing parentheses. */
4447 static cp_expr
4449 {
4452 /* Consume the '('. */
4455 /* Start the statement-expression. */
4457 /* Parse the compound-statement. */
4459 /* Finish up. */
4461 /* Consume the ')'. */
4469 }
4471 /* Expressions [gram.expr] */
4473 /* Parse a fold-operator.
4475 fold-operator:
4476 - * / % ^ & | = < > << >>
4477 = -= *= /= %= ^= &= |= <<= >>=
4478 == != <= >= && || , .* ->*
4480 This returns the tree code corresponding to the matched operator
4481 as an int. When the current token matches a compound assignment
4482 opertor, the resulting tree code is the negative value of the
4483 non-assignment operator. */
4485 static int
4487 {
4489 {
4529 }
4530 }
4532 /* Returns true if CODE indicates a binary expression, which is not allowed in
4533 the LHS of a fold-expression. More codes will need to be added to use this
4534 function in other contexts. */
4536 static bool
4538 {
4540 {
4573 }
4574 }
4576 /* If the next token is a suitable fold operator, consume it and return as
4577 the function above. */
4579 static int
4581 {
4587 }
4589 /* Parse a fold-expression.
4591 fold-expression:
4592 ( ... folding-operator cast-expression)
4593 ( cast-expression folding-operator ... )
4594 ( cast-expression folding operator ... folding-operator cast-expression)
4596 Note that the '(' and ')' are matched in primary expression. */
4598 static cp_expr
4600 {
4601 cp_id_kind pidk;
4603 // Left fold.
4605 {
4609 {
4612 }
4619 }
4624 {
4627 }
4630 {
4633 }
4636 /* The operands of a fold-expression are cast-expressions, so binary or
4637 conditional expressions are not allowed. We check this here to avoid
4638 tentative parsing. */
4646 // Right fold.
4651 {
4654 }
4657 // Binary left or right fold.
4662 }
4664 /* Parse a primary-expression.
4666 primary-expression:
4667 literal
4668 this
4669 ( expression )
4670 id-expression
4671 lambda-expression (C++11)
4673 GNU Extensions:
4675 primary-expression:
4676 ( compound-statement )
4677 __builtin_va_arg ( assignment-expression , type-id )
4678 __builtin_offsetof ( type-id , offsetof-expression )
4680 C++ Extensions:
4681 __has_nothrow_assign ( type-id )
4682 __has_nothrow_constructor ( type-id )
4683 __has_nothrow_copy ( type-id )
4684 __has_trivial_assign ( type-id )
4685 __has_trivial_constructor ( type-id )
4686 __has_trivial_copy ( type-id )
4687 __has_trivial_destructor ( type-id )
4688 __has_virtual_destructor ( type-id )
4689 __is_abstract ( type-id )
4690 __is_base_of ( type-id , type-id )
4691 __is_class ( type-id )
4692 __is_empty ( type-id )
4693 __is_enum ( type-id )
4694 __is_final ( type-id )
4695 __is_literal_type ( type-id )
4696 __is_pod ( type-id )
4697 __is_polymorphic ( type-id )
4698 __is_std_layout ( type-id )
4699 __is_trivial ( type-id )
4700 __is_union ( type-id )
4702 Objective-C++ Extension:
4704 primary-expression:
4705 objc-expression
4707 literal:
4708 __null
4710 ADDRESS_P is true iff this expression was immediately preceded by
4711 "&" and therefore might denote a pointer-to-member. CAST_P is true
4712 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4713 true iff this expression is a template argument.
4715 Returns a representation of the expression. Upon return, *IDK
4716 indicates what kind of id-expression (if any) was present. */
4718 static cp_expr
4725 {
4728 /* Assume the primary expression is not an id-expression. */
4731 /* Peek at the next token. */
4734 {
4735 /* literal:
4736 integer-literal
4737 character-literal
4738 floating-literal
4739 string-literal
4740 boolean-literal
4741 pointer-literal
4742 user-defined-literal */
4754 {
4758 }
4759 /* Floating-point literals are only allowed in an integral
4760 constant expression if they are cast to an integral or
4761 enumeration type. */
4765 {
4766 /* CAST_P will be set even in invalid code like "int(2.7 +
4767 ...)". Therefore, we have to check that the next token
4768 is sure to end the cast. */
4770 {
4775 enumerator-definition. */
4777 /* The curly brace at the end of an enum-specifier. */
4779 /* The end of a statement. */
4781 /* The end of the cast-expression. */
4783 /* The end of an array bound. */
4785 /* The closing ">" in a template-argument-list. */
4788 /* C++0x only: A ">>" treated like two ">" tokens,
4789 in a template-argument-list. */
4794 }
4796 /* If we are within a cast, then the constraint that the
4797 cast is to an integral or enumeration type will be
4798 checked at that point. If we are not within a cast, then
4799 this code is invalid. */
4802 }
4822 /* ??? Should wide strings be allowed when parser->translate_strings_p
4823 is false (i.e. in attributes)? If not, we can kill the third
4824 argument to cp_parser_string_literal. */
4830 /* If we see `( { ' then we are looking at the beginning of
4831 a GNU statement-expression. */
4834 {
4835 /* Statement-expressions are not allowed by the standard. */
4839 /* And they're not allowed outside of a function-body; you
4840 cannot, for example, write:
4842 int i = ({ int j = 3; j + 1; });
4844 at class or namespace scope. */
4847 {
4849 "statement-expressions are not allowed outside "
4855 }
4856 else
4858 }
4859 /* Otherwise it's a normal parenthesized expression. */
4860 {
4861 cp_expr expr;
4866 /* Consume the `('. */
4868 /* Within a parenthesized expression, a `>' token is always
4869 the greater-than operator. */
4870 saved_greater_than_is_operator_p
4875 /* Left fold expression. */
4877 else
4878 /* Parse the parenthesized expression. */
4883 {
4890 }
4891 else
4892 /* Let the front end know that this expression was
4893 enclosed in parentheses. This matters in case, for
4894 example, the expression is of the form `A::B', since
4895 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4896 not. */
4899 /* DR 705: Wrapping an unqualified name in parentheses
4900 suppresses arg-dependent lookup. We want to pass back
4901 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4902 (c++/37862), but none of the others. */
4906 /* The `>' token might be the end of a template-id or
4907 template-parameter-list now. */
4908 parser->greater_than_is_operator_p
4911 /* Consume the `)'. */
4920 }
4923 {
4925 {
4926 /* We might have an Objective-C++ message. */
4929 /* If that works out, we're done ... */
4932 /* ... else, fall though to see if it's a lambda. */
4933 }
4935 /* Don't warn about a failed tentative parse. */
4940 }
4944 /* We have an Objective-C++ string literal. */
4951 {
4952 /* These two are the boolean literals. */
4960 /* The `__null' literal. */
4965 /* The `nullptr' literal. */
4970 /* Recognize the `this' keyword. */
4974 {
4978 }
4979 /* Pointers cannot appear in constant-expressions. */
4984 /* The `operator' keyword can be the beginning of an
4985 id-expression. */
4992 {
4993 non_integral_constant name;
4995 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4996 __func__ are the names of variables -- but they are
4997 treated specially. Therefore, they are handled here,
4998 rather than relying on the generic id-expression logic
4999 below. Grammatically, these names are id-expressions.
5001 Consume the token. */
5005 {
5017 }
5022 /* Look up the name. */
5024 }
5027 {
5028 tree expression;
5029 tree type;
5030 source_location type_location;
5031 location_t start_loc
5033 /* The `__builtin_va_arg' construct is used to handle
5034 `va_arg'. Consume the `__builtin_va_arg' token. */
5036 /* Look for the opening `('. */
5038 /* Now, parse the assignment-expression. */
5040 /* Look for the `,'. */
5043 /* Parse the type-id. */
5044 {
5047 }
5048 /* Look for the closing `)'. */
5049 location_t finish_loc
5052 /* Using `va_arg' in a constant-expression is not
5053 allowed. */
5055 NIC_VA_ARG))
5057 /* Construct a location of the form:
5058 __builtin_va_arg (v, int)
5059 ~~~~~~~~~~~~~~~~~~~~~^~~~
5060 with the caret at the type, ranging from the start of the
5061 "__builtin_va_arg" token to the close paren. */
5062 location_t combined_loc
5065 }
5096 // C++ concepts
5100 /* Objective-C++ expressions. */
5110 {
5115 }
5119 }
5121 /* An id-expression can start with either an identifier, a
5122 `::' as the beginning of a qualified-id, or the "operator"
5123 keyword. */
5128 {
5129 id_expression:
5130 cp_expr id_expression;
5131 cp_expr decl;
5137 /* Parse the id-expression. */
5138 id_expression
5155 /* If we have a template-id, then no further lookup is
5156 required. If the template-id was for a template-class, we
5157 will sometimes have a TYPE_DECL at this point. */
5161 /* Look up the name. */
5162 else
5163 {
5164 tree ambiguous_decls;
5166 /* If we already know that this lookup is ambiguous, then
5167 we've already issued an error message; there's no reason
5168 to check again. */
5171 {
5174 }
5177 none_type,
5178 template_p,
5183 /* If the lookup was ambiguous, an error will already have
5184 been issued. */
5188 /* In Objective-C++, we may have an Objective-C 2.0
5189 dot-syntax for classes here. */
5194 {
5195 tree component;
5202 component);
5203 /* Build a location of the form:
5204 expr.component
5205 ~~~~~^~~~~~~~~
5206 with caret at the start of the component name (at
5207 input_location), ranging from the start of the id_expression
5208 to the end of the component name. */
5209 location_t combined_loc
5214 }
5216 /* In Objective-C++, an instance variable (ivar) may be preferred
5217 to whatever cp_parser_lookup_name() found.
5218 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5219 rest of c-family, we have to do a little extra work to preserve
5220 any location information in cp_expr "decl". Given that
5221 objc_lookup_ivar is implemented in "c-family" and "objc", we
5222 have a trip through the pure "tree" type, rather than cp_expr.
5223 Naively copying it back to "decl" would implicitly give the
5224 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5225 store an EXPR_LOCATION. Hence we only update "decl" (and
5226 hence its location_t) if we get back a different tree node. */
5228 id_expression);
5232 /* If name lookup gives us a SCOPE_REF, then the
5233 qualifying scope was dependent. */
5235 {
5236 /* At this point, we do not know if DECL is a valid
5237 integral constant expression. We assume that it is
5238 in fact such an expression, so that code like:
5240 template <int N> struct A {
5241 int a[B<N>::i];
5242 };
5244 is accepted. At template-instantiation time, we
5245 will check that B<N>::i is actually a constant. */
5247 }
5248 /* Check to see if DECL is a local variable in a context
5249 where that is forbidden. */
5252 {
5253 /* It might be that we only found DECL because we are
5254 trying to be generous with pre-ISO scoping rules.
5255 For example, consider:
5257 int i;
5258 void g() {
5259 for (int i = 0; i < 10; ++i) {}
5260 extern void f(int j = i);
5261 }
5263 Here, name look up will originally find the out
5264 of scope `i'. We need to issue a warning message,
5265 but then use the global `i'. */
5268 {
5273 }
5274 }
5275 }
5277 decl = (finish_id_expression
5279 idk,
5284 template_arg_p,
5291 }
5293 /* Anything else is an error. */
5297 }
5298 }
5306 {
5309 }
5311 /* Parse an id-expression.
5313 id-expression:
5314 unqualified-id
5315 qualified-id
5317 qualified-id:
5318 :: [opt] nested-name-specifier template [opt] unqualified-id
5319 :: identifier
5320 :: operator-function-id
5321 :: template-id
5323 Return a representation of the unqualified portion of the
5324 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5325 a `::' or nested-name-specifier.
5327 Often, if the id-expression was a qualified-id, the caller will
5328 want to make a SCOPE_REF to represent the qualified-id. This
5329 function does not do this in order to avoid wastefully creating
5330 SCOPE_REFs when they are not required.
5332 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5333 `template' keyword.
5335 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5336 uninstantiated templates.
5338 If *TEMPLATE_P is non-NULL, it is set to true iff the
5339 `template' keyword is used to explicitly indicate that the entity
5340 named is a template.
5342 If DECLARATOR_P is true, the id-expression is appearing as part of
5343 a declarator, rather than as part of an expression. */
5345 static cp_expr
5352 {
5356 /* Assume the `template' keyword was not used. */
5360 /* Look for the optional `::' operator. */
5361 global_scope_p
5364 /* Look for the optional nested-name-specifier. */
5365 nested_name_specifier_p
5368 check_dependency_p,
5370 declarator_p)
5372 /* If there is a nested-name-specifier, then we are looking at
5373 the first qualified-id production. */
5375 {
5376 tree saved_scope;
5377 tree saved_object_scope;
5378 tree saved_qualifying_scope;
5379 tree unqualified_id;
5382 /* See if the next token is the `template' keyword. */
5386 /* Name lookup we do during the processing of the
5387 unqualified-id might obliterate SCOPE. */
5391 /* Process the final unqualified-id. */
5393 check_dependency_p,
5394 declarator_p,
5396 /* Restore the SAVED_SCOPE for our caller. */
5402 }
5403 /* Otherwise, if we are in global scope, then we are looking at one
5404 of the other qualified-id productions. */
5406 {
5408 tree id;
5410 /* Peek at the next token. */
5413 /* If it's an identifier, and the next token is not a "<", then
5414 we can avoid the template-id case. This is an optimization
5415 for this common case. */
5417 && !cp_parser_nth_token_starts_template_argument_list_p
5422 /* Try a template-id. */
5426 none_type,
5427 declarator_p);
5428 /* If that worked, we're done. */
5432 /* Peek at the next token. (Changes in the token buffer may
5433 have invalidated the pointer obtained above.) */
5437 {
5444 /* Fall through. */
5449 }
5450 }
5451 else
5454 declarator_p,
5455 optional_p);
5456 }
5458 /* Parse an unqualified-id.
5460 unqualified-id:
5461 identifier
5462 operator-function-id
5463 conversion-function-id
5464 ~ class-name
5465 template-id
5467 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5468 keyword, in a construct like `A::template ...'.
5470 Returns a representation of unqualified-id. For the `identifier'
5471 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5472 production a BIT_NOT_EXPR is returned; the operand of the
5473 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5474 other productions, see the documentation accompanying the
5475 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5476 names are looked up in uninstantiated templates. If DECLARATOR_P
5477 is true, the unqualified-id is appearing as part of a declarator,
5478 rather than as part of an expression. */
5480 static cp_expr
5486 {
5489 /* Peek at the next token. */
5493 {
5495 {
5496 tree id;
5498 /* We don't know yet whether or not this will be a
5499 template-id. */
5501 /* Try a template-id. */
5503 check_dependency_p,
5504 none_type,
5505 declarator_p);
5506 /* If it worked, we're done. */
5509 /* Otherwise, it's an ordinary identifier. */
5511 }
5515 check_dependency_p,
5516 none_type,
5517 declarator_p);
5520 {
5521 tree type_decl;
5522 tree qualifying_scope;
5523 tree object_scope;
5524 tree scope;
5527 /* Consume the `~' token. */
5529 /* Parse the class-name. The standard, as written, seems to
5530 say that:
5532 template <typename T> struct S { ~S (); };
5533 template <typename T> S<T>::~S() {}
5535 is invalid, since `~' must be followed by a class-name, but
5536 `S<T>' is dependent, and so not known to be a class.
5537 That's not right; we need to look in uninstantiated
5538 templates. A further complication arises from:
5540 template <typename T> void f(T t) {
5541 t.T::~T();
5542 }
5544 Here, it is not possible to look up `T' in the scope of `T'
5545 itself. We must look in both the current scope, and the
5546 scope of the containing complete expression.
5548 Yet another issue is:
5550 struct S {
5551 int S;
5552 ~S();
5553 };
5555 S::~S() {}
5557 The standard does not seem to say that the `S' in `~S'
5558 should refer to the type `S' and not the data member
5559 `S::S'. */
5561 /* DR 244 says that we look up the name after the "~" in the
5562 same scope as we looked up the qualifying name. That idea
5563 isn't fully worked out; it's more complicated than that. */
5568 /* Check for invalid scopes. */
5570 {
5574 }
5576 {
5580 scope);
5585 }
5588 /* If the name is of the form "X::~X" it's OK even if X is a
5589 typedef. */
5598 {
5601 }
5603 /* ~auto means the destructor of whatever the object is. */
5605 {
5608 "%<~auto%> only available with "
5612 }
5614 /* If there was an explicit qualification (S::~T), first look
5615 in the scope given by the qualification (i.e., S).
5617 Note: in the calls to cp_parser_class_name below we pass
5618 typename_type so that lookup finds the injected-class-name
5619 rather than the constructor. */
5623 {
5628 typename_type,
5631 declarator_p);
5634 }
5635 /* In "N::S::~S", look in "N" as well. */
5637 {
5642 type_decl
5646 typename_type,
5649 declarator_p);
5652 }
5653 /* In "p->S::~T", look in the scope given by "*p" as well. */
5655 {
5660 type_decl
5664 typename_type,
5667 declarator_p);
5670 }
5671 /* Look in the surrounding context. */
5673 {
5679 type_decl
5683 typename_type,
5686 declarator_p);
5689 {
5690 /* We couldn't find a type with this name. If we're parsing
5691 tentatively, fail and try something else. */
5693 {
5696 }
5697 /* Otherwise, accept it and check for a match at instantiation
5698 time. */
5703 }
5704 }
5705 /* If an error occurred, assume that the name of the
5706 destructor is the same as the name of the qualifying
5707 class. That allows us to keep parsing after running
5708 into ill-formed destructor names. */
5714 /* Check that destructor name and scope match. */
5716 {
5723 }
5725 /* [class.dtor]
5727 A typedef-name that names a class shall not be used as the
5728 identifier in the declarator for a destructor declaration. */
5735 type_decl);
5738 }
5742 {
5743 cp_expr id;
5745 /* This could be a template-id, so we try that first. */
5747 /* Try a template-id. */
5750 none_type,
5751 declarator_p);
5752 /* If that worked, we're done. */
5755 /* We still don't know whether we're looking at an
5756 operator-function-id or a conversion-function-id. */
5758 /* Try an operator-function-id. */
5760 /* If that didn't work, try a conversion-function-id. */
5764 {
5765 /* 17.6.3.3.5 */
5771 }
5774 }
5775 /* Fall through. */
5782 }
5783 }
5785 /* Parse an (optional) nested-name-specifier.
5787 nested-name-specifier: [C++98]
5788 class-or-namespace-name :: nested-name-specifier [opt]
5789 class-or-namespace-name :: template nested-name-specifier [opt]
5791 nested-name-specifier: [C++0x]
5792 type-name ::
5793 namespace-name ::
5794 nested-name-specifier identifier ::
5795 nested-name-specifier template [opt] simple-template-id ::
5797 PARSER->SCOPE should be set appropriately before this function is
5798 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5799 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5800 in name lookups.
5802 Sets PARSER->SCOPE to the class (TYPE) or namespace
5803 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5804 it unchanged if there is no nested-name-specifier. Returns the new
5805 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5807 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5808 part of a declaration and/or decl-specifier. */
5810 static tree
5816 {
5821 /* Remember where the nested-name-specifier starts. */
5823 {
5826 }
5829 {
5830 tree new_scope;
5831 tree old_scope;
5832 tree saved_qualifying_scope;
5835 /* Spot cases that cannot be the beginning of a
5836 nested-name-specifier. */
5839 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5840 the already parsed nested-name-specifier. */
5842 {
5843 /* Grab the nested-name-specifier and continue the loop. */
5845 /* If we originally encountered this nested-name-specifier
5846 with IS_DECLARATION set to false, we will not have
5847 resolved TYPENAME_TYPEs, so we must do so here. */
5850 {
5855 }
5858 }
5860 /* Spot cases that cannot be the beginning of a
5861 nested-name-specifier. On the second and subsequent times
5862 through the loop, we look for the `template' keyword. */
5864 ;
5865 /* A template-id can start a nested-name-specifier. */
5867 ;
5868 /* DR 743: decltype can be used in a nested-name-specifier. */
5870 ;
5871 else
5872 {
5873 /* If the next token is not an identifier, then it is
5874 definitely not a type-name or namespace-name. */
5877 /* If the following token is neither a `<' (to begin a
5878 template-id), nor a `::', then we are not looking at a
5879 nested-name-specifier. */
5885 {
5889 }
5892 && !cp_parser_nth_token_starts_template_argument_list_p
5895 }
5897 /* The nested-name-specifier is optional, so we parse
5898 tentatively. */
5901 /* Look for the optional `template' keyword, if this isn't the
5902 first time through the loop. */
5905 else
5908 /* Save the old scope since the name lookup we are about to do
5909 might destroy it. */
5912 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5913 look up names in "X<T>::I" in order to determine that "Y" is
5914 a template. So, if we have a typename at this point, we make
5915 an effort to look through it. */
5917 && !typename_keyword_p
5922 /* Parse the qualifying entity. */
5923 new_scope
5925 typename_keyword_p,
5926 template_keyword_p,
5927 check_dependency_p,
5928 type_p,
5929 is_declaration);
5930 /* Look for the `::' token. */
5933 /* If we found what we wanted, we keep going; otherwise, we're
5934 done. */
5936 {
5939 /* Restore the OLD_SCOPE since it was valid before the
5940 failed attempt at finding the last
5941 class-or-namespace-name. */
5945 /* If the next token is a decltype, and the one after that is a
5946 `::', then the decltype has failed to resolve to a class or
5947 enumeration type. Give this error even when parsing
5948 tentatively since it can't possibly be valid--and we're going
5949 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5950 won't get another chance.*/
5954 {
5961 /* As below. */
5964 }
5968 {
5969 /* If we have a non-type template-id followed by ::, it can't
5970 possibly be valid. */
5975 {
5978 {
5984 }
5985 else
5986 {
5987 /* Variable template. */
5992 }
5999 /* As below. */
6003 }
6004 }
6008 /* If the next token is an identifier, and the one after
6009 that is a `::', then any valid interpretation would have
6010 found a class-or-namespace-name. */
6016 {
6019 {
6021 {
6022 tree decl;
6023 tree ambiguous_decls;
6026 none_type,
6035 decl);
6037 {
6038 // cp_parser_lookup_name has the same diagnostic,
6039 // thus make sure to emit it at most once.
6042 {
6047 }
6049 }
6050 else
6051 {
6053 cp_parser_name_lookup_error
6056 else
6057 cp_parser_name_lookup_error
6060 }
6061 }
6064 /* Treat this as a successful nested-name-specifier
6065 due to:
6067 [basic.lookup.qual]
6069 If the name found is not a class-name (clause
6070 _class_) or namespace-name (_namespace.def_), the
6071 program is ill-formed. */
6073 }
6075 }
6077 }
6078 /* We've found one valid nested-name-specifier. */
6080 /* Name lookup always gives us a DECL. */
6083 /* Uses of "template" must be followed by actual templates. */
6095 new_scope);
6096 /* If it is a class scope, try to complete it; we are about to
6097 be looking up names inside the class. */
6099 /* Since checking types for dependency can be expensive,
6100 avoid doing it if the type is already complete. */
6102 /* Do not try to complete dependent types. */
6104 {
6106 /* If it is a typedef to current class, use the current
6107 class instead, as the typedef won't have any names inside
6108 it yet. */
6112 }
6113 /* Make sure we look in the right scope the next time through
6114 the loop. */
6116 }
6118 /* If parsing tentatively, replace the sequence of tokens that makes
6119 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6120 token. That way, should we re-parse the token stream, we will
6121 not have to repeat the effort required to do the parse, nor will
6122 we issue duplicate error messages. */
6124 {
6128 /* Reset the contents of the START token. */
6130 /* Retrieve any deferred checks. Do not pop this access checks yet
6131 so the memory will not be reclaimed during token replacing below. */
6139 /* Purge all subsequent tokens. */
6141 }
6147 }
6149 /* Parse a nested-name-specifier. See
6150 cp_parser_nested_name_specifier_opt for details. This function
6151 behaves identically, except that it will an issue an error if no
6152 nested-name-specifier is present. */
6154 static tree
6160 {
6161 tree scope;
6163 /* Look for the nested-name-specifier. */
6165 typename_keyword_p,
6166 check_dependency_p,
6167 type_p,
6168 is_declaration);
6169 /* If it was not present, issue an error message. */
6171 {
6174 }
6177 }
6179 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6180 this is either a class-name or a namespace-name (which corresponds
6181 to the class-or-namespace-name production in the grammar). For
6182 C++0x, it can also be a type-name that refers to an enumeration
6183 type or a simple-template-id.
6185 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6186 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6187 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6188 TYPE_P is TRUE iff the next name should be taken as a class-name,
6189 even the same name is declared to be another entity in the same
6190 scope.
6192 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6193 specified by the class-or-namespace-name. If neither is found the
6194 ERROR_MARK_NODE is returned. */
6196 static tree
6203 {
6204 tree saved_scope;
6205 tree saved_qualifying_scope;
6206 tree saved_object_scope;
6207 tree scope;
6211 /* DR 743: decltype can appear in a nested-name-specifier. */
6213 {
6217 {
6220 }
6224 }
6226 /* Before we try to parse the class-name, we must save away the
6227 current PARSER->SCOPE since cp_parser_class_name will destroy
6228 it. */
6232 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6233 there is no need to look for a namespace-name. */
6234 only_class_p = template_keyword_p
6239 typename_keyword_p,
6240 template_keyword_p,
6242 check_dependency_p,
6244 is_declaration,
6247 /* If that didn't work, try for a namespace-name. */
6249 {
6250 /* Restore the saved scope. */
6254 /* If we are not looking at an identifier followed by the scope
6255 resolution operator, then this is not part of a
6256 nested-name-specifier. (Note that this function is only used
6257 to parse the components of a nested-name-specifier.) */
6262 }
6265 }
6267 /* Return true if we are looking at a compound-literal, false otherwise. */
6269 static bool
6271 {
6272 /* Consume the `('. */
6277 /* Skip tokens until the next token is a closing parenthesis.
6278 If we find the closing `)', and the next token is a `{', then
6279 we are looking at a compound-literal. */
6280 bool compound_literal_p
6285 /* Roll back the tokens we skipped. */
6289 }
6291 /* Parse a postfix-expression.
6293 postfix-expression:
6294 primary-expression
6295 postfix-expression [ expression ]
6296 postfix-expression ( expression-list [opt] )
6297 simple-type-specifier ( expression-list [opt] )
6298 typename :: [opt] nested-name-specifier identifier
6299 ( expression-list [opt] )
6300 typename :: [opt] nested-name-specifier template [opt] template-id
6301 ( expression-list [opt] )
6302 postfix-expression . template [opt] id-expression
6303 postfix-expression -> template [opt] id-expression
6304 postfix-expression . pseudo-destructor-name
6305 postfix-expression -> pseudo-destructor-name
6306 postfix-expression ++
6307 postfix-expression --
6308 dynamic_cast < type-id > ( expression )
6309 static_cast < type-id > ( expression )
6310 reinterpret_cast < type-id > ( expression )
6311 const_cast < type-id > ( expression )
6312 typeid ( expression )
6313 typeid ( type-id )
6315 GNU Extension:
6317 postfix-expression:
6318 ( type-id ) { initializer-list , [opt] }
6320 This extension is a GNU version of the C99 compound-literal
6321 construct. (The C99 grammar uses `type-name' instead of `type-id',
6322 but they are essentially the same concept.)
6324 If ADDRESS_P is true, the postfix expression is the operand of the
6325 `&' operator. CAST_P is true if this expression is the target of a
6326 cast.
6328 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6329 class member access expressions [expr.ref].
6331 Returns a representation of the expression. */
6333 static cp_expr
6337 {
6339 location_t loc;
6346 /* Peek at the next token. */
6351 /* Some of the productions are determined by keywords. */
6354 {
6359 {
6360 tree type;
6361 cp_expr expression;
6365 /* All of these can be handled in the same way from the point
6366 of view of parsing. Begin by consuming the token
6367 identifying the cast. */
6370 /* New types cannot be defined in the cast. */
6372 parser->type_definition_forbidden_message
6375 /* Look for the opening `<'. */
6377 /* Parse the type to which we are casting. */
6382 /* Look for the closing `>'. */
6384 /* Restore the old message. */
6387 bool saved_greater_than_is_operator_p
6391 /* And the expression which is being cast. */
6395 RT_CLOSE_PAREN);
6399 parser->greater_than_is_operator_p
6402 /* Only type conversions to integral or enumeration types
6403 can be used in constant-expressions. */
6409 {
6411 postfix_expression
6415 postfix_expression
6419 postfix_expression
6421 tf_warning_or_error);
6424 postfix_expression
6429 }
6431 /* Construct a location e.g. :
6432 reinterpret_cast <int *> (expr)
6433 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6434 ranging from the start of the "*_cast" token to the final closing
6435 paren, with the caret at the start. */
6438 }
6442 {
6443 tree type;
6447 /* Consume the `typeid' token. */
6449 /* Look for the `(' token. */
6451 /* Types cannot be defined in a `typeid' expression. */
6453 parser->type_definition_forbidden_message
6455 /* We can't be sure yet whether we're looking at a type-id or an
6456 expression. */
6458 /* Try a type-id first. */
6463 /* Look for the `)' token. Otherwise, we can't be sure that
6464 we're not looking at an expression: consider `typeid (int
6465 (3))', for example. */
6467 /* If all went well, simply lookup the type-id. */
6470 /* Otherwise, fall back to the expression variant. */
6471 else
6472 {
6473 tree expression;
6475 /* Look for an expression. */
6477 /* Compute its typeid. */
6479 /* Look for the `)' token. */
6481 }
6482 /* Restore the saved message. */
6484 /* `typeid' may not appear in an integral constant expression. */
6487 }
6491 {
6492 tree type;
6493 /* The syntax permitted here is the same permitted for an
6494 elaborated-type-specifier. */
6501 }
6505 {
6506 location_t cilk_spawn_loc
6511 {
6516 }
6518 {
6523 }
6524 else
6525 {
6526 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6529 }
6531 postfix_expression =
6535 {
6539 }
6541 {
6546 }
6547 else
6548 {
6551 postfix_expression);
6552 /* Build a location of the form:
6553 _Cilk_spawn expr
6554 ~~~~~~~~~~~~^~~~
6555 with caret at the expr, ranging from the start of the
6556 _Cilk_spawn token to the end of the expression. */
6557 location_t combined_loc =
6563 }
6565 }
6568 {
6571 tree p;
6585 tf_warning_or_error);
6588 tf_warning_or_error);
6589 else
6590 {
6594 }
6596 }
6599 {
6600 tree type;
6602 /* If the next thing is a simple-type-specifier, we may be
6603 looking at a functional cast. We could also be looking at
6604 an id-expression. So, we try the functional cast, and if
6605 that doesn't work we fall back to the primary-expression. */
6607 /* Look for the simple-type-specifier. */
6611 CP_PARSER_FLAGS_NONE);
6613 /* Parse the cast itself. */
6615 postfix_expression
6617 /* If that worked, we're done. */
6621 /* If the functional-cast didn't work out, try a
6622 compound-literal. */
6625 {
6630 /* Avoid calling cp_parser_type_id pointlessly, see comment
6631 in cp_parser_cast_expression about c++/29234. */
6634 else
6635 {
6636 /* Parse the type. */
6641 /* Look for the `)'. */
6643 }
6645 /* If things aren't going well, there's no need to
6646 keep going. */
6648 {
6650 /* Parse the brace-enclosed initializer list. */
6653 }
6654 /* If that worked, we're definitely looking at a
6655 compound-literal expression. */
6657 {
6658 /* Warn the user that a compound literal is not
6659 allowed in standard C++. */
6662 /* For simplicity, we disallow compound literals in
6663 constant-expressions. We could
6664 allow compound literals of integer type, whose
6665 initializer was a constant, in constant
6666 expressions. Permitting that usage, as a further
6667 extension, would not change the meaning of any
6668 currently accepted programs. (Of course, as
6669 compound literals are not part of ISO C++, the
6670 standard has nothing to say.) */
6672 NIC_NCC))
6673 {
6676 }
6677 /* Form the representation of the compound-literal. */
6678 postfix_expression
6680 tf_warning_or_error);
6683 }
6684 }
6686 /* It must be a primary-expression. */
6687 postfix_expression
6690 decltype_p,
6692 }
6694 }
6696 /* Note that we don't need to worry about calling build_cplus_new on a
6697 class-valued CALL_EXPR in decltype when it isn't the end of the
6698 postfix-expression; unary_complex_lvalue will take care of that for
6699 all these cases. */
6701 /* Keep looping until the postfix-expression is complete. */
6703 {
6707 /* It is not a Koenig lookup function call. */
6708 postfix_expression
6711 /* Peek at the next token. */
6715 {
6718 {
6720 "two consecutive %<[%> shall "
6723 }
6724 postfix_expression
6726 postfix_expression,
6728 decltype_p);
6737 /* postfix-expression ( expression-list [opt] ) */
6738 {
6749 is_builtin_constant_p
6752 {
6753 /* The whole point of __builtin_constant_p is to allow
6754 non-constant expressions to appear as arguments. */
6755 saved_integral_constant_expression_p
6757 saved_non_integral_constant_expression_p
6760 }
6761 args = (cp_parser_parenthesized_expression_list
6767 {
6768 parser->integral_constant_expression_p
6770 parser->non_integral_constant_expression_p
6772 }
6775 {
6778 }
6780 /* Function calls are not permitted in
6781 constant-expressions. */
6784 NIC_FUNC_CALL))
6785 {
6789 }
6794 {
6796 {
6798 {
6801 postfix_expression
6803 complain);
6804 }
6805 else
6806 postfix_expression
6808 }
6809 /* We do not perform argument-dependent lookup if
6810 normal lookup finds a non-function, in accordance
6811 with the expected resolution of DR 218. */
6814 {
6818 /* Do not do argument dependent lookup if regular
6819 lookup finds a member function or a block-scope
6820 function declaration. [basic.lookup.argdep]/3 */
6823 {
6826 postfix_expression
6828 complain);
6829 }
6830 }
6831 }
6837 {
6846 }
6849 {
6859 {
6860 postfix_expression
6864 }
6867 {
6868 postfix_expression
6869 = (build_new_method_call
6875 complain));
6876 }
6877 else
6878 postfix_expression
6882 complain);
6883 }
6887 postfix_expression = (build_offset_ref_call_from_tree
6889 complain));
6891 /* A call to a static class member, or a namespace-scope
6892 function. */
6893 postfix_expression
6896 koenig_p,
6897 complain);
6898 else
6899 /* All other function calls. */
6900 postfix_expression
6903 koenig_p,
6904 complain);
6907 {
6909 start_loc,
6910 close_paren_loc);
6912 }
6914 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6918 }
6923 /* postfix-expression . template [opt] id-expression
6924 postfix-expression . pseudo-destructor-name
6925 postfix-expression -> template [opt] id-expression
6926 postfix-expression -> pseudo-destructor-name */
6928 /* Consume the `.' or `->' operator. */
6931 postfix_expression
6933 postfix_expression,
6940 /* postfix-expression ++ */
6941 /* Consume the `++' token. */
6943 /* Generate a representation for the complete expression. */
6944 postfix_expression
6946 POSTINCREMENT_EXPR);
6947 /* Increments may not appear in constant-expressions. */
6955 /* postfix-expression -- */
6956 /* Consume the `--' token. */
6958 /* Generate a representation for the complete expression. */
6959 postfix_expression
6961 POSTDECREMENT_EXPR);
6962 /* Decrements may not appear in constant-expressions. */
6973 return is_member_access
6974 ? postfix_expression
6976 else
6978 }
6979 }
6981 /* We should never get here. */
6984 }
6986 /* This function parses Cilk Plus array notations. If a normal array expr. is
6987 parsed then the array index is passed back to the caller through *INIT_INDEX
6988 and the function returns a NULL_TREE. If array notation expr. is parsed,
6989 then *INIT_INDEX is ignored by the caller and the function returns
6990 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6991 error_mark_node. */
6993 static tree
6995 tree array_value)
6996 {
7000 {
7003 }
7012 {
7015 }
7017 {
7018 /* Consume the ':'. */
7021 /* If we are here, then we have a case like this A[:]. */
7023 {
7027 }
7031 }
7032 else
7033 {
7034 /* If we are here, then there are three valid possibilities:
7035 1. ARRAY [ EXP ]
7036 2. ARRAY [ EXP : EXP ]
7037 3. ARRAY [ EXP : EXP : EXP ] */
7041 {
7042 /* This indicates that we have a normal array expression. */
7045 }
7047 /* Consume the ':'. */
7051 {
7054 }
7055 }
7060 {
7064 }
7070 }
7072 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7073 by cp_parser_builtin_offsetof. We're looking for
7075 postfix-expression [ expression ]
7076 postfix-expression [ braced-init-list ] (C++11)
7078 FOR_OFFSETOF is set if we're being called in that context, which
7079 changes how we deal with integer constant expressions. */
7081 static tree
7083 tree postfix_expression,
7086 {
7091 /* Consume the `[' token. */
7097 /* Parse the index expression. */
7098 /* ??? For offsetof, there is a question of what to allow here. If
7099 offsetof is not being used in an integral constant expression context,
7100 then we *could* get the right answer by computing the value at runtime.
7101 If we are in an integral constant expression context, then we might
7102 could accept any constant expression; hard to say without analysis.
7103 Rather than open the barn door too wide right away, allow only integer
7104 constant expressions here. */
7107 else
7108 {
7110 {
7117 {
7119 "braced list index is not allowed with array "
7123 }
7124 }
7126 {
7127 /* Here are have these two options:
7128 ARRAY[EXP : EXP] - Array notation expr with default
7129 stride of 1.
7130 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7131 stride. */
7133 postfix_expression);
7136 }
7137 else
7139 }
7143 /* Look for the closing `]'. */
7146 /* Build the ARRAY_REF. */
7150 /* When not doing offsetof, array references are not permitted in
7151 constant-expressions. */
7157 }
7159 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7160 by cp_parser_builtin_offsetof. We're looking for
7162 postfix-expression . template [opt] id-expression
7163 postfix-expression . pseudo-destructor-name
7164 postfix-expression -> template [opt] id-expression
7165 postfix-expression -> pseudo-destructor-name
7167 FOR_OFFSETOF is set if we're being called in that context. That sorta
7168 limits what of the above we'll actually accept, but nevermind.
7169 TOKEN_TYPE is the "." or "->" token, which will already have been
7170 removed from the stream. */
7172 static tree
7175 cp_expr postfix_expression,
7177 location_t location)
7178 {
7179 tree name;
7185 /* If this is a `->' operator, dereference the pointer. */
7188 tf_warning_or_error);
7189 /* Check to see whether or not the expression is type-dependent and
7190 not the current instantiation. */
7192 /* The identifier following the `->' or `.' is not qualified. */
7198 /* Enter the scope corresponding to the type of the object
7199 given by the POSTFIX_EXPRESSION. */
7201 {
7203 /* According to the standard, no expression should ever have
7204 reference type. Unfortunately, we do not currently match
7205 the standard in this respect in that our internal representation
7206 of an expression may have reference type even when the standard
7207 says it does not. Therefore, we have to manually obtain the
7208 underlying type here. */
7210 /* The type of the POSTFIX_EXPRESSION must be complete. */
7211 /* Unlike the object expression in other contexts, *this is not
7212 required to be of complete type for purposes of class member
7213 access (5.2.5) outside the member function body. */
7215 && !(processing_template_decl
7216 && current_class_type
7217 && (same_type_ignoring_top_level_qualifiers_p
7220 /* Let the name lookup machinery know that we are processing a
7221 class member access expression. */
7223 /* If something went wrong, we want to be able to discern that case,
7224 as opposed to the case where there was no SCOPE due to the type
7225 of expression being dependent. */
7228 /* If the SCOPE was erroneous, make the various semantic analysis
7229 functions exit quickly -- and without issuing additional error
7230 messages. */
7233 }
7234 else
7235 /* Tell cp_parser_lookup_name that there was an object, even though it's
7236 type-dependent. */
7239 /* Assume this expression is not a pseudo-destructor access. */
7242 /* If the SCOPE is a scalar type, then, if this is a valid program,
7243 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7244 is type dependent, it can be pseudo-destructor-name or something else.
7245 Try to parse it as pseudo-destructor-name first. */
7247 {
7248 tree s;
7249 tree type;
7252 /* Parse the pseudo-destructor-name. */
7261 {
7263 postfix_expression
7266 }
7267 }
7270 {
7271 /* If the SCOPE is not a scalar type, we are looking at an
7272 ordinary class member access expression, rather than a
7273 pseudo-destructor-name. */
7276 /* Parse the id-expression. */
7277 name = (cp_parser_id_expression
7284 /* In general, build a SCOPE_REF if the member name is qualified.
7285 However, if the name was not dependent and has already been
7286 resolved; there is no need to build the SCOPE_REF. For example;
7288 struct X { void f(); };
7289 template <typename T> void f(T* t) { t->X::f(); }
7291 Even though "t" is dependent, "X::f" is not and has been resolved
7292 to a BASELINK; there is no need to include scope information. */
7294 /* But we do need to remember that there was an explicit scope for
7295 virtual function calls. */
7299 /* If the name is a template-id that names a type, we will get a
7300 TYPE_DECL here. That is invalid code. */
7302 {
7305 }
7306 else
7307 {
7309 {
7311 {
7315 }
7316 else
7319 name,
7320 template_p);
7324 }
7326 adjust_result_of_qualified_name_lookup
7328 postfix_expression
7330 template_p,
7331 tf_warning_or_error);
7332 /* Build a location e.g.:
7333 ptr->access_expr
7334 ~~~^~~~~~~~~~~~~
7335 where the caret is at the deref token, ranging from
7336 the start of postfix_expression to the end of the access expr. */
7337 location_t end_loc
7339 location_t combined_loc
7342 }
7343 }
7345 /* We no longer need to look up names in the scope of the object on
7346 the left-hand side of the `.' or `->' operator. */
7349 /* Outside of offsetof, these operators may not appear in
7350 constant-expressions. */
7352 && (cp_parser_non_integral_constant_expression
7357 }
7359 /* Parse a parenthesized expression-list.
7361 expression-list:
7362 assignment-expression
7363 expression-list, assignment-expression
7365 attribute-list:
7366 expression-list
7367 identifier
7368 identifier, expression-list
7370 CAST_P is true if this expression is the target of a cast.
7372 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7373 argument pack.
7375 Returns a vector of trees. Each element is a representation of an
7376 assignment-expression. NULL is returned if the ( and or ) are
7377 missing. An empty, but allocated, vector is returned on no
7378 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7379 if we are parsing an attribute list for an attribute that wants a
7380 plain identifier argument, normal_attr for an attribute that wants
7381 an expression, or non_attr if we aren't parsing an attribute list. If
7382 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7383 not all of the expressions in the list were constant.
7384 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7385 will be written to with the location of the closing parenthesis. If
7386 an error occurs, it may or may not be written to. */
7395 {
7401 /* Assume all the expressions will be constant. */
7410 /* Within a parenthesized expression, a `>' token is always
7411 the greater-than operator. */
7412 saved_greater_than_is_operator_p
7416 /* Consume expressions until there are no more. */
7419 {
7420 tree expr;
7422 /* At the beginning of attribute lists, check to see if the
7423 next token is an identifier. */
7426 {
7429 /* Consume the identifier. */
7431 /* Save the identifier. */
7433 }
7434 else
7435 {
7438 /* Parse the next assignment-expression. */
7440 {
7441 /* A braced-init-list. */
7447 }
7449 {
7450 expr = (cp_parser_constant_expression
7455 }
7456 else
7458 cast_p);
7463 /* If we have an ellipsis, then this is an expression
7464 expansion. */
7467 {
7468 /* Consume the `...'. */
7471 /* Build the argument pack. */
7473 }
7475 /* Add it to the list. We add error_mark_node
7476 expressions to the list, so that we can still tell if
7477 the correct form for a parenthesized expression-list
7478 is found. That gives better errors. */
7483 }
7485 /* After the first item, attribute lists look the same as
7486 expression lists. */
7489 get_comma:;
7490 /* If the next token isn't a `,', then we are done. */
7494 /* Otherwise, consume the `,' and keep going. */
7496 }
7502 {
7505 skip_comma:;
7506 /* We try and resync to an unnested comma, as that will give the
7507 user better diagnostics. */
7515 {
7516 parser->greater_than_is_operator_p
7519 }
7520 }
7522 parser->greater_than_is_operator_p
7529 }
7531 /* Parse a pseudo-destructor-name.
7533 pseudo-destructor-name:
7534 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7535 :: [opt] nested-name-specifier template template-id :: ~ type-name
7536 :: [opt] nested-name-specifier [opt] ~ type-name
7538 If either of the first two productions is used, sets *SCOPE to the
7539 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7540 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7541 or ERROR_MARK_NODE if the parse fails. */
7543 static void
7545 tree object,
7548 {
7551 /* Handle ~auto. */
7555 {
7558 "%<~auto%> only available with "
7565 }
7567 /* Assume that things will not work out. */
7570 /* Look for the optional `::' operator. */
7572 /* Look for the optional nested-name-specifier. */
7573 nested_name_specifier_p
7580 /* Now, if we saw a nested-name-specifier, we might be doing the
7581 second production. */
7584 {
7585 /* Consume the `template' keyword. */
7587 /* Parse the template-id. */
7591 class_type,
7593 /* Look for the `::' token. */
7595 }
7596 /* If the next token is not a `~', then there might be some
7597 additional qualification. */
7599 {
7600 /* At this point, we're looking for "type-name :: ~". The type-name
7601 must not be a class-name, since this is a pseudo-destructor. So,
7602 it must be either an enum-name, or a typedef-name -- both of which
7603 are just identifiers. So, we peek ahead to check that the "::"
7604 and "~" tokens are present; if they are not, then we can avoid
7605 calling type_name. */
7609 {
7612 }
7614 /* Look for the type-name. */
7619 /* Look for the `::' token. */
7621 }
7622 else
7625 /* Look for the `~'. */
7628 /* Once we see the ~, this has to be a pseudo-destructor. */
7632 /* Look for the type-name again. We are not responsible for
7633 checking that it matches the first type-name. */
7635 }
7637 /* Parse a unary-expression.
7639 unary-expression:
7640 postfix-expression
7641 ++ cast-expression
7642 -- cast-expression
7643 unary-operator cast-expression
7644 sizeof unary-expression
7645 sizeof ( type-id )
7646 alignof ( type-id ) [C++0x]
7647 new-expression
7648 delete-expression
7650 GNU Extensions:
7652 unary-expression:
7653 __extension__ cast-expression
7654 __alignof__ unary-expression
7655 __alignof__ ( type-id )
7656 alignof unary-expression [C++0x]
7657 __real__ cast-expression
7658 __imag__ cast-expression
7659 && identifier
7660 sizeof ( type-id ) { initializer-list , [opt] }
7661 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7662 __alignof__ ( type-id ) { initializer-list , [opt] }
7664 ADDRESS_P is true iff the unary-expression is appearing as the
7665 operand of the `&' operator. CAST_P is true if this expression is
7666 the target of a cast.
7668 Returns a representation of the expression. */
7670 static cp_expr
7673 {
7677 /* Peek at the next token. */
7679 /* Some keywords give away the kind of expression. */
7681 {
7685 {
7688 {
7691 location_t first_loc;
7694 /* Consume the token. */
7697 /* Parse the operand. */
7702 else
7703 {
7704 /* ISO C++ defines alignof only with types, not with
7705 expressions. So pedwarn if alignof is used with a non-
7706 type expression. However, __alignof__ is ok. */
7709 "ISO C++ does not allow %<alignof%> "
7713 }
7714 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7715 SIZEOF_EXPR with the original operand. */
7717 {
7719 {
7721 {
7724 error_mark_node));
7726 }
7727 else
7731 }
7733 }
7735 }
7744 {
7745 /* The saved value of the PEDANTIC flag. */
7747 tree expr;
7749 /* Save away the PEDANTIC flag. */
7751 /* Parse the cast-expression. */
7753 /* Restore the PEDANTIC flag. */
7757 }
7761 {
7762 tree expression;
7764 /* Consume the `__real__' or `__imag__' token. */
7766 /* Parse the cast-expression. */
7768 /* Create the complete representation. */
7772 expression,
7773 tf_warning_or_error);
7774 }
7782 {
7783 tree expr;
7793 parser->type_definition_forbidden_message
7796 saved_integral_constant_expression_p
7798 saved_non_integral_constant_expression_p
7802 saved_greater_than_is_operator_p
7814 parser->greater_than_is_operator_p
7817 parser->integral_constant_expression_p
7819 parser->non_integral_constant_expression_p
7826 }
7830 }
7831 }
7833 /* Look for the `:: new' and `:: delete', which also signal the
7834 beginning of a new-expression, or delete-expression,
7835 respectively. If the next token is `::', then it might be one of
7836 these. */
7838 {
7841 /* See if the token after the `::' is one of the keywords in
7842 which we're interested. */
7844 /* If it's `new', we have a new-expression. */
7847 /* Similarly, for `delete'. */
7850 }
7852 /* Look for a unary operator. */
7854 /* The `++' and `--' operators can be handled similarly, even though
7855 they are not technically unary-operators in the grammar. */
7857 {
7862 /* Handle the GNU address-of-label extension. */
7865 {
7866 tree identifier;
7867 tree expression;
7870 /* Consume the '&&' token. */
7872 /* Look for the identifier. */
7873 location_t finish_loc
7876 /* Construct a location of the form:
7877 &&label
7878 ^~~~~~~
7879 with caret==start at the "&&", finish at the end of the label. */
7880 location_t combined_loc
7882 /* Create an expression representing the address. */
7885 NIC_ADDR_LABEL))
7888 }
7889 }
7891 {
7892 cp_expr cast_expression;
7898 /* Consume the operator token. */
7902 /* Parse the cast-expression. */
7903 cast_expression
7908 pidk);
7910 /* Make a location:
7911 OP_TOKEN CAST_EXPRESSION
7912 ^~~~~~~~~~~~~~~~~~~~~~~~~
7913 with start==caret at the operator token, and
7914 extending to the end of the cast_expression. */
7917 /* Now, build an appropriate representation. */
7919 {
7923 RO_UNARY_STAR,
7924 complain);
7925 /* TODO: build_x_indirect_ref does not always honor the
7926 location, so ensure it is set. */
7932 /* Fall through. */
7935 cast_expression,
7936 complain);
7937 /* TODO: build_x_unary_op does not always honor the location,
7938 so ensure it is set. */
7946 /* Fall through. */
7948 /* Immediately fold negation of a constant, unless the constant is 0
7949 (since -0 == 0) or it would overflow. */
7954 {
7957 cast_expression);
7959 {
7962 }
7963 }
7964 /* Fall through. */
7973 }
7977 non_constant_p))
7981 }
7985 decltype_p,
7986 pidk);
7987 }
7989 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7990 unary-operator, the corresponding tree code is returned. */
7992 static enum tree_code
7994 {
7996 {
8017 }
8018 }
8020 /* Parse a new-expression.
8022 new-expression:
8023 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8024 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8026 Returns a representation of the expression. */
8028 static tree
8030 {
8033 tree type;
8036 tree ret;
8040 /* Look for the optional `::' operator. */
8041 global_scope_p
8045 /* Look for the `new' operator. */
8047 /* There's no easy way to tell a new-placement from the
8048 `( type-id )' construct. */
8050 /* Look for a new-placement. */
8052 /* If that didn't work out, there's no new-placement. */
8054 {
8058 }
8060 /* If the next token is a `(', then we have a parenthesized
8061 type-id. */
8063 {
8067 /* Consume the `('. */
8070 /* Parse the type-id. */
8071 parser->type_definition_forbidden_message
8073 {
8076 }
8079 /* Look for the closing `)'. */
8082 /* There should not be a direct-new-declarator in this production,
8083 but GCC used to allowed this, so we check and emit a sensible error
8084 message for this case. */
8086 {
8092 }
8093 }
8094 /* Otherwise, there must be a new-type-id. */
8095 else
8098 /* If the next token is a `(' or '{', then we have a new-initializer. */
8103 else
8106 /* A new-expression may not appear in an integral constant
8107 expression. */
8110 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8111 of a new-type-id or type-id of a new-expression, the new-expression shall
8112 contain a new-initializer of the form ( assignment-expression )".
8113 Additionally, consistently with the spirit of DR 1467, we want to accept
8114 'new auto { 2 }' too. */
8119 {
8121 "initialization of new-expression for type %<auto%> "
8124 }
8125 else
8126 {
8127 /* Construct a location e.g.:
8128 ptr = new int[100]
8129 ^~~~~~~~~~~~
8130 with caret == start at the start of the "new" token, and the end
8131 at the end of the final token we consumed. */
8136 /* Create a representation of the new-expression. */
8138 tf_warning_or_error);
8140 }
8148 }
8150 /* Parse a new-placement.
8152 new-placement:
8153 ( expression-list )
8155 Returns the same representation as for an expression-list. */
8159 {
8162 /* Parse the expression-list. */
8163 expression_list = (cp_parser_parenthesized_expression_list
8172 }
8174 /* Parse a new-type-id.
8176 new-type-id:
8177 type-specifier-seq new-declarator [opt]
8179 Returns the TYPE allocated. If the new-type-id indicates an array
8180 type, *NELTS is set to the number of elements in the last array
8181 bound; the TYPE will not include the last array bound. */
8183 static tree
8185 {
8186 cp_decl_specifier_seq type_specifier_seq;
8192 /* The type-specifier sequence must not contain type definitions.
8193 (It cannot contain declarations of new types either, but if they
8194 are not definitions we will catch that because they are not
8195 complete.) */
8197 parser->type_definition_forbidden_message
8199 /* Parse the type-specifier-seq. */
8203 /* Restore the old message. */
8209 /* Parse the new-declarator. */
8212 /* Determine the number of elements in the last array dimension, if
8213 any. */
8215 /* Skip down to the last array dimension. */
8220 {
8223 }
8228 {
8231 }
8234 {
8241 else
8243 }
8246 }
8248 /* Parse an (optional) new-declarator.
8250 new-declarator:
8251 ptr-operator new-declarator [opt]
8252 direct-new-declarator
8254 Returns the declarator. */
8258 {
8261 cp_cv_quals cv_quals;
8263 /* We don't know if there's a ptr-operator next, or not. */
8265 /* Look for a ptr-operator. */
8267 /* If that worked, look for more new-declarators. */
8269 {
8272 /* Parse another optional declarator. */
8275 declarator = cp_parser_make_indirect_declarator
8279 }
8281 /* If the next token is a `[', there is a direct-new-declarator. */
8286 }
8288 /* Parse a direct-new-declarator.
8290 direct-new-declarator:
8291 [ expression ]
8292 direct-new-declarator [constant-expression]
8294 */
8298 {
8302 {
8303 tree expression;
8306 /* Look for the opening `['. */
8311 /* The standard requires that the expression have integral
8312 type. DR 74 adds enumeration types. We believe that the
8313 real intent is that these expressions be handled like the
8314 expression in a `switch' condition, which also allows
8315 classes with a single conversion to integral or
8316 enumeration type. */
8318 {
8319 expression
8321 expression,
8324 {
8326 "expression in new-declarator must have integral "
8329 }
8330 }
8332 /* Look for the closing `]'. */
8335 /* Add this bound to the declarator. */
8338 /* If the next token is not a `[', then there are no more
8339 bounds. */
8342 }
8345 }
8347 /* Parse a new-initializer.
8349 new-initializer:
8350 ( expression-list [opt] )
8351 braced-init-list
8353 Returns a representation of the expression-list. */
8357 {
8361 {
8362 tree t;
8369 }
8370 else
8371 expression_list = (cp_parser_parenthesized_expression_list
8377 }
8379 /* Parse a delete-expression.
8381 delete-expression:
8382 :: [opt] delete cast-expression
8383 :: [opt] delete [ ] cast-expression
8385 Returns a representation of the expression. */
8387 static tree
8389 {
8392 tree expression;
8394 /* Look for the optional `::' operator. */
8395 global_scope_p
8399 /* Look for the `delete' keyword. */
8401 /* See if the array syntax is in use. */
8403 {
8404 /* Consume the `[' token. */
8406 /* Look for the `]' token. */
8408 /* Remember that this is the `[]' construct. */
8410 }
8411 else
8414 /* Parse the cast-expression. */
8417 /* A delete-expression may not appear in an integral constant
8418 expression. */
8423 tf_warning_or_error);
8424 }
8426 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8427 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8428 0 otherwise. */
8430 static int
8432 {
8435 {
8477 /* In ((type ()) () the last () isn't a valid cast-expression,
8478 so the whole must be parsed as postfix-expression. */
8483 /* '[' may start a primary-expression in obj-c++ and in C++11,
8484 as a lambda-expression, eg, '(void)[]{}'. */
8491 /* '++' and '--' may or may not start a cast-expression:
8493 struct T { void operator++(int); };
8494 void f() { (T())++; }
8496 vs
8498 int a;
8499 (int)++a; */
8504 }
8505 }
8507 /* Parse a cast-expression.
8509 cast-expression:
8510 unary-expression
8511 ( type-id ) cast-expression
8513 ADDRESS_P is true iff the unary-expression is appearing as the
8514 operand of the `&' operator. CAST_P is true if this expression is
8515 the target of a cast.
8517 Returns a representation of the expression. */
8519 static cp_expr
8522 {
8523 /* If it's a `(', then we might be looking at a cast. */
8525 {
8531 /* There's no way to know yet whether or not this is a cast.
8532 For example, `(int (3))' is a unary-expression, while `(int)
8533 3' is a cast. So, we resort to parsing tentatively. */
8535 /* Types may not be defined in a cast. */
8537 parser->type_definition_forbidden_message
8539 /* Consume the `('. */
8543 /* A very tricky bit is that `(struct S) { 3 }' is a
8544 compound-literal (which we permit in C++ as an extension).
8545 But, that construct is not a cast-expression -- it is a
8546 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8547 is legal; if the compound-literal were a cast-expression,
8548 you'd need an extra set of parentheses.) But, if we parse
8549 the type-id, and it happens to be a class-specifier, then we
8550 will commit to the parse at that point, because we cannot
8551 undo the action that is done when creating a new class. So,
8552 then we cannot back up and do a postfix-expression.
8554 Another tricky case is the following (c++/29234):
8556 struct S { void operator () (); };
8558 void foo ()
8559 {
8560 ( S()() );
8561 }
8563 As a type-id we parse the parenthesized S()() as a function
8564 returning a function, groktypename complains and we cannot
8565 back up in this case either.
8567 Therefore, we scan ahead to the closing `)', and check to see
8568 if the tokens after the `)' can start a cast-expression. Otherwise
8569 we are dealing with an unary-expression, a postfix-expression
8570 or something else.
8572 Yet another tricky case, in C++11, is the following (c++/54891):
8574 (void)[]{};
8576 The issue is that usually, besides the case of lambda-expressions,
8577 the parenthesized type-id cannot be followed by '[', and, eg, we
8578 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8579 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8580 we don't commit, we try a cast-expression, then an unary-expression.
8582 Save tokens so that we can put them back. */
8585 /* We may be looking at a cast-expression. */
8588 cast_expression
8591 /* Roll back the tokens we skipped. */
8593 /* If we aren't looking at a cast-expression, simulate an error so
8594 that the call to cp_parser_error_occurred below returns true. */
8597 else
8598 {
8601 /* Look for the type-id. */
8603 /* Look for the closing `)'. */
8606 }
8608 /* Restore the saved message. */
8611 /* At this point this can only be either a cast or a
8612 parenthesized ctor such as `(T ())' that looks like a cast to
8613 function returning T. */
8615 {
8616 /* Only commit if the cast-expression doesn't start with
8617 '++', '--', or '[' in C++11. */
8625 pidk);
8628 {
8629 /* Warn about old-style casts, if so requested. */
8636 /* Only type conversions to integral or enumeration types
8637 can be used in constant-expressions. */
8640 NIC_CAST))
8643 /* Perform the cast. */
8644 /* Make a location:
8645 (TYPE) EXPR
8646 ^~~~~~~~~~~
8647 with start==caret at the open paren, extending to the
8648 end of "expr". */
8650 open_paren_loc,
8654 }
8655 }
8656 else
8658 }
8660 /* If we get here, then it's not a cast, so it must be a
8661 unary-expression. */
8664 }
8666 /* Parse a binary expression of the general form:
8668 pm-expression:
8669 cast-expression
8670 pm-expression .* cast-expression
8671 pm-expression ->* cast-expression
8673 multiplicative-expression:
8674 pm-expression
8675 multiplicative-expression * pm-expression
8676 multiplicative-expression / pm-expression
8677 multiplicative-expression % pm-expression
8679 additive-expression:
8680 multiplicative-expression
8681 additive-expression + multiplicative-expression
8682 additive-expression - multiplicative-expression
8684 shift-expression:
8685 additive-expression
8686 shift-expression << additive-expression
8687 shift-expression >> additive-expression
8689 relational-expression:
8690 shift-expression
8691 relational-expression < shift-expression
8692 relational-expression > shift-expression
8693 relational-expression <= shift-expression
8694 relational-expression >= shift-expression
8696 GNU Extension:
8698 relational-expression:
8699 relational-expression <? shift-expression
8700 relational-expression >? shift-expression
8702 equality-expression:
8703 relational-expression
8704 equality-expression == relational-expression
8705 equality-expression != relational-expression
8707 and-expression:
8708 equality-expression
8709 and-expression & equality-expression
8711 exclusive-or-expression:
8712 and-expression
8713 exclusive-or-expression ^ and-expression
8715 inclusive-or-expression:
8716 exclusive-or-expression
8717 inclusive-or-expression | exclusive-or-expression
8719 logical-and-expression:
8720 inclusive-or-expression
8721 logical-and-expression && inclusive-or-expression
8723 logical-or-expression:
8724 logical-and-expression
8725 logical-or-expression || logical-and-expression
8727 All these are implemented with a single function like:
8729 binary-expression:
8730 simple-cast-expression
8731 binary-expression <token> binary-expression
8733 CAST_P is true if this expression is the target of a cast.
8735 The binops_by_token map is used to get the tree codes for each <token> type.
8736 binary-expressions are associated according to a precedence table. */
8738 #define TOKEN_PRECEDENCE(token) \
8739 (((token->type == CPP_GREATER \
8740 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8741 && !parser->greater_than_is_operator_p) \
8742 ? PREC_NOT_OPERATOR \
8743 : binops_by_token[token->type].prec)
8745 static cp_expr
8751 {
8752 cp_parser_expression_stack stack;
8754 cp_parser_expression_stack_entry current;
8755 cp_expr rhs;
8759 tree overload;
8761 /* Parse the first expression. */
8772 {
8773 /* Get an operator token. */
8779 {
8781 "%<>>%> operator is treated"
8785 }
8790 /* This is a fold-expression; handle it later. */
8793 /* Popping an entry off the stack means we completed a subexpression:
8794 - either we found a token which is not an operator (`>' where it is not
8795 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8796 will happen repeatedly;
8797 - or, we found an operator which has lower priority. This is the case
8798 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8799 parsing `3 * 4'. */
8801 {
8804 else
8806 }
8808 get_rhs:
8812 /* We used the operator token. */
8815 /* For "false && x" or "true || x", x will never be executed;
8816 disable warnings while evaluating it. */
8818 c_inhibit_evaluation_warnings +=
8821 c_inhibit_evaluation_warnings +=
8824 /* Extract another operand. It may be the RHS of this expression
8825 or the LHS of a new, higher priority expression. */
8830 /* Get another operator token. Look up its precedence to avoid
8831 building a useless (immediately popped) stack entry for common
8832 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8839 {
8840 /* ... and prepare to parse the RHS of the new, higher priority
8841 expression. Since precedence levels on the stack are
8842 monotonically increasing, we do not have to care about
8843 stack overflows. */
8852 pop:
8854 /* If the stack is not empty, we have parsed into LHS the right side
8855 (`4' in the example above) of an expression we had suspended.
8856 We can use the information on the stack to recover the LHS (`3')
8857 from the stack together with the tree code (`MULT_EXPR'), and
8858 the precedence of the higher level subexpression
8859 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8860 which will be used to actually build the additive expression. */
8865 }
8867 /* Undo the disabling of warnings done above. */
8869 c_inhibit_evaluation_warnings -=
8872 c_inhibit_evaluation_warnings -=
8878 /* Avoid warning for !!x == y. */
8883 /* Avoid warning for !b == y where b is boolean. */
8887 /* Avoid warning for !!b == y where b is boolean. */
8900 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8901 ERROR_MARK for everything that is not a binary expression.
8902 This makes warn_about_parentheses miss some warnings that
8903 involve unary operators. For unary expressions we should
8904 pass the correct tree_code unless the unary expression was
8905 surrounded by parentheses.
8906 */
8913 == tcc_comparison
8916 else
8917 {
8922 /* TODO: build_x_binary_op doesn't always honor the location. */
8924 }
8927 /* If the binary operator required the use of an overloaded operator,
8928 then this expression cannot be an integral constant-expression.
8929 An overloaded operator can be used even if both operands are
8930 otherwise permissible in an integral constant-expression if at
8931 least one of the operands is of enumeration type. */
8935 NIC_OVERLOADED))
8937 }
8940 }
8942 static cp_expr
8947 {
8950 }
8952 /* Parse the `? expression : assignment-expression' part of a
8953 conditional-expression. The LOGICAL_OR_EXPR is the
8954 logical-or-expression that started the conditional-expression.
8955 Returns a representation of the entire conditional-expression.
8957 This routine is used by cp_parser_assignment_expression.
8959 ? expression : assignment-expression
8961 GNU Extensions:
8963 ? : assignment-expression */
8965 static tree
8967 {
8969 cp_expr assignment_expr;
8973 /* Consume the `?' token. */
8978 {
8981 /* Implicit true clause. */
8983 c_inhibit_evaluation_warnings +=
8986 }
8987 else
8988 {
8991 /* Parse the expression. */
8992 c_inhibit_evaluation_warnings +=
8995 c_inhibit_evaluation_warnings +=
8999 }
9001 /* The next token should be a `:'. */
9003 /* Parse the assignment-expression. */
9005 c_inhibit_evaluation_warnings -=
9008 /* Make a location:
9009 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9010 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9011 with the caret at the "?", ranging from the start of
9012 the logical_or_expr to the end of the assignment_expr. */
9017 /* Build the conditional-expression. */
9019 expr,
9020 assignment_expr,
9021 tf_warning_or_error);
9022 }
9024 /* Parse an assignment-expression.
9026 assignment-expression:
9027 conditional-expression
9028 logical-or-expression assignment-operator assignment_expression
9029 throw-expression
9031 CAST_P is true if this expression is the target of a cast.
9032 DECLTYPE_P is true if this expression is the operand of decltype.
9034 Returns a representation for the expression. */
9036 static cp_expr
9039 {
9040 cp_expr expr;
9042 /* If the next token is the `throw' keyword, then we're looking at
9043 a throw-expression. */
9046 /* Otherwise, it must be that we are looking at a
9047 logical-or-expression. */
9048 else
9049 {
9050 /* Parse the binary expressions (logical-or-expression). */
9052 decltype_p,
9054 /* If the next token is a `?' then we're actually looking at a
9055 conditional-expression. */
9058 else
9059 {
9062 /* If it's an assignment-operator, we're using the second
9063 production. */
9064 enum tree_code assignment_operator
9067 {
9070 /* Parse the right-hand side of the assignment. */
9077 /* An assignment may not appear in a
9078 constant-expression. */
9080 NIC_ASSIGNMENT))
9082 /* Build the assignment expression. Its default
9083 location:
9084 LHS = RHS
9085 ~~~~^~~~~
9086 is the location of the '=' token as the
9087 caret, ranging from the start of the lhs to the
9088 end of the rhs. */
9093 assignment_operator,
9094 rhs,
9096 /* TODO: build_x_modify_expr doesn't honor the location,
9097 so we must set it here. */
9099 }
9100 }
9101 }
9104 }
9106 /* Parse an (optional) assignment-operator.
9108 assignment-operator: one of
9109 = *= /= %= += -= >>= <<= &= ^= |=
9111 GNU Extension:
9113 assignment-operator: one of
9114 <?= >?=
9116 If the next token is an assignment operator, the corresponding tree
9117 code is returned, and the token is consumed. For example, for
9118 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9119 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9120 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9121 operator, ERROR_MARK is returned. */
9123 static enum tree_code
9125 {
9129 /* Peek at the next token. */
9133 {
9179 /* Nothing else is an assignment operator. */
9181 }
9183 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9188 /* If it was an assignment operator, consume it. */
9193 }
9195 /* Parse an expression.
9197 expression:
9198 assignment-expression
9199 expression , assignment-expression
9201 CAST_P is true if this expression is the target of a cast.
9202 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9203 except possibly parenthesized or on the RHS of a comma (N3276).
9205 Returns a representation of the expression. */
9207 static cp_expr
9210 {
9215 {
9216 cp_expr assignment_expression;
9218 /* Parse the next assignment-expression. */
9219 assignment_expression
9222 /* We don't create a temporary for a call that is the immediate operand
9223 of decltype or on the RHS of a comma. But when we see a comma, we
9224 need to create a temporary for a call on the LHS. */
9229 assignment_expression
9233 /* If this is the first assignment-expression, we can just
9234 save it away. */
9237 else
9238 {
9239 /* Create a location with caret at the comma, ranging
9240 from the start of the LHS to the end of the RHS. */
9245 assignment_expression,
9248 }
9249 /* If the next token is not a comma, or we're in a fold-expression, then
9250 we are done with the expression. */
9254 /* Consume the `,'. */
9257 /* A comma operator cannot appear in a constant-expression. */
9260 }
9263 }
9265 /* Parse a constant-expression.
9267 constant-expression:
9268 conditional-expression
9270 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9271 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9272 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9273 is false, NON_CONSTANT_P should be NULL. */
9275 static cp_expr
9279 {
9283 cp_expr expression;
9285 /* It might seem that we could simply parse the
9286 conditional-expression, and then check to see if it were
9287 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9288 one that the compiler can figure out is constant, possibly after
9289 doing some simplifications or optimizations. The standard has a
9290 precise definition of constant-expression, and we must honor
9291 that, even though it is somewhat more restrictive.
9293 For example:
9295 int i[(2, 3)];
9297 is not a legal declaration, because `(2, 3)' is not a
9298 constant-expression. The `,' operator is forbidden in a
9299 constant-expression. However, GCC's constant-folding machinery
9300 will fold this operation to an INTEGER_CST for `3'. */
9302 /* Save the old settings. */
9304 saved_allow_non_integral_constant_expression_p
9307 /* We are now parsing a constant-expression. */
9309 parser->allow_non_integral_constant_expression_p
9312 /* Although the grammar says "conditional-expression", we parse an
9313 "assignment-expression", which also permits "throw-expression"
9314 and the use of assignment operators. In the case that
9315 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9316 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9317 actually essential that we look for an assignment-expression.
9318 For example, cp_parser_initializer_clauses uses this function to
9319 determine whether a particular assignment-expression is in fact
9320 constant. */
9322 /* Restore the old settings. */
9323 parser->integral_constant_expression_p
9325 parser->allow_non_integral_constant_expression_p
9328 {
9329 /* Require an rvalue constant expression here; that's what our
9330 callers expect. Reference constant expressions are handled
9331 separately in e.g. cp_parser_template_argument. */
9336 }
9339 parser->non_integral_constant_expression_p
9343 }
9345 /* Parse __builtin_offsetof.
9347 offsetof-expression:
9348 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9350 offsetof-member-designator:
9351 id-expression
9352 | offsetof-member-designator "." id-expression
9353 | offsetof-member-designator "[" expression "]"
9354 | offsetof-member-designator "->" id-expression */
9356 static cp_expr
9358 {
9360 tree type;
9361 cp_expr expr;
9362 cp_id_kind dummy;
9364 location_t finish_loc;
9366 /* We're about to accept non-integral-constant things, but will
9367 definitely yield an integral constant expression. Save and
9368 restore these values around our local parsing. */
9374 /* Consume the "__builtin_offsetof" token. */
9376 /* Consume the opening `('. */
9378 /* Parse the type-id. */
9381 /* Look for the `,'. */
9385 /* Build the (type *)null that begins the traditional offsetof macro. */
9387 tf_warning_or_error);
9389 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9393 {
9396 {
9398 /* offsetof-member-designator "[" expression "]" */
9404 /* offsetof-member-designator "->" identifier */
9407 /* FALLTHRU */
9410 /* offsetof-member-designator "." identifier */
9418 /* Consume the ")" token. */
9424 /* Error. We know the following require will fail, but
9425 that gives the proper error message. */
9430 }
9431 }
9433 success:
9434 /* Make a location of the form:
9435 __builtin_offsetof (struct s, f)
9436 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9437 with caret at the type-id, ranging from the start of the
9438 "_builtin_offsetof" token to the close paren. */
9440 /* The result will be an INTEGER_CST, so we need to explicitly
9441 preserve the location. */
9444 failure:
9449 }
9451 /* Parse a trait expression.
9453 Returns a representation of the expression, the underlying type
9454 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9456 static tree
9458 {
9459 cp_trait_kind kind;
9465 {
9553 }
9555 /* Consume the token. */
9560 {
9563 }
9569 {
9572 {
9575 }
9579 }
9581 {
9583 {
9587 {
9590 }
9594 }
9595 }
9599 /* Complete the trait expression, which may mean either processing
9600 the trait expr now or saving it for template instantiation. */
9602 {
9611 }
9612 }
9614 /* Lambdas that appear in variable initializer or default argument scope
9615 get that in their mangling, so we need to record it. We might as well
9616 use the count for function and namespace scopes as well. */
9620 {
9621 tree t;
9623 };
9626 static void
9628 {
9629 tree_int ti;
9631 /* Once we're inside a function, we ignore other scopes and just push
9632 the function again so that popping works properly. */
9639 {
9640 /* Don't reset the count if we're still in the same function. */
9643 }
9644 }
9646 static void
9648 {
9651 }
9653 static void
9655 {
9658 {
9661 }
9663 }
9665 /* Parse a lambda expression.
9667 lambda-expression:
9668 lambda-introducer lambda-declarator [opt] compound-statement
9670 Returns a representation of the expression. */
9672 static cp_expr
9674 {
9676 tree type;
9684 {
9686 {
9690 }
9692 }
9694 {
9696 {
9699 }
9701 }
9703 /* We may be in the middle of deferred access check. Disable
9704 it now. */
9715 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9718 /* Now that we've started the type, add the capture fields for any
9719 explicit captures. */
9722 {
9723 /* Inside the class, surrounding template-parameter-lists do not apply. */
9724 unsigned int saved_num_template_parameter_lists
9728 bool fully_implicit_function_template_p
9732 bool auto_is_implicit_function_template_parm_p
9743 /* By virtue of defining a local class, a lambda expression has access to
9744 the private variables of enclosing classes. */
9749 {
9755 }
9757 {
9760 }
9762 /* The capture list was built up in reverse order; fix that now. */
9774 parser->fully_implicit_function_template_p
9778 parser->auto_is_implicit_function_template_parm_p
9780 }
9782 /* This field is only used during parsing of the lambda. */
9785 /* This lambda shouldn't have any proxies left at this point. */
9787 /* And now that we're done, push proxies for an enclosing lambda. */
9792 else
9800 }
9802 /* Parse the beginning of a lambda expression.
9804 lambda-introducer:
9805 [ lambda-capture [opt] ]
9807 LAMBDA_EXPR is the current representation of the lambda expression. */
9809 static void
9811 {
9812 /* Need commas after the first capture. */
9815 /* Eat the leading `['. */
9818 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9826 {
9829 }
9832 {
9834 tree capture_id;
9835 tree capture_init_expr;
9839 enum capture_kind_type
9840 {
9841 BY_COPY,
9842 BY_REFERENCE
9843 };
9847 {
9850 }
9854 else
9857 /* Possibly capture `this'. */
9859 {
9869 explicit_init_p);
9871 }
9873 /* Remember whether we want to capture as a reference or not. */
9875 {
9878 }
9880 /* Get the identifier. */
9885 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9886 delimiters, but I modified this to stop on unnested ']' as well. It
9887 was already changed to stop on unnested '}', so the
9888 "closing_parenthesis" name is no more misleading with my change. */
9889 {
9895 }
9897 /* Find the initializer for this capture. */
9901 {
9903 /* An explicit initializer exists. */
9906 "lambda capture initializers "
9912 {
9915 }
9916 }
9917 else
9918 {
9921 /* Turn the identifier into an id-expression. */
9922 capture_init_expr
9927 {
9930 }
9934 {
9937 capture_init_expr);
9941 }
9944 {
9947 capture_init_expr))
9951 }
9953 capture_init_expr
9954 = finish_id_expression
9956 capture_init_expr,
9970 {
9973 }
9974 else
9976 }
9980 {
9985 capture_id);
9989 "capture of %qD redundant with by-reference capture "
9991 }
9994 capture_id,
9995 capture_init_expr,
9997 explicit_init_p);
9998 }
10001 }
10003 /* Parse the (optional) middle of a lambda expression.
10005 lambda-declarator:
10006 < template-parameter-list [opt] >
10007 ( parameter-declaration-clause [opt] )
10008 attribute-specifier [opt]
10009 mutable [opt]
10010 exception-specification [opt]
10011 lambda-return-type-clause [opt]
10013 LAMBDA_EXPR is the current representation of the lambda expression. */
10015 static bool
10017 {
10018 /* 5.1.1.4 of the standard says:
10019 If a lambda-expression does not include a lambda-declarator, it is as if
10020 the lambda-declarator were ().
10021 This means an empty parameter list, no attributes, and no exception
10022 specification. */
10029 /* The template-parameter-list is optional, but must begin with
10030 an opening angle if present. */
10032 {
10035 "lambda templates are only available with "
10044 /* We just processed one more parameter list. */
10046 }
10048 /* The parameter-declaration-clause is optional (unless
10049 template-parameter-list was given), but must begin with an
10050 opening parenthesis if present. */
10052 {
10057 /* Parse parameters. */
10060 /* Default arguments shall not be specified in the
10061 parameter-declaration-clause of a lambda-declarator. */
10071 /* Parse optional `mutable' keyword. */
10073 {
10076 }
10080 /* Parse optional exception specification. */
10083 /* Parse optional trailing return type. */
10085 {
10089 }
10091 /* The function parameters must be in scope all the way until after the
10092 trailing-return-type in case of decltype. */
10094 }
10098 /* Create the function call operator.
10100 Messing with declarators like this is no uglier than building up the
10101 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10102 other code. */
10103 {
10104 cp_decl_specifier_seq return_type_specs;
10106 tree fco;
10113 else
10114 /* Maybe we will deduce the return type later. */
10120 sfk_none);
10125 VIRT_SPEC_UNSPECIFIED,
10126 REF_QUAL_NONE,
10127 tx_qual,
10128 exception_spec,
10134 declarator,
10135 attributes);
10137 {
10140 /* Give the object parameter a different name. */
10144 }
10146 {
10150 }
10159 }
10160 }
10162 /* Parse the body of a lambda expression, which is simply
10164 compound-statement
10166 but which requires special handling.
10167 LAMBDA_EXPR is the current representation of the lambda expression. */
10169 static void
10171 {
10176 else
10177 /* Still increment function_depth so that we don't GC in the
10178 middle of an expression. */
10182 /* Clear this in case we're in the middle of a default argument. */
10185 /* Finish the function call operator
10186 - class_specifier
10187 + late_parsing_for_member
10188 + function_definition_after_declarator
10189 + ctor_initializer_opt_and_function_body */
10190 {
10192 tree body;
10194 tree compound_stmt;
10195 tree cap;
10197 /* Let the front end know that we are going to be defining this
10198 function. */
10200 NULL_TREE,
10209 /* Push the proxies for any explicit captures. */
10216 /* 5.1.1.4 of the standard says:
10217 If a lambda-expression does not include a trailing-return-type, it
10218 is as if the trailing-return-type denotes the following type:
10219 * if the compound-statement is of the form
10220 { return attribute-specifier [opt] expression ; }
10221 the type of the returned expression after lvalue-to-rvalue
10222 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10223 (_conv.array_ 4.2), and function-to-pointer conversion
10224 (_conv.func_ 4.3);
10225 * otherwise, void. */
10227 /* In a lambda that has neither a lambda-return-type-clause
10228 nor a deducible form, errors should be reported for return statements
10229 in the body. Since we used void as the placeholder return type, parsing
10230 the body as usual will give such desired behavior. */
10234 {
10238 /* Parse tentatively in case there's more after the initial return
10239 statement. */
10250 {
10252 {
10257 }
10259 /* Will get error here if type not deduced yet. */
10263 }
10264 }
10267 {
10272 }
10276 out:
10280 /* Finish the function and generate code for it if necessary. */
10283 /* Only expand if the call op is not a template. */
10286 }
10292 else
10294 }
10296 /* Statements [gram.stmt.stmt] */
10298 /* Parse a statement.
10300 statement:
10301 labeled-statement
10302 expression-statement
10303 compound-statement
10304 selection-statement
10305 iteration-statement
10306 jump-statement
10307 declaration-statement
10308 try-block
10310 C++11:
10312 statement:
10313 labeled-statement
10314 attribute-specifier-seq (opt) expression-statement
10315 attribute-specifier-seq (opt) compound-statement
10316 attribute-specifier-seq (opt) selection-statement
10317 attribute-specifier-seq (opt) iteration-statement
10318 attribute-specifier-seq (opt) jump-statement
10319 declaration-statement
10320 attribute-specifier-seq (opt) try-block
10322 TM Extension:
10324 statement:
10325 atomic-statement
10327 IN_COMPOUND is true when the statement is nested inside a
10328 cp_parser_compound_statement; this matters for certain pragmas.
10330 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10331 is a (possibly labeled) if statement which is not enclosed in braces
10332 and has an else clause. This is used to implement -Wparentheses.
10334 CHAIN is a vector of if-else-if conditions. */
10336 static void
10339 {
10344 restart:
10347 /* There is no statement yet. */
10353 /* In obj-c++, seeing '[[' might be the either the beginning of
10354 c++11 attributes, or a nested objc-message-expression. So
10355 let's parse the c++11 attributes tentatively. */
10359 {
10362 }
10364 /* Peek at the next token. */
10366 /* Remember the location of the first token in the statement. */
10368 /* If this is a keyword, then that will often determine what kind of
10369 statement we have. */
10371 {
10375 {
10378 /* Looks like a labeled-statement with a case label.
10379 Parse the label, and then use tail recursion to parse
10380 the statement. */
10398 {
10403 }
10404 else
10418 {
10423 }
10424 else
10425 {
10429 }
10433 /* Objective-C++ exception-handling constructs. */
10447 /* This must be a namespace alias definition. */
10463 /* It might be a keyword like `int' that can start a
10464 declaration-statement. */
10466 }
10467 }
10469 {
10470 /* If the next token is a `:', then we are looking at a
10471 labeled-statement. */
10474 {
10475 /* Looks like a labeled-statement with an ordinary label.
10476 Parse the label, and then use tail recursion to parse
10477 the statement. */
10482 }
10483 }
10484 /* Anything that starts with a `{' must be a compound-statement. */
10487 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10488 a statement all its own. */
10490 {
10491 /* Only certain OpenMP pragmas are attached to statements, and thus
10492 are considered statements themselves. All others are not. In
10493 the context of a compound, accept the pragma as a "statement" and
10494 return so that we can check for a close brace. Otherwise we
10495 require a real statement and must go back and read one. */
10501 }
10503 {
10506 }
10508 /* Everything else must be a declaration-statement or an
10509 expression-statement. Try for the declaration-statement
10510 first, unless we are looking at a `;', in which case we know that
10511 we have an expression-statement. */
10513 {
10515 {
10517 {
10518 /* Attributes should be parsed as part of the the
10519 declaration, so let's un-parse them. */
10522 }
10525 /* Try to parse the declaration-statement. */
10527 /* If that worked, we're done. */
10530 }
10531 /* Look for an expression-statement instead. */
10533 }
10535 /* Set the line number for the statement. */
10539 /* Note that for now, we don't do anything with c++11 statements
10540 parsed at this level. */
10543 OPT_Wattributes,
10545 }
10547 /* Parse the label for a labeled-statement, i.e.
10549 identifier :
10550 case constant-expression :
10551 default :
10553 GNU Extension:
10554 case constant-expression ... constant-expression : statement
10556 When a label is parsed without errors, the label is added to the
10557 parse tree by the finish_* functions, so this function doesn't
10558 have to return the label. */
10560 static void
10562 {
10567 /* The next token should be an identifier. */
10571 {
10574 }
10578 {
10580 {
10584 /* Consume the `case' token. */
10586 /* Parse the constant-expression. */
10593 {
10594 /* Consume the `...' token. */
10600 /* We don't need to emit warnings here, as the common code
10601 will do this for us. */
10602 }
10603 else
10608 else
10611 expr);
10612 }
10616 /* Consume the `default' token. */
10621 else
10626 /* Anything else must be an ordinary label. */
10629 }
10631 /* Require the `:' token. */
10634 /* An ordinary label may optionally be followed by attributes.
10635 However, this is only permitted if the attributes are then
10636 followed by a semicolon. This is because, for backward
10637 compatibility, when parsing
10638 lab: __attribute__ ((unused)) int i;
10639 we want the attribute to attach to "i", not "lab". */
10642 {
10643 tree attrs;
10650 ;
10651 else
10653 }
10659 }
10661 /* Parse an expression-statement.
10663 expression-statement:
10664 expression [opt] ;
10666 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10667 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10668 indicates whether this expression-statement is part of an
10669 expression statement. */
10671 static tree
10673 {
10677 /* If the next token is a ';', then there is no expression
10678 statement. */
10680 {
10684 {
10687 }
10688 }
10690 /* Give a helpful message for "A<T>::type t;" and the like. */
10693 {
10700 {
10701 /* A::A a; */
10706 }
10707 }
10709 /* Consume the final `;'. */
10714 /* This is the final expression statement of a statement
10715 expression. */
10721 }
10723 /* Parse a compound-statement.
10725 compound-statement:
10726 { statement-seq [opt] }
10728 GNU extension:
10730 compound-statement:
10731 { label-declaration-seq [opt] statement-seq [opt] }
10733 label-declaration-seq:
10734 label-declaration
10735 label-declaration-seq label-declaration
10737 Returns a tree representing the statement. */
10739 static tree
10742 {
10743 tree compound_stmt;
10745 /* Consume the `{'. */
10752 /* Begin the compound-statement. */
10754 /* If the next keyword is `__label__' we have a label declaration. */
10757 /* Parse an (optional) statement-seq. */
10759 /* Finish the compound-statement. */
10761 /* Consume the `}'. */
10765 }
10767 /* Parse an (optional) statement-seq.
10769 statement-seq:
10770 statement
10771 statement-seq [opt] statement */
10773 static void
10775 {
10776 /* Scan statements until there aren't any more. */
10778 {
10781 /* If we are looking at a `}', then we have run out of
10782 statements; the same is true if we have reached the end
10783 of file, or have stumbled upon a stray '@end'. */
10790 /* If we are in a compound statement and find 'else' then
10791 something went wrong. */
10793 {
10796 else
10797 {
10800 }
10801 }
10803 /* Parse the statement. */
10805 }
10806 }
10808 /* Parse a selection-statement.
10810 selection-statement:
10811 if ( condition ) statement
10812 if ( condition ) statement else statement
10813 switch ( condition ) statement
10815 Returns the new IF_STMT or SWITCH_STMT.
10817 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10818 is a (possibly labeled) if statement which is not enclosed in
10819 braces and has an else clause. This is used to implement
10820 -Wparentheses.
10822 CHAIN is a vector of if-else-if conditions. This is used to implement
10823 -Wduplicated-cond. */
10825 static tree
10828 {
10831 token_indent_info guard_tinfo;
10836 /* Peek at the next token. */
10840 /* See what kind of keyword it is. */
10843 {
10846 {
10847 tree statement;
10848 tree condition;
10850 /* Look for the `('. */
10852 {
10855 }
10857 /* Begin the selection-statement. */
10860 else
10863 /* Parse the condition. */
10865 /* Look for the `)'. */
10871 {
10875 /* Add the condition. */
10882 /* Parse the then-clause. */
10886 guard_tinfo);
10891 /* If the next token is `else', parse the else-clause. */
10893 RID_ELSE))
10894 {
10895 guard_tinfo
10897 /* Consume the `else' keyword. */
10900 {
10902 RID_IF)
10904 {
10905 /* We've got "if (COND) else if (COND2)". Start
10906 the condition chain and add COND as the first
10907 element. */
10911 {
10912 /* Wrap it in a NOP_EXPR so that we can set the
10913 location of the condition. */
10915 condition);
10918 }
10919 }
10921 RID_IF))
10922 {
10923 /* This is if-else without subsequent if. Zap the
10924 condition chain; we would have already warned at
10925 this point. */
10928 }
10929 }
10931 /* Parse the else-clause. */
10937 /* If we are currently parsing a then-clause, then
10938 IF_P will not be NULL. We set it to true to
10939 indicate that this if statement has an else clause.
10940 This may trigger the Wparentheses warning below
10941 when we get back up to the parent if statement. */
10944 }
10945 else
10946 {
10947 /* This if statement does not have an else clause. If
10948 NESTED_IF is true, then the then-clause has an if
10949 statement which does have an else clause. We warn
10950 about the potential ambiguity. */
10953 "suggest explicit braces to avoid ambiguous"
10956 {
10957 /* We don't need the condition chain anymore. */
10960 }
10961 }
10963 /* Now we're all done with the if-statement. */
10965 }
10966 else
10967 {
10971 /* Add the condition. */
10974 /* Parse the body of the switch-statement. */
10980 guard_tinfo);
10984 /* Now we're all done with the switch-statement. */
10986 }
10989 }
10995 }
10996 }
10998 /* Parse a condition.
11000 condition:
11001 expression
11002 type-specifier-seq declarator = initializer-clause
11003 type-specifier-seq declarator braced-init-list
11005 GNU Extension:
11007 condition:
11008 type-specifier-seq declarator asm-specification [opt]
11009 attributes [opt] = assignment-expression
11011 Returns the expression that should be tested. */
11013 static tree
11015 {
11016 cp_decl_specifier_seq type_specifiers;
11020 /* Try the declaration first. */
11022 /* New types are not allowed in the type-specifier-seq for a
11023 condition. */
11025 parser->type_definition_forbidden_message
11027 /* Parse the type-specifier-seq. */
11029 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11032 /* Restore the saved message. */
11034 /* If all is well, we might be looking at a declaration. */
11036 {
11037 tree decl;
11038 tree asm_specification;
11039 tree attributes;
11043 /* Parse the declarator. */
11049 /* Parse the attributes. */
11051 /* Parse the asm-specification. */
11053 /* If the next token is not an `=' or '{', then we might still be
11054 looking at an expression. For example:
11056 if (A(a).x)
11058 looks like a decl-specifier-seq and a declarator -- but then
11059 there is no `=', so this is an expression. */
11064 /* If we did see an `=' or '{', then we are looking at a declaration
11065 for sure. */
11067 {
11068 tree pushed_scope;
11072 /* Create the declaration. */
11078 /* Parse the initializer. */
11080 {
11084 }
11085 else
11086 {
11087 /* Consume the `='. */
11090 }
11094 /* Process the initializer. */
11097 asm_specification,
11098 flags);
11104 }
11105 }
11106 /* If we didn't even get past the declarator successfully, we are
11107 definitely not looking at a declaration. */
11108 else
11111 /* Otherwise, we are looking at an expression. */
11113 }
11115 /* Parses a for-statement or range-for-statement until the closing ')',
11116 not included. */
11118 static tree
11120 {
11124 /* Begin the for-statement. */
11127 /* Parse the initialization. */
11132 else
11134 }
11136 static tree
11138 {
11139 /* Normal for loop */
11142 tree stmt;
11145 /* The for-init-statement has already been parsed in
11146 cp_parser_for_init_statement, so no work is needed here. */
11149 /* If there's a condition, process it. */
11153 {
11157 }
11159 /* Look for the `;'. */
11162 /* If there's an expression, process it. */
11168 }
11170 /* Tries to parse a range-based for-statement:
11172 range-based-for:
11173 decl-specifier-seq declarator : expression
11175 The decl-specifier-seq declarator and the `:' are already parsed by
11176 cp_parser_for_init_statement. If processing_template_decl it returns a
11177 newly created RANGE_FOR_STMT; if not, it is converted to a
11178 regular FOR_STMT. */
11180 static tree
11183 {
11186 /* Get the range declaration momentarily out of the way so that
11187 the range expression doesn't clash with it. */
11192 {
11195 }
11196 else
11199 /* Put the range declaration back into scope. */
11203 /* If in template, STMT is converted to a normal for-statement
11204 at instantiation. If not, it is done just ahead. */
11206 {
11214 /* do_auto_deduction doesn't mess with template init-lists. */
11217 }
11218 else
11219 {
11222 }
11224 }
11226 /* Subroutine of cp_convert_range_for: given the initializer expression,
11227 builds up the range temporary. */
11229 static tree
11231 {
11234 /* Find out the type deduced by the declaration
11235 `auto &&__range = range_expr'. */
11240 /* Create the __range variable. */
11247 }
11249 /* Used by cp_parser_range_for in template context: we aren't going to
11250 do a full conversion yet, but we still need to resolve auto in the
11251 type of the for-range-declaration if present. This is basically
11252 a shortcut version of cp_convert_range_for. */
11254 static void
11256 {
11259 {
11262 iter_type = (cp_parser_perform_range_for_lookup
11265 {
11267 iter_type);
11269 tf_warning_or_error);
11272 }
11273 }
11274 }
11276 /* Converts a range-based for-statement into a normal
11277 for-statement, as per the definition.
11279 for (RANGE_DECL : RANGE_EXPR)
11280 BLOCK
11282 should be equivalent to:
11284 {
11285 auto &&__range = RANGE_EXPR;
11286 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11287 __begin != __end;
11288 ++__begin)
11289 {
11290 RANGE_DECL = *__begin;
11291 BLOCK
11292 }
11293 }
11295 If RANGE_EXPR is an array:
11296 BEGIN_EXPR = __range
11297 END_EXPR = __range + ARRAY_SIZE(__range)
11298 Else if RANGE_EXPR has a member 'begin' or 'end':
11299 BEGIN_EXPR = __range.begin()
11300 END_EXPR = __range.end()
11301 Else:
11302 BEGIN_EXPR = begin(__range)
11303 END_EXPR = end(__range);
11305 If __range has a member 'begin' but not 'end', or vice versa, we must
11306 still use the second alternative (it will surely fail, however).
11307 When calling begin()/end() in the third alternative we must use
11308 argument dependent lookup, but always considering 'std' as an associated
11309 namespace. */
11311 tree
11314 {
11320 /* If an error happened previously do nothing or else a lot of
11321 unhelpful errors would be issued. */
11323 else
11324 {
11325 tree range_temp;
11329 /* Can't bind a reference to an array of runtime bound. */
11331 else
11332 {
11337 LOOKUP_ONLYCONVERTING);
11339 }
11342 }
11344 /* The new for initialization statement. */
11352 LOOKUP_ONLYCONVERTING);
11363 LOOKUP_ONLYCONVERTING);
11367 /* The new for condition. */
11374 /* The new increment expression. */
11377 tf_warning_or_error);
11380 /* The declaration is initialized with *__begin inside the loop body. */
11383 tf_warning_or_error),
11385 LOOKUP_ONLYCONVERTING);
11388 }
11390 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11391 We need to solve both at the same time because the method used
11392 depends on the existence of members begin or end.
11393 Returns the type deduced for the iterator expression. */
11395 static tree
11397 {
11399 {
11402 }
11405 {
11410 }
11412 {
11413 /* If RANGE is an array, we will use pointer arithmetic. */
11416 range,
11420 }
11421 else
11422 {
11423 /* If it is not an array, we must do a bit of magic. */
11433 tf_warning_or_error);
11436 tf_warning_or_error);
11439 {
11440 /* Use the member functions. */
11443 else
11449 else
11452 }
11453 else
11454 {
11455 /* Use global functions with ADL. */
11462 tf_warning_or_error);
11464 tf_warning_or_error);
11466 tf_warning_or_error);
11468 tf_warning_or_error);
11471 }
11473 /* Last common checks. */
11475 {
11476 /* If one of the expressions is an error do no more checks. */
11479 }
11482 /* Can happen, when, eg, in a template context, Koenig lookup
11483 can't resolve begin/end (c++/58503). */
11485 else
11486 {
11488 /* The unqualified type of the __begin and __end temporaries should
11489 be the same, as required by the multiple auto declaration. */
11491 {
11498 /* P0184R0 allows __begin and __end to have different types,
11499 but make sure they are comparable so we can give a better
11501 else
11505 }
11507 }
11508 }
11509 }
11511 /* Helper function for cp_parser_perform_range_for_lookup.
11512 Builds a tree for RANGE.IDENTIFIER(). */
11514 static tree
11516 {
11529 tf_warning_or_error);
11532 }
11534 /* Parse an iteration-statement.
11536 iteration-statement:
11537 while ( condition ) statement
11538 do statement while ( expression ) ;
11539 for ( for-init-statement condition [opt] ; expression [opt] )
11540 statement
11542 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11544 static tree
11546 {
11549 tree statement;
11551 token_indent_info guard_tinfo;
11553 /* Peek at the next token. */
11560 /* Remember whether or not we are already within an iteration
11561 statement. */
11564 /* See what kind of keyword it is. */
11567 {
11569 {
11570 tree condition;
11572 /* Begin the while-statement. */
11574 /* Look for the `('. */
11576 /* Parse the condition. */
11579 /* Look for the `)'. */
11581 /* Parse the dependent statement. */
11585 /* We're done with the while-statement. */
11587 }
11591 {
11592 tree expression;
11594 /* Begin the do-statement. */
11596 /* Parse the body of the do-statement. */
11601 /* Look for the `while' keyword. */
11603 /* Look for the `('. */
11605 /* Parse the expression. */
11607 /* We're done with the do-statement. */
11609 /* Look for the `)'. */
11611 /* Look for the `;'. */
11613 }
11617 {
11618 /* Look for the `('. */
11623 /* Look for the `)'. */
11626 /* Parse the body of the for-statement. */
11631 /* We're done with the for-statement. */
11633 }
11640 }
11643 }
11645 /* Parse a for-init-statement or the declarator of a range-based-for.
11646 Returns true if a range-based-for declaration is seen.
11648 for-init-statement:
11649 expression-statement
11650 simple-declaration */
11652 static bool
11654 {
11655 /* If the next token is a `;', then we have an empty
11656 expression-statement. Grammatically, this is also a
11657 simple-declaration, but an invalid one, because it does not
11658 declare anything. Therefore, if we did not handle this case
11659 specially, we would issue an error message about an invalid
11660 declaration. */
11662 {
11666 /* A colon is used in range-based for. */
11669 /* We're going to speculatively look for a declaration, falling back
11670 to an expression, if necessary. */
11672 /* Parse the declaration. */
11675 decl);
11678 {
11679 /* It is a range-for, consume the ':' */
11683 {
11685 "range-based %<for%> loops only available with "
11688 }
11689 }
11690 else
11691 /* The ';' is not consumed yet because we told
11692 cp_parser_simple_declaration not to. */
11697 /* If the tentative parse failed, then we shall need to look for an
11698 expression-statement. */
11699 }
11700 /* If we are here, it is an expression-statement. */
11703 }
11705 /* Parse a jump-statement.
11707 jump-statement:
11708 break ;
11709 continue ;
11710 return expression [opt] ;
11711 return braced-init-list ;
11712 goto identifier ;
11714 GNU extension:
11716 jump-statement:
11717 goto * expression ;
11719 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11721 static tree
11723 {
11729 /* Peek at the next token. */
11734 /* See what kind of keyword it is. */
11737 {
11741 {
11761 }
11767 {
11774 /* Fall through. */
11784 }
11789 {
11790 tree expr;
11794 {
11798 }
11801 else
11802 /* If the next token is a `;', then there is no
11803 expression. */
11805 /* Build the return-statement. */
11807 /* Look for the final `;'. */
11809 }
11815 {
11818 }
11820 /* Create the goto-statement. */
11822 {
11823 /* Issue a warning about this use of a GNU extension. */
11825 /* Consume the '*' token. */
11827 /* Parse the dependent expression. */
11829 }
11830 else
11832 /* Look for the final `;'. */
11839 }
11842 }
11844 /* Parse a declaration-statement.
11846 declaration-statement:
11847 block-declaration */
11849 static void
11851 {
11854 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11857 /* Parse the block-declaration. */
11860 /* Free any declarators allocated. */
11862 }
11864 /* Some dependent statements (like `if (cond) statement'), are
11865 implicitly in their own scope. In other words, if the statement is
11866 a single statement (as opposed to a compound-statement), it is
11867 none-the-less treated as if it were enclosed in braces. Any
11868 declarations appearing in the dependent statement are out of scope
11869 after control passes that point. This function parses a statement,
11870 but ensures that is in its own scope, even if it is not a
11871 compound-statement.
11873 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11874 is a (possibly labeled) if statement which is not enclosed in
11875 braces and has an else clause. This is used to implement
11876 -Wparentheses.
11878 CHAIN is a vector of if-else-if conditions. This is used to implement
11879 -Wduplicated-cond.
11881 Returns the new statement. */
11883 static tree
11887 {
11888 tree statement;
11890 token_indent_info body_tinfo
11896 /* Mark if () ; with a special NOP_EXPR. */
11898 {
11909 }
11910 /* if a compound is opened, we simply parse the statement directly. */
11913 /* If the token is not a `{', then we must take special action. */
11914 else
11915 {
11916 /* Create a compound-statement. */
11918 /* Parse the dependent-statement. */
11920 /* Finish the dummy compound-statement. */
11922 }
11924 token_indent_info next_tinfo
11928 /* Return the statement. */
11930 }
11932 /* For some dependent statements (like `while (cond) statement'), we
11933 have already created a scope. Therefore, even if the dependent
11934 statement is a compound-statement, we do not want to create another
11935 scope. */
11937 static void
11940 {
11941 /* If the token is a `{', then we must take special action. */
11943 {
11944 token_indent_info body_tinfo
11948 token_indent_info next_tinfo
11951 }
11952 else
11953 {
11954 /* Avoid calling cp_parser_compound_statement, so that we
11955 don't create a new scope. Do everything else by hand. */
11957 /* If the next keyword is `__label__' we have a label declaration. */
11960 /* Parse an (optional) statement-seq. */
11963 }
11964 }
11966 /* Declarations [gram.dcl.dcl] */
11968 /* Parse an optional declaration-sequence.
11970 declaration-seq:
11971 declaration
11972 declaration-seq declaration */
11974 static void
11976 {
11978 {
11989 {
11990 /* A declaration consisting of a single semicolon is
11991 invalid. Allow it unless we're being pedantic. */
11996 }
11998 /* If we're entering or exiting a region that's implicitly
11999 extern "C", modify the lang context appropriately. */
12001 {
12004 }
12006 {
12009 }
12012 {
12013 /* A top-level declaration can consist solely of a #pragma.
12014 A nested declaration cannot, so this is done here and not
12015 in cp_parser_declaration. (A #pragma at block scope is
12016 handled in cp_parser_statement.) */
12019 }
12021 /* Parse the declaration itself. */
12023 }
12024 }
12026 /* Parse a declaration.
12028 declaration:
12029 block-declaration
12030 function-definition
12031 template-declaration
12032 explicit-instantiation
12033 explicit-specialization
12034 linkage-specification
12035 namespace-definition
12037 GNU extension:
12039 declaration:
12040 __extension__ declaration */
12042 static void
12044 {
12045 cp_token token1;
12046 cp_token token2;
12051 /* Check for the `__extension__' keyword. */
12053 {
12054 /* Parse the qualified declaration. */
12056 /* Restore the PEDANTIC flag. */
12060 }
12062 /* Try to figure out what kind of declaration is present. */
12067 else
12068 {
12071 }
12073 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12076 /* If the next token is `extern' and the following token is a string
12077 literal, then we have a linkage specification. */
12081 /* If the next token is `template', then we have either a template
12082 declaration, an explicit instantiation, or an explicit
12083 specialization. */
12085 {
12086 /* `template <>' indicates a template specialization. */
12090 /* `template <' indicates a template declaration. */
12093 /* Anything else must be an explicit instantiation. */
12094 else
12096 }
12097 /* If the next token is `export', then we have a template
12098 declaration. */
12101 /* If the next token is `extern', 'static' or 'inline' and the one
12102 after that is `template', we have a GNU extended explicit
12103 instantiation directive. */
12110 /* If the next token is `namespace', check for a named or unnamed
12111 namespace definition. */
12120 /* An unnamed namespace definition. */
12124 /* An inline (associated) namespace definition. */
12128 /* Objective-C++ declaration/definition. */
12135 /* At this point we may have a template declared by a concept
12136 introduction. */
12141 else
12142 /* Try to parse a block-declaration, or a function-definition. */
12145 /* Free any declarators allocated. */
12147 }
12149 /* Parse a block-declaration.
12151 block-declaration:
12152 simple-declaration
12153 asm-definition
12154 namespace-alias-definition
12155 using-declaration
12156 using-directive
12158 GNU Extension:
12160 block-declaration:
12161 __extension__ block-declaration
12163 C++0x Extension:
12165 block-declaration:
12166 static_assert-declaration
12168 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12169 part of a declaration-statement. */
12171 static void
12174 {
12178 /* Check for the `__extension__' keyword. */
12180 {
12181 /* Parse the qualified declaration. */
12183 /* Restore the PEDANTIC flag. */
12187 }
12189 /* Peek at the next token to figure out which kind of declaration is
12190 present. */
12193 /* If the next keyword is `asm', we have an asm-definition. */
12195 {
12199 }
12200 /* If the next keyword is `namespace', we have a
12201 namespace-alias-definition. */
12204 /* If the next keyword is `using', we have a
12205 using-declaration, a using-directive, or an alias-declaration. */
12207 {
12212 /* If the token after `using' is `namespace', then we have a
12213 using-directive. */
12217 /* If the second token after 'using' is '=', then we have an
12218 alias-declaration. */
12224 /* Otherwise, it's a using-declaration. */
12225 else
12228 }
12229 /* If the next keyword is `__label__' we have a misplaced label
12230 declaration. */
12232 {
12236 /* If the next token is now a `;', consume it. */
12239 }
12240 /* If the next token is `static_assert' we have a static assertion. */
12243 /* Anything else must be a simple-declaration. */
12244 else
12247 }
12249 /* Parse a simple-declaration.
12251 simple-declaration:
12252 decl-specifier-seq [opt] init-declarator-list [opt] ;
12254 init-declarator-list:
12255 init-declarator
12256 init-declarator-list , init-declarator
12258 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12259 function-definition as a simple-declaration.
12261 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12262 parsed declaration if it is an uninitialized single declarator not followed
12263 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12264 if present, will not be consumed. */
12266 static void
12270 {
12271 cp_decl_specifier_seq decl_specifiers;
12280 /* Defer access checks until we know what is being declared; the
12281 checks for names appearing in the decl-specifier-seq should be
12282 done as if we were in the scope of the thing being declared. */
12285 /* Parse the decl-specifier-seq. We have to keep track of whether
12286 or not the decl-specifier-seq declares a named class or
12287 enumeration type, since that is the only case in which the
12288 init-declarator-list is allowed to be empty.
12290 [dcl.dcl]
12292 In a simple-declaration, the optional init-declarator-list can be
12293 omitted only when declaring a class or enumeration, that is when
12294 the decl-specifier-seq contains either a class-specifier, an
12295 elaborated-type-specifier, or an enum-specifier. */
12297 CP_PARSER_FLAGS_OPTIONAL,
12300 /* We no longer need to defer access checks. */
12303 /* In a block scope, a valid declaration must always have a
12304 decl-specifier-seq. By not trying to parse declarators, we can
12305 resolve the declaration/expression ambiguity more quickly. */
12308 {
12311 }
12313 /* If the next two tokens are both identifiers, the code is
12314 erroneous. The usual cause of this situation is code like:
12316 T t;
12318 where "T" should name a type -- but does not. */
12321 {
12322 /* If parsing tentatively, we should commit; we really are
12323 looking at a declaration. */
12325 /* Give up. */
12327 }
12329 /* If we have seen at least one decl-specifier, and the next token
12330 is not a parenthesis, then we must be looking at a declaration.
12331 (After "int (" we might be looking at a functional cast.) */
12338 tree last_type;
12342 /* Keep going until we hit the `;' at the end of the simple
12343 declaration. */
12346 CPP_SEMICOLON))
12347 {
12350 tree decl;
12354 {
12355 /* If we are processing next declarator, comma is expected */
12360 {
12364 }
12365 }
12366 else
12369 /* Parse the init-declarator. */
12372 function_definition_allowed_p,
12374 declares_class_or_enum,
12376 maybe_range_for_decl,
12379 /* If an error occurred while parsing tentatively, exit quickly.
12380 (That usually happens when in the body of a function; each
12381 statement is treated as a declaration-statement until proven
12382 otherwise.) */
12387 {
12390 {
12391 /* If the list of declarators contains more than one declarator,
12392 the type of each declared variable is determined as described
12393 above. If the type deduced for the template parameter U is not
12394 the same in each deduction, the program is ill-formed. */
12399 }
12400 else
12402 }
12404 /* Handle function definitions specially. */
12406 {
12407 /* If the next token is a `,', then we are probably
12408 processing something like:
12410 void f() {}, *p;
12412 which is erroneous. */
12414 {
12417 "mixing"
12419 }
12420 /* Otherwise, we're done with the list of declarators. */
12421 else
12422 {
12425 }
12426 }
12429 /* The next token should be either a `,' or a `;'. */
12431 /* If it's a `,', there are more declarators to come. */
12434 /* If it's a `;', we are done. */
12437 /* Anything else is an error. */
12438 else
12439 {
12440 /* If we have already issued an error message we don't need
12441 to issue another one. */
12446 /* Skip tokens until we reach the end of the statement. */
12448 /* If the next token is now a `;', consume it. */
12452 }
12453 /* After the first time around, a function-definition is not
12454 allowed -- even if it was OK at first. For example:
12456 int i, f() {}
12458 is not valid. */
12460 }
12462 /* Issue an error message if no declarators are present, and the
12463 decl-specifier-seq does not itself declare a class or
12464 enumeration: [dcl.dcl]/3. */
12466 {
12468 {
12472 /* Ensure an error is issued anyway when finish_decltype_type,
12473 called via cp_parser_decl_specifier_seq, returns a class or
12474 an enumeration (c++/51786). */
12477 }
12478 /* Perform any deferred access checks. */
12480 }
12482 /* Consume the `;'. */
12486 {
12492 }
12494 done:
12496 }
12498 /* Parse a decl-specifier-seq.
12500 decl-specifier-seq:
12501 decl-specifier-seq [opt] decl-specifier
12502 decl-specifier attribute-specifier-seq [opt] (C++11)
12504 decl-specifier:
12505 storage-class-specifier
12506 type-specifier
12507 function-specifier
12508 friend
12509 typedef
12511 GNU Extension:
12513 decl-specifier:
12514 attributes
12516 Concepts Extension:
12518 decl-specifier:
12519 concept
12521 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12523 The parser flags FLAGS is used to control type-specifier parsing.
12525 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12526 flags:
12528 1: one of the decl-specifiers is an elaborated-type-specifier
12529 (i.e., a type declaration)
12530 2: one of the decl-specifiers is an enum-specifier or a
12531 class-specifier (i.e., a type definition)
12533 */
12535 static void
12537 cp_parser_flags flags,
12540 {
12544 cp_decl_spec ds;
12546 /* Clear DECL_SPECS. */
12549 /* Assume no class or enumeration type is declared. */
12552 /* Keep reading specifiers until there are no more to read. */
12554 {
12559 /* Peek at the next token. */
12562 /* Save the first token of the decl spec list for error
12563 reporting. */
12566 /* Handle attributes. */
12568 {
12569 /* Parse the attributes. */
12572 /* In a sequence of declaration specifiers, c++11 attributes
12573 appertain to the type that precede them. In that case
12574 [dcl.spec]/1 says:
12576 The attribute-specifier-seq affects the type only for
12577 the declaration it appears in, not other declarations
12578 involving the same type.
12580 But for now let's force the user to position the
12581 attribute either at the beginning of the declaration or
12582 after the declarator-id, which would clearly mean that it
12583 applies to the declarator. */
12585 {
12587 /* The c++11 attribute is at the beginning of the
12588 declaration. It appertains to the entity being
12590 else
12591 {
12593 {
12594 /* This is an attribute following a
12595 class-specifier. */
12600 }
12601 else
12602 {
12603 decl_specs->std_attributes
12605 attrs);
12608 }
12610 }
12611 }
12613 decl_specs->attributes
12615 attrs);
12619 }
12620 /* Assume we will find a decl-specifier keyword. */
12622 /* If the next token is an appropriate keyword, we can simply
12623 add it to the list. */
12625 {
12626 /* decl-specifier:
12627 friend
12628 constexpr */
12631 {
12634 }
12635 else
12636 {
12638 /* Consume the token. */
12640 }
12653 /* function-specifier:
12654 inline
12655 virtual
12656 explicit */
12663 /* decl-specifier:
12664 typedef */
12667 /* Consume the token. */
12669 /* A constructor declarator cannot appear in a typedef. */
12671 /* The "typedef" keyword can only occur in a declaration; we
12672 may as well commit at this point. */
12679 /* storage-class-specifier:
12680 auto
12681 register
12682 static
12683 extern
12684 mutable
12686 GNU Extension:
12687 thread */
12690 {
12691 /* Consume the token. */
12694 /* Complain about `auto' as a storage specifier, if
12695 we're complaining about C++0x compatibility. */
12699 /* Set the storage class anyway. */
12701 token);
12702 }
12703 else
12704 /* C++0x auto type-specifier. */
12712 /* Consume the token. */
12715 token);
12718 /* Consume the token. */
12724 /* We did not yet find a decl-specifier yet. */
12727 }
12737 /* Constructors are a special case. The `S' in `S()' is not a
12738 decl-specifier; it is the beginning of the declarator. */
12739 constructor_p
12740 = (!found_decl_spec
12741 && constructor_possible_p
12742 && (cp_parser_constructor_declarator_p
12745 /* If we don't have a DECL_SPEC yet, then we must be looking at
12746 a type-specifier. */
12748 {
12751 tree type_spec;
12753 type_spec
12755 decl_specs,
12761 /* If this type-specifier referenced a user-defined type
12762 (a typedef, class-name, etc.), then we can't allow any
12763 more such type-specifiers henceforth.
12765 [dcl.spec]
12767 The longest sequence of decl-specifiers that could
12768 possibly be a type name is taken as the
12769 decl-specifier-seq of a declaration. The sequence shall
12770 be self-consistent as described below.
12772 [dcl.type]
12774 As a general rule, at most one type-specifier is allowed
12775 in the complete decl-specifier-seq of a declaration. The
12776 only exceptions are the following:
12778 -- const or volatile can be combined with any other
12779 type-specifier.
12781 -- signed or unsigned can be combined with char, long,
12782 short, or int.
12784 -- ..
12786 Example:
12788 typedef char* Pc;
12789 void g (const int Pc);
12791 Here, Pc is *not* part of the decl-specifier seq; it's
12792 the declarator. Therefore, once we see a type-specifier
12793 (other than a cv-qualifier), we forbid any additional
12794 user-defined types. We *do* still allow things like `int
12795 int' to be considered a decl-specifier-seq, and issue the
12796 error message later. */
12799 /* A constructor declarator cannot follow a type-specifier. */
12801 {
12806 }
12807 }
12809 /* If we still do not have a DECL_SPEC, then there are no more
12810 decl-specifiers. */
12815 /* After we see one decl-specifier, further decl-specifiers are
12816 always optional. */
12818 }
12820 /* Don't allow a friend specifier with a class definition. */
12825 }
12827 /* Parse an (optional) storage-class-specifier.
12829 storage-class-specifier:
12830 auto
12831 register
12832 static
12833 extern
12834 mutable
12836 GNU Extension:
12838 storage-class-specifier:
12839 thread
12841 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12843 static tree
12845 {
12847 {
12851 /* Fall through for C++98. */
12858 /* Consume the token. */
12863 }
12864 }
12866 /* Parse an (optional) function-specifier.
12868 function-specifier:
12869 inline
12870 virtual
12871 explicit
12873 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12874 Updates DECL_SPECS, if it is non-NULL. */
12876 static tree
12879 {
12882 {
12888 /* 14.5.2.3 [temp.mem]
12890 A member function template shall not be virtual. */
12893 else
12903 }
12905 /* Consume the token. */
12907 }
12909 /* Parse a linkage-specification.
12911 linkage-specification:
12912 extern string-literal { declaration-seq [opt] }
12913 extern string-literal declaration */
12915 static void
12917 {
12918 tree linkage;
12920 /* Look for the `extern' keyword. */
12923 /* Look for the string-literal. */
12926 /* Transform the literal into an identifier. If the literal is a
12927 wide-character string, or contains embedded NULs, then we can't
12928 handle it as the user wants. */
12931 {
12933 /* Assume C++ linkage. */
12935 }
12936 else
12939 /* We're now using the new linkage. */
12942 /* If the next token is a `{', then we're using the first
12943 production. */
12945 {
12949 /* Consume the `{' token. */
12951 /* Parse the declarations. */
12953 /* Look for the closing `}'. */
12955 }
12956 /* Otherwise, there's just one declaration. */
12957 else
12958 {
12961 saved_in_unbraced_linkage_specification_p
12965 parser->in_unbraced_linkage_specification_p
12967 }
12969 /* We're done with the linkage-specification. */
12971 }
12973 /* Parse a static_assert-declaration.
12975 static_assert-declaration:
12976 static_assert ( constant-expression , string-literal ) ;
12977 static_assert ( constant-expression ) ; (C++1Z)
12979 If MEMBER_P, this static_assert is a class member. */
12981 static void
12983 {
12984 tree condition;
12985 tree message;
12987 location_t saved_loc;
12990 /* Peek at the `static_assert' token so we can keep track of exactly
12991 where the static assertion started. */
12995 /* Look for the `static_assert' keyword. */
12997 RT_STATIC_ASSERT))
13000 /* We know we are in a static assertion; commit to any tentative
13001 parse. */
13005 /* Parse the `(' starting the static assertion condition. */
13008 /* Parse the constant-expression. Allow a non-constant expression
13009 here in order to give better diagnostics in finish_static_assert. */
13010 condition =
13016 {
13019 "static_assert without a message "
13021 /* Eat the ')' */
13026 }
13027 else
13028 {
13029 /* Parse the separating `,'. */
13032 /* Parse the string-literal message. */
13037 /* A `)' completes the static assertion. */
13043 }
13045 /* A semicolon terminates the declaration. */
13048 /* Complete the static assertion, which may mean either processing
13049 the static assert now or saving it for template instantiation. */
13051 }
13053 /* Parse the expression in decltype ( expression ). */
13055 static tree
13058 {
13060 tree expr;
13062 /* Since we're going to preserve any side-effects from this parse, set up a
13063 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13064 in the expression. */
13067 /* First, try parsing an id-expression. */
13078 {
13081 cp_id_kind idk;
13085 /* Lookup the name we got back from the id-expression. */
13095 {
13096 /* Complete lookup of the id-expression. */
13097 expr = (finish_id_expression
13110 /* We found an id-expression, but it was something that we
13111 should not have found. This is an error, not something
13112 we can recover from, so note that we found an
13113 id-expression and we'll recover as gracefully as
13114 possible. */
13116 }
13121 /* We have an id-expression. */
13123 }
13126 {
13127 /* Abort the id-expression parse. */
13130 /* Parsing tentatively, again. */
13133 /* Parse a class member access. */
13141 /* We have an id-expression. */
13143 }
13146 /* We have parsed the complete id-expression or member access. */
13148 else
13149 {
13150 /* Abort our attempt to parse an id-expression or member access
13151 expression. */
13154 /* Parse a full expression. */
13157 }
13160 }
13162 /* Parse a `decltype' type. Returns the type.
13164 simple-type-specifier:
13165 decltype ( expression )
13166 C++14 proposal:
13167 decltype ( auto ) */
13169 static tree
13171 {
13172 tree expr;
13181 {
13182 /* Already parsed. */
13185 }
13187 /* Look for the `decltype' token. */
13191 /* Parse the opening `('. */
13195 /* decltype (auto) */
13198 {
13205 }
13207 /* Types cannot be defined in a `decltype' expression. Save away the
13208 old message. */
13211 /* And create the new one. */
13212 parser->type_definition_forbidden_message
13215 /* The restrictions on constant-expressions do not apply inside
13216 decltype expressions. */
13217 saved_integral_constant_expression_p
13219 saved_non_integral_constant_expression_p
13223 /* Within a parenthesized expression, a `>' token is always
13224 the greater-than operator. */
13225 saved_greater_than_is_operator_p
13229 /* Do not actually evaluate the expression. */
13232 /* Do not warn about problems with the expression. */
13237 /* Go back to evaluating expressions. */
13241 /* The `>' token might be the end of a template-id or
13242 template-parameter-list now. */
13243 parser->greater_than_is_operator_p
13246 /* Restore the old message and the integral constant expression
13247 flags. */
13249 parser->integral_constant_expression_p
13251 parser->non_integral_constant_expression_p
13254 /* Parse to the closing `)'. */
13256 {
13260 }
13263 tf_warning_or_error);
13265 rewrite:
13266 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13267 it again. */
13276 }
13278 /* Special member functions [gram.special] */
13280 /* Parse a conversion-function-id.
13282 conversion-function-id:
13283 operator conversion-type-id
13285 Returns an IDENTIFIER_NODE representing the operator. */
13287 static tree
13289 {
13290 tree type;
13291 tree saved_scope;
13292 tree saved_qualifying_scope;
13293 tree saved_object_scope;
13296 /* Look for the `operator' token. */
13299 /* When we parse the conversion-type-id, the current scope will be
13300 reset. However, we need that information in able to look up the
13301 conversion function later, so we save it here. */
13305 /* We must enter the scope of the class so that the names of
13306 entities declared within the class are available in the
13307 conversion-type-id. For example, consider:
13309 struct S {
13310 typedef int I;
13311 operator I();
13312 };
13314 S::operator I() { ... }
13316 In order to see that `I' is a type-name in the definition, we
13317 must be in the scope of `S'. */
13320 /* Parse the conversion-type-id. */
13322 /* Leave the scope of the class, if any. */
13325 /* Restore the saved scope. */
13329 /* If the TYPE is invalid, indicate failure. */
13333 }
13335 /* Parse a conversion-type-id:
13337 conversion-type-id:
13338 type-specifier-seq conversion-declarator [opt]
13340 Returns the TYPE specified. */
13342 static tree
13344 {
13345 tree attributes;
13346 cp_decl_specifier_seq type_specifiers;
13348 tree type_specified;
13351 /* Parse the attributes. */
13355 parser->type_definition_forbidden_message
13358 /* Parse the type-specifiers. */
13365 /* If that didn't work, stop. */
13368 /* Parse the conversion-declarator. */
13376 /* Don't give this error when parsing tentatively. This happens to
13377 work because we always parse this definitively once. */
13380 {
13382 {
13385 }
13389 }
13392 }
13394 /* Parse an (optional) conversion-declarator.
13396 conversion-declarator:
13397 ptr-operator conversion-declarator [opt]
13399 */
13403 {
13406 cp_cv_quals cv_quals;
13408 /* We don't know if there's a ptr-operator next, or not. */
13410 /* Try the ptr-operator. */
13413 /* If it worked, look for more conversion-declarators. */
13415 {
13418 /* Parse another optional declarator. */
13421 declarator = cp_parser_make_indirect_declarator
13425 }
13428 }
13430 /* Parse an (optional) ctor-initializer.
13432 ctor-initializer:
13433 : mem-initializer-list
13435 Returns TRUE iff the ctor-initializer was actually present. */
13437 static bool
13439 {
13440 /* If the next token is not a `:', then there is no
13441 ctor-initializer. */
13443 {
13444 /* Do default initialization of any bases and members. */
13449 }
13451 /* Consume the `:' token. */
13453 /* And the mem-initializer-list. */
13457 }
13459 /* Parse a mem-initializer-list.
13461 mem-initializer-list:
13462 mem-initializer ... [opt]
13463 mem-initializer ... [opt] , mem-initializer-list */
13465 static void
13467 {
13472 /* Let the semantic analysis code know that we are starting the
13473 mem-initializer-list. */
13478 /* Loop through the list. */
13480 {
13481 tree mem_initializer;
13484 /* Parse the mem-initializer. */
13486 /* If the next token is a `...', we're expanding member initializers. */
13488 {
13489 /* Consume the `...'. */
13492 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13493 can be expanded but members cannot. */
13496 {
13501 }
13503 /* Construct the pack expansion type. */
13506 }
13509 {
13513 }
13514 /* Look for a target constructor. */
13518 {
13521 {
13525 }
13527 }
13528 /* Add it to the list, unless it was erroneous. */
13530 {
13533 }
13534 /* If the next token is not a `,', we're done. */
13537 /* Consume the `,' token. */
13539 }
13541 /* Perform semantic analysis. */
13544 }
13546 /* Parse a mem-initializer.
13548 mem-initializer:
13549 mem-initializer-id ( expression-list [opt] )
13550 mem-initializer-id braced-init-list
13552 GNU extension:
13554 mem-initializer:
13555 ( expression-list [opt] )
13557 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13558 class) or FIELD_DECL (for a non-static data member) to initialize;
13559 the TREE_VALUE is the expression-list. An empty initialization
13560 list is represented by void_list_node. */
13562 static tree
13564 {
13565 tree mem_initializer_id;
13566 tree expression_list;
13567 tree member;
13570 /* Find out what is being initialized. */
13572 {
13576 }
13577 else
13578 {
13582 }
13588 {
13595 }
13596 else
13597 {
13607 }
13617 }
13619 /* Parse a mem-initializer-id.
13621 mem-initializer-id:
13622 :: [opt] nested-name-specifier [opt] class-name
13623 decltype-specifier (C++11)
13624 identifier
13626 Returns a TYPE indicating the class to be initialized for the first
13627 production (and the second in C++11). Returns an IDENTIFIER_NODE
13628 indicating the data member to be initialized for the last production. */
13630 static tree
13632 {
13636 tree id;
13640 /* `typename' is not allowed in this context ([temp.res]). */
13642 {
13644 "keyword %<typename%> not allowed in this context (a qualified "
13647 }
13648 /* Look for the optional `::' operator. */
13649 global_scope_p
13653 /* Look for the optional nested-name-specifier. The simplest way to
13654 implement:
13656 [temp.res]
13658 The keyword `typename' is not permitted in a base-specifier or
13659 mem-initializer; in these contexts a qualified name that
13660 depends on a template-parameter is implicitly assumed to be a
13661 type name.
13663 is to assume that we have seen the `typename' keyword at this
13664 point. */
13665 nested_name_specifier_p
13674 /* If there is a `::' operator or a nested-name-specifier, then we
13675 are definitely looking for a class-name. */
13680 typename_type,
13684 /* Otherwise, we could also be looking for an ordinary identifier. */
13687 /* Try a decltype-specifier. */
13689 else
13690 /* Otherwise, try a class-name. */
13694 none_type,
13698 /* If we found one, we're done. */
13701 /* Otherwise, look for an ordinary identifier. */
13703 }
13705 /* Overloading [gram.over] */
13707 /* Parse an operator-function-id.
13709 operator-function-id:
13710 operator operator
13712 Returns an IDENTIFIER_NODE for the operator which is a
13713 human-readable spelling of the identifier, e.g., `operator +'. */
13715 static cp_expr
13717 {
13718 /* Look for the `operator' keyword. */
13721 /* And then the name of the operator itself. */
13723 }
13725 /* Return an identifier node for a user-defined literal operator.
13726 The suffix identifier is chained to the operator name identifier. */
13728 static tree
13730 {
13731 tree identifier;
13738 }
13740 /* Parse an operator.
13742 operator:
13743 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13744 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13745 || ++ -- , ->* -> () []
13747 GNU Extensions:
13749 operator:
13750 <? >? <?= >?=
13752 Returns an IDENTIFIER_NODE for the operator which is a
13753 human-readable spelling of the identifier, e.g., `operator +'. */
13755 static cp_expr
13757 {
13762 /* Peek at the next token. */
13767 /* Figure out which operator we have. */
13769 {
13771 {
13774 /* The keyword should be either `new' or `delete'. */
13779 else
13782 /* Consume the `new' or `delete' token. */
13785 /* Peek at the next token. */
13787 /* If it's a `[' token then this is the array variant of the
13788 operator. */
13790 {
13791 /* Consume the `[' token. */
13793 /* Look for the `]' token. */
13799 }
13800 /* Otherwise, we have the non-array variant. */
13801 else
13807 }
13954 /* Consume the `('. */
13956 /* Look for the matching `)'. */
13961 /* Consume the `['. */
13963 /* Look for the matching `]'. */
13978 {
13985 /* Consume the string. */
13991 {
13994 }
13995 else
13996 {
13998 /* Look for the suffix identifier. */
14003 {
14007 }
14008 else
14009 {
14012 }
14013 }
14018 {
14021 }
14024 {
14027 }
14029 {
14032 }
14034 }
14037 /* Anything else is an error. */
14039 }
14041 /* If we have selected an identifier, we need to consume the
14042 operator token. */
14045 /* Otherwise, no valid operator name was present. */
14046 else
14047 {
14050 }
14053 }
14055 /* Parse a template-declaration.
14057 template-declaration:
14058 export [opt] template < template-parameter-list > declaration
14060 If MEMBER_P is TRUE, this template-declaration occurs within a
14061 class-specifier.
14063 The grammar rule given by the standard isn't correct. What
14064 is really meant is:
14066 template-declaration:
14067 export [opt] template-parameter-list-seq
14068 decl-specifier-seq [opt] init-declarator [opt] ;
14069 export [opt] template-parameter-list-seq
14070 function-definition
14072 template-parameter-list-seq:
14073 template-parameter-list-seq [opt]
14074 template < template-parameter-list >
14076 Concept Extensions:
14078 template-parameter-list-seq:
14079 template < template-parameter-list > requires-clause [opt]
14081 requires-clause:
14082 requires logical-or-expression */
14084 static void
14086 {
14087 /* Check for `export'. */
14089 {
14090 /* Consume the `export' token. */
14092 /* Warn that we do not support `export'. */
14094 }
14097 }
14099 /* Parse a template-parameter-list.
14101 template-parameter-list:
14102 template-parameter
14103 template-parameter-list , template-parameter
14105 Returns a TREE_LIST. Each node represents a template parameter.
14106 The nodes are connected via their TREE_CHAINs. */
14108 static tree
14110 {
14115 /* The loop below parses the template parms. We first need to know
14116 the total number of template parms to be able to compute proper
14117 canonical types of each dependent type. So after the loop, when
14118 we know the total number of template parms,
14119 end_template_parm_list computes the proper canonical types and
14120 fixes up the dependent types accordingly. */
14122 {
14123 tree parameter;
14126 location_t parm_loc;
14128 /* Parse the template-parameter. */
14133 /* Add it to the list. */
14136 parm_loc,
14137 parameter,
14138 is_non_type,
14139 is_parameter_pack);
14140 else
14141 {
14144 }
14146 /* If the next token is not a `,', we're done. */
14149 /* Otherwise, consume the `,' token. */
14151 }
14154 }
14156 /* Parse a introduction-list.
14158 introduction-list:
14159 introduced-parameter
14160 introduction-list , introduced-parameter
14162 introduced-parameter:
14163 ...[opt] identifier
14165 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14166 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14167 WILDCARD_DECL will also have DECL_NAME set and token location in
14168 DECL_SOURCE_LOCATION. */
14170 static tree
14172 {
14176 {
14181 /* Build placeholder. */
14189 /* If the next token is not a `,', we're done. */
14192 /* Otherwise, consume the `,' token. */
14194 }
14196 /* Convert the vec into a TREE_VEC. */
14199 tree parm;
14205 }
14207 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14208 is an abstract declarator. */
14212 {
14217 }
14219 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14220 is an abstract declarator. */
14224 {
14228 else
14230 }
14232 /* Returns true if DECL represents a constrained-parameter. */
14236 {
14241 }
14243 /* Returns true if PARM declares a constrained-parameter. */
14247 {
14249 }
14251 /* Check that the type parameter is only a declarator-id, and that its
14252 type is not cv-qualified. */
14254 bool
14257 {
14262 {
14265 }
14267 /* Don't allow cv-qualified type parameters. */
14270 {
14273 }
14276 }
14278 /* Finish parsing/processing a template type parameter and checking
14279 various restrictions. */
14283 tree id,
14285 {
14288 else
14290 }
14292 static tree
14294 {
14295 /* FIXME: This should probably be copied, and we may need to adjust
14296 the template parameter depths. */
14306 }
14308 /* Finish parsing/processing a template template parameter by borrowing
14309 the template parameter list from the prototype parameter. */
14311 static tree
14313 tree proto,
14314 tree id,
14316 {
14320 }
14322 /* Create a new non-type template parameter from the given PARM
14323 declarator. */
14325 static tree
14328 {
14334 }
14336 /* Build a constrained template parameter based on the PARMDECL
14337 declarator. The type of PARMDECL is the constrained type, which
14338 refers to the prototype template parameter that ultimately
14339 specifies the type of the declared parameter. */
14341 static tree
14346 {
14352 /* A template parameter constrained by a variadic concept shall also
14353 be declared as a template parameter pack. */
14358 /* Build the parameter. Return an error if the declarator was invalid. */
14359 tree parm;
14364 parmdecl);
14365 else
14370 /* Finish the parameter decl and create a node attaching the
14371 default argument and constraint. */
14376 }
14378 /* Returns true if the parsed type actually represents the declaration
14379 of a type template-parameter. */
14383 {
14386 }
14389 /* Returns true if the parsed type actually represents the declaration of
14390 a template template-parameter. */
14392 static bool
14394 {
14397 }
14399 /* Parse a default argument for a type template-parameter.
14400 Note that diagnostics are handled in cp_parser_template_parameter. */
14402 static tree
14404 {
14407 /* Consume the `=' token. */
14412 /* Parse the default-argument. */
14418 {
14422 }
14425 }
14427 /* Parse a default argument for a template template-parameter. */
14429 static tree
14431 {
14436 /* Consume the `='. */
14438 /* Parse the id-expression. */
14440 /* save token before parsing the id-expression, for error
14441 reporting */
14443 tree default_argument
14451 /* If the id-expression was a template-id that refers to
14452 a template-class, we already have the declaration here,
14453 so no further lookup is needed. */
14454 ;
14455 else
14456 /* Look up the name. */
14457 default_argument
14459 none_type,
14465 /* See if the default argument is valid. */
14469 }
14471 /* Parse a template-parameter.
14473 template-parameter:
14474 type-parameter
14475 parameter-declaration
14477 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14478 the parameter. The TREE_PURPOSE is the default value, if any.
14479 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14480 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14481 set to true iff this parameter is a parameter pack. */
14483 static tree
14486 {
14489 tree parm;
14491 /* Assume it is a type parameter or a template parameter. */
14493 /* Assume it not a parameter pack. */
14495 /* Peek at the next token. */
14497 /* If it is `class' or `template', we have a type-parameter. */
14500 /* If it is `class' or `typename' we do not know yet whether it is a
14501 type parameter or a non-type parameter. Consider:
14503 template <typename T, typename T::X X> ...
14505 or:
14507 template <class C, class D*> ...
14509 Here, the first parameter is a type parameter, and the second is
14510 a non-type parameter. We can tell by looking at the token after
14511 the identifier -- if it is a `,', `=', or `>' then we have a type
14512 parameter. */
14514 {
14515 /* Peek at the token after `class' or `typename'. */
14517 /* If it's an ellipsis, we have a template type parameter
14518 pack. */
14521 /* If it's an identifier, skip it. */
14524 /* Now, see if the token looks like the end of a template
14525 parameter. */
14530 }
14532 /* Otherwise, it is a non-type parameter or a constrained parameter.
14534 [temp.param]
14536 When parsing a default template-argument for a non-type
14537 template-parameter, the first non-nested `>' is taken as the end
14538 of the template parameter-list rather than a greater-than
14539 operator. */
14540 parameter_declarator
14547 /* If the parameter declaration is marked as a parameter pack, set
14548 *IS_PARAMETER_PACK to notify the caller. */
14553 {
14554 /* Can happen in some cases of erroneous input (c++/34892). */
14556 /* Consume the `...' for better error recovery. */
14558 }
14560 // The parameter may have been constrained.
14563 parameter_declarator,
14564 is_non_type,
14565 is_parameter_pack);
14567 // Now we're sure that the parameter is a non-type parameter.
14578 }
14580 /* Parse a type-parameter.
14582 type-parameter:
14583 class identifier [opt]
14584 class identifier [opt] = type-id
14585 typename identifier [opt]
14586 typename identifier [opt] = type-id
14587 template < template-parameter-list > class identifier [opt]
14588 template < template-parameter-list > class identifier [opt]
14589 = id-expression
14591 GNU Extension (variadic templates):
14593 type-parameter:
14594 class ... identifier [opt]
14595 typename ... identifier [opt]
14597 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14598 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14599 the declaration of the parameter.
14601 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14603 static tree
14605 {
14607 tree parameter;
14609 /* Look for a keyword to tell us what kind of parameter this is. */
14615 {
14618 {
14619 tree identifier;
14620 tree default_argument;
14622 /* If the next token is an ellipsis, we have a template
14623 argument pack. */
14625 {
14626 /* Consume the `...' token. */
14631 }
14633 /* If the next token is an identifier, then it names the
14634 parameter. */
14637 else
14640 /* Create the parameter. */
14643 /* If the next token is an `=', we have a default argument. */
14645 {
14646 default_argument
14649 /* Template parameter packs cannot have default
14650 arguments. */
14652 {
14655 "template parameter pack %qD cannot have a "
14657 else
14659 "template parameter packs cannot have "
14662 }
14665 }
14666 else
14669 /* Create the combined representation of the parameter and the
14670 default argument. */
14672 }
14676 {
14677 tree identifier;
14678 tree default_argument;
14680 /* Look for the `<'. */
14682 /* Parse the template-parameter-list. */
14684 /* Look for the `>'. */
14687 // If template requirements are present, parse them.
14693 /* Look for the `class' or 'typename' keywords. */
14695 /* If the next token is an ellipsis, we have a template
14696 argument pack. */
14698 {
14699 /* Consume the `...' token. */
14704 }
14705 /* If the next token is an `=', then there is a
14706 default-argument. If the next token is a `>', we are at
14707 the end of the parameter-list. If the next token is a `,',
14708 then we are at the end of this parameter. */
14712 {
14714 /* Treat invalid names as if the parameter were nameless. */
14717 }
14718 else
14721 /* Create the template parameter. */
14723 identifier);
14725 /* If the next token is an `=', then there is a
14726 default-argument. */
14728 {
14729 default_argument
14732 /* Template parameter packs cannot have default
14733 arguments. */
14735 {
14738 "template parameter pack %qD cannot "
14740 identifier);
14741 else
14745 }
14746 }
14747 else
14750 /* Create the combined representation of the parameter and the
14751 default argument. */
14753 }
14759 }
14762 }
14764 /* Parse a template-id.
14766 template-id:
14767 template-name < template-argument-list [opt] >
14769 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14770 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14771 returned. Otherwise, if the template-name names a function, or set
14772 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14773 names a class, returns a TYPE_DECL for the specialization.
14775 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14776 uninstantiated templates. */
14778 static tree
14784 {
14785 tree templ;
14786 tree arguments;
14787 tree template_id;
14792 /* If the next token corresponds to a template-id, there is no need
14793 to reparse it. */
14796 {
14799 }
14801 /* Avoid performing name lookup if there is no possibility of
14802 finding a template-id. */
14805 && !cp_parser_nth_token_starts_template_argument_list_p
14807 {
14810 }
14812 /* Remember where the template-id starts. */
14818 /* Parse the template-name. */
14821 check_dependency_p,
14822 is_declaration,
14823 tag_type,
14826 {
14829 }
14831 /* Since we're going to preserve any side-effects from this parse, set up a
14832 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14833 in the template arguments. */
14836 /* If we find the sequence `[:' after a template-name, it's probably
14837 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14838 parse correctly the argument list. */
14845 {
14847 /* Change `:' into `::'. */
14849 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14850 CPP_LESS. */
14853 /* Parse the arguments. */
14856 {
14857 /* If we couldn't parse an argument list, then we revert our changes
14858 and return simply an error. Maybe this is not a template-id
14859 after all. */
14864 }
14865 /* Otherwise, emit an error about the invalid digraph, but continue
14866 parsing because we got our argument list. */
14869 {
14872 "%<<:%> is an alternate spelling for %<[%>."
14875 {
14877 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14880 }
14881 }
14882 }
14883 else
14884 {
14885 /* Look for the `<' that starts the template-argument-list. */
14887 {
14890 }
14891 /* Parse the arguments. */
14893 }
14895 /* Build a representation of the specialization. */
14898 TEMPLATE_ID_EXPR,
14902 {
14904 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14905 template (rather than some instantiation thereof) only if
14906 is not nested within some other construct. For example, in
14907 "template <typename T> void f(T) { A<T>::", A<T> is just an
14908 instantiation of A. */
14911 CPP_SCOPE));
14912 template_id
14914 }
14915 /* A template-like identifier may be a partial concept id. */
14921 {
14925 }
14926 else
14927 {
14928 /* If it's not a class-template or a template-template, it should be
14929 a function-template. */
14937 }
14939 /* If parsing tentatively, replace the sequence of tokens that makes
14940 up the template-id with a CPP_TEMPLATE_ID token. That way,
14941 should we re-parse the token stream, we will not have to repeat
14942 the effort required to do the parse, nor will we issue duplicate
14943 error messages about problems during instantiation of the
14944 template. */
14946 /* Don't do this if we had a parse error in a declarator; re-parsing
14947 might succeed if a name changes meaning (60361). */
14951 {
14954 /* Reset the contents of the START_OF_ID token. */
14957 /* Update the location to be of the form:
14958 template-name < template-argument-list [opt] >
14959 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14960 with caret == start at the start of the template-name,
14961 ranging until the closing '>'. */
14962 location_t finish_loc
14964 location_t combined_loc
14968 /* Retrieve any deferred checks. Do not pop this access checks yet
14969 so the memory will not be reclaimed during token replacing below. */
14975 /* Purge all subsequent tokens. */
14978 /* ??? Can we actually assume that, if template_id ==
14979 error_mark_node, we will have issued a diagnostic to the
14980 user, as opposed to simply marking the tentative parse as
14981 failed? */
14984 }
14988 }
14990 /* Parse a template-name.
14992 template-name:
14993 identifier
14995 The standard should actually say:
14997 template-name:
14998 identifier
14999 operator-function-id
15001 A defect report has been filed about this issue.
15003 A conversion-function-id cannot be a template name because they cannot
15004 be part of a template-id. In fact, looking at this code:
15006 a.operator K<int>()
15008 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15009 It is impossible to call a templated conversion-function-id with an
15010 explicit argument list, since the only allowed template parameter is
15011 the type to which it is converting.
15013 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15014 `template' keyword, in a construction like:
15016 T::template f<3>()
15018 In that case `f' is taken to be a template-name, even though there
15019 is no way of knowing for sure.
15021 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15022 name refers to a set of overloaded functions, at least one of which
15023 is a template, or an IDENTIFIER_NODE with the name of the template,
15024 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15025 names are looked up inside uninstantiated templates. */
15027 static tree
15034 {
15035 tree identifier;
15036 tree decl;
15037 tree fns;
15040 /* If the next token is `operator', then we have either an
15041 operator-function-id or a conversion-function-id. */
15043 {
15044 /* We don't know whether we're looking at an
15045 operator-function-id or a conversion-function-id. */
15047 /* Try an operator-function-id. */
15049 /* If that didn't work, try a conversion-function-id. */
15051 {
15054 }
15055 }
15056 /* Look for the identifier. */
15057 else
15060 /* If we didn't find an identifier, we don't have a template-id. */
15064 /* If the name immediately followed the `template' keyword, then it
15065 is a template-name. However, if the next token is not `<', then
15066 we do not treat it as a template-name, since it is not being used
15067 as part of a template-id. This enables us to handle constructs
15068 like:
15070 template <typename T> struct S { S(); };
15071 template <typename T> S<T>::S();
15073 correctly. We would treat `S' as a template -- if it were `S<T>'
15074 -- but we do not if there is no `<'. */
15078 {
15079 /* In a declaration, in a dependent context, we pretend that the
15080 "template" keyword was present in order to improve error
15081 recovery. For example, given:
15083 template <typename T> void f(T::X<int>);
15085 we want to treat "X<int>" as a template-id. */
15087 && !template_keyword_p
15089 && check_dependency_p
15091 /* Do not do this for dtors (or ctors), since they never
15092 need the template keyword before their name. */
15094 {
15097 /* Explain what went wrong. */
15099 identifier);
15102 /* If parsing tentatively, find the location of the "<" token. */
15105 /* Parse the template arguments so that we can issue error
15106 messages about them. */
15109 /* Skip tokens until we find a good place from which to
15110 continue parsing. */
15115 /* If parsing tentatively, permanently remove the
15116 template argument list. That will prevent duplicate
15117 error messages from being issued about the missing
15118 "template" keyword. */
15124 }
15126 /* If the "template" keyword is present, then there is generally
15127 no point in doing name-lookup, so we just return IDENTIFIER.
15128 But, if the qualifying scope is non-dependent then we can
15129 (and must) do name-lookup normally. */
15135 }
15137 /* Look up the name. */
15139 tag_type,
15142 check_dependency_p,
15148 /* If DECL is a template, then the name was a template-name. */
15150 {
15154 }
15155 else
15156 {
15159 /* The standard does not explicitly indicate whether a name that
15160 names a set of overloaded declarations, some of which are
15161 templates, is a template-name. However, such a name should
15162 be a template-name; otherwise, there is no way to form a
15163 template-id for the overloaded templates. */
15171 {
15172 /* The name does not name a template. */
15175 }
15176 }
15178 /* If DECL is dependent, and refers to a function, then just return
15179 its name; we will look it up again during template instantiation. */
15181 {
15185 }
15188 }
15190 /* Parse a template-argument-list.
15192 template-argument-list:
15193 template-argument ... [opt]
15194 template-argument-list , template-argument ... [opt]
15196 Returns a TREE_VEC containing the arguments. */
15198 static tree
15200 {
15205 tree vec;
15212 /* Even if the template-id appears in an integral
15213 constant-expression, the contents of the argument list do
15214 not. */
15220 /* Parse the arguments. */
15221 do
15222 {
15223 tree argument;
15226 /* Consume the comma. */
15229 /* Parse the template-argument. */
15232 /* If the next token is an ellipsis, we're expanding a template
15233 argument pack. */
15235 {
15237 {
15241 }
15242 /* Consume the `...' token. */
15245 /* Make the argument into a TYPE_PACK_EXPANSION or
15246 EXPR_PACK_EXPANSION. */
15248 }
15251 {
15255 {
15258 }
15259 else
15261 }
15263 }
15279 }
15281 /* Parse a template-argument.
15283 template-argument:
15284 assignment-expression
15285 type-id
15286 id-expression
15288 The representation is that of an assignment-expression, type-id, or
15289 id-expression -- except that the qualified id-expression is
15290 evaluated, so that the value returned is either a DECL or an
15291 OVERLOAD.
15293 Although the standard says "assignment-expression", it forbids
15294 throw-expressions or assignments in the template argument.
15295 Therefore, we use "conditional-expression" instead. */
15297 static tree
15299 {
15300 tree argument;
15306 cp_id_kind idk;
15308 /* There's really no way to know what we're looking at, so we just
15309 try each alternative in order.
15311 [temp.arg]
15313 In a template-argument, an ambiguity between a type-id and an
15314 expression is resolved to a type-id, regardless of the form of
15315 the corresponding template-parameter.
15317 Therefore, we try a type-id first. */
15320 /* If there was no error parsing the type-id but the next token is a
15321 '>>', our behavior depends on which dialect of C++ we're
15322 parsing. In C++98, we probably found a typo for '> >'. But there
15323 are type-id which are also valid expressions. For instance:
15325 struct X { int operator >> (int); };
15326 template <int V> struct Foo {};
15327 Foo<X () >> 5> r;
15329 Here 'X()' is a valid type-id of a function type, but the user just
15330 wanted to write the expression "X() >> 5". Thus, we remember that we
15331 found a valid type-id, but we still try to parse the argument as an
15332 expression to see what happens.
15334 In C++0x, the '>>' will be considered two separate '>'
15335 tokens. */
15339 {
15342 }
15343 else
15344 {
15345 /* If the next token isn't a `,' or a `>', then this argument wasn't
15346 really finished. This means that the argument is not a valid
15347 type-id. */
15350 /* If that worked, we're done. */
15353 }
15354 /* We're still not sure what the argument will be. */
15356 /* Try a template. */
15364 /* If the next token isn't a `,' or a `>', then this argument wasn't
15365 really finished. */
15369 {
15370 /* Figure out what is being referred to. If the id-expression
15371 was for a class template specialization, then we will have a
15372 TYPE_DECL at this point. There is no need to do name lookup
15373 at this point in that case. */
15376 none_type,
15382 /* Handle a constrained-type-specifier for a non-type template
15383 parameter. */
15389 }
15391 {
15395 }
15396 /* It must be a non-type argument. In C++17 any constant-expression is
15397 allowed. */
15401 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15403 -- an integral constant-expression of integral or enumeration
15404 type; or
15406 -- the name of a non-type template-parameter; or
15408 -- the name of an object or function with external linkage...
15410 -- the address of an object or function with external linkage...
15412 -- a pointer to member... */
15413 /* Look for a non-type template parameter. */
15415 {
15427 }
15429 /* If the next token is "&", the argument must be the address of an
15430 object or function with external linkage. */
15433 {
15436 }
15437 /* See if we might have an id-expression. */
15444 {
15447 address_p,
15454 else
15455 {
15456 tree probe;
15459 {
15460 /* Strip the dereference temporarily. */
15463 }
15465 /* If we're in a template, we represent a qualified-id referring
15466 to a static data member as a SCOPE_REF even if the scope isn't
15467 dependent so that we can check access control later. */
15472 {
15473 /* A variable without external linkage might still be a
15474 valid constant-expression, so no error is issued here
15475 if the external-linkage check fails. */
15478 }
15480 /* All overloaded functions are allowed; if the external
15481 linkage test does not pass, an error will be issued
15482 later. */
15483 ;
15487 /* A pointer-to-member. */
15488 ;
15490 ;
15491 else
15495 {
15498 tf_warning_or_error);
15499 else
15502 }
15503 }
15504 }
15505 /* If the argument started with "&", there are no other valid
15506 alternatives at this point. */
15508 {
15511 }
15513 general_expr:
15514 /* If the argument wasn't successfully parsed as a type-id followed
15515 by '>>', the argument can only be a constant expression now.
15516 Otherwise, we try parsing the constant-expression tentatively,
15517 because the argument could really be a type-id. */
15523 else
15524 {
15525 /* With C++17 generalized non-type template arguments we need to handle
15526 lvalue constant expressions, too. */
15529 }
15537 /* We did our best to parse the argument as a non type-id, but that
15538 was the only alternative that matched (albeit with a '>' after
15539 it). We can assume it's just a typo from the user, and a
15540 diagnostic will then be issued. */
15542 }
15544 /* Parse an explicit-instantiation.
15546 explicit-instantiation:
15547 template declaration
15549 Although the standard says `declaration', what it really means is:
15551 explicit-instantiation:
15552 template decl-specifier-seq [opt] declarator [opt] ;
15554 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15555 supposed to be allowed. A defect report has been filed about this
15556 issue.
15558 GNU Extension:
15560 explicit-instantiation:
15561 storage-class-specifier template
15562 decl-specifier-seq [opt] declarator [opt] ;
15563 function-specifier template
15564 decl-specifier-seq [opt] declarator [opt] ; */
15566 static void
15568 {
15570 cp_decl_specifier_seq decl_specifiers;
15575 /* Look for an (optional) storage-class-specifier or
15576 function-specifier. */
15578 {
15579 extension_specifier
15582 extension_specifier
15585 }
15587 /* Look for the `template' keyword. */
15589 /* Let the front end know that we are processing an explicit
15590 instantiation. */
15592 /* [temp.explicit] says that we are supposed to ignore access
15593 control while processing explicit instantiation directives. */
15595 /* Parse a decl-specifier-seq. */
15597 CP_PARSER_FLAGS_OPTIONAL,
15600 /* If there was exactly one decl-specifier, and it declared a class,
15601 and there's no declarator, then we have an explicit type
15602 instantiation. */
15604 {
15605 tree type;
15609 /* Turn access control back on for names used during
15610 template instantiation. */
15615 }
15616 else
15617 {
15619 tree decl;
15621 /* Parse the declarator. */
15622 declarator
15633 {
15636 "explicit instantiation shall not use"
15640 "explicit instantiation shall not use"
15645 /* Turn access control back on for names used during
15646 template instantiation. */
15648 /* Do the explicit instantiation. */
15650 }
15651 else
15652 {
15654 /* Skip the body of the explicit instantiation. */
15656 }
15657 }
15658 /* We're done with the instantiation. */
15664 }
15666 /* Parse an explicit-specialization.
15668 explicit-specialization:
15669 template < > declaration
15671 Although the standard says `declaration', what it really means is:
15673 explicit-specialization:
15674 template <> decl-specifier [opt] init-declarator [opt] ;
15675 template <> function-definition
15676 template <> explicit-specialization
15677 template <> template-declaration */
15679 static void
15681 {
15685 /* Look for the `template' keyword. */
15687 /* Look for the `<'. */
15689 /* Look for the `>'. */
15691 /* We have processed another parameter list. */
15693 /* [temp]
15695 A template ... explicit specialization ... shall not have C
15696 linkage. */
15698 {
15700 /* Give it C++ linkage to avoid confusing other parts of the
15701 front end. */
15704 }
15705 else
15707 /* Let the front end know that we are beginning a specialization. */
15709 {
15712 }
15714 /* If the next keyword is `template', we need to figure out whether
15715 or not we're looking a template-declaration. */
15717 {
15722 else
15724 }
15725 else
15726 /* Parse the dependent declaration. */
15732 /* We're done with the specialization. */
15734 /* For the erroneous case of a template with C linkage, we pushed an
15735 implicit C++ linkage scope; exit that scope now. */
15738 /* We're done with this parameter list. */
15740 }
15742 /* Parse a type-specifier.
15744 type-specifier:
15745 simple-type-specifier
15746 class-specifier
15747 enum-specifier
15748 elaborated-type-specifier
15749 cv-qualifier
15751 GNU Extension:
15753 type-specifier:
15754 __complex__
15756 Returns a representation of the type-specifier. For a
15757 class-specifier, enum-specifier, or elaborated-type-specifier, a
15758 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15760 The parser flags FLAGS is used to control type-specifier parsing.
15762 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15763 in a decl-specifier-seq.
15765 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15766 class-specifier, enum-specifier, or elaborated-type-specifier, then
15767 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15768 if a type is declared; 2 if it is defined. Otherwise, it is set to
15769 zero.
15771 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15772 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15773 is set to FALSE. */
15775 static tree
15777 cp_parser_flags flags,
15782 {
15788 /* Assume this type-specifier does not declare a new type. */
15791 /* And that it does not specify a cv-qualifier. */
15794 /* Peek at the next token. */
15797 /* If we're looking at a keyword, we can use that to guide the
15798 production we choose. */
15801 {
15806 /* Look for the enum-specifier. */
15808 /* If that worked, we're done. */
15810 {
15815 type_spec,
15816 token,
15819 }
15820 else
15823 /* Any of these indicate either a class-specifier, or an
15824 elaborated-type-specifier. */
15831 /* Parse tentatively so that we can back up if we don't find a
15832 class-specifier. */
15834 /* Look for the class-specifier. */
15837 /* If that worked, we're done. */
15839 {
15844 type_spec,
15845 token,
15848 }
15850 /* Fall through. */
15851 elaborated_type_specifier:
15852 /* We're declaring (not defining) a class or enum. */
15856 /* Fall through. */
15858 /* Look for an elaborated-type-specifier. */
15859 type_spec
15860 = (cp_parser_elaborated_type_specifier
15863 is_declaration));
15866 type_spec,
15867 token,
15890 /* The `__complex__' keyword is a GNU extension. */
15896 }
15898 /* Handle simple keywords. */
15900 {
15902 {
15905 }
15907 }
15909 /* If we do not already have a type-specifier, assume we are looking
15910 at a simple-type-specifier. */
15912 decl_specs,
15913 flags);
15915 /* If we didn't find a type-specifier, and a type-specifier was not
15916 optional in this context, issue an error message. */
15918 {
15921 }
15924 }
15926 /* Parse a simple-type-specifier.
15928 simple-type-specifier:
15929 :: [opt] nested-name-specifier [opt] type-name
15930 :: [opt] nested-name-specifier template template-id
15931 char
15932 wchar_t
15933 bool
15934 short
15935 int
15936 long
15937 signed
15938 unsigned
15939 float
15940 double
15941 void
15943 C++0x Extension:
15945 simple-type-specifier:
15946 auto
15947 decltype ( expression )
15948 char16_t
15949 char32_t
15950 __underlying_type ( type-id )
15952 GNU Extension:
15954 simple-type-specifier:
15955 __int128
15956 __typeof__ unary-expression
15957 __typeof__ ( type-id )
15958 __typeof__ ( type-id ) { initializer-list , [opt] }
15960 Concepts Extension:
15962 simple-type-specifier:
15963 constrained-type-specifier
15965 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15966 appropriately updated. */
15968 static tree
15971 cp_parser_flags flags)
15972 {
15977 /* Peek at the next token. */
15980 /* If we're looking at a keyword, things are easy. */
15982 {
16017 {
16020 }
16049 {
16050 /* The 'auto' might be the placeholder return type for a function decl
16051 with trailing return type. */
16060 {
16062 {
16069 }
16072 {
16075 }
16078 }
16082 {
16085 }
16088 {
16091 }
16092 else
16096 {
16099 "use of %<auto%> in lambda parameter declaration "
16100 "only available with "
16102 }
16105 "use of %<auto%> in parameter declaration "
16106 "only available with "
16110 "ISO C++ forbids use of %<auto%> in parameter "
16112 }
16113 else
16118 /* Since DR 743, decltype can either be a simple-type-specifier by
16119 itself or begin a nested-name-specifier. Parsing it will replace
16120 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16121 handling below decide what to do. */
16127 /* Consume the `typeof' token. */
16129 /* Parse the operand to `typeof'. */
16131 /* If it is not already a TYPE, take its type. */
16137 token,
16146 token,
16156 token,
16161 }
16163 /* If token is an already-parsed decltype not followed by ::,
16164 it's a simple-type-specifier. */
16167 {
16170 {
16172 token,
16174 /* Remember that we are handling a decltype in order to
16175 implement the resolution of DR 1510 when the argument
16176 isn't instantiation dependent. */
16178 }
16181 }
16183 /* If the type-specifier was for a built-in type, we're done. */
16185 {
16186 /* Record the type. */
16193 type,
16194 token,
16199 /* Consume the token. */
16205 /* There is no valid C++ program where a non-template type is
16206 followed by a "<". That usually indicates that the user thought
16207 that the type was a template. */
16212 }
16214 /* The type-specifier must be a user-defined type. */
16216 {
16220 /* Don't gobble tokens or issue error messages if this is an
16221 optional type-specifier. */
16225 /* Look for the optional `::' operator. */
16226 global_p
16230 /* Look for the nested-name specifier. */
16231 qualified_p
16239 /* If we have seen a nested-name-specifier, and the next token
16240 is `template', then we are using the template-id production. */
16243 {
16244 /* Look for the template-id. */
16248 none_type,
16250 /* If the template-id did not name a type, we are out of
16251 luck. */
16253 {
16256 }
16257 }
16258 /* Otherwise, look for a type-name. */
16259 else
16261 /* Keep track of all name-lookups performed in class scopes. */
16263 && !global_p
16264 && !qualified_p
16268 /* If it didn't work out, we don't have a TYPE. */
16274 token,
16276 }
16278 /* If we didn't get a type-name, issue an error message. */
16280 {
16283 }
16286 {
16287 /* See if TYPE is an Objective-C type, and if so, parse and
16288 accept any protocol references following it. Do this before
16289 the cp_parser_check_for_invalid_template_id() call, because
16290 Objective-C types can be followed by '<...>' which would
16291 enclose protocol names rather than template arguments, and so
16292 everything is fine. */
16295 {
16299 /* Clobber the "unqualified" type previously entered into
16300 DECL_SPECS with the new, improved protocol-qualified version. */
16305 }
16307 /* There is no valid C++ program where a non-template type is
16308 followed by a "<". That usually indicates that the user
16309 thought that the type was a template. */
16311 none_type,
16313 }
16316 }
16318 /* Parse a type-name.
16320 type-name:
16321 class-name
16322 enum-name
16323 typedef-name
16324 simple-template-id [in c++0x]
16326 enum-name:
16327 identifier
16329 typedef-name:
16330 identifier
16332 Concepts:
16334 type-name:
16335 concept-name
16336 partial-concept-id
16338 concept-name:
16339 identifier
16341 Returns a TYPE_DECL for the type. */
16343 static tree
16345 {
16347 }
16349 /* See above. */
16350 static tree
16352 {
16353 tree type_decl;
16355 /* We can't know yet whether it is a class-name or not. */
16357 /* Try a class-name. */
16359 typename_keyword_p,
16361 none_type,
16365 /* If it's not a class-name, keep looking. */
16367 {
16369 /* It must be a typedef-name or an enum-name. */
16373 /* It is either a simple-template-id representing an
16374 instantiation of an alias template... */
16378 none_type,
16380 /* Note that this must be an instantiation of an alias template
16381 because [temp.names]/6 says:
16383 A template-id that names an alias template specialization
16384 is a type-name.
16386 Whereas [temp.names]/7 says:
16388 A simple-template-id that names a class template
16389 specialization is a class-name.
16391 With concepts, this could also be a partial-concept-id that
16392 declares a non-type template parameter. */
16399 else
16403 /* ... Or a typedef-name or an enum-name. */
16405 }
16408 }
16410 /* Check if DECL and ARGS can form a constrained-type-specifier.
16411 If ARGS is non-null, we try to form a concept check of the
16412 form DECL<?, ARGS> where ? is a wildcard that matches any
16413 kind of template argument. If ARGS is NULL, then we try to
16414 form a concept check of the form DECL<?>. */
16416 static tree
16419 {
16422 /* If we a constrained-type-specifier cannot be deduced. */
16426 /* A constrained type specifier can only be found in an
16427 overload set or as a reference to a template declaration.
16429 FIXME: This might be masking a bug. It's possible that
16430 that the deduction below is causing template specializations
16431 to be formed with the wildcard as an argument. */
16435 /* Try to build a call expression that evaluates the
16436 concept. This can fail if the overload set refers
16437 only to non-templates. */
16443 /* Deduce the checked constraint and the prototype parameter.
16445 FIXME: In certain cases, failure to deduce should be a
16446 diagnosable error. */
16447 tree conc;
16448 tree proto;
16452 /* In template parameter scope, this results in a constrained
16453 parameter. Return a descriptor of that parm. */
16457 /* In a parameter-declaration-clause, constrained-type
16458 specifiers result in invented template parameters. */
16460 {
16463 }
16464 else
16465 {
16466 /* Otherwise, we're in a context where the constrained
16467 type name is deduced and the constraint applies
16468 after deduction. */
16470 }
16473 }
16475 /* If DECL refers to a concept, return a TYPE_DECL representing
16476 the result of using the constrained type specifier in the
16477 current context. DECL refers to a concept if
16479 - it is an overload set containing a function concept taking a single
16480 type argument, or
16482 - it is a variable concept taking a single type argument. */
16484 static tree
16486 {
16492 else
16494 }
16496 /* Check if DECL and ARGS form a partial-concept-id. If so,
16497 assign ID to the resulting constrained placeholder.
16499 Returns true if the partial-concept-id designates a placeholder
16500 and false otherwise. Note that *id is set to NULL_TREE in
16501 this case. */
16503 static tree
16505 {
16507 }
16509 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16510 or a concept-name.
16512 enum-name:
16513 identifier
16515 typedef-name:
16516 identifier
16518 concept-name:
16519 identifier
16521 Returns a TYPE_DECL for the type. */
16523 static tree
16525 {
16526 tree type_decl;
16527 tree identifier;
16534 /* Look up the type-name. */
16539 /* If we found an overload set, then it may refer to a concept-name. */
16545 {
16546 /* See if this is an Objective-C type. */
16551 }
16553 /* Issue an error if we did not find a type-name. */
16555 /* In Objective-C, we have the complication that class names are
16556 normally type names and start declarations (eg, the
16557 "NSObject" in "NSObject *object;"), but can be used in an
16558 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16559 is an expression. So, a classname followed by a dot is not a
16560 valid type-name. */
16563 {
16568 }
16569 /* Remember that the name was used in the definition of the
16570 current class so that we can check later to see if the
16571 meaning would have been different after the class was
16572 entirely defined. */
16578 }
16580 /* Parse an elaborated-type-specifier. Note that the grammar given
16581 here incorporates the resolution to DR68.
16583 elaborated-type-specifier:
16584 class-key :: [opt] nested-name-specifier [opt] identifier
16585 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16586 enum-key :: [opt] nested-name-specifier [opt] identifier
16587 typename :: [opt] nested-name-specifier identifier
16588 typename :: [opt] nested-name-specifier template [opt]
16589 template-id
16591 GNU extension:
16593 elaborated-type-specifier:
16594 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16595 class-key attributes :: [opt] nested-name-specifier [opt]
16596 template [opt] template-id
16597 enum attributes :: [opt] nested-name-specifier [opt] identifier
16599 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16600 declared `friend'. If IS_DECLARATION is TRUE, then this
16601 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16602 something is being declared.
16604 Returns the TYPE specified. */
16606 static tree
16610 {
16612 tree identifier;
16615 tree globalscope;
16618 /* See if we're looking at the `enum' keyword. */
16620 {
16621 /* Consume the `enum' token. */
16623 /* Remember that it's an enumeration type. */
16625 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16626 enums) is used here. */
16629 {
16633 /* Consume the `struct' or `class' and parse it anyway. */
16635 }
16636 /* Parse the attributes. */
16638 }
16639 /* Or, it might be `typename'. */
16641 RID_TYPENAME))
16642 {
16643 /* Consume the `typename' token. */
16645 /* Remember that it's a `typename' type. */
16647 }
16648 /* Otherwise it must be a class-key. */
16649 else
16650 {
16654 /* Parse the attributes. */
16656 }
16658 /* Look for the `::' operator. */
16661 /* Look for the nested-name-specifier. */
16663 {
16668 is_declaration))
16670 }
16671 else
16672 /* Even though `typename' is not present, the proposed resolution
16673 to Core Issue 180 says that in `class A<T>::B', `B' should be
16674 considered a type-name, even if `A<T>' is dependent. */
16679 is_declaration);
16680 /* For everything but enumeration types, consider a template-id.
16681 For an enumeration type, consider only a plain identifier. */
16683 {
16685 tree decl;
16687 /* Allow the `template' keyword. */
16689 /* If we didn't see `template', we don't know if there's a
16690 template-id or not. */
16693 /* Parse the template-id. */
16697 tag_type,
16698 is_declaration);
16699 /* If we didn't find a template-id, look for an ordinary
16700 identifier. */
16702 ;
16703 /* We can get here when cp_parser_template_id, called by
16704 cp_parser_class_name with tag_type == none_type, succeeds
16705 and caches a BASELINK. Then, when called again here,
16706 instead of failing and returning an error_mark_node
16707 returns it (see template/typename17.C in C++11).
16708 ??? Could we diagnose this earlier? */
16710 {
16713 }
16714 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16715 in effect, then we must assume that, upon instantiation, the
16716 template will correspond to a class. */
16720 typename_type,
16722 /* If the `typename' keyword is in effect and DECL is not a type
16723 decl, then type is non existent. */
16725 ;
16731 }
16734 {
16739 {
16742 }
16744 /* For a `typename', we needn't call xref_tag. */
16750 /* Template parameter lists apply only if we are not within a
16751 function parameter list. */
16752 bool template_parm_lists_apply
16761 /* Look up a qualified name in the usual way. */
16763 {
16764 tree decl;
16765 tree ambiguous_decls;
16768 tag_type,
16775 /* If the lookup was ambiguous, an error will already have been
16776 issued. */
16780 /* If we are parsing friend declaration, DECL may be a
16781 TEMPLATE_DECL tree node here. However, we need to check
16782 whether this TEMPLATE_DECL results in valid code. Consider
16783 the following example:
16785 namespace N {
16786 template <class T> class C {};
16787 }
16788 class X {
16789 template <class T> friend class N::C; // #1, valid code
16790 };
16791 template <class T> class Y {
16792 friend class N::C; // #2, invalid code
16793 };
16795 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16796 name lookup of `N::C'. We see that friend declaration must
16797 be template for the code to be valid. Note that
16798 processing_template_decl does not work here since it is
16799 always 1 for the above two cases. */
16801 decl = (cp_parser_maybe_treat_template_as_class
16806 {
16808 identifier,
16811 }
16814 {
16818 allow_template);
16822 }
16824 /* Forward declarations of nested types, such as
16826 class C1::C2;
16827 class C1::C2::C3;
16829 are invalid unless all components preceding the final '::'
16830 are complete. If all enclosing types are complete, these
16831 declarations become merely pointless.
16833 Invalid forward declarations of nested types are errors
16834 caught elsewhere in parsing. Those that are pointless arrive
16835 here. */
16842 }
16843 else
16844 {
16845 /* An elaborated-type-specifier sometimes introduces a new type and
16846 sometimes names an existing type. Normally, the rule is that it
16847 introduces a new type only if there is not an existing type of
16848 the same name already in scope. For example, given:
16850 struct S {};
16851 void f() { struct S s; }
16853 the `struct S' in the body of `f' is the same `struct S' as in
16854 the global scope; the existing definition is used. However, if
16855 there were no global declaration, this would introduce a new
16856 local class named `S'.
16858 An exception to this rule applies to the following code:
16860 namespace N { struct S; }
16862 Here, the elaborated-type-specifier names a new type
16863 unconditionally; even if there is already an `S' in the
16864 containing scope this declaration names a new type.
16865 This exception only applies if the elaborated-type-specifier
16866 forms the complete declaration:
16868 [class.name]
16870 A declaration consisting solely of `class-key identifier ;' is
16871 either a redeclaration of the name in the current scope or a
16872 forward declaration of the identifier as a class name. It
16873 introduces the name into the current scope.
16875 We are in this situation precisely when the next token is a `;'.
16877 An exception to the exception is that a `friend' declaration does
16878 *not* name a new type; i.e., given:
16880 struct S { friend struct T; };
16882 `T' is not a new type in the scope of `S'.
16884 Also, `new struct S' or `sizeof (struct S)' never results in the
16885 definition of a new type; a new type can only be declared in a
16886 declaration context. */
16888 tag_scope ts;
16892 /* Friends have special name lookup rules. */
16896 CPP_SEMICOLON))
16897 /* This is a `class-key identifier ;' */
16899 else
16902 template_p =
16903 (template_parm_lists_apply
16906 /* An unqualified name was used to reference this type, so
16907 there were no qualifying templates. */
16915 }
16916 }
16921 /* Allow attributes on forward declarations of classes. */
16923 {
16933 else
16936 }
16939 {
16940 /* Indicate whether this class was declared as a `class' or as a
16941 `struct'. */
16945 }
16947 /* A "<" cannot follow an elaborated type specifier. If that
16948 happens, the user was probably trying to form a template-id. */
16953 }
16955 /* Parse an enum-specifier.
16957 enum-specifier:
16958 enum-head { enumerator-list [opt] }
16959 enum-head { enumerator-list , } [C++0x]
16961 enum-head:
16962 enum-key identifier [opt] enum-base [opt]
16963 enum-key nested-name-specifier identifier enum-base [opt]
16965 enum-key:
16966 enum
16967 enum class [C++0x]
16968 enum struct [C++0x]
16970 enum-base: [C++0x]
16971 : type-specifier-seq
16973 opaque-enum-specifier:
16974 enum-key identifier enum-base [opt] ;
16976 GNU Extensions:
16977 enum-key attributes[opt] identifier [opt] enum-base [opt]
16978 { enumerator-list [opt] }attributes[opt]
16979 enum-key attributes[opt] identifier [opt] enum-base [opt]
16980 { enumerator-list, }attributes[opt] [C++0x]
16982 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16983 if the token stream isn't an enum-specifier after all. */
16985 static tree
16987 {
16988 tree identifier;
16990 tree prev_scope;
16992 tree attributes;
17005 /* Parse tentatively so that we can back up if we don't find a
17006 enum-specifier. */
17009 /* Caller guarantees that the current token is 'enum', an identifier
17010 possibly follows, and the token after that is an opening brace.
17011 If we don't have an identifier, fabricate an anonymous name for
17012 the enumeration being defined. */
17015 /* Parse the "class" or "struct", which indicates a scoped
17016 enumeration type in C++0x. */
17019 {
17023 /* Consume the `struct' or `class' token. */
17027 }
17031 /* Clear the qualification. */
17036 /* Figure out in what scope the declaration is being placed. */
17042 nested_name_specifier
17050 {
17051 tree name;
17055 enum_type,
17060 input_location);
17062 {
17065 {
17066 /* Are template enums allowed in ISO? */
17070 /* ignore a typename reference, for it will be solved by name
17071 in start_enum. */
17073 }
17074 }
17077 else
17078 {
17083 }
17084 }
17085 else
17086 {
17089 else
17090 {
17096 }
17097 }
17100 /* Check for the `:' that denotes a specified underlying type in C++0x.
17101 Note that a ':' could also indicate a bitfield width, however. */
17103 {
17104 cp_decl_specifier_seq type_specifiers;
17106 /* Consume the `:'. */
17109 /* Parse the type-specifier-seq. */
17114 /* At this point this is surely not elaborated type specifier. */
17123 /* If that didn't work, stop. */
17125 {
17131 }
17132 }
17134 /* Look for the `{' but don't consume it yet. */
17136 {
17138 {
17141 {
17144 }
17145 }
17146 /* An opaque-enum-specifier must have a ';' here. */
17149 {
17152 {
17155 }
17156 }
17157 }
17163 {
17165 {
17169 }
17171 {
17173 }
17174 }
17176 /* Issue an error message if type-definitions are forbidden here. */
17179 else
17180 /* Create the new type. We do this before consuming the opening
17181 brace so the enum will be recorded as being on the line of its
17182 tag (or the 'enum' keyword, if there is no tag). */
17186 /* If the next token is not '{' it is an opaque-enum-specifier or an
17187 elaborated-type-specifier. */
17189 {
17193 {
17194 /* The following catches invalid code such as:
17195 enum class S<int>::E { A, B, C }; */
17203 {
17207 nested_name_specifier);
17209 }
17212 {
17214 "%qT for enum declaration does not name a class "
17217 }
17218 /* If that scope does not contain the scope in which the
17219 class was originally declared, the program is invalid. */
17221 nested_name_specifier))
17222 {
17225 "declaration of %qD in namespace %qD which does not "
17228 else
17230 "declaration of %qD in %qD which does not "
17234 }
17235 /* If that scope is the scope where the declaration is being placed
17236 the program is invalid. */
17240 {
17244 }
17245 }
17250 /* Consume the opening brace. */
17257 {
17261 }
17262 else
17263 {
17269 }
17273 /* If the next token is not '}', then there are some enumerators. */
17275 {
17279 }
17280 else
17283 /* Consume the final '}'. */
17289 }
17290 else
17291 {
17292 /* If a ';' follows, then it is an opaque-enum-specifier
17293 and additional restrictions apply. */
17295 {
17302 }
17303 }
17305 /* Look for trailing attributes to apply to this enumeration, and
17306 apply them if appropriate. */
17308 {
17311 trailing_attr,
17313 }
17315 /* Finish up the enumeration. */
17317 {
17322 }
17325 {
17327 {
17330 }
17332 {
17334 }
17335 }
17336 out:
17339 }
17341 /* Parse an enumerator-list. The enumerators all have the indicated
17342 TYPE.
17344 enumerator-list:
17345 enumerator-definition
17346 enumerator-list , enumerator-definition */
17348 static void
17350 {
17352 {
17353 /* Parse an enumerator-definition. */
17356 /* If the next token is not a ',', we've reached the end of
17357 the list. */
17360 /* Otherwise, consume the `,' and keep going. */
17362 /* If the next token is a `}', there is a trailing comma. */
17364 {
17369 }
17370 }
17371 }
17373 /* Parse an enumerator-definition. The enumerator has the indicated
17374 TYPE.
17376 enumerator-definition:
17377 enumerator
17378 enumerator = constant-expression
17380 enumerator:
17381 identifier
17383 GNU Extensions:
17385 enumerator-definition:
17386 enumerator attributes [opt]
17387 enumerator attributes [opt] = constant-expression */
17389 static void
17391 {
17392 tree identifier;
17393 tree value;
17394 location_t loc;
17396 /* Save the input location because we are interested in the location
17397 of the identifier and not the location of the explicit value. */
17400 /* Look for the identifier. */
17405 /* Parse any specified attributes. */
17408 /* If the next token is an '=', then there is an explicit value. */
17410 {
17411 /* Consume the `=' token. */
17413 /* Parse the value. */
17415 }
17416 else
17419 /* If we are processing a template, make sure the initializer of the
17420 enumerator doesn't contain any bare template parameter pack. */
17424 /* Create the enumerator. */
17426 }
17428 /* Parse a namespace-name.
17430 namespace-name:
17431 original-namespace-name
17432 namespace-alias
17434 Returns the NAMESPACE_DECL for the namespace. */
17436 static tree
17438 {
17439 tree identifier;
17440 tree namespace_decl;
17444 /* Get the name of the namespace. */
17449 /* Look up the identifier in the currently active scope. Look only
17450 for namespaces, due to:
17452 [basic.lookup.udir]
17454 When looking up a namespace-name in a using-directive or alias
17455 definition, only namespace names are considered.
17457 And:
17459 [basic.lookup.qual]
17461 During the lookup of a name preceding the :: scope resolution
17462 operator, object, function, and enumerator names are ignored.
17464 (Note that cp_parser_qualifying_entity only calls this
17465 function if the token after the name is the scope resolution
17466 operator.) */
17468 none_type,
17474 /* If it's not a namespace, issue an error. */
17477 {
17482 }
17485 }
17487 /* Parse a namespace-definition.
17489 namespace-definition:
17490 named-namespace-definition
17491 unnamed-namespace-definition
17493 named-namespace-definition:
17494 original-namespace-definition
17495 extension-namespace-definition
17497 original-namespace-definition:
17498 namespace identifier { namespace-body }
17500 extension-namespace-definition:
17501 namespace original-namespace-name { namespace-body }
17503 unnamed-namespace-definition:
17504 namespace { namespace-body } */
17506 static void
17508 {
17518 {
17522 }
17523 else
17526 /* Look for the `namespace' keyword. */
17529 /* Parse any specified attributes before the identifier. */
17532 /* Get the name of the namespace. We do not attempt to distinguish
17533 between an original-namespace-definition and an
17534 extension-namespace-definition at this point. The semantic
17535 analysis routines are responsible for that. */
17538 else
17541 /* Parse any specified attributes after the identifier. */
17544 {
17547 else
17549 }
17551 /* Start the namespace. */
17554 /* Parse any nested namespace definition. */
17556 {
17561 "nested namespace definitions only available with "
17566 {
17570 else
17571 {
17574 }
17577 }
17578 }
17580 /* Look for the `{' to validate starting the namespace. */
17583 /* "inline namespace" is equivalent to a stub namespace definition
17584 followed by a strong using directive. */
17586 {
17588 /* Set up namespace association. */
17592 /* Import the contents of the inline namespace. */
17596 }
17602 /* Parse the body of the namespace. */
17608 /* Finish the nested namespace definitions. */
17612 /* Finish the namespace. */
17615 /* Look for the final `}'. */
17617 }
17619 /* Parse a namespace-body.
17621 namespace-body:
17622 declaration-seq [opt] */
17624 static void
17626 {
17628 }
17630 /* Parse a namespace-alias-definition.
17632 namespace-alias-definition:
17633 namespace identifier = qualified-namespace-specifier ; */
17635 static void
17637 {
17638 tree identifier;
17639 tree namespace_specifier;
17643 /* Look for the `namespace' keyword. */
17645 /* Look for the identifier. */
17649 /* Look for the `=' token. */
17652 {
17654 /* Skip the definition. */
17659 }
17661 /* Look for the qualified-namespace-specifier. */
17662 namespace_specifier
17664 /* Look for the `;' token. */
17667 /* Register the alias in the symbol table. */
17669 }
17671 /* Parse a qualified-namespace-specifier.
17673 qualified-namespace-specifier:
17674 :: [opt] nested-name-specifier [opt] namespace-name
17676 Returns a NAMESPACE_DECL corresponding to the specified
17677 namespace. */
17679 static tree
17681 {
17682 /* Look for the optional `::'. */
17686 /* Look for the optional nested-name-specifier. */
17694 }
17696 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17697 access declaration.
17699 using-declaration:
17700 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17701 using :: unqualified-id ;
17703 access-declaration:
17704 qualified-id ;
17706 */
17708 static bool
17711 {
17715 tree decl;
17716 tree identifier;
17717 tree qscope;
17722 {
17725 }
17726 else
17727 {
17728 /* Look for the `using' keyword. */
17731 /* Peek at the next token. */
17733 /* See if it's `typename'. */
17735 {
17736 /* Remember that we've seen it. */
17738 /* Consume the `typename' token. */
17740 }
17741 }
17743 /* Look for the optional global scope qualification. */
17744 global_scope_p
17749 /* If we saw `typename', or didn't see `::', then there must be a
17750 nested-name-specifier present. */
17752 {
17758 {
17761 }
17762 }
17763 /* Otherwise, we could be in either of the two productions. In that
17764 case, treat the nested-name-specifier as optional. */
17765 else
17777 /* Something has already gone wrong; there's no need to parse
17778 further. Since an error has occurred, the return value of
17779 cp_parser_parse_definitely will be false, as required. */
17783 /* Parse the unqualified-id. */
17791 {
17796 }
17798 /* The function we call to handle a using-declaration is different
17799 depending on what scope we are in. */
17801 ;
17804 /* [namespace.udecl]
17806 A using declaration shall not name a template-id. */
17809 else
17810 {
17812 {
17813 /* Create the USING_DECL. */
17820 {
17823 }
17824 else
17825 /* Add it to the list of members in this class. */
17827 }
17828 else
17829 {
17831 identifier,
17838 {
17841 }
17844 else
17846 }
17847 }
17849 /* Look for the final `;'. */
17854 "access declarations are deprecated "
17855 "in favour of using-declarations; "
17859 }
17861 /* Parse an alias-declaration.
17863 alias-declaration:
17864 using identifier attribute-specifier-seq [opt] = type-id */
17866 static tree
17868 {
17870 location_t id_location;
17872 cp_decl_specifier_seq decl_specs;
17876 /* Look for the `using' keyword. */
17877 cp_token *using_token
17899 /* Now we are going to parse the type-id of the declaration. */
17901 /*
17902 [dcl.type]/3 says:
17904 "A type-specifier-seq shall not define a class or enumeration
17905 unless it appears in the type-id of an alias-declaration (7.1.3) that
17906 is not the declaration of a template-declaration."
17908 In other words, if we currently are in an alias template, the
17909 type-id should not define a type.
17911 So let's set parser->type_definition_forbidden_message in that
17912 case; cp_parser_check_type_definition (called by
17913 cp_parser_class_specifier) will then emit an error if a type is
17914 defined in the type-id. */
17916 {
17920 }
17924 /* Restore the error message if need be. */
17930 {
17933 }
17935 /* A typedef-name can also be introduced by an alias-declaration. The
17936 identifier following the using keyword becomes a typedef-name. It has
17937 the same semantics as if it were introduced by the typedef
17938 specifier. In particular, it does not define a new type and it shall
17939 not appear in the type-id. */
17944 {
17947 ds_attribute,
17948 attrs_token);
17949 }
17951 ds_typedef,
17952 using_token);
17954 ds_alias,
17955 using_token);
17964 else
17970 // Attach constraints to the alias declaration.
17972 {
17976 }
17983 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17984 added into the symbol table; otherwise, return the TYPE_DECL. */
17988 {
17992 }
17995 }
17997 /* Parse a using-directive.
17999 using-directive:
18000 using namespace :: [opt] nested-name-specifier [opt]
18001 namespace-name ; */
18003 static void
18005 {
18006 tree namespace_decl;
18007 tree attribs;
18009 /* Look for the `using' keyword. */
18011 /* And the `namespace' keyword. */
18013 /* Look for the optional `::' operator. */
18015 /* And the optional nested-name-specifier. */
18021 /* Get the namespace being used. */
18023 /* And any specified attributes. */
18025 /* Update the symbol table. */
18027 /* Look for the final `;'. */
18029 }
18031 /* Parse an asm-definition.
18033 asm-definition:
18034 asm ( string-literal ) ;
18036 GNU Extension:
18038 asm-definition:
18039 asm volatile [opt] ( string-literal ) ;
18040 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18041 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18042 : asm-operand-list [opt] ) ;
18043 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18044 : asm-operand-list [opt]
18045 : asm-clobber-list [opt] ) ;
18046 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18047 : asm-clobber-list [opt]
18048 : asm-goto-list ) ; */
18050 static void
18052 {
18053 tree string;
18058 tree asm_stmt;
18066 /* Look for the `asm' keyword. */
18071 {
18074 }
18076 /* See if the next token is `volatile'. */
18079 {
18080 /* Remember that we saw the `volatile' keyword. */
18082 /* Consume the token. */
18084 }
18088 {
18089 /* Remember that we saw the `goto' keyword. */
18091 /* Consume the token. */
18093 }
18094 /* Look for the opening `('. */
18097 /* Look for the string. */
18100 {
18104 }
18106 /* If we're allowing GNU extensions, check for the extended assembly
18107 syntax. Unfortunately, the `:' tokens need not be separated by
18108 a space in C, and so, for compatibility, we tolerate that here
18109 too. Doing that means that we have to treat the `::' operator as
18110 two `:' tokens. */
18115 {
18120 /* The extended syntax was used. */
18123 /* Look for outputs. */
18125 {
18126 /* Consume the `:'. */
18128 /* Parse the output-operands. */
18130 CPP_COLON)
18132 CPP_SCOPE)
18134 CPP_CLOSE_PAREN)
18136 {
18140 }
18141 }
18142 /* If the next token is `::', there are no outputs, and the
18143 next token is the beginning of the inputs. */
18145 /* The inputs are coming next. */
18148 /* Look for inputs. */
18151 {
18152 /* Consume the `:' or `::'. */
18154 /* Parse the output-operands. */
18156 CPP_COLON)
18158 CPP_SCOPE)
18160 CPP_CLOSE_PAREN))
18161 {
18165 }
18166 }
18168 /* The clobbers are coming next. */
18171 /* Look for clobbers. */
18174 {
18176 /* Consume the `:' or `::'. */
18178 /* Parse the clobbers. */
18180 CPP_COLON)
18182 CPP_CLOSE_PAREN))
18184 }
18187 /* The labels are coming next. */
18190 /* Look for labels. */
18193 {
18195 /* Consume the `:' or `::'. */
18197 /* Parse the labels. */
18199 }
18203 }
18207 /* Look for the closing `)'. */
18215 {
18216 /* Create the ASM_EXPR. */
18218 {
18221 /* If the extended syntax was not used, mark the ASM_EXPR. */
18223 {
18229 }
18230 }
18231 else
18233 }
18234 }
18236 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18237 type that comes from the decl-specifier-seq. */
18239 static tree
18241 {
18244 {
18256 }
18259 }
18261 /* Declarators [gram.dcl.decl] */
18263 /* Parse an init-declarator.
18265 init-declarator:
18266 declarator initializer [opt]
18268 GNU Extension:
18270 init-declarator:
18271 declarator asm-specification [opt] attributes [opt] initializer [opt]
18273 function-definition:
18274 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18275 function-body
18276 decl-specifier-seq [opt] declarator function-try-block
18278 GNU Extension:
18280 function-definition:
18281 __extension__ function-definition
18283 TM Extension:
18285 function-definition:
18286 decl-specifier-seq [opt] declarator function-transaction-block
18288 The DECL_SPECIFIERS apply to this declarator. Returns a
18289 representation of the entity declared. If MEMBER_P is TRUE, then
18290 this declarator appears in a class scope. The new DECL created by
18291 this declarator is returned.
18293 The CHECKS are access checks that should be performed once we know
18294 what entity is being declared (and, therefore, what classes have
18295 befriended it).
18297 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18298 for a function-definition here as well. If the declarator is a
18299 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18300 be TRUE upon return. By that point, the function-definition will
18301 have been completely parsed.
18303 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18304 is FALSE.
18306 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18307 parsed declaration if it is an uninitialized single declarator not followed
18308 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18309 if present, will not be consumed. If returned, this declarator will be
18310 created with SD_INITIALIZED but will not call cp_finish_decl.
18312 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18313 and there is an initializer, the pointed location_t is set to the
18314 location of the '=' or `(', or '{' in C++11 token introducing the
18315 initializer. */
18317 static tree
18328 {
18332 tree prefix_attributes;
18334 tree asm_specification;
18335 tree initializer;
18337 tree scope;
18339 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18340 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18341 "(...)". */
18352 /* Gather the attributes that were provided with the
18353 decl-specifiers. */
18356 /* Assume that this is not the declarator for a function
18357 definition. */
18361 /* Default arguments are only permitted for function parameters. */
18365 /* Defer access checks while parsing the declarator; we cannot know
18366 what names are accessible until we know what is being
18367 declared. */
18370 /* Parse the declarator. */
18372 declarator
18377 /* Gather up the deferred checks. */
18382 /* If the DECLARATOR was erroneous, there's no need to go
18383 further. */
18387 /* Check that the number of template-parameter-lists is OK. */
18397 /* Figure out what scope the entity declared by the DECLARATOR is
18398 located in. `grokdeclarator' sometimes changes the scope, so
18399 we compute it now. */
18402 /* Perform any lookups in the declared type which were thought to be
18403 dependent, but are not in the scope of the declarator. */
18404 decl_specifiers->type
18407 /* If we're allowing GNU extensions, look for an
18408 asm-specification. */
18410 {
18411 /* Look for an asm-specification. */
18414 }
18415 else
18418 /* Look for attributes. */
18422 /* Peek at the next token. */
18428 {
18429 /* Check to see if the token indicates the start of a
18430 function-definition. */
18432 {
18434 {
18435 /* If a function-definition should not appear here, issue an
18436 error message. */
18440 }
18442 location_t func_brace_location
18445 /* Neither attributes nor an asm-specification are allowed
18446 on a function-definition. */
18449 "an asm-specification is not allowed "
18453 "attributes are not allowed "
18455 /* This is a function-definition. */
18458 /* Parse the function definition. */
18461 decl_specifiers,
18462 declarator,
18463 prefix_attributes);
18464 else
18465 decl =
18466 (cp_parser_function_definition_from_specifiers_and_declarator
18470 {
18471 /* This is where the prologue starts... */
18474 }
18477 }
18478 }
18480 {
18481 /* A non-template declaration involving a function parameter list
18482 containing an implicit template parameter will be made into a
18483 template. If the resulting declaration is not going to be an
18484 actual function then finish the template scope here to prevent it.
18485 An error message will be issued once we have a decl to talk about.
18487 FIXME probably we should do type deduction rather than create an
18488 implicit template, but the standard currently doesn't allow it. */
18491 }
18493 /* [dcl.dcl]
18495 Only in function declarations for constructors, destructors, and
18496 type conversions can the decl-specifier-seq be omitted.
18498 We explicitly postpone this check past the point where we handle
18499 function-definitions because we tolerate function-definitions
18500 that are missing their return types in some modes. */
18502 {
18506 }
18508 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18512 {
18523 {
18529 }
18530 }
18531 else
18532 {
18533 /* If the init-declarator isn't initialized and isn't followed by a
18534 `,' or `;', it's not a valid init-declarator. */
18537 {
18540 else
18541 {
18545 }
18546 }
18549 }
18551 /* Because start_decl has side-effects, we should only call it if we
18552 know we're going ahead. By this point, we know that we cannot
18553 possibly be looking at any other construct. */
18556 /* Enter the newly declared entry in the symbol table. If we're
18557 processing a declaration in a class-specifier, we wait until
18558 after processing the initializer. */
18560 {
18568 /* Adjust location of decl if declarator->id_loc is more appropriate:
18569 set, and decl wasn't merged with another decl, in which case its
18570 location would be different from input_location, and more accurate. */
18575 }
18577 /* Enter the SCOPE. That way unqualified names appearing in the
18578 initializer will be looked up in SCOPE. */
18581 /* Perform deferred access control checks, now that we know in which
18582 SCOPE the declared entity resides. */
18584 {
18587 /* If the entity being declared is a function, pretend that we
18588 are in its scope. If it is a `friend', it may have access to
18589 things that would not otherwise be accessible. */
18591 {
18594 }
18596 /* Perform access checks for template parameters. */
18599 /* Perform the access control checks for the declarator and the
18600 decl-specifiers. */
18603 /* Restore the saved value. */
18606 }
18608 /* Parse the initializer. */
18613 {
18615 {
18618 else
18619 {
18620 /* If the declaration was erroneous, we don't really
18621 know what the user intended, so just silently
18622 consume the initializer. */
18629 }
18630 }
18631 else
18632 {
18633 /* We want to record the extra mangling scope for in-class
18634 initializers of class members and initializers of static data
18635 member templates. The former involves deferring
18636 parsing of the initializer until end of class as with default
18637 arguments. So right here we only handle the latter. */
18647 }
18648 }
18650 /* The old parser allows attributes to appear after a parenthesized
18651 initializer. Mark Mitchell proposed removing this functionality
18652 on the GCC mailing lists on 2002-08-13. This parser accepts the
18653 attributes -- but ignores them. */
18660 /* And now complain about a non-function implicit template. */
18665 /* For an in-class declaration, use `grokfield' to create the
18666 declaration. */
18668 {
18670 {
18673 }
18682 }
18684 /* Finish processing the declaration. But, skip member
18685 declarations. */
18687 {
18690 asm_specification,
18691 /* If the initializer is in parentheses, then this is
18692 a direct-initialization, which means that an
18693 `explicit' constructor is OK. Otherwise, an
18694 `explicit' constructor cannot be used. */
18697 }
18700 /* Core issue #226 (C++0x only): A default template-argument
18701 shall not be specified in a friend class template
18702 declaration. */
18711 {
18714 else
18716 }
18723 }
18725 /* Parse a declarator.
18727 declarator:
18728 direct-declarator
18729 ptr-operator declarator
18731 abstract-declarator:
18732 ptr-operator abstract-declarator [opt]
18733 direct-abstract-declarator
18735 GNU Extensions:
18737 declarator:
18738 attributes [opt] direct-declarator
18739 attributes [opt] ptr-operator declarator
18741 abstract-declarator:
18742 attributes [opt] ptr-operator abstract-declarator [opt]
18743 attributes [opt] direct-abstract-declarator
18745 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18746 detect constructor, destructor or conversion operators. It is set
18747 to -1 if the declarator is a name, and +1 if it is a
18748 function. Otherwise it is set to zero. Usually you just want to
18749 test for >0, but internally the negative value is used.
18751 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18752 a decl-specifier-seq unless it declares a constructor, destructor,
18753 or conversion. It might seem that we could check this condition in
18754 semantic analysis, rather than parsing, but that makes it difficult
18755 to handle something like `f()'. We want to notice that there are
18756 no decl-specifiers, and therefore realize that this is an
18757 expression, not a declaration.)
18759 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18760 the declarator is a direct-declarator of the form "(...)".
18762 MEMBER_P is true iff this declarator is a member-declarator.
18764 FRIEND_P is true iff this declarator is a friend. */
18768 cp_parser_declarator_kind dcl_kind,
18772 {
18775 cp_cv_quals cv_quals;
18776 tree class_type;
18779 /* Assume this is not a constructor, destructor, or type-conversion
18780 operator. */
18787 /* Check for the ptr-operator production. */
18789 /* Parse the ptr-operator. */
18795 /* If that worked, then we have a ptr-operator. */
18797 {
18798 /* If a ptr-operator was found, then this declarator was not
18799 parenthesized. */
18802 /* The dependent declarator is optional if we are parsing an
18803 abstract-declarator. */
18807 /* Parse the dependent declarator. */
18812 friend_p);
18814 /* If we are parsing an abstract-declarator, we must handle the
18815 case where the dependent declarator is absent. */
18820 declarator = cp_parser_make_indirect_declarator
18822 }
18823 /* Everything else is a direct-declarator. */
18824 else
18825 {
18828 CPP_OPEN_PAREN);
18830 ctor_dtor_or_conv_p,
18832 }
18837 }
18839 /* Parse a direct-declarator or direct-abstract-declarator.
18841 direct-declarator:
18842 declarator-id
18843 direct-declarator ( parameter-declaration-clause )
18844 cv-qualifier-seq [opt]
18845 ref-qualifier [opt]
18846 exception-specification [opt]
18847 direct-declarator [ constant-expression [opt] ]
18848 ( declarator )
18850 direct-abstract-declarator:
18851 direct-abstract-declarator [opt]
18852 ( parameter-declaration-clause )
18853 cv-qualifier-seq [opt]
18854 ref-qualifier [opt]
18855 exception-specification [opt]
18856 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18857 ( abstract-declarator )
18859 Returns a representation of the declarator. DCL_KIND is
18860 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18861 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18862 we are parsing a direct-declarator. It is
18863 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18864 of ambiguity we prefer an abstract declarator, as per
18865 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18866 as for cp_parser_declarator. */
18870 cp_parser_declarator_kind dcl_kind,
18873 {
18883 {
18884 /* Peek at the next token. */
18887 {
18888 /* This is either a parameter-declaration-clause, or a
18889 parenthesized declarator. When we know we are parsing a
18890 named declarator, it must be a parenthesized declarator
18891 if FIRST is true. For instance, `(int)' is a
18892 parameter-declaration-clause, with an omitted
18893 direct-abstract-declarator. But `((*))', is a
18894 parenthesized abstract declarator. Finally, when T is a
18895 template parameter `(T)' is a
18896 parameter-declaration-clause, and not a parenthesized
18897 named declarator.
18899 We first try and parse a parameter-declaration-clause,
18900 and then try a nested declarator (if FIRST is true).
18902 It is not an error for it not to be a
18903 parameter-declaration-clause, even when FIRST is
18904 false. Consider,
18906 int i (int);
18907 int i (3);
18909 The first is the declaration of a function while the
18910 second is the definition of a variable, including its
18911 initializer.
18913 Having seen only the parenthesis, we cannot know which of
18914 these two alternatives should be selected. Even more
18915 complex are examples like:
18917 int i (int (a));
18918 int i (int (3));
18920 The former is a function-declaration; the latter is a
18921 variable initialization.
18923 Thus again, we try a parameter-declaration-clause, and if
18924 that fails, we back out and return. */
18927 {
18928 tree params;
18931 /* In a member-declarator, the only valid interpretation
18932 of a parenthesis is the start of a
18933 parameter-declaration-clause. (It is invalid to
18934 initialize a static data member with a parenthesized
18935 initializer; only the "=" form of initialization is
18936 permitted.) */
18940 /* Consume the `('. */
18943 {
18944 /* If this is going to be an abstract declarator, we're
18945 in a declarator and we can't have default args. */
18948 }
18952 /* Parse the parameter-declaration-clause. */
18955 /* Consume the `)'. */
18958 /* If all went well, parse the cv-qualifier-seq,
18959 ref-qualifier and the exception-specification. */
18961 {
18962 cp_cv_quals cv_quals;
18963 cp_virt_specifiers virt_specifiers;
18964 cp_ref_qualifier ref_qual;
18965 tree exception_specification;
18966 tree late_return;
18967 tree attrs;
18977 /* Parse the cv-qualifier-seq. */
18979 /* Parse the ref-qualifier. */
18981 /* Parse the tx-qualifier. */
18983 /* And the exception-specification. */
18984 exception_specification
18989 /* In here, we handle cases where attribute is used after
18990 the function declaration. For example:
18991 void func (int x) __attribute__((vector(..))); */
18995 {
18999 CPP_SEMICOLON)
19001 CPP_OPEN_BRACE))
19004 ;
19005 else
19007 }
19009 late_return = (cp_parser_late_return_type_opt
19013 /* Parse the virt-specifier-seq. */
19016 /* Create the function-declarator. */
19018 params,
19019 cv_quals,
19020 virt_specifiers,
19021 ref_qual,
19022 tx_qual,
19023 exception_specification,
19024 late_return,
19025 requires_clause);
19028 /* Any subsequent parameter lists are to do with
19029 return type, so are not those of the declared
19030 function. */
19032 }
19034 /* Remove the function parms from scope. */
19038 /* Repeat the main loop. */
19040 }
19042 /* If this is the first, we can try a parenthesized
19043 declarator. */
19045 {
19051 /* Consume the `('. */
19053 /* Parse the nested declarator. */
19056 declarator
19062 /* Expect a `)'. */
19069 }
19070 /* Otherwise, we must be done. */
19071 else
19073 }
19077 {
19078 /* Parse an array-declarator. */
19087 /* Consume the `['. */
19089 /* Peek at the next token. */
19091 /* If the next token is `]', then there is no
19092 constant-expression. */
19094 {
19096 bounds
19106 {
19107 /* Normally, the array bound must be an integral constant
19108 expression. However, as an extension, we allow VLAs
19109 in function scopes as long as they aren't part of a
19110 parameter declaration. */
19114 }
19117 {
19118 /* Remember this wasn't a constant-expression. */
19121 }
19122 }
19123 else
19125 /* Look for the closing `]'. */
19127 {
19130 }
19135 }
19137 {
19138 {
19139 tree qualifying_scope;
19140 tree unqualified_name;
19141 tree attrs;
19142 special_function_kind sfk;
19147 /* Parse a declarator-id */
19150 {
19153 /* If we see an ellipsis, we should be looking at a
19154 parameter pack. */
19156 {
19157 /* Consume the `...' */
19161 }
19162 }
19165 unqualified_name
19169 {
19173 {
19174 /* Check whether an error occurred. */
19177 /* We already consumed the ellipsis to mark a
19178 parameter pack, but we have no way to report it,
19179 so abort the tentative parse. We will be exiting
19180 immediately anyway. */
19182 }
19183 else
19189 && (qualifying_scope
19191 {
19194 }
19195 }
19200 {
19205 }
19211 {
19212 /* In the declaration of a member of a template class
19213 outside of the class itself, the SCOPE will sometimes
19214 be a TYPENAME_TYPE. For example, given:
19216 template <typename T>
19217 int S<T>::R::i = 3;
19219 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19220 this context, we must resolve S<T>::R to an ordinary
19221 type, rather than a typename type.
19223 The reason we normally avoid resolving TYPENAME_TYPEs
19224 is that a specialization of `S' might render
19225 `S<T>::R' not a type. However, if `S' is
19226 specialized, then this `i' will not be used, so there
19227 is no harm in resolving the types here. */
19228 tree type;
19230 /* Resolve the TYPENAME_TYPE. */
19233 /* If that failed, the declarator is invalid. */
19235 {
19238 "cannot define member of dependent typedef "
19240 else
19245 }
19247 }
19252 {
19253 tree class_type;
19258 else
19262 {
19265 {
19268 {
19272 "use %<%T::%D%> instead of %<%T::%D%> to "
19274 class_type,
19279 }
19280 else
19282 }
19283 else
19284 {
19285 /* We do not attempt to print the declarator
19286 here because we do not have enough
19287 information about its original syntactic
19288 form. */
19292 }
19293 }
19296 {
19302 for an anonymous type, even if the type
19303 got a name for linkage purposes. */
19305 /* Handle correctly (c++/19200):
19307 struct S {
19308 struct T{};
19309 friend void S(T);
19310 };
19312 and also:
19314 namespace N {
19315 void S();
19316 }
19318 struct S {
19319 friend void N::S();
19320 }; */
19321 && !(friend_p
19324 class_type))
19325 {
19328 }
19336 }
19337 }
19339 unqualified_name,
19340 sfk);
19347 }
19349 handle_declarator:;
19352 {
19353 /* Any names that appear after the declarator-id for a
19354 member are looked up in the containing scope. */
19356 {
19357 /* But declarations with qualified-ids can't appear in a
19358 function. */
19362 }
19364 }
19368 /* Default args are only allowed on function
19369 declarations. */
19371 else
19375 }
19376 /* We're done. */
19377 else
19379 }
19381 /* For an abstract declarator, we might wind up with nothing at this
19382 point. That's an error; the declarator is not optional. */
19386 /* If we entered a scope, we must exit it now. */
19394 }
19396 /* Parse a ptr-operator.
19398 ptr-operator:
19399 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19400 * cv-qualifier-seq [opt]
19401 &
19402 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19403 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19405 GNU Extension:
19407 ptr-operator:
19408 & cv-qualifier-seq [opt]
19410 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19411 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19412 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19413 filled in with the TYPE containing the member. *CV_QUALS is
19414 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19415 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19416 Note that the tree codes returned by this function have nothing
19417 to do with the types of trees that will be eventually be created
19418 to represent the pointer or reference type being parsed. They are
19419 just constants with suggestive names. */
19420 static enum tree_code
19425 {
19430 /* Assume that it's not a pointer-to-member. */
19432 /* And that there are no cv-qualifiers. */
19435 /* Peek at the next token. */
19438 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19448 {
19449 /* Consume the `*', `&' or `&&'. */
19452 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19453 `&', if we are allowing GNU extensions. (The only qualifier
19454 that can legally appear after `&' is `restrict', but that is
19455 enforced during semantic analysis. */
19463 }
19464 else
19465 {
19466 /* Try the pointer-to-member case. */
19468 /* Look for the optional `::' operator. */
19471 /* Look for the nested-name specifier. */
19478 /* If we found it, and the next token is a `*', then we are
19479 indeed looking at a pointer-to-member operator. */
19482 {
19483 /* Indicate that the `*' operator was used. */
19491 else
19492 {
19493 /* The type of which the member is a member is given by the
19494 current SCOPE. */
19496 /* The next name will not be qualified. */
19500 /* Look for optional c++11 attributes. */
19504 /* Look for the optional cv-qualifier-seq. */
19506 }
19507 }
19508 /* If that didn't work we don't have a ptr-operator. */
19511 }
19514 }
19516 /* Parse an (optional) cv-qualifier-seq.
19518 cv-qualifier-seq:
19519 cv-qualifier cv-qualifier-seq [opt]
19521 cv-qualifier:
19522 const
19523 volatile
19525 GNU Extension:
19527 cv-qualifier:
19528 __restrict__
19530 Returns a bitmask representing the cv-qualifiers. */
19532 static cp_cv_quals
19534 {
19538 {
19540 cp_cv_quals cv_qualifier;
19542 /* Peek at the next token. */
19544 /* See if it's a cv-qualifier. */
19546 {
19562 }
19568 {
19571 }
19572 else
19573 {
19576 }
19577 }
19580 }
19582 /* Parse an (optional) ref-qualifier
19584 ref-qualifier:
19585 &
19586 &&
19588 Returns cp_ref_qualifier representing ref-qualifier. */
19590 static cp_ref_qualifier
19592 {
19595 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19600 {
19605 {
19617 }
19622 {
19625 }
19626 else
19627 {
19630 }
19631 }
19634 }
19636 /* Parse an optional tx-qualifier.
19638 tx-qualifier:
19639 transaction_safe
19640 transaction_safe_dynamic */
19642 static tree
19644 {
19647 {
19652 {
19656 {
19659 {
19662 }
19663 else
19665 }
19666 }
19667 }
19669 }
19671 /* Parse an (optional) virt-specifier-seq.
19673 virt-specifier-seq:
19674 virt-specifier virt-specifier-seq [opt]
19676 virt-specifier:
19677 override
19678 final
19680 Returns a bitmask representing the virt-specifiers. */
19682 static cp_virt_specifiers
19684 {
19688 {
19690 cp_virt_specifiers virt_specifier;
19692 /* Peek at the next token. */
19694 /* See if it's a virt-specifier-qualifier. */
19698 {
19701 }
19703 {
19706 }
19708 {
19710 }
19711 else
19715 {
19718 }
19719 else
19720 {
19723 }
19724 }
19726 }
19728 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19729 is in scope even though it isn't real. */
19731 void
19733 {
19734 tree this_parm;
19737 {
19738 /* We don't clear this between NSDMIs. Is it already what we want? */
19743 }
19746 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19748 current_class_ref
19751 }
19753 /* Return true iff our current scope is a non-static data member
19754 initializer. */
19756 bool
19758 {
19759 /* We recognize NSDMI context by the context-less 'this' pointer set up
19760 by the function above. */
19766 }
19768 /* Parse a late-specified return type, if any. This is not a separate
19769 non-terminal, but part of a function declarator, which looks like
19771 -> trailing-type-specifier-seq abstract-declarator(opt)
19773 Returns the type indicated by the type-id.
19775 In addition to this, parse any queued up omp declare simd
19776 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19778 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19779 function. */
19781 static tree
19784 {
19788 && declarator
19795 && declarator
19798 /* Peek at the next token. */
19800 /* A late-specified return type is indicated by an initial '->'. */
19811 {
19812 /* DR 1207: 'this' is in scope in the trailing return type. */
19814 }
19817 {
19818 /* Consume the ->. */
19822 }
19824 /* Function declarations may be followed by a trailing
19825 requires-clause. */
19829 declarator->attributes
19833 declarator->attributes
19837 declarator->attributes
19842 {
19845 }
19848 }
19850 /* Parse a declarator-id.
19852 declarator-id:
19853 id-expression
19854 :: [opt] nested-name-specifier [opt] type-name
19856 In the `id-expression' case, the value returned is as for
19857 cp_parser_id_expression if the id-expression was an unqualified-id.
19858 If the id-expression was a qualified-id, then a SCOPE_REF is
19859 returned. The first operand is the scope (either a NAMESPACE_DECL
19860 or TREE_TYPE), but the second is still just a representation of an
19861 unqualified-id. */
19863 static tree
19865 {
19866 tree id;
19867 /* The expression must be an id-expression. Assume that qualified
19868 names are the names of types so that:
19870 template <class T>
19871 int S<T>::R::i = 3;
19873 will work; we must treat `S<T>::R' as the name of a type.
19874 Similarly, assume that qualified names are templates, where
19875 required, so that:
19877 template <class T>
19878 int S<T>::R<T>::i = 3;
19880 will work, too. */
19886 optional_p);
19890 }
19892 /* Parse a type-id.
19894 type-id:
19895 type-specifier-seq abstract-declarator [opt]
19897 Returns the TYPE specified. */
19899 static tree
19902 {
19903 cp_decl_specifier_seq type_specifier_seq;
19906 /* Parse the type-specifier-seq. */
19908 is_trailing_return,
19913 /* There might or might not be an abstract declarator. */
19915 /* Look for the declarator. */
19916 abstract_declarator
19921 /* Check to see if there really was a declarator. */
19926 /* The concepts TS allows 'auto' as a type-id. */
19928 /* None of the valid uses of 'auto' in C++14 involve the type-id
19929 nonterminal, but it is valid in a trailing-return-type. */
19932 {
19933 /* A type-id with type 'auto' is only ok if the abstract declarator
19934 is a function declarator with a late-specified return type.
19936 A type-id with 'auto' is also valid in a trailing-return-type
19937 in a compound-requirement. */
19944 else
19945 {
19948 }
19949 }
19952 is_template_arg);
19953 }
19955 static tree
19957 {
19959 }
19961 static tree
19963 {
19964 tree r;
19966 parser->type_definition_forbidden_message
19971 {
19974 }
19976 }
19978 static tree
19980 {
19982 }
19984 /* Parse a type-specifier-seq.
19986 type-specifier-seq:
19987 type-specifier type-specifier-seq [opt]
19989 GNU extension:
19991 type-specifier-seq:
19992 attributes type-specifier-seq [opt]
19994 If IS_DECLARATION is true, we are at the start of a "condition" or
19995 exception-declaration, so we might be followed by a declarator-id.
19997 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19998 i.e. we've just seen "->".
20000 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20002 static void
20007 {
20012 /* Clear the TYPE_SPECIFIER_SEQ. */
20015 /* In the context of a trailing return type, enum E { } is an
20016 elaborated-type-specifier followed by a function-body, not an
20017 enum-specifier. */
20021 /* Parse the type-specifiers and attributes. */
20023 {
20024 tree type_specifier;
20027 /* Check for attributes first. */
20029 {
20034 }
20036 /* record the token of the beginning of the type specifier seq,
20037 for error reporting purposes*/
20041 /* Look for the type-specifier. */
20043 flags,
20044 type_specifier_seq,
20046 NULL,
20049 {
20050 /* If the first type-specifier could not be found, this is not a
20051 type-specifier-seq at all. */
20053 {
20054 /* Set in_declarator_p to avoid skipping to the semicolon. */
20066 }
20067 /* If subsequent type-specifiers could not be found, the
20068 type-specifier-seq is complete. */
20070 }
20073 /* The standard says that a condition can be:
20075 type-specifier-seq declarator = assignment-expression
20077 However, given:
20079 struct S {};
20080 if (int S = ...)
20082 we should treat the "S" as a declarator, not as a
20083 type-specifier. The standard doesn't say that explicitly for
20084 type-specifier-seq, but it does say that for
20085 decl-specifier-seq in an ordinary declaration. Perhaps it
20086 would be clearer just to allow a decl-specifier-seq here, and
20087 then add a semantic restriction that if any decl-specifiers
20088 that are not type-specifiers appear, the program is invalid. */
20091 }
20092 }
20094 /* Return whether the function currently being declared has an associated
20095 template parameter list. */
20097 static bool
20099 {
20112 }
20114 /* Parse a parameter-declaration-clause.
20116 parameter-declaration-clause:
20117 parameter-declaration-list [opt] ... [opt]
20118 parameter-declaration-list , ...
20120 Returns a representation for the parameter declarations. A return
20121 value of NULL indicates a parameter-declaration-clause consisting
20122 only of an ellipsis. */
20124 static tree
20126 {
20127 tree parameters;
20136 parser->auto_is_implicit_function_template_parm_p
20138 }
20144 && !processing_template_parmlist
20150 /* Peek at the next token. */
20152 /* Check for trivial parameter-declaration-clauses. */
20154 {
20155 /* Consume the `...' token. */
20158 }
20160 /* There are no parameters. */
20161 {
20162 #ifndef NO_IMPLICIT_EXTERN_C
20167 else
20168 #endif
20170 }
20171 /* Check for `(void)', too, which is a special case. */
20175 {
20176 /* Consume the `void' token. */
20178 /* There are no parameters. */
20180 }
20182 /* Parse the parameter-declaration-list. */
20184 /* If a parse error occurred while parsing the
20185 parameter-declaration-list, then the entire
20186 parameter-declaration-clause is erroneous. */
20190 /* Peek at the next token. */
20192 /* If it's a `,', the clause should terminate with an ellipsis. */
20194 {
20195 /* Consume the `,'. */
20197 /* Expect an ellipsis. */
20198 ellipsis_p
20200 }
20201 /* It might also be `...' if the optional trailing `,' was
20202 omitted. */
20204 {
20205 /* Consume the `...' token. */
20207 /* And remember that we saw it. */
20209 }
20210 else
20213 /* Finish the parameter list. */
20218 }
20220 /* Parse a parameter-declaration-list.
20222 parameter-declaration-list:
20223 parameter-declaration
20224 parameter-declaration-list , parameter-declaration
20226 Returns a representation of the parameter-declaration-list, as for
20227 cp_parser_parameter_declaration_clause. However, the
20228 `void_list_node' is never appended to the list. Upon return,
20229 *IS_ERROR will be true iff an error occurred. */
20231 static tree
20233 {
20239 /* Assume all will go well. */
20241 /* The special considerations that apply to a function within an
20242 unbraced linkage specifications do not apply to the parameters
20243 to the function. */
20244 saved_in_unbraced_linkage_specification_p
20248 /* Look for more parameters. */
20250 {
20258 /* Parse the parameter. */
20259 parameter
20264 /* We don't know yet if the enclosing context is deprecated, so wait
20265 and warn in grokparms if appropriate. */
20269 {
20270 /* If a function parameter pack was specified and an implicit template
20271 parameter was introduced during cp_parser_parameter_declaration,
20272 change any implicit parameters introduced into packs. */
20276 {
20284 }
20288 PARM,
20291 }
20295 /* If a parse error occurred parsing the parameter declaration,
20296 then the entire parameter-declaration-list is erroneous. */
20298 {
20302 }
20312 {
20316 }
20318 /* Add the new parameter to the list. */
20322 /* Peek at the next token. */
20325 /* These are for Objective-C++ */
20328 /* The parameter-declaration-list is complete. */
20331 {
20334 /* Peek at the next token. */
20336 /* If it's an ellipsis, then the list is complete. */
20339 /* Otherwise, there must be more parameters. Consume the
20340 `,'. */
20342 /* When parsing something like:
20344 int i(float f, double d)
20346 we can tell after seeing the declaration for "f" that we
20347 are not looking at an initialization of a variable "i",
20348 but rather at the declaration of a function "i".
20350 Due to the fact that the parsing of template arguments
20351 (as specified to a template-id) requires backtracking we
20352 cannot use this technique when inside a template argument
20353 list. */
20357 /* However, a parameter-declaration of the form
20358 "float(f)" (which is a valid declaration of a
20359 parameter "f") can also be interpreted as an
20360 expression (the conversion of "f" to "float"). */
20363 }
20364 else
20365 {
20373 }
20374 }
20376 parser->in_unbraced_linkage_specification_p
20379 /* Reset implicit_template_scope if we are about to leave the function
20380 parameter list that introduced it. Note that for out-of-line member
20381 definitions, there will be one or more class scopes before we get to
20382 the template parameter scope. */
20386 {
20390 {
20393 }
20394 }
20397 }
20399 /* Parse a parameter declaration.
20401 parameter-declaration:
20402 decl-specifier-seq ... [opt] declarator
20403 decl-specifier-seq declarator = assignment-expression
20404 decl-specifier-seq ... [opt] abstract-declarator [opt]
20405 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20407 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20408 declares a template parameter. (In that case, a non-nested `>'
20409 token encountered during the parsing of the assignment-expression
20410 is not interpreted as a greater-than operator.)
20412 Returns a representation of the parameter, or NULL if an error
20413 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20414 true iff the declarator is of the form "(p)". */
20420 {
20422 cp_decl_specifier_seq decl_specifiers;
20424 tree default_argument;
20429 /* In a template parameter, `>' is not an operator.
20431 [temp.param]
20433 When parsing a default template-argument for a non-type
20434 template-parameter, the first non-nested `>' is taken as the end
20435 of the template parameter-list rather than a greater-than
20436 operator. */
20438 /* Type definitions may not appear in parameter types. */
20440 parser->type_definition_forbidden_message
20443 /* Parse the declaration-specifiers. */
20445 CP_PARSER_FLAGS_NONE,
20449 /* Complain about missing 'typename' or other invalid type names. */
20454 /* If an error occurred, there's no reason to attempt to parse the
20455 rest of the declaration. */
20457 {
20460 }
20462 /* Peek at the next token. */
20465 /* If the next token is a `)', `,', `=', `>', or `...', then there
20466 is no declarator. However, when variadic templates are enabled,
20467 there may be a declarator following `...'. */
20472 {
20476 }
20477 /* Otherwise, there should be a declarator. */
20478 else
20479 {
20483 /* After seeing a decl-specifier-seq, if the next token is not a
20484 "(", there is no possibility that the code is a valid
20485 expression. Therefore, if parsing tentatively, we commit at
20486 this point. */
20488 /* In an expression context, having seen:
20490 (int((char ...
20492 we cannot be sure whether we are looking at a
20493 function-type (taking a "char" as a parameter) or a cast
20494 of some object of type "char" to "int". */
20500 /* Parse the declarator. */
20503 CP_PARSER_DECLARATOR_EITHER,
20505 parenthesized_p,
20509 /* After the declarator, allow more attributes. */
20510 decl_specifiers.attributes
20514 /* If the declarator is a template parameter pack, remember that and
20515 clear the flag in the declarator itself so we don't get errors
20516 from grokdeclarator. */
20518 {
20521 }
20522 }
20524 /* If the next token is an ellipsis, and we have not seen a declarator
20525 name, and if either the type of the declarator contains parameter
20526 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20527 for, eg, abbreviated integral type names), then we actually have a
20528 parameter pack expansion expression. Otherwise, leave the ellipsis
20529 for a C-style variadic function. */
20532 {
20543 {
20544 /* Consume the `...'. */
20548 /* Build a pack expansion type */
20553 else
20555 }
20556 }
20558 /* The restriction on defining new types applies only to the type
20559 of the parameter, not to the default argument. */
20562 /* If the next token is `=', then process a default argument. */
20564 {
20567 /* If we are defining a class, then the tokens that make up the
20568 default argument must be saved and processed later. */
20574 // A constrained-type-specifier may declare a type template-parameter.
20576 default_argument
20579 // A constrained-type-specifier may declare a template-template-parameter.
20581 default_argument
20584 /* Outside of a class definition, we can just parse the
20585 assignment-expression. */
20586 else
20587 default_argument
20591 {
20593 "default arguments are only "
20595 }
20597 || template_parameter_pack_p
20600 {
20601 /* Find the name of the parameter pack. */
20608 template_parm_p
20614 else
20616 template_parm_p
20623 }
20624 }
20625 else
20629 declarator,
20630 default_argument,
20631 template_parameter_pack_p);
20632 }
20634 /* Parse a default argument and return it.
20636 TEMPLATE_PARM_P is true if this is a default argument for a
20637 non-type template parameter. */
20638 static tree
20640 {
20646 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20647 set correctly. */
20650 /* Local variable names (and the `this' keyword) may not
20651 appear in a default argument. */
20654 /* Parse the assignment-expression. */
20659 /* The "this" pointer is not valid in a default argument. */
20661 {
20666 }
20667 default_argument
20669 /* Restore the "this" pointer. */
20671 {
20674 }
20683 }
20685 /* Parse a function-body.
20687 function-body:
20688 compound_statement */
20690 static void
20692 {
20696 }
20698 /* Parse a ctor-initializer-opt followed by a function-body. Return
20699 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20700 is true we are parsing a function-try-block. */
20702 static bool
20705 {
20713 /* Begin the function body. */
20715 /* Parse the optional ctor-initializer. */
20718 /* If we're parsing a constexpr constructor definition, we need
20719 to check that the constructor body is indeed empty. However,
20720 before we get to cp_parser_function_body lot of junk has been
20721 generated, so we can't just check that we have an empty block.
20722 Rather we take a snapshot of the outermost block, and check whether
20723 cp_parser_function_body changed its state. */
20725 {
20729 }
20730 /* Parse the function-body. */
20734 /* Finish the function body. */
20738 }
20740 /* Parse an initializer.
20742 initializer:
20743 = initializer-clause
20744 ( expression-list )
20746 Returns an expression representing the initializer. If no
20747 initializer is present, NULL_TREE is returned.
20749 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20750 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20751 set to TRUE if there is no initializer present. If there is an
20752 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20753 is set to true; otherwise it is set to false. */
20755 static tree
20758 {
20760 tree init;
20762 /* Peek at the next token. */
20765 /* Let our caller know whether or not this initializer was
20766 parenthesized. */
20768 /* Assume that the initializer is constant. */
20772 {
20773 /* Consume the `='. */
20775 /* Parse the initializer-clause. */
20777 }
20779 {
20784 non_constant_p);
20789 }
20791 {
20796 }
20797 else
20798 {
20799 /* Anything else is an error. */
20802 }
20808 }
20810 /* Parse an initializer-clause.
20812 initializer-clause:
20813 assignment-expression
20814 braced-init-list
20816 Returns an expression representing the initializer.
20818 If the `assignment-expression' production is used the value
20819 returned is simply a representation for the expression.
20821 Otherwise, calls cp_parser_braced_list. */
20823 static cp_expr
20825 {
20826 cp_expr initializer;
20828 /* Assume the expression is constant. */
20831 /* If it is not a `{', then we are looking at an
20832 assignment-expression. */
20834 {
20835 initializer
20838 non_constant_p);
20839 }
20840 else
20844 }
20846 /* Parse a brace-enclosed initializer list.
20848 braced-init-list:
20849 { initializer-list , [opt] }
20850 { }
20852 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20853 the elements of the initializer-list (or NULL, if the last
20854 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20855 NULL_TREE. There is no way to detect whether or not the optional
20856 trailing `,' was provided. NON_CONSTANT_P is as for
20857 cp_parser_initializer. */
20859 static cp_expr
20861 {
20862 tree initializer;
20865 /* Consume the `{' token. */
20867 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20869 /* If it's not a `}', then there is a non-trivial initializer. */
20871 {
20872 /* Parse the initializer list. */
20875 /* A trailing `,' token is allowed. */
20878 }
20879 else
20881 /* Now, there should be a trailing `}'. */
20887 /* Build a location of the form:
20888 { ... }
20889 ^~~~~~~
20890 with caret==start at the open brace, finish at the close brace. */
20894 }
20896 /* Consume tokens up to, and including, the next non-nested closing `]'.
20897 Returns true iff we found a closing `]'. */
20899 static bool
20901 {
20905 {
20909 {
20912 /* If we've run out of tokens, then there is no closing `]'. */
20921 {
20924 }
20929 }
20931 /* Consume the token. */
20933 }
20934 }
20936 /* Return true if we are looking at an array-designator, false otherwise. */
20938 static bool
20940 {
20941 /* Consume the `['. */
20946 /* Skip tokens until the next token is a closing square bracket.
20947 If we find the closing `]', and the next token is a `=', then
20948 we are looking at an array designator. */
20949 bool array_designator_p
20953 /* Roll back the tokens we skipped. */
20957 }
20959 /* Parse an initializer-list.
20961 initializer-list:
20962 initializer-clause ... [opt]
20963 initializer-list , initializer-clause ... [opt]
20965 GNU Extension:
20967 initializer-list:
20968 designation initializer-clause ...[opt]
20969 initializer-list , designation initializer-clause ...[opt]
20971 designation:
20972 . identifier =
20973 identifier :
20974 [ constant-expression ] =
20976 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20977 for the initializer. If the INDEX of the elt is non-NULL, it is the
20978 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20979 as for cp_parser_initializer. */
20983 {
20986 /* Assume all of the expressions are constant. */
20989 /* Parse the rest of the list. */
20991 {
20993 tree designator;
20994 tree initializer;
20997 /* If the next token is an identifier and the following one is a
20998 colon, we are looking at the GNU designated-initializer
20999 syntax. */
21003 {
21004 /* Warn the user that they are using an extension. */
21007 /* Consume the identifier. */
21009 /* Consume the `:'. */
21011 }
21012 /* Also handle the C99 syntax, '. id ='. */
21017 {
21018 /* Warn the user that they are using an extension. */
21021 /* Consume the `.'. */
21023 /* Consume the identifier. */
21025 /* Consume the `='. */
21027 }
21028 /* Also handle C99 array designators, '[ const ] ='. */
21032 {
21033 /* In C++11, [ could start a lambda-introducer. */
21039 {
21042 }
21043 else
21044 {
21049 }
21055 }
21056 else
21059 /* Parse the initializer. */
21062 /* If any clause is non-constant, so is the entire initializer. */
21066 /* If we have an ellipsis, this is an initializer pack
21067 expansion. */
21069 {
21070 /* Consume the `...'. */
21073 /* Turn the initializer into an initializer expansion. */
21075 }
21077 /* Add it to the vector. */
21080 /* If the next token is not a comma, we have reached the end of
21081 the list. */
21085 /* Peek at the next token. */
21087 /* If the next token is a `}', then we're still done. An
21088 initializer-clause can have a trailing `,' after the
21089 initializer-list and before the closing `}'. */
21093 /* Consume the `,' token. */
21095 }
21098 }
21100 /* Classes [gram.class] */
21102 /* Parse a class-name.
21104 class-name:
21105 identifier
21106 template-id
21108 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21109 to indicate that names looked up in dependent types should be
21110 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21111 keyword has been used to indicate that the name that appears next
21112 is a template. TAG_TYPE indicates the explicit tag given before
21113 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21114 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21115 is the class being defined in a class-head. If ENUM_OK is TRUE,
21116 enum-names are also accepted.
21118 Returns the TYPE_DECL representing the class. */
21120 static tree
21129 {
21130 tree decl;
21131 tree scope;
21136 /* All class-names start with an identifier. */
21139 {
21142 }
21144 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21145 to a template-id, so we save it here. */
21150 /* Any name names a type if we're following the `typename' keyword
21151 in a qualified name where the enclosing scope is type-dependent. */
21154 /* Handle the common case (an identifier, but not a template-id)
21155 efficiently. */
21158 {
21162 /* Look for the identifier. */
21166 /* If the next token isn't an identifier, we are certainly not
21167 looking at a class-name. */
21170 /* If we know this is a type-name, there's no need to look it
21171 up. */
21174 else
21175 {
21176 tree ambiguous_decls;
21177 /* If we already know that this lookup is ambiguous, then
21178 we've already issued an error message; there's no reason
21179 to check again. */
21181 {
21184 }
21185 /* If the next token is a `::', then the name must be a type
21186 name.
21188 [basic.lookup.qual]
21190 During the lookup for a name preceding the :: scope
21191 resolution operator, object, function, and enumerator
21192 names are ignored. */
21195 /* Look up the name. */
21197 tag_type,
21200 check_dependency_p,
21204 {
21208 }
21209 }
21210 }
21211 else
21212 {
21213 /* Try a template-id. */
21215 check_dependency_p,
21216 tag_type,
21217 is_declaration);
21220 }
21224 /* If this is a typename, create a TYPENAME_TYPE. */
21226 {
21231 }
21235 /* Check to see that it is really the name of a class. */
21239 /* Situations like this:
21241 template <typename T> struct A {
21242 typename T::template X<int>::I i;
21243 };
21245 are problematic. Is `T::template X<int>' a class-name? The
21246 standard does not seem to be definitive, but there is no other
21247 valid interpretation of the following `::'. Therefore, those
21248 names are considered class-names. */
21249 {
21253 }
21258 /* In Objective-C 2.0, a classname followed by '.' starts a
21259 dot-syntax expression, and it's not a type-name. */
21271 }
21273 /* Parse a class-specifier.
21275 class-specifier:
21276 class-head { member-specification [opt] }
21278 Returns the TREE_TYPE representing the class. */
21280 static tree
21282 {
21283 tree type;
21297 /* Parse the class-head. */
21300 /* If the class-head was a semantic disaster, skip the entire body
21301 of the class. */
21303 {
21307 }
21309 /* Look for the `{'. */
21311 {
21314 }
21319 /* Issue an error message if type-definitions are forbidden here. */
21321 /* Remember that we are defining one more class. */
21323 /* Inside the class, surrounding template-parameter-lists do not
21324 apply. */
21325 saved_num_template_parameter_lists
21328 /* We are not in a function body. */
21331 /* Or in a loop. */
21334 /* Or in a switch. */
21337 /* We are not immediately inside an extern "lang" block. */
21338 saved_in_unbraced_linkage_specification_p
21342 // Associate constraints with the type.
21346 /* Start the class. */
21348 {
21351 }
21355 /* If the type is erroneous, skip the entire body of the class. */
21357 else
21358 /* Parse the member-specification. */
21361 /* Look for the trailing `}'. */
21363 /* Look for trailing attributes to apply to this class. */
21371 /* We've finished a type definition. Check for the common syntax
21372 error of forgetting a semicolon after the definition. We need to
21373 be careful, as we can't just check for not-a-semicolon and be done
21374 with it; the user might have typed:
21376 class X { } c = ...;
21377 class X { } *p = ...;
21379 and so forth. Instead, enumerate all the possible tokens that
21380 might follow this production; if we don't see one of them, then
21381 complain and silently insert the semicolon. */
21382 {
21387 /* Don't try to parse c++11 attributes here. As per the
21388 grammar, that should be a task for
21389 cp_parser_decl_specifier_seq. */
21393 {
21404 /* While it's legal for type qualifiers and storage class
21405 specifiers to follow type definitions in the grammar, only
21406 compiler testsuites contain code like that. Assume that if
21407 we see such code, then what we're really seeing is a case
21408 like:
21410 class X { }
21411 const <type> var = ...;
21413 or
21415 class Y { }
21416 static <type> func (...) ...
21418 i.e. the qualifier or specifier applies to the next
21419 declaration. To do so, however, we need to look ahead one
21420 more token to see if *that* token is a type specifier.
21422 This code could be improved to handle:
21424 class Z { }
21425 static const <type> var = ...; */
21428 {
21431 /* Handling user-defined types here would be nice, but very
21432 tricky. */
21433 want_semicolon
21436 }
21440 }
21442 /* If we don't have a type, then something is very wrong and we
21443 shouldn't try to do anything clever. Likewise for not seeing the
21444 closing brace. */
21446 {
21447 cp_token_position prev
21458 else
21461 /* Unget one token and smash it to look as though we encountered
21462 a semicolon in the input stream. */
21467 }
21468 }
21470 /* If this class is not itself within the scope of another class,
21471 then we need to parse the bodies of all of the queued function
21472 definitions. Note that the queued functions defined in a class
21473 are not always processed immediately following the
21474 class-specifier for that class. Consider:
21476 struct A {
21477 struct B { void f() { sizeof (A); } };
21478 };
21480 If `f' were processed before the processing of `A' were
21481 completed, there would be no way to compute the size of `A'.
21482 Note that the nesting we are interested in here is lexical --
21483 not the semantic nesting given by TYPE_CONTEXT. In particular,
21484 for:
21486 struct A { struct B; };
21487 struct A::B { void f() { } };
21489 there is no need to delay the parsing of `A::B::f'. */
21491 {
21492 tree decl;
21499 /* In a first pass, parse default arguments to the functions.
21500 Then, in a second pass, parse the bodies of the functions.
21501 This two-phased approach handles cases like:
21503 struct S {
21504 void f() { g(); }
21505 void g(int i = 3);
21506 };
21508 */
21510 {
21512 /* If there are default arguments that have not yet been processed,
21513 take care of them now. */
21515 {
21520 }
21521 /* Make sure that any template parameters are in scope. */
21523 /* Parse the default argument expressions. */
21525 /* Remove any template parameters from the symbol table. */
21527 }
21529 /* Now parse any NSDMIs. */
21533 {
21535 {
21540 }
21543 }
21550 /* Now do some post-NSDMI bookkeeping. */
21556 /* Now parse the body of the functions. */
21558 {
21559 /* OpenMP UDRs need to be parsed before all other functions. */
21566 }
21567 else
21571 }
21572 else
21575 /* Put back any saved access checks. */
21578 /* Restore saved state. */
21582 parser->num_template_parameter_lists
21584 parser->in_unbraced_linkage_specification_p
21588 }
21590 static tree
21592 {
21593 tree ret;
21598 }
21600 /* Parse a class-head.
21602 class-head:
21603 class-key identifier [opt] base-clause [opt]
21604 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21605 class-key nested-name-specifier [opt] template-id
21606 base-clause [opt]
21608 class-virt-specifier:
21609 final
21611 GNU Extensions:
21612 class-key attributes identifier [opt] base-clause [opt]
21613 class-key attributes nested-name-specifier identifier base-clause [opt]
21614 class-key attributes nested-name-specifier [opt] template-id
21615 base-clause [opt]
21617 Upon return BASES is initialized to the list of base classes (or
21618 NULL, if there are none) in the same form returned by
21619 cp_parser_base_clause.
21621 Returns the TYPE of the indicated class. Sets
21622 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21623 involving a nested-name-specifier was used, and FALSE otherwise.
21625 Returns error_mark_node if this is not a class-head.
21627 Returns NULL_TREE if the class-head is syntactically valid, but
21628 semantically invalid in a way that means we should skip the entire
21629 body of the class. */
21631 static tree
21634 {
21635 tree nested_name_specifier;
21639 tree attributes;
21640 tree bases;
21650 /* Assume no nested-name-specifier will be present. */
21652 /* Assume no template parameter lists will be used in defining the
21653 type. */
21657 /* Look for the class-key. */
21664 /* Parse the attributes. */
21667 /* If the next token is `::', that is invalid -- but sometimes
21668 people do try to write:
21670 struct ::S {};
21672 Handle this gracefully by accepting the extra qualifier, and then
21673 issuing an error about it later if this really is a
21674 class-head. If it turns out just to be an elaborated type
21675 specifier, remain silent. */
21681 /* Determine the name of the class. Begin by looking for an
21682 optional nested-name-specifier. */
21684 nested_name_specifier
21690 /* If there was a nested-name-specifier, then there *must* be an
21691 identifier. */
21693 {
21695 /* Although the grammar says `identifier', it really means
21696 `class-name' or `template-name'. You are only allowed to
21697 define a class that has already been declared with this
21698 syntax.
21700 The proposed resolution for Core Issue 180 says that wherever
21701 you see `class T::X' you should treat `X' as a type-name.
21703 It is OK to define an inaccessible class; for example:
21705 class A { class B; };
21706 class A::B {};
21708 We do not know if we will see a class-name, or a
21709 template-name. We look for a class-name first, in case the
21710 class-name is a template-id; if we looked for the
21711 template-name first we would stop after the template-name. */
21716 class_type,
21720 /* If that didn't work, ignore the nested-name-specifier. */
21722 {
21728 }
21729 /* If we could not find a corresponding TYPE, treat this
21730 declaration like an unqualified declaration. */
21733 /* Otherwise, count the number of templates used in TYPE and its
21734 containing scopes. */
21735 else
21736 {
21737 tree scope;
21749 }
21750 }
21751 /* Otherwise, the identifier is optional. */
21752 else
21753 {
21754 /* We don't know whether what comes next is a template-id,
21755 an identifier, or nothing at all. */
21757 /* Check for a template-id. */
21762 class_key,
21764 /* If that didn't work, it could still be an identifier. */
21766 {
21768 {
21771 }
21772 else
21774 }
21775 else
21776 {
21779 }
21780 }
21785 {
21787 class_key,
21789 }
21792 /* If it's not a `:' or a `{' then we can't really be looking at a
21793 class-head, since a class-head only appears as part of a
21794 class-specifier. We have to detect this situation before calling
21795 xref_tag, since that has irreversible side-effects. */
21797 {
21801 }
21803 /* At this point, we're going ahead with the class-specifier, even
21804 if some other problem occurs. */
21807 {
21812 }
21813 /* Issue the error about the overly-qualified name now. */
21815 {
21820 }
21822 {
21827 }
21829 {
21830 tree scope;
21832 /* Reject typedef-names in class heads. */
21834 {
21837 type);
21840 }
21842 /* Figure out in what scope the declaration is being placed. */
21844 /* If that scope does not contain the scope in which the
21845 class was originally declared, the program is invalid. */
21847 {
21850 "declaration of %qD in namespace %qD which does not "
21853 else
21859 }
21860 /* [dcl.meaning]
21862 A declarator-id shall not be qualified except for the
21863 definition of a ... nested class outside of its class
21864 ... [or] the definition or explicit instantiation of a
21865 class member of a namespace outside of its namespace. */
21867 {
21872 }
21873 }
21874 /* An explicit-specialization must be preceded by "template <>". If
21875 it is not, try to recover gracefully. */
21879 {
21880 /* Build a location of this form:
21881 struct typename <ARGS>
21882 ^~~~~~~~~~~~~~~~~~~~~~
21883 with caret==start at the start token, and
21884 finishing at the end of the type. */
21885 location_t reported_loc
21887 class_head_start_location,
21891 error_at_rich_loc
21895 /* Take the same action that would have been taken by
21896 cp_parser_explicit_specialization. */
21899 }
21900 /* There must be no "return" statements between this point and the
21901 end of this function; set "type "to the correct return value and
21902 use "goto done;" to return. */
21903 /* Make sure that the right number of template parameters were
21904 present. */
21908 {
21909 /* If something went wrong, there is no point in even trying to
21910 process the class-definition. */
21913 }
21915 /* Look up the type. */
21917 {
21921 {
21925 }
21926 else
21927 {
21930 }
21933 }
21935 {
21936 tree class_type;
21938 /* Given:
21940 template <typename T> struct S { struct T };
21941 template <typename T> struct S<T>::T { };
21943 we will get a TYPENAME_TYPE when processing the definition of
21944 `S::T'. We need to resolve it to the actual type before we
21945 try to define it. */
21947 {
21952 else
21953 {
21956 }
21957 }
21961 {
21964 }
21967 /* Enter the scope indicated by the nested-name-specifier. */
21969 /* Get the canonical version of this type. */
21971 /* Call push_template_decl if it seems like we should be defining a
21972 template either from the template headers or the type we're
21973 defining, so that we diagnose both extra and missing headers. */
21977 {
21980 {
21983 }
21984 }
21988 }
21990 {
21991 /* If the class was unnamed, create a dummy name. */
21996 }
21998 /* Indicate whether this class was declared as a `class' or as a
21999 `struct'. */
22004 /* If this type was already complete, and we see another definition,
22005 that's an error. */
22007 {
22009 type);
22011 type);
22014 }
22019 {
22020 /* Apply attributes now, before any use of the class as a template
22021 argument in its base list. */
22024 }
22026 /* We will have entered the scope containing the class; the names of
22027 base classes should be looked up in that context. For example:
22029 struct A { struct B {}; struct C; };
22030 struct A::C : B {};
22032 is valid. */
22034 /* Get the list of base-classes, if there is one. */
22036 {
22037 /* PR59482: enter the class scope so that base-specifiers are looked
22038 up correctly. */
22042 /* PR59482: get out of the previously pushed class scope so that the
22043 subsequent pops pop the right thing. */
22046 }
22047 else
22050 /* If we're really defining a class, process the base classes.
22051 If they're invalid, fail. */
22056 done:
22057 /* Leave the scope given by the nested-name-specifier. We will
22058 enter the class scope itself while processing the members. */
22063 {
22066 }
22072 out:
22075 }
22077 /* Parse a class-key.
22079 class-key:
22080 class
22081 struct
22082 union
22084 Returns the kind of class-key specified, or none_type to indicate
22085 error. */
22087 static enum tag_types
22089 {
22093 /* Look for the class-key. */
22098 /* Check to see if the TOKEN is a class-key. */
22103 }
22105 /* Parse a type-parameter-key.
22107 type-parameter-key:
22108 class
22109 typename
22110 */
22112 static void
22114 {
22115 /* Look for the type-parameter-key. */
22119 {
22122 /* typename is not allowed in a template template parameter
22123 by the standard until C++1Z. */
22125 "ISO C++ forbids typename key in template template parameter;"
22127 }
22128 else
22132 }
22134 /* Parse an (optional) member-specification.
22136 member-specification:
22137 member-declaration member-specification [opt]
22138 access-specifier : member-specification [opt] */
22140 static void
22142 {
22144 {
22148 /* Peek at the next token. */
22150 /* If it's a `}', or EOF then we've seen all the members. */
22156 /* See if this token is a keyword. */
22159 {
22163 /* Consume the access-specifier. */
22165 /* Remember which access-specifier is active. */
22167 /* Look for the `:'. */
22172 /* Accept #pragmas at class scope. */
22174 {
22177 }
22179 /* Otherwise, the next construction must be a
22180 member-declaration. */
22182 }
22183 }
22184 }
22186 /* Parse a member-declaration.
22188 member-declaration:
22189 decl-specifier-seq [opt] member-declarator-list [opt] ;
22190 function-definition ; [opt]
22191 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22192 using-declaration
22193 template-declaration
22194 alias-declaration
22196 member-declarator-list:
22197 member-declarator
22198 member-declarator-list , member-declarator
22200 member-declarator:
22201 declarator pure-specifier [opt]
22202 declarator constant-initializer [opt]
22203 identifier [opt] : constant-expression
22205 GNU Extensions:
22207 member-declaration:
22208 __extension__ member-declaration
22210 member-declarator:
22211 declarator attributes [opt] pure-specifier [opt]
22212 declarator attributes [opt] constant-initializer [opt]
22213 identifier [opt] attributes [opt] : constant-expression
22215 C++0x Extensions:
22217 member-declaration:
22218 static_assert-declaration */
22220 static void
22222 {
22223 cp_decl_specifier_seq decl_specifiers;
22224 tree prefix_attributes;
22225 tree decl;
22234 /* Check for the `__extension__' keyword. */
22236 {
22237 /* Recurse. */
22239 /* Restore the old value of the PEDANTIC flag. */
22243 }
22245 /* Check for a template-declaration. */
22247 {
22248 /* An explicit specialization here is an error condition, and we
22249 expect the specialization handler to detect and report this. */
22253 else
22257 }
22258 /* Check for a template introduction. */
22262 /* Check for a using-declaration. */
22264 {
22266 {
22267 /* Parse the using-declaration. */
22271 }
22272 else
22273 {
22274 tree decl;
22278 /* Note that if we actually see the '=' token after the
22279 identifier, cp_parser_alias_declaration commits the
22280 tentative parse. In that case, we really expect an
22281 alias-declaration. Otherwise, we expect a using
22282 declaration. */
22283 alias_decl_expected =
22289 else
22293 }
22294 }
22296 /* Check for @defs. */
22298 {
22303 {
22308 }
22310 }
22312 /* If the next token is `static_assert' we have a static assertion. */
22314 {
22317 }
22324 /* Parse the decl-specifier-seq. */
22327 CP_PARSER_FLAGS_OPTIONAL,
22330 /* Check for an invalid type-name. */
22334 /* If there is no declarator, then the decl-specifier-seq should
22335 specify a type. */
22337 {
22338 /* If there was no decl-specifier-seq, and the next token is a
22339 `;', then we have something like:
22341 struct S { ; };
22343 [class.mem]
22345 Each member-declaration shall declare at least one member
22346 name of the class. */
22348 {
22352 }
22353 else
22354 {
22355 tree type;
22357 /* See if this declaration is a friend. */
22359 /* If there were decl-specifiers, check to see if there was
22360 a class-declaration. */
22363 /* Nested classes have already been added to the class, but
22364 a `friend' needs to be explicitly registered. */
22366 {
22367 /* If the `friend' keyword was present, the friend must
22368 be introduced with a class-key. */
22371 "in C++03 a class-key must be used "
22373 /* In this case:
22375 template <typename T> struct A {
22376 friend struct A<T>::B;
22377 };
22379 A<T>::B will be represented by a TYPENAME_TYPE, and
22380 therefore not recognized by check_tag_decl. */
22382 {
22386 }
22389 "friend declaration does not name a class or "
22391 else
22394 }
22395 /* If there is no TYPE, an error message will already have
22396 been issued. */
22398 ;
22399 /* An anonymous aggregate has to be handled specially; such
22400 a declaration really declares a data member (with a
22401 particular type), as opposed to a nested class. */
22403 {
22404 /* C++11 9.5/6. */
22407 "a storage class on an anonymous aggregate "
22410 /* Remove constructors and such from TYPE, now that we
22411 know it is an anonymous aggregate. */
22413 /* And make the corresponding data member. */
22416 /* Add it to the class. */
22418 }
22419 else
22420 cp_parser_check_access_in_redeclaration
22423 }
22424 }
22425 else
22426 {
22429 /* Clear attributes from the decl_specifiers but keep them
22430 around as prefix attributes that apply them to the entity
22431 being declared. */
22435 /* See if these declarations will be friends. */
22438 /* Keep going until we hit the `;' at the end of the
22439 declaration. */
22441 {
22443 tree first_attribute;
22445 /* Peek at the next token. */
22448 /* Check for a bitfield declaration. */
22453 {
22454 tree identifier;
22455 tree width;
22457 /* Get the name of the bitfield. Note that we cannot just
22458 check TOKEN here because it may have been invalidated by
22459 the call to cp_lexer_peek_nth_token above. */
22462 else
22465 /* Consume the `:' token. */
22467 /* Get the width of the bitfield. */
22468 width
22471 /* Look for attributes that apply to the bitfield. */
22473 /* Remember which attributes are prefix attributes and
22474 which are not. */
22476 /* Combine the attributes. */
22479 /* Create the bitfield declaration. */
22482 identifier,
22483 sfk_none)
22486 width,
22487 attributes);
22488 }
22489 else
22490 {
22492 tree initializer;
22493 tree asm_specification;
22496 /* Parse the declarator. */
22497 declarator
22502 friend_p);
22504 /* If something went wrong parsing the declarator, make sure
22505 that we at least consume some tokens. */
22507 {
22508 /* Skip to the end of the statement. */
22510 /* If the next token is not a semicolon, that is
22511 probably because we just skipped over the body of
22512 a function. So, we consume a semicolon if
22513 present, but do not issue an error message if it
22514 is not present. */
22516 CPP_SEMICOLON))
22519 }
22522 cp_parser_check_for_definition_in_return_type
22526 /* Look for an asm-specification. */
22528 /* Look for attributes that apply to the declaration. */
22530 /* Remember which attributes are prefix attributes and
22531 which are not. */
22533 /* Combine the attributes. */
22536 /* If it's an `=', then we have a constant-initializer or a
22537 pure-specifier. It is not correct to parse the
22538 initializer before registering the member declaration
22539 since the member declaration should be in scope while
22540 its initializer is processed. However, the rest of the
22541 front end does not yet provide an interface that allows
22542 us to handle this correctly. */
22544 {
22545 /* In [class.mem]:
22547 A pure-specifier shall be used only in the declaration of
22548 a virtual function.
22550 A member-declarator can contain a constant-initializer
22551 only if it declares a static member of integral or
22552 enumeration type.
22554 Therefore, if the DECLARATOR is for a function, we look
22555 for a pure-specifier; otherwise, we look for a
22556 constant-initializer. When we call `grokfield', it will
22557 perform more stringent semantics checks. */
22569 {
22571 /* Don't require a constant rvalue in C++11, since we
22572 might want a reference constant. We'll enforce
22573 constancy later. */
22575 /* Parse the initializer. */
22578 }
22579 else
22580 /* Parse the initializer. */
22582 }
22585 {
22589 else
22591 }
22592 /* Otherwise, there is no initializer. */
22593 else
22596 /* See if we are probably looking at a function
22597 definition. We are certainly not looking at a
22598 member-declarator. Calling `grokfield' has
22599 side-effects, so we must not do it unless we are sure
22600 that we are looking at a member-declarator. */
22603 {
22604 /* The grammar does not allow a pure-specifier to be
22605 used when a member function is defined. (It is
22606 possible that this fact is an oversight in the
22607 standard, since a pure function may be defined
22608 outside of the class-specifier. */
22614 declarator,
22615 attributes);
22618 /* If the member was not a friend, declare it here. */
22621 /* Peek at the next token. */
22623 /* If the next token is a semicolon, consume it. */
22627 }
22628 else
22631 /* Create the declaration. */
22636 {
22639 else
22641 }
22642 }
22647 /* Reset PREFIX_ATTRIBUTES. */
22653 /* If there is any qualification still in effect, clear it
22654 now; we will be starting fresh with the next declarator. */
22658 /* If it's a `,', then there are more declarators. */
22660 {
22663 {
22667 }
22668 }
22669 /* If the next token isn't a `;', then we have a parse error. */
22671 CPP_SEMICOLON))
22672 {
22673 /* The next token might be a ways away from where the
22674 actual semicolon is missing. Find the previous token
22675 and use that for our error position. */
22680 /* Assume that the user meant to provide a semicolon. If
22681 we were to cp_parser_skip_to_end_of_statement, we might
22682 skip to a semicolon inside a member function definition
22683 and issue nonsensical error messages. */
22685 }
22688 {
22689 /* Add DECL to the list of members. */
22691 /* Explicitly include, eg, NSDMIs, for better error
22692 recovery (c++/58650). */
22701 /* Add DECL to the queue of NSDMI to be parsed later. */
22703 }
22707 }
22708 }
22711 out:
22713 }
22715 /* Parse a pure-specifier.
22717 pure-specifier:
22718 = 0
22720 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22721 Otherwise, ERROR_MARK_NODE is returned. */
22723 static tree
22725 {
22728 /* Look for the `=' token. */
22731 /* Look for the `0' token. */
22740 /* Accept = default or = delete in c++0x mode. */
22743 {
22746 }
22748 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22750 {
22755 }
22757 {
22760 }
22763 }
22765 /* Parse a constant-initializer.
22767 constant-initializer:
22768 = constant-expression
22770 Returns a representation of the constant-expression. */
22772 static tree
22774 {
22775 /* Look for the `=' token. */
22779 /* It is invalid to write:
22781 struct S { static const int i = { 7 }; };
22783 */
22785 {
22788 /* Consume the opening brace. */
22790 /* Skip the initializer. */
22792 /* Look for the trailing `}'. */
22796 }
22799 }
22801 /* Derived classes [gram.class.derived] */
22803 /* Parse a base-clause.
22805 base-clause:
22806 : base-specifier-list
22808 base-specifier-list:
22809 base-specifier ... [opt]
22810 base-specifier-list , base-specifier ... [opt]
22812 Returns a TREE_LIST representing the base-classes, in the order in
22813 which they were declared. The representation of each node is as
22814 described by cp_parser_base_specifier.
22816 In the case that no bases are specified, this function will return
22817 NULL_TREE, not ERROR_MARK_NODE. */
22819 static tree
22821 {
22824 /* Look for the `:' that begins the list. */
22827 /* Scan the base-specifier-list. */
22829 {
22831 tree base;
22834 /* Look for the base-specifier. */
22836 /* Look for the (optional) ellipsis. */
22838 {
22839 /* Consume the `...'. */
22843 }
22845 /* Add BASE to the front of the list. */
22847 {
22849 /* Make this a pack expansion type. */
22853 {
22856 }
22857 }
22858 /* Peek at the next token. */
22860 /* If it's not a comma, then the list is complete. */
22863 /* Consume the `,'. */
22865 }
22867 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22868 base class had a qualified name. However, the next name that
22869 appears is certainly not qualified. */
22875 }
22877 /* Parse a base-specifier.
22879 base-specifier:
22880 :: [opt] nested-name-specifier [opt] class-name
22881 virtual access-specifier [opt] :: [opt] nested-name-specifier
22882 [opt] class-name
22883 access-specifier virtual [opt] :: [opt] nested-name-specifier
22884 [opt] class-name
22886 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22887 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22888 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22889 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22891 static tree
22893 {
22901 tree type;
22903 /* Process the optional `virtual' and `access-specifier'. */
22905 {
22906 /* Peek at the next token. */
22908 /* Process `virtual'. */
22910 {
22912 /* If `virtual' appears more than once, issue an error. */
22914 {
22918 }
22922 /* Consume the `virtual' token. */
22930 /* If more than one access specifier appears, issue an
22931 error. */
22934 {
22938 }
22942 /* Consume the access-specifier. */
22950 }
22951 }
22952 /* It is not uncommon to see programs mechanically, erroneously, use
22953 the 'typename' keyword to denote (dependent) qualified types
22954 as base classes. */
22956 {
22961 else
22963 "keyword %<typename%> not allowed in this context "
22966 }
22968 /* Look for the optional `::' operator. */
22970 /* Look for the nested-name-specifier. The simplest way to
22971 implement:
22973 [temp.res]
22975 The keyword `typename' is not permitted in a base-specifier or
22976 mem-initializer; in these contexts a qualified name that
22977 depends on a template-parameter is implicitly assumed to be a
22978 type name.
22980 is to pretend that we have seen the `typename' keyword at this
22981 point. */
22985 typename_type,
22987 /* If the base class is given by a qualified name, assume that names
22988 we see are type names or templates, as appropriate. */
22994 /* DR 950 allows decltype as a base-specifier. */
22996 else
22997 {
22998 /* Otherwise, look for the class-name. */
23000 class_scope_p,
23001 template_p,
23002 typename_type,
23007 }
23013 }
23015 /* Exception handling [gram.exception] */
23017 /* Parse an (optional) noexcept-specification.
23019 noexcept-specification:
23020 noexcept ( constant-expression ) [opt]
23022 If no noexcept-specification is present, returns NULL_TREE.
23023 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23024 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23025 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23026 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23027 in which case a boolean condition is returned instead. */
23029 static tree
23034 {
23038 /* Peek at the next token. */
23041 /* Is it a noexcept-specification? */
23043 {
23044 tree expr;
23048 {
23052 {
23053 /* Types may not be defined in an exception-specification. */
23055 parser->type_definition_forbidden_message
23060 /* Restore the saved message. */
23062 }
23063 else
23064 {
23067 }
23070 }
23071 else
23072 {
23076 }
23078 /* We cannot build a noexcept-spec right away because this will check
23079 that expr is a constexpr. */
23082 else
23084 }
23085 else
23087 }
23089 /* Parse an (optional) exception-specification.
23091 exception-specification:
23092 throw ( type-id-list [opt] )
23094 Returns a TREE_LIST representing the exception-specification. The
23095 TREE_VALUE of each node is a type. */
23097 static tree
23099 {
23101 tree type_id_list;
23104 /* Peek at the next token. */
23107 /* Is it a noexcept-specification? */
23113 /* If it's not `throw', then there's no exception-specification. */
23117 #if 0
23118 /* Enable this once a lot of code has transitioned to noexcept? */
23122 #endif
23124 /* Consume the `throw'. */
23127 /* Look for the `('. */
23130 /* Peek at the next token. */
23132 /* If it's not a `)', then there is a type-id-list. */
23134 {
23135 /* Types may not be defined in an exception-specification. */
23137 parser->type_definition_forbidden_message
23139 /* Parse the type-id-list. */
23141 /* Restore the saved message. */
23143 }
23144 else
23147 /* Look for the `)'. */
23151 }
23153 /* Parse an (optional) type-id-list.
23155 type-id-list:
23156 type-id ... [opt]
23157 type-id-list , type-id ... [opt]
23159 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23160 in the order that the types were presented. */
23162 static tree
23164 {
23168 {
23170 tree type;
23174 /* Get the next type-id. */
23176 /* Check for invalid 'auto'. */
23178 {
23182 }
23183 /* Parse the optional ellipsis. */
23185 {
23186 /* Consume the `...'. */
23189 /* Turn the type into a pack expansion expression. */
23191 }
23192 /* Add it to the list. */
23194 /* Peek at the next token. */
23196 /* If it is not a `,', we are done. */
23199 /* Consume the `,'. */
23201 }
23204 }
23206 /* Parse a try-block.
23208 try-block:
23209 try compound-statement handler-seq */
23211 static tree
23213 {
23214 tree try_block;
23228 }
23230 /* Parse a function-try-block.
23232 function-try-block:
23233 try ctor-initializer [opt] function-body handler-seq */
23235 static bool
23237 {
23238 tree compound_stmt;
23239 tree try_block;
23242 /* Look for the `try' keyword. */
23245 /* Let the rest of the front end know where we are. */
23247 /* Parse the function-body. */
23248 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23250 /* We're done with the `try' part. */
23252 /* Parse the handlers. */
23254 /* We're done with the handlers. */
23258 }
23260 /* Parse a handler-seq.
23262 handler-seq:
23263 handler handler-seq [opt] */
23265 static void
23267 {
23269 {
23272 /* Parse the handler. */
23274 /* Peek at the next token. */
23276 /* If it's not `catch' then there are no more handlers. */
23279 }
23280 }
23282 /* Parse a handler.
23284 handler:
23285 catch ( exception-declaration ) compound-statement */
23287 static void
23289 {
23290 tree handler;
23291 tree declaration;
23301 }
23303 /* Parse an exception-declaration.
23305 exception-declaration:
23306 type-specifier-seq declarator
23307 type-specifier-seq abstract-declarator
23308 type-specifier-seq
23309 ...
23311 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23312 ellipsis variant is used. */
23314 static tree
23316 {
23317 cp_decl_specifier_seq type_specifiers;
23321 /* If it's an ellipsis, it's easy to handle. */
23323 {
23324 /* Consume the `...' token. */
23327 }
23329 /* Types may not be defined in exception-declarations. */
23331 parser->type_definition_forbidden_message
23334 /* Parse the type-specifier-seq. */
23338 /* If it's a `)', then there is no declarator. */
23341 else
23348 /* Restore the saved message. */
23355 }
23357 /* Parse a throw-expression.
23359 throw-expression:
23360 throw assignment-expression [opt]
23362 Returns a THROW_EXPR representing the throw-expression. */
23364 static tree
23366 {
23367 tree expression;
23372 /* Figure out whether or not there is an assignment-expression
23373 following the "throw" keyword. */
23381 else
23385 }
23387 /* GNU Extensions */
23389 /* Parse an (optional) asm-specification.
23391 asm-specification:
23392 asm ( string-literal )
23394 If the asm-specification is present, returns a STRING_CST
23395 corresponding to the string-literal. Otherwise, returns
23396 NULL_TREE. */
23398 static tree
23400 {
23402 tree asm_specification;
23404 /* Peek at the next token. */
23406 /* If the next token isn't the `asm' keyword, then there's no
23407 asm-specification. */
23411 /* Consume the `asm' token. */
23413 /* Look for the `('. */
23416 /* Look for the string-literal. */
23419 /* Look for the `)'. */
23423 }
23425 /* Parse an asm-operand-list.
23427 asm-operand-list:
23428 asm-operand
23429 asm-operand-list , asm-operand
23431 asm-operand:
23432 string-literal ( expression )
23433 [ string-literal ] string-literal ( expression )
23435 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23436 each node is the expression. The TREE_PURPOSE is itself a
23437 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23438 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23439 is a STRING_CST for the string literal before the parenthesis. Returns
23440 ERROR_MARK_NODE if any of the operands are invalid. */
23442 static tree
23444 {
23449 {
23450 tree string_literal;
23451 tree expression;
23452 tree name;
23455 {
23456 /* Consume the `[' token. */
23458 /* Read the operand name. */
23463 /* Look for the closing `]'. */
23465 }
23466 else
23468 /* Look for the string-literal. */
23471 /* Look for the `('. */
23473 /* Parse the expression. */
23475 /* Look for the `)'. */
23483 /* Add this operand to the list. */
23485 expression,
23486 asm_operands);
23487 /* If the next token is not a `,', there are no more
23488 operands. */
23491 /* Consume the `,'. */
23493 }
23496 }
23498 /* Parse an asm-clobber-list.
23500 asm-clobber-list:
23501 string-literal
23502 asm-clobber-list , string-literal
23504 Returns a TREE_LIST, indicating the clobbers in the order that they
23505 appeared. The TREE_VALUE of each node is a STRING_CST. */
23507 static tree
23509 {
23513 {
23514 tree string_literal;
23516 /* Look for the string literal. */
23518 /* Add it to the list. */
23520 /* If the next token is not a `,', then the list is
23521 complete. */
23524 /* Consume the `,' token. */
23526 }
23529 }
23531 /* Parse an asm-label-list.
23533 asm-label-list:
23534 identifier
23535 asm-label-list , identifier
23537 Returns a TREE_LIST, indicating the labels in the order that they
23538 appeared. The TREE_VALUE of each node is a label. */
23540 static tree
23542 {
23546 {
23549 /* Look for the identifier. */
23552 {
23555 {
23561 }
23562 }
23563 /* If the next token is not a `,', then the list is
23564 complete. */
23567 /* Consume the `,' token. */
23569 }
23572 }
23574 /* Return TRUE iff the next tokens in the stream are possibly the
23575 beginning of a GNU extension attribute. */
23577 static bool
23579 {
23581 }
23583 /* Return TRUE iff the next tokens in the stream are possibly the
23584 beginning of a standard C++-11 attribute specifier. */
23586 static bool
23588 {
23590 }
23592 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23593 beginning of a standard C++-11 attribute specifier. */
23595 static bool
23597 {
23605 }
23607 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23608 beginning of a GNU extension attribute. */
23610 static bool
23612 {
23616 }
23618 /* Return true iff the next tokens can be the beginning of either a
23619 GNU attribute list, or a standard C++11 attribute sequence. */
23621 static bool
23623 {
23626 }
23628 /* Return true iff the next Nth tokens can be the beginning of either
23629 a GNU attribute list, or a standard C++11 attribute sequence. */
23631 static bool
23633 {
23636 }
23638 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23639 of GNU attributes, or return NULL. */
23641 static tree
23643 {
23647 }
23649 #define CILK_SIMD_FN_CLAUSE_MASK \
23650 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23651 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23652 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23653 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23654 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23656 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23657 vector [(<clauses>)] */
23659 static void
23661 {
23665 {
23670 }
23673 {
23676 paren_scope++;
23677 }
23679 {
23682 paren_scope++;
23684 paren_scope--;
23685 /* Do not push the last ')' */
23688 }
23697 }
23699 /* Parse an (optional) series of attributes.
23701 attributes:
23702 attributes attribute
23704 attribute:
23705 __attribute__ (( attribute-list [opt] ))
23707 The return value is as for cp_parser_gnu_attribute_list. */
23709 static tree
23711 {
23715 {
23717 tree attribute_list;
23720 /* Peek at the next token. */
23722 /* If it's not `__attribute__', then we're done. */
23726 /* Consume the `__attribute__' keyword. */
23728 /* Look for the two `(' tokens. */
23732 /* Peek at the next token. */
23735 /* Parse the attribute-list. */
23737 else
23738 /* If the next token is a `)', then there is no attribute
23739 list. */
23742 /* Look for the two `)' tokens. */
23750 /* Add these new attributes to the list. */
23752 }
23755 }
23757 /* Parse a GNU attribute-list.
23759 attribute-list:
23760 attribute
23761 attribute-list , attribute
23763 attribute:
23764 identifier
23765 identifier ( identifier )
23766 identifier ( identifier , expression-list )
23767 identifier ( expression-list )
23769 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23770 to an attribute. The TREE_PURPOSE of each node is the identifier
23771 indicating which attribute is in use. The TREE_VALUE represents
23772 the arguments, if any. */
23774 static tree
23776 {
23782 {
23784 tree identifier;
23785 tree attribute;
23787 /* Look for the identifier. We also allow keywords here; for
23788 example `__attribute__ ((const))' is legal. */
23792 {
23795 /* Consume the token, but save it since we need it for the
23796 SIMD enabled function parsing. */
23799 /* Save away the identifier that indicates which attribute
23800 this is. */
23802 /* For keywords, use the canonical spelling, not the
23803 parsed identifier. */
23809 /* Peek at the next token. */
23811 /* If it's an `(', then parse the attribute arguments. */
23813 {
23818 {
23821 }
23822 else
23823 vec = cp_parser_parenthesized_expression_list
23829 else
23830 {
23833 }
23834 /* Save the arguments away. */
23836 }
23838 {
23841 }
23844 {
23845 /* Add this attribute to the list. */
23848 }
23851 }
23852 /* Now, look for more attributes. If the next token isn't a
23853 `,', we're done. */
23857 /* Consume the comma and keep going. */
23859 }
23862 /* We built up the list in reverse order. */
23864 }
23866 /* Parse a standard C++11 attribute.
23868 The returned representation is a TREE_LIST which TREE_PURPOSE is
23869 the scoped name of the attribute, and the TREE_VALUE is its
23870 arguments list.
23872 Note that the scoped name of the attribute is itself a TREE_LIST
23873 which TREE_PURPOSE is the namespace of the attribute, and
23874 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23875 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23876 and which TREE_PURPOSE is directly the attribute name.
23878 Clients of the attribute code should use get_attribute_namespace
23879 and get_attribute_name to get the actual namespace and name of
23880 attributes, regardless of their being GNU or C++11 attributes.
23882 attribute:
23883 attribute-token attribute-argument-clause [opt]
23885 attribute-token:
23886 identifier
23887 attribute-scoped-token
23889 attribute-scoped-token:
23890 attribute-namespace :: identifier
23892 attribute-namespace:
23893 identifier
23895 attribute-argument-clause:
23896 ( balanced-token-seq )
23898 balanced-token-seq:
23899 balanced-token [opt]
23900 balanced-token-seq balanced-token
23902 balanced-token:
23903 ( balanced-token-seq )
23904 [ balanced-token-seq ]
23905 { balanced-token-seq }. */
23907 static tree
23909 {
23913 /* First, parse name of the attribute, a.k.a attribute-token. */
23930 {
23931 /* We are seeing a scoped attribute token. */
23941 else
23942 {
23946 }
23948 NULL_TREE);
23950 }
23951 else
23952 {
23954 NULL_TREE);
23955 /* C++11 noreturn attribute is equivalent to GNU's. */
23958 /* C++14 deprecated attribute is equivalent to GNU's. */
23960 {
23963 "%<deprecated%> is a C++14 feature;"
23966 }
23967 /* Transactional Memory TS optimize_for_synchronized attribute is
23968 equivalent to GNU transaction_callable. */
23972 /* Transactional Memory attributes are GNU attributes. */
23975 }
23977 /* Now parse the optional argument clause of the attribute. */
23982 {
23988 /* A GNU attribute that takes an identifier in parameter. */
23991 vec = cp_parser_parenthesized_expression_list
23997 else
23998 {
24001 }
24005 else
24007 }
24010 }
24012 /* Check that the attribute ATTRIBUTE appears at most once in the
24013 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24014 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24015 isn't implemented yet in GCC. */
24017 static void
24019 {
24021 {
24031 }
24032 }
24034 /* Parse a list of standard C++-11 attributes.
24036 attribute-list:
24037 attribute [opt]
24038 attribute-list , attribute[opt]
24039 attribute ...
24040 attribute-list , attribute ...
24041 */
24043 static tree
24045 {
24050 {
24055 {
24059 }
24062 {
24067 }
24071 }
24074 }
24076 /* Parse a standard C++-11 attribute specifier.
24078 attribute-specifier:
24079 [ [ attribute-list ] ]
24080 alignment-specifier
24082 alignment-specifier:
24083 alignas ( type-id ... [opt] )
24084 alignas ( alignment-expression ... [opt] ). */
24086 static tree
24088 {
24094 {
24103 else
24104 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24105 when we are sure that we have actually parsed them. */
24107 }
24108 else
24109 {
24110 tree alignas_expr;
24112 /* Look for an alignment-specifier. */
24124 {
24127 }
24133 {
24137 alignas_expr =
24144 }
24150 {
24153 }
24156 {
24159 }
24161 /* Build the C++-11 representation of an 'aligned'
24162 attribute. */
24163 attributes =
24166 alignas_expr);
24167 }
24170 }
24172 /* Parse a standard C++-11 attribute-specifier-seq.
24174 attribute-specifier-seq:
24175 attribute-specifier-seq [opt] attribute-specifier
24176 */
24178 static tree
24180 {
24185 {
24194 else
24197 }
24200 }
24202 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24203 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24204 current value of the PEDANTIC flag, regardless of whether or not
24205 the `__extension__' keyword is present. The caller is responsible
24206 for restoring the value of the PEDANTIC flag. */
24208 static bool
24210 {
24211 /* Save the old value of the PEDANTIC flag. */
24215 {
24216 /* Consume the `__extension__' token. */
24218 /* We're not being pedantic while the `__extension__' keyword is
24219 in effect. */
24223 }
24226 }
24228 /* Parse a label declaration.
24230 label-declaration:
24231 __label__ label-declarator-seq ;
24233 label-declarator-seq:
24234 identifier , label-declarator-seq
24235 identifier */
24237 static void
24239 {
24240 /* Look for the `__label__' keyword. */
24244 {
24245 tree identifier;
24247 /* Look for an identifier. */
24249 /* If we failed, stop. */
24252 /* Declare it as a label. */
24254 /* If the next token is a `;', stop. */
24257 /* Look for the `,' separating the label declarations. */
24259 }
24261 /* Look for the final `;'. */
24263 }
24265 // -------------------------------------------------------------------------- //
24266 // Requires Clause
24268 // Parse a requires clause.
24269 //
24270 // requires-clause:
24271 // 'requires' logical-or-expression
24272 //
24273 // The required logical-or-expression must be a constant expression. Note
24274 // that we don't check that the expression is constepxr here. We defer until
24275 // we analyze constraints and then, we only check atomic constraints.
24276 static tree
24278 {
24279 // Parse the requires clause so that it is not automatically folded.
24287 }
24289 // Optionally parse a requires clause:
24290 static tree
24292 {
24295 {
24298 {
24301 /* Parse and discard the requires-clause. */
24304 }
24306 }
24309 }
24312 /*---------------------------------------------------------------------------
24313 Requires expressions
24314 ---------------------------------------------------------------------------*/
24316 /* Parse a requires expression
24318 requirement-expression:
24319 'requires' requirement-parameter-list [opt] requirement-body */
24320 static tree
24322 {
24326 /* A requires-expression shall appear only within a concept
24327 definition or a requires-clause.
24329 TODO: Implement this diagnostic correctly. */
24331 {
24335 }
24338 {
24339 /* Local parameters are delared as variables within the scope
24340 of the expression. They are not visible past the end of
24341 the expression. Expressions within the requires-expression
24342 are unevaluated. */
24343 struct scope_sentinel
24344 {
24346 {
24349 }
24352 {
24355 }
24358 /* Parse the optional parameter list. */
24360 {
24364 }
24365 else
24368 /* Parse the requirement body. */
24372 }
24374 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24375 the parm chain. */
24378 }
24380 /* Parse a parameterized requirement.
24382 requirement-parameter-list:
24383 '(' parameter-declaration-clause ')' */
24384 static tree
24386 {
24396 }
24398 /* Parse the body of a requirement.
24400 requirement-body:
24401 '{' requirement-list '}' */
24402 static tree
24404 {
24414 }
24416 /* Parse a list of requirements.
24418 requirement-list:
24419 requirement
24420 requirement-list ';' requirement[opt] */
24421 static tree
24423 {
24426 {
24433 /* If we see a semi-colon, consume it. */
24437 /* Stop processing at the end of the list. */
24440 }
24442 /* Reverse the order of requirements so they are analyzed in
24443 declaration order. */
24445 }
24447 /* Parse a syntactic requirement or type requirement.
24449 requirement:
24450 simple-requirement
24451 compound-requirement
24452 type-requirement
24453 nested-requirement */
24454 static tree
24456 {
24463 else
24465 }
24467 /* Parse a simple requirement.
24469 simple-requirement:
24470 expression ';' */
24471 static tree
24473 {
24482 }
24484 /* Parse a type requirement
24486 type-requirement
24487 nested-name-specifier [opt] required-type-name ';'
24489 required-type-name:
24490 type-name
24491 'template' [opt] simple-template-id */
24492 static tree
24494 {
24497 // Save the scope before parsing name specifiers.
24508 tree type;
24510 {
24519 }
24520 else
24539 }
24541 /* Parse a compound requirement
24543 compound-requirement:
24544 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24545 static tree
24547 {
24548 /* Parse an expression enclosed in '{ }'s. */
24559 /* Parse the optional noexcept. */
24562 {
24565 }
24567 /* Parse the optional trailing return type. */
24570 {
24578 }
24581 }
24583 /* Parse a nested requirement. This is the same as a requires clause.
24585 nested-requirement:
24586 requires-clause */
24587 static tree
24589 {
24595 }
24597 /* Support Functions */
24599 /* Return the appropriate prefer_type argument for lookup_name_real based on
24600 tag_type and template_mem_access. */
24604 {
24605 /* DR 141: When looking in the current enclosing context for a template-name
24606 after -> or ., only consider class templates. */
24610 {
24614 }
24615 }
24617 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24618 NAME should have one of the representations used for an
24619 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24620 is returned. If PARSER->SCOPE is a dependent type, then a
24621 SCOPE_REF is returned.
24623 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24624 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24625 was formed. Abstractly, such entities should not be passed to this
24626 function, because they do not need to be looked up, but it is
24627 simpler to check for this special case here, rather than at the
24628 call-sites.
24630 In cases not explicitly covered above, this function returns a
24631 DECL, OVERLOAD, or baselink representing the result of the lookup.
24632 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24633 is returned.
24635 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24636 (e.g., "struct") that was used. In that case bindings that do not
24637 refer to types are ignored.
24639 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24640 ignored.
24642 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24643 are ignored.
24645 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24646 types.
24648 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24649 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24650 NULL_TREE otherwise. */
24652 static cp_expr
24659 location_t name_location)
24660 {
24661 tree decl;
24664 /* Assume that the lookup will be unambiguous. */
24668 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24669 no longer valid. Note that if we are parsing tentatively, and
24670 the parse fails, OBJECT_TYPE will be automatically restored. */
24676 /* A template-id has already been resolved; there is no lookup to
24677 do. */
24681 {
24685 }
24687 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24688 it should already have been checked to make sure that the name
24689 used matches the type being destroyed. */
24691 {
24692 tree type;
24694 /* Figure out to which type this destructor applies. */
24699 else
24701 /* If that's not a class type, there is no destructor. */
24708 /* If it was a class type, return the destructor. */
24710 }
24712 /* By this point, the NAME should be an ordinary identifier. If
24713 the id-expression was a qualified name, the qualifying scope is
24714 stored in PARSER->SCOPE at this point. */
24717 /* Perform the lookup. */
24719 {
24725 /* If the SCOPE is dependent, the lookup must be deferred until
24726 the template is instantiated -- unless we are explicitly
24727 looking up names in uninstantiated templates. Even then, we
24728 cannot look up the name if the scope is not a class type; it
24729 might, for example, be a template type parameter. */
24734 /* Defer lookup. */
24736 else
24737 {
24740 /* If PARSER->SCOPE is a dependent type, then it must be a
24741 class type, and we must not be checking dependencies;
24742 otherwise, we would have processed this lookup above. So
24743 that PARSER->SCOPE is not considered a dependent base by
24744 lookup_member, we must enter the scope here. */
24748 /* If the PARSER->SCOPE is a template specialization, it
24749 may be instantiated during name lookup. In that case,
24750 errors may be issued. Even if we rollback the current
24751 tentative parse, those errors are valid. */
24756 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24757 lookup result and the nested-name-specifier nominates a class C:
24758 * if the name specified after the nested-name-specifier, when
24759 looked up in C, is the injected-class-name of C (Clause 9), or
24760 * if the name specified after the nested-name-specifier is the
24761 same as the identifier or the simple-template-id's template-
24762 name in the last component of the nested-name-specifier,
24763 the name is instead considered to name the constructor of
24764 class C. [ Note: for example, the constructor is not an
24765 acceptable lookup result in an elaborated-type-specifier so
24766 the constructor would not be used in place of the
24767 injected-class-name. --end note ] Such a constructor name
24768 shall be used only in the declarator-id of a declaration that
24769 names a constructor or in a using-declaration. */
24777 /* If we have a single function from a using decl, pull it out. */
24784 }
24786 /* If the scope is a dependent type and either we deferred lookup or
24787 we did lookup but didn't find the name, rememeber the name. */
24790 {
24792 {
24793 tree type;
24795 /* The resolution to Core Issue 180 says that `struct
24796 A::B' should be considered a type-name, even if `A'
24797 is dependent. */
24802 }
24806 CPP_CLOSE_PAREN)))
24810 else
24813 is_template);
24814 }
24817 }
24819 {
24820 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24821 OBJECT_TYPE is not a class. */
24823 /* If the OBJECT_TYPE is a template specialization, it may
24824 be instantiated during name lookup. In that case, errors
24825 may be issued. Even if we rollback the current tentative
24826 parse, those errors are valid. */
24828 name,
24831 tf_warning_or_error);
24832 else
24836 /* Look it up in the enclosing context. DR 141: When looking for a
24837 template-name after -> or ., only consider class templates. */
24842 /* The object is type-dependent, so we can't look anything up; we used
24843 this to get the DR 141 behavior. */
24847 }
24848 else
24849 {
24855 }
24857 /* If the lookup failed, let our caller know. */
24861 /* Pull out the template from an injected-class-name (or multiple). */
24865 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24867 {
24870 /* The error message we have to print is too complicated for
24871 cp_parser_error, so we incorporate its actions directly. */
24873 {
24875 name);
24877 }
24879 }
24887 /* If we have resolved the name of a member declaration, check to
24888 see if the declaration is accessible. When the name resolves to
24889 set of overloaded functions, accessibility is checked when
24890 overload resolution is done.
24892 During an explicit instantiation, access is not checked at all,
24893 as per [temp.explicit]. */
24900 }
24902 /* Like cp_parser_lookup_name, but for use in the typical case where
24903 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24904 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24906 static tree
24908 {
24910 none_type,
24915 location);
24916 }
24918 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24919 the current context, return the TYPE_DECL. If TAG_NAME_P is
24920 true, the DECL indicates the class being defined in a class-head,
24921 or declared in an elaborated-type-specifier.
24923 Otherwise, return DECL. */
24925 static tree
24927 {
24928 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24929 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24931 struct A {
24932 template <typename T> struct B;
24933 };
24935 template <typename T> struct A::B {};
24937 Similarly, in an elaborated-type-specifier:
24939 namespace N { struct X{}; }
24941 struct A {
24942 template <typename T> friend struct N::X;
24943 };
24945 However, if the DECL refers to a class type, and we are in
24946 the scope of the class, then the name lookup automatically
24947 finds the TYPE_DECL created by build_self_reference rather
24948 than a TEMPLATE_DECL. For example, in:
24950 template <class T> struct S {
24951 S s;
24952 };
24954 there is no need to handle such case. */
24960 }
24962 /* If too many, or too few, template-parameter lists apply to the
24963 declarator, issue an error message. Returns TRUE if all went well,
24964 and FALSE otherwise. */
24966 static bool
24969 location_t declarator_location)
24970 {
24972 {
24974 {
24982 /* If the DECLARATOR has the form `X<y>' then it uses one
24983 additional level of template parameters. */
24986 return cp_parser_check_template_parameters
24988 }
25003 }
25005 }
25007 /* NUM_TEMPLATES were used in the current declaration. If that is
25008 invalid, return FALSE and issue an error messages. Otherwise,
25009 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25010 declarator and we can print more accurate diagnostics. */
25012 static bool
25015 location_t location,
25017 {
25018 /* If there are the same number of template classes and parameter
25019 lists, that's OK. */
25022 /* If there are more, but only one more, then we are referring to a
25023 member template. That's OK too. */
25026 /* If there are more template classes than parameter lists, we have
25027 something like:
25029 template <class T> void S<T>::R<T>::f (); */
25031 {
25041 else
25044 }
25045 /* Otherwise, there are too many template parameter lists. We have
25046 something like:
25048 template <class T> template <class U> void S::f(); */
25051 }
25053 /* Parse an optional `::' token indicating that the following name is
25054 from the global namespace. If so, PARSER->SCOPE is set to the
25055 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25056 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25057 Returns the new value of PARSER->SCOPE, if the `::' token is
25058 present, and NULL_TREE otherwise. */
25060 static tree
25062 {
25065 /* Peek at the next token. */
25067 /* If we're looking at a `::' token then we're starting from the
25068 global namespace, not our current location. */
25070 {
25071 /* Consume the `::' token. */
25073 /* Set the SCOPE so that we know where to start the lookup. */
25079 }
25081 {
25085 }
25088 }
25090 /* Returns TRUE if the upcoming token sequence is the start of a
25091 constructor declarator. If FRIEND_P is true, the declarator is
25092 preceded by the `friend' specifier. */
25094 static bool
25096 {
25099 tree nested_name_specifier;
25102 /* The common case is that this is not a constructor declarator, so
25103 try to avoid doing lots of work if at all possible. It's not
25104 valid declare a constructor at function scope. */
25107 /* And only certain tokens can begin a constructor declarator. */
25115 /* Parse tentatively; we are going to roll back all of the tokens
25116 consumed here. */
25118 /* Assume that we are looking at a constructor declarator. */
25121 /* Look for the optional `::' operator. */
25124 /* Look for the nested-name-specifier. */
25125 nested_name_specifier
25136 /* Outside of a class-specifier, there must be a
25137 nested-name-specifier. */
25143 /* If we have a class scope, this is easy; DR 147 says that S::S always
25144 names the constructor, and no other qualified name could. */
25147 {
25157 }
25158 /* If we still think that this might be a constructor-declarator,
25159 look for a class-name. */
25161 {
25162 /* If we have:
25164 template <typename T> struct S {
25165 S();
25166 };
25168 we must recognize that the nested `S' names a class. */
25169 tree type_decl;
25173 none_type,
25177 /* If there was no class-name, then this is not a constructor.
25178 Otherwise, if we are in a class-specifier and we aren't
25179 handling a friend declaration, check that its type matches
25180 current_class_type (c++/38313). Note: error_mark_node
25181 is left alone for error recovery purposes. */
25183 && (outside_class_specifier_p
25188 /* If we're still considering a constructor, we have to see a `(',
25189 to begin the parameter-declaration-clause, followed by either a
25190 `)', an `...', or a decl-specifier. We need to check for a
25191 type-specifier to avoid being fooled into thinking that:
25193 S (f) (int);
25195 is a constructor. (It is actually a function named `f' that
25196 takes one parameter (of type `int') and returns a value of type
25197 `S'. */
25205 /* A parameter declaration begins with a decl-specifier,
25206 which is either the "attribute" keyword, a storage class
25207 specifier, or (usually) a type-specifier. */
25209 {
25210 tree type;
25214 /* Names appearing in the type-specifier should be looked up
25215 in the scope of the class. */
25218 else
25219 {
25222 {
25226 {
25229 }
25230 }
25232 }
25234 /* Inside the constructor parameter list, surrounding
25235 template-parameter-lists do not apply. */
25236 saved_num_template_parameter_lists
25240 /* Look for the type-specifier. */
25242 CP_PARSER_FLAGS_NONE,
25248 parser->num_template_parameter_lists
25251 /* Leave the scope of the class. */
25256 }
25257 }
25259 /* We did not really want to consume any tokens. */
25263 }
25265 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25266 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25267 they must be performed once we are in the scope of the function.
25269 Returns the function defined. */
25271 static tree
25272 cp_parser_function_definition_from_specifiers_and_declarator
25275 tree attributes,
25277 {
25278 tree fn;
25281 /* Begin the function-definition. */
25284 /* The things we're about to see are not directly qualified by any
25285 template headers we've seen thus far. */
25288 /* If there were names looked up in the decl-specifier-seq that we
25289 did not check, check them now. We must wait until we are in the
25290 scope of the function to perform the checks, since the function
25291 might be a friend. */
25295 {
25300 }
25303 {
25304 /* Skip the entire function. */
25307 }
25309 {
25310 /* Seen already, skip it. An error message has already been output. */
25314 /* If this is a function from a class, pop the nested class. */
25317 }
25318 else
25319 {
25320 timevar_id_t tv;
25323 else
25329 }
25332 }
25334 /* Parse the part of a function-definition that follows the
25335 declarator. INLINE_P is TRUE iff this function is an inline
25336 function defined within a class-specifier.
25338 Returns the function defined. */
25340 static tree
25343 {
25344 tree fn;
25350 bool fully_implicit_function_template_p
25353 tree implicit_template_parms
25356 cp_binding_level* implicit_template_scope
25362 /* If the next token is `return', then the code may be trying to
25363 make use of the "named return value" extension that G++ used to
25364 support. */
25367 {
25368 /* Consume the `return' keyword. */
25370 /* Look for the identifier that indicates what value is to be
25371 returned. */
25373 /* Issue an error message. */
25376 /* Skip tokens until we reach the start of the function body. */
25378 {
25385 }
25386 }
25387 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25388 anything declared inside `f'. */
25389 saved_in_unbraced_linkage_specification_p
25392 /* Inside the function, surrounding template-parameter-lists do not
25393 apply. */
25394 saved_num_template_parameter_lists
25400 /* If the next token is `try', `__transaction_atomic', or
25401 `__transaction_relaxed`, then we are looking at either function-try-block
25402 or function-transaction-block. Note that all of these include the
25403 function-body. */
25406 RID_TRANSACTION_ATOMIC);
25408 RID_TRANSACTION_RELAXED))
25410 RID_TRANSACTION_RELAXED);
25413 else
25414 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25419 /* Finish the function. */
25422 /* Generate code for it, if necessary. */
25424 /* Restore the saved values. */
25425 parser->in_unbraced_linkage_specification_p
25427 parser->num_template_parameter_lists
25431 parser->fully_implicit_function_template_p
25433 parser->implicit_template_parms
25435 parser->implicit_template_scope
25442 }
25444 /* Parse a template-declaration body (following argument list). */
25446 static void
25448 tree parameter_list,
25450 {
25454 /* We just processed one more parameter list. */
25457 /* Get the deferred access checks from the parameter list. These
25458 will be checked once we know what is being declared, as for a
25459 member template the checks must be performed in the scope of the
25460 class containing the member. */
25463 /* Tentatively parse for a new template parameter list, which can either be
25464 the template keyword or a template introduction. */
25470 else
25471 {
25472 /* There are no access checks when parsing a template, as we do not
25473 know if a specialization will be a friend. */
25477 checks,
25478 member_p,
25483 /* If this is a member template declaration, let the front
25484 end know. */
25486 {
25491 }
25496 }
25497 /* We are done with the current parameter list. */
25502 /* Finish up. */
25505 /* Check the template arguments for a literal operator template. */
25509 {
25513 else
25514 {
25517 {
25523 }
25525 {
25533 }
25534 else
25536 }
25538 {
25541 " Expected non-type template argument pack <char...>"
25543 decl);
25544 else
25547 decl);
25548 }
25549 }
25551 /* Register member declarations. */
25554 /* If DECL is a function template, we must return to parse it later.
25555 (Even though there is no definition, there might be default
25556 arguments that need handling.) */
25560 }
25562 /* Parse a template introduction header for a template-declaration. Returns
25563 false if tentative parse fails. */
25565 static bool
25567 {
25574 /* Look for the optional `::' operator. */
25577 /* Look for the nested-name-specifier. */
25587 /* Look up the concept for which we will be matching
25588 template parameters. */
25598 /* Look for opening brace for introduction. */
25606 /* Build vector of placeholder parameters and grab
25607 matching identifiers. */
25610 /* The introduction-list shall not be empty. */
25613 {
25616 }
25618 /* Look for closing brace for introduction. */
25623 {
25627 }
25629 /* Build and associate the constraint. */
25632 {
25634 member_p);
25636 }
25640 }
25642 /* Parse a normal template-declaration following the template keyword. */
25644 static void
25646 {
25647 tree parameter_list;
25651 /* Look for the `<' token. */
25655 {
25656 /* 14.5.2.2 [temp.mem]
25658 A local class shall not have member templates. */
25663 }
25664 /* [temp]
25666 A template ... shall not have C linkage. */
25668 {
25670 /* Give it C++ linkage to avoid confusing other parts of the
25671 front end. */
25674 }
25675 else
25678 /* We cannot perform access checks on the template parameter
25679 declarations until we know what is being declared, just as we
25680 cannot check the decl-specifier list. */
25683 /* If the next token is `>', then we have an invalid
25684 specialization. Rather than complain about an invalid template
25685 parameter, issue an error message here. */
25687 {
25691 }
25692 else
25693 {
25694 /* Parse the template parameters. */
25696 }
25698 /* Look for the `>'. */
25701 /* Manage template requirements */
25708 member_p);
25710 /* For the erroneous case of a template with C linkage, we pushed an
25711 implicit C++ linkage scope; exit that scope now. */
25714 }
25716 /* Parse a template-declaration, assuming that the `export' (and
25717 `extern') keywords, if present, has already been scanned. MEMBER_P
25718 is as for cp_parser_template_declaration. */
25720 static bool
25722 {
25724 {
25728 }
25733 }
25735 /* Perform the deferred access checks from a template-parameter-list.
25736 CHECKS is a TREE_LIST of access checks, as returned by
25737 get_deferred_access_checks. */
25739 static void
25740 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25741 {
25745 }
25747 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25748 `function-definition' sequence that follows a template header.
25749 If MEMBER_P is true, this declaration appears in a class scope.
25751 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25752 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25754 static tree
25760 {
25763 cp_decl_specifier_seq decl_specifiers;
25767 /* This function is only used when processing a template
25768 declaration. */
25772 /* Defer access checks until we know what is being declared. */
25775 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25776 alternative. */
25779 CP_PARSER_FLAGS_OPTIONAL,
25785 /* There are no template typedefs. */
25787 {
25791 }
25793 /* Gather up the access checks that occurred the
25794 decl-specifier-seq. */
25797 /* Check for the declaration of a template class. */
25799 {
25802 {
25803 // If this is a declaration, but not a definition, associate
25804 // any constraints with the type declaration. Constraints
25805 // are associated with definitions in cp_parser_class_specifier.
25811 /* In this case:
25813 struct C {
25814 friend template <typename T> struct A<T>::B;
25815 };
25817 A<T>::B will be represented by a TYPENAME_TYPE, and
25818 therefore not recognized by shadow_tag. */
25820 && !decl
25827 else
25830 /* Perform access checks for template parameters. */
25833 /* Give a helpful diagnostic for
25834 template <class T> struct A { } a;
25835 if we aren't already recovering from an error. */
25838 {
25840 "a class template declaration must not declare "
25844 }
25845 }
25846 }
25848 /* Complain about missing 'typename' or other invalid type names. */
25851 {
25852 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25853 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25854 the rest of this declaration. */
25857 }
25859 /* If it's not a template class, try for a template function. If
25860 the next token is a `;', then this declaration does not declare
25861 anything. But, if there were errors in the decl-specifiers, then
25862 the error might well have come from an attempted class-specifier.
25863 In that case, there's no need to warn about a missing declarator. */
25867 {
25870 checks,
25872 member_p,
25873 declares_class_or_enum,
25877 /* 7.1.1-1 [dcl.stc]
25879 A storage-class-specifier shall not be specified in an explicit
25880 specialization... */
25882 && explicit_specialization_p
25884 {
25888 }
25892 }
25894 /* Look for a trailing `;' after the declaration. */
25900 out:
25903 /* Clear any current qualification; whatever comes next is the start
25904 of something new. */
25910 }
25912 /* Parse a cast-expression that is not the operand of a unary "&". */
25914 static cp_expr
25916 {
25919 }
25921 /* Parse a functional cast to TYPE. Returns an expression
25922 representing the cast. */
25924 static cp_expr
25926 {
25928 tree expression_list;
25929 cp_expr cast;
25938 {
25947 tf_warning_or_error);
25948 /* Create a location of the form:
25949 type_name{i, f}
25950 ^~~~~~~~~~~~~~~
25951 with caret == start at the start of the type name,
25952 finishing at the closing brace. */
25953 location_t finish_loc
25956 finish_loc);
25959 }
25968 else
25969 {
25972 }
25975 tf_warning_or_error);
25976 /* [expr.const]/1: In an integral constant expression "only type
25977 conversions to integral or enumeration type can be used". */
25983 NIC_CONSTRUCTOR))
25986 /* Create a location of the form:
25987 float(i)
25988 ^~~~~~~~
25989 with caret == start at the start of the type name,
25990 finishing at the closing paren. */
25991 location_t finish_loc
25996 }
25998 /* Save the tokens that make up the body of a member function defined
25999 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26000 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26001 specifiers applied to the declaration. Returns the FUNCTION_DECL
26002 for the member function. */
26004 static tree
26008 tree attributes)
26009 {
26012 tree fn;
26014 /* Create the FUNCTION_DECL. */
26018 /* If something went badly wrong, bail out now. */
26020 {
26021 /* If there's a function-body, skip it. */
26026 }
26028 /* Remember it, if there default args to post process. */
26031 /* Save away the tokens that make up the body of the
26032 function. */
26034 /* Handle function try blocks. */
26037 /* We can have braced-init-list mem-initializers before the fn body. */
26039 {
26042 {
26043 /* cache_group will stop after an un-nested { } pair, too. */
26047 /* variadic mem-inits have ... after the ')'. */
26050 }
26051 }
26053 /* Handle function try blocks. */
26058 /* Save away the inline definition; we will process it when the
26059 class is complete. */
26063 /* We need to know that this was defined in the class, so that
26064 friend templates are handled correctly. */
26067 /* Add FN to the queue of functions to be parsed later. */
26071 }
26073 /* Save the tokens that make up the in-class initializer for a non-static
26074 data member. Returns a DEFAULT_ARG. */
26076 static tree
26078 {
26080 }
26082 /* Parse a template-argument-list, as well as the trailing ">" (but
26083 not the opening "<"). See cp_parser_template_argument_list for the
26084 return value. */
26086 static tree
26088 {
26089 tree arguments;
26090 tree saved_scope;
26091 tree saved_qualifying_scope;
26092 tree saved_object_scope;
26097 /* [temp.names]
26099 When parsing a template-id, the first non-nested `>' is taken as
26100 the end of the template-argument-list rather than a greater-than
26101 operator. */
26102 saved_greater_than_is_operator_p
26105 /* Parsing the argument list may modify SCOPE, so we save it
26106 here. */
26110 /* We need to evaluate the template arguments, even though this
26111 template-id may be nested within a "sizeof". */
26116 /* Parse the template-argument-list itself. */
26120 else
26122 /* Look for the `>' that ends the template-argument-list. If we find
26123 a '>>' instead, it's probably just a typo. */
26125 {
26127 {
26128 /* In C++0x, a `>>' in a template argument list or cast
26129 expression is considered to be two separate `>'
26130 tokens. So, change the current token to a `>', but don't
26131 consume it: it will be consumed later when the outer
26132 template argument list (or cast expression) is parsed.
26133 Note that this replacement of `>' for `>>' is necessary
26134 even if we are parsing tentatively: in the tentative
26135 case, after calling
26136 cp_parser_enclosed_template_argument_list we will always
26137 throw away all of the template arguments and the first
26138 closing `>', either because the template argument list
26139 was erroneous or because we are replacing those tokens
26140 with a CPP_TEMPLATE_ID token. The second `>' (which will
26141 not have been thrown away) is needed either to close an
26142 outer template argument list or to complete a new-style
26143 cast. */
26146 }
26148 {
26149 /* If we're in a nested template argument list, the '>>' has
26150 to be a typo for '> >'. We emit the error message, but we
26151 continue parsing and we push a '>' as next token, so that
26152 the argument list will be parsed correctly. Note that the
26153 global source location is still on the token before the
26154 '>>', so we need to say explicitly where we want it. */
26160 }
26161 else
26162 {
26163 /* If this is not a nested template argument list, the '>>'
26164 is a typo for '>'. Emit an error message and continue.
26165 Same deal about the token location, but here we can get it
26166 right by consuming the '>>' before issuing the diagnostic. */
26169 "spurious %<>>%>, use %<>%> to terminate "
26171 }
26172 }
26173 else
26175 /* The `>' token might be a greater-than operator again now. */
26176 parser->greater_than_is_operator_p
26178 /* Restore the SAVED_SCOPE. */
26186 }
26188 /* MEMBER_FUNCTION is a member function, or a friend. If default
26189 arguments, or the body of the function have not yet been parsed,
26190 parse them now. */
26192 static void
26194 {
26196 /* If this member is a template, get the underlying
26197 FUNCTION_DECL. */
26201 /* There should not be any class definitions in progress at this
26202 point; the bodies of members are only parsed outside of all class
26203 definitions. */
26205 /* While we're parsing the member functions we might encounter more
26206 classes. We want to handle them right away, but we don't want
26207 them getting mixed up with functions that are currently in the
26208 queue. */
26211 /* Make sure that any template parameters are in scope. */
26214 /* If the body of the function has not yet been parsed, parse it
26215 now. */
26217 {
26218 tree function_scope;
26221 /* The function is no longer pending; we are processing it. */
26226 /* If this is a local class, enter the scope of the containing
26227 function. */
26232 /* Push the body of the function onto the lexer stack. */
26235 /* Let the front end know that we going to be defining this
26236 function. */
26240 /* Don't do access checking if it is a templated function. */
26244 /* #pragma omp declare reduction needs special parsing. */
26246 {
26251 }
26252 else
26253 /* Now, parse the body of the function. */
26260 /* Leave the scope of the containing function. */
26264 }
26266 /* Remove any template parameters from the symbol table. */
26269 /* Restore the queue. */
26272 }
26274 /* If DECL contains any default args, remember it on the unparsed
26275 functions queue. */
26277 static void
26279 {
26280 tree probe;
26283 probe;
26286 {
26290 }
26291 }
26293 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26294 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26295 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26296 from the parameter-type-list. */
26298 static tree
26301 {
26303 tree parsed_arg;
26309 /* Push the saved tokens for the default argument onto the parser's
26310 lexer stack. */
26316 /* Parse the default argument. */
26327 {
26328 /* In a non-template class, check conversions now. In a template,
26329 we'll wait and instantiate these as needed. */
26332 tf_warning_or_error);
26333 else
26335 }
26337 /* If the token stream has not been completely used up, then
26338 there was extra junk after the end of the default
26339 argument. */
26341 {
26344 else
26346 }
26348 /* Revert to the main lexer. */
26352 }
26354 /* FIELD is a non-static data member with an initializer which we saved for
26355 later; parse it now. */
26357 static void
26359 {
26360 tree def;
26367 NULL_TREE);
26373 }
26375 /* FN is a FUNCTION_DECL which may contains a parameter with an
26376 unparsed DEFAULT_ARG. Parse the default args now. This function
26377 assumes that the current scope is the scope in which the default
26378 argument should be processed. */
26380 static void
26382 {
26386 /* While we're parsing the default args, we might (due to the
26387 statement expression extension) encounter more classes. We want
26388 to handle them right away, but we don't want them getting mixed
26389 up with default args that are currently in the queue. */
26392 /* Local variable names (and the `this' keyword) may not appear
26393 in a default argument. */
26404 {
26406 tree parsed_arg;
26408 tree copy;
26415 /* This can happen for a friend declaration for a function
26416 already declared with default arguments. */
26419 parsed_arg
26421 default_arg,
26424 {
26426 }
26430 /* Update any instantiations we've already created. */
26434 }
26438 /* Make sure no default arg is missing. */
26441 /* Restore the state of local_variables_forbidden_p. */
26444 /* Restore the queue. */
26446 }
26448 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26450 sizeof ... ( identifier )
26452 where the 'sizeof' token has already been consumed. */
26454 static tree
26456 {
26457 /* Consume the `...'. */
26464 else
26472 /* The name is not qualified. */
26491 }
26493 /* Parse the operand of `sizeof' (or a similar operator). Returns
26494 either a TYPE or an expression, depending on the form of the
26495 input. The KEYWORD indicates which kind of expression we have
26496 encountered. */
26498 static tree
26500 {
26507 /* If it's a `...', then we are computing the length of a parameter
26508 pack. */
26513 /* Types cannot be defined in a `sizeof' expression. Save away the
26514 old message. */
26516 /* And create the new one. */
26522 /* The restrictions on constant-expressions do not apply inside
26523 sizeof expressions. */
26524 saved_integral_constant_expression_p
26526 saved_non_integral_constant_expression_p
26530 /* Do not actually evaluate the expression. */
26533 /* If it's a `(', then we might be looking at the type-id
26534 construction. */
26536 {
26539 /* We can't be sure yet whether we're looking at a type-id or an
26540 expression. */
26542 /* Note: as a GNU Extension, compound literals are considered
26543 postfix-expressions as they are in C99, so they are valid
26544 arguments to sizeof. See comment in cp_parser_cast_expression
26545 for details. */
26548 else
26549 {
26552 /* Look for the type-id. */
26554 /* Look for the closing `)'. */
26557 }
26559 /* If all went well, then we're done. */
26561 {
26562 cp_decl_specifier_seq decl_specs;
26564 /* Build a trivial decl-specifier-seq. */
26568 /* Call grokdeclarator to figure out what type this is. */
26571 TYPENAME,
26574 }
26575 }
26577 /* If the type-id production did not work out, then we must be
26578 looking at the unary-expression production. */
26582 /* Go back to evaluating expressions. */
26586 /* Free the message we created. */
26588 /* And restore the old one. */
26590 parser->integral_constant_expression_p
26592 parser->non_integral_constant_expression_p
26596 }
26598 /* If the current declaration has no declarator, return true. */
26600 static bool
26602 {
26603 /* If the next token is a `;' or a `,' then there is no
26604 declarator. */
26607 }
26609 /* Update the DECL_SPECS to reflect the storage class indicated by
26610 KEYWORD. */
26612 static void
26617 {
26618 cp_storage_class storage_class;
26621 {
26625 }
26627 {
26630 }
26635 {
26638 }
26641 {
26659 }
26663 /* A storage class specifier cannot be applied alongside a typedef
26664 specifier. If there is a typedef specifier present then set
26665 conflicting_specifiers_p which will trigger an error later
26666 on in grokdeclarator. */
26669 }
26671 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26672 is true, the type is a class or enum definition. */
26674 static void
26676 tree type_spec,
26679 {
26682 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26683 (with, for example, in "typedef int wchar_t;") we remember that
26684 this is what happened. In system headers, we ignore these
26685 declarations so that G++ can work with system headers that are not
26686 C++-safe. */
26688 && !type_definition_p
26698 {
26701 ds_redefined_builtin_type_spec,
26702 token);
26704 {
26708 }
26709 }
26712 else
26713 {
26718 }
26719 }
26721 /* True iff TOKEN is the GNU keyword __thread. */
26723 static bool
26725 {
26728 }
26730 /* Set the location for a declarator specifier and check if it is
26731 duplicated.
26733 DECL_SPECS is the sequence of declarator specifiers onto which to
26734 set the location.
26736 DS is the single declarator specifier to set which location is to
26737 be set onto the existing sequence of declarators.
26739 LOCATION is the location for the declarator specifier to
26740 consider. */
26742 static void
26745 {
26754 {
26758 }
26759 else
26760 {
26762 {
26766 else
26767 {
26770 OPT_Wlong_long,
26772 }
26773 }
26775 {
26780 else
26782 }
26783 else
26784 {
26800 "__complex"
26801 };
26804 }
26805 }
26806 }
26808 /* Return true iff the declarator specifier DS is present in the
26809 sequence of declarator specifiers DECL_SPECS. */
26811 bool
26813 cp_decl_spec ds)
26814 {
26821 }
26823 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26824 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26826 static bool
26828 {
26830 }
26832 /* Issue an error message indicating that TOKEN_DESC was expected.
26833 If KEYWORD is true, it indicated this function is called by
26834 cp_parser_require_keword and the required token can only be
26835 a indicated keyword. */
26837 static void
26839 required_token token_desc,
26841 {
26843 {
26912 }
26914 {
26916 {
26995 }
26996 }
26997 else
26999 }
27003 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27004 issue an error message indicating that TOKEN_DESC was expected.
27006 Returns the token consumed, if the token had the appropriate type.
27007 Otherwise, returns NULL. */
27012 required_token token_desc)
27013 {
27016 else
27017 {
27018 /* Output the MESSAGE -- unless we're parsing tentatively. */
27022 }
27023 }
27025 /* An error message is produced if the next token is not '>'.
27026 All further tokens are skipped until the desired token is
27027 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27029 static void
27031 {
27032 /* Current level of '< ... >'. */
27034 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27037 /* Are we ready, yet? If not, issue error message. */
27041 /* Skip tokens until the desired token is found. */
27043 {
27044 /* Peek at the next token. */
27046 {
27054 /* C++0x views the `>>' operator as two `>' tokens, but
27055 C++98 does not. */
27058 {
27059 /* We've hit a `>>' where the first `>' closes the
27060 template argument list, and the second `>' is
27061 spurious. Just consume the `>>' and stop; we've
27062 already produced at least one error. */
27065 }
27066 /* Fall through for C++0x, so we handle the second `>' in
27067 the `>>'. */
27071 {
27072 /* We've reached the token we want, consume it and stop. */
27075 }
27094 /* The '>' was probably forgotten, don't look further. */
27099 }
27101 /* Consume this token. */
27103 }
27104 }
27106 /* If the next token is the indicated keyword, consume it. Otherwise,
27107 issue an error message indicating that TOKEN_DESC was expected.
27109 Returns the token consumed, if the token had the appropriate type.
27110 Otherwise, returns NULL. */
27115 required_token token_desc)
27116 {
27120 {
27123 }
27126 }
27128 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27129 function-definition. */
27131 static bool
27133 {
27136 /* A ctor-initializer begins with a `:'. */
27138 /* A function-try-block begins with `try'. */
27140 /* A function-transaction-block begins with `__transaction_atomic'
27141 or `__transaction_relaxed'. */
27144 /* The named return value extension begins with `return'. */
27146 }
27148 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27149 definition. */
27151 static bool
27153 {
27160 }
27162 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27163 C++0x) ending a template-argument. */
27165 static bool
27167 {
27175 }
27177 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27178 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27180 static bool
27183 {
27189 /* Check for the sequence `<::' in the original code. It would be lexed as
27190 `[:', where `[' is a digraph, and there is no whitespace before
27191 `:'. */
27193 {
27198 }
27200 }
27202 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27203 or none_type otherwise. */
27205 static enum tag_types
27207 {
27209 {
27219 }
27220 }
27222 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27223 or none_type otherwise or if the token is null. */
27225 static enum tag_types
27227 {
27232 {
27240 }
27241 }
27243 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27245 static void
27247 {
27251 {
27255 type))
27258 }
27259 }
27261 /* Issue an error message if DECL is redeclared with different
27262 access than its original declaration [class.access.spec/3].
27263 This applies to nested classes, nested class templates and
27264 enumerations [class.mem/1]. */
27266 static void
27268 {
27279 }
27281 /* Look for the `template' keyword, as a syntactic disambiguator.
27282 Return TRUE iff it is present, in which case it will be
27283 consumed. */
27285 static bool
27287 {
27289 {
27290 /* In C++98 the `template' keyword can only be used within templates;
27291 outside templates the parser can always figure out what is a
27292 template and what is not. In C++11, per the resolution of DR 468,
27293 `template' is allowed in cases where it is not strictly necessary. */
27296 {
27299 "in C++98 %<template%> (as a disambiguator) is only "
27301 /* If this part of the token stream is rescanned, the same
27302 error message would be generated. So, we purge the token
27303 from the stream. */
27306 }
27307 else
27308 {
27309 /* Consume the `template' keyword. */
27312 }
27313 }
27315 }
27317 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27318 set PARSER->SCOPE, and perform other related actions. */
27320 static void
27322 {
27325 /* Get the stored value. */
27327 /* Set the scope from the stored value. */
27331 }
27333 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27334 encounter the end of a block before what we were looking for. */
27336 static bool
27340 {
27342 {
27345 /* Abort a parenthesized expression if we encounter a semicolon. */
27349 /* If we've reached the end of the file, stop. */
27355 /* We've hit the end of an enclosing block, so there's been some
27356 kind of syntax error. */
27359 /* Consume the token. */
27361 /* See if it starts a new group. */
27363 {
27365 /* In theory this should probably check end == '}', but
27366 cp_parser_save_member_function_body needs it to exit
27367 after either '}' or ')' when called with ')'. */
27370 }
27372 {
27376 }
27381 }
27382 }
27384 /* Like above, for caching a default argument or NSDMI. Both of these are
27385 terminated by a non-nested comma, but it can be unclear whether or not a
27386 comma is nested in a template argument list unless we do more parsing.
27387 In order to handle this ambiguity, when we encounter a ',' after a '<'
27388 we try to parse what follows as a parameter-declaration-list (in the
27389 case of a default argument) or a member-declarator (in the case of an
27390 NSDMI). If that succeeds, then we stop caching. */
27392 static tree
27394 {
27399 tree default_argument;
27401 /* Add tokens until we have processed the entire default
27402 argument. We add the range [first_token, token). */
27405 {
27406 /* For list-initialization, this is straightforward. */
27409 }
27411 {
27414 /* Peek at the next token. */
27416 /* What we do depends on what token we have. */
27418 {
27419 /* In valid code, a default argument must be
27420 immediately followed by a `,' `)', or `...'. */
27423 {
27424 /* If we've seen a '<', we might be in a
27425 template-argument-list. Until Core issue 325 is
27426 resolved, we don't know how this situation ought
27427 to be handled, so try to DTRT. We check whether
27428 what comes after the comma is a valid parameter
27429 declaration list. If it is, then the comma ends
27430 the default argument; otherwise the default
27431 argument continues. */
27435 /* Set ITALP so cp_parser_parameter_declaration_list
27436 doesn't decide to commit to this parse. */
27443 {
27444 /* Parse declarators until we reach a non-comma or
27445 somthing that cannot be an initializer.
27446 Just checking whether we're looking at a single
27447 declarator is insufficient. Consider:
27448 int var = tuple<T,U>::x;
27449 The template parameter 'U' looks exactly like a
27450 declarator. */
27451 do
27452 {
27463 }
27465 /* If we met an '=' or ';' then the original comma
27466 was the end of the NSDMI. Otherwise assume
27467 we're still in the NSDMI. */
27470 }
27471 else
27472 {
27477 }
27484 }
27487 /* If we run into a non-nested `;', `}', or `]',
27488 then the code is invalid -- but the default
27489 argument is certainly over. */
27494 /* Handle correctly int n = sizeof ... ( p ); */
27497 /* Update DEPTH, if necessary. */
27512 /* This might be the comparison operator, or it might
27513 start a template argument list. */
27520 /* Fall through for C++0x, which treats the `>>'
27521 operator like two `>' tokens in certain
27522 cases. */
27526 {
27527 /* This might be an operator, or it might close a
27528 template argument list. But if a previous '<'
27529 started a template argument list, this will have
27530 closed it, so we can't be in one anymore. */
27534 }
27537 /* If we run out of tokens, issue an error message. */
27545 /* In these cases, we should look for template-ids.
27546 For example, if the default argument is
27547 `X<int, double>()', we need to do name lookup to
27548 figure out whether or not `X' is a template; if
27549 so, the `,' does not end the default argument.
27551 That is not yet done. */
27556 }
27558 /* If we've reached the end, stop. */
27562 /* Add the token to the token block. */
27564 }
27566 /* Create a DEFAULT_ARG to represent the unparsed default
27567 argument. */
27574 }
27576 /* Begin parsing tentatively. We always save tokens while parsing
27577 tentatively so that if the tentative parsing fails we can restore the
27578 tokens. */
27580 static void
27582 {
27583 /* Enter a new parsing context. */
27585 /* Begin saving tokens. */
27587 /* In order to avoid repetitive access control error messages,
27588 access checks are queued up until we are no longer parsing
27589 tentatively. */
27591 }
27593 /* Commit to the currently active tentative parse. */
27595 static void
27597 {
27601 /* Mark all of the levels as committed. */
27604 {
27611 }
27612 }
27614 /* Commit to the topmost currently active tentative parse.
27616 Note that this function shouldn't be called when there are
27617 irreversible side-effects while in a tentative state. For
27618 example, we shouldn't create a permanent entry in the symbol
27619 table, or issue an error message that might not apply if the
27620 tentative parse is aborted. */
27622 static void
27624 {
27629 {
27637 }
27638 }
27640 /* Abort the currently active tentative parse. All consumed tokens
27641 will be rolled back, and no diagnostics will be issued. */
27643 static void
27645 {
27649 /* Now, pretend that we want to see if the construct was
27650 successfully parsed. */
27652 }
27654 /* Stop parsing tentatively. If a parse error has occurred, restore the
27655 token stream. Otherwise, commit to the tokens we have consumed.
27656 Returns true if no error occurred; false otherwise. */
27658 static bool
27660 {
27664 /* Remember whether or not an error occurred, since we are about to
27665 destroy that information. */
27667 /* Remove the topmost context from the stack. */
27670 /* If no parse errors occurred, commit to the tentative parse. */
27672 {
27673 /* Commit to the tokens read tentatively, unless that was
27674 already done. */
27679 }
27680 /* Otherwise, if errors occurred, roll back our state so that things
27681 are just as they were before we began the tentative parse. */
27682 else
27683 {
27686 }
27687 /* Add the context to the front of the free list. */
27692 }
27694 /* Returns true if we are parsing tentatively and are not committed to
27695 this tentative parse. */
27697 static bool
27699 {
27702 }
27704 /* Returns nonzero iff an error has occurred during the most recent
27705 tentative parse. */
27707 static bool
27709 {
27712 }
27714 /* Returns nonzero if GNU extensions are allowed. */
27716 static bool
27718 {
27720 }
27721 \f
27722 /* Objective-C++ Productions */
27725 /* Parse an Objective-C expression, which feeds into a primary-expression
27726 above.
27728 objc-expression:
27729 objc-message-expression
27730 objc-string-literal
27731 objc-encode-expression
27732 objc-protocol-expression
27733 objc-selector-expression
27735 Returns a tree representation of the expression. */
27737 static cp_expr
27739 {
27740 /* Try to figure out what kind of declaration is present. */
27744 {
27754 {
27766 }
27772 }
27775 }
27777 /* Parse an Objective-C message expression.
27779 objc-message-expression:
27780 [ objc-message-receiver objc-message-args ]
27782 Returns a representation of an Objective-C message. */
27784 static tree
27786 {
27798 /* Construct a location e.g.
27799 [self func1:5]
27800 ^~~~~~~~~~~~~~
27801 ranging from the '[' to the ']', with the caret at the start. */
27806 }
27808 /* Parse an objc-message-receiver.
27810 objc-message-receiver:
27811 expression
27812 simple-type-specifier
27814 Returns a representation of the type or expression. */
27816 static tree
27818 {
27819 tree rcv;
27821 /* An Objective-C message receiver may be either (1) a type
27822 or (2) an expression. */
27826 /* If that worked out, fine. */
27833 CP_PARSER_FLAGS_NONE);
27840 }
27842 /* Parse the arguments and selectors comprising an Objective-C message.
27844 objc-message-args:
27845 objc-selector
27846 objc-selector-args
27847 objc-selector-args , objc-comma-args
27849 objc-selector-args:
27850 objc-selector [opt] : assignment-expression
27851 objc-selector-args objc-selector [opt] : assignment-expression
27853 objc-comma-args:
27854 assignment-expression
27855 objc-comma-args , assignment-expression
27857 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27858 selector arguments and TREE_VALUE containing a list of comma
27859 arguments. */
27861 static tree
27863 {
27869 {
27875 /* Detect if we have a unary selector. */
27884 sel_args
27889 }
27891 /* Handle non-selector arguments, if any. */
27893 {
27894 tree arg;
27899 addl_args
27904 }
27907 {
27910 }
27913 }
27915 /* Parse an Objective-C encode expression.
27917 objc-encode-expression:
27918 @encode objc-typename
27920 Returns an encoded representation of the type argument. */
27922 static cp_expr
27924 {
27925 tree type;
27936 {
27940 }
27942 /* This happens if we find @encode(T) (where T is a template
27943 typename or something dependent on a template typename) when
27944 parsing a template. In that case, we can't compile it
27945 immediately, but we rather create an AT_ENCODE_EXPR which will
27946 need to be instantiated when the template is used.
27947 */
27949 {
27953 }
27956 /* Build a location of the form:
27957 @encode(int)
27958 ^~~~~~~~~~~~
27959 with caret==start at the @ token, finishing at the close paren. */
27960 location_t combined_loc
27965 }
27967 /* Parse an Objective-C @defs expression. */
27969 static tree
27971 {
27972 tree name;
27980 }
27982 /* Parse an Objective-C protocol expression.
27984 objc-protocol-expression:
27985 @protocol ( identifier )
27987 Returns a representation of the protocol expression. */
27989 static tree
27991 {
27992 tree proto;
28000 /* Build a location of the form:
28001 @protocol(prot)
28002 ^~~~~~~~~~~~~~~
28003 with caret==start at the @ token, finishing at the close paren. */
28004 location_t combined_loc
28010 }
28012 /* Parse an Objective-C selector expression.
28014 objc-selector-expression:
28015 @selector ( objc-method-signature )
28017 objc-method-signature:
28018 objc-selector
28019 objc-selector-seq
28021 objc-selector-seq:
28022 objc-selector :
28023 objc-selector-seq objc-selector :
28025 Returns a representation of the method selector. */
28027 static tree
28029 {
28041 {
28050 {
28051 /* Detect if we have a unary selector. */
28053 {
28056 }
28057 else
28058 {
28060 }
28061 }
28066 {
28067 sel_seq
28070 sel_seq
28073 }
28074 else
28075 sel_seq
28080 }
28082 finish_selector:
28086 /* Build a location of the form:
28087 @selector(func)
28088 ^~~~~~~~~~~~~~~
28089 with caret==start at the @ token, finishing at the close paren. */
28090 location_t combined_loc
28094 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28097 }
28099 /* Parse a list of identifiers.
28101 objc-identifier-list:
28102 identifier
28103 objc-identifier-list , identifier
28105 Returns a TREE_LIST of identifier nodes. */
28107 static tree
28109 {
28110 tree identifier;
28111 tree list;
28122 {
28129 identifier));
28131 }
28134 }
28136 /* Parse an Objective-C alias declaration.
28138 objc-alias-declaration:
28139 @compatibility_alias identifier identifier ;
28141 This function registers the alias mapping with the Objective-C front end.
28142 It returns nothing. */
28144 static void
28146 {
28154 }
28156 /* Parse an Objective-C class forward-declaration.
28158 objc-class-declaration:
28159 @class objc-identifier-list ;
28161 The function registers the forward declarations with the Objective-C
28162 front end. It returns nothing. */
28164 static void
28166 {
28169 {
28170 tree id;
28180 else
28182 }
28184 }
28186 /* Parse a list of Objective-C protocol references.
28188 objc-protocol-refs-opt:
28189 objc-protocol-refs [opt]
28191 objc-protocol-refs:
28192 < objc-identifier-list >
28194 Returns a TREE_LIST of identifiers, if any. */
28196 static tree
28198 {
28202 {
28206 }
28209 }
28211 /* Parse a Objective-C visibility specification. */
28213 static void
28215 {
28219 {
28234 }
28236 /* Eat '@private'/'@protected'/'@public'. */
28238 }
28240 /* Parse an Objective-C method type. Return 'true' if it is a class
28241 (+) method, and 'false' if it is an instance (-) method. */
28245 {
28248 else
28250 }
28252 /* Parse an Objective-C protocol qualifier. */
28254 static tree
28256 {
28269 {
28274 }
28277 }
28279 /* Parse an Objective-C typename. */
28281 static tree
28283 {
28287 {
28293 /* An ObjC type name may consist of just protocol qualifiers, in which
28294 case the type shall default to 'id'. */
28296 {
28299 /* If the type could not be parsed, an error has already
28300 been produced. For error recovery, behave as if it had
28301 not been specified, which will use the default type
28302 'id'. */
28304 {
28306 /* We need to skip to the closing parenthesis as
28307 cp_parser_type_id() does not seem to do it for
28308 us. */
28313 }
28314 }
28318 }
28321 }
28323 /* Check to see if TYPE refers to an Objective-C selector name. */
28325 static bool
28327 {
28333 }
28335 /* Parse an Objective-C selector. */
28337 static tree
28339 {
28343 {
28346 }
28348 /* C++ operator names are allowed to appear in ObjC selectors. */
28350 {
28363 }
28364 }
28366 /* Parse an Objective-C params list. */
28368 static tree
28370 {
28376 {
28386 /* Detect if we have a unary selector. */
28389 {
28392 }
28396 {
28397 /* Something went quite wrong. There should be a colon
28398 here, but there is not. Stop parsing parameters. */
28400 }
28402 /* New ObjC allows attributes on parameters too. */
28407 params
28410 type_name,
28411 identifier,
28412 parm_attr));
28415 }
28418 {
28421 }
28423 /* We allow tail attributes for the method. */
28425 {
28433 }
28436 {
28439 }
28441 }
28443 /* Parse the non-keyword Objective-C params. */
28445 static tree
28448 {
28454 {
28456 tree parm;
28462 {
28467 }
28469 /* TODO: parse attributes for tail parameters. */
28478 }
28480 /* We allow tail attributes for the method. */
28482 {
28484 {
28489 }
28490 else
28491 /* We have an error, but parse the attributes, so that we can
28492 carry on. */
28498 }
28501 }
28503 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28505 static void
28507 {
28510 /* If the next token is `extern' and the following token is a string
28511 literal, then we have a linkage specification. */
28513 && cp_parser_is_pure_string_literal
28516 /* Handle #pragma, if any. */
28519 /* Allow stray semicolons. */
28522 /* Mark methods as optional or required, when building protocols. */
28524 {
28527 }
28529 {
28532 }
28535 /* Other stray characters must generate errors. */
28537 {
28541 }
28542 /* Finally, try to parse a block-declaration, or a function-definition. */
28543 else
28545 }
28547 /* Parse a method signature. */
28549 static tree
28551 {
28567 }
28569 static bool
28571 {
28572 tree tattr;
28577 /* If the attributes are followed by a method introducer, this is not allowed.
28578 Dump the attributes and flag the situation. */
28583 /* Otherwise, the attributes introduce some interstitial code, possibly so
28584 rewind to allow that check. */
28587 }
28589 /* Parse an Objective-C method prototype list. */
28591 static void
28593 {
28597 {
28599 {
28604 else
28608 {
28612 }
28615 }
28621 OPT_Wattributes,
28623 else
28624 /* Allow for interspersed non-ObjC++ code. */
28628 }
28632 else
28636 }
28638 /* Parse an Objective-C method definition list. */
28640 static void
28642 {
28646 {
28647 tree meth;
28650 {
28656 else
28661 {
28665 }
28667 NULL_TREE);
28669 /* For historical reasons, we accept an optional semicolon. */
28676 {
28683 }
28684 }
28685 /* The following case will be removed once @synthesize is
28686 completely implemented. */
28697 else
28698 /* Allow for interspersed non-ObjC++ code. */
28702 }
28706 else
28710 }
28712 /* Parse Objective-C ivars. */
28714 static void
28716 {
28727 {
28728 cp_decl_specifier_seq declspecs;
28730 tree prefix_attributes;
28738 CP_PARSER_FLAGS_OPTIONAL,
28742 /* auto, register, static, extern, mutable. */
28744 {
28747 }
28749 /* thread_local. */
28751 {
28754 }
28756 /* typedef. */
28758 {
28761 }
28766 /* Keep going until we hit the `;' at the end of the
28767 declaration. */
28769 {
28774 /* Check for a (possibly unnamed) bitfield declaration. */
28782 {
28783 /* Get the name of the bitfield. */
28786 sfk_none);
28788 eat_colon:
28790 /* Get the width of the bitfield. */
28791 width
28793 }
28794 else
28795 {
28796 /* Parse the declarator. */
28797 declarator
28803 }
28805 /* Look for attributes that apply to the ivar. */
28807 /* Remember which attributes are prefix attributes and
28808 which are not. */
28810 /* Combine the attributes. */
28814 /* Create the bitfield declaration. */
28816 width,
28817 attributes);
28818 else
28823 /* Add the instance variable. */
28827 /* Reset PREFIX_ATTRIBUTES. */
28836 {
28839 }
28841 }
28845 }
28850 /* Do not consume the RID_AT_END, so it will be read again as terminating
28851 the @interface of @implementation. */
28855 /* For historical reasons, we accept an optional semicolon. */
28858 }
28860 /* Parse an Objective-C protocol declaration. */
28862 static void
28864 {
28870 {
28875 }
28877 /* See if we have a forward declaration or a definition. */
28880 /* Try a forward declaration first. */
28882 {
28884 {
28885 tree id;
28895 else
28897 }
28899 }
28901 /* Ok, we got a full-fledged definition (or at least should). */
28902 else
28903 {
28908 }
28909 }
28911 /* Parse an Objective-C superclass or category. */
28913 static void
28918 {
28924 {
28927 }
28929 {
28932 /* If there is no category name, and this is an @interface, we
28933 have a class extension. */
28935 {
28938 }
28939 else
28943 }
28944 }
28946 /* Parse an Objective-C class interface. */
28948 static void
28950 {
28957 {
28958 /* It's hard to recover because even if valid @interface stuff
28959 is to follow, we can't compile it (or validate it) if we
28960 don't even know which class it refers to. Let's assume this
28961 was a stray '@interface' token in the stream and skip it.
28962 */
28964 }
28969 /* We have either a class or a category on our hands. */
28972 else
28973 {
28975 /* Handle instance variable declarations, if any. */
28978 }
28981 }
28983 /* Parse an Objective-C class implementation. */
28985 static void
28987 {
28994 {
28995 /* It's hard to recover because even if valid @implementation
28996 stuff is to follow, we can't compile it (or validate it) if
28997 we don't even know which class it refers to. Let's assume
28998 this was a stray '@implementation' token in the stream and
28999 skip it.
29000 */
29002 }
29006 /* We have either a class or a category on our hands. */
29009 else
29010 {
29012 /* Handle instance variable declarations, if any. */
29015 }
29018 }
29020 /* Consume the @end token and finish off the implementation. */
29022 static void
29024 {
29027 }
29029 /* Parse an Objective-C declaration. */
29031 static void
29033 {
29034 /* Try to figure out what kind of declaration is present. */
29039 {
29055 }
29058 {
29081 }
29082 }
29084 /* Parse an Objective-C try-catch-finally statement.
29086 objc-try-catch-finally-stmt:
29087 @try compound-statement objc-catch-clause-seq [opt]
29088 objc-finally-clause [opt]
29090 objc-catch-clause-seq:
29091 objc-catch-clause objc-catch-clause-seq [opt]
29093 objc-catch-clause:
29094 @catch ( objc-exception-declaration ) compound-statement
29096 objc-finally-clause:
29097 @finally compound-statement
29099 objc-exception-declaration:
29100 parameter-declaration
29101 '...'
29103 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29105 Returns NULL_TREE.
29107 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29108 for C. Keep them in sync. */
29110 static tree
29112 {
29113 location_t location;
29114 tree stmt;
29119 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29120 node, lest it get absorbed into the surrounding block. */
29126 {
29135 {
29136 /* We have "@catch (...)" (where the '...' are literally
29137 what is in the code). Skip the '...'.
29138 parameter_declaration is set to NULL_TREE, and
29139 objc_being_catch_clauses() knows that that means
29140 '...'. */
29143 }
29144 else
29145 {
29146 /* We have "@catch (NSException *exception)" or something
29147 like that. Parse the parameter declaration. */
29151 else
29156 }
29159 else
29160 {
29161 /* If there was no open parenthesis, we are recovering from
29162 an error, and we are trying to figure out what mistake
29163 the user has made. */
29165 /* If there is an immediate closing parenthesis, the user
29166 probably forgot the opening one (ie, they typed "@catch
29167 NSException *e)". Parse the closing parenthesis and keep
29168 going. */
29172 /* If these is no immediate closing parenthesis, the user
29173 probably doesn't know that parenthesis are required at
29174 all (ie, they typed "@catch NSException *e"). So, just
29175 forget about the closing parenthesis and keep going. */
29176 }
29180 }
29182 {
29185 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29186 node, lest it get absorbed into the surrounding block. */
29190 }
29193 }
29195 /* Parse an Objective-C synchronized statement.
29197 objc-synchronized-stmt:
29198 @synchronized ( expression ) compound-statement
29200 Returns NULL_TREE. */
29202 static tree
29204 {
29205 location_t location;
29216 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29217 node, lest it get absorbed into the surrounding block. */
29222 }
29224 /* Parse an Objective-C throw statement.
29226 objc-throw-stmt:
29227 @throw assignment-expression [opt] ;
29229 Returns a constructed '@throw' statement. */
29231 static tree
29233 {
29245 }
29247 /* Parse an Objective-C statement. */
29249 static tree
29251 {
29252 /* Try to figure out what kind of declaration is present. */
29256 {
29267 }
29270 }
29272 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29273 look ahead to see if an objc keyword follows the attributes. This
29274 is to detect the use of prefix attributes on ObjC @interface and
29275 @protocol. */
29277 static bool
29279 {
29284 {
29287 }
29290 }
29292 /* This routine is a minimal replacement for
29293 c_parser_struct_declaration () used when parsing the list of
29294 types/names or ObjC++ properties. For example, when parsing the
29295 code
29297 @property (readonly) int a, b, c;
29299 this function is responsible for parsing "int a, int b, int c" and
29300 returning the declarations as CHAIN of DECLs.
29302 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29303 similar parsing. */
29304 static tree
29306 {
29308 cp_decl_specifier_seq declspecs;
29310 tree prefix_attributes;
29313 CP_PARSER_FLAGS_NONE,
29320 /* auto, register, static, extern, mutable. */
29322 {
29325 }
29327 /* thread_local. */
29329 {
29332 }
29334 /* typedef. */
29336 {
29339 }
29344 /* Keep going until we hit the `;' at the end of the declaration. */
29346 {
29351 /* Parse the declarator. */
29355 /* Look for attributes that apply to the ivar. */
29357 /* Remember which attributes are prefix attributes and
29358 which are not. */
29360 /* Combine the attributes. */
29370 /* Reset PREFIX_ATTRIBUTES. */
29381 {
29384 }
29385 else
29387 }
29389 }
29391 /* Parse an Objective-C @property declaration. The syntax is:
29393 objc-property-declaration:
29394 '@property' objc-property-attributes[opt] struct-declaration ;
29396 objc-property-attributes:
29397 '(' objc-property-attribute-list ')'
29399 objc-property-attribute-list:
29400 objc-property-attribute
29401 objc-property-attribute-list, objc-property-attribute
29403 objc-property-attribute
29404 'getter' = identifier
29405 'setter' = identifier
29406 'readonly'
29407 'readwrite'
29408 'assign'
29409 'retain'
29410 'copy'
29411 'nonatomic'
29413 For example:
29414 @property NSString *name;
29415 @property (readonly) id object;
29416 @property (retain, nonatomic, getter=getTheName) id name;
29417 @property int a, b, c;
29419 PS: This function is identical to
29420 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29421 static void
29423 {
29424 /* The following variables hold the attributes of the properties as
29425 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29426 seen. When we see an attribute, we set them to 'true' (if they
29427 are boolean properties) or to the identifier (if they have an
29428 argument, ie, for getter and setter). Note that here we only
29429 parse the list of attributes, check the syntax and accumulate the
29430 attributes that we find. objc_add_property_declaration() will
29431 then process the information. */
29441 /* 'properties' is the list of properties that we read. Usually a
29442 single one, but maybe more (eg, in "@property int a, b, c;" there
29443 are three). */
29444 tree properties;
29445 location_t loc;
29451 /* Parse the optional attribute list... */
29453 {
29454 /* Eat the '('. */
29458 {
29464 {
29467 }
29471 {
29482 {
29486 else
29491 }
29494 {
29498 }
29500 {
29502 {
29505 }
29506 else
29510 else
29512 }
29513 else
29514 {
29516 {
29519 }
29520 else
29522 }
29528 }
29535 else
29537 }
29539 /* FIXME: "@property (setter, assign);" will generate a spurious
29540 "error: expected ‘)’ before ‘,’ token". This is because
29541 cp_parser_require, unlike the C counterpart, will produce an
29542 error even if we are in error recovery. */
29544 {
29549 }
29550 }
29552 /* ... and the property declaration(s). */
29556 {
29558 /* If the next token is now a `;', consume it. */
29562 }
29566 else
29567 {
29568 /* Comma-separated properties are chained together in
29569 reverse order; add them one by one. */
29578 }
29581 }
29583 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29585 objc-synthesize-declaration:
29586 @synthesize objc-synthesize-identifier-list ;
29588 objc-synthesize-identifier-list:
29589 objc-synthesize-identifier
29590 objc-synthesize-identifier-list, objc-synthesize-identifier
29592 objc-synthesize-identifier
29593 identifier
29594 identifier = identifier
29596 For example:
29597 @synthesize MyProperty;
29598 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29600 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29601 for C. Keep them in sync.
29602 */
29603 static void
29605 {
29607 location_t loc;
29612 {
29616 {
29619 }
29621 {
29625 {
29628 }
29629 }
29630 else
29635 else
29637 }
29640 }
29642 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29644 objc-dynamic-declaration:
29645 @dynamic identifier-list ;
29647 For example:
29648 @dynamic MyProperty;
29649 @dynamic MyProperty, AnotherProperty;
29651 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29652 for C. Keep them in sync.
29653 */
29654 static void
29656 {
29658 location_t loc;
29663 {
29664 tree property;
29667 {
29670 }
29674 else
29676 }
29679 }
29681 \f
29682 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29684 /* Returns name of the next clause.
29685 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29686 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29687 returned and the token is consumed. */
29689 static pragma_omp_clause
29691 {
29707 {
29712 {
29895 }
29896 }
29902 }
29904 /* Validate that a clause of the given type does not already exist. */
29906 static void
29909 {
29910 tree c;
29914 {
29917 }
29918 }
29920 /* OpenMP 2.5:
29921 variable-list:
29922 identifier
29923 variable-list , identifier
29925 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29926 colon). An opening parenthesis will have been consumed by the caller.
29928 If KIND is nonzero, create the appropriate node and install the decl
29929 in OMP_CLAUSE_DECL and add the node to the head of the list.
29931 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29932 return the list created.
29934 COLON can be NULL if only closing parenthesis should end the list,
29935 or pointer to bool which will receive false if the list is terminated
29936 by closing parenthesis or true if the list is terminated by colon. */
29938 static tree
29941 {
29945 {
29948 }
29950 {
29955 && current_class_ptr
29957 {
29963 }
29964 else
29965 {
29978 }
29980 ;
29982 {
29984 {
29987 {
29991 }
29992 /* FALLTHROUGH. */
29997 {
29998 location_t loc
30002 decl
30006 }
30007 /* FALLTHROUGH. */
30011 {
30019 parser->colon_corrects_to_scope_p
30023 else
30024 {
30025 /* Look for `:'. */
30029 CPP_CLOSE_SQUARE))
30031 }
30032 /* Look for the closing `]'. */
30034 RT_CLOSE_SQUARE))
30038 {
30041 {
30045 }
30049 {
30053 }
30054 }
30057 }
30061 }
30067 }
30068 else
30071 get_comma:
30075 }
30081 {
30085 }
30088 {
30091 /* Try to resync to an unnested comma. Copied from
30092 cp_parser_parenthesized_expression_list. */
30093 skip_comma:
30102 }
30105 }
30107 /* Similarly, but expect leading and trailing parenthesis. This is a very
30108 common case for omp clauses. */
30110 static tree
30112 {
30116 }
30118 /* OpenACC 2.0:
30119 copy ( variable-list )
30120 copyin ( variable-list )
30121 copyout ( variable-list )
30122 create ( variable-list )
30123 delete ( variable-list )
30124 present ( variable-list )
30125 present_or_copy ( variable-list )
30126 pcopy ( variable-list )
30127 present_or_copyin ( variable-list )
30128 pcopyin ( variable-list )
30129 present_or_copyout ( variable-list )
30130 pcopyout ( variable-list )
30131 present_or_create ( variable-list )
30132 pcreate ( variable-list ) */
30134 static tree
30136 tree list)
30137 {
30140 {
30186 }
30194 }
30196 /* OpenACC 2.0:
30197 deviceptr ( variable-list ) */
30199 static tree
30201 {
30205 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30206 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30207 variable-list must only allow for pointer variables. */
30210 {
30217 }
30220 }
30222 /* OpenACC 2.0:
30223 auto
30224 independent
30225 nohost
30226 seq */
30228 static tree
30232 {
30237 }
30239 /* OpenACC:
30240 num_gangs ( expression )
30241 num_workers ( expression )
30242 vector_length ( expression ) */
30244 static tree
30247 {
30257 {
30262 }
30270 }
30272 /* OpenACC:
30274 gang [( gang-arg-list )]
30275 worker [( [num:] int-expr )]
30276 vector [( [length:] int-expr )]
30278 where gang-arg is one of:
30280 [num:] int-expr
30281 static: size-expr
30283 and size-expr may be:
30285 *
30286 int-expr
30287 */
30289 static tree
30292 {
30302 {
30305 do
30306 {
30310 /* Gang static argument. */
30313 {
30321 {
30324 }
30326 /* Check for the '*' argument. */
30330 CPP_CLOSE_PAREN)))
30331 {
30336 {
30339 }
30341 }
30342 }
30343 /* Worker num: argument and vector length: arguments. */
30347 {
30350 }
30352 /* Now collect the actual argument. */
30354 {
30357 }
30369 {
30372 }
30374 }
30379 }
30393 cleanup_error:
30396 }
30398 /* OpenACC 2.0:
30399 tile ( size-expr-list ) */
30401 static tree
30403 {
30412 do
30413 {
30417 {
30420 }
30421 else
30431 }
30434 /* Consume the trailing ')'. */
30442 }
30444 /* OpenACC 2.0
30445 Parse wait clause or directive parameters. */
30447 static tree
30449 {
30459 {
30464 }
30471 {
30475 {
30478 else
30479 {
30486 }
30487 }
30488 }
30491 }
30493 /* OpenACC:
30494 wait ( int-expr-list ) */
30496 static tree
30498 {
30507 }
30509 /* OpenMP 3.0:
30510 collapse ( constant-expression ) */
30512 static tree
30514 {
30516 location_t loc;
30517 HOST_WIDE_INT n;
30537 {
30540 }
30548 }
30550 /* OpenMP 2.5:
30551 default ( shared | none )
30553 OpenACC 2.0
30554 default (none) */
30556 static tree
30559 {
30561 tree c;
30566 {
30571 {
30586 }
30589 }
30590 else
30591 {
30592 invalid_kind:
30595 else
30597 }
30613 }
30615 /* OpenMP 3.1:
30616 final ( expression ) */
30618 static tree
30620 {
30641 }
30643 /* OpenMP 2.5:
30644 if ( expression )
30646 OpenMP 4.5:
30647 if ( directive-name-modifier : expression )
30649 directive-name-modifier:
30650 parallel | task | taskloop | target data | target | target update
30651 | target enter data | target exit data */
30653 static tree
30656 {
30664 {
30676 {
30679 {
30692 else
30693 {
30694 location_t loc
30699 }
30702 {
30704 {
30709 }
30711 {
30712 location_t loc
30716 }
30717 }
30718 }
30719 }
30721 {
30723 {
30726 }
30727 else
30728 {
30730 {
30731 location_t loc
30734 }
30736 }
30737 }
30738 }
30750 {
30753 {
30756 {
30766 }
30768 p);
30770 }
30772 {
30775 else
30778 }
30781 {
30785 }
30786 }
30794 }
30796 /* OpenMP 3.1:
30797 mergeable */
30799 static tree
30802 {
30803 tree c;
30806 location);
30811 }
30813 /* OpenMP 2.5:
30814 nowait */
30816 static tree
30819 {
30820 tree c;
30827 }
30829 /* OpenMP 2.5:
30830 num_threads ( expression ) */
30832 static tree
30834 location_t location)
30835 {
30857 }
30859 /* OpenMP 4.5:
30860 num_tasks ( expression ) */
30862 static tree
30864 location_t location)
30865 {
30887 }
30889 /* OpenMP 4.5:
30890 grainsize ( expression ) */
30892 static tree
30894 location_t location)
30895 {
30917 }
30919 /* OpenMP 4.5:
30920 priority ( expression ) */
30922 static tree
30924 location_t location)
30925 {
30947 }
30949 /* OpenMP 4.5:
30950 hint ( expression ) */
30952 static tree
30954 location_t location)
30955 {
30976 }
30978 /* OpenMP 4.5:
30979 defaultmap ( tofrom : scalar ) */
30981 static tree
30983 location_t location)
30984 {
30992 {
30995 }
30999 {
31002 }
31008 {
31011 }
31015 {
31018 }
31024 location);
31030 out_err:
31035 }
31037 /* OpenMP 2.5:
31038 ordered
31040 OpenMP 4.5:
31041 ordered ( constant-expression ) */
31043 static tree
31046 {
31048 HOST_WIDE_INT n;
31054 {
31071 {
31073 "ordered argument needs positive constant integer "
31076 }
31077 }
31083 }
31085 /* OpenMP 2.5:
31086 reduction ( reduction-operator : variable-list )
31088 reduction-operator:
31089 One of: + * - & ^ | && ||
31091 OpenMP 3.1:
31093 reduction-operator:
31094 One of: + * - & ^ | && || min max
31096 OpenMP 4.0:
31098 reduction-operator:
31099 One of: + * - & ^ | && ||
31100 id-expression */
31102 static tree
31104 {
31112 {
31122 }
31126 else
31127 {
31138 {
31168 }
31169 else
31170 {
31172 resync_fail:
31177 }
31178 }
31184 NULL);
31186 {
31189 }
31192 }
31194 /* OpenMP 2.5:
31195 schedule ( schedule-kind )
31196 schedule ( schedule-kind , expression )
31198 schedule-kind:
31199 static | dynamic | guided | runtime | auto
31201 OpenMP 4.5:
31202 schedule ( schedule-modifier : schedule-kind )
31203 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31205 schedule-modifier:
31206 simd
31207 monotonic
31208 nonmonotonic */
31210 static tree
31212 {
31222 {
31231 else
31237 else
31238 {
31241 }
31242 }
31245 {
31250 {
31271 }
31272 }
31277 else
31283 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31285 {
31289 }
31292 {
31307 else
31312 }
31324 invalid_kind:
31326 resync_fail:
31331 }
31333 /* OpenMP 3.0:
31334 untied */
31336 static tree
31339 {
31340 tree c;
31347 }
31349 /* OpenMP 4.0:
31350 inbranch
31351 notinbranch */
31353 static tree
31356 {
31361 }
31363 /* OpenMP 4.0:
31364 parallel
31365 for
31366 sections
31367 taskgroup */
31369 static tree
31373 {
31377 }
31379 /* OpenMP 4.5:
31380 nogroup */
31382 static tree
31385 {
31390 }
31392 /* OpenMP 4.5:
31393 simd
31394 threads */
31396 static tree
31400 {
31405 }
31407 /* OpenMP 4.0:
31408 num_teams ( expression ) */
31410 static tree
31412 location_t location)
31413 {
31435 }
31437 /* OpenMP 4.0:
31438 thread_limit ( expression ) */
31440 static tree
31442 location_t location)
31443 {
31465 }
31467 /* OpenMP 4.0:
31468 aligned ( variable-list )
31469 aligned ( variable-list : constant-expression ) */
31471 static tree
31473 {
31484 {
31494 }
31500 }
31502 /* OpenMP 4.0:
31503 linear ( variable-list )
31504 linear ( variable-list : expression )
31506 OpenMP 4.5:
31507 linear ( modifier ( variable-list ) )
31508 linear ( modifier ( variable-list ) : expression ) */
31510 static tree
31513 {
31523 {
31535 else
31537 }
31542 else
31543 {
31552 }
31555 {
31560 {
31571 {
31574 }
31577 }
31582 {
31585 }
31593 }
31596 {
31599 }
31602 }
31604 /* OpenMP 4.0:
31605 safelen ( constant-expression ) */
31607 static tree
31609 location_t location)
31610 {
31631 }
31633 /* OpenMP 4.0:
31634 simdlen ( constant-expression ) */
31636 static tree
31638 location_t location)
31639 {
31660 }
31662 /* OpenMP 4.5:
31663 vec:
31664 identifier [+/- integer]
31665 vec , identifier [+/- integer]
31666 */
31668 static tree
31670 tree list)
31671 {
31675 {
31678 }
31681 {
31688 else
31689 {
31690 t = cp_parser_lookup_name_simple
31695 id_loc);
31696 }
31702 {
31705 }
31709 {
31712 }
31716 {
31719 }
31722 add_to_vector:
31724 {
31728 }
31734 }
31737 {
31743 }
31745 }
31747 /* OpenMP 4.0:
31748 depend ( depend-kind : variable-list )
31750 depend-kind:
31751 in | out | inout
31753 OpenMP 4.5:
31754 depend ( source )
31756 depend ( sink : vec ) */
31758 static tree
31760 {
31768 {
31782 else
31784 }
31785 else
31791 {
31801 }
31808 else
31809 {
31815 }
31818 invalid_kind:
31820 resync_fail:
31825 }
31827 /* OpenMP 4.0:
31828 map ( map-kind : variable-list )
31829 map ( variable-list )
31831 map-kind:
31832 alloc | to | from | tofrom
31834 OpenMP 4.5:
31835 map-kind:
31836 alloc | to | from | tofrom | release | delete
31838 map ( always [,] map-kind: variable-list ) */
31840 static tree
31842 {
31851 {
31856 {
31859 nth++;
31865 {
31870 }
31871 }
31872 }
31876 {
31890 else
31891 {
31897 }
31900 }
31903 {
31907 }
31910 NULL);
31916 }
31918 /* OpenMP 4.0:
31919 device ( expression ) */
31921 static tree
31923 location_t location)
31924 {
31946 }
31948 /* OpenMP 4.0:
31949 dist_schedule ( static )
31950 dist_schedule ( static , expression ) */
31952 static tree
31954 location_t location)
31955 {
31968 {
31979 }
31984 location);
31988 invalid_kind:
31990 resync_fail:
31995 }
31997 /* OpenMP 4.0:
31998 proc_bind ( proc-bind-kind )
32000 proc-bind-kind:
32001 master | close | spread */
32003 static tree
32005 location_t location)
32006 {
32007 tree c;
32014 {
32024 else
32026 }
32027 else
32036 location);
32041 invalid_kind:
32043 resync_fail:
32048 }
32050 /* OpenACC:
32051 async [( int-expr )] */
32053 static tree
32055 {
32062 {
32071 }
32081 }
32083 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32084 is a bitmask in MASK. Return the list of clauses found. */
32086 static tree
32090 {
32095 {
32096 location_t here;
32097 pragma_omp_clause c_kind;
32098 omp_clause_code code;
32109 {
32161 clauses);
32179 OMP_CLAUSE_INDEPENDENT,
32191 clauses);
32197 clauses);
32221 clauses);
32243 clauses);
32255 clauses);
32269 }
32274 {
32275 /* Remove the invalid clause(s) from the list to avoid
32276 confusing the rest of the compiler. */
32279 }
32280 }
32282 saw_error:
32289 }
32291 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32292 is a bitmask in MASK. Return the list of clauses found; the result
32293 of clause default goes in *pdefault. */
32295 static tree
32299 {
32305 {
32306 pragma_omp_clause c_kind;
32317 {
32329 clauses);
32343 clauses);
32363 clauses);
32368 clauses);
32378 clauses);
32412 clauses);
32426 clauses);
32443 OMP_CLAUSE_NOTINBRANCH,
32452 {
32453 clause_not_first:
32457 }
32487 clauses);
32488 else
32498 clauses);
32516 {
32524 }
32567 clauses
32573 clauses
32585 }
32590 {
32591 /* Remove the invalid clause(s) from the list to avoid
32592 confusing the rest of the compiler. */
32595 }
32596 }
32597 saw_error:
32598 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32599 no reason to skip to the end. */
32603 {
32606 else
32608 }
32610 }
32612 /* OpenMP 2.5:
32613 structured-block:
32614 statement
32616 In practice, we're also interested in adding the statement to an
32617 outer node. So it is convenient if we work around the fact that
32618 cp_parser_statement calls add_stmt. */
32620 static unsigned
32622 {
32625 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32626 This preserves the "not within loop or switch" style error messages
32627 for nonsense cases like
32628 void foo() {
32629 #pragma omp single
32630 break;
32631 }
32632 */
32637 }
32639 static void
32641 {
32643 }
32645 static tree
32647 {
32655 }
32657 /* OpenMP 2.5:
32658 # pragma omp atomic new-line
32659 expression-stmt
32661 expression-stmt:
32662 x binop= expr | x++ | ++x | x-- | --x
32663 binop:
32664 +, *, -, /, &, ^, |, <<, >>
32666 where x is an lvalue expression with scalar type.
32668 OpenMP 3.1:
32669 # pragma omp atomic new-line
32670 update-stmt
32672 # pragma omp atomic read new-line
32673 read-stmt
32675 # pragma omp atomic write new-line
32676 write-stmt
32678 # pragma omp atomic update new-line
32679 update-stmt
32681 # pragma omp atomic capture new-line
32682 capture-stmt
32684 # pragma omp atomic capture new-line
32685 capture-block
32687 read-stmt:
32688 v = x
32689 write-stmt:
32690 x = expr
32691 update-stmt:
32692 expression-stmt | x = x binop expr
32693 capture-stmt:
32694 v = expression-stmt
32695 capture-block:
32696 { v = x; update-stmt; } | { update-stmt; v = x; }
32698 OpenMP 4.0:
32699 update-stmt:
32700 expression-stmt | x = x binop expr | x = expr binop x
32701 capture-stmt:
32702 v = update-stmt
32703 capture-block:
32704 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32706 where x and v are lvalue expressions with scalar type. */
32708 static void
32710 {
32718 {
32723 {
32729 }
32730 }
32732 {
32744 else
32748 }
32750 {
32756 {
32761 {
32764 }
32765 }
32766 }
32770 {
32780 else
32785 {
32786 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32787 opcode. */
32792 }
32796 {
32799 }
32800 else
32801 {
32807 }
32810 }
32812 restart:
32816 {
32823 /* FALLTHROUGH */
32833 /* FALLTHROUGH */
32848 /* Undo effects of boolean_increment for post {in,de}crement. */
32850 /* FALLTHRU */
32854 {
32855 /* Undo effects of boolean_increment. */
32857 {
32858 /* This is pre or post increment. */
32863 && !structured_block
32867 }
32868 }
32869 /* FALLTHRU */
32872 {
32907 {
32911 }
32914 {
32920 {
32925 }
32927 {
32939 {
32941 {
32946 }
32947 else
32949 }
32953 }
32956 {
32963 }
32967 }
32971 {
32974 {
32982 }
32984 {
32989 }
33024 }
33035 /* FALLTHROUGH */
33040 }
33047 }
33048 stmt_done:
33050 {
33061 }
33063 {
33066 }
33067 done:
33073 saw_error:
33076 {
33080 {
33084 }
33085 }
33086 }
33089 /* OpenMP 2.5:
33090 # pragma omp barrier new-line */
33092 static void
33094 {
33097 }
33099 /* OpenMP 2.5:
33100 # pragma omp critical [(name)] new-line
33101 structured-block
33103 OpenMP 4.5:
33104 # pragma omp critical [(name) [hint(expression)]] new-line
33105 structured-block */
33107 #define OMP_CRITICAL_CLAUSE_MASK \
33108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33110 static tree
33112 {
33116 {
33130 OMP_CRITICAL_CLAUSE_MASK,
33132 }
33133 else
33138 }
33140 /* OpenMP 2.5:
33141 # pragma omp flush flush-vars[opt] new-line
33143 flush-vars:
33144 ( variable-list ) */
33146 static void
33148 {
33154 }
33156 /* Helper function, to parse omp for increment expression. */
33158 static tree
33160 {
33165 {
33168 }
33171 {
33180 /* Fall through: OpenMP disallows NE_EXPR. */
33183 }
33185 /* If decl is an iterator, preserve LHS and RHS of the relational
33186 expr until finish_omp_for. */
33197 }
33199 /* Helper function, to parse omp for increment expression. */
33201 static tree
33203 {
33207 cp_id_kind idk;
33211 {
33220 }
33229 {
33234 }
33241 {
33245 }
33258 do
33259 {
33266 {
33268 {
33271 else
33273 tf_warning_or_error);
33274 }
33275 else
33278 }
33279 }
33283 {
33289 }
33290 else
33294 }
33296 /* Parse the initialization statement of either an OpenMP for loop or
33297 a Cilk Plus for loop.
33299 Return true if the resulting construct should have an
33300 OMP_CLAUSE_PRIVATE added to it. */
33302 static tree
33311 {
33317 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33319 init-expr:
33320 var = lb
33321 integer-type var = lb
33322 random-access-iterator-type var = lb
33323 pointer-type var = lb
33324 */
33325 cp_decl_specifier_seq type_specifiers;
33327 /* First, try to parse as an initialized declaration. See
33328 cp_parser_condition, from whence the bulk of this is copied. */
33335 {
33336 /* If parsing a type specifier seq succeeded, then this
33337 MUST be a initialized declaration. */
33342 CP_PARSER_DECLARATOR_NAMED,
33353 else
33354 {
33364 {
33366 CPP_OPEN_PAREN))
33367 {
33371 else
33374 }
33375 else
33376 /* Trigger an error. */
33381 }
33385 {
33393 {
33396 auto_node);
33401 }
33404 asm_specification,
33405 LOOKUP_ONLYCONVERTING);
33408 {
33411 }
33412 else
33415 }
33416 else
33417 {
33418 /* Consume '='. */
33422 non_class:
33425 else
33428 asm_specification,
33429 LOOKUP_ONLYCONVERTING);
33430 }
33434 }
33435 }
33436 else
33437 {
33438 cp_id_kind idk;
33439 /* If parsing a type specifier sequence failed, then
33440 this MUST be a simple expression. */
33449 && decl
33452 {
33463 {
33468 }
33473 }
33475 && decl
33478 {
33479 tree rhs;
33487 rhs,
33488 tf_warning_or_error));
33491 }
33492 else
33493 {
33498 {
33502 }
33503 }
33504 }
33506 }
33508 /* Parse the restricted form of the for statement allowed by OpenMP. */
33510 static tree
33513 {
33517 location_t loc_first;
33528 {
33531 }
33534 {
33540 }
33542 {
33545 {
33547 "%<linear%> clause may not be specified together "
33550 }
33551 else
33553 }
33566 {
33569 location_t loc;
33573 {
33576 }
33579 {
33582 }
33591 add_private_clause
33598 {
33601 {
33607 }
33608 else
33610 }
33617 {
33622 {
33626 }
33629 {
33630 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33634 {
33637 }
33638 else
33639 {
33642 }
33644 }
33645 else
33646 {
33651 }
33652 }
33655 {
33656 tree c;
33658 {
33667 decl);
33671 decl);
33672 }
33674 {
33679 else
33684 {
33687 /* For linear, signal that we need to fill up
33688 the so far unknown linear step. */
33691 }
33692 }
33693 }
33702 {
33703 /* If decl is an iterator, preserve the operator on decl
33704 until finish_omp_for. */
33706 && ((processing_template_decl
33711 else
33715 }
33727 {
33730 }
33735 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33736 in between the collapsed for loops to be still considered perfectly
33737 nested. Hopefully the final version clarifies this.
33738 For now handle (multiple) {'s and empty statements. */
33740 do
33741 {
33745 {
33747 bracecount++;
33748 }
33752 else
33753 {
33760 }
33761 }
33765 {
33768 }
33769 }
33774 /* Note that we saved the original contents of this flag when we entered
33775 the structured block, and so we don't need to re-save it here. */
33778 else
33781 /* Note that the grammar doesn't call for a structured block here,
33782 though the loop as a whole is a structured block. */
33789 else
33794 {
33796 {
33798 nbraces--;
33799 }
33802 else
33803 {
33805 {
33808 }
33813 }
33814 }
33821 }
33823 /* Helper function for OpenMP parsing, split clauses and call
33824 finish_omp_clauses on each of the set of clauses afterwards. */
33826 static void
33829 {
33835 }
33837 /* OpenMP 4.0:
33838 #pragma omp simd simd-clause[optseq] new-line
33839 for-loop */
33841 #define OMP_SIMD_CLAUSE_MASK \
33842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33851 static tree
33855 {
33866 {
33870 OMP_CLAUSE_ORDERED);
33872 {
33874 "%<ordered%> clause with parameter may not be specified "
33877 }
33878 }
33889 }
33891 /* OpenMP 2.5:
33892 #pragma omp for for-clause[optseq] new-line
33893 for-loop
33895 OpenMP 4.0:
33896 #pragma omp for simd for-simd-clause[optseq] new-line
33897 for-loop */
33899 #define OMP_FOR_CLAUSE_MASK \
33900 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33910 static tree
33914 {
33923 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33928 {
33933 {
33957 }
33958 }
33960 {
33963 }
33965 /* Composite distribute parallel for disallows linear clause. */
33972 {
33975 }
33986 }
33988 /* OpenMP 2.5:
33989 # pragma omp master new-line
33990 structured-block */
33992 static tree
33994 {
33998 }
34000 /* OpenMP 2.5:
34001 # pragma omp ordered new-line
34002 structured-block
34004 OpenMP 4.5:
34005 # pragma omp ordered ordered-clauses new-line
34006 structured-block */
34008 #define OMP_ORDERED_CLAUSE_MASK \
34009 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34012 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34013 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34015 static bool
34018 {
34022 {
34026 }
34029 {
34034 {
34036 {
34038 "%<depend%> clause may only be used in compound "
34042 }
34043 tree clauses
34045 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34049 }
34050 }
34052 tree clauses
34058 }
34060 /* OpenMP 2.5:
34062 section-scope:
34063 { section-sequence }
34065 section-sequence:
34066 section-directive[opt] structured-block
34067 section-sequence section-directive structured-block */
34069 static tree
34071 {
34083 {
34087 }
34090 {
34098 {
34102 }
34104 {
34107 }
34112 }
34123 }
34125 /* OpenMP 2.5:
34126 # pragma omp sections sections-clause[optseq] newline
34127 sections-scope */
34129 #define OMP_SECTIONS_CLAUSE_MASK \
34130 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34136 static tree
34139 {
34151 {
34154 }
34161 }
34163 /* OpenMP 2.5:
34164 # pragma omp parallel parallel-clause[optseq] new-line
34165 structured-block
34166 # pragma omp parallel for parallel-for-clause[optseq] new-line
34167 structured-block
34168 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34169 structured-block
34171 OpenMP 4.0:
34172 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34173 structured-block */
34175 #define OMP_PARALLEL_CLAUSE_MASK \
34176 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34186 static tree
34190 {
34197 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34203 {
34211 if_p);
34215 if_p);
34218 block);
34223 }
34224 /* When combined with distribute, parallel has to be followed by for.
34225 #pragma omp target parallel is allowed though. */
34229 {
34233 }
34235 {
34238 }
34240 {
34244 {
34254 block);
34257 }
34258 }
34262 {
34265 }
34273 }
34275 /* OpenMP 2.5:
34276 # pragma omp single single-clause[optseq] new-line
34277 structured-block */
34279 #define OMP_SINGLE_CLAUSE_MASK \
34280 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34285 static tree
34287 {
34297 }
34299 /* OpenMP 3.0:
34300 # pragma omp task task-clause[optseq] new-line
34301 structured-block */
34303 #define OMP_TASK_CLAUSE_MASK \
34304 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34315 static tree
34317 {
34328 }
34330 /* OpenMP 3.0:
34331 # pragma omp taskwait new-line */
34333 static void
34335 {
34338 }
34340 /* OpenMP 3.1:
34341 # pragma omp taskyield new-line */
34343 static void
34345 {
34348 }
34350 /* OpenMP 4.0:
34351 # pragma omp taskgroup new-line
34352 structured-block */
34354 static tree
34356 {
34360 if_p));
34361 }
34364 /* OpenMP 2.5:
34365 # pragma omp threadprivate (variable-list) */
34367 static void
34369 {
34370 tree vars;
34376 }
34378 /* OpenMP 4.0:
34379 # pragma omp cancel cancel-clause[optseq] new-line */
34381 #define OMP_CANCEL_CLAUSE_MASK \
34382 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34388 static void
34390 {
34394 }
34396 /* OpenMP 4.0:
34397 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34399 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34400 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34405 static void
34407 {
34408 tree clauses;
34412 {
34417 {
34420 }
34421 }
34423 {
34427 }
34430 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34432 pragma_tok);
34434 }
34436 /* OpenMP 4.0:
34437 #pragma omp distribute distribute-clause[optseq] new-line
34438 for-loop */
34440 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34441 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34447 static tree
34451 {
34460 {
34468 else
34471 {
34477 {
34481 else
34484 }
34490 else
34504 }
34505 }
34507 {
34510 }
34515 {
34518 }
34529 }
34531 /* OpenMP 4.0:
34532 # pragma omp teams teams-clause[optseq] new-line
34533 structured-block */
34535 #define OMP_TEAMS_CLAUSE_MASK \
34536 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34544 static tree
34548 {
34557 {
34561 {
34585 }
34586 }
34588 {
34591 }
34596 {
34599 }
34607 }
34609 /* OpenMP 4.0:
34610 # pragma omp target data target-data-clause[optseq] new-line
34611 structured-block */
34613 #define OMP_TARGET_DATA_CLAUSE_MASK \
34614 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34619 static tree
34621 {
34622 tree clauses
34627 {
34630 {
34647 "%<#pragma omp target data%> with map-type other "
34648 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34652 }
34654 }
34657 {
34660 "%<#pragma omp target data%> must contain at least "
34663 }
34674 }
34676 /* OpenMP 4.5:
34677 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34678 structured-block */
34680 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34687 static tree
34690 {
34693 {
34698 {
34701 }
34702 }
34704 {
34708 }
34711 {
34713 "%<#pragma omp target enter data%> may only be "
34717 }
34719 tree clauses
34724 {
34727 {
34740 "%<#pragma omp target enter data%> with map-type other "
34744 }
34746 }
34749 {
34752 "%<#pragma omp target enter data%> must contain at least "
34755 }
34762 }
34764 /* OpenMP 4.5:
34765 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34766 structured-block */
34768 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34775 static tree
34778 {
34781 {
34786 {
34789 }
34790 }
34792 {
34796 }
34799 {
34801 "%<#pragma omp target exit data%> may only be "
34805 }
34807 tree clauses
34812 {
34815 {
34829 "%<#pragma omp target exit data%> with map-type other "
34830 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34834 }
34836 }
34839 {
34842 "%<#pragma omp target exit data%> must contain at least "
34845 }
34852 }
34854 /* OpenMP 4.0:
34855 # pragma omp target update target-update-clause[optseq] new-line */
34857 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34858 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34865 static bool
34868 {
34870 {
34872 "%<#pragma omp target update%> may only be "
34876 }
34878 tree clauses
34883 {
34885 "%<#pragma omp target update%> must contain at least one "
34888 }
34896 }
34898 /* OpenMP 4.0:
34899 # pragma omp target target-clause[optseq] new-line
34900 structured-block */
34902 #define OMP_TARGET_CLAUSE_MASK \
34903 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34913 static bool
34916 {
34920 {
34924 }
34927 {
34939 {
34947 {
34948 tree stmt;
34950 {
34953 OMP_TARGET_CLAUSE_MASK,
34958 OMP_TARGET_CLAUSE_MASK,
34963 OMP_TARGET_CLAUSE_MASK,
34968 }
34970 }
34975 {
34979 if_p);
34984 if_p);
34989 if_p);
34993 }
34999 {
35000 /* For combined target teams, ensure the num_teams and
35001 thread_limit clause expressions are evaluated on the host,
35002 before entering the target construct. */
35003 tree c;
35009 {
35018 OMP_CLAUSE_FIRSTPRIVATE);
35023 }
35024 }
35033 }
35035 {
35038 }
35040 {
35044 }
35046 {
35050 }
35052 {
35056 }
35058 {
35061 }
35062 }
35077 check_clauses:
35079 {
35082 {
35096 "%<#pragma omp target%> with map-type other "
35097 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35101 }
35103 }
35105 }
35107 /* OpenACC 2.0:
35108 # pragma acc cache (variable-list) new-line
35109 */
35111 static tree
35113 {
35128 }
35130 /* OpenACC 2.0:
35131 # pragma acc data oacc-data-clause[optseq] new-line
35132 structured-block */
35134 #define OACC_DATA_CLAUSE_MASK \
35135 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35147 static tree
35149 {
35162 }
35164 /* OpenACC 2.0:
35165 # pragma acc host_data <clauses> new-line
35166 structured-block */
35168 #define OACC_HOST_DATA_CLAUSE_MASK \
35169 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35171 static tree
35173 {
35186 }
35188 /* OpenACC 2.0:
35189 # pragma acc declare oacc-data-clause[optseq] new-line
35190 */
35192 #define OACC_DECLARE_CLAUSE_MASK \
35193 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35206 static tree
35208 {
35217 {
35221 }
35224 {
35228 {
35232 }
35235 {
35244 /* Generated by c_finish_omp_clauses from array sections;
35245 avoid spurious diagnostics. */
35252 {
35254 "%qD must be a global variable in"
35256 decl);
35259 }
35264 {
35268 }
35270 {
35272 "invalid use of %<extern%> variable %qD "
35276 }
35278 {
35280 "invalid use of %<global%> variable %qD "
35284 }
35286 }
35291 {
35296 }
35299 {
35300 tree id;
35304 else
35310 {
35313 {
35316 {
35320 }
35321 }
35322 }
35323 }
35324 }
35337 }
35339 /* OpenACC 2.0:
35340 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35342 or
35344 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35346 LOC is the location of the #pragma token.
35347 */
35349 #define OACC_ENTER_DATA_CLAUSE_MASK \
35350 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35358 #define OACC_EXIT_DATA_CLAUSE_MASK \
35359 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35365 static tree
35368 {
35373 {
35379 }
35384 {
35388 }
35395 else
35400 {
35404 }
35412 }
35414 /* OpenACC 2.0:
35415 # pragma acc loop oacc-loop-clause[optseq] new-line
35416 structured-block */
35418 #define OACC_LOOP_CLAUSE_MASK \
35419 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35430 static tree
35433 {
35442 {
35448 }
35457 }
35459 /* OpenACC 2.0:
35460 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35461 structured-block
35463 or
35465 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35466 structured-block
35467 */
35469 #define OACC_KERNELS_CLAUSE_MASK \
35470 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35485 #define OACC_PARALLEL_CLAUSE_MASK \
35486 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35507 static tree
35510 {
35511 omp_clause_mask mask;
35514 {
35527 }
35530 {
35534 {
35537 tree clauses;
35539 if_p);
35541 }
35542 }
35551 }
35553 /* OpenACC 2.0:
35554 # pragma acc update oacc-update-clause[optseq] new-line
35555 */
35557 #define OACC_UPDATE_CLAUSE_MASK \
35558 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35565 static tree
35567 {
35574 {
35576 "%<#pragma acc update%> must contain at least one "
35579 }
35587 }
35589 /* OpenACC 2.0:
35590 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35592 LOC is the location of the #pragma token.
35593 */
35595 #define OACC_WAIT_CLAUSE_MASK \
35596 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35598 static tree
35600 {
35614 }
35616 /* OpenMP 4.0:
35617 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35619 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35620 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35627 static void
35630 {
35632 cp_omp_declare_simd_data data;
35634 {
35639 }
35650 {
35654 {
35667 }
35672 "%<#pragma omp declare simd%> not immediately followed by "
35676 }
35677 }
35679 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35680 This function is modelled similar to the late parsing of omp declare
35681 simd. */
35683 static tree
35685 {
35692 {
35694 "used in the same function marked as a Cilk Plus SIMD-enabled "
35700 }
35702 {
35706 }
35711 {
35718 NULL);
35732 }
35738 }
35740 /* Finalize #pragma omp declare simd clauses after direct declarator has
35741 been parsed, and put that into "omp declare simd" attribute. */
35743 static tree
35745 {
35751 {
35756 }
35761 {
35779 }
35783 }
35786 /* OpenMP 4.0:
35787 # pragma omp declare target new-line
35788 declarations and definitions
35789 # pragma omp end declare target new-line
35791 OpenMP 4.5:
35792 # pragma omp declare target ( extended-list ) new-line
35794 # pragma omp declare target declare-target-clauses[seq] new-line */
35796 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35797 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35800 static void
35802 {
35805 clauses
35809 {
35811 clauses);
35814 }
35815 else
35816 {
35820 }
35823 "%<#pragma omp declare target%> with clauses in between "
35824 "%<#pragma omp declare target%> without clauses and "
35827 {
35833 {
35836 }
35837 else
35840 {
35842 "%qD specified both in declare target %<link%> and %<to%>"
35845 }
35847 {
35851 {
35854 {
35858 }
35859 }
35860 }
35861 }
35862 }
35864 static void
35866 {
35869 {
35872 }
35874 {
35878 {
35881 }
35884 else
35885 {
35889 }
35890 }
35891 else
35892 {
35896 }
35900 "%<#pragma omp end declare target%> without corresponding "
35902 else
35904 }
35906 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35907 expression and optional initializer clause of
35908 #pragma omp declare reduction. We store the expression(s) as
35909 either 3, 6 or 7 special statements inside of the artificial function's
35910 body. The first two statements are DECL_EXPRs for the artificial
35911 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35912 expression that uses those variables.
35913 If there was any INITIALIZER clause, this is followed by further statements,
35914 the fourth and fifth statements are DECL_EXPRs for the artificial
35915 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35916 constructor variant (first token after open paren is not omp_priv),
35917 then the sixth statement is a statement with the function call expression
35918 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35919 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35920 to initialize the OMP_PRIV artificial variable and there is seventh
35921 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35923 static bool
35925 {
35937 tree combiner;
35952 {
35955 }
35958 {
35965 {
35968 }
35984 {
35988 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35992 == CPP_CLOSE_PAREN
35995 {
35999 }
36004 }
36005 else
36006 {
36022 {
36027 }
36029 tree arg;
36042 }
36053 }
36059 }
36061 /* OpenMP 4.0
36062 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36063 initializer-clause[opt] new-line
36065 initializer-clause:
36066 initializer (omp_priv initializer)
36067 initializer (function-name (argument-list)) */
36069 static void
36072 {
36082 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36089 {
36121 }
36133 /* Types may not be defined in declare reduction type list. */
36136 parser->type_definition_forbidden_message
36142 saved_colon_doesnt_start_class_def_p
36147 {
36151 ;
36172 else
36177 else
36179 }
36181 /* Restore the saved message. */
36184 parser->colon_doesnt_start_class_def_p
36189 {
36190 fail:
36193 }
36199 {
36200 tree fntype
36203 NULL_TREE);
36223 {
36228 }
36230 {
36232 {
36241 }
36248 }
36249 else
36250 {
36253 }
36256 else
36259 {
36262 }
36264 {
36267 else
36272 }
36277 else
36278 {
36287 }
36294 }
36298 done:
36299 /* Free any declarators allocated. */
36301 }
36303 /* OpenMP 4.0
36304 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36305 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36306 initializer-clause[opt] new-line
36307 #pragma omp declare target new-line */
36309 static void
36312 {
36314 {
36319 {
36322 context);
36324 }
36327 {
36330 context);
36332 }
36334 {
36337 }
36339 {
36343 }
36344 }
36348 }
36350 /* OpenMP 4.5:
36351 #pragma omp taskloop taskloop-clause[optseq] new-line
36352 for-loop
36354 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36355 for-loop */
36357 #define OMP_TASKLOOP_CLAUSE_MASK \
36358 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36373 static tree
36377 {
36386 {
36391 {
36415 }
36416 }
36418 {
36421 }
36426 {
36429 }
36435 if_p);
36441 }
36444 /* OpenACC 2.0:
36445 # pragma acc routine oacc-routine-clause[optseq] new-line
36446 function-definition
36448 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36449 */
36451 #define OACC_ROUTINE_CLAUSE_MASK \
36452 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36458 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36459 component, which must resolve to a declared namespace-scope
36460 function. The clauses are either processed directly (for a named
36461 function), or defered until the immediatley following declaration
36462 is parsed. */
36464 static void
36467 {
36470 cp_omp_declare_simd_data data;
36472 {
36478 }
36481 /* Create a dummy claue, to record location. */
36485 {
36490 }
36492 /* Look for optional '( name )'. */
36494 {
36496 {
36505 "%<#pragma acc routine%> not followed by a "
36510 }
36515 /* We parse the name as an id-expression. If it resolves to
36516 anything other than a non-overloaded function at namespace
36517 scope, it's an error. */
36531 {
36535 }
36537 /* Build a chain of clauses. */
36542 cp_lexer_peek_token
36545 /* Force clauses to be non-null, by attaching context to it. */
36551 {
36555 }
36557 /* Perhaps we should use the same rule as declarations in different
36558 namespaces? */
36560 {
36565 }
36568 {
36573 }
36580 }
36581 else
36582 {
36601 {
36602 /* Create an empty list of clauses. */
36604 NULL_TREE);
36615 }
36616 }
36617 }
36619 /* Finalize #pragma acc routine clauses after direct declarator has
36620 been parsed, and put that into "oacc function" attribute. */
36622 static tree
36624 {
36628 location_t loc;
36634 {
36639 }
36656 /* Force clauses to be non-null, by attaching context to it. */
36661 }
36663 /* Apply any saved OpenACC routine clauses to a just-parsed
36664 declaration. */
36666 static void
36668 {
36670 {
36678 {
36681 }
36684 {
36687 }
36690 {
36692 "%<#pragma acc routine%> not followed by a function "
36695 }
36698 {
36700 fndecl);
36702 }
36705 {
36709 }
36711 /* Process for function attrib */
36715 /* Add an "omp target" attribute. */
36719 }
36720 }
36722 /* Main entry point to OpenMP statement pragmas. */
36724 static void
36726 {
36727 tree stmt;
36732 {
36755 if_p);
36760 if_p);
36777 if_p);
36782 if_p);
36790 if_p);
36799 if_p);
36813 if_p);
36818 if_p);
36822 }
36825 }
36826 \f
36827 /* Transactional Memory parsing routines. */
36829 /* Parse a transaction attribute.
36831 txn-attribute:
36832 attribute
36833 [ [ identifier ] ]
36835 We use this instead of cp_parser_attributes_opt for transactions to avoid
36836 the pedwarn in C++98 mode. */
36838 static tree
36840 {
36855 {
36859 /* For keywords, use the canonical spelling,
36860 not the parsed identifier. */
36864 }
36865 else
36869 error1:
36872 }
36874 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36876 transaction-statement:
36877 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36878 compound-statement
36879 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36880 */
36882 static tree
36884 {
36895 else
36896 {
36900 }
36902 /* Parse a noexcept specification. */
36906 {
36907 /* cancel-and-throw is unimplemented. */
36910 }
36911 else
36914 /* Keep track if we're in the lexical scope of an outer transaction. */
36926 }
36928 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36930 transaction-expression:
36931 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36932 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36933 */
36935 static tree
36937 {
36950 keyword == RID_TRANSACTION_RELAXED
36964 /* Set this early. This might mean that we allow transaction_cancel in
36965 an expression that we find out later actually has to be a constexpr.
36966 However, we expect that cxx_constant_value will be able to deal with
36967 this; also, if the noexcept has no constexpr, then what we parse next
36968 really is a transaction's body. */
36971 /* Parse a noexcept specification. */
36977 {
36984 }
36985 else
36986 {
36987 /* The only expression that is available got parsed for the noexcept
36988 already. noexcept is true then. */
36991 }
37000 }
37002 /* Parse a function-transaction-block.
37004 function-transaction-block:
37005 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37006 function-body
37007 __transaction_atomic txn-attribute[opt] function-try-block
37008 __transaction_relaxed ctor-initializer[opt] function-body
37009 __transaction_relaxed function-try-block
37010 */
37012 static bool
37014 {
37030 else
37031 {
37035 }
37043 else
37044 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37052 }
37054 /* Parse a __transaction_cancel statement.
37056 cancel-statement:
37057 __transaction_cancel txn-attribute[opt] ;
37058 __transaction_cancel txn-attribute[opt] throw-expression ;
37060 ??? Cancel and throw is not yet implemented. */
37062 static tree
37064 {
37070 RT_TRANSACTION_CANCEL);
37077 /* ??? Parse cancel-and-throw here. */
37082 {
37086 }
37088 {
37092 }
37094 {
37097 {
37103 }
37104 }
37106 {
37110 }
37116 }
37117 \f
37118 /* The parser. */
37122 \f
37123 /* Special handling for the first token or line in the file. The first
37124 thing in the file might be #pragma GCC pch_preprocess, which loads a
37125 PCH file, which is a GC collection point. So we need to handle this
37126 first pragma without benefit of an existing lexer structure.
37128 Always returns one token to the caller in *FIRST_TOKEN. This is
37129 either the true first token of the file, or the first token after
37130 the initial pragma. */
37132 static void
37134 {
37143 {
37150 }
37151 else
37154 /* Skip to the end of the pragma. */
37158 /* Now actually load the PCH file. */
37162 /* Read one more token to return to our caller. We have to do this
37163 after reading the PCH file in, since its pointers have to be
37164 live. */
37166 }
37168 /* Parses the grainsize pragma for the _Cilk_for statement.
37169 Syntax:
37170 #pragma cilk grainsize = <VALUE>. */
37172 static void
37174 {
37176 {
37181 {
37184 }
37186 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37189 else
37191 "%<#pragma cilk grainsize%> is not followed by "
37194 }
37196 }
37198 /* Normal parsing of a pragma token. Here we can (and must) use the
37199 regular lexer. */
37201 static bool
37203 {
37206 tree stmt;
37217 {
37225 {
37235 }
37240 {
37250 }
37255 {
37261 "%<#pragma omp taskwait%> may only be "
37266 }
37271 {
37277 "%<#pragma omp taskyield%> may only be "
37282 }
37287 {
37293 "%<#pragma omp cancel%> may only be "
37298 }
37303 {
37309 "%<#pragma omp cancellation point%> may only be "
37314 }
37382 "%<#pragma omp section%> may only be used in "
37387 {
37389 {
37393 }
37400 {
37403 }
37406 }
37410 {
37414 }
37422 {
37426 }
37428 /* Ignore the pragma if Cilk Plus is not enabled. */
37430 {
37433 }
37434 else
37435 {
37439 }
37446 bad_stmt:
37449 }
37453 }
37455 /* The interface the pragma parsers have to the lexer. */
37457 enum cpp_ttype
37459 {
37471 else
37472 {
37476 }
37479 }
37481 \f
37482 /* External interface. */
37484 /* Parse one entire translation unit. */
37486 void
37488 {
37501 }
37503 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37504 vectorlength clause:
37505 Syntax:
37506 vectorlength ( constant-expression ) */
37508 static tree
37511 {
37513 tree expr;
37514 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37515 safelen clause. Thus, vectorlength is represented as OMP 4.0
37516 safelen. For SIMD-enabled function it is represented by OMP 4.0
37517 simdlen. */
37520 loc);
37521 else
37523 loc);
37531 /* If expr == error_mark_node, then don't emit any errors nor
37532 create a clause. if any of the above functions returns
37533 error mark node then they would have emitted an error message. */
37535 ;
37543 else
37544 {
37545 tree c;
37547 {
37552 }
37553 else
37554 {
37559 }
37560 }
37565 }
37567 /* Handles the Cilk Plus #pragma simd linear clause.
37568 Syntax:
37569 linear ( simd-linear-variable-list )
37571 simd-linear-variable-list:
37572 simd-linear-variable
37573 simd-linear-variable-list , simd-linear-variable
37575 simd-linear-variable:
37576 id-expression
37577 id-expression : simd-linear-step
37579 simd-linear-step:
37580 conditional-expression */
37582 static tree
37584 {
37590 {
37594 }
37599 {
37602 {
37606 }
37613 {
37617 }
37618 else
37619 {
37623 /* If present, parse the linear step. Otherwise, assume the default
37624 value of 1. */
37626 {
37633 {
37634 /* If an error has occurred, then the whole pragma is
37635 considered ill-formed. Thus, no reason to keep
37636 parsing. */
37639 }
37647 else
37649 "step size must be an integer constant "
37651 }
37653 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37659 }
37664 else
37665 {
37670 }
37671 }
37675 }
37677 /* Returns the name of the next clause. If the clause is not
37678 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37679 token is not consumed. Otherwise, the appropriate enum from the
37680 pragma_simd_clause is returned and the token is consumed. */
37682 static pragma_omp_clause
37684 {
37685 pragma_omp_clause clause_type;
37702 else
37707 }
37709 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37711 static tree
37713 {
37718 {
37719 pragma_omp_clause c_kind;
37726 /* Use the OpenMP 4.0 equivalent function. */
37729 /* Use the OpenMP 4.0 equivalent function. */
37731 clauses);
37733 /* Use the OMP 4.0 equivalent function. */
37735 clauses);
37737 /* Use the OMP 4.0 equivalent function. */
37739 else
37740 {
37744 }
37745 }
37751 else
37753 }
37755 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37757 static void
37759 {
37766 {
37770 }
37779 }
37781 /* Main entry-point for parsing Cilk Plus _Cilk_for
37782 loops. The return value is error_mark_node
37783 when errors happen and CILK_FOR tree on success. */
37785 static tree
37787 {
37802 else
37808 }
37810 /* Create an identifier for a generic parameter type (a synthesized
37811 template parameter implied by `auto' or a concept identifier). */
37814 static tree
37816 {
37820 }
37822 /* Predicate that behaves as is_auto_or_concept but matches the parent
37823 node of the generic type rather than the generic type itself. This
37824 allows for type transformation in add_implicit_template_parms. */
37828 {
37830 }
37832 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37833 (creating a new template parameter list if necessary). Returns the newly
37834 created template type parm. */
37836 static tree
37838 {
37841 /* Before committing to modifying any scope, if we're in an
37842 implicit template scope, and we're trying to synthesize a
37843 constrained parameter, try to find a previous parameter with
37844 the same name. This is the same-type rule for abbreviated
37845 function templates. */
37847 {
37850 {
37852 {
37855 /* Return the TEMPLATE_PARM_INDEX. */
37858 }
37860 }
37861 }
37863 /* We are either continuing a function template that already contains implicit
37864 template parameters, creating a new fully-implicit function template, or
37865 extending an existing explicit function template with implicit template
37866 parameters. */
37874 {
37878 }
37879 else
37880 {
37881 /* Roll back to the existing template parameter scope (in the case of
37882 extending an explicit function template) or introduce a new template
37883 parameter scope ahead of the function parameter scope (or class scope
37884 in the case of out-of-line member definitions). The function scope is
37885 added back after template parameter synthesis below. */
37890 {
37893 }
37895 {
37896 /* If not defining a class, then any class scope is a scope level in
37897 an out-of-line member definition. In this case simply wind back
37898 beyond the first such scope to inject the template parameter list.
37899 Otherwise wind back to the class being defined. The latter can
37900 occur in class member friend declarations such as:
37902 class A {
37903 void foo (auto);
37904 };
37905 class B {
37906 friend void A::foo (auto);
37907 };
37909 The template parameter list synthesized for the friend declaration
37910 must be injected in the scope of 'B'. This can also occur in
37911 erroneous cases such as:
37913 struct A {
37914 struct B {
37915 void foo (auto);
37916 };
37917 void B::foo (auto) {}
37918 };
37920 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37921 but, nevertheless, the template parameter list synthesized for the
37922 declarator should be injected into the scope of 'A' as if the
37923 ill-formed template was specified explicitly. */
37926 {
37929 }
37930 }
37936 {
37937 /* Introduce a new template parameter list for implicit template
37938 parameters. */
37942 parser->implicit_template_scope
37949 }
37950 else
37951 {
37952 /* Synthesize implicit template parameters at the end of the explicit
37953 template parameter list. */
37960 parser->implicit_template_parms
37962 }
37963 }
37965 /* Synthesize a new template parameter and track the current template
37966 parameter chain with implicit_template_parms. */
37970 tree synth_tmpl_parm;
37974 synth_tmpl_parm
37977 synth_tmpl_parm
37979 else
37980 {
37984 }
37986 // Attach the constraint to the parm before processing.
37989 tree new_parm
37991 input_location,
37992 node,
37996 // Chain the new parameter to the list of implicit parameters.
37998 parser->implicit_template_parms
38000 else
38005 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38008 /* If creating a fully implicit function template, start the new implicit
38009 template parameter list with this synthesized type, otherwise grow the
38010 current template parameter list. */
38013 {
38020 }
38021 else
38022 {
38027 }
38029 // If the new parameter was constrained, we need to add that to the
38030 // constraints in the template parameter list.
38032 {
38036 }
38041 }
38043 /* Finish the declaration of a fully implicit function template. Such a
38044 template has no explicit template parameter list so has not been through the
38045 normal template head and tail processing. synthesize_implicit_template_parm
38046 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38047 provided if the declaration is a class member such that its template
38048 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38049 form is returned. Otherwise NULL_TREE is returned. */
38051 static tree
38053 {
38058 {
38062 }
38072 }