| blob | c4941a0599692ae818f54e1b73f6058894d352a1 |
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. */
7191 /* The identifier following the `->' or `.' is not qualified. */
7197 /* Enter the scope corresponding to the type of the object
7198 given by the POSTFIX_EXPRESSION. */
7200 {
7202 /* According to the standard, no expression should ever have
7203 reference type. Unfortunately, we do not currently match
7204 the standard in this respect in that our internal representation
7205 of an expression may have reference type even when the standard
7206 says it does not. Therefore, we have to manually obtain the
7207 underlying type here. */
7209 /* The type of the POSTFIX_EXPRESSION must be complete. */
7211 {
7215 }
7216 /* Unlike the object expression in other contexts, *this is not
7217 required to be of complete type for purposes of class member
7218 access (5.2.5) outside the member function body. */
7222 /* Let the name lookup machinery know that we are processing a
7223 class member access expression. */
7225 /* If something went wrong, we want to be able to discern that case,
7226 as opposed to the case where there was no SCOPE due to the type
7227 of expression being dependent. */
7230 /* If the SCOPE was erroneous, make the various semantic analysis
7231 functions exit quickly -- and without issuing additional error
7232 messages. */
7235 }
7236 else
7237 /* Tell cp_parser_lookup_name that there was an object, even though it's
7238 type-dependent. */
7241 /* Assume this expression is not a pseudo-destructor access. */
7244 /* If the SCOPE is a scalar type, then, if this is a valid program,
7245 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7246 is type dependent, it can be pseudo-destructor-name or something else.
7247 Try to parse it as pseudo-destructor-name first. */
7249 {
7250 tree s;
7251 tree type;
7254 /* Parse the pseudo-destructor-name. */
7263 {
7265 postfix_expression
7268 }
7269 }
7272 {
7273 /* If the SCOPE is not a scalar type, we are looking at an
7274 ordinary class member access expression, rather than a
7275 pseudo-destructor-name. */
7278 /* Parse the id-expression. */
7279 name = (cp_parser_id_expression
7286 /* In general, build a SCOPE_REF if the member name is qualified.
7287 However, if the name was not dependent and has already been
7288 resolved; there is no need to build the SCOPE_REF. For example;
7290 struct X { void f(); };
7291 template <typename T> void f(T* t) { t->X::f(); }
7293 Even though "t" is dependent, "X::f" is not and has been resolved
7294 to a BASELINK; there is no need to include scope information. */
7296 /* But we do need to remember that there was an explicit scope for
7297 virtual function calls. */
7301 /* If the name is a template-id that names a type, we will get a
7302 TYPE_DECL here. That is invalid code. */
7304 {
7307 }
7308 else
7309 {
7311 {
7313 {
7317 }
7318 else
7321 name,
7322 template_p);
7326 }
7328 adjust_result_of_qualified_name_lookup
7330 postfix_expression
7332 template_p,
7333 tf_warning_or_error);
7334 /* Build a location e.g.:
7335 ptr->access_expr
7336 ~~~^~~~~~~~~~~~~
7337 where the caret is at the deref token, ranging from
7338 the start of postfix_expression to the end of the access expr. */
7339 location_t end_loc
7341 location_t combined_loc
7344 }
7345 }
7347 /* We no longer need to look up names in the scope of the object on
7348 the left-hand side of the `.' or `->' operator. */
7351 /* Outside of offsetof, these operators may not appear in
7352 constant-expressions. */
7354 && (cp_parser_non_integral_constant_expression
7359 }
7361 /* Parse a parenthesized expression-list.
7363 expression-list:
7364 assignment-expression
7365 expression-list, assignment-expression
7367 attribute-list:
7368 expression-list
7369 identifier
7370 identifier, expression-list
7372 CAST_P is true if this expression is the target of a cast.
7374 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7375 argument pack.
7377 Returns a vector of trees. Each element is a representation of an
7378 assignment-expression. NULL is returned if the ( and or ) are
7379 missing. An empty, but allocated, vector is returned on no
7380 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7381 if we are parsing an attribute list for an attribute that wants a
7382 plain identifier argument, normal_attr for an attribute that wants
7383 an expression, or non_attr if we aren't parsing an attribute list. If
7384 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7385 not all of the expressions in the list were constant.
7386 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7387 will be written to with the location of the closing parenthesis. If
7388 an error occurs, it may or may not be written to. */
7397 {
7403 /* Assume all the expressions will be constant. */
7412 /* Within a parenthesized expression, a `>' token is always
7413 the greater-than operator. */
7414 saved_greater_than_is_operator_p
7418 /* Consume expressions until there are no more. */
7421 {
7422 tree expr;
7424 /* At the beginning of attribute lists, check to see if the
7425 next token is an identifier. */
7428 {
7431 /* Consume the identifier. */
7433 /* Save the identifier. */
7435 }
7436 else
7437 {
7440 /* Parse the next assignment-expression. */
7442 {
7443 /* A braced-init-list. */
7449 }
7451 {
7452 expr = (cp_parser_constant_expression
7457 }
7458 else
7460 cast_p);
7465 /* If we have an ellipsis, then this is an expression
7466 expansion. */
7469 {
7470 /* Consume the `...'. */
7473 /* Build the argument pack. */
7475 }
7477 /* Add it to the list. We add error_mark_node
7478 expressions to the list, so that we can still tell if
7479 the correct form for a parenthesized expression-list
7480 is found. That gives better errors. */
7485 }
7487 /* After the first item, attribute lists look the same as
7488 expression lists. */
7491 get_comma:;
7492 /* If the next token isn't a `,', then we are done. */
7496 /* Otherwise, consume the `,' and keep going. */
7498 }
7504 {
7507 skip_comma:;
7508 /* We try and resync to an unnested comma, as that will give the
7509 user better diagnostics. */
7517 {
7518 parser->greater_than_is_operator_p
7521 }
7522 }
7524 parser->greater_than_is_operator_p
7531 }
7533 /* Parse a pseudo-destructor-name.
7535 pseudo-destructor-name:
7536 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7537 :: [opt] nested-name-specifier template template-id :: ~ type-name
7538 :: [opt] nested-name-specifier [opt] ~ type-name
7540 If either of the first two productions is used, sets *SCOPE to the
7541 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7542 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7543 or ERROR_MARK_NODE if the parse fails. */
7545 static void
7547 tree object,
7550 {
7553 /* Handle ~auto. */
7557 {
7560 "%<~auto%> only available with "
7567 }
7569 /* Assume that things will not work out. */
7572 /* Look for the optional `::' operator. */
7574 /* Look for the optional nested-name-specifier. */
7575 nested_name_specifier_p
7582 /* Now, if we saw a nested-name-specifier, we might be doing the
7583 second production. */
7586 {
7587 /* Consume the `template' keyword. */
7589 /* Parse the template-id. */
7593 class_type,
7595 /* Look for the `::' token. */
7597 }
7598 /* If the next token is not a `~', then there might be some
7599 additional qualification. */
7601 {
7602 /* At this point, we're looking for "type-name :: ~". The type-name
7603 must not be a class-name, since this is a pseudo-destructor. So,
7604 it must be either an enum-name, or a typedef-name -- both of which
7605 are just identifiers. So, we peek ahead to check that the "::"
7606 and "~" tokens are present; if they are not, then we can avoid
7607 calling type_name. */
7611 {
7614 }
7616 /* Look for the type-name. */
7621 /* Look for the `::' token. */
7623 }
7624 else
7627 /* Look for the `~'. */
7630 /* Once we see the ~, this has to be a pseudo-destructor. */
7634 /* Look for the type-name again. We are not responsible for
7635 checking that it matches the first type-name. */
7637 }
7639 /* Parse a unary-expression.
7641 unary-expression:
7642 postfix-expression
7643 ++ cast-expression
7644 -- cast-expression
7645 unary-operator cast-expression
7646 sizeof unary-expression
7647 sizeof ( type-id )
7648 alignof ( type-id ) [C++0x]
7649 new-expression
7650 delete-expression
7652 GNU Extensions:
7654 unary-expression:
7655 __extension__ cast-expression
7656 __alignof__ unary-expression
7657 __alignof__ ( type-id )
7658 alignof unary-expression [C++0x]
7659 __real__ cast-expression
7660 __imag__ cast-expression
7661 && identifier
7662 sizeof ( type-id ) { initializer-list , [opt] }
7663 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7664 __alignof__ ( type-id ) { initializer-list , [opt] }
7666 ADDRESS_P is true iff the unary-expression is appearing as the
7667 operand of the `&' operator. CAST_P is true if this expression is
7668 the target of a cast.
7670 Returns a representation of the expression. */
7672 static cp_expr
7675 {
7679 /* Peek at the next token. */
7681 /* Some keywords give away the kind of expression. */
7683 {
7687 {
7690 {
7693 location_t first_loc;
7696 /* Consume the token. */
7699 /* Parse the operand. */
7704 else
7705 {
7706 /* ISO C++ defines alignof only with types, not with
7707 expressions. So pedwarn if alignof is used with a non-
7708 type expression. However, __alignof__ is ok. */
7711 "ISO C++ does not allow %<alignof%> "
7715 }
7716 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7717 SIZEOF_EXPR with the original operand. */
7719 {
7721 {
7723 {
7726 error_mark_node));
7728 }
7729 else
7733 }
7735 }
7737 }
7746 {
7747 /* The saved value of the PEDANTIC flag. */
7749 tree expr;
7751 /* Save away the PEDANTIC flag. */
7753 /* Parse the cast-expression. */
7755 /* Restore the PEDANTIC flag. */
7759 }
7763 {
7764 tree expression;
7766 /* Consume the `__real__' or `__imag__' token. */
7768 /* Parse the cast-expression. */
7770 /* Create the complete representation. */
7774 expression,
7775 tf_warning_or_error);
7776 }
7784 {
7785 tree expr;
7795 parser->type_definition_forbidden_message
7798 saved_integral_constant_expression_p
7800 saved_non_integral_constant_expression_p
7804 saved_greater_than_is_operator_p
7816 parser->greater_than_is_operator_p
7819 parser->integral_constant_expression_p
7821 parser->non_integral_constant_expression_p
7828 }
7832 }
7833 }
7835 /* Look for the `:: new' and `:: delete', which also signal the
7836 beginning of a new-expression, or delete-expression,
7837 respectively. If the next token is `::', then it might be one of
7838 these. */
7840 {
7843 /* See if the token after the `::' is one of the keywords in
7844 which we're interested. */
7846 /* If it's `new', we have a new-expression. */
7849 /* Similarly, for `delete'. */
7852 }
7854 /* Look for a unary operator. */
7856 /* The `++' and `--' operators can be handled similarly, even though
7857 they are not technically unary-operators in the grammar. */
7859 {
7864 /* Handle the GNU address-of-label extension. */
7867 {
7868 tree identifier;
7869 tree expression;
7872 /* Consume the '&&' token. */
7874 /* Look for the identifier. */
7875 location_t finish_loc
7878 /* Construct a location of the form:
7879 &&label
7880 ^~~~~~~
7881 with caret==start at the "&&", finish at the end of the label. */
7882 location_t combined_loc
7884 /* Create an expression representing the address. */
7887 NIC_ADDR_LABEL))
7890 }
7891 }
7893 {
7894 cp_expr cast_expression;
7900 /* Consume the operator token. */
7904 /* Parse the cast-expression. */
7905 cast_expression
7910 pidk);
7912 /* Make a location:
7913 OP_TOKEN CAST_EXPRESSION
7914 ^~~~~~~~~~~~~~~~~~~~~~~~~
7915 with start==caret at the operator token, and
7916 extending to the end of the cast_expression. */
7919 /* Now, build an appropriate representation. */
7921 {
7925 RO_UNARY_STAR,
7926 complain);
7927 /* TODO: build_x_indirect_ref does not always honor the
7928 location, so ensure it is set. */
7934 /* Fall through. */
7937 cast_expression,
7938 complain);
7939 /* TODO: build_x_unary_op does not always honor the location,
7940 so ensure it is set. */
7948 /* Fall through. */
7950 /* Immediately fold negation of a constant, unless the constant is 0
7951 (since -0 == 0) or it would overflow. */
7956 {
7959 cast_expression);
7961 {
7964 }
7965 }
7966 /* Fall through. */
7975 }
7979 non_constant_p))
7983 }
7987 decltype_p,
7988 pidk);
7989 }
7991 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7992 unary-operator, the corresponding tree code is returned. */
7994 static enum tree_code
7996 {
7998 {
8019 }
8020 }
8022 /* Parse a new-expression.
8024 new-expression:
8025 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8026 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8028 Returns a representation of the expression. */
8030 static tree
8032 {
8035 tree type;
8038 tree ret;
8042 /* Look for the optional `::' operator. */
8043 global_scope_p
8047 /* Look for the `new' operator. */
8049 /* There's no easy way to tell a new-placement from the
8050 `( type-id )' construct. */
8052 /* Look for a new-placement. */
8054 /* If that didn't work out, there's no new-placement. */
8056 {
8060 }
8062 /* If the next token is a `(', then we have a parenthesized
8063 type-id. */
8065 {
8069 /* Consume the `('. */
8072 /* Parse the type-id. */
8073 parser->type_definition_forbidden_message
8075 {
8078 }
8081 /* Look for the closing `)'. */
8084 /* There should not be a direct-new-declarator in this production,
8085 but GCC used to allowed this, so we check and emit a sensible error
8086 message for this case. */
8088 {
8094 }
8095 }
8096 /* Otherwise, there must be a new-type-id. */
8097 else
8100 /* If the next token is a `(' or '{', then we have a new-initializer. */
8105 else
8108 /* A new-expression may not appear in an integral constant
8109 expression. */
8112 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8113 of a new-type-id or type-id of a new-expression, the new-expression shall
8114 contain a new-initializer of the form ( assignment-expression )".
8115 Additionally, consistently with the spirit of DR 1467, we want to accept
8116 'new auto { 2 }' too. */
8121 {
8123 "initialization of new-expression for type %<auto%> "
8126 }
8127 else
8128 {
8129 /* Construct a location e.g.:
8130 ptr = new int[100]
8131 ^~~~~~~~~~~~
8132 with caret == start at the start of the "new" token, and the end
8133 at the end of the final token we consumed. */
8138 /* Create a representation of the new-expression. */
8140 tf_warning_or_error);
8142 }
8150 }
8152 /* Parse a new-placement.
8154 new-placement:
8155 ( expression-list )
8157 Returns the same representation as for an expression-list. */
8161 {
8164 /* Parse the expression-list. */
8165 expression_list = (cp_parser_parenthesized_expression_list
8174 }
8176 /* Parse a new-type-id.
8178 new-type-id:
8179 type-specifier-seq new-declarator [opt]
8181 Returns the TYPE allocated. If the new-type-id indicates an array
8182 type, *NELTS is set to the number of elements in the last array
8183 bound; the TYPE will not include the last array bound. */
8185 static tree
8187 {
8188 cp_decl_specifier_seq type_specifier_seq;
8194 /* The type-specifier sequence must not contain type definitions.
8195 (It cannot contain declarations of new types either, but if they
8196 are not definitions we will catch that because they are not
8197 complete.) */
8199 parser->type_definition_forbidden_message
8201 /* Parse the type-specifier-seq. */
8205 /* Restore the old message. */
8211 /* Parse the new-declarator. */
8214 /* Determine the number of elements in the last array dimension, if
8215 any. */
8217 /* Skip down to the last array dimension. */
8222 {
8225 }
8230 {
8233 }
8236 {
8243 else
8245 }
8248 }
8250 /* Parse an (optional) new-declarator.
8252 new-declarator:
8253 ptr-operator new-declarator [opt]
8254 direct-new-declarator
8256 Returns the declarator. */
8260 {
8263 cp_cv_quals cv_quals;
8265 /* We don't know if there's a ptr-operator next, or not. */
8267 /* Look for a ptr-operator. */
8269 /* If that worked, look for more new-declarators. */
8271 {
8274 /* Parse another optional declarator. */
8277 declarator = cp_parser_make_indirect_declarator
8281 }
8283 /* If the next token is a `[', there is a direct-new-declarator. */
8288 }
8290 /* Parse a direct-new-declarator.
8292 direct-new-declarator:
8293 [ expression ]
8294 direct-new-declarator [constant-expression]
8296 */
8300 {
8304 {
8305 tree expression;
8308 /* Look for the opening `['. */
8313 /* The standard requires that the expression have integral
8314 type. DR 74 adds enumeration types. We believe that the
8315 real intent is that these expressions be handled like the
8316 expression in a `switch' condition, which also allows
8317 classes with a single conversion to integral or
8318 enumeration type. */
8320 {
8321 expression
8323 expression,
8326 {
8328 "expression in new-declarator must have integral "
8331 }
8332 }
8334 /* Look for the closing `]'. */
8337 /* Add this bound to the declarator. */
8340 /* If the next token is not a `[', then there are no more
8341 bounds. */
8344 }
8347 }
8349 /* Parse a new-initializer.
8351 new-initializer:
8352 ( expression-list [opt] )
8353 braced-init-list
8355 Returns a representation of the expression-list. */
8359 {
8363 {
8364 tree t;
8371 }
8372 else
8373 expression_list = (cp_parser_parenthesized_expression_list
8379 }
8381 /* Parse a delete-expression.
8383 delete-expression:
8384 :: [opt] delete cast-expression
8385 :: [opt] delete [ ] cast-expression
8387 Returns a representation of the expression. */
8389 static tree
8391 {
8394 tree expression;
8396 /* Look for the optional `::' operator. */
8397 global_scope_p
8401 /* Look for the `delete' keyword. */
8403 /* See if the array syntax is in use. */
8405 {
8406 /* Consume the `[' token. */
8408 /* Look for the `]' token. */
8410 /* Remember that this is the `[]' construct. */
8412 }
8413 else
8416 /* Parse the cast-expression. */
8419 /* A delete-expression may not appear in an integral constant
8420 expression. */
8425 tf_warning_or_error);
8426 }
8428 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8429 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8430 0 otherwise. */
8432 static int
8434 {
8437 {
8479 /* In ((type ()) () the last () isn't a valid cast-expression,
8480 so the whole must be parsed as postfix-expression. */
8485 /* '[' may start a primary-expression in obj-c++ and in C++11,
8486 as a lambda-expression, eg, '(void)[]{}'. */
8493 /* '++' and '--' may or may not start a cast-expression:
8495 struct T { void operator++(int); };
8496 void f() { (T())++; }
8498 vs
8500 int a;
8501 (int)++a; */
8506 }
8507 }
8509 /* Parse a cast-expression.
8511 cast-expression:
8512 unary-expression
8513 ( type-id ) cast-expression
8515 ADDRESS_P is true iff the unary-expression is appearing as the
8516 operand of the `&' operator. CAST_P is true if this expression is
8517 the target of a cast.
8519 Returns a representation of the expression. */
8521 static cp_expr
8524 {
8525 /* If it's a `(', then we might be looking at a cast. */
8527 {
8533 /* There's no way to know yet whether or not this is a cast.
8534 For example, `(int (3))' is a unary-expression, while `(int)
8535 3' is a cast. So, we resort to parsing tentatively. */
8537 /* Types may not be defined in a cast. */
8539 parser->type_definition_forbidden_message
8541 /* Consume the `('. */
8545 /* A very tricky bit is that `(struct S) { 3 }' is a
8546 compound-literal (which we permit in C++ as an extension).
8547 But, that construct is not a cast-expression -- it is a
8548 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8549 is legal; if the compound-literal were a cast-expression,
8550 you'd need an extra set of parentheses.) But, if we parse
8551 the type-id, and it happens to be a class-specifier, then we
8552 will commit to the parse at that point, because we cannot
8553 undo the action that is done when creating a new class. So,
8554 then we cannot back up and do a postfix-expression.
8556 Another tricky case is the following (c++/29234):
8558 struct S { void operator () (); };
8560 void foo ()
8561 {
8562 ( S()() );
8563 }
8565 As a type-id we parse the parenthesized S()() as a function
8566 returning a function, groktypename complains and we cannot
8567 back up in this case either.
8569 Therefore, we scan ahead to the closing `)', and check to see
8570 if the tokens after the `)' can start a cast-expression. Otherwise
8571 we are dealing with an unary-expression, a postfix-expression
8572 or something else.
8574 Yet another tricky case, in C++11, is the following (c++/54891):
8576 (void)[]{};
8578 The issue is that usually, besides the case of lambda-expressions,
8579 the parenthesized type-id cannot be followed by '[', and, eg, we
8580 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8581 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8582 we don't commit, we try a cast-expression, then an unary-expression.
8584 Save tokens so that we can put them back. */
8587 /* We may be looking at a cast-expression. */
8590 cast_expression
8593 /* Roll back the tokens we skipped. */
8595 /* If we aren't looking at a cast-expression, simulate an error so
8596 that the call to cp_parser_error_occurred below returns true. */
8599 else
8600 {
8603 /* Look for the type-id. */
8605 /* Look for the closing `)'. */
8608 }
8610 /* Restore the saved message. */
8613 /* At this point this can only be either a cast or a
8614 parenthesized ctor such as `(T ())' that looks like a cast to
8615 function returning T. */
8617 {
8618 /* Only commit if the cast-expression doesn't start with
8619 '++', '--', or '[' in C++11. */
8627 pidk);
8630 {
8631 /* Warn about old-style casts, if so requested. */
8638 /* Only type conversions to integral or enumeration types
8639 can be used in constant-expressions. */
8642 NIC_CAST))
8645 /* Perform the cast. */
8646 /* Make a location:
8647 (TYPE) EXPR
8648 ^~~~~~~~~~~
8649 with start==caret at the open paren, extending to the
8650 end of "expr". */
8652 open_paren_loc,
8656 }
8657 }
8658 else
8660 }
8662 /* If we get here, then it's not a cast, so it must be a
8663 unary-expression. */
8666 }
8668 /* Parse a binary expression of the general form:
8670 pm-expression:
8671 cast-expression
8672 pm-expression .* cast-expression
8673 pm-expression ->* cast-expression
8675 multiplicative-expression:
8676 pm-expression
8677 multiplicative-expression * pm-expression
8678 multiplicative-expression / pm-expression
8679 multiplicative-expression % pm-expression
8681 additive-expression:
8682 multiplicative-expression
8683 additive-expression + multiplicative-expression
8684 additive-expression - multiplicative-expression
8686 shift-expression:
8687 additive-expression
8688 shift-expression << additive-expression
8689 shift-expression >> additive-expression
8691 relational-expression:
8692 shift-expression
8693 relational-expression < shift-expression
8694 relational-expression > shift-expression
8695 relational-expression <= shift-expression
8696 relational-expression >= shift-expression
8698 GNU Extension:
8700 relational-expression:
8701 relational-expression <? shift-expression
8702 relational-expression >? shift-expression
8704 equality-expression:
8705 relational-expression
8706 equality-expression == relational-expression
8707 equality-expression != relational-expression
8709 and-expression:
8710 equality-expression
8711 and-expression & equality-expression
8713 exclusive-or-expression:
8714 and-expression
8715 exclusive-or-expression ^ and-expression
8717 inclusive-or-expression:
8718 exclusive-or-expression
8719 inclusive-or-expression | exclusive-or-expression
8721 logical-and-expression:
8722 inclusive-or-expression
8723 logical-and-expression && inclusive-or-expression
8725 logical-or-expression:
8726 logical-and-expression
8727 logical-or-expression || logical-and-expression
8729 All these are implemented with a single function like:
8731 binary-expression:
8732 simple-cast-expression
8733 binary-expression <token> binary-expression
8735 CAST_P is true if this expression is the target of a cast.
8737 The binops_by_token map is used to get the tree codes for each <token> type.
8738 binary-expressions are associated according to a precedence table. */
8740 #define TOKEN_PRECEDENCE(token) \
8741 (((token->type == CPP_GREATER \
8742 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8743 && !parser->greater_than_is_operator_p) \
8744 ? PREC_NOT_OPERATOR \
8745 : binops_by_token[token->type].prec)
8747 static cp_expr
8753 {
8754 cp_parser_expression_stack stack;
8756 cp_parser_expression_stack_entry current;
8757 cp_expr rhs;
8761 tree overload;
8763 /* Parse the first expression. */
8774 {
8775 /* Get an operator token. */
8781 {
8783 "%<>>%> operator is treated"
8787 }
8792 /* This is a fold-expression; handle it later. */
8795 /* Popping an entry off the stack means we completed a subexpression:
8796 - either we found a token which is not an operator (`>' where it is not
8797 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8798 will happen repeatedly;
8799 - or, we found an operator which has lower priority. This is the case
8800 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8801 parsing `3 * 4'. */
8803 {
8806 else
8808 }
8810 get_rhs:
8814 /* We used the operator token. */
8817 /* For "false && x" or "true || x", x will never be executed;
8818 disable warnings while evaluating it. */
8820 c_inhibit_evaluation_warnings +=
8823 c_inhibit_evaluation_warnings +=
8826 /* Extract another operand. It may be the RHS of this expression
8827 or the LHS of a new, higher priority expression. */
8832 /* Get another operator token. Look up its precedence to avoid
8833 building a useless (immediately popped) stack entry for common
8834 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8841 {
8842 /* ... and prepare to parse the RHS of the new, higher priority
8843 expression. Since precedence levels on the stack are
8844 monotonically increasing, we do not have to care about
8845 stack overflows. */
8854 pop:
8856 /* If the stack is not empty, we have parsed into LHS the right side
8857 (`4' in the example above) of an expression we had suspended.
8858 We can use the information on the stack to recover the LHS (`3')
8859 from the stack together with the tree code (`MULT_EXPR'), and
8860 the precedence of the higher level subexpression
8861 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8862 which will be used to actually build the additive expression. */
8867 }
8869 /* Undo the disabling of warnings done above. */
8871 c_inhibit_evaluation_warnings -=
8874 c_inhibit_evaluation_warnings -=
8880 /* Avoid warning for !!x == y. */
8885 /* Avoid warning for !b == y where b is boolean. */
8889 /* Avoid warning for !!b == y where b is boolean. */
8902 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8903 ERROR_MARK for everything that is not a binary expression.
8904 This makes warn_about_parentheses miss some warnings that
8905 involve unary operators. For unary expressions we should
8906 pass the correct tree_code unless the unary expression was
8907 surrounded by parentheses.
8908 */
8915 == tcc_comparison
8918 else
8919 {
8924 /* TODO: build_x_binary_op doesn't always honor the location. */
8926 }
8929 /* If the binary operator required the use of an overloaded operator,
8930 then this expression cannot be an integral constant-expression.
8931 An overloaded operator can be used even if both operands are
8932 otherwise permissible in an integral constant-expression if at
8933 least one of the operands is of enumeration type. */
8937 NIC_OVERLOADED))
8939 }
8942 }
8944 static cp_expr
8949 {
8952 }
8954 /* Parse the `? expression : assignment-expression' part of a
8955 conditional-expression. The LOGICAL_OR_EXPR is the
8956 logical-or-expression that started the conditional-expression.
8957 Returns a representation of the entire conditional-expression.
8959 This routine is used by cp_parser_assignment_expression.
8961 ? expression : assignment-expression
8963 GNU Extensions:
8965 ? : assignment-expression */
8967 static tree
8969 {
8971 cp_expr assignment_expr;
8975 /* Consume the `?' token. */
8980 {
8983 /* Implicit true clause. */
8985 c_inhibit_evaluation_warnings +=
8988 }
8989 else
8990 {
8993 /* Parse the expression. */
8994 c_inhibit_evaluation_warnings +=
8997 c_inhibit_evaluation_warnings +=
9001 }
9003 /* The next token should be a `:'. */
9005 /* Parse the assignment-expression. */
9007 c_inhibit_evaluation_warnings -=
9010 /* Make a location:
9011 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9012 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9013 with the caret at the "?", ranging from the start of
9014 the logical_or_expr to the end of the assignment_expr. */
9019 /* Build the conditional-expression. */
9021 expr,
9022 assignment_expr,
9023 tf_warning_or_error);
9024 }
9026 /* Parse an assignment-expression.
9028 assignment-expression:
9029 conditional-expression
9030 logical-or-expression assignment-operator assignment_expression
9031 throw-expression
9033 CAST_P is true if this expression is the target of a cast.
9034 DECLTYPE_P is true if this expression is the operand of decltype.
9036 Returns a representation for the expression. */
9038 static cp_expr
9041 {
9042 cp_expr expr;
9044 /* If the next token is the `throw' keyword, then we're looking at
9045 a throw-expression. */
9048 /* Otherwise, it must be that we are looking at a
9049 logical-or-expression. */
9050 else
9051 {
9052 /* Parse the binary expressions (logical-or-expression). */
9054 decltype_p,
9056 /* If the next token is a `?' then we're actually looking at a
9057 conditional-expression. */
9060 else
9061 {
9064 /* If it's an assignment-operator, we're using the second
9065 production. */
9066 enum tree_code assignment_operator
9069 {
9072 /* Parse the right-hand side of the assignment. */
9079 /* An assignment may not appear in a
9080 constant-expression. */
9082 NIC_ASSIGNMENT))
9084 /* Build the assignment expression. Its default
9085 location:
9086 LHS = RHS
9087 ~~~~^~~~~
9088 is the location of the '=' token as the
9089 caret, ranging from the start of the lhs to the
9090 end of the rhs. */
9095 assignment_operator,
9096 rhs,
9098 /* TODO: build_x_modify_expr doesn't honor the location,
9099 so we must set it here. */
9101 }
9102 }
9103 }
9106 }
9108 /* Parse an (optional) assignment-operator.
9110 assignment-operator: one of
9111 = *= /= %= += -= >>= <<= &= ^= |=
9113 GNU Extension:
9115 assignment-operator: one of
9116 <?= >?=
9118 If the next token is an assignment operator, the corresponding tree
9119 code is returned, and the token is consumed. For example, for
9120 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9121 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9122 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9123 operator, ERROR_MARK is returned. */
9125 static enum tree_code
9127 {
9131 /* Peek at the next token. */
9135 {
9181 /* Nothing else is an assignment operator. */
9183 }
9185 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9190 /* If it was an assignment operator, consume it. */
9195 }
9197 /* Parse an expression.
9199 expression:
9200 assignment-expression
9201 expression , assignment-expression
9203 CAST_P is true if this expression is the target of a cast.
9204 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9205 except possibly parenthesized or on the RHS of a comma (N3276).
9207 Returns a representation of the expression. */
9209 static cp_expr
9212 {
9217 {
9218 cp_expr assignment_expression;
9220 /* Parse the next assignment-expression. */
9221 assignment_expression
9224 /* We don't create a temporary for a call that is the immediate operand
9225 of decltype or on the RHS of a comma. But when we see a comma, we
9226 need to create a temporary for a call on the LHS. */
9231 assignment_expression
9235 /* If this is the first assignment-expression, we can just
9236 save it away. */
9239 else
9240 {
9241 /* Create a location with caret at the comma, ranging
9242 from the start of the LHS to the end of the RHS. */
9247 assignment_expression,
9250 }
9251 /* If the next token is not a comma, or we're in a fold-expression, then
9252 we are done with the expression. */
9256 /* Consume the `,'. */
9259 /* A comma operator cannot appear in a constant-expression. */
9262 }
9265 }
9267 /* Parse a constant-expression.
9269 constant-expression:
9270 conditional-expression
9272 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9273 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9274 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9275 is false, NON_CONSTANT_P should be NULL. */
9277 static cp_expr
9281 {
9285 cp_expr expression;
9287 /* It might seem that we could simply parse the
9288 conditional-expression, and then check to see if it were
9289 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9290 one that the compiler can figure out is constant, possibly after
9291 doing some simplifications or optimizations. The standard has a
9292 precise definition of constant-expression, and we must honor
9293 that, even though it is somewhat more restrictive.
9295 For example:
9297 int i[(2, 3)];
9299 is not a legal declaration, because `(2, 3)' is not a
9300 constant-expression. The `,' operator is forbidden in a
9301 constant-expression. However, GCC's constant-folding machinery
9302 will fold this operation to an INTEGER_CST for `3'. */
9304 /* Save the old settings. */
9306 saved_allow_non_integral_constant_expression_p
9309 /* We are now parsing a constant-expression. */
9311 parser->allow_non_integral_constant_expression_p
9314 /* Although the grammar says "conditional-expression", we parse an
9315 "assignment-expression", which also permits "throw-expression"
9316 and the use of assignment operators. In the case that
9317 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9318 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9319 actually essential that we look for an assignment-expression.
9320 For example, cp_parser_initializer_clauses uses this function to
9321 determine whether a particular assignment-expression is in fact
9322 constant. */
9324 /* Restore the old settings. */
9325 parser->integral_constant_expression_p
9327 parser->allow_non_integral_constant_expression_p
9330 {
9331 /* Require an rvalue constant expression here; that's what our
9332 callers expect. Reference constant expressions are handled
9333 separately in e.g. cp_parser_template_argument. */
9338 }
9341 parser->non_integral_constant_expression_p
9345 }
9347 /* Parse __builtin_offsetof.
9349 offsetof-expression:
9350 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9352 offsetof-member-designator:
9353 id-expression
9354 | offsetof-member-designator "." id-expression
9355 | offsetof-member-designator "[" expression "]"
9356 | offsetof-member-designator "->" id-expression */
9358 static cp_expr
9360 {
9362 tree type;
9363 cp_expr expr;
9364 cp_id_kind dummy;
9366 location_t finish_loc;
9368 /* We're about to accept non-integral-constant things, but will
9369 definitely yield an integral constant expression. Save and
9370 restore these values around our local parsing. */
9376 /* Consume the "__builtin_offsetof" token. */
9378 /* Consume the opening `('. */
9380 /* Parse the type-id. */
9383 /* Look for the `,'. */
9387 /* Build the (type *)null that begins the traditional offsetof macro. */
9389 tf_warning_or_error);
9391 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9395 {
9398 {
9400 /* offsetof-member-designator "[" expression "]" */
9406 /* offsetof-member-designator "->" identifier */
9409 /* FALLTHRU */
9412 /* offsetof-member-designator "." identifier */
9420 /* Consume the ")" token. */
9426 /* Error. We know the following require will fail, but
9427 that gives the proper error message. */
9432 }
9433 }
9435 success:
9436 /* Make a location of the form:
9437 __builtin_offsetof (struct s, f)
9438 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9439 with caret at the type-id, ranging from the start of the
9440 "_builtin_offsetof" token to the close paren. */
9442 /* The result will be an INTEGER_CST, so we need to explicitly
9443 preserve the location. */
9446 failure:
9451 }
9453 /* Parse a trait expression.
9455 Returns a representation of the expression, the underlying type
9456 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9458 static tree
9460 {
9461 cp_trait_kind kind;
9467 {
9555 }
9557 /* Consume the token. */
9562 {
9565 }
9571 {
9574 {
9577 }
9581 }
9583 {
9585 {
9589 {
9592 }
9596 }
9597 }
9601 /* Complete the trait expression, which may mean either processing
9602 the trait expr now or saving it for template instantiation. */
9604 {
9613 }
9614 }
9616 /* Lambdas that appear in variable initializer or default argument scope
9617 get that in their mangling, so we need to record it. We might as well
9618 use the count for function and namespace scopes as well. */
9622 {
9623 tree t;
9625 };
9628 static void
9630 {
9631 tree_int ti;
9633 /* Once we're inside a function, we ignore other scopes and just push
9634 the function again so that popping works properly. */
9641 {
9642 /* Don't reset the count if we're still in the same function. */
9645 }
9646 }
9648 static void
9650 {
9653 }
9655 static void
9657 {
9660 {
9663 }
9665 }
9667 /* Parse a lambda expression.
9669 lambda-expression:
9670 lambda-introducer lambda-declarator [opt] compound-statement
9672 Returns a representation of the expression. */
9674 static cp_expr
9676 {
9678 tree type;
9686 {
9688 {
9692 }
9694 }
9696 {
9698 {
9701 }
9703 }
9705 /* We may be in the middle of deferred access check. Disable
9706 it now. */
9717 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9720 /* Now that we've started the type, add the capture fields for any
9721 explicit captures. */
9724 {
9725 /* Inside the class, surrounding template-parameter-lists do not apply. */
9726 unsigned int saved_num_template_parameter_lists
9730 bool fully_implicit_function_template_p
9734 bool auto_is_implicit_function_template_parm_p
9745 /* By virtue of defining a local class, a lambda expression has access to
9746 the private variables of enclosing classes. */
9751 {
9757 }
9759 {
9762 }
9764 /* The capture list was built up in reverse order; fix that now. */
9776 parser->fully_implicit_function_template_p
9780 parser->auto_is_implicit_function_template_parm_p
9782 }
9784 /* This field is only used during parsing of the lambda. */
9787 /* This lambda shouldn't have any proxies left at this point. */
9789 /* And now that we're done, push proxies for an enclosing lambda. */
9794 else
9802 }
9804 /* Parse the beginning of a lambda expression.
9806 lambda-introducer:
9807 [ lambda-capture [opt] ]
9809 LAMBDA_EXPR is the current representation of the lambda expression. */
9811 static void
9813 {
9814 /* Need commas after the first capture. */
9817 /* Eat the leading `['. */
9820 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9828 {
9831 }
9834 {
9836 tree capture_id;
9837 tree capture_init_expr;
9841 enum capture_kind_type
9842 {
9843 BY_COPY,
9844 BY_REFERENCE
9845 };
9849 {
9852 }
9856 else
9859 /* Possibly capture `this'. */
9861 {
9871 explicit_init_p);
9873 }
9875 /* Remember whether we want to capture as a reference or not. */
9877 {
9880 }
9882 /* Get the identifier. */
9887 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9888 delimiters, but I modified this to stop on unnested ']' as well. It
9889 was already changed to stop on unnested '}', so the
9890 "closing_parenthesis" name is no more misleading with my change. */
9891 {
9897 }
9899 /* Find the initializer for this capture. */
9903 {
9905 /* An explicit initializer exists. */
9908 "lambda capture initializers "
9914 {
9917 }
9918 }
9919 else
9920 {
9923 /* Turn the identifier into an id-expression. */
9924 capture_init_expr
9929 {
9932 }
9936 {
9939 capture_init_expr);
9943 }
9946 {
9949 capture_init_expr))
9953 }
9955 capture_init_expr
9956 = finish_id_expression
9958 capture_init_expr,
9972 {
9975 }
9976 else
9978 }
9982 {
9987 capture_id);
9991 "capture of %qD redundant with by-reference capture "
9993 }
9996 capture_id,
9997 capture_init_expr,
9999 explicit_init_p);
10000 }
10003 }
10005 /* Parse the (optional) middle of a lambda expression.
10007 lambda-declarator:
10008 < template-parameter-list [opt] >
10009 ( parameter-declaration-clause [opt] )
10010 attribute-specifier [opt]
10011 mutable [opt]
10012 exception-specification [opt]
10013 lambda-return-type-clause [opt]
10015 LAMBDA_EXPR is the current representation of the lambda expression. */
10017 static bool
10019 {
10020 /* 5.1.1.4 of the standard says:
10021 If a lambda-expression does not include a lambda-declarator, it is as if
10022 the lambda-declarator were ().
10023 This means an empty parameter list, no attributes, and no exception
10024 specification. */
10031 /* The template-parameter-list is optional, but must begin with
10032 an opening angle if present. */
10034 {
10037 "lambda templates are only available with "
10046 /* We just processed one more parameter list. */
10048 }
10050 /* The parameter-declaration-clause is optional (unless
10051 template-parameter-list was given), but must begin with an
10052 opening parenthesis if present. */
10054 {
10059 /* Parse parameters. */
10062 /* Default arguments shall not be specified in the
10063 parameter-declaration-clause of a lambda-declarator. */
10073 /* Parse optional `mutable' keyword. */
10075 {
10078 }
10082 /* Parse optional exception specification. */
10085 /* Parse optional trailing return type. */
10087 {
10091 }
10093 /* The function parameters must be in scope all the way until after the
10094 trailing-return-type in case of decltype. */
10096 }
10100 /* Create the function call operator.
10102 Messing with declarators like this is no uglier than building up the
10103 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10104 other code. */
10105 {
10106 cp_decl_specifier_seq return_type_specs;
10108 tree fco;
10115 else
10116 /* Maybe we will deduce the return type later. */
10122 sfk_none);
10127 VIRT_SPEC_UNSPECIFIED,
10128 REF_QUAL_NONE,
10129 tx_qual,
10130 exception_spec,
10136 declarator,
10137 attributes);
10139 {
10142 /* Give the object parameter a different name. */
10146 }
10148 {
10152 }
10161 }
10162 }
10164 /* Parse the body of a lambda expression, which is simply
10166 compound-statement
10168 but which requires special handling.
10169 LAMBDA_EXPR is the current representation of the lambda expression. */
10171 static void
10173 {
10178 else
10179 /* Still increment function_depth so that we don't GC in the
10180 middle of an expression. */
10184 /* Clear this in case we're in the middle of a default argument. */
10187 /* Finish the function call operator
10188 - class_specifier
10189 + late_parsing_for_member
10190 + function_definition_after_declarator
10191 + ctor_initializer_opt_and_function_body */
10192 {
10194 tree body;
10196 tree compound_stmt;
10197 tree cap;
10199 /* Let the front end know that we are going to be defining this
10200 function. */
10202 NULL_TREE,
10211 /* Push the proxies for any explicit captures. */
10218 /* 5.1.1.4 of the standard says:
10219 If a lambda-expression does not include a trailing-return-type, it
10220 is as if the trailing-return-type denotes the following type:
10221 * if the compound-statement is of the form
10222 { return attribute-specifier [opt] expression ; }
10223 the type of the returned expression after lvalue-to-rvalue
10224 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10225 (_conv.array_ 4.2), and function-to-pointer conversion
10226 (_conv.func_ 4.3);
10227 * otherwise, void. */
10229 /* In a lambda that has neither a lambda-return-type-clause
10230 nor a deducible form, errors should be reported for return statements
10231 in the body. Since we used void as the placeholder return type, parsing
10232 the body as usual will give such desired behavior. */
10236 {
10240 /* Parse tentatively in case there's more after the initial return
10241 statement. */
10252 {
10254 {
10259 }
10261 /* Will get error here if type not deduced yet. */
10265 }
10266 }
10269 {
10274 }
10278 out:
10282 /* Finish the function and generate code for it if necessary. */
10285 /* Only expand if the call op is not a template. */
10288 }
10294 else
10296 }
10298 /* Statements [gram.stmt.stmt] */
10300 /* Parse a statement.
10302 statement:
10303 labeled-statement
10304 expression-statement
10305 compound-statement
10306 selection-statement
10307 iteration-statement
10308 jump-statement
10309 declaration-statement
10310 try-block
10312 C++11:
10314 statement:
10315 labeled-statement
10316 attribute-specifier-seq (opt) expression-statement
10317 attribute-specifier-seq (opt) compound-statement
10318 attribute-specifier-seq (opt) selection-statement
10319 attribute-specifier-seq (opt) iteration-statement
10320 attribute-specifier-seq (opt) jump-statement
10321 declaration-statement
10322 attribute-specifier-seq (opt) try-block
10324 TM Extension:
10326 statement:
10327 atomic-statement
10329 IN_COMPOUND is true when the statement is nested inside a
10330 cp_parser_compound_statement; this matters for certain pragmas.
10332 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10333 is a (possibly labeled) if statement which is not enclosed in braces
10334 and has an else clause. This is used to implement -Wparentheses.
10336 CHAIN is a vector of if-else-if conditions. */
10338 static void
10341 {
10346 restart:
10349 /* There is no statement yet. */
10355 /* In obj-c++, seeing '[[' might be the either the beginning of
10356 c++11 attributes, or a nested objc-message-expression. So
10357 let's parse the c++11 attributes tentatively. */
10361 {
10364 }
10366 /* Peek at the next token. */
10368 /* Remember the location of the first token in the statement. */
10370 /* If this is a keyword, then that will often determine what kind of
10371 statement we have. */
10373 {
10377 {
10380 /* Looks like a labeled-statement with a case label.
10381 Parse the label, and then use tail recursion to parse
10382 the statement. */
10400 {
10405 }
10406 else
10420 {
10425 }
10426 else
10427 {
10431 }
10435 /* Objective-C++ exception-handling constructs. */
10449 /* This must be a namespace alias definition. */
10465 /* It might be a keyword like `int' that can start a
10466 declaration-statement. */
10468 }
10469 }
10471 {
10472 /* If the next token is a `:', then we are looking at a
10473 labeled-statement. */
10476 {
10477 /* Looks like a labeled-statement with an ordinary label.
10478 Parse the label, and then use tail recursion to parse
10479 the statement. */
10484 }
10485 }
10486 /* Anything that starts with a `{' must be a compound-statement. */
10489 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10490 a statement all its own. */
10492 {
10493 /* Only certain OpenMP pragmas are attached to statements, and thus
10494 are considered statements themselves. All others are not. In
10495 the context of a compound, accept the pragma as a "statement" and
10496 return so that we can check for a close brace. Otherwise we
10497 require a real statement and must go back and read one. */
10503 }
10505 {
10508 }
10510 /* Everything else must be a declaration-statement or an
10511 expression-statement. Try for the declaration-statement
10512 first, unless we are looking at a `;', in which case we know that
10513 we have an expression-statement. */
10515 {
10517 {
10519 {
10520 /* Attributes should be parsed as part of the the
10521 declaration, so let's un-parse them. */
10524 }
10527 /* Try to parse the declaration-statement. */
10529 /* If that worked, we're done. */
10532 }
10533 /* Look for an expression-statement instead. */
10535 }
10537 /* Set the line number for the statement. */
10541 /* Note that for now, we don't do anything with c++11 statements
10542 parsed at this level. */
10545 OPT_Wattributes,
10547 }
10549 /* Parse the label for a labeled-statement, i.e.
10551 identifier :
10552 case constant-expression :
10553 default :
10555 GNU Extension:
10556 case constant-expression ... constant-expression : statement
10558 When a label is parsed without errors, the label is added to the
10559 parse tree by the finish_* functions, so this function doesn't
10560 have to return the label. */
10562 static void
10564 {
10569 /* The next token should be an identifier. */
10573 {
10576 }
10580 {
10582 {
10586 /* Consume the `case' token. */
10588 /* Parse the constant-expression. */
10595 {
10596 /* Consume the `...' token. */
10602 /* We don't need to emit warnings here, as the common code
10603 will do this for us. */
10604 }
10605 else
10610 else
10613 expr);
10614 }
10618 /* Consume the `default' token. */
10623 else
10628 /* Anything else must be an ordinary label. */
10631 }
10633 /* Require the `:' token. */
10636 /* An ordinary label may optionally be followed by attributes.
10637 However, this is only permitted if the attributes are then
10638 followed by a semicolon. This is because, for backward
10639 compatibility, when parsing
10640 lab: __attribute__ ((unused)) int i;
10641 we want the attribute to attach to "i", not "lab". */
10644 {
10645 tree attrs;
10652 ;
10653 else
10655 }
10661 }
10663 /* Parse an expression-statement.
10665 expression-statement:
10666 expression [opt] ;
10668 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10669 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10670 indicates whether this expression-statement is part of an
10671 expression statement. */
10673 static tree
10675 {
10679 /* If the next token is a ';', then there is no expression
10680 statement. */
10682 {
10686 {
10689 }
10690 }
10692 /* Give a helpful message for "A<T>::type t;" and the like. */
10695 {
10702 {
10703 /* A::A a; */
10708 }
10709 }
10711 /* Consume the final `;'. */
10716 /* This is the final expression statement of a statement
10717 expression. */
10723 }
10725 /* Parse a compound-statement.
10727 compound-statement:
10728 { statement-seq [opt] }
10730 GNU extension:
10732 compound-statement:
10733 { label-declaration-seq [opt] statement-seq [opt] }
10735 label-declaration-seq:
10736 label-declaration
10737 label-declaration-seq label-declaration
10739 Returns a tree representing the statement. */
10741 static tree
10744 {
10745 tree compound_stmt;
10747 /* Consume the `{'. */
10754 /* Begin the compound-statement. */
10756 /* If the next keyword is `__label__' we have a label declaration. */
10759 /* Parse an (optional) statement-seq. */
10761 /* Finish the compound-statement. */
10763 /* Consume the `}'. */
10767 }
10769 /* Parse an (optional) statement-seq.
10771 statement-seq:
10772 statement
10773 statement-seq [opt] statement */
10775 static void
10777 {
10778 /* Scan statements until there aren't any more. */
10780 {
10783 /* If we are looking at a `}', then we have run out of
10784 statements; the same is true if we have reached the end
10785 of file, or have stumbled upon a stray '@end'. */
10792 /* If we are in a compound statement and find 'else' then
10793 something went wrong. */
10795 {
10798 else
10799 {
10802 }
10803 }
10805 /* Parse the statement. */
10807 }
10808 }
10810 /* Parse a selection-statement.
10812 selection-statement:
10813 if ( condition ) statement
10814 if ( condition ) statement else statement
10815 switch ( condition ) statement
10817 Returns the new IF_STMT or SWITCH_STMT.
10819 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10820 is a (possibly labeled) if statement which is not enclosed in
10821 braces and has an else clause. This is used to implement
10822 -Wparentheses.
10824 CHAIN is a vector of if-else-if conditions. This is used to implement
10825 -Wduplicated-cond. */
10827 static tree
10830 {
10833 token_indent_info guard_tinfo;
10838 /* Peek at the next token. */
10842 /* See what kind of keyword it is. */
10845 {
10848 {
10849 tree statement;
10850 tree condition;
10852 /* Look for the `('. */
10854 {
10857 }
10859 /* Begin the selection-statement. */
10862 else
10865 /* Parse the condition. */
10867 /* Look for the `)'. */
10873 {
10877 /* Add the condition. */
10884 /* Parse the then-clause. */
10888 guard_tinfo);
10893 /* If the next token is `else', parse the else-clause. */
10895 RID_ELSE))
10896 {
10897 guard_tinfo
10899 /* Consume the `else' keyword. */
10902 {
10904 RID_IF)
10906 {
10907 /* We've got "if (COND) else if (COND2)". Start
10908 the condition chain and add COND as the first
10909 element. */
10913 {
10914 /* Wrap it in a NOP_EXPR so that we can set the
10915 location of the condition. */
10917 condition);
10920 }
10921 }
10923 RID_IF))
10924 {
10925 /* This is if-else without subsequent if. Zap the
10926 condition chain; we would have already warned at
10927 this point. */
10930 }
10931 }
10933 /* Parse the else-clause. */
10939 /* If we are currently parsing a then-clause, then
10940 IF_P will not be NULL. We set it to true to
10941 indicate that this if statement has an else clause.
10942 This may trigger the Wparentheses warning below
10943 when we get back up to the parent if statement. */
10946 }
10947 else
10948 {
10949 /* This if statement does not have an else clause. If
10950 NESTED_IF is true, then the then-clause has an if
10951 statement which does have an else clause. We warn
10952 about the potential ambiguity. */
10955 "suggest explicit braces to avoid ambiguous"
10958 {
10959 /* We don't need the condition chain anymore. */
10962 }
10963 }
10965 /* Now we're all done with the if-statement. */
10967 }
10968 else
10969 {
10973 /* Add the condition. */
10976 /* Parse the body of the switch-statement. */
10982 guard_tinfo);
10986 /* Now we're all done with the switch-statement. */
10988 }
10991 }
10997 }
10998 }
11000 /* Parse a condition.
11002 condition:
11003 expression
11004 type-specifier-seq declarator = initializer-clause
11005 type-specifier-seq declarator braced-init-list
11007 GNU Extension:
11009 condition:
11010 type-specifier-seq declarator asm-specification [opt]
11011 attributes [opt] = assignment-expression
11013 Returns the expression that should be tested. */
11015 static tree
11017 {
11018 cp_decl_specifier_seq type_specifiers;
11022 /* Try the declaration first. */
11024 /* New types are not allowed in the type-specifier-seq for a
11025 condition. */
11027 parser->type_definition_forbidden_message
11029 /* Parse the type-specifier-seq. */
11031 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11034 /* Restore the saved message. */
11036 /* If all is well, we might be looking at a declaration. */
11038 {
11039 tree decl;
11040 tree asm_specification;
11041 tree attributes;
11045 /* Parse the declarator. */
11051 /* Parse the attributes. */
11053 /* Parse the asm-specification. */
11055 /* If the next token is not an `=' or '{', then we might still be
11056 looking at an expression. For example:
11058 if (A(a).x)
11060 looks like a decl-specifier-seq and a declarator -- but then
11061 there is no `=', so this is an expression. */
11066 /* If we did see an `=' or '{', then we are looking at a declaration
11067 for sure. */
11069 {
11070 tree pushed_scope;
11074 /* Create the declaration. */
11080 /* Parse the initializer. */
11082 {
11086 }
11087 else
11088 {
11089 /* Consume the `='. */
11092 }
11096 /* Process the initializer. */
11099 asm_specification,
11100 flags);
11106 }
11107 }
11108 /* If we didn't even get past the declarator successfully, we are
11109 definitely not looking at a declaration. */
11110 else
11113 /* Otherwise, we are looking at an expression. */
11115 }
11117 /* Parses a for-statement or range-for-statement until the closing ')',
11118 not included. */
11120 static tree
11122 {
11126 /* Begin the for-statement. */
11129 /* Parse the initialization. */
11134 else
11136 }
11138 static tree
11140 {
11141 /* Normal for loop */
11144 tree stmt;
11147 /* The for-init-statement has already been parsed in
11148 cp_parser_for_init_statement, so no work is needed here. */
11151 /* If there's a condition, process it. */
11155 {
11159 }
11161 /* Look for the `;'. */
11164 /* If there's an expression, process it. */
11170 }
11172 /* Tries to parse a range-based for-statement:
11174 range-based-for:
11175 decl-specifier-seq declarator : expression
11177 The decl-specifier-seq declarator and the `:' are already parsed by
11178 cp_parser_for_init_statement. If processing_template_decl it returns a
11179 newly created RANGE_FOR_STMT; if not, it is converted to a
11180 regular FOR_STMT. */
11182 static tree
11185 {
11188 /* Get the range declaration momentarily out of the way so that
11189 the range expression doesn't clash with it. */
11194 {
11197 }
11198 else
11201 /* Put the range declaration back into scope. */
11205 /* If in template, STMT is converted to a normal for-statement
11206 at instantiation. If not, it is done just ahead. */
11208 {
11216 /* do_auto_deduction doesn't mess with template init-lists. */
11219 }
11220 else
11221 {
11224 }
11226 }
11228 /* Subroutine of cp_convert_range_for: given the initializer expression,
11229 builds up the range temporary. */
11231 static tree
11233 {
11236 /* Find out the type deduced by the declaration
11237 `auto &&__range = range_expr'. */
11242 /* Create the __range variable. */
11249 }
11251 /* Used by cp_parser_range_for in template context: we aren't going to
11252 do a full conversion yet, but we still need to resolve auto in the
11253 type of the for-range-declaration if present. This is basically
11254 a shortcut version of cp_convert_range_for. */
11256 static void
11258 {
11261 {
11264 iter_type = (cp_parser_perform_range_for_lookup
11267 {
11269 iter_type);
11271 tf_warning_or_error);
11274 }
11275 }
11276 }
11278 /* Converts a range-based for-statement into a normal
11279 for-statement, as per the definition.
11281 for (RANGE_DECL : RANGE_EXPR)
11282 BLOCK
11284 should be equivalent to:
11286 {
11287 auto &&__range = RANGE_EXPR;
11288 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11289 __begin != __end;
11290 ++__begin)
11291 {
11292 RANGE_DECL = *__begin;
11293 BLOCK
11294 }
11295 }
11297 If RANGE_EXPR is an array:
11298 BEGIN_EXPR = __range
11299 END_EXPR = __range + ARRAY_SIZE(__range)
11300 Else if RANGE_EXPR has a member 'begin' or 'end':
11301 BEGIN_EXPR = __range.begin()
11302 END_EXPR = __range.end()
11303 Else:
11304 BEGIN_EXPR = begin(__range)
11305 END_EXPR = end(__range);
11307 If __range has a member 'begin' but not 'end', or vice versa, we must
11308 still use the second alternative (it will surely fail, however).
11309 When calling begin()/end() in the third alternative we must use
11310 argument dependent lookup, but always considering 'std' as an associated
11311 namespace. */
11313 tree
11316 {
11322 /* If an error happened previously do nothing or else a lot of
11323 unhelpful errors would be issued. */
11325 else
11326 {
11327 tree range_temp;
11331 /* Can't bind a reference to an array of runtime bound. */
11333 else
11334 {
11339 LOOKUP_ONLYCONVERTING);
11341 }
11344 }
11346 /* The new for initialization statement. */
11354 LOOKUP_ONLYCONVERTING);
11365 LOOKUP_ONLYCONVERTING);
11369 /* The new for condition. */
11376 /* The new increment expression. */
11379 tf_warning_or_error);
11382 /* The declaration is initialized with *__begin inside the loop body. */
11385 tf_warning_or_error),
11387 LOOKUP_ONLYCONVERTING);
11390 }
11392 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11393 We need to solve both at the same time because the method used
11394 depends on the existence of members begin or end.
11395 Returns the type deduced for the iterator expression. */
11397 static tree
11399 {
11401 {
11404 }
11407 {
11412 }
11414 {
11415 /* If RANGE is an array, we will use pointer arithmetic. */
11418 range,
11422 }
11423 else
11424 {
11425 /* If it is not an array, we must do a bit of magic. */
11435 tf_warning_or_error);
11438 tf_warning_or_error);
11441 {
11442 /* Use the member functions. */
11445 else
11451 else
11454 }
11455 else
11456 {
11457 /* Use global functions with ADL. */
11464 tf_warning_or_error);
11466 tf_warning_or_error);
11468 tf_warning_or_error);
11470 tf_warning_or_error);
11473 }
11475 /* Last common checks. */
11477 {
11478 /* If one of the expressions is an error do no more checks. */
11481 }
11484 /* Can happen, when, eg, in a template context, Koenig lookup
11485 can't resolve begin/end (c++/58503). */
11487 else
11488 {
11490 /* The unqualified type of the __begin and __end temporaries should
11491 be the same, as required by the multiple auto declaration. */
11493 {
11500 /* P0184R0 allows __begin and __end to have different types,
11501 but make sure they are comparable so we can give a better
11503 else
11507 }
11509 }
11510 }
11511 }
11513 /* Helper function for cp_parser_perform_range_for_lookup.
11514 Builds a tree for RANGE.IDENTIFIER(). */
11516 static tree
11518 {
11531 tf_warning_or_error);
11534 }
11536 /* Parse an iteration-statement.
11538 iteration-statement:
11539 while ( condition ) statement
11540 do statement while ( expression ) ;
11541 for ( for-init-statement condition [opt] ; expression [opt] )
11542 statement
11544 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11546 static tree
11548 {
11551 tree statement;
11553 token_indent_info guard_tinfo;
11555 /* Peek at the next token. */
11562 /* Remember whether or not we are already within an iteration
11563 statement. */
11566 /* See what kind of keyword it is. */
11569 {
11571 {
11572 tree condition;
11574 /* Begin the while-statement. */
11576 /* Look for the `('. */
11578 /* Parse the condition. */
11581 /* Look for the `)'. */
11583 /* Parse the dependent statement. */
11587 /* We're done with the while-statement. */
11589 }
11593 {
11594 tree expression;
11596 /* Begin the do-statement. */
11598 /* Parse the body of the do-statement. */
11603 /* Look for the `while' keyword. */
11605 /* Look for the `('. */
11607 /* Parse the expression. */
11609 /* We're done with the do-statement. */
11611 /* Look for the `)'. */
11613 /* Look for the `;'. */
11615 }
11619 {
11620 /* Look for the `('. */
11625 /* Look for the `)'. */
11628 /* Parse the body of the for-statement. */
11633 /* We're done with the for-statement. */
11635 }
11642 }
11645 }
11647 /* Parse a for-init-statement or the declarator of a range-based-for.
11648 Returns true if a range-based-for declaration is seen.
11650 for-init-statement:
11651 expression-statement
11652 simple-declaration */
11654 static bool
11656 {
11657 /* If the next token is a `;', then we have an empty
11658 expression-statement. Grammatically, this is also a
11659 simple-declaration, but an invalid one, because it does not
11660 declare anything. Therefore, if we did not handle this case
11661 specially, we would issue an error message about an invalid
11662 declaration. */
11664 {
11668 /* A colon is used in range-based for. */
11671 /* We're going to speculatively look for a declaration, falling back
11672 to an expression, if necessary. */
11674 /* Parse the declaration. */
11677 decl);
11680 {
11681 /* It is a range-for, consume the ':' */
11685 {
11687 "range-based %<for%> loops only available with "
11690 }
11691 }
11692 else
11693 /* The ';' is not consumed yet because we told
11694 cp_parser_simple_declaration not to. */
11699 /* If the tentative parse failed, then we shall need to look for an
11700 expression-statement. */
11701 }
11702 /* If we are here, it is an expression-statement. */
11705 }
11707 /* Parse a jump-statement.
11709 jump-statement:
11710 break ;
11711 continue ;
11712 return expression [opt] ;
11713 return braced-init-list ;
11714 goto identifier ;
11716 GNU extension:
11718 jump-statement:
11719 goto * expression ;
11721 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11723 static tree
11725 {
11731 /* Peek at the next token. */
11736 /* See what kind of keyword it is. */
11739 {
11743 {
11763 }
11769 {
11776 /* Fall through. */
11786 }
11791 {
11792 tree expr;
11796 {
11800 }
11803 else
11804 /* If the next token is a `;', then there is no
11805 expression. */
11807 /* Build the return-statement. */
11809 /* Look for the final `;'. */
11811 }
11817 {
11820 }
11822 /* Create the goto-statement. */
11824 {
11825 /* Issue a warning about this use of a GNU extension. */
11827 /* Consume the '*' token. */
11829 /* Parse the dependent expression. */
11831 }
11832 else
11834 /* Look for the final `;'. */
11841 }
11844 }
11846 /* Parse a declaration-statement.
11848 declaration-statement:
11849 block-declaration */
11851 static void
11853 {
11856 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11859 /* Parse the block-declaration. */
11862 /* Free any declarators allocated. */
11864 }
11866 /* Some dependent statements (like `if (cond) statement'), are
11867 implicitly in their own scope. In other words, if the statement is
11868 a single statement (as opposed to a compound-statement), it is
11869 none-the-less treated as if it were enclosed in braces. Any
11870 declarations appearing in the dependent statement are out of scope
11871 after control passes that point. This function parses a statement,
11872 but ensures that is in its own scope, even if it is not a
11873 compound-statement.
11875 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11876 is a (possibly labeled) if statement which is not enclosed in
11877 braces and has an else clause. This is used to implement
11878 -Wparentheses.
11880 CHAIN is a vector of if-else-if conditions. This is used to implement
11881 -Wduplicated-cond.
11883 Returns the new statement. */
11885 static tree
11889 {
11890 tree statement;
11892 token_indent_info body_tinfo
11898 /* Mark if () ; with a special NOP_EXPR. */
11900 {
11911 }
11912 /* if a compound is opened, we simply parse the statement directly. */
11915 /* If the token is not a `{', then we must take special action. */
11916 else
11917 {
11918 /* Create a compound-statement. */
11920 /* Parse the dependent-statement. */
11922 /* Finish the dummy compound-statement. */
11924 }
11926 token_indent_info next_tinfo
11930 /* Return the statement. */
11932 }
11934 /* For some dependent statements (like `while (cond) statement'), we
11935 have already created a scope. Therefore, even if the dependent
11936 statement is a compound-statement, we do not want to create another
11937 scope. */
11939 static void
11942 {
11943 /* If the token is a `{', then we must take special action. */
11945 {
11946 token_indent_info body_tinfo
11950 token_indent_info next_tinfo
11953 }
11954 else
11955 {
11956 /* Avoid calling cp_parser_compound_statement, so that we
11957 don't create a new scope. Do everything else by hand. */
11959 /* If the next keyword is `__label__' we have a label declaration. */
11962 /* Parse an (optional) statement-seq. */
11965 }
11966 }
11968 /* Declarations [gram.dcl.dcl] */
11970 /* Parse an optional declaration-sequence.
11972 declaration-seq:
11973 declaration
11974 declaration-seq declaration */
11976 static void
11978 {
11980 {
11991 {
11992 /* A declaration consisting of a single semicolon is
11993 invalid. Allow it unless we're being pedantic. */
11998 }
12000 /* If we're entering or exiting a region that's implicitly
12001 extern "C", modify the lang context appropriately. */
12003 {
12006 }
12008 {
12011 }
12014 {
12015 /* A top-level declaration can consist solely of a #pragma.
12016 A nested declaration cannot, so this is done here and not
12017 in cp_parser_declaration. (A #pragma at block scope is
12018 handled in cp_parser_statement.) */
12021 }
12023 /* Parse the declaration itself. */
12025 }
12026 }
12028 /* Parse a declaration.
12030 declaration:
12031 block-declaration
12032 function-definition
12033 template-declaration
12034 explicit-instantiation
12035 explicit-specialization
12036 linkage-specification
12037 namespace-definition
12039 GNU extension:
12041 declaration:
12042 __extension__ declaration */
12044 static void
12046 {
12047 cp_token token1;
12048 cp_token token2;
12053 /* Check for the `__extension__' keyword. */
12055 {
12056 /* Parse the qualified declaration. */
12058 /* Restore the PEDANTIC flag. */
12062 }
12064 /* Try to figure out what kind of declaration is present. */
12069 else
12070 {
12073 }
12075 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12078 /* If the next token is `extern' and the following token is a string
12079 literal, then we have a linkage specification. */
12083 /* If the next token is `template', then we have either a template
12084 declaration, an explicit instantiation, or an explicit
12085 specialization. */
12087 {
12088 /* `template <>' indicates a template specialization. */
12092 /* `template <' indicates a template declaration. */
12095 /* Anything else must be an explicit instantiation. */
12096 else
12098 }
12099 /* If the next token is `export', then we have a template
12100 declaration. */
12103 /* If the next token is `extern', 'static' or 'inline' and the one
12104 after that is `template', we have a GNU extended explicit
12105 instantiation directive. */
12112 /* If the next token is `namespace', check for a named or unnamed
12113 namespace definition. */
12122 /* An unnamed namespace definition. */
12126 /* An inline (associated) namespace definition. */
12130 /* Objective-C++ declaration/definition. */
12137 /* At this point we may have a template declared by a concept
12138 introduction. */
12143 else
12144 /* Try to parse a block-declaration, or a function-definition. */
12147 /* Free any declarators allocated. */
12149 }
12151 /* Parse a block-declaration.
12153 block-declaration:
12154 simple-declaration
12155 asm-definition
12156 namespace-alias-definition
12157 using-declaration
12158 using-directive
12160 GNU Extension:
12162 block-declaration:
12163 __extension__ block-declaration
12165 C++0x Extension:
12167 block-declaration:
12168 static_assert-declaration
12170 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12171 part of a declaration-statement. */
12173 static void
12176 {
12180 /* Check for the `__extension__' keyword. */
12182 {
12183 /* Parse the qualified declaration. */
12185 /* Restore the PEDANTIC flag. */
12189 }
12191 /* Peek at the next token to figure out which kind of declaration is
12192 present. */
12195 /* If the next keyword is `asm', we have an asm-definition. */
12197 {
12201 }
12202 /* If the next keyword is `namespace', we have a
12203 namespace-alias-definition. */
12206 /* If the next keyword is `using', we have a
12207 using-declaration, a using-directive, or an alias-declaration. */
12209 {
12214 /* If the token after `using' is `namespace', then we have a
12215 using-directive. */
12219 /* If the second token after 'using' is '=', then we have an
12220 alias-declaration. */
12226 /* Otherwise, it's a using-declaration. */
12227 else
12230 }
12231 /* If the next keyword is `__label__' we have a misplaced label
12232 declaration. */
12234 {
12238 /* If the next token is now a `;', consume it. */
12241 }
12242 /* If the next token is `static_assert' we have a static assertion. */
12245 /* Anything else must be a simple-declaration. */
12246 else
12249 }
12251 /* Parse a simple-declaration.
12253 simple-declaration:
12254 decl-specifier-seq [opt] init-declarator-list [opt] ;
12256 init-declarator-list:
12257 init-declarator
12258 init-declarator-list , init-declarator
12260 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12261 function-definition as a simple-declaration.
12263 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12264 parsed declaration if it is an uninitialized single declarator not followed
12265 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12266 if present, will not be consumed. */
12268 static void
12272 {
12273 cp_decl_specifier_seq decl_specifiers;
12282 /* Defer access checks until we know what is being declared; the
12283 checks for names appearing in the decl-specifier-seq should be
12284 done as if we were in the scope of the thing being declared. */
12287 /* Parse the decl-specifier-seq. We have to keep track of whether
12288 or not the decl-specifier-seq declares a named class or
12289 enumeration type, since that is the only case in which the
12290 init-declarator-list is allowed to be empty.
12292 [dcl.dcl]
12294 In a simple-declaration, the optional init-declarator-list can be
12295 omitted only when declaring a class or enumeration, that is when
12296 the decl-specifier-seq contains either a class-specifier, an
12297 elaborated-type-specifier, or an enum-specifier. */
12299 CP_PARSER_FLAGS_OPTIONAL,
12302 /* We no longer need to defer access checks. */
12305 /* In a block scope, a valid declaration must always have a
12306 decl-specifier-seq. By not trying to parse declarators, we can
12307 resolve the declaration/expression ambiguity more quickly. */
12310 {
12313 }
12315 /* If the next two tokens are both identifiers, the code is
12316 erroneous. The usual cause of this situation is code like:
12318 T t;
12320 where "T" should name a type -- but does not. */
12323 {
12324 /* If parsing tentatively, we should commit; we really are
12325 looking at a declaration. */
12327 /* Give up. */
12329 }
12331 /* If we have seen at least one decl-specifier, and the next token
12332 is not a parenthesis, then we must be looking at a declaration.
12333 (After "int (" we might be looking at a functional cast.) */
12340 tree last_type;
12344 /* Keep going until we hit the `;' at the end of the simple
12345 declaration. */
12348 CPP_SEMICOLON))
12349 {
12352 tree decl;
12356 {
12357 /* If we are processing next declarator, comma is expected */
12362 {
12366 }
12367 }
12368 else
12371 /* Parse the init-declarator. */
12374 function_definition_allowed_p,
12376 declares_class_or_enum,
12378 maybe_range_for_decl,
12381 /* If an error occurred while parsing tentatively, exit quickly.
12382 (That usually happens when in the body of a function; each
12383 statement is treated as a declaration-statement until proven
12384 otherwise.) */
12389 {
12392 {
12393 /* If the list of declarators contains more than one declarator,
12394 the type of each declared variable is determined as described
12395 above. If the type deduced for the template parameter U is not
12396 the same in each deduction, the program is ill-formed. */
12401 }
12402 else
12404 }
12406 /* Handle function definitions specially. */
12408 {
12409 /* If the next token is a `,', then we are probably
12410 processing something like:
12412 void f() {}, *p;
12414 which is erroneous. */
12416 {
12419 "mixing"
12421 }
12422 /* Otherwise, we're done with the list of declarators. */
12423 else
12424 {
12427 }
12428 }
12431 /* The next token should be either a `,' or a `;'. */
12433 /* If it's a `,', there are more declarators to come. */
12436 /* If it's a `;', we are done. */
12439 /* Anything else is an error. */
12440 else
12441 {
12442 /* If we have already issued an error message we don't need
12443 to issue another one. */
12448 /* Skip tokens until we reach the end of the statement. */
12450 /* If the next token is now a `;', consume it. */
12454 }
12455 /* After the first time around, a function-definition is not
12456 allowed -- even if it was OK at first. For example:
12458 int i, f() {}
12460 is not valid. */
12462 }
12464 /* Issue an error message if no declarators are present, and the
12465 decl-specifier-seq does not itself declare a class or
12466 enumeration: [dcl.dcl]/3. */
12468 {
12470 {
12474 /* Ensure an error is issued anyway when finish_decltype_type,
12475 called via cp_parser_decl_specifier_seq, returns a class or
12476 an enumeration (c++/51786). */
12479 }
12480 /* Perform any deferred access checks. */
12482 }
12484 /* Consume the `;'. */
12488 {
12494 }
12496 done:
12498 }
12500 /* Parse a decl-specifier-seq.
12502 decl-specifier-seq:
12503 decl-specifier-seq [opt] decl-specifier
12504 decl-specifier attribute-specifier-seq [opt] (C++11)
12506 decl-specifier:
12507 storage-class-specifier
12508 type-specifier
12509 function-specifier
12510 friend
12511 typedef
12513 GNU Extension:
12515 decl-specifier:
12516 attributes
12518 Concepts Extension:
12520 decl-specifier:
12521 concept
12523 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12525 The parser flags FLAGS is used to control type-specifier parsing.
12527 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12528 flags:
12530 1: one of the decl-specifiers is an elaborated-type-specifier
12531 (i.e., a type declaration)
12532 2: one of the decl-specifiers is an enum-specifier or a
12533 class-specifier (i.e., a type definition)
12535 */
12537 static void
12539 cp_parser_flags flags,
12542 {
12546 cp_decl_spec ds;
12548 /* Clear DECL_SPECS. */
12551 /* Assume no class or enumeration type is declared. */
12554 /* Keep reading specifiers until there are no more to read. */
12556 {
12561 /* Peek at the next token. */
12564 /* Save the first token of the decl spec list for error
12565 reporting. */
12568 /* Handle attributes. */
12570 {
12571 /* Parse the attributes. */
12574 /* In a sequence of declaration specifiers, c++11 attributes
12575 appertain to the type that precede them. In that case
12576 [dcl.spec]/1 says:
12578 The attribute-specifier-seq affects the type only for
12579 the declaration it appears in, not other declarations
12580 involving the same type.
12582 But for now let's force the user to position the
12583 attribute either at the beginning of the declaration or
12584 after the declarator-id, which would clearly mean that it
12585 applies to the declarator. */
12587 {
12589 /* The c++11 attribute is at the beginning of the
12590 declaration. It appertains to the entity being
12592 else
12593 {
12595 {
12596 /* This is an attribute following a
12597 class-specifier. */
12602 }
12603 else
12604 {
12605 decl_specs->std_attributes
12607 attrs);
12610 }
12612 }
12613 }
12615 decl_specs->attributes
12617 attrs);
12621 }
12622 /* Assume we will find a decl-specifier keyword. */
12624 /* If the next token is an appropriate keyword, we can simply
12625 add it to the list. */
12627 {
12628 /* decl-specifier:
12629 friend
12630 constexpr */
12633 {
12636 }
12637 else
12638 {
12640 /* Consume the token. */
12642 }
12655 /* function-specifier:
12656 inline
12657 virtual
12658 explicit */
12665 /* decl-specifier:
12666 typedef */
12669 /* Consume the token. */
12671 /* A constructor declarator cannot appear in a typedef. */
12673 /* The "typedef" keyword can only occur in a declaration; we
12674 may as well commit at this point. */
12681 /* storage-class-specifier:
12682 auto
12683 register
12684 static
12685 extern
12686 mutable
12688 GNU Extension:
12689 thread */
12692 {
12693 /* Consume the token. */
12696 /* Complain about `auto' as a storage specifier, if
12697 we're complaining about C++0x compatibility. */
12701 /* Set the storage class anyway. */
12703 token);
12704 }
12705 else
12706 /* C++0x auto type-specifier. */
12714 /* Consume the token. */
12717 token);
12720 /* Consume the token. */
12726 /* We did not yet find a decl-specifier yet. */
12729 }
12739 /* Constructors are a special case. The `S' in `S()' is not a
12740 decl-specifier; it is the beginning of the declarator. */
12741 constructor_p
12742 = (!found_decl_spec
12743 && constructor_possible_p
12744 && (cp_parser_constructor_declarator_p
12747 /* If we don't have a DECL_SPEC yet, then we must be looking at
12748 a type-specifier. */
12750 {
12753 tree type_spec;
12755 type_spec
12757 decl_specs,
12763 /* If this type-specifier referenced a user-defined type
12764 (a typedef, class-name, etc.), then we can't allow any
12765 more such type-specifiers henceforth.
12767 [dcl.spec]
12769 The longest sequence of decl-specifiers that could
12770 possibly be a type name is taken as the
12771 decl-specifier-seq of a declaration. The sequence shall
12772 be self-consistent as described below.
12774 [dcl.type]
12776 As a general rule, at most one type-specifier is allowed
12777 in the complete decl-specifier-seq of a declaration. The
12778 only exceptions are the following:
12780 -- const or volatile can be combined with any other
12781 type-specifier.
12783 -- signed or unsigned can be combined with char, long,
12784 short, or int.
12786 -- ..
12788 Example:
12790 typedef char* Pc;
12791 void g (const int Pc);
12793 Here, Pc is *not* part of the decl-specifier seq; it's
12794 the declarator. Therefore, once we see a type-specifier
12795 (other than a cv-qualifier), we forbid any additional
12796 user-defined types. We *do* still allow things like `int
12797 int' to be considered a decl-specifier-seq, and issue the
12798 error message later. */
12801 /* A constructor declarator cannot follow a type-specifier. */
12803 {
12808 }
12809 }
12811 /* If we still do not have a DECL_SPEC, then there are no more
12812 decl-specifiers. */
12817 /* After we see one decl-specifier, further decl-specifiers are
12818 always optional. */
12820 }
12822 /* Don't allow a friend specifier with a class definition. */
12827 }
12829 /* Parse an (optional) storage-class-specifier.
12831 storage-class-specifier:
12832 auto
12833 register
12834 static
12835 extern
12836 mutable
12838 GNU Extension:
12840 storage-class-specifier:
12841 thread
12843 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12845 static tree
12847 {
12849 {
12853 /* Fall through for C++98. */
12860 /* Consume the token. */
12865 }
12866 }
12868 /* Parse an (optional) function-specifier.
12870 function-specifier:
12871 inline
12872 virtual
12873 explicit
12875 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12876 Updates DECL_SPECS, if it is non-NULL. */
12878 static tree
12881 {
12884 {
12890 /* 14.5.2.3 [temp.mem]
12892 A member function template shall not be virtual. */
12895 else
12905 }
12907 /* Consume the token. */
12909 }
12911 /* Parse a linkage-specification.
12913 linkage-specification:
12914 extern string-literal { declaration-seq [opt] }
12915 extern string-literal declaration */
12917 static void
12919 {
12920 tree linkage;
12922 /* Look for the `extern' keyword. */
12925 /* Look for the string-literal. */
12928 /* Transform the literal into an identifier. If the literal is a
12929 wide-character string, or contains embedded NULs, then we can't
12930 handle it as the user wants. */
12933 {
12935 /* Assume C++ linkage. */
12937 }
12938 else
12941 /* We're now using the new linkage. */
12944 /* If the next token is a `{', then we're using the first
12945 production. */
12947 {
12951 /* Consume the `{' token. */
12953 /* Parse the declarations. */
12955 /* Look for the closing `}'. */
12957 }
12958 /* Otherwise, there's just one declaration. */
12959 else
12960 {
12963 saved_in_unbraced_linkage_specification_p
12967 parser->in_unbraced_linkage_specification_p
12969 }
12971 /* We're done with the linkage-specification. */
12973 }
12975 /* Parse a static_assert-declaration.
12977 static_assert-declaration:
12978 static_assert ( constant-expression , string-literal ) ;
12979 static_assert ( constant-expression ) ; (C++1Z)
12981 If MEMBER_P, this static_assert is a class member. */
12983 static void
12985 {
12986 tree condition;
12987 tree message;
12989 location_t saved_loc;
12992 /* Peek at the `static_assert' token so we can keep track of exactly
12993 where the static assertion started. */
12997 /* Look for the `static_assert' keyword. */
12999 RT_STATIC_ASSERT))
13002 /* We know we are in a static assertion; commit to any tentative
13003 parse. */
13007 /* Parse the `(' starting the static assertion condition. */
13010 /* Parse the constant-expression. Allow a non-constant expression
13011 here in order to give better diagnostics in finish_static_assert. */
13012 condition =
13018 {
13021 "static_assert without a message "
13023 /* Eat the ')' */
13028 }
13029 else
13030 {
13031 /* Parse the separating `,'. */
13034 /* Parse the string-literal message. */
13039 /* A `)' completes the static assertion. */
13045 }
13047 /* A semicolon terminates the declaration. */
13050 /* Complete the static assertion, which may mean either processing
13051 the static assert now or saving it for template instantiation. */
13053 }
13055 /* Parse the expression in decltype ( expression ). */
13057 static tree
13060 {
13062 tree expr;
13064 /* Since we're going to preserve any side-effects from this parse, set up a
13065 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13066 in the expression. */
13069 /* First, try parsing an id-expression. */
13080 {
13083 cp_id_kind idk;
13087 /* Lookup the name we got back from the id-expression. */
13097 {
13098 /* Complete lookup of the id-expression. */
13099 expr = (finish_id_expression
13112 /* We found an id-expression, but it was something that we
13113 should not have found. This is an error, not something
13114 we can recover from, so note that we found an
13115 id-expression and we'll recover as gracefully as
13116 possible. */
13118 }
13123 /* We have an id-expression. */
13125 }
13128 {
13129 /* Abort the id-expression parse. */
13132 /* Parsing tentatively, again. */
13135 /* Parse a class member access. */
13143 /* We have an id-expression. */
13145 }
13148 /* We have parsed the complete id-expression or member access. */
13150 else
13151 {
13152 /* Abort our attempt to parse an id-expression or member access
13153 expression. */
13156 /* Parse a full expression. */
13159 }
13162 }
13164 /* Parse a `decltype' type. Returns the type.
13166 simple-type-specifier:
13167 decltype ( expression )
13168 C++14 proposal:
13169 decltype ( auto ) */
13171 static tree
13173 {
13174 tree expr;
13183 {
13184 /* Already parsed. */
13187 }
13189 /* Look for the `decltype' token. */
13193 /* Parse the opening `('. */
13197 /* decltype (auto) */
13200 {
13207 }
13209 /* Types cannot be defined in a `decltype' expression. Save away the
13210 old message. */
13213 /* And create the new one. */
13214 parser->type_definition_forbidden_message
13217 /* The restrictions on constant-expressions do not apply inside
13218 decltype expressions. */
13219 saved_integral_constant_expression_p
13221 saved_non_integral_constant_expression_p
13225 /* Within a parenthesized expression, a `>' token is always
13226 the greater-than operator. */
13227 saved_greater_than_is_operator_p
13231 /* Do not actually evaluate the expression. */
13234 /* Do not warn about problems with the expression. */
13239 /* Go back to evaluating expressions. */
13243 /* The `>' token might be the end of a template-id or
13244 template-parameter-list now. */
13245 parser->greater_than_is_operator_p
13248 /* Restore the old message and the integral constant expression
13249 flags. */
13251 parser->integral_constant_expression_p
13253 parser->non_integral_constant_expression_p
13256 /* Parse to the closing `)'. */
13258 {
13262 }
13265 tf_warning_or_error);
13267 rewrite:
13268 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13269 it again. */
13278 }
13280 /* Special member functions [gram.special] */
13282 /* Parse a conversion-function-id.
13284 conversion-function-id:
13285 operator conversion-type-id
13287 Returns an IDENTIFIER_NODE representing the operator. */
13289 static tree
13291 {
13292 tree type;
13293 tree saved_scope;
13294 tree saved_qualifying_scope;
13295 tree saved_object_scope;
13298 /* Look for the `operator' token. */
13301 /* When we parse the conversion-type-id, the current scope will be
13302 reset. However, we need that information in able to look up the
13303 conversion function later, so we save it here. */
13307 /* We must enter the scope of the class so that the names of
13308 entities declared within the class are available in the
13309 conversion-type-id. For example, consider:
13311 struct S {
13312 typedef int I;
13313 operator I();
13314 };
13316 S::operator I() { ... }
13318 In order to see that `I' is a type-name in the definition, we
13319 must be in the scope of `S'. */
13322 /* Parse the conversion-type-id. */
13324 /* Leave the scope of the class, if any. */
13327 /* Restore the saved scope. */
13331 /* If the TYPE is invalid, indicate failure. */
13335 }
13337 /* Parse a conversion-type-id:
13339 conversion-type-id:
13340 type-specifier-seq conversion-declarator [opt]
13342 Returns the TYPE specified. */
13344 static tree
13346 {
13347 tree attributes;
13348 cp_decl_specifier_seq type_specifiers;
13350 tree type_specified;
13353 /* Parse the attributes. */
13357 parser->type_definition_forbidden_message
13360 /* Parse the type-specifiers. */
13367 /* If that didn't work, stop. */
13370 /* Parse the conversion-declarator. */
13378 /* Don't give this error when parsing tentatively. This happens to
13379 work because we always parse this definitively once. */
13382 {
13384 {
13387 }
13391 }
13394 }
13396 /* Parse an (optional) conversion-declarator.
13398 conversion-declarator:
13399 ptr-operator conversion-declarator [opt]
13401 */
13405 {
13408 cp_cv_quals cv_quals;
13410 /* We don't know if there's a ptr-operator next, or not. */
13412 /* Try the ptr-operator. */
13415 /* If it worked, look for more conversion-declarators. */
13417 {
13420 /* Parse another optional declarator. */
13423 declarator = cp_parser_make_indirect_declarator
13427 }
13430 }
13432 /* Parse an (optional) ctor-initializer.
13434 ctor-initializer:
13435 : mem-initializer-list
13437 Returns TRUE iff the ctor-initializer was actually present. */
13439 static bool
13441 {
13442 /* If the next token is not a `:', then there is no
13443 ctor-initializer. */
13445 {
13446 /* Do default initialization of any bases and members. */
13451 }
13453 /* Consume the `:' token. */
13455 /* And the mem-initializer-list. */
13459 }
13461 /* Parse a mem-initializer-list.
13463 mem-initializer-list:
13464 mem-initializer ... [opt]
13465 mem-initializer ... [opt] , mem-initializer-list */
13467 static void
13469 {
13474 /* Let the semantic analysis code know that we are starting the
13475 mem-initializer-list. */
13480 /* Loop through the list. */
13482 {
13483 tree mem_initializer;
13486 /* Parse the mem-initializer. */
13488 /* If the next token is a `...', we're expanding member initializers. */
13490 {
13491 /* Consume the `...'. */
13494 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13495 can be expanded but members cannot. */
13498 {
13503 }
13505 /* Construct the pack expansion type. */
13508 }
13511 {
13515 }
13516 /* Look for a target constructor. */
13520 {
13523 {
13527 }
13529 }
13530 /* Add it to the list, unless it was erroneous. */
13532 {
13535 }
13536 /* If the next token is not a `,', we're done. */
13539 /* Consume the `,' token. */
13541 }
13543 /* Perform semantic analysis. */
13546 }
13548 /* Parse a mem-initializer.
13550 mem-initializer:
13551 mem-initializer-id ( expression-list [opt] )
13552 mem-initializer-id braced-init-list
13554 GNU extension:
13556 mem-initializer:
13557 ( expression-list [opt] )
13559 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13560 class) or FIELD_DECL (for a non-static data member) to initialize;
13561 the TREE_VALUE is the expression-list. An empty initialization
13562 list is represented by void_list_node. */
13564 static tree
13566 {
13567 tree mem_initializer_id;
13568 tree expression_list;
13569 tree member;
13572 /* Find out what is being initialized. */
13574 {
13578 }
13579 else
13580 {
13584 }
13590 {
13597 }
13598 else
13599 {
13609 }
13619 }
13621 /* Parse a mem-initializer-id.
13623 mem-initializer-id:
13624 :: [opt] nested-name-specifier [opt] class-name
13625 decltype-specifier (C++11)
13626 identifier
13628 Returns a TYPE indicating the class to be initialized for the first
13629 production (and the second in C++11). Returns an IDENTIFIER_NODE
13630 indicating the data member to be initialized for the last production. */
13632 static tree
13634 {
13638 tree id;
13642 /* `typename' is not allowed in this context ([temp.res]). */
13644 {
13646 "keyword %<typename%> not allowed in this context (a qualified "
13649 }
13650 /* Look for the optional `::' operator. */
13651 global_scope_p
13655 /* Look for the optional nested-name-specifier. The simplest way to
13656 implement:
13658 [temp.res]
13660 The keyword `typename' is not permitted in a base-specifier or
13661 mem-initializer; in these contexts a qualified name that
13662 depends on a template-parameter is implicitly assumed to be a
13663 type name.
13665 is to assume that we have seen the `typename' keyword at this
13666 point. */
13667 nested_name_specifier_p
13676 /* If there is a `::' operator or a nested-name-specifier, then we
13677 are definitely looking for a class-name. */
13682 typename_type,
13686 /* Otherwise, we could also be looking for an ordinary identifier. */
13689 /* Try a decltype-specifier. */
13691 else
13692 /* Otherwise, try a class-name. */
13696 none_type,
13700 /* If we found one, we're done. */
13703 /* Otherwise, look for an ordinary identifier. */
13705 }
13707 /* Overloading [gram.over] */
13709 /* Parse an operator-function-id.
13711 operator-function-id:
13712 operator operator
13714 Returns an IDENTIFIER_NODE for the operator which is a
13715 human-readable spelling of the identifier, e.g., `operator +'. */
13717 static cp_expr
13719 {
13720 /* Look for the `operator' keyword. */
13723 /* And then the name of the operator itself. */
13725 }
13727 /* Return an identifier node for a user-defined literal operator.
13728 The suffix identifier is chained to the operator name identifier. */
13730 static tree
13732 {
13733 tree identifier;
13740 }
13742 /* Parse an operator.
13744 operator:
13745 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13746 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13747 || ++ -- , ->* -> () []
13749 GNU Extensions:
13751 operator:
13752 <? >? <?= >?=
13754 Returns an IDENTIFIER_NODE for the operator which is a
13755 human-readable spelling of the identifier, e.g., `operator +'. */
13757 static cp_expr
13759 {
13764 /* Peek at the next token. */
13769 /* Figure out which operator we have. */
13771 {
13773 {
13776 /* The keyword should be either `new' or `delete'. */
13781 else
13784 /* Consume the `new' or `delete' token. */
13787 /* Peek at the next token. */
13789 /* If it's a `[' token then this is the array variant of the
13790 operator. */
13792 {
13793 /* Consume the `[' token. */
13795 /* Look for the `]' token. */
13800 }
13801 /* Otherwise, we have the non-array variant. */
13802 else
13808 }
13955 /* Consume the `('. */
13957 /* Look for the matching `)'. */
13962 /* Consume the `['. */
13964 /* Look for the matching `]'. */
13979 {
13986 /* Consume the string. */
13992 {
13995 }
13996 else
13997 {
13999 /* Look for the suffix identifier. */
14004 {
14008 }
14009 else
14010 {
14013 }
14014 }
14019 {
14022 }
14025 {
14028 }
14030 {
14033 }
14035 }
14038 /* Anything else is an error. */
14040 }
14042 /* If we have selected an identifier, we need to consume the
14043 operator token. */
14046 /* Otherwise, no valid operator name was present. */
14047 else
14048 {
14051 }
14054 }
14056 /* Parse a template-declaration.
14058 template-declaration:
14059 export [opt] template < template-parameter-list > declaration
14061 If MEMBER_P is TRUE, this template-declaration occurs within a
14062 class-specifier.
14064 The grammar rule given by the standard isn't correct. What
14065 is really meant is:
14067 template-declaration:
14068 export [opt] template-parameter-list-seq
14069 decl-specifier-seq [opt] init-declarator [opt] ;
14070 export [opt] template-parameter-list-seq
14071 function-definition
14073 template-parameter-list-seq:
14074 template-parameter-list-seq [opt]
14075 template < template-parameter-list >
14077 Concept Extensions:
14079 template-parameter-list-seq:
14080 template < template-parameter-list > requires-clause [opt]
14082 requires-clause:
14083 requires logical-or-expression */
14085 static void
14087 {
14088 /* Check for `export'. */
14090 {
14091 /* Consume the `export' token. */
14093 /* Warn that we do not support `export'. */
14095 }
14098 }
14100 /* Parse a template-parameter-list.
14102 template-parameter-list:
14103 template-parameter
14104 template-parameter-list , template-parameter
14106 Returns a TREE_LIST. Each node represents a template parameter.
14107 The nodes are connected via their TREE_CHAINs. */
14109 static tree
14111 {
14116 /* The loop below parses the template parms. We first need to know
14117 the total number of template parms to be able to compute proper
14118 canonical types of each dependent type. So after the loop, when
14119 we know the total number of template parms,
14120 end_template_parm_list computes the proper canonical types and
14121 fixes up the dependent types accordingly. */
14123 {
14124 tree parameter;
14127 location_t parm_loc;
14129 /* Parse the template-parameter. */
14134 /* Add it to the list. */
14137 parm_loc,
14138 parameter,
14139 is_non_type,
14140 is_parameter_pack);
14141 else
14142 {
14145 }
14147 /* If the next token is not a `,', we're done. */
14150 /* Otherwise, consume the `,' token. */
14152 }
14155 }
14157 /* Parse a introduction-list.
14159 introduction-list:
14160 introduced-parameter
14161 introduction-list , introduced-parameter
14163 introduced-parameter:
14164 ...[opt] identifier
14166 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14167 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14168 WILDCARD_DECL will also have DECL_NAME set and token location in
14169 DECL_SOURCE_LOCATION. */
14171 static tree
14173 {
14177 {
14182 /* Build placeholder. */
14190 /* If the next token is not a `,', we're done. */
14193 /* Otherwise, consume the `,' token. */
14195 }
14197 /* Convert the vec into a TREE_VEC. */
14200 tree parm;
14206 }
14208 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14209 is an abstract declarator. */
14213 {
14218 }
14220 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14221 is an abstract declarator. */
14225 {
14229 else
14231 }
14233 /* Returns true if DECL represents a constrained-parameter. */
14237 {
14242 }
14244 /* Returns true if PARM declares a constrained-parameter. */
14248 {
14250 }
14252 /* Check that the type parameter is only a declarator-id, and that its
14253 type is not cv-qualified. */
14255 bool
14258 {
14263 {
14266 }
14268 /* Don't allow cv-qualified type parameters. */
14271 {
14274 }
14277 }
14279 /* Finish parsing/processing a template type parameter and checking
14280 various restrictions. */
14284 tree id,
14286 {
14289 else
14291 }
14293 static tree
14295 {
14296 /* FIXME: This should probably be copied, and we may need to adjust
14297 the template parameter depths. */
14307 }
14309 /* Finish parsing/processing a template template parameter by borrowing
14310 the template parameter list from the prototype parameter. */
14312 static tree
14314 tree proto,
14315 tree id,
14317 {
14321 }
14323 /* Create a new non-type template parameter from the given PARM
14324 declarator. */
14326 static tree
14329 {
14335 }
14337 /* Build a constrained template parameter based on the PARMDECL
14338 declarator. The type of PARMDECL is the constrained type, which
14339 refers to the prototype template parameter that ultimately
14340 specifies the type of the declared parameter. */
14342 static tree
14347 {
14353 /* A template parameter constrained by a variadic concept shall also
14354 be declared as a template parameter pack. */
14359 /* Build the parameter. Return an error if the declarator was invalid. */
14360 tree parm;
14365 parmdecl);
14366 else
14371 /* Finish the parameter decl and create a node attaching the
14372 default argument and constraint. */
14377 }
14379 /* Returns true if the parsed type actually represents the declaration
14380 of a type template-parameter. */
14384 {
14387 }
14390 /* Returns true if the parsed type actually represents the declaration of
14391 a template template-parameter. */
14393 static bool
14395 {
14398 }
14400 /* Parse a default argument for a type template-parameter.
14401 Note that diagnostics are handled in cp_parser_template_parameter. */
14403 static tree
14405 {
14408 /* Consume the `=' token. */
14413 /* Parse the default-argument. */
14419 {
14423 }
14426 }
14428 /* Parse a default argument for a template template-parameter. */
14430 static tree
14432 {
14437 /* Consume the `='. */
14439 /* Parse the id-expression. */
14441 /* save token before parsing the id-expression, for error
14442 reporting */
14444 tree default_argument
14452 /* If the id-expression was a template-id that refers to
14453 a template-class, we already have the declaration here,
14454 so no further lookup is needed. */
14455 ;
14456 else
14457 /* Look up the name. */
14458 default_argument
14460 none_type,
14466 /* See if the default argument is valid. */
14470 }
14472 /* Parse a template-parameter.
14474 template-parameter:
14475 type-parameter
14476 parameter-declaration
14478 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14479 the parameter. The TREE_PURPOSE is the default value, if any.
14480 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14481 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14482 set to true iff this parameter is a parameter pack. */
14484 static tree
14487 {
14490 tree parm;
14492 /* Assume it is a type parameter or a template parameter. */
14494 /* Assume it not a parameter pack. */
14496 /* Peek at the next token. */
14498 /* If it is `class' or `template', we have a type-parameter. */
14501 /* If it is `class' or `typename' we do not know yet whether it is a
14502 type parameter or a non-type parameter. Consider:
14504 template <typename T, typename T::X X> ...
14506 or:
14508 template <class C, class D*> ...
14510 Here, the first parameter is a type parameter, and the second is
14511 a non-type parameter. We can tell by looking at the token after
14512 the identifier -- if it is a `,', `=', or `>' then we have a type
14513 parameter. */
14515 {
14516 /* Peek at the token after `class' or `typename'. */
14518 /* If it's an ellipsis, we have a template type parameter
14519 pack. */
14522 /* If it's an identifier, skip it. */
14525 /* Now, see if the token looks like the end of a template
14526 parameter. */
14531 }
14533 /* Otherwise, it is a non-type parameter or a constrained parameter.
14535 [temp.param]
14537 When parsing a default template-argument for a non-type
14538 template-parameter, the first non-nested `>' is taken as the end
14539 of the template parameter-list rather than a greater-than
14540 operator. */
14541 parameter_declarator
14548 /* If the parameter declaration is marked as a parameter pack, set
14549 *IS_PARAMETER_PACK to notify the caller. */
14554 {
14555 /* Can happen in some cases of erroneous input (c++/34892). */
14557 /* Consume the `...' for better error recovery. */
14559 }
14561 // The parameter may have been constrained.
14564 parameter_declarator,
14565 is_non_type,
14566 is_parameter_pack);
14568 // Now we're sure that the parameter is a non-type parameter.
14579 }
14581 /* Parse a type-parameter.
14583 type-parameter:
14584 class identifier [opt]
14585 class identifier [opt] = type-id
14586 typename identifier [opt]
14587 typename identifier [opt] = type-id
14588 template < template-parameter-list > class identifier [opt]
14589 template < template-parameter-list > class identifier [opt]
14590 = id-expression
14592 GNU Extension (variadic templates):
14594 type-parameter:
14595 class ... identifier [opt]
14596 typename ... identifier [opt]
14598 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14599 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14600 the declaration of the parameter.
14602 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14604 static tree
14606 {
14608 tree parameter;
14610 /* Look for a keyword to tell us what kind of parameter this is. */
14616 {
14619 {
14620 tree identifier;
14621 tree default_argument;
14623 /* If the next token is an ellipsis, we have a template
14624 argument pack. */
14626 {
14627 /* Consume the `...' token. */
14632 }
14634 /* If the next token is an identifier, then it names the
14635 parameter. */
14638 else
14641 /* Create the parameter. */
14644 /* If the next token is an `=', we have a default argument. */
14646 {
14647 default_argument
14650 /* Template parameter packs cannot have default
14651 arguments. */
14653 {
14656 "template parameter pack %qD cannot have a "
14658 else
14660 "template parameter packs cannot have "
14663 }
14666 }
14667 else
14670 /* Create the combined representation of the parameter and the
14671 default argument. */
14673 }
14677 {
14678 tree identifier;
14679 tree default_argument;
14681 /* Look for the `<'. */
14683 /* Parse the template-parameter-list. */
14685 /* Look for the `>'. */
14688 // If template requirements are present, parse them.
14694 /* Look for the `class' or 'typename' keywords. */
14696 /* If the next token is an ellipsis, we have a template
14697 argument pack. */
14699 {
14700 /* Consume the `...' token. */
14705 }
14706 /* If the next token is an `=', then there is a
14707 default-argument. If the next token is a `>', we are at
14708 the end of the parameter-list. If the next token is a `,',
14709 then we are at the end of this parameter. */
14713 {
14715 /* Treat invalid names as if the parameter were nameless. */
14718 }
14719 else
14722 /* Create the template parameter. */
14724 identifier);
14726 /* If the next token is an `=', then there is a
14727 default-argument. */
14729 {
14730 default_argument
14733 /* Template parameter packs cannot have default
14734 arguments. */
14736 {
14739 "template parameter pack %qD cannot "
14741 identifier);
14742 else
14746 }
14747 }
14748 else
14751 /* Create the combined representation of the parameter and the
14752 default argument. */
14754 }
14760 }
14763 }
14765 /* Parse a template-id.
14767 template-id:
14768 template-name < template-argument-list [opt] >
14770 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14771 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14772 returned. Otherwise, if the template-name names a function, or set
14773 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14774 names a class, returns a TYPE_DECL for the specialization.
14776 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14777 uninstantiated templates. */
14779 static tree
14785 {
14786 tree templ;
14787 tree arguments;
14788 tree template_id;
14793 /* If the next token corresponds to a template-id, there is no need
14794 to reparse it. */
14797 {
14800 }
14802 /* Avoid performing name lookup if there is no possibility of
14803 finding a template-id. */
14806 && !cp_parser_nth_token_starts_template_argument_list_p
14808 {
14811 }
14813 /* Remember where the template-id starts. */
14819 /* Parse the template-name. */
14822 check_dependency_p,
14823 is_declaration,
14824 tag_type,
14827 {
14830 }
14832 /* Since we're going to preserve any side-effects from this parse, set up a
14833 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14834 in the template arguments. */
14837 /* If we find the sequence `[:' after a template-name, it's probably
14838 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14839 parse correctly the argument list. */
14846 {
14848 /* Change `:' into `::'. */
14850 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14851 CPP_LESS. */
14854 /* Parse the arguments. */
14857 {
14858 /* If we couldn't parse an argument list, then we revert our changes
14859 and return simply an error. Maybe this is not a template-id
14860 after all. */
14865 }
14866 /* Otherwise, emit an error about the invalid digraph, but continue
14867 parsing because we got our argument list. */
14870 {
14873 "%<<:%> is an alternate spelling for %<[%>."
14876 {
14878 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14881 }
14882 }
14883 }
14884 else
14885 {
14886 /* Look for the `<' that starts the template-argument-list. */
14888 {
14891 }
14892 /* Parse the arguments. */
14894 }
14896 /* Build a representation of the specialization. */
14899 TEMPLATE_ID_EXPR,
14903 {
14905 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14906 template (rather than some instantiation thereof) only if
14907 is not nested within some other construct. For example, in
14908 "template <typename T> void f(T) { A<T>::", A<T> is just an
14909 instantiation of A. */
14912 CPP_SCOPE));
14913 template_id
14915 }
14916 /* A template-like identifier may be a partial concept id. */
14922 {
14926 }
14927 else
14928 {
14929 /* If it's not a class-template or a template-template, it should be
14930 a function-template. */
14938 }
14940 /* If parsing tentatively, replace the sequence of tokens that makes
14941 up the template-id with a CPP_TEMPLATE_ID token. That way,
14942 should we re-parse the token stream, we will not have to repeat
14943 the effort required to do the parse, nor will we issue duplicate
14944 error messages about problems during instantiation of the
14945 template. */
14947 /* Don't do this if we had a parse error in a declarator; re-parsing
14948 might succeed if a name changes meaning (60361). */
14952 {
14955 /* Reset the contents of the START_OF_ID token. */
14958 /* Update the location to be of the form:
14959 template-name < template-argument-list [opt] >
14960 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14961 with caret == start at the start of the template-name,
14962 ranging until the closing '>'. */
14963 location_t finish_loc
14965 location_t combined_loc
14969 /* Retrieve any deferred checks. Do not pop this access checks yet
14970 so the memory will not be reclaimed during token replacing below. */
14976 /* Purge all subsequent tokens. */
14979 /* ??? Can we actually assume that, if template_id ==
14980 error_mark_node, we will have issued a diagnostic to the
14981 user, as opposed to simply marking the tentative parse as
14982 failed? */
14985 }
14989 }
14991 /* Parse a template-name.
14993 template-name:
14994 identifier
14996 The standard should actually say:
14998 template-name:
14999 identifier
15000 operator-function-id
15002 A defect report has been filed about this issue.
15004 A conversion-function-id cannot be a template name because they cannot
15005 be part of a template-id. In fact, looking at this code:
15007 a.operator K<int>()
15009 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15010 It is impossible to call a templated conversion-function-id with an
15011 explicit argument list, since the only allowed template parameter is
15012 the type to which it is converting.
15014 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15015 `template' keyword, in a construction like:
15017 T::template f<3>()
15019 In that case `f' is taken to be a template-name, even though there
15020 is no way of knowing for sure.
15022 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15023 name refers to a set of overloaded functions, at least one of which
15024 is a template, or an IDENTIFIER_NODE with the name of the template,
15025 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15026 names are looked up inside uninstantiated templates. */
15028 static tree
15035 {
15036 tree identifier;
15037 tree decl;
15038 tree fns;
15041 /* If the next token is `operator', then we have either an
15042 operator-function-id or a conversion-function-id. */
15044 {
15045 /* We don't know whether we're looking at an
15046 operator-function-id or a conversion-function-id. */
15048 /* Try an operator-function-id. */
15050 /* If that didn't work, try a conversion-function-id. */
15052 {
15055 }
15056 }
15057 /* Look for the identifier. */
15058 else
15061 /* If we didn't find an identifier, we don't have a template-id. */
15065 /* If the name immediately followed the `template' keyword, then it
15066 is a template-name. However, if the next token is not `<', then
15067 we do not treat it as a template-name, since it is not being used
15068 as part of a template-id. This enables us to handle constructs
15069 like:
15071 template <typename T> struct S { S(); };
15072 template <typename T> S<T>::S();
15074 correctly. We would treat `S' as a template -- if it were `S<T>'
15075 -- but we do not if there is no `<'. */
15079 {
15080 /* In a declaration, in a dependent context, we pretend that the
15081 "template" keyword was present in order to improve error
15082 recovery. For example, given:
15084 template <typename T> void f(T::X<int>);
15086 we want to treat "X<int>" as a template-id. */
15088 && !template_keyword_p
15090 && check_dependency_p
15092 /* Do not do this for dtors (or ctors), since they never
15093 need the template keyword before their name. */
15095 {
15098 /* Explain what went wrong. */
15100 identifier);
15103 /* If parsing tentatively, find the location of the "<" token. */
15106 /* Parse the template arguments so that we can issue error
15107 messages about them. */
15110 /* Skip tokens until we find a good place from which to
15111 continue parsing. */
15116 /* If parsing tentatively, permanently remove the
15117 template argument list. That will prevent duplicate
15118 error messages from being issued about the missing
15119 "template" keyword. */
15125 }
15127 /* If the "template" keyword is present, then there is generally
15128 no point in doing name-lookup, so we just return IDENTIFIER.
15129 But, if the qualifying scope is non-dependent then we can
15130 (and must) do name-lookup normally. */
15136 }
15138 /* Look up the name. */
15140 tag_type,
15143 check_dependency_p,
15149 /* If DECL is a template, then the name was a template-name. */
15151 {
15155 }
15156 else
15157 {
15160 /* The standard does not explicitly indicate whether a name that
15161 names a set of overloaded declarations, some of which are
15162 templates, is a template-name. However, such a name should
15163 be a template-name; otherwise, there is no way to form a
15164 template-id for the overloaded templates. */
15172 {
15173 /* The name does not name a template. */
15176 }
15177 }
15179 /* If DECL is dependent, and refers to a function, then just return
15180 its name; we will look it up again during template instantiation. */
15182 {
15186 }
15189 }
15191 /* Parse a template-argument-list.
15193 template-argument-list:
15194 template-argument ... [opt]
15195 template-argument-list , template-argument ... [opt]
15197 Returns a TREE_VEC containing the arguments. */
15199 static tree
15201 {
15206 tree vec;
15213 /* Even if the template-id appears in an integral
15214 constant-expression, the contents of the argument list do
15215 not. */
15221 /* Parse the arguments. */
15222 do
15223 {
15224 tree argument;
15227 /* Consume the comma. */
15230 /* Parse the template-argument. */
15233 /* If the next token is an ellipsis, we're expanding a template
15234 argument pack. */
15236 {
15238 {
15242 }
15243 /* Consume the `...' token. */
15246 /* Make the argument into a TYPE_PACK_EXPANSION or
15247 EXPR_PACK_EXPANSION. */
15249 }
15252 {
15256 {
15259 }
15260 else
15262 }
15264 }
15280 }
15282 /* Parse a template-argument.
15284 template-argument:
15285 assignment-expression
15286 type-id
15287 id-expression
15289 The representation is that of an assignment-expression, type-id, or
15290 id-expression -- except that the qualified id-expression is
15291 evaluated, so that the value returned is either a DECL or an
15292 OVERLOAD.
15294 Although the standard says "assignment-expression", it forbids
15295 throw-expressions or assignments in the template argument.
15296 Therefore, we use "conditional-expression" instead. */
15298 static tree
15300 {
15301 tree argument;
15307 cp_id_kind idk;
15309 /* There's really no way to know what we're looking at, so we just
15310 try each alternative in order.
15312 [temp.arg]
15314 In a template-argument, an ambiguity between a type-id and an
15315 expression is resolved to a type-id, regardless of the form of
15316 the corresponding template-parameter.
15318 Therefore, we try a type-id first. */
15321 /* If there was no error parsing the type-id but the next token is a
15322 '>>', our behavior depends on which dialect of C++ we're
15323 parsing. In C++98, we probably found a typo for '> >'. But there
15324 are type-id which are also valid expressions. For instance:
15326 struct X { int operator >> (int); };
15327 template <int V> struct Foo {};
15328 Foo<X () >> 5> r;
15330 Here 'X()' is a valid type-id of a function type, but the user just
15331 wanted to write the expression "X() >> 5". Thus, we remember that we
15332 found a valid type-id, but we still try to parse the argument as an
15333 expression to see what happens.
15335 In C++0x, the '>>' will be considered two separate '>'
15336 tokens. */
15340 {
15343 }
15344 else
15345 {
15346 /* If the next token isn't a `,' or a `>', then this argument wasn't
15347 really finished. This means that the argument is not a valid
15348 type-id. */
15351 /* If that worked, we're done. */
15354 }
15355 /* We're still not sure what the argument will be. */
15357 /* Try a template. */
15365 /* If the next token isn't a `,' or a `>', then this argument wasn't
15366 really finished. */
15370 {
15371 /* Figure out what is being referred to. If the id-expression
15372 was for a class template specialization, then we will have a
15373 TYPE_DECL at this point. There is no need to do name lookup
15374 at this point in that case. */
15377 none_type,
15383 /* Handle a constrained-type-specifier for a non-type template
15384 parameter. */
15390 }
15392 {
15396 }
15397 /* It must be a non-type argument. In C++17 any constant-expression is
15398 allowed. */
15402 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15404 -- an integral constant-expression of integral or enumeration
15405 type; or
15407 -- the name of a non-type template-parameter; or
15409 -- the name of an object or function with external linkage...
15411 -- the address of an object or function with external linkage...
15413 -- a pointer to member... */
15414 /* Look for a non-type template parameter. */
15416 {
15428 }
15430 /* If the next token is "&", the argument must be the address of an
15431 object or function with external linkage. */
15434 {
15437 }
15438 /* See if we might have an id-expression. */
15445 {
15448 address_p,
15455 else
15456 {
15457 tree probe;
15460 {
15461 /* Strip the dereference temporarily. */
15464 }
15466 /* If we're in a template, we represent a qualified-id referring
15467 to a static data member as a SCOPE_REF even if the scope isn't
15468 dependent so that we can check access control later. */
15473 {
15474 /* A variable without external linkage might still be a
15475 valid constant-expression, so no error is issued here
15476 if the external-linkage check fails. */
15479 }
15481 /* All overloaded functions are allowed; if the external
15482 linkage test does not pass, an error will be issued
15483 later. */
15484 ;
15488 /* A pointer-to-member. */
15489 ;
15491 ;
15492 else
15496 {
15499 tf_warning_or_error);
15500 else
15503 }
15504 }
15505 }
15506 /* If the argument started with "&", there are no other valid
15507 alternatives at this point. */
15509 {
15512 }
15514 general_expr:
15515 /* If the argument wasn't successfully parsed as a type-id followed
15516 by '>>', the argument can only be a constant expression now.
15517 Otherwise, we try parsing the constant-expression tentatively,
15518 because the argument could really be a type-id. */
15524 else
15525 {
15526 /* With C++17 generalized non-type template arguments we need to handle
15527 lvalue constant expressions, too. */
15530 }
15538 /* We did our best to parse the argument as a non type-id, but that
15539 was the only alternative that matched (albeit with a '>' after
15540 it). We can assume it's just a typo from the user, and a
15541 diagnostic will then be issued. */
15543 }
15545 /* Parse an explicit-instantiation.
15547 explicit-instantiation:
15548 template declaration
15550 Although the standard says `declaration', what it really means is:
15552 explicit-instantiation:
15553 template decl-specifier-seq [opt] declarator [opt] ;
15555 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15556 supposed to be allowed. A defect report has been filed about this
15557 issue.
15559 GNU Extension:
15561 explicit-instantiation:
15562 storage-class-specifier template
15563 decl-specifier-seq [opt] declarator [opt] ;
15564 function-specifier template
15565 decl-specifier-seq [opt] declarator [opt] ; */
15567 static void
15569 {
15571 cp_decl_specifier_seq decl_specifiers;
15576 /* Look for an (optional) storage-class-specifier or
15577 function-specifier. */
15579 {
15580 extension_specifier
15583 extension_specifier
15586 }
15588 /* Look for the `template' keyword. */
15590 /* Let the front end know that we are processing an explicit
15591 instantiation. */
15593 /* [temp.explicit] says that we are supposed to ignore access
15594 control while processing explicit instantiation directives. */
15596 /* Parse a decl-specifier-seq. */
15598 CP_PARSER_FLAGS_OPTIONAL,
15601 /* If there was exactly one decl-specifier, and it declared a class,
15602 and there's no declarator, then we have an explicit type
15603 instantiation. */
15605 {
15606 tree type;
15610 /* Turn access control back on for names used during
15611 template instantiation. */
15616 }
15617 else
15618 {
15620 tree decl;
15622 /* Parse the declarator. */
15623 declarator
15634 {
15637 "explicit instantiation shall not use"
15641 "explicit instantiation shall not use"
15646 /* Turn access control back on for names used during
15647 template instantiation. */
15649 /* Do the explicit instantiation. */
15651 }
15652 else
15653 {
15655 /* Skip the body of the explicit instantiation. */
15657 }
15658 }
15659 /* We're done with the instantiation. */
15665 }
15667 /* Parse an explicit-specialization.
15669 explicit-specialization:
15670 template < > declaration
15672 Although the standard says `declaration', what it really means is:
15674 explicit-specialization:
15675 template <> decl-specifier [opt] init-declarator [opt] ;
15676 template <> function-definition
15677 template <> explicit-specialization
15678 template <> template-declaration */
15680 static void
15682 {
15686 /* Look for the `template' keyword. */
15688 /* Look for the `<'. */
15690 /* Look for the `>'. */
15692 /* We have processed another parameter list. */
15694 /* [temp]
15696 A template ... explicit specialization ... shall not have C
15697 linkage. */
15699 {
15701 /* Give it C++ linkage to avoid confusing other parts of the
15702 front end. */
15705 }
15706 else
15708 /* Let the front end know that we are beginning a specialization. */
15710 {
15713 }
15715 /* If the next keyword is `template', we need to figure out whether
15716 or not we're looking a template-declaration. */
15718 {
15723 else
15725 }
15726 else
15727 /* Parse the dependent declaration. */
15733 /* We're done with the specialization. */
15735 /* For the erroneous case of a template with C linkage, we pushed an
15736 implicit C++ linkage scope; exit that scope now. */
15739 /* We're done with this parameter list. */
15741 }
15743 /* Parse a type-specifier.
15745 type-specifier:
15746 simple-type-specifier
15747 class-specifier
15748 enum-specifier
15749 elaborated-type-specifier
15750 cv-qualifier
15752 GNU Extension:
15754 type-specifier:
15755 __complex__
15757 Returns a representation of the type-specifier. For a
15758 class-specifier, enum-specifier, or elaborated-type-specifier, a
15759 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15761 The parser flags FLAGS is used to control type-specifier parsing.
15763 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15764 in a decl-specifier-seq.
15766 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15767 class-specifier, enum-specifier, or elaborated-type-specifier, then
15768 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15769 if a type is declared; 2 if it is defined. Otherwise, it is set to
15770 zero.
15772 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15773 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15774 is set to FALSE. */
15776 static tree
15778 cp_parser_flags flags,
15783 {
15789 /* Assume this type-specifier does not declare a new type. */
15792 /* And that it does not specify a cv-qualifier. */
15795 /* Peek at the next token. */
15798 /* If we're looking at a keyword, we can use that to guide the
15799 production we choose. */
15802 {
15807 /* Look for the enum-specifier. */
15809 /* If that worked, we're done. */
15811 {
15816 type_spec,
15817 token,
15820 }
15821 else
15824 /* Any of these indicate either a class-specifier, or an
15825 elaborated-type-specifier. */
15832 /* Parse tentatively so that we can back up if we don't find a
15833 class-specifier. */
15835 /* Look for the class-specifier. */
15838 /* If that worked, we're done. */
15840 {
15845 type_spec,
15846 token,
15849 }
15851 /* Fall through. */
15852 elaborated_type_specifier:
15853 /* We're declaring (not defining) a class or enum. */
15857 /* Fall through. */
15859 /* Look for an elaborated-type-specifier. */
15860 type_spec
15861 = (cp_parser_elaborated_type_specifier
15864 is_declaration));
15867 type_spec,
15868 token,
15891 /* The `__complex__' keyword is a GNU extension. */
15897 }
15899 /* Handle simple keywords. */
15901 {
15903 {
15906 }
15908 }
15910 /* If we do not already have a type-specifier, assume we are looking
15911 at a simple-type-specifier. */
15913 decl_specs,
15914 flags);
15916 /* If we didn't find a type-specifier, and a type-specifier was not
15917 optional in this context, issue an error message. */
15919 {
15922 }
15925 }
15927 /* Parse a simple-type-specifier.
15929 simple-type-specifier:
15930 :: [opt] nested-name-specifier [opt] type-name
15931 :: [opt] nested-name-specifier template template-id
15932 char
15933 wchar_t
15934 bool
15935 short
15936 int
15937 long
15938 signed
15939 unsigned
15940 float
15941 double
15942 void
15944 C++0x Extension:
15946 simple-type-specifier:
15947 auto
15948 decltype ( expression )
15949 char16_t
15950 char32_t
15951 __underlying_type ( type-id )
15953 GNU Extension:
15955 simple-type-specifier:
15956 __int128
15957 __typeof__ unary-expression
15958 __typeof__ ( type-id )
15959 __typeof__ ( type-id ) { initializer-list , [opt] }
15961 Concepts Extension:
15963 simple-type-specifier:
15964 constrained-type-specifier
15966 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15967 appropriately updated. */
15969 static tree
15972 cp_parser_flags flags)
15973 {
15978 /* Peek at the next token. */
15981 /* If we're looking at a keyword, things are easy. */
15983 {
16018 {
16021 }
16050 {
16051 /* The 'auto' might be the placeholder return type for a function decl
16052 with trailing return type. */
16061 {
16063 {
16070 }
16073 {
16076 }
16079 }
16083 {
16086 }
16089 {
16092 }
16093 else
16097 {
16100 "use of %<auto%> in lambda parameter declaration "
16101 "only available with "
16103 }
16106 "use of %<auto%> in parameter declaration "
16107 "only available with "
16111 "ISO C++ forbids use of %<auto%> in parameter "
16113 }
16114 else
16119 /* Since DR 743, decltype can either be a simple-type-specifier by
16120 itself or begin a nested-name-specifier. Parsing it will replace
16121 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16122 handling below decide what to do. */
16128 /* Consume the `typeof' token. */
16130 /* Parse the operand to `typeof'. */
16132 /* If it is not already a TYPE, take its type. */
16138 token,
16147 token,
16157 token,
16162 }
16164 /* If token is an already-parsed decltype not followed by ::,
16165 it's a simple-type-specifier. */
16168 {
16171 {
16173 token,
16175 /* Remember that we are handling a decltype in order to
16176 implement the resolution of DR 1510 when the argument
16177 isn't instantiation dependent. */
16179 }
16182 }
16184 /* If the type-specifier was for a built-in type, we're done. */
16186 {
16187 /* Record the type. */
16194 type,
16195 token,
16200 /* Consume the token. */
16206 /* There is no valid C++ program where a non-template type is
16207 followed by a "<". That usually indicates that the user thought
16208 that the type was a template. */
16213 }
16215 /* The type-specifier must be a user-defined type. */
16217 {
16221 /* Don't gobble tokens or issue error messages if this is an
16222 optional type-specifier. */
16226 /* Look for the optional `::' operator. */
16227 global_p
16231 /* Look for the nested-name specifier. */
16232 qualified_p
16240 /* If we have seen a nested-name-specifier, and the next token
16241 is `template', then we are using the template-id production. */
16244 {
16245 /* Look for the template-id. */
16249 none_type,
16251 /* If the template-id did not name a type, we are out of
16252 luck. */
16254 {
16257 }
16258 }
16259 /* Otherwise, look for a type-name. */
16260 else
16262 /* Keep track of all name-lookups performed in class scopes. */
16264 && !global_p
16265 && !qualified_p
16269 /* If it didn't work out, we don't have a TYPE. */
16275 token,
16277 }
16279 /* If we didn't get a type-name, issue an error message. */
16281 {
16284 }
16287 {
16288 /* See if TYPE is an Objective-C type, and if so, parse and
16289 accept any protocol references following it. Do this before
16290 the cp_parser_check_for_invalid_template_id() call, because
16291 Objective-C types can be followed by '<...>' which would
16292 enclose protocol names rather than template arguments, and so
16293 everything is fine. */
16296 {
16300 /* Clobber the "unqualified" type previously entered into
16301 DECL_SPECS with the new, improved protocol-qualified version. */
16306 }
16308 /* There is no valid C++ program where a non-template type is
16309 followed by a "<". That usually indicates that the user
16310 thought that the type was a template. */
16312 none_type,
16314 }
16317 }
16319 /* Parse a type-name.
16321 type-name:
16322 class-name
16323 enum-name
16324 typedef-name
16325 simple-template-id [in c++0x]
16327 enum-name:
16328 identifier
16330 typedef-name:
16331 identifier
16333 Concepts:
16335 type-name:
16336 concept-name
16337 partial-concept-id
16339 concept-name:
16340 identifier
16342 Returns a TYPE_DECL for the type. */
16344 static tree
16346 {
16348 }
16350 /* See above. */
16351 static tree
16353 {
16354 tree type_decl;
16356 /* We can't know yet whether it is a class-name or not. */
16358 /* Try a class-name. */
16360 typename_keyword_p,
16362 none_type,
16366 /* If it's not a class-name, keep looking. */
16368 {
16370 /* It must be a typedef-name or an enum-name. */
16374 /* It is either a simple-template-id representing an
16375 instantiation of an alias template... */
16379 none_type,
16381 /* Note that this must be an instantiation of an alias template
16382 because [temp.names]/6 says:
16384 A template-id that names an alias template specialization
16385 is a type-name.
16387 Whereas [temp.names]/7 says:
16389 A simple-template-id that names a class template
16390 specialization is a class-name.
16392 With concepts, this could also be a partial-concept-id that
16393 declares a non-type template parameter. */
16400 else
16404 /* ... Or a typedef-name or an enum-name. */
16406 }
16409 }
16411 /* Check if DECL and ARGS can form a constrained-type-specifier.
16412 If ARGS is non-null, we try to form a concept check of the
16413 form DECL<?, ARGS> where ? is a wildcard that matches any
16414 kind of template argument. If ARGS is NULL, then we try to
16415 form a concept check of the form DECL<?>. */
16417 static tree
16420 {
16423 /* If we a constrained-type-specifier cannot be deduced. */
16427 /* A constrained type specifier can only be found in an
16428 overload set or as a reference to a template declaration.
16430 FIXME: This might be masking a bug. It's possible that
16431 that the deduction below is causing template specializations
16432 to be formed with the wildcard as an argument. */
16436 /* Try to build a call expression that evaluates the
16437 concept. This can fail if the overload set refers
16438 only to non-templates. */
16444 /* Deduce the checked constraint and the prototype parameter.
16446 FIXME: In certain cases, failure to deduce should be a
16447 diagnosable error. */
16448 tree conc;
16449 tree proto;
16453 /* In template parameter scope, this results in a constrained
16454 parameter. Return a descriptor of that parm. */
16458 /* In a parameter-declaration-clause, constrained-type
16459 specifiers result in invented template parameters. */
16461 {
16464 }
16465 else
16466 {
16467 /* Otherwise, we're in a context where the constrained
16468 type name is deduced and the constraint applies
16469 after deduction. */
16471 }
16474 }
16476 /* If DECL refers to a concept, return a TYPE_DECL representing
16477 the result of using the constrained type specifier in the
16478 current context. DECL refers to a concept if
16480 - it is an overload set containing a function concept taking a single
16481 type argument, or
16483 - it is a variable concept taking a single type argument. */
16485 static tree
16487 {
16493 else
16495 }
16497 /* Check if DECL and ARGS form a partial-concept-id. If so,
16498 assign ID to the resulting constrained placeholder.
16500 Returns true if the partial-concept-id designates a placeholder
16501 and false otherwise. Note that *id is set to NULL_TREE in
16502 this case. */
16504 static tree
16506 {
16508 }
16510 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16511 or a concept-name.
16513 enum-name:
16514 identifier
16516 typedef-name:
16517 identifier
16519 concept-name:
16520 identifier
16522 Returns a TYPE_DECL for the type. */
16524 static tree
16526 {
16527 tree type_decl;
16528 tree identifier;
16535 /* Look up the type-name. */
16540 /* If we found an overload set, then it may refer to a concept-name. */
16546 {
16547 /* See if this is an Objective-C type. */
16552 }
16554 /* Issue an error if we did not find a type-name. */
16556 /* In Objective-C, we have the complication that class names are
16557 normally type names and start declarations (eg, the
16558 "NSObject" in "NSObject *object;"), but can be used in an
16559 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16560 is an expression. So, a classname followed by a dot is not a
16561 valid type-name. */
16564 {
16569 }
16570 /* Remember that the name was used in the definition of the
16571 current class so that we can check later to see if the
16572 meaning would have been different after the class was
16573 entirely defined. */
16579 }
16581 /* Parse an elaborated-type-specifier. Note that the grammar given
16582 here incorporates the resolution to DR68.
16584 elaborated-type-specifier:
16585 class-key :: [opt] nested-name-specifier [opt] identifier
16586 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16587 enum-key :: [opt] nested-name-specifier [opt] identifier
16588 typename :: [opt] nested-name-specifier identifier
16589 typename :: [opt] nested-name-specifier template [opt]
16590 template-id
16592 GNU extension:
16594 elaborated-type-specifier:
16595 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16596 class-key attributes :: [opt] nested-name-specifier [opt]
16597 template [opt] template-id
16598 enum attributes :: [opt] nested-name-specifier [opt] identifier
16600 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16601 declared `friend'. If IS_DECLARATION is TRUE, then this
16602 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16603 something is being declared.
16605 Returns the TYPE specified. */
16607 static tree
16611 {
16613 tree identifier;
16616 tree globalscope;
16619 /* See if we're looking at the `enum' keyword. */
16621 {
16622 /* Consume the `enum' token. */
16624 /* Remember that it's an enumeration type. */
16626 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16627 enums) is used here. */
16630 {
16634 /* Consume the `struct' or `class' and parse it anyway. */
16636 }
16637 /* Parse the attributes. */
16639 }
16640 /* Or, it might be `typename'. */
16642 RID_TYPENAME))
16643 {
16644 /* Consume the `typename' token. */
16646 /* Remember that it's a `typename' type. */
16648 }
16649 /* Otherwise it must be a class-key. */
16650 else
16651 {
16655 /* Parse the attributes. */
16657 }
16659 /* Look for the `::' operator. */
16662 /* Look for the nested-name-specifier. */
16664 {
16669 is_declaration))
16671 }
16672 else
16673 /* Even though `typename' is not present, the proposed resolution
16674 to Core Issue 180 says that in `class A<T>::B', `B' should be
16675 considered a type-name, even if `A<T>' is dependent. */
16680 is_declaration);
16681 /* For everything but enumeration types, consider a template-id.
16682 For an enumeration type, consider only a plain identifier. */
16684 {
16686 tree decl;
16688 /* Allow the `template' keyword. */
16690 /* If we didn't see `template', we don't know if there's a
16691 template-id or not. */
16694 /* Parse the template-id. */
16698 tag_type,
16699 is_declaration);
16700 /* If we didn't find a template-id, look for an ordinary
16701 identifier. */
16703 ;
16704 /* We can get here when cp_parser_template_id, called by
16705 cp_parser_class_name with tag_type == none_type, succeeds
16706 and caches a BASELINK. Then, when called again here,
16707 instead of failing and returning an error_mark_node
16708 returns it (see template/typename17.C in C++11).
16709 ??? Could we diagnose this earlier? */
16711 {
16714 }
16715 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16716 in effect, then we must assume that, upon instantiation, the
16717 template will correspond to a class. */
16721 typename_type,
16723 /* If the `typename' keyword is in effect and DECL is not a type
16724 decl, then type is non existent. */
16726 ;
16732 }
16735 {
16740 {
16743 }
16745 /* For a `typename', we needn't call xref_tag. */
16751 /* Template parameter lists apply only if we are not within a
16752 function parameter list. */
16753 bool template_parm_lists_apply
16762 /* Look up a qualified name in the usual way. */
16764 {
16765 tree decl;
16766 tree ambiguous_decls;
16769 tag_type,
16776 /* If the lookup was ambiguous, an error will already have been
16777 issued. */
16781 /* If we are parsing friend declaration, DECL may be a
16782 TEMPLATE_DECL tree node here. However, we need to check
16783 whether this TEMPLATE_DECL results in valid code. Consider
16784 the following example:
16786 namespace N {
16787 template <class T> class C {};
16788 }
16789 class X {
16790 template <class T> friend class N::C; // #1, valid code
16791 };
16792 template <class T> class Y {
16793 friend class N::C; // #2, invalid code
16794 };
16796 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16797 name lookup of `N::C'. We see that friend declaration must
16798 be template for the code to be valid. Note that
16799 processing_template_decl does not work here since it is
16800 always 1 for the above two cases. */
16802 decl = (cp_parser_maybe_treat_template_as_class
16807 {
16809 identifier,
16812 }
16815 {
16819 allow_template);
16823 }
16825 /* Forward declarations of nested types, such as
16827 class C1::C2;
16828 class C1::C2::C3;
16830 are invalid unless all components preceding the final '::'
16831 are complete. If all enclosing types are complete, these
16832 declarations become merely pointless.
16834 Invalid forward declarations of nested types are errors
16835 caught elsewhere in parsing. Those that are pointless arrive
16836 here. */
16843 }
16844 else
16845 {
16846 /* An elaborated-type-specifier sometimes introduces a new type and
16847 sometimes names an existing type. Normally, the rule is that it
16848 introduces a new type only if there is not an existing type of
16849 the same name already in scope. For example, given:
16851 struct S {};
16852 void f() { struct S s; }
16854 the `struct S' in the body of `f' is the same `struct S' as in
16855 the global scope; the existing definition is used. However, if
16856 there were no global declaration, this would introduce a new
16857 local class named `S'.
16859 An exception to this rule applies to the following code:
16861 namespace N { struct S; }
16863 Here, the elaborated-type-specifier names a new type
16864 unconditionally; even if there is already an `S' in the
16865 containing scope this declaration names a new type.
16866 This exception only applies if the elaborated-type-specifier
16867 forms the complete declaration:
16869 [class.name]
16871 A declaration consisting solely of `class-key identifier ;' is
16872 either a redeclaration of the name in the current scope or a
16873 forward declaration of the identifier as a class name. It
16874 introduces the name into the current scope.
16876 We are in this situation precisely when the next token is a `;'.
16878 An exception to the exception is that a `friend' declaration does
16879 *not* name a new type; i.e., given:
16881 struct S { friend struct T; };
16883 `T' is not a new type in the scope of `S'.
16885 Also, `new struct S' or `sizeof (struct S)' never results in the
16886 definition of a new type; a new type can only be declared in a
16887 declaration context. */
16889 tag_scope ts;
16893 /* Friends have special name lookup rules. */
16897 CPP_SEMICOLON))
16898 /* This is a `class-key identifier ;' */
16900 else
16903 template_p =
16904 (template_parm_lists_apply
16907 /* An unqualified name was used to reference this type, so
16908 there were no qualifying templates. */
16916 }
16917 }
16922 /* Allow attributes on forward declarations of classes. */
16924 {
16934 else
16937 }
16940 {
16941 /* Indicate whether this class was declared as a `class' or as a
16942 `struct'. */
16946 }
16948 /* A "<" cannot follow an elaborated type specifier. If that
16949 happens, the user was probably trying to form a template-id. */
16954 }
16956 /* Parse an enum-specifier.
16958 enum-specifier:
16959 enum-head { enumerator-list [opt] }
16960 enum-head { enumerator-list , } [C++0x]
16962 enum-head:
16963 enum-key identifier [opt] enum-base [opt]
16964 enum-key nested-name-specifier identifier enum-base [opt]
16966 enum-key:
16967 enum
16968 enum class [C++0x]
16969 enum struct [C++0x]
16971 enum-base: [C++0x]
16972 : type-specifier-seq
16974 opaque-enum-specifier:
16975 enum-key identifier enum-base [opt] ;
16977 GNU Extensions:
16978 enum-key attributes[opt] identifier [opt] enum-base [opt]
16979 { enumerator-list [opt] }attributes[opt]
16980 enum-key attributes[opt] identifier [opt] enum-base [opt]
16981 { enumerator-list, }attributes[opt] [C++0x]
16983 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16984 if the token stream isn't an enum-specifier after all. */
16986 static tree
16988 {
16989 tree identifier;
16991 tree prev_scope;
16993 tree attributes;
17006 /* Parse tentatively so that we can back up if we don't find a
17007 enum-specifier. */
17010 /* Caller guarantees that the current token is 'enum', an identifier
17011 possibly follows, and the token after that is an opening brace.
17012 If we don't have an identifier, fabricate an anonymous name for
17013 the enumeration being defined. */
17016 /* Parse the "class" or "struct", which indicates a scoped
17017 enumeration type in C++0x. */
17020 {
17024 /* Consume the `struct' or `class' token. */
17028 }
17032 /* Clear the qualification. */
17037 /* Figure out in what scope the declaration is being placed. */
17043 nested_name_specifier
17051 {
17052 tree name;
17056 enum_type,
17061 input_location);
17063 {
17066 {
17067 /* Are template enums allowed in ISO? */
17071 /* ignore a typename reference, for it will be solved by name
17072 in start_enum. */
17074 }
17075 }
17078 else
17079 {
17084 }
17085 }
17086 else
17087 {
17090 else
17091 {
17097 }
17098 }
17101 /* Check for the `:' that denotes a specified underlying type in C++0x.
17102 Note that a ':' could also indicate a bitfield width, however. */
17104 {
17105 cp_decl_specifier_seq type_specifiers;
17107 /* Consume the `:'. */
17110 /* Parse the type-specifier-seq. */
17115 /* At this point this is surely not elaborated type specifier. */
17124 /* If that didn't work, stop. */
17126 {
17132 }
17133 }
17135 /* Look for the `{' but don't consume it yet. */
17137 {
17139 {
17142 {
17145 }
17146 }
17147 /* An opaque-enum-specifier must have a ';' here. */
17150 {
17153 {
17156 }
17157 }
17158 }
17164 {
17166 {
17170 }
17172 {
17174 }
17175 }
17177 /* Issue an error message if type-definitions are forbidden here. */
17180 else
17181 /* Create the new type. We do this before consuming the opening
17182 brace so the enum will be recorded as being on the line of its
17183 tag (or the 'enum' keyword, if there is no tag). */
17187 /* If the next token is not '{' it is an opaque-enum-specifier or an
17188 elaborated-type-specifier. */
17190 {
17194 {
17195 /* The following catches invalid code such as:
17196 enum class S<int>::E { A, B, C }; */
17204 {
17208 nested_name_specifier);
17210 }
17213 {
17215 "%qT for enum declaration does not name a class "
17218 }
17219 /* If that scope does not contain the scope in which the
17220 class was originally declared, the program is invalid. */
17222 nested_name_specifier))
17223 {
17226 "declaration of %qD in namespace %qD which does not "
17229 else
17231 "declaration of %qD in %qD which does not "
17235 }
17236 /* If that scope is the scope where the declaration is being placed
17237 the program is invalid. */
17241 {
17245 }
17246 }
17251 /* Consume the opening brace. */
17258 {
17262 }
17263 else
17264 {
17270 }
17274 /* If the next token is not '}', then there are some enumerators. */
17276 {
17280 }
17281 else
17284 /* Consume the final '}'. */
17290 }
17291 else
17292 {
17293 /* If a ';' follows, then it is an opaque-enum-specifier
17294 and additional restrictions apply. */
17296 {
17303 }
17304 }
17306 /* Look for trailing attributes to apply to this enumeration, and
17307 apply them if appropriate. */
17309 {
17312 trailing_attr,
17314 }
17316 /* Finish up the enumeration. */
17318 {
17323 }
17326 {
17328 {
17331 }
17333 {
17335 }
17336 }
17337 out:
17340 }
17342 /* Parse an enumerator-list. The enumerators all have the indicated
17343 TYPE.
17345 enumerator-list:
17346 enumerator-definition
17347 enumerator-list , enumerator-definition */
17349 static void
17351 {
17353 {
17354 /* Parse an enumerator-definition. */
17357 /* If the next token is not a ',', we've reached the end of
17358 the list. */
17361 /* Otherwise, consume the `,' and keep going. */
17363 /* If the next token is a `}', there is a trailing comma. */
17365 {
17370 }
17371 }
17372 }
17374 /* Parse an enumerator-definition. The enumerator has the indicated
17375 TYPE.
17377 enumerator-definition:
17378 enumerator
17379 enumerator = constant-expression
17381 enumerator:
17382 identifier
17384 GNU Extensions:
17386 enumerator-definition:
17387 enumerator attributes [opt]
17388 enumerator attributes [opt] = constant-expression */
17390 static void
17392 {
17393 tree identifier;
17394 tree value;
17395 location_t loc;
17397 /* Save the input location because we are interested in the location
17398 of the identifier and not the location of the explicit value. */
17401 /* Look for the identifier. */
17406 /* Parse any specified attributes. */
17409 /* If the next token is an '=', then there is an explicit value. */
17411 {
17412 /* Consume the `=' token. */
17414 /* Parse the value. */
17416 }
17417 else
17420 /* If we are processing a template, make sure the initializer of the
17421 enumerator doesn't contain any bare template parameter pack. */
17425 /* Create the enumerator. */
17427 }
17429 /* Parse a namespace-name.
17431 namespace-name:
17432 original-namespace-name
17433 namespace-alias
17435 Returns the NAMESPACE_DECL for the namespace. */
17437 static tree
17439 {
17440 tree identifier;
17441 tree namespace_decl;
17445 /* Get the name of the namespace. */
17450 /* Look up the identifier in the currently active scope. Look only
17451 for namespaces, due to:
17453 [basic.lookup.udir]
17455 When looking up a namespace-name in a using-directive or alias
17456 definition, only namespace names are considered.
17458 And:
17460 [basic.lookup.qual]
17462 During the lookup of a name preceding the :: scope resolution
17463 operator, object, function, and enumerator names are ignored.
17465 (Note that cp_parser_qualifying_entity only calls this
17466 function if the token after the name is the scope resolution
17467 operator.) */
17469 none_type,
17475 /* If it's not a namespace, issue an error. */
17478 {
17483 }
17486 }
17488 /* Parse a namespace-definition.
17490 namespace-definition:
17491 named-namespace-definition
17492 unnamed-namespace-definition
17494 named-namespace-definition:
17495 original-namespace-definition
17496 extension-namespace-definition
17498 original-namespace-definition:
17499 namespace identifier { namespace-body }
17501 extension-namespace-definition:
17502 namespace original-namespace-name { namespace-body }
17504 unnamed-namespace-definition:
17505 namespace { namespace-body } */
17507 static void
17509 {
17519 {
17523 }
17524 else
17527 /* Look for the `namespace' keyword. */
17530 /* Parse any specified attributes before the identifier. */
17533 /* Get the name of the namespace. We do not attempt to distinguish
17534 between an original-namespace-definition and an
17535 extension-namespace-definition at this point. The semantic
17536 analysis routines are responsible for that. */
17539 else
17542 /* Parse any specified attributes after the identifier. */
17545 {
17548 else
17550 }
17552 /* Start the namespace. */
17555 /* Parse any nested namespace definition. */
17557 {
17562 "nested namespace definitions only available with "
17567 {
17571 else
17572 {
17575 }
17578 }
17579 }
17581 /* Look for the `{' to validate starting the namespace. */
17584 /* "inline namespace" is equivalent to a stub namespace definition
17585 followed by a strong using directive. */
17587 {
17589 /* Set up namespace association. */
17593 /* Import the contents of the inline namespace. */
17597 }
17603 /* Parse the body of the namespace. */
17609 /* Finish the nested namespace definitions. */
17613 /* 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 }
20805 }
20807 /* Parse an initializer-clause.
20809 initializer-clause:
20810 assignment-expression
20811 braced-init-list
20813 Returns an expression representing the initializer.
20815 If the `assignment-expression' production is used the value
20816 returned is simply a representation for the expression.
20818 Otherwise, calls cp_parser_braced_list. */
20820 static cp_expr
20822 {
20823 cp_expr initializer;
20825 /* Assume the expression is constant. */
20828 /* If it is not a `{', then we are looking at an
20829 assignment-expression. */
20831 {
20832 initializer
20835 non_constant_p);
20836 }
20837 else
20841 }
20843 /* Parse a brace-enclosed initializer list.
20845 braced-init-list:
20846 { initializer-list , [opt] }
20847 { }
20849 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20850 the elements of the initializer-list (or NULL, if the last
20851 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20852 NULL_TREE. There is no way to detect whether or not the optional
20853 trailing `,' was provided. NON_CONSTANT_P is as for
20854 cp_parser_initializer. */
20856 static cp_expr
20858 {
20859 tree initializer;
20862 /* Consume the `{' token. */
20864 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20866 /* If it's not a `}', then there is a non-trivial initializer. */
20868 {
20869 /* Parse the initializer list. */
20872 /* A trailing `,' token is allowed. */
20875 }
20876 else
20878 /* Now, there should be a trailing `}'. */
20884 /* Build a location of the form:
20885 { ... }
20886 ^~~~~~~
20887 with caret==start at the open brace, finish at the close brace. */
20891 }
20893 /* Consume tokens up to, and including, the next non-nested closing `]'.
20894 Returns true iff we found a closing `]'. */
20896 static bool
20898 {
20902 {
20906 {
20909 /* If we've run out of tokens, then there is no closing `]'. */
20918 {
20921 }
20926 }
20928 /* Consume the token. */
20930 }
20931 }
20933 /* Return true if we are looking at an array-designator, false otherwise. */
20935 static bool
20937 {
20938 /* Consume the `['. */
20943 /* Skip tokens until the next token is a closing square bracket.
20944 If we find the closing `]', and the next token is a `=', then
20945 we are looking at an array designator. */
20946 bool array_designator_p
20950 /* Roll back the tokens we skipped. */
20954 }
20956 /* Parse an initializer-list.
20958 initializer-list:
20959 initializer-clause ... [opt]
20960 initializer-list , initializer-clause ... [opt]
20962 GNU Extension:
20964 initializer-list:
20965 designation initializer-clause ...[opt]
20966 initializer-list , designation initializer-clause ...[opt]
20968 designation:
20969 . identifier =
20970 identifier :
20971 [ constant-expression ] =
20973 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20974 for the initializer. If the INDEX of the elt is non-NULL, it is the
20975 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20976 as for cp_parser_initializer. */
20980 {
20983 /* Assume all of the expressions are constant. */
20986 /* Parse the rest of the list. */
20988 {
20990 tree designator;
20991 tree initializer;
20994 /* If the next token is an identifier and the following one is a
20995 colon, we are looking at the GNU designated-initializer
20996 syntax. */
21000 {
21001 /* Warn the user that they are using an extension. */
21004 /* Consume the identifier. */
21006 /* Consume the `:'. */
21008 }
21009 /* Also handle the C99 syntax, '. id ='. */
21014 {
21015 /* Warn the user that they are using an extension. */
21018 /* Consume the `.'. */
21020 /* Consume the identifier. */
21022 /* Consume the `='. */
21024 }
21025 /* Also handle C99 array designators, '[ const ] ='. */
21029 {
21030 /* In C++11, [ could start a lambda-introducer. */
21036 {
21039 }
21040 else
21041 {
21046 }
21052 }
21053 else
21056 /* Parse the initializer. */
21059 /* If any clause is non-constant, so is the entire initializer. */
21063 /* If we have an ellipsis, this is an initializer pack
21064 expansion. */
21066 {
21067 /* Consume the `...'. */
21070 /* Turn the initializer into an initializer expansion. */
21072 }
21074 /* Add it to the vector. */
21077 /* If the next token is not a comma, we have reached the end of
21078 the list. */
21082 /* Peek at the next token. */
21084 /* If the next token is a `}', then we're still done. An
21085 initializer-clause can have a trailing `,' after the
21086 initializer-list and before the closing `}'. */
21090 /* Consume the `,' token. */
21092 }
21095 }
21097 /* Classes [gram.class] */
21099 /* Parse a class-name.
21101 class-name:
21102 identifier
21103 template-id
21105 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21106 to indicate that names looked up in dependent types should be
21107 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21108 keyword has been used to indicate that the name that appears next
21109 is a template. TAG_TYPE indicates the explicit tag given before
21110 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21111 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21112 is the class being defined in a class-head. If ENUM_OK is TRUE,
21113 enum-names are also accepted.
21115 Returns the TYPE_DECL representing the class. */
21117 static tree
21126 {
21127 tree decl;
21128 tree scope;
21133 /* All class-names start with an identifier. */
21136 {
21139 }
21141 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21142 to a template-id, so we save it here. */
21147 /* Any name names a type if we're following the `typename' keyword
21148 in a qualified name where the enclosing scope is type-dependent. */
21151 /* Handle the common case (an identifier, but not a template-id)
21152 efficiently. */
21155 {
21159 /* Look for the identifier. */
21163 /* If the next token isn't an identifier, we are certainly not
21164 looking at a class-name. */
21167 /* If we know this is a type-name, there's no need to look it
21168 up. */
21171 else
21172 {
21173 tree ambiguous_decls;
21174 /* If we already know that this lookup is ambiguous, then
21175 we've already issued an error message; there's no reason
21176 to check again. */
21178 {
21181 }
21182 /* If the next token is a `::', then the name must be a type
21183 name.
21185 [basic.lookup.qual]
21187 During the lookup for a name preceding the :: scope
21188 resolution operator, object, function, and enumerator
21189 names are ignored. */
21192 /* Look up the name. */
21194 tag_type,
21197 check_dependency_p,
21201 {
21205 }
21206 }
21207 }
21208 else
21209 {
21210 /* Try a template-id. */
21212 check_dependency_p,
21213 tag_type,
21214 is_declaration);
21217 }
21221 /* If this is a typename, create a TYPENAME_TYPE. */
21223 {
21228 }
21232 /* Check to see that it is really the name of a class. */
21236 /* Situations like this:
21238 template <typename T> struct A {
21239 typename T::template X<int>::I i;
21240 };
21242 are problematic. Is `T::template X<int>' a class-name? The
21243 standard does not seem to be definitive, but there is no other
21244 valid interpretation of the following `::'. Therefore, those
21245 names are considered class-names. */
21246 {
21250 }
21255 /* In Objective-C 2.0, a classname followed by '.' starts a
21256 dot-syntax expression, and it's not a type-name. */
21268 }
21270 /* Parse a class-specifier.
21272 class-specifier:
21273 class-head { member-specification [opt] }
21275 Returns the TREE_TYPE representing the class. */
21277 static tree
21279 {
21280 tree type;
21294 /* Parse the class-head. */
21297 /* If the class-head was a semantic disaster, skip the entire body
21298 of the class. */
21300 {
21304 }
21306 /* Look for the `{'. */
21308 {
21311 }
21316 /* Issue an error message if type-definitions are forbidden here. */
21318 /* Remember that we are defining one more class. */
21320 /* Inside the class, surrounding template-parameter-lists do not
21321 apply. */
21322 saved_num_template_parameter_lists
21325 /* We are not in a function body. */
21328 /* Or in a loop. */
21331 /* Or in a switch. */
21334 /* We are not immediately inside an extern "lang" block. */
21335 saved_in_unbraced_linkage_specification_p
21339 // Associate constraints with the type.
21343 /* Start the class. */
21345 {
21348 }
21352 /* If the type is erroneous, skip the entire body of the class. */
21354 else
21355 /* Parse the member-specification. */
21358 /* Look for the trailing `}'. */
21360 /* Look for trailing attributes to apply to this class. */
21368 /* We've finished a type definition. Check for the common syntax
21369 error of forgetting a semicolon after the definition. We need to
21370 be careful, as we can't just check for not-a-semicolon and be done
21371 with it; the user might have typed:
21373 class X { } c = ...;
21374 class X { } *p = ...;
21376 and so forth. Instead, enumerate all the possible tokens that
21377 might follow this production; if we don't see one of them, then
21378 complain and silently insert the semicolon. */
21379 {
21384 /* Don't try to parse c++11 attributes here. As per the
21385 grammar, that should be a task for
21386 cp_parser_decl_specifier_seq. */
21390 {
21401 /* While it's legal for type qualifiers and storage class
21402 specifiers to follow type definitions in the grammar, only
21403 compiler testsuites contain code like that. Assume that if
21404 we see such code, then what we're really seeing is a case
21405 like:
21407 class X { }
21408 const <type> var = ...;
21410 or
21412 class Y { }
21413 static <type> func (...) ...
21415 i.e. the qualifier or specifier applies to the next
21416 declaration. To do so, however, we need to look ahead one
21417 more token to see if *that* token is a type specifier.
21419 This code could be improved to handle:
21421 class Z { }
21422 static const <type> var = ...; */
21425 {
21428 /* Handling user-defined types here would be nice, but very
21429 tricky. */
21430 want_semicolon
21433 }
21437 }
21439 /* If we don't have a type, then something is very wrong and we
21440 shouldn't try to do anything clever. Likewise for not seeing the
21441 closing brace. */
21443 {
21444 cp_token_position prev
21455 else
21458 /* Unget one token and smash it to look as though we encountered
21459 a semicolon in the input stream. */
21464 }
21465 }
21467 /* If this class is not itself within the scope of another class,
21468 then we need to parse the bodies of all of the queued function
21469 definitions. Note that the queued functions defined in a class
21470 are not always processed immediately following the
21471 class-specifier for that class. Consider:
21473 struct A {
21474 struct B { void f() { sizeof (A); } };
21475 };
21477 If `f' were processed before the processing of `A' were
21478 completed, there would be no way to compute the size of `A'.
21479 Note that the nesting we are interested in here is lexical --
21480 not the semantic nesting given by TYPE_CONTEXT. In particular,
21481 for:
21483 struct A { struct B; };
21484 struct A::B { void f() { } };
21486 there is no need to delay the parsing of `A::B::f'. */
21488 {
21489 tree decl;
21496 /* In a first pass, parse default arguments to the functions.
21497 Then, in a second pass, parse the bodies of the functions.
21498 This two-phased approach handles cases like:
21500 struct S {
21501 void f() { g(); }
21502 void g(int i = 3);
21503 };
21505 */
21507 {
21509 /* If there are default arguments that have not yet been processed,
21510 take care of them now. */
21512 {
21517 }
21518 /* Make sure that any template parameters are in scope. */
21520 /* Parse the default argument expressions. */
21522 /* Remove any template parameters from the symbol table. */
21524 }
21526 /* Now parse any NSDMIs. */
21530 {
21532 {
21537 }
21540 }
21547 /* Now do some post-NSDMI bookkeeping. */
21553 /* Now parse the body of the functions. */
21555 {
21556 /* OpenMP UDRs need to be parsed before all other functions. */
21563 }
21564 else
21568 }
21569 else
21572 /* Put back any saved access checks. */
21575 /* Restore saved state. */
21579 parser->num_template_parameter_lists
21581 parser->in_unbraced_linkage_specification_p
21585 }
21587 static tree
21589 {
21590 tree ret;
21595 }
21597 /* Parse a class-head.
21599 class-head:
21600 class-key identifier [opt] base-clause [opt]
21601 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21602 class-key nested-name-specifier [opt] template-id
21603 base-clause [opt]
21605 class-virt-specifier:
21606 final
21608 GNU Extensions:
21609 class-key attributes identifier [opt] base-clause [opt]
21610 class-key attributes nested-name-specifier identifier base-clause [opt]
21611 class-key attributes nested-name-specifier [opt] template-id
21612 base-clause [opt]
21614 Upon return BASES is initialized to the list of base classes (or
21615 NULL, if there are none) in the same form returned by
21616 cp_parser_base_clause.
21618 Returns the TYPE of the indicated class. Sets
21619 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21620 involving a nested-name-specifier was used, and FALSE otherwise.
21622 Returns error_mark_node if this is not a class-head.
21624 Returns NULL_TREE if the class-head is syntactically valid, but
21625 semantically invalid in a way that means we should skip the entire
21626 body of the class. */
21628 static tree
21631 {
21632 tree nested_name_specifier;
21636 tree attributes;
21637 tree bases;
21647 /* Assume no nested-name-specifier will be present. */
21649 /* Assume no template parameter lists will be used in defining the
21650 type. */
21654 /* Look for the class-key. */
21661 /* Parse the attributes. */
21664 /* If the next token is `::', that is invalid -- but sometimes
21665 people do try to write:
21667 struct ::S {};
21669 Handle this gracefully by accepting the extra qualifier, and then
21670 issuing an error about it later if this really is a
21671 class-head. If it turns out just to be an elaborated type
21672 specifier, remain silent. */
21678 /* Determine the name of the class. Begin by looking for an
21679 optional nested-name-specifier. */
21681 nested_name_specifier
21687 /* If there was a nested-name-specifier, then there *must* be an
21688 identifier. */
21690 {
21692 /* Although the grammar says `identifier', it really means
21693 `class-name' or `template-name'. You are only allowed to
21694 define a class that has already been declared with this
21695 syntax.
21697 The proposed resolution for Core Issue 180 says that wherever
21698 you see `class T::X' you should treat `X' as a type-name.
21700 It is OK to define an inaccessible class; for example:
21702 class A { class B; };
21703 class A::B {};
21705 We do not know if we will see a class-name, or a
21706 template-name. We look for a class-name first, in case the
21707 class-name is a template-id; if we looked for the
21708 template-name first we would stop after the template-name. */
21713 class_type,
21717 /* If that didn't work, ignore the nested-name-specifier. */
21719 {
21725 }
21726 /* If we could not find a corresponding TYPE, treat this
21727 declaration like an unqualified declaration. */
21730 /* Otherwise, count the number of templates used in TYPE and its
21731 containing scopes. */
21732 else
21733 {
21734 tree scope;
21746 }
21747 }
21748 /* Otherwise, the identifier is optional. */
21749 else
21750 {
21751 /* We don't know whether what comes next is a template-id,
21752 an identifier, or nothing at all. */
21754 /* Check for a template-id. */
21759 class_key,
21761 /* If that didn't work, it could still be an identifier. */
21763 {
21765 {
21768 }
21769 else
21771 }
21772 else
21773 {
21776 }
21777 }
21782 {
21784 class_key,
21786 }
21789 /* If it's not a `:' or a `{' then we can't really be looking at a
21790 class-head, since a class-head only appears as part of a
21791 class-specifier. We have to detect this situation before calling
21792 xref_tag, since that has irreversible side-effects. */
21794 {
21798 }
21800 /* At this point, we're going ahead with the class-specifier, even
21801 if some other problem occurs. */
21804 {
21809 }
21810 /* Issue the error about the overly-qualified name now. */
21812 {
21817 }
21819 {
21824 }
21826 {
21827 tree scope;
21829 /* Reject typedef-names in class heads. */
21831 {
21834 type);
21837 }
21839 /* Figure out in what scope the declaration is being placed. */
21841 /* If that scope does not contain the scope in which the
21842 class was originally declared, the program is invalid. */
21844 {
21847 "declaration of %qD in namespace %qD which does not "
21850 else
21856 }
21857 /* [dcl.meaning]
21859 A declarator-id shall not be qualified except for the
21860 definition of a ... nested class outside of its class
21861 ... [or] the definition or explicit instantiation of a
21862 class member of a namespace outside of its namespace. */
21864 {
21869 }
21870 }
21871 /* An explicit-specialization must be preceded by "template <>". If
21872 it is not, try to recover gracefully. */
21876 {
21877 /* Build a location of this form:
21878 struct typename <ARGS>
21879 ^~~~~~~~~~~~~~~~~~~~~~
21880 with caret==start at the start token, and
21881 finishing at the end of the type. */
21882 location_t reported_loc
21884 class_head_start_location,
21888 error_at_rich_loc
21892 /* Take the same action that would have been taken by
21893 cp_parser_explicit_specialization. */
21896 }
21897 /* There must be no "return" statements between this point and the
21898 end of this function; set "type "to the correct return value and
21899 use "goto done;" to return. */
21900 /* Make sure that the right number of template parameters were
21901 present. */
21905 {
21906 /* If something went wrong, there is no point in even trying to
21907 process the class-definition. */
21910 }
21912 /* Look up the type. */
21914 {
21918 {
21922 }
21923 else
21924 {
21927 }
21930 }
21932 {
21933 tree class_type;
21935 /* Given:
21937 template <typename T> struct S { struct T };
21938 template <typename T> struct S<T>::T { };
21940 we will get a TYPENAME_TYPE when processing the definition of
21941 `S::T'. We need to resolve it to the actual type before we
21942 try to define it. */
21944 {
21949 else
21950 {
21953 }
21954 }
21958 {
21961 }
21964 /* Enter the scope indicated by the nested-name-specifier. */
21966 /* Get the canonical version of this type. */
21968 /* Call push_template_decl if it seems like we should be defining a
21969 template either from the template headers or the type we're
21970 defining, so that we diagnose both extra and missing headers. */
21974 {
21977 {
21980 }
21981 }
21985 }
21987 {
21988 /* If the class was unnamed, create a dummy name. */
21993 }
21995 /* Indicate whether this class was declared as a `class' or as a
21996 `struct'. */
22001 /* If this type was already complete, and we see another definition,
22002 that's an error. */
22004 {
22006 type);
22008 type);
22011 }
22016 {
22017 /* Apply attributes now, before any use of the class as a template
22018 argument in its base list. */
22021 }
22023 /* We will have entered the scope containing the class; the names of
22024 base classes should be looked up in that context. For example:
22026 struct A { struct B {}; struct C; };
22027 struct A::C : B {};
22029 is valid. */
22031 /* Get the list of base-classes, if there is one. */
22033 {
22034 /* PR59482: enter the class scope so that base-specifiers are looked
22035 up correctly. */
22039 /* PR59482: get out of the previously pushed class scope so that the
22040 subsequent pops pop the right thing. */
22043 }
22044 else
22047 /* If we're really defining a class, process the base classes.
22048 If they're invalid, fail. */
22053 done:
22054 /* Leave the scope given by the nested-name-specifier. We will
22055 enter the class scope itself while processing the members. */
22060 {
22063 }
22069 out:
22072 }
22074 /* Parse a class-key.
22076 class-key:
22077 class
22078 struct
22079 union
22081 Returns the kind of class-key specified, or none_type to indicate
22082 error. */
22084 static enum tag_types
22086 {
22090 /* Look for the class-key. */
22095 /* Check to see if the TOKEN is a class-key. */
22100 }
22102 /* Parse a type-parameter-key.
22104 type-parameter-key:
22105 class
22106 typename
22107 */
22109 static void
22111 {
22112 /* Look for the type-parameter-key. */
22116 {
22119 /* typename is not allowed in a template template parameter
22120 by the standard until C++1Z. */
22122 "ISO C++ forbids typename key in template template parameter;"
22124 }
22125 else
22129 }
22131 /* Parse an (optional) member-specification.
22133 member-specification:
22134 member-declaration member-specification [opt]
22135 access-specifier : member-specification [opt] */
22137 static void
22139 {
22141 {
22145 /* Peek at the next token. */
22147 /* If it's a `}', or EOF then we've seen all the members. */
22153 /* See if this token is a keyword. */
22156 {
22160 /* Consume the access-specifier. */
22162 /* Remember which access-specifier is active. */
22164 /* Look for the `:'. */
22169 /* Accept #pragmas at class scope. */
22171 {
22174 }
22176 /* Otherwise, the next construction must be a
22177 member-declaration. */
22179 }
22180 }
22181 }
22183 /* Parse a member-declaration.
22185 member-declaration:
22186 decl-specifier-seq [opt] member-declarator-list [opt] ;
22187 function-definition ; [opt]
22188 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22189 using-declaration
22190 template-declaration
22191 alias-declaration
22193 member-declarator-list:
22194 member-declarator
22195 member-declarator-list , member-declarator
22197 member-declarator:
22198 declarator pure-specifier [opt]
22199 declarator constant-initializer [opt]
22200 identifier [opt] : constant-expression
22202 GNU Extensions:
22204 member-declaration:
22205 __extension__ member-declaration
22207 member-declarator:
22208 declarator attributes [opt] pure-specifier [opt]
22209 declarator attributes [opt] constant-initializer [opt]
22210 identifier [opt] attributes [opt] : constant-expression
22212 C++0x Extensions:
22214 member-declaration:
22215 static_assert-declaration */
22217 static void
22219 {
22220 cp_decl_specifier_seq decl_specifiers;
22221 tree prefix_attributes;
22222 tree decl;
22231 /* Check for the `__extension__' keyword. */
22233 {
22234 /* Recurse. */
22236 /* Restore the old value of the PEDANTIC flag. */
22240 }
22242 /* Check for a template-declaration. */
22244 {
22245 /* An explicit specialization here is an error condition, and we
22246 expect the specialization handler to detect and report this. */
22250 else
22254 }
22255 /* Check for a template introduction. */
22259 /* Check for a using-declaration. */
22261 {
22263 {
22264 /* Parse the using-declaration. */
22268 }
22269 else
22270 {
22271 tree decl;
22275 /* Note that if we actually see the '=' token after the
22276 identifier, cp_parser_alias_declaration commits the
22277 tentative parse. In that case, we really expect an
22278 alias-declaration. Otherwise, we expect a using
22279 declaration. */
22280 alias_decl_expected =
22286 else
22290 }
22291 }
22293 /* Check for @defs. */
22295 {
22300 {
22305 }
22307 }
22309 /* If the next token is `static_assert' we have a static assertion. */
22311 {
22314 }
22321 /* Parse the decl-specifier-seq. */
22324 CP_PARSER_FLAGS_OPTIONAL,
22327 /* Check for an invalid type-name. */
22331 /* If there is no declarator, then the decl-specifier-seq should
22332 specify a type. */
22334 {
22335 /* If there was no decl-specifier-seq, and the next token is a
22336 `;', then we have something like:
22338 struct S { ; };
22340 [class.mem]
22342 Each member-declaration shall declare at least one member
22343 name of the class. */
22345 {
22349 }
22350 else
22351 {
22352 tree type;
22354 /* See if this declaration is a friend. */
22356 /* If there were decl-specifiers, check to see if there was
22357 a class-declaration. */
22360 /* Nested classes have already been added to the class, but
22361 a `friend' needs to be explicitly registered. */
22363 {
22364 /* If the `friend' keyword was present, the friend must
22365 be introduced with a class-key. */
22368 "in C++03 a class-key must be used "
22370 /* In this case:
22372 template <typename T> struct A {
22373 friend struct A<T>::B;
22374 };
22376 A<T>::B will be represented by a TYPENAME_TYPE, and
22377 therefore not recognized by check_tag_decl. */
22379 {
22383 }
22386 "friend declaration does not name a class or "
22388 else
22391 }
22392 /* If there is no TYPE, an error message will already have
22393 been issued. */
22395 ;
22396 /* An anonymous aggregate has to be handled specially; such
22397 a declaration really declares a data member (with a
22398 particular type), as opposed to a nested class. */
22400 {
22401 /* C++11 9.5/6. */
22404 "a storage class on an anonymous aggregate "
22407 /* Remove constructors and such from TYPE, now that we
22408 know it is an anonymous aggregate. */
22410 /* And make the corresponding data member. */
22413 /* Add it to the class. */
22415 }
22416 else
22417 cp_parser_check_access_in_redeclaration
22420 }
22421 }
22422 else
22423 {
22426 /* Clear attributes from the decl_specifiers but keep them
22427 around as prefix attributes that apply them to the entity
22428 being declared. */
22432 /* See if these declarations will be friends. */
22435 /* Keep going until we hit the `;' at the end of the
22436 declaration. */
22438 {
22440 tree first_attribute;
22442 /* Peek at the next token. */
22445 /* Check for a bitfield declaration. */
22450 {
22451 tree identifier;
22452 tree width;
22454 /* Get the name of the bitfield. Note that we cannot just
22455 check TOKEN here because it may have been invalidated by
22456 the call to cp_lexer_peek_nth_token above. */
22459 else
22462 /* Consume the `:' token. */
22464 /* Get the width of the bitfield. */
22465 width
22468 /* Look for attributes that apply to the bitfield. */
22470 /* Remember which attributes are prefix attributes and
22471 which are not. */
22473 /* Combine the attributes. */
22476 /* Create the bitfield declaration. */
22479 identifier,
22480 sfk_none)
22483 width,
22484 attributes);
22485 }
22486 else
22487 {
22489 tree initializer;
22490 tree asm_specification;
22493 /* Parse the declarator. */
22494 declarator
22499 friend_p);
22501 /* If something went wrong parsing the declarator, make sure
22502 that we at least consume some tokens. */
22504 {
22505 /* Skip to the end of the statement. */
22507 /* If the next token is not a semicolon, that is
22508 probably because we just skipped over the body of
22509 a function. So, we consume a semicolon if
22510 present, but do not issue an error message if it
22511 is not present. */
22513 CPP_SEMICOLON))
22516 }
22519 cp_parser_check_for_definition_in_return_type
22523 /* Look for an asm-specification. */
22525 /* Look for attributes that apply to the declaration. */
22527 /* Remember which attributes are prefix attributes and
22528 which are not. */
22530 /* Combine the attributes. */
22533 /* If it's an `=', then we have a constant-initializer or a
22534 pure-specifier. It is not correct to parse the
22535 initializer before registering the member declaration
22536 since the member declaration should be in scope while
22537 its initializer is processed. However, the rest of the
22538 front end does not yet provide an interface that allows
22539 us to handle this correctly. */
22541 {
22542 /* In [class.mem]:
22544 A pure-specifier shall be used only in the declaration of
22545 a virtual function.
22547 A member-declarator can contain a constant-initializer
22548 only if it declares a static member of integral or
22549 enumeration type.
22551 Therefore, if the DECLARATOR is for a function, we look
22552 for a pure-specifier; otherwise, we look for a
22553 constant-initializer. When we call `grokfield', it will
22554 perform more stringent semantics checks. */
22566 {
22568 /* Don't require a constant rvalue in C++11, since we
22569 might want a reference constant. We'll enforce
22570 constancy later. */
22572 /* Parse the initializer. */
22575 }
22576 else
22577 /* Parse the initializer. */
22579 }
22582 {
22586 else
22588 }
22589 /* Otherwise, there is no initializer. */
22590 else
22593 /* See if we are probably looking at a function
22594 definition. We are certainly not looking at a
22595 member-declarator. Calling `grokfield' has
22596 side-effects, so we must not do it unless we are sure
22597 that we are looking at a member-declarator. */
22600 {
22601 /* The grammar does not allow a pure-specifier to be
22602 used when a member function is defined. (It is
22603 possible that this fact is an oversight in the
22604 standard, since a pure function may be defined
22605 outside of the class-specifier. */
22611 declarator,
22612 attributes);
22615 /* If the member was not a friend, declare it here. */
22618 /* Peek at the next token. */
22620 /* If the next token is a semicolon, consume it. */
22624 }
22625 else
22628 /* Create the declaration. */
22633 {
22636 else
22638 }
22639 }
22644 /* Reset PREFIX_ATTRIBUTES. */
22650 /* If there is any qualification still in effect, clear it
22651 now; we will be starting fresh with the next declarator. */
22655 /* If it's a `,', then there are more declarators. */
22657 {
22660 {
22664 }
22665 }
22666 /* If the next token isn't a `;', then we have a parse error. */
22668 CPP_SEMICOLON))
22669 {
22670 /* The next token might be a ways away from where the
22671 actual semicolon is missing. Find the previous token
22672 and use that for our error position. */
22677 /* Assume that the user meant to provide a semicolon. If
22678 we were to cp_parser_skip_to_end_of_statement, we might
22679 skip to a semicolon inside a member function definition
22680 and issue nonsensical error messages. */
22682 }
22685 {
22686 /* Add DECL to the list of members. */
22688 /* Explicitly include, eg, NSDMIs, for better error
22689 recovery (c++/58650). */
22698 /* Add DECL to the queue of NSDMI to be parsed later. */
22700 }
22704 }
22705 }
22708 out:
22710 }
22712 /* Parse a pure-specifier.
22714 pure-specifier:
22715 = 0
22717 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22718 Otherwise, ERROR_MARK_NODE is returned. */
22720 static tree
22722 {
22725 /* Look for the `=' token. */
22728 /* Look for the `0' token. */
22737 /* Accept = default or = delete in c++0x mode. */
22740 {
22743 }
22745 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22747 {
22752 }
22754 {
22757 }
22760 }
22762 /* Parse a constant-initializer.
22764 constant-initializer:
22765 = constant-expression
22767 Returns a representation of the constant-expression. */
22769 static tree
22771 {
22772 /* Look for the `=' token. */
22776 /* It is invalid to write:
22778 struct S { static const int i = { 7 }; };
22780 */
22782 {
22785 /* Consume the opening brace. */
22787 /* Skip the initializer. */
22789 /* Look for the trailing `}'. */
22793 }
22796 }
22798 /* Derived classes [gram.class.derived] */
22800 /* Parse a base-clause.
22802 base-clause:
22803 : base-specifier-list
22805 base-specifier-list:
22806 base-specifier ... [opt]
22807 base-specifier-list , base-specifier ... [opt]
22809 Returns a TREE_LIST representing the base-classes, in the order in
22810 which they were declared. The representation of each node is as
22811 described by cp_parser_base_specifier.
22813 In the case that no bases are specified, this function will return
22814 NULL_TREE, not ERROR_MARK_NODE. */
22816 static tree
22818 {
22821 /* Look for the `:' that begins the list. */
22824 /* Scan the base-specifier-list. */
22826 {
22828 tree base;
22831 /* Look for the base-specifier. */
22833 /* Look for the (optional) ellipsis. */
22835 {
22836 /* Consume the `...'. */
22840 }
22842 /* Add BASE to the front of the list. */
22844 {
22846 /* Make this a pack expansion type. */
22850 {
22853 }
22854 }
22855 /* Peek at the next token. */
22857 /* If it's not a comma, then the list is complete. */
22860 /* Consume the `,'. */
22862 }
22864 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22865 base class had a qualified name. However, the next name that
22866 appears is certainly not qualified. */
22872 }
22874 /* Parse a base-specifier.
22876 base-specifier:
22877 :: [opt] nested-name-specifier [opt] class-name
22878 virtual access-specifier [opt] :: [opt] nested-name-specifier
22879 [opt] class-name
22880 access-specifier virtual [opt] :: [opt] nested-name-specifier
22881 [opt] class-name
22883 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22884 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22885 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22886 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22888 static tree
22890 {
22898 tree type;
22900 /* Process the optional `virtual' and `access-specifier'. */
22902 {
22903 /* Peek at the next token. */
22905 /* Process `virtual'. */
22907 {
22909 /* If `virtual' appears more than once, issue an error. */
22911 {
22915 }
22919 /* Consume the `virtual' token. */
22927 /* If more than one access specifier appears, issue an
22928 error. */
22931 {
22935 }
22939 /* Consume the access-specifier. */
22947 }
22948 }
22949 /* It is not uncommon to see programs mechanically, erroneously, use
22950 the 'typename' keyword to denote (dependent) qualified types
22951 as base classes. */
22953 {
22958 else
22960 "keyword %<typename%> not allowed in this context "
22963 }
22965 /* Look for the optional `::' operator. */
22967 /* Look for the nested-name-specifier. The simplest way to
22968 implement:
22970 [temp.res]
22972 The keyword `typename' is not permitted in a base-specifier or
22973 mem-initializer; in these contexts a qualified name that
22974 depends on a template-parameter is implicitly assumed to be a
22975 type name.
22977 is to pretend that we have seen the `typename' keyword at this
22978 point. */
22982 typename_type,
22984 /* If the base class is given by a qualified name, assume that names
22985 we see are type names or templates, as appropriate. */
22991 /* DR 950 allows decltype as a base-specifier. */
22993 else
22994 {
22995 /* Otherwise, look for the class-name. */
22997 class_scope_p,
22998 template_p,
22999 typename_type,
23004 }
23010 }
23012 /* Exception handling [gram.exception] */
23014 /* Parse an (optional) noexcept-specification.
23016 noexcept-specification:
23017 noexcept ( constant-expression ) [opt]
23019 If no noexcept-specification is present, returns NULL_TREE.
23020 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23021 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23022 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23023 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23024 in which case a boolean condition is returned instead. */
23026 static tree
23031 {
23035 /* Peek at the next token. */
23038 /* Is it a noexcept-specification? */
23040 {
23041 tree expr;
23045 {
23049 {
23050 /* Types may not be defined in an exception-specification. */
23052 parser->type_definition_forbidden_message
23057 /* Restore the saved message. */
23059 }
23060 else
23061 {
23064 }
23067 }
23068 else
23069 {
23073 }
23075 /* We cannot build a noexcept-spec right away because this will check
23076 that expr is a constexpr. */
23079 else
23081 }
23082 else
23084 }
23086 /* Parse an (optional) exception-specification.
23088 exception-specification:
23089 throw ( type-id-list [opt] )
23091 Returns a TREE_LIST representing the exception-specification. The
23092 TREE_VALUE of each node is a type. */
23094 static tree
23096 {
23098 tree type_id_list;
23101 /* Peek at the next token. */
23104 /* Is it a noexcept-specification? */
23110 /* If it's not `throw', then there's no exception-specification. */
23114 #if 0
23115 /* Enable this once a lot of code has transitioned to noexcept? */
23119 #endif
23121 /* Consume the `throw'. */
23124 /* Look for the `('. */
23127 /* Peek at the next token. */
23129 /* If it's not a `)', then there is a type-id-list. */
23131 {
23132 /* Types may not be defined in an exception-specification. */
23134 parser->type_definition_forbidden_message
23136 /* Parse the type-id-list. */
23138 /* Restore the saved message. */
23140 }
23141 else
23144 /* Look for the `)'. */
23148 }
23150 /* Parse an (optional) type-id-list.
23152 type-id-list:
23153 type-id ... [opt]
23154 type-id-list , type-id ... [opt]
23156 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23157 in the order that the types were presented. */
23159 static tree
23161 {
23165 {
23167 tree type;
23171 /* Get the next type-id. */
23173 /* Check for invalid 'auto'. */
23175 {
23179 }
23180 /* Parse the optional ellipsis. */
23182 {
23183 /* Consume the `...'. */
23186 /* Turn the type into a pack expansion expression. */
23188 }
23189 /* Add it to the list. */
23191 /* Peek at the next token. */
23193 /* If it is not a `,', we are done. */
23196 /* Consume the `,'. */
23198 }
23201 }
23203 /* Parse a try-block.
23205 try-block:
23206 try compound-statement handler-seq */
23208 static tree
23210 {
23211 tree try_block;
23225 }
23227 /* Parse a function-try-block.
23229 function-try-block:
23230 try ctor-initializer [opt] function-body handler-seq */
23232 static bool
23234 {
23235 tree compound_stmt;
23236 tree try_block;
23239 /* Look for the `try' keyword. */
23242 /* Let the rest of the front end know where we are. */
23244 /* Parse the function-body. */
23245 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23247 /* We're done with the `try' part. */
23249 /* Parse the handlers. */
23251 /* We're done with the handlers. */
23255 }
23257 /* Parse a handler-seq.
23259 handler-seq:
23260 handler handler-seq [opt] */
23262 static void
23264 {
23266 {
23269 /* Parse the handler. */
23271 /* Peek at the next token. */
23273 /* If it's not `catch' then there are no more handlers. */
23276 }
23277 }
23279 /* Parse a handler.
23281 handler:
23282 catch ( exception-declaration ) compound-statement */
23284 static void
23286 {
23287 tree handler;
23288 tree declaration;
23298 }
23300 /* Parse an exception-declaration.
23302 exception-declaration:
23303 type-specifier-seq declarator
23304 type-specifier-seq abstract-declarator
23305 type-specifier-seq
23306 ...
23308 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23309 ellipsis variant is used. */
23311 static tree
23313 {
23314 cp_decl_specifier_seq type_specifiers;
23318 /* If it's an ellipsis, it's easy to handle. */
23320 {
23321 /* Consume the `...' token. */
23324 }
23326 /* Types may not be defined in exception-declarations. */
23328 parser->type_definition_forbidden_message
23331 /* Parse the type-specifier-seq. */
23335 /* If it's a `)', then there is no declarator. */
23338 else
23345 /* Restore the saved message. */
23352 }
23354 /* Parse a throw-expression.
23356 throw-expression:
23357 throw assignment-expression [opt]
23359 Returns a THROW_EXPR representing the throw-expression. */
23361 static tree
23363 {
23364 tree expression;
23369 /* Figure out whether or not there is an assignment-expression
23370 following the "throw" keyword. */
23378 else
23382 }
23384 /* GNU Extensions */
23386 /* Parse an (optional) asm-specification.
23388 asm-specification:
23389 asm ( string-literal )
23391 If the asm-specification is present, returns a STRING_CST
23392 corresponding to the string-literal. Otherwise, returns
23393 NULL_TREE. */
23395 static tree
23397 {
23399 tree asm_specification;
23401 /* Peek at the next token. */
23403 /* If the next token isn't the `asm' keyword, then there's no
23404 asm-specification. */
23408 /* Consume the `asm' token. */
23410 /* Look for the `('. */
23413 /* Look for the string-literal. */
23416 /* Look for the `)'. */
23420 }
23422 /* Parse an asm-operand-list.
23424 asm-operand-list:
23425 asm-operand
23426 asm-operand-list , asm-operand
23428 asm-operand:
23429 string-literal ( expression )
23430 [ string-literal ] string-literal ( expression )
23432 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23433 each node is the expression. The TREE_PURPOSE is itself a
23434 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23435 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23436 is a STRING_CST for the string literal before the parenthesis. Returns
23437 ERROR_MARK_NODE if any of the operands are invalid. */
23439 static tree
23441 {
23446 {
23447 tree string_literal;
23448 tree expression;
23449 tree name;
23452 {
23453 /* Consume the `[' token. */
23455 /* Read the operand name. */
23460 /* Look for the closing `]'. */
23462 }
23463 else
23465 /* Look for the string-literal. */
23468 /* Look for the `('. */
23470 /* Parse the expression. */
23472 /* Look for the `)'. */
23480 /* Add this operand to the list. */
23482 expression,
23483 asm_operands);
23484 /* If the next token is not a `,', there are no more
23485 operands. */
23488 /* Consume the `,'. */
23490 }
23493 }
23495 /* Parse an asm-clobber-list.
23497 asm-clobber-list:
23498 string-literal
23499 asm-clobber-list , string-literal
23501 Returns a TREE_LIST, indicating the clobbers in the order that they
23502 appeared. The TREE_VALUE of each node is a STRING_CST. */
23504 static tree
23506 {
23510 {
23511 tree string_literal;
23513 /* Look for the string literal. */
23515 /* Add it to the list. */
23517 /* If the next token is not a `,', then the list is
23518 complete. */
23521 /* Consume the `,' token. */
23523 }
23526 }
23528 /* Parse an asm-label-list.
23530 asm-label-list:
23531 identifier
23532 asm-label-list , identifier
23534 Returns a TREE_LIST, indicating the labels in the order that they
23535 appeared. The TREE_VALUE of each node is a label. */
23537 static tree
23539 {
23543 {
23546 /* Look for the identifier. */
23549 {
23552 {
23558 }
23559 }
23560 /* If the next token is not a `,', then the list is
23561 complete. */
23564 /* Consume the `,' token. */
23566 }
23569 }
23571 /* Return TRUE iff the next tokens in the stream are possibly the
23572 beginning of a GNU extension attribute. */
23574 static bool
23576 {
23578 }
23580 /* Return TRUE iff the next tokens in the stream are possibly the
23581 beginning of a standard C++-11 attribute specifier. */
23583 static bool
23585 {
23587 }
23589 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23590 beginning of a standard C++-11 attribute specifier. */
23592 static bool
23594 {
23602 }
23604 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23605 beginning of a GNU extension attribute. */
23607 static bool
23609 {
23613 }
23615 /* Return true iff the next tokens can be the beginning of either a
23616 GNU attribute list, or a standard C++11 attribute sequence. */
23618 static bool
23620 {
23623 }
23625 /* Return true iff the next Nth tokens can be the beginning of either
23626 a GNU attribute list, or a standard C++11 attribute sequence. */
23628 static bool
23630 {
23633 }
23635 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23636 of GNU attributes, or return NULL. */
23638 static tree
23640 {
23644 }
23646 #define CILK_SIMD_FN_CLAUSE_MASK \
23647 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23648 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23649 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23650 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23651 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23653 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23654 vector [(<clauses>)] */
23656 static void
23658 {
23662 {
23667 }
23670 {
23673 paren_scope++;
23674 }
23676 {
23679 paren_scope++;
23681 paren_scope--;
23682 /* Do not push the last ')' */
23685 }
23694 }
23696 /* Parse an (optional) series of attributes.
23698 attributes:
23699 attributes attribute
23701 attribute:
23702 __attribute__ (( attribute-list [opt] ))
23704 The return value is as for cp_parser_gnu_attribute_list. */
23706 static tree
23708 {
23712 {
23714 tree attribute_list;
23717 /* Peek at the next token. */
23719 /* If it's not `__attribute__', then we're done. */
23723 /* Consume the `__attribute__' keyword. */
23725 /* Look for the two `(' tokens. */
23729 /* Peek at the next token. */
23732 /* Parse the attribute-list. */
23734 else
23735 /* If the next token is a `)', then there is no attribute
23736 list. */
23739 /* Look for the two `)' tokens. */
23747 /* Add these new attributes to the list. */
23749 }
23752 }
23754 /* Parse a GNU attribute-list.
23756 attribute-list:
23757 attribute
23758 attribute-list , attribute
23760 attribute:
23761 identifier
23762 identifier ( identifier )
23763 identifier ( identifier , expression-list )
23764 identifier ( expression-list )
23766 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23767 to an attribute. The TREE_PURPOSE of each node is the identifier
23768 indicating which attribute is in use. The TREE_VALUE represents
23769 the arguments, if any. */
23771 static tree
23773 {
23779 {
23781 tree identifier;
23782 tree attribute;
23784 /* Look for the identifier. We also allow keywords here; for
23785 example `__attribute__ ((const))' is legal. */
23789 {
23792 /* Consume the token, but save it since we need it for the
23793 SIMD enabled function parsing. */
23796 /* Save away the identifier that indicates which attribute
23797 this is. */
23799 /* For keywords, use the canonical spelling, not the
23800 parsed identifier. */
23806 /* Peek at the next token. */
23808 /* If it's an `(', then parse the attribute arguments. */
23810 {
23815 {
23818 }
23819 else
23820 vec = cp_parser_parenthesized_expression_list
23826 else
23827 {
23830 }
23831 /* Save the arguments away. */
23833 }
23835 {
23838 }
23841 {
23842 /* Add this attribute to the list. */
23845 }
23848 }
23849 /* Now, look for more attributes. If the next token isn't a
23850 `,', we're done. */
23854 /* Consume the comma and keep going. */
23856 }
23859 /* We built up the list in reverse order. */
23861 }
23863 /* Parse a standard C++11 attribute.
23865 The returned representation is a TREE_LIST which TREE_PURPOSE is
23866 the scoped name of the attribute, and the TREE_VALUE is its
23867 arguments list.
23869 Note that the scoped name of the attribute is itself a TREE_LIST
23870 which TREE_PURPOSE is the namespace of the attribute, and
23871 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23872 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23873 and which TREE_PURPOSE is directly the attribute name.
23875 Clients of the attribute code should use get_attribute_namespace
23876 and get_attribute_name to get the actual namespace and name of
23877 attributes, regardless of their being GNU or C++11 attributes.
23879 attribute:
23880 attribute-token attribute-argument-clause [opt]
23882 attribute-token:
23883 identifier
23884 attribute-scoped-token
23886 attribute-scoped-token:
23887 attribute-namespace :: identifier
23889 attribute-namespace:
23890 identifier
23892 attribute-argument-clause:
23893 ( balanced-token-seq )
23895 balanced-token-seq:
23896 balanced-token [opt]
23897 balanced-token-seq balanced-token
23899 balanced-token:
23900 ( balanced-token-seq )
23901 [ balanced-token-seq ]
23902 { balanced-token-seq }. */
23904 static tree
23906 {
23910 /* First, parse name of the attribute, a.k.a attribute-token. */
23927 {
23928 /* We are seeing a scoped attribute token. */
23938 else
23939 {
23943 }
23945 NULL_TREE);
23947 }
23948 else
23949 {
23951 NULL_TREE);
23952 /* C++11 noreturn attribute is equivalent to GNU's. */
23955 /* C++14 deprecated attribute is equivalent to GNU's. */
23957 {
23960 "%<deprecated%> is a C++14 feature;"
23963 }
23964 /* Transactional Memory TS optimize_for_synchronized attribute is
23965 equivalent to GNU transaction_callable. */
23969 /* Transactional Memory attributes are GNU attributes. */
23972 }
23974 /* Now parse the optional argument clause of the attribute. */
23979 {
23985 /* A GNU attribute that takes an identifier in parameter. */
23988 vec = cp_parser_parenthesized_expression_list
23994 else
23995 {
23998 }
24002 else
24004 }
24007 }
24009 /* Check that the attribute ATTRIBUTE appears at most once in the
24010 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24011 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24012 isn't implemented yet in GCC. */
24014 static void
24016 {
24018 {
24028 }
24029 }
24031 /* Parse a list of standard C++-11 attributes.
24033 attribute-list:
24034 attribute [opt]
24035 attribute-list , attribute[opt]
24036 attribute ...
24037 attribute-list , attribute ...
24038 */
24040 static tree
24042 {
24047 {
24052 {
24056 }
24059 {
24064 }
24068 }
24071 }
24073 /* Parse a standard C++-11 attribute specifier.
24075 attribute-specifier:
24076 [ [ attribute-list ] ]
24077 alignment-specifier
24079 alignment-specifier:
24080 alignas ( type-id ... [opt] )
24081 alignas ( alignment-expression ... [opt] ). */
24083 static tree
24085 {
24091 {
24100 else
24101 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24102 when we are sure that we have actually parsed them. */
24104 }
24105 else
24106 {
24107 tree alignas_expr;
24109 /* Look for an alignment-specifier. */
24121 {
24124 }
24130 {
24134 alignas_expr =
24141 }
24147 {
24150 }
24153 {
24156 }
24158 /* Build the C++-11 representation of an 'aligned'
24159 attribute. */
24160 attributes =
24163 alignas_expr);
24164 }
24167 }
24169 /* Parse a standard C++-11 attribute-specifier-seq.
24171 attribute-specifier-seq:
24172 attribute-specifier-seq [opt] attribute-specifier
24173 */
24175 static tree
24177 {
24182 {
24191 else
24194 }
24197 }
24199 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24200 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24201 current value of the PEDANTIC flag, regardless of whether or not
24202 the `__extension__' keyword is present. The caller is responsible
24203 for restoring the value of the PEDANTIC flag. */
24205 static bool
24207 {
24208 /* Save the old value of the PEDANTIC flag. */
24212 {
24213 /* Consume the `__extension__' token. */
24215 /* We're not being pedantic while the `__extension__' keyword is
24216 in effect. */
24220 }
24223 }
24225 /* Parse a label declaration.
24227 label-declaration:
24228 __label__ label-declarator-seq ;
24230 label-declarator-seq:
24231 identifier , label-declarator-seq
24232 identifier */
24234 static void
24236 {
24237 /* Look for the `__label__' keyword. */
24241 {
24242 tree identifier;
24244 /* Look for an identifier. */
24246 /* If we failed, stop. */
24249 /* Declare it as a label. */
24251 /* If the next token is a `;', stop. */
24254 /* Look for the `,' separating the label declarations. */
24256 }
24258 /* Look for the final `;'. */
24260 }
24262 // -------------------------------------------------------------------------- //
24263 // Requires Clause
24265 // Parse a requires clause.
24266 //
24267 // requires-clause:
24268 // 'requires' logical-or-expression
24269 //
24270 // The required logical-or-expression must be a constant expression. Note
24271 // that we don't check that the expression is constepxr here. We defer until
24272 // we analyze constraints and then, we only check atomic constraints.
24273 static tree
24275 {
24276 // Parse the requires clause so that it is not automatically folded.
24284 }
24286 // Optionally parse a requires clause:
24287 static tree
24289 {
24292 {
24295 {
24298 /* Parse and discard the requires-clause. */
24301 }
24303 }
24306 }
24309 /*---------------------------------------------------------------------------
24310 Requires expressions
24311 ---------------------------------------------------------------------------*/
24313 /* Parse a requires expression
24315 requirement-expression:
24316 'requires' requirement-parameter-list [opt] requirement-body */
24317 static tree
24319 {
24323 /* A requires-expression shall appear only within a concept
24324 definition or a requires-clause.
24326 TODO: Implement this diagnostic correctly. */
24328 {
24332 }
24335 {
24336 /* Local parameters are delared as variables within the scope
24337 of the expression. They are not visible past the end of
24338 the expression. Expressions within the requires-expression
24339 are unevaluated. */
24340 struct scope_sentinel
24341 {
24343 {
24346 }
24349 {
24352 }
24355 /* Parse the optional parameter list. */
24357 {
24361 }
24362 else
24365 /* Parse the requirement body. */
24369 }
24371 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24372 the parm chain. */
24375 }
24377 /* Parse a parameterized requirement.
24379 requirement-parameter-list:
24380 '(' parameter-declaration-clause ')' */
24381 static tree
24383 {
24393 }
24395 /* Parse the body of a requirement.
24397 requirement-body:
24398 '{' requirement-list '}' */
24399 static tree
24401 {
24411 }
24413 /* Parse a list of requirements.
24415 requirement-list:
24416 requirement
24417 requirement-list ';' requirement[opt] */
24418 static tree
24420 {
24423 {
24430 /* If we see a semi-colon, consume it. */
24434 /* Stop processing at the end of the list. */
24437 }
24439 /* Reverse the order of requirements so they are analyzed in
24440 declaration order. */
24442 }
24444 /* Parse a syntactic requirement or type requirement.
24446 requirement:
24447 simple-requirement
24448 compound-requirement
24449 type-requirement
24450 nested-requirement */
24451 static tree
24453 {
24460 else
24462 }
24464 /* Parse a simple requirement.
24466 simple-requirement:
24467 expression ';' */
24468 static tree
24470 {
24479 }
24481 /* Parse a type requirement
24483 type-requirement
24484 nested-name-specifier [opt] required-type-name ';'
24486 required-type-name:
24487 type-name
24488 'template' [opt] simple-template-id */
24489 static tree
24491 {
24494 // Save the scope before parsing name specifiers.
24505 tree type;
24507 {
24516 }
24517 else
24536 }
24538 /* Parse a compound requirement
24540 compound-requirement:
24541 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24542 static tree
24544 {
24545 /* Parse an expression enclosed in '{ }'s. */
24556 /* Parse the optional noexcept. */
24559 {
24562 }
24564 /* Parse the optional trailing return type. */
24567 {
24575 }
24578 }
24580 /* Parse a nested requirement. This is the same as a requires clause.
24582 nested-requirement:
24583 requires-clause */
24584 static tree
24586 {
24592 }
24594 /* Support Functions */
24596 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24597 NAME should have one of the representations used for an
24598 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24599 is returned. If PARSER->SCOPE is a dependent type, then a
24600 SCOPE_REF is returned.
24602 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24603 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24604 was formed. Abstractly, such entities should not be passed to this
24605 function, because they do not need to be looked up, but it is
24606 simpler to check for this special case here, rather than at the
24607 call-sites.
24609 In cases not explicitly covered above, this function returns a
24610 DECL, OVERLOAD, or baselink representing the result of the lookup.
24611 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24612 is returned.
24614 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24615 (e.g., "struct") that was used. In that case bindings that do not
24616 refer to types are ignored.
24618 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24619 ignored.
24621 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24622 are ignored.
24624 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24625 types.
24627 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24628 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24629 NULL_TREE otherwise. */
24631 static cp_expr
24638 location_t name_location)
24639 {
24640 tree decl;
24643 /* Assume that the lookup will be unambiguous. */
24647 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24648 no longer valid. Note that if we are parsing tentatively, and
24649 the parse fails, OBJECT_TYPE will be automatically restored. */
24655 /* A template-id has already been resolved; there is no lookup to
24656 do. */
24660 {
24664 }
24666 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24667 it should already have been checked to make sure that the name
24668 used matches the type being destroyed. */
24670 {
24671 tree type;
24673 /* Figure out to which type this destructor applies. */
24678 else
24680 /* If that's not a class type, there is no destructor. */
24687 /* If it was a class type, return the destructor. */
24689 }
24691 /* By this point, the NAME should be an ordinary identifier. If
24692 the id-expression was a qualified name, the qualifying scope is
24693 stored in PARSER->SCOPE at this point. */
24696 /* Perform the lookup. */
24698 {
24704 /* If the SCOPE is dependent, the lookup must be deferred until
24705 the template is instantiated -- unless we are explicitly
24706 looking up names in uninstantiated templates. Even then, we
24707 cannot look up the name if the scope is not a class type; it
24708 might, for example, be a template type parameter. */
24713 /* Defer lookup. */
24715 else
24716 {
24719 /* If PARSER->SCOPE is a dependent type, then it must be a
24720 class type, and we must not be checking dependencies;
24721 otherwise, we would have processed this lookup above. So
24722 that PARSER->SCOPE is not considered a dependent base by
24723 lookup_member, we must enter the scope here. */
24727 /* If the PARSER->SCOPE is a template specialization, it
24728 may be instantiated during name lookup. In that case,
24729 errors may be issued. Even if we rollback the current
24730 tentative parse, those errors are valid. */
24735 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24736 lookup result and the nested-name-specifier nominates a class C:
24737 * if the name specified after the nested-name-specifier, when
24738 looked up in C, is the injected-class-name of C (Clause 9), or
24739 * if the name specified after the nested-name-specifier is the
24740 same as the identifier or the simple-template-id's template-
24741 name in the last component of the nested-name-specifier,
24742 the name is instead considered to name the constructor of
24743 class C. [ Note: for example, the constructor is not an
24744 acceptable lookup result in an elaborated-type-specifier so
24745 the constructor would not be used in place of the
24746 injected-class-name. --end note ] Such a constructor name
24747 shall be used only in the declarator-id of a declaration that
24748 names a constructor or in a using-declaration. */
24756 /* If we have a single function from a using decl, pull it out. */
24763 }
24765 /* If the scope is a dependent type and either we deferred lookup or
24766 we did lookup but didn't find the name, rememeber the name. */
24769 {
24771 {
24772 tree type;
24774 /* The resolution to Core Issue 180 says that `struct
24775 A::B' should be considered a type-name, even if `A'
24776 is dependent. */
24781 }
24785 CPP_CLOSE_PAREN)))
24789 else
24792 is_template);
24793 }
24796 }
24798 {
24799 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24800 OBJECT_TYPE is not a class. */
24802 /* If the OBJECT_TYPE is a template specialization, it may
24803 be instantiated during name lookup. In that case, errors
24804 may be issued. Even if we rollback the current tentative
24805 parse, those errors are valid. */
24807 name,
24810 tf_warning_or_error);
24811 else
24815 {
24816 /* Look it up in the enclosing context. */
24820 /* DR 141 says when looking for a template-name after -> or ., only
24821 consider class templates. We need to fix our handling of
24822 dependent expressions to implement that properly, but for now
24823 let's ignore namespace-scope function templates. */
24825 {
24831 }
24832 }
24834 /* The object is type-dependent, so we can't look anything up; we used
24835 this to get the DR 141 behavior. */
24839 }
24840 else
24841 {
24847 }
24849 /* If the lookup failed, let our caller know. */
24853 /* Pull out the template from an injected-class-name (or multiple). */
24857 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24859 {
24862 /* The error message we have to print is too complicated for
24863 cp_parser_error, so we incorporate its actions directly. */
24865 {
24867 name);
24869 }
24871 }
24879 /* If we have resolved the name of a member declaration, check to
24880 see if the declaration is accessible. When the name resolves to
24881 set of overloaded functions, accessibility is checked when
24882 overload resolution is done.
24884 During an explicit instantiation, access is not checked at all,
24885 as per [temp.explicit]. */
24892 }
24894 /* Like cp_parser_lookup_name, but for use in the typical case where
24895 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24896 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24898 static tree
24900 {
24902 none_type,
24907 location);
24908 }
24910 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24911 the current context, return the TYPE_DECL. If TAG_NAME_P is
24912 true, the DECL indicates the class being defined in a class-head,
24913 or declared in an elaborated-type-specifier.
24915 Otherwise, return DECL. */
24917 static tree
24919 {
24920 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24921 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24923 struct A {
24924 template <typename T> struct B;
24925 };
24927 template <typename T> struct A::B {};
24929 Similarly, in an elaborated-type-specifier:
24931 namespace N { struct X{}; }
24933 struct A {
24934 template <typename T> friend struct N::X;
24935 };
24937 However, if the DECL refers to a class type, and we are in
24938 the scope of the class, then the name lookup automatically
24939 finds the TYPE_DECL created by build_self_reference rather
24940 than a TEMPLATE_DECL. For example, in:
24942 template <class T> struct S {
24943 S s;
24944 };
24946 there is no need to handle such case. */
24952 }
24954 /* If too many, or too few, template-parameter lists apply to the
24955 declarator, issue an error message. Returns TRUE if all went well,
24956 and FALSE otherwise. */
24958 static bool
24961 location_t declarator_location)
24962 {
24964 {
24966 {
24974 /* If the DECLARATOR has the form `X<y>' then it uses one
24975 additional level of template parameters. */
24978 return cp_parser_check_template_parameters
24980 }
24995 }
24997 }
24999 /* NUM_TEMPLATES were used in the current declaration. If that is
25000 invalid, return FALSE and issue an error messages. Otherwise,
25001 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25002 declarator and we can print more accurate diagnostics. */
25004 static bool
25007 location_t location,
25009 {
25010 /* If there are the same number of template classes and parameter
25011 lists, that's OK. */
25014 /* If there are more, but only one more, then we are referring to a
25015 member template. That's OK too. */
25018 /* If there are more template classes than parameter lists, we have
25019 something like:
25021 template <class T> void S<T>::R<T>::f (); */
25023 {
25033 else
25036 }
25037 /* Otherwise, there are too many template parameter lists. We have
25038 something like:
25040 template <class T> template <class U> void S::f(); */
25043 }
25045 /* Parse an optional `::' token indicating that the following name is
25046 from the global namespace. If so, PARSER->SCOPE is set to the
25047 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25048 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25049 Returns the new value of PARSER->SCOPE, if the `::' token is
25050 present, and NULL_TREE otherwise. */
25052 static tree
25054 {
25057 /* Peek at the next token. */
25059 /* If we're looking at a `::' token then we're starting from the
25060 global namespace, not our current location. */
25062 {
25063 /* Consume the `::' token. */
25065 /* Set the SCOPE so that we know where to start the lookup. */
25071 }
25073 {
25077 }
25080 }
25082 /* Returns TRUE if the upcoming token sequence is the start of a
25083 constructor declarator. If FRIEND_P is true, the declarator is
25084 preceded by the `friend' specifier. */
25086 static bool
25088 {
25091 tree nested_name_specifier;
25094 /* The common case is that this is not a constructor declarator, so
25095 try to avoid doing lots of work if at all possible. It's not
25096 valid declare a constructor at function scope. */
25099 /* And only certain tokens can begin a constructor declarator. */
25107 /* Parse tentatively; we are going to roll back all of the tokens
25108 consumed here. */
25110 /* Assume that we are looking at a constructor declarator. */
25113 /* Look for the optional `::' operator. */
25116 /* Look for the nested-name-specifier. */
25117 nested_name_specifier
25128 /* Outside of a class-specifier, there must be a
25129 nested-name-specifier. */
25135 /* If we have a class scope, this is easy; DR 147 says that S::S always
25136 names the constructor, and no other qualified name could. */
25139 {
25149 }
25150 /* If we still think that this might be a constructor-declarator,
25151 look for a class-name. */
25153 {
25154 /* If we have:
25156 template <typename T> struct S {
25157 S();
25158 };
25160 we must recognize that the nested `S' names a class. */
25161 tree type_decl;
25165 none_type,
25169 /* If there was no class-name, then this is not a constructor.
25170 Otherwise, if we are in a class-specifier and we aren't
25171 handling a friend declaration, check that its type matches
25172 current_class_type (c++/38313). Note: error_mark_node
25173 is left alone for error recovery purposes. */
25175 && (outside_class_specifier_p
25180 /* If we're still considering a constructor, we have to see a `(',
25181 to begin the parameter-declaration-clause, followed by either a
25182 `)', an `...', or a decl-specifier. We need to check for a
25183 type-specifier to avoid being fooled into thinking that:
25185 S (f) (int);
25187 is a constructor. (It is actually a function named `f' that
25188 takes one parameter (of type `int') and returns a value of type
25189 `S'. */
25197 /* A parameter declaration begins with a decl-specifier,
25198 which is either the "attribute" keyword, a storage class
25199 specifier, or (usually) a type-specifier. */
25201 {
25202 tree type;
25206 /* Names appearing in the type-specifier should be looked up
25207 in the scope of the class. */
25210 else
25211 {
25214 {
25218 {
25221 }
25222 }
25224 }
25226 /* Inside the constructor parameter list, surrounding
25227 template-parameter-lists do not apply. */
25228 saved_num_template_parameter_lists
25232 /* Look for the type-specifier. */
25234 CP_PARSER_FLAGS_NONE,
25240 parser->num_template_parameter_lists
25243 /* Leave the scope of the class. */
25248 }
25249 }
25251 /* We did not really want to consume any tokens. */
25255 }
25257 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25258 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25259 they must be performed once we are in the scope of the function.
25261 Returns the function defined. */
25263 static tree
25264 cp_parser_function_definition_from_specifiers_and_declarator
25267 tree attributes,
25269 {
25270 tree fn;
25273 /* Begin the function-definition. */
25276 /* The things we're about to see are not directly qualified by any
25277 template headers we've seen thus far. */
25280 /* If there were names looked up in the decl-specifier-seq that we
25281 did not check, check them now. We must wait until we are in the
25282 scope of the function to perform the checks, since the function
25283 might be a friend. */
25287 {
25292 }
25295 {
25296 /* Skip the entire function. */
25299 }
25301 {
25302 /* Seen already, skip it. An error message has already been output. */
25306 /* If this is a function from a class, pop the nested class. */
25309 }
25310 else
25311 {
25312 timevar_id_t tv;
25315 else
25321 }
25324 }
25326 /* Parse the part of a function-definition that follows the
25327 declarator. INLINE_P is TRUE iff this function is an inline
25328 function defined within a class-specifier.
25330 Returns the function defined. */
25332 static tree
25335 {
25336 tree fn;
25342 bool fully_implicit_function_template_p
25345 tree implicit_template_parms
25348 cp_binding_level* implicit_template_scope
25354 /* If the next token is `return', then the code may be trying to
25355 make use of the "named return value" extension that G++ used to
25356 support. */
25359 {
25360 /* Consume the `return' keyword. */
25362 /* Look for the identifier that indicates what value is to be
25363 returned. */
25365 /* Issue an error message. */
25368 /* Skip tokens until we reach the start of the function body. */
25370 {
25377 }
25378 }
25379 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25380 anything declared inside `f'. */
25381 saved_in_unbraced_linkage_specification_p
25384 /* Inside the function, surrounding template-parameter-lists do not
25385 apply. */
25386 saved_num_template_parameter_lists
25392 /* If the next token is `try', `__transaction_atomic', or
25393 `__transaction_relaxed`, then we are looking at either function-try-block
25394 or function-transaction-block. Note that all of these include the
25395 function-body. */
25398 RID_TRANSACTION_ATOMIC);
25400 RID_TRANSACTION_RELAXED))
25402 RID_TRANSACTION_RELAXED);
25405 else
25406 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25411 /* Finish the function. */
25414 /* Generate code for it, if necessary. */
25416 /* Restore the saved values. */
25417 parser->in_unbraced_linkage_specification_p
25419 parser->num_template_parameter_lists
25423 parser->fully_implicit_function_template_p
25425 parser->implicit_template_parms
25427 parser->implicit_template_scope
25434 }
25436 /* Parse a template-declaration body (following argument list). */
25438 static void
25440 tree parameter_list,
25442 {
25446 /* We just processed one more parameter list. */
25449 /* Get the deferred access checks from the parameter list. These
25450 will be checked once we know what is being declared, as for a
25451 member template the checks must be performed in the scope of the
25452 class containing the member. */
25455 /* Tentatively parse for a new template parameter list, which can either be
25456 the template keyword or a template introduction. */
25462 else
25463 {
25464 /* There are no access checks when parsing a template, as we do not
25465 know if a specialization will be a friend. */
25469 checks,
25470 member_p,
25475 /* If this is a member template declaration, let the front
25476 end know. */
25478 {
25483 }
25488 }
25489 /* We are done with the current parameter list. */
25494 /* Finish up. */
25497 /* Check the template arguments for a literal operator template. */
25501 {
25505 else
25506 {
25509 {
25515 }
25517 {
25525 }
25526 else
25528 }
25530 {
25533 " Expected non-type template argument pack <char...>"
25535 decl);
25536 else
25539 decl);
25540 }
25541 }
25543 /* Register member declarations. */
25546 /* If DECL is a function template, we must return to parse it later.
25547 (Even though there is no definition, there might be default
25548 arguments that need handling.) */
25552 }
25554 /* Parse a template introduction header for a template-declaration. Returns
25555 false if tentative parse fails. */
25557 static bool
25559 {
25566 /* Look for the optional `::' operator. */
25569 /* Look for the nested-name-specifier. */
25579 /* Look up the concept for which we will be matching
25580 template parameters. */
25590 /* Look for opening brace for introduction. */
25598 /* Build vector of placeholder parameters and grab
25599 matching identifiers. */
25602 /* The introduction-list shall not be empty. */
25605 {
25608 }
25610 /* Look for closing brace for introduction. */
25615 {
25619 }
25621 /* Build and associate the constraint. */
25624 {
25626 member_p);
25628 }
25632 }
25634 /* Parse a normal template-declaration following the template keyword. */
25636 static void
25638 {
25639 tree parameter_list;
25643 /* Look for the `<' token. */
25647 {
25648 /* 14.5.2.2 [temp.mem]
25650 A local class shall not have member templates. */
25655 }
25656 /* [temp]
25658 A template ... shall not have C linkage. */
25660 {
25662 /* Give it C++ linkage to avoid confusing other parts of the
25663 front end. */
25666 }
25667 else
25670 /* We cannot perform access checks on the template parameter
25671 declarations until we know what is being declared, just as we
25672 cannot check the decl-specifier list. */
25675 /* If the next token is `>', then we have an invalid
25676 specialization. Rather than complain about an invalid template
25677 parameter, issue an error message here. */
25679 {
25683 }
25684 else
25685 {
25686 /* Parse the template parameters. */
25688 }
25690 /* Look for the `>'. */
25693 /* Manage template requirements */
25700 member_p);
25702 /* For the erroneous case of a template with C linkage, we pushed an
25703 implicit C++ linkage scope; exit that scope now. */
25706 }
25708 /* Parse a template-declaration, assuming that the `export' (and
25709 `extern') keywords, if present, has already been scanned. MEMBER_P
25710 is as for cp_parser_template_declaration. */
25712 static bool
25714 {
25716 {
25720 }
25725 }
25727 /* Perform the deferred access checks from a template-parameter-list.
25728 CHECKS is a TREE_LIST of access checks, as returned by
25729 get_deferred_access_checks. */
25731 static void
25732 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25733 {
25737 }
25739 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25740 `function-definition' sequence that follows a template header.
25741 If MEMBER_P is true, this declaration appears in a class scope.
25743 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25744 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25746 static tree
25752 {
25755 cp_decl_specifier_seq decl_specifiers;
25759 /* This function is only used when processing a template
25760 declaration. */
25764 /* Defer access checks until we know what is being declared. */
25767 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25768 alternative. */
25771 CP_PARSER_FLAGS_OPTIONAL,
25777 /* There are no template typedefs. */
25779 {
25783 }
25785 /* Gather up the access checks that occurred the
25786 decl-specifier-seq. */
25789 /* Check for the declaration of a template class. */
25791 {
25794 {
25795 // If this is a declaration, but not a definition, associate
25796 // any constraints with the type declaration. Constraints
25797 // are associated with definitions in cp_parser_class_specifier.
25803 /* In this case:
25805 struct C {
25806 friend template <typename T> struct A<T>::B;
25807 };
25809 A<T>::B will be represented by a TYPENAME_TYPE, and
25810 therefore not recognized by shadow_tag. */
25812 && !decl
25819 else
25822 /* Perform access checks for template parameters. */
25825 /* Give a helpful diagnostic for
25826 template <class T> struct A { } a;
25827 if we aren't already recovering from an error. */
25830 {
25832 "a class template declaration must not declare "
25836 }
25837 }
25838 }
25840 /* Complain about missing 'typename' or other invalid type names. */
25843 {
25844 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25845 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25846 the rest of this declaration. */
25849 }
25851 /* If it's not a template class, try for a template function. If
25852 the next token is a `;', then this declaration does not declare
25853 anything. But, if there were errors in the decl-specifiers, then
25854 the error might well have come from an attempted class-specifier.
25855 In that case, there's no need to warn about a missing declarator. */
25859 {
25862 checks,
25864 member_p,
25865 declares_class_or_enum,
25869 /* 7.1.1-1 [dcl.stc]
25871 A storage-class-specifier shall not be specified in an explicit
25872 specialization... */
25874 && explicit_specialization_p
25876 {
25880 }
25884 }
25886 /* Look for a trailing `;' after the declaration. */
25892 out:
25895 /* Clear any current qualification; whatever comes next is the start
25896 of something new. */
25902 }
25904 /* Parse a cast-expression that is not the operand of a unary "&". */
25906 static cp_expr
25908 {
25911 }
25913 /* Parse a functional cast to TYPE. Returns an expression
25914 representing the cast. */
25916 static cp_expr
25918 {
25920 tree expression_list;
25921 cp_expr cast;
25930 {
25939 tf_warning_or_error);
25940 /* Create a location of the form:
25941 type_name{i, f}
25942 ^~~~~~~~~~~~~~~
25943 with caret == start at the start of the type name,
25944 finishing at the closing brace. */
25945 location_t finish_loc
25948 finish_loc);
25951 }
25960 else
25961 {
25964 }
25967 tf_warning_or_error);
25968 /* [expr.const]/1: In an integral constant expression "only type
25969 conversions to integral or enumeration type can be used". */
25975 NIC_CONSTRUCTOR))
25978 /* Create a location of the form:
25979 float(i)
25980 ^~~~~~~~
25981 with caret == start at the start of the type name,
25982 finishing at the closing paren. */
25983 location_t finish_loc
25988 }
25990 /* Save the tokens that make up the body of a member function defined
25991 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25992 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25993 specifiers applied to the declaration. Returns the FUNCTION_DECL
25994 for the member function. */
25996 static tree
26000 tree attributes)
26001 {
26004 tree fn;
26006 /* Create the FUNCTION_DECL. */
26010 /* If something went badly wrong, bail out now. */
26012 {
26013 /* If there's a function-body, skip it. */
26018 }
26020 /* Remember it, if there default args to post process. */
26023 /* Save away the tokens that make up the body of the
26024 function. */
26026 /* Handle function try blocks. */
26029 /* We can have braced-init-list mem-initializers before the fn body. */
26031 {
26034 {
26035 /* cache_group will stop after an un-nested { } pair, too. */
26039 /* variadic mem-inits have ... after the ')'. */
26042 }
26043 }
26045 /* Handle function try blocks. */
26050 /* Save away the inline definition; we will process it when the
26051 class is complete. */
26055 /* We need to know that this was defined in the class, so that
26056 friend templates are handled correctly. */
26059 /* Add FN to the queue of functions to be parsed later. */
26063 }
26065 /* Save the tokens that make up the in-class initializer for a non-static
26066 data member. Returns a DEFAULT_ARG. */
26068 static tree
26070 {
26072 }
26074 /* Parse a template-argument-list, as well as the trailing ">" (but
26075 not the opening "<"). See cp_parser_template_argument_list for the
26076 return value. */
26078 static tree
26080 {
26081 tree arguments;
26082 tree saved_scope;
26083 tree saved_qualifying_scope;
26084 tree saved_object_scope;
26089 /* [temp.names]
26091 When parsing a template-id, the first non-nested `>' is taken as
26092 the end of the template-argument-list rather than a greater-than
26093 operator. */
26094 saved_greater_than_is_operator_p
26097 /* Parsing the argument list may modify SCOPE, so we save it
26098 here. */
26102 /* We need to evaluate the template arguments, even though this
26103 template-id may be nested within a "sizeof". */
26108 /* Parse the template-argument-list itself. */
26112 else
26114 /* Look for the `>' that ends the template-argument-list. If we find
26115 a '>>' instead, it's probably just a typo. */
26117 {
26119 {
26120 /* In C++0x, a `>>' in a template argument list or cast
26121 expression is considered to be two separate `>'
26122 tokens. So, change the current token to a `>', but don't
26123 consume it: it will be consumed later when the outer
26124 template argument list (or cast expression) is parsed.
26125 Note that this replacement of `>' for `>>' is necessary
26126 even if we are parsing tentatively: in the tentative
26127 case, after calling
26128 cp_parser_enclosed_template_argument_list we will always
26129 throw away all of the template arguments and the first
26130 closing `>', either because the template argument list
26131 was erroneous or because we are replacing those tokens
26132 with a CPP_TEMPLATE_ID token. The second `>' (which will
26133 not have been thrown away) is needed either to close an
26134 outer template argument list or to complete a new-style
26135 cast. */
26138 }
26140 {
26141 /* If we're in a nested template argument list, the '>>' has
26142 to be a typo for '> >'. We emit the error message, but we
26143 continue parsing and we push a '>' as next token, so that
26144 the argument list will be parsed correctly. Note that the
26145 global source location is still on the token before the
26146 '>>', so we need to say explicitly where we want it. */
26152 }
26153 else
26154 {
26155 /* If this is not a nested template argument list, the '>>'
26156 is a typo for '>'. Emit an error message and continue.
26157 Same deal about the token location, but here we can get it
26158 right by consuming the '>>' before issuing the diagnostic. */
26161 "spurious %<>>%>, use %<>%> to terminate "
26163 }
26164 }
26165 else
26167 /* The `>' token might be a greater-than operator again now. */
26168 parser->greater_than_is_operator_p
26170 /* Restore the SAVED_SCOPE. */
26178 }
26180 /* MEMBER_FUNCTION is a member function, or a friend. If default
26181 arguments, or the body of the function have not yet been parsed,
26182 parse them now. */
26184 static void
26186 {
26188 /* If this member is a template, get the underlying
26189 FUNCTION_DECL. */
26193 /* There should not be any class definitions in progress at this
26194 point; the bodies of members are only parsed outside of all class
26195 definitions. */
26197 /* While we're parsing the member functions we might encounter more
26198 classes. We want to handle them right away, but we don't want
26199 them getting mixed up with functions that are currently in the
26200 queue. */
26203 /* Make sure that any template parameters are in scope. */
26206 /* If the body of the function has not yet been parsed, parse it
26207 now. */
26209 {
26210 tree function_scope;
26213 /* The function is no longer pending; we are processing it. */
26218 /* If this is a local class, enter the scope of the containing
26219 function. */
26224 /* Push the body of the function onto the lexer stack. */
26227 /* Let the front end know that we going to be defining this
26228 function. */
26232 /* Don't do access checking if it is a templated function. */
26236 /* #pragma omp declare reduction needs special parsing. */
26238 {
26243 }
26244 else
26245 /* Now, parse the body of the function. */
26252 /* Leave the scope of the containing function. */
26256 }
26258 /* Remove any template parameters from the symbol table. */
26261 /* Restore the queue. */
26264 }
26266 /* If DECL contains any default args, remember it on the unparsed
26267 functions queue. */
26269 static void
26271 {
26272 tree probe;
26275 probe;
26278 {
26282 }
26283 }
26285 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26286 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26287 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26288 from the parameter-type-list. */
26290 static tree
26293 {
26295 tree parsed_arg;
26301 /* Push the saved tokens for the default argument onto the parser's
26302 lexer stack. */
26308 /* Parse the default argument. */
26319 {
26320 /* In a non-template class, check conversions now. In a template,
26321 we'll wait and instantiate these as needed. */
26324 tf_warning_or_error);
26325 else
26327 }
26329 /* If the token stream has not been completely used up, then
26330 there was extra junk after the end of the default
26331 argument. */
26333 {
26336 else
26338 }
26340 /* Revert to the main lexer. */
26344 }
26346 /* FIELD is a non-static data member with an initializer which we saved for
26347 later; parse it now. */
26349 static void
26351 {
26352 tree def;
26359 NULL_TREE);
26365 }
26367 /* FN is a FUNCTION_DECL which may contains a parameter with an
26368 unparsed DEFAULT_ARG. Parse the default args now. This function
26369 assumes that the current scope is the scope in which the default
26370 argument should be processed. */
26372 static void
26374 {
26378 /* While we're parsing the default args, we might (due to the
26379 statement expression extension) encounter more classes. We want
26380 to handle them right away, but we don't want them getting mixed
26381 up with default args that are currently in the queue. */
26384 /* Local variable names (and the `this' keyword) may not appear
26385 in a default argument. */
26396 {
26398 tree parsed_arg;
26400 tree copy;
26407 /* This can happen for a friend declaration for a function
26408 already declared with default arguments. */
26411 parsed_arg
26413 default_arg,
26416 {
26418 }
26422 /* Update any instantiations we've already created. */
26426 }
26430 /* Make sure no default arg is missing. */
26433 /* Restore the state of local_variables_forbidden_p. */
26436 /* Restore the queue. */
26438 }
26440 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26442 sizeof ... ( identifier )
26444 where the 'sizeof' token has already been consumed. */
26446 static tree
26448 {
26449 /* Consume the `...'. */
26456 else
26464 /* The name is not qualified. */
26483 }
26485 /* Parse the operand of `sizeof' (or a similar operator). Returns
26486 either a TYPE or an expression, depending on the form of the
26487 input. The KEYWORD indicates which kind of expression we have
26488 encountered. */
26490 static tree
26492 {
26499 /* If it's a `...', then we are computing the length of a parameter
26500 pack. */
26505 /* Types cannot be defined in a `sizeof' expression. Save away the
26506 old message. */
26508 /* And create the new one. */
26514 /* The restrictions on constant-expressions do not apply inside
26515 sizeof expressions. */
26516 saved_integral_constant_expression_p
26518 saved_non_integral_constant_expression_p
26522 /* Do not actually evaluate the expression. */
26525 /* If it's a `(', then we might be looking at the type-id
26526 construction. */
26528 {
26531 /* We can't be sure yet whether we're looking at a type-id or an
26532 expression. */
26534 /* Note: as a GNU Extension, compound literals are considered
26535 postfix-expressions as they are in C99, so they are valid
26536 arguments to sizeof. See comment in cp_parser_cast_expression
26537 for details. */
26540 else
26541 {
26544 /* Look for the type-id. */
26546 /* Look for the closing `)'. */
26549 }
26551 /* If all went well, then we're done. */
26553 {
26554 cp_decl_specifier_seq decl_specs;
26556 /* Build a trivial decl-specifier-seq. */
26560 /* Call grokdeclarator to figure out what type this is. */
26563 TYPENAME,
26566 }
26567 }
26569 /* If the type-id production did not work out, then we must be
26570 looking at the unary-expression production. */
26574 /* Go back to evaluating expressions. */
26578 /* Free the message we created. */
26580 /* And restore the old one. */
26582 parser->integral_constant_expression_p
26584 parser->non_integral_constant_expression_p
26588 }
26590 /* If the current declaration has no declarator, return true. */
26592 static bool
26594 {
26595 /* If the next token is a `;' or a `,' then there is no
26596 declarator. */
26599 }
26601 /* Update the DECL_SPECS to reflect the storage class indicated by
26602 KEYWORD. */
26604 static void
26609 {
26610 cp_storage_class storage_class;
26613 {
26617 }
26619 {
26622 }
26627 {
26630 }
26633 {
26651 }
26655 /* A storage class specifier cannot be applied alongside a typedef
26656 specifier. If there is a typedef specifier present then set
26657 conflicting_specifiers_p which will trigger an error later
26658 on in grokdeclarator. */
26661 }
26663 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26664 is true, the type is a class or enum definition. */
26666 static void
26668 tree type_spec,
26671 {
26674 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26675 (with, for example, in "typedef int wchar_t;") we remember that
26676 this is what happened. In system headers, we ignore these
26677 declarations so that G++ can work with system headers that are not
26678 C++-safe. */
26680 && !type_definition_p
26690 {
26693 ds_redefined_builtin_type_spec,
26694 token);
26696 {
26700 }
26701 }
26704 else
26705 {
26710 }
26711 }
26713 /* True iff TOKEN is the GNU keyword __thread. */
26715 static bool
26717 {
26720 }
26722 /* Set the location for a declarator specifier and check if it is
26723 duplicated.
26725 DECL_SPECS is the sequence of declarator specifiers onto which to
26726 set the location.
26728 DS is the single declarator specifier to set which location is to
26729 be set onto the existing sequence of declarators.
26731 LOCATION is the location for the declarator specifier to
26732 consider. */
26734 static void
26737 {
26746 {
26750 }
26751 else
26752 {
26754 {
26758 else
26759 {
26762 OPT_Wlong_long,
26764 }
26765 }
26767 {
26772 else
26774 }
26775 else
26776 {
26792 "__complex"
26793 };
26796 }
26797 }
26798 }
26800 /* Return true iff the declarator specifier DS is present in the
26801 sequence of declarator specifiers DECL_SPECS. */
26803 bool
26805 cp_decl_spec ds)
26806 {
26813 }
26815 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26816 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26818 static bool
26820 {
26822 }
26824 /* Issue an error message indicating that TOKEN_DESC was expected.
26825 If KEYWORD is true, it indicated this function is called by
26826 cp_parser_require_keword and the required token can only be
26827 a indicated keyword. */
26829 static void
26831 required_token token_desc,
26833 {
26835 {
26904 }
26906 {
26908 {
26987 }
26988 }
26989 else
26991 }
26995 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26996 issue an error message indicating that TOKEN_DESC was expected.
26998 Returns the token consumed, if the token had the appropriate type.
26999 Otherwise, returns NULL. */
27004 required_token token_desc)
27005 {
27008 else
27009 {
27010 /* Output the MESSAGE -- unless we're parsing tentatively. */
27014 }
27015 }
27017 /* An error message is produced if the next token is not '>'.
27018 All further tokens are skipped until the desired token is
27019 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27021 static void
27023 {
27024 /* Current level of '< ... >'. */
27026 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27029 /* Are we ready, yet? If not, issue error message. */
27033 /* Skip tokens until the desired token is found. */
27035 {
27036 /* Peek at the next token. */
27038 {
27046 /* C++0x views the `>>' operator as two `>' tokens, but
27047 C++98 does not. */
27050 {
27051 /* We've hit a `>>' where the first `>' closes the
27052 template argument list, and the second `>' is
27053 spurious. Just consume the `>>' and stop; we've
27054 already produced at least one error. */
27057 }
27058 /* Fall through for C++0x, so we handle the second `>' in
27059 the `>>'. */
27063 {
27064 /* We've reached the token we want, consume it and stop. */
27067 }
27086 /* The '>' was probably forgotten, don't look further. */
27091 }
27093 /* Consume this token. */
27095 }
27096 }
27098 /* If the next token is the indicated keyword, consume it. Otherwise,
27099 issue an error message indicating that TOKEN_DESC was expected.
27101 Returns the token consumed, if the token had the appropriate type.
27102 Otherwise, returns NULL. */
27107 required_token token_desc)
27108 {
27112 {
27115 }
27118 }
27120 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27121 function-definition. */
27123 static bool
27125 {
27128 /* A ctor-initializer begins with a `:'. */
27130 /* A function-try-block begins with `try'. */
27132 /* A function-transaction-block begins with `__transaction_atomic'
27133 or `__transaction_relaxed'. */
27136 /* The named return value extension begins with `return'. */
27138 }
27140 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27141 definition. */
27143 static bool
27145 {
27152 }
27154 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27155 C++0x) ending a template-argument. */
27157 static bool
27159 {
27167 }
27169 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27170 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27172 static bool
27175 {
27181 /* Check for the sequence `<::' in the original code. It would be lexed as
27182 `[:', where `[' is a digraph, and there is no whitespace before
27183 `:'. */
27185 {
27190 }
27192 }
27194 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27195 or none_type otherwise. */
27197 static enum tag_types
27199 {
27201 {
27211 }
27212 }
27214 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27215 or none_type otherwise or if the token is null. */
27217 static enum tag_types
27219 {
27224 {
27232 }
27233 }
27235 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27237 static void
27239 {
27243 {
27247 type))
27250 }
27251 }
27253 /* Issue an error message if DECL is redeclared with different
27254 access than its original declaration [class.access.spec/3].
27255 This applies to nested classes, nested class templates and
27256 enumerations [class.mem/1]. */
27258 static void
27260 {
27271 }
27273 /* Look for the `template' keyword, as a syntactic disambiguator.
27274 Return TRUE iff it is present, in which case it will be
27275 consumed. */
27277 static bool
27279 {
27281 {
27282 /* In C++98 the `template' keyword can only be used within templates;
27283 outside templates the parser can always figure out what is a
27284 template and what is not. In C++11, per the resolution of DR 468,
27285 `template' is allowed in cases where it is not strictly necessary. */
27288 {
27291 "in C++98 %<template%> (as a disambiguator) is only "
27293 /* If this part of the token stream is rescanned, the same
27294 error message would be generated. So, we purge the token
27295 from the stream. */
27298 }
27299 else
27300 {
27301 /* Consume the `template' keyword. */
27304 }
27305 }
27307 }
27309 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27310 set PARSER->SCOPE, and perform other related actions. */
27312 static void
27314 {
27317 /* Get the stored value. */
27319 /* Set the scope from the stored value. */
27323 }
27325 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27326 encounter the end of a block before what we were looking for. */
27328 static bool
27332 {
27334 {
27337 /* Abort a parenthesized expression if we encounter a semicolon. */
27341 /* If we've reached the end of the file, stop. */
27347 /* We've hit the end of an enclosing block, so there's been some
27348 kind of syntax error. */
27351 /* Consume the token. */
27353 /* See if it starts a new group. */
27355 {
27357 /* In theory this should probably check end == '}', but
27358 cp_parser_save_member_function_body needs it to exit
27359 after either '}' or ')' when called with ')'. */
27362 }
27364 {
27368 }
27373 }
27374 }
27376 /* Like above, for caching a default argument or NSDMI. Both of these are
27377 terminated by a non-nested comma, but it can be unclear whether or not a
27378 comma is nested in a template argument list unless we do more parsing.
27379 In order to handle this ambiguity, when we encounter a ',' after a '<'
27380 we try to parse what follows as a parameter-declaration-list (in the
27381 case of a default argument) or a member-declarator (in the case of an
27382 NSDMI). If that succeeds, then we stop caching. */
27384 static tree
27386 {
27391 tree default_argument;
27393 /* Add tokens until we have processed the entire default
27394 argument. We add the range [first_token, token). */
27397 {
27398 /* For list-initialization, this is straightforward. */
27401 }
27403 {
27406 /* Peek at the next token. */
27408 /* What we do depends on what token we have. */
27410 {
27411 /* In valid code, a default argument must be
27412 immediately followed by a `,' `)', or `...'. */
27415 {
27416 /* If we've seen a '<', we might be in a
27417 template-argument-list. Until Core issue 325 is
27418 resolved, we don't know how this situation ought
27419 to be handled, so try to DTRT. We check whether
27420 what comes after the comma is a valid parameter
27421 declaration list. If it is, then the comma ends
27422 the default argument; otherwise the default
27423 argument continues. */
27427 /* Set ITALP so cp_parser_parameter_declaration_list
27428 doesn't decide to commit to this parse. */
27435 {
27436 /* Parse declarators until we reach a non-comma or
27437 somthing that cannot be an initializer.
27438 Just checking whether we're looking at a single
27439 declarator is insufficient. Consider:
27440 int var = tuple<T,U>::x;
27441 The template parameter 'U' looks exactly like a
27442 declarator. */
27443 do
27444 {
27455 }
27457 /* If we met an '=' or ';' then the original comma
27458 was the end of the NSDMI. Otherwise assume
27459 we're still in the NSDMI. */
27462 }
27463 else
27464 {
27469 }
27476 }
27479 /* If we run into a non-nested `;', `}', or `]',
27480 then the code is invalid -- but the default
27481 argument is certainly over. */
27486 /* Handle correctly int n = sizeof ... ( p ); */
27489 /* Update DEPTH, if necessary. */
27504 /* This might be the comparison operator, or it might
27505 start a template argument list. */
27512 /* Fall through for C++0x, which treats the `>>'
27513 operator like two `>' tokens in certain
27514 cases. */
27518 {
27519 /* This might be an operator, or it might close a
27520 template argument list. But if a previous '<'
27521 started a template argument list, this will have
27522 closed it, so we can't be in one anymore. */
27526 }
27529 /* If we run out of tokens, issue an error message. */
27537 /* In these cases, we should look for template-ids.
27538 For example, if the default argument is
27539 `X<int, double>()', we need to do name lookup to
27540 figure out whether or not `X' is a template; if
27541 so, the `,' does not end the default argument.
27543 That is not yet done. */
27548 }
27550 /* If we've reached the end, stop. */
27554 /* Add the token to the token block. */
27556 }
27558 /* Create a DEFAULT_ARG to represent the unparsed default
27559 argument. */
27566 }
27568 /* Begin parsing tentatively. We always save tokens while parsing
27569 tentatively so that if the tentative parsing fails we can restore the
27570 tokens. */
27572 static void
27574 {
27575 /* Enter a new parsing context. */
27577 /* Begin saving tokens. */
27579 /* In order to avoid repetitive access control error messages,
27580 access checks are queued up until we are no longer parsing
27581 tentatively. */
27583 }
27585 /* Commit to the currently active tentative parse. */
27587 static void
27589 {
27593 /* Mark all of the levels as committed. */
27596 {
27603 }
27604 }
27606 /* Commit to the topmost currently active tentative parse.
27608 Note that this function shouldn't be called when there are
27609 irreversible side-effects while in a tentative state. For
27610 example, we shouldn't create a permanent entry in the symbol
27611 table, or issue an error message that might not apply if the
27612 tentative parse is aborted. */
27614 static void
27616 {
27621 {
27629 }
27630 }
27632 /* Abort the currently active tentative parse. All consumed tokens
27633 will be rolled back, and no diagnostics will be issued. */
27635 static void
27637 {
27641 /* Now, pretend that we want to see if the construct was
27642 successfully parsed. */
27644 }
27646 /* Stop parsing tentatively. If a parse error has occurred, restore the
27647 token stream. Otherwise, commit to the tokens we have consumed.
27648 Returns true if no error occurred; false otherwise. */
27650 static bool
27652 {
27656 /* Remember whether or not an error occurred, since we are about to
27657 destroy that information. */
27659 /* Remove the topmost context from the stack. */
27662 /* If no parse errors occurred, commit to the tentative parse. */
27664 {
27665 /* Commit to the tokens read tentatively, unless that was
27666 already done. */
27671 }
27672 /* Otherwise, if errors occurred, roll back our state so that things
27673 are just as they were before we began the tentative parse. */
27674 else
27675 {
27678 }
27679 /* Add the context to the front of the free list. */
27684 }
27686 /* Returns true if we are parsing tentatively and are not committed to
27687 this tentative parse. */
27689 static bool
27691 {
27694 }
27696 /* Returns nonzero iff an error has occurred during the most recent
27697 tentative parse. */
27699 static bool
27701 {
27704 }
27706 /* Returns nonzero if GNU extensions are allowed. */
27708 static bool
27710 {
27712 }
27713 \f
27714 /* Objective-C++ Productions */
27717 /* Parse an Objective-C expression, which feeds into a primary-expression
27718 above.
27720 objc-expression:
27721 objc-message-expression
27722 objc-string-literal
27723 objc-encode-expression
27724 objc-protocol-expression
27725 objc-selector-expression
27727 Returns a tree representation of the expression. */
27729 static cp_expr
27731 {
27732 /* Try to figure out what kind of declaration is present. */
27736 {
27746 {
27758 }
27764 }
27767 }
27769 /* Parse an Objective-C message expression.
27771 objc-message-expression:
27772 [ objc-message-receiver objc-message-args ]
27774 Returns a representation of an Objective-C message. */
27776 static tree
27778 {
27790 /* Construct a location e.g.
27791 [self func1:5]
27792 ^~~~~~~~~~~~~~
27793 ranging from the '[' to the ']', with the caret at the start. */
27798 }
27800 /* Parse an objc-message-receiver.
27802 objc-message-receiver:
27803 expression
27804 simple-type-specifier
27806 Returns a representation of the type or expression. */
27808 static tree
27810 {
27811 tree rcv;
27813 /* An Objective-C message receiver may be either (1) a type
27814 or (2) an expression. */
27818 /* If that worked out, fine. */
27825 CP_PARSER_FLAGS_NONE);
27832 }
27834 /* Parse the arguments and selectors comprising an Objective-C message.
27836 objc-message-args:
27837 objc-selector
27838 objc-selector-args
27839 objc-selector-args , objc-comma-args
27841 objc-selector-args:
27842 objc-selector [opt] : assignment-expression
27843 objc-selector-args objc-selector [opt] : assignment-expression
27845 objc-comma-args:
27846 assignment-expression
27847 objc-comma-args , assignment-expression
27849 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27850 selector arguments and TREE_VALUE containing a list of comma
27851 arguments. */
27853 static tree
27855 {
27861 {
27867 /* Detect if we have a unary selector. */
27876 sel_args
27881 }
27883 /* Handle non-selector arguments, if any. */
27885 {
27886 tree arg;
27891 addl_args
27896 }
27899 {
27902 }
27905 }
27907 /* Parse an Objective-C encode expression.
27909 objc-encode-expression:
27910 @encode objc-typename
27912 Returns an encoded representation of the type argument. */
27914 static cp_expr
27916 {
27917 tree type;
27928 {
27932 }
27934 /* This happens if we find @encode(T) (where T is a template
27935 typename or something dependent on a template typename) when
27936 parsing a template. In that case, we can't compile it
27937 immediately, but we rather create an AT_ENCODE_EXPR which will
27938 need to be instantiated when the template is used.
27939 */
27941 {
27945 }
27948 /* Build a location of the form:
27949 @encode(int)
27950 ^~~~~~~~~~~~
27951 with caret==start at the @ token, finishing at the close paren. */
27952 location_t combined_loc
27957 }
27959 /* Parse an Objective-C @defs expression. */
27961 static tree
27963 {
27964 tree name;
27972 }
27974 /* Parse an Objective-C protocol expression.
27976 objc-protocol-expression:
27977 @protocol ( identifier )
27979 Returns a representation of the protocol expression. */
27981 static tree
27983 {
27984 tree proto;
27992 /* Build a location of the form:
27993 @protocol(prot)
27994 ^~~~~~~~~~~~~~~
27995 with caret==start at the @ token, finishing at the close paren. */
27996 location_t combined_loc
28002 }
28004 /* Parse an Objective-C selector expression.
28006 objc-selector-expression:
28007 @selector ( objc-method-signature )
28009 objc-method-signature:
28010 objc-selector
28011 objc-selector-seq
28013 objc-selector-seq:
28014 objc-selector :
28015 objc-selector-seq objc-selector :
28017 Returns a representation of the method selector. */
28019 static tree
28021 {
28033 {
28042 {
28043 /* Detect if we have a unary selector. */
28045 {
28048 }
28049 else
28050 {
28052 }
28053 }
28058 {
28059 sel_seq
28062 sel_seq
28065 }
28066 else
28067 sel_seq
28072 }
28074 finish_selector:
28078 /* Build a location of the form:
28079 @selector(func)
28080 ^~~~~~~~~~~~~~~
28081 with caret==start at the @ token, finishing at the close paren. */
28082 location_t combined_loc
28086 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28089 }
28091 /* Parse a list of identifiers.
28093 objc-identifier-list:
28094 identifier
28095 objc-identifier-list , identifier
28097 Returns a TREE_LIST of identifier nodes. */
28099 static tree
28101 {
28102 tree identifier;
28103 tree list;
28114 {
28121 identifier));
28123 }
28126 }
28128 /* Parse an Objective-C alias declaration.
28130 objc-alias-declaration:
28131 @compatibility_alias identifier identifier ;
28133 This function registers the alias mapping with the Objective-C front end.
28134 It returns nothing. */
28136 static void
28138 {
28146 }
28148 /* Parse an Objective-C class forward-declaration.
28150 objc-class-declaration:
28151 @class objc-identifier-list ;
28153 The function registers the forward declarations with the Objective-C
28154 front end. It returns nothing. */
28156 static void
28158 {
28161 {
28162 tree id;
28172 else
28174 }
28176 }
28178 /* Parse a list of Objective-C protocol references.
28180 objc-protocol-refs-opt:
28181 objc-protocol-refs [opt]
28183 objc-protocol-refs:
28184 < objc-identifier-list >
28186 Returns a TREE_LIST of identifiers, if any. */
28188 static tree
28190 {
28194 {
28198 }
28201 }
28203 /* Parse a Objective-C visibility specification. */
28205 static void
28207 {
28211 {
28226 }
28228 /* Eat '@private'/'@protected'/'@public'. */
28230 }
28232 /* Parse an Objective-C method type. Return 'true' if it is a class
28233 (+) method, and 'false' if it is an instance (-) method. */
28237 {
28240 else
28242 }
28244 /* Parse an Objective-C protocol qualifier. */
28246 static tree
28248 {
28261 {
28266 }
28269 }
28271 /* Parse an Objective-C typename. */
28273 static tree
28275 {
28279 {
28285 /* An ObjC type name may consist of just protocol qualifiers, in which
28286 case the type shall default to 'id'. */
28288 {
28291 /* If the type could not be parsed, an error has already
28292 been produced. For error recovery, behave as if it had
28293 not been specified, which will use the default type
28294 'id'. */
28296 {
28298 /* We need to skip to the closing parenthesis as
28299 cp_parser_type_id() does not seem to do it for
28300 us. */
28305 }
28306 }
28310 }
28313 }
28315 /* Check to see if TYPE refers to an Objective-C selector name. */
28317 static bool
28319 {
28325 }
28327 /* Parse an Objective-C selector. */
28329 static tree
28331 {
28335 {
28338 }
28340 /* C++ operator names are allowed to appear in ObjC selectors. */
28342 {
28355 }
28356 }
28358 /* Parse an Objective-C params list. */
28360 static tree
28362 {
28368 {
28378 /* Detect if we have a unary selector. */
28381 {
28384 }
28388 {
28389 /* Something went quite wrong. There should be a colon
28390 here, but there is not. Stop parsing parameters. */
28392 }
28394 /* New ObjC allows attributes on parameters too. */
28399 params
28402 type_name,
28403 identifier,
28404 parm_attr));
28407 }
28410 {
28413 }
28415 /* We allow tail attributes for the method. */
28417 {
28425 }
28428 {
28431 }
28433 }
28435 /* Parse the non-keyword Objective-C params. */
28437 static tree
28440 {
28446 {
28448 tree parm;
28454 {
28459 }
28461 /* TODO: parse attributes for tail parameters. */
28470 }
28472 /* We allow tail attributes for the method. */
28474 {
28476 {
28481 }
28482 else
28483 /* We have an error, but parse the attributes, so that we can
28484 carry on. */
28490 }
28493 }
28495 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28497 static void
28499 {
28502 /* If the next token is `extern' and the following token is a string
28503 literal, then we have a linkage specification. */
28505 && cp_parser_is_pure_string_literal
28508 /* Handle #pragma, if any. */
28511 /* Allow stray semicolons. */
28514 /* Mark methods as optional or required, when building protocols. */
28516 {
28519 }
28521 {
28524 }
28527 /* Other stray characters must generate errors. */
28529 {
28533 }
28534 /* Finally, try to parse a block-declaration, or a function-definition. */
28535 else
28537 }
28539 /* Parse a method signature. */
28541 static tree
28543 {
28559 }
28561 static bool
28563 {
28564 tree tattr;
28569 /* If the attributes are followed by a method introducer, this is not allowed.
28570 Dump the attributes and flag the situation. */
28575 /* Otherwise, the attributes introduce some interstitial code, possibly so
28576 rewind to allow that check. */
28579 }
28581 /* Parse an Objective-C method prototype list. */
28583 static void
28585 {
28589 {
28591 {
28596 else
28600 {
28604 }
28607 }
28613 OPT_Wattributes,
28615 else
28616 /* Allow for interspersed non-ObjC++ code. */
28620 }
28624 else
28628 }
28630 /* Parse an Objective-C method definition list. */
28632 static void
28634 {
28638 {
28639 tree meth;
28642 {
28648 else
28653 {
28657 }
28659 NULL_TREE);
28661 /* For historical reasons, we accept an optional semicolon. */
28668 {
28675 }
28676 }
28677 /* The following case will be removed once @synthesize is
28678 completely implemented. */
28689 else
28690 /* Allow for interspersed non-ObjC++ code. */
28694 }
28698 else
28702 }
28704 /* Parse Objective-C ivars. */
28706 static void
28708 {
28719 {
28720 cp_decl_specifier_seq declspecs;
28722 tree prefix_attributes;
28730 CP_PARSER_FLAGS_OPTIONAL,
28734 /* auto, register, static, extern, mutable. */
28736 {
28739 }
28741 /* thread_local. */
28743 {
28746 }
28748 /* typedef. */
28750 {
28753 }
28758 /* Keep going until we hit the `;' at the end of the
28759 declaration. */
28761 {
28766 /* Check for a (possibly unnamed) bitfield declaration. */
28774 {
28775 /* Get the name of the bitfield. */
28778 sfk_none);
28780 eat_colon:
28782 /* Get the width of the bitfield. */
28783 width
28785 }
28786 else
28787 {
28788 /* Parse the declarator. */
28789 declarator
28795 }
28797 /* Look for attributes that apply to the ivar. */
28799 /* Remember which attributes are prefix attributes and
28800 which are not. */
28802 /* Combine the attributes. */
28806 /* Create the bitfield declaration. */
28808 width,
28809 attributes);
28810 else
28815 /* Add the instance variable. */
28819 /* Reset PREFIX_ATTRIBUTES. */
28828 {
28831 }
28833 }
28837 }
28842 /* Do not consume the RID_AT_END, so it will be read again as terminating
28843 the @interface of @implementation. */
28847 /* For historical reasons, we accept an optional semicolon. */
28850 }
28852 /* Parse an Objective-C protocol declaration. */
28854 static void
28856 {
28862 {
28867 }
28869 /* See if we have a forward declaration or a definition. */
28872 /* Try a forward declaration first. */
28874 {
28876 {
28877 tree id;
28887 else
28889 }
28891 }
28893 /* Ok, we got a full-fledged definition (or at least should). */
28894 else
28895 {
28900 }
28901 }
28903 /* Parse an Objective-C superclass or category. */
28905 static void
28910 {
28916 {
28919 }
28921 {
28924 /* If there is no category name, and this is an @interface, we
28925 have a class extension. */
28927 {
28930 }
28931 else
28935 }
28936 }
28938 /* Parse an Objective-C class interface. */
28940 static void
28942 {
28949 {
28950 /* It's hard to recover because even if valid @interface stuff
28951 is to follow, we can't compile it (or validate it) if we
28952 don't even know which class it refers to. Let's assume this
28953 was a stray '@interface' token in the stream and skip it.
28954 */
28956 }
28961 /* We have either a class or a category on our hands. */
28964 else
28965 {
28967 /* Handle instance variable declarations, if any. */
28970 }
28973 }
28975 /* Parse an Objective-C class implementation. */
28977 static void
28979 {
28986 {
28987 /* It's hard to recover because even if valid @implementation
28988 stuff is to follow, we can't compile it (or validate it) if
28989 we don't even know which class it refers to. Let's assume
28990 this was a stray '@implementation' token in the stream and
28991 skip it.
28992 */
28994 }
28998 /* We have either a class or a category on our hands. */
29001 else
29002 {
29004 /* Handle instance variable declarations, if any. */
29007 }
29010 }
29012 /* Consume the @end token and finish off the implementation. */
29014 static void
29016 {
29019 }
29021 /* Parse an Objective-C declaration. */
29023 static void
29025 {
29026 /* Try to figure out what kind of declaration is present. */
29031 {
29047 }
29050 {
29073 }
29074 }
29076 /* Parse an Objective-C try-catch-finally statement.
29078 objc-try-catch-finally-stmt:
29079 @try compound-statement objc-catch-clause-seq [opt]
29080 objc-finally-clause [opt]
29082 objc-catch-clause-seq:
29083 objc-catch-clause objc-catch-clause-seq [opt]
29085 objc-catch-clause:
29086 @catch ( objc-exception-declaration ) compound-statement
29088 objc-finally-clause:
29089 @finally compound-statement
29091 objc-exception-declaration:
29092 parameter-declaration
29093 '...'
29095 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29097 Returns NULL_TREE.
29099 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29100 for C. Keep them in sync. */
29102 static tree
29104 {
29105 location_t location;
29106 tree stmt;
29111 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29112 node, lest it get absorbed into the surrounding block. */
29118 {
29127 {
29128 /* We have "@catch (...)" (where the '...' are literally
29129 what is in the code). Skip the '...'.
29130 parameter_declaration is set to NULL_TREE, and
29131 objc_being_catch_clauses() knows that that means
29132 '...'. */
29135 }
29136 else
29137 {
29138 /* We have "@catch (NSException *exception)" or something
29139 like that. Parse the parameter declaration. */
29143 else
29148 }
29151 else
29152 {
29153 /* If there was no open parenthesis, we are recovering from
29154 an error, and we are trying to figure out what mistake
29155 the user has made. */
29157 /* If there is an immediate closing parenthesis, the user
29158 probably forgot the opening one (ie, they typed "@catch
29159 NSException *e)". Parse the closing parenthesis and keep
29160 going. */
29164 /* If these is no immediate closing parenthesis, the user
29165 probably doesn't know that parenthesis are required at
29166 all (ie, they typed "@catch NSException *e"). So, just
29167 forget about the closing parenthesis and keep going. */
29168 }
29172 }
29174 {
29177 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29178 node, lest it get absorbed into the surrounding block. */
29182 }
29185 }
29187 /* Parse an Objective-C synchronized statement.
29189 objc-synchronized-stmt:
29190 @synchronized ( expression ) compound-statement
29192 Returns NULL_TREE. */
29194 static tree
29196 {
29197 location_t location;
29208 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29209 node, lest it get absorbed into the surrounding block. */
29214 }
29216 /* Parse an Objective-C throw statement.
29218 objc-throw-stmt:
29219 @throw assignment-expression [opt] ;
29221 Returns a constructed '@throw' statement. */
29223 static tree
29225 {
29237 }
29239 /* Parse an Objective-C statement. */
29241 static tree
29243 {
29244 /* Try to figure out what kind of declaration is present. */
29248 {
29259 }
29262 }
29264 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29265 look ahead to see if an objc keyword follows the attributes. This
29266 is to detect the use of prefix attributes on ObjC @interface and
29267 @protocol. */
29269 static bool
29271 {
29276 {
29279 }
29282 }
29284 /* This routine is a minimal replacement for
29285 c_parser_struct_declaration () used when parsing the list of
29286 types/names or ObjC++ properties. For example, when parsing the
29287 code
29289 @property (readonly) int a, b, c;
29291 this function is responsible for parsing "int a, int b, int c" and
29292 returning the declarations as CHAIN of DECLs.
29294 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29295 similar parsing. */
29296 static tree
29298 {
29300 cp_decl_specifier_seq declspecs;
29302 tree prefix_attributes;
29305 CP_PARSER_FLAGS_NONE,
29312 /* auto, register, static, extern, mutable. */
29314 {
29317 }
29319 /* thread_local. */
29321 {
29324 }
29326 /* typedef. */
29328 {
29331 }
29336 /* Keep going until we hit the `;' at the end of the declaration. */
29338 {
29343 /* Parse the declarator. */
29347 /* Look for attributes that apply to the ivar. */
29349 /* Remember which attributes are prefix attributes and
29350 which are not. */
29352 /* Combine the attributes. */
29362 /* Reset PREFIX_ATTRIBUTES. */
29373 {
29376 }
29377 else
29379 }
29381 }
29383 /* Parse an Objective-C @property declaration. The syntax is:
29385 objc-property-declaration:
29386 '@property' objc-property-attributes[opt] struct-declaration ;
29388 objc-property-attributes:
29389 '(' objc-property-attribute-list ')'
29391 objc-property-attribute-list:
29392 objc-property-attribute
29393 objc-property-attribute-list, objc-property-attribute
29395 objc-property-attribute
29396 'getter' = identifier
29397 'setter' = identifier
29398 'readonly'
29399 'readwrite'
29400 'assign'
29401 'retain'
29402 'copy'
29403 'nonatomic'
29405 For example:
29406 @property NSString *name;
29407 @property (readonly) id object;
29408 @property (retain, nonatomic, getter=getTheName) id name;
29409 @property int a, b, c;
29411 PS: This function is identical to
29412 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29413 static void
29415 {
29416 /* The following variables hold the attributes of the properties as
29417 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29418 seen. When we see an attribute, we set them to 'true' (if they
29419 are boolean properties) or to the identifier (if they have an
29420 argument, ie, for getter and setter). Note that here we only
29421 parse the list of attributes, check the syntax and accumulate the
29422 attributes that we find. objc_add_property_declaration() will
29423 then process the information. */
29433 /* 'properties' is the list of properties that we read. Usually a
29434 single one, but maybe more (eg, in "@property int a, b, c;" there
29435 are three). */
29436 tree properties;
29437 location_t loc;
29443 /* Parse the optional attribute list... */
29445 {
29446 /* Eat the '('. */
29450 {
29456 {
29459 }
29463 {
29474 {
29478 else
29483 }
29486 {
29490 }
29492 {
29494 {
29497 }
29498 else
29502 else
29504 }
29505 else
29506 {
29508 {
29511 }
29512 else
29514 }
29520 }
29527 else
29529 }
29531 /* FIXME: "@property (setter, assign);" will generate a spurious
29532 "error: expected ‘)’ before ‘,’ token". This is because
29533 cp_parser_require, unlike the C counterpart, will produce an
29534 error even if we are in error recovery. */
29536 {
29541 }
29542 }
29544 /* ... and the property declaration(s). */
29548 {
29550 /* If the next token is now a `;', consume it. */
29554 }
29558 else
29559 {
29560 /* Comma-separated properties are chained together in
29561 reverse order; add them one by one. */
29570 }
29573 }
29575 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29577 objc-synthesize-declaration:
29578 @synthesize objc-synthesize-identifier-list ;
29580 objc-synthesize-identifier-list:
29581 objc-synthesize-identifier
29582 objc-synthesize-identifier-list, objc-synthesize-identifier
29584 objc-synthesize-identifier
29585 identifier
29586 identifier = identifier
29588 For example:
29589 @synthesize MyProperty;
29590 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29592 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29593 for C. Keep them in sync.
29594 */
29595 static void
29597 {
29599 location_t loc;
29604 {
29608 {
29611 }
29613 {
29617 {
29620 }
29621 }
29622 else
29627 else
29629 }
29632 }
29634 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29636 objc-dynamic-declaration:
29637 @dynamic identifier-list ;
29639 For example:
29640 @dynamic MyProperty;
29641 @dynamic MyProperty, AnotherProperty;
29643 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29644 for C. Keep them in sync.
29645 */
29646 static void
29648 {
29650 location_t loc;
29655 {
29656 tree property;
29659 {
29662 }
29666 else
29668 }
29671 }
29673 \f
29674 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29676 /* Returns name of the next clause.
29677 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29678 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29679 returned and the token is consumed. */
29681 static pragma_omp_clause
29683 {
29699 {
29704 {
29887 }
29888 }
29894 }
29896 /* Validate that a clause of the given type does not already exist. */
29898 static void
29901 {
29902 tree c;
29906 {
29909 }
29910 }
29912 /* OpenMP 2.5:
29913 variable-list:
29914 identifier
29915 variable-list , identifier
29917 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29918 colon). An opening parenthesis will have been consumed by the caller.
29920 If KIND is nonzero, create the appropriate node and install the decl
29921 in OMP_CLAUSE_DECL and add the node to the head of the list.
29923 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29924 return the list created.
29926 COLON can be NULL if only closing parenthesis should end the list,
29927 or pointer to bool which will receive false if the list is terminated
29928 by closing parenthesis or true if the list is terminated by colon. */
29930 static tree
29933 {
29937 {
29940 }
29942 {
29947 && current_class_ptr
29949 {
29955 }
29956 else
29957 {
29970 }
29972 ;
29974 {
29976 {
29979 {
29983 }
29984 /* FALLTHROUGH. */
29989 {
29990 location_t loc
29994 decl
29998 }
29999 /* FALLTHROUGH. */
30003 {
30011 parser->colon_corrects_to_scope_p
30015 else
30016 {
30017 /* Look for `:'. */
30021 CPP_CLOSE_SQUARE))
30023 }
30024 /* Look for the closing `]'. */
30026 RT_CLOSE_SQUARE))
30030 {
30033 {
30037 }
30041 {
30045 }
30046 }
30049 }
30053 }
30059 }
30060 else
30063 get_comma:
30067 }
30073 {
30077 }
30080 {
30083 /* Try to resync to an unnested comma. Copied from
30084 cp_parser_parenthesized_expression_list. */
30085 skip_comma:
30094 }
30097 }
30099 /* Similarly, but expect leading and trailing parenthesis. This is a very
30100 common case for omp clauses. */
30102 static tree
30104 {
30108 }
30110 /* OpenACC 2.0:
30111 copy ( variable-list )
30112 copyin ( variable-list )
30113 copyout ( variable-list )
30114 create ( variable-list )
30115 delete ( variable-list )
30116 present ( variable-list )
30117 present_or_copy ( variable-list )
30118 pcopy ( variable-list )
30119 present_or_copyin ( variable-list )
30120 pcopyin ( variable-list )
30121 present_or_copyout ( variable-list )
30122 pcopyout ( variable-list )
30123 present_or_create ( variable-list )
30124 pcreate ( variable-list ) */
30126 static tree
30128 tree list)
30129 {
30132 {
30178 }
30186 }
30188 /* OpenACC 2.0:
30189 deviceptr ( variable-list ) */
30191 static tree
30193 {
30197 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30198 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30199 variable-list must only allow for pointer variables. */
30202 {
30209 }
30212 }
30214 /* OpenACC 2.0:
30215 auto
30216 independent
30217 nohost
30218 seq */
30220 static tree
30224 {
30229 }
30231 /* OpenACC:
30232 num_gangs ( expression )
30233 num_workers ( expression )
30234 vector_length ( expression ) */
30236 static tree
30239 {
30249 {
30254 }
30262 }
30264 /* OpenACC:
30266 gang [( gang-arg-list )]
30267 worker [( [num:] int-expr )]
30268 vector [( [length:] int-expr )]
30270 where gang-arg is one of:
30272 [num:] int-expr
30273 static: size-expr
30275 and size-expr may be:
30277 *
30278 int-expr
30279 */
30281 static tree
30284 {
30294 {
30297 do
30298 {
30302 /* Gang static argument. */
30305 {
30313 {
30316 }
30318 /* Check for the '*' argument. */
30322 CPP_CLOSE_PAREN)))
30323 {
30328 {
30331 }
30333 }
30334 }
30335 /* Worker num: argument and vector length: arguments. */
30339 {
30342 }
30344 /* Now collect the actual argument. */
30346 {
30349 }
30361 {
30364 }
30366 }
30371 }
30385 cleanup_error:
30388 }
30390 /* OpenACC 2.0:
30391 tile ( size-expr-list ) */
30393 static tree
30395 {
30404 do
30405 {
30409 {
30412 }
30413 else
30423 }
30426 /* Consume the trailing ')'. */
30434 }
30436 /* OpenACC 2.0
30437 Parse wait clause or directive parameters. */
30439 static tree
30441 {
30451 {
30456 }
30463 {
30467 {
30470 else
30471 {
30478 }
30479 }
30480 }
30483 }
30485 /* OpenACC:
30486 wait ( int-expr-list ) */
30488 static tree
30490 {
30499 }
30501 /* OpenMP 3.0:
30502 collapse ( constant-expression ) */
30504 static tree
30506 {
30508 location_t loc;
30509 HOST_WIDE_INT n;
30529 {
30532 }
30540 }
30542 /* OpenMP 2.5:
30543 default ( shared | none )
30545 OpenACC 2.0
30546 default (none) */
30548 static tree
30551 {
30553 tree c;
30558 {
30563 {
30578 }
30581 }
30582 else
30583 {
30584 invalid_kind:
30587 else
30589 }
30605 }
30607 /* OpenMP 3.1:
30608 final ( expression ) */
30610 static tree
30612 {
30633 }
30635 /* OpenMP 2.5:
30636 if ( expression )
30638 OpenMP 4.5:
30639 if ( directive-name-modifier : expression )
30641 directive-name-modifier:
30642 parallel | task | taskloop | target data | target | target update
30643 | target enter data | target exit data */
30645 static tree
30648 {
30656 {
30668 {
30671 {
30684 else
30685 {
30686 location_t loc
30691 }
30694 {
30696 {
30701 }
30703 {
30704 location_t loc
30708 }
30709 }
30710 }
30711 }
30713 {
30715 {
30718 }
30719 else
30720 {
30722 {
30723 location_t loc
30726 }
30728 }
30729 }
30730 }
30742 {
30745 {
30748 {
30758 }
30760 p);
30762 }
30764 {
30767 else
30770 }
30773 {
30777 }
30778 }
30786 }
30788 /* OpenMP 3.1:
30789 mergeable */
30791 static tree
30794 {
30795 tree c;
30798 location);
30803 }
30805 /* OpenMP 2.5:
30806 nowait */
30808 static tree
30811 {
30812 tree c;
30819 }
30821 /* OpenMP 2.5:
30822 num_threads ( expression ) */
30824 static tree
30826 location_t location)
30827 {
30849 }
30851 /* OpenMP 4.5:
30852 num_tasks ( expression ) */
30854 static tree
30856 location_t location)
30857 {
30879 }
30881 /* OpenMP 4.5:
30882 grainsize ( expression ) */
30884 static tree
30886 location_t location)
30887 {
30909 }
30911 /* OpenMP 4.5:
30912 priority ( expression ) */
30914 static tree
30916 location_t location)
30917 {
30939 }
30941 /* OpenMP 4.5:
30942 hint ( expression ) */
30944 static tree
30946 location_t location)
30947 {
30968 }
30970 /* OpenMP 4.5:
30971 defaultmap ( tofrom : scalar ) */
30973 static tree
30975 location_t location)
30976 {
30984 {
30987 }
30991 {
30994 }
31000 {
31003 }
31007 {
31010 }
31016 location);
31022 out_err:
31027 }
31029 /* OpenMP 2.5:
31030 ordered
31032 OpenMP 4.5:
31033 ordered ( constant-expression ) */
31035 static tree
31038 {
31040 HOST_WIDE_INT n;
31046 {
31063 {
31065 "ordered argument needs positive constant integer "
31068 }
31069 }
31075 }
31077 /* OpenMP 2.5:
31078 reduction ( reduction-operator : variable-list )
31080 reduction-operator:
31081 One of: + * - & ^ | && ||
31083 OpenMP 3.1:
31085 reduction-operator:
31086 One of: + * - & ^ | && || min max
31088 OpenMP 4.0:
31090 reduction-operator:
31091 One of: + * - & ^ | && ||
31092 id-expression */
31094 static tree
31096 {
31104 {
31114 }
31118 else
31119 {
31130 {
31160 }
31161 else
31162 {
31164 resync_fail:
31169 }
31170 }
31176 NULL);
31178 {
31181 }
31184 }
31186 /* OpenMP 2.5:
31187 schedule ( schedule-kind )
31188 schedule ( schedule-kind , expression )
31190 schedule-kind:
31191 static | dynamic | guided | runtime | auto
31193 OpenMP 4.5:
31194 schedule ( schedule-modifier : schedule-kind )
31195 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31197 schedule-modifier:
31198 simd
31199 monotonic
31200 nonmonotonic */
31202 static tree
31204 {
31214 {
31223 else
31229 else
31230 {
31233 }
31234 }
31237 {
31242 {
31263 }
31264 }
31269 else
31275 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31277 {
31281 }
31284 {
31299 else
31304 }
31316 invalid_kind:
31318 resync_fail:
31323 }
31325 /* OpenMP 3.0:
31326 untied */
31328 static tree
31331 {
31332 tree c;
31339 }
31341 /* OpenMP 4.0:
31342 inbranch
31343 notinbranch */
31345 static tree
31348 {
31353 }
31355 /* OpenMP 4.0:
31356 parallel
31357 for
31358 sections
31359 taskgroup */
31361 static tree
31365 {
31369 }
31371 /* OpenMP 4.5:
31372 nogroup */
31374 static tree
31377 {
31382 }
31384 /* OpenMP 4.5:
31385 simd
31386 threads */
31388 static tree
31392 {
31397 }
31399 /* OpenMP 4.0:
31400 num_teams ( expression ) */
31402 static tree
31404 location_t location)
31405 {
31427 }
31429 /* OpenMP 4.0:
31430 thread_limit ( expression ) */
31432 static tree
31434 location_t location)
31435 {
31457 }
31459 /* OpenMP 4.0:
31460 aligned ( variable-list )
31461 aligned ( variable-list : constant-expression ) */
31463 static tree
31465 {
31476 {
31486 }
31492 }
31494 /* OpenMP 4.0:
31495 linear ( variable-list )
31496 linear ( variable-list : expression )
31498 OpenMP 4.5:
31499 linear ( modifier ( variable-list ) )
31500 linear ( modifier ( variable-list ) : expression ) */
31502 static tree
31505 {
31515 {
31527 else
31529 }
31534 else
31535 {
31544 }
31547 {
31552 {
31563 {
31566 }
31569 }
31574 {
31577 }
31585 }
31588 {
31591 }
31594 }
31596 /* OpenMP 4.0:
31597 safelen ( constant-expression ) */
31599 static tree
31601 location_t location)
31602 {
31623 }
31625 /* OpenMP 4.0:
31626 simdlen ( constant-expression ) */
31628 static tree
31630 location_t location)
31631 {
31652 }
31654 /* OpenMP 4.5:
31655 vec:
31656 identifier [+/- integer]
31657 vec , identifier [+/- integer]
31658 */
31660 static tree
31662 tree list)
31663 {
31667 {
31670 }
31673 {
31680 else
31681 {
31682 t = cp_parser_lookup_name_simple
31687 id_loc);
31688 }
31694 {
31697 }
31701 {
31704 }
31708 {
31711 }
31714 add_to_vector:
31716 {
31720 }
31726 }
31729 {
31735 }
31737 }
31739 /* OpenMP 4.0:
31740 depend ( depend-kind : variable-list )
31742 depend-kind:
31743 in | out | inout
31745 OpenMP 4.5:
31746 depend ( source )
31748 depend ( sink : vec ) */
31750 static tree
31752 {
31760 {
31774 else
31776 }
31777 else
31783 {
31793 }
31800 else
31801 {
31807 }
31810 invalid_kind:
31812 resync_fail:
31817 }
31819 /* OpenMP 4.0:
31820 map ( map-kind : variable-list )
31821 map ( variable-list )
31823 map-kind:
31824 alloc | to | from | tofrom
31826 OpenMP 4.5:
31827 map-kind:
31828 alloc | to | from | tofrom | release | delete
31830 map ( always [,] map-kind: variable-list ) */
31832 static tree
31834 {
31843 {
31848 {
31851 nth++;
31857 {
31862 }
31863 }
31864 }
31868 {
31882 else
31883 {
31889 }
31892 }
31895 {
31899 }
31902 NULL);
31908 }
31910 /* OpenMP 4.0:
31911 device ( expression ) */
31913 static tree
31915 location_t location)
31916 {
31938 }
31940 /* OpenMP 4.0:
31941 dist_schedule ( static )
31942 dist_schedule ( static , expression ) */
31944 static tree
31946 location_t location)
31947 {
31960 {
31971 }
31976 location);
31980 invalid_kind:
31982 resync_fail:
31987 }
31989 /* OpenMP 4.0:
31990 proc_bind ( proc-bind-kind )
31992 proc-bind-kind:
31993 master | close | spread */
31995 static tree
31997 location_t location)
31998 {
31999 tree c;
32006 {
32016 else
32018 }
32019 else
32028 location);
32033 invalid_kind:
32035 resync_fail:
32040 }
32042 /* OpenACC:
32043 async [( int-expr )] */
32045 static tree
32047 {
32054 {
32063 }
32073 }
32075 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32076 is a bitmask in MASK. Return the list of clauses found. */
32078 static tree
32082 {
32087 {
32088 location_t here;
32089 pragma_omp_clause c_kind;
32090 omp_clause_code code;
32101 {
32153 clauses);
32171 OMP_CLAUSE_INDEPENDENT,
32183 clauses);
32189 clauses);
32213 clauses);
32235 clauses);
32247 clauses);
32261 }
32266 {
32267 /* Remove the invalid clause(s) from the list to avoid
32268 confusing the rest of the compiler. */
32271 }
32272 }
32274 saw_error:
32281 }
32283 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32284 is a bitmask in MASK. Return the list of clauses found; the result
32285 of clause default goes in *pdefault. */
32287 static tree
32291 {
32297 {
32298 pragma_omp_clause c_kind;
32309 {
32321 clauses);
32335 clauses);
32355 clauses);
32360 clauses);
32370 clauses);
32404 clauses);
32418 clauses);
32435 OMP_CLAUSE_NOTINBRANCH,
32444 {
32445 clause_not_first:
32449 }
32479 clauses);
32480 else
32490 clauses);
32508 {
32516 }
32559 clauses
32565 clauses
32577 }
32582 {
32583 /* Remove the invalid clause(s) from the list to avoid
32584 confusing the rest of the compiler. */
32587 }
32588 }
32589 saw_error:
32590 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32591 no reason to skip to the end. */
32595 {
32598 else
32600 }
32602 }
32604 /* OpenMP 2.5:
32605 structured-block:
32606 statement
32608 In practice, we're also interested in adding the statement to an
32609 outer node. So it is convenient if we work around the fact that
32610 cp_parser_statement calls add_stmt. */
32612 static unsigned
32614 {
32617 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32618 This preserves the "not within loop or switch" style error messages
32619 for nonsense cases like
32620 void foo() {
32621 #pragma omp single
32622 break;
32623 }
32624 */
32629 }
32631 static void
32633 {
32635 }
32637 static tree
32639 {
32647 }
32649 /* OpenMP 2.5:
32650 # pragma omp atomic new-line
32651 expression-stmt
32653 expression-stmt:
32654 x binop= expr | x++ | ++x | x-- | --x
32655 binop:
32656 +, *, -, /, &, ^, |, <<, >>
32658 where x is an lvalue expression with scalar type.
32660 OpenMP 3.1:
32661 # pragma omp atomic new-line
32662 update-stmt
32664 # pragma omp atomic read new-line
32665 read-stmt
32667 # pragma omp atomic write new-line
32668 write-stmt
32670 # pragma omp atomic update new-line
32671 update-stmt
32673 # pragma omp atomic capture new-line
32674 capture-stmt
32676 # pragma omp atomic capture new-line
32677 capture-block
32679 read-stmt:
32680 v = x
32681 write-stmt:
32682 x = expr
32683 update-stmt:
32684 expression-stmt | x = x binop expr
32685 capture-stmt:
32686 v = expression-stmt
32687 capture-block:
32688 { v = x; update-stmt; } | { update-stmt; v = x; }
32690 OpenMP 4.0:
32691 update-stmt:
32692 expression-stmt | x = x binop expr | x = expr binop x
32693 capture-stmt:
32694 v = update-stmt
32695 capture-block:
32696 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32698 where x and v are lvalue expressions with scalar type. */
32700 static void
32702 {
32710 {
32715 {
32721 }
32722 }
32724 {
32736 else
32740 }
32742 {
32748 {
32753 {
32756 }
32757 }
32758 }
32762 {
32772 else
32777 {
32778 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32779 opcode. */
32784 }
32788 {
32791 }
32792 else
32793 {
32799 }
32802 }
32804 restart:
32808 {
32815 /* FALLTHROUGH */
32825 /* FALLTHROUGH */
32840 /* Undo effects of boolean_increment for post {in,de}crement. */
32842 /* FALLTHRU */
32846 {
32847 /* Undo effects of boolean_increment. */
32849 {
32850 /* This is pre or post increment. */
32855 && !structured_block
32859 }
32860 }
32861 /* FALLTHRU */
32864 {
32899 {
32903 }
32906 {
32912 {
32917 }
32919 {
32931 {
32933 {
32938 }
32939 else
32941 }
32945 }
32948 {
32955 }
32959 }
32963 {
32966 {
32974 }
32976 {
32981 }
33016 }
33027 /* FALLTHROUGH */
33032 }
33039 }
33040 stmt_done:
33042 {
33053 }
33055 {
33058 }
33059 done:
33065 saw_error:
33068 {
33072 {
33076 }
33077 }
33078 }
33081 /* OpenMP 2.5:
33082 # pragma omp barrier new-line */
33084 static void
33086 {
33089 }
33091 /* OpenMP 2.5:
33092 # pragma omp critical [(name)] new-line
33093 structured-block
33095 OpenMP 4.5:
33096 # pragma omp critical [(name) [hint(expression)]] new-line
33097 structured-block */
33099 #define OMP_CRITICAL_CLAUSE_MASK \
33100 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33102 static tree
33104 {
33108 {
33122 OMP_CRITICAL_CLAUSE_MASK,
33124 }
33125 else
33130 }
33132 /* OpenMP 2.5:
33133 # pragma omp flush flush-vars[opt] new-line
33135 flush-vars:
33136 ( variable-list ) */
33138 static void
33140 {
33146 }
33148 /* Helper function, to parse omp for increment expression. */
33150 static tree
33152 {
33157 {
33160 }
33163 {
33172 /* Fall through: OpenMP disallows NE_EXPR. */
33175 }
33177 /* If decl is an iterator, preserve LHS and RHS of the relational
33178 expr until finish_omp_for. */
33189 }
33191 /* Helper function, to parse omp for increment expression. */
33193 static tree
33195 {
33199 cp_id_kind idk;
33203 {
33212 }
33221 {
33226 }
33233 {
33237 }
33250 do
33251 {
33258 {
33260 {
33263 else
33265 tf_warning_or_error);
33266 }
33267 else
33270 }
33271 }
33275 {
33281 }
33282 else
33286 }
33288 /* Parse the initialization statement of either an OpenMP for loop or
33289 a Cilk Plus for loop.
33291 Return true if the resulting construct should have an
33292 OMP_CLAUSE_PRIVATE added to it. */
33294 static tree
33303 {
33309 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33311 init-expr:
33312 var = lb
33313 integer-type var = lb
33314 random-access-iterator-type var = lb
33315 pointer-type var = lb
33316 */
33317 cp_decl_specifier_seq type_specifiers;
33319 /* First, try to parse as an initialized declaration. See
33320 cp_parser_condition, from whence the bulk of this is copied. */
33327 {
33328 /* If parsing a type specifier seq succeeded, then this
33329 MUST be a initialized declaration. */
33334 CP_PARSER_DECLARATOR_NAMED,
33345 else
33346 {
33356 {
33358 CPP_OPEN_PAREN))
33359 {
33363 else
33366 }
33367 else
33368 /* Trigger an error. */
33373 }
33377 {
33385 {
33388 auto_node);
33393 }
33396 asm_specification,
33397 LOOKUP_ONLYCONVERTING);
33400 {
33403 }
33404 else
33407 }
33408 else
33409 {
33410 /* Consume '='. */
33414 non_class:
33417 else
33420 asm_specification,
33421 LOOKUP_ONLYCONVERTING);
33422 }
33426 }
33427 }
33428 else
33429 {
33430 cp_id_kind idk;
33431 /* If parsing a type specifier sequence failed, then
33432 this MUST be a simple expression. */
33441 && decl
33444 {
33455 {
33460 }
33465 }
33467 && decl
33470 {
33471 tree rhs;
33479 rhs,
33480 tf_warning_or_error));
33483 }
33484 else
33485 {
33490 {
33494 }
33495 }
33496 }
33498 }
33500 /* Parse the restricted form of the for statement allowed by OpenMP. */
33502 static tree
33505 {
33509 location_t loc_first;
33520 {
33523 }
33526 {
33532 }
33534 {
33537 {
33539 "%<linear%> clause may not be specified together "
33542 }
33543 else
33545 }
33558 {
33561 location_t loc;
33565 {
33568 }
33571 {
33574 }
33583 add_private_clause
33590 {
33593 {
33599 }
33600 else
33602 }
33609 {
33614 {
33618 }
33621 {
33622 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33626 {
33629 }
33630 else
33631 {
33634 }
33636 }
33637 else
33638 {
33643 }
33644 }
33647 {
33648 tree c;
33650 {
33659 decl);
33663 decl);
33664 }
33666 {
33671 else
33676 {
33679 /* For linear, signal that we need to fill up
33680 the so far unknown linear step. */
33683 }
33684 }
33685 }
33694 {
33695 /* If decl is an iterator, preserve the operator on decl
33696 until finish_omp_for. */
33698 && ((processing_template_decl
33703 else
33707 }
33719 {
33722 }
33727 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33728 in between the collapsed for loops to be still considered perfectly
33729 nested. Hopefully the final version clarifies this.
33730 For now handle (multiple) {'s and empty statements. */
33732 do
33733 {
33737 {
33739 bracecount++;
33740 }
33744 else
33745 {
33752 }
33753 }
33757 {
33760 }
33761 }
33766 /* Note that we saved the original contents of this flag when we entered
33767 the structured block, and so we don't need to re-save it here. */
33770 else
33773 /* Note that the grammar doesn't call for a structured block here,
33774 though the loop as a whole is a structured block. */
33781 else
33786 {
33788 {
33790 nbraces--;
33791 }
33794 else
33795 {
33797 {
33800 }
33805 }
33806 }
33813 }
33815 /* Helper function for OpenMP parsing, split clauses and call
33816 finish_omp_clauses on each of the set of clauses afterwards. */
33818 static void
33821 {
33827 }
33829 /* OpenMP 4.0:
33830 #pragma omp simd simd-clause[optseq] new-line
33831 for-loop */
33833 #define OMP_SIMD_CLAUSE_MASK \
33834 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33843 static tree
33847 {
33858 {
33862 OMP_CLAUSE_ORDERED);
33864 {
33866 "%<ordered%> clause with parameter may not be specified "
33869 }
33870 }
33881 }
33883 /* OpenMP 2.5:
33884 #pragma omp for for-clause[optseq] new-line
33885 for-loop
33887 OpenMP 4.0:
33888 #pragma omp for simd for-simd-clause[optseq] new-line
33889 for-loop */
33891 #define OMP_FOR_CLAUSE_MASK \
33892 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33902 static tree
33906 {
33915 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33920 {
33925 {
33949 }
33950 }
33952 {
33955 }
33957 /* Composite distribute parallel for disallows linear clause. */
33964 {
33967 }
33978 }
33980 /* OpenMP 2.5:
33981 # pragma omp master new-line
33982 structured-block */
33984 static tree
33986 {
33990 }
33992 /* OpenMP 2.5:
33993 # pragma omp ordered new-line
33994 structured-block
33996 OpenMP 4.5:
33997 # pragma omp ordered ordered-clauses new-line
33998 structured-block */
34000 #define OMP_ORDERED_CLAUSE_MASK \
34001 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34004 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34005 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34007 static bool
34010 {
34014 {
34018 }
34021 {
34026 {
34028 {
34030 "%<depend%> clause may only be used in compound "
34034 }
34035 tree clauses
34037 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34041 }
34042 }
34044 tree clauses
34050 }
34052 /* OpenMP 2.5:
34054 section-scope:
34055 { section-sequence }
34057 section-sequence:
34058 section-directive[opt] structured-block
34059 section-sequence section-directive structured-block */
34061 static tree
34063 {
34075 {
34079 }
34082 {
34090 {
34094 }
34096 {
34099 }
34104 }
34115 }
34117 /* OpenMP 2.5:
34118 # pragma omp sections sections-clause[optseq] newline
34119 sections-scope */
34121 #define OMP_SECTIONS_CLAUSE_MASK \
34122 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34128 static tree
34131 {
34143 {
34146 }
34153 }
34155 /* OpenMP 2.5:
34156 # pragma omp parallel parallel-clause[optseq] new-line
34157 structured-block
34158 # pragma omp parallel for parallel-for-clause[optseq] new-line
34159 structured-block
34160 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34161 structured-block
34163 OpenMP 4.0:
34164 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34165 structured-block */
34167 #define OMP_PARALLEL_CLAUSE_MASK \
34168 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34178 static tree
34182 {
34189 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34195 {
34203 if_p);
34207 if_p);
34210 block);
34215 }
34216 /* When combined with distribute, parallel has to be followed by for.
34217 #pragma omp target parallel is allowed though. */
34221 {
34225 }
34227 {
34230 }
34232 {
34236 {
34246 block);
34249 }
34250 }
34254 {
34257 }
34265 }
34267 /* OpenMP 2.5:
34268 # pragma omp single single-clause[optseq] new-line
34269 structured-block */
34271 #define OMP_SINGLE_CLAUSE_MASK \
34272 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34277 static tree
34279 {
34289 }
34291 /* OpenMP 3.0:
34292 # pragma omp task task-clause[optseq] new-line
34293 structured-block */
34295 #define OMP_TASK_CLAUSE_MASK \
34296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34307 static tree
34309 {
34320 }
34322 /* OpenMP 3.0:
34323 # pragma omp taskwait new-line */
34325 static void
34327 {
34330 }
34332 /* OpenMP 3.1:
34333 # pragma omp taskyield new-line */
34335 static void
34337 {
34340 }
34342 /* OpenMP 4.0:
34343 # pragma omp taskgroup new-line
34344 structured-block */
34346 static tree
34348 {
34352 if_p));
34353 }
34356 /* OpenMP 2.5:
34357 # pragma omp threadprivate (variable-list) */
34359 static void
34361 {
34362 tree vars;
34368 }
34370 /* OpenMP 4.0:
34371 # pragma omp cancel cancel-clause[optseq] new-line */
34373 #define OMP_CANCEL_CLAUSE_MASK \
34374 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34380 static void
34382 {
34386 }
34388 /* OpenMP 4.0:
34389 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34391 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34392 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34397 static void
34399 {
34400 tree clauses;
34404 {
34409 {
34412 }
34413 }
34415 {
34419 }
34422 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34424 pragma_tok);
34426 }
34428 /* OpenMP 4.0:
34429 #pragma omp distribute distribute-clause[optseq] new-line
34430 for-loop */
34432 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34433 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34439 static tree
34443 {
34452 {
34460 else
34463 {
34469 {
34473 else
34476 }
34482 else
34496 }
34497 }
34499 {
34502 }
34507 {
34510 }
34521 }
34523 /* OpenMP 4.0:
34524 # pragma omp teams teams-clause[optseq] new-line
34525 structured-block */
34527 #define OMP_TEAMS_CLAUSE_MASK \
34528 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34536 static tree
34540 {
34549 {
34553 {
34577 }
34578 }
34580 {
34583 }
34588 {
34591 }
34599 }
34601 /* OpenMP 4.0:
34602 # pragma omp target data target-data-clause[optseq] new-line
34603 structured-block */
34605 #define OMP_TARGET_DATA_CLAUSE_MASK \
34606 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34611 static tree
34613 {
34614 tree clauses
34619 {
34622 {
34639 "%<#pragma omp target data%> with map-type other "
34640 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34644 }
34646 }
34649 {
34652 "%<#pragma omp target data%> must contain at least "
34655 }
34666 }
34668 /* OpenMP 4.5:
34669 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34670 structured-block */
34672 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34673 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34679 static tree
34682 {
34685 {
34690 {
34693 }
34694 }
34696 {
34700 }
34703 {
34705 "%<#pragma omp target enter data%> may only be "
34709 }
34711 tree clauses
34716 {
34719 {
34732 "%<#pragma omp target enter data%> with map-type other "
34736 }
34738 }
34741 {
34744 "%<#pragma omp target enter data%> must contain at least "
34747 }
34754 }
34756 /* OpenMP 4.5:
34757 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34758 structured-block */
34760 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34761 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34767 static tree
34770 {
34773 {
34778 {
34781 }
34782 }
34784 {
34788 }
34791 {
34793 "%<#pragma omp target exit data%> may only be "
34797 }
34799 tree clauses
34804 {
34807 {
34821 "%<#pragma omp target exit data%> with map-type other "
34822 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34826 }
34828 }
34831 {
34834 "%<#pragma omp target exit data%> must contain at least "
34837 }
34844 }
34846 /* OpenMP 4.0:
34847 # pragma omp target update target-update-clause[optseq] new-line */
34849 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34850 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34857 static bool
34860 {
34862 {
34864 "%<#pragma omp target update%> may only be "
34868 }
34870 tree clauses
34875 {
34877 "%<#pragma omp target update%> must contain at least one "
34880 }
34888 }
34890 /* OpenMP 4.0:
34891 # pragma omp target target-clause[optseq] new-line
34892 structured-block */
34894 #define OMP_TARGET_CLAUSE_MASK \
34895 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34905 static bool
34908 {
34912 {
34916 }
34919 {
34931 {
34939 {
34940 tree stmt;
34942 {
34945 OMP_TARGET_CLAUSE_MASK,
34950 OMP_TARGET_CLAUSE_MASK,
34955 OMP_TARGET_CLAUSE_MASK,
34960 }
34962 }
34967 {
34971 if_p);
34976 if_p);
34981 if_p);
34985 }
34991 {
34992 /* For combined target teams, ensure the num_teams and
34993 thread_limit clause expressions are evaluated on the host,
34994 before entering the target construct. */
34995 tree c;
35001 {
35010 OMP_CLAUSE_FIRSTPRIVATE);
35015 }
35016 }
35025 }
35027 {
35030 }
35032 {
35036 }
35038 {
35042 }
35044 {
35048 }
35050 {
35053 }
35054 }
35069 check_clauses:
35071 {
35074 {
35088 "%<#pragma omp target%> with map-type other "
35089 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35093 }
35095 }
35097 }
35099 /* OpenACC 2.0:
35100 # pragma acc cache (variable-list) new-line
35101 */
35103 static tree
35105 {
35120 }
35122 /* OpenACC 2.0:
35123 # pragma acc data oacc-data-clause[optseq] new-line
35124 structured-block */
35126 #define OACC_DATA_CLAUSE_MASK \
35127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35139 static tree
35141 {
35154 }
35156 /* OpenACC 2.0:
35157 # pragma acc host_data <clauses> new-line
35158 structured-block */
35160 #define OACC_HOST_DATA_CLAUSE_MASK \
35161 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35163 static tree
35165 {
35178 }
35180 /* OpenACC 2.0:
35181 # pragma acc declare oacc-data-clause[optseq] new-line
35182 */
35184 #define OACC_DECLARE_CLAUSE_MASK \
35185 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35198 static tree
35200 {
35209 {
35213 }
35216 {
35220 {
35224 }
35227 {
35235 /* Generated by c_finish_omp_clauses from array sections;
35236 avoid spurious diagnostics. */
35243 {
35245 "%qD must be a global variable in"
35247 decl);
35250 }
35255 {
35259 }
35261 {
35263 "invalid use of %<extern%> variable %qD "
35267 }
35269 {
35271 "invalid use of %<global%> variable %qD "
35275 }
35277 }
35282 {
35287 }
35290 {
35291 tree id;
35295 else
35301 {
35304 {
35307 {
35311 }
35312 }
35313 }
35314 }
35315 }
35328 }
35330 /* OpenACC 2.0:
35331 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35333 or
35335 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35337 LOC is the location of the #pragma token.
35338 */
35340 #define OACC_ENTER_DATA_CLAUSE_MASK \
35341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35349 #define OACC_EXIT_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_COPYOUT) \
35353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35356 static tree
35359 {
35364 {
35370 }
35375 {
35379 }
35386 else
35391 {
35395 }
35403 }
35405 /* OpenACC 2.0:
35406 # pragma acc loop oacc-loop-clause[optseq] new-line
35407 structured-block */
35409 #define OACC_LOOP_CLAUSE_MASK \
35410 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35421 static tree
35424 {
35433 {
35439 }
35448 }
35450 /* OpenACC 2.0:
35451 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35452 structured-block
35454 or
35456 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35457 structured-block
35458 */
35460 #define OACC_KERNELS_CLAUSE_MASK \
35461 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35476 #define OACC_PARALLEL_CLAUSE_MASK \
35477 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35498 static tree
35501 {
35502 omp_clause_mask mask;
35505 {
35518 }
35521 {
35525 {
35528 tree clauses;
35530 if_p);
35532 }
35533 }
35542 }
35544 /* OpenACC 2.0:
35545 # pragma acc update oacc-update-clause[optseq] new-line
35546 */
35548 #define OACC_UPDATE_CLAUSE_MASK \
35549 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35556 static tree
35558 {
35565 {
35567 "%<#pragma acc update%> must contain at least one "
35570 }
35578 }
35580 /* OpenACC 2.0:
35581 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35583 LOC is the location of the #pragma token.
35584 */
35586 #define OACC_WAIT_CLAUSE_MASK \
35587 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35589 static tree
35591 {
35605 }
35607 /* OpenMP 4.0:
35608 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35610 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35611 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35618 static void
35621 {
35623 cp_omp_declare_simd_data data;
35625 {
35630 }
35641 {
35645 {
35658 }
35663 "%<#pragma omp declare simd%> not immediately followed by "
35667 }
35668 }
35670 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35671 This function is modelled similar to the late parsing of omp declare
35672 simd. */
35674 static tree
35676 {
35683 {
35685 "used in the same function marked as a Cilk Plus SIMD-enabled "
35691 }
35693 {
35697 }
35702 {
35709 NULL);
35723 }
35729 }
35731 /* Finalize #pragma omp declare simd clauses after direct declarator has
35732 been parsed, and put that into "omp declare simd" attribute. */
35734 static tree
35736 {
35742 {
35747 }
35752 {
35770 }
35774 }
35777 /* OpenMP 4.0:
35778 # pragma omp declare target new-line
35779 declarations and definitions
35780 # pragma omp end declare target new-line
35782 OpenMP 4.5:
35783 # pragma omp declare target ( extended-list ) new-line
35785 # pragma omp declare target declare-target-clauses[seq] new-line */
35787 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35788 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35791 static void
35793 {
35796 clauses
35800 {
35802 clauses);
35805 }
35806 else
35807 {
35811 }
35814 "%<#pragma omp declare target%> with clauses in between "
35815 "%<#pragma omp declare target%> without clauses and "
35818 {
35824 {
35827 }
35828 else
35831 {
35833 "%qD specified both in declare target %<link%> and %<to%>"
35836 }
35838 {
35842 {
35845 {
35849 }
35850 }
35851 }
35852 }
35853 }
35855 static void
35857 {
35860 {
35863 }
35865 {
35869 {
35872 }
35875 else
35876 {
35880 }
35881 }
35882 else
35883 {
35887 }
35891 "%<#pragma omp end declare target%> without corresponding "
35893 else
35895 }
35897 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35898 expression and optional initializer clause of
35899 #pragma omp declare reduction. We store the expression(s) as
35900 either 3, 6 or 7 special statements inside of the artificial function's
35901 body. The first two statements are DECL_EXPRs for the artificial
35902 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35903 expression that uses those variables.
35904 If there was any INITIALIZER clause, this is followed by further statements,
35905 the fourth and fifth statements are DECL_EXPRs for the artificial
35906 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35907 constructor variant (first token after open paren is not omp_priv),
35908 then the sixth statement is a statement with the function call expression
35909 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35910 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35911 to initialize the OMP_PRIV artificial variable and there is seventh
35912 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35914 static bool
35916 {
35928 tree combiner;
35943 {
35946 }
35949 {
35956 {
35959 }
35975 {
35979 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35983 == CPP_CLOSE_PAREN
35986 {
35990 }
35995 }
35996 else
35997 {
36013 {
36018 }
36020 tree arg;
36033 }
36044 }
36050 }
36052 /* OpenMP 4.0
36053 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36054 initializer-clause[opt] new-line
36056 initializer-clause:
36057 initializer (omp_priv initializer)
36058 initializer (function-name (argument-list)) */
36060 static void
36063 {
36073 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36080 {
36112 }
36124 /* Types may not be defined in declare reduction type list. */
36127 parser->type_definition_forbidden_message
36133 saved_colon_doesnt_start_class_def_p
36138 {
36142 ;
36163 else
36168 else
36170 }
36172 /* Restore the saved message. */
36175 parser->colon_doesnt_start_class_def_p
36180 {
36181 fail:
36184 }
36190 {
36191 tree fntype
36194 NULL_TREE);
36214 {
36219 }
36221 {
36223 {
36232 }
36239 }
36240 else
36241 {
36244 }
36247 else
36250 {
36253 }
36255 {
36258 else
36263 }
36268 else
36269 {
36278 }
36285 }
36289 done:
36290 /* Free any declarators allocated. */
36292 }
36294 /* OpenMP 4.0
36295 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36296 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36297 initializer-clause[opt] new-line
36298 #pragma omp declare target new-line */
36300 static void
36303 {
36305 {
36310 {
36313 context);
36315 }
36318 {
36321 context);
36323 }
36325 {
36328 }
36330 {
36334 }
36335 }
36339 }
36341 /* OpenMP 4.5:
36342 #pragma omp taskloop taskloop-clause[optseq] new-line
36343 for-loop
36345 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36346 for-loop */
36348 #define OMP_TASKLOOP_CLAUSE_MASK \
36349 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36364 static tree
36368 {
36377 {
36382 {
36406 }
36407 }
36409 {
36412 }
36417 {
36420 }
36426 if_p);
36432 }
36435 /* OpenACC 2.0:
36436 # pragma acc routine oacc-routine-clause[optseq] new-line
36437 function-definition
36439 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36440 */
36442 #define OACC_ROUTINE_CLAUSE_MASK \
36443 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36449 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36450 component, which must resolve to a declared namespace-scope
36451 function. The clauses are either processed directly (for a named
36452 function), or defered until the immediatley following declaration
36453 is parsed. */
36455 static void
36458 {
36461 cp_omp_declare_simd_data data;
36463 {
36469 }
36472 /* Create a dummy claue, to record location. */
36476 {
36481 }
36483 /* Look for optional '( name )'. */
36485 {
36487 {
36496 "%<#pragma acc routine%> not followed by a "
36501 }
36506 /* We parse the name as an id-expression. If it resolves to
36507 anything other than a non-overloaded function at namespace
36508 scope, it's an error. */
36522 {
36526 }
36528 /* Build a chain of clauses. */
36533 cp_lexer_peek_token
36536 /* Force clauses to be non-null, by attaching context to it. */
36542 {
36546 }
36548 /* Perhaps we should use the same rule as declarations in different
36549 namespaces? */
36551 {
36556 }
36559 {
36564 }
36571 }
36572 else
36573 {
36592 {
36593 /* Create an empty list of clauses. */
36595 NULL_TREE);
36606 }
36607 }
36608 }
36610 /* Finalize #pragma acc routine clauses after direct declarator has
36611 been parsed, and put that into "oacc function" attribute. */
36613 static tree
36615 {
36619 location_t loc;
36625 {
36630 }
36647 /* Force clauses to be non-null, by attaching context to it. */
36652 }
36654 /* Apply any saved OpenACC routine clauses to a just-parsed
36655 declaration. */
36657 static void
36659 {
36661 {
36669 {
36672 }
36675 {
36678 }
36681 {
36683 "%<#pragma acc routine%> not followed by a function "
36686 }
36689 {
36691 fndecl);
36693 }
36696 {
36700 }
36702 /* Process for function attrib */
36706 /* Add an "omp target" attribute. */
36710 }
36711 }
36713 /* Main entry point to OpenMP statement pragmas. */
36715 static void
36717 {
36718 tree stmt;
36723 {
36746 if_p);
36751 if_p);
36768 if_p);
36773 if_p);
36781 if_p);
36790 if_p);
36804 if_p);
36809 if_p);
36813 }
36816 }
36817 \f
36818 /* Transactional Memory parsing routines. */
36820 /* Parse a transaction attribute.
36822 txn-attribute:
36823 attribute
36824 [ [ identifier ] ]
36826 We use this instead of cp_parser_attributes_opt for transactions to avoid
36827 the pedwarn in C++98 mode. */
36829 static tree
36831 {
36846 {
36850 /* For keywords, use the canonical spelling,
36851 not the parsed identifier. */
36855 }
36856 else
36860 error1:
36863 }
36865 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36867 transaction-statement:
36868 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36869 compound-statement
36870 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36871 */
36873 static tree
36875 {
36886 else
36887 {
36891 }
36893 /* Parse a noexcept specification. */
36897 {
36898 /* cancel-and-throw is unimplemented. */
36901 }
36902 else
36905 /* Keep track if we're in the lexical scope of an outer transaction. */
36917 }
36919 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36921 transaction-expression:
36922 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36923 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36924 */
36926 static tree
36928 {
36941 keyword == RID_TRANSACTION_RELAXED
36955 /* Set this early. This might mean that we allow transaction_cancel in
36956 an expression that we find out later actually has to be a constexpr.
36957 However, we expect that cxx_constant_value will be able to deal with
36958 this; also, if the noexcept has no constexpr, then what we parse next
36959 really is a transaction's body. */
36962 /* Parse a noexcept specification. */
36968 {
36975 }
36976 else
36977 {
36978 /* The only expression that is available got parsed for the noexcept
36979 already. noexcept is true then. */
36982 }
36991 }
36993 /* Parse a function-transaction-block.
36995 function-transaction-block:
36996 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36997 function-body
36998 __transaction_atomic txn-attribute[opt] function-try-block
36999 __transaction_relaxed ctor-initializer[opt] function-body
37000 __transaction_relaxed function-try-block
37001 */
37003 static bool
37005 {
37021 else
37022 {
37026 }
37034 else
37035 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37043 }
37045 /* Parse a __transaction_cancel statement.
37047 cancel-statement:
37048 __transaction_cancel txn-attribute[opt] ;
37049 __transaction_cancel txn-attribute[opt] throw-expression ;
37051 ??? Cancel and throw is not yet implemented. */
37053 static tree
37055 {
37061 RT_TRANSACTION_CANCEL);
37068 /* ??? Parse cancel-and-throw here. */
37073 {
37077 }
37079 {
37083 }
37085 {
37088 {
37094 }
37095 }
37097 {
37101 }
37107 }
37108 \f
37109 /* The parser. */
37113 \f
37114 /* Special handling for the first token or line in the file. The first
37115 thing in the file might be #pragma GCC pch_preprocess, which loads a
37116 PCH file, which is a GC collection point. So we need to handle this
37117 first pragma without benefit of an existing lexer structure.
37119 Always returns one token to the caller in *FIRST_TOKEN. This is
37120 either the true first token of the file, or the first token after
37121 the initial pragma. */
37123 static void
37125 {
37134 {
37141 }
37142 else
37145 /* Skip to the end of the pragma. */
37149 /* Now actually load the PCH file. */
37153 /* Read one more token to return to our caller. We have to do this
37154 after reading the PCH file in, since its pointers have to be
37155 live. */
37157 }
37159 /* Parses the grainsize pragma for the _Cilk_for statement.
37160 Syntax:
37161 #pragma cilk grainsize = <VALUE>. */
37163 static void
37165 {
37167 {
37172 {
37175 }
37177 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37180 else
37182 "%<#pragma cilk grainsize%> is not followed by "
37185 }
37187 }
37189 /* Normal parsing of a pragma token. Here we can (and must) use the
37190 regular lexer. */
37192 static bool
37194 {
37197 tree stmt;
37208 {
37216 {
37226 }
37231 {
37241 }
37246 {
37252 "%<#pragma omp taskwait%> may only be "
37257 }
37262 {
37268 "%<#pragma omp taskyield%> may only be "
37273 }
37278 {
37284 "%<#pragma omp cancel%> may only be "
37289 }
37294 {
37300 "%<#pragma omp cancellation point%> may only be "
37305 }
37373 "%<#pragma omp section%> may only be used in "
37378 {
37380 {
37384 }
37391 {
37394 }
37397 }
37401 {
37405 }
37413 {
37417 }
37419 /* Ignore the pragma if Cilk Plus is not enabled. */
37421 {
37424 }
37425 else
37426 {
37430 }
37437 bad_stmt:
37440 }
37444 }
37446 /* The interface the pragma parsers have to the lexer. */
37448 enum cpp_ttype
37450 {
37462 else
37463 {
37467 }
37470 }
37472 \f
37473 /* External interface. */
37475 /* Parse one entire translation unit. */
37477 void
37479 {
37492 }
37494 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37495 vectorlength clause:
37496 Syntax:
37497 vectorlength ( constant-expression ) */
37499 static tree
37502 {
37504 tree expr;
37505 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37506 safelen clause. Thus, vectorlength is represented as OMP 4.0
37507 safelen. For SIMD-enabled function it is represented by OMP 4.0
37508 simdlen. */
37511 loc);
37512 else
37514 loc);
37522 /* If expr == error_mark_node, then don't emit any errors nor
37523 create a clause. if any of the above functions returns
37524 error mark node then they would have emitted an error message. */
37526 ;
37534 else
37535 {
37536 tree c;
37538 {
37543 }
37544 else
37545 {
37550 }
37551 }
37556 }
37558 /* Handles the Cilk Plus #pragma simd linear clause.
37559 Syntax:
37560 linear ( simd-linear-variable-list )
37562 simd-linear-variable-list:
37563 simd-linear-variable
37564 simd-linear-variable-list , simd-linear-variable
37566 simd-linear-variable:
37567 id-expression
37568 id-expression : simd-linear-step
37570 simd-linear-step:
37571 conditional-expression */
37573 static tree
37575 {
37581 {
37585 }
37590 {
37593 {
37597 }
37604 {
37608 }
37609 else
37610 {
37614 /* If present, parse the linear step. Otherwise, assume the default
37615 value of 1. */
37617 {
37624 {
37625 /* If an error has occurred, then the whole pragma is
37626 considered ill-formed. Thus, no reason to keep
37627 parsing. */
37630 }
37638 else
37640 "step size must be an integer constant "
37642 }
37644 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37650 }
37655 else
37656 {
37661 }
37662 }
37666 }
37668 /* Returns the name of the next clause. If the clause is not
37669 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37670 token is not consumed. Otherwise, the appropriate enum from the
37671 pragma_simd_clause is returned and the token is consumed. */
37673 static pragma_omp_clause
37675 {
37676 pragma_omp_clause clause_type;
37693 else
37698 }
37700 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37702 static tree
37704 {
37709 {
37710 pragma_omp_clause c_kind;
37717 /* Use the OpenMP 4.0 equivalent function. */
37720 /* Use the OpenMP 4.0 equivalent function. */
37722 clauses);
37724 /* Use the OMP 4.0 equivalent function. */
37726 clauses);
37728 /* Use the OMP 4.0 equivalent function. */
37730 else
37731 {
37735 }
37736 }
37742 else
37744 }
37746 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37748 static void
37750 {
37757 {
37761 }
37770 }
37772 /* Main entry-point for parsing Cilk Plus _Cilk_for
37773 loops. The return value is error_mark_node
37774 when errors happen and CILK_FOR tree on success. */
37776 static tree
37778 {
37793 else
37799 }
37801 /* Create an identifier for a generic parameter type (a synthesized
37802 template parameter implied by `auto' or a concept identifier). */
37805 static tree
37807 {
37811 }
37813 /* Predicate that behaves as is_auto_or_concept but matches the parent
37814 node of the generic type rather than the generic type itself. This
37815 allows for type transformation in add_implicit_template_parms. */
37819 {
37821 }
37823 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37824 (creating a new template parameter list if necessary). Returns the newly
37825 created template type parm. */
37827 static tree
37829 {
37832 /* Before committing to modifying any scope, if we're in an
37833 implicit template scope, and we're trying to synthesize a
37834 constrained parameter, try to find a previous parameter with
37835 the same name. This is the same-type rule for abbreviated
37836 function templates. */
37838 {
37841 {
37843 {
37846 /* Return the TEMPLATE_PARM_INDEX. */
37849 }
37851 }
37852 }
37854 /* We are either continuing a function template that already contains implicit
37855 template parameters, creating a new fully-implicit function template, or
37856 extending an existing explicit function template with implicit template
37857 parameters. */
37865 {
37869 }
37870 else
37871 {
37872 /* Roll back to the existing template parameter scope (in the case of
37873 extending an explicit function template) or introduce a new template
37874 parameter scope ahead of the function parameter scope (or class scope
37875 in the case of out-of-line member definitions). The function scope is
37876 added back after template parameter synthesis below. */
37881 {
37884 }
37886 {
37887 /* If not defining a class, then any class scope is a scope level in
37888 an out-of-line member definition. In this case simply wind back
37889 beyond the first such scope to inject the template parameter list.
37890 Otherwise wind back to the class being defined. The latter can
37891 occur in class member friend declarations such as:
37893 class A {
37894 void foo (auto);
37895 };
37896 class B {
37897 friend void A::foo (auto);
37898 };
37900 The template parameter list synthesized for the friend declaration
37901 must be injected in the scope of 'B'. This can also occur in
37902 erroneous cases such as:
37904 struct A {
37905 struct B {
37906 void foo (auto);
37907 };
37908 void B::foo (auto) {}
37909 };
37911 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37912 but, nevertheless, the template parameter list synthesized for the
37913 declarator should be injected into the scope of 'A' as if the
37914 ill-formed template was specified explicitly. */
37917 {
37920 }
37921 }
37927 {
37928 /* Introduce a new template parameter list for implicit template
37929 parameters. */
37933 parser->implicit_template_scope
37940 }
37941 else
37942 {
37943 /* Synthesize implicit template parameters at the end of the explicit
37944 template parameter list. */
37951 parser->implicit_template_parms
37953 }
37954 }
37956 /* Synthesize a new template parameter and track the current template
37957 parameter chain with implicit_template_parms. */
37961 tree synth_tmpl_parm;
37965 synth_tmpl_parm
37968 synth_tmpl_parm
37970 else
37971 {
37975 }
37977 // Attach the constraint to the parm before processing.
37980 tree new_parm
37982 input_location,
37983 node,
37987 // Chain the new parameter to the list of implicit parameters.
37989 parser->implicit_template_parms
37991 else
37996 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37999 /* If creating a fully implicit function template, start the new implicit
38000 template parameter list with this synthesized type, otherwise grow the
38001 current template parameter list. */
38004 {
38011 }
38012 else
38013 {
38018 }
38020 // If the new parameter was constrained, we need to add that to the
38021 // constraints in the template parameter list.
38023 {
38027 }
38032 }
38034 /* Finish the declaration of a fully implicit function template. Such a
38035 template has no explicit template parameter list so has not been through the
38036 normal template head and tail processing. synthesize_implicit_template_parm
38037 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38038 provided if the declaration is a class member such that its template
38039 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38040 form is returned. Otherwise NULL_TREE is returned. */
38042 static tree
38044 {
38049 {
38053 }
38063 }