| blob | b06170482097740901ce8dac6103a08ec0a7bb31 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 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/>. */
22 #define INCLUDE_UNIQUE_PTR
49 \f
50 /* The lexer. */
52 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
53 and c-lex.c) and the C++ parser. */
56 {
58 };
60 /* The various kinds of non integral constant we encounter. */
62 NIC_NONE,
63 /* floating-point literal */
64 NIC_FLOAT,
65 /* %<this%> */
66 NIC_THIS,
67 /* %<__FUNCTION__%> */
68 NIC_FUNC_NAME,
69 /* %<__PRETTY_FUNCTION__%> */
70 NIC_PRETTY_FUNC,
71 /* %<__func__%> */
72 NIC_C99_FUNC,
73 /* "%<va_arg%> */
74 NIC_VA_ARG,
75 /* a cast */
76 NIC_CAST,
77 /* %<typeid%> operator */
78 NIC_TYPEID,
79 /* non-constant compound literals */
80 NIC_NCC,
81 /* a function call */
82 NIC_FUNC_CALL,
83 /* an increment */
84 NIC_INC,
85 /* an decrement */
86 NIC_DEC,
87 /* an array reference */
88 NIC_ARRAY_REF,
89 /* %<->%> */
90 NIC_ARROW,
91 /* %<.%> */
92 NIC_POINT,
93 /* the address of a label */
94 NIC_ADDR_LABEL,
95 /* %<*%> */
96 NIC_STAR,
97 /* %<&%> */
98 NIC_ADDR,
99 /* %<++%> */
100 NIC_PREINCREMENT,
101 /* %<--%> */
102 NIC_PREDECREMENT,
103 /* %<new%> */
104 NIC_NEW,
105 /* %<delete%> */
106 NIC_DEL,
107 /* calls to overloaded operators */
108 NIC_OVERLOADED,
109 /* an assignment */
110 NIC_ASSIGNMENT,
111 /* a comma operator */
112 NIC_COMMA,
113 /* a call to a constructor */
114 NIC_CONSTRUCTOR,
115 /* a transaction expression */
116 NIC_TRANSACTION
117 };
119 /* The various kinds of errors about name-lookup failing. */
121 /* NULL */
122 NLE_NULL,
123 /* is not a type */
124 NLE_TYPE,
125 /* is not a class or namespace */
126 NLE_CXX98,
127 /* is not a class, namespace, or enumeration */
128 NLE_NOT_CXX98
129 };
131 /* The various kinds of required token */
133 RT_NONE,
155 /* The type is CPP_KEYWORD */
184 RT_TRANSACTION_CANCEL /* __transaction_cancel */
185 };
187 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
188 reverting it on destruction. */
190 class type_id_in_expr_sentinel
191 {
201 };
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static void cp_parser_cilk_simd
256 static tree cp_parser_cilk_for
258 static bool cp_parser_omp_declare_reduction_exprs
260 static tree cp_parser_cilk_simd_vectorlength
262 static void cp_finalize_oacc_routine
265 /* Manifest constants. */
266 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
267 #define CP_SAVED_TOKEN_STACK 5
269 /* Variables. */
271 /* The stream to which debugging output should be written. */
274 /* Nonzero if we are parsing an unevaluated operand: an operand to
275 sizeof, typeof, or alignof. */
278 /* Dump up to NUM tokens in BUFFER to FILE starting with token
279 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
280 first token in BUFFER. If NUM is 0, dump all the tokens. If
281 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
282 highlighted by surrounding it in [[ ]]. */
284 static void
288 {
305 {
308 }
313 {
320 nprinted++;
330 {
340 }
341 }
344 {
347 }
350 }
353 /* Dump all tokens in BUFFER to stderr. */
355 void
357 {
359 }
361 DEBUG_FUNCTION void
363 {
365 }
367 DEBUG_FUNCTION void
369 {
372 else
374 }
377 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
378 description for T. */
380 static void
382 {
384 {
387 }
388 }
391 /* Dump parser context C to FILE. */
393 static void
395 {
400 }
403 /* Print the stack of parsing contexts to FILE starting with FIRST. */
405 static void
407 {
413 {
416 }
417 }
420 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
422 static void
424 {
427 }
430 /* Print an unparsed function entry UF to FILE. */
432 static void
434 {
437 tree fn;
442 i++)
443 {
449 }
454 {
457 }
463 {
466 }
468 }
471 /* Print the stack of unparsed member functions S to FILE. */
473 static void
476 {
482 {
485 }
486 }
489 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
490 the given PARSER. If FILE is NULL, the output is printed on stderr. */
492 static void
494 {
506 next_token);
507 }
510 /* Dump debugging information for the given PARSER. If FILE is NULL,
511 the output is printed on stderr. */
513 void
515 {
518 expanded_location eloc;
596 }
598 DEBUG_FUNCTION void
600 {
602 }
604 DEBUG_FUNCTION void
606 {
609 else
611 }
613 /* Allocate memory for a new lexer object and return it. */
617 {
622 /* Allocate the memory. */
625 /* Initially we are not debugging. */
630 /* Create the buffer. */
634 }
637 /* Create a new main C++ lexer, the lexer that gets tokens from the
638 preprocessor. */
642 {
644 cp_token token;
646 /* It's possible that parsing the first pragma will load a PCH file,
647 which is a GC collection point. So we have to do that before
648 allocating any memory. */
653 /* Put the first token in the buffer. */
656 /* Get the remaining tokens from the preprocessor. */
658 {
661 }
670 /* Subsequent preprocessor diagnostics should use compiler
671 diagnostic functions to get the compiler source location. */
676 }
678 /* Create a new lexer whose token stream is primed with the tokens in
679 CACHE. When these tokens are exhausted, no new tokens will be read. */
683 {
688 /* We do not own the buffer. */
695 /* Initially we are not debugging. */
700 }
702 /* Frees all resources associated with LEXER. */
704 static void
706 {
710 }
712 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
713 be used. The point of this flag is to help the compiler to fold away calls
714 to cp_lexer_debugging_p within this source file at compile time, when the
715 lexer is not being debugged. */
717 #define LEXER_DEBUGGING_ENABLED_P false
719 /* Returns nonzero if debugging information should be output. */
723 {
728 }
733 {
737 }
741 {
743 }
747 {
749 }
753 {
756 else
758 }
762 {
765 /* Skip past purged tokens. */
767 {
769 tp--;
770 }
773 }
775 /* nonzero if we are presently saving tokens. */
779 {
781 }
783 /* Store the next token from the preprocessor in *TOKEN. Return true
784 if we reach EOF. If LEXER is NULL, assume we are handling an
785 initial #pragma pch_preprocess, and thus want the lexer to return
786 processed strings. */
788 static void
790 {
793 /* Get a new token from the preprocessor. */
794 token->type
801 /* On some systems, some header files are surrounded by an
802 implicit extern "C" block. Set a flag in the token if it
803 comes from such a header. */
808 /* Check to see if this token is a keyword. */
810 {
812 {
813 /* Mark this token as a keyword. */
815 /* Record which keyword. */
817 }
818 else
819 {
823 {
824 /* Warn about the C++0x keyword (but still treat it as
825 an identifier). */
830 /* Clear out the C_RID_CODE so we don't warn about this
831 particular identifier-turned-keyword again. */
833 }
836 }
837 }
839 {
840 /* This only happens in Objective-C++; it must be a keyword. */
843 {
844 /* Replace 'class' with '@class', 'private' with '@private',
845 etc. This prevents confusion with the C++ keyword
846 'class', and makes the tokens consistent with other
847 Objective-C 'AT' keywords. For example '@class' is
848 reported as RID_AT_CLASS which is consistent with
849 '@synchronized', which is reported as
850 RID_AT_SYNCHRONIZED.
851 */
861 }
862 }
863 }
865 /* Update the globals input_location and the input file stack from TOKEN. */
868 {
870 {
872 }
873 }
875 /* Update the globals input_location and the input file stack from LEXER. */
878 {
881 }
883 /* Return a pointer to the next token in the token stream, but do not
884 consume it. */
888 {
890 {
894 }
896 }
898 /* Return true if the next token has the indicated TYPE. */
902 {
904 }
906 /* Return true if the next token does not have the indicated TYPE. */
910 {
912 }
914 /* Return true if the next token is the indicated KEYWORD. */
918 {
920 }
924 {
926 }
930 {
932 }
934 /* Return true if the next token is not the indicated KEYWORD. */
938 {
940 }
942 /* Return true if KEYWORD can start a decl-specifier. */
944 bool
946 {
948 {
949 /* auto specifier: storage-class-specifier in C++,
950 simple-type-specifier in C++0x. */
952 /* Storage classes. */
958 /* Elaborated type specifiers. */
964 /* Simple type specifiers. */
978 /* GNU extensions. */
981 /* C++0x extensions. */
993 }
994 }
996 /* Return true if the next token is a keyword for a decl-specifier. */
998 static bool
1000 {
1005 }
1007 /* Returns TRUE iff the token T begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Returns TRUE iff the next token begins a decltype type. */
1018 static bool
1020 {
1023 }
1025 /* Called when processing a token with tree_check_value; perform or defer the
1026 associated checks and return the value. */
1028 static tree
1030 {
1031 /* Perform any access checks that were deferred. */
1036 {
1042 }
1043 /* Return the stored value. */
1045 }
1047 /* Return a pointer to the Nth token in the token stream. If N is 1,
1048 then this is precisely equivalent to cp_lexer_peek_token (except
1049 that it is not inline). One would like to disallow that case, but
1050 there is one case (cp_parser_nth_token_starts_template_id) where
1051 the caller passes a variable for N and it might be 1. */
1055 {
1058 /* N is 1-based, not zero-based. */
1069 {
1072 {
1075 }
1079 }
1082 {
1085 }
1088 }
1090 /* Return the next token, and advance the lexer's next_token pointer
1091 to point to the next non-purged token. */
1095 {
1101 do
1102 {
1105 {
1108 }
1110 }
1115 /* Provide debugging output. */
1117 {
1121 }
1124 }
1126 /* Permanently remove the next token from the token stream, and
1127 advance the next_token pointer to refer to the next non-purged
1128 token. */
1130 static void
1132 {
1141 do
1142 {
1143 tok++;
1145 {
1148 }
1149 }
1152 }
1154 /* Permanently remove all tokens after TOK, up to, but not
1155 including, the token that will be returned next by
1156 cp_lexer_peek_token. */
1158 static void
1160 {
1169 {
1174 }
1175 }
1177 /* Begin saving tokens. All tokens consumed after this point will be
1178 preserved. */
1180 static void
1182 {
1183 /* Provide debugging output. */
1188 }
1190 /* Commit to the portion of the token stream most recently saved. */
1192 static void
1194 {
1195 /* Provide debugging output. */
1200 }
1202 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1203 to the token stream. Stop saving tokens. */
1205 static void
1207 {
1208 /* Provide debugging output. */
1213 }
1215 /* RAII wrapper around the above functions, with sanity checking. Creating
1216 a variable saves tokens, which are committed when the variable is
1217 destroyed unless they are explicitly rolled back by calling the rollback
1218 member function. */
1220 struct saved_token_sentinel
1221 {
1226 {
1229 }
1231 {
1234 }
1236 {
1240 }
1241 };
1243 /* Print a representation of the TOKEN on the STREAM. */
1245 static void
1247 {
1248 /* We don't use cpp_type2name here because the parser defines
1249 a few tokens of its own. */
1251 /* cpplib-defined token types */
1252 #define OP(e, s) #e,
1253 #define TK(e, s) #e,
1254 TTYPE_TABLE
1255 #undef OP
1256 #undef TK
1257 /* C++ parser token types - see "Manifest constants", above. */
1261 };
1263 /* For some tokens, print the associated data. */
1265 {
1267 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1268 For example, `struct' is mapped to an INTEGER_CST. */
1271 /* fall through */
1289 /* If we have a name for the token, print it out. Otherwise, we
1290 simply give the numeric code. */
1293 else
1296 }
1297 }
1299 DEBUG_FUNCTION void
1301 {
1304 }
1306 DEBUG_FUNCTION void
1308 {
1311 else
1313 }
1316 /* Start emitting debugging information. */
1318 static void
1320 {
1327 }
1329 /* Stop emitting debugging information. */
1331 static void
1333 {
1340 }
1342 /* Create a new cp_token_cache, representing a range of tokens. */
1346 {
1351 }
1353 /* Diagnose if #pragma omp declare simd isn't followed immediately
1354 by function declaration or definition. */
1358 {
1360 {
1364 }
1365 }
1367 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1368 and put that into "omp declare simd" attribute. */
1372 {
1374 {
1376 {
1379 }
1381 {
1384 }
1385 }
1386 }
1388 /* Diagnose if #pragma acc routine isn't followed immediately by function
1389 declaration or definition. */
1393 {
1395 {
1397 "%<#pragma acc routine%> not immediately followed by "
1400 }
1401 }
1402 \f
1403 /* Decl-specifiers. */
1405 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1407 static void
1409 {
1411 }
1413 /* Declarators. */
1415 /* Nothing other than the parser should be creating declarators;
1416 declarators are a semi-syntactic representation of C++ entities.
1417 Other parts of the front end that need to create entities (like
1418 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1421 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1431 /* An erroneous declarator. */
1434 /* The obstack on which declarators and related data structures are
1435 allocated. */
1438 /* Alloc BYTES from the declarator memory pool. */
1442 {
1444 }
1446 /* Allocate a declarator of the indicated KIND. Clear fields that are
1447 common to all declarators. */
1451 {
1464 }
1466 /* Make a declarator for a generalized identifier. If
1467 QUALIFYING_SCOPE is non-NULL, the identifier is
1468 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1469 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1470 is, if any. */
1474 special_function_kind sfk)
1475 {
1478 /* It is valid to write:
1480 class C { void f(); };
1481 typedef C D;
1482 void D::f();
1484 The standard is not clear about whether `typedef const C D' is
1485 legal; as of 2002-09-15 the committee is considering that
1486 question. EDG 3.0 allows that syntax. Therefore, we do as
1487 well. */
1501 }
1503 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1504 of modifiers such as const or volatile to apply to the pointer
1505 type, represented as identifiers. ATTRIBUTES represent the attributes that
1506 appertain to the pointer or reference. */
1508 cp_declarator *
1510 tree attributes)
1511 {
1519 {
1523 }
1524 else
1530 }
1532 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1533 represent the attributes that appertain to the pointer or
1534 reference. */
1536 cp_declarator *
1539 {
1547 {
1551 }
1552 else
1558 }
1560 /* Like make_pointer_declarator -- but for a pointer to a non-static
1561 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1562 appertain to the pointer or reference. */
1564 cp_declarator *
1567 tree attributes)
1568 {
1577 {
1580 }
1581 else
1587 }
1589 /* Make a declarator for the function given by TARGET, with the
1590 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1591 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1592 indicates what exceptions can be thrown. */
1594 cp_declarator *
1596 tree parms,
1597 cp_cv_quals cv_qualifiers,
1598 cp_virt_specifiers virt_specifiers,
1599 cp_ref_qualifier ref_qualifier,
1600 tree tx_qualifier,
1601 tree exception_specification,
1602 tree late_return_type,
1603 tree requires_clause)
1604 {
1618 {
1622 }
1623 else
1627 }
1629 /* Make a declarator for an array of BOUNDS elements, each of which is
1630 defined by ELEMENT. */
1632 cp_declarator *
1634 {
1641 {
1645 }
1646 else
1650 }
1652 /* Determine whether the declarator we've seen so far can be a
1653 parameter pack, when followed by an ellipsis. */
1654 static bool
1656 {
1658 /* We already saw an ellipsis. */
1661 /* Search for a declarator name, or any other declarator that goes
1662 after the point where the ellipsis could appear in a parameter
1663 pack. If we find any of these, then this declarator can not be
1664 made into a parameter pack. */
1667 {
1669 {
1682 }
1683 }
1686 }
1690 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1691 DECLARATOR and DEFAULT_ARGUMENT. */
1693 cp_parameter_declarator *
1696 tree default_argument,
1697 location_t loc,
1699 {
1707 else
1715 }
1717 /* Returns true iff DECLARATOR is a declaration for a function. */
1719 static bool
1721 {
1723 {
1732 }
1734 }
1736 /* The parser. */
1738 /* Overview
1739 --------
1741 A cp_parser parses the token stream as specified by the C++
1742 grammar. Its job is purely parsing, not semantic analysis. For
1743 example, the parser breaks the token stream into declarators,
1744 expressions, statements, and other similar syntactic constructs.
1745 It does not check that the types of the expressions on either side
1746 of an assignment-statement are compatible, or that a function is
1747 not declared with a parameter of type `void'.
1749 The parser invokes routines elsewhere in the compiler to perform
1750 semantic analysis and to build up the abstract syntax tree for the
1751 code processed.
1753 The parser (and the template instantiation code, which is, in a
1754 way, a close relative of parsing) are the only parts of the
1755 compiler that should be calling push_scope and pop_scope, or
1756 related functions. The parser (and template instantiation code)
1757 keeps track of what scope is presently active; everything else
1758 should simply honor that. (The code that generates static
1759 initializers may also need to set the scope, in order to check
1760 access control correctly when emitting the initializers.)
1762 Methodology
1763 -----------
1765 The parser is of the standard recursive-descent variety. Upcoming
1766 tokens in the token stream are examined in order to determine which
1767 production to use when parsing a non-terminal. Some C++ constructs
1768 require arbitrary look ahead to disambiguate. For example, it is
1769 impossible, in the general case, to tell whether a statement is an
1770 expression or declaration without scanning the entire statement.
1771 Therefore, the parser is capable of "parsing tentatively." When the
1772 parser is not sure what construct comes next, it enters this mode.
1773 Then, while we attempt to parse the construct, the parser queues up
1774 error messages, rather than issuing them immediately, and saves the
1775 tokens it consumes. If the construct is parsed successfully, the
1776 parser "commits", i.e., it issues any queued error messages and
1777 the tokens that were being preserved are permanently discarded.
1778 If, however, the construct is not parsed successfully, the parser
1779 rolls back its state completely so that it can resume parsing using
1780 a different alternative.
1782 Future Improvements
1783 -------------------
1785 The performance of the parser could probably be improved substantially.
1786 We could often eliminate the need to parse tentatively by looking ahead
1787 a little bit. In some places, this approach might not entirely eliminate
1788 the need to parse tentatively, but it might still speed up the average
1789 case. */
1791 /* Flags that are passed to some parsing functions. These values can
1792 be bitwise-ored together. */
1794 enum
1795 {
1796 /* No flags. */
1798 /* The construct is optional. If it is not present, then no error
1799 should be issued. */
1801 /* When parsing a type-specifier, treat user-defined type-names
1802 as non-type identifiers. */
1804 /* When parsing a type-specifier, do not try to parse a class-specifier
1805 or enum-specifier. */
1807 /* When parsing a decl-specifier-seq, only allow type-specifier or
1808 constexpr. */
1810 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1812 };
1814 /* This type is used for parameters and variables which hold
1815 combinations of the above flags. */
1818 /* The different kinds of declarators we want to parse. */
1820 enum cp_parser_declarator_kind
1821 {
1822 /* We want an abstract declarator. */
1823 CP_PARSER_DECLARATOR_ABSTRACT,
1824 /* We want a named declarator. */
1825 CP_PARSER_DECLARATOR_NAMED,
1826 /* We don't mind, but the name must be an unqualified-id. */
1827 CP_PARSER_DECLARATOR_EITHER
1828 };
1830 /* The precedence values used to parse binary expressions. The minimum value
1831 of PREC must be 1, because zero is reserved to quickly discriminate
1832 binary operators from other tokens. */
1834 enum cp_parser_prec
1835 {
1836 PREC_NOT_OPERATOR,
1837 PREC_LOGICAL_OR_EXPRESSION,
1838 PREC_LOGICAL_AND_EXPRESSION,
1839 PREC_INCLUSIVE_OR_EXPRESSION,
1840 PREC_EXCLUSIVE_OR_EXPRESSION,
1841 PREC_AND_EXPRESSION,
1842 PREC_EQUALITY_EXPRESSION,
1843 PREC_RELATIONAL_EXPRESSION,
1844 PREC_SHIFT_EXPRESSION,
1845 PREC_ADDITIVE_EXPRESSION,
1846 PREC_MULTIPLICATIVE_EXPRESSION,
1847 PREC_PM_EXPRESSION,
1848 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1849 };
1851 /* A mapping from a token type to a corresponding tree node type, with a
1852 precedence value. */
1854 struct cp_parser_binary_operations_map_node
1855 {
1856 /* The token type. */
1858 /* The corresponding tree code. */
1860 /* The precedence of this operator. */
1862 };
1864 struct cp_parser_expression_stack_entry
1865 {
1866 /* Left hand side of the binary operation we are currently
1867 parsing. */
1868 cp_expr lhs;
1869 /* Original tree code for left hand side, if it was a binary
1870 expression itself (used for -Wparentheses). */
1872 /* Tree code for the binary operation we are parsing. */
1874 /* Precedence of the binary operation we are parsing. */
1876 /* Location of the binary operation we are parsing. */
1877 location_t loc;
1878 };
1880 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1881 entries because precedence levels on the stack are monotonically
1882 increasing. */
1886 /* Prototypes. */
1888 /* Constructors and destructors. */
1893 /* Class variables. */
1897 /* The operator-precedence table used by cp_parser_binary_expression.
1898 Transformed into an associative array (binops_by_token) by
1899 cp_parser_new. */
1932 };
1934 /* The same as binops, but initialized by cp_parser_new so that
1935 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1936 for speed. */
1939 /* Constructors and destructors. */
1941 /* Construct a new context. The context below this one on the stack
1942 is given by NEXT. */
1946 {
1949 /* Allocate the storage. */
1951 {
1952 /* Pull the first entry from the free list. */
1956 }
1957 else
1960 /* No errors have occurred yet in this context. */
1962 /* If this is not the bottommost context, copy information that we
1963 need from the previous context. */
1965 {
1966 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1967 expression, then we are parsing one in this context, too. */
1969 /* Thread the stack. */
1971 }
1974 }
1976 /* Managing the unparsed function queues. */
1978 #define unparsed_funs_with_default_args \
1979 parser->unparsed_queues->last ().funs_with_default_args
1980 #define unparsed_funs_with_definitions \
1981 parser->unparsed_queues->last ().funs_with_definitions
1982 #define unparsed_nsdmis \
1983 parser->unparsed_queues->last ().nsdmis
1984 #define unparsed_classes \
1985 parser->unparsed_queues->last ().classes
1987 static void
1989 {
1992 }
1994 static void
1996 {
1999 }
2001 /* Prototypes. */
2003 /* Constructors and destructors. */
2008 /* Routines to parse various constructs.
2010 Those that return `tree' will return the error_mark_node (rather
2011 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2012 Sometimes, they will return an ordinary node if error-recovery was
2013 attempted, even though a parse error occurred. So, to check
2014 whether or not a parse error occurred, you should always use
2015 cp_parser_error_occurred. If the construct is optional (indicated
2016 either by an `_opt' in the name of the function that does the
2017 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2018 the construct is not present. */
2020 /* Lexical conventions [gram.lex] */
2022 static cp_expr cp_parser_identifier
2024 static cp_expr cp_parser_string_literal
2026 static cp_expr cp_parser_userdef_char_literal
2028 static tree cp_parser_userdef_string_literal
2030 static cp_expr cp_parser_userdef_numeric_literal
2033 /* Basic concepts [gram.basic] */
2035 static bool cp_parser_translation_unit
2038 /* Expressions [gram.expr] */
2040 static cp_expr cp_parser_primary_expression
2042 static cp_expr cp_parser_id_expression
2044 static cp_expr cp_parser_unqualified_id
2046 static tree cp_parser_nested_name_specifier_opt
2048 static tree cp_parser_nested_name_specifier
2050 static tree cp_parser_qualifying_entity
2052 static cp_expr cp_parser_postfix_expression
2054 static tree cp_parser_postfix_open_square_expression
2056 static tree cp_parser_postfix_dot_deref_expression
2060 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2062 static void cp_parser_pseudo_destructor_name
2064 static cp_expr cp_parser_unary_expression
2066 static enum tree_code cp_parser_unary_operator
2068 static tree cp_parser_new_expression
2072 static tree cp_parser_new_type_id
2080 static tree cp_parser_delete_expression
2082 static cp_expr cp_parser_cast_expression
2084 static cp_expr cp_parser_binary_expression
2086 static tree cp_parser_question_colon_clause
2088 static cp_expr cp_parser_assignment_expression
2090 static enum tree_code cp_parser_assignment_operator_opt
2092 static cp_expr cp_parser_expression
2094 static cp_expr cp_parser_constant_expression
2096 static cp_expr cp_parser_builtin_offsetof
2098 static cp_expr cp_parser_lambda_expression
2100 static void cp_parser_lambda_introducer
2102 static bool cp_parser_lambda_declarator_opt
2104 static void cp_parser_lambda_body
2107 /* Statements [gram.stmt.stmt] */
2109 static void cp_parser_statement
2111 static void cp_parser_label_for_labeled_statement
2113 static tree cp_parser_expression_statement
2115 static tree cp_parser_compound_statement
2117 static void cp_parser_statement_seq_opt
2119 static tree cp_parser_selection_statement
2121 static tree cp_parser_condition
2123 static tree cp_parser_iteration_statement
2125 static bool cp_parser_init_statement
2127 static tree cp_parser_for
2129 static tree cp_parser_c_for
2131 static tree cp_parser_range_for
2133 static void do_range_for_auto_deduction
2135 static tree cp_parser_perform_range_for_lookup
2137 static tree cp_parser_range_for_member_function
2139 static tree cp_parser_jump_statement
2141 static void cp_parser_declaration_statement
2144 static tree cp_parser_implicitly_scoped_statement
2146 static void cp_parser_already_scoped_statement
2149 /* Declarations [gram.dcl.dcl] */
2151 static void cp_parser_declaration_seq_opt
2153 static void cp_parser_declaration
2155 static void cp_parser_block_declaration
2157 static void cp_parser_simple_declaration
2159 static void cp_parser_decl_specifier_seq
2161 static tree cp_parser_storage_class_specifier_opt
2163 static tree cp_parser_function_specifier_opt
2165 static tree cp_parser_type_specifier
2168 static tree cp_parser_simple_type_specifier
2170 static tree cp_parser_type_name
2172 static tree cp_parser_type_name
2174 static tree cp_parser_nonclass_name
2176 static tree cp_parser_elaborated_type_specifier
2178 static tree cp_parser_enum_specifier
2180 static void cp_parser_enumerator_list
2182 static void cp_parser_enumerator_definition
2184 static tree cp_parser_namespace_name
2186 static void cp_parser_namespace_definition
2188 static void cp_parser_namespace_body
2190 static tree cp_parser_qualified_namespace_specifier
2192 static void cp_parser_namespace_alias_definition
2194 static bool cp_parser_using_declaration
2196 static void cp_parser_using_directive
2198 static tree cp_parser_alias_declaration
2200 static void cp_parser_asm_definition
2202 static void cp_parser_linkage_specification
2204 static void cp_parser_static_assert
2206 static tree cp_parser_decltype
2208 static tree cp_parser_decomposition_declaration
2211 /* Declarators [gram.dcl.decl] */
2213 static tree cp_parser_init_declarator
2220 static enum tree_code cp_parser_ptr_operator
2222 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2224 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2226 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2228 static tree cp_parser_tx_qualifier_opt
2230 static tree cp_parser_late_return_type_opt
2232 static tree cp_parser_declarator_id
2234 static tree cp_parser_type_id
2236 static tree cp_parser_template_type_arg
2239 static tree cp_parser_type_id_1
2241 static void cp_parser_type_specifier_seq
2243 static tree cp_parser_parameter_declaration_clause
2245 static tree cp_parser_parameter_declaration_list
2249 static tree cp_parser_default_argument
2251 static void cp_parser_function_body
2253 static tree cp_parser_initializer
2255 static cp_expr cp_parser_initializer_clause
2257 static cp_expr cp_parser_braced_list
2262 static void cp_parser_ctor_initializer_opt_and_function_body
2265 static tree cp_parser_late_parsing_omp_declare_simd
2268 static tree cp_parser_late_parsing_cilk_simd_fn_info
2271 static tree cp_parser_late_parsing_oacc_routine
2274 static tree synthesize_implicit_template_parm
2276 static tree finish_fully_implicit_template
2279 /* Classes [gram.class] */
2281 static tree cp_parser_class_name
2283 static tree cp_parser_class_specifier
2285 static tree cp_parser_class_head
2287 static enum tag_types cp_parser_class_key
2289 static void cp_parser_type_parameter_key
2291 static void cp_parser_member_specification_opt
2293 static void cp_parser_member_declaration
2295 static tree cp_parser_pure_specifier
2297 static tree cp_parser_constant_initializer
2300 /* Derived classes [gram.class.derived] */
2302 static tree cp_parser_base_clause
2304 static tree cp_parser_base_specifier
2307 /* Special member functions [gram.special] */
2309 static tree cp_parser_conversion_function_id
2311 static tree cp_parser_conversion_type_id
2315 static void cp_parser_ctor_initializer_opt
2317 static void cp_parser_mem_initializer_list
2319 static tree cp_parser_mem_initializer
2321 static tree cp_parser_mem_initializer_id
2324 /* Overloading [gram.over] */
2326 static cp_expr cp_parser_operator_function_id
2328 static cp_expr cp_parser_operator
2331 /* Templates [gram.temp] */
2333 static void cp_parser_template_declaration
2335 static tree cp_parser_template_parameter_list
2337 static tree cp_parser_template_parameter
2339 static tree cp_parser_type_parameter
2341 static tree cp_parser_template_id
2343 static tree cp_parser_template_name
2345 static tree cp_parser_template_argument_list
2347 static tree cp_parser_template_argument
2349 static void cp_parser_explicit_instantiation
2351 static void cp_parser_explicit_specialization
2354 /* Exception handling [gram.exception] */
2356 static tree cp_parser_try_block
2358 static void cp_parser_function_try_block
2360 static void cp_parser_handler_seq
2362 static void cp_parser_handler
2364 static tree cp_parser_exception_declaration
2366 static tree cp_parser_throw_expression
2368 static tree cp_parser_exception_specification_opt
2370 static tree cp_parser_type_id_list
2373 /* GNU Extensions */
2375 static tree cp_parser_asm_specification_opt
2377 static tree cp_parser_asm_operand_list
2379 static tree cp_parser_asm_clobber_list
2381 static tree cp_parser_asm_label_list
2383 static bool cp_next_tokens_can_be_attribute_p
2385 static bool cp_next_tokens_can_be_gnu_attribute_p
2387 static bool cp_next_tokens_can_be_std_attribute_p
2389 static bool cp_nth_tokens_can_be_std_attribute_p
2391 static bool cp_nth_tokens_can_be_gnu_attribute_p
2393 static bool cp_nth_tokens_can_be_attribute_p
2395 static tree cp_parser_attributes_opt
2397 static tree cp_parser_gnu_attributes_opt
2399 static tree cp_parser_gnu_attribute_list
2401 static tree cp_parser_std_attribute
2403 static tree cp_parser_std_attribute_spec
2405 static tree cp_parser_std_attribute_spec_seq
2407 static bool cp_parser_extension_opt
2409 static void cp_parser_label_declaration
2412 /* Concept Extensions */
2414 static tree cp_parser_requires_clause
2416 static tree cp_parser_requires_clause_opt
2418 static tree cp_parser_requires_expression
2420 static tree cp_parser_requirement_parameter_list
2422 static tree cp_parser_requirement_body
2424 static tree cp_parser_requirement_list
2426 static tree cp_parser_requirement
2428 static tree cp_parser_simple_requirement
2430 static tree cp_parser_compound_requirement
2432 static tree cp_parser_type_requirement
2434 static tree cp_parser_nested_requirement
2437 /* Transactional Memory Extensions */
2439 static tree cp_parser_transaction
2441 static tree cp_parser_transaction_expression
2443 static void cp_parser_function_transaction
2445 static tree cp_parser_transaction_cancel
2449 pragma_external,
2450 pragma_member,
2451 pragma_objc_icode,
2452 pragma_stmt,
2453 pragma_compound
2454 };
2455 static bool cp_parser_pragma
2458 /* Objective-C++ Productions */
2460 static tree cp_parser_objc_message_receiver
2462 static tree cp_parser_objc_message_args
2464 static tree cp_parser_objc_message_expression
2466 static cp_expr cp_parser_objc_encode_expression
2468 static tree cp_parser_objc_defs_expression
2470 static tree cp_parser_objc_protocol_expression
2472 static tree cp_parser_objc_selector_expression
2474 static cp_expr cp_parser_objc_expression
2476 static bool cp_parser_objc_selector_p
2478 static tree cp_parser_objc_selector
2480 static tree cp_parser_objc_protocol_refs_opt
2482 static void cp_parser_objc_declaration
2484 static tree cp_parser_objc_statement
2486 static bool cp_parser_objc_valid_prefix_attributes
2488 static void cp_parser_objc_at_property_declaration
2490 static void cp_parser_objc_at_synthesize_declaration
2492 static void cp_parser_objc_at_dynamic_declaration
2494 static tree cp_parser_objc_struct_declaration
2497 /* Utility Routines */
2499 static cp_expr cp_parser_lookup_name
2501 static tree cp_parser_lookup_name_simple
2503 static tree cp_parser_maybe_treat_template_as_class
2505 static bool cp_parser_check_declarator_template_parameters
2507 static bool cp_parser_check_template_parameters
2509 static cp_expr cp_parser_simple_cast_expression
2511 static tree cp_parser_global_scope_opt
2513 static bool cp_parser_constructor_declarator_p
2515 static tree cp_parser_function_definition_from_specifiers_and_declarator
2517 static tree cp_parser_function_definition_after_declarator
2519 static bool cp_parser_template_declaration_after_export
2521 static void cp_parser_perform_template_parameter_access_checks
2523 static tree cp_parser_single_declaration
2525 static cp_expr cp_parser_functional_cast
2527 static tree cp_parser_save_member_function_body
2529 static tree cp_parser_save_nsdmi
2531 static tree cp_parser_enclosed_template_argument_list
2533 static void cp_parser_save_default_args
2535 static void cp_parser_late_parsing_for_member
2537 static tree cp_parser_late_parse_one_default_arg
2539 static void cp_parser_late_parsing_nsdmi
2541 static void cp_parser_late_parsing_default_args
2543 static tree cp_parser_sizeof_operand
2545 static tree cp_parser_trait_expr
2547 static bool cp_parser_declares_only_class_p
2549 static void cp_parser_set_storage_class
2551 static void cp_parser_set_decl_spec_type
2553 static void set_and_check_decl_spec_loc
2556 static bool cp_parser_friend_p
2558 static void cp_parser_required_error
2564 static bool cp_parser_token_starts_function_definition_p
2566 static bool cp_parser_next_token_starts_class_definition_p
2568 static bool cp_parser_next_token_ends_template_argument_p
2570 static bool cp_parser_nth_token_starts_template_argument_list_p
2572 static enum tag_types cp_parser_token_is_class_key
2574 static enum tag_types cp_parser_token_is_type_parameter_key
2576 static void cp_parser_check_class_key
2578 static void cp_parser_check_access_in_redeclaration
2580 static bool cp_parser_optional_template_keyword
2582 static void cp_parser_pre_parsed_nested_name_specifier
2584 static bool cp_parser_cache_group
2586 static tree cp_parser_cache_defarg
2588 static void cp_parser_parse_tentatively
2590 static void cp_parser_commit_to_tentative_parse
2592 static void cp_parser_commit_to_topmost_tentative_parse
2594 static void cp_parser_abort_tentative_parse
2596 static bool cp_parser_parse_definitely
2600 static bool cp_parser_uncommitted_to_tentative_parse_p
2602 static void cp_parser_error
2604 static void cp_parser_name_lookup_error
2606 static bool cp_parser_simulate_error
2608 static bool cp_parser_check_type_definition
2610 static void cp_parser_check_for_definition_in_return_type
2612 static void cp_parser_check_for_invalid_template_id
2614 static bool cp_parser_non_integral_constant_expression
2616 static void cp_parser_diagnose_invalid_type_name
2618 static bool cp_parser_parse_and_diagnose_invalid_type_name
2620 static int cp_parser_skip_to_closing_parenthesis
2622 static void cp_parser_skip_to_end_of_statement
2624 static void cp_parser_consume_semicolon_at_end_of_statement
2626 static void cp_parser_skip_to_end_of_block_or_statement
2628 static bool cp_parser_skip_to_closing_brace
2630 static void cp_parser_skip_to_end_of_template_parameter_list
2632 static void cp_parser_skip_to_pragma_eol
2634 static bool cp_parser_error_occurred
2636 static bool cp_parser_allow_gnu_extensions_p
2638 static bool cp_parser_is_pure_string_literal
2640 static bool cp_parser_is_string_literal
2642 static bool cp_parser_is_keyword
2644 static tree cp_parser_make_typename_type
2648 static bool cp_parser_compound_literal_p
2650 static bool cp_parser_array_designator_p
2652 static bool cp_parser_init_statement_p
2654 static bool cp_parser_skip_to_closing_square_bracket
2657 /* Concept-related syntactic transformations */
2662 // -------------------------------------------------------------------------- //
2663 // Unevaluated Operand Guard
2664 //
2665 // Implementation of an RAII helper for unevaluated operand parsing.
2667 {
2670 }
2673 {
2676 }
2678 // -------------------------------------------------------------------------- //
2679 // Tentative Parsing
2681 /* Returns nonzero if we are parsing tentatively. */
2685 {
2687 }
2689 /* Returns nonzero if TOKEN is a string literal. */
2691 static bool
2693 {
2699 }
2701 /* Returns nonzero if TOKEN is a string literal
2702 of a user-defined string literal. */
2704 static bool
2706 {
2713 }
2715 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2717 static bool
2719 {
2721 }
2723 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2724 PRAGMA_NONE. */
2726 static enum pragma_kind
2728 {
2731 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2733 }
2735 /* Helper function for cp_parser_error.
2736 Having peeked a token of kind TOK1_KIND that might signify
2737 a conflict marker, peek successor tokens to determine
2738 if we actually do have a conflict marker.
2739 Specifically, we consider a run of 7 '<', '=' or '>' characters
2740 at the start of a line as a conflict marker.
2741 These come through the lexer as three pairs and a single,
2742 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2743 If it returns true, *OUT_LOC is written to with the location/range
2744 of the marker. */
2746 static bool
2749 {
2760 /* It must be at the start of the line. */
2765 /* We have a conflict marker. Construct a location of the form:
2766 <<<<<<<
2767 ^~~~~~~
2768 with start == caret, finishing at the end of the marker. */
2773 }
2775 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2776 RT_CLOSE_PAREN. */
2780 {
2782 {
2790 }
2791 }
2793 /* Attempt to convert TOKEN_DESC from a required_token to an
2794 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2796 static enum cpp_ttype
2798 {
2800 {
2821 /* Use CPP_EOF as a "no completions possible" code. */
2823 }
2824 }
2827 /* Subroutine of cp_parser_error and cp_parser_required_error.
2829 Issue a diagnostic of the form
2830 FILE:LINE: MESSAGE before TOKEN
2831 where TOKEN is the next token in the input stream. MESSAGE
2832 (specified by the caller) is usually of the form "expected
2833 OTHER-TOKEN".
2835 This bypasses the check for tentative passing, and potentially
2836 adds material needed by cp_parser_required_error.
2838 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2839 suggesting insertion of the missing token.
2841 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2842 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2843 location. */
2845 static void
2847 required_token missing_token_desc,
2848 location_t matching_location)
2849 {
2851 /* This diagnostic makes more sense if it is tagged to the line
2852 of the token we just peeked at. */
2856 {
2861 }
2863 /* If this is actually a conflict marker, report it as such. */
2867 {
2868 location_t loc;
2870 {
2873 }
2874 }
2881 {
2882 /* Potentially supply a fix-it hint, suggesting to add the
2883 missing token immediately after the *previous* token.
2884 This may move the primary location within richloc. */
2886 location_t prev_token_loc
2890 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2891 Attempt to consolidate diagnostics by printing it as a
2892 secondary range within the main diagnostic. */
2894 added_matching_location
2896 }
2898 /* Actually emit the error. */
2900 /* Because c_parser_error does not understand
2901 CPP_KEYWORD, keywords are treated like
2902 identifiers. */
2907 {
2908 /* If we weren't able to consolidate matching_location, then
2909 print it as a secondary diagnostic. */
2914 }
2915 }
2917 /* If not parsing tentatively, issue a diagnostic of the form
2918 FILE:LINE: MESSAGE before TOKEN
2919 where TOKEN is the next token in the input stream. MESSAGE
2920 (specified by the caller) is usually of the form "expected
2921 OTHER-TOKEN". */
2923 static void
2925 {
2928 }
2930 /* Issue an error about name-lookup failing. NAME is the
2931 IDENTIFIER_NODE DECL is the result of
2932 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2933 the thing that we hoped to find. */
2935 static void
2937 tree name,
2938 tree decl,
2939 name_lookup_error desired,
2940 location_t location)
2941 {
2942 /* If name lookup completely failed, tell the user that NAME was not
2943 declared. */
2945 {
2958 else
2960 }
2962 {
2964 {
2981 }
2982 }
2984 {
2986 {
2996 name);
3000 }
3001 }
3002 else
3003 {
3005 {
3018 }
3019 }
3020 }
3022 /* If we are parsing tentatively, remember that an error has occurred
3023 during this tentative parse. Returns true if the error was
3024 simulated; false if a message should be issued by the caller. */
3026 static bool
3028 {
3030 {
3033 }
3035 }
3037 /* This function is called when a type is defined. If type
3038 definitions are forbidden at this point, an error message is
3039 issued. */
3041 static bool
3043 {
3044 /* If types are forbidden here, issue a message. */
3046 {
3047 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3048 in the message need to be interpreted. */
3051 }
3053 }
3055 /* This function is called when the DECLARATOR is processed. The TYPE
3056 was a type defined in the decl-specifiers. If it is invalid to
3057 define a type in the decl-specifiers for DECLARATOR, an error is
3058 issued. TYPE_LOCATION is the location of TYPE and is used
3059 for error reporting. */
3061 static void
3064 {
3065 /* [dcl.fct] forbids type definitions in return types.
3066 Unfortunately, it's not easy to know whether or not we are
3067 processing a return type until after the fact. */
3075 {
3080 type);
3081 }
3082 }
3084 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3085 "<" in any valid C++ program. If the next token is indeed "<",
3086 issue a message warning the user about what appears to be an
3087 invalid attempt to form a template-id. LOCATION is the location
3088 of the type-specifier (TYPE) */
3090 static void
3092 tree type,
3094 location_t location)
3095 {
3099 {
3105 {
3108 else
3110 }
3111 else
3113 /* Remember the location of the invalid "<". */
3116 /* Consume the "<". */
3118 /* Parse the template arguments. */
3120 /* Permanently remove the invalid template arguments so that
3121 this error message is not issued again. */
3124 }
3125 }
3127 /* If parsing an integral constant-expression, issue an error message
3128 about the fact that THING appeared and return true. Otherwise,
3129 return false. In either case, set
3130 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3132 static bool
3134 non_integral_constant thing)
3135 {
3138 {
3140 {
3143 {
3146 "ISO C++ forbids using a floating-point literal "
3151 "enumeration type cannot appear in a "
3242 }
3246 }
3247 }
3249 }
3251 /* Emit a diagnostic for an invalid type name. This function commits
3252 to the current active tentative parse, if any. (Otherwise, the
3253 problematic construct might be encountered again later, resulting
3254 in duplicate error messages.) LOCATION is the location of ID. */
3256 static void
3258 location_t location)
3259 {
3262 /* Try to lookup the identifier. */
3269 /* If the lookup was ambiguous, an error will already have
3270 been issued. */
3272 /* If the lookup found a template-name, it means that the user forgot
3273 to specify an argument list. Emit a useful error message. */
3275 {
3278 decl);
3283 }
3287 /* Something like 'unsigned A a;' */
3290 {
3291 /* Issue an error message. */
3292 name_hint hint;
3296 {
3302 }
3303 else
3305 /* If we're in a template class, it's possible that the user was
3306 referring to a type from a base class. For example:
3308 template <typename T> struct A { typedef T X; };
3309 template <typename T> struct B : public A<T> { X x; };
3311 The user should have said "typename A<T>::X". */
3327 {
3328 tree b;
3331 b;
3333 {
3337 {
3338 tree field;
3339 /* Go from a particular instantiation of the
3340 template (which will have an empty TYPE_FIELDs),
3341 to the main version. */
3344 field;
3348 {
3353 }
3356 }
3357 }
3358 }
3359 }
3360 /* Here we diagnose qualified-ids where the scope is actually correct,
3361 but the identifier does not resolve to a valid type name. */
3363 {
3365 {
3374 else
3380 }
3383 {
3384 /* A<T>::A<T>() */
3390 }
3393 {
3396 "need %<typename%> before %<%T::%D::%E%> because "
3400 id,
3403 else
3407 }
3409 {
3421 else
3427 }
3428 else
3430 }
3431 }
3433 /* Check for a common situation where a type-name should be present,
3434 but is not, and issue a sensible error message. Returns true if an
3435 invalid type-name was detected.
3437 The situation handled by this function are variable declarations of the
3438 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3439 Usually, `ID' should name a type, but if we got here it means that it
3440 does not. We try to emit the best possible error message depending on
3441 how exactly the id-expression looks like. */
3443 static bool
3445 {
3446 tree id;
3449 /* Avoid duplicate error about ambiguous lookup. */
3451 {
3455 }
3464 /* If the next token is a (, this is a function with no explicit return
3465 type, i.e. constructor, destructor or conversion op. */
3468 {
3471 }
3475 /* Emit a diagnostic for the invalid type. */
3477 out:
3478 /* If we aren't in the middle of a declarator (i.e. in a
3479 parameter-declaration-clause), skip to the end of the declaration;
3480 there's no point in trying to process it. */
3484 }
3486 /* Consume tokens up to, and including, the next non-nested closing `)'.
3487 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3488 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3489 found an unnested token of that type. */
3491 static int
3494 cpp_ttype or_ttype,
3496 {
3506 {
3509 /* Have we found what we're looking for before the closing paren? */
3515 {
3518 /* If we've run out of tokens, then there is no closing `)'. */
3521 /* This is good for lambda expression capture-lists. */
3531 /* This matches the processing in skip_to_end_of_statement. */
3551 {
3555 }
3560 }
3562 /* Consume the token. */
3564 }
3565 }
3567 /* Consume tokens up to, and including, the next non-nested closing `)'.
3568 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3569 are doing error recovery. Returns -1 if OR_COMMA is true and we
3570 found an unnested token of that type. */
3572 static int
3577 {
3581 }
3583 /* Consume tokens until we reach the end of the current statement.
3584 Normally, that will be just before consuming a `;'. However, if a
3585 non-nested `}' comes first, then we stop before consuming that. */
3587 static void
3589 {
3592 /* Unwind generic function template scope if necessary. */
3597 {
3601 {
3604 /* If we've run out of tokens, stop. */
3608 /* If the next token is a `;', we have reached the end of the
3609 statement. */
3615 /* If this is a non-nested '}', stop before consuming it.
3616 That way, when confronted with something like:
3618 { 3 + }
3620 we stop before consuming the closing '}', even though we
3621 have not yet reached a `;'. */
3625 /* If it is the closing '}' for a block that we have
3626 scanned, stop -- but only after consuming the token.
3627 That way given:
3629 void f g () { ... }
3630 typedef int I;
3632 we will stop after the body of the erroneously declared
3633 function, but before consuming the following `typedef'
3634 declaration. */
3636 {
3639 }
3648 }
3650 /* Consume the token. */
3652 }
3653 }
3655 /* This function is called at the end of a statement or declaration.
3656 If the next token is a semicolon, it is consumed; otherwise, error
3657 recovery is attempted. */
3659 static void
3661 {
3662 /* Look for the trailing `;'. */
3664 {
3665 /* If there is additional (erroneous) input, skip to the end of
3666 the statement. */
3668 /* If the next token is now a `;', consume it. */
3671 }
3672 }
3674 /* Skip tokens until we have consumed an entire block, or until we
3675 have consumed a non-nested `;'. */
3677 static void
3679 {
3682 /* Unwind generic function template scope if necessary. */
3687 {
3691 {
3694 /* If we've run out of tokens, stop. */
3698 /* Stop if this is an unnested ';'. */
3704 /* Stop if this is an unnested '}', or closes the outermost
3705 nesting level. */
3706 nesting_depth--;
3714 /* Nest. */
3715 nesting_depth++;
3720 }
3722 /* Consume the token. */
3724 }
3725 }
3727 /* Skip tokens until a non-nested closing curly brace is the next
3728 token, or there are no more tokens. Return true in the first case,
3729 false otherwise. */
3731 static bool
3733 {
3737 {
3741 {
3744 /* If we've run out of tokens, stop. */
3748 /* If the next token is a non-nested `}', then we have reached
3749 the end of the current block. */
3755 /* If it the next token is a `{', then we are entering a new
3756 block. Consume the entire block. */
3762 }
3764 /* Consume the token. */
3766 }
3767 }
3769 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3770 parameter is the PRAGMA token, allowing us to purge the entire pragma
3771 sequence. */
3773 static void
3775 {
3780 do
3784 /* Ensure that the pragma is not parsed again. */
3786 }
3788 /* Require pragma end of line, resyncing with it as necessary. The
3789 arguments are as for cp_parser_skip_to_pragma_eol. */
3791 static void
3793 {
3797 }
3799 /* This is a simple wrapper around make_typename_type. When the id is
3800 an unresolved identifier node, we can provide a superior diagnostic
3801 using cp_parser_diagnose_invalid_type_name. */
3803 static tree
3805 location_t id_location)
3806 {
3807 tree result;
3809 {
3815 }
3817 }
3819 /* This is a wrapper around the
3820 make_{pointer,ptrmem,reference}_declarator functions that decides
3821 which one to call based on the CODE and CLASS_TYPE arguments. The
3822 CODE argument should be one of the values returned by
3823 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3824 appertain to the pointer or reference. */
3828 cp_cv_quals cv_qualifiers,
3830 tree attributes)
3831 {
3838 else
3848 }
3850 /* Create a new C++ parser. */
3854 {
3859 /* cp_lexer_new_main is called before doing GC allocation because
3860 cp_lexer_new_main might load a PCH file. */
3863 /* Initialize the binops_by_token so that we can get the tree
3864 directly from the token. */
3872 /* For now, we always accept GNU extensions. */
3875 /* The `>' token is a greater-than operator, not the end of a
3876 template-id. */
3881 /* We are not parsing a constant-expression. */
3886 /* Local variable names are not forbidden. */
3889 /* We are not processing an `extern "C"' declaration. */
3892 /* We are not processing a declarator. */
3895 /* We are not processing a template-argument-list. */
3898 /* We are not in an iteration statement. */
3901 /* We are not in a switch statement. */
3904 /* We are not parsing a type-id inside an expression. */
3907 /* Declarations aren't implicitly extern "C". */
3910 /* String literals should be translated to the execution character set. */
3913 /* We are not parsing a function body. */
3916 /* We can correct until told otherwise. */
3919 /* The unparsed function queue is empty. */
3922 /* There are no classes being defined. */
3925 /* No template parameters apply. */
3928 /* Special parsing data structures. */
3933 /* Not declaring an implicit function template. */
3939 /* Allow constrained-type-specifiers. */
3942 /* We haven't yet seen an 'extern "C"'. */
3946 }
3948 /* Create a cp_lexer structure which will emit the tokens in CACHE
3949 and push it onto the parser's lexer stack. This is used for delayed
3950 parsing of in-class method bodies and default arguments, and should
3951 not be confused with tentative parsing. */
3952 static void
3954 {
3959 /* Move the current source position to that of the first token in the
3960 new lexer. */
3962 }
3964 /* Pop the top lexer off the parser stack. This is never used for the
3965 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3966 static void
3968 {
3973 /* Put the current source position back where it was before this
3974 lexer was pushed. */
3976 }
3978 /* Lexical conventions [gram.lex] */
3980 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3981 identifier. */
3983 static cp_expr
3985 {
3988 /* Look for the identifier. */
3990 /* Return the value. */
3993 else
3995 }
3997 /* Parse a sequence of adjacent string constants. Returns a
3998 TREE_STRING representing the combined, nul-terminated string
3999 constant. If TRANSLATE is true, translate the string to the
4000 execution character set. If WIDE_OK is true, a wide string is
4001 invalid here.
4003 C++98 [lex.string] says that if a narrow string literal token is
4004 adjacent to a wide string literal token, the behavior is undefined.
4005 However, C99 6.4.5p4 says that this results in a wide string literal.
4006 We follow C99 here, for consistency with the C front end.
4008 This code is largely lifted from lex_string() in c-lex.c.
4010 FUTURE: ObjC++ will need to handle @-strings here. */
4011 static cp_expr
4014 {
4015 tree value;
4022 tree string_tree;
4028 {
4031 }
4036 {
4040 }
4041 else
4042 {
4045 }
4048 /* Try to avoid the overhead of creating and destroying an obstack
4049 for the common case of just one string. */
4052 {
4060 {
4064 }
4065 else
4069 }
4070 else
4071 {
4076 do
4077 {
4079 count++;
4084 {
4087 {
4090 }
4093 {
4098 }
4100 }
4101 else
4105 {
4109 {
4113 "unsupported non-standard concatenation "
4115 }
4116 }
4124 {
4128 }
4129 else
4130 {
4134 }
4135 }
4138 /* A string literal built by concatenation has its caret=start at
4139 the start of the initial string, and its finish at the finish of
4140 the final string literal. */
4144 }
4147 {
4150 }
4154 {
4159 {
4174 }
4179 {
4184 else
4186 }
4187 }
4188 else
4189 /* cpp_interpret_string has issued an error. */
4196 }
4198 /* Look up a literal operator with the name and the exact arguments. */
4200 static tree
4202 {
4203 tree decl;
4209 {
4215 {
4218 {
4228 }
4231 /* May be this should be sufficient_parms_p instead,
4232 depending on how exactly should user-defined literals
4233 work in presence of default arguments on the literal
4234 operator parameters. */
4237 }
4238 }
4241 }
4243 /* Parse a user-defined char constant. Returns a call to a user-defined
4244 literal operator taking the character as an argument. */
4246 static cp_expr
4248 {
4256 /* Build up a call to the user-defined operator */
4257 /* Lookup the name we got back from the id-expression. */
4262 {
4267 }
4271 }
4273 /* A subroutine of cp_parser_userdef_numeric_literal to
4274 create a char... template parameter pack from a string node. */
4276 static tree
4278 {
4279 tree charvec;
4285 /* Fill in CHARVEC with all of the parameters. */
4290 /* Build the argument packs. */
4296 }
4298 /* A subroutine of cp_parser_userdef_numeric_literal to
4299 create a char... template parameter pack from a string node. */
4301 static tree
4303 {
4304 tree charvec;
4315 /* First template parm is character type. */
4318 /* Fill in CHARVEC with all of the parameters. */
4325 /* Build the argument packs. */
4331 }
4333 /* Parse a user-defined numeric constant. returns a call to a user-defined
4334 literal operator. */
4336 static cp_expr
4338 {
4349 /* Look for a literal operator taking the exact type of numeric argument
4350 as the literal value. */
4355 {
4357 tf_warning_or_error);
4360 {
4363 long_long_unsigned_type_node);
4364 }
4365 else
4366 {
4370 long_double_type_node);
4374 }
4378 }
4381 /* If the numeric argument didn't work, look for a raw literal
4382 operator taking a const char* argument consisting of the number
4383 in string format. */
4388 {
4390 tf_warning_or_error);
4393 }
4396 /* If the raw literal didn't work, look for a non-type template
4397 function with parameter pack char.... Call the function with
4398 template parameter characters representing the number. */
4402 {
4406 tf_warning_or_error);
4409 }
4418 }
4420 /* Parse a user-defined string constant. Returns a call to a user-defined
4421 literal operator taking a character pointer and the length of the string
4422 as arguments. */
4424 static tree
4426 {
4435 /* Build up a call to the user-defined operator. */
4436 /* Lookup the name we got back from the id-expression. */
4443 {
4445 tf_warning_or_error);
4448 }
4451 /* Look for a template function with typename parameter CharT
4452 and parameter pack CharT... Call the function with
4453 template parameter characters representing the string. */
4457 {
4461 tf_warning_or_error);
4464 }
4470 }
4473 /* Basic concepts [gram.basic] */
4475 /* Parse a translation-unit.
4477 translation-unit:
4478 declaration-seq [opt]
4480 Returns TRUE if all went well. */
4482 static bool
4484 {
4485 /* The address of the first non-permanent object on the declarator
4486 obstack. */
4491 /* Create the declarator obstack, if necessary. */
4493 {
4495 /* Create the error declarator. */
4497 /* Create the empty parameter list. */
4499 UNKNOWN_LOCATION);
4500 /* Remember where the base of the declarator obstack lies. */
4502 }
4506 /* If there are no tokens left then all went well. */
4508 {
4509 /* Get rid of the token array; we don't need it any more. */
4513 /* This file might have been a context that's implicitly extern
4514 "C". If so, pop the lang context. (Only relevant for PCH.) */
4516 {
4519 }
4521 /* Finish up. */
4525 }
4526 else
4527 {
4530 }
4532 /* Make sure the declarator obstack was fully cleaned up. */
4536 /* All went well. */
4538 }
4540 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4541 decltype context. */
4545 {
4550 }
4552 /* We're about to parse a collection of statements. If we're currently
4553 parsing tentatively, set up a firewall so that any nested
4554 cp_parser_commit_to_tentative_parse won't affect the current context. */
4556 static cp_token_position
4558 {
4565 }
4567 /* We've finished parsing the collection of statements. Wrap up the
4568 firewall and replace the relevant tokens with the parsed form. */
4570 static void
4572 tree expr)
4573 {
4577 /* Finish the firewall level. */
4579 /* And remember the result of the parse for when we try again. */
4585 }
4587 /* Like the above functions, but let the user modify the tokens. Used by
4588 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4589 later parses, so it makes sense to localize the effects of
4590 cp_parser_commit_to_tentative_parse. */
4592 struct tentative_firewall
4593 {
4598 {
4599 /* If we're currently parsing tentatively, start a committed level as a
4600 firewall and then an inner tentative parse. */
4602 {
4606 }
4607 }
4610 {
4612 {
4613 /* Finish the inner tentative parse and the firewall, propagating any
4614 uncommitted error state to the outer tentative parse. */
4620 }
4621 }
4622 };
4624 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4625 This class is for tracking such a matching pair of symbols.
4626 In particular, it tracks the location of the first token,
4627 so that if the second token is missing, we can highlight the
4628 location of the first token when notifying the user about the
4629 problem. */
4632 class token_pair
4633 {
4635 /* token_pair's ctor. */
4638 /* If the next token is the opening symbol for this pair, consume it and
4639 return true.
4640 Otherwise, issue an error and return false.
4641 In either case, record the location of the opening token. */
4644 {
4648 }
4650 /* Consume the next token from PARSER, recording its location as
4651 that of the opening token within the pair. */
4654 {
4659 }
4661 /* If the next token is the closing symbol for this pair, consume it
4662 and return it.
4663 Otherwise, issue an error, highlighting the location of the
4664 corresponding opening token, and return NULL. */
4667 {
4670 m_open_loc);
4671 }
4674 location_t m_open_loc;
4675 };
4677 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4679 struct matching_paren_traits
4680 {
4685 };
4687 /* "matching_parens" is a token_pair<T> class for tracking matching
4688 pairs of parentheses. */
4692 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4694 struct matching_brace_traits
4695 {
4700 };
4702 /* "matching_braces" is a token_pair<T> class for tracking matching
4703 pairs of braces. */
4708 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4709 enclosing parentheses. */
4711 static cp_expr
4713 {
4716 /* Consume the '('. */
4718 matching_parens parens;
4720 /* Start the statement-expression. */
4722 /* Parse the compound-statement. */
4724 /* Finish up. */
4726 /* Consume the ')'. */
4734 }
4736 /* Expressions [gram.expr] */
4738 /* Parse a fold-operator.
4740 fold-operator:
4741 - * / % ^ & | = < > << >>
4742 = -= *= /= %= ^= &= |= <<= >>=
4743 == != <= >= && || , .* ->*
4745 This returns the tree code corresponding to the matched operator
4746 as an int. When the current token matches a compound assignment
4747 opertor, the resulting tree code is the negative value of the
4748 non-assignment operator. */
4750 static int
4752 {
4754 {
4794 }
4795 }
4797 /* Returns true if CODE indicates a binary expression, which is not allowed in
4798 the LHS of a fold-expression. More codes will need to be added to use this
4799 function in other contexts. */
4801 static bool
4803 {
4805 {
4838 }
4839 }
4841 /* If the next token is a suitable fold operator, consume it and return as
4842 the function above. */
4844 static int
4846 {
4852 }
4854 /* Parse a fold-expression.
4856 fold-expression:
4857 ( ... folding-operator cast-expression)
4858 ( cast-expression folding-operator ... )
4859 ( cast-expression folding operator ... folding-operator cast-expression)
4861 Note that the '(' and ')' are matched in primary expression. */
4863 static cp_expr
4865 {
4866 cp_id_kind pidk;
4868 // Left fold.
4870 {
4874 {
4877 }
4884 }
4889 {
4892 }
4895 {
4898 }
4901 /* The operands of a fold-expression are cast-expressions, so binary or
4902 conditional expressions are not allowed. We check this here to avoid
4903 tentative parsing. */
4913 // Right fold.
4918 {
4921 }
4924 // Binary left or right fold.
4929 }
4931 /* Parse a primary-expression.
4933 primary-expression:
4934 literal
4935 this
4936 ( expression )
4937 id-expression
4938 lambda-expression (C++11)
4940 GNU Extensions:
4942 primary-expression:
4943 ( compound-statement )
4944 __builtin_va_arg ( assignment-expression , type-id )
4945 __builtin_offsetof ( type-id , offsetof-expression )
4947 C++ Extensions:
4948 __has_nothrow_assign ( type-id )
4949 __has_nothrow_constructor ( type-id )
4950 __has_nothrow_copy ( type-id )
4951 __has_trivial_assign ( type-id )
4952 __has_trivial_constructor ( type-id )
4953 __has_trivial_copy ( type-id )
4954 __has_trivial_destructor ( type-id )
4955 __has_virtual_destructor ( type-id )
4956 __is_abstract ( type-id )
4957 __is_base_of ( type-id , type-id )
4958 __is_class ( type-id )
4959 __is_empty ( type-id )
4960 __is_enum ( type-id )
4961 __is_final ( type-id )
4962 __is_literal_type ( type-id )
4963 __is_pod ( type-id )
4964 __is_polymorphic ( type-id )
4965 __is_std_layout ( type-id )
4966 __is_trivial ( type-id )
4967 __is_union ( type-id )
4969 Objective-C++ Extension:
4971 primary-expression:
4972 objc-expression
4974 literal:
4975 __null
4977 ADDRESS_P is true iff this expression was immediately preceded by
4978 "&" and therefore might denote a pointer-to-member. CAST_P is true
4979 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4980 true iff this expression is a template argument.
4982 Returns a representation of the expression. Upon return, *IDK
4983 indicates what kind of id-expression (if any) was present. */
4985 static cp_expr
4992 {
4995 /* Assume the primary expression is not an id-expression. */
4998 /* Peek at the next token. */
5001 {
5002 /* literal:
5003 integer-literal
5004 character-literal
5005 floating-literal
5006 string-literal
5007 boolean-literal
5008 pointer-literal
5009 user-defined-literal */
5021 {
5025 }
5026 /* Floating-point literals are only allowed in an integral
5027 constant expression if they are cast to an integral or
5028 enumeration type. */
5032 {
5033 /* CAST_P will be set even in invalid code like "int(2.7 +
5034 ...)". Therefore, we have to check that the next token
5035 is sure to end the cast. */
5037 {
5042 enumerator-definition. */
5044 /* The curly brace at the end of an enum-specifier. */
5046 /* The end of a statement. */
5048 /* The end of the cast-expression. */
5050 /* The end of an array bound. */
5052 /* The closing ">" in a template-argument-list. */
5055 /* C++0x only: A ">>" treated like two ">" tokens,
5056 in a template-argument-list. */
5061 }
5063 /* If we are within a cast, then the constraint that the
5064 cast is to an integral or enumeration type will be
5065 checked at that point. If we are not within a cast, then
5066 this code is invalid. */
5069 }
5089 /* ??? Should wide strings be allowed when parser->translate_strings_p
5090 is false (i.e. in attributes)? If not, we can kill the third
5091 argument to cp_parser_string_literal. */
5097 /* If we see `( { ' then we are looking at the beginning of
5098 a GNU statement-expression. */
5101 {
5102 /* Statement-expressions are not allowed by the standard. */
5106 /* And they're not allowed outside of a function-body; you
5107 cannot, for example, write:
5109 int i = ({ int j = 3; j + 1; });
5111 at class or namespace scope. */
5114 {
5116 "statement-expressions are not allowed outside "
5122 }
5123 else
5125 }
5126 /* Otherwise it's a normal parenthesized expression. */
5127 {
5128 cp_expr expr;
5133 /* Consume the `('. */
5134 matching_parens parens;
5136 /* Within a parenthesized expression, a `>' token is always
5137 the greater-than operator. */
5138 saved_greater_than_is_operator_p
5143 /* Left fold expression. */
5145 else
5146 /* Parse the parenthesized expression. */
5151 {
5158 }
5159 else
5160 /* Let the front end know that this expression was
5161 enclosed in parentheses. This matters in case, for
5162 example, the expression is of the form `A::B', since
5163 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5164 not. */
5167 /* DR 705: Wrapping an unqualified name in parentheses
5168 suppresses arg-dependent lookup. We want to pass back
5169 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5170 (c++/37862), but none of the others. */
5174 /* The `>' token might be the end of a template-id or
5175 template-parameter-list now. */
5176 parser->greater_than_is_operator_p
5179 /* Consume the `)'. */
5188 }
5191 {
5193 {
5194 /* We might have an Objective-C++ message. */
5197 /* If that works out, we're done ... */
5200 /* ... else, fall though to see if it's a lambda. */
5201 }
5203 /* Don't warn about a failed tentative parse. */
5208 }
5212 /* We have an Objective-C++ string literal. */
5219 {
5220 /* These two are the boolean literals. */
5228 /* The `__null' literal. */
5233 /* The `nullptr' literal. */
5238 /* Recognize the `this' keyword. */
5242 {
5246 }
5247 /* Pointers cannot appear in constant-expressions. */
5252 /* The `operator' keyword can be the beginning of an
5253 id-expression. */
5260 {
5261 non_integral_constant name;
5263 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5264 __func__ are the names of variables -- but they are
5265 treated specially. Therefore, they are handled here,
5266 rather than relying on the generic id-expression logic
5267 below. Grammatically, these names are id-expressions.
5269 Consume the token. */
5273 {
5285 }
5290 /* Look up the name. */
5292 }
5295 {
5296 tree expression;
5297 tree type;
5298 source_location type_location;
5299 location_t start_loc
5301 /* The `__builtin_va_arg' construct is used to handle
5302 `va_arg'. Consume the `__builtin_va_arg' token. */
5304 /* Look for the opening `('. */
5305 matching_parens parens;
5307 /* Now, parse the assignment-expression. */
5309 /* Look for the `,'. */
5312 /* Parse the type-id. */
5313 {
5316 }
5317 /* Look for the closing `)'. */
5318 location_t finish_loc
5321 /* Using `va_arg' in a constant-expression is not
5322 allowed. */
5324 NIC_VA_ARG))
5326 /* Construct a location of the form:
5327 __builtin_va_arg (v, int)
5328 ~~~~~~~~~~~~~~~~~~~~~^~~~
5329 with the caret at the type, ranging from the start of the
5330 "__builtin_va_arg" token to the close paren. */
5331 location_t combined_loc
5334 }
5369 // C++ concepts
5373 /* Objective-C++ expressions. */
5383 {
5388 }
5389 /* FALLTHRU */
5393 }
5395 /* An id-expression can start with either an identifier, a
5396 `::' as the beginning of a qualified-id, or the "operator"
5397 keyword. */
5402 {
5403 id_expression:
5404 cp_expr id_expression;
5405 cp_expr decl;
5411 /* Parse the id-expression. */
5412 id_expression
5429 /* If we have a template-id, then no further lookup is
5430 required. If the template-id was for a template-class, we
5431 will sometimes have a TYPE_DECL at this point. */
5435 /* Look up the name. */
5436 else
5437 {
5438 tree ambiguous_decls;
5440 /* If we already know that this lookup is ambiguous, then
5441 we've already issued an error message; there's no reason
5442 to check again. */
5445 {
5448 }
5451 none_type,
5452 template_p,
5457 /* If the lookup was ambiguous, an error will already have
5458 been issued. */
5462 /* In Objective-C++, we may have an Objective-C 2.0
5463 dot-syntax for classes here. */
5468 {
5469 tree component;
5476 component);
5477 /* Build a location of the form:
5478 expr.component
5479 ~~~~~^~~~~~~~~
5480 with caret at the start of the component name (at
5481 input_location), ranging from the start of the id_expression
5482 to the end of the component name. */
5483 location_t combined_loc
5488 }
5490 /* In Objective-C++, an instance variable (ivar) may be preferred
5491 to whatever cp_parser_lookup_name() found.
5492 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5493 rest of c-family, we have to do a little extra work to preserve
5494 any location information in cp_expr "decl". Given that
5495 objc_lookup_ivar is implemented in "c-family" and "objc", we
5496 have a trip through the pure "tree" type, rather than cp_expr.
5497 Naively copying it back to "decl" would implicitly give the
5498 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5499 store an EXPR_LOCATION. Hence we only update "decl" (and
5500 hence its location_t) if we get back a different tree node. */
5502 id_expression);
5506 /* If name lookup gives us a SCOPE_REF, then the
5507 qualifying scope was dependent. */
5509 {
5510 /* At this point, we do not know if DECL is a valid
5511 integral constant expression. We assume that it is
5512 in fact such an expression, so that code like:
5514 template <int N> struct A {
5515 int a[B<N>::i];
5516 };
5518 is accepted. At template-instantiation time, we
5519 will check that B<N>::i is actually a constant. */
5521 }
5522 /* Check to see if DECL is a local variable in a context
5523 where that is forbidden. */
5526 {
5527 /* It might be that we only found DECL because we are
5528 trying to be generous with pre-ISO scoping rules.
5529 For example, consider:
5531 int i;
5532 void g() {
5533 for (int i = 0; i < 10; ++i) {}
5534 extern void f(int j = i);
5535 }
5537 Here, name look up will originally find the out
5538 of scope `i'. We need to issue a warning message,
5539 but then use the global `i'. */
5542 {
5547 }
5548 }
5549 }
5551 decl = (finish_id_expression
5553 idk,
5558 template_arg_p,
5565 }
5567 /* Anything else is an error. */
5571 }
5572 }
5580 {
5583 }
5585 /* Parse an id-expression.
5587 id-expression:
5588 unqualified-id
5589 qualified-id
5591 qualified-id:
5592 :: [opt] nested-name-specifier template [opt] unqualified-id
5593 :: identifier
5594 :: operator-function-id
5595 :: template-id
5597 Return a representation of the unqualified portion of the
5598 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5599 a `::' or nested-name-specifier.
5601 Often, if the id-expression was a qualified-id, the caller will
5602 want to make a SCOPE_REF to represent the qualified-id. This
5603 function does not do this in order to avoid wastefully creating
5604 SCOPE_REFs when they are not required.
5606 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5607 `template' keyword.
5609 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5610 uninstantiated templates.
5612 If *TEMPLATE_P is non-NULL, it is set to true iff the
5613 `template' keyword is used to explicitly indicate that the entity
5614 named is a template.
5616 If DECLARATOR_P is true, the id-expression is appearing as part of
5617 a declarator, rather than as part of an expression. */
5619 static cp_expr
5626 {
5630 /* Assume the `template' keyword was not used. */
5634 /* Look for the optional `::' operator. */
5635 global_scope_p
5636 = (!template_keyword_p
5641 /* Look for the optional nested-name-specifier. */
5642 nested_name_specifier_p
5645 check_dependency_p,
5647 declarator_p,
5648 template_keyword_p)
5651 /* If there is a nested-name-specifier, then we are looking at
5652 the first qualified-id production. */
5654 {
5655 tree saved_scope;
5656 tree saved_object_scope;
5657 tree saved_qualifying_scope;
5658 cp_expr unqualified_id;
5661 /* See if the next token is the `template' keyword. */
5665 /* Name lookup we do during the processing of the
5666 unqualified-id might obliterate SCOPE. */
5670 /* Process the final unqualified-id. */
5672 check_dependency_p,
5673 declarator_p,
5675 /* Restore the SAVED_SCOPE for our caller. */
5681 }
5682 /* Otherwise, if we are in global scope, then we are looking at one
5683 of the other qualified-id productions. */
5685 {
5687 tree id;
5689 /* Peek at the next token. */
5692 /* If it's an identifier, and the next token is not a "<", then
5693 we can avoid the template-id case. This is an optimization
5694 for this common case. */
5696 && !cp_parser_nth_token_starts_template_argument_list_p
5701 /* Try a template-id. */
5705 none_type,
5706 declarator_p);
5707 /* If that worked, we're done. */
5711 /* Peek at the next token. (Changes in the token buffer may
5712 have invalidated the pointer obtained above.) */
5716 {
5723 /* Fall through. */
5728 }
5729 }
5730 else
5733 declarator_p,
5734 optional_p);
5735 }
5737 /* Parse an unqualified-id.
5739 unqualified-id:
5740 identifier
5741 operator-function-id
5742 conversion-function-id
5743 ~ class-name
5744 template-id
5746 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5747 keyword, in a construct like `A::template ...'.
5749 Returns a representation of unqualified-id. For the `identifier'
5750 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5751 production a BIT_NOT_EXPR is returned; the operand of the
5752 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5753 other productions, see the documentation accompanying the
5754 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5755 names are looked up in uninstantiated templates. If DECLARATOR_P
5756 is true, the unqualified-id is appearing as part of a declarator,
5757 rather than as part of an expression. */
5759 static cp_expr
5765 {
5768 /* Peek at the next token. */
5772 {
5774 {
5775 tree id;
5777 /* We don't know yet whether or not this will be a
5778 template-id. */
5780 /* Try a template-id. */
5782 check_dependency_p,
5783 none_type,
5784 declarator_p);
5785 /* If it worked, we're done. */
5788 /* Otherwise, it's an ordinary identifier. */
5790 }
5794 check_dependency_p,
5795 none_type,
5796 declarator_p);
5799 {
5800 tree type_decl;
5801 tree qualifying_scope;
5802 tree object_scope;
5803 tree scope;
5806 /* Consume the `~' token. */
5808 /* Parse the class-name. The standard, as written, seems to
5809 say that:
5811 template <typename T> struct S { ~S (); };
5812 template <typename T> S<T>::~S() {}
5814 is invalid, since `~' must be followed by a class-name, but
5815 `S<T>' is dependent, and so not known to be a class.
5816 That's not right; we need to look in uninstantiated
5817 templates. A further complication arises from:
5819 template <typename T> void f(T t) {
5820 t.T::~T();
5821 }
5823 Here, it is not possible to look up `T' in the scope of `T'
5824 itself. We must look in both the current scope, and the
5825 scope of the containing complete expression.
5827 Yet another issue is:
5829 struct S {
5830 int S;
5831 ~S();
5832 };
5834 S::~S() {}
5836 The standard does not seem to say that the `S' in `~S'
5837 should refer to the type `S' and not the data member
5838 `S::S'. */
5840 /* DR 244 says that we look up the name after the "~" in the
5841 same scope as we looked up the qualifying name. That idea
5842 isn't fully worked out; it's more complicated than that. */
5847 /* Check for invalid scopes. */
5849 {
5853 }
5855 {
5859 scope);
5864 }
5867 /* If the name is of the form "X::~X" it's OK even if X is a
5868 typedef. */
5877 {
5880 }
5882 /* ~auto means the destructor of whatever the object is. */
5884 {
5887 "%<~auto%> only available with "
5891 }
5893 /* If there was an explicit qualification (S::~T), first look
5894 in the scope given by the qualification (i.e., S).
5896 Note: in the calls to cp_parser_class_name below we pass
5897 typename_type so that lookup finds the injected-class-name
5898 rather than the constructor. */
5902 {
5907 typename_type,
5910 declarator_p);
5913 }
5914 /* In "N::S::~S", look in "N" as well. */
5916 {
5921 type_decl
5925 typename_type,
5928 declarator_p);
5931 }
5932 /* In "p->S::~T", look in the scope given by "*p" as well. */
5934 {
5939 type_decl
5943 typename_type,
5946 declarator_p);
5949 }
5950 /* Look in the surrounding context. */
5952 {
5958 type_decl
5962 typename_type,
5965 declarator_p);
5968 {
5969 /* We couldn't find a type with this name. If we're parsing
5970 tentatively, fail and try something else. */
5972 {
5975 }
5976 /* Otherwise, accept it and check for a match at instantiation
5977 time. */
5982 }
5983 }
5984 /* If an error occurred, assume that the name of the
5985 destructor is the same as the name of the qualifying
5986 class. That allows us to keep parsing after running
5987 into ill-formed destructor names. */
5993 /* Check that destructor name and scope match. */
5995 {
6002 }
6004 /* [class.dtor]
6006 A typedef-name that names a class shall not be used as the
6007 identifier in the declarator for a destructor declaration. */
6014 type_decl);
6017 }
6021 {
6022 cp_expr id;
6024 /* This could be a template-id, so we try that first. */
6026 /* Try a template-id. */
6029 none_type,
6030 declarator_p);
6031 /* If that worked, we're done. */
6034 /* We still don't know whether we're looking at an
6035 operator-function-id or a conversion-function-id. */
6037 /* Try an operator-function-id. */
6039 /* If that didn't work, try a conversion-function-id. */
6043 {
6044 /* 17.6.3.3.5 */
6049 "literal operator suffixes not preceded by %<_%>"
6051 }
6054 }
6055 /* Fall through. */
6062 }
6063 }
6065 /* Parse an (optional) nested-name-specifier.
6067 nested-name-specifier: [C++98]
6068 class-or-namespace-name :: nested-name-specifier [opt]
6069 class-or-namespace-name :: template nested-name-specifier [opt]
6071 nested-name-specifier: [C++0x]
6072 type-name ::
6073 namespace-name ::
6074 nested-name-specifier identifier ::
6075 nested-name-specifier template [opt] simple-template-id ::
6077 PARSER->SCOPE should be set appropriately before this function is
6078 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6079 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6080 in name lookups.
6082 Sets PARSER->SCOPE to the class (TYPE) or namespace
6083 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6084 it unchanged if there is no nested-name-specifier. Returns the new
6085 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6087 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6088 part of a declaration and/or decl-specifier. */
6090 static tree
6097 {
6102 /* Remember where the nested-name-specifier starts. */
6104 {
6107 }
6110 {
6111 tree new_scope;
6112 tree old_scope;
6113 tree saved_qualifying_scope;
6115 /* Spot cases that cannot be the beginning of a
6116 nested-name-specifier. */
6119 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6120 the already parsed nested-name-specifier. */
6122 {
6123 /* Grab the nested-name-specifier and continue the loop. */
6125 /* If we originally encountered this nested-name-specifier
6126 with IS_DECLARATION set to false, we will not have
6127 resolved TYPENAME_TYPEs, so we must do so here. */
6130 {
6135 }
6138 }
6140 /* Spot cases that cannot be the beginning of a
6141 nested-name-specifier. On the second and subsequent times
6142 through the loop, we look for the `template' keyword. */
6144 ;
6145 /* A template-id can start a nested-name-specifier. */
6147 ;
6148 /* DR 743: decltype can be used in a nested-name-specifier. */
6150 ;
6151 else
6152 {
6153 /* If the next token is not an identifier, then it is
6154 definitely not a type-name or namespace-name. */
6157 /* If the following token is neither a `<' (to begin a
6158 template-id), nor a `::', then we are not looking at a
6159 nested-name-specifier. */
6165 {
6169 "found %<:%> in nested-name-specifier, "
6172 }
6175 && !cp_parser_nth_token_starts_template_argument_list_p
6178 }
6180 /* The nested-name-specifier is optional, so we parse
6181 tentatively. */
6184 /* Look for the optional `template' keyword, if this isn't the
6185 first time through the loop. */
6189 /* Save the old scope since the name lookup we are about to do
6190 might destroy it. */
6193 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6194 look up names in "X<T>::I" in order to determine that "Y" is
6195 a template. So, if we have a typename at this point, we make
6196 an effort to look through it. */
6198 && !typename_keyword_p
6203 /* Parse the qualifying entity. */
6204 new_scope
6206 typename_keyword_p,
6207 template_keyword_p,
6208 check_dependency_p,
6209 type_p,
6210 is_declaration);
6211 /* Look for the `::' token. */
6214 /* If we found what we wanted, we keep going; otherwise, we're
6215 done. */
6217 {
6220 /* Restore the OLD_SCOPE since it was valid before the
6221 failed attempt at finding the last
6222 class-or-namespace-name. */
6226 /* If the next token is a decltype, and the one after that is a
6227 `::', then the decltype has failed to resolve to a class or
6228 enumeration type. Give this error even when parsing
6229 tentatively since it can't possibly be valid--and we're going
6230 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6231 won't get another chance.*/
6235 {
6242 /* As below. */
6245 }
6249 {
6250 /* If we have a non-type template-id followed by ::, it can't
6251 possibly be valid. */
6256 {
6259 {
6265 }
6266 else
6267 {
6268 /* Variable template. */
6273 }
6280 /* As below. */
6284 }
6285 }
6289 /* If the next token is an identifier, and the one after
6290 that is a `::', then any valid interpretation would have
6291 found a class-or-namespace-name. */
6297 {
6300 {
6302 {
6303 tree decl;
6304 tree ambiguous_decls;
6307 none_type,
6316 decl);
6318 {
6319 // cp_parser_lookup_name has the same diagnostic,
6320 // thus make sure to emit it at most once.
6323 {
6328 }
6330 }
6331 else
6332 {
6334 cp_parser_name_lookup_error
6337 else
6338 cp_parser_name_lookup_error
6341 }
6342 }
6345 /* Treat this as a successful nested-name-specifier
6346 due to:
6348 [basic.lookup.qual]
6350 If the name found is not a class-name (clause
6351 _class_) or namespace-name (_namespace.def_), the
6352 program is ill-formed. */
6354 }
6356 }
6358 }
6359 /* We've found one valid nested-name-specifier. */
6361 /* Name lookup always gives us a DECL. */
6364 /* Uses of "template" must be followed by actual templates. */
6376 new_scope);
6377 /* If it is a class scope, try to complete it; we are about to
6378 be looking up names inside the class. */
6380 /* Since checking types for dependency can be expensive,
6381 avoid doing it if the type is already complete. */
6383 /* Do not try to complete dependent types. */
6385 {
6387 /* If it is a typedef to current class, use the current
6388 class instead, as the typedef won't have any names inside
6389 it yet. */
6393 }
6394 /* Make sure we look in the right scope the next time through
6395 the loop. */
6397 }
6399 /* If parsing tentatively, replace the sequence of tokens that makes
6400 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6401 token. That way, should we re-parse the token stream, we will
6402 not have to repeat the effort required to do the parse, nor will
6403 we issue duplicate error messages. */
6405 {
6409 /* Reset the contents of the START token. */
6411 /* Retrieve any deferred checks. Do not pop this access checks yet
6412 so the memory will not be reclaimed during token replacing below. */
6420 /* Purge all subsequent tokens. */
6422 }
6428 }
6430 /* Parse a nested-name-specifier. See
6431 cp_parser_nested_name_specifier_opt for details. This function
6432 behaves identically, except that it will an issue an error if no
6433 nested-name-specifier is present. */
6435 static tree
6441 {
6442 tree scope;
6444 /* Look for the nested-name-specifier. */
6446 typename_keyword_p,
6447 check_dependency_p,
6448 type_p,
6449 is_declaration);
6450 /* If it was not present, issue an error message. */
6452 {
6455 }
6458 }
6460 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6461 this is either a class-name or a namespace-name (which corresponds
6462 to the class-or-namespace-name production in the grammar). For
6463 C++0x, it can also be a type-name that refers to an enumeration
6464 type or a simple-template-id.
6466 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6467 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6468 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6469 TYPE_P is TRUE iff the next name should be taken as a class-name,
6470 even the same name is declared to be another entity in the same
6471 scope.
6473 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6474 specified by the class-or-namespace-name. If neither is found the
6475 ERROR_MARK_NODE is returned. */
6477 static tree
6484 {
6485 tree saved_scope;
6486 tree saved_qualifying_scope;
6487 tree saved_object_scope;
6488 tree scope;
6492 /* DR 743: decltype can appear in a nested-name-specifier. */
6494 {
6498 {
6501 }
6505 }
6507 /* Before we try to parse the class-name, we must save away the
6508 current PARSER->SCOPE since cp_parser_class_name will destroy
6509 it. */
6513 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6514 there is no need to look for a namespace-name. */
6515 only_class_p = template_keyword_p
6520 typename_keyword_p,
6521 template_keyword_p,
6523 check_dependency_p,
6525 is_declaration,
6528 /* If that didn't work, try for a namespace-name. */
6530 {
6531 /* Restore the saved scope. */
6535 /* If we are not looking at an identifier followed by the scope
6536 resolution operator, then this is not part of a
6537 nested-name-specifier. (Note that this function is only used
6538 to parse the components of a nested-name-specifier.) */
6543 }
6546 }
6548 /* Return true if we are looking at a compound-literal, false otherwise. */
6550 static bool
6552 {
6555 /* Skip tokens until the next token is a closing parenthesis.
6556 If we find the closing `)', and the next token is a `{', then
6557 we are looking at a compound-literal. */
6558 bool compound_literal_p
6563 /* Roll back the tokens we skipped. */
6567 }
6569 /* Parse a postfix-expression.
6571 postfix-expression:
6572 primary-expression
6573 postfix-expression [ expression ]
6574 postfix-expression ( expression-list [opt] )
6575 simple-type-specifier ( expression-list [opt] )
6576 typename :: [opt] nested-name-specifier identifier
6577 ( expression-list [opt] )
6578 typename :: [opt] nested-name-specifier template [opt] template-id
6579 ( expression-list [opt] )
6580 postfix-expression . template [opt] id-expression
6581 postfix-expression -> template [opt] id-expression
6582 postfix-expression . pseudo-destructor-name
6583 postfix-expression -> pseudo-destructor-name
6584 postfix-expression ++
6585 postfix-expression --
6586 dynamic_cast < type-id > ( expression )
6587 static_cast < type-id > ( expression )
6588 reinterpret_cast < type-id > ( expression )
6589 const_cast < type-id > ( expression )
6590 typeid ( expression )
6591 typeid ( type-id )
6593 GNU Extension:
6595 postfix-expression:
6596 ( type-id ) { initializer-list , [opt] }
6598 This extension is a GNU version of the C99 compound-literal
6599 construct. (The C99 grammar uses `type-name' instead of `type-id',
6600 but they are essentially the same concept.)
6602 If ADDRESS_P is true, the postfix expression is the operand of the
6603 `&' operator. CAST_P is true if this expression is the target of a
6604 cast.
6606 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6607 class member access expressions [expr.ref].
6609 Returns a representation of the expression. */
6611 static cp_expr
6615 {
6617 location_t loc;
6624 /* Peek at the next token. */
6629 /* Some of the productions are determined by keywords. */
6632 {
6637 {
6638 tree type;
6639 cp_expr expression;
6643 /* All of these can be handled in the same way from the point
6644 of view of parsing. Begin by consuming the token
6645 identifying the cast. */
6648 /* New types cannot be defined in the cast. */
6650 parser->type_definition_forbidden_message
6653 /* Look for the opening `<'. */
6655 /* Parse the type to which we are casting. */
6660 /* Look for the closing `>'. */
6662 /* Restore the old message. */
6665 bool saved_greater_than_is_operator_p
6669 /* And the expression which is being cast. */
6670 matching_parens parens;
6674 RT_CLOSE_PAREN);
6678 parser->greater_than_is_operator_p
6681 /* Only type conversions to integral or enumeration types
6682 can be used in constant-expressions. */
6685 {
6688 }
6691 {
6693 postfix_expression
6697 postfix_expression
6701 postfix_expression
6703 tf_warning_or_error);
6706 postfix_expression
6711 }
6713 /* Construct a location e.g. :
6714 reinterpret_cast <int *> (expr)
6715 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6716 ranging from the start of the "*_cast" token to the final closing
6717 paren, with the caret at the start. */
6720 }
6724 {
6725 tree type;
6729 /* Consume the `typeid' token. */
6731 /* Look for the `(' token. */
6732 matching_parens parens;
6734 /* Types cannot be defined in a `typeid' expression. */
6736 parser->type_definition_forbidden_message
6738 /* We can't be sure yet whether we're looking at a type-id or an
6739 expression. */
6741 /* Try a type-id first. */
6746 /* Look for the `)' token. Otherwise, we can't be sure that
6747 we're not looking at an expression: consider `typeid (int
6748 (3))', for example. */
6750 /* If all went well, simply lookup the type-id. */
6753 /* Otherwise, fall back to the expression variant. */
6754 else
6755 {
6756 tree expression;
6758 /* Look for an expression. */
6760 /* Compute its typeid. */
6762 /* Look for the `)' token. */
6764 }
6765 /* Restore the saved message. */
6767 /* `typeid' may not appear in an integral constant expression. */
6771 /* Construct a location e.g. :
6772 typeid (expr)
6773 ^~~~~~~~~~~~~
6774 ranging from the start of the "typeid" token to the final closing
6775 paren, with the caret at the start. */
6777 {
6778 location_t typeid_loc
6781 }
6782 }
6786 {
6787 tree type;
6788 /* The syntax permitted here is the same permitted for an
6789 elaborated-type-specifier. */
6796 }
6800 {
6801 location_t cilk_spawn_loc
6806 {
6811 }
6813 {
6818 }
6819 else
6820 {
6821 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6824 }
6826 postfix_expression =
6830 {
6834 }
6836 {
6841 }
6842 else
6843 {
6846 postfix_expression);
6847 /* Build a location of the form:
6848 _Cilk_spawn expr
6849 ~~~~~~~~~~~~^~~~
6850 with caret at the expr, ranging from the start of the
6851 _Cilk_spawn token to the end of the expression. */
6852 location_t combined_loc =
6858 }
6860 }
6865 {
6868 tree p;
6875 {
6878 }
6884 {
6887 postfix_expression
6889 else
6890 {
6894 }
6900 tf_warning_or_error);
6901 else
6902 {
6906 }
6911 postfix_expression
6915 postfix_expression
6918 else
6919 {
6923 }
6928 }
6930 }
6933 {
6934 tree type;
6936 /* If the next thing is a simple-type-specifier, we may be
6937 looking at a functional cast. We could also be looking at
6938 an id-expression. So, we try the functional cast, and if
6939 that doesn't work we fall back to the primary-expression. */
6941 /* Look for the simple-type-specifier. */
6945 CP_PARSER_FLAGS_NONE);
6947 /* Parse the cast itself. */
6949 postfix_expression
6951 /* If that worked, we're done. */
6955 /* If the functional-cast didn't work out, try a
6956 compound-literal. */
6959 {
6964 matching_parens parens;
6967 /* Avoid calling cp_parser_type_id pointlessly, see comment
6968 in cp_parser_cast_expression about c++/29234. */
6971 else
6972 {
6973 /* Parse the type. */
6979 }
6981 /* If things aren't going well, there's no need to
6982 keep going. */
6984 {
6986 /* Parse the brace-enclosed initializer list. */
6989 }
6990 /* If that worked, we're definitely looking at a
6991 compound-literal expression. */
6993 {
6994 /* Warn the user that a compound literal is not
6995 allowed in standard C++. */
6998 /* For simplicity, we disallow compound literals in
6999 constant-expressions. We could
7000 allow compound literals of integer type, whose
7001 initializer was a constant, in constant
7002 expressions. Permitting that usage, as a further
7003 extension, would not change the meaning of any
7004 currently accepted programs. (Of course, as
7005 compound literals are not part of ISO C++, the
7006 standard has nothing to say.) */
7008 NIC_NCC))
7009 {
7012 }
7013 /* Form the representation of the compound-literal. */
7014 postfix_expression
7019 }
7020 }
7022 /* It must be a primary-expression. */
7023 postfix_expression
7026 decltype_p,
7028 }
7030 }
7032 /* Note that we don't need to worry about calling build_cplus_new on a
7033 class-valued CALL_EXPR in decltype when it isn't the end of the
7034 postfix-expression; unary_complex_lvalue will take care of that for
7035 all these cases. */
7037 /* Keep looping until the postfix-expression is complete. */
7039 {
7043 /* It is not a Koenig lookup function call. */
7044 postfix_expression
7047 /* Peek at the next token. */
7051 {
7054 {
7056 "two consecutive %<[%> shall "
7059 }
7060 postfix_expression
7062 postfix_expression,
7064 decltype_p);
7073 /* postfix-expression ( expression-list [opt] ) */
7074 {
7085 is_builtin_constant_p
7088 {
7089 /* The whole point of __builtin_constant_p is to allow
7090 non-constant expressions to appear as arguments. */
7091 saved_integral_constant_expression_p
7093 saved_non_integral_constant_expression_p
7096 }
7097 args = (cp_parser_parenthesized_expression_list
7103 {
7104 parser->integral_constant_expression_p
7106 parser->non_integral_constant_expression_p
7108 }
7111 {
7114 }
7116 /* Function calls are not permitted in
7117 constant-expressions. */
7120 NIC_FUNC_CALL))
7121 {
7125 }
7130 {
7132 {
7134 {
7137 postfix_expression
7139 complain);
7140 }
7141 else
7142 postfix_expression
7144 }
7145 /* We do not perform argument-dependent lookup if
7146 normal lookup finds a non-function, in accordance
7147 with the expected resolution of DR 218. */
7150 {
7154 /* Do not do argument dependent lookup if regular
7155 lookup finds a member function or a block-scope
7156 function declaration. [basic.lookup.argdep]/3 */
7159 {
7162 postfix_expression
7164 complain);
7165 }
7166 }
7167 }
7173 {
7182 }
7185 {
7195 {
7197 postfix_expression
7201 }
7204 {
7205 postfix_expression
7206 = (build_new_method_call
7212 complain));
7213 }
7214 else
7215 postfix_expression
7219 complain);
7220 }
7224 postfix_expression = (build_offset_ref_call_from_tree
7226 complain));
7228 /* A call to a static class member, or a namespace-scope
7229 function. */
7230 postfix_expression
7233 koenig_p,
7234 complain);
7235 else
7236 /* All other function calls. */
7237 postfix_expression
7240 koenig_p,
7241 complain);
7244 {
7246 start_loc,
7247 close_paren_loc);
7249 }
7251 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7255 }
7260 /* postfix-expression . template [opt] id-expression
7261 postfix-expression . pseudo-destructor-name
7262 postfix-expression -> template [opt] id-expression
7263 postfix-expression -> pseudo-destructor-name */
7265 /* Consume the `.' or `->' operator. */
7268 postfix_expression
7270 postfix_expression,
7277 /* postfix-expression ++ */
7278 /* Consume the `++' token. */
7280 /* Generate a representation for the complete expression. */
7281 postfix_expression
7283 POSTINCREMENT_EXPR);
7284 /* Increments may not appear in constant-expressions. */
7292 /* postfix-expression -- */
7293 /* Consume the `--' token. */
7295 /* Generate a representation for the complete expression. */
7296 postfix_expression
7298 POSTDECREMENT_EXPR);
7299 /* Decrements may not appear in constant-expressions. */
7310 return is_member_access
7311 ? postfix_expression
7313 else
7315 }
7316 }
7318 /* We should never get here. */
7321 }
7323 /* This function parses Cilk Plus array notations. If a normal array expr. is
7324 parsed then the array index is passed back to the caller through *INIT_INDEX
7325 and the function returns a NULL_TREE. If array notation expr. is parsed,
7326 then *INIT_INDEX is ignored by the caller and the function returns
7327 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7328 error_mark_node. */
7330 static tree
7332 tree array_value)
7333 {
7337 {
7340 }
7349 {
7352 }
7354 {
7355 /* Consume the ':'. */
7358 /* If we are here, then we have a case like this A[:]. */
7360 {
7364 }
7368 }
7369 else
7370 {
7371 /* If we are here, then there are three valid possibilities:
7372 1. ARRAY [ EXP ]
7373 2. ARRAY [ EXP : EXP ]
7374 3. ARRAY [ EXP : EXP : EXP ] */
7378 {
7379 /* This indicates that we have a normal array expression. */
7382 }
7384 /* Consume the ':'. */
7388 {
7391 }
7392 }
7397 {
7401 }
7407 }
7409 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7410 by cp_parser_builtin_offsetof. We're looking for
7412 postfix-expression [ expression ]
7413 postfix-expression [ braced-init-list ] (C++11)
7415 FOR_OFFSETOF is set if we're being called in that context, which
7416 changes how we deal with integer constant expressions. */
7418 static tree
7420 tree postfix_expression,
7423 {
7428 /* Consume the `[' token. */
7434 /* Parse the index expression. */
7435 /* ??? For offsetof, there is a question of what to allow here. If
7436 offsetof is not being used in an integral constant expression context,
7437 then we *could* get the right answer by computing the value at runtime.
7438 If we are in an integral constant expression context, then we might
7439 could accept any constant expression; hard to say without analysis.
7440 Rather than open the barn door too wide right away, allow only integer
7441 constant expressions here. */
7444 else
7445 {
7447 {
7454 {
7456 "braced list index is not allowed with array "
7460 }
7461 }
7463 {
7464 /* Here are have these two options:
7465 ARRAY[EXP : EXP] - Array notation expr with default
7466 stride of 1.
7467 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7468 stride. */
7470 postfix_expression);
7473 }
7474 else
7476 }
7480 /* Look for the closing `]'. */
7483 /* Build the ARRAY_REF. */
7487 /* When not doing offsetof, array references are not permitted in
7488 constant-expressions. */
7494 }
7496 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7497 by cp_parser_builtin_offsetof. We're looking for
7499 postfix-expression . template [opt] id-expression
7500 postfix-expression . pseudo-destructor-name
7501 postfix-expression -> template [opt] id-expression
7502 postfix-expression -> pseudo-destructor-name
7504 FOR_OFFSETOF is set if we're being called in that context. That sorta
7505 limits what of the above we'll actually accept, but nevermind.
7506 TOKEN_TYPE is the "." or "->" token, which will already have been
7507 removed from the stream. */
7509 static tree
7512 cp_expr postfix_expression,
7514 location_t location)
7515 {
7516 tree name;
7522 /* If this is a `->' operator, dereference the pointer. */
7525 tf_warning_or_error);
7526 /* Check to see whether or not the expression is type-dependent and
7527 not the current instantiation. */
7529 /* The identifier following the `->' or `.' is not qualified. */
7535 /* Enter the scope corresponding to the type of the object
7536 given by the POSTFIX_EXPRESSION. */
7538 {
7540 /* According to the standard, no expression should ever have
7541 reference type. Unfortunately, we do not currently match
7542 the standard in this respect in that our internal representation
7543 of an expression may have reference type even when the standard
7544 says it does not. Therefore, we have to manually obtain the
7545 underlying type here. */
7547 /* The type of the POSTFIX_EXPRESSION must be complete. */
7548 /* Unlike the object expression in other contexts, *this is not
7549 required to be of complete type for purposes of class member
7550 access (5.2.5) outside the member function body. */
7553 && !(processing_template_decl
7554 && current_class_type
7555 && (same_type_ignoring_top_level_qualifiers_p
7557 {
7560 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7562 {
7563 /* In a template, be permissive by treating an object expression
7564 of incomplete type as dependent (after a pedwarn). */
7565 diagnostic_t kind = (processing_template_decl
7567 ? DK_PEDWARN
7569 cxx_incomplete_type_diagnostic
7575 {
7578 }
7579 }
7580 }
7583 {
7584 /* Let the name lookup machinery know that we are processing a
7585 class member access expression. */
7587 /* If something went wrong, we want to be able to discern that case,
7588 as opposed to the case where there was no SCOPE due to the type
7589 of expression being dependent. */
7592 /* If the SCOPE was erroneous, make the various semantic analysis
7593 functions exit quickly -- and without issuing additional error
7594 messages. */
7597 }
7598 }
7601 /* Tell cp_parser_lookup_name that there was an object, even though it's
7602 type-dependent. */
7605 /* Assume this expression is not a pseudo-destructor access. */
7608 /* If the SCOPE is a scalar type, then, if this is a valid program,
7609 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7610 is type dependent, it can be pseudo-destructor-name or something else.
7611 Try to parse it as pseudo-destructor-name first. */
7613 {
7614 tree s;
7615 tree type;
7618 /* Parse the pseudo-destructor-name. */
7627 {
7629 postfix_expression
7632 }
7633 }
7636 {
7637 /* If the SCOPE is not a scalar type, we are looking at an
7638 ordinary class member access expression, rather than a
7639 pseudo-destructor-name. */
7642 /* Parse the id-expression. */
7643 name = (cp_parser_id_expression
7650 /* In general, build a SCOPE_REF if the member name is qualified.
7651 However, if the name was not dependent and has already been
7652 resolved; there is no need to build the SCOPE_REF. For example;
7654 struct X { void f(); };
7655 template <typename T> void f(T* t) { t->X::f(); }
7657 Even though "t" is dependent, "X::f" is not and has been resolved
7658 to a BASELINK; there is no need to include scope information. */
7660 /* But we do need to remember that there was an explicit scope for
7661 virtual function calls. */
7665 /* If the name is a template-id that names a type, we will get a
7666 TYPE_DECL here. That is invalid code. */
7668 {
7671 }
7672 else
7673 {
7675 {
7677 {
7681 }
7682 else
7685 name,
7686 template_p);
7690 }
7692 adjust_result_of_qualified_name_lookup
7694 postfix_expression
7696 template_p,
7697 tf_warning_or_error);
7698 /* Build a location e.g.:
7699 ptr->access_expr
7700 ~~~^~~~~~~~~~~~~
7701 where the caret is at the deref token, ranging from
7702 the start of postfix_expression to the end of the access expr. */
7703 location_t end_loc
7705 location_t combined_loc
7708 }
7709 }
7711 /* We no longer need to look up names in the scope of the object on
7712 the left-hand side of the `.' or `->' operator. */
7715 /* Outside of offsetof, these operators may not appear in
7716 constant-expressions. */
7718 && (cp_parser_non_integral_constant_expression
7723 }
7725 /* Parse a parenthesized expression-list.
7727 expression-list:
7728 assignment-expression
7729 expression-list, assignment-expression
7731 attribute-list:
7732 expression-list
7733 identifier
7734 identifier, expression-list
7736 CAST_P is true if this expression is the target of a cast.
7738 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7739 argument pack.
7741 Returns a vector of trees. Each element is a representation of an
7742 assignment-expression. NULL is returned if the ( and or ) are
7743 missing. An empty, but allocated, vector is returned on no
7744 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7745 if we are parsing an attribute list for an attribute that wants a
7746 plain identifier argument, normal_attr for an attribute that wants
7747 an expression, or non_attr if we aren't parsing an attribute list. If
7748 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7749 not all of the expressions in the list were constant.
7750 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7751 will be written to with the location of the closing parenthesis. If
7752 an error occurs, it may or may not be written to. */
7761 {
7767 /* Assume all the expressions will be constant. */
7771 matching_parens parens;
7777 /* Within a parenthesized expression, a `>' token is always
7778 the greater-than operator. */
7779 saved_greater_than_is_operator_p
7783 /* Consume expressions until there are no more. */
7786 {
7787 tree expr;
7789 /* At the beginning of attribute lists, check to see if the
7790 next token is an identifier. */
7793 {
7796 /* Consume the identifier. */
7798 /* Save the identifier. */
7800 }
7801 else
7802 {
7805 /* Parse the next assignment-expression. */
7807 {
7808 /* A braced-init-list. */
7814 }
7816 {
7817 expr = (cp_parser_constant_expression
7822 }
7823 else
7825 cast_p);
7830 /* If we have an ellipsis, then this is an expression
7831 expansion. */
7834 {
7835 /* Consume the `...'. */
7838 /* Build the argument pack. */
7840 }
7842 /* Add it to the list. We add error_mark_node
7843 expressions to the list, so that we can still tell if
7844 the correct form for a parenthesized expression-list
7845 is found. That gives better errors. */
7850 }
7852 /* After the first item, attribute lists look the same as
7853 expression lists. */
7856 get_comma:;
7857 /* If the next token isn't a `,', then we are done. */
7861 /* Otherwise, consume the `,' and keep going. */
7863 }
7869 {
7872 skip_comma:;
7873 /* We try and resync to an unnested comma, as that will give the
7874 user better diagnostics. */
7882 {
7883 parser->greater_than_is_operator_p
7886 }
7887 }
7889 parser->greater_than_is_operator_p
7896 }
7898 /* Parse a pseudo-destructor-name.
7900 pseudo-destructor-name:
7901 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7902 :: [opt] nested-name-specifier template template-id :: ~ type-name
7903 :: [opt] nested-name-specifier [opt] ~ type-name
7905 If either of the first two productions is used, sets *SCOPE to the
7906 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7907 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7908 or ERROR_MARK_NODE if the parse fails. */
7910 static void
7912 tree object,
7915 {
7918 /* Handle ~auto. */
7922 {
7925 "%<~auto%> only available with "
7932 }
7934 /* Assume that things will not work out. */
7937 /* Look for the optional `::' operator. */
7939 /* Look for the optional nested-name-specifier. */
7940 nested_name_specifier_p
7947 /* Now, if we saw a nested-name-specifier, we might be doing the
7948 second production. */
7951 {
7952 /* Consume the `template' keyword. */
7954 /* Parse the template-id. */
7958 class_type,
7960 /* Look for the `::' token. */
7962 }
7963 /* If the next token is not a `~', then there might be some
7964 additional qualification. */
7966 {
7967 /* At this point, we're looking for "type-name :: ~". The type-name
7968 must not be a class-name, since this is a pseudo-destructor. So,
7969 it must be either an enum-name, or a typedef-name -- both of which
7970 are just identifiers. So, we peek ahead to check that the "::"
7971 and "~" tokens are present; if they are not, then we can avoid
7972 calling type_name. */
7976 {
7979 }
7981 /* Look for the type-name. */
7986 /* Look for the `::' token. */
7988 }
7989 else
7992 /* Look for the `~'. */
7995 /* Once we see the ~, this has to be a pseudo-destructor. */
7999 /* Look for the type-name again. We are not responsible for
8000 checking that it matches the first type-name. */
8002 }
8004 /* Parse a unary-expression.
8006 unary-expression:
8007 postfix-expression
8008 ++ cast-expression
8009 -- cast-expression
8010 unary-operator cast-expression
8011 sizeof unary-expression
8012 sizeof ( type-id )
8013 alignof ( type-id ) [C++0x]
8014 new-expression
8015 delete-expression
8017 GNU Extensions:
8019 unary-expression:
8020 __extension__ cast-expression
8021 __alignof__ unary-expression
8022 __alignof__ ( type-id )
8023 alignof unary-expression [C++0x]
8024 __real__ cast-expression
8025 __imag__ cast-expression
8026 && identifier
8027 sizeof ( type-id ) { initializer-list , [opt] }
8028 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8029 __alignof__ ( type-id ) { initializer-list , [opt] }
8031 ADDRESS_P is true iff the unary-expression is appearing as the
8032 operand of the `&' operator. CAST_P is true if this expression is
8033 the target of a cast.
8035 Returns a representation of the expression. */
8037 static cp_expr
8040 {
8044 /* Peek at the next token. */
8046 /* Some keywords give away the kind of expression. */
8048 {
8052 {
8055 {
8061 /* Consume the token. */
8063 /* Parse the operand. */
8068 else
8069 {
8070 /* ISO C++ defines alignof only with types, not with
8071 expressions. So pedwarn if alignof is used with a non-
8072 type expression. However, __alignof__ is ok. */
8075 "ISO C++ does not allow %<alignof%> "
8079 }
8080 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8081 SIZEOF_EXPR with the original operand. */
8083 {
8085 {
8087 {
8090 error_mark_node));
8092 }
8093 else
8097 }
8098 }
8100 /* Construct a location e.g. :
8101 alignof (expr)
8102 ^~~~~~~~~~~~~~
8103 with start == caret at the start of the "alignof"/"sizeof"
8104 token, with the endpoint at the final closing paren. */
8105 location_t finish_loc
8107 location_t compound_loc
8113 }
8122 {
8123 /* The saved value of the PEDANTIC flag. */
8125 tree expr;
8127 /* Save away the PEDANTIC flag. */
8129 /* Parse the cast-expression. */
8131 /* Restore the PEDANTIC flag. */
8135 }
8139 {
8140 tree expression;
8142 /* Consume the `__real__' or `__imag__' token. */
8144 /* Parse the cast-expression. */
8146 /* Create the complete representation. */
8150 expression,
8151 tf_warning_or_error);
8152 }
8160 {
8161 tree expr;
8168 matching_parens parens;
8172 parser->type_definition_forbidden_message
8175 saved_integral_constant_expression_p
8177 saved_non_integral_constant_expression_p
8181 saved_greater_than_is_operator_p
8193 parser->greater_than_is_operator_p
8196 parser->integral_constant_expression_p
8198 parser->non_integral_constant_expression_p
8205 }
8209 }
8210 }
8212 /* Look for the `:: new' and `:: delete', which also signal the
8213 beginning of a new-expression, or delete-expression,
8214 respectively. If the next token is `::', then it might be one of
8215 these. */
8217 {
8220 /* See if the token after the `::' is one of the keywords in
8221 which we're interested. */
8223 /* If it's `new', we have a new-expression. */
8226 /* Similarly, for `delete'. */
8229 }
8231 /* Look for a unary operator. */
8233 /* The `++' and `--' operators can be handled similarly, even though
8234 they are not technically unary-operators in the grammar. */
8236 {
8241 /* Handle the GNU address-of-label extension. */
8244 {
8245 tree identifier;
8246 tree expression;
8249 /* Consume the '&&' token. */
8251 /* Look for the identifier. */
8252 location_t finish_loc
8255 /* Construct a location of the form:
8256 &&label
8257 ^~~~~~~
8258 with caret==start at the "&&", finish at the end of the label. */
8259 location_t combined_loc
8261 /* Create an expression representing the address. */
8264 NIC_ADDR_LABEL))
8267 }
8268 }
8270 {
8271 cp_expr cast_expression;
8277 /* Consume the operator token. */
8281 /* Parse the cast-expression. */
8282 cast_expression
8287 pidk);
8289 /* Make a location:
8290 OP_TOKEN CAST_EXPRESSION
8291 ^~~~~~~~~~~~~~~~~~~~~~~~~
8292 with start==caret at the operator token, and
8293 extending to the end of the cast_expression. */
8296 /* Now, build an appropriate representation. */
8298 {
8302 RO_UNARY_STAR,
8303 complain);
8304 /* TODO: build_x_indirect_ref does not always honor the
8305 location, so ensure it is set. */
8311 /* Fall through. */
8314 cast_expression,
8315 complain);
8316 /* TODO: build_x_unary_op does not always honor the location,
8317 so ensure it is set. */
8325 /* Fall through. */
8327 /* Immediately fold negation of a constant, unless the constant is 0
8328 (since -0 == 0) or it would overflow. */
8333 {
8336 cast_expression);
8338 {
8341 }
8342 }
8343 /* Fall through. */
8352 }
8356 non_constant_p))
8360 }
8364 decltype_p,
8365 pidk);
8366 }
8368 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8369 unary-operator, the corresponding tree code is returned. */
8371 static enum tree_code
8373 {
8375 {
8396 }
8397 }
8399 /* Parse a new-expression.
8401 new-expression:
8402 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8403 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8405 Returns a representation of the expression. */
8407 static tree
8409 {
8412 tree type;
8415 tree ret;
8419 /* Look for the optional `::' operator. */
8420 global_scope_p
8424 /* Look for the `new' operator. */
8426 /* There's no easy way to tell a new-placement from the
8427 `( type-id )' construct. */
8429 /* Look for a new-placement. */
8431 /* If that didn't work out, there's no new-placement. */
8433 {
8437 }
8439 /* If the next token is a `(', then we have a parenthesized
8440 type-id. */
8442 {
8446 /* Consume the `('. */
8447 matching_parens parens;
8450 /* Parse the type-id. */
8451 parser->type_definition_forbidden_message
8453 {
8456 }
8459 /* Look for the closing `)'. */
8462 /* There should not be a direct-new-declarator in this production,
8463 but GCC used to allowed this, so we check and emit a sensible error
8464 message for this case. */
8466 {
8472 }
8473 }
8474 /* Otherwise, there must be a new-type-id. */
8475 else
8478 /* If the next token is a `(' or '{', then we have a new-initializer. */
8483 else
8486 /* A new-expression may not appear in an integral constant
8487 expression. */
8490 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8491 of a new-type-id or type-id of a new-expression, the new-expression shall
8492 contain a new-initializer of the form ( assignment-expression )".
8493 Additionally, consistently with the spirit of DR 1467, we want to accept
8494 'new auto { 2 }' too. */
8500 {
8502 "initialization of new-expression for type %<auto%> "
8505 }
8506 else
8507 {
8508 /* Construct a location e.g.:
8509 ptr = new int[100]
8510 ^~~~~~~~~~~~
8511 with caret == start at the start of the "new" token, and the end
8512 at the end of the final token we consumed. */
8517 /* Create a representation of the new-expression. */
8519 tf_warning_or_error);
8521 }
8529 }
8531 /* Parse a new-placement.
8533 new-placement:
8534 ( expression-list )
8536 Returns the same representation as for an expression-list. */
8540 {
8543 /* Parse the expression-list. */
8544 expression_list = (cp_parser_parenthesized_expression_list
8553 }
8555 /* Parse a new-type-id.
8557 new-type-id:
8558 type-specifier-seq new-declarator [opt]
8560 Returns the TYPE allocated. If the new-type-id indicates an array
8561 type, *NELTS is set to the number of elements in the last array
8562 bound; the TYPE will not include the last array bound. */
8564 static tree
8566 {
8567 cp_decl_specifier_seq type_specifier_seq;
8573 /* The type-specifier sequence must not contain type definitions.
8574 (It cannot contain declarations of new types either, but if they
8575 are not definitions we will catch that because they are not
8576 complete.) */
8578 parser->type_definition_forbidden_message
8580 /* Parse the type-specifier-seq. */
8584 /* Restore the old message. */
8590 /* Parse the new-declarator. */
8593 /* Determine the number of elements in the last array dimension, if
8594 any. */
8596 /* Skip down to the last array dimension. */
8601 {
8604 }
8609 {
8612 }
8615 {
8622 else
8624 }
8627 }
8629 /* Parse an (optional) new-declarator.
8631 new-declarator:
8632 ptr-operator new-declarator [opt]
8633 direct-new-declarator
8635 Returns the declarator. */
8639 {
8642 cp_cv_quals cv_quals;
8644 /* We don't know if there's a ptr-operator next, or not. */
8646 /* Look for a ptr-operator. */
8648 /* If that worked, look for more new-declarators. */
8650 {
8653 /* Parse another optional declarator. */
8656 declarator = cp_parser_make_indirect_declarator
8660 }
8662 /* If the next token is a `[', there is a direct-new-declarator. */
8667 }
8669 /* Parse a direct-new-declarator.
8671 direct-new-declarator:
8672 [ expression ]
8673 direct-new-declarator [constant-expression]
8675 */
8679 {
8683 {
8684 tree expression;
8687 /* Look for the opening `['. */
8692 /* The standard requires that the expression have integral
8693 type. DR 74 adds enumeration types. We believe that the
8694 real intent is that these expressions be handled like the
8695 expression in a `switch' condition, which also allows
8696 classes with a single conversion to integral or
8697 enumeration type. */
8699 {
8700 expression
8702 expression,
8705 {
8707 "expression in new-declarator must have integral "
8710 }
8711 }
8713 /* Look for the closing `]'. */
8716 /* Add this bound to the declarator. */
8719 /* If the next token is not a `[', then there are no more
8720 bounds. */
8723 }
8726 }
8728 /* Parse a new-initializer.
8730 new-initializer:
8731 ( expression-list [opt] )
8732 braced-init-list
8734 Returns a representation of the expression-list. */
8738 {
8742 {
8743 tree t;
8750 }
8751 else
8752 expression_list = (cp_parser_parenthesized_expression_list
8758 }
8760 /* Parse a delete-expression.
8762 delete-expression:
8763 :: [opt] delete cast-expression
8764 :: [opt] delete [ ] cast-expression
8766 Returns a representation of the expression. */
8768 static tree
8770 {
8773 tree expression;
8775 /* Look for the optional `::' operator. */
8776 global_scope_p
8780 /* Look for the `delete' keyword. */
8782 /* See if the array syntax is in use. */
8784 {
8785 /* Consume the `[' token. */
8787 /* Look for the `]' token. */
8789 /* Remember that this is the `[]' construct. */
8791 }
8792 else
8795 /* Parse the cast-expression. */
8798 /* A delete-expression may not appear in an integral constant
8799 expression. */
8804 tf_warning_or_error);
8805 }
8807 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8808 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8809 0 otherwise. */
8811 static int
8813 {
8816 {
8858 /* In ((type ()) () the last () isn't a valid cast-expression,
8859 so the whole must be parsed as postfix-expression. */
8864 /* '[' may start a primary-expression in obj-c++ and in C++11,
8865 as a lambda-expression, eg, '(void)[]{}'. */
8872 /* '++' and '--' may or may not start a cast-expression:
8874 struct T { void operator++(int); };
8875 void f() { (T())++; }
8877 vs
8879 int a;
8880 (int)++a; */
8885 }
8886 }
8888 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8889 in the order: const_cast, static_cast, reinterpret_cast.
8891 Don't suggest dynamic_cast.
8893 Return the first legal cast kind found, or NULL otherwise. */
8897 {
8898 tree trial;
8900 /* Reuse the parser logic by attempting to build the various kinds of
8901 cast, with "complain" disabled.
8902 Identify the first such cast that is valid. */
8904 /* Don't attempt to run such logic within template processing. */
8908 /* First try const_cast. */
8913 /* If that fails, try static_cast. */
8918 /* Finally, try reinterpret_cast. */
8923 /* No such cast possible. */
8925 }
8927 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8928 suggesting how to convert a C-style cast of the form:
8930 (DST_TYPE)ORIG_EXPR
8932 to a C++-style cast.
8934 The primary range of RICHLOC is asssumed to be that of the original
8935 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8936 of the parens in the C-style cast. */
8938 static void
8941 tree dst_type)
8942 {
8943 /* This function is non-trivial, so bail out now if the warning isn't
8944 going to be emitted. */
8948 /* Try to find a legal C++ cast, trying them in order:
8949 const_cast, static_cast, reinterpret_cast. */
8954 /* Replace the open paren with "CAST_SUGGESTION<". */
8955 pretty_printer pp;
8959 /* Replace the close paren with "> (". */
8962 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8964 }
8967 /* Parse a cast-expression.
8969 cast-expression:
8970 unary-expression
8971 ( type-id ) cast-expression
8973 ADDRESS_P is true iff the unary-expression is appearing as the
8974 operand of the `&' operator. CAST_P is true if this expression is
8975 the target of a cast.
8977 Returns a representation of the expression. */
8979 static cp_expr
8982 {
8983 /* If it's a `(', then we might be looking at a cast. */
8985 {
8991 /* There's no way to know yet whether or not this is a cast.
8992 For example, `(int (3))' is a unary-expression, while `(int)
8993 3' is a cast. So, we resort to parsing tentatively. */
8995 /* Types may not be defined in a cast. */
8997 parser->type_definition_forbidden_message
8999 /* Consume the `('. */
9000 matching_parens parens;
9005 /* A very tricky bit is that `(struct S) { 3 }' is a
9006 compound-literal (which we permit in C++ as an extension).
9007 But, that construct is not a cast-expression -- it is a
9008 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9009 is legal; if the compound-literal were a cast-expression,
9010 you'd need an extra set of parentheses.) But, if we parse
9011 the type-id, and it happens to be a class-specifier, then we
9012 will commit to the parse at that point, because we cannot
9013 undo the action that is done when creating a new class. So,
9014 then we cannot back up and do a postfix-expression.
9016 Another tricky case is the following (c++/29234):
9018 struct S { void operator () (); };
9020 void foo ()
9021 {
9022 ( S()() );
9023 }
9025 As a type-id we parse the parenthesized S()() as a function
9026 returning a function, groktypename complains and we cannot
9027 back up in this case either.
9029 Therefore, we scan ahead to the closing `)', and check to see
9030 if the tokens after the `)' can start a cast-expression. Otherwise
9031 we are dealing with an unary-expression, a postfix-expression
9032 or something else.
9034 Yet another tricky case, in C++11, is the following (c++/54891):
9036 (void)[]{};
9038 The issue is that usually, besides the case of lambda-expressions,
9039 the parenthesized type-id cannot be followed by '[', and, eg, we
9040 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9041 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9042 we don't commit, we try a cast-expression, then an unary-expression.
9044 Save tokens so that we can put them back. */
9047 /* We may be looking at a cast-expression. */
9050 cast_expression
9053 /* Roll back the tokens we skipped. */
9055 /* If we aren't looking at a cast-expression, simulate an error so
9056 that the call to cp_parser_error_occurred below returns true. */
9059 else
9060 {
9063 /* Look for the type-id. */
9065 /* Look for the closing `)'. */
9070 }
9072 /* Restore the saved message. */
9075 /* At this point this can only be either a cast or a
9076 parenthesized ctor such as `(T ())' that looks like a cast to
9077 function returning T. */
9079 {
9080 /* Only commit if the cast-expression doesn't start with
9081 '++', '--', or '[' in C++11. */
9089 pidk);
9092 {
9093 /* Warn about old-style casts, if so requested. */
9098 {
9104 }
9106 /* Only type conversions to integral or enumeration types
9107 can be used in constant-expressions. */
9110 NIC_CAST))
9113 /* Perform the cast. */
9114 /* Make a location:
9115 (TYPE) EXPR
9116 ^~~~~~~~~~~
9117 with start==caret at the open paren, extending to the
9118 end of "expr". */
9120 open_paren_loc,
9124 }
9125 }
9126 else
9128 }
9130 /* If we get here, then it's not a cast, so it must be a
9131 unary-expression. */
9134 }
9136 /* Parse a binary expression of the general form:
9138 pm-expression:
9139 cast-expression
9140 pm-expression .* cast-expression
9141 pm-expression ->* cast-expression
9143 multiplicative-expression:
9144 pm-expression
9145 multiplicative-expression * pm-expression
9146 multiplicative-expression / pm-expression
9147 multiplicative-expression % pm-expression
9149 additive-expression:
9150 multiplicative-expression
9151 additive-expression + multiplicative-expression
9152 additive-expression - multiplicative-expression
9154 shift-expression:
9155 additive-expression
9156 shift-expression << additive-expression
9157 shift-expression >> additive-expression
9159 relational-expression:
9160 shift-expression
9161 relational-expression < shift-expression
9162 relational-expression > shift-expression
9163 relational-expression <= shift-expression
9164 relational-expression >= shift-expression
9166 GNU Extension:
9168 relational-expression:
9169 relational-expression <? shift-expression
9170 relational-expression >? shift-expression
9172 equality-expression:
9173 relational-expression
9174 equality-expression == relational-expression
9175 equality-expression != relational-expression
9177 and-expression:
9178 equality-expression
9179 and-expression & equality-expression
9181 exclusive-or-expression:
9182 and-expression
9183 exclusive-or-expression ^ and-expression
9185 inclusive-or-expression:
9186 exclusive-or-expression
9187 inclusive-or-expression | exclusive-or-expression
9189 logical-and-expression:
9190 inclusive-or-expression
9191 logical-and-expression && inclusive-or-expression
9193 logical-or-expression:
9194 logical-and-expression
9195 logical-or-expression || logical-and-expression
9197 All these are implemented with a single function like:
9199 binary-expression:
9200 simple-cast-expression
9201 binary-expression <token> binary-expression
9203 CAST_P is true if this expression is the target of a cast.
9205 The binops_by_token map is used to get the tree codes for each <token> type.
9206 binary-expressions are associated according to a precedence table. */
9208 #define TOKEN_PRECEDENCE(token) \
9209 (((token->type == CPP_GREATER \
9210 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9211 && !parser->greater_than_is_operator_p) \
9212 ? PREC_NOT_OPERATOR \
9213 : binops_by_token[token->type].prec)
9215 static cp_expr
9221 {
9222 cp_parser_expression_stack stack;
9224 cp_parser_expression_stack_entry current;
9225 cp_expr rhs;
9229 tree overload;
9231 /* Parse the first expression. */
9242 {
9243 /* Get an operator token. */
9249 {
9251 "%<>>%> operator is treated"
9255 }
9260 /* This is a fold-expression; handle it later. */
9263 /* Popping an entry off the stack means we completed a subexpression:
9264 - either we found a token which is not an operator (`>' where it is not
9265 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9266 will happen repeatedly;
9267 - or, we found an operator which has lower priority. This is the case
9268 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9269 parsing `3 * 4'. */
9271 {
9274 else
9276 }
9278 get_rhs:
9282 /* We used the operator token. */
9285 /* For "false && x" or "true || x", x will never be executed;
9286 disable warnings while evaluating it. */
9288 c_inhibit_evaluation_warnings +=
9291 c_inhibit_evaluation_warnings +=
9294 /* Extract another operand. It may be the RHS of this expression
9295 or the LHS of a new, higher priority expression. */
9300 /* Get another operator token. Look up its precedence to avoid
9301 building a useless (immediately popped) stack entry for common
9302 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9309 {
9310 /* ... and prepare to parse the RHS of the new, higher priority
9311 expression. Since precedence levels on the stack are
9312 monotonically increasing, we do not have to care about
9313 stack overflows. */
9322 pop:
9324 /* If the stack is not empty, we have parsed into LHS the right side
9325 (`4' in the example above) of an expression we had suspended.
9326 We can use the information on the stack to recover the LHS (`3')
9327 from the stack together with the tree code (`MULT_EXPR'), and
9328 the precedence of the higher level subexpression
9329 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9330 which will be used to actually build the additive expression. */
9335 }
9337 /* Undo the disabling of warnings done above. */
9339 c_inhibit_evaluation_warnings -=
9342 c_inhibit_evaluation_warnings -=
9348 /* Avoid warning for !!x == y. */
9353 /* Avoid warning for !b == y where b is boolean. */
9357 /* Avoid warning for !!b == y where b is boolean. */
9370 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9371 ERROR_MARK for everything that is not a binary expression.
9372 This makes warn_about_parentheses miss some warnings that
9373 involve unary operators. For unary expressions we should
9374 pass the correct tree_code unless the unary expression was
9375 surrounded by parentheses.
9376 */
9383 == tcc_comparison
9386 else
9387 {
9392 /* TODO: build_x_binary_op doesn't always honor the location. */
9394 }
9397 /* If the binary operator required the use of an overloaded operator,
9398 then this expression cannot be an integral constant-expression.
9399 An overloaded operator can be used even if both operands are
9400 otherwise permissible in an integral constant-expression if at
9401 least one of the operands is of enumeration type. */
9405 NIC_OVERLOADED))
9407 }
9410 }
9412 static cp_expr
9417 {
9420 }
9422 /* Parse the `? expression : assignment-expression' part of a
9423 conditional-expression. The LOGICAL_OR_EXPR is the
9424 logical-or-expression that started the conditional-expression.
9425 Returns a representation of the entire conditional-expression.
9427 This routine is used by cp_parser_assignment_expression.
9429 ? expression : assignment-expression
9431 GNU Extensions:
9433 ? : assignment-expression */
9435 static tree
9437 {
9439 cp_expr assignment_expr;
9443 /* Consume the `?' token. */
9448 {
9451 /* Implicit true clause. */
9453 c_inhibit_evaluation_warnings +=
9456 }
9457 else
9458 {
9461 /* Parse the expression. */
9462 c_inhibit_evaluation_warnings +=
9465 c_inhibit_evaluation_warnings +=
9469 }
9471 /* The next token should be a `:'. */
9473 /* Parse the assignment-expression. */
9475 c_inhibit_evaluation_warnings -=
9478 /* Make a location:
9479 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9480 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9481 with the caret at the "?", ranging from the start of
9482 the logical_or_expr to the end of the assignment_expr. */
9487 /* Build the conditional-expression. */
9489 expr,
9490 assignment_expr,
9491 tf_warning_or_error);
9492 }
9494 /* Parse an assignment-expression.
9496 assignment-expression:
9497 conditional-expression
9498 logical-or-expression assignment-operator assignment_expression
9499 throw-expression
9501 CAST_P is true if this expression is the target of a cast.
9502 DECLTYPE_P is true if this expression is the operand of decltype.
9504 Returns a representation for the expression. */
9506 static cp_expr
9509 {
9510 cp_expr expr;
9512 /* If the next token is the `throw' keyword, then we're looking at
9513 a throw-expression. */
9516 /* Otherwise, it must be that we are looking at a
9517 logical-or-expression. */
9518 else
9519 {
9520 /* Parse the binary expressions (logical-or-expression). */
9522 decltype_p,
9524 /* If the next token is a `?' then we're actually looking at a
9525 conditional-expression. */
9528 else
9529 {
9532 /* If it's an assignment-operator, we're using the second
9533 production. */
9534 enum tree_code assignment_operator
9537 {
9540 /* Parse the right-hand side of the assignment. */
9547 /* An assignment may not appear in a
9548 constant-expression. */
9550 NIC_ASSIGNMENT))
9552 /* Build the assignment expression. Its default
9553 location:
9554 LHS = RHS
9555 ~~~~^~~~~
9556 is the location of the '=' token as the
9557 caret, ranging from the start of the lhs to the
9558 end of the rhs. */
9563 assignment_operator,
9564 rhs,
9566 /* TODO: build_x_modify_expr doesn't honor the location,
9567 so we must set it here. */
9569 }
9570 }
9571 }
9574 }
9576 /* Parse an (optional) assignment-operator.
9578 assignment-operator: one of
9579 = *= /= %= += -= >>= <<= &= ^= |=
9581 GNU Extension:
9583 assignment-operator: one of
9584 <?= >?=
9586 If the next token is an assignment operator, the corresponding tree
9587 code is returned, and the token is consumed. For example, for
9588 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9589 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9590 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9591 operator, ERROR_MARK is returned. */
9593 static enum tree_code
9595 {
9599 /* Peek at the next token. */
9603 {
9649 /* Nothing else is an assignment operator. */
9651 }
9653 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9658 /* If it was an assignment operator, consume it. */
9663 }
9665 /* Parse an expression.
9667 expression:
9668 assignment-expression
9669 expression , assignment-expression
9671 CAST_P is true if this expression is the target of a cast.
9672 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9673 except possibly parenthesized or on the RHS of a comma (N3276).
9675 Returns a representation of the expression. */
9677 static cp_expr
9680 {
9685 {
9686 cp_expr assignment_expression;
9688 /* Parse the next assignment-expression. */
9689 assignment_expression
9692 /* We don't create a temporary for a call that is the immediate operand
9693 of decltype or on the RHS of a comma. But when we see a comma, we
9694 need to create a temporary for a call on the LHS. */
9699 assignment_expression
9703 /* If this is the first assignment-expression, we can just
9704 save it away. */
9707 else
9708 {
9709 /* Create a location with caret at the comma, ranging
9710 from the start of the LHS to the end of the RHS. */
9715 assignment_expression,
9718 }
9719 /* If the next token is not a comma, or we're in a fold-expression, then
9720 we are done with the expression. */
9724 /* Consume the `,'. */
9727 /* A comma operator cannot appear in a constant-expression. */
9730 }
9733 }
9735 /* Parse a constant-expression.
9737 constant-expression:
9738 conditional-expression
9740 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9741 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9742 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9743 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9744 only parse a conditional-expression, otherwise parse an
9745 assignment-expression. See below for rationale. */
9747 static cp_expr
9752 {
9756 cp_expr expression;
9758 /* It might seem that we could simply parse the
9759 conditional-expression, and then check to see if it were
9760 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9761 one that the compiler can figure out is constant, possibly after
9762 doing some simplifications or optimizations. The standard has a
9763 precise definition of constant-expression, and we must honor
9764 that, even though it is somewhat more restrictive.
9766 For example:
9768 int i[(2, 3)];
9770 is not a legal declaration, because `(2, 3)' is not a
9771 constant-expression. The `,' operator is forbidden in a
9772 constant-expression. However, GCC's constant-folding machinery
9773 will fold this operation to an INTEGER_CST for `3'. */
9775 /* Save the old settings. */
9777 saved_allow_non_integral_constant_expression_p
9780 /* We are now parsing a constant-expression. */
9782 parser->allow_non_integral_constant_expression_p
9785 /* Although the grammar says "conditional-expression", when not STRICT_P,
9786 we parse an "assignment-expression", which also permits
9787 "throw-expression" and the use of assignment operators. In the case
9788 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9789 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9790 actually essential that we look for an assignment-expression.
9791 For example, cp_parser_initializer_clauses uses this function to
9792 determine whether a particular assignment-expression is in fact
9793 constant. */
9795 {
9796 /* Parse the binary expressions (logical-or-expression). */
9799 /* If the next token is a `?' then we're actually looking at
9800 a conditional-expression; otherwise we're done. */
9803 }
9804 else
9806 /* Restore the old settings. */
9807 parser->integral_constant_expression_p
9809 parser->allow_non_integral_constant_expression_p
9812 {
9813 /* Require an rvalue constant expression here; that's what our
9814 callers expect. Reference constant expressions are handled
9815 separately in e.g. cp_parser_template_argument. */
9824 }
9827 parser->non_integral_constant_expression_p
9831 }
9833 /* Parse __builtin_offsetof.
9835 offsetof-expression:
9836 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9838 offsetof-member-designator:
9839 id-expression
9840 | offsetof-member-designator "." id-expression
9841 | offsetof-member-designator "[" expression "]"
9842 | offsetof-member-designator "->" id-expression */
9844 static cp_expr
9846 {
9848 tree type;
9849 cp_expr expr;
9850 cp_id_kind dummy;
9852 location_t finish_loc;
9854 /* We're about to accept non-integral-constant things, but will
9855 definitely yield an integral constant expression. Save and
9856 restore these values around our local parsing. */
9862 /* Consume the "__builtin_offsetof" token. */
9864 /* Consume the opening `('. */
9865 matching_parens parens;
9867 /* Parse the type-id. */
9870 /* Look for the `,'. */
9874 /* Build the (type *)null that begins the traditional offsetof macro. */
9875 tree object_ptr
9877 tf_warning_or_error);
9879 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9883 {
9886 {
9888 /* offsetof-member-designator "[" expression "]" */
9894 /* offsetof-member-designator "->" identifier */
9897 /* FALLTHRU */
9900 /* offsetof-member-designator "." identifier */
9908 /* Consume the ")" token. */
9914 /* Error. We know the following require will fail, but
9915 that gives the proper error message. */
9920 }
9921 }
9923 success:
9924 /* Make a location of the form:
9925 __builtin_offsetof (struct s, f)
9926 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9927 with caret at the type-id, ranging from the start of the
9928 "_builtin_offsetof" token to the close paren. */
9930 /* The result will be an INTEGER_CST, so we need to explicitly
9931 preserve the location. */
9934 failure:
9939 }
9941 /* Parse a trait expression.
9943 Returns a representation of the expression, the underlying type
9944 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9946 static tree
9948 {
9949 cp_trait_kind kind;
9955 {
10057 }
10059 /* Consume the token. */
10062 matching_parens parens;
10065 {
10068 }
10074 {
10077 {
10080 }
10084 }
10086 {
10088 {
10092 {
10095 }
10099 }
10100 }
10104 /* Complete the trait expression, which may mean either processing
10105 the trait expr now or saving it for template instantiation. */
10107 {
10116 }
10117 }
10119 /* Parse a lambda expression.
10121 lambda-expression:
10122 lambda-introducer lambda-declarator [opt] compound-statement
10124 Returns a representation of the expression. */
10126 static cp_expr
10128 {
10130 tree type;
10138 {
10140 {
10144 }
10146 }
10148 {
10150 {
10153 }
10155 }
10157 /* We may be in the middle of deferred access check. Disable
10158 it now. */
10169 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10172 /* Now that we've started the type, add the capture fields for any
10173 explicit captures. */
10176 {
10177 /* Inside the class, surrounding template-parameter-lists do not apply. */
10178 unsigned int saved_num_template_parameter_lists
10182 bool fully_implicit_function_template_p
10186 bool auto_is_implicit_function_template_parm_p
10197 /* By virtue of defining a local class, a lambda expression has access to
10198 the private variables of enclosing classes. */
10206 {
10211 }
10213 {
10216 }
10218 /* The capture list was built up in reverse order; fix that now. */
10230 parser->fully_implicit_function_template_p
10234 parser->auto_is_implicit_function_template_parm_p
10236 }
10238 /* This field is only used during parsing of the lambda. */
10241 /* This lambda shouldn't have any proxies left at this point. */
10243 /* And now that we're done, push proxies for an enclosing lambda. */
10248 else
10256 }
10258 /* Parse the beginning of a lambda expression.
10260 lambda-introducer:
10261 [ lambda-capture [opt] ]
10263 LAMBDA_EXPR is the current representation of the lambda expression. */
10265 static void
10267 {
10268 /* Need commas after the first capture. */
10271 /* Eat the leading `['. */
10274 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10282 {
10285 }
10288 {
10290 tree capture_id;
10291 tree capture_init_expr;
10295 enum capture_kind_type
10296 {
10297 BY_COPY,
10298 BY_REFERENCE
10299 };
10303 {
10306 }
10310 else
10313 /* Possibly capture `this'. */
10315 {
10326 explicit_init_p);
10328 }
10330 /* Possibly capture `*this'. */
10333 {
10344 explicit_init_p);
10346 }
10348 /* Remember whether we want to capture as a reference or not. */
10350 {
10353 }
10355 /* Get the identifier. */
10360 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10361 delimiters, but I modified this to stop on unnested ']' as well. It
10362 was already changed to stop on unnested '}', so the
10363 "closing_parenthesis" name is no more misleading with my change. */
10364 {
10370 }
10372 /* Find the initializer for this capture. */
10376 {
10378 /* An explicit initializer exists. */
10381 "lambda capture initializers "
10387 {
10390 }
10391 }
10392 else
10393 {
10396 /* Turn the identifier into an id-expression. */
10397 capture_init_expr
10402 {
10405 }
10409 {
10412 capture_init_expr);
10416 }
10419 {
10422 capture_init_expr))
10426 }
10428 capture_init_expr
10429 = finish_id_expression
10431 capture_init_expr,
10445 {
10448 }
10449 else
10451 }
10455 {
10460 capture_id);
10464 "capture of %qD redundant with by-reference capture "
10466 }
10469 capture_id,
10470 capture_init_expr,
10472 explicit_init_p);
10473 }
10476 }
10478 /* Parse the (optional) middle of a lambda expression.
10480 lambda-declarator:
10481 < template-parameter-list [opt] >
10482 ( parameter-declaration-clause [opt] )
10483 attribute-specifier [opt]
10484 decl-specifier-seq [opt]
10485 exception-specification [opt]
10486 lambda-return-type-clause [opt]
10488 LAMBDA_EXPR is the current representation of the lambda expression. */
10490 static bool
10492 {
10493 /* 5.1.1.4 of the standard says:
10494 If a lambda-expression does not include a lambda-declarator, it is as if
10495 the lambda-declarator were ().
10496 This means an empty parameter list, no attributes, and no exception
10497 specification. */
10504 cp_decl_specifier_seq lambda_specs;
10507 /* The template-parameter-list is optional, but must begin with
10508 an opening angle if present. */
10510 {
10513 "lambda templates are only available with "
10517 "lambda templates are only available with "
10526 /* We just processed one more parameter list. */
10528 }
10530 /* The parameter-declaration-clause is optional (unless
10531 template-parameter-list was given), but must begin with an
10532 opening parenthesis if present. */
10534 {
10535 matching_parens parens;
10540 /* Parse parameters. */
10543 /* Default arguments shall not be specified in the
10544 parameter-declaration-clause of a lambda-declarator. */
10555 /* In the decl-specifier-seq of the lambda-declarator, each
10556 decl-specifier shall either be mutable or constexpr. */
10560 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10563 {
10568 }
10572 /* Parse optional exception specification. */
10575 /* Parse optional trailing return type. */
10577 {
10580 }
10582 /* The function parameters must be in scope all the way until after the
10583 trailing-return-type in case of decltype. */
10585 }
10589 /* Create the function call operator.
10591 Messing with declarators like this is no uglier than building up the
10592 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10593 other code. */
10594 {
10595 cp_decl_specifier_seq return_type_specs;
10597 tree fco;
10604 else
10605 /* Maybe we will deduce the return type later. */
10609 {
10613 else
10616 }
10625 VIRT_SPEC_UNSPECIFIED,
10626 REF_QUAL_NONE,
10627 tx_qual,
10628 exception_spec,
10634 declarator,
10635 attributes);
10637 {
10640 /* Give the object parameter a different name. */
10644 }
10646 {
10650 }
10659 }
10660 }
10662 /* Parse the body of a lambda expression, which is simply
10664 compound-statement
10666 but which requires special handling.
10667 LAMBDA_EXPR is the current representation of the lambda expression. */
10669 static void
10671 {
10677 else
10678 /* Still increment function_depth so that we don't GC in the
10679 middle of an expression. */
10683 /* Clear this in case we're in the middle of a default argument. */
10687 /* Finish the function call operator
10688 - class_specifier
10689 + late_parsing_for_member
10690 + function_definition_after_declarator
10691 + ctor_initializer_opt_and_function_body */
10692 {
10698 tree compound_stmt;
10700 matching_braces braces;
10706 /* 5.1.1.4 of the standard says:
10707 If a lambda-expression does not include a trailing-return-type, it
10708 is as if the trailing-return-type denotes the following type:
10709 * if the compound-statement is of the form
10710 { return attribute-specifier [opt] expression ; }
10711 the type of the returned expression after lvalue-to-rvalue
10712 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10713 (_conv.array_ 4.2), and function-to-pointer conversion
10714 (_conv.func_ 4.3);
10715 * otherwise, void. */
10717 /* In a lambda that has neither a lambda-return-type-clause
10718 nor a deducible form, errors should be reported for return statements
10719 in the body. Since we used void as the placeholder return type, parsing
10720 the body as usual will give such desired behavior. */
10724 {
10728 /* Parse tentatively in case there's more after the initial return
10729 statement. */
10740 {
10742 {
10747 }
10749 /* Will get error here if type not deduced yet. */
10753 }
10754 }
10757 {
10762 }
10766 out:
10768 }
10775 else
10777 }
10779 /* Statements [gram.stmt.stmt] */
10781 /* Parse a statement.
10783 statement:
10784 labeled-statement
10785 expression-statement
10786 compound-statement
10787 selection-statement
10788 iteration-statement
10789 jump-statement
10790 declaration-statement
10791 try-block
10793 C++11:
10795 statement:
10796 labeled-statement
10797 attribute-specifier-seq (opt) expression-statement
10798 attribute-specifier-seq (opt) compound-statement
10799 attribute-specifier-seq (opt) selection-statement
10800 attribute-specifier-seq (opt) iteration-statement
10801 attribute-specifier-seq (opt) jump-statement
10802 declaration-statement
10803 attribute-specifier-seq (opt) try-block
10805 init-statement:
10806 expression-statement
10807 simple-declaration
10809 TM Extension:
10811 statement:
10812 atomic-statement
10814 IN_COMPOUND is true when the statement is nested inside a
10815 cp_parser_compound_statement; this matters for certain pragmas.
10817 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10818 is a (possibly labeled) if statement which is not enclosed in braces
10819 and has an else clause. This is used to implement -Wparentheses.
10821 CHAIN is a vector of if-else-if conditions. */
10823 static void
10827 {
10832 restart:
10835 /* There is no statement yet. */
10841 /* In obj-c++, seeing '[[' might be the either the beginning of
10842 c++11 attributes, or a nested objc-message-expression. So
10843 let's parse the c++11 attributes tentatively. */
10847 {
10850 }
10852 /* Peek at the next token. */
10854 /* Remember the location of the first token in the statement. */
10856 /* If this is a keyword, then that will often determine what kind of
10857 statement we have. */
10859 {
10863 {
10866 /* Looks like a labeled-statement with a case label.
10867 Parse the label, and then use tail recursion to parse
10868 the statement. */
10886 {
10891 }
10892 else
10906 {
10911 }
10912 else
10913 {
10917 }
10921 /* Objective-C++ exception-handling constructs. */
10935 /* This must be a namespace alias definition. */
10951 /* It might be a keyword like `int' that can start a
10952 declaration-statement. */
10954 }
10955 }
10957 {
10958 /* If the next token is a `:', then we are looking at a
10959 labeled-statement. */
10962 {
10963 /* Looks like a labeled-statement with an ordinary label.
10964 Parse the label, and then use tail recursion to parse
10965 the statement. */
10970 }
10971 }
10972 /* Anything that starts with a `{' must be a compound-statement. */
10975 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10976 a statement all its own. */
10978 {
10979 /* Only certain OpenMP pragmas are attached to statements, and thus
10980 are considered statements themselves. All others are not. In
10981 the context of a compound, accept the pragma as a "statement" and
10982 return so that we can check for a close brace. Otherwise we
10983 require a real statement and must go back and read one. */
10989 }
10991 {
10994 }
10996 /* Everything else must be a declaration-statement or an
10997 expression-statement. Try for the declaration-statement
10998 first, unless we are looking at a `;', in which case we know that
10999 we have an expression-statement. */
11001 {
11003 {
11005 {
11006 /* Attributes should be parsed as part of the the
11007 declaration, so let's un-parse them. */
11010 }
11013 /* Try to parse the declaration-statement. */
11015 /* If that worked, we're done. */
11018 }
11019 /* All preceding labels have been parsed at this point. */
11023 /* Look for an expression-statement instead. */
11026 /* Handle [[fallthrough]];. */
11028 {
11029 /* The next token after the fallthrough attribute is ';'. */
11031 {
11032 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11034 IFN_FALLTHROUGH,
11037 }
11038 else
11042 }
11043 }
11045 /* Set the line number for the statement. */
11049 /* Allow "[[fallthrough]];", but warn otherwise. */
11052 OPT_Wattributes,
11054 }
11056 /* Parse the label for a labeled-statement, i.e.
11058 identifier :
11059 case constant-expression :
11060 default :
11062 GNU Extension:
11063 case constant-expression ... constant-expression : statement
11065 When a label is parsed without errors, the label is added to the
11066 parse tree by the finish_* functions, so this function doesn't
11067 have to return the label. */
11069 static void
11071 {
11076 /* The next token should be an identifier. */
11080 {
11083 }
11085 /* Remember whether this case or a user-defined label is allowed to fall
11086 through to. */
11091 {
11093 {
11097 /* Consume the `case' token. */
11099 /* Parse the constant-expression. */
11106 {
11107 /* Consume the `...' token. */
11113 /* We don't need to emit warnings here, as the common code
11114 will do this for us. */
11115 }
11116 else
11120 {
11124 }
11125 else
11128 expr);
11129 }
11133 /* Consume the `default' token. */
11137 {
11141 }
11142 else
11147 /* Anything else must be an ordinary label. */
11152 }
11154 /* Require the `:' token. */
11157 /* An ordinary label may optionally be followed by attributes.
11158 However, this is only permitted if the attributes are then
11159 followed by a semicolon. This is because, for backward
11160 compatibility, when parsing
11161 lab: __attribute__ ((unused)) int i;
11162 we want the attribute to attach to "i", not "lab". */
11165 {
11166 tree attrs;
11173 ;
11174 else
11176 }
11182 }
11184 /* Parse an expression-statement.
11186 expression-statement:
11187 expression [opt] ;
11189 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11190 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11191 indicates whether this expression-statement is part of an
11192 expression statement. */
11194 static tree
11196 {
11201 /* There might be attribute fallthrough. */
11204 /* If the next token is a ';', then there is no expression
11205 statement. */
11207 {
11211 {
11214 }
11215 }
11217 /* Handle [[fallthrough]];. */
11219 {
11220 /* The next token after the fallthrough attribute is ';'. */
11222 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11225 else
11229 }
11231 /* Allow "[[fallthrough]];", but warn otherwise. */
11236 /* Give a helpful message for "A<T>::type t;" and the like. */
11239 {
11246 {
11247 /* A::A a; */
11252 }
11253 }
11255 /* Consume the final `;'. */
11260 /* This is the final expression statement of a statement
11261 expression. */
11267 }
11269 /* Parse a compound-statement.
11271 compound-statement:
11272 { statement-seq [opt] }
11274 GNU extension:
11276 compound-statement:
11277 { label-declaration-seq [opt] statement-seq [opt] }
11279 label-declaration-seq:
11280 label-declaration
11281 label-declaration-seq label-declaration
11283 Returns a tree representing the statement. */
11285 static tree
11288 {
11289 tree compound_stmt;
11290 matching_braces braces;
11292 /* Consume the `{'. */
11299 /* Begin the compound-statement. */
11301 /* If the next keyword is `__label__' we have a label declaration. */
11304 /* Parse an (optional) statement-seq. */
11306 /* Finish the compound-statement. */
11308 /* Consume the `}'. */
11312 }
11314 /* Parse an (optional) statement-seq.
11316 statement-seq:
11317 statement
11318 statement-seq [opt] statement */
11320 static void
11322 {
11323 /* Scan statements until there aren't any more. */
11325 {
11328 /* If we are looking at a `}', then we have run out of
11329 statements; the same is true if we have reached the end
11330 of file, or have stumbled upon a stray '@end'. */
11337 /* If we are in a compound statement and find 'else' then
11338 something went wrong. */
11340 {
11343 else
11344 {
11347 }
11348 }
11350 /* Parse the statement. */
11352 }
11353 }
11355 /* Return true if we're looking at (init; cond), false otherwise. */
11357 static bool
11359 {
11360 /* Save tokens so that we can put them back. */
11363 /* Look for ';' that is not nested in () or {}. */
11366 CPP_SEMICOLON,
11369 /* Roll back the tokens we skipped. */
11373 }
11375 /* Parse a selection-statement.
11377 selection-statement:
11378 if ( init-statement [opt] condition ) statement
11379 if ( init-statement [opt] condition ) statement else statement
11380 switch ( init-statement [opt] condition ) statement
11382 Returns the new IF_STMT or SWITCH_STMT.
11384 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11385 is a (possibly labeled) if statement which is not enclosed in
11386 braces and has an else clause. This is used to implement
11387 -Wparentheses.
11389 CHAIN is a vector of if-else-if conditions. This is used to implement
11390 -Wduplicated-cond. */
11392 static tree
11395 {
11398 token_indent_info guard_tinfo;
11403 /* Peek at the next token. */
11407 /* See what kind of keyword it is. */
11410 {
11413 {
11414 tree statement;
11415 tree condition;
11420 RID_CONSTEXPR))
11421 {
11427 }
11429 /* Look for the `('. */
11430 matching_parens parens;
11432 {
11435 }
11437 /* Begin the selection-statement. */
11439 {
11442 }
11443 else
11446 /* Parse the optional init-statement. */
11448 {
11449 tree decl;
11452 "init-statement in selection statements only available "
11455 }
11457 /* Parse the condition. */
11459 /* Look for the `)'. */
11465 {
11469 /* Add the condition. */
11476 /* Parse the then-clause. */
11480 /* Outside a template, the non-selected branch of a constexpr
11481 if is a 'discarded statement', i.e. unevaluated. */
11486 {
11489 }
11492 guard_tinfo);
11499 {
11503 }
11505 /* If the next token is `else', parse the else-clause. */
11507 RID_ELSE))
11508 {
11512 {
11515 }
11517 guard_tinfo
11519 /* Consume the `else' keyword. */
11522 {
11524 RID_IF)
11526 {
11527 /* We've got "if (COND) else if (COND2)". Start
11528 the condition chain and add COND as the first
11529 element. */
11533 {
11534 /* Wrap it in a NOP_EXPR so that we can set the
11535 location of the condition. */
11537 condition);
11540 }
11541 }
11543 RID_IF))
11544 {
11545 /* This is if-else without subsequent if. Zap the
11546 condition chain; we would have already warned at
11547 this point. */
11550 }
11551 }
11553 /* Parse the else-clause. */
11559 /* If we are currently parsing a then-clause, then
11560 IF_P will not be NULL. We set it to true to
11561 indicate that this if statement has an else clause.
11562 This may trigger the Wparentheses warning below
11563 when we get back up to the parent if statement. */
11568 {
11572 }
11573 }
11574 else
11575 {
11576 /* This if statement does not have an else clause. If
11577 NESTED_IF is true, then the then-clause has an if
11578 statement which does have an else clause. We warn
11579 about the potential ambiguity. */
11582 "suggest explicit braces to avoid ambiguous"
11585 {
11586 /* We don't need the condition chain anymore. */
11589 }
11590 }
11592 /* Now we're all done with the if-statement. */
11594 }
11595 else
11596 {
11600 /* Add the condition. */
11603 /* Parse the body of the switch-statement. */
11609 guard_tinfo);
11613 /* Now we're all done with the switch-statement. */
11615 }
11618 }
11624 }
11625 }
11627 /* Parse a condition.
11629 condition:
11630 expression
11631 type-specifier-seq declarator = initializer-clause
11632 type-specifier-seq declarator braced-init-list
11634 GNU Extension:
11636 condition:
11637 type-specifier-seq declarator asm-specification [opt]
11638 attributes [opt] = assignment-expression
11640 Returns the expression that should be tested. */
11642 static tree
11644 {
11645 cp_decl_specifier_seq type_specifiers;
11649 /* Try the declaration first. */
11651 /* New types are not allowed in the type-specifier-seq for a
11652 condition. */
11654 parser->type_definition_forbidden_message
11656 /* Parse the type-specifier-seq. */
11658 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11661 /* Restore the saved message. */
11663 /* If all is well, we might be looking at a declaration. */
11665 {
11666 tree decl;
11667 tree asm_specification;
11668 tree attributes;
11672 /* Parse the declarator. */
11678 /* Parse the attributes. */
11680 /* Parse the asm-specification. */
11682 /* If the next token is not an `=' or '{', then we might still be
11683 looking at an expression. For example:
11685 if (A(a).x)
11687 looks like a decl-specifier-seq and a declarator -- but then
11688 there is no `=', so this is an expression. */
11693 /* If we did see an `=' or '{', then we are looking at a declaration
11694 for sure. */
11696 {
11697 tree pushed_scope;
11701 /* Create the declaration. */
11707 /* Parse the initializer. */
11709 {
11713 }
11714 else
11715 {
11716 /* Consume the `='. */
11719 }
11723 /* Process the initializer. */
11726 asm_specification,
11727 flags);
11733 }
11734 }
11735 /* If we didn't even get past the declarator successfully, we are
11736 definitely not looking at a declaration. */
11737 else
11740 /* Otherwise, we are looking at an expression. */
11742 }
11744 /* Parses a for-statement or range-for-statement until the closing ')',
11745 not included. */
11747 static tree
11749 {
11753 /* Begin the for-statement. */
11756 /* Parse the initialization. */
11761 else
11763 }
11765 static tree
11767 {
11768 /* Normal for loop */
11771 tree stmt;
11774 /* The init-statement has already been parsed in
11775 cp_parser_init_statement, so no work is needed here. */
11778 /* If there's a condition, process it. */
11782 {
11786 }
11788 /* Look for the `;'. */
11791 /* If there's an expression, process it. */
11797 }
11799 /* Tries to parse a range-based for-statement:
11801 range-based-for:
11802 decl-specifier-seq declarator : expression
11804 The decl-specifier-seq declarator and the `:' are already parsed by
11805 cp_parser_init_statement. If processing_template_decl it returns a
11806 newly created RANGE_FOR_STMT; if not, it is converted to a
11807 regular FOR_STMT. */
11809 static tree
11812 {
11819 /* Get the range declaration momentarily out of the way so that
11820 the range expression doesn't clash with it. */
11822 {
11824 {
11826 /* For decomposition declaration get all of the corresponding
11827 declarations out of the way. */
11831 {
11837 {
11843 }
11844 }
11845 }
11847 {
11852 }
11853 }
11856 {
11859 }
11860 else
11863 /* Put the range declaration(s) back into scope. */
11865 {
11869 }
11871 /* If in template, STMT is converted to a normal for-statement
11872 at instantiation. If not, it is done just ahead. */
11874 {
11882 /* do_auto_deduction doesn't mess with template init-lists. */
11885 }
11886 else
11887 {
11891 }
11893 }
11895 /* Subroutine of cp_convert_range_for: given the initializer expression,
11896 builds up the range temporary. */
11898 static tree
11900 {
11903 /* Find out the type deduced by the declaration
11904 `auto &&__range = range_expr'. */
11909 /* Create the __range variable. */
11916 }
11918 /* Used by cp_parser_range_for in template context: we aren't going to
11919 do a full conversion yet, but we still need to resolve auto in the
11920 type of the for-range-declaration if present. This is basically
11921 a shortcut version of cp_convert_range_for. */
11923 static void
11925 {
11928 {
11931 iter_type = (cp_parser_perform_range_for_lookup
11934 {
11936 iter_type);
11938 RO_UNARY_STAR,
11939 tf_warning_or_error);
11942 }
11943 }
11944 }
11946 /* Converts a range-based for-statement into a normal
11947 for-statement, as per the definition.
11949 for (RANGE_DECL : RANGE_EXPR)
11950 BLOCK
11952 should be equivalent to:
11954 {
11955 auto &&__range = RANGE_EXPR;
11956 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11957 __begin != __end;
11958 ++__begin)
11959 {
11960 RANGE_DECL = *__begin;
11961 BLOCK
11962 }
11963 }
11965 If RANGE_EXPR is an array:
11966 BEGIN_EXPR = __range
11967 END_EXPR = __range + ARRAY_SIZE(__range)
11968 Else if RANGE_EXPR has a member 'begin' or 'end':
11969 BEGIN_EXPR = __range.begin()
11970 END_EXPR = __range.end()
11971 Else:
11972 BEGIN_EXPR = begin(__range)
11973 END_EXPR = end(__range);
11975 If __range has a member 'begin' but not 'end', or vice versa, we must
11976 still use the second alternative (it will surely fail, however).
11977 When calling begin()/end() in the third alternative we must use
11978 argument dependent lookup, but always considering 'std' as an associated
11979 namespace. */
11981 tree
11985 {
11993 /* If an error happened previously do nothing or else a lot of
11994 unhelpful errors would be issued. */
11996 else
11997 {
11998 tree range_temp;
12002 /* Can't bind a reference to an array of runtime bound. */
12004 else
12005 {
12010 LOOKUP_ONLYCONVERTING);
12012 }
12015 }
12017 /* The new for initialization statement. */
12025 LOOKUP_ONLYCONVERTING);
12036 LOOKUP_ONLYCONVERTING);
12040 /* The new for condition. */
12047 /* The new increment expression. */
12050 tf_warning_or_error);
12053 /* The declaration is initialized with *__begin inside the loop body. */
12056 tf_warning_or_error),
12058 LOOKUP_ONLYCONVERTING);
12063 }
12065 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12066 We need to solve both at the same time because the method used
12067 depends on the existence of members begin or end.
12068 Returns the type deduced for the iterator expression. */
12070 static tree
12072 {
12074 {
12077 }
12080 {
12085 }
12087 {
12088 /* If RANGE is an array, we will use pointer arithmetic. */
12091 range,
12095 }
12096 else
12097 {
12098 /* If it is not an array, we must do a bit of magic. */
12108 tf_warning_or_error);
12111 tf_warning_or_error);
12114 {
12115 /* Use the member functions. */
12118 else
12124 else
12127 }
12128 else
12129 {
12130 /* Use global functions with ADL. */
12137 tf_warning_or_error);
12139 tf_warning_or_error);
12141 tf_warning_or_error);
12143 tf_warning_or_error);
12146 }
12148 /* Last common checks. */
12150 {
12151 /* If one of the expressions is an error do no more checks. */
12154 }
12157 /* Can happen, when, eg, in a template context, Koenig lookup
12158 can't resolve begin/end (c++/58503). */
12160 else
12161 {
12163 /* The unqualified type of the __begin and __end temporaries should
12164 be the same, as required by the multiple auto declaration. */
12166 {
12173 /* P0184R0 allows __begin and __end to have different types,
12174 but make sure they are comparable so we can give a better
12176 else
12180 }
12182 }
12183 }
12184 }
12186 /* Helper function for cp_parser_perform_range_for_lookup.
12187 Builds a tree for RANGE.IDENTIFIER(). */
12189 static tree
12191 {
12204 tf_warning_or_error);
12207 }
12209 /* Parse an iteration-statement.
12211 iteration-statement:
12212 while ( condition ) statement
12213 do statement while ( expression ) ;
12214 for ( init-statement condition [opt] ; expression [opt] )
12215 statement
12217 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12219 static tree
12221 {
12224 tree statement;
12226 token_indent_info guard_tinfo;
12228 /* Peek at the next token. */
12235 /* Remember whether or not we are already within an iteration
12236 statement. */
12239 /* See what kind of keyword it is. */
12242 {
12244 {
12245 tree condition;
12247 /* Begin the while-statement. */
12249 /* Look for the `('. */
12250 matching_parens parens;
12252 /* Parse the condition. */
12255 /* Look for the `)'. */
12257 /* Parse the dependent statement. */
12261 /* We're done with the while-statement. */
12263 }
12267 {
12268 tree expression;
12270 /* Begin the do-statement. */
12272 /* Parse the body of the do-statement. */
12277 /* Look for the `while' keyword. */
12279 /* Look for the `('. */
12280 matching_parens parens;
12282 /* Parse the expression. */
12284 /* We're done with the do-statement. */
12286 /* Look for the `)'. */
12288 /* Look for the `;'. */
12290 }
12294 {
12295 /* Look for the `('. */
12296 matching_parens parens;
12301 /* Look for the `)'. */
12304 /* Parse the body of the for-statement. */
12309 /* We're done with the for-statement. */
12311 }
12318 }
12321 }
12323 /* Parse a init-statement or the declarator of a range-based-for.
12324 Returns true if a range-based-for declaration is seen.
12326 init-statement:
12327 expression-statement
12328 simple-declaration */
12330 static bool
12332 {
12333 /* If the next token is a `;', then we have an empty
12334 expression-statement. Grammatically, this is also a
12335 simple-declaration, but an invalid one, because it does not
12336 declare anything. Therefore, if we did not handle this case
12337 specially, we would issue an error message about an invalid
12338 declaration. */
12340 {
12344 /* A colon is used in range-based for. */
12347 /* We're going to speculatively look for a declaration, falling back
12348 to an expression, if necessary. */
12350 /* Parse the declaration. */
12353 decl);
12356 {
12357 /* It is a range-for, consume the ':' */
12361 {
12363 "range-based %<for%> loops only available with "
12366 }
12367 }
12368 else
12369 /* The ';' is not consumed yet because we told
12370 cp_parser_simple_declaration not to. */
12375 /* If the tentative parse failed, then we shall need to look for an
12376 expression-statement. */
12377 }
12378 /* If we are here, it is an expression-statement. */
12381 }
12383 /* Parse a jump-statement.
12385 jump-statement:
12386 break ;
12387 continue ;
12388 return expression [opt] ;
12389 return braced-init-list ;
12390 goto identifier ;
12392 GNU extension:
12394 jump-statement:
12395 goto * expression ;
12397 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12399 static tree
12401 {
12407 /* Peek at the next token. */
12412 /* See what kind of keyword it is. */
12415 {
12419 {
12439 }
12445 {
12452 /* Fall through. */
12462 }
12467 {
12468 tree expr;
12472 {
12476 }
12479 else
12480 /* If the next token is a `;', then there is no
12481 expression. */
12483 /* Build the return-statement. */
12486 else
12488 /* Look for the final `;'. */
12490 }
12496 {
12499 }
12501 /* Create the goto-statement. */
12503 {
12504 /* Issue a warning about this use of a GNU extension. */
12506 /* Consume the '*' token. */
12508 /* Parse the dependent expression. */
12510 }
12511 else
12513 /* Look for the final `;'. */
12520 }
12523 }
12525 /* Parse a declaration-statement.
12527 declaration-statement:
12528 block-declaration */
12530 static void
12532 {
12535 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12538 /* Parse the block-declaration. */
12541 /* Free any declarators allocated. */
12543 }
12545 /* Some dependent statements (like `if (cond) statement'), are
12546 implicitly in their own scope. In other words, if the statement is
12547 a single statement (as opposed to a compound-statement), it is
12548 none-the-less treated as if it were enclosed in braces. Any
12549 declarations appearing in the dependent statement are out of scope
12550 after control passes that point. This function parses a statement,
12551 but ensures that is in its own scope, even if it is not a
12552 compound-statement.
12554 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12555 is a (possibly labeled) if statement which is not enclosed in
12556 braces and has an else clause. This is used to implement
12557 -Wparentheses.
12559 CHAIN is a vector of if-else-if conditions. This is used to implement
12560 -Wduplicated-cond.
12562 Returns the new statement. */
12564 static tree
12568 {
12569 tree statement;
12572 token_indent_info body_tinfo
12578 /* Mark if () ; with a special NOP_EXPR. */
12580 {
12591 }
12592 /* if a compound is opened, we simply parse the statement directly. */
12595 /* If the token is not a `{', then we must take special action. */
12596 else
12597 {
12598 /* Create a compound-statement. */
12600 /* Parse the dependent-statement. */
12603 /* Finish the dummy compound-statement. */
12605 }
12607 token_indent_info next_tinfo
12616 /* Return the statement. */
12618 }
12620 /* For some dependent statements (like `while (cond) statement'), we
12621 have already created a scope. Therefore, even if the dependent
12622 statement is a compound-statement, we do not want to create another
12623 scope. */
12625 static void
12628 {
12629 /* If the token is a `{', then we must take special action. */
12631 {
12632 token_indent_info body_tinfo
12638 token_indent_info next_tinfo
12647 }
12648 else
12649 {
12650 /* Avoid calling cp_parser_compound_statement, so that we
12651 don't create a new scope. Do everything else by hand. */
12652 matching_braces braces;
12654 /* If the next keyword is `__label__' we have a label declaration. */
12657 /* Parse an (optional) statement-seq. */
12660 }
12661 }
12663 /* Declarations [gram.dcl.dcl] */
12665 /* Parse an optional declaration-sequence.
12667 declaration-seq:
12668 declaration
12669 declaration-seq declaration */
12671 static void
12673 {
12675 {
12686 {
12687 /* A declaration consisting of a single semicolon is
12688 invalid. Allow it unless we're being pedantic. */
12693 }
12695 /* If we're entering or exiting a region that's implicitly
12696 extern "C", modify the lang context appropriately. */
12698 {
12701 }
12703 {
12706 }
12709 {
12710 /* A top-level declaration can consist solely of a #pragma.
12711 A nested declaration cannot, so this is done here and not
12712 in cp_parser_declaration. (A #pragma at block scope is
12713 handled in cp_parser_statement.) */
12716 }
12718 /* Parse the declaration itself. */
12720 }
12721 }
12723 /* Parse a declaration.
12725 declaration:
12726 block-declaration
12727 function-definition
12728 template-declaration
12729 explicit-instantiation
12730 explicit-specialization
12731 linkage-specification
12732 namespace-definition
12734 C++17:
12735 deduction-guide
12737 GNU extension:
12739 declaration:
12740 __extension__ declaration */
12742 static void
12744 {
12745 cp_token token1;
12746 cp_token token2;
12751 /* Check for the `__extension__' keyword. */
12753 {
12754 /* Parse the qualified declaration. */
12756 /* Restore the PEDANTIC flag. */
12760 }
12762 /* Try to figure out what kind of declaration is present. */
12767 else
12768 {
12771 }
12773 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12776 /* If the next token is `extern' and the following token is a string
12777 literal, then we have a linkage specification. */
12781 /* If the next token is `template', then we have either a template
12782 declaration, an explicit instantiation, or an explicit
12783 specialization. */
12785 {
12786 /* `template <>' indicates a template specialization. */
12790 /* `template <' indicates a template declaration. */
12793 /* Anything else must be an explicit instantiation. */
12794 else
12796 }
12797 /* If the next token is `export', then we have a template
12798 declaration. */
12801 /* If the next token is `extern', 'static' or 'inline' and the one
12802 after that is `template', we have a GNU extended explicit
12803 instantiation directive. */
12810 /* If the next token is `namespace', check for a named or unnamed
12811 namespace definition. */
12820 /* An unnamed namespace definition. */
12824 /* An inline (associated) namespace definition. */
12828 /* Objective-C++ declaration/definition. */
12835 /* At this point we may have a template declared by a concept
12836 introduction. */
12841 else
12842 /* Try to parse a block-declaration, or a function-definition. */
12845 /* Free any declarators allocated. */
12847 }
12849 /* Parse a block-declaration.
12851 block-declaration:
12852 simple-declaration
12853 asm-definition
12854 namespace-alias-definition
12855 using-declaration
12856 using-directive
12858 GNU Extension:
12860 block-declaration:
12861 __extension__ block-declaration
12863 C++0x Extension:
12865 block-declaration:
12866 static_assert-declaration
12868 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12869 part of a declaration-statement. */
12871 static void
12874 {
12878 /* Check for the `__extension__' keyword. */
12880 {
12881 /* Parse the qualified declaration. */
12883 /* Restore the PEDANTIC flag. */
12887 }
12889 /* Peek at the next token to figure out which kind of declaration is
12890 present. */
12893 /* If the next keyword is `asm', we have an asm-definition. */
12895 {
12899 }
12900 /* If the next keyword is `namespace', we have a
12901 namespace-alias-definition. */
12904 /* If the next keyword is `using', we have a
12905 using-declaration, a using-directive, or an alias-declaration. */
12907 {
12912 /* If the token after `using' is `namespace', then we have a
12913 using-directive. */
12917 /* If the second token after 'using' is '=', then we have an
12918 alias-declaration. */
12924 /* Otherwise, it's a using-declaration. */
12925 else
12928 }
12929 /* If the next keyword is `__label__' we have a misplaced label
12930 declaration. */
12932 {
12936 /* If the next token is now a `;', consume it. */
12939 }
12940 /* If the next token is `static_assert' we have a static assertion. */
12943 /* Anything else must be a simple-declaration. */
12944 else
12947 }
12949 /* Parse a simple-declaration.
12951 simple-declaration:
12952 decl-specifier-seq [opt] init-declarator-list [opt] ;
12953 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12954 brace-or-equal-initializer ;
12956 init-declarator-list:
12957 init-declarator
12958 init-declarator-list , init-declarator
12960 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12961 function-definition as a simple-declaration.
12963 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12964 parsed declaration if it is an uninitialized single declarator not followed
12965 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12966 if present, will not be consumed. */
12968 static void
12972 {
12973 cp_decl_specifier_seq decl_specifiers;
12982 /* Defer access checks until we know what is being declared; the
12983 checks for names appearing in the decl-specifier-seq should be
12984 done as if we were in the scope of the thing being declared. */
12987 /* Parse the decl-specifier-seq. We have to keep track of whether
12988 or not the decl-specifier-seq declares a named class or
12989 enumeration type, since that is the only case in which the
12990 init-declarator-list is allowed to be empty.
12992 [dcl.dcl]
12994 In a simple-declaration, the optional init-declarator-list can be
12995 omitted only when declaring a class or enumeration, that is when
12996 the decl-specifier-seq contains either a class-specifier, an
12997 elaborated-type-specifier, or an enum-specifier. */
12999 CP_PARSER_FLAGS_OPTIONAL,
13002 /* We no longer need to defer access checks. */
13005 /* In a block scope, a valid declaration must always have a
13006 decl-specifier-seq. By not trying to parse declarators, we can
13007 resolve the declaration/expression ambiguity more quickly. */
13010 {
13013 }
13015 /* If the next two tokens are both identifiers, the code is
13016 erroneous. The usual cause of this situation is code like:
13018 T t;
13020 where "T" should name a type -- but does not. */
13023 {
13024 /* If parsing tentatively, we should commit; we really are
13025 looking at a declaration. */
13027 /* Give up. */
13029 }
13031 /* If we have seen at least one decl-specifier, and the next token
13032 is not a parenthesis, then we must be looking at a declaration.
13033 (After "int (" we might be looking at a functional cast.) */
13040 /* Look for C++17 decomposition declaration. */
13048 {
13049 tree decl
13051 maybe_range_for_decl,
13054 /* The next token should be either a `,' or a `;'. */
13056 /* If it's a `;', we are done. */
13059 /* Anything else is an error. */
13060 else
13061 {
13062 /* If we have already issued an error message we don't need
13063 to issue another one. */
13068 /* Skip tokens until we reach the end of the statement. */
13070 /* If the next token is now a `;', consume it. */
13074 }
13075 }
13076 else
13079 tree last_type;
13081 /* NULL_TREE if both variable and function declaration are allowed,
13082 error_mark_node if function declaration are not allowed and
13083 a FUNCTION_DECL that should be diagnosed if it is followed by
13084 variable declarations. */
13085 tree auto_function_declaration;
13088 auto_specifier_p
13092 /* Keep going until we hit the `;' at the end of the simple
13093 declaration. */
13096 CPP_SEMICOLON))
13097 {
13100 tree decl;
13104 {
13105 /* If we are processing next declarator, comma is expected */
13110 {
13114 }
13115 }
13116 else
13119 /* Parse the init-declarator. */
13122 function_definition_allowed_p,
13124 declares_class_or_enum,
13126 maybe_range_for_decl,
13129 /* If an error occurred while parsing tentatively, exit quickly.
13130 (That usually happens when in the body of a function; each
13131 statement is treated as a declaration-statement until proven
13132 otherwise.) */
13137 {
13138 /* If the init-declarator-list contains more than one
13139 init-declarator, they shall all form declarations of
13140 variables. */
13142 auto_function_declaration
13146 {
13148 "non-variable %qD in declaration with more than one "
13153 }
13154 }
13158 {
13162 {
13163 /* If the list of declarators contains more than one declarator,
13164 the type of each declared variable is determined as described
13165 above. If the type deduced for the template parameter U is not
13166 the same in each deduction, the program is ill-formed. */
13171 }
13172 else
13174 }
13176 /* Handle function definitions specially. */
13178 {
13179 /* If the next token is a `,', then we are probably
13180 processing something like:
13182 void f() {}, *p;
13184 which is erroneous. */
13186 {
13189 "mixing"
13191 }
13192 /* Otherwise, we're done with the list of declarators. */
13193 else
13194 {
13197 }
13198 }
13201 /* The next token should be either a `,' or a `;'. */
13203 /* If it's a `,', there are more declarators to come. */
13206 /* If it's a `;', we are done. */
13210 {
13215 }
13216 /* Anything else is an error. */
13217 else
13218 {
13219 /* If we have already issued an error message we don't need
13220 to issue another one. */
13225 /* Skip tokens until we reach the end of the statement. */
13227 /* If the next token is now a `;', consume it. */
13231 }
13232 /* After the first time around, a function-definition is not
13233 allowed -- even if it was OK at first. For example:
13235 int i, f() {}
13237 is not valid. */
13239 }
13241 /* Issue an error message if no declarators are present, and the
13242 decl-specifier-seq does not itself declare a class or
13243 enumeration: [dcl.dcl]/3. */
13245 {
13247 {
13251 /* Ensure an error is issued anyway when finish_decltype_type,
13252 called via cp_parser_decl_specifier_seq, returns a class or
13253 an enumeration (c++/51786). */
13256 }
13257 /* Perform any deferred access checks. */
13259 }
13261 /* Consume the `;'. */
13262 finish:
13266 {
13272 }
13274 done:
13276 }
13278 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13279 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13280 initializer ; */
13282 static tree
13287 {
13292 /* Parse the identifier-list. */
13296 {
13304 }
13308 {
13314 else
13315 {
13318 }
13319 }
13325 tree pushed_scope;
13332 NULL_TREE);
13339 cp_expr e;
13340 cp_decl_specifier_seq decl_specs;
13345 {
13348 else
13351 tree elt_pushed_scope;
13357 {
13358 /* Ensure we've diagnosed redeclaration if we aren't creating
13359 a new VAR_DECL. */
13362 }
13363 else
13367 }
13370 {
13373 }
13377 {
13387 {
13391 }
13394 {
13398 }
13399 }
13401 {
13403 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13404 the underlying DECL. */
13406 }
13412 {
13415 }
13418 }
13420 /* Parse a decl-specifier-seq.
13422 decl-specifier-seq:
13423 decl-specifier-seq [opt] decl-specifier
13424 decl-specifier attribute-specifier-seq [opt] (C++11)
13426 decl-specifier:
13427 storage-class-specifier
13428 type-specifier
13429 function-specifier
13430 friend
13431 typedef
13433 GNU Extension:
13435 decl-specifier:
13436 attributes
13438 Concepts Extension:
13440 decl-specifier:
13441 concept
13443 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13445 The parser flags FLAGS is used to control type-specifier parsing.
13447 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13448 flags:
13450 1: one of the decl-specifiers is an elaborated-type-specifier
13451 (i.e., a type declaration)
13452 2: one of the decl-specifiers is an enum-specifier or a
13453 class-specifier (i.e., a type definition)
13455 */
13457 static void
13459 cp_parser_flags flags,
13462 {
13466 cp_decl_spec ds;
13468 /* Clear DECL_SPECS. */
13471 /* Assume no class or enumeration type is declared. */
13474 /* Keep reading specifiers until there are no more to read. */
13476 {
13481 /* Peek at the next token. */
13484 /* Save the first token of the decl spec list for error
13485 reporting. */
13488 /* Handle attributes. */
13490 {
13491 /* Parse the attributes. */
13494 /* In a sequence of declaration specifiers, c++11 attributes
13495 appertain to the type that precede them. In that case
13496 [dcl.spec]/1 says:
13498 The attribute-specifier-seq affects the type only for
13499 the declaration it appears in, not other declarations
13500 involving the same type.
13502 But for now let's force the user to position the
13503 attribute either at the beginning of the declaration or
13504 after the declarator-id, which would clearly mean that it
13505 applies to the declarator. */
13507 {
13509 /* The c++11 attribute is at the beginning of the
13510 declaration. It appertains to the entity being
13512 else
13513 {
13515 {
13516 /* This is an attribute following a
13517 class-specifier. */
13522 }
13523 else
13524 {
13525 decl_specs->std_attributes
13527 attrs);
13530 }
13532 }
13533 }
13535 decl_specs->attributes
13537 attrs);
13541 }
13542 /* Assume we will find a decl-specifier keyword. */
13544 /* If the next token is an appropriate keyword, we can simply
13545 add it to the list. */
13547 {
13548 /* decl-specifier:
13549 friend
13550 constexpr */
13553 {
13558 }
13559 else
13560 {
13562 /* Consume the token. */
13564 }
13577 /* function-specifier:
13578 inline
13579 virtual
13580 explicit */
13587 /* decl-specifier:
13588 typedef */
13591 /* Consume the token. */
13593 /* A constructor declarator cannot appear in a typedef. */
13595 /* The "typedef" keyword can only occur in a declaration; we
13596 may as well commit at this point. */
13603 /* storage-class-specifier:
13604 auto
13605 register
13606 static
13607 extern
13608 mutable
13610 GNU Extension:
13611 thread */
13614 {
13615 /* Consume the token. */
13618 /* Complain about `auto' as a storage specifier, if
13619 we're complaining about C++0x compatibility. */
13623 "%<auto%> changes meaning in C++11; "
13626 /* Set the storage class anyway. */
13628 token);
13629 }
13630 else
13631 /* C++0x auto type-specifier. */
13639 /* Consume the token. */
13642 token);
13645 /* Consume the token. */
13651 /* We did not yet find a decl-specifier yet. */
13654 }
13671 /* Constructors are a special case. The `S' in `S()' is not a
13672 decl-specifier; it is the beginning of the declarator. */
13673 constructor_p
13674 = (!found_decl_spec
13675 && constructor_possible_p
13676 && (cp_parser_constructor_declarator_p
13679 /* If we don't have a DECL_SPEC yet, then we must be looking at
13680 a type-specifier. */
13682 {
13685 tree type_spec;
13687 type_spec
13689 decl_specs,
13695 /* If this type-specifier referenced a user-defined type
13696 (a typedef, class-name, etc.), then we can't allow any
13697 more such type-specifiers henceforth.
13699 [dcl.spec]
13701 The longest sequence of decl-specifiers that could
13702 possibly be a type name is taken as the
13703 decl-specifier-seq of a declaration. The sequence shall
13704 be self-consistent as described below.
13706 [dcl.type]
13708 As a general rule, at most one type-specifier is allowed
13709 in the complete decl-specifier-seq of a declaration. The
13710 only exceptions are the following:
13712 -- const or volatile can be combined with any other
13713 type-specifier.
13715 -- signed or unsigned can be combined with char, long,
13716 short, or int.
13718 -- ..
13720 Example:
13722 typedef char* Pc;
13723 void g (const int Pc);
13725 Here, Pc is *not* part of the decl-specifier seq; it's
13726 the declarator. Therefore, once we see a type-specifier
13727 (other than a cv-qualifier), we forbid any additional
13728 user-defined types. We *do* still allow things like `int
13729 int' to be considered a decl-specifier-seq, and issue the
13730 error message later. */
13733 /* A constructor declarator cannot follow a type-specifier. */
13735 {
13740 }
13741 }
13743 /* If we still do not have a DECL_SPEC, then there are no more
13744 decl-specifiers. */
13749 /* After we see one decl-specifier, further decl-specifiers are
13750 always optional. */
13752 }
13754 /* Don't allow a friend specifier with a class definition. */
13759 }
13761 /* Parse an (optional) storage-class-specifier.
13763 storage-class-specifier:
13764 auto
13765 register
13766 static
13767 extern
13768 mutable
13770 GNU Extension:
13772 storage-class-specifier:
13773 thread
13775 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13777 static tree
13779 {
13781 {
13785 /* Fall through for C++98. */
13793 /* Consume the token. */
13798 }
13799 }
13801 /* Parse an (optional) function-specifier.
13803 function-specifier:
13804 inline
13805 virtual
13806 explicit
13808 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13809 Updates DECL_SPECS, if it is non-NULL. */
13811 static tree
13814 {
13817 {
13823 /* 14.5.2.3 [temp.mem]
13825 A member function template shall not be virtual. */
13829 else
13839 }
13841 /* Consume the token. */
13843 }
13845 /* Parse a linkage-specification.
13847 linkage-specification:
13848 extern string-literal { declaration-seq [opt] }
13849 extern string-literal declaration */
13851 static void
13853 {
13854 tree linkage;
13856 /* Look for the `extern' keyword. */
13857 cp_token *extern_token
13860 /* Look for the string-literal. */
13864 /* Transform the literal into an identifier. If the literal is a
13865 wide-character string, or contains embedded NULs, then we can't
13866 handle it as the user wants. */
13869 {
13871 /* Assume C++ linkage. */
13873 }
13874 else
13877 /* We're now using the new linkage. */
13880 /* Preserve the location of the the innermost linkage specification,
13881 tracking the locations of nested specifications via a local. */
13882 location_t saved_location
13884 /* Construct a location ranging from the start of the "extern" to
13885 the end of the string-literal, with the caret at the start, e.g.:
13886 extern "C" {
13887 ^~~~~~~~~~
13888 */
13889 parser->innermost_linkage_specification_location
13894 /* If the next token is a `{', then we're using the first
13895 production. */
13897 {
13901 /* Consume the `{' token. */
13902 matching_braces braces;
13904 /* Parse the declarations. */
13906 /* Look for the closing `}'. */
13908 }
13909 /* Otherwise, there's just one declaration. */
13910 else
13911 {
13914 saved_in_unbraced_linkage_specification_p
13918 parser->in_unbraced_linkage_specification_p
13920 }
13922 /* We're done with the linkage-specification. */
13925 /* Restore location of parent linkage specification, if any. */
13927 }
13929 /* Parse a static_assert-declaration.
13931 static_assert-declaration:
13932 static_assert ( constant-expression , string-literal ) ;
13933 static_assert ( constant-expression ) ; (C++17)
13935 If MEMBER_P, this static_assert is a class member. */
13937 static void
13939 {
13940 tree condition;
13941 tree message;
13943 location_t saved_loc;
13946 /* Peek at the `static_assert' token so we can keep track of exactly
13947 where the static assertion started. */
13951 /* Look for the `static_assert' keyword. */
13953 RT_STATIC_ASSERT))
13956 /* We know we are in a static assertion; commit to any tentative
13957 parse. */
13961 /* Parse the `(' starting the static assertion condition. */
13962 matching_parens parens;
13965 /* Parse the constant-expression. Allow a non-constant expression
13966 here in order to give better diagnostics in finish_static_assert. */
13967 condition =
13973 {
13976 "static_assert without a message "
13978 /* Eat the ')' */
13983 }
13984 else
13985 {
13986 /* Parse the separating `,'. */
13989 /* Parse the string-literal message. */
13994 /* A `)' completes the static assertion. */
14000 }
14002 /* A semicolon terminates the declaration. */
14005 /* Complete the static assertion, which may mean either processing
14006 the static assert now or saving it for template instantiation. */
14008 }
14010 /* Parse the expression in decltype ( expression ). */
14012 static tree
14015 {
14017 tree expr;
14019 /* Since we're going to preserve any side-effects from this parse, set up a
14020 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14021 in the expression. */
14024 /* First, try parsing an id-expression. */
14035 {
14038 cp_id_kind idk;
14042 /* Lookup the name we got back from the id-expression. */
14052 {
14053 /* Complete lookup of the id-expression. */
14054 expr = (finish_id_expression
14067 /* We found an id-expression, but it was something that we
14068 should not have found. This is an error, not something
14069 we can recover from, so note that we found an
14070 id-expression and we'll recover as gracefully as
14071 possible. */
14073 }
14078 /* We have an id-expression. */
14080 }
14083 {
14084 /* Abort the id-expression parse. */
14087 /* Parsing tentatively, again. */
14090 /* Parse a class member access. */
14098 /* We have an id-expression. */
14100 }
14103 /* We have parsed the complete id-expression or member access. */
14105 else
14106 {
14107 /* Abort our attempt to parse an id-expression or member access
14108 expression. */
14111 /* Parse a full expression. */
14114 }
14117 }
14119 /* Parse a `decltype' type. Returns the type.
14121 simple-type-specifier:
14122 decltype ( expression )
14123 C++14 proposal:
14124 decltype ( auto ) */
14126 static tree
14128 {
14129 tree expr;
14138 {
14139 /* Already parsed. */
14142 }
14144 /* Look for the `decltype' token. */
14148 /* Parse the opening `('. */
14149 matching_parens parens;
14153 /* decltype (auto) */
14156 {
14163 }
14165 /* Types cannot be defined in a `decltype' expression. Save away the
14166 old message. */
14169 /* And create the new one. */
14170 parser->type_definition_forbidden_message
14173 /* The restrictions on constant-expressions do not apply inside
14174 decltype expressions. */
14175 saved_integral_constant_expression_p
14177 saved_non_integral_constant_expression_p
14181 /* Within a parenthesized expression, a `>' token is always
14182 the greater-than operator. */
14183 saved_greater_than_is_operator_p
14187 /* Do not actually evaluate the expression. */
14190 /* Do not warn about problems with the expression. */
14195 /* Go back to evaluating expressions. */
14199 /* The `>' token might be the end of a template-id or
14200 template-parameter-list now. */
14201 parser->greater_than_is_operator_p
14204 /* Restore the old message and the integral constant expression
14205 flags. */
14207 parser->integral_constant_expression_p
14209 parser->non_integral_constant_expression_p
14212 /* Parse to the closing `)'. */
14214 {
14218 }
14221 tf_warning_or_error);
14223 rewrite:
14224 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14225 it again. */
14234 }
14236 /* Special member functions [gram.special] */
14238 /* Parse a conversion-function-id.
14240 conversion-function-id:
14241 operator conversion-type-id
14243 Returns an IDENTIFIER_NODE representing the operator. */
14245 static tree
14247 {
14248 tree type;
14249 tree saved_scope;
14250 tree saved_qualifying_scope;
14251 tree saved_object_scope;
14254 /* Look for the `operator' token. */
14257 /* When we parse the conversion-type-id, the current scope will be
14258 reset. However, we need that information in able to look up the
14259 conversion function later, so we save it here. */
14263 /* We must enter the scope of the class so that the names of
14264 entities declared within the class are available in the
14265 conversion-type-id. For example, consider:
14267 struct S {
14268 typedef int I;
14269 operator I();
14270 };
14272 S::operator I() { ... }
14274 In order to see that `I' is a type-name in the definition, we
14275 must be in the scope of `S'. */
14278 /* Parse the conversion-type-id. */
14280 /* Leave the scope of the class, if any. */
14283 /* Restore the saved scope. */
14287 /* If the TYPE is invalid, indicate failure. */
14291 }
14293 /* Parse a conversion-type-id:
14295 conversion-type-id:
14296 type-specifier-seq conversion-declarator [opt]
14298 Returns the TYPE specified. */
14300 static tree
14302 {
14303 tree attributes;
14304 cp_decl_specifier_seq type_specifiers;
14306 tree type_specified;
14309 /* Parse the attributes. */
14313 parser->type_definition_forbidden_message
14316 /* Parse the type-specifiers. */
14323 /* If that didn't work, stop. */
14326 /* Parse the conversion-declarator. */
14334 /* Don't give this error when parsing tentatively. This happens to
14335 work because we always parse this definitively once. */
14338 {
14340 {
14343 }
14347 }
14350 }
14352 /* Parse an (optional) conversion-declarator.
14354 conversion-declarator:
14355 ptr-operator conversion-declarator [opt]
14357 */
14361 {
14364 cp_cv_quals cv_quals;
14366 /* We don't know if there's a ptr-operator next, or not. */
14368 /* Try the ptr-operator. */
14371 /* If it worked, look for more conversion-declarators. */
14373 {
14376 /* Parse another optional declarator. */
14379 declarator = cp_parser_make_indirect_declarator
14383 }
14386 }
14388 /* Parse an (optional) ctor-initializer.
14390 ctor-initializer:
14391 : mem-initializer-list */
14393 static void
14395 {
14396 /* If the next token is not a `:', then there is no
14397 ctor-initializer. */
14399 {
14400 /* Do default initialization of any bases and members. */
14404 }
14406 /* Consume the `:' token. */
14408 /* And the mem-initializer-list. */
14410 }
14412 /* Parse a mem-initializer-list.
14414 mem-initializer-list:
14415 mem-initializer ... [opt]
14416 mem-initializer ... [opt] , mem-initializer-list */
14418 static void
14420 {
14425 /* Let the semantic analysis code know that we are starting the
14426 mem-initializer-list. */
14431 /* Loop through the list. */
14433 {
14434 tree mem_initializer;
14437 /* Parse the mem-initializer. */
14439 /* If the next token is a `...', we're expanding member initializers. */
14441 {
14442 /* Consume the `...'. */
14445 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14446 can be expanded but members cannot. */
14449 {
14454 }
14456 /* Construct the pack expansion type. */
14459 }
14462 {
14466 }
14467 /* Look for a target constructor. */
14471 {
14474 {
14478 }
14480 }
14481 /* Add it to the list, unless it was erroneous. */
14483 {
14486 }
14487 /* If the next token is not a `,', we're done. */
14490 /* Consume the `,' token. */
14492 }
14494 /* Perform semantic analysis. */
14497 }
14499 /* Parse a mem-initializer.
14501 mem-initializer:
14502 mem-initializer-id ( expression-list [opt] )
14503 mem-initializer-id braced-init-list
14505 GNU extension:
14507 mem-initializer:
14508 ( expression-list [opt] )
14510 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14511 class) or FIELD_DECL (for a non-static data member) to initialize;
14512 the TREE_VALUE is the expression-list. An empty initialization
14513 list is represented by void_list_node. */
14515 static tree
14517 {
14518 tree mem_initializer_id;
14519 tree expression_list;
14520 tree member;
14523 /* Find out what is being initialized. */
14525 {
14529 }
14530 else
14531 {
14535 }
14541 {
14548 }
14549 else
14550 {
14560 }
14570 }
14572 /* Parse a mem-initializer-id.
14574 mem-initializer-id:
14575 :: [opt] nested-name-specifier [opt] class-name
14576 decltype-specifier (C++11)
14577 identifier
14579 Returns a TYPE indicating the class to be initialized for the first
14580 production (and the second in C++11). Returns an IDENTIFIER_NODE
14581 indicating the data member to be initialized for the last production. */
14583 static tree
14585 {
14589 tree id;
14593 /* `typename' is not allowed in this context ([temp.res]). */
14595 {
14597 "keyword %<typename%> not allowed in this context (a qualified "
14600 }
14601 /* Look for the optional `::' operator. */
14602 global_scope_p
14606 /* Look for the optional nested-name-specifier. The simplest way to
14607 implement:
14609 [temp.res]
14611 The keyword `typename' is not permitted in a base-specifier or
14612 mem-initializer; in these contexts a qualified name that
14613 depends on a template-parameter is implicitly assumed to be a
14614 type name.
14616 is to assume that we have seen the `typename' keyword at this
14617 point. */
14618 nested_name_specifier_p
14627 /* If there is a `::' operator or a nested-name-specifier, then we
14628 are definitely looking for a class-name. */
14633 typename_type,
14637 /* Otherwise, we could also be looking for an ordinary identifier. */
14640 /* Try a decltype-specifier. */
14642 else
14643 /* Otherwise, try a class-name. */
14647 none_type,
14651 /* If we found one, we're done. */
14654 /* Otherwise, look for an ordinary identifier. */
14656 }
14658 /* Overloading [gram.over] */
14660 /* Parse an operator-function-id.
14662 operator-function-id:
14663 operator operator
14665 Returns an IDENTIFIER_NODE for the operator which is a
14666 human-readable spelling of the identifier, e.g., `operator +'. */
14668 static cp_expr
14670 {
14671 /* Look for the `operator' keyword. */
14674 /* And then the name of the operator itself. */
14676 }
14678 /* Return an identifier node for a user-defined literal operator.
14679 The suffix identifier is chained to the operator name identifier. */
14681 tree
14683 {
14684 tree identifier;
14691 }
14693 /* Parse an operator.
14695 operator:
14696 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14697 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14698 || ++ -- , ->* -> () []
14700 GNU Extensions:
14702 operator:
14703 <? >? <?= >?=
14705 Returns an IDENTIFIER_NODE for the operator which is a
14706 human-readable spelling of the identifier, e.g., `operator +'. */
14708 static cp_expr
14710 {
14715 /* Peek at the next token. */
14720 /* Figure out which operator we have. */
14725 {
14727 {
14728 /* The keyword should be either `new' or `delete'. */
14733 else
14736 /* Consume the `new' or `delete' token. */
14739 /* Peek at the next token. */
14741 /* If it's a `[' token then this is the array variant of the
14742 operator. */
14744 {
14745 /* Consume the `[' token. */
14747 /* Look for the `]' token. */
14752 }
14756 }
14914 {
14915 /* Consume the `('. */
14916 matching_parens parens;
14918 /* Look for the matching `)'. */
14923 }
14926 /* Consume the `['. */
14928 /* Look for the matching `]'. */
14937 /* FALLTHRU */
14946 {
14953 /* Consume the string. */
14959 {
14962 }
14963 else
14964 {
14966 /* Look for the suffix identifier. */
14971 {
14975 }
14976 else
14977 {
14980 }
14981 }
14986 {
14989 }
14992 {
14995 }
14997 {
15000 }
15002 }
15005 /* Anything else is an error. */
15007 }
15009 /* If we have selected an identifier, we need to consume the
15010 operator token. */
15012 {
15016 }
15017 /* Otherwise, no valid operator name was present. */
15018 else
15019 {
15022 }
15025 }
15027 /* Parse a template-declaration.
15029 template-declaration:
15030 export [opt] template < template-parameter-list > declaration
15032 If MEMBER_P is TRUE, this template-declaration occurs within a
15033 class-specifier.
15035 The grammar rule given by the standard isn't correct. What
15036 is really meant is:
15038 template-declaration:
15039 export [opt] template-parameter-list-seq
15040 decl-specifier-seq [opt] init-declarator [opt] ;
15041 export [opt] template-parameter-list-seq
15042 function-definition
15044 template-parameter-list-seq:
15045 template-parameter-list-seq [opt]
15046 template < template-parameter-list >
15048 Concept Extensions:
15050 template-parameter-list-seq:
15051 template < template-parameter-list > requires-clause [opt]
15053 requires-clause:
15054 requires logical-or-expression */
15056 static void
15058 {
15059 /* Check for `export'. */
15061 {
15062 /* Consume the `export' token. */
15064 /* Warn that we do not support `export'. */
15066 }
15069 }
15071 /* Parse a template-parameter-list.
15073 template-parameter-list:
15074 template-parameter
15075 template-parameter-list , template-parameter
15077 Returns a TREE_LIST. Each node represents a template parameter.
15078 The nodes are connected via their TREE_CHAINs. */
15080 static tree
15082 {
15087 /* The loop below parses the template parms. We first need to know
15088 the total number of template parms to be able to compute proper
15089 canonical types of each dependent type. So after the loop, when
15090 we know the total number of template parms,
15091 end_template_parm_list computes the proper canonical types and
15092 fixes up the dependent types accordingly. */
15094 {
15095 tree parameter;
15098 location_t parm_loc;
15100 /* Parse the template-parameter. */
15105 /* Add it to the list. */
15108 parm_loc,
15109 parameter,
15110 is_non_type,
15111 is_parameter_pack);
15112 else
15113 {
15116 }
15118 /* If the next token is not a `,', we're done. */
15121 /* Otherwise, consume the `,' token. */
15123 }
15126 }
15128 /* Parse a introduction-list.
15130 introduction-list:
15131 introduced-parameter
15132 introduction-list , introduced-parameter
15134 introduced-parameter:
15135 ...[opt] identifier
15137 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15138 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15139 WILDCARD_DECL will also have DECL_NAME set and token location in
15140 DECL_SOURCE_LOCATION. */
15142 static tree
15144 {
15148 {
15153 /* Build placeholder. */
15161 /* If the next token is not a `,', we're done. */
15164 /* Otherwise, consume the `,' token. */
15166 }
15168 /* Convert the vec into a TREE_VEC. */
15171 tree parm;
15177 }
15179 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15180 is an abstract declarator. */
15184 {
15189 }
15191 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15192 is an abstract declarator. */
15196 {
15200 else
15202 }
15204 /* Returns true if DECL represents a constrained-parameter. */
15208 {
15213 }
15215 /* Returns true if PARM declares a constrained-parameter. */
15219 {
15221 }
15223 /* Check that the type parameter is only a declarator-id, and that its
15224 type is not cv-qualified. */
15226 bool
15229 {
15234 {
15237 }
15239 /* Don't allow cv-qualified type parameters. */
15242 {
15245 }
15248 }
15250 /* Finish parsing/processing a template type parameter and checking
15251 various restrictions. */
15255 tree id,
15257 {
15260 else
15262 }
15264 static tree
15266 {
15267 /* FIXME: This should probably be copied, and we may need to adjust
15268 the template parameter depths. */
15278 }
15280 /* Finish parsing/processing a template template parameter by borrowing
15281 the template parameter list from the prototype parameter. */
15283 static tree
15285 tree proto,
15286 tree id,
15288 {
15292 }
15294 /* Create a new non-type template parameter from the given PARM
15295 declarator. */
15297 static tree
15300 {
15306 }
15308 /* Build a constrained template parameter based on the PARMDECL
15309 declarator. The type of PARMDECL is the constrained type, which
15310 refers to the prototype template parameter that ultimately
15311 specifies the type of the declared parameter. */
15313 static tree
15318 {
15324 /* A template parameter constrained by a variadic concept shall also
15325 be declared as a template parameter pack. */
15330 /* Build the parameter. Return an error if the declarator was invalid. */
15331 tree parm;
15336 parmdecl);
15337 else
15342 /* Finish the parameter decl and create a node attaching the
15343 default argument and constraint. */
15348 }
15350 /* Returns true if the parsed type actually represents the declaration
15351 of a type template-parameter. */
15355 {
15358 }
15361 /* Returns true if the parsed type actually represents the declaration of
15362 a template template-parameter. */
15364 static bool
15366 {
15369 }
15371 /* Parse a default argument for a type template-parameter.
15372 Note that diagnostics are handled in cp_parser_template_parameter. */
15374 static tree
15376 {
15379 /* Consume the `=' token. */
15384 /* Parse the default-argument. */
15390 {
15394 }
15397 }
15399 /* Parse a default argument for a template template-parameter. */
15401 static tree
15403 {
15408 /* Consume the `='. */
15410 /* Parse the id-expression. */
15412 /* save token before parsing the id-expression, for error
15413 reporting */
15415 tree default_argument
15423 /* If the id-expression was a template-id that refers to
15424 a template-class, we already have the declaration here,
15425 so no further lookup is needed. */
15426 ;
15427 else
15428 /* Look up the name. */
15429 default_argument
15431 none_type,
15437 /* See if the default argument is valid. */
15441 }
15443 /* Parse a template-parameter.
15445 template-parameter:
15446 type-parameter
15447 parameter-declaration
15449 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15450 the parameter. The TREE_PURPOSE is the default value, if any.
15451 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15452 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15453 set to true iff this parameter is a parameter pack. */
15455 static tree
15458 {
15461 tree parm;
15463 /* Assume it is a type parameter or a template parameter. */
15465 /* Assume it not a parameter pack. */
15467 /* Peek at the next token. */
15469 /* If it is `template', we have a type-parameter. */
15472 /* If it is `class' or `typename' we do not know yet whether it is a
15473 type parameter or a non-type parameter. Consider:
15475 template <typename T, typename T::X X> ...
15477 or:
15479 template <class C, class D*> ...
15481 Here, the first parameter is a type parameter, and the second is
15482 a non-type parameter. We can tell by looking at the token after
15483 the identifier -- if it is a `,', `=', or `>' then we have a type
15484 parameter. */
15486 {
15487 /* Peek at the token after `class' or `typename'. */
15489 /* If it's an ellipsis, we have a template type parameter
15490 pack. */
15493 /* If it's an identifier, skip it. */
15496 /* Now, see if the token looks like the end of a template
15497 parameter. */
15502 }
15504 /* Otherwise, it is a non-type parameter or a constrained parameter.
15506 [temp.param]
15508 When parsing a default template-argument for a non-type
15509 template-parameter, the first non-nested `>' is taken as the end
15510 of the template parameter-list rather than a greater-than
15511 operator. */
15512 parameter_declarator
15519 /* If the parameter declaration is marked as a parameter pack, set
15520 *IS_PARAMETER_PACK to notify the caller. */
15525 {
15526 /* Can happen in some cases of erroneous input (c++/34892). */
15528 /* Consume the `...' for better error recovery. */
15530 }
15532 // The parameter may have been constrained.
15535 parameter_declarator,
15536 is_non_type,
15537 is_parameter_pack);
15539 // Now we're sure that the parameter is a non-type parameter.
15550 }
15552 /* Parse a type-parameter.
15554 type-parameter:
15555 class identifier [opt]
15556 class identifier [opt] = type-id
15557 typename identifier [opt]
15558 typename identifier [opt] = type-id
15559 template < template-parameter-list > class identifier [opt]
15560 template < template-parameter-list > class identifier [opt]
15561 = id-expression
15563 GNU Extension (variadic templates):
15565 type-parameter:
15566 class ... identifier [opt]
15567 typename ... identifier [opt]
15569 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15570 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15571 the declaration of the parameter.
15573 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15575 static tree
15577 {
15579 tree parameter;
15581 /* Look for a keyword to tell us what kind of parameter this is. */
15587 {
15590 {
15591 tree identifier;
15592 tree default_argument;
15594 /* If the next token is an ellipsis, we have a template
15595 argument pack. */
15597 {
15598 /* Consume the `...' token. */
15603 }
15605 /* If the next token is an identifier, then it names the
15606 parameter. */
15609 else
15612 /* Create the parameter. */
15615 /* If the next token is an `=', we have a default argument. */
15617 {
15618 default_argument
15621 /* Template parameter packs cannot have default
15622 arguments. */
15624 {
15627 "template parameter pack %qD cannot have a "
15629 else
15631 "template parameter packs cannot have "
15634 }
15637 }
15638 else
15641 /* Create the combined representation of the parameter and the
15642 default argument. */
15644 }
15648 {
15649 tree identifier;
15650 tree default_argument;
15652 /* Look for the `<'. */
15654 /* Parse the template-parameter-list. */
15656 /* Look for the `>'. */
15659 // If template requirements are present, parse them.
15661 {
15666 }
15668 /* Look for the `class' or 'typename' keywords. */
15670 /* If the next token is an ellipsis, we have a template
15671 argument pack. */
15673 {
15674 /* Consume the `...' token. */
15679 }
15680 /* If the next token is an `=', then there is a
15681 default-argument. If the next token is a `>', we are at
15682 the end of the parameter-list. If the next token is a `,',
15683 then we are at the end of this parameter. */
15687 {
15689 /* Treat invalid names as if the parameter were nameless. */
15692 }
15693 else
15696 /* Create the template parameter. */
15698 identifier);
15700 /* If the next token is an `=', then there is a
15701 default-argument. */
15703 {
15704 default_argument
15707 /* Template parameter packs cannot have default
15708 arguments. */
15710 {
15713 "template parameter pack %qD cannot "
15715 identifier);
15716 else
15720 }
15721 }
15722 else
15725 /* Create the combined representation of the parameter and the
15726 default argument. */
15728 }
15734 }
15737 }
15739 /* Parse a template-id.
15741 template-id:
15742 template-name < template-argument-list [opt] >
15744 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15745 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15746 returned. Otherwise, if the template-name names a function, or set
15747 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15748 names a class, returns a TYPE_DECL for the specialization.
15750 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15751 uninstantiated templates. */
15753 static tree
15759 {
15760 tree templ;
15761 tree arguments;
15762 tree template_id;
15767 /* If the next token corresponds to a template-id, there is no need
15768 to reparse it. */
15771 {
15774 }
15776 /* Avoid performing name lookup if there is no possibility of
15777 finding a template-id. */
15780 && !cp_parser_nth_token_starts_template_argument_list_p
15782 {
15785 }
15787 /* Remember where the template-id starts. */
15793 /* Parse the template-name. */
15796 check_dependency_p,
15797 is_declaration,
15798 tag_type,
15801 {
15804 }
15806 /* Since we're going to preserve any side-effects from this parse, set up a
15807 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15808 in the template arguments. */
15811 /* If we find the sequence `[:' after a template-name, it's probably
15812 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15813 parse correctly the argument list. */
15820 {
15822 /* Change `:' into `::'. */
15824 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15825 CPP_LESS. */
15828 /* Parse the arguments. */
15831 {
15832 /* If we couldn't parse an argument list, then we revert our changes
15833 and return simply an error. Maybe this is not a template-id
15834 after all. */
15839 }
15840 /* Otherwise, emit an error about the invalid digraph, but continue
15841 parsing because we got our argument list. */
15844 {
15847 "%<<:%> is an alternate spelling for %<[%>."
15850 {
15852 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15855 }
15856 }
15857 }
15858 else
15859 {
15860 /* Look for the `<' that starts the template-argument-list. */
15862 {
15865 }
15866 /* Parse the arguments. */
15868 }
15870 /* Set the location to be of the form:
15871 template-name < template-argument-list [opt] >
15872 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15873 with caret == start at the start of the template-name,
15874 ranging until the closing '>'. */
15875 location_t finish_loc
15877 location_t combined_loc
15880 /* Build a representation of the specialization. */
15883 TEMPLATE_ID_EXPR,
15887 {
15889 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15890 template (rather than some instantiation thereof) only if
15891 is not nested within some other construct. For example, in
15892 "template <typename T> void f(T) { A<T>::", A<T> is just an
15893 instantiation of A. */
15896 CPP_SCOPE));
15897 template_id
15899 }
15900 /* A template-like identifier may be a partial concept id. */
15906 {
15910 }
15911 else
15912 {
15913 /* If it's not a class-template or a template-template, it should be
15914 a function-template. */
15922 }
15924 /* If parsing tentatively, replace the sequence of tokens that makes
15925 up the template-id with a CPP_TEMPLATE_ID token. That way,
15926 should we re-parse the token stream, we will not have to repeat
15927 the effort required to do the parse, nor will we issue duplicate
15928 error messages about problems during instantiation of the
15929 template. */
15931 /* Don't do this if we had a parse error in a declarator; re-parsing
15932 might succeed if a name changes meaning (60361). */
15936 {
15937 /* Reset the contents of the START_OF_ID token. */
15941 /* We must mark the lookup as kept, so we don't throw it away on
15942 the first parse. */
15946 /* Retrieve any deferred checks. Do not pop this access checks yet
15947 so the memory will not be reclaimed during token replacing below. */
15953 /* Purge all subsequent tokens. */
15956 /* ??? Can we actually assume that, if template_id ==
15957 error_mark_node, we will have issued a diagnostic to the
15958 user, as opposed to simply marking the tentative parse as
15959 failed? */
15962 }
15966 }
15968 /* Parse a template-name.
15970 template-name:
15971 identifier
15973 The standard should actually say:
15975 template-name:
15976 identifier
15977 operator-function-id
15979 A defect report has been filed about this issue.
15981 A conversion-function-id cannot be a template name because they cannot
15982 be part of a template-id. In fact, looking at this code:
15984 a.operator K<int>()
15986 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15987 It is impossible to call a templated conversion-function-id with an
15988 explicit argument list, since the only allowed template parameter is
15989 the type to which it is converting.
15991 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15992 `template' keyword, in a construction like:
15994 T::template f<3>()
15996 In that case `f' is taken to be a template-name, even though there
15997 is no way of knowing for sure.
15999 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16000 name refers to a set of overloaded functions, at least one of which
16001 is a template, or an IDENTIFIER_NODE with the name of the template,
16002 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16003 names are looked up inside uninstantiated templates. */
16005 static tree
16012 {
16013 tree identifier;
16014 tree decl;
16017 /* If the next token is `operator', then we have either an
16018 operator-function-id or a conversion-function-id. */
16020 {
16021 /* We don't know whether we're looking at an
16022 operator-function-id or a conversion-function-id. */
16024 /* Try an operator-function-id. */
16026 /* If that didn't work, try a conversion-function-id. */
16028 {
16031 }
16032 }
16033 /* Look for the identifier. */
16034 else
16037 /* If we didn't find an identifier, we don't have a template-id. */
16041 /* If the name immediately followed the `template' keyword, then it
16042 is a template-name. However, if the next token is not `<', then
16043 we do not treat it as a template-name, since it is not being used
16044 as part of a template-id. This enables us to handle constructs
16045 like:
16047 template <typename T> struct S { S(); };
16048 template <typename T> S<T>::S();
16050 correctly. We would treat `S' as a template -- if it were `S<T>'
16051 -- but we do not if there is no `<'. */
16055 {
16056 /* In a declaration, in a dependent context, we pretend that the
16057 "template" keyword was present in order to improve error
16058 recovery. For example, given:
16060 template <typename T> void f(T::X<int>);
16062 we want to treat "X<int>" as a template-id. */
16064 && !template_keyword_p
16066 && check_dependency_p
16068 /* Do not do this for dtors (or ctors), since they never
16069 need the template keyword before their name. */
16071 {
16074 /* Explain what went wrong. */
16076 identifier);
16079 /* If parsing tentatively, find the location of the "<" token. */
16082 /* Parse the template arguments so that we can issue error
16083 messages about them. */
16086 /* Skip tokens until we find a good place from which to
16087 continue parsing. */
16092 /* If parsing tentatively, permanently remove the
16093 template argument list. That will prevent duplicate
16094 error messages from being issued about the missing
16095 "template" keyword. */
16102 }
16104 /* If the "template" keyword is present, then there is generally
16105 no point in doing name-lookup, so we just return IDENTIFIER.
16106 But, if the qualifying scope is non-dependent then we can
16107 (and must) do name-lookup normally. */
16109 {
16115 {
16116 /* We're optimizing away the call to cp_parser_lookup_name, but
16117 we still need to do this. */
16120 }
16121 }
16122 }
16124 /* Look up the name. */
16126 tag_type,
16129 check_dependency_p,
16135 /* If DECL is a template, then the name was a template-name. */
16137 {
16141 }
16142 else
16143 {
16144 /* The standard does not explicitly indicate whether a name that
16145 names a set of overloaded declarations, some of which are
16146 templates, is a template-name. However, such a name should
16147 be a template-name; otherwise, there is no way to form a
16148 template-id for the overloaded templates. */
16157 {
16158 /* The name does not name a template. */
16161 }
16162 }
16164 /* If DECL is dependent, and refers to a function, then just return
16165 its name; we will look it up again during template instantiation. */
16167 {
16171 }
16174 }
16176 /* Parse a template-argument-list.
16178 template-argument-list:
16179 template-argument ... [opt]
16180 template-argument-list , template-argument ... [opt]
16182 Returns a TREE_VEC containing the arguments. */
16184 static tree
16186 {
16191 tree vec;
16198 /* Even if the template-id appears in an integral
16199 constant-expression, the contents of the argument list do
16200 not. */
16206 /* Parse the arguments. */
16207 do
16208 {
16209 tree argument;
16212 /* Consume the comma. */
16215 /* Parse the template-argument. */
16218 /* If the next token is an ellipsis, we're expanding a template
16219 argument pack. */
16221 {
16223 {
16227 }
16228 /* Consume the `...' token. */
16231 /* Make the argument into a TYPE_PACK_EXPANSION or
16232 EXPR_PACK_EXPANSION. */
16234 }
16237 {
16241 {
16244 }
16245 else
16247 }
16249 }
16265 }
16267 /* Parse a template-argument.
16269 template-argument:
16270 assignment-expression
16271 type-id
16272 id-expression
16274 The representation is that of an assignment-expression, type-id, or
16275 id-expression -- except that the qualified id-expression is
16276 evaluated, so that the value returned is either a DECL or an
16277 OVERLOAD.
16279 Although the standard says "assignment-expression", it forbids
16280 throw-expressions or assignments in the template argument.
16281 Therefore, we use "conditional-expression" instead. */
16283 static tree
16285 {
16286 tree argument;
16292 cp_id_kind idk;
16294 /* There's really no way to know what we're looking at, so we just
16295 try each alternative in order.
16297 [temp.arg]
16299 In a template-argument, an ambiguity between a type-id and an
16300 expression is resolved to a type-id, regardless of the form of
16301 the corresponding template-parameter.
16303 Therefore, we try a type-id first. */
16306 /* If there was no error parsing the type-id but the next token is a
16307 '>>', our behavior depends on which dialect of C++ we're
16308 parsing. In C++98, we probably found a typo for '> >'. But there
16309 are type-id which are also valid expressions. For instance:
16311 struct X { int operator >> (int); };
16312 template <int V> struct Foo {};
16313 Foo<X () >> 5> r;
16315 Here 'X()' is a valid type-id of a function type, but the user just
16316 wanted to write the expression "X() >> 5". Thus, we remember that we
16317 found a valid type-id, but we still try to parse the argument as an
16318 expression to see what happens.
16320 In C++0x, the '>>' will be considered two separate '>'
16321 tokens. */
16325 {
16328 }
16329 else
16330 {
16331 /* If the next token isn't a `,' or a `>', then this argument wasn't
16332 really finished. This means that the argument is not a valid
16333 type-id. */
16336 /* If that worked, we're done. */
16339 }
16340 /* We're still not sure what the argument will be. */
16342 /* Try a template. */
16350 /* If the next token isn't a `,' or a `>', then this argument wasn't
16351 really finished. */
16355 {
16356 /* Figure out what is being referred to. If the id-expression
16357 was for a class template specialization, then we will have a
16358 TYPE_DECL at this point. There is no need to do name lookup
16359 at this point in that case. */
16362 none_type,
16368 /* Handle a constrained-type-specifier for a non-type template
16369 parameter. */
16375 }
16377 {
16381 }
16382 /* It must be a non-type argument. In C++17 any constant-expression is
16383 allowed. */
16387 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16389 -- an integral constant-expression of integral or enumeration
16390 type; or
16392 -- the name of a non-type template-parameter; or
16394 -- the name of an object or function with external linkage...
16396 -- the address of an object or function with external linkage...
16398 -- a pointer to member... */
16399 /* Look for a non-type template parameter. */
16401 {
16413 }
16415 /* If the next token is "&", the argument must be the address of an
16416 object or function with external linkage. */
16419 {
16422 }
16423 /* See if we might have an id-expression. */
16430 {
16433 address_p,
16440 else
16441 {
16442 tree probe;
16445 {
16446 /* Strip the dereference temporarily. */
16449 }
16451 /* If we're in a template, we represent a qualified-id referring
16452 to a static data member as a SCOPE_REF even if the scope isn't
16453 dependent so that we can check access control later. */
16458 {
16459 /* A variable without external linkage might still be a
16460 valid constant-expression, so no error is issued here
16461 if the external-linkage check fails. */
16464 }
16466 /* All overloaded functions are allowed; if the external
16467 linkage test does not pass, an error will be issued
16468 later. */
16469 ;
16473 /* A pointer-to-member. */
16474 ;
16476 ;
16477 else
16481 {
16484 tf_warning_or_error);
16485 else
16488 }
16489 }
16490 }
16491 /* If the argument started with "&", there are no other valid
16492 alternatives at this point. */
16494 {
16497 }
16499 general_expr:
16500 /* If the argument wasn't successfully parsed as a type-id followed
16501 by '>>', the argument can only be a constant expression now.
16502 Otherwise, we try parsing the constant-expression tentatively,
16503 because the argument could really be a type-id. */
16509 else
16510 {
16511 /* With C++17 generalized non-type template arguments we need to handle
16512 lvalue constant expressions, too. */
16515 }
16523 /* We did our best to parse the argument as a non type-id, but that
16524 was the only alternative that matched (albeit with a '>' after
16525 it). We can assume it's just a typo from the user, and a
16526 diagnostic will then be issued. */
16528 }
16530 /* Parse an explicit-instantiation.
16532 explicit-instantiation:
16533 template declaration
16535 Although the standard says `declaration', what it really means is:
16537 explicit-instantiation:
16538 template decl-specifier-seq [opt] declarator [opt] ;
16540 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16541 supposed to be allowed. A defect report has been filed about this
16542 issue.
16544 GNU Extension:
16546 explicit-instantiation:
16547 storage-class-specifier template
16548 decl-specifier-seq [opt] declarator [opt] ;
16549 function-specifier template
16550 decl-specifier-seq [opt] declarator [opt] ; */
16552 static void
16554 {
16556 cp_decl_specifier_seq decl_specifiers;
16561 /* Look for an (optional) storage-class-specifier or
16562 function-specifier. */
16564 {
16565 extension_specifier
16568 extension_specifier
16571 }
16573 /* Look for the `template' keyword. */
16575 /* Let the front end know that we are processing an explicit
16576 instantiation. */
16578 /* [temp.explicit] says that we are supposed to ignore access
16579 control while processing explicit instantiation directives. */
16581 /* Parse a decl-specifier-seq. */
16583 CP_PARSER_FLAGS_OPTIONAL,
16586 /* If there was exactly one decl-specifier, and it declared a class,
16587 and there's no declarator, then we have an explicit type
16588 instantiation. */
16590 {
16591 tree type;
16595 /* Turn access control back on for names used during
16596 template instantiation. */
16601 }
16602 else
16603 {
16605 tree decl;
16607 /* Parse the declarator. */
16608 declarator
16619 {
16622 "explicit instantiation shall not use"
16626 "explicit instantiation shall not use"
16631 /* Turn access control back on for names used during
16632 template instantiation. */
16634 /* Do the explicit instantiation. */
16636 }
16637 else
16638 {
16640 /* Skip the body of the explicit instantiation. */
16642 }
16643 }
16644 /* We're done with the instantiation. */
16650 }
16652 /* Parse an explicit-specialization.
16654 explicit-specialization:
16655 template < > declaration
16657 Although the standard says `declaration', what it really means is:
16659 explicit-specialization:
16660 template <> decl-specifier [opt] init-declarator [opt] ;
16661 template <> function-definition
16662 template <> explicit-specialization
16663 template <> template-declaration */
16665 static void
16667 {
16671 /* Look for the `template' keyword. */
16673 /* Look for the `<'. */
16675 /* Look for the `>'. */
16677 /* We have processed another parameter list. */
16679 /* [temp]
16681 A template ... explicit specialization ... shall not have C
16682 linkage. */
16684 {
16687 /* Give it C++ linkage to avoid confusing other parts of the
16688 front end. */
16691 }
16692 else
16694 /* Let the front end know that we are beginning a specialization. */
16696 {
16699 }
16701 /* If the next keyword is `template', we need to figure out whether
16702 or not we're looking a template-declaration. */
16704 {
16709 else
16711 }
16712 else
16713 /* Parse the dependent declaration. */
16719 /* We're done with the specialization. */
16721 /* For the erroneous case of a template with C linkage, we pushed an
16722 implicit C++ linkage scope; exit that scope now. */
16725 /* We're done with this parameter list. */
16727 }
16729 /* Parse a type-specifier.
16731 type-specifier:
16732 simple-type-specifier
16733 class-specifier
16734 enum-specifier
16735 elaborated-type-specifier
16736 cv-qualifier
16738 GNU Extension:
16740 type-specifier:
16741 __complex__
16743 Returns a representation of the type-specifier. For a
16744 class-specifier, enum-specifier, or elaborated-type-specifier, a
16745 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16747 The parser flags FLAGS is used to control type-specifier parsing.
16749 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16750 in a decl-specifier-seq.
16752 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16753 class-specifier, enum-specifier, or elaborated-type-specifier, then
16754 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16755 if a type is declared; 2 if it is defined. Otherwise, it is set to
16756 zero.
16758 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16759 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16760 is set to FALSE. */
16762 static tree
16764 cp_parser_flags flags,
16769 {
16775 /* Assume this type-specifier does not declare a new type. */
16778 /* And that it does not specify a cv-qualifier. */
16781 /* Peek at the next token. */
16784 /* If we're looking at a keyword, we can use that to guide the
16785 production we choose. */
16788 {
16793 /* Look for the enum-specifier. */
16795 /* If that worked, we're done. */
16797 {
16802 type_spec,
16803 token,
16806 }
16807 else
16810 /* Any of these indicate either a class-specifier, or an
16811 elaborated-type-specifier. */
16818 /* Parse tentatively so that we can back up if we don't find a
16819 class-specifier. */
16821 /* Look for the class-specifier. */
16824 /* If that worked, we're done. */
16826 {
16831 type_spec,
16832 token,
16835 }
16837 /* Fall through. */
16838 elaborated_type_specifier:
16839 /* We're declaring (not defining) a class or enum. */
16843 /* Fall through. */
16845 /* Look for an elaborated-type-specifier. */
16846 type_spec
16847 = (cp_parser_elaborated_type_specifier
16850 is_declaration));
16853 type_spec,
16854 token,
16877 /* The `__complex__' keyword is a GNU extension. */
16883 }
16885 /* Handle simple keywords. */
16887 {
16889 {
16892 }
16894 }
16896 /* If we do not already have a type-specifier, assume we are looking
16897 at a simple-type-specifier. */
16899 decl_specs,
16900 flags);
16902 /* If we didn't find a type-specifier, and a type-specifier was not
16903 optional in this context, issue an error message. */
16905 {
16908 }
16911 }
16913 /* Parse a simple-type-specifier.
16915 simple-type-specifier:
16916 :: [opt] nested-name-specifier [opt] type-name
16917 :: [opt] nested-name-specifier template template-id
16918 char
16919 wchar_t
16920 bool
16921 short
16922 int
16923 long
16924 signed
16925 unsigned
16926 float
16927 double
16928 void
16930 C++11 Extension:
16932 simple-type-specifier:
16933 auto
16934 decltype ( expression )
16935 char16_t
16936 char32_t
16937 __underlying_type ( type-id )
16939 C++17 extension:
16941 nested-name-specifier(opt) template-name
16943 GNU Extension:
16945 simple-type-specifier:
16946 __int128
16947 __typeof__ unary-expression
16948 __typeof__ ( type-id )
16949 __typeof__ ( type-id ) { initializer-list , [opt] }
16951 Concepts Extension:
16953 simple-type-specifier:
16954 constrained-type-specifier
16956 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16957 appropriately updated. */
16959 static tree
16962 cp_parser_flags flags)
16963 {
16968 /* Peek at the next token. */
16971 /* If we're looking at a keyword, things are easy. */
16973 {
17008 {
17011 }
17040 {
17041 /* The 'auto' might be the placeholder return type for a function decl
17042 with trailing return type. */
17051 {
17053 {
17060 }
17063 {
17066 }
17069 }
17073 {
17076 }
17079 {
17082 }
17083 else
17087 {
17090 "use of %<auto%> in lambda parameter declaration "
17091 "only available with "
17093 }
17096 "use of %<auto%> in parameter declaration "
17097 "only available with "
17101 "ISO C++ forbids use of %<auto%> in parameter "
17103 }
17104 else
17109 /* Since DR 743, decltype can either be a simple-type-specifier by
17110 itself or begin a nested-name-specifier. Parsing it will replace
17111 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17112 handling below decide what to do. */
17118 /* Consume the `typeof' token. */
17120 /* Parse the operand to `typeof'. */
17122 /* If it is not already a TYPE, take its type. */
17128 token,
17137 token,
17147 token,
17152 }
17154 /* If token is an already-parsed decltype not followed by ::,
17155 it's a simple-type-specifier. */
17158 {
17161 {
17163 token,
17165 /* Remember that we are handling a decltype in order to
17166 implement the resolution of DR 1510 when the argument
17167 isn't instantiation dependent. */
17169 }
17172 }
17174 /* If the type-specifier was for a built-in type, we're done. */
17176 {
17177 /* Record the type. */
17184 type,
17185 token,
17190 /* Consume the token. */
17196 /* There is no valid C++ program where a non-template type is
17197 followed by a "<". That usually indicates that the user thought
17198 that the type was a template. */
17203 }
17205 /* The type-specifier must be a user-defined type. */
17207 {
17211 /* Don't gobble tokens or issue error messages if this is an
17212 optional type-specifier. */
17218 /* Look for the optional `::' operator. */
17219 global_p
17223 /* Look for the nested-name specifier. */
17224 qualified_p
17231 /* If we have seen a nested-name-specifier, and the next token
17232 is `template', then we are using the template-id production. */
17235 {
17236 /* Look for the template-id. */
17240 none_type,
17242 /* If the template-id did not name a type, we are out of
17243 luck. */
17245 {
17248 }
17249 }
17250 /* Otherwise, look for a type-name. */
17251 else
17253 /* Keep track of all name-lookups performed in class scopes. */
17255 && !global_p
17256 && !qualified_p
17260 /* If it didn't work out, we don't have a TYPE. */
17265 {
17279 {
17281 none_type,
17291 else
17292 {
17297 }
17298 }
17299 else
17305 }
17308 token,
17310 }
17312 /* If we didn't get a type-name, issue an error message. */
17314 {
17317 }
17320 {
17321 /* See if TYPE is an Objective-C type, and if so, parse and
17322 accept any protocol references following it. Do this before
17323 the cp_parser_check_for_invalid_template_id() call, because
17324 Objective-C types can be followed by '<...>' which would
17325 enclose protocol names rather than template arguments, and so
17326 everything is fine. */
17329 {
17333 /* Clobber the "unqualified" type previously entered into
17334 DECL_SPECS with the new, improved protocol-qualified version. */
17339 }
17341 /* There is no valid C++ program where a non-template type is
17342 followed by a "<". That usually indicates that the user
17343 thought that the type was a template. */
17345 none_type,
17347 }
17350 }
17352 /* Parse a type-name.
17354 type-name:
17355 class-name
17356 enum-name
17357 typedef-name
17358 simple-template-id [in c++0x]
17360 enum-name:
17361 identifier
17363 typedef-name:
17364 identifier
17366 Concepts:
17368 type-name:
17369 concept-name
17370 partial-concept-id
17372 concept-name:
17373 identifier
17375 Returns a TYPE_DECL for the type. */
17377 static tree
17379 {
17381 }
17383 /* See above. */
17384 static tree
17386 {
17387 tree type_decl;
17389 /* We can't know yet whether it is a class-name or not. */
17391 /* Try a class-name. */
17393 typename_keyword_p,
17395 none_type,
17399 /* If it's not a class-name, keep looking. */
17401 {
17403 /* It must be a typedef-name or an enum-name. */
17407 /* It is either a simple-template-id representing an
17408 instantiation of an alias template... */
17412 none_type,
17414 /* Note that this must be an instantiation of an alias template
17415 because [temp.names]/6 says:
17417 A template-id that names an alias template specialization
17418 is a type-name.
17420 Whereas [temp.names]/7 says:
17422 A simple-template-id that names a class template
17423 specialization is a class-name.
17425 With concepts, this could also be a partial-concept-id that
17426 declares a non-type template parameter. */
17433 else
17437 /* ... Or a typedef-name or an enum-name. */
17439 }
17442 }
17444 /* Check if DECL and ARGS can form a constrained-type-specifier.
17445 If ARGS is non-null, we try to form a concept check of the
17446 form DECL<?, ARGS> where ? is a wildcard that matches any
17447 kind of template argument. If ARGS is NULL, then we try to
17448 form a concept check of the form DECL<?>. */
17450 static tree
17453 {
17456 /* If we a constrained-type-specifier cannot be deduced. */
17460 /* A constrained type specifier can only be found in an
17461 overload set or as a reference to a template declaration.
17463 FIXME: This might be masking a bug. It's possible that
17464 that the deduction below is causing template specializations
17465 to be formed with the wildcard as an argument. */
17469 /* Try to build a call expression that evaluates the
17470 concept. This can fail if the overload set refers
17471 only to non-templates. */
17477 /* Deduce the checked constraint and the prototype parameter.
17479 FIXME: In certain cases, failure to deduce should be a
17480 diagnosable error. */
17481 tree conc;
17482 tree proto;
17486 /* In template parameter scope, this results in a constrained
17487 parameter. Return a descriptor of that parm. */
17491 /* In a parameter-declaration-clause, constrained-type
17492 specifiers result in invented template parameters. */
17494 {
17497 }
17498 else
17499 {
17500 /* Otherwise, we're in a context where the constrained
17501 type name is deduced and the constraint applies
17502 after deduction. */
17504 }
17507 }
17509 /* If DECL refers to a concept, return a TYPE_DECL representing
17510 the result of using the constrained type specifier in the
17511 current context. DECL refers to a concept if
17513 - it is an overload set containing a function concept taking a single
17514 type argument, or
17516 - it is a variable concept taking a single type argument. */
17518 static tree
17520 {
17526 else
17528 }
17530 /* Check if DECL and ARGS form a partial-concept-id. If so,
17531 assign ID to the resulting constrained placeholder.
17533 Returns true if the partial-concept-id designates a placeholder
17534 and false otherwise. Note that *id is set to NULL_TREE in
17535 this case. */
17537 static tree
17539 {
17541 }
17543 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17544 or a concept-name.
17546 enum-name:
17547 identifier
17549 typedef-name:
17550 identifier
17552 concept-name:
17553 identifier
17555 Returns a TYPE_DECL for the type. */
17557 static tree
17559 {
17560 tree type_decl;
17561 tree identifier;
17568 /* Look up the type-name. */
17573 /* If we found an overload set, then it may refer to a concept-name. */
17579 {
17580 /* See if this is an Objective-C type. */
17585 }
17587 /* Issue an error if we did not find a type-name. */
17589 /* In Objective-C, we have the complication that class names are
17590 normally type names and start declarations (eg, the
17591 "NSObject" in "NSObject *object;"), but can be used in an
17592 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17593 is an expression. So, a classname followed by a dot is not a
17594 valid type-name. */
17597 {
17602 }
17603 /* Remember that the name was used in the definition of the
17604 current class so that we can check later to see if the
17605 meaning would have been different after the class was
17606 entirely defined. */
17612 }
17614 /* Parse an elaborated-type-specifier. Note that the grammar given
17615 here incorporates the resolution to DR68.
17617 elaborated-type-specifier:
17618 class-key :: [opt] nested-name-specifier [opt] identifier
17619 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17620 enum-key :: [opt] nested-name-specifier [opt] identifier
17621 typename :: [opt] nested-name-specifier identifier
17622 typename :: [opt] nested-name-specifier template [opt]
17623 template-id
17625 GNU extension:
17627 elaborated-type-specifier:
17628 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17629 class-key attributes :: [opt] nested-name-specifier [opt]
17630 template [opt] template-id
17631 enum attributes :: [opt] nested-name-specifier [opt] identifier
17633 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17634 declared `friend'. If IS_DECLARATION is TRUE, then this
17635 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17636 something is being declared.
17638 Returns the TYPE specified. */
17640 static tree
17644 {
17646 tree identifier;
17649 tree globalscope;
17652 /* See if we're looking at the `enum' keyword. */
17654 {
17655 /* Consume the `enum' token. */
17657 /* Remember that it's an enumeration type. */
17659 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17660 enums) is used here. */
17664 {
17671 /* Consume the `struct' or `class' and parse it anyway. */
17673 }
17674 /* Parse the attributes. */
17676 }
17677 /* Or, it might be `typename'. */
17679 RID_TYPENAME))
17680 {
17681 /* Consume the `typename' token. */
17683 /* Remember that it's a `typename' type. */
17685 }
17686 /* Otherwise it must be a class-key. */
17687 else
17688 {
17692 /* Parse the attributes. */
17694 }
17696 /* Look for the `::' operator. */
17699 /* Look for the nested-name-specifier. */
17700 tree nested_name_specifier;
17702 {
17703 nested_name_specifier
17708 is_declaration);
17711 }
17712 else
17713 /* Even though `typename' is not present, the proposed resolution
17714 to Core Issue 180 says that in `class A<T>::B', `B' should be
17715 considered a type-name, even if `A<T>' is dependent. */
17716 nested_name_specifier
17721 is_declaration);
17722 /* For everything but enumeration types, consider a template-id.
17723 For an enumeration type, consider only a plain identifier. */
17725 {
17727 tree decl;
17729 /* Allow the `template' keyword. */
17731 /* If we didn't see `template', we don't know if there's a
17732 template-id or not. */
17735 /* Parse the template-id. */
17739 tag_type,
17740 is_declaration);
17741 /* If we didn't find a template-id, look for an ordinary
17742 identifier. */
17744 ;
17745 /* We can get here when cp_parser_template_id, called by
17746 cp_parser_class_name with tag_type == none_type, succeeds
17747 and caches a BASELINK. Then, when called again here,
17748 instead of failing and returning an error_mark_node
17749 returns it (see template/typename17.C in C++11).
17750 ??? Could we diagnose this earlier? */
17752 {
17755 }
17756 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17757 in effect, then we must assume that, upon instantiation, the
17758 template will correspond to a class. */
17762 typename_type,
17764 /* If the `typename' keyword is in effect and DECL is not a type
17765 decl, then type is non existent. */
17767 ;
17769 {
17773 /* If the next token is a semicolon, this must be a specialization,
17774 instantiation, or friend declaration. Check the scope while we
17775 still know whether or not we had a nested-name-specifier. */
17780 }
17783 }
17786 {
17791 {
17794 }
17796 /* For a `typename', we needn't call xref_tag. */
17802 /* Template parameter lists apply only if we are not within a
17803 function parameter list. */
17804 bool template_parm_lists_apply
17813 /* Look up a qualified name in the usual way. */
17815 {
17816 tree decl;
17817 tree ambiguous_decls;
17820 tag_type,
17827 /* If the lookup was ambiguous, an error will already have been
17828 issued. */
17832 /* If we are parsing friend declaration, DECL may be a
17833 TEMPLATE_DECL tree node here. However, we need to check
17834 whether this TEMPLATE_DECL results in valid code. Consider
17835 the following example:
17837 namespace N {
17838 template <class T> class C {};
17839 }
17840 class X {
17841 template <class T> friend class N::C; // #1, valid code
17842 };
17843 template <class T> class Y {
17844 friend class N::C; // #2, invalid code
17845 };
17847 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17848 name lookup of `N::C'. We see that friend declaration must
17849 be template for the code to be valid. Note that
17850 processing_template_decl does not work here since it is
17851 always 1 for the above two cases. */
17853 decl = (cp_parser_maybe_treat_template_as_class
17858 {
17860 identifier,
17863 }
17866 {
17870 allow_template);
17874 }
17876 /* Forward declarations of nested types, such as
17878 class C1::C2;
17879 class C1::C2::C3;
17881 are invalid unless all components preceding the final '::'
17882 are complete. If all enclosing types are complete, these
17883 declarations become merely pointless.
17885 Invalid forward declarations of nested types are errors
17886 caught elsewhere in parsing. Those that are pointless arrive
17887 here. */
17894 }
17895 else
17896 {
17897 /* An elaborated-type-specifier sometimes introduces a new type and
17898 sometimes names an existing type. Normally, the rule is that it
17899 introduces a new type only if there is not an existing type of
17900 the same name already in scope. For example, given:
17902 struct S {};
17903 void f() { struct S s; }
17905 the `struct S' in the body of `f' is the same `struct S' as in
17906 the global scope; the existing definition is used. However, if
17907 there were no global declaration, this would introduce a new
17908 local class named `S'.
17910 An exception to this rule applies to the following code:
17912 namespace N { struct S; }
17914 Here, the elaborated-type-specifier names a new type
17915 unconditionally; even if there is already an `S' in the
17916 containing scope this declaration names a new type.
17917 This exception only applies if the elaborated-type-specifier
17918 forms the complete declaration:
17920 [class.name]
17922 A declaration consisting solely of `class-key identifier ;' is
17923 either a redeclaration of the name in the current scope or a
17924 forward declaration of the identifier as a class name. It
17925 introduces the name into the current scope.
17927 We are in this situation precisely when the next token is a `;'.
17929 An exception to the exception is that a `friend' declaration does
17930 *not* name a new type; i.e., given:
17932 struct S { friend struct T; };
17934 `T' is not a new type in the scope of `S'.
17936 Also, `new struct S' or `sizeof (struct S)' never results in the
17937 definition of a new type; a new type can only be declared in a
17938 declaration context. */
17940 tag_scope ts;
17944 /* Friends have special name lookup rules. */
17948 CPP_SEMICOLON))
17949 /* This is a `class-key identifier ;' */
17951 else
17954 template_p =
17955 (template_parm_lists_apply
17958 /* An unqualified name was used to reference this type, so
17959 there were no qualifying templates. */
17967 }
17968 }
17973 /* Allow attributes on forward declarations of classes. */
17975 {
17985 else
17988 }
17991 {
17992 /* Indicate whether this class was declared as a `class' or as a
17993 `struct'. */
17997 }
17999 /* A "<" cannot follow an elaborated type specifier. If that
18000 happens, the user was probably trying to form a template-id. */
18005 }
18007 /* Parse an enum-specifier.
18009 enum-specifier:
18010 enum-head { enumerator-list [opt] }
18011 enum-head { enumerator-list , } [C++0x]
18013 enum-head:
18014 enum-key identifier [opt] enum-base [opt]
18015 enum-key nested-name-specifier identifier enum-base [opt]
18017 enum-key:
18018 enum
18019 enum class [C++0x]
18020 enum struct [C++0x]
18022 enum-base: [C++0x]
18023 : type-specifier-seq
18025 opaque-enum-specifier:
18026 enum-key identifier enum-base [opt] ;
18028 GNU Extensions:
18029 enum-key attributes[opt] identifier [opt] enum-base [opt]
18030 { enumerator-list [opt] }attributes[opt]
18031 enum-key attributes[opt] identifier [opt] enum-base [opt]
18032 { enumerator-list, }attributes[opt] [C++0x]
18034 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18035 if the token stream isn't an enum-specifier after all. */
18037 static tree
18039 {
18040 tree identifier;
18042 tree prev_scope;
18044 tree attributes;
18057 /* Parse tentatively so that we can back up if we don't find a
18058 enum-specifier. */
18061 /* Caller guarantees that the current token is 'enum', an identifier
18062 possibly follows, and the token after that is an opening brace.
18063 If we don't have an identifier, fabricate an anonymous name for
18064 the enumeration being defined. */
18067 /* Parse the "class" or "struct", which indicates a scoped
18068 enumeration type in C++0x. */
18071 {
18075 /* Consume the `struct' or `class' token. */
18079 }
18083 /* Clear the qualification. */
18088 /* Figure out in what scope the declaration is being placed. */
18094 nested_name_specifier
18102 {
18103 tree name;
18107 enum_type,
18112 input_location);
18114 {
18117 {
18118 /* Are template enums allowed in ISO? */
18122 /* ignore a typename reference, for it will be solved by name
18123 in start_enum. */
18125 }
18126 }
18129 else
18130 {
18135 }
18136 }
18137 else
18138 {
18141 else
18142 {
18148 }
18149 }
18152 /* Check for the `:' that denotes a specified underlying type in C++0x.
18153 Note that a ':' could also indicate a bitfield width, however. */
18155 {
18156 cp_decl_specifier_seq type_specifiers;
18158 /* Consume the `:'. */
18161 /* Parse the type-specifier-seq. */
18166 /* At this point this is surely not elaborated type specifier. */
18175 /* If that didn't work, stop. */
18177 {
18183 }
18184 }
18186 /* Look for the `{' but don't consume it yet. */
18188 {
18190 {
18193 {
18196 }
18197 }
18198 /* An opaque-enum-specifier must have a ';' here. */
18201 {
18204 {
18207 }
18208 }
18209 }
18215 {
18217 {
18221 }
18223 {
18225 }
18226 }
18228 /* Issue an error message if type-definitions are forbidden here. */
18231 else
18232 /* Create the new type. We do this before consuming the opening
18233 brace so the enum will be recorded as being on the line of its
18234 tag (or the 'enum' keyword, if there is no tag). */
18238 /* If the next token is not '{' it is an opaque-enum-specifier or an
18239 elaborated-type-specifier. */
18241 {
18245 {
18246 /* The following catches invalid code such as:
18247 enum class S<int>::E { A, B, C }; */
18255 {
18259 nested_name_specifier);
18261 }
18264 {
18266 "%qT for enum declaration does not name a class "
18269 }
18270 /* If that scope does not contain the scope in which the
18271 class was originally declared, the program is invalid. */
18273 nested_name_specifier))
18274 {
18277 "declaration of %qD in namespace %qD which does not "
18280 else
18282 "declaration of %qD in %qD which does not "
18286 }
18287 /* If that scope is the scope where the declaration is being placed
18288 the program is invalid. */
18292 {
18296 }
18297 }
18302 /* Consume the opening brace. */
18303 matching_braces braces;
18310 {
18314 }
18315 else
18316 {
18322 }
18326 /* If the next token is not '}', then there are some enumerators. */
18328 {
18332 }
18333 else
18336 /* Consume the final '}'. */
18342 }
18343 else
18344 {
18345 /* If a ';' follows, then it is an opaque-enum-specifier
18346 and additional restrictions apply. */
18348 {
18355 }
18356 }
18358 /* Look for trailing attributes to apply to this enumeration, and
18359 apply them if appropriate. */
18361 {
18364 trailing_attr,
18366 }
18368 /* Finish up the enumeration. */
18370 {
18375 }
18378 {
18380 {
18383 }
18385 {
18387 }
18388 }
18389 out:
18392 }
18394 /* Parse an enumerator-list. The enumerators all have the indicated
18395 TYPE.
18397 enumerator-list:
18398 enumerator-definition
18399 enumerator-list , enumerator-definition */
18401 static void
18403 {
18405 {
18406 /* Parse an enumerator-definition. */
18409 /* If the next token is not a ',', we've reached the end of
18410 the list. */
18413 /* Otherwise, consume the `,' and keep going. */
18415 /* If the next token is a `}', there is a trailing comma. */
18417 {
18422 }
18423 }
18424 }
18426 /* Parse an enumerator-definition. The enumerator has the indicated
18427 TYPE.
18429 enumerator-definition:
18430 enumerator
18431 enumerator = constant-expression
18433 enumerator:
18434 identifier
18436 GNU Extensions:
18438 enumerator-definition:
18439 enumerator attributes [opt]
18440 enumerator attributes [opt] = constant-expression */
18442 static void
18444 {
18445 tree identifier;
18446 tree value;
18447 location_t loc;
18449 /* Save the input location because we are interested in the location
18450 of the identifier and not the location of the explicit value. */
18453 /* Look for the identifier. */
18458 /* Parse any specified attributes. */
18461 /* If the next token is an '=', then there is an explicit value. */
18463 {
18464 /* Consume the `=' token. */
18466 /* Parse the value. */
18468 }
18469 else
18472 /* If we are processing a template, make sure the initializer of the
18473 enumerator doesn't contain any bare template parameter pack. */
18477 /* Create the enumerator. */
18479 }
18481 /* Parse a namespace-name.
18483 namespace-name:
18484 original-namespace-name
18485 namespace-alias
18487 Returns the NAMESPACE_DECL for the namespace. */
18489 static tree
18491 {
18492 tree identifier;
18493 tree namespace_decl;
18497 /* Get the name of the namespace. */
18502 /* Look up the identifier in the currently active scope. Look only
18503 for namespaces, due to:
18505 [basic.lookup.udir]
18507 When looking up a namespace-name in a using-directive or alias
18508 definition, only namespace names are considered.
18510 And:
18512 [basic.lookup.qual]
18514 During the lookup of a name preceding the :: scope resolution
18515 operator, object, function, and enumerator names are ignored.
18517 (Note that cp_parser_qualifying_entity only calls this
18518 function if the token after the name is the scope resolution
18519 operator.) */
18521 none_type,
18527 /* If it's not a namespace, issue an error. */
18530 {
18535 }
18538 }
18540 /* Parse a namespace-definition.
18542 namespace-definition:
18543 named-namespace-definition
18544 unnamed-namespace-definition
18546 named-namespace-definition:
18547 original-namespace-definition
18548 extension-namespace-definition
18550 original-namespace-definition:
18551 namespace identifier { namespace-body }
18553 extension-namespace-definition:
18554 namespace original-namespace-name { namespace-body }
18556 unnamed-namespace-definition:
18557 namespace { namespace-body } */
18559 static void
18561 {
18562 tree identifier;
18571 {
18574 }
18576 /* Look for the `namespace' keyword. */
18577 cp_token* token
18580 /* Parse any specified attributes before the identifier. */
18584 {
18588 {
18591 /* Parse any attributes specified after the identifier. */
18593 }
18600 "nested namespace definitions only available with "
18603 /* Nested namespace names can create new namespaces (unlike
18604 other qualified-ids). */
18607 else
18610 }
18622 /* Start the namespace. */
18629 /* Look for the `{' to validate starting the namespace. */
18630 matching_braces braces;
18632 {
18633 /* Parse the body of the namespace. */
18636 /* Look for the final `}'. */
18638 }
18643 /* Pop the nested namespace definitions. */
18646 }
18648 /* Parse a namespace-body.
18650 namespace-body:
18651 declaration-seq [opt] */
18653 static void
18655 {
18657 }
18659 /* Parse a namespace-alias-definition.
18661 namespace-alias-definition:
18662 namespace identifier = qualified-namespace-specifier ; */
18664 static void
18666 {
18667 tree identifier;
18668 tree namespace_specifier;
18672 /* Look for the `namespace' keyword. */
18674 /* Look for the identifier. */
18678 /* Look for the `=' token. */
18681 {
18683 /* Skip the definition. */
18688 }
18690 /* Look for the qualified-namespace-specifier. */
18691 namespace_specifier
18693 /* Look for the `;' token. */
18696 /* Register the alias in the symbol table. */
18698 }
18700 /* Parse a qualified-namespace-specifier.
18702 qualified-namespace-specifier:
18703 :: [opt] nested-name-specifier [opt] namespace-name
18705 Returns a NAMESPACE_DECL corresponding to the specified
18706 namespace. */
18708 static tree
18710 {
18711 /* Look for the optional `::'. */
18715 /* Look for the optional nested-name-specifier. */
18723 }
18725 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18726 access declaration.
18728 using-declaration:
18729 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18730 using :: unqualified-id ;
18732 access-declaration:
18733 qualified-id ;
18735 */
18737 static bool
18740 {
18744 tree decl;
18745 tree identifier;
18746 tree qscope;
18751 {
18754 }
18755 else
18756 {
18757 /* Look for the `using' keyword. */
18760 again:
18761 /* Peek at the next token. */
18763 /* See if it's `typename'. */
18765 {
18766 /* Remember that we've seen it. */
18768 /* Consume the `typename' token. */
18770 }
18771 }
18773 /* Look for the optional global scope qualification. */
18774 global_scope_p
18779 /* If we saw `typename', or didn't see `::', then there must be a
18780 nested-name-specifier present. */
18782 {
18788 {
18791 }
18792 }
18793 /* Otherwise, we could be in either of the two productions. In that
18794 case, treat the nested-name-specifier as optional. */
18795 else
18807 /* Something has already gone wrong; there's no need to parse
18808 further. Since an error has occurred, the return value of
18809 cp_parser_parse_definitely will be false, as required. */
18813 /* Parse the unqualified-id. */
18821 {
18826 }
18828 {
18833 "pack expansion in using-declaration only available "
18836 }
18838 /* The function we call to handle a using-declaration is different
18839 depending on what scope we are in. */
18841 ;
18844 /* [namespace.udecl]
18846 A using declaration shall not name a template-id. */
18849 else
18850 {
18852 {
18853 /* Create the USING_DECL. */
18860 {
18863 }
18864 else
18865 /* Add it to the list of members in this class. */
18867 }
18868 else
18869 {
18871 identifier,
18878 {
18881 }
18884 else
18886 }
18887 }
18891 {
18895 "comma-separated list in using-declaration only available "
18898 }
18900 /* Look for the final `;'. */
18905 "access declarations are deprecated "
18906 "in favour of using-declarations; "
18910 }
18912 /* Parse an alias-declaration.
18914 alias-declaration:
18915 using identifier attribute-specifier-seq [opt] = type-id */
18917 static tree
18919 {
18921 location_t id_location;
18923 cp_decl_specifier_seq decl_specs;
18927 /* Look for the `using' keyword. */
18928 cp_token *using_token
18950 /* Now we are going to parse the type-id of the declaration. */
18952 /*
18953 [dcl.type]/3 says:
18955 "A type-specifier-seq shall not define a class or enumeration
18956 unless it appears in the type-id of an alias-declaration (7.1.3) that
18957 is not the declaration of a template-declaration."
18959 In other words, if we currently are in an alias template, the
18960 type-id should not define a type.
18962 So let's set parser->type_definition_forbidden_message in that
18963 case; cp_parser_check_type_definition (called by
18964 cp_parser_class_specifier) will then emit an error if a type is
18965 defined in the type-id. */
18967 {
18971 }
18975 /* Restore the error message if need be. */
18981 {
18984 }
18986 /* A typedef-name can also be introduced by an alias-declaration. The
18987 identifier following the using keyword becomes a typedef-name. It has
18988 the same semantics as if it were introduced by the typedef
18989 specifier. In particular, it does not define a new type and it shall
18990 not appear in the type-id. */
18995 {
18998 ds_attribute,
18999 attrs_token);
19000 }
19002 ds_typedef,
19003 using_token);
19005 ds_alias,
19006 using_token);
19015 else
19021 // Attach constraints to the alias declaration.
19023 {
19027 }
19034 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19035 added into the symbol table; otherwise, return the TYPE_DECL. */
19039 {
19043 }
19046 }
19048 /* Parse a using-directive.
19050 using-directive:
19051 using namespace :: [opt] nested-name-specifier [opt]
19052 namespace-name ; */
19054 static void
19056 {
19057 tree namespace_decl;
19058 tree attribs;
19060 /* Look for the `using' keyword. */
19062 /* And the `namespace' keyword. */
19064 /* Look for the optional `::' operator. */
19066 /* And the optional nested-name-specifier. */
19072 /* Get the namespace being used. */
19074 /* And any specified attributes. */
19077 /* Update the symbol table. */
19080 else
19083 /* Look for the final `;'. */
19085 }
19087 /* Parse an asm-definition.
19089 asm-definition:
19090 asm ( string-literal ) ;
19092 GNU Extension:
19094 asm-definition:
19095 asm volatile [opt] ( string-literal ) ;
19096 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19097 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19098 : asm-operand-list [opt] ) ;
19099 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19100 : asm-operand-list [opt]
19101 : asm-clobber-list [opt] ) ;
19102 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19103 : asm-clobber-list [opt]
19104 : asm-goto-list ) ; */
19106 static void
19108 {
19109 tree string;
19114 tree asm_stmt;
19122 /* Look for the `asm' keyword. */
19127 {
19130 }
19132 /* See if the next token is `volatile'. */
19135 {
19136 /* Remember that we saw the `volatile' keyword. */
19138 /* Consume the token. */
19140 }
19144 {
19145 /* Remember that we saw the `goto' keyword. */
19147 /* Consume the token. */
19149 }
19150 /* Look for the opening `('. */
19153 /* Look for the string. */
19156 {
19160 }
19162 /* If we're allowing GNU extensions, check for the extended assembly
19163 syntax. Unfortunately, the `:' tokens need not be separated by
19164 a space in C, and so, for compatibility, we tolerate that here
19165 too. Doing that means that we have to treat the `::' operator as
19166 two `:' tokens. */
19171 {
19176 /* The extended syntax was used. */
19179 /* Look for outputs. */
19181 {
19182 /* Consume the `:'. */
19184 /* Parse the output-operands. */
19186 CPP_COLON)
19188 CPP_SCOPE)
19190 CPP_CLOSE_PAREN)
19192 {
19196 }
19197 }
19198 /* If the next token is `::', there are no outputs, and the
19199 next token is the beginning of the inputs. */
19201 /* The inputs are coming next. */
19204 /* Look for inputs. */
19207 {
19208 /* Consume the `:' or `::'. */
19210 /* Parse the output-operands. */
19212 CPP_COLON)
19214 CPP_SCOPE)
19216 CPP_CLOSE_PAREN))
19217 {
19221 }
19222 }
19224 /* The clobbers are coming next. */
19227 /* Look for clobbers. */
19230 {
19232 /* Consume the `:' or `::'. */
19234 /* Parse the clobbers. */
19236 CPP_COLON)
19238 CPP_CLOSE_PAREN))
19240 }
19243 /* The labels are coming next. */
19246 /* Look for labels. */
19249 {
19251 /* Consume the `:' or `::'. */
19253 /* Parse the labels. */
19255 }
19259 }
19263 /* Look for the closing `)'. */
19271 {
19272 /* Create the ASM_EXPR. */
19274 {
19277 /* If the extended syntax was not used, mark the ASM_EXPR. */
19279 {
19285 }
19286 }
19287 else
19289 }
19290 }
19292 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19293 type that comes from the decl-specifier-seq. */
19295 static tree
19297 {
19300 {
19313 }
19316 }
19318 /* Declarators [gram.dcl.decl] */
19320 /* Parse an init-declarator.
19322 init-declarator:
19323 declarator initializer [opt]
19325 GNU Extension:
19327 init-declarator:
19328 declarator asm-specification [opt] attributes [opt] initializer [opt]
19330 function-definition:
19331 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19332 function-body
19333 decl-specifier-seq [opt] declarator function-try-block
19335 GNU Extension:
19337 function-definition:
19338 __extension__ function-definition
19340 TM Extension:
19342 function-definition:
19343 decl-specifier-seq [opt] declarator function-transaction-block
19345 The DECL_SPECIFIERS apply to this declarator. Returns a
19346 representation of the entity declared. If MEMBER_P is TRUE, then
19347 this declarator appears in a class scope. The new DECL created by
19348 this declarator is returned.
19350 The CHECKS are access checks that should be performed once we know
19351 what entity is being declared (and, therefore, what classes have
19352 befriended it).
19354 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19355 for a function-definition here as well. If the declarator is a
19356 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19357 be TRUE upon return. By that point, the function-definition will
19358 have been completely parsed.
19360 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19361 is FALSE.
19363 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19364 parsed declaration if it is an uninitialized single declarator not followed
19365 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19366 if present, will not be consumed. If returned, this declarator will be
19367 created with SD_INITIALIZED but will not call cp_finish_decl.
19369 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19370 and there is an initializer, the pointed location_t is set to the
19371 location of the '=' or `(', or '{' in C++11 token introducing the
19372 initializer. */
19374 static tree
19385 {
19389 tree prefix_attributes;
19391 tree asm_specification;
19392 tree initializer;
19394 tree scope;
19396 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19397 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19398 "(...)". */
19409 /* Gather the attributes that were provided with the
19410 decl-specifiers. */
19413 /* Assume that this is not the declarator for a function
19414 definition. */
19418 /* Default arguments are only permitted for function parameters. */
19422 /* Defer access checks while parsing the declarator; we cannot know
19423 what names are accessible until we know what is being
19424 declared. */
19429 /* Parse the declarator. */
19430 declarator
19435 /* Gather up the deferred checks. */
19440 /* If the DECLARATOR was erroneous, there's no need to go
19441 further. */
19445 /* Check that the number of template-parameter-lists is OK. */
19455 /* Figure out what scope the entity declared by the DECLARATOR is
19456 located in. `grokdeclarator' sometimes changes the scope, so
19457 we compute it now. */
19460 /* Perform any lookups in the declared type which were thought to be
19461 dependent, but are not in the scope of the declarator. */
19462 decl_specifiers->type
19465 /* If we're allowing GNU extensions, look for an
19466 asm-specification. */
19468 {
19469 /* Look for an asm-specification. */
19472 }
19473 else
19476 /* Look for attributes. */
19480 /* Peek at the next token. */
19486 {
19487 /* Handle C++17 deduction guides. */
19491 {
19499 {
19503 }
19504 }
19506 /* Check to see if the token indicates the start of a
19507 function-definition. */
19509 {
19511 {
19512 /* If a function-definition should not appear here, issue an
19513 error message. */
19517 }
19519 location_t func_brace_location
19522 /* Neither attributes nor an asm-specification are allowed
19523 on a function-definition. */
19526 "an asm-specification is not allowed "
19530 "attributes are not allowed "
19532 /* This is a function-definition. */
19535 /* Parse the function definition. */
19538 decl_specifiers,
19539 declarator,
19540 prefix_attributes);
19541 else
19542 decl =
19543 (cp_parser_function_definition_from_specifiers_and_declarator
19547 {
19548 /* This is where the prologue starts... */
19551 }
19554 }
19555 }
19557 {
19558 /* A non-template declaration involving a function parameter list
19559 containing an implicit template parameter will be made into a
19560 template. If the resulting declaration is not going to be an
19561 actual function then finish the template scope here to prevent it.
19562 An error message will be issued once we have a decl to talk about.
19564 FIXME probably we should do type deduction rather than create an
19565 implicit template, but the standard currently doesn't allow it. */
19568 }
19570 /* [dcl.dcl]
19572 Only in function declarations for constructors, destructors, type
19573 conversions, and deduction guides can the decl-specifier-seq be omitted.
19575 We explicitly postpone this check past the point where we handle
19576 function-definitions because we tolerate function-definitions
19577 that are missing their return types in some modes. */
19579 {
19583 }
19585 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19589 {
19600 {
19606 }
19607 }
19608 else
19609 {
19610 /* If the init-declarator isn't initialized and isn't followed by a
19611 `,' or `;', it's not a valid init-declarator. */
19614 {
19617 else
19618 {
19622 }
19623 }
19626 }
19628 /* Because start_decl has side-effects, we should only call it if we
19629 know we're going ahead. By this point, we know that we cannot
19630 possibly be looking at any other construct. */
19633 /* Enter the newly declared entry in the symbol table. If we're
19634 processing a declaration in a class-specifier, we wait until
19635 after processing the initializer. */
19637 {
19645 /* Adjust location of decl if declarator->id_loc is more appropriate:
19646 set, and decl wasn't merged with another decl, in which case its
19647 location would be different from input_location, and more accurate. */
19652 }
19654 /* Enter the SCOPE. That way unqualified names appearing in the
19655 initializer will be looked up in SCOPE. */
19658 /* Perform deferred access control checks, now that we know in which
19659 SCOPE the declared entity resides. */
19661 {
19664 /* If the entity being declared is a function, pretend that we
19665 are in its scope. If it is a `friend', it may have access to
19666 things that would not otherwise be accessible. */
19668 {
19671 }
19673 /* Perform access checks for template parameters. */
19676 /* Perform the access control checks for the declarator and the
19677 decl-specifiers. */
19680 /* Restore the saved value. */
19683 }
19685 /* Parse the initializer. */
19690 {
19692 {
19695 else
19696 {
19697 /* If the declaration was erroneous, we don't really
19698 know what the user intended, so just silently
19699 consume the initializer. */
19706 }
19707 }
19708 else
19709 {
19710 /* We want to record the extra mangling scope for in-class
19711 initializers of class members and initializers of static data
19712 member templates. The former involves deferring
19713 parsing of the initializer until end of class as with default
19714 arguments. So right here we only handle the latter. */
19724 }
19725 }
19727 /* The old parser allows attributes to appear after a parenthesized
19728 initializer. Mark Mitchell proposed removing this functionality
19729 on the GCC mailing lists on 2002-08-13. This parser accepts the
19730 attributes -- but ignores them. */
19737 /* And now complain about a non-function implicit template. */
19742 /* For an in-class declaration, use `grokfield' to create the
19743 declaration. */
19745 {
19747 {
19750 }
19759 }
19761 /* Finish processing the declaration. But, skip member
19762 declarations. */
19764 {
19767 asm_specification,
19768 /* If the initializer is in parentheses, then this is
19769 a direct-initialization, which means that an
19770 `explicit' constructor is OK. Otherwise, an
19771 `explicit' constructor cannot be used. */
19774 }
19777 /* Core issue #226 (C++0x only): A default template-argument
19778 shall not be specified in a friend class template
19779 declaration. */
19788 {
19791 else
19793 }
19800 }
19802 /* Parse a declarator.
19804 declarator:
19805 direct-declarator
19806 ptr-operator declarator
19808 abstract-declarator:
19809 ptr-operator abstract-declarator [opt]
19810 direct-abstract-declarator
19812 GNU Extensions:
19814 declarator:
19815 attributes [opt] direct-declarator
19816 attributes [opt] ptr-operator declarator
19818 abstract-declarator:
19819 attributes [opt] ptr-operator abstract-declarator [opt]
19820 attributes [opt] direct-abstract-declarator
19822 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19823 detect constructors, destructors, deduction guides, or conversion operators.
19824 It is set to -1 if the declarator is a name, and +1 if it is a
19825 function. Otherwise it is set to zero. Usually you just want to
19826 test for >0, but internally the negative value is used.
19828 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19829 a decl-specifier-seq unless it declares a constructor, destructor,
19830 or conversion. It might seem that we could check this condition in
19831 semantic analysis, rather than parsing, but that makes it difficult
19832 to handle something like `f()'. We want to notice that there are
19833 no decl-specifiers, and therefore realize that this is an
19834 expression, not a declaration.)
19836 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19837 the declarator is a direct-declarator of the form "(...)".
19839 MEMBER_P is true iff this declarator is a member-declarator.
19841 FRIEND_P is true iff this declarator is a friend. */
19845 cp_parser_declarator_kind dcl_kind,
19849 {
19852 cp_cv_quals cv_quals;
19853 tree class_type;
19856 /* Assume this is not a constructor, destructor, or type-conversion
19857 operator. */
19864 /* Check for the ptr-operator production. */
19866 /* Parse the ptr-operator. */
19872 /* If that worked, then we have a ptr-operator. */
19874 {
19875 /* If a ptr-operator was found, then this declarator was not
19876 parenthesized. */
19879 /* The dependent declarator is optional if we are parsing an
19880 abstract-declarator. */
19884 /* Parse the dependent declarator. */
19889 friend_p);
19891 /* If we are parsing an abstract-declarator, we must handle the
19892 case where the dependent declarator is absent. */
19897 declarator = cp_parser_make_indirect_declarator
19899 }
19900 /* Everything else is a direct-declarator. */
19901 else
19902 {
19905 CPP_OPEN_PAREN);
19907 ctor_dtor_or_conv_p,
19909 }
19914 }
19916 /* Parse a direct-declarator or direct-abstract-declarator.
19918 direct-declarator:
19919 declarator-id
19920 direct-declarator ( parameter-declaration-clause )
19921 cv-qualifier-seq [opt]
19922 ref-qualifier [opt]
19923 exception-specification [opt]
19924 direct-declarator [ constant-expression [opt] ]
19925 ( declarator )
19927 direct-abstract-declarator:
19928 direct-abstract-declarator [opt]
19929 ( parameter-declaration-clause )
19930 cv-qualifier-seq [opt]
19931 ref-qualifier [opt]
19932 exception-specification [opt]
19933 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19934 ( abstract-declarator )
19936 Returns a representation of the declarator. DCL_KIND is
19937 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19938 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19939 we are parsing a direct-declarator. It is
19940 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19941 of ambiguity we prefer an abstract declarator, as per
19942 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19943 as for cp_parser_declarator. */
19947 cp_parser_declarator_kind dcl_kind,
19950 {
19961 {
19962 /* Peek at the next token. */
19965 {
19966 /* This is either a parameter-declaration-clause, or a
19967 parenthesized declarator. When we know we are parsing a
19968 named declarator, it must be a parenthesized declarator
19969 if FIRST is true. For instance, `(int)' is a
19970 parameter-declaration-clause, with an omitted
19971 direct-abstract-declarator. But `((*))', is a
19972 parenthesized abstract declarator. Finally, when T is a
19973 template parameter `(T)' is a
19974 parameter-declaration-clause, and not a parenthesized
19975 named declarator.
19977 We first try and parse a parameter-declaration-clause,
19978 and then try a nested declarator (if FIRST is true).
19980 It is not an error for it not to be a
19981 parameter-declaration-clause, even when FIRST is
19982 false. Consider,
19984 int i (int);
19985 int i (3);
19987 The first is the declaration of a function while the
19988 second is the definition of a variable, including its
19989 initializer.
19991 Having seen only the parenthesis, we cannot know which of
19992 these two alternatives should be selected. Even more
19993 complex are examples like:
19995 int i (int (a));
19996 int i (int (3));
19998 The former is a function-declaration; the latter is a
19999 variable initialization.
20001 Thus again, we try a parameter-declaration-clause, and if
20002 that fails, we back out and return. */
20005 {
20006 tree params;
20011 /* In a member-declarator, the only valid interpretation
20012 of a parenthesis is the start of a
20013 parameter-declaration-clause. (It is invalid to
20014 initialize a static data member with a parenthesized
20015 initializer; only the "=" form of initialization is
20016 permitted.) */
20020 /* Consume the `('. */
20021 matching_parens parens;
20024 {
20025 /* If this is going to be an abstract declarator, we're
20026 in a declarator and we can't have default args. */
20029 }
20033 /* Parse the parameter-declaration-clause. */
20036 /* Consume the `)'. */
20039 /* If all went well, parse the cv-qualifier-seq,
20040 ref-qualifier and the exception-specification. */
20042 {
20043 cp_cv_quals cv_quals;
20044 cp_virt_specifiers virt_specifiers;
20045 cp_ref_qualifier ref_qual;
20046 tree exception_specification;
20047 tree late_return;
20048 tree attrs;
20058 /* Parse the cv-qualifier-seq. */
20060 /* Parse the ref-qualifier. */
20062 /* Parse the tx-qualifier. */
20064 /* And the exception-specification. */
20065 exception_specification
20070 /* In here, we handle cases where attribute is used after
20071 the function declaration. For example:
20072 void func (int x) __attribute__((vector(..))); */
20076 {
20080 CPP_SEMICOLON)
20082 CPP_OPEN_BRACE))
20085 ;
20086 else
20088 }
20090 late_return = (cp_parser_late_return_type_opt
20094 /* Parse the virt-specifier-seq. */
20097 /* Create the function-declarator. */
20099 params,
20100 cv_quals,
20101 virt_specifiers,
20102 ref_qual,
20103 tx_qual,
20104 exception_specification,
20105 late_return,
20106 requires_clause);
20109 /* Any subsequent parameter lists are to do with
20110 return type, so are not those of the declared
20111 function. */
20113 }
20115 /* Remove the function parms from scope. */
20119 /* Repeat the main loop. */
20121 }
20123 /* If this is the first, we can try a parenthesized
20124 declarator. */
20126 {
20133 /* Consume the `('. */
20134 matching_parens parens;
20136 /* Parse the nested declarator. */
20139 declarator
20145 /* Expect a `)'. */
20153 }
20154 /* Otherwise, we must be done. */
20155 else
20157 }
20161 {
20162 /* Parse an array-declarator. */
20172 /* Consume the `['. */
20174 /* Peek at the next token. */
20176 /* If the next token is `]', then there is no
20177 constant-expression. */
20179 {
20181 bounds
20191 {
20192 /* Normally, the array bound must be an integral constant
20193 expression. However, as an extension, we allow VLAs
20194 in function scopes as long as they aren't part of a
20195 parameter declaration. */
20199 }
20202 {
20203 /* Remember this wasn't a constant-expression. */
20206 }
20207 }
20208 else
20210 /* Look for the closing `]'. */
20212 {
20215 }
20220 }
20222 {
20223 {
20224 tree qualifying_scope;
20225 tree unqualified_name;
20226 tree attrs;
20227 special_function_kind sfk;
20232 /* Parse a declarator-id */
20235 {
20238 /* If we see an ellipsis, we should be looking at a
20239 parameter pack. */
20241 {
20242 /* Consume the `...' */
20246 }
20247 }
20250 unqualified_name
20254 {
20258 {
20259 /* Check whether an error occurred. */
20262 /* We already consumed the ellipsis to mark a
20263 parameter pack, but we have no way to report it,
20264 so abort the tentative parse. We will be exiting
20265 immediately anyway. */
20267 }
20268 else
20274 && (qualifying_scope
20276 {
20279 }
20280 }
20285 {
20290 }
20296 {
20297 /* In the declaration of a member of a template class
20298 outside of the class itself, the SCOPE will sometimes
20299 be a TYPENAME_TYPE. For example, given:
20301 template <typename T>
20302 int S<T>::R::i = 3;
20304 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20305 this context, we must resolve S<T>::R to an ordinary
20306 type, rather than a typename type.
20308 The reason we normally avoid resolving TYPENAME_TYPEs
20309 is that a specialization of `S' might render
20310 `S<T>::R' not a type. However, if `S' is
20311 specialized, then this `i' will not be used, so there
20312 is no harm in resolving the types here. */
20313 tree type;
20315 /* Resolve the TYPENAME_TYPE. */
20318 /* If that failed, the declarator is invalid. */
20320 {
20323 "cannot define member of dependent typedef "
20325 else
20330 }
20332 }
20337 {
20338 tree class_type;
20343 else
20347 {
20351 {
20352 /* We do not attempt to print the declarator
20353 here because we do not have enough
20354 information about its original syntactic
20355 form. */
20359 }
20362 {
20366 "use %<%T::%D%> instead of %<%T::%D%> to "
20368 class_type,
20373 }
20375 }
20378 {
20385 for an unnamed type, even if the type
20386 got a name for linkage purposes. */
20388 /* Handle correctly (c++/19200):
20390 struct S {
20391 struct T{};
20392 friend void S(T);
20393 };
20395 and also:
20397 namespace N {
20398 void S();
20399 }
20401 struct S {
20402 friend void N::S();
20403 }; */
20406 class_type))
20415 }
20416 }
20418 unqualified_name,
20419 sfk);
20426 }
20428 handle_declarator:;
20431 {
20432 /* Any names that appear after the declarator-id for a
20433 member are looked up in the containing scope. */
20435 {
20436 /* But declarations with qualified-ids can't appear in a
20437 function. */
20441 }
20443 }
20447 /* Default args are only allowed on function
20448 declarations. */
20450 else
20454 }
20455 /* We're done. */
20456 else
20458 }
20460 /* For an abstract declarator, we might wind up with nothing at this
20461 point. That's an error; the declarator is not optional. */
20465 {
20466 /* Record overly parenthesized declarator so we can give a
20467 diagnostic about confusing decl/expr disambiguation. */
20469 {
20470 /* If the open and close parens are on different lines, this
20471 is probably a formatting thing, so ignore. */
20476 }
20479 }
20481 /* If we entered a scope, we must exit it now. */
20489 }
20491 /* Parse a ptr-operator.
20493 ptr-operator:
20494 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20495 * cv-qualifier-seq [opt]
20496 &
20497 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20498 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20500 GNU Extension:
20502 ptr-operator:
20503 & cv-qualifier-seq [opt]
20505 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20506 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20507 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20508 filled in with the TYPE containing the member. *CV_QUALS is
20509 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20510 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20511 Note that the tree codes returned by this function have nothing
20512 to do with the types of trees that will be eventually be created
20513 to represent the pointer or reference type being parsed. They are
20514 just constants with suggestive names. */
20515 static enum tree_code
20520 {
20525 /* Assume that it's not a pointer-to-member. */
20527 /* And that there are no cv-qualifiers. */
20530 /* Peek at the next token. */
20533 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20543 {
20544 /* Consume the `*', `&' or `&&'. */
20547 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20548 `&', if we are allowing GNU extensions. (The only qualifier
20549 that can legally appear after `&' is `restrict', but that is
20550 enforced during semantic analysis. */
20558 }
20559 else
20560 {
20561 /* Try the pointer-to-member case. */
20563 /* Look for the optional `::' operator. */
20566 /* Look for the nested-name specifier. */
20573 /* If we found it, and the next token is a `*', then we are
20574 indeed looking at a pointer-to-member operator. */
20577 {
20578 /* Indicate that the `*' operator was used. */
20586 else
20587 {
20588 /* The type of which the member is a member is given by the
20589 current SCOPE. */
20591 /* The next name will not be qualified. */
20595 /* Look for optional c++11 attributes. */
20599 /* Look for the optional cv-qualifier-seq. */
20601 }
20602 }
20603 /* If that didn't work we don't have a ptr-operator. */
20606 }
20609 }
20611 /* Parse an (optional) cv-qualifier-seq.
20613 cv-qualifier-seq:
20614 cv-qualifier cv-qualifier-seq [opt]
20616 cv-qualifier:
20617 const
20618 volatile
20620 GNU Extension:
20622 cv-qualifier:
20623 __restrict__
20625 Returns a bitmask representing the cv-qualifiers. */
20627 static cp_cv_quals
20629 {
20633 {
20635 cp_cv_quals cv_qualifier;
20637 /* Peek at the next token. */
20639 /* See if it's a cv-qualifier. */
20641 {
20657 }
20663 {
20668 }
20669 else
20670 {
20673 }
20674 }
20677 }
20679 /* Parse an (optional) ref-qualifier
20681 ref-qualifier:
20682 &
20683 &&
20685 Returns cp_ref_qualifier representing ref-qualifier. */
20687 static cp_ref_qualifier
20689 {
20692 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20697 {
20702 {
20714 }
20719 {
20722 }
20723 else
20724 {
20727 }
20728 }
20731 }
20733 /* Parse an optional tx-qualifier.
20735 tx-qualifier:
20736 transaction_safe
20737 transaction_safe_dynamic */
20739 static tree
20741 {
20744 {
20749 {
20753 {
20756 {
20759 }
20760 else
20762 }
20763 }
20764 }
20766 }
20768 /* Parse an (optional) virt-specifier-seq.
20770 virt-specifier-seq:
20771 virt-specifier virt-specifier-seq [opt]
20773 virt-specifier:
20774 override
20775 final
20777 Returns a bitmask representing the virt-specifiers. */
20779 static cp_virt_specifiers
20781 {
20785 {
20787 cp_virt_specifiers virt_specifier;
20789 /* Peek at the next token. */
20791 /* See if it's a virt-specifier-qualifier. */
20795 {
20798 }
20800 {
20803 }
20805 {
20807 }
20808 else
20812 {
20817 }
20818 else
20819 {
20822 }
20823 }
20825 }
20827 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20828 is in scope even though it isn't real. */
20830 void
20832 {
20833 tree this_parm;
20836 {
20837 /* We don't clear this between NSDMIs. Is it already what we want? */
20844 }
20847 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20849 current_class_ref
20852 }
20854 /* Return true iff our current scope is a non-static data member
20855 initializer. */
20857 bool
20859 {
20860 /* We recognize NSDMI context by the context-less 'this' pointer set up
20861 by the function above. */
20867 }
20869 /* Parse a late-specified return type, if any. This is not a separate
20870 non-terminal, but part of a function declarator, which looks like
20872 -> trailing-type-specifier-seq abstract-declarator(opt)
20874 Returns the type indicated by the type-id.
20876 In addition to this, parse any queued up #pragma omp declare simd
20877 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20878 #pragma acc routine clauses.
20880 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20881 function. */
20883 static tree
20886 {
20890 && declarator
20897 && declarator
20900 /* Peek at the next token. */
20902 /* A late-specified return type is indicated by an initial '->'. */
20913 {
20914 /* DR 1207: 'this' is in scope in the trailing return type. */
20916 }
20919 {
20920 /* Consume the ->. */
20924 }
20926 /* Function declarations may be followed by a trailing
20927 requires-clause. */
20931 declarator->attributes
20935 declarator->attributes
20939 declarator->attributes
20944 {
20947 }
20950 }
20952 /* Parse a declarator-id.
20954 declarator-id:
20955 id-expression
20956 :: [opt] nested-name-specifier [opt] type-name
20958 In the `id-expression' case, the value returned is as for
20959 cp_parser_id_expression if the id-expression was an unqualified-id.
20960 If the id-expression was a qualified-id, then a SCOPE_REF is
20961 returned. The first operand is the scope (either a NAMESPACE_DECL
20962 or TREE_TYPE), but the second is still just a representation of an
20963 unqualified-id. */
20965 static tree
20967 {
20968 tree id;
20969 /* The expression must be an id-expression. Assume that qualified
20970 names are the names of types so that:
20972 template <class T>
20973 int S<T>::R::i = 3;
20975 will work; we must treat `S<T>::R' as the name of a type.
20976 Similarly, assume that qualified names are templates, where
20977 required, so that:
20979 template <class T>
20980 int S<T>::R<T>::i = 3;
20982 will work, too. */
20988 optional_p);
20992 }
20994 /* Parse a type-id.
20996 type-id:
20997 type-specifier-seq abstract-declarator [opt]
20999 Returns the TYPE specified. */
21001 static tree
21004 {
21005 cp_decl_specifier_seq type_specifier_seq;
21008 /* Parse the type-specifier-seq. */
21010 is_trailing_return,
21015 /* A bare template name as a template argument is a template template
21016 argument, not a placeholder, so fail parsing it as a type argument. */
21017 {
21021 }
21025 /* There might or might not be an abstract declarator. */
21027 /* Look for the declarator. */
21028 abstract_declarator
21033 /* Check to see if there really was a declarator. */
21038 /* The concepts TS allows 'auto' as a type-id. */
21040 /* None of the valid uses of 'auto' in C++14 involve the type-id
21041 nonterminal, but it is valid in a trailing-return-type. */
21044 {
21045 /* A type-id with type 'auto' is only ok if the abstract declarator
21046 is a function declarator with a late-specified return type.
21048 A type-id with 'auto' is also valid in a trailing-return-type
21049 in a compound-requirement. */
21056 else
21057 {
21060 {
21062 auto_node);
21064 tmpl);
21065 }
21066 else
21069 }
21070 }
21073 is_template_arg);
21074 }
21076 static tree
21078 {
21080 }
21082 static tree
21084 {
21085 tree r;
21087 parser->type_definition_forbidden_message
21092 {
21095 }
21097 }
21099 static tree
21101 {
21103 }
21105 /* Parse a type-specifier-seq.
21107 type-specifier-seq:
21108 type-specifier type-specifier-seq [opt]
21110 GNU extension:
21112 type-specifier-seq:
21113 attributes type-specifier-seq [opt]
21115 If IS_DECLARATION is true, we are at the start of a "condition" or
21116 exception-declaration, so we might be followed by a declarator-id.
21118 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21119 i.e. we've just seen "->".
21121 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21123 static void
21128 {
21133 /* Clear the TYPE_SPECIFIER_SEQ. */
21136 /* In the context of a trailing return type, enum E { } is an
21137 elaborated-type-specifier followed by a function-body, not an
21138 enum-specifier. */
21142 /* Parse the type-specifiers and attributes. */
21144 {
21145 tree type_specifier;
21148 /* Check for attributes first. */
21150 {
21155 }
21157 /* record the token of the beginning of the type specifier seq,
21158 for error reporting purposes*/
21162 /* Look for the type-specifier. */
21164 flags,
21165 type_specifier_seq,
21167 NULL,
21170 {
21171 /* If the first type-specifier could not be found, this is not a
21172 type-specifier-seq at all. */
21174 {
21175 /* Set in_declarator_p to avoid skipping to the semicolon. */
21187 }
21188 /* If subsequent type-specifiers could not be found, the
21189 type-specifier-seq is complete. */
21191 }
21194 /* The standard says that a condition can be:
21196 type-specifier-seq declarator = assignment-expression
21198 However, given:
21200 struct S {};
21201 if (int S = ...)
21203 we should treat the "S" as a declarator, not as a
21204 type-specifier. The standard doesn't say that explicitly for
21205 type-specifier-seq, but it does say that for
21206 decl-specifier-seq in an ordinary declaration. Perhaps it
21207 would be clearer just to allow a decl-specifier-seq here, and
21208 then add a semantic restriction that if any decl-specifiers
21209 that are not type-specifiers appear, the program is invalid. */
21212 }
21213 }
21215 /* Return whether the function currently being declared has an associated
21216 template parameter list. */
21218 static bool
21220 {
21233 }
21235 /* Parse a parameter-declaration-clause.
21237 parameter-declaration-clause:
21238 parameter-declaration-list [opt] ... [opt]
21239 parameter-declaration-list , ...
21241 Returns a representation for the parameter declarations. A return
21242 value of NULL indicates a parameter-declaration-clause consisting
21243 only of an ellipsis. */
21245 static tree
21247 {
21248 tree parameters;
21257 parser->auto_is_implicit_function_template_parm_p
21259 }
21265 && !processing_template_parmlist
21271 /* Peek at the next token. */
21273 /* Check for trivial parameter-declaration-clauses. */
21275 {
21276 /* Consume the `...' token. */
21279 }
21281 /* There are no parameters. */
21282 {
21283 #ifndef NO_IMPLICIT_EXTERN_C
21288 else
21289 #endif
21291 }
21292 /* Check for `(void)', too, which is a special case. */
21296 {
21297 /* Consume the `void' token. */
21299 /* There are no parameters. */
21301 }
21303 /* Parse the parameter-declaration-list. */
21305 /* If a parse error occurred while parsing the
21306 parameter-declaration-list, then the entire
21307 parameter-declaration-clause is erroneous. */
21311 /* Peek at the next token. */
21313 /* If it's a `,', the clause should terminate with an ellipsis. */
21315 {
21316 /* Consume the `,'. */
21318 /* Expect an ellipsis. */
21319 ellipsis_p
21321 }
21322 /* It might also be `...' if the optional trailing `,' was
21323 omitted. */
21325 {
21326 /* Consume the `...' token. */
21328 /* And remember that we saw it. */
21330 }
21331 else
21334 /* Finish the parameter list. */
21339 }
21341 /* Parse a parameter-declaration-list.
21343 parameter-declaration-list:
21344 parameter-declaration
21345 parameter-declaration-list , parameter-declaration
21347 Returns a representation of the parameter-declaration-list, as for
21348 cp_parser_parameter_declaration_clause. However, the
21349 `void_list_node' is never appended to the list. Upon return,
21350 *IS_ERROR will be true iff an error occurred. */
21352 static tree
21354 {
21360 /* Assume all will go well. */
21362 /* The special considerations that apply to a function within an
21363 unbraced linkage specifications do not apply to the parameters
21364 to the function. */
21365 saved_in_unbraced_linkage_specification_p
21369 /* Look for more parameters. */
21371 {
21379 /* Parse the parameter. */
21380 parameter
21385 /* We don't know yet if the enclosing context is deprecated, so wait
21386 and warn in grokparms if appropriate. */
21390 {
21391 /* If a function parameter pack was specified and an implicit template
21392 parameter was introduced during cp_parser_parameter_declaration,
21393 change any implicit parameters introduced into packs. */
21397 {
21405 }
21409 PARM,
21414 }
21418 /* If a parse error occurred parsing the parameter declaration,
21419 then the entire parameter-declaration-list is erroneous. */
21421 {
21425 }
21435 {
21439 }
21441 /* Add the new parameter to the list. */
21445 /* Peek at the next token. */
21448 /* These are for Objective-C++ */
21451 /* The parameter-declaration-list is complete. */
21454 {
21457 /* Peek at the next token. */
21459 /* If it's an ellipsis, then the list is complete. */
21462 /* Otherwise, there must be more parameters. Consume the
21463 `,'. */
21465 /* When parsing something like:
21467 int i(float f, double d)
21469 we can tell after seeing the declaration for "f" that we
21470 are not looking at an initialization of a variable "i",
21471 but rather at the declaration of a function "i".
21473 Due to the fact that the parsing of template arguments
21474 (as specified to a template-id) requires backtracking we
21475 cannot use this technique when inside a template argument
21476 list. */
21480 /* However, a parameter-declaration of the form
21481 "float(f)" (which is a valid declaration of a
21482 parameter "f") can also be interpreted as an
21483 expression (the conversion of "f" to "float"). */
21486 }
21487 else
21488 {
21496 }
21497 }
21499 parser->in_unbraced_linkage_specification_p
21502 /* Reset implicit_template_scope if we are about to leave the function
21503 parameter list that introduced it. Note that for out-of-line member
21504 definitions, there will be one or more class scopes before we get to
21505 the template parameter scope. */
21509 {
21513 {
21516 }
21517 }
21520 }
21522 /* Parse a parameter declaration.
21524 parameter-declaration:
21525 decl-specifier-seq ... [opt] declarator
21526 decl-specifier-seq declarator = assignment-expression
21527 decl-specifier-seq ... [opt] abstract-declarator [opt]
21528 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21530 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21531 declares a template parameter. (In that case, a non-nested `>'
21532 token encountered during the parsing of the assignment-expression
21533 is not interpreted as a greater-than operator.)
21535 Returns a representation of the parameter, or NULL if an error
21536 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21537 true iff the declarator is of the form "(p)". */
21543 {
21545 cp_decl_specifier_seq decl_specifiers;
21547 tree default_argument;
21552 /* In a template parameter, `>' is not an operator.
21554 [temp.param]
21556 When parsing a default template-argument for a non-type
21557 template-parameter, the first non-nested `>' is taken as the end
21558 of the template parameter-list rather than a greater-than
21559 operator. */
21561 /* Type definitions may not appear in parameter types. */
21563 parser->type_definition_forbidden_message
21566 /* Parse the declaration-specifiers. */
21569 CP_PARSER_FLAGS_NONE,
21573 /* Complain about missing 'typename' or other invalid type names. */
21578 /* If an error occurred, there's no reason to attempt to parse the
21579 rest of the declaration. */
21581 {
21584 }
21586 /* Peek at the next token. */
21589 /* If the next token is a `)', `,', `=', `>', or `...', then there
21590 is no declarator. However, when variadic templates are enabled,
21591 there may be a declarator following `...'. */
21596 {
21600 }
21601 /* Otherwise, there should be a declarator. */
21602 else
21603 {
21607 /* After seeing a decl-specifier-seq, if the next token is not a
21608 "(", there is no possibility that the code is a valid
21609 expression. Therefore, if parsing tentatively, we commit at
21610 this point. */
21612 /* In an expression context, having seen:
21614 (int((char ...
21616 we cannot be sure whether we are looking at a
21617 function-type (taking a "char" as a parameter) or a cast
21618 of some object of type "char" to "int". */
21624 /* Parse the declarator. */
21627 CP_PARSER_DECLARATOR_EITHER,
21629 parenthesized_p,
21633 /* After the declarator, allow more attributes. */
21634 decl_specifiers.attributes
21638 /* If the declarator is a template parameter pack, remember that and
21639 clear the flag in the declarator itself so we don't get errors
21640 from grokdeclarator. */
21642 {
21645 }
21646 }
21648 /* If the next token is an ellipsis, and we have not seen a declarator
21649 name, and if either the type of the declarator contains parameter
21650 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21651 for, eg, abbreviated integral type names), then we actually have a
21652 parameter pack expansion expression. Otherwise, leave the ellipsis
21653 for a C-style variadic function. */
21656 {
21667 {
21668 /* Consume the `...'. */
21672 /* Build a pack expansion type */
21677 else
21679 }
21680 }
21682 /* The restriction on defining new types applies only to the type
21683 of the parameter, not to the default argument. */
21686 /* If the next token is `=', then process a default argument. */
21688 {
21691 /* If we are defining a class, then the tokens that make up the
21692 default argument must be saved and processed later. */
21698 // A constrained-type-specifier may declare a type template-parameter.
21700 default_argument
21703 // A constrained-type-specifier may declare a template-template-parameter.
21705 default_argument
21708 /* Outside of a class definition, we can just parse the
21709 assignment-expression. */
21710 else
21711 default_argument
21715 {
21717 "default arguments are only "
21719 }
21721 || template_parameter_pack_p
21724 {
21725 /* Find the name of the parameter pack. */
21732 template_parm_p
21738 else
21740 template_parm_p
21747 }
21748 }
21749 else
21752 /* Generate a location for the parameter, ranging from the start of the
21753 initial token to the end of the final token (using input_location for
21754 the latter, set up by cp_lexer_set_source_position_from_token when
21755 consuming tokens).
21757 If we have a identifier, then use it for the caret location, e.g.
21759 extern int callee (int one, int (*two)(int, int), float three);
21760 ~~~~~~^~~~~~~~~~~~~~
21762 otherwise, reuse the start location for the caret location e.g.:
21764 extern int callee (int one, int (*)(int, int), float three);
21765 ^~~~~~~~~~~~~~~~~
21767 */
21773 input_location);
21776 declarator,
21777 default_argument,
21778 param_loc,
21779 template_parameter_pack_p);
21780 }
21782 /* Parse a default argument and return it.
21784 TEMPLATE_PARM_P is true if this is a default argument for a
21785 non-type template parameter. */
21786 static tree
21788 {
21794 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21795 set correctly. */
21798 /* Local variable names (and the `this' keyword) may not
21799 appear in a default argument. */
21802 /* Parse the assignment-expression. */
21807 /* The "this" pointer is not valid in a default argument. */
21809 {
21814 }
21815 default_argument
21817 /* Restore the "this" pointer. */
21819 {
21822 }
21831 }
21833 /* Parse a function-body.
21835 function-body:
21836 compound_statement */
21838 static void
21840 {
21844 }
21846 /* Parse a ctor-initializer-opt followed by a function-body. Return
21847 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21848 is true we are parsing a function-try-block. */
21850 static void
21853 {
21860 /* Begin the function body. */
21862 /* Parse the optional ctor-initializer. */
21865 /* If we're parsing a constexpr constructor definition, we need
21866 to check that the constructor body is indeed empty. However,
21867 before we get to cp_parser_function_body lot of junk has been
21868 generated, so we can't just check that we have an empty block.
21869 Rather we take a snapshot of the outermost block, and check whether
21870 cp_parser_function_body changed its state. */
21872 {
21876 }
21877 /* Parse the function-body. */
21881 /* Finish the function body. */
21883 }
21885 /* Parse an initializer.
21887 initializer:
21888 = initializer-clause
21889 ( expression-list )
21891 Returns an expression representing the initializer. If no
21892 initializer is present, NULL_TREE is returned.
21894 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21895 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21896 set to TRUE if there is no initializer present. If there is an
21897 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21898 is set to true; otherwise it is set to false. */
21900 static tree
21903 {
21905 tree init;
21907 /* Peek at the next token. */
21910 /* Let our caller know whether or not this initializer was
21911 parenthesized. */
21913 /* Assume that the initializer is constant. */
21917 {
21918 /* Consume the `='. */
21920 /* Parse the initializer-clause. */
21922 }
21924 {
21929 non_constant_p);
21934 }
21936 {
21941 }
21942 else
21943 {
21944 /* Anything else is an error. */
21947 }
21953 }
21955 /* Parse an initializer-clause.
21957 initializer-clause:
21958 assignment-expression
21959 braced-init-list
21961 Returns an expression representing the initializer.
21963 If the `assignment-expression' production is used the value
21964 returned is simply a representation for the expression.
21966 Otherwise, calls cp_parser_braced_list. */
21968 static cp_expr
21970 {
21971 cp_expr initializer;
21973 /* Assume the expression is constant. */
21976 /* If it is not a `{', then we are looking at an
21977 assignment-expression. */
21979 {
21980 initializer
21983 non_constant_p);
21984 }
21985 else
21989 }
21991 /* Parse a brace-enclosed initializer list.
21993 braced-init-list:
21994 { initializer-list , [opt] }
21995 { designated-initializer-list , [opt] }
21996 { }
21998 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21999 the elements of the initializer-list (or NULL, if the last
22000 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22001 NULL_TREE. There is no way to detect whether or not the optional
22002 trailing `,' was provided. NON_CONSTANT_P is as for
22003 cp_parser_initializer. */
22005 static cp_expr
22007 {
22008 tree initializer;
22011 /* Consume the `{' token. */
22012 matching_braces braces;
22014 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22016 /* If it's not a `}', then there is a non-trivial initializer. */
22018 {
22019 /* Parse the initializer list. */
22022 /* A trailing `,' token is allowed. */
22025 }
22026 else
22028 /* Now, there should be a trailing `}'. */
22034 /* Build a location of the form:
22035 { ... }
22036 ^~~~~~~
22037 with caret==start at the open brace, finish at the close brace. */
22041 }
22043 /* Consume tokens up to, and including, the next non-nested closing `]'.
22044 Returns true iff we found a closing `]'. */
22046 static bool
22048 {
22052 {
22056 {
22059 /* If we've run out of tokens, then there is no closing `]'. */
22068 {
22071 }
22076 }
22078 /* Consume the token. */
22080 }
22081 }
22083 /* Return true if we are looking at an array-designator, false otherwise. */
22085 static bool
22087 {
22088 /* Consume the `['. */
22093 /* Skip tokens until the next token is a closing square bracket.
22094 If we find the closing `]', and the next token is a `=', then
22095 we are looking at an array designator. */
22096 bool array_designator_p
22100 /* Roll back the tokens we skipped. */
22104 }
22106 /* Parse an initializer-list.
22108 initializer-list:
22109 initializer-clause ... [opt]
22110 initializer-list , initializer-clause ... [opt]
22112 C++2A Extension:
22114 designated-initializer-list:
22115 designated-initializer-clause
22116 designated-initializer-list , designated-initializer-clause
22118 designated-initializer-clause:
22119 designator brace-or-equal-initializer
22121 designator:
22122 . identifier
22124 GNU Extension:
22126 initializer-list:
22127 designation initializer-clause ...[opt]
22128 initializer-list , designation initializer-clause ...[opt]
22130 designation:
22131 . identifier =
22132 identifier :
22133 [ constant-expression ] =
22135 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22136 for the initializer. If the INDEX of the elt is non-NULL, it is the
22137 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22138 as for cp_parser_initializer. */
22142 {
22147 /* Assume all of the expressions are constant. */
22150 /* Parse the rest of the list. */
22152 {
22154 tree designator;
22155 tree initializer;
22159 /* Handle the C++2A syntax, '. id ='. */
22167 {
22170 "C++ designated initializers only available with "
22172 /* Consume the `.'. */
22174 /* Consume the identifier. */
22177 /* Consume the `='. */
22179 }
22180 /* Also, if the next token is an identifier and the following one is a
22181 colon, we are looking at the GNU designated-initializer
22182 syntax. */
22187 {
22188 /* Warn the user that they are using an extension. */
22191 /* Consume the identifier. */
22193 /* Consume the `:'. */
22195 }
22196 /* Also handle C99 array designators, '[ const ] ='. */
22200 {
22201 /* In C++11, [ could start a lambda-introducer. */
22207 {
22210 }
22211 else
22212 {
22217 }
22224 /* Warn the user that they are using an extension. */
22227 }
22228 else
22232 {
22235 }
22239 {
22243 }
22247 /* Parse the initializer. */
22250 /* If any clause is non-constant, so is the entire initializer. */
22254 /* If we have an ellipsis, this is an initializer pack
22255 expansion. */
22257 {
22260 /* Consume the `...'. */
22267 /* Turn the initializer into an initializer expansion. */
22269 }
22271 /* Add it to the vector. */
22274 /* If the next token is not a comma, we have reached the end of
22275 the list. */
22279 /* Peek at the next token. */
22281 /* If the next token is a `}', then we're still done. An
22282 initializer-clause can have a trailing `,' after the
22283 initializer-list and before the closing `}'. */
22287 /* Consume the `,' token. */
22289 }
22291 /* The same identifier shall not appear in multiple designators
22292 of a designated-initializer-list. */
22294 {
22299 {
22301 {
22303 "%<.%s%> designator used multiple times in "
22307 }
22308 else
22310 }
22314 }
22317 }
22319 /* Classes [gram.class] */
22321 /* Parse a class-name.
22323 class-name:
22324 identifier
22325 template-id
22327 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22328 to indicate that names looked up in dependent types should be
22329 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22330 keyword has been used to indicate that the name that appears next
22331 is a template. TAG_TYPE indicates the explicit tag given before
22332 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22333 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22334 is the class being defined in a class-head. If ENUM_OK is TRUE,
22335 enum-names are also accepted.
22337 Returns the TYPE_DECL representing the class. */
22339 static tree
22348 {
22349 tree decl;
22350 tree scope;
22355 /* All class-names start with an identifier. */
22358 {
22361 }
22363 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22364 to a template-id, so we save it here. */
22369 /* Any name names a type if we're following the `typename' keyword
22370 in a qualified name where the enclosing scope is type-dependent. */
22373 /* Handle the common case (an identifier, but not a template-id)
22374 efficiently. */
22377 {
22381 /* Look for the identifier. */
22385 /* If the next token isn't an identifier, we are certainly not
22386 looking at a class-name. */
22389 /* If we know this is a type-name, there's no need to look it
22390 up. */
22393 else
22394 {
22395 tree ambiguous_decls;
22396 /* If we already know that this lookup is ambiguous, then
22397 we've already issued an error message; there's no reason
22398 to check again. */
22400 {
22403 }
22404 /* If the next token is a `::', then the name must be a type
22405 name.
22407 [basic.lookup.qual]
22409 During the lookup for a name preceding the :: scope
22410 resolution operator, object, function, and enumerator
22411 names are ignored. */
22414 /* Look up the name. */
22416 tag_type,
22419 check_dependency_p,
22423 {
22427 }
22428 }
22429 }
22430 else
22431 {
22432 /* Try a template-id. */
22434 check_dependency_p,
22435 tag_type,
22436 is_declaration);
22439 }
22443 /* If this is a typename, create a TYPENAME_TYPE. */
22445 {
22450 }
22454 /* Check to see that it is really the name of a class. */
22458 /* Situations like this:
22460 template <typename T> struct A {
22461 typename T::template X<int>::I i;
22462 };
22464 are problematic. Is `T::template X<int>' a class-name? The
22465 standard does not seem to be definitive, but there is no other
22466 valid interpretation of the following `::'. Therefore, those
22467 names are considered class-names. */
22468 {
22472 }
22477 /* In Objective-C 2.0, a classname followed by '.' starts a
22478 dot-syntax expression, and it's not a type-name. */
22490 }
22492 /* Parse a class-specifier.
22494 class-specifier:
22495 class-head { member-specification [opt] }
22497 Returns the TREE_TYPE representing the class. */
22499 static tree
22501 {
22502 tree type;
22516 /* Parse the class-head. */
22519 /* If the class-head was a semantic disaster, skip the entire body
22520 of the class. */
22522 {
22526 }
22528 /* Look for the `{'. */
22529 matching_braces braces;
22531 {
22534 }
22539 /* Issue an error message if type-definitions are forbidden here. */
22541 /* Remember that we are defining one more class. */
22543 /* Inside the class, surrounding template-parameter-lists do not
22544 apply. */
22545 saved_num_template_parameter_lists
22548 /* We are not in a function body. */
22551 /* Or in a loop. */
22554 /* Or in a switch. */
22557 /* We are not immediately inside an extern "lang" block. */
22558 saved_in_unbraced_linkage_specification_p
22562 // Associate constraints with the type.
22566 /* Start the class. */
22568 {
22571 }
22575 /* If the type is erroneous, skip the entire body of the class. */
22577 else
22578 /* Parse the member-specification. */
22581 /* Look for the trailing `}'. */
22583 /* Look for trailing attributes to apply to this class. */
22591 /* We've finished a type definition. Check for the common syntax
22592 error of forgetting a semicolon after the definition. We need to
22593 be careful, as we can't just check for not-a-semicolon and be done
22594 with it; the user might have typed:
22596 class X { } c = ...;
22597 class X { } *p = ...;
22599 and so forth. Instead, enumerate all the possible tokens that
22600 might follow this production; if we don't see one of them, then
22601 complain and silently insert the semicolon. */
22602 {
22607 /* Don't try to parse c++11 attributes here. As per the
22608 grammar, that should be a task for
22609 cp_parser_decl_specifier_seq. */
22613 {
22624 /* While it's legal for type qualifiers and storage class
22625 specifiers to follow type definitions in the grammar, only
22626 compiler testsuites contain code like that. Assume that if
22627 we see such code, then what we're really seeing is a case
22628 like:
22630 class X { }
22631 const <type> var = ...;
22633 or
22635 class Y { }
22636 static <type> func (...) ...
22638 i.e. the qualifier or specifier applies to the next
22639 declaration. To do so, however, we need to look ahead one
22640 more token to see if *that* token is a type specifier.
22642 This code could be improved to handle:
22644 class Z { }
22645 static const <type> var = ...; */
22648 {
22651 /* Handling user-defined types here would be nice, but very
22652 tricky. */
22653 want_semicolon
22656 }
22660 }
22662 /* If we don't have a type, then something is very wrong and we
22663 shouldn't try to do anything clever. Likewise for not seeing the
22664 closing brace. */
22666 {
22667 /* Locate the closing brace. */
22668 cp_token_position prev
22673 /* We want to suggest insertion of a ';' immediately *after* the
22674 closing brace, so, if we can, offset the location by 1 column. */
22681 /* If we successfully offset the location, suggest the fix-it. */
22694 else
22697 /* Unget one token and smash it to look as though we encountered
22698 a semicolon in the input stream. */
22703 }
22704 }
22706 /* If this class is not itself within the scope of another class,
22707 then we need to parse the bodies of all of the queued function
22708 definitions. Note that the queued functions defined in a class
22709 are not always processed immediately following the
22710 class-specifier for that class. Consider:
22712 struct A {
22713 struct B { void f() { sizeof (A); } };
22714 };
22716 If `f' were processed before the processing of `A' were
22717 completed, there would be no way to compute the size of `A'.
22718 Note that the nesting we are interested in here is lexical --
22719 not the semantic nesting given by TYPE_CONTEXT. In particular,
22720 for:
22722 struct A { struct B; };
22723 struct A::B { void f() { } };
22725 there is no need to delay the parsing of `A::B::f'. */
22727 {
22728 tree decl;
22735 /* In a first pass, parse default arguments to the functions.
22736 Then, in a second pass, parse the bodies of the functions.
22737 This two-phased approach handles cases like:
22739 struct S {
22740 void f() { g(); }
22741 void g(int i = 3);
22742 };
22744 */
22746 {
22748 /* If there are default arguments that have not yet been processed,
22749 take care of them now. */
22751 {
22756 }
22757 /* Make sure that any template parameters are in scope. */
22759 /* Parse the default argument expressions. */
22761 /* Remove any template parameters from the symbol table. */
22763 }
22765 /* Now parse any NSDMIs. */
22769 {
22771 {
22776 }
22779 }
22786 /* Now do some post-NSDMI bookkeeping. */
22792 /* Now parse the body of the functions. */
22794 {
22795 /* OpenMP UDRs need to be parsed before all other functions. */
22802 }
22803 else
22807 }
22808 else
22811 /* Put back any saved access checks. */
22814 /* Restore saved state. */
22818 parser->num_template_parameter_lists
22820 parser->in_unbraced_linkage_specification_p
22824 }
22826 static tree
22828 {
22829 tree ret;
22834 }
22836 /* Parse a class-head.
22838 class-head:
22839 class-key identifier [opt] base-clause [opt]
22840 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22841 class-key nested-name-specifier [opt] template-id
22842 base-clause [opt]
22844 class-virt-specifier:
22845 final
22847 GNU Extensions:
22848 class-key attributes identifier [opt] base-clause [opt]
22849 class-key attributes nested-name-specifier identifier base-clause [opt]
22850 class-key attributes nested-name-specifier [opt] template-id
22851 base-clause [opt]
22853 Upon return BASES is initialized to the list of base classes (or
22854 NULL, if there are none) in the same form returned by
22855 cp_parser_base_clause.
22857 Returns the TYPE of the indicated class. Sets
22858 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22859 involving a nested-name-specifier was used, and FALSE otherwise.
22861 Returns error_mark_node if this is not a class-head.
22863 Returns NULL_TREE if the class-head is syntactically valid, but
22864 semantically invalid in a way that means we should skip the entire
22865 body of the class. */
22867 static tree
22870 {
22871 tree nested_name_specifier;
22875 tree attributes;
22876 tree bases;
22886 /* Assume no nested-name-specifier will be present. */
22888 /* Assume no template parameter lists will be used in defining the
22889 type. */
22893 /* Look for the class-key. */
22900 /* Parse the attributes. */
22903 /* If the next token is `::', that is invalid -- but sometimes
22904 people do try to write:
22906 struct ::S {};
22908 Handle this gracefully by accepting the extra qualifier, and then
22909 issuing an error about it later if this really is a
22910 class-head. If it turns out just to be an elaborated type
22911 specifier, remain silent. */
22917 /* Determine the name of the class. Begin by looking for an
22918 optional nested-name-specifier. */
22920 nested_name_specifier
22926 /* If there was a nested-name-specifier, then there *must* be an
22927 identifier. */
22932 {
22934 /* Although the grammar says `identifier', it really means
22935 `class-name' or `template-name'. You are only allowed to
22936 define a class that has already been declared with this
22937 syntax.
22939 The proposed resolution for Core Issue 180 says that wherever
22940 you see `class T::X' you should treat `X' as a type-name.
22942 It is OK to define an inaccessible class; for example:
22944 class A { class B; };
22945 class A::B {};
22947 We do not know if we will see a class-name, or a
22948 template-name. We look for a class-name first, in case the
22949 class-name is a template-id; if we looked for the
22950 template-name first we would stop after the template-name. */
22957 class_type,
22961 /* If that didn't work, ignore the nested-name-specifier. */
22963 {
22969 }
22970 /* If we could not find a corresponding TYPE, treat this
22971 declaration like an unqualified declaration. */
22974 /* Otherwise, count the number of templates used in TYPE and its
22975 containing scopes. */
22976 else
22977 {
22978 tree scope;
22990 }
22991 }
22992 /* Otherwise, the identifier is optional. */
22993 else
22994 {
22995 /* We don't know whether what comes next is a template-id,
22996 an identifier, or nothing at all. */
22998 /* Check for a template-id. */
23003 class_key,
23005 /* If that didn't work, it could still be an identifier. */
23007 {
23009 {
23012 }
23013 else
23015 }
23016 else
23017 {
23020 }
23021 }
23026 {
23028 class_key,
23030 }
23033 /* If it's not a `:' or a `{' then we can't really be looking at a
23034 class-head, since a class-head only appears as part of a
23035 class-specifier. We have to detect this situation before calling
23036 xref_tag, since that has irreversible side-effects. */
23038 {
23042 }
23044 /* At this point, we're going ahead with the class-specifier, even
23045 if some other problem occurs. */
23048 {
23053 }
23054 /* Issue the error about the overly-qualified name now. */
23056 {
23061 }
23063 {
23068 }
23070 {
23071 tree scope;
23074 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23075 keyword template shall not appear at the top level. */
23079 /* Reject typedef-names in class heads. */
23081 {
23084 type);
23087 }
23089 /* Figure out in what scope the declaration is being placed. */
23091 /* If that scope does not contain the scope in which the
23092 class was originally declared, the program is invalid. */
23094 {
23097 "declaration of %qD in namespace %qD which does not "
23100 else
23106 }
23107 /* [dcl.meaning]
23109 A declarator-id shall not be qualified except for the
23110 definition of a ... nested class outside of its class
23111 ... [or] the definition or explicit instantiation of a
23112 class member of a namespace outside of its namespace. */
23114 {
23119 }
23120 }
23121 /* An explicit-specialization must be preceded by "template <>". If
23122 it is not, try to recover gracefully. */
23125 && !processing_template_parmlist
23127 {
23128 /* Build a location of this form:
23129 struct typename <ARGS>
23130 ^~~~~~~~~~~~~~~~~~~~~~
23131 with caret==start at the start token, and
23132 finishing at the end of the type. */
23133 location_t reported_loc
23135 class_head_start_location,
23141 "an explicit specialization must be preceded by"
23144 /* Take the same action that would have been taken by
23145 cp_parser_explicit_specialization. */
23148 }
23149 /* There must be no "return" statements between this point and the
23150 end of this function; set "type "to the correct return value and
23151 use "goto done;" to return. */
23152 /* Make sure that the right number of template parameters were
23153 present. */
23157 {
23158 /* If something went wrong, there is no point in even trying to
23159 process the class-definition. */
23162 }
23164 /* Look up the type. */
23166 {
23170 {
23174 }
23175 else
23176 {
23180 /* Check the scope while we still know whether or not we had a
23181 nested-name-specifier. */
23184 }
23187 }
23189 {
23190 tree class_type;
23192 /* Given:
23194 template <typename T> struct S { struct T };
23195 template <typename T> struct S<T>::T { };
23197 we will get a TYPENAME_TYPE when processing the definition of
23198 `S::T'. We need to resolve it to the actual type before we
23199 try to define it. */
23201 {
23206 else
23207 {
23210 }
23211 }
23215 {
23218 }
23221 /* Enter the scope indicated by the nested-name-specifier. */
23223 /* Get the canonical version of this type. */
23225 /* Call push_template_decl if it seems like we should be defining a
23226 template either from the template headers or the type we're
23227 defining, so that we diagnose both extra and missing headers. */
23231 {
23234 {
23237 }
23238 }
23242 }
23244 {
23245 /* If the class was unnamed, create a dummy name. */
23249 ? ts_within_enclosing_non_class
23253 }
23255 /* Indicate whether this class was declared as a `class' or as a
23256 `struct'. */
23261 /* If this type was already complete, and we see another definition,
23262 that's an error. */
23264 {
23266 type);
23268 type);
23271 }
23276 {
23277 /* Apply attributes now, before any use of the class as a template
23278 argument in its base list. */
23281 }
23283 /* We will have entered the scope containing the class; the names of
23284 base classes should be looked up in that context. For example:
23286 struct A { struct B {}; struct C; };
23287 struct A::C : B {};
23289 is valid. */
23291 /* Get the list of base-classes, if there is one. */
23293 {
23294 /* PR59482: enter the class scope so that base-specifiers are looked
23295 up correctly. */
23299 /* PR59482: get out of the previously pushed class scope so that the
23300 subsequent pops pop the right thing. */
23303 }
23304 else
23307 /* If we're really defining a class, process the base classes.
23308 If they're invalid, fail. */
23312 done:
23313 /* Leave the scope given by the nested-name-specifier. We will
23314 enter the class scope itself while processing the members. */
23319 {
23322 }
23328 out:
23331 }
23333 /* Parse a class-key.
23335 class-key:
23336 class
23337 struct
23338 union
23340 Returns the kind of class-key specified, or none_type to indicate
23341 error. */
23343 static enum tag_types
23345 {
23349 /* Look for the class-key. */
23354 /* Check to see if the TOKEN is a class-key. */
23359 }
23361 /* Parse a type-parameter-key.
23363 type-parameter-key:
23364 class
23365 typename
23366 */
23368 static void
23370 {
23371 /* Look for the type-parameter-key. */
23375 {
23378 /* typename is not allowed in a template template parameter
23379 by the standard until C++17. */
23381 "ISO C++ forbids typename key in template template parameter;"
23383 }
23384 else
23388 }
23390 /* Parse an (optional) member-specification.
23392 member-specification:
23393 member-declaration member-specification [opt]
23394 access-specifier : member-specification [opt] */
23396 static void
23398 {
23400 {
23404 /* Peek at the next token. */
23406 /* If it's a `}', or EOF then we've seen all the members. */
23412 /* See if this token is a keyword. */
23415 {
23419 /* Consume the access-specifier. */
23421 /* Remember which access-specifier is active. */
23423 /* Look for the `:'. */
23428 /* Accept #pragmas at class scope. */
23430 {
23433 }
23435 /* Otherwise, the next construction must be a
23436 member-declaration. */
23438 }
23439 }
23440 }
23442 /* Parse a member-declaration.
23444 member-declaration:
23445 decl-specifier-seq [opt] member-declarator-list [opt] ;
23446 function-definition ; [opt]
23447 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23448 using-declaration
23449 template-declaration
23450 alias-declaration
23452 member-declarator-list:
23453 member-declarator
23454 member-declarator-list , member-declarator
23456 member-declarator:
23457 declarator pure-specifier [opt]
23458 declarator constant-initializer [opt]
23459 identifier [opt] : constant-expression
23461 GNU Extensions:
23463 member-declaration:
23464 __extension__ member-declaration
23466 member-declarator:
23467 declarator attributes [opt] pure-specifier [opt]
23468 declarator attributes [opt] constant-initializer [opt]
23469 identifier [opt] attributes [opt] : constant-expression
23471 C++0x Extensions:
23473 member-declaration:
23474 static_assert-declaration */
23476 static void
23478 {
23479 cp_decl_specifier_seq decl_specifiers;
23480 tree prefix_attributes;
23481 tree decl;
23490 /* Check for the `__extension__' keyword. */
23492 {
23493 /* Recurse. */
23495 /* Restore the old value of the PEDANTIC flag. */
23499 }
23501 /* Check for a template-declaration. */
23503 {
23504 /* An explicit specialization here is an error condition, and we
23505 expect the specialization handler to detect and report this. */
23509 else
23513 }
23514 /* Check for a template introduction. */
23518 /* Check for a using-declaration. */
23520 {
23522 {
23523 /* Parse the using-declaration. */
23527 }
23528 else
23529 {
23530 tree decl;
23534 /* Note that if we actually see the '=' token after the
23535 identifier, cp_parser_alias_declaration commits the
23536 tentative parse. In that case, we really expect an
23537 alias-declaration. Otherwise, we expect a using
23538 declaration. */
23539 alias_decl_expected =
23545 else
23549 }
23550 }
23552 /* Check for @defs. */
23554 {
23559 {
23564 }
23566 }
23568 /* If the next token is `static_assert' we have a static assertion. */
23570 {
23573 }
23580 /* Parse the decl-specifier-seq. */
23583 CP_PARSER_FLAGS_OPTIONAL,
23586 /* Check for an invalid type-name. */
23590 /* If there is no declarator, then the decl-specifier-seq should
23591 specify a type. */
23593 {
23594 /* If there was no decl-specifier-seq, and the next token is a
23595 `;', then we have something like:
23597 struct S { ; };
23599 [class.mem]
23601 Each member-declaration shall declare at least one member
23602 name of the class. */
23604 {
23607 {
23611 }
23612 }
23613 else
23614 {
23615 tree type;
23617 /* See if this declaration is a friend. */
23619 /* If there were decl-specifiers, check to see if there was
23620 a class-declaration. */
23623 /* Nested classes have already been added to the class, but
23624 a `friend' needs to be explicitly registered. */
23626 {
23627 /* If the `friend' keyword was present, the friend must
23628 be introduced with a class-key. */
23631 "in C++03 a class-key must be used "
23633 /* In this case:
23635 template <typename T> struct A {
23636 friend struct A<T>::B;
23637 };
23639 A<T>::B will be represented by a TYPENAME_TYPE, and
23640 therefore not recognized by check_tag_decl. */
23642 {
23646 }
23649 "friend declaration does not name a class or "
23651 else
23654 }
23655 /* If there is no TYPE, an error message will already have
23656 been issued. */
23658 ;
23659 /* An anonymous aggregate has to be handled specially; such
23660 a declaration really declares a data member (with a
23661 particular type), as opposed to a nested class. */
23663 {
23664 /* C++11 9.5/6. */
23667 "a storage class on an anonymous aggregate "
23670 /* Remove constructors and such from TYPE, now that we
23671 know it is an anonymous aggregate. */
23673 /* And make the corresponding data member. */
23676 /* Add it to the class. */
23678 }
23679 else
23680 cp_parser_check_access_in_redeclaration
23683 }
23684 }
23685 else
23686 {
23689 /* Clear attributes from the decl_specifiers but keep them
23690 around as prefix attributes that apply them to the entity
23691 being declared. */
23695 /* See if these declarations will be friends. */
23698 /* Keep going until we hit the `;' at the end of the
23699 declaration. */
23701 {
23703 tree first_attribute;
23704 tree initializer;
23708 /* Peek at the next token. */
23711 /* The following code wants to know early if it is a bit-field
23712 or some other declaration. Attributes can appear before
23713 the `:' token, but are hopefully rare enough that the
23714 simplicity of the tentative lookup pays off. */
23719 {
23727 }
23729 /* Check for a bitfield declaration. */
23735 {
23736 tree identifier;
23737 tree width;
23742 else
23745 /* Look for attributes that apply to the bitfield. */
23748 /* Consume the `:' token. */
23751 /* Get the width of the bitfield. */
23755 /* In C++2A and as extension for C++11 and above we allow
23756 default member initializers for bit-fields. */
23761 CPP_OPEN_BRACE)))
23762 {
23763 location_t loc
23769 "default member initializers for bit-fields "
23770 "only available with -std=c++2a or "
23775 {
23779 }
23780 }
23781 else
23782 {
23783 /* Look for attributes that apply to the bitfield after
23784 the `:' token and width. This is where GCC used to
23785 parse attributes in the past, pedwarn if there is
23786 a std attribute. */
23789 "ISO C++ allows bit-field attributes only "
23793 }
23797 /* Remember which attributes are prefix attributes and
23798 which are not. */
23800 /* Combine the attributes. */
23803 /* Create the bitfield declaration. */
23806 identifier,
23807 sfk_none)
23811 attributes);
23812 }
23813 else
23814 {
23816 tree asm_specification;
23819 /* Parse the declarator. */
23820 declarator
23825 friend_p);
23827 /* If something went wrong parsing the declarator, make sure
23828 that we at least consume some tokens. */
23830 {
23831 /* Skip to the end of the statement. */
23833 /* If the next token is not a semicolon, that is
23834 probably because we just skipped over the body of
23835 a function. So, we consume a semicolon if
23836 present, but do not issue an error message if it
23837 is not present. */
23839 CPP_SEMICOLON))
23842 }
23845 cp_parser_check_for_definition_in_return_type
23849 /* Look for an asm-specification. */
23851 /* Look for attributes that apply to the declaration. */
23853 /* Remember which attributes are prefix attributes and
23854 which are not. */
23856 /* Combine the attributes. */
23859 /* If it's an `=', then we have a constant-initializer or a
23860 pure-specifier. It is not correct to parse the
23861 initializer before registering the member declaration
23862 since the member declaration should be in scope while
23863 its initializer is processed. However, the rest of the
23864 front end does not yet provide an interface that allows
23865 us to handle this correctly. */
23867 {
23868 /* In [class.mem]:
23870 A pure-specifier shall be used only in the declaration of
23871 a virtual function.
23873 A member-declarator can contain a constant-initializer
23874 only if it declares a static member of integral or
23875 enumeration type.
23877 Therefore, if the DECLARATOR is for a function, we look
23878 for a pure-specifier; otherwise, we look for a
23879 constant-initializer. When we call `grokfield', it will
23880 perform more stringent semantics checks. */
23892 {
23894 /* Don't require a constant rvalue in C++11, since we
23895 might want a reference constant. We'll enforce
23896 constancy later. */
23898 /* Parse the initializer. */
23901 }
23902 else
23903 /* Parse the initializer. */
23905 }
23908 {
23912 else
23914 }
23915 /* Otherwise, there is no initializer. */
23916 else
23919 /* See if we are probably looking at a function
23920 definition. We are certainly not looking at a
23921 member-declarator. Calling `grokfield' has
23922 side-effects, so we must not do it unless we are sure
23923 that we are looking at a member-declarator. */
23926 {
23927 /* The grammar does not allow a pure-specifier to be
23928 used when a member function is defined. (It is
23929 possible that this fact is an oversight in the
23930 standard, since a pure function may be defined
23931 outside of the class-specifier. */
23937 declarator,
23938 attributes);
23941 /* If the member was not a friend, declare it here. */
23944 /* Peek at the next token. */
23946 /* If the next token is a semicolon, consume it. */
23948 {
23949 location_t semicolon_loc
23954 "extra %<;%> after in-class "
23956 }
23958 }
23959 else
23962 /* Create the declaration. */
23967 {
23970 else
23972 }
23973 }
23978 /* Reset PREFIX_ATTRIBUTES. */
23984 /* If there is any qualification still in effect, clear it
23985 now; we will be starting fresh with the next declarator. */
23989 /* If it's a `,', then there are more declarators. */
23991 {
23994 {
24000 }
24001 }
24002 /* If the next token isn't a `;', then we have a parse error. */
24004 CPP_SEMICOLON))
24005 {
24006 /* The next token might be a ways away from where the
24007 actual semicolon is missing. Find the previous token
24008 and use that for our error position. */
24015 /* Assume that the user meant to provide a semicolon. If
24016 we were to cp_parser_skip_to_end_of_statement, we might
24017 skip to a semicolon inside a member function definition
24018 and issue nonsensical error messages. */
24020 }
24023 {
24024 /* Add DECL to the list of members. */
24026 /* Explicitly include, eg, NSDMIs, for better error
24027 recovery (c++/58650). */
24035 /* Add DECL to the queue of NSDMI to be parsed later. */
24037 }
24041 }
24042 }
24045 out:
24047 }
24049 /* Parse a pure-specifier.
24051 pure-specifier:
24052 = 0
24054 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24055 Otherwise, ERROR_MARK_NODE is returned. */
24057 static tree
24059 {
24062 /* Look for the `=' token. */
24065 /* Look for the `0' token. */
24074 /* Accept = default or = delete in c++0x mode. */
24077 {
24080 }
24082 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24084 {
24089 }
24091 {
24094 }
24097 }
24099 /* Parse a constant-initializer.
24101 constant-initializer:
24102 = constant-expression
24104 Returns a representation of the constant-expression. */
24106 static tree
24108 {
24109 /* Look for the `=' token. */
24113 /* It is invalid to write:
24115 struct S { static const int i = { 7 }; };
24117 */
24119 {
24122 /* Consume the opening brace. */
24123 matching_braces braces;
24125 /* Skip the initializer. */
24127 /* Look for the trailing `}'. */
24131 }
24134 }
24136 /* Derived classes [gram.class.derived] */
24138 /* Parse a base-clause.
24140 base-clause:
24141 : base-specifier-list
24143 base-specifier-list:
24144 base-specifier ... [opt]
24145 base-specifier-list , base-specifier ... [opt]
24147 Returns a TREE_LIST representing the base-classes, in the order in
24148 which they were declared. The representation of each node is as
24149 described by cp_parser_base_specifier.
24151 In the case that no bases are specified, this function will return
24152 NULL_TREE, not ERROR_MARK_NODE. */
24154 static tree
24156 {
24159 /* Look for the `:' that begins the list. */
24162 /* Scan the base-specifier-list. */
24164 {
24166 tree base;
24169 /* Look for the base-specifier. */
24171 /* Look for the (optional) ellipsis. */
24173 {
24174 /* Consume the `...'. */
24178 }
24180 /* Add BASE to the front of the list. */
24182 {
24184 /* Make this a pack expansion type. */
24188 {
24191 }
24192 }
24193 /* Peek at the next token. */
24195 /* If it's not a comma, then the list is complete. */
24198 /* Consume the `,'. */
24200 }
24202 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24203 base class had a qualified name. However, the next name that
24204 appears is certainly not qualified. */
24210 }
24212 /* Parse a base-specifier.
24214 base-specifier:
24215 :: [opt] nested-name-specifier [opt] class-name
24216 virtual access-specifier [opt] :: [opt] nested-name-specifier
24217 [opt] class-name
24218 access-specifier virtual [opt] :: [opt] nested-name-specifier
24219 [opt] class-name
24221 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24222 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24223 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24224 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24226 static tree
24228 {
24236 tree type;
24238 /* Process the optional `virtual' and `access-specifier'. */
24240 {
24241 /* Peek at the next token. */
24243 /* Process `virtual'. */
24245 {
24247 /* If `virtual' appears more than once, issue an error. */
24249 {
24253 }
24257 /* Consume the `virtual' token. */
24265 /* If more than one access specifier appears, issue an
24266 error. */
24269 {
24273 }
24277 /* Consume the access-specifier. */
24285 }
24286 }
24287 /* It is not uncommon to see programs mechanically, erroneously, use
24288 the 'typename' keyword to denote (dependent) qualified types
24289 as base classes. */
24291 {
24296 else
24298 "keyword %<typename%> not allowed in this context "
24301 }
24303 /* Look for the optional `::' operator. */
24305 /* Look for the nested-name-specifier. The simplest way to
24306 implement:
24308 [temp.res]
24310 The keyword `typename' is not permitted in a base-specifier or
24311 mem-initializer; in these contexts a qualified name that
24312 depends on a template-parameter is implicitly assumed to be a
24313 type name.
24315 is to pretend that we have seen the `typename' keyword at this
24316 point. */
24322 /* If the base class is given by a qualified name, assume that names
24323 we see are type names or templates, as appropriate. */
24329 /* DR 950 allows decltype as a base-specifier. */
24331 else
24332 {
24333 /* Otherwise, look for the class-name. */
24335 class_scope_p,
24336 template_p,
24337 typename_type,
24342 }
24348 }
24350 /* Exception handling [gram.exception] */
24352 /* Parse an (optional) noexcept-specification.
24354 noexcept-specification:
24355 noexcept ( constant-expression ) [opt]
24357 If no noexcept-specification is present, returns NULL_TREE.
24358 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24359 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24360 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24361 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24362 in which case a boolean condition is returned instead. */
24364 static tree
24369 {
24373 /* Peek at the next token. */
24376 /* Is it a noexcept-specification? */
24378 {
24379 tree expr;
24383 {
24384 matching_parens parens;
24388 {
24389 /* Types may not be defined in an exception-specification. */
24391 parser->type_definition_forbidden_message
24396 /* Restore the saved message. */
24398 }
24399 else
24400 {
24403 }
24406 }
24407 else
24408 {
24412 }
24414 /* We cannot build a noexcept-spec right away because this will check
24415 that expr is a constexpr. */
24418 else
24420 }
24421 else
24423 }
24425 /* Parse an (optional) exception-specification.
24427 exception-specification:
24428 throw ( type-id-list [opt] )
24430 Returns a TREE_LIST representing the exception-specification. The
24431 TREE_VALUE of each node is a type. */
24433 static tree
24435 {
24437 tree type_id_list;
24440 /* Peek at the next token. */
24443 /* Is it a noexcept-specification? */
24449 /* If it's not `throw', then there's no exception-specification. */
24455 /* Consume the `throw'. */
24458 /* Look for the `('. */
24459 matching_parens parens;
24462 /* Peek at the next token. */
24464 /* If it's not a `)', then there is a type-id-list. */
24466 {
24467 /* Types may not be defined in an exception-specification. */
24469 parser->type_definition_forbidden_message
24471 /* Parse the type-id-list. */
24473 /* Restore the saved message. */
24477 {
24481 }
24484 "dynamic exception specifications are deprecated in "
24486 }
24487 /* In C++17, throw() is equivalent to noexcept (true). throw()
24488 is deprecated in C++11 and above as well, but is still widely used,
24489 so don't warn about it yet. */
24492 else
24495 /* Look for the `)'. */
24499 }
24501 /* Parse an (optional) type-id-list.
24503 type-id-list:
24504 type-id ... [opt]
24505 type-id-list , type-id ... [opt]
24507 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24508 in the order that the types were presented. */
24510 static tree
24512 {
24516 {
24518 tree type;
24522 /* Get the next type-id. */
24524 /* Check for invalid 'auto'. */
24526 {
24530 }
24531 /* Parse the optional ellipsis. */
24533 {
24534 /* Consume the `...'. */
24537 /* Turn the type into a pack expansion expression. */
24539 }
24540 /* Add it to the list. */
24542 /* Peek at the next token. */
24544 /* If it is not a `,', we are done. */
24547 /* Consume the `,'. */
24549 }
24552 }
24554 /* Parse a try-block.
24556 try-block:
24557 try compound-statement handler-seq */
24559 static tree
24561 {
24562 tree try_block;
24576 }
24578 /* Parse a function-try-block.
24580 function-try-block:
24581 try ctor-initializer [opt] function-body handler-seq */
24583 static void
24585 {
24586 tree compound_stmt;
24587 tree try_block;
24589 /* Look for the `try' keyword. */
24592 /* Let the rest of the front end know where we are. */
24594 /* Parse the function-body. */
24595 cp_parser_ctor_initializer_opt_and_function_body
24597 /* We're done with the `try' part. */
24599 /* Parse the handlers. */
24601 /* We're done with the handlers. */
24603 }
24605 /* Parse a handler-seq.
24607 handler-seq:
24608 handler handler-seq [opt] */
24610 static void
24612 {
24614 {
24617 /* Parse the handler. */
24619 /* Peek at the next token. */
24621 /* If it's not `catch' then there are no more handlers. */
24624 }
24625 }
24627 /* Parse a handler.
24629 handler:
24630 catch ( exception-declaration ) compound-statement */
24632 static void
24634 {
24635 tree handler;
24636 tree declaration;
24640 matching_parens parens;
24647 }
24649 /* Parse an exception-declaration.
24651 exception-declaration:
24652 type-specifier-seq declarator
24653 type-specifier-seq abstract-declarator
24654 type-specifier-seq
24655 ...
24657 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24658 ellipsis variant is used. */
24660 static tree
24662 {
24663 cp_decl_specifier_seq type_specifiers;
24667 /* If it's an ellipsis, it's easy to handle. */
24669 {
24670 /* Consume the `...' token. */
24673 }
24675 /* Types may not be defined in exception-declarations. */
24677 parser->type_definition_forbidden_message
24680 /* Parse the type-specifier-seq. */
24684 /* If it's a `)', then there is no declarator. */
24687 else
24694 /* Restore the saved message. */
24701 }
24703 /* Parse a throw-expression.
24705 throw-expression:
24706 throw assignment-expression [opt]
24708 Returns a THROW_EXPR representing the throw-expression. */
24710 static tree
24712 {
24713 tree expression;
24718 /* Figure out whether or not there is an assignment-expression
24719 following the "throw" keyword. */
24727 else
24731 }
24733 /* GNU Extensions */
24735 /* Parse an (optional) asm-specification.
24737 asm-specification:
24738 asm ( string-literal )
24740 If the asm-specification is present, returns a STRING_CST
24741 corresponding to the string-literal. Otherwise, returns
24742 NULL_TREE. */
24744 static tree
24746 {
24748 tree asm_specification;
24750 /* Peek at the next token. */
24752 /* If the next token isn't the `asm' keyword, then there's no
24753 asm-specification. */
24757 /* Consume the `asm' token. */
24759 /* Look for the `('. */
24760 matching_parens parens;
24763 /* Look for the string-literal. */
24766 /* Look for the `)'. */
24770 }
24772 /* Parse an asm-operand-list.
24774 asm-operand-list:
24775 asm-operand
24776 asm-operand-list , asm-operand
24778 asm-operand:
24779 string-literal ( expression )
24780 [ string-literal ] string-literal ( expression )
24782 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24783 each node is the expression. The TREE_PURPOSE is itself a
24784 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24785 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24786 is a STRING_CST for the string literal before the parenthesis. Returns
24787 ERROR_MARK_NODE if any of the operands are invalid. */
24789 static tree
24791 {
24796 {
24797 tree string_literal;
24798 tree expression;
24799 tree name;
24802 {
24803 /* Consume the `[' token. */
24805 /* Read the operand name. */
24810 /* Look for the closing `]'. */
24812 }
24813 else
24815 /* Look for the string-literal. */
24818 /* Look for the `('. */
24819 matching_parens parens;
24821 /* Parse the expression. */
24823 /* Look for the `)'. */
24831 /* Add this operand to the list. */
24833 expression,
24834 asm_operands);
24835 /* If the next token is not a `,', there are no more
24836 operands. */
24839 /* Consume the `,'. */
24841 }
24844 }
24846 /* Parse an asm-clobber-list.
24848 asm-clobber-list:
24849 string-literal
24850 asm-clobber-list , string-literal
24852 Returns a TREE_LIST, indicating the clobbers in the order that they
24853 appeared. The TREE_VALUE of each node is a STRING_CST. */
24855 static tree
24857 {
24861 {
24862 tree string_literal;
24864 /* Look for the string literal. */
24866 /* Add it to the list. */
24868 /* If the next token is not a `,', then the list is
24869 complete. */
24872 /* Consume the `,' token. */
24874 }
24877 }
24879 /* Parse an asm-label-list.
24881 asm-label-list:
24882 identifier
24883 asm-label-list , identifier
24885 Returns a TREE_LIST, indicating the labels in the order that they
24886 appeared. The TREE_VALUE of each node is a label. */
24888 static tree
24890 {
24894 {
24897 /* Look for the identifier. */
24900 {
24903 {
24909 }
24910 }
24911 /* If the next token is not a `,', then the list is
24912 complete. */
24915 /* Consume the `,' token. */
24917 }
24920 }
24922 /* Return TRUE iff the next tokens in the stream are possibly the
24923 beginning of a GNU extension attribute. */
24925 static bool
24927 {
24929 }
24931 /* Return TRUE iff the next tokens in the stream are possibly the
24932 beginning of a standard C++-11 attribute specifier. */
24934 static bool
24936 {
24938 }
24940 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24941 beginning of a standard C++-11 attribute specifier. */
24943 static bool
24945 {
24953 }
24955 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24956 beginning of a GNU extension attribute. */
24958 static bool
24960 {
24964 }
24966 /* Return true iff the next tokens can be the beginning of either a
24967 GNU attribute list, or a standard C++11 attribute sequence. */
24969 static bool
24971 {
24974 }
24976 /* Return true iff the next Nth tokens can be the beginning of either
24977 a GNU attribute list, or a standard C++11 attribute sequence. */
24979 static bool
24981 {
24984 }
24986 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24987 of GNU attributes, or return NULL. */
24989 static tree
24991 {
24995 }
24997 #define CILK_SIMD_FN_CLAUSE_MASK \
24998 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24999 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
25000 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
25001 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
25002 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
25004 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
25005 vector [(<clauses>)] */
25007 static void
25009 {
25013 {
25019 }
25022 {
25025 paren_scope++;
25026 }
25028 {
25031 paren_scope++;
25033 paren_scope--;
25034 /* Do not push the last ')' */
25037 }
25046 }
25048 /* Parse an (optional) series of attributes.
25050 attributes:
25051 attributes attribute
25053 attribute:
25054 __attribute__ (( attribute-list [opt] ))
25056 The return value is as for cp_parser_gnu_attribute_list. */
25058 static tree
25060 {
25064 {
25066 tree attribute_list;
25069 /* Peek at the next token. */
25071 /* If it's not `__attribute__', then we're done. */
25075 /* Consume the `__attribute__' keyword. */
25077 /* Look for the two `(' tokens. */
25078 matching_parens outer_parens;
25080 matching_parens inner_parens;
25083 /* Peek at the next token. */
25086 /* Parse the attribute-list. */
25088 else
25089 /* If the next token is a `)', then there is no attribute
25090 list. */
25093 /* Look for the two `)' tokens. */
25101 /* Add these new attributes to the list. */
25103 }
25106 }
25108 /* Parse a GNU attribute-list.
25110 attribute-list:
25111 attribute
25112 attribute-list , attribute
25114 attribute:
25115 identifier
25116 identifier ( identifier )
25117 identifier ( identifier , expression-list )
25118 identifier ( expression-list )
25120 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25121 to an attribute. The TREE_PURPOSE of each node is the identifier
25122 indicating which attribute is in use. The TREE_VALUE represents
25123 the arguments, if any. */
25125 static tree
25127 {
25133 {
25135 tree identifier;
25136 tree attribute;
25138 /* Look for the identifier. We also allow keywords here; for
25139 example `__attribute__ ((const))' is legal. */
25143 {
25146 /* Consume the token, but save it since we need it for the
25147 SIMD enabled function parsing. */
25150 /* Save away the identifier that indicates which attribute
25151 this is. */
25153 /* For keywords, use the canonical spelling, not the
25154 parsed identifier. */
25161 /* Peek at the next token. */
25163 /* If it's an `(', then parse the attribute arguments. */
25165 {
25170 {
25173 }
25174 else
25175 vec = cp_parser_parenthesized_expression_list
25181 else
25182 {
25185 }
25186 /* Save the arguments away. */
25188 }
25190 {
25193 }
25196 {
25197 /* Add this attribute to the list. */
25200 }
25203 }
25204 /* Now, look for more attributes. If the next token isn't a
25205 `,', we're done. */
25209 /* Consume the comma and keep going. */
25211 }
25214 /* We built up the list in reverse order. */
25216 }
25218 /* Parse a standard C++11 attribute.
25220 The returned representation is a TREE_LIST which TREE_PURPOSE is
25221 the scoped name of the attribute, and the TREE_VALUE is its
25222 arguments list.
25224 Note that the scoped name of the attribute is itself a TREE_LIST
25225 which TREE_PURPOSE is the namespace of the attribute, and
25226 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25227 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25228 and which TREE_PURPOSE is directly the attribute name.
25230 Clients of the attribute code should use get_attribute_namespace
25231 and get_attribute_name to get the actual namespace and name of
25232 attributes, regardless of their being GNU or C++11 attributes.
25234 attribute:
25235 attribute-token attribute-argument-clause [opt]
25237 attribute-token:
25238 identifier
25239 attribute-scoped-token
25241 attribute-scoped-token:
25242 attribute-namespace :: identifier
25244 attribute-namespace:
25245 identifier
25247 attribute-argument-clause:
25248 ( balanced-token-seq )
25250 balanced-token-seq:
25251 balanced-token [opt]
25252 balanced-token-seq balanced-token
25254 balanced-token:
25255 ( balanced-token-seq )
25256 [ balanced-token-seq ]
25257 { balanced-token-seq }. */
25259 static tree
25261 {
25265 /* First, parse name of the attribute, a.k.a attribute-token. */
25282 {
25283 /* We are seeing a scoped attribute token. */
25298 else
25299 {
25303 }
25307 NULL_TREE);
25309 }
25312 NULL_TREE);
25313 else
25314 {
25317 NULL_TREE);
25318 /* C++11 noreturn attribute is equivalent to GNU's. */
25321 /* C++14 deprecated attribute is equivalent to GNU's. */
25324 /* C++17 fallthrough attribute is equivalent to GNU's. */
25327 /* Transactional Memory TS optimize_for_synchronized attribute is
25328 equivalent to GNU transaction_callable. */
25332 /* Transactional Memory attributes are GNU attributes. */
25335 }
25337 /* Now parse the optional argument clause of the attribute. */
25342 {
25348 /* A GNU attribute that takes an identifier in parameter. */
25351 vec = cp_parser_parenthesized_expression_list
25357 else
25358 {
25361 }
25365 else
25367 }
25370 }
25372 /* Check that the attribute ATTRIBUTE appears at most once in the
25373 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25374 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25375 isn't implemented yet in GCC. */
25377 static void
25379 {
25381 {
25391 }
25392 }
25394 /* Parse a list of standard C++-11 attributes.
25396 attribute-list:
25397 attribute [opt]
25398 attribute-list , attribute[opt]
25399 attribute ...
25400 attribute-list , attribute ...
25401 */
25403 static tree
25405 {
25410 {
25415 {
25419 }
25422 {
25427 else
25428 {
25433 }
25435 }
25439 }
25442 }
25444 /* Parse a standard C++-11 attribute specifier.
25446 attribute-specifier:
25447 [ [ attribute-using-prefix [opt] attribute-list ] ]
25448 alignment-specifier
25450 attribute-using-prefix:
25451 using attribute-namespace :
25453 alignment-specifier:
25454 alignas ( type-id ... [opt] )
25455 alignas ( alignment-expression ... [opt] ). */
25457 static tree
25459 {
25465 {
25472 {
25483 {
25487 "attribute using prefix only available "
25493 }
25494 else
25496 }
25503 else
25504 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25505 when we are sure that we have actually parsed them. */
25507 }
25508 else
25509 {
25510 tree alignas_expr;
25512 /* Look for an alignment-specifier. */
25523 matching_parens parens;
25525 {
25528 }
25534 {
25541 }
25546 /* Handle alignas (pack...). */
25548 {
25551 }
25553 /* Something went wrong, so don't build the attribute. */
25558 {
25561 }
25563 /* Build the C++-11 representation of an 'aligned'
25564 attribute. */
25565 attributes =
25568 alignas_expr);
25569 }
25572 }
25574 /* Parse a standard C++-11 attribute-specifier-seq.
25576 attribute-specifier-seq:
25577 attribute-specifier-seq [opt] attribute-specifier
25578 */
25580 static tree
25582 {
25587 {
25596 else
25599 }
25602 }
25604 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25605 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25606 current value of the PEDANTIC flag, regardless of whether or not
25607 the `__extension__' keyword is present. The caller is responsible
25608 for restoring the value of the PEDANTIC flag. */
25610 static bool
25612 {
25613 /* Save the old value of the PEDANTIC flag. */
25617 {
25618 /* Consume the `__extension__' token. */
25620 /* We're not being pedantic while the `__extension__' keyword is
25621 in effect. */
25625 }
25628 }
25630 /* Parse a label declaration.
25632 label-declaration:
25633 __label__ label-declarator-seq ;
25635 label-declarator-seq:
25636 identifier , label-declarator-seq
25637 identifier */
25639 static void
25641 {
25642 /* Look for the `__label__' keyword. */
25646 {
25647 tree identifier;
25649 /* Look for an identifier. */
25651 /* If we failed, stop. */
25654 /* Declare it as a label. */
25656 /* If the next token is a `;', stop. */
25659 /* Look for the `,' separating the label declarations. */
25661 }
25663 /* Look for the final `;'. */
25665 }
25667 // -------------------------------------------------------------------------- //
25668 // Requires Clause
25670 // Parse a requires clause.
25671 //
25672 // requires-clause:
25673 // 'requires' logical-or-expression
25674 //
25675 // The required logical-or-expression must be a constant expression. Note
25676 // that we don't check that the expression is constepxr here. We defer until
25677 // we analyze constraints and then, we only check atomic constraints.
25678 static tree
25680 {
25681 // Parse the requires clause so that it is not automatically folded.
25689 }
25691 // Optionally parse a requires clause:
25692 static tree
25694 {
25697 {
25700 {
25703 /* Parse and discard the requires-clause. */
25706 }
25708 }
25711 }
25714 /*---------------------------------------------------------------------------
25715 Requires expressions
25716 ---------------------------------------------------------------------------*/
25718 /* Parse a requires expression
25720 requirement-expression:
25721 'requires' requirement-parameter-list [opt] requirement-body */
25722 static tree
25724 {
25728 /* A requires-expression shall appear only within a concept
25729 definition or a requires-clause.
25731 TODO: Implement this diagnostic correctly. */
25733 {
25737 }
25740 {
25741 /* Local parameters are delared as variables within the scope
25742 of the expression. They are not visible past the end of
25743 the expression. Expressions within the requires-expression
25744 are unevaluated. */
25745 struct scope_sentinel
25746 {
25748 {
25751 }
25754 {
25757 }
25760 /* Parse the optional parameter list. */
25762 {
25766 }
25767 else
25770 /* Parse the requirement body. */
25774 }
25776 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25777 the parm chain. */
25780 }
25782 /* Parse a parameterized requirement.
25784 requirement-parameter-list:
25785 '(' parameter-declaration-clause ')' */
25786 static tree
25788 {
25789 matching_parens parens;
25799 }
25801 /* Parse the body of a requirement.
25803 requirement-body:
25804 '{' requirement-list '}' */
25805 static tree
25807 {
25808 matching_braces braces;
25818 }
25820 /* Parse a list of requirements.
25822 requirement-list:
25823 requirement
25824 requirement-list ';' requirement[opt] */
25825 static tree
25827 {
25830 {
25837 /* If we see a semi-colon, consume it. */
25841 /* Stop processing at the end of the list. */
25844 }
25846 /* Reverse the order of requirements so they are analyzed in
25847 declaration order. */
25849 }
25851 /* Parse a syntactic requirement or type requirement.
25853 requirement:
25854 simple-requirement
25855 compound-requirement
25856 type-requirement
25857 nested-requirement */
25858 static tree
25860 {
25867 else
25869 }
25871 /* Parse a simple requirement.
25873 simple-requirement:
25874 expression ';' */
25875 static tree
25877 {
25886 }
25888 /* Parse a type requirement
25890 type-requirement
25891 nested-name-specifier [opt] required-type-name ';'
25893 required-type-name:
25894 type-name
25895 'template' [opt] simple-template-id */
25896 static tree
25898 {
25901 // Save the scope before parsing name specifiers.
25912 tree type;
25914 {
25923 }
25924 else
25943 }
25945 /* Parse a compound requirement
25947 compound-requirement:
25948 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25949 static tree
25951 {
25952 /* Parse an expression enclosed in '{ }'s. */
25953 matching_braces braces;
25964 /* Parse the optional noexcept. */
25967 {
25970 }
25972 /* Parse the optional trailing return type. */
25975 {
25983 }
25986 }
25988 /* Parse a nested requirement. This is the same as a requires clause.
25990 nested-requirement:
25991 requires-clause */
25992 static tree
25994 {
26000 }
26002 /* Support Functions */
26004 /* Return the appropriate prefer_type argument for lookup_name_real based on
26005 tag_type and template_mem_access. */
26009 {
26010 /* DR 141: When looking in the current enclosing context for a template-name
26011 after -> or ., only consider class templates. */
26015 {
26019 }
26020 }
26022 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26023 NAME should have one of the representations used for an
26024 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26025 is returned. If PARSER->SCOPE is a dependent type, then a
26026 SCOPE_REF is returned.
26028 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26029 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26030 was formed. Abstractly, such entities should not be passed to this
26031 function, because they do not need to be looked up, but it is
26032 simpler to check for this special case here, rather than at the
26033 call-sites.
26035 In cases not explicitly covered above, this function returns a
26036 DECL, OVERLOAD, or baselink representing the result of the lookup.
26037 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26038 is returned.
26040 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26041 (e.g., "struct") that was used. In that case bindings that do not
26042 refer to types are ignored.
26044 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26045 ignored.
26047 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26048 are ignored.
26050 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26051 types.
26053 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26054 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26055 NULL_TREE otherwise. */
26057 static cp_expr
26064 location_t name_location)
26065 {
26066 tree decl;
26069 /* Assume that the lookup will be unambiguous. */
26073 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26074 no longer valid. Note that if we are parsing tentatively, and
26075 the parse fails, OBJECT_TYPE will be automatically restored. */
26081 /* A template-id has already been resolved; there is no lookup to
26082 do. */
26086 {
26090 }
26092 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26093 it should already have been checked to make sure that the name
26094 used matches the type being destroyed. */
26096 {
26097 tree type;
26099 /* Figure out to which type this destructor applies. */
26104 else
26106 /* If that's not a class type, there is no destructor. */
26117 }
26119 /* By this point, the NAME should be an ordinary identifier. If
26120 the id-expression was a qualified name, the qualifying scope is
26121 stored in PARSER->SCOPE at this point. */
26124 /* Perform the lookup. */
26126 {
26132 /* If the SCOPE is dependent, the lookup must be deferred until
26133 the template is instantiated -- unless we are explicitly
26134 looking up names in uninstantiated templates. Even then, we
26135 cannot look up the name if the scope is not a class type; it
26136 might, for example, be a template type parameter. */
26141 /* Defer lookup. */
26143 else
26144 {
26147 /* If PARSER->SCOPE is a dependent type, then it must be a
26148 class type, and we must not be checking dependencies;
26149 otherwise, we would have processed this lookup above. So
26150 that PARSER->SCOPE is not considered a dependent base by
26151 lookup_member, we must enter the scope here. */
26155 /* If the PARSER->SCOPE is a template specialization, it
26156 may be instantiated during name lookup. In that case,
26157 errors may be issued. Even if we rollback the current
26158 tentative parse, those errors are valid. */
26163 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26164 lookup result and the nested-name-specifier nominates a class C:
26165 * if the name specified after the nested-name-specifier, when
26166 looked up in C, is the injected-class-name of C (Clause 9), or
26167 * if the name specified after the nested-name-specifier is the
26168 same as the identifier or the simple-template-id's template-
26169 name in the last component of the nested-name-specifier,
26170 the name is instead considered to name the constructor of
26171 class C. [ Note: for example, the constructor is not an
26172 acceptable lookup result in an elaborated-type-specifier so
26173 the constructor would not be used in place of the
26174 injected-class-name. --end note ] Such a constructor name
26175 shall be used only in the declarator-id of a declaration that
26176 names a constructor or in a using-declaration. */
26184 /* If we have a single function from a using decl, pull it out. */
26191 }
26193 /* If the scope is a dependent type and either we deferred lookup or
26194 we did lookup but didn't find the name, rememeber the name. */
26197 {
26199 {
26200 tree type;
26202 /* The resolution to Core Issue 180 says that `struct
26203 A::B' should be considered a type-name, even if `A'
26204 is dependent. */
26209 }
26213 CPP_CLOSE_PAREN)))
26217 else
26220 is_template);
26221 }
26224 }
26226 {
26227 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26228 OBJECT_TYPE is not a class. */
26230 /* If the OBJECT_TYPE is a template specialization, it may
26231 be instantiated during name lookup. In that case, errors
26232 may be issued. Even if we rollback the current tentative
26233 parse, those errors are valid. */
26235 name,
26238 tf_warning_or_error);
26239 else
26243 /* Look it up in the enclosing context. DR 141: When looking for a
26244 template-name after -> or ., only consider class templates. */
26249 /* The object is type-dependent, so we can't look anything up; we used
26250 this to get the DR 141 behavior. */
26254 }
26255 else
26256 {
26262 }
26264 /* If the lookup failed, let our caller know. */
26268 /* Pull out the template from an injected-class-name (or multiple). */
26272 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26274 {
26277 /* The error message we have to print is too complicated for
26278 cp_parser_error, so we incorporate its actions directly. */
26280 {
26282 name);
26284 }
26286 }
26294 /* If we have resolved the name of a member declaration, check to
26295 see if the declaration is accessible. When the name resolves to
26296 set of overloaded functions, accessibility is checked when
26297 overload resolution is done.
26299 During an explicit instantiation, access is not checked at all,
26300 as per [temp.explicit]. */
26307 }
26309 /* Like cp_parser_lookup_name, but for use in the typical case where
26310 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26311 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26313 static tree
26315 {
26317 none_type,
26322 location);
26323 }
26325 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26326 the current context, return the TYPE_DECL. If TAG_NAME_P is
26327 true, the DECL indicates the class being defined in a class-head,
26328 or declared in an elaborated-type-specifier.
26330 Otherwise, return DECL. */
26332 static tree
26334 {
26335 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26336 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26338 struct A {
26339 template <typename T> struct B;
26340 };
26342 template <typename T> struct A::B {};
26344 Similarly, in an elaborated-type-specifier:
26346 namespace N { struct X{}; }
26348 struct A {
26349 template <typename T> friend struct N::X;
26350 };
26352 However, if the DECL refers to a class type, and we are in
26353 the scope of the class, then the name lookup automatically
26354 finds the TYPE_DECL created by build_self_reference rather
26355 than a TEMPLATE_DECL. For example, in:
26357 template <class T> struct S {
26358 S s;
26359 };
26361 there is no need to handle such case. */
26367 }
26369 /* If too many, or too few, template-parameter lists apply to the
26370 declarator, issue an error message. Returns TRUE if all went well,
26371 and FALSE otherwise. */
26373 static bool
26376 location_t declarator_location)
26377 {
26379 {
26381 {
26389 /* If the DECLARATOR has the form `X<y>' then it uses one
26390 additional level of template parameters. */
26393 return cp_parser_check_template_parameters
26395 }
26411 }
26413 }
26415 /* NUM_TEMPLATES were used in the current declaration. If that is
26416 invalid, return FALSE and issue an error messages. Otherwise,
26417 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26418 declarator and we can print more accurate diagnostics. */
26420 static bool
26423 location_t location,
26425 {
26426 /* If there are the same number of template classes and parameter
26427 lists, that's OK. */
26430 /* If there are more, but only one more, then we are referring to a
26431 member template. That's OK too. */
26434 /* If there are more template classes than parameter lists, we have
26435 something like:
26437 template <class T> void S<T>::R<T>::f (); */
26439 {
26449 else
26452 }
26453 /* Otherwise, there are too many template parameter lists. We have
26454 something like:
26456 template <class T> template <class U> void S::f(); */
26459 }
26461 /* Parse an optional `::' token indicating that the following name is
26462 from the global namespace. If so, PARSER->SCOPE is set to the
26463 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26464 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26465 Returns the new value of PARSER->SCOPE, if the `::' token is
26466 present, and NULL_TREE otherwise. */
26468 static tree
26470 {
26473 /* Peek at the next token. */
26475 /* If we're looking at a `::' token then we're starting from the
26476 global namespace, not our current location. */
26478 {
26479 /* Consume the `::' token. */
26481 /* Set the SCOPE so that we know where to start the lookup. */
26487 }
26489 {
26493 }
26496 }
26498 /* Returns TRUE if the upcoming token sequence is the start of a
26499 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26500 declarator is preceded by the `friend' specifier. */
26502 static bool
26504 {
26507 tree nested_name_specifier;
26510 /* The common case is that this is not a constructor declarator, so
26511 try to avoid doing lots of work if at all possible. It's not
26512 valid declare a constructor at function scope. */
26515 /* And only certain tokens can begin a constructor declarator. */
26523 /* Parse tentatively; we are going to roll back all of the tokens
26524 consumed here. */
26526 /* Assume that we are looking at a constructor declarator. */
26529 /* Look for the optional `::' operator. */
26532 /* Look for the nested-name-specifier. */
26533 nested_name_specifier
26544 /* Outside of a class-specifier, there must be a
26545 nested-name-specifier. Except in C++17 mode, where we
26546 might be declaring a guiding declaration. */
26553 /* If we have a class scope, this is easy; DR 147 says that S::S always
26554 names the constructor, and no other qualified name could. */
26557 {
26567 }
26568 /* If we still think that this might be a constructor-declarator,
26569 look for a class-name. */
26571 {
26572 /* If we have:
26574 template <typename T> struct S {
26575 S();
26576 };
26578 we must recognize that the nested `S' names a class. */
26582 tree type_decl;
26586 none_type,
26593 {
26599 none_type,
26604 else
26606 }
26608 /* If there was no class-name, then this is not a constructor.
26609 Otherwise, if we are in a class-specifier and we aren't
26610 handling a friend declaration, check that its type matches
26611 current_class_type (c++/38313). Note: error_mark_node
26612 is left alone for error recovery purposes. */
26614 && (outside_class_specifier_p
26620 /* If we're still considering a constructor, we have to see a `(',
26621 to begin the parameter-declaration-clause, followed by either a
26622 `)', an `...', or a decl-specifier. We need to check for a
26623 type-specifier to avoid being fooled into thinking that:
26625 S (f) (int);
26627 is a constructor. (It is actually a function named `f' that
26628 takes one parameter (of type `int') and returns a value of type
26629 `S'. */
26637 /* A parameter declaration begins with a decl-specifier,
26638 which is either the "attribute" keyword, a storage class
26639 specifier, or (usually) a type-specifier. */
26641 {
26642 tree type;
26646 /* Names appearing in the type-specifier should be looked up
26647 in the scope of the class. */
26651 {
26654 {
26658 {
26661 }
26662 }
26664 }
26666 /* Inside the constructor parameter list, surrounding
26667 template-parameter-lists do not apply. */
26668 saved_num_template_parameter_lists
26672 /* Look for the type-specifier. */
26674 CP_PARSER_FLAGS_NONE,
26680 parser->num_template_parameter_lists
26683 /* Leave the scope of the class. */
26688 }
26689 }
26691 /* We did not really want to consume any tokens. */
26695 }
26697 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26698 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26699 they must be performed once we are in the scope of the function.
26701 Returns the function defined. */
26703 static tree
26704 cp_parser_function_definition_from_specifiers_and_declarator
26707 tree attributes,
26709 {
26710 tree fn;
26713 /* Begin the function-definition. */
26716 /* The things we're about to see are not directly qualified by any
26717 template headers we've seen thus far. */
26720 /* If there were names looked up in the decl-specifier-seq that we
26721 did not check, check them now. We must wait until we are in the
26722 scope of the function to perform the checks, since the function
26723 might be a friend. */
26727 {
26732 }
26735 {
26736 /* Skip the entire function. */
26739 }
26741 {
26742 /* Seen already, skip it. An error message has already been output. */
26746 /* If this is a function from a class, pop the nested class. */
26749 }
26750 else
26751 {
26752 timevar_id_t tv;
26755 else
26761 }
26764 }
26766 /* Parse the part of a function-definition that follows the
26767 declarator. INLINE_P is TRUE iff this function is an inline
26768 function defined within a class-specifier.
26770 Returns the function defined. */
26772 static tree
26775 {
26776 tree fn;
26781 bool fully_implicit_function_template_p
26784 tree implicit_template_parms
26787 cp_binding_level* implicit_template_scope
26793 /* If the next token is `return', then the code may be trying to
26794 make use of the "named return value" extension that G++ used to
26795 support. */
26798 {
26799 /* Consume the `return' keyword. */
26801 /* Look for the identifier that indicates what value is to be
26802 returned. */
26804 /* Issue an error message. */
26807 /* Skip tokens until we reach the start of the function body. */
26809 {
26816 }
26817 }
26818 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26819 anything declared inside `f'. */
26820 saved_in_unbraced_linkage_specification_p
26823 /* Inside the function, surrounding template-parameter-lists do not
26824 apply. */
26825 saved_num_template_parameter_lists
26829 /* If the next token is `try', `__transaction_atomic', or
26830 `__transaction_relaxed`, then we are looking at either function-try-block
26831 or function-transaction-block. Note that all of these include the
26832 function-body. */
26836 RID_TRANSACTION_RELAXED))
26840 else
26841 cp_parser_ctor_initializer_opt_and_function_body
26844 /* Finish the function. */
26846 /* Generate code for it, if necessary. */
26848 /* Restore the saved values. */
26849 parser->in_unbraced_linkage_specification_p
26851 parser->num_template_parameter_lists
26855 parser->fully_implicit_function_template_p
26857 parser->implicit_template_parms
26859 parser->implicit_template_scope
26866 }
26868 /* Parse a template-declaration body (following argument list). */
26870 static void
26872 tree parameter_list,
26874 {
26878 /* We just processed one more parameter list. */
26881 /* Get the deferred access checks from the parameter list. These
26882 will be checked once we know what is being declared, as for a
26883 member template the checks must be performed in the scope of the
26884 class containing the member. */
26887 /* Tentatively parse for a new template parameter list, which can either be
26888 the template keyword or a template introduction. */
26894 else
26895 {
26896 /* There are no access checks when parsing a template, as we do not
26897 know if a specialization will be a friend. */
26901 checks,
26902 member_p,
26907 /* If this is a member template declaration, let the front
26908 end know. */
26910 {
26915 }
26920 }
26921 /* We are done with the current parameter list. */
26926 /* Finish up. */
26929 /* Check the template arguments for a literal operator template. */
26933 {
26937 else
26938 {
26941 {
26947 }
26949 {
26958 }
26959 else
26961 }
26963 {
26966 " Expected non-type template argument pack <char...>"
26968 decl);
26969 else
26972 decl);
26973 }
26974 }
26976 /* Register member declarations. */
26979 /* If DECL is a function template, we must return to parse it later.
26980 (Even though there is no definition, there might be default
26981 arguments that need handling.) */
26985 }
26987 /* Parse a template introduction header for a template-declaration. Returns
26988 false if tentative parse fails. */
26990 static bool
26992 {
26999 /* Look for the optional `::' operator. */
27002 /* Look for the nested-name-specifier. */
27012 /* Look up the concept for which we will be matching
27013 template parameters. */
27023 /* Look for opening brace for introduction. */
27024 matching_braces braces;
27032 /* Build vector of placeholder parameters and grab
27033 matching identifiers. */
27036 /* The introduction-list shall not be empty. */
27039 {
27042 }
27044 /* Look for closing brace for introduction. */
27049 {
27053 }
27055 /* Build and associate the constraint. */
27058 {
27060 member_p);
27062 }
27066 }
27068 /* Parse a normal template-declaration following the template keyword. */
27070 static void
27072 {
27073 tree parameter_list;
27077 /* Look for the `<' token. */
27081 {
27082 /* 14.5.2.2 [temp.mem]
27084 A local class shall not have member templates. */
27089 }
27090 /* [temp]
27092 A template ... shall not have C linkage. */
27094 {
27097 /* Give it C++ linkage to avoid confusing other parts of the
27098 front end. */
27101 }
27102 else
27105 /* We cannot perform access checks on the template parameter
27106 declarations until we know what is being declared, just as we
27107 cannot check the decl-specifier list. */
27110 /* If the next token is `>', then we have an invalid
27111 specialization. Rather than complain about an invalid template
27112 parameter, issue an error message here. */
27114 {
27118 }
27119 else
27120 {
27121 /* Parse the template parameters. */
27123 }
27125 /* Look for the `>'. */
27128 /* Manage template requirements */
27130 {
27135 }
27138 member_p);
27140 /* For the erroneous case of a template with C linkage, we pushed an
27141 implicit C++ linkage scope; exit that scope now. */
27144 }
27146 /* Parse a template-declaration, assuming that the `export' (and
27147 `extern') keywords, if present, has already been scanned. MEMBER_P
27148 is as for cp_parser_template_declaration. */
27150 static bool
27152 {
27154 {
27158 }
27163 }
27165 /* Perform the deferred access checks from a template-parameter-list.
27166 CHECKS is a TREE_LIST of access checks, as returned by
27167 get_deferred_access_checks. */
27169 static void
27170 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27171 {
27175 }
27177 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27178 `function-definition' sequence that follows a template header.
27179 If MEMBER_P is true, this declaration appears in a class scope.
27181 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27182 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27184 static tree
27190 {
27193 cp_decl_specifier_seq decl_specifiers;
27197 /* This function is only used when processing a template
27198 declaration. */
27202 /* Defer access checks until we know what is being declared. */
27205 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27206 alternative. */
27209 CP_PARSER_FLAGS_OPTIONAL,
27215 /* There are no template typedefs. */
27217 {
27221 }
27223 /* Gather up the access checks that occurred the
27224 decl-specifier-seq. */
27227 /* Check for the declaration of a template class. */
27229 {
27232 {
27233 // If this is a declaration, but not a definition, associate
27234 // any constraints with the type declaration. Constraints
27235 // are associated with definitions in cp_parser_class_specifier.
27241 /* In this case:
27243 struct C {
27244 friend template <typename T> struct A<T>::B;
27245 };
27247 A<T>::B will be represented by a TYPENAME_TYPE, and
27248 therefore not recognized by shadow_tag. */
27250 && !decl
27257 else
27260 /* Perform access checks for template parameters. */
27263 /* Give a helpful diagnostic for
27264 template <class T> struct A { } a;
27265 if we aren't already recovering from an error. */
27268 {
27270 "a class template declaration must not declare "
27274 }
27275 }
27276 }
27278 /* Complain about missing 'typename' or other invalid type names. */
27281 {
27282 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27283 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27284 the rest of this declaration. */
27287 }
27289 /* If it's not a template class, try for a template function. If
27290 the next token is a `;', then this declaration does not declare
27291 anything. But, if there were errors in the decl-specifiers, then
27292 the error might well have come from an attempted class-specifier.
27293 In that case, there's no need to warn about a missing declarator. */
27297 {
27300 checks,
27302 member_p,
27303 declares_class_or_enum,
27307 /* 7.1.1-1 [dcl.stc]
27309 A storage-class-specifier shall not be specified in an explicit
27310 specialization... */
27312 && explicit_specialization_p
27314 {
27318 }
27322 }
27324 /* Look for a trailing `;' after the declaration. */
27330 out:
27333 /* Clear any current qualification; whatever comes next is the start
27334 of something new. */
27340 }
27342 /* Parse a cast-expression that is not the operand of a unary "&". */
27344 static cp_expr
27346 {
27349 }
27351 /* Parse a functional cast to TYPE. Returns an expression
27352 representing the cast. */
27354 static cp_expr
27356 {
27358 tree expression_list;
27359 cp_expr cast;
27368 {
27378 /* Create a location of the form:
27379 type_name{i, f}
27380 ^~~~~~~~~~~~~~~
27381 with caret == start at the start of the type name,
27382 finishing at the closing brace. */
27383 location_t finish_loc
27386 finish_loc);
27389 }
27398 else
27399 {
27402 }
27405 tf_warning_or_error);
27406 /* [expr.const]/1: In an integral constant expression "only type
27407 conversions to integral or enumeration type can be used". */
27413 NIC_CONSTRUCTOR))
27416 /* Create a location of the form:
27417 float(i)
27418 ^~~~~~~~
27419 with caret == start at the start of the type name,
27420 finishing at the closing paren. */
27421 location_t finish_loc
27426 }
27428 /* Save the tokens that make up the body of a member function defined
27429 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27430 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27431 specifiers applied to the declaration. Returns the FUNCTION_DECL
27432 for the member function. */
27434 static tree
27438 tree attributes)
27439 {
27442 tree fn;
27445 /* Create the FUNCTION_DECL. */
27449 /* If something went badly wrong, bail out now. */
27451 {
27452 /* If there's a function-body, skip it. */
27457 }
27459 /* Remember it, if there default args to post process. */
27462 /* Save away the tokens that make up the body of the
27463 function. */
27469 RID_TRANSACTION_ATOMIC))
27470 {
27472 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27479 {
27485 }
27486 else
27489 {
27493 }
27494 }
27496 /* Handle function try blocks. */
27498 {
27501 }
27502 /* We can have braced-init-list mem-initializers before the fn body. */
27504 {
27507 {
27508 /* cache_group will stop after an un-nested { } pair, too. */
27512 /* variadic mem-inits have ... after the ')'. */
27515 }
27516 }
27518 /* Handle function try blocks. */
27524 /* Save away the inline definition; we will process it when the
27525 class is complete. */
27529 /* We need to know that this was defined in the class, so that
27530 friend templates are handled correctly. */
27533 /* Add FN to the queue of functions to be parsed later. */
27537 }
27539 /* Save the tokens that make up the in-class initializer for a non-static
27540 data member. Returns a DEFAULT_ARG. */
27542 static tree
27544 {
27546 }
27548 /* Parse a template-argument-list, as well as the trailing ">" (but
27549 not the opening "<"). See cp_parser_template_argument_list for the
27550 return value. */
27552 static tree
27554 {
27555 tree arguments;
27556 tree saved_scope;
27557 tree saved_qualifying_scope;
27558 tree saved_object_scope;
27563 /* [temp.names]
27565 When parsing a template-id, the first non-nested `>' is taken as
27566 the end of the template-argument-list rather than a greater-than
27567 operator. */
27568 saved_greater_than_is_operator_p
27571 /* Parsing the argument list may modify SCOPE, so we save it
27572 here. */
27576 /* We need to evaluate the template arguments, even though this
27577 template-id may be nested within a "sizeof". */
27582 /* Parse the template-argument-list itself. */
27586 else
27588 /* Look for the `>' that ends the template-argument-list. If we find
27589 a '>>' instead, it's probably just a typo. */
27591 {
27593 {
27594 /* In C++0x, a `>>' in a template argument list or cast
27595 expression is considered to be two separate `>'
27596 tokens. So, change the current token to a `>', but don't
27597 consume it: it will be consumed later when the outer
27598 template argument list (or cast expression) is parsed.
27599 Note that this replacement of `>' for `>>' is necessary
27600 even if we are parsing tentatively: in the tentative
27601 case, after calling
27602 cp_parser_enclosed_template_argument_list we will always
27603 throw away all of the template arguments and the first
27604 closing `>', either because the template argument list
27605 was erroneous or because we are replacing those tokens
27606 with a CPP_TEMPLATE_ID token. The second `>' (which will
27607 not have been thrown away) is needed either to close an
27608 outer template argument list or to complete a new-style
27609 cast. */
27612 }
27614 {
27615 /* If we're in a nested template argument list, the '>>' has
27616 to be a typo for '> >'. We emit the error message, but we
27617 continue parsing and we push a '>' as next token, so that
27618 the argument list will be parsed correctly. Note that the
27619 global source location is still on the token before the
27620 '>>', so we need to say explicitly where we want it. */
27628 }
27629 else
27630 {
27631 /* If this is not a nested template argument list, the '>>'
27632 is a typo for '>'. Emit an error message and continue.
27633 Same deal about the token location, but here we can get it
27634 right by consuming the '>>' before issuing the diagnostic. */
27637 "spurious %<>>%>, use %<>%> to terminate "
27639 }
27640 }
27641 else
27643 /* The `>' token might be a greater-than operator again now. */
27644 parser->greater_than_is_operator_p
27646 /* Restore the SAVED_SCOPE. */
27654 }
27656 /* MEMBER_FUNCTION is a member function, or a friend. If default
27657 arguments, or the body of the function have not yet been parsed,
27658 parse them now. */
27660 static void
27662 {
27664 /* If this member is a template, get the underlying
27665 FUNCTION_DECL. */
27669 /* There should not be any class definitions in progress at this
27670 point; the bodies of members are only parsed outside of all class
27671 definitions. */
27673 /* While we're parsing the member functions we might encounter more
27674 classes. We want to handle them right away, but we don't want
27675 them getting mixed up with functions that are currently in the
27676 queue. */
27679 /* Make sure that any template parameters are in scope. */
27682 /* If the body of the function has not yet been parsed, parse it
27683 now. */
27685 {
27686 tree function_scope;
27689 /* The function is no longer pending; we are processing it. */
27694 /* If this is a local class, enter the scope of the containing
27695 function. */
27700 /* Push the body of the function onto the lexer stack. */
27703 /* Let the front end know that we going to be defining this
27704 function. */
27708 /* Don't do access checking if it is a templated function. */
27712 /* #pragma omp declare reduction needs special parsing. */
27714 {
27719 }
27720 else
27721 /* Now, parse the body of the function. */
27728 /* Leave the scope of the containing function. */
27732 }
27734 /* Remove any template parameters from the symbol table. */
27737 /* Restore the queue. */
27740 }
27742 /* If DECL contains any default args, remember it on the unparsed
27743 functions queue. */
27745 static void
27747 {
27748 tree probe;
27751 probe;
27754 {
27758 }
27759 }
27761 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27762 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27763 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27764 from the parameter-type-list. */
27766 static tree
27769 {
27771 tree parsed_arg;
27777 /* Push the saved tokens for the default argument onto the parser's
27778 lexer stack. */
27784 /* Parse the default argument. */
27795 {
27796 /* In a non-template class, check conversions now. In a template,
27797 we'll wait and instantiate these as needed. */
27800 tf_warning_or_error);
27803 else
27805 }
27807 /* If the token stream has not been completely used up, then
27808 there was extra junk after the end of the default
27809 argument. */
27811 {
27814 else
27816 }
27818 /* Revert to the main lexer. */
27822 }
27824 /* FIELD is a non-static data member with an initializer which we saved for
27825 later; parse it now. */
27827 static void
27829 {
27830 tree def;
27837 NULL_TREE);
27843 }
27845 /* FN is a FUNCTION_DECL which may contains a parameter with an
27846 unparsed DEFAULT_ARG. Parse the default args now. This function
27847 assumes that the current scope is the scope in which the default
27848 argument should be processed. */
27850 static void
27852 {
27856 /* While we're parsing the default args, we might (due to the
27857 statement expression extension) encounter more classes. We want
27858 to handle them right away, but we don't want them getting mixed
27859 up with default args that are currently in the queue. */
27862 /* Local variable names (and the `this' keyword) may not appear
27863 in a default argument. */
27874 {
27876 tree parsed_arg;
27878 tree copy;
27885 /* This can happen for a friend declaration for a function
27886 already declared with default arguments. */
27889 parsed_arg
27891 default_arg,
27895 /* Update any instantiations we've already created. */
27899 }
27903 /* Make sure no default arg is missing. */
27906 /* Restore the state of local_variables_forbidden_p. */
27909 /* Restore the queue. */
27911 }
27913 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27915 sizeof ... ( identifier )
27917 where the 'sizeof' token has already been consumed. */
27919 static tree
27921 {
27922 /* Consume the `...'. */
27926 matching_parens parens;
27930 else
27938 /* The name is not qualified. */
27957 }
27959 /* Parse the operand of `sizeof' (or a similar operator). Returns
27960 either a TYPE or an expression, depending on the form of the
27961 input. The KEYWORD indicates which kind of expression we have
27962 encountered. */
27964 static tree
27966 {
27973 /* If it's a `...', then we are computing the length of a parameter
27974 pack. */
27979 /* Types cannot be defined in a `sizeof' expression. Save away the
27980 old message. */
27982 /* And create the new one. */
27988 /* The restrictions on constant-expressions do not apply inside
27989 sizeof expressions. */
27990 saved_integral_constant_expression_p
27992 saved_non_integral_constant_expression_p
27996 /* Do not actually evaluate the expression. */
27999 /* If it's a `(', then we might be looking at the type-id
28000 construction. */
28002 {
28005 /* We can't be sure yet whether we're looking at a type-id or an
28006 expression. */
28009 matching_parens parens;
28012 /* Note: as a GNU Extension, compound literals are considered
28013 postfix-expressions as they are in C99, so they are valid
28014 arguments to sizeof. See comment in cp_parser_cast_expression
28015 for details. */
28018 else
28019 {
28022 /* Look for the type-id. */
28024 /* Look for the closing `)'. */
28027 }
28029 /* If all went well, then we're done. */
28031 {
28032 cp_decl_specifier_seq decl_specs;
28034 /* Build a trivial decl-specifier-seq. */
28038 /* Call grokdeclarator to figure out what type this is. */
28041 TYPENAME,
28044 }
28045 }
28047 /* If the type-id production did not work out, then we must be
28048 looking at the unary-expression production. */
28052 /* Go back to evaluating expressions. */
28056 /* Free the message we created. */
28058 /* And restore the old one. */
28060 parser->integral_constant_expression_p
28062 parser->non_integral_constant_expression_p
28066 }
28068 /* If the current declaration has no declarator, return true. */
28070 static bool
28072 {
28073 /* If the next token is a `;' or a `,' then there is no
28074 declarator. */
28077 }
28079 /* Update the DECL_SPECS to reflect the storage class indicated by
28080 KEYWORD. */
28082 static void
28087 {
28088 cp_storage_class storage_class;
28091 {
28095 }
28097 {
28100 }
28105 {
28108 }
28111 {
28129 }
28133 /* A storage class specifier cannot be applied alongside a typedef
28134 specifier. If there is a typedef specifier present then set
28135 conflicting_specifiers_p which will trigger an error later
28136 on in grokdeclarator. */
28139 }
28141 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28142 is true, the type is a class or enum definition. */
28144 static void
28146 tree type_spec,
28149 {
28152 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28153 (with, for example, in "typedef int wchar_t;") we remember that
28154 this is what happened. In system headers, we ignore these
28155 declarations so that G++ can work with system headers that are not
28156 C++-safe. */
28158 && !type_definition_p
28168 {
28171 ds_redefined_builtin_type_spec,
28172 token);
28174 {
28178 }
28179 }
28182 else
28183 {
28188 }
28189 }
28191 /* True iff TOKEN is the GNU keyword __thread. */
28193 static bool
28195 {
28198 }
28200 /* Set the location for a declarator specifier and check if it is
28201 duplicated.
28203 DECL_SPECS is the sequence of declarator specifiers onto which to
28204 set the location.
28206 DS is the single declarator specifier to set which location is to
28207 be set onto the existing sequence of declarators.
28209 LOCATION is the location for the declarator specifier to
28210 consider. */
28212 static void
28215 {
28224 {
28228 }
28229 else
28230 {
28232 {
28236 else
28237 {
28240 OPT_Wlong_long,
28242 }
28243 }
28245 {
28250 else
28251 {
28255 }
28256 }
28257 else
28258 {
28274 "__complex"
28275 };
28279 }
28280 }
28281 }
28283 /* Return true iff the declarator specifier DS is present in the
28284 sequence of declarator specifiers DECL_SPECS. */
28286 bool
28288 cp_decl_spec ds)
28289 {
28296 }
28298 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28299 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28301 static bool
28303 {
28305 }
28307 /* Issue an error message indicating that TOKEN_DESC was expected.
28308 If KEYWORD is true, it indicated this function is called by
28309 cp_parser_require_keword and the required token can only be
28310 a indicated keyword.
28312 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28313 within any error as the location of an "opening" token matching
28314 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28315 RT_CLOSE_PAREN). */
28317 static void
28319 required_token token_desc,
28321 location_t matching_location)
28322 {
28328 {
28397 }
28400 {
28402 {
28480 }
28481 }
28485 }
28488 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28489 issue an error message indicating that TOKEN_DESC was expected.
28491 Returns the token consumed, if the token had the appropriate type.
28492 Otherwise, returns NULL.
28494 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28495 within any error as the location of an "opening" token matching
28496 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28497 RT_CLOSE_PAREN). */
28502 required_token token_desc,
28503 location_t matching_location)
28504 {
28507 else
28508 {
28509 /* Output the MESSAGE -- unless we're parsing tentatively. */
28512 matching_location);
28514 }
28515 }
28517 /* An error message is produced if the next token is not '>'.
28518 All further tokens are skipped until the desired token is
28519 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28521 static void
28523 {
28524 /* Current level of '< ... >'. */
28526 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28529 /* Are we ready, yet? If not, issue error message. */
28533 /* Skip tokens until the desired token is found. */
28535 {
28536 /* Peek at the next token. */
28538 {
28546 /* C++0x views the `>>' operator as two `>' tokens, but
28547 C++98 does not. */
28550 {
28551 /* We've hit a `>>' where the first `>' closes the
28552 template argument list, and the second `>' is
28553 spurious. Just consume the `>>' and stop; we've
28554 already produced at least one error. */
28557 }
28558 /* Fall through for C++0x, so we handle the second `>' in
28559 the `>>'. */
28564 {
28565 /* We've reached the token we want, consume it and stop. */
28568 }
28587 /* The '>' was probably forgotten, don't look further. */
28592 }
28594 /* Consume this token. */
28596 }
28597 }
28599 /* If the next token is the indicated keyword, consume it. Otherwise,
28600 issue an error message indicating that TOKEN_DESC was expected.
28602 Returns the token consumed, if the token had the appropriate type.
28603 Otherwise, returns NULL. */
28608 required_token token_desc)
28609 {
28613 {
28615 UNKNOWN_LOCATION);
28617 }
28620 }
28622 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28623 function-definition. */
28625 static bool
28627 {
28630 /* A ctor-initializer begins with a `:'. */
28632 /* A function-try-block begins with `try'. */
28634 /* A function-transaction-block begins with `__transaction_atomic'
28635 or `__transaction_relaxed'. */
28638 /* The named return value extension begins with `return'. */
28640 }
28642 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28643 definition. */
28645 static bool
28647 {
28654 }
28656 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28657 C++0x) ending a template-argument. */
28659 static bool
28661 {
28669 }
28671 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28672 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28674 static bool
28677 {
28683 /* Check for the sequence `<::' in the original code. It would be lexed as
28684 `[:', where `[' is a digraph, and there is no whitespace before
28685 `:'. */
28687 {
28692 }
28694 }
28696 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28697 or none_type otherwise. */
28699 static enum tag_types
28701 {
28703 {
28713 }
28714 }
28716 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28717 or none_type otherwise or if the token is null. */
28719 static enum tag_types
28721 {
28726 {
28734 }
28735 }
28737 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28739 static void
28741 {
28745 {
28749 type))
28752 }
28753 }
28755 /* Issue an error message if DECL is redeclared with different
28756 access than its original declaration [class.access.spec/3].
28757 This applies to nested classes, nested class templates and
28758 enumerations [class.mem/1]. */
28760 static void
28762 {
28773 }
28775 /* Look for the `template' keyword, as a syntactic disambiguator.
28776 Return TRUE iff it is present, in which case it will be
28777 consumed. */
28779 static bool
28781 {
28783 {
28784 /* In C++98 the `template' keyword can only be used within templates;
28785 outside templates the parser can always figure out what is a
28786 template and what is not. In C++11, per the resolution of DR 468,
28787 `template' is allowed in cases where it is not strictly necessary. */
28790 {
28793 "in C++98 %<template%> (as a disambiguator) is only "
28795 /* If this part of the token stream is rescanned, the same
28796 error message would be generated. So, we purge the token
28797 from the stream. */
28800 }
28801 else
28802 {
28803 /* Consume the `template' keyword. */
28806 }
28807 }
28809 }
28811 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28812 set PARSER->SCOPE, and perform other related actions. */
28814 static void
28816 {
28819 /* Get the stored value. */
28821 /* Set the scope from the stored value. */
28825 }
28827 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28828 encounter the end of a block before what we were looking for. */
28830 static bool
28834 {
28836 {
28839 /* Abort a parenthesized expression if we encounter a semicolon. */
28843 /* If we've reached the end of the file, stop. */
28849 /* We've hit the end of an enclosing block, so there's been some
28850 kind of syntax error. */
28853 /* Consume the token. */
28855 /* See if it starts a new group. */
28857 {
28859 /* In theory this should probably check end == '}', but
28860 cp_parser_save_member_function_body needs it to exit
28861 after either '}' or ')' when called with ')'. */
28864 }
28866 {
28870 }
28875 }
28876 }
28878 /* Like above, for caching a default argument or NSDMI. Both of these are
28879 terminated by a non-nested comma, but it can be unclear whether or not a
28880 comma is nested in a template argument list unless we do more parsing.
28881 In order to handle this ambiguity, when we encounter a ',' after a '<'
28882 we try to parse what follows as a parameter-declaration-list (in the
28883 case of a default argument) or a member-declarator (in the case of an
28884 NSDMI). If that succeeds, then we stop caching. */
28886 static tree
28888 {
28893 tree default_argument;
28895 /* Add tokens until we have processed the entire default
28896 argument. We add the range [first_token, token). */
28899 {
28900 /* For list-initialization, this is straightforward. */
28903 }
28905 {
28908 /* Peek at the next token. */
28910 /* What we do depends on what token we have. */
28912 {
28913 /* In valid code, a default argument must be
28914 immediately followed by a `,' `)', or `...'. */
28917 {
28918 /* If we've seen a '<', we might be in a
28919 template-argument-list. Until Core issue 325 is
28920 resolved, we don't know how this situation ought
28921 to be handled, so try to DTRT. We check whether
28922 what comes after the comma is a valid parameter
28923 declaration list. If it is, then the comma ends
28924 the default argument; otherwise the default
28925 argument continues. */
28929 /* Set ITALP so cp_parser_parameter_declaration_list
28930 doesn't decide to commit to this parse. */
28937 {
28938 /* Parse declarators until we reach a non-comma or
28939 somthing that cannot be an initializer.
28940 Just checking whether we're looking at a single
28941 declarator is insufficient. Consider:
28942 int var = tuple<T,U>::x;
28943 The template parameter 'U' looks exactly like a
28944 declarator. */
28945 do
28946 {
28957 }
28959 /* If we met an '=' or ';' then the original comma
28960 was the end of the NSDMI. Otherwise assume
28961 we're still in the NSDMI. */
28964 }
28965 else
28966 {
28971 }
28978 }
28979 /* FALLTHRU */
28982 /* If we run into a non-nested `;', `}', or `]',
28983 then the code is invalid -- but the default
28984 argument is certainly over. */
28989 /* Handle correctly int n = sizeof ... ( p ); */
28992 /* Update DEPTH, if necessary. */
29007 /* This might be the comparison operator, or it might
29008 start a template argument list. */
29015 /* Fall through for C++0x, which treats the `>>'
29016 operator like two `>' tokens in certain
29017 cases. */
29022 {
29023 /* This might be an operator, or it might close a
29024 template argument list. But if a previous '<'
29025 started a template argument list, this will have
29026 closed it, so we can't be in one anymore. */
29030 }
29033 /* If we run out of tokens, issue an error message. */
29041 /* In these cases, we should look for template-ids.
29042 For example, if the default argument is
29043 `X<int, double>()', we need to do name lookup to
29044 figure out whether or not `X' is a template; if
29045 so, the `,' does not end the default argument.
29047 That is not yet done. */
29052 }
29054 /* If we've reached the end, stop. */
29058 /* Add the token to the token block. */
29060 }
29062 /* Create a DEFAULT_ARG to represent the unparsed default
29063 argument. */
29070 }
29072 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29074 location_t
29076 {
29081 }
29083 /* Begin parsing tentatively. We always save tokens while parsing
29084 tentatively so that if the tentative parsing fails we can restore the
29085 tokens. */
29087 static void
29089 {
29090 /* Enter a new parsing context. */
29092 /* Begin saving tokens. */
29094 /* In order to avoid repetitive access control error messages,
29095 access checks are queued up until we are no longer parsing
29096 tentatively. */
29098 }
29100 /* Commit to the currently active tentative parse. */
29102 static void
29104 {
29108 /* Mark all of the levels as committed. */
29111 {
29118 }
29119 }
29121 /* Commit to the topmost currently active tentative parse.
29123 Note that this function shouldn't be called when there are
29124 irreversible side-effects while in a tentative state. For
29125 example, we shouldn't create a permanent entry in the symbol
29126 table, or issue an error message that might not apply if the
29127 tentative parse is aborted. */
29129 static void
29131 {
29136 {
29144 }
29145 }
29147 /* Abort the currently active tentative parse. All consumed tokens
29148 will be rolled back, and no diagnostics will be issued. */
29150 static void
29152 {
29156 /* Now, pretend that we want to see if the construct was
29157 successfully parsed. */
29159 }
29161 /* Stop parsing tentatively. If a parse error has occurred, restore the
29162 token stream. Otherwise, commit to the tokens we have consumed.
29163 Returns true if no error occurred; false otherwise. */
29165 static bool
29167 {
29171 /* Remember whether or not an error occurred, since we are about to
29172 destroy that information. */
29174 /* Remove the topmost context from the stack. */
29177 /* If no parse errors occurred, commit to the tentative parse. */
29179 {
29180 /* Commit to the tokens read tentatively, unless that was
29181 already done. */
29186 }
29187 /* Otherwise, if errors occurred, roll back our state so that things
29188 are just as they were before we began the tentative parse. */
29189 else
29190 {
29193 }
29194 /* Add the context to the front of the free list. */
29199 }
29201 /* Returns true if we are parsing tentatively and are not committed to
29202 this tentative parse. */
29204 static bool
29206 {
29209 }
29211 /* Returns nonzero iff an error has occurred during the most recent
29212 tentative parse. */
29214 static bool
29216 {
29219 }
29221 /* Returns nonzero if GNU extensions are allowed. */
29223 static bool
29225 {
29227 }
29228 \f
29229 /* Objective-C++ Productions */
29232 /* Parse an Objective-C expression, which feeds into a primary-expression
29233 above.
29235 objc-expression:
29236 objc-message-expression
29237 objc-string-literal
29238 objc-encode-expression
29239 objc-protocol-expression
29240 objc-selector-expression
29242 Returns a tree representation of the expression. */
29244 static cp_expr
29246 {
29247 /* Try to figure out what kind of declaration is present. */
29251 {
29261 {
29273 }
29279 }
29282 }
29284 /* Parse an Objective-C message expression.
29286 objc-message-expression:
29287 [ objc-message-receiver objc-message-args ]
29289 Returns a representation of an Objective-C message. */
29291 static tree
29293 {
29305 /* Construct a location e.g.
29306 [self func1:5]
29307 ^~~~~~~~~~~~~~
29308 ranging from the '[' to the ']', with the caret at the start. */
29313 }
29315 /* Parse an objc-message-receiver.
29317 objc-message-receiver:
29318 expression
29319 simple-type-specifier
29321 Returns a representation of the type or expression. */
29323 static tree
29325 {
29326 tree rcv;
29328 /* An Objective-C message receiver may be either (1) a type
29329 or (2) an expression. */
29333 /* If that worked out, fine. */
29340 CP_PARSER_FLAGS_NONE);
29347 }
29349 /* Parse the arguments and selectors comprising an Objective-C message.
29351 objc-message-args:
29352 objc-selector
29353 objc-selector-args
29354 objc-selector-args , objc-comma-args
29356 objc-selector-args:
29357 objc-selector [opt] : assignment-expression
29358 objc-selector-args objc-selector [opt] : assignment-expression
29360 objc-comma-args:
29361 assignment-expression
29362 objc-comma-args , assignment-expression
29364 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29365 selector arguments and TREE_VALUE containing a list of comma
29366 arguments. */
29368 static tree
29370 {
29376 {
29382 /* Detect if we have a unary selector. */
29391 sel_args
29396 }
29398 /* Handle non-selector arguments, if any. */
29400 {
29401 tree arg;
29406 addl_args
29411 }
29414 {
29417 }
29420 }
29422 /* Parse an Objective-C encode expression.
29424 objc-encode-expression:
29425 @encode objc-typename
29427 Returns an encoded representation of the type argument. */
29429 static cp_expr
29431 {
29432 tree type;
29437 matching_parens parens;
29444 {
29448 }
29450 /* This happens if we find @encode(T) (where T is a template
29451 typename or something dependent on a template typename) when
29452 parsing a template. In that case, we can't compile it
29453 immediately, but we rather create an AT_ENCODE_EXPR which will
29454 need to be instantiated when the template is used.
29455 */
29457 {
29461 }
29464 /* Build a location of the form:
29465 @encode(int)
29466 ^~~~~~~~~~~~
29467 with caret==start at the @ token, finishing at the close paren. */
29468 location_t combined_loc
29473 }
29475 /* Parse an Objective-C @defs expression. */
29477 static tree
29479 {
29480 tree name;
29483 matching_parens parens;
29489 }
29491 /* Parse an Objective-C protocol expression.
29493 objc-protocol-expression:
29494 @protocol ( identifier )
29496 Returns a representation of the protocol expression. */
29498 static tree
29500 {
29501 tree proto;
29505 matching_parens parens;
29510 /* Build a location of the form:
29511 @protocol(prot)
29512 ^~~~~~~~~~~~~~~
29513 with caret==start at the @ token, finishing at the close paren. */
29514 location_t combined_loc
29520 }
29522 /* Parse an Objective-C selector expression.
29524 objc-selector-expression:
29525 @selector ( objc-method-signature )
29527 objc-method-signature:
29528 objc-selector
29529 objc-selector-seq
29531 objc-selector-seq:
29532 objc-selector :
29533 objc-selector-seq objc-selector :
29535 Returns a representation of the method selector. */
29537 static tree
29539 {
29546 matching_parens parens;
29552 {
29561 {
29562 /* Detect if we have a unary selector. */
29564 {
29567 }
29568 else
29569 {
29571 }
29572 }
29577 {
29578 sel_seq
29581 sel_seq
29584 }
29585 else
29586 sel_seq
29591 }
29593 finish_selector:
29597 /* Build a location of the form:
29598 @selector(func)
29599 ^~~~~~~~~~~~~~~
29600 with caret==start at the @ token, finishing at the close paren. */
29601 location_t combined_loc
29605 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29608 }
29610 /* Parse a list of identifiers.
29612 objc-identifier-list:
29613 identifier
29614 objc-identifier-list , identifier
29616 Returns a TREE_LIST of identifier nodes. */
29618 static tree
29620 {
29621 tree identifier;
29622 tree list;
29633 {
29640 identifier));
29642 }
29645 }
29647 /* Parse an Objective-C alias declaration.
29649 objc-alias-declaration:
29650 @compatibility_alias identifier identifier ;
29652 This function registers the alias mapping with the Objective-C front end.
29653 It returns nothing. */
29655 static void
29657 {
29665 }
29667 /* Parse an Objective-C class forward-declaration.
29669 objc-class-declaration:
29670 @class objc-identifier-list ;
29672 The function registers the forward declarations with the Objective-C
29673 front end. It returns nothing. */
29675 static void
29677 {
29680 {
29681 tree id;
29691 else
29693 }
29695 }
29697 /* Parse a list of Objective-C protocol references.
29699 objc-protocol-refs-opt:
29700 objc-protocol-refs [opt]
29702 objc-protocol-refs:
29703 < objc-identifier-list >
29705 Returns a TREE_LIST of identifiers, if any. */
29707 static tree
29709 {
29713 {
29717 }
29720 }
29722 /* Parse a Objective-C visibility specification. */
29724 static void
29726 {
29730 {
29745 }
29747 /* Eat '@private'/'@protected'/'@public'. */
29749 }
29751 /* Parse an Objective-C method type. Return 'true' if it is a class
29752 (+) method, and 'false' if it is an instance (-) method. */
29756 {
29759 else
29761 }
29763 /* Parse an Objective-C protocol qualifier. */
29765 static tree
29767 {
29780 {
29785 }
29788 }
29790 /* Parse an Objective-C typename. */
29792 static tree
29794 {
29798 {
29801 matching_parens parens;
29805 /* An ObjC type name may consist of just protocol qualifiers, in which
29806 case the type shall default to 'id'. */
29808 {
29811 /* If the type could not be parsed, an error has already
29812 been produced. For error recovery, behave as if it had
29813 not been specified, which will use the default type
29814 'id'. */
29816 {
29818 /* We need to skip to the closing parenthesis as
29819 cp_parser_type_id() does not seem to do it for
29820 us. */
29825 }
29826 }
29830 }
29833 }
29835 /* Check to see if TYPE refers to an Objective-C selector name. */
29837 static bool
29839 {
29845 }
29847 /* Parse an Objective-C selector. */
29849 static tree
29851 {
29855 {
29858 }
29860 /* C++ operator names are allowed to appear in ObjC selectors. */
29862 {
29875 }
29876 }
29878 /* Parse an Objective-C params list. */
29880 static tree
29882 {
29888 {
29898 /* Detect if we have a unary selector. */
29901 {
29904 }
29908 {
29909 /* Something went quite wrong. There should be a colon
29910 here, but there is not. Stop parsing parameters. */
29912 }
29914 /* New ObjC allows attributes on parameters too. */
29919 params
29922 type_name,
29923 identifier,
29924 parm_attr));
29927 }
29930 {
29933 }
29935 /* We allow tail attributes for the method. */
29937 {
29945 }
29948 {
29951 }
29953 }
29955 /* Parse the non-keyword Objective-C params. */
29957 static tree
29960 {
29966 {
29968 tree parm;
29974 {
29979 }
29981 /* TODO: parse attributes for tail parameters. */
29990 }
29992 /* We allow tail attributes for the method. */
29994 {
29996 {
30001 }
30002 else
30003 /* We have an error, but parse the attributes, so that we can
30004 carry on. */
30010 }
30013 }
30015 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30017 static void
30019 {
30022 /* If the next token is `extern' and the following token is a string
30023 literal, then we have a linkage specification. */
30025 && cp_parser_is_pure_string_literal
30028 /* Handle #pragma, if any. */
30031 /* Allow stray semicolons. */
30034 /* Mark methods as optional or required, when building protocols. */
30036 {
30039 }
30041 {
30044 }
30047 /* Other stray characters must generate errors. */
30049 {
30053 }
30054 /* Finally, try to parse a block-declaration, or a function-definition. */
30055 else
30057 }
30059 /* Parse a method signature. */
30061 static tree
30063 {
30079 }
30081 static bool
30083 {
30084 tree tattr;
30089 /* If the attributes are followed by a method introducer, this is not allowed.
30090 Dump the attributes and flag the situation. */
30095 /* Otherwise, the attributes introduce some interstitial code, possibly so
30096 rewind to allow that check. */
30099 }
30101 /* Parse an Objective-C method prototype list. */
30103 static void
30105 {
30109 {
30111 {
30116 else
30120 {
30124 }
30127 }
30133 OPT_Wattributes,
30135 else
30136 /* Allow for interspersed non-ObjC++ code. */
30140 }
30144 else
30148 }
30150 /* Parse an Objective-C method definition list. */
30152 static void
30154 {
30158 {
30159 tree meth;
30162 {
30168 else
30173 {
30177 }
30179 NULL_TREE);
30181 /* For historical reasons, we accept an optional semicolon. */
30188 {
30195 }
30196 }
30197 /* The following case will be removed once @synthesize is
30198 completely implemented. */
30209 else
30210 /* Allow for interspersed non-ObjC++ code. */
30214 }
30218 else
30222 }
30224 /* Parse Objective-C ivars. */
30226 static void
30228 {
30239 {
30240 cp_decl_specifier_seq declspecs;
30242 tree prefix_attributes;
30250 CP_PARSER_FLAGS_OPTIONAL,
30254 /* auto, register, static, extern, mutable. */
30256 {
30259 }
30261 /* thread_local. */
30263 {
30266 }
30268 /* typedef. */
30270 {
30273 }
30278 /* Keep going until we hit the `;' at the end of the
30279 declaration. */
30281 {
30286 /* Check for a (possibly unnamed) bitfield declaration. */
30294 {
30295 /* Get the name of the bitfield. */
30298 sfk_none);
30300 eat_colon:
30302 /* Get the width of the bitfield. */
30303 width
30305 }
30306 else
30307 {
30308 /* Parse the declarator. */
30309 declarator
30315 }
30317 /* Look for attributes that apply to the ivar. */
30319 /* Remember which attributes are prefix attributes and
30320 which are not. */
30322 /* Combine the attributes. */
30326 /* Create the bitfield declaration. */
30329 else
30334 /* Add the instance variable. */
30338 /* Reset PREFIX_ATTRIBUTES. */
30347 {
30350 }
30352 }
30356 }
30361 /* Do not consume the RID_AT_END, so it will be read again as terminating
30362 the @interface of @implementation. */
30366 /* For historical reasons, we accept an optional semicolon. */
30369 }
30371 /* Parse an Objective-C protocol declaration. */
30373 static void
30375 {
30381 {
30386 }
30388 /* See if we have a forward declaration or a definition. */
30391 /* Try a forward declaration first. */
30393 {
30395 {
30396 tree id;
30406 else
30408 }
30410 }
30412 /* Ok, we got a full-fledged definition (or at least should). */
30413 else
30414 {
30419 }
30420 }
30422 /* Parse an Objective-C superclass or category. */
30424 static void
30429 {
30435 {
30438 }
30440 {
30441 matching_parens parens;
30444 /* If there is no category name, and this is an @interface, we
30445 have a class extension. */
30447 {
30450 }
30451 else
30455 }
30456 }
30458 /* Parse an Objective-C class interface. */
30460 static void
30462 {
30469 {
30470 /* It's hard to recover because even if valid @interface stuff
30471 is to follow, we can't compile it (or validate it) if we
30472 don't even know which class it refers to. Let's assume this
30473 was a stray '@interface' token in the stream and skip it.
30474 */
30476 }
30481 /* We have either a class or a category on our hands. */
30484 else
30485 {
30487 /* Handle instance variable declarations, if any. */
30490 }
30493 }
30495 /* Parse an Objective-C class implementation. */
30497 static void
30499 {
30506 {
30507 /* It's hard to recover because even if valid @implementation
30508 stuff is to follow, we can't compile it (or validate it) if
30509 we don't even know which class it refers to. Let's assume
30510 this was a stray '@implementation' token in the stream and
30511 skip it.
30512 */
30514 }
30518 /* We have either a class or a category on our hands. */
30521 else
30522 {
30524 /* Handle instance variable declarations, if any. */
30527 }
30530 }
30532 /* Consume the @end token and finish off the implementation. */
30534 static void
30536 {
30539 }
30541 /* Parse an Objective-C declaration. */
30543 static void
30545 {
30546 /* Try to figure out what kind of declaration is present. */
30551 {
30567 }
30570 {
30593 }
30594 }
30596 /* Parse an Objective-C try-catch-finally statement.
30598 objc-try-catch-finally-stmt:
30599 @try compound-statement objc-catch-clause-seq [opt]
30600 objc-finally-clause [opt]
30602 objc-catch-clause-seq:
30603 objc-catch-clause objc-catch-clause-seq [opt]
30605 objc-catch-clause:
30606 @catch ( objc-exception-declaration ) compound-statement
30608 objc-finally-clause:
30609 @finally compound-statement
30611 objc-exception-declaration:
30612 parameter-declaration
30613 '...'
30615 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30617 Returns NULL_TREE.
30619 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30620 for C. Keep them in sync. */
30622 static tree
30624 {
30625 location_t location;
30626 tree stmt;
30631 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30632 node, lest it get absorbed into the surrounding block. */
30638 {
30642 matching_parens parens;
30648 {
30649 /* We have "@catch (...)" (where the '...' are literally
30650 what is in the code). Skip the '...'.
30651 parameter_declaration is set to NULL_TREE, and
30652 objc_being_catch_clauses() knows that that means
30653 '...'. */
30656 }
30657 else
30658 {
30659 /* We have "@catch (NSException *exception)" or something
30660 like that. Parse the parameter declaration. */
30664 else
30669 }
30672 else
30673 {
30674 /* If there was no open parenthesis, we are recovering from
30675 an error, and we are trying to figure out what mistake
30676 the user has made. */
30678 /* If there is an immediate closing parenthesis, the user
30679 probably forgot the opening one (ie, they typed "@catch
30680 NSException *e)". Parse the closing parenthesis and keep
30681 going. */
30685 /* If these is no immediate closing parenthesis, the user
30686 probably doesn't know that parenthesis are required at
30687 all (ie, they typed "@catch NSException *e"). So, just
30688 forget about the closing parenthesis and keep going. */
30689 }
30693 }
30695 {
30698 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30699 node, lest it get absorbed into the surrounding block. */
30703 }
30706 }
30708 /* Parse an Objective-C synchronized statement.
30710 objc-synchronized-stmt:
30711 @synchronized ( expression ) compound-statement
30713 Returns NULL_TREE. */
30715 static tree
30717 {
30718 location_t location;
30725 matching_parens parens;
30730 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30731 node, lest it get absorbed into the surrounding block. */
30736 }
30738 /* Parse an Objective-C throw statement.
30740 objc-throw-stmt:
30741 @throw assignment-expression [opt] ;
30743 Returns a constructed '@throw' statement. */
30745 static tree
30747 {
30759 }
30761 /* Parse an Objective-C statement. */
30763 static tree
30765 {
30766 /* Try to figure out what kind of declaration is present. */
30770 {
30781 }
30784 }
30786 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30787 look ahead to see if an objc keyword follows the attributes. This
30788 is to detect the use of prefix attributes on ObjC @interface and
30789 @protocol. */
30791 static bool
30793 {
30798 {
30801 }
30804 }
30806 /* This routine is a minimal replacement for
30807 c_parser_struct_declaration () used when parsing the list of
30808 types/names or ObjC++ properties. For example, when parsing the
30809 code
30811 @property (readonly) int a, b, c;
30813 this function is responsible for parsing "int a, int b, int c" and
30814 returning the declarations as CHAIN of DECLs.
30816 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30817 similar parsing. */
30818 static tree
30820 {
30822 cp_decl_specifier_seq declspecs;
30824 tree prefix_attributes;
30827 CP_PARSER_FLAGS_NONE,
30834 /* auto, register, static, extern, mutable. */
30836 {
30839 }
30841 /* thread_local. */
30843 {
30846 }
30848 /* typedef. */
30850 {
30853 }
30858 /* Keep going until we hit the `;' at the end of the declaration. */
30860 {
30865 /* Parse the declarator. */
30869 /* Look for attributes that apply to the ivar. */
30871 /* Remember which attributes are prefix attributes and
30872 which are not. */
30874 /* Combine the attributes. */
30884 /* Reset PREFIX_ATTRIBUTES. */
30895 {
30898 }
30899 else
30901 }
30903 }
30905 /* Parse an Objective-C @property declaration. The syntax is:
30907 objc-property-declaration:
30908 '@property' objc-property-attributes[opt] struct-declaration ;
30910 objc-property-attributes:
30911 '(' objc-property-attribute-list ')'
30913 objc-property-attribute-list:
30914 objc-property-attribute
30915 objc-property-attribute-list, objc-property-attribute
30917 objc-property-attribute
30918 'getter' = identifier
30919 'setter' = identifier
30920 'readonly'
30921 'readwrite'
30922 'assign'
30923 'retain'
30924 'copy'
30925 'nonatomic'
30927 For example:
30928 @property NSString *name;
30929 @property (readonly) id object;
30930 @property (retain, nonatomic, getter=getTheName) id name;
30931 @property int a, b, c;
30933 PS: This function is identical to
30934 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30935 static void
30937 {
30938 /* The following variables hold the attributes of the properties as
30939 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30940 seen. When we see an attribute, we set them to 'true' (if they
30941 are boolean properties) or to the identifier (if they have an
30942 argument, ie, for getter and setter). Note that here we only
30943 parse the list of attributes, check the syntax and accumulate the
30944 attributes that we find. objc_add_property_declaration() will
30945 then process the information. */
30955 /* 'properties' is the list of properties that we read. Usually a
30956 single one, but maybe more (eg, in "@property int a, b, c;" there
30957 are three). */
30958 tree properties;
30959 location_t loc;
30965 /* Parse the optional attribute list... */
30967 {
30968 /* Eat the '('. */
30969 matching_parens parens;
30973 {
30979 {
30982 }
30986 {
30997 {
31001 else
31006 }
31009 {
31013 }
31015 {
31017 {
31020 }
31021 else
31025 else
31027 }
31028 else
31029 {
31031 {
31034 }
31035 else
31037 }
31043 }
31050 else
31052 }
31054 /* FIXME: "@property (setter, assign);" will generate a spurious
31055 "error: expected ‘)’ before ‘,’ token". This is because
31056 cp_parser_require, unlike the C counterpart, will produce an
31057 error even if we are in error recovery. */
31059 {
31064 }
31065 }
31067 /* ... and the property declaration(s). */
31071 {
31073 /* If the next token is now a `;', consume it. */
31077 }
31081 else
31082 {
31083 /* Comma-separated properties are chained together in
31084 reverse order; add them one by one. */
31093 }
31096 }
31098 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31100 objc-synthesize-declaration:
31101 @synthesize objc-synthesize-identifier-list ;
31103 objc-synthesize-identifier-list:
31104 objc-synthesize-identifier
31105 objc-synthesize-identifier-list, objc-synthesize-identifier
31107 objc-synthesize-identifier
31108 identifier
31109 identifier = identifier
31111 For example:
31112 @synthesize MyProperty;
31113 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31115 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31116 for C. Keep them in sync.
31117 */
31118 static void
31120 {
31122 location_t loc;
31127 {
31131 {
31134 }
31136 {
31140 {
31143 }
31144 }
31145 else
31150 else
31152 }
31155 }
31157 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31159 objc-dynamic-declaration:
31160 @dynamic identifier-list ;
31162 For example:
31163 @dynamic MyProperty;
31164 @dynamic MyProperty, AnotherProperty;
31166 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31167 for C. Keep them in sync.
31168 */
31169 static void
31171 {
31173 location_t loc;
31178 {
31179 tree property;
31182 {
31185 }
31189 else
31191 }
31194 }
31196 \f
31197 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31199 /* Returns name of the next clause.
31200 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31201 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31202 returned and the token is consumed. */
31204 static pragma_omp_clause
31206 {
31222 {
31227 {
31410 }
31411 }
31417 }
31419 /* Validate that a clause of the given type does not already exist. */
31421 static void
31424 {
31425 tree c;
31429 {
31432 }
31433 }
31435 /* OpenMP 2.5:
31436 variable-list:
31437 identifier
31438 variable-list , identifier
31440 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31441 colon). An opening parenthesis will have been consumed by the caller.
31443 If KIND is nonzero, create the appropriate node and install the decl
31444 in OMP_CLAUSE_DECL and add the node to the head of the list.
31446 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31447 return the list created.
31449 COLON can be NULL if only closing parenthesis should end the list,
31450 or pointer to bool which will receive false if the list is terminated
31451 by closing parenthesis or true if the list is terminated by colon. */
31453 static tree
31456 {
31460 {
31463 }
31465 {
31470 && current_class_ptr
31472 {
31478 }
31479 else
31480 {
31493 }
31495 ;
31497 {
31499 {
31501 /* The OpenACC cache directive explicitly only allows "array
31502 elements or subarrays". */
31504 {
31508 }
31509 /* FALLTHROUGH. */
31514 {
31515 location_t loc
31520 decl
31524 }
31525 /* FALLTHROUGH. */
31529 {
31537 parser->colon_corrects_to_scope_p
31541 else
31542 {
31543 /* Look for `:'. */
31547 CPP_CLOSE_SQUARE))
31549 }
31550 /* Look for the closing `]'. */
31552 RT_CLOSE_SQUARE))
31556 }
31560 }
31566 }
31567 else
31570 get_comma:
31574 }
31580 {
31584 }
31587 {
31590 /* Try to resync to an unnested comma. Copied from
31591 cp_parser_parenthesized_expression_list. */
31592 skip_comma:
31601 }
31604 }
31606 /* Similarly, but expect leading and trailing parenthesis. This is a very
31607 common case for omp clauses. */
31609 static tree
31611 {
31615 }
31617 /* OpenACC 2.0:
31618 copy ( variable-list )
31619 copyin ( variable-list )
31620 copyout ( variable-list )
31621 create ( variable-list )
31622 delete ( variable-list )
31623 present ( variable-list )
31624 present_or_copy ( variable-list )
31625 pcopy ( variable-list )
31626 present_or_copyin ( variable-list )
31627 pcopyin ( variable-list )
31628 present_or_copyout ( variable-list )
31629 pcopyout ( variable-list )
31630 present_or_create ( variable-list )
31631 pcreate ( variable-list ) */
31633 static tree
31635 tree list)
31636 {
31639 {
31685 }
31693 }
31695 /* OpenACC 2.0:
31696 deviceptr ( variable-list ) */
31698 static tree
31700 {
31704 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31705 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31706 variable-list must only allow for pointer variables. */
31709 {
31716 }
31719 }
31721 /* OpenACC 2.0:
31722 auto
31723 independent
31724 nohost
31725 seq */
31727 static tree
31731 {
31736 }
31738 /* OpenACC:
31739 num_gangs ( expression )
31740 num_workers ( expression )
31741 vector_length ( expression ) */
31743 static tree
31746 {
31749 matching_parens parens;
31757 {
31762 }
31770 }
31772 /* OpenACC:
31774 gang [( gang-arg-list )]
31775 worker [( [num:] int-expr )]
31776 vector [( [length:] int-expr )]
31778 where gang-arg is one of:
31780 [num:] int-expr
31781 static: size-expr
31783 and size-expr may be:
31785 *
31786 int-expr
31787 */
31789 static tree
31792 {
31802 {
31803 matching_parens parens;
31806 do
31807 {
31811 /* Gang static argument. */
31814 {
31822 {
31825 }
31827 /* Check for the '*' argument. */
31831 CPP_CLOSE_PAREN)))
31832 {
31837 {
31840 }
31842 }
31843 }
31844 /* Worker num: argument and vector length: arguments. */
31848 {
31851 }
31853 /* Now collect the actual argument. */
31855 {
31858 }
31870 {
31873 }
31875 }
31880 }
31894 cleanup_error:
31897 }
31899 /* OpenACC 2.0:
31900 tile ( size-expr-list ) */
31902 static tree
31904 {
31908 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31909 so, but the spec authors never considered such a case and have
31910 differing opinions on what it might mean, including 'not
31911 allowed'.) */
31914 clause_loc);
31919 do
31920 {
31927 {
31930 }
31931 else
31935 }
31938 /* Consume the trailing ')'. */
31946 }
31948 /* OpenACC 2.0
31949 Parse wait clause or directive parameters. */
31951 static tree
31953 {
31963 {
31968 }
31975 {
31979 {
31982 else
31983 {
31990 }
31991 }
31992 }
31995 }
31997 /* OpenACC:
31998 wait ( int-expr-list ) */
32000 static tree
32002 {
32011 }
32013 /* OpenMP 3.0:
32014 collapse ( constant-expression ) */
32016 static tree
32018 {
32020 location_t loc;
32021 HOST_WIDE_INT n;
32024 matching_parens parens;
32042 {
32045 }
32054 }
32056 /* OpenMP 2.5:
32057 default ( none | shared )
32059 OpenACC:
32060 default ( none | present ) */
32062 static tree
32065 {
32067 tree c;
32069 matching_parens parens;
32073 {
32078 {
32099 }
32102 }
32103 else
32104 {
32105 invalid_kind:
32108 else
32110 }
32127 }
32129 /* OpenMP 3.1:
32130 final ( expression ) */
32132 static tree
32134 {
32137 matching_parens parens;
32156 }
32158 /* OpenMP 2.5:
32159 if ( expression )
32161 OpenMP 4.5:
32162 if ( directive-name-modifier : expression )
32164 directive-name-modifier:
32165 parallel | task | taskloop | target data | target | target update
32166 | target enter data | target exit data */
32168 static tree
32171 {
32175 matching_parens parens;
32180 {
32192 {
32195 {
32208 else
32209 {
32210 location_t loc
32215 }
32218 {
32220 {
32225 }
32227 {
32228 location_t loc
32232 }
32233 }
32234 }
32235 }
32237 {
32239 {
32242 }
32243 else
32244 {
32246 {
32247 location_t loc
32250 }
32252 }
32253 }
32254 }
32266 {
32269 {
32272 {
32282 }
32284 p);
32286 }
32288 {
32291 else
32294 }
32297 {
32301 }
32302 }
32310 }
32312 /* OpenMP 3.1:
32313 mergeable */
32315 static tree
32318 {
32319 tree c;
32322 location);
32327 }
32329 /* OpenMP 2.5:
32330 nowait */
32332 static tree
32335 {
32336 tree c;
32343 }
32345 /* OpenMP 2.5:
32346 num_threads ( expression ) */
32348 static tree
32350 location_t location)
32351 {
32354 matching_parens parens;
32374 }
32376 /* OpenMP 4.5:
32377 num_tasks ( expression ) */
32379 static tree
32381 location_t location)
32382 {
32385 matching_parens parens;
32405 }
32407 /* OpenMP 4.5:
32408 grainsize ( expression ) */
32410 static tree
32412 location_t location)
32413 {
32416 matching_parens parens;
32436 }
32438 /* OpenMP 4.5:
32439 priority ( expression ) */
32441 static tree
32443 location_t location)
32444 {
32447 matching_parens parens;
32467 }
32469 /* OpenMP 4.5:
32470 hint ( expression ) */
32472 static tree
32474 location_t location)
32475 {
32478 matching_parens parens;
32497 }
32499 /* OpenMP 4.5:
32500 defaultmap ( tofrom : scalar ) */
32502 static tree
32504 location_t location)
32505 {
32509 matching_parens parens;
32514 {
32517 }
32521 {
32524 }
32530 {
32533 }
32537 {
32540 }
32546 location);
32552 out_err:
32557 }
32559 /* OpenMP 2.5:
32560 ordered
32562 OpenMP 4.5:
32563 ordered ( constant-expression ) */
32565 static tree
32568 {
32570 HOST_WIDE_INT n;
32576 {
32577 matching_parens parens;
32594 {
32596 "ordered argument needs positive constant integer "
32599 }
32600 }
32606 }
32608 /* OpenMP 2.5:
32609 reduction ( reduction-operator : variable-list )
32611 reduction-operator:
32612 One of: + * - & ^ | && ||
32614 OpenMP 3.1:
32616 reduction-operator:
32617 One of: + * - & ^ | && || min max
32619 OpenMP 4.0:
32621 reduction-operator:
32622 One of: + * - & ^ | && ||
32623 id-expression */
32625 static tree
32627 {
32635 {
32645 }
32649 else
32650 {
32661 {
32691 }
32692 else
32693 {
32695 resync_fail:
32700 }
32701 }
32707 NULL);
32709 {
32712 }
32715 }
32717 /* OpenMP 2.5:
32718 schedule ( schedule-kind )
32719 schedule ( schedule-kind , expression )
32721 schedule-kind:
32722 static | dynamic | guided | runtime | auto
32724 OpenMP 4.5:
32725 schedule ( schedule-modifier : schedule-kind )
32726 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32728 schedule-modifier:
32729 simd
32730 monotonic
32731 nonmonotonic */
32733 static tree
32735 {
32739 matching_parens parens;
32746 {
32755 else
32761 else
32762 {
32765 }
32766 }
32769 {
32774 {
32795 }
32796 }
32801 else
32807 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32809 {
32813 }
32816 {
32831 else
32836 }
32848 invalid_kind:
32850 resync_fail:
32855 }
32857 /* OpenMP 3.0:
32858 untied */
32860 static tree
32863 {
32864 tree c;
32871 }
32873 /* OpenMP 4.0:
32874 inbranch
32875 notinbranch */
32877 static tree
32880 {
32885 }
32887 /* OpenMP 4.0:
32888 parallel
32889 for
32890 sections
32891 taskgroup */
32893 static tree
32897 {
32901 }
32903 /* OpenMP 4.5:
32904 nogroup */
32906 static tree
32909 {
32914 }
32916 /* OpenMP 4.5:
32917 simd
32918 threads */
32920 static tree
32924 {
32929 }
32931 /* OpenMP 4.0:
32932 num_teams ( expression ) */
32934 static tree
32936 location_t location)
32937 {
32940 matching_parens parens;
32960 }
32962 /* OpenMP 4.0:
32963 thread_limit ( expression ) */
32965 static tree
32967 location_t location)
32968 {
32971 matching_parens parens;
32991 }
32993 /* OpenMP 4.0:
32994 aligned ( variable-list )
32995 aligned ( variable-list : constant-expression ) */
32997 static tree
32999 {
33003 matching_parens parens;
33011 {
33021 }
33027 }
33029 /* OpenMP 4.0:
33030 linear ( variable-list )
33031 linear ( variable-list : expression )
33033 OpenMP 4.5:
33034 linear ( modifier ( variable-list ) )
33035 linear ( modifier ( variable-list ) : expression ) */
33037 static tree
33040 {
33045 matching_parens parens;
33051 {
33063 else
33065 }
33070 else
33071 {
33080 }
33083 {
33088 {
33099 {
33102 }
33105 }
33110 {
33113 }
33121 }
33124 {
33127 }
33130 }
33132 /* OpenMP 4.0:
33133 safelen ( constant-expression ) */
33135 static tree
33137 location_t location)
33138 {
33141 matching_parens parens;
33160 }
33162 /* OpenMP 4.0:
33163 simdlen ( constant-expression ) */
33165 static tree
33167 location_t location)
33168 {
33171 matching_parens parens;
33190 }
33192 /* OpenMP 4.5:
33193 vec:
33194 identifier [+/- integer]
33195 vec , identifier [+/- integer]
33196 */
33198 static tree
33200 tree list)
33201 {
33205 {
33208 }
33211 {
33218 else
33219 {
33220 t = cp_parser_lookup_name_simple
33225 id_loc);
33226 }
33232 {
33235 }
33239 {
33242 }
33246 {
33249 }
33252 add_to_vector:
33254 {
33258 }
33264 }
33267 {
33273 }
33275 }
33277 /* OpenMP 4.0:
33278 depend ( depend-kind : variable-list )
33280 depend-kind:
33281 in | out | inout
33283 OpenMP 4.5:
33284 depend ( source )
33286 depend ( sink : vec ) */
33288 static tree
33290 {
33294 matching_parens parens;
33299 {
33313 else
33315 }
33316 else
33322 {
33332 }
33339 else
33340 {
33346 }
33349 invalid_kind:
33351 resync_fail:
33356 }
33358 /* OpenMP 4.0:
33359 map ( map-kind : variable-list )
33360 map ( variable-list )
33362 map-kind:
33363 alloc | to | from | tofrom
33365 OpenMP 4.5:
33366 map-kind:
33367 alloc | to | from | tofrom | release | delete
33369 map ( always [,] map-kind: variable-list ) */
33371 static tree
33373 {
33382 {
33387 {
33390 nth++;
33396 {
33401 }
33402 }
33403 }
33407 {
33421 else
33422 {
33428 }
33431 }
33434 {
33438 }
33441 NULL);
33447 }
33449 /* OpenMP 4.0:
33450 device ( expression ) */
33452 static tree
33454 location_t location)
33455 {
33458 matching_parens parens;
33478 }
33480 /* OpenMP 4.0:
33481 dist_schedule ( static )
33482 dist_schedule ( static , expression ) */
33484 static tree
33486 location_t location)
33487 {
33490 matching_parens parens;
33501 {
33512 }
33517 location);
33521 invalid_kind:
33523 resync_fail:
33528 }
33530 /* OpenMP 4.0:
33531 proc_bind ( proc-bind-kind )
33533 proc-bind-kind:
33534 master | close | spread */
33536 static tree
33538 location_t location)
33539 {
33540 tree c;
33547 {
33557 else
33559 }
33560 else
33569 location);
33574 invalid_kind:
33576 resync_fail:
33581 }
33583 /* OpenACC:
33584 async [( int-expr )] */
33586 static tree
33588 {
33595 {
33596 matching_parens parens;
33605 }
33615 }
33617 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33618 is a bitmask in MASK. Return the list of clauses found. */
33620 static tree
33624 {
33629 {
33630 location_t here;
33631 pragma_omp_clause c_kind;
33632 omp_clause_code code;
33643 {
33695 clauses);
33713 OMP_CLAUSE_INDEPENDENT,
33725 clauses);
33731 clauses);
33755 clauses);
33777 clauses);
33789 clauses);
33803 }
33808 {
33809 /* Remove the invalid clause(s) from the list to avoid
33810 confusing the rest of the compiler. */
33813 }
33814 }
33816 saw_error:
33823 }
33825 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33826 is a bitmask in MASK. Return the list of clauses found; the result
33827 of clause default goes in *pdefault. */
33829 static tree
33833 {
33839 {
33840 pragma_omp_clause c_kind;
33851 {
33863 clauses);
33877 clauses);
33897 clauses);
33902 clauses);
33912 clauses);
33946 clauses);
33960 clauses);
33977 OMP_CLAUSE_NOTINBRANCH,
33986 {
33987 clause_not_first:
33991 }
34021 clauses);
34022 else
34032 clauses);
34050 {
34058 }
34101 clauses
34107 clauses
34119 }
34124 {
34125 /* Remove the invalid clause(s) from the list to avoid
34126 confusing the rest of the compiler. */
34129 }
34130 }
34131 saw_error:
34132 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
34133 no reason to skip to the end. */
34137 {
34140 else
34142 }
34144 }
34146 /* OpenMP 2.5:
34147 structured-block:
34148 statement
34150 In practice, we're also interested in adding the statement to an
34151 outer node. So it is convenient if we work around the fact that
34152 cp_parser_statement calls add_stmt. */
34154 static unsigned
34156 {
34159 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34160 This preserves the "not within loop or switch" style error messages
34161 for nonsense cases like
34162 void foo() {
34163 #pragma omp single
34164 break;
34165 }
34166 */
34171 }
34173 static void
34175 {
34177 }
34179 static tree
34181 {
34189 }
34191 /* OpenMP 2.5:
34192 # pragma omp atomic new-line
34193 expression-stmt
34195 expression-stmt:
34196 x binop= expr | x++ | ++x | x-- | --x
34197 binop:
34198 +, *, -, /, &, ^, |, <<, >>
34200 where x is an lvalue expression with scalar type.
34202 OpenMP 3.1:
34203 # pragma omp atomic new-line
34204 update-stmt
34206 # pragma omp atomic read new-line
34207 read-stmt
34209 # pragma omp atomic write new-line
34210 write-stmt
34212 # pragma omp atomic update new-line
34213 update-stmt
34215 # pragma omp atomic capture new-line
34216 capture-stmt
34218 # pragma omp atomic capture new-line
34219 capture-block
34221 read-stmt:
34222 v = x
34223 write-stmt:
34224 x = expr
34225 update-stmt:
34226 expression-stmt | x = x binop expr
34227 capture-stmt:
34228 v = expression-stmt
34229 capture-block:
34230 { v = x; update-stmt; } | { update-stmt; v = x; }
34232 OpenMP 4.0:
34233 update-stmt:
34234 expression-stmt | x = x binop expr | x = expr binop x
34235 capture-stmt:
34236 v = update-stmt
34237 capture-block:
34238 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34240 where x and v are lvalue expressions with scalar type. */
34242 static void
34244 {
34252 {
34257 {
34263 }
34264 }
34266 {
34278 else
34282 }
34284 {
34290 {
34295 {
34298 }
34299 }
34300 }
34304 {
34314 else
34319 {
34320 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34321 opcode. */
34326 }
34330 {
34333 }
34334 else
34335 {
34341 }
34344 }
34346 restart:
34350 {
34357 /* FALLTHROUGH */
34367 /* FALLTHROUGH */
34382 /* Undo effects of boolean_increment for post {in,de}crement. */
34384 /* FALLTHRU */
34388 {
34389 /* Undo effects of boolean_increment. */
34391 {
34392 /* This is pre or post increment. */
34397 && !structured_block
34401 }
34402 }
34403 /* FALLTHRU */
34406 {
34441 {
34445 }
34448 {
34454 {
34459 }
34461 {
34473 {
34475 {
34480 }
34481 else
34483 }
34487 }
34490 {
34497 }
34501 }
34505 {
34508 {
34516 }
34518 {
34523 }
34558 }
34569 /* FALLTHROUGH */
34574 }
34581 }
34582 stmt_done:
34584 {
34595 }
34597 {
34600 }
34601 done:
34607 saw_error:
34610 {
34614 {
34618 }
34619 }
34620 }
34623 /* OpenMP 2.5:
34624 # pragma omp barrier new-line */
34626 static void
34628 {
34631 }
34633 /* OpenMP 2.5:
34634 # pragma omp critical [(name)] new-line
34635 structured-block
34637 OpenMP 4.5:
34638 # pragma omp critical [(name) [hint(expression)]] new-line
34639 structured-block */
34641 #define OMP_CRITICAL_CLAUSE_MASK \
34642 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34644 static tree
34646 {
34650 {
34651 matching_parens parens;
34665 OMP_CRITICAL_CLAUSE_MASK,
34667 }
34668 else
34673 }
34675 /* OpenMP 2.5:
34676 # pragma omp flush flush-vars[opt] new-line
34678 flush-vars:
34679 ( variable-list ) */
34681 static void
34683 {
34689 }
34691 /* Helper function, to parse omp for increment expression. */
34693 static tree
34695 {
34700 {
34703 }
34706 {
34715 /* Fall through: OpenMP disallows NE_EXPR. */
34719 }
34721 /* If decl is an iterator, preserve LHS and RHS of the relational
34722 expr until finish_omp_for. */
34733 }
34735 /* Helper function, to parse omp for increment expression. */
34737 static tree
34739 {
34743 cp_id_kind idk;
34747 {
34756 }
34765 {
34770 }
34777 {
34781 }
34794 do
34795 {
34802 {
34804 {
34807 else
34809 tf_warning_or_error);
34810 }
34811 else
34814 }
34815 }
34819 {
34825 }
34826 else
34830 }
34832 /* Parse the initialization statement of either an OpenMP for loop or
34833 a Cilk Plus for loop.
34835 Return true if the resulting construct should have an
34836 OMP_CLAUSE_PRIVATE added to it. */
34838 static tree
34847 {
34853 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34855 init-expr:
34856 var = lb
34857 integer-type var = lb
34858 random-access-iterator-type var = lb
34859 pointer-type var = lb
34860 */
34861 cp_decl_specifier_seq type_specifiers;
34863 /* First, try to parse as an initialized declaration. See
34864 cp_parser_condition, from whence the bulk of this is copied. */
34871 {
34872 /* If parsing a type specifier seq succeeded, then this
34873 MUST be a initialized declaration. */
34878 CP_PARSER_DECLARATOR_NAMED,
34889 else
34890 {
34900 {
34902 CPP_OPEN_PAREN))
34903 {
34907 else
34910 }
34911 else
34912 /* Trigger an error. */
34917 }
34921 {
34929 {
34932 auto_node);
34937 }
34940 asm_specification,
34941 LOOKUP_ONLYCONVERTING);
34944 {
34947 }
34948 else
34949 {
34952 {
34954 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34956 {
34960 {
34964 }
34966 }
34968 {
34973 }
34974 }
34975 }
34977 }
34978 else
34979 {
34980 /* Consume '='. */
34984 non_class:
34987 else
34990 asm_specification,
34991 LOOKUP_ONLYCONVERTING);
34992 }
34996 }
34997 }
34998 else
34999 {
35000 cp_id_kind idk;
35001 /* If parsing a type specifier sequence failed, then
35002 this MUST be a simple expression. */
35011 && decl
35014 {
35025 {
35030 }
35035 }
35037 && decl
35040 {
35041 tree rhs;
35049 rhs,
35050 tf_warning_or_error));
35053 }
35054 else
35055 {
35060 {
35064 }
35065 }
35066 }
35068 }
35070 /* Parse the restricted form of the for statement allowed by OpenMP. */
35072 static tree
35075 {
35079 location_t loc_first;
35090 {
35093 }
35096 {
35099 }
35102 {
35108 }
35110 {
35113 {
35115 "%<linear%> clause may not be specified together "
35118 }
35119 else
35121 }
35134 {
35137 location_t loc;
35141 {
35145 }
35148 {
35152 }
35155 matching_parens parens;
35162 add_private_clause
35169 {
35172 {
35178 }
35179 else
35181 }
35188 {
35193 {
35197 }
35200 {
35201 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35205 {
35208 }
35209 else
35210 {
35213 }
35215 }
35216 else
35217 {
35222 }
35223 }
35226 {
35227 tree c;
35229 {
35238 decl);
35242 decl);
35243 }
35245 {
35250 else
35255 {
35258 /* For linear, signal that we need to fill up
35259 the so far unknown linear step. */
35262 }
35263 }
35264 }
35273 {
35274 /* If decl is an iterator, preserve the operator on decl
35275 until finish_omp_for. */
35277 && ((processing_template_decl
35282 else
35286 }
35298 {
35301 }
35306 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35307 in between the collapsed for loops to be still considered perfectly
35308 nested. Hopefully the final version clarifies this.
35309 For now handle (multiple) {'s and empty statements. */
35312 {
35316 {
35318 bracecount++;
35319 }
35323 else
35324 {
35331 }
35332 }
35335 {
35338 }
35339 }
35344 /* Note that we saved the original contents of this flag when we entered
35345 the structured block, and so we don't need to re-save it here. */
35348 else
35351 /* Note that the grammar doesn't call for a structured block here,
35352 though the loop as a whole is a structured block. */
35359 else
35364 {
35366 {
35368 nbraces--;
35369 }
35372 else
35373 {
35375 {
35378 }
35383 }
35384 }
35387 {
35391 else
35393 }
35397 }
35399 /* Helper function for OpenMP parsing, split clauses and call
35400 finish_omp_clauses on each of the set of clauses afterwards. */
35402 static void
35405 {
35411 }
35413 /* OpenMP 4.0:
35414 #pragma omp simd simd-clause[optseq] new-line
35415 for-loop */
35417 #define OMP_SIMD_CLAUSE_MASK \
35418 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35427 static tree
35431 {
35442 {
35446 OMP_CLAUSE_ORDERED);
35448 {
35450 "%<ordered%> clause with parameter may not be specified "
35453 }
35454 }
35465 }
35467 /* OpenMP 2.5:
35468 #pragma omp for for-clause[optseq] new-line
35469 for-loop
35471 OpenMP 4.0:
35472 #pragma omp for simd for-simd-clause[optseq] new-line
35473 for-loop */
35475 #define OMP_FOR_CLAUSE_MASK \
35476 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35486 static tree
35490 {
35497 /* parallel for{, simd} disallows nowait clause, but for
35498 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35501 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35506 {
35511 {
35535 }
35536 }
35538 {
35541 }
35543 /* Composite distribute parallel for disallows linear clause. */
35550 {
35553 }
35564 }
35566 /* OpenMP 2.5:
35567 # pragma omp master new-line
35568 structured-block */
35570 static tree
35572 {
35576 }
35578 /* OpenMP 2.5:
35579 # pragma omp ordered new-line
35580 structured-block
35582 OpenMP 4.5:
35583 # pragma omp ordered ordered-clauses new-line
35584 structured-block */
35586 #define OMP_ORDERED_CLAUSE_MASK \
35587 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35590 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35591 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35593 static bool
35596 {
35600 {
35605 {
35607 {
35610 }
35612 {
35614 "%<depend%> clause may only be used in compound "
35618 }
35619 tree clauses
35621 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35625 }
35626 }
35628 tree clauses
35639 }
35641 /* OpenMP 2.5:
35643 section-scope:
35644 { section-sequence }
35646 section-sequence:
35647 section-directive[opt] structured-block
35648 section-sequence section-directive structured-block */
35650 static tree
35652 {
35657 matching_braces braces;
35665 {
35669 }
35672 {
35680 {
35684 }
35686 {
35689 }
35694 }
35705 }
35707 /* OpenMP 2.5:
35708 # pragma omp sections sections-clause[optseq] newline
35709 sections-scope */
35711 #define OMP_SECTIONS_CLAUSE_MASK \
35712 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35718 static tree
35721 {
35733 {
35736 }
35743 }
35745 /* OpenMP 2.5:
35746 # pragma omp parallel parallel-clause[optseq] new-line
35747 structured-block
35748 # pragma omp parallel for parallel-for-clause[optseq] new-line
35749 structured-block
35750 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35751 structured-block
35753 OpenMP 4.0:
35754 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35755 structured-block */
35757 #define OMP_PARALLEL_CLAUSE_MASK \
35758 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35768 static tree
35772 {
35779 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35785 {
35793 if_p);
35797 if_p);
35800 block);
35805 }
35806 /* When combined with distribute, parallel has to be followed by for.
35807 #pragma omp target parallel is allowed though. */
35811 {
35815 }
35817 {
35820 }
35822 {
35826 {
35836 block);
35839 }
35840 }
35845 {
35848 }
35856 }
35858 /* OpenMP 2.5:
35859 # pragma omp single single-clause[optseq] new-line
35860 structured-block */
35862 #define OMP_SINGLE_CLAUSE_MASK \
35863 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35868 static tree
35870 {
35880 }
35882 /* OpenMP 3.0:
35883 # pragma omp task task-clause[optseq] new-line
35884 structured-block */
35886 #define OMP_TASK_CLAUSE_MASK \
35887 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35898 static tree
35900 {
35911 }
35913 /* OpenMP 3.0:
35914 # pragma omp taskwait new-line */
35916 static void
35918 {
35921 }
35923 /* OpenMP 3.1:
35924 # pragma omp taskyield new-line */
35926 static void
35928 {
35931 }
35933 /* OpenMP 4.0:
35934 # pragma omp taskgroup new-line
35935 structured-block */
35937 static tree
35939 {
35943 if_p));
35944 }
35947 /* OpenMP 2.5:
35948 # pragma omp threadprivate (variable-list) */
35950 static void
35952 {
35953 tree vars;
35959 }
35961 /* OpenMP 4.0:
35962 # pragma omp cancel cancel-clause[optseq] new-line */
35964 #define OMP_CANCEL_CLAUSE_MASK \
35965 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35971 static void
35973 {
35977 }
35979 /* OpenMP 4.0:
35980 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35982 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35983 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35988 static void
35991 {
35992 tree clauses;
35996 {
36001 {
36004 }
36005 }
36007 {
36011 }
36014 {
36019 else
36023 }
36026 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36028 pragma_tok);
36030 }
36032 /* OpenMP 4.0:
36033 #pragma omp distribute distribute-clause[optseq] new-line
36034 for-loop */
36036 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36037 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36043 static tree
36047 {
36056 {
36064 else
36067 {
36073 {
36077 else
36080 }
36086 else
36100 }
36101 }
36103 {
36106 }
36111 {
36114 }
36125 }
36127 /* OpenMP 4.0:
36128 # pragma omp teams teams-clause[optseq] new-line
36129 structured-block */
36131 #define OMP_TEAMS_CLAUSE_MASK \
36132 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36140 static tree
36144 {
36153 {
36157 {
36182 }
36183 }
36185 {
36188 }
36193 {
36196 }
36205 }
36207 /* OpenMP 4.0:
36208 # pragma omp target data target-data-clause[optseq] new-line
36209 structured-block */
36211 #define OMP_TARGET_DATA_CLAUSE_MASK \
36212 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36217 static tree
36219 {
36220 tree clauses
36225 {
36228 {
36245 "%<#pragma omp target data%> with map-type other "
36246 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36250 }
36252 }
36255 {
36258 "%<#pragma omp target data%> must contain at least "
36261 }
36272 }
36274 /* OpenMP 4.5:
36275 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36276 structured-block */
36278 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36285 static tree
36288 {
36291 {
36296 {
36299 }
36300 }
36302 {
36306 }
36309 {
36315 }
36317 tree clauses
36322 {
36325 {
36338 "%<#pragma omp target enter data%> with map-type other "
36342 }
36344 }
36347 {
36350 "%<#pragma omp target enter data%> must contain at least "
36353 }
36360 }
36362 /* OpenMP 4.5:
36363 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36364 structured-block */
36366 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36367 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36373 static tree
36376 {
36379 {
36384 {
36387 }
36388 }
36390 {
36394 }
36397 {
36403 }
36405 tree clauses
36410 {
36413 {
36427 "%<#pragma omp target exit data%> with map-type other "
36428 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36432 }
36434 }
36437 {
36440 "%<#pragma omp target exit data%> must contain at least "
36443 }
36450 }
36452 /* OpenMP 4.0:
36453 # pragma omp target update target-update-clause[optseq] new-line */
36455 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36456 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36463 static bool
36466 {
36468 {
36474 }
36476 tree clauses
36481 {
36483 "%<#pragma omp target update%> must contain at least one "
36486 }
36494 }
36496 /* OpenMP 4.0:
36497 # pragma omp target target-clause[optseq] new-line
36498 structured-block */
36500 #define OMP_TARGET_CLAUSE_MASK \
36501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36511 static bool
36514 {
36518 {
36530 {
36538 {
36539 tree stmt;
36541 {
36544 OMP_TARGET_CLAUSE_MASK,
36549 OMP_TARGET_CLAUSE_MASK,
36554 OMP_TARGET_CLAUSE_MASK,
36559 }
36561 }
36566 {
36570 if_p);
36575 if_p);
36580 if_p);
36584 }
36590 {
36591 /* For combined target teams, ensure the num_teams and
36592 thread_limit clause expressions are evaluated on the host,
36593 before entering the target construct. */
36594 tree c;
36600 {
36609 OMP_CLAUSE_FIRSTPRIVATE);
36614 }
36615 }
36625 }
36627 {
36630 }
36632 {
36636 }
36638 {
36642 }
36644 {
36648 }
36650 {
36653 }
36654 }
36656 {
36659 }
36674 check_clauses:
36676 {
36679 {
36693 "%<#pragma omp target%> with map-type other "
36694 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36698 }
36700 }
36702 }
36704 /* OpenACC 2.0:
36705 # pragma acc cache (variable-list) new-line
36706 */
36708 static tree
36710 {
36725 }
36727 /* OpenACC 2.0:
36728 # pragma acc data oacc-data-clause[optseq] new-line
36729 structured-block */
36731 #define OACC_DATA_CLAUSE_MASK \
36732 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36744 static tree
36746 {
36759 }
36761 /* OpenACC 2.0:
36762 # pragma acc host_data <clauses> new-line
36763 structured-block */
36765 #define OACC_HOST_DATA_CLAUSE_MASK \
36766 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36768 static tree
36770 {
36783 }
36785 /* OpenACC 2.0:
36786 # pragma acc declare oacc-data-clause[optseq] new-line
36787 */
36789 #define OACC_DECLARE_CLAUSE_MASK \
36790 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36803 static tree
36805 {
36814 {
36818 }
36821 {
36825 {
36829 }
36832 {
36844 {
36846 "%qD must be a global variable in "
36848 decl);
36851 }
36856 {
36860 }
36862 {
36864 "invalid use of %<extern%> variable %qD "
36868 }
36870 {
36872 "invalid use of %<global%> variable %qD "
36876 }
36878 }
36883 {
36888 }
36891 {
36892 tree id;
36896 else
36902 {
36905 {
36908 {
36912 }
36913 }
36914 }
36915 }
36916 }
36929 }
36931 /* OpenACC 2.0:
36932 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36934 or
36936 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36938 LOC is the location of the #pragma token.
36939 */
36941 #define OACC_ENTER_DATA_CLAUSE_MASK \
36942 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36950 #define OACC_EXIT_DATA_CLAUSE_MASK \
36951 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36952 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36953 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36957 static tree
36960 {
36969 {
36974 }
36981 else
36986 {
36990 }
36998 }
37000 /* OpenACC 2.0:
37001 # pragma acc loop oacc-loop-clause[optseq] new-line
37002 structured-block */
37004 #define OACC_LOOP_CLAUSE_MASK \
37005 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37016 static tree
37019 {
37028 {
37034 }
37043 }
37045 /* OpenACC 2.0:
37046 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37047 structured-block
37049 or
37051 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37052 structured-block
37053 */
37055 #define OACC_KERNELS_CLAUSE_MASK \
37056 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37074 #define OACC_PARALLEL_CLAUSE_MASK \
37075 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37096 static tree
37099 {
37100 omp_clause_mask mask;
37103 {
37116 }
37119 {
37123 {
37126 tree clauses;
37128 if_p);
37130 }
37131 }
37140 }
37142 /* OpenACC 2.0:
37143 # pragma acc update oacc-update-clause[optseq] new-line
37144 */
37146 #define OACC_UPDATE_CLAUSE_MASK \
37147 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37154 static tree
37156 {
37163 {
37165 "%<#pragma acc update%> must contain at least one "
37168 }
37176 }
37178 /* OpenACC 2.0:
37179 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37181 LOC is the location of the #pragma token.
37182 */
37184 #define OACC_WAIT_CLAUSE_MASK \
37185 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37187 static tree
37189 {
37203 }
37205 /* OpenMP 4.0:
37206 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37208 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37209 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37216 static void
37219 {
37221 cp_omp_declare_simd_data data;
37223 {
37228 /* It is safe to take the address of a local variable; it will only be
37229 used while this scope is live. */
37231 }
37233 /* Store away all pragma tokens. */
37245 {
37249 {
37262 }
37267 "%<#pragma omp declare simd%> not immediately followed by "
37271 }
37272 }
37274 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
37275 This function is modelled similar to the late parsing of omp declare
37276 simd. */
37278 static tree
37280 {
37287 {
37289 "used in the same function marked as a Cilk Plus SIMD-enabled "
37295 }
37297 {
37301 }
37306 {
37313 NULL);
37327 }
37333 }
37335 /* Finalize #pragma omp declare simd clauses after direct declarator has
37336 been parsed, and put that into "omp declare simd" attribute. */
37338 static tree
37340 {
37346 {
37350 }
37355 {
37373 }
37377 }
37380 /* OpenMP 4.0:
37381 # pragma omp declare target new-line
37382 declarations and definitions
37383 # pragma omp end declare target new-line
37385 OpenMP 4.5:
37386 # pragma omp declare target ( extended-list ) new-line
37388 # pragma omp declare target declare-target-clauses[seq] new-line */
37390 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37394 static void
37396 {
37399 clauses
37403 {
37405 clauses);
37408 }
37409 else
37410 {
37414 }
37417 "%<#pragma omp declare target%> with clauses in between "
37418 "%<#pragma omp declare target%> without clauses and "
37421 {
37427 {
37430 }
37431 else
37434 {
37436 "%qD specified both in declare target %<link%> and %<to%>"
37439 }
37441 {
37448 {
37451 {
37455 }
37456 }
37457 }
37458 }
37459 }
37461 static void
37463 {
37466 {
37469 }
37471 {
37475 {
37478 }
37481 else
37482 {
37486 }
37487 }
37488 else
37489 {
37493 }
37497 "%<#pragma omp end declare target%> without corresponding "
37499 else
37501 }
37503 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37504 expression and optional initializer clause of
37505 #pragma omp declare reduction. We store the expression(s) as
37506 either 3, 6 or 7 special statements inside of the artificial function's
37507 body. The first two statements are DECL_EXPRs for the artificial
37508 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37509 expression that uses those variables.
37510 If there was any INITIALIZER clause, this is followed by further statements,
37511 the fourth and fifth statements are DECL_EXPRs for the artificial
37512 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37513 constructor variant (first token after open paren is not omp_priv),
37514 then the sixth statement is a statement with the function call expression
37515 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37516 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37517 to initialize the OMP_PRIV artificial variable and there is seventh
37518 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37520 static bool
37522 {
37534 tree combiner;
37549 {
37552 }
37555 {
37557 matching_parens parens;
37563 {
37566 }
37582 {
37586 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37590 == CPP_CLOSE_PAREN
37593 {
37597 }
37602 }
37603 else
37604 {
37620 {
37625 }
37627 tree arg;
37640 }
37651 }
37655 UNKNOWN_LOCATION);
37658 }
37660 /* OpenMP 4.0
37661 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37662 initializer-clause[opt] new-line
37664 initializer-clause:
37665 initializer (omp_priv initializer)
37666 initializer (function-name (argument-list)) */
37668 static void
37671 {
37681 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37688 {
37720 }
37732 /* Types may not be defined in declare reduction type list. */
37735 parser->type_definition_forbidden_message
37741 saved_colon_doesnt_start_class_def_p
37746 {
37750 ;
37769 else
37774 else
37776 }
37778 /* Restore the saved message. */
37781 parser->colon_doesnt_start_class_def_p
37786 {
37787 fail:
37790 }
37796 {
37797 tree fntype
37800 NULL_TREE);
37820 {
37825 }
37827 {
37829 {
37838 }
37845 }
37846 else
37847 {
37850 }
37853 else
37856 {
37859 }
37861 {
37864 else
37869 }
37874 else
37875 {
37884 }
37891 }
37895 done:
37896 /* Free any declarators allocated. */
37898 }
37900 /* OpenMP 4.0
37901 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37902 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37903 initializer-clause[opt] new-line
37904 #pragma omp declare target new-line */
37906 static void
37909 {
37911 {
37916 {
37919 context);
37921 }
37924 {
37927 context);
37929 }
37931 {
37934 }
37936 {
37940 }
37941 }
37945 }
37947 /* OpenMP 4.5:
37948 #pragma omp taskloop taskloop-clause[optseq] new-line
37949 for-loop
37951 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37952 for-loop */
37954 #define OMP_TASKLOOP_CLAUSE_MASK \
37955 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37970 static tree
37974 {
37983 {
37988 {
38012 }
38013 }
38015 {
38018 }
38023 {
38026 }
38032 if_p);
38038 }
38041 /* OpenACC 2.0:
38042 # pragma acc routine oacc-routine-clause[optseq] new-line
38043 function-definition
38045 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38046 */
38048 #define OACC_ROUTINE_CLAUSE_MASK \
38049 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38055 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38056 component, which must resolve to a declared namespace-scope
38057 function. The clauses are either processed directly (for a named
38058 function), or defered until the immediatley following declaration
38059 is parsed. */
38061 static void
38064 {
38066 /* The checking for "another pragma following this one" in the "no optional
38067 '( name )'" case makes sure that we dont re-enter. */
38070 cp_oacc_routine_data data;
38076 /* It is safe to take the address of a local variable; it will only be
38077 used while this scope is live. */
38080 /* Look for optional '( name )'. */
38082 {
38083 matching_parens parens;
38086 /* We parse the name as an id-expression. If it resolves to
38087 anything other than a non-overloaded function at namespace
38088 scope, it's an error. */
38102 {
38106 }
38108 data.clauses
38116 {
38121 }
38123 /* Perhaps we should use the same rule as declarations in different
38124 namespaces? */
38126 {
38131 }
38134 {
38138 }
38142 }
38144 {
38145 /* Store away all pragma tokens. */
38156 /* Emit a helpful diagnostic if there's another pragma following this
38157 one. */
38159 {
38162 /* ..., and then just keep going. */
38164 }
38166 /* We only have to consider the pragma_external case here. */
38171 else
38174 }
38175 }
38177 /* Finalize #pragma acc routine clauses after direct declarator has
38178 been parsed. */
38180 static tree
38182 {
38187 {
38189 "%<#pragma acc routine%> not immediately followed by "
38192 }
38209 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38210 fndecl_seen. */
38213 }
38215 /* Apply any saved OpenACC routine clauses to a just-parsed
38216 declaration. */
38218 static void
38220 {
38222 {
38223 /* Keep going if we're in error reporting mode. */
38229 {
38231 "%<#pragma acc routine%> not immediately followed by"
38235 }
38237 {
38240 }
38243 {
38248 }
38251 {
38259 }
38261 /* Process the routine's dimension clauses. */
38265 /* Add an "omp declare target" attribute. */
38270 /* Don't unset parser->oacc_routine here: we may still need it to
38271 diagnose wrong usage. But, remember that we've used this "#pragma acc
38272 routine". */
38274 }
38275 }
38277 /* Main entry point to OpenMP statement pragmas. */
38279 static void
38281 {
38282 tree stmt;
38287 {
38310 if_p);
38315 if_p);
38332 if_p);
38337 if_p);
38345 if_p);
38354 if_p);
38368 if_p);
38373 if_p);
38377 }
38380 }
38381 \f
38382 /* Transactional Memory parsing routines. */
38384 /* Parse a transaction attribute.
38386 txn-attribute:
38387 attribute
38388 [ [ identifier ] ]
38390 We use this instead of cp_parser_attributes_opt for transactions to avoid
38391 the pedwarn in C++98 mode. */
38393 static tree
38395 {
38410 {
38414 /* For keywords, use the canonical spelling,
38415 not the parsed identifier. */
38419 }
38420 else
38424 error1:
38427 }
38429 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38431 transaction-statement:
38432 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38433 compound-statement
38434 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38435 */
38437 static tree
38439 {
38450 else
38451 {
38455 }
38457 /* Parse a noexcept specification. */
38461 {
38462 /* cancel-and-throw is unimplemented. */
38465 }
38466 else
38469 /* Keep track if we're in the lexical scope of an outer transaction. */
38481 }
38483 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38485 transaction-expression:
38486 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38487 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38488 */
38490 static tree
38492 {
38505 keyword == RID_TRANSACTION_RELAXED
38519 /* Set this early. This might mean that we allow transaction_cancel in
38520 an expression that we find out later actually has to be a constexpr.
38521 However, we expect that cxx_constant_value will be able to deal with
38522 this; also, if the noexcept has no constexpr, then what we parse next
38523 really is a transaction's body. */
38526 /* Parse a noexcept specification. */
38532 {
38533 matching_parens parens;
38540 }
38541 else
38542 {
38543 /* The only expression that is available got parsed for the noexcept
38544 already. noexcept is true then. */
38547 }
38556 }
38558 /* Parse a function-transaction-block.
38560 function-transaction-block:
38561 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38562 function-body
38563 __transaction_atomic txn-attribute[opt] function-try-block
38564 __transaction_relaxed ctor-initializer[opt] function-body
38565 __transaction_relaxed function-try-block
38566 */
38568 static void
38570 {
38585 else
38586 {
38590 }
38598 else
38599 cp_parser_ctor_initializer_opt_and_function_body
38605 }
38607 /* Parse a __transaction_cancel statement.
38609 cancel-statement:
38610 __transaction_cancel txn-attribute[opt] ;
38611 __transaction_cancel txn-attribute[opt] throw-expression ;
38613 ??? Cancel and throw is not yet implemented. */
38615 static tree
38617 {
38623 RT_TRANSACTION_CANCEL);
38630 /* ??? Parse cancel-and-throw here. */
38635 {
38639 }
38641 {
38645 }
38647 {
38650 {
38656 }
38657 }
38659 {
38663 }
38669 }
38670 \f
38671 /* The parser. */
38675 \f
38676 /* Special handling for the first token or line in the file. The first
38677 thing in the file might be #pragma GCC pch_preprocess, which loads a
38678 PCH file, which is a GC collection point. So we need to handle this
38679 first pragma without benefit of an existing lexer structure.
38681 Always returns one token to the caller in *FIRST_TOKEN. This is
38682 either the true first token of the file, or the first token after
38683 the initial pragma. */
38685 static void
38687 {
38696 {
38703 }
38704 else
38707 /* Skip to the end of the pragma. */
38711 /* Now actually load the PCH file. */
38715 /* Read one more token to return to our caller. We have to do this
38716 after reading the PCH file in, since its pointers have to be
38717 live. */
38719 }
38721 /* Parses the grainsize pragma for the _Cilk_for statement.
38722 Syntax:
38723 #pragma cilk grainsize = <VALUE>. */
38725 static void
38727 {
38729 {
38734 {
38737 }
38739 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38742 else
38744 "%<#pragma cilk grainsize%> is not followed by "
38747 }
38749 }
38751 /* Normal parsing of a pragma token. Here we can (and must) use the
38752 regular lexer. */
38754 static bool
38756 {
38759 tree stmt;
38770 {
38778 {
38788 }
38793 {
38803 }
38808 {
38819 }
38824 {
38835 }
38840 {
38851 }
38872 {
38877 }
38885 {
38890 }
38898 {
38902 }
38908 {
38913 }
38921 {
38926 }
38981 "%<#pragma omp section%> may only be used in "
38986 {
38988 {
38992 }
38999 {
39002 }
39005 }
39009 {
39013 }
39021 {
39025 }
39027 /* Ignore the pragma if Cilk Plus is not enabled. */
39029 {
39032 }
39033 else
39034 {
39038 }
39045 bad_stmt:
39048 }
39052 }
39054 /* The interface the pragma parsers have to the lexer. */
39056 enum cpp_ttype
39058 {
39070 else
39071 {
39075 }
39078 }
39080 \f
39081 /* External interface. */
39083 /* Parse one entire translation unit. */
39085 void
39087 {
39100 }
39102 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
39103 vectorlength clause:
39104 Syntax:
39105 vectorlength ( constant-expression ) */
39107 static tree
39110 {
39112 tree expr;
39113 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
39114 safelen clause. Thus, vectorlength is represented as OMP 4.0
39115 safelen. For SIMD-enabled function it is represented by OMP 4.0
39116 simdlen. */
39119 loc);
39120 else
39122 loc);
39124 matching_parens parens;
39131 /* If expr == error_mark_node, then don't emit any errors nor
39132 create a clause. if any of the above functions returns
39133 error mark node then they would have emitted an error message. */
39135 ;
39143 else
39144 {
39145 tree c;
39147 {
39152 }
39153 else
39154 {
39159 }
39160 }
39165 }
39167 /* Handles the Cilk Plus #pragma simd linear clause.
39168 Syntax:
39169 linear ( simd-linear-variable-list )
39171 simd-linear-variable-list:
39172 simd-linear-variable
39173 simd-linear-variable-list , simd-linear-variable
39175 simd-linear-variable:
39176 id-expression
39177 id-expression : simd-linear-step
39179 simd-linear-step:
39180 conditional-expression */
39182 static tree
39184 {
39190 {
39194 }
39199 {
39202 {
39206 }
39213 {
39217 }
39218 else
39219 {
39223 /* If present, parse the linear step. Otherwise, assume the default
39224 value of 1. */
39226 {
39233 {
39234 /* If an error has occurred, then the whole pragma is
39235 considered ill-formed. Thus, no reason to keep
39236 parsing. */
39239 }
39247 else
39249 "step size must be an integer constant "
39251 }
39253 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
39259 }
39264 else
39265 {
39270 }
39271 }
39275 }
39277 /* Returns the name of the next clause. If the clause is not
39278 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
39279 token is not consumed. Otherwise, the appropriate enum from the
39280 pragma_simd_clause is returned and the token is consumed. */
39282 static pragma_omp_clause
39284 {
39285 pragma_omp_clause clause_type;
39302 else
39307 }
39309 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
39311 static tree
39313 {
39318 {
39319 pragma_omp_clause c_kind;
39326 /* Use the OpenMP 4.0 equivalent function. */
39329 /* Use the OpenMP 4.0 equivalent function. */
39331 clauses);
39333 /* Use the OMP 4.0 equivalent function. */
39335 clauses);
39337 /* Use the OMP 4.0 equivalent function. */
39339 else
39340 {
39344 }
39345 }
39351 else
39353 }
39355 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
39357 static void
39359 {
39366 {
39370 }
39379 }
39381 /* Main entry-point for parsing Cilk Plus _Cilk_for
39382 loops. The return value is error_mark_node
39383 when errors happen and CILK_FOR tree on success. */
39385 static tree
39387 {
39402 else
39408 }
39410 /* Create an identifier for a generic parameter type (a synthesized
39411 template parameter implied by `auto' or a concept identifier). */
39414 static tree
39416 {
39420 }
39422 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39423 (creating a new template parameter list if necessary). Returns the newly
39424 created template type parm. */
39426 static tree
39428 {
39431 /* Before committing to modifying any scope, if we're in an
39432 implicit template scope, and we're trying to synthesize a
39433 constrained parameter, try to find a previous parameter with
39434 the same name. This is the same-type rule for abbreviated
39435 function templates.
39437 NOTE: We can generate implicit parameters when tentatively
39438 parsing a nested name specifier, only to reject that parse
39439 later. However, matching the same template-id as part of a
39440 direct-declarator should generate an identical template
39441 parameter, so this rule will merge them. */
39443 {
39446 {
39448 {
39451 /* Return the TEMPLATE_PARM_INDEX. */
39454 }
39456 }
39457 }
39459 /* We are either continuing a function template that already contains implicit
39460 template parameters, creating a new fully-implicit function template, or
39461 extending an existing explicit function template with implicit template
39462 parameters. */
39470 {
39474 }
39475 else
39476 {
39477 /* Roll back to the existing template parameter scope (in the case of
39478 extending an explicit function template) or introduce a new template
39479 parameter scope ahead of the function parameter scope (or class scope
39480 in the case of out-of-line member definitions). The function scope is
39481 added back after template parameter synthesis below. */
39486 {
39489 }
39491 {
39492 /* If not defining a class, then any class scope is a scope level in
39493 an out-of-line member definition. In this case simply wind back
39494 beyond the first such scope to inject the template parameter list.
39495 Otherwise wind back to the class being defined. The latter can
39496 occur in class member friend declarations such as:
39498 class A {
39499 void foo (auto);
39500 };
39501 class B {
39502 friend void A::foo (auto);
39503 };
39505 The template parameter list synthesized for the friend declaration
39506 must be injected in the scope of 'B'. This can also occur in
39507 erroneous cases such as:
39509 struct A {
39510 struct B {
39511 void foo (auto);
39512 };
39513 void B::foo (auto) {}
39514 };
39516 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39517 but, nevertheless, the template parameter list synthesized for the
39518 declarator should be injected into the scope of 'A' as if the
39519 ill-formed template was specified explicitly. */
39522 {
39525 }
39526 }
39532 {
39533 /* Introduce a new template parameter list for implicit template
39534 parameters. */
39538 parser->implicit_template_scope
39545 }
39546 else
39547 {
39548 /* Synthesize implicit template parameters at the end of the explicit
39549 template parameter list. */
39556 parser->implicit_template_parms
39558 }
39559 }
39561 /* Synthesize a new template parameter and track the current template
39562 parameter chain with implicit_template_parms. */
39566 tree synth_tmpl_parm;
39570 synth_tmpl_parm
39573 synth_tmpl_parm
39575 else
39576 {
39580 }
39582 // Attach the constraint to the parm before processing.
39585 tree new_parm
39587 input_location,
39588 node,
39592 // Chain the new parameter to the list of implicit parameters.
39594 parser->implicit_template_parms
39596 else
39601 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39604 /* If creating a fully implicit function template, start the new implicit
39605 template parameter list with this synthesized type, otherwise grow the
39606 current template parameter list. */
39609 {
39616 }
39617 else
39618 {
39623 }
39625 // If the new parameter was constrained, we need to add that to the
39626 // constraints in the template parameter list.
39628 {
39632 }
39637 }
39639 /* Finish the declaration of a fully implicit function template. Such a
39640 template has no explicit template parameter list so has not been through the
39641 normal template head and tail processing. synthesize_implicit_template_parm
39642 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39643 provided if the declaration is a class member such that its template
39644 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39645 form is returned. Otherwise NULL_TREE is returned. */
39647 static tree
39649 {
39654 {
39658 }
39668 }
39670 /* Helper function for diagnostics that have complained about things
39671 being used with 'extern "C"' linkage.
39673 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39675 void
39677 {
39681 }