| blob | f672b8de18859f65ff60e4f8bc3e6ee68ce9cb4e |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2016 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
46 \f
47 /* The lexer. */
49 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
50 and c-lex.c) and the C++ parser. */
53 {
55 };
57 /* The various kinds of non integral constant we encounter. */
59 NIC_NONE,
60 /* floating-point literal */
61 NIC_FLOAT,
62 /* %<this%> */
63 NIC_THIS,
64 /* %<__FUNCTION__%> */
65 NIC_FUNC_NAME,
66 /* %<__PRETTY_FUNCTION__%> */
67 NIC_PRETTY_FUNC,
68 /* %<__func__%> */
69 NIC_C99_FUNC,
70 /* "%<va_arg%> */
71 NIC_VA_ARG,
72 /* a cast */
73 NIC_CAST,
74 /* %<typeid%> operator */
75 NIC_TYPEID,
76 /* non-constant compound literals */
77 NIC_NCC,
78 /* a function call */
79 NIC_FUNC_CALL,
80 /* an increment */
81 NIC_INC,
82 /* an decrement */
83 NIC_DEC,
84 /* an array reference */
85 NIC_ARRAY_REF,
86 /* %<->%> */
87 NIC_ARROW,
88 /* %<.%> */
89 NIC_POINT,
90 /* the address of a label */
91 NIC_ADDR_LABEL,
92 /* %<*%> */
93 NIC_STAR,
94 /* %<&%> */
95 NIC_ADDR,
96 /* %<++%> */
97 NIC_PREINCREMENT,
98 /* %<--%> */
99 NIC_PREDECREMENT,
100 /* %<new%> */
101 NIC_NEW,
102 /* %<delete%> */
103 NIC_DEL,
104 /* calls to overloaded operators */
105 NIC_OVERLOADED,
106 /* an assignment */
107 NIC_ASSIGNMENT,
108 /* a comma operator */
109 NIC_COMMA,
110 /* a call to a constructor */
111 NIC_CONSTRUCTOR,
112 /* a transaction expression */
113 NIC_TRANSACTION
114 };
116 /* The various kinds of errors about name-lookup failing. */
118 /* NULL */
119 NLE_NULL,
120 /* is not a type */
121 NLE_TYPE,
122 /* is not a class or namespace */
123 NLE_CXX98,
124 /* is not a class, namespace, or enumeration */
125 NLE_NOT_CXX98
126 };
128 /* The various kinds of required token */
130 RT_NONE,
152 /* The type is CPP_KEYWORD */
181 RT_TRANSACTION_CANCEL /* __transaction_cancel */
182 };
184 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
185 reverting it on destruction. */
187 class type_id_in_expr_sentinel
188 {
198 };
200 /* Prototypes. */
206 static void cp_lexer_destroy
208 static int cp_lexer_saving_tokens
212 static void cp_lexer_get_preprocessor_token
220 static bool cp_lexer_next_token_is_not
222 static bool cp_lexer_next_token_is_keyword
226 static void cp_lexer_purge_token
228 static void cp_lexer_purge_tokens_after
230 static void cp_lexer_save_tokens
232 static void cp_lexer_commit_tokens
234 static void cp_lexer_rollback_tokens
236 static void cp_lexer_print_token
240 static void cp_lexer_start_debugging
242 static void cp_lexer_stop_debugging
248 static void cp_parser_initial_pragma
251 static tree cp_literal_operator_id
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 {
1463 }
1465 /* Make a declarator for a generalized identifier. If
1466 QUALIFYING_SCOPE is non-NULL, the identifier is
1467 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1468 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1469 is, if any. */
1473 special_function_kind sfk)
1474 {
1477 /* It is valid to write:
1479 class C { void f(); };
1480 typedef C D;
1481 void D::f();
1483 The standard is not clear about whether `typedef const C D' is
1484 legal; as of 2002-09-15 the committee is considering that
1485 question. EDG 3.0 allows that syntax. Therefore, we do as
1486 well. */
1500 }
1502 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1503 of modifiers such as const or volatile to apply to the pointer
1504 type, represented as identifiers. ATTRIBUTES represent the attributes that
1505 appertain to the pointer or reference. */
1507 cp_declarator *
1509 tree attributes)
1510 {
1518 {
1522 }
1523 else
1529 }
1531 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1532 represent the attributes that appertain to the pointer or
1533 reference. */
1535 cp_declarator *
1538 {
1546 {
1550 }
1551 else
1557 }
1559 /* Like make_pointer_declarator -- but for a pointer to a non-static
1560 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1561 appertain to the pointer or reference. */
1563 cp_declarator *
1566 tree attributes)
1567 {
1576 {
1579 }
1580 else
1586 }
1588 /* Make a declarator for the function given by TARGET, with the
1589 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1590 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1591 indicates what exceptions can be thrown. */
1593 cp_declarator *
1595 tree parms,
1596 cp_cv_quals cv_qualifiers,
1597 cp_virt_specifiers virt_specifiers,
1598 cp_ref_qualifier ref_qualifier,
1599 tree tx_qualifier,
1600 tree exception_specification,
1601 tree late_return_type,
1602 tree requires_clause)
1603 {
1617 {
1621 }
1622 else
1626 }
1628 /* Make a declarator for an array of BOUNDS elements, each of which is
1629 defined by ELEMENT. */
1631 cp_declarator *
1633 {
1640 {
1644 }
1645 else
1649 }
1651 /* Determine whether the declarator we've seen so far can be a
1652 parameter pack, when followed by an ellipsis. */
1653 static bool
1655 {
1657 /* We already saw an ellipsis. */
1660 /* Search for a declarator name, or any other declarator that goes
1661 after the point where the ellipsis could appear in a parameter
1662 pack. If we find any of these, then this declarator can not be
1663 made into a parameter pack. */
1666 {
1668 {
1680 }
1681 }
1684 }
1688 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1689 DECLARATOR and DEFAULT_ARGUMENT. */
1691 cp_parameter_declarator *
1694 tree default_argument,
1696 {
1704 else
1711 }
1713 /* Returns true iff DECLARATOR is a declaration for a function. */
1715 static bool
1717 {
1719 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_for_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2204 /* Declarators [gram.dcl.decl] */
2206 static tree cp_parser_init_declarator
2213 static enum tree_code cp_parser_ptr_operator
2215 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2217 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2219 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2221 static tree cp_parser_tx_qualifier_opt
2223 static tree cp_parser_late_return_type_opt
2225 static tree cp_parser_declarator_id
2227 static tree cp_parser_type_id
2229 static tree cp_parser_template_type_arg
2232 static tree cp_parser_type_id_1
2234 static void cp_parser_type_specifier_seq
2236 static tree cp_parser_parameter_declaration_clause
2238 static tree cp_parser_parameter_declaration_list
2242 static tree cp_parser_default_argument
2244 static void cp_parser_function_body
2246 static tree cp_parser_initializer
2248 static cp_expr cp_parser_initializer_clause
2250 static cp_expr cp_parser_braced_list
2255 static bool cp_parser_ctor_initializer_opt_and_function_body
2258 static tree cp_parser_late_parsing_omp_declare_simd
2261 static tree cp_parser_late_parsing_cilk_simd_fn_info
2264 static tree cp_parser_late_parsing_oacc_routine
2267 static tree synthesize_implicit_template_parm
2269 static tree finish_fully_implicit_template
2272 /* Classes [gram.class] */
2274 static tree cp_parser_class_name
2276 static tree cp_parser_class_specifier
2278 static tree cp_parser_class_head
2280 static enum tag_types cp_parser_class_key
2282 static void cp_parser_type_parameter_key
2284 static void cp_parser_member_specification_opt
2286 static void cp_parser_member_declaration
2288 static tree cp_parser_pure_specifier
2290 static tree cp_parser_constant_initializer
2293 /* Derived classes [gram.class.derived] */
2295 static tree cp_parser_base_clause
2297 static tree cp_parser_base_specifier
2300 /* Special member functions [gram.special] */
2302 static tree cp_parser_conversion_function_id
2304 static tree cp_parser_conversion_type_id
2308 static bool cp_parser_ctor_initializer_opt
2310 static void cp_parser_mem_initializer_list
2312 static tree cp_parser_mem_initializer
2314 static tree cp_parser_mem_initializer_id
2317 /* Overloading [gram.over] */
2319 static cp_expr cp_parser_operator_function_id
2321 static cp_expr cp_parser_operator
2324 /* Templates [gram.temp] */
2326 static void cp_parser_template_declaration
2328 static tree cp_parser_template_parameter_list
2330 static tree cp_parser_template_parameter
2332 static tree cp_parser_type_parameter
2334 static tree cp_parser_template_id
2336 static tree cp_parser_template_name
2338 static tree cp_parser_template_argument_list
2340 static tree cp_parser_template_argument
2342 static void cp_parser_explicit_instantiation
2344 static void cp_parser_explicit_specialization
2347 /* Exception handling [gram.exception] */
2349 static tree cp_parser_try_block
2351 static bool cp_parser_function_try_block
2353 static void cp_parser_handler_seq
2355 static void cp_parser_handler
2357 static tree cp_parser_exception_declaration
2359 static tree cp_parser_throw_expression
2361 static tree cp_parser_exception_specification_opt
2363 static tree cp_parser_type_id_list
2366 /* GNU Extensions */
2368 static tree cp_parser_asm_specification_opt
2370 static tree cp_parser_asm_operand_list
2372 static tree cp_parser_asm_clobber_list
2374 static tree cp_parser_asm_label_list
2376 static bool cp_next_tokens_can_be_attribute_p
2378 static bool cp_next_tokens_can_be_gnu_attribute_p
2380 static bool cp_next_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_gnu_attribute_p
2386 static bool cp_nth_tokens_can_be_attribute_p
2388 static tree cp_parser_attributes_opt
2390 static tree cp_parser_gnu_attributes_opt
2392 static tree cp_parser_gnu_attribute_list
2394 static tree cp_parser_std_attribute
2396 static tree cp_parser_std_attribute_spec
2398 static tree cp_parser_std_attribute_spec_seq
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static bool cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static tree cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_skip_to_closing_square_bracket
2648 /* Concept-related syntactic transformations */
2653 // -------------------------------------------------------------------------- //
2654 // Unevaluated Operand Guard
2655 //
2656 // Implementation of an RAII helper for unevaluated operand parsing.
2658 {
2661 }
2664 {
2667 }
2669 // -------------------------------------------------------------------------- //
2670 // Tentative Parsing
2672 /* Returns nonzero if we are parsing tentatively. */
2676 {
2678 }
2680 /* Returns nonzero if TOKEN is a string literal. */
2682 static bool
2684 {
2690 }
2692 /* Returns nonzero if TOKEN is a string literal
2693 of a user-defined string literal. */
2695 static bool
2697 {
2704 }
2706 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2708 static bool
2710 {
2712 }
2714 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2715 PRAGMA_NONE. */
2717 static enum pragma_kind
2719 {
2722 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2724 }
2726 /* Helper function for cp_parser_error.
2727 Having peeked a token of kind TOK1_KIND that might signify
2728 a conflict marker, peek successor tokens to determine
2729 if we actually do have a conflict marker.
2730 Specifically, we consider a run of 7 '<', '=' or '>' characters
2731 at the start of a line as a conflict marker.
2732 These come through the lexer as three pairs and a single,
2733 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2734 If it returns true, *OUT_LOC is written to with the location/range
2735 of the marker. */
2737 static bool
2740 {
2751 /* It must be at the start of the line. */
2756 /* We have a conflict marker. Construct a location of the form:
2757 <<<<<<<
2758 ^~~~~~~
2759 with start == caret, finishing at the end of the marker. */
2764 }
2766 /* If not parsing tentatively, issue a diagnostic of the form
2767 FILE:LINE: MESSAGE before TOKEN
2768 where TOKEN is the next token in the input stream. MESSAGE
2769 (specified by the caller) is usually of the form "expected
2770 OTHER-TOKEN". */
2772 static void
2774 {
2776 {
2778 /* This diagnostic makes more sense if it is tagged to the line
2779 of the token we just peeked at. */
2783 {
2788 }
2790 /* If this is actually a conflict marker, report it as such. */
2794 {
2795 location_t loc;
2797 {
2800 }
2801 }
2804 /* Because c_parser_error does not understand
2805 CPP_KEYWORD, keywords are treated like
2806 identifiers. */
2809 }
2810 }
2812 /* Issue an error about name-lookup failing. NAME is the
2813 IDENTIFIER_NODE DECL is the result of
2814 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2815 the thing that we hoped to find. */
2817 static void
2819 tree name,
2820 tree decl,
2821 name_lookup_error desired,
2822 location_t location)
2823 {
2824 /* If name lookup completely failed, tell the user that NAME was not
2825 declared. */
2827 {
2840 else
2842 }
2844 {
2846 {
2863 }
2864 }
2866 {
2868 {
2878 name);
2882 }
2883 }
2884 else
2885 {
2887 {
2900 }
2901 }
2902 }
2904 /* If we are parsing tentatively, remember that an error has occurred
2905 during this tentative parse. Returns true if the error was
2906 simulated; false if a message should be issued by the caller. */
2908 static bool
2910 {
2912 {
2915 }
2917 }
2919 /* This function is called when a type is defined. If type
2920 definitions are forbidden at this point, an error message is
2921 issued. */
2923 static bool
2925 {
2926 /* If types are forbidden here, issue a message. */
2928 {
2929 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2930 in the message need to be interpreted. */
2933 }
2935 }
2937 /* This function is called when the DECLARATOR is processed. The TYPE
2938 was a type defined in the decl-specifiers. If it is invalid to
2939 define a type in the decl-specifiers for DECLARATOR, an error is
2940 issued. TYPE_LOCATION is the location of TYPE and is used
2941 for error reporting. */
2943 static void
2946 {
2947 /* [dcl.fct] forbids type definitions in return types.
2948 Unfortunately, it's not easy to know whether or not we are
2949 processing a return type until after the fact. */
2957 {
2962 type);
2963 }
2964 }
2966 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2967 "<" in any valid C++ program. If the next token is indeed "<",
2968 issue a message warning the user about what appears to be an
2969 invalid attempt to form a template-id. LOCATION is the location
2970 of the type-specifier (TYPE) */
2972 static void
2974 tree type,
2976 location_t location)
2977 {
2981 {
2985 {
2988 else
2990 }
2991 else
2993 /* Remember the location of the invalid "<". */
2996 /* Consume the "<". */
2998 /* Parse the template arguments. */
3000 /* Permanently remove the invalid template arguments so that
3001 this error message is not issued again. */
3004 }
3005 }
3007 /* If parsing an integral constant-expression, issue an error message
3008 about the fact that THING appeared and return true. Otherwise,
3009 return false. In either case, set
3010 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3012 static bool
3014 non_integral_constant thing)
3015 {
3018 {
3020 {
3023 {
3030 "enumeration type cannot appear in a "
3121 }
3125 }
3126 }
3128 }
3130 /* Emit a diagnostic for an invalid type name. This function commits
3131 to the current active tentative parse, if any. (Otherwise, the
3132 problematic construct might be encountered again later, resulting
3133 in duplicate error messages.) LOCATION is the location of ID. */
3135 static void
3137 location_t location)
3138 {
3141 /* Try to lookup the identifier. */
3148 /* If the lookup was ambiguous, an error will already have
3149 been issued. */
3151 /* If the lookup found a template-name, it means that the user forgot
3152 to specify an argument list. Emit a useful error message. */
3154 {
3157 decl);
3159 }
3163 /* Something like 'unsigned A a;' */
3166 {
3167 /* Issue an error message. */
3172 {
3178 }
3179 else
3181 /* If we're in a template class, it's possible that the user was
3182 referring to a type from a base class. For example:
3184 template <typename T> struct A { typedef T X; };
3185 template <typename T> struct B : public A<T> { X x; };
3187 The user should have said "typename A<T>::X". */
3203 {
3204 tree b;
3207 b;
3209 {
3213 {
3214 tree field;
3215 /* Go from a particular instantiation of the
3216 template (which will have an empty TYPE_FIELDs),
3217 to the main version. */
3220 field;
3224 {
3229 }
3232 }
3233 }
3234 }
3235 }
3236 /* Here we diagnose qualified-ids where the scope is actually correct,
3237 but the identifier does not resolve to a valid type name. */
3239 {
3241 {
3246 else
3252 }
3255 {
3256 /* A<T>::A<T>() */
3262 }
3269 {
3274 else
3280 }
3281 else
3283 }
3284 }
3286 /* Check for a common situation where a type-name should be present,
3287 but is not, and issue a sensible error message. Returns true if an
3288 invalid type-name was detected.
3290 The situation handled by this function are variable declarations of the
3291 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3292 Usually, `ID' should name a type, but if we got here it means that it
3293 does not. We try to emit the best possible error message depending on
3294 how exactly the id-expression looks like. */
3296 static bool
3298 {
3299 tree id;
3302 /* Avoid duplicate error about ambiguous lookup. */
3304 {
3308 }
3317 /* If the next token is a (, this is a function with no explicit return
3318 type, i.e. constructor, destructor or conversion op. */
3321 {
3324 }
3328 /* Emit a diagnostic for the invalid type. */
3330 out:
3331 /* If we aren't in the middle of a declarator (i.e. in a
3332 parameter-declaration-clause), skip to the end of the declaration;
3333 there's no point in trying to process it. */
3337 }
3339 /* Consume tokens up to, and including, the next non-nested closing `)'.
3340 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3341 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3342 found an unnested token of that type. */
3344 static int
3347 cpp_ttype or_ttype,
3349 {
3359 {
3362 /* Have we found what we're looking for before the closing paren? */
3368 {
3371 /* If we've run out of tokens, then there is no closing `)'. */
3374 /* This is good for lambda expression capture-lists. */
3384 /* This matches the processing in skip_to_end_of_statement. */
3404 {
3408 }
3413 }
3415 /* Consume the token. */
3417 }
3418 }
3420 /* Consume tokens up to, and including, the next non-nested closing `)'.
3421 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3422 are doing error recovery. Returns -1 if OR_COMMA is true and we
3423 found an unnested token of that type. */
3425 static int
3430 {
3434 }
3436 /* Consume tokens until we reach the end of the current statement.
3437 Normally, that will be just before consuming a `;'. However, if a
3438 non-nested `}' comes first, then we stop before consuming that. */
3440 static void
3442 {
3445 /* Unwind generic function template scope if necessary. */
3450 {
3454 {
3457 /* If we've run out of tokens, stop. */
3461 /* If the next token is a `;', we have reached the end of the
3462 statement. */
3468 /* If this is a non-nested '}', stop before consuming it.
3469 That way, when confronted with something like:
3471 { 3 + }
3473 we stop before consuming the closing '}', even though we
3474 have not yet reached a `;'. */
3478 /* If it is the closing '}' for a block that we have
3479 scanned, stop -- but only after consuming the token.
3480 That way given:
3482 void f g () { ... }
3483 typedef int I;
3485 we will stop after the body of the erroneously declared
3486 function, but before consuming the following `typedef'
3487 declaration. */
3489 {
3492 }
3493 /* XXX Really fallthru? */
3494 /* FALLTHRU */
3502 }
3504 /* Consume the token. */
3506 }
3507 }
3509 /* This function is called at the end of a statement or declaration.
3510 If the next token is a semicolon, it is consumed; otherwise, error
3511 recovery is attempted. */
3513 static void
3515 {
3516 /* Look for the trailing `;'. */
3518 {
3519 /* If there is additional (erroneous) input, skip to the end of
3520 the statement. */
3522 /* If the next token is now a `;', consume it. */
3525 }
3526 }
3528 /* Skip tokens until we have consumed an entire block, or until we
3529 have consumed a non-nested `;'. */
3531 static void
3533 {
3536 /* Unwind generic function template scope if necessary. */
3541 {
3545 {
3548 /* If we've run out of tokens, stop. */
3552 /* Stop if this is an unnested ';'. */
3558 /* Stop if this is an unnested '}', or closes the outermost
3559 nesting level. */
3560 nesting_depth--;
3568 /* Nest. */
3569 nesting_depth++;
3574 }
3576 /* Consume the token. */
3578 }
3579 }
3581 /* Skip tokens until a non-nested closing curly brace is the next
3582 token, or there are no more tokens. Return true in the first case,
3583 false otherwise. */
3585 static bool
3587 {
3591 {
3595 {
3598 /* If we've run out of tokens, stop. */
3602 /* If the next token is a non-nested `}', then we have reached
3603 the end of the current block. */
3609 /* If it the next token is a `{', then we are entering a new
3610 block. Consume the entire block. */
3616 }
3618 /* Consume the token. */
3620 }
3621 }
3623 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3624 parameter is the PRAGMA token, allowing us to purge the entire pragma
3625 sequence. */
3627 static void
3629 {
3634 do
3638 /* Ensure that the pragma is not parsed again. */
3640 }
3642 /* Require pragma end of line, resyncing with it as necessary. The
3643 arguments are as for cp_parser_skip_to_pragma_eol. */
3645 static void
3647 {
3651 }
3653 /* This is a simple wrapper around make_typename_type. When the id is
3654 an unresolved identifier node, we can provide a superior diagnostic
3655 using cp_parser_diagnose_invalid_type_name. */
3657 static tree
3659 location_t id_location)
3660 {
3661 tree result;
3663 {
3669 }
3671 }
3673 /* This is a wrapper around the
3674 make_{pointer,ptrmem,reference}_declarator functions that decides
3675 which one to call based on the CODE and CLASS_TYPE arguments. The
3676 CODE argument should be one of the values returned by
3677 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3678 appertain to the pointer or reference. */
3682 cp_cv_quals cv_qualifiers,
3684 tree attributes)
3685 {
3692 else
3702 }
3704 /* Create a new C++ parser. */
3708 {
3713 /* cp_lexer_new_main is called before doing GC allocation because
3714 cp_lexer_new_main might load a PCH file. */
3717 /* Initialize the binops_by_token so that we can get the tree
3718 directly from the token. */
3726 /* For now, we always accept GNU extensions. */
3729 /* The `>' token is a greater-than operator, not the end of a
3730 template-id. */
3735 /* We are not parsing a constant-expression. */
3740 /* Local variable names are not forbidden. */
3743 /* We are not processing an `extern "C"' declaration. */
3746 /* We are not processing a declarator. */
3749 /* We are not processing a template-argument-list. */
3752 /* We are not in an iteration statement. */
3755 /* We are not in a switch statement. */
3758 /* We are not parsing a type-id inside an expression. */
3761 /* Declarations aren't implicitly extern "C". */
3764 /* String literals should be translated to the execution character set. */
3767 /* We are not parsing a function body. */
3770 /* We can correct until told otherwise. */
3773 /* The unparsed function queue is empty. */
3776 /* There are no classes being defined. */
3779 /* No template parameters apply. */
3782 /* Special parsing data structures. */
3787 /* Not declaring an implicit function template. */
3793 /* Allow constrained-type-specifiers. */
3797 }
3799 /* Create a cp_lexer structure which will emit the tokens in CACHE
3800 and push it onto the parser's lexer stack. This is used for delayed
3801 parsing of in-class method bodies and default arguments, and should
3802 not be confused with tentative parsing. */
3803 static void
3805 {
3810 /* Move the current source position to that of the first token in the
3811 new lexer. */
3813 }
3815 /* Pop the top lexer off the parser stack. This is never used for the
3816 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3817 static void
3819 {
3824 /* Put the current source position back where it was before this
3825 lexer was pushed. */
3827 }
3829 /* Lexical conventions [gram.lex] */
3831 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3832 identifier. */
3834 static cp_expr
3836 {
3839 /* Look for the identifier. */
3841 /* Return the value. */
3844 else
3846 }
3848 /* Parse a sequence of adjacent string constants. Returns a
3849 TREE_STRING representing the combined, nul-terminated string
3850 constant. If TRANSLATE is true, translate the string to the
3851 execution character set. If WIDE_OK is true, a wide string is
3852 invalid here.
3854 C++98 [lex.string] says that if a narrow string literal token is
3855 adjacent to a wide string literal token, the behavior is undefined.
3856 However, C99 6.4.5p4 says that this results in a wide string literal.
3857 We follow C99 here, for consistency with the C front end.
3859 This code is largely lifted from lex_string() in c-lex.c.
3861 FUTURE: ObjC++ will need to handle @-strings here. */
3862 static cp_expr
3865 {
3866 tree value;
3873 tree string_tree;
3879 {
3882 }
3887 {
3891 }
3892 else
3893 {
3896 }
3899 /* Try to avoid the overhead of creating and destroying an obstack
3900 for the common case of just one string. */
3903 {
3911 {
3915 }
3916 else
3920 }
3921 else
3922 {
3927 do
3928 {
3930 count++;
3935 {
3938 {
3941 }
3944 {
3949 }
3951 }
3952 else
3956 {
3960 {
3964 "unsupported non-standard concatenation "
3966 }
3967 }
3975 {
3979 }
3980 else
3981 {
3985 }
3986 }
3989 /* A string literal built by concatenation has its caret=start at
3990 the start of the initial string, and its finish at the finish of
3991 the final string literal. */
3995 }
3998 {
4001 }
4005 {
4010 {
4025 }
4030 {
4035 else
4037 }
4038 }
4039 else
4040 /* cpp_interpret_string has issued an error. */
4047 }
4049 /* Look up a literal operator with the name and the exact arguments. */
4051 static tree
4053 {
4060 {
4066 {
4069 {
4079 }
4082 /* May be this should be sufficient_parms_p instead,
4083 depending on how exactly should user-defined literals
4084 work in presence of default arguments on the literal
4085 operator parameters. */
4088 }
4089 }
4092 }
4094 /* Parse a user-defined char constant. Returns a call to a user-defined
4095 literal operator taking the character as an argument. */
4097 static cp_expr
4099 {
4107 /* Build up a call to the user-defined operator */
4108 /* Lookup the name we got back from the id-expression. */
4113 {
4118 }
4122 }
4124 /* A subroutine of cp_parser_userdef_numeric_literal to
4125 create a char... template parameter pack from a string node. */
4127 static tree
4129 {
4130 tree charvec;
4136 /* Fill in CHARVEC with all of the parameters. */
4141 /* Build the argument packs. */
4148 }
4150 /* A subroutine of cp_parser_userdef_numeric_literal to
4151 create a char... template parameter pack from a string node. */
4153 static tree
4155 {
4156 tree charvec;
4167 /* First template parm is character type. */
4170 /* Fill in CHARVEC with all of the parameters. */
4177 /* Build the argument packs. */
4184 }
4186 /* Parse a user-defined numeric constant. returns a call to a user-defined
4187 literal operator. */
4189 static cp_expr
4191 {
4202 /* Look for a literal operator taking the exact type of numeric argument
4203 as the literal value. */
4208 {
4210 tf_warning_or_error);
4213 {
4216 long_long_unsigned_type_node);
4217 }
4218 else
4219 {
4223 long_double_type_node);
4227 }
4231 }
4234 /* If the numeric argument didn't work, look for a raw literal
4235 operator taking a const char* argument consisting of the number
4236 in string format. */
4241 {
4243 tf_warning_or_error);
4246 }
4249 /* If the raw literal didn't work, look for a non-type template
4250 function with parameter pack char.... Call the function with
4251 template parameter characters representing the number. */
4255 {
4259 tf_warning_or_error);
4262 }
4271 }
4273 /* Parse a user-defined string constant. Returns a call to a user-defined
4274 literal operator taking a character pointer and the length of the string
4275 as arguments. */
4277 static tree
4279 {
4288 /* Build up a call to the user-defined operator. */
4289 /* Lookup the name we got back from the id-expression. */
4296 {
4298 tf_warning_or_error);
4301 }
4304 /* Look for a template function with typename parameter CharT
4305 and parameter pack CharT... Call the function with
4306 template parameter characters representing the string. */
4310 {
4314 tf_warning_or_error);
4317 }
4323 }
4326 /* Basic concepts [gram.basic] */
4328 /* Parse a translation-unit.
4330 translation-unit:
4331 declaration-seq [opt]
4333 Returns TRUE if all went well. */
4335 static bool
4337 {
4338 /* The address of the first non-permanent object on the declarator
4339 obstack. */
4344 /* Create the declarator obstack, if necessary. */
4346 {
4348 /* Create the error declarator. */
4350 /* Create the empty parameter list. */
4352 /* Remember where the base of the declarator obstack lies. */
4354 }
4358 /* If there are no tokens left then all went well. */
4360 {
4361 /* Get rid of the token array; we don't need it any more. */
4365 /* This file might have been a context that's implicitly extern
4366 "C". If so, pop the lang context. (Only relevant for PCH.) */
4368 {
4371 }
4373 /* Finish up. */
4377 }
4378 else
4379 {
4382 }
4384 /* Make sure the declarator obstack was fully cleaned up. */
4388 /* All went well. */
4390 }
4392 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4393 decltype context. */
4397 {
4402 }
4404 /* We're about to parse a collection of statements. If we're currently
4405 parsing tentatively, set up a firewall so that any nested
4406 cp_parser_commit_to_tentative_parse won't affect the current context. */
4408 static cp_token_position
4410 {
4417 }
4419 /* We've finished parsing the collection of statements. Wrap up the
4420 firewall and replace the relevant tokens with the parsed form. */
4422 static void
4424 tree expr)
4425 {
4429 /* Finish the firewall level. */
4431 /* And remember the result of the parse for when we try again. */
4437 }
4439 /* Like the above functions, but let the user modify the tokens. Used by
4440 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4441 later parses, so it makes sense to localize the effects of
4442 cp_parser_commit_to_tentative_parse. */
4444 struct tentative_firewall
4445 {
4450 {
4451 /* If we're currently parsing tentatively, start a committed level as a
4452 firewall and then an inner tentative parse. */
4454 {
4458 }
4459 }
4462 {
4464 {
4465 /* Finish the inner tentative parse and the firewall, propagating any
4466 uncommitted error state to the outer tentative parse. */
4472 }
4473 }
4474 };
4476 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4477 enclosing parentheses. */
4479 static cp_expr
4481 {
4484 /* Consume the '('. */
4487 /* Start the statement-expression. */
4489 /* Parse the compound-statement. */
4491 /* Finish up. */
4493 /* Consume the ')'. */
4501 }
4503 /* Expressions [gram.expr] */
4505 /* Parse a fold-operator.
4507 fold-operator:
4508 - * / % ^ & | = < > << >>
4509 = -= *= /= %= ^= &= |= <<= >>=
4510 == != <= >= && || , .* ->*
4512 This returns the tree code corresponding to the matched operator
4513 as an int. When the current token matches a compound assignment
4514 opertor, the resulting tree code is the negative value of the
4515 non-assignment operator. */
4517 static int
4519 {
4521 {
4561 }
4562 }
4564 /* Returns true if CODE indicates a binary expression, which is not allowed in
4565 the LHS of a fold-expression. More codes will need to be added to use this
4566 function in other contexts. */
4568 static bool
4570 {
4572 {
4605 }
4606 }
4608 /* If the next token is a suitable fold operator, consume it and return as
4609 the function above. */
4611 static int
4613 {
4619 }
4621 /* Parse a fold-expression.
4623 fold-expression:
4624 ( ... folding-operator cast-expression)
4625 ( cast-expression folding-operator ... )
4626 ( cast-expression folding operator ... folding-operator cast-expression)
4628 Note that the '(' and ')' are matched in primary expression. */
4630 static cp_expr
4632 {
4633 cp_id_kind pidk;
4635 // Left fold.
4637 {
4641 {
4644 }
4651 }
4656 {
4659 }
4662 {
4665 }
4668 /* The operands of a fold-expression are cast-expressions, so binary or
4669 conditional expressions are not allowed. We check this here to avoid
4670 tentative parsing. */
4678 // Right fold.
4683 {
4686 }
4689 // Binary left or right fold.
4694 }
4696 /* Parse a primary-expression.
4698 primary-expression:
4699 literal
4700 this
4701 ( expression )
4702 id-expression
4703 lambda-expression (C++11)
4705 GNU Extensions:
4707 primary-expression:
4708 ( compound-statement )
4709 __builtin_va_arg ( assignment-expression , type-id )
4710 __builtin_offsetof ( type-id , offsetof-expression )
4712 C++ Extensions:
4713 __has_nothrow_assign ( type-id )
4714 __has_nothrow_constructor ( type-id )
4715 __has_nothrow_copy ( type-id )
4716 __has_trivial_assign ( type-id )
4717 __has_trivial_constructor ( type-id )
4718 __has_trivial_copy ( type-id )
4719 __has_trivial_destructor ( type-id )
4720 __has_virtual_destructor ( type-id )
4721 __is_abstract ( type-id )
4722 __is_base_of ( type-id , type-id )
4723 __is_class ( type-id )
4724 __is_empty ( type-id )
4725 __is_enum ( type-id )
4726 __is_final ( type-id )
4727 __is_literal_type ( type-id )
4728 __is_pod ( type-id )
4729 __is_polymorphic ( type-id )
4730 __is_std_layout ( type-id )
4731 __is_trivial ( type-id )
4732 __is_union ( type-id )
4734 Objective-C++ Extension:
4736 primary-expression:
4737 objc-expression
4739 literal:
4740 __null
4742 ADDRESS_P is true iff this expression was immediately preceded by
4743 "&" and therefore might denote a pointer-to-member. CAST_P is true
4744 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4745 true iff this expression is a template argument.
4747 Returns a representation of the expression. Upon return, *IDK
4748 indicates what kind of id-expression (if any) was present. */
4750 static cp_expr
4757 {
4760 /* Assume the primary expression is not an id-expression. */
4763 /* Peek at the next token. */
4766 {
4767 /* literal:
4768 integer-literal
4769 character-literal
4770 floating-literal
4771 string-literal
4772 boolean-literal
4773 pointer-literal
4774 user-defined-literal */
4786 {
4790 }
4791 /* Floating-point literals are only allowed in an integral
4792 constant expression if they are cast to an integral or
4793 enumeration type. */
4797 {
4798 /* CAST_P will be set even in invalid code like "int(2.7 +
4799 ...)". Therefore, we have to check that the next token
4800 is sure to end the cast. */
4802 {
4807 enumerator-definition. */
4809 /* The curly brace at the end of an enum-specifier. */
4811 /* The end of a statement. */
4813 /* The end of the cast-expression. */
4815 /* The end of an array bound. */
4817 /* The closing ">" in a template-argument-list. */
4820 /* C++0x only: A ">>" treated like two ">" tokens,
4821 in a template-argument-list. */
4826 }
4828 /* If we are within a cast, then the constraint that the
4829 cast is to an integral or enumeration type will be
4830 checked at that point. If we are not within a cast, then
4831 this code is invalid. */
4834 }
4854 /* ??? Should wide strings be allowed when parser->translate_strings_p
4855 is false (i.e. in attributes)? If not, we can kill the third
4856 argument to cp_parser_string_literal. */
4862 /* If we see `( { ' then we are looking at the beginning of
4863 a GNU statement-expression. */
4866 {
4867 /* Statement-expressions are not allowed by the standard. */
4871 /* And they're not allowed outside of a function-body; you
4872 cannot, for example, write:
4874 int i = ({ int j = 3; j + 1; });
4876 at class or namespace scope. */
4879 {
4881 "statement-expressions are not allowed outside "
4887 }
4888 else
4890 }
4891 /* Otherwise it's a normal parenthesized expression. */
4892 {
4893 cp_expr expr;
4898 /* Consume the `('. */
4900 /* Within a parenthesized expression, a `>' token is always
4901 the greater-than operator. */
4902 saved_greater_than_is_operator_p
4907 /* Left fold expression. */
4909 else
4910 /* Parse the parenthesized expression. */
4915 {
4922 }
4923 else
4924 /* Let the front end know that this expression was
4925 enclosed in parentheses. This matters in case, for
4926 example, the expression is of the form `A::B', since
4927 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4928 not. */
4931 /* DR 705: Wrapping an unqualified name in parentheses
4932 suppresses arg-dependent lookup. We want to pass back
4933 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4934 (c++/37862), but none of the others. */
4938 /* The `>' token might be the end of a template-id or
4939 template-parameter-list now. */
4940 parser->greater_than_is_operator_p
4943 /* Consume the `)'. */
4952 }
4955 {
4957 {
4958 /* We might have an Objective-C++ message. */
4961 /* If that works out, we're done ... */
4964 /* ... else, fall though to see if it's a lambda. */
4965 }
4967 /* Don't warn about a failed tentative parse. */
4972 }
4976 /* We have an Objective-C++ string literal. */
4983 {
4984 /* These two are the boolean literals. */
4992 /* The `__null' literal. */
4997 /* The `nullptr' literal. */
5002 /* Recognize the `this' keyword. */
5006 {
5010 }
5011 /* Pointers cannot appear in constant-expressions. */
5016 /* The `operator' keyword can be the beginning of an
5017 id-expression. */
5024 {
5025 non_integral_constant name;
5027 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5028 __func__ are the names of variables -- but they are
5029 treated specially. Therefore, they are handled here,
5030 rather than relying on the generic id-expression logic
5031 below. Grammatically, these names are id-expressions.
5033 Consume the token. */
5037 {
5049 }
5054 /* Look up the name. */
5056 }
5059 {
5060 tree expression;
5061 tree type;
5062 source_location type_location;
5063 location_t start_loc
5065 /* The `__builtin_va_arg' construct is used to handle
5066 `va_arg'. Consume the `__builtin_va_arg' token. */
5068 /* Look for the opening `('. */
5070 /* Now, parse the assignment-expression. */
5072 /* Look for the `,'. */
5075 /* Parse the type-id. */
5076 {
5079 }
5080 /* Look for the closing `)'. */
5081 location_t finish_loc
5084 /* Using `va_arg' in a constant-expression is not
5085 allowed. */
5087 NIC_VA_ARG))
5089 /* Construct a location of the form:
5090 __builtin_va_arg (v, int)
5091 ~~~~~~~~~~~~~~~~~~~~~^~~~
5092 with the caret at the type, ranging from the start of the
5093 "__builtin_va_arg" token to the close paren. */
5094 location_t combined_loc
5097 }
5128 // C++ concepts
5132 /* Objective-C++ expressions. */
5142 {
5147 }
5148 /* FALLTHRU */
5152 }
5154 /* An id-expression can start with either an identifier, a
5155 `::' as the beginning of a qualified-id, or the "operator"
5156 keyword. */
5161 {
5162 id_expression:
5163 cp_expr id_expression;
5164 cp_expr decl;
5170 /* Parse the id-expression. */
5171 id_expression
5188 /* If we have a template-id, then no further lookup is
5189 required. If the template-id was for a template-class, we
5190 will sometimes have a TYPE_DECL at this point. */
5194 /* Look up the name. */
5195 else
5196 {
5197 tree ambiguous_decls;
5199 /* If we already know that this lookup is ambiguous, then
5200 we've already issued an error message; there's no reason
5201 to check again. */
5204 {
5207 }
5210 none_type,
5211 template_p,
5216 /* If the lookup was ambiguous, an error will already have
5217 been issued. */
5221 /* In Objective-C++, we may have an Objective-C 2.0
5222 dot-syntax for classes here. */
5227 {
5228 tree component;
5235 component);
5236 /* Build a location of the form:
5237 expr.component
5238 ~~~~~^~~~~~~~~
5239 with caret at the start of the component name (at
5240 input_location), ranging from the start of the id_expression
5241 to the end of the component name. */
5242 location_t combined_loc
5247 }
5249 /* In Objective-C++, an instance variable (ivar) may be preferred
5250 to whatever cp_parser_lookup_name() found.
5251 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5252 rest of c-family, we have to do a little extra work to preserve
5253 any location information in cp_expr "decl". Given that
5254 objc_lookup_ivar is implemented in "c-family" and "objc", we
5255 have a trip through the pure "tree" type, rather than cp_expr.
5256 Naively copying it back to "decl" would implicitly give the
5257 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5258 store an EXPR_LOCATION. Hence we only update "decl" (and
5259 hence its location_t) if we get back a different tree node. */
5261 id_expression);
5265 /* If name lookup gives us a SCOPE_REF, then the
5266 qualifying scope was dependent. */
5268 {
5269 /* At this point, we do not know if DECL is a valid
5270 integral constant expression. We assume that it is
5271 in fact such an expression, so that code like:
5273 template <int N> struct A {
5274 int a[B<N>::i];
5275 };
5277 is accepted. At template-instantiation time, we
5278 will check that B<N>::i is actually a constant. */
5280 }
5281 /* Check to see if DECL is a local variable in a context
5282 where that is forbidden. */
5285 {
5286 /* It might be that we only found DECL because we are
5287 trying to be generous with pre-ISO scoping rules.
5288 For example, consider:
5290 int i;
5291 void g() {
5292 for (int i = 0; i < 10; ++i) {}
5293 extern void f(int j = i);
5294 }
5296 Here, name look up will originally find the out
5297 of scope `i'. We need to issue a warning message,
5298 but then use the global `i'. */
5301 {
5306 }
5307 }
5308 }
5310 decl = (finish_id_expression
5312 idk,
5317 template_arg_p,
5324 }
5326 /* Anything else is an error. */
5330 }
5331 }
5339 {
5342 }
5344 /* Parse an id-expression.
5346 id-expression:
5347 unqualified-id
5348 qualified-id
5350 qualified-id:
5351 :: [opt] nested-name-specifier template [opt] unqualified-id
5352 :: identifier
5353 :: operator-function-id
5354 :: template-id
5356 Return a representation of the unqualified portion of the
5357 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5358 a `::' or nested-name-specifier.
5360 Often, if the id-expression was a qualified-id, the caller will
5361 want to make a SCOPE_REF to represent the qualified-id. This
5362 function does not do this in order to avoid wastefully creating
5363 SCOPE_REFs when they are not required.
5365 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5366 `template' keyword.
5368 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5369 uninstantiated templates.
5371 If *TEMPLATE_P is non-NULL, it is set to true iff the
5372 `template' keyword is used to explicitly indicate that the entity
5373 named is a template.
5375 If DECLARATOR_P is true, the id-expression is appearing as part of
5376 a declarator, rather than as part of an expression. */
5378 static cp_expr
5385 {
5389 /* Assume the `template' keyword was not used. */
5393 /* Look for the optional `::' operator. */
5394 global_scope_p
5397 /* Look for the optional nested-name-specifier. */
5398 nested_name_specifier_p
5401 check_dependency_p,
5403 declarator_p)
5405 /* If there is a nested-name-specifier, then we are looking at
5406 the first qualified-id production. */
5408 {
5409 tree saved_scope;
5410 tree saved_object_scope;
5411 tree saved_qualifying_scope;
5412 tree unqualified_id;
5415 /* See if the next token is the `template' keyword. */
5419 /* Name lookup we do during the processing of the
5420 unqualified-id might obliterate SCOPE. */
5424 /* Process the final unqualified-id. */
5426 check_dependency_p,
5427 declarator_p,
5429 /* Restore the SAVED_SCOPE for our caller. */
5435 }
5436 /* Otherwise, if we are in global scope, then we are looking at one
5437 of the other qualified-id productions. */
5439 {
5441 tree id;
5443 /* Peek at the next token. */
5446 /* If it's an identifier, and the next token is not a "<", then
5447 we can avoid the template-id case. This is an optimization
5448 for this common case. */
5450 && !cp_parser_nth_token_starts_template_argument_list_p
5455 /* Try a template-id. */
5459 none_type,
5460 declarator_p);
5461 /* If that worked, we're done. */
5465 /* Peek at the next token. (Changes in the token buffer may
5466 have invalidated the pointer obtained above.) */
5470 {
5477 /* Fall through. */
5482 }
5483 }
5484 else
5487 declarator_p,
5488 optional_p);
5489 }
5491 /* Parse an unqualified-id.
5493 unqualified-id:
5494 identifier
5495 operator-function-id
5496 conversion-function-id
5497 ~ class-name
5498 template-id
5500 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5501 keyword, in a construct like `A::template ...'.
5503 Returns a representation of unqualified-id. For the `identifier'
5504 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5505 production a BIT_NOT_EXPR is returned; the operand of the
5506 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5507 other productions, see the documentation accompanying the
5508 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5509 names are looked up in uninstantiated templates. If DECLARATOR_P
5510 is true, the unqualified-id is appearing as part of a declarator,
5511 rather than as part of an expression. */
5513 static cp_expr
5519 {
5522 /* Peek at the next token. */
5526 {
5528 {
5529 tree id;
5531 /* We don't know yet whether or not this will be a
5532 template-id. */
5534 /* Try a template-id. */
5536 check_dependency_p,
5537 none_type,
5538 declarator_p);
5539 /* If it worked, we're done. */
5542 /* Otherwise, it's an ordinary identifier. */
5544 }
5548 check_dependency_p,
5549 none_type,
5550 declarator_p);
5553 {
5554 tree type_decl;
5555 tree qualifying_scope;
5556 tree object_scope;
5557 tree scope;
5560 /* Consume the `~' token. */
5562 /* Parse the class-name. The standard, as written, seems to
5563 say that:
5565 template <typename T> struct S { ~S (); };
5566 template <typename T> S<T>::~S() {}
5568 is invalid, since `~' must be followed by a class-name, but
5569 `S<T>' is dependent, and so not known to be a class.
5570 That's not right; we need to look in uninstantiated
5571 templates. A further complication arises from:
5573 template <typename T> void f(T t) {
5574 t.T::~T();
5575 }
5577 Here, it is not possible to look up `T' in the scope of `T'
5578 itself. We must look in both the current scope, and the
5579 scope of the containing complete expression.
5581 Yet another issue is:
5583 struct S {
5584 int S;
5585 ~S();
5586 };
5588 S::~S() {}
5590 The standard does not seem to say that the `S' in `~S'
5591 should refer to the type `S' and not the data member
5592 `S::S'. */
5594 /* DR 244 says that we look up the name after the "~" in the
5595 same scope as we looked up the qualifying name. That idea
5596 isn't fully worked out; it's more complicated than that. */
5601 /* Check for invalid scopes. */
5603 {
5607 }
5609 {
5613 scope);
5618 }
5621 /* If the name is of the form "X::~X" it's OK even if X is a
5622 typedef. */
5631 {
5634 }
5636 /* ~auto means the destructor of whatever the object is. */
5638 {
5641 "%<~auto%> only available with "
5645 }
5647 /* If there was an explicit qualification (S::~T), first look
5648 in the scope given by the qualification (i.e., S).
5650 Note: in the calls to cp_parser_class_name below we pass
5651 typename_type so that lookup finds the injected-class-name
5652 rather than the constructor. */
5656 {
5661 typename_type,
5664 declarator_p);
5667 }
5668 /* In "N::S::~S", look in "N" as well. */
5670 {
5675 type_decl
5679 typename_type,
5682 declarator_p);
5685 }
5686 /* In "p->S::~T", look in the scope given by "*p" as well. */
5688 {
5693 type_decl
5697 typename_type,
5700 declarator_p);
5703 }
5704 /* Look in the surrounding context. */
5706 {
5712 type_decl
5716 typename_type,
5719 declarator_p);
5722 {
5723 /* We couldn't find a type with this name. If we're parsing
5724 tentatively, fail and try something else. */
5726 {
5729 }
5730 /* Otherwise, accept it and check for a match at instantiation
5731 time. */
5736 }
5737 }
5738 /* If an error occurred, assume that the name of the
5739 destructor is the same as the name of the qualifying
5740 class. That allows us to keep parsing after running
5741 into ill-formed destructor names. */
5747 /* Check that destructor name and scope match. */
5749 {
5756 }
5758 /* [class.dtor]
5760 A typedef-name that names a class shall not be used as the
5761 identifier in the declarator for a destructor declaration. */
5768 type_decl);
5771 }
5775 {
5776 cp_expr id;
5778 /* This could be a template-id, so we try that first. */
5780 /* Try a template-id. */
5783 none_type,
5784 declarator_p);
5785 /* If that worked, we're done. */
5788 /* We still don't know whether we're looking at an
5789 operator-function-id or a conversion-function-id. */
5791 /* Try an operator-function-id. */
5793 /* If that didn't work, try a conversion-function-id. */
5797 {
5798 /* 17.6.3.3.5 */
5804 }
5807 }
5808 /* Fall through. */
5815 }
5816 }
5818 /* Parse an (optional) nested-name-specifier.
5820 nested-name-specifier: [C++98]
5821 class-or-namespace-name :: nested-name-specifier [opt]
5822 class-or-namespace-name :: template nested-name-specifier [opt]
5824 nested-name-specifier: [C++0x]
5825 type-name ::
5826 namespace-name ::
5827 nested-name-specifier identifier ::
5828 nested-name-specifier template [opt] simple-template-id ::
5830 PARSER->SCOPE should be set appropriately before this function is
5831 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5832 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5833 in name lookups.
5835 Sets PARSER->SCOPE to the class (TYPE) or namespace
5836 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5837 it unchanged if there is no nested-name-specifier. Returns the new
5838 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5840 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5841 part of a declaration and/or decl-specifier. */
5843 static tree
5849 {
5854 /* Remember where the nested-name-specifier starts. */
5856 {
5859 }
5862 {
5863 tree new_scope;
5864 tree old_scope;
5865 tree saved_qualifying_scope;
5868 /* Spot cases that cannot be the beginning of a
5869 nested-name-specifier. */
5872 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5873 the already parsed nested-name-specifier. */
5875 {
5876 /* Grab the nested-name-specifier and continue the loop. */
5878 /* If we originally encountered this nested-name-specifier
5879 with IS_DECLARATION set to false, we will not have
5880 resolved TYPENAME_TYPEs, so we must do so here. */
5883 {
5888 }
5891 }
5893 /* Spot cases that cannot be the beginning of a
5894 nested-name-specifier. On the second and subsequent times
5895 through the loop, we look for the `template' keyword. */
5897 ;
5898 /* A template-id can start a nested-name-specifier. */
5900 ;
5901 /* DR 743: decltype can be used in a nested-name-specifier. */
5903 ;
5904 else
5905 {
5906 /* If the next token is not an identifier, then it is
5907 definitely not a type-name or namespace-name. */
5910 /* If the following token is neither a `<' (to begin a
5911 template-id), nor a `::', then we are not looking at a
5912 nested-name-specifier. */
5918 {
5922 }
5925 && !cp_parser_nth_token_starts_template_argument_list_p
5928 }
5930 /* The nested-name-specifier is optional, so we parse
5931 tentatively. */
5934 /* Look for the optional `template' keyword, if this isn't the
5935 first time through the loop. */
5938 else
5941 /* Save the old scope since the name lookup we are about to do
5942 might destroy it. */
5945 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5946 look up names in "X<T>::I" in order to determine that "Y" is
5947 a template. So, if we have a typename at this point, we make
5948 an effort to look through it. */
5950 && !typename_keyword_p
5955 /* Parse the qualifying entity. */
5956 new_scope
5958 typename_keyword_p,
5959 template_keyword_p,
5960 check_dependency_p,
5961 type_p,
5962 is_declaration);
5963 /* Look for the `::' token. */
5966 /* If we found what we wanted, we keep going; otherwise, we're
5967 done. */
5969 {
5972 /* Restore the OLD_SCOPE since it was valid before the
5973 failed attempt at finding the last
5974 class-or-namespace-name. */
5978 /* If the next token is a decltype, and the one after that is a
5979 `::', then the decltype has failed to resolve to a class or
5980 enumeration type. Give this error even when parsing
5981 tentatively since it can't possibly be valid--and we're going
5982 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5983 won't get another chance.*/
5987 {
5994 /* As below. */
5997 }
6001 {
6002 /* If we have a non-type template-id followed by ::, it can't
6003 possibly be valid. */
6008 {
6011 {
6017 }
6018 else
6019 {
6020 /* Variable template. */
6025 }
6032 /* As below. */
6036 }
6037 }
6041 /* If the next token is an identifier, and the one after
6042 that is a `::', then any valid interpretation would have
6043 found a class-or-namespace-name. */
6049 {
6052 {
6054 {
6055 tree decl;
6056 tree ambiguous_decls;
6059 none_type,
6068 decl);
6070 {
6071 // cp_parser_lookup_name has the same diagnostic,
6072 // thus make sure to emit it at most once.
6075 {
6080 }
6082 }
6083 else
6084 {
6086 cp_parser_name_lookup_error
6089 else
6090 cp_parser_name_lookup_error
6093 }
6094 }
6097 /* Treat this as a successful nested-name-specifier
6098 due to:
6100 [basic.lookup.qual]
6102 If the name found is not a class-name (clause
6103 _class_) or namespace-name (_namespace.def_), the
6104 program is ill-formed. */
6106 }
6108 }
6110 }
6111 /* We've found one valid nested-name-specifier. */
6113 /* Name lookup always gives us a DECL. */
6116 /* Uses of "template" must be followed by actual templates. */
6128 new_scope);
6129 /* If it is a class scope, try to complete it; we are about to
6130 be looking up names inside the class. */
6132 /* Since checking types for dependency can be expensive,
6133 avoid doing it if the type is already complete. */
6135 /* Do not try to complete dependent types. */
6137 {
6139 /* If it is a typedef to current class, use the current
6140 class instead, as the typedef won't have any names inside
6141 it yet. */
6145 }
6146 /* Make sure we look in the right scope the next time through
6147 the loop. */
6149 }
6151 /* If parsing tentatively, replace the sequence of tokens that makes
6152 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6153 token. That way, should we re-parse the token stream, we will
6154 not have to repeat the effort required to do the parse, nor will
6155 we issue duplicate error messages. */
6157 {
6161 /* Reset the contents of the START token. */
6163 /* Retrieve any deferred checks. Do not pop this access checks yet
6164 so the memory will not be reclaimed during token replacing below. */
6172 /* Purge all subsequent tokens. */
6174 }
6180 }
6182 /* Parse a nested-name-specifier. See
6183 cp_parser_nested_name_specifier_opt for details. This function
6184 behaves identically, except that it will an issue an error if no
6185 nested-name-specifier is present. */
6187 static tree
6193 {
6194 tree scope;
6196 /* Look for the nested-name-specifier. */
6198 typename_keyword_p,
6199 check_dependency_p,
6200 type_p,
6201 is_declaration);
6202 /* If it was not present, issue an error message. */
6204 {
6207 }
6210 }
6212 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6213 this is either a class-name or a namespace-name (which corresponds
6214 to the class-or-namespace-name production in the grammar). For
6215 C++0x, it can also be a type-name that refers to an enumeration
6216 type or a simple-template-id.
6218 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6219 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6220 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6221 TYPE_P is TRUE iff the next name should be taken as a class-name,
6222 even the same name is declared to be another entity in the same
6223 scope.
6225 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6226 specified by the class-or-namespace-name. If neither is found the
6227 ERROR_MARK_NODE is returned. */
6229 static tree
6236 {
6237 tree saved_scope;
6238 tree saved_qualifying_scope;
6239 tree saved_object_scope;
6240 tree scope;
6244 /* DR 743: decltype can appear in a nested-name-specifier. */
6246 {
6250 {
6253 }
6257 }
6259 /* Before we try to parse the class-name, we must save away the
6260 current PARSER->SCOPE since cp_parser_class_name will destroy
6261 it. */
6265 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6266 there is no need to look for a namespace-name. */
6267 only_class_p = template_keyword_p
6272 typename_keyword_p,
6273 template_keyword_p,
6275 check_dependency_p,
6277 is_declaration,
6280 /* If that didn't work, try for a namespace-name. */
6282 {
6283 /* Restore the saved scope. */
6287 /* If we are not looking at an identifier followed by the scope
6288 resolution operator, then this is not part of a
6289 nested-name-specifier. (Note that this function is only used
6290 to parse the components of a nested-name-specifier.) */
6295 }
6298 }
6300 /* Return true if we are looking at a compound-literal, false otherwise. */
6302 static bool
6304 {
6305 /* Consume the `('. */
6310 /* Skip tokens until the next token is a closing parenthesis.
6311 If we find the closing `)', and the next token is a `{', then
6312 we are looking at a compound-literal. */
6313 bool compound_literal_p
6318 /* Roll back the tokens we skipped. */
6322 }
6324 /* Parse a postfix-expression.
6326 postfix-expression:
6327 primary-expression
6328 postfix-expression [ expression ]
6329 postfix-expression ( expression-list [opt] )
6330 simple-type-specifier ( expression-list [opt] )
6331 typename :: [opt] nested-name-specifier identifier
6332 ( expression-list [opt] )
6333 typename :: [opt] nested-name-specifier template [opt] template-id
6334 ( expression-list [opt] )
6335 postfix-expression . template [opt] id-expression
6336 postfix-expression -> template [opt] id-expression
6337 postfix-expression . pseudo-destructor-name
6338 postfix-expression -> pseudo-destructor-name
6339 postfix-expression ++
6340 postfix-expression --
6341 dynamic_cast < type-id > ( expression )
6342 static_cast < type-id > ( expression )
6343 reinterpret_cast < type-id > ( expression )
6344 const_cast < type-id > ( expression )
6345 typeid ( expression )
6346 typeid ( type-id )
6348 GNU Extension:
6350 postfix-expression:
6351 ( type-id ) { initializer-list , [opt] }
6353 This extension is a GNU version of the C99 compound-literal
6354 construct. (The C99 grammar uses `type-name' instead of `type-id',
6355 but they are essentially the same concept.)
6357 If ADDRESS_P is true, the postfix expression is the operand of the
6358 `&' operator. CAST_P is true if this expression is the target of a
6359 cast.
6361 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6362 class member access expressions [expr.ref].
6364 Returns a representation of the expression. */
6366 static cp_expr
6370 {
6372 location_t loc;
6379 /* Peek at the next token. */
6384 /* Some of the productions are determined by keywords. */
6387 {
6392 {
6393 tree type;
6394 cp_expr expression;
6398 /* All of these can be handled in the same way from the point
6399 of view of parsing. Begin by consuming the token
6400 identifying the cast. */
6403 /* New types cannot be defined in the cast. */
6405 parser->type_definition_forbidden_message
6408 /* Look for the opening `<'. */
6410 /* Parse the type to which we are casting. */
6415 /* Look for the closing `>'. */
6417 /* Restore the old message. */
6420 bool saved_greater_than_is_operator_p
6424 /* And the expression which is being cast. */
6428 RT_CLOSE_PAREN);
6432 parser->greater_than_is_operator_p
6435 /* Only type conversions to integral or enumeration types
6436 can be used in constant-expressions. */
6442 {
6444 postfix_expression
6448 postfix_expression
6452 postfix_expression
6454 tf_warning_or_error);
6457 postfix_expression
6462 }
6464 /* Construct a location e.g. :
6465 reinterpret_cast <int *> (expr)
6466 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6467 ranging from the start of the "*_cast" token to the final closing
6468 paren, with the caret at the start. */
6471 }
6475 {
6476 tree type;
6480 /* Consume the `typeid' token. */
6482 /* Look for the `(' token. */
6484 /* Types cannot be defined in a `typeid' expression. */
6486 parser->type_definition_forbidden_message
6488 /* We can't be sure yet whether we're looking at a type-id or an
6489 expression. */
6491 /* Try a type-id first. */
6496 /* Look for the `)' token. Otherwise, we can't be sure that
6497 we're not looking at an expression: consider `typeid (int
6498 (3))', for example. */
6500 /* If all went well, simply lookup the type-id. */
6503 /* Otherwise, fall back to the expression variant. */
6504 else
6505 {
6506 tree expression;
6508 /* Look for an expression. */
6510 /* Compute its typeid. */
6512 /* Look for the `)' token. */
6514 }
6515 /* Restore the saved message. */
6517 /* `typeid' may not appear in an integral constant expression. */
6520 }
6524 {
6525 tree type;
6526 /* The syntax permitted here is the same permitted for an
6527 elaborated-type-specifier. */
6534 }
6538 {
6539 location_t cilk_spawn_loc
6544 {
6549 }
6551 {
6556 }
6557 else
6558 {
6559 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6562 }
6564 postfix_expression =
6568 {
6572 }
6574 {
6579 }
6580 else
6581 {
6584 postfix_expression);
6585 /* Build a location of the form:
6586 _Cilk_spawn expr
6587 ~~~~~~~~~~~~^~~~
6588 with caret at the expr, ranging from the start of the
6589 _Cilk_spawn token to the end of the expression. */
6590 location_t combined_loc =
6596 }
6598 }
6601 {
6604 tree p;
6618 tf_warning_or_error);
6621 tf_warning_or_error);
6622 else
6623 {
6627 }
6629 }
6632 {
6633 tree type;
6635 /* If the next thing is a simple-type-specifier, we may be
6636 looking at a functional cast. We could also be looking at
6637 an id-expression. So, we try the functional cast, and if
6638 that doesn't work we fall back to the primary-expression. */
6640 /* Look for the simple-type-specifier. */
6644 CP_PARSER_FLAGS_NONE);
6646 /* Parse the cast itself. */
6648 postfix_expression
6650 /* If that worked, we're done. */
6654 /* If the functional-cast didn't work out, try a
6655 compound-literal. */
6658 {
6663 /* Avoid calling cp_parser_type_id pointlessly, see comment
6664 in cp_parser_cast_expression about c++/29234. */
6667 else
6668 {
6669 /* Parse the type. */
6674 /* Look for the `)'. */
6676 }
6678 /* If things aren't going well, there's no need to
6679 keep going. */
6681 {
6683 /* Parse the brace-enclosed initializer list. */
6686 }
6687 /* If that worked, we're definitely looking at a
6688 compound-literal expression. */
6690 {
6691 /* Warn the user that a compound literal is not
6692 allowed in standard C++. */
6695 /* For simplicity, we disallow compound literals in
6696 constant-expressions. We could
6697 allow compound literals of integer type, whose
6698 initializer was a constant, in constant
6699 expressions. Permitting that usage, as a further
6700 extension, would not change the meaning of any
6701 currently accepted programs. (Of course, as
6702 compound literals are not part of ISO C++, the
6703 standard has nothing to say.) */
6705 NIC_NCC))
6706 {
6709 }
6710 /* Form the representation of the compound-literal. */
6711 postfix_expression
6713 tf_warning_or_error);
6716 }
6717 }
6719 /* It must be a primary-expression. */
6720 postfix_expression
6723 decltype_p,
6725 }
6727 }
6729 /* Note that we don't need to worry about calling build_cplus_new on a
6730 class-valued CALL_EXPR in decltype when it isn't the end of the
6731 postfix-expression; unary_complex_lvalue will take care of that for
6732 all these cases. */
6734 /* Keep looping until the postfix-expression is complete. */
6736 {
6740 /* It is not a Koenig lookup function call. */
6741 postfix_expression
6744 /* Peek at the next token. */
6748 {
6751 {
6753 "two consecutive %<[%> shall "
6756 }
6757 postfix_expression
6759 postfix_expression,
6761 decltype_p);
6770 /* postfix-expression ( expression-list [opt] ) */
6771 {
6782 is_builtin_constant_p
6785 {
6786 /* The whole point of __builtin_constant_p is to allow
6787 non-constant expressions to appear as arguments. */
6788 saved_integral_constant_expression_p
6790 saved_non_integral_constant_expression_p
6793 }
6794 args = (cp_parser_parenthesized_expression_list
6800 {
6801 parser->integral_constant_expression_p
6803 parser->non_integral_constant_expression_p
6805 }
6808 {
6811 }
6813 /* Function calls are not permitted in
6814 constant-expressions. */
6817 NIC_FUNC_CALL))
6818 {
6822 }
6827 {
6829 {
6831 {
6834 postfix_expression
6836 complain);
6837 }
6838 else
6839 postfix_expression
6841 }
6842 /* We do not perform argument-dependent lookup if
6843 normal lookup finds a non-function, in accordance
6844 with the expected resolution of DR 218. */
6847 {
6851 /* Do not do argument dependent lookup if regular
6852 lookup finds a member function or a block-scope
6853 function declaration. [basic.lookup.argdep]/3 */
6856 {
6859 postfix_expression
6861 complain);
6862 }
6863 }
6864 }
6870 {
6879 }
6882 {
6892 {
6893 postfix_expression
6897 }
6900 {
6901 postfix_expression
6902 = (build_new_method_call
6908 complain));
6909 }
6910 else
6911 postfix_expression
6915 complain);
6916 }
6920 postfix_expression = (build_offset_ref_call_from_tree
6922 complain));
6924 /* A call to a static class member, or a namespace-scope
6925 function. */
6926 postfix_expression
6929 koenig_p,
6930 complain);
6931 else
6932 /* All other function calls. */
6933 postfix_expression
6936 koenig_p,
6937 complain);
6940 {
6942 start_loc,
6943 close_paren_loc);
6945 }
6947 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6951 }
6956 /* postfix-expression . template [opt] id-expression
6957 postfix-expression . pseudo-destructor-name
6958 postfix-expression -> template [opt] id-expression
6959 postfix-expression -> pseudo-destructor-name */
6961 /* Consume the `.' or `->' operator. */
6964 postfix_expression
6966 postfix_expression,
6973 /* postfix-expression ++ */
6974 /* Consume the `++' token. */
6976 /* Generate a representation for the complete expression. */
6977 postfix_expression
6979 POSTINCREMENT_EXPR);
6980 /* Increments may not appear in constant-expressions. */
6988 /* postfix-expression -- */
6989 /* Consume the `--' token. */
6991 /* Generate a representation for the complete expression. */
6992 postfix_expression
6994 POSTDECREMENT_EXPR);
6995 /* Decrements may not appear in constant-expressions. */
7006 return is_member_access
7007 ? postfix_expression
7009 else
7011 }
7012 }
7014 /* We should never get here. */
7017 }
7019 /* This function parses Cilk Plus array notations. If a normal array expr. is
7020 parsed then the array index is passed back to the caller through *INIT_INDEX
7021 and the function returns a NULL_TREE. If array notation expr. is parsed,
7022 then *INIT_INDEX is ignored by the caller and the function returns
7023 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7024 error_mark_node. */
7026 static tree
7028 tree array_value)
7029 {
7033 {
7036 }
7045 {
7048 }
7050 {
7051 /* Consume the ':'. */
7054 /* If we are here, then we have a case like this A[:]. */
7056 {
7060 }
7064 }
7065 else
7066 {
7067 /* If we are here, then there are three valid possibilities:
7068 1. ARRAY [ EXP ]
7069 2. ARRAY [ EXP : EXP ]
7070 3. ARRAY [ EXP : EXP : EXP ] */
7074 {
7075 /* This indicates that we have a normal array expression. */
7078 }
7080 /* Consume the ':'. */
7084 {
7087 }
7088 }
7093 {
7097 }
7103 }
7105 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7106 by cp_parser_builtin_offsetof. We're looking for
7108 postfix-expression [ expression ]
7109 postfix-expression [ braced-init-list ] (C++11)
7111 FOR_OFFSETOF is set if we're being called in that context, which
7112 changes how we deal with integer constant expressions. */
7114 static tree
7116 tree postfix_expression,
7119 {
7124 /* Consume the `[' token. */
7130 /* Parse the index expression. */
7131 /* ??? For offsetof, there is a question of what to allow here. If
7132 offsetof is not being used in an integral constant expression context,
7133 then we *could* get the right answer by computing the value at runtime.
7134 If we are in an integral constant expression context, then we might
7135 could accept any constant expression; hard to say without analysis.
7136 Rather than open the barn door too wide right away, allow only integer
7137 constant expressions here. */
7140 else
7141 {
7143 {
7150 {
7152 "braced list index is not allowed with array "
7156 }
7157 }
7159 {
7160 /* Here are have these two options:
7161 ARRAY[EXP : EXP] - Array notation expr with default
7162 stride of 1.
7163 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7164 stride. */
7166 postfix_expression);
7169 }
7170 else
7172 }
7176 /* Look for the closing `]'. */
7179 /* Build the ARRAY_REF. */
7183 /* When not doing offsetof, array references are not permitted in
7184 constant-expressions. */
7190 }
7192 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7193 by cp_parser_builtin_offsetof. We're looking for
7195 postfix-expression . template [opt] id-expression
7196 postfix-expression . pseudo-destructor-name
7197 postfix-expression -> template [opt] id-expression
7198 postfix-expression -> pseudo-destructor-name
7200 FOR_OFFSETOF is set if we're being called in that context. That sorta
7201 limits what of the above we'll actually accept, but nevermind.
7202 TOKEN_TYPE is the "." or "->" token, which will already have been
7203 removed from the stream. */
7205 static tree
7208 cp_expr postfix_expression,
7210 location_t location)
7211 {
7212 tree name;
7218 /* If this is a `->' operator, dereference the pointer. */
7221 tf_warning_or_error);
7222 /* Check to see whether or not the expression is type-dependent and
7223 not the current instantiation. */
7225 /* The identifier following the `->' or `.' is not qualified. */
7231 /* Enter the scope corresponding to the type of the object
7232 given by the POSTFIX_EXPRESSION. */
7234 {
7236 /* According to the standard, no expression should ever have
7237 reference type. Unfortunately, we do not currently match
7238 the standard in this respect in that our internal representation
7239 of an expression may have reference type even when the standard
7240 says it does not. Therefore, we have to manually obtain the
7241 underlying type here. */
7243 /* The type of the POSTFIX_EXPRESSION must be complete. */
7244 /* Unlike the object expression in other contexts, *this is not
7245 required to be of complete type for purposes of class member
7246 access (5.2.5) outside the member function body. */
7248 && !(processing_template_decl
7249 && current_class_type
7250 && (same_type_ignoring_top_level_qualifiers_p
7253 /* Let the name lookup machinery know that we are processing a
7254 class member access expression. */
7256 /* If something went wrong, we want to be able to discern that case,
7257 as opposed to the case where there was no SCOPE due to the type
7258 of expression being dependent. */
7261 /* If the SCOPE was erroneous, make the various semantic analysis
7262 functions exit quickly -- and without issuing additional error
7263 messages. */
7266 }
7267 else
7268 /* Tell cp_parser_lookup_name that there was an object, even though it's
7269 type-dependent. */
7272 /* Assume this expression is not a pseudo-destructor access. */
7275 /* If the SCOPE is a scalar type, then, if this is a valid program,
7276 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7277 is type dependent, it can be pseudo-destructor-name or something else.
7278 Try to parse it as pseudo-destructor-name first. */
7280 {
7281 tree s;
7282 tree type;
7285 /* Parse the pseudo-destructor-name. */
7294 {
7296 postfix_expression
7299 }
7300 }
7303 {
7304 /* If the SCOPE is not a scalar type, we are looking at an
7305 ordinary class member access expression, rather than a
7306 pseudo-destructor-name. */
7309 /* Parse the id-expression. */
7310 name = (cp_parser_id_expression
7317 /* In general, build a SCOPE_REF if the member name is qualified.
7318 However, if the name was not dependent and has already been
7319 resolved; there is no need to build the SCOPE_REF. For example;
7321 struct X { void f(); };
7322 template <typename T> void f(T* t) { t->X::f(); }
7324 Even though "t" is dependent, "X::f" is not and has been resolved
7325 to a BASELINK; there is no need to include scope information. */
7327 /* But we do need to remember that there was an explicit scope for
7328 virtual function calls. */
7332 /* If the name is a template-id that names a type, we will get a
7333 TYPE_DECL here. That is invalid code. */
7335 {
7338 }
7339 else
7340 {
7342 {
7344 {
7348 }
7349 else
7352 name,
7353 template_p);
7357 }
7359 adjust_result_of_qualified_name_lookup
7361 postfix_expression
7363 template_p,
7364 tf_warning_or_error);
7365 /* Build a location e.g.:
7366 ptr->access_expr
7367 ~~~^~~~~~~~~~~~~
7368 where the caret is at the deref token, ranging from
7369 the start of postfix_expression to the end of the access expr. */
7370 location_t end_loc
7372 location_t combined_loc
7375 }
7376 }
7378 /* We no longer need to look up names in the scope of the object on
7379 the left-hand side of the `.' or `->' operator. */
7382 /* Outside of offsetof, these operators may not appear in
7383 constant-expressions. */
7385 && (cp_parser_non_integral_constant_expression
7390 }
7392 /* Parse a parenthesized expression-list.
7394 expression-list:
7395 assignment-expression
7396 expression-list, assignment-expression
7398 attribute-list:
7399 expression-list
7400 identifier
7401 identifier, expression-list
7403 CAST_P is true if this expression is the target of a cast.
7405 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7406 argument pack.
7408 Returns a vector of trees. Each element is a representation of an
7409 assignment-expression. NULL is returned if the ( and or ) are
7410 missing. An empty, but allocated, vector is returned on no
7411 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7412 if we are parsing an attribute list for an attribute that wants a
7413 plain identifier argument, normal_attr for an attribute that wants
7414 an expression, or non_attr if we aren't parsing an attribute list. If
7415 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7416 not all of the expressions in the list were constant.
7417 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7418 will be written to with the location of the closing parenthesis. If
7419 an error occurs, it may or may not be written to. */
7428 {
7434 /* Assume all the expressions will be constant. */
7443 /* Within a parenthesized expression, a `>' token is always
7444 the greater-than operator. */
7445 saved_greater_than_is_operator_p
7449 /* Consume expressions until there are no more. */
7452 {
7453 tree expr;
7455 /* At the beginning of attribute lists, check to see if the
7456 next token is an identifier. */
7459 {
7462 /* Consume the identifier. */
7464 /* Save the identifier. */
7466 }
7467 else
7468 {
7471 /* Parse the next assignment-expression. */
7473 {
7474 /* A braced-init-list. */
7480 }
7482 {
7483 expr = (cp_parser_constant_expression
7488 }
7489 else
7491 cast_p);
7496 /* If we have an ellipsis, then this is an expression
7497 expansion. */
7500 {
7501 /* Consume the `...'. */
7504 /* Build the argument pack. */
7506 }
7508 /* Add it to the list. We add error_mark_node
7509 expressions to the list, so that we can still tell if
7510 the correct form for a parenthesized expression-list
7511 is found. That gives better errors. */
7516 }
7518 /* After the first item, attribute lists look the same as
7519 expression lists. */
7522 get_comma:;
7523 /* If the next token isn't a `,', then we are done. */
7527 /* Otherwise, consume the `,' and keep going. */
7529 }
7535 {
7538 skip_comma:;
7539 /* We try and resync to an unnested comma, as that will give the
7540 user better diagnostics. */
7548 {
7549 parser->greater_than_is_operator_p
7552 }
7553 }
7555 parser->greater_than_is_operator_p
7562 }
7564 /* Parse a pseudo-destructor-name.
7566 pseudo-destructor-name:
7567 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7568 :: [opt] nested-name-specifier template template-id :: ~ type-name
7569 :: [opt] nested-name-specifier [opt] ~ type-name
7571 If either of the first two productions is used, sets *SCOPE to the
7572 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7573 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7574 or ERROR_MARK_NODE if the parse fails. */
7576 static void
7578 tree object,
7581 {
7584 /* Handle ~auto. */
7588 {
7591 "%<~auto%> only available with "
7598 }
7600 /* Assume that things will not work out. */
7603 /* Look for the optional `::' operator. */
7605 /* Look for the optional nested-name-specifier. */
7606 nested_name_specifier_p
7613 /* Now, if we saw a nested-name-specifier, we might be doing the
7614 second production. */
7617 {
7618 /* Consume the `template' keyword. */
7620 /* Parse the template-id. */
7624 class_type,
7626 /* Look for the `::' token. */
7628 }
7629 /* If the next token is not a `~', then there might be some
7630 additional qualification. */
7632 {
7633 /* At this point, we're looking for "type-name :: ~". The type-name
7634 must not be a class-name, since this is a pseudo-destructor. So,
7635 it must be either an enum-name, or a typedef-name -- both of which
7636 are just identifiers. So, we peek ahead to check that the "::"
7637 and "~" tokens are present; if they are not, then we can avoid
7638 calling type_name. */
7642 {
7645 }
7647 /* Look for the type-name. */
7652 /* Look for the `::' token. */
7654 }
7655 else
7658 /* Look for the `~'. */
7661 /* Once we see the ~, this has to be a pseudo-destructor. */
7665 /* Look for the type-name again. We are not responsible for
7666 checking that it matches the first type-name. */
7668 }
7670 /* Parse a unary-expression.
7672 unary-expression:
7673 postfix-expression
7674 ++ cast-expression
7675 -- cast-expression
7676 unary-operator cast-expression
7677 sizeof unary-expression
7678 sizeof ( type-id )
7679 alignof ( type-id ) [C++0x]
7680 new-expression
7681 delete-expression
7683 GNU Extensions:
7685 unary-expression:
7686 __extension__ cast-expression
7687 __alignof__ unary-expression
7688 __alignof__ ( type-id )
7689 alignof unary-expression [C++0x]
7690 __real__ cast-expression
7691 __imag__ cast-expression
7692 && identifier
7693 sizeof ( type-id ) { initializer-list , [opt] }
7694 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7695 __alignof__ ( type-id ) { initializer-list , [opt] }
7697 ADDRESS_P is true iff the unary-expression is appearing as the
7698 operand of the `&' operator. CAST_P is true if this expression is
7699 the target of a cast.
7701 Returns a representation of the expression. */
7703 static cp_expr
7706 {
7710 /* Peek at the next token. */
7712 /* Some keywords give away the kind of expression. */
7714 {
7718 {
7721 {
7724 location_t first_loc;
7727 /* Consume the token. */
7730 /* Parse the operand. */
7735 else
7736 {
7737 /* ISO C++ defines alignof only with types, not with
7738 expressions. So pedwarn if alignof is used with a non-
7739 type expression. However, __alignof__ is ok. */
7742 "ISO C++ does not allow %<alignof%> "
7746 }
7747 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7748 SIZEOF_EXPR with the original operand. */
7750 {
7752 {
7754 {
7757 error_mark_node));
7759 }
7760 else
7764 }
7766 }
7768 }
7777 {
7778 /* The saved value of the PEDANTIC flag. */
7780 tree expr;
7782 /* Save away the PEDANTIC flag. */
7784 /* Parse the cast-expression. */
7786 /* Restore the PEDANTIC flag. */
7790 }
7794 {
7795 tree expression;
7797 /* Consume the `__real__' or `__imag__' token. */
7799 /* Parse the cast-expression. */
7801 /* Create the complete representation. */
7805 expression,
7806 tf_warning_or_error);
7807 }
7815 {
7816 tree expr;
7826 parser->type_definition_forbidden_message
7829 saved_integral_constant_expression_p
7831 saved_non_integral_constant_expression_p
7835 saved_greater_than_is_operator_p
7847 parser->greater_than_is_operator_p
7850 parser->integral_constant_expression_p
7852 parser->non_integral_constant_expression_p
7859 }
7863 }
7864 }
7866 /* Look for the `:: new' and `:: delete', which also signal the
7867 beginning of a new-expression, or delete-expression,
7868 respectively. If the next token is `::', then it might be one of
7869 these. */
7871 {
7874 /* See if the token after the `::' is one of the keywords in
7875 which we're interested. */
7877 /* If it's `new', we have a new-expression. */
7880 /* Similarly, for `delete'. */
7883 }
7885 /* Look for a unary operator. */
7887 /* The `++' and `--' operators can be handled similarly, even though
7888 they are not technically unary-operators in the grammar. */
7890 {
7895 /* Handle the GNU address-of-label extension. */
7898 {
7899 tree identifier;
7900 tree expression;
7903 /* Consume the '&&' token. */
7905 /* Look for the identifier. */
7906 location_t finish_loc
7909 /* Construct a location of the form:
7910 &&label
7911 ^~~~~~~
7912 with caret==start at the "&&", finish at the end of the label. */
7913 location_t combined_loc
7915 /* Create an expression representing the address. */
7918 NIC_ADDR_LABEL))
7921 }
7922 }
7924 {
7925 cp_expr cast_expression;
7931 /* Consume the operator token. */
7935 /* Parse the cast-expression. */
7936 cast_expression
7941 pidk);
7943 /* Make a location:
7944 OP_TOKEN CAST_EXPRESSION
7945 ^~~~~~~~~~~~~~~~~~~~~~~~~
7946 with start==caret at the operator token, and
7947 extending to the end of the cast_expression. */
7950 /* Now, build an appropriate representation. */
7952 {
7956 RO_UNARY_STAR,
7957 complain);
7958 /* TODO: build_x_indirect_ref does not always honor the
7959 location, so ensure it is set. */
7965 /* Fall through. */
7968 cast_expression,
7969 complain);
7970 /* TODO: build_x_unary_op does not always honor the location,
7971 so ensure it is set. */
7979 /* Fall through. */
7981 /* Immediately fold negation of a constant, unless the constant is 0
7982 (since -0 == 0) or it would overflow. */
7987 {
7990 cast_expression);
7992 {
7995 }
7996 }
7997 /* Fall through. */
8006 }
8010 non_constant_p))
8014 }
8018 decltype_p,
8019 pidk);
8020 }
8022 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8023 unary-operator, the corresponding tree code is returned. */
8025 static enum tree_code
8027 {
8029 {
8050 }
8051 }
8053 /* Parse a new-expression.
8055 new-expression:
8056 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8057 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8059 Returns a representation of the expression. */
8061 static tree
8063 {
8066 tree type;
8069 tree ret;
8073 /* Look for the optional `::' operator. */
8074 global_scope_p
8078 /* Look for the `new' operator. */
8080 /* There's no easy way to tell a new-placement from the
8081 `( type-id )' construct. */
8083 /* Look for a new-placement. */
8085 /* If that didn't work out, there's no new-placement. */
8087 {
8091 }
8093 /* If the next token is a `(', then we have a parenthesized
8094 type-id. */
8096 {
8100 /* Consume the `('. */
8103 /* Parse the type-id. */
8104 parser->type_definition_forbidden_message
8106 {
8109 }
8112 /* Look for the closing `)'. */
8115 /* There should not be a direct-new-declarator in this production,
8116 but GCC used to allowed this, so we check and emit a sensible error
8117 message for this case. */
8119 {
8125 }
8126 }
8127 /* Otherwise, there must be a new-type-id. */
8128 else
8131 /* If the next token is a `(' or '{', then we have a new-initializer. */
8136 else
8139 /* A new-expression may not appear in an integral constant
8140 expression. */
8143 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8144 of a new-type-id or type-id of a new-expression, the new-expression shall
8145 contain a new-initializer of the form ( assignment-expression )".
8146 Additionally, consistently with the spirit of DR 1467, we want to accept
8147 'new auto { 2 }' too. */
8152 {
8154 "initialization of new-expression for type %<auto%> "
8157 }
8158 else
8159 {
8160 /* Construct a location e.g.:
8161 ptr = new int[100]
8162 ^~~~~~~~~~~~
8163 with caret == start at the start of the "new" token, and the end
8164 at the end of the final token we consumed. */
8169 /* Create a representation of the new-expression. */
8171 tf_warning_or_error);
8173 }
8181 }
8183 /* Parse a new-placement.
8185 new-placement:
8186 ( expression-list )
8188 Returns the same representation as for an expression-list. */
8192 {
8195 /* Parse the expression-list. */
8196 expression_list = (cp_parser_parenthesized_expression_list
8205 }
8207 /* Parse a new-type-id.
8209 new-type-id:
8210 type-specifier-seq new-declarator [opt]
8212 Returns the TYPE allocated. If the new-type-id indicates an array
8213 type, *NELTS is set to the number of elements in the last array
8214 bound; the TYPE will not include the last array bound. */
8216 static tree
8218 {
8219 cp_decl_specifier_seq type_specifier_seq;
8225 /* The type-specifier sequence must not contain type definitions.
8226 (It cannot contain declarations of new types either, but if they
8227 are not definitions we will catch that because they are not
8228 complete.) */
8230 parser->type_definition_forbidden_message
8232 /* Parse the type-specifier-seq. */
8236 /* Restore the old message. */
8242 /* Parse the new-declarator. */
8245 /* Determine the number of elements in the last array dimension, if
8246 any. */
8248 /* Skip down to the last array dimension. */
8253 {
8256 }
8261 {
8264 }
8267 {
8274 else
8276 }
8279 }
8281 /* Parse an (optional) new-declarator.
8283 new-declarator:
8284 ptr-operator new-declarator [opt]
8285 direct-new-declarator
8287 Returns the declarator. */
8291 {
8294 cp_cv_quals cv_quals;
8296 /* We don't know if there's a ptr-operator next, or not. */
8298 /* Look for a ptr-operator. */
8300 /* If that worked, look for more new-declarators. */
8302 {
8305 /* Parse another optional declarator. */
8308 declarator = cp_parser_make_indirect_declarator
8312 }
8314 /* If the next token is a `[', there is a direct-new-declarator. */
8319 }
8321 /* Parse a direct-new-declarator.
8323 direct-new-declarator:
8324 [ expression ]
8325 direct-new-declarator [constant-expression]
8327 */
8331 {
8335 {
8336 tree expression;
8339 /* Look for the opening `['. */
8344 /* The standard requires that the expression have integral
8345 type. DR 74 adds enumeration types. We believe that the
8346 real intent is that these expressions be handled like the
8347 expression in a `switch' condition, which also allows
8348 classes with a single conversion to integral or
8349 enumeration type. */
8351 {
8352 expression
8354 expression,
8357 {
8359 "expression in new-declarator must have integral "
8362 }
8363 }
8365 /* Look for the closing `]'. */
8368 /* Add this bound to the declarator. */
8371 /* If the next token is not a `[', then there are no more
8372 bounds. */
8375 }
8378 }
8380 /* Parse a new-initializer.
8382 new-initializer:
8383 ( expression-list [opt] )
8384 braced-init-list
8386 Returns a representation of the expression-list. */
8390 {
8394 {
8395 tree t;
8402 }
8403 else
8404 expression_list = (cp_parser_parenthesized_expression_list
8410 }
8412 /* Parse a delete-expression.
8414 delete-expression:
8415 :: [opt] delete cast-expression
8416 :: [opt] delete [ ] cast-expression
8418 Returns a representation of the expression. */
8420 static tree
8422 {
8425 tree expression;
8427 /* Look for the optional `::' operator. */
8428 global_scope_p
8432 /* Look for the `delete' keyword. */
8434 /* See if the array syntax is in use. */
8436 {
8437 /* Consume the `[' token. */
8439 /* Look for the `]' token. */
8441 /* Remember that this is the `[]' construct. */
8443 }
8444 else
8447 /* Parse the cast-expression. */
8450 /* A delete-expression may not appear in an integral constant
8451 expression. */
8456 tf_warning_or_error);
8457 }
8459 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8460 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8461 0 otherwise. */
8463 static int
8465 {
8468 {
8510 /* In ((type ()) () the last () isn't a valid cast-expression,
8511 so the whole must be parsed as postfix-expression. */
8516 /* '[' may start a primary-expression in obj-c++ and in C++11,
8517 as a lambda-expression, eg, '(void)[]{}'. */
8524 /* '++' and '--' may or may not start a cast-expression:
8526 struct T { void operator++(int); };
8527 void f() { (T())++; }
8529 vs
8531 int a;
8532 (int)++a; */
8537 }
8538 }
8540 /* Parse a cast-expression.
8542 cast-expression:
8543 unary-expression
8544 ( type-id ) cast-expression
8546 ADDRESS_P is true iff the unary-expression is appearing as the
8547 operand of the `&' operator. CAST_P is true if this expression is
8548 the target of a cast.
8550 Returns a representation of the expression. */
8552 static cp_expr
8555 {
8556 /* If it's a `(', then we might be looking at a cast. */
8558 {
8564 /* There's no way to know yet whether or not this is a cast.
8565 For example, `(int (3))' is a unary-expression, while `(int)
8566 3' is a cast. So, we resort to parsing tentatively. */
8568 /* Types may not be defined in a cast. */
8570 parser->type_definition_forbidden_message
8572 /* Consume the `('. */
8576 /* A very tricky bit is that `(struct S) { 3 }' is a
8577 compound-literal (which we permit in C++ as an extension).
8578 But, that construct is not a cast-expression -- it is a
8579 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8580 is legal; if the compound-literal were a cast-expression,
8581 you'd need an extra set of parentheses.) But, if we parse
8582 the type-id, and it happens to be a class-specifier, then we
8583 will commit to the parse at that point, because we cannot
8584 undo the action that is done when creating a new class. So,
8585 then we cannot back up and do a postfix-expression.
8587 Another tricky case is the following (c++/29234):
8589 struct S { void operator () (); };
8591 void foo ()
8592 {
8593 ( S()() );
8594 }
8596 As a type-id we parse the parenthesized S()() as a function
8597 returning a function, groktypename complains and we cannot
8598 back up in this case either.
8600 Therefore, we scan ahead to the closing `)', and check to see
8601 if the tokens after the `)' can start a cast-expression. Otherwise
8602 we are dealing with an unary-expression, a postfix-expression
8603 or something else.
8605 Yet another tricky case, in C++11, is the following (c++/54891):
8607 (void)[]{};
8609 The issue is that usually, besides the case of lambda-expressions,
8610 the parenthesized type-id cannot be followed by '[', and, eg, we
8611 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8612 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8613 we don't commit, we try a cast-expression, then an unary-expression.
8615 Save tokens so that we can put them back. */
8618 /* We may be looking at a cast-expression. */
8621 cast_expression
8624 /* Roll back the tokens we skipped. */
8626 /* If we aren't looking at a cast-expression, simulate an error so
8627 that the call to cp_parser_error_occurred below returns true. */
8630 else
8631 {
8634 /* Look for the type-id. */
8636 /* Look for the closing `)'. */
8639 }
8641 /* Restore the saved message. */
8644 /* At this point this can only be either a cast or a
8645 parenthesized ctor such as `(T ())' that looks like a cast to
8646 function returning T. */
8648 {
8649 /* Only commit if the cast-expression doesn't start with
8650 '++', '--', or '[' in C++11. */
8658 pidk);
8661 {
8662 /* Warn about old-style casts, if so requested. */
8669 /* Only type conversions to integral or enumeration types
8670 can be used in constant-expressions. */
8673 NIC_CAST))
8676 /* Perform the cast. */
8677 /* Make a location:
8678 (TYPE) EXPR
8679 ^~~~~~~~~~~
8680 with start==caret at the open paren, extending to the
8681 end of "expr". */
8683 open_paren_loc,
8687 }
8688 }
8689 else
8691 }
8693 /* If we get here, then it's not a cast, so it must be a
8694 unary-expression. */
8697 }
8699 /* Parse a binary expression of the general form:
8701 pm-expression:
8702 cast-expression
8703 pm-expression .* cast-expression
8704 pm-expression ->* cast-expression
8706 multiplicative-expression:
8707 pm-expression
8708 multiplicative-expression * pm-expression
8709 multiplicative-expression / pm-expression
8710 multiplicative-expression % pm-expression
8712 additive-expression:
8713 multiplicative-expression
8714 additive-expression + multiplicative-expression
8715 additive-expression - multiplicative-expression
8717 shift-expression:
8718 additive-expression
8719 shift-expression << additive-expression
8720 shift-expression >> additive-expression
8722 relational-expression:
8723 shift-expression
8724 relational-expression < shift-expression
8725 relational-expression > shift-expression
8726 relational-expression <= shift-expression
8727 relational-expression >= shift-expression
8729 GNU Extension:
8731 relational-expression:
8732 relational-expression <? shift-expression
8733 relational-expression >? shift-expression
8735 equality-expression:
8736 relational-expression
8737 equality-expression == relational-expression
8738 equality-expression != relational-expression
8740 and-expression:
8741 equality-expression
8742 and-expression & equality-expression
8744 exclusive-or-expression:
8745 and-expression
8746 exclusive-or-expression ^ and-expression
8748 inclusive-or-expression:
8749 exclusive-or-expression
8750 inclusive-or-expression | exclusive-or-expression
8752 logical-and-expression:
8753 inclusive-or-expression
8754 logical-and-expression && inclusive-or-expression
8756 logical-or-expression:
8757 logical-and-expression
8758 logical-or-expression || logical-and-expression
8760 All these are implemented with a single function like:
8762 binary-expression:
8763 simple-cast-expression
8764 binary-expression <token> binary-expression
8766 CAST_P is true if this expression is the target of a cast.
8768 The binops_by_token map is used to get the tree codes for each <token> type.
8769 binary-expressions are associated according to a precedence table. */
8771 #define TOKEN_PRECEDENCE(token) \
8772 (((token->type == CPP_GREATER \
8773 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8774 && !parser->greater_than_is_operator_p) \
8775 ? PREC_NOT_OPERATOR \
8776 : binops_by_token[token->type].prec)
8778 static cp_expr
8784 {
8785 cp_parser_expression_stack stack;
8787 cp_parser_expression_stack_entry current;
8788 cp_expr rhs;
8792 tree overload;
8794 /* Parse the first expression. */
8805 {
8806 /* Get an operator token. */
8812 {
8814 "%<>>%> operator is treated"
8818 }
8823 /* This is a fold-expression; handle it later. */
8826 /* Popping an entry off the stack means we completed a subexpression:
8827 - either we found a token which is not an operator (`>' where it is not
8828 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8829 will happen repeatedly;
8830 - or, we found an operator which has lower priority. This is the case
8831 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8832 parsing `3 * 4'. */
8834 {
8837 else
8839 }
8841 get_rhs:
8845 /* We used the operator token. */
8848 /* For "false && x" or "true || x", x will never be executed;
8849 disable warnings while evaluating it. */
8851 c_inhibit_evaluation_warnings +=
8854 c_inhibit_evaluation_warnings +=
8857 /* Extract another operand. It may be the RHS of this expression
8858 or the LHS of a new, higher priority expression. */
8863 /* Get another operator token. Look up its precedence to avoid
8864 building a useless (immediately popped) stack entry for common
8865 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8872 {
8873 /* ... and prepare to parse the RHS of the new, higher priority
8874 expression. Since precedence levels on the stack are
8875 monotonically increasing, we do not have to care about
8876 stack overflows. */
8885 pop:
8887 /* If the stack is not empty, we have parsed into LHS the right side
8888 (`4' in the example above) of an expression we had suspended.
8889 We can use the information on the stack to recover the LHS (`3')
8890 from the stack together with the tree code (`MULT_EXPR'), and
8891 the precedence of the higher level subexpression
8892 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8893 which will be used to actually build the additive expression. */
8898 }
8900 /* Undo the disabling of warnings done above. */
8902 c_inhibit_evaluation_warnings -=
8905 c_inhibit_evaluation_warnings -=
8911 /* Avoid warning for !!x == y. */
8916 /* Avoid warning for !b == y where b is boolean. */
8920 /* Avoid warning for !!b == y where b is boolean. */
8933 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8934 ERROR_MARK for everything that is not a binary expression.
8935 This makes warn_about_parentheses miss some warnings that
8936 involve unary operators. For unary expressions we should
8937 pass the correct tree_code unless the unary expression was
8938 surrounded by parentheses.
8939 */
8946 == tcc_comparison
8949 else
8950 {
8955 /* TODO: build_x_binary_op doesn't always honor the location. */
8957 }
8960 /* If the binary operator required the use of an overloaded operator,
8961 then this expression cannot be an integral constant-expression.
8962 An overloaded operator can be used even if both operands are
8963 otherwise permissible in an integral constant-expression if at
8964 least one of the operands is of enumeration type. */
8968 NIC_OVERLOADED))
8970 }
8973 }
8975 static cp_expr
8980 {
8983 }
8985 /* Parse the `? expression : assignment-expression' part of a
8986 conditional-expression. The LOGICAL_OR_EXPR is the
8987 logical-or-expression that started the conditional-expression.
8988 Returns a representation of the entire conditional-expression.
8990 This routine is used by cp_parser_assignment_expression.
8992 ? expression : assignment-expression
8994 GNU Extensions:
8996 ? : assignment-expression */
8998 static tree
9000 {
9002 cp_expr assignment_expr;
9006 /* Consume the `?' token. */
9011 {
9014 /* Implicit true clause. */
9016 c_inhibit_evaluation_warnings +=
9019 }
9020 else
9021 {
9024 /* Parse the expression. */
9025 c_inhibit_evaluation_warnings +=
9028 c_inhibit_evaluation_warnings +=
9032 }
9034 /* The next token should be a `:'. */
9036 /* Parse the assignment-expression. */
9038 c_inhibit_evaluation_warnings -=
9041 /* Make a location:
9042 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9043 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9044 with the caret at the "?", ranging from the start of
9045 the logical_or_expr to the end of the assignment_expr. */
9050 /* Build the conditional-expression. */
9052 expr,
9053 assignment_expr,
9054 tf_warning_or_error);
9055 }
9057 /* Parse an assignment-expression.
9059 assignment-expression:
9060 conditional-expression
9061 logical-or-expression assignment-operator assignment_expression
9062 throw-expression
9064 CAST_P is true if this expression is the target of a cast.
9065 DECLTYPE_P is true if this expression is the operand of decltype.
9067 Returns a representation for the expression. */
9069 static cp_expr
9072 {
9073 cp_expr expr;
9075 /* If the next token is the `throw' keyword, then we're looking at
9076 a throw-expression. */
9079 /* Otherwise, it must be that we are looking at a
9080 logical-or-expression. */
9081 else
9082 {
9083 /* Parse the binary expressions (logical-or-expression). */
9085 decltype_p,
9087 /* If the next token is a `?' then we're actually looking at a
9088 conditional-expression. */
9091 else
9092 {
9095 /* If it's an assignment-operator, we're using the second
9096 production. */
9097 enum tree_code assignment_operator
9100 {
9103 /* Parse the right-hand side of the assignment. */
9110 /* An assignment may not appear in a
9111 constant-expression. */
9113 NIC_ASSIGNMENT))
9115 /* Build the assignment expression. Its default
9116 location:
9117 LHS = RHS
9118 ~~~~^~~~~
9119 is the location of the '=' token as the
9120 caret, ranging from the start of the lhs to the
9121 end of the rhs. */
9126 assignment_operator,
9127 rhs,
9129 /* TODO: build_x_modify_expr doesn't honor the location,
9130 so we must set it here. */
9132 }
9133 }
9134 }
9137 }
9139 /* Parse an (optional) assignment-operator.
9141 assignment-operator: one of
9142 = *= /= %= += -= >>= <<= &= ^= |=
9144 GNU Extension:
9146 assignment-operator: one of
9147 <?= >?=
9149 If the next token is an assignment operator, the corresponding tree
9150 code is returned, and the token is consumed. For example, for
9151 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9152 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9153 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9154 operator, ERROR_MARK is returned. */
9156 static enum tree_code
9158 {
9162 /* Peek at the next token. */
9166 {
9212 /* Nothing else is an assignment operator. */
9214 }
9216 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9221 /* If it was an assignment operator, consume it. */
9226 }
9228 /* Parse an expression.
9230 expression:
9231 assignment-expression
9232 expression , assignment-expression
9234 CAST_P is true if this expression is the target of a cast.
9235 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9236 except possibly parenthesized or on the RHS of a comma (N3276).
9238 Returns a representation of the expression. */
9240 static cp_expr
9243 {
9248 {
9249 cp_expr assignment_expression;
9251 /* Parse the next assignment-expression. */
9252 assignment_expression
9255 /* We don't create a temporary for a call that is the immediate operand
9256 of decltype or on the RHS of a comma. But when we see a comma, we
9257 need to create a temporary for a call on the LHS. */
9262 assignment_expression
9266 /* If this is the first assignment-expression, we can just
9267 save it away. */
9270 else
9271 {
9272 /* Create a location with caret at the comma, ranging
9273 from the start of the LHS to the end of the RHS. */
9278 assignment_expression,
9281 }
9282 /* If the next token is not a comma, or we're in a fold-expression, then
9283 we are done with the expression. */
9287 /* Consume the `,'. */
9290 /* A comma operator cannot appear in a constant-expression. */
9293 }
9296 }
9298 /* Parse a constant-expression.
9300 constant-expression:
9301 conditional-expression
9303 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9304 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9305 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9306 is false, NON_CONSTANT_P should be NULL. */
9308 static cp_expr
9312 {
9316 cp_expr expression;
9318 /* It might seem that we could simply parse the
9319 conditional-expression, and then check to see if it were
9320 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9321 one that the compiler can figure out is constant, possibly after
9322 doing some simplifications or optimizations. The standard has a
9323 precise definition of constant-expression, and we must honor
9324 that, even though it is somewhat more restrictive.
9326 For example:
9328 int i[(2, 3)];
9330 is not a legal declaration, because `(2, 3)' is not a
9331 constant-expression. The `,' operator is forbidden in a
9332 constant-expression. However, GCC's constant-folding machinery
9333 will fold this operation to an INTEGER_CST for `3'. */
9335 /* Save the old settings. */
9337 saved_allow_non_integral_constant_expression_p
9340 /* We are now parsing a constant-expression. */
9342 parser->allow_non_integral_constant_expression_p
9345 /* Although the grammar says "conditional-expression", we parse an
9346 "assignment-expression", which also permits "throw-expression"
9347 and the use of assignment operators. In the case that
9348 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9349 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9350 actually essential that we look for an assignment-expression.
9351 For example, cp_parser_initializer_clauses uses this function to
9352 determine whether a particular assignment-expression is in fact
9353 constant. */
9355 /* Restore the old settings. */
9356 parser->integral_constant_expression_p
9358 parser->allow_non_integral_constant_expression_p
9361 {
9362 /* Require an rvalue constant expression here; that's what our
9363 callers expect. Reference constant expressions are handled
9364 separately in e.g. cp_parser_template_argument. */
9369 }
9372 parser->non_integral_constant_expression_p
9376 }
9378 /* Parse __builtin_offsetof.
9380 offsetof-expression:
9381 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9383 offsetof-member-designator:
9384 id-expression
9385 | offsetof-member-designator "." id-expression
9386 | offsetof-member-designator "[" expression "]"
9387 | offsetof-member-designator "->" id-expression */
9389 static cp_expr
9391 {
9393 tree type;
9394 cp_expr expr;
9395 cp_id_kind dummy;
9397 location_t finish_loc;
9399 /* We're about to accept non-integral-constant things, but will
9400 definitely yield an integral constant expression. Save and
9401 restore these values around our local parsing. */
9407 /* Consume the "__builtin_offsetof" token. */
9409 /* Consume the opening `('. */
9411 /* Parse the type-id. */
9414 /* Look for the `,'. */
9418 /* Build the (type *)null that begins the traditional offsetof macro. */
9420 tf_warning_or_error);
9422 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9426 {
9429 {
9431 /* offsetof-member-designator "[" expression "]" */
9437 /* offsetof-member-designator "->" identifier */
9440 /* FALLTHRU */
9443 /* offsetof-member-designator "." identifier */
9451 /* Consume the ")" token. */
9457 /* Error. We know the following require will fail, but
9458 that gives the proper error message. */
9463 }
9464 }
9466 success:
9467 /* Make a location of the form:
9468 __builtin_offsetof (struct s, f)
9469 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9470 with caret at the type-id, ranging from the start of the
9471 "_builtin_offsetof" token to the close paren. */
9473 /* The result will be an INTEGER_CST, so we need to explicitly
9474 preserve the location. */
9477 failure:
9482 }
9484 /* Parse a trait expression.
9486 Returns a representation of the expression, the underlying type
9487 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9489 static tree
9491 {
9492 cp_trait_kind kind;
9498 {
9586 }
9588 /* Consume the token. */
9593 {
9596 }
9602 {
9605 {
9608 }
9612 }
9614 {
9616 {
9620 {
9623 }
9627 }
9628 }
9632 /* Complete the trait expression, which may mean either processing
9633 the trait expr now or saving it for template instantiation. */
9635 {
9644 }
9645 }
9647 /* Lambdas that appear in variable initializer or default argument scope
9648 get that in their mangling, so we need to record it. We might as well
9649 use the count for function and namespace scopes as well. */
9653 {
9654 tree t;
9656 };
9659 static void
9661 {
9662 tree_int ti;
9664 /* Once we're inside a function, we ignore other scopes and just push
9665 the function again so that popping works properly. */
9672 {
9673 /* Don't reset the count if we're still in the same function. */
9676 }
9677 }
9679 static void
9681 {
9684 }
9686 static void
9688 {
9691 {
9694 }
9696 }
9698 /* Parse a lambda expression.
9700 lambda-expression:
9701 lambda-introducer lambda-declarator [opt] compound-statement
9703 Returns a representation of the expression. */
9705 static cp_expr
9707 {
9709 tree type;
9717 {
9719 {
9723 }
9725 }
9727 {
9729 {
9732 }
9734 }
9736 /* We may be in the middle of deferred access check. Disable
9737 it now. */
9748 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9751 /* Now that we've started the type, add the capture fields for any
9752 explicit captures. */
9755 {
9756 /* Inside the class, surrounding template-parameter-lists do not apply. */
9757 unsigned int saved_num_template_parameter_lists
9761 bool fully_implicit_function_template_p
9765 bool auto_is_implicit_function_template_parm_p
9776 /* By virtue of defining a local class, a lambda expression has access to
9777 the private variables of enclosing classes. */
9785 {
9790 }
9792 {
9795 }
9797 /* The capture list was built up in reverse order; fix that now. */
9809 parser->fully_implicit_function_template_p
9813 parser->auto_is_implicit_function_template_parm_p
9815 }
9817 /* This field is only used during parsing of the lambda. */
9820 /* This lambda shouldn't have any proxies left at this point. */
9822 /* And now that we're done, push proxies for an enclosing lambda. */
9827 else
9835 }
9837 /* Parse the beginning of a lambda expression.
9839 lambda-introducer:
9840 [ lambda-capture [opt] ]
9842 LAMBDA_EXPR is the current representation of the lambda expression. */
9844 static void
9846 {
9847 /* Need commas after the first capture. */
9850 /* Eat the leading `['. */
9853 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9861 {
9864 }
9867 {
9869 tree capture_id;
9870 tree capture_init_expr;
9874 enum capture_kind_type
9875 {
9876 BY_COPY,
9877 BY_REFERENCE
9878 };
9882 {
9885 }
9889 else
9892 /* Possibly capture `this'. */
9894 {
9904 explicit_init_p);
9906 }
9908 /* Possibly capture `*this'. */
9911 {
9922 explicit_init_p);
9924 }
9926 /* Remember whether we want to capture as a reference or not. */
9928 {
9931 }
9933 /* Get the identifier. */
9938 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9939 delimiters, but I modified this to stop on unnested ']' as well. It
9940 was already changed to stop on unnested '}', so the
9941 "closing_parenthesis" name is no more misleading with my change. */
9942 {
9948 }
9950 /* Find the initializer for this capture. */
9954 {
9956 /* An explicit initializer exists. */
9959 "lambda capture initializers "
9965 {
9968 }
9969 }
9970 else
9971 {
9974 /* Turn the identifier into an id-expression. */
9975 capture_init_expr
9980 {
9983 }
9987 {
9990 capture_init_expr);
9994 }
9997 {
10000 capture_init_expr))
10004 }
10006 capture_init_expr
10007 = finish_id_expression
10009 capture_init_expr,
10023 {
10026 }
10027 else
10029 }
10033 {
10038 capture_id);
10042 "capture of %qD redundant with by-reference capture "
10044 }
10047 capture_id,
10048 capture_init_expr,
10050 explicit_init_p);
10051 }
10054 }
10056 /* Parse the (optional) middle of a lambda expression.
10058 lambda-declarator:
10059 < template-parameter-list [opt] >
10060 ( parameter-declaration-clause [opt] )
10061 attribute-specifier [opt]
10062 decl-specifier-seq [opt]
10063 exception-specification [opt]
10064 lambda-return-type-clause [opt]
10066 LAMBDA_EXPR is the current representation of the lambda expression. */
10068 static bool
10070 {
10071 /* 5.1.1.4 of the standard says:
10072 If a lambda-expression does not include a lambda-declarator, it is as if
10073 the lambda-declarator were ().
10074 This means an empty parameter list, no attributes, and no exception
10075 specification. */
10081 cp_decl_specifier_seq lambda_specs;
10084 /* The template-parameter-list is optional, but must begin with
10085 an opening angle if present. */
10087 {
10090 "lambda templates are only available with "
10099 /* We just processed one more parameter list. */
10101 }
10103 /* The parameter-declaration-clause is optional (unless
10104 template-parameter-list was given), but must begin with an
10105 opening parenthesis if present. */
10107 {
10112 /* Parse parameters. */
10115 /* Default arguments shall not be specified in the
10116 parameter-declaration-clause of a lambda-declarator. */
10126 /* In the decl-specifier-seq of the lambda-declarator, each
10127 decl-specifier shall either be mutable or constexpr. */
10131 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10134 {
10139 }
10143 /* Parse optional exception specification. */
10146 /* Parse optional trailing return type. */
10148 {
10152 }
10154 /* The function parameters must be in scope all the way until after the
10155 trailing-return-type in case of decltype. */
10157 }
10161 /* Create the function call operator.
10163 Messing with declarators like this is no uglier than building up the
10164 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10165 other code. */
10166 {
10167 cp_decl_specifier_seq return_type_specs;
10169 tree fco;
10176 else
10177 /* Maybe we will deduce the return type later. */
10181 {
10185 else
10188 }
10193 sfk_none);
10198 VIRT_SPEC_UNSPECIFIED,
10199 REF_QUAL_NONE,
10200 tx_qual,
10201 exception_spec,
10207 declarator,
10208 attributes);
10210 {
10213 /* Give the object parameter a different name. */
10217 }
10219 {
10223 }
10232 }
10233 }
10235 /* Parse the body of a lambda expression, which is simply
10237 compound-statement
10239 but which requires special handling.
10240 LAMBDA_EXPR is the current representation of the lambda expression. */
10242 static void
10244 {
10249 else
10250 /* Still increment function_depth so that we don't GC in the
10251 middle of an expression. */
10255 /* Clear this in case we're in the middle of a default argument. */
10258 /* Finish the function call operator
10259 - class_specifier
10260 + late_parsing_for_member
10261 + function_definition_after_declarator
10262 + ctor_initializer_opt_and_function_body */
10263 {
10265 tree body;
10267 tree compound_stmt;
10268 tree cap;
10270 /* Let the front end know that we are going to be defining this
10271 function. */
10273 NULL_TREE,
10282 /* Push the proxies for any explicit captures. */
10289 /* 5.1.1.4 of the standard says:
10290 If a lambda-expression does not include a trailing-return-type, it
10291 is as if the trailing-return-type denotes the following type:
10292 * if the compound-statement is of the form
10293 { return attribute-specifier [opt] expression ; }
10294 the type of the returned expression after lvalue-to-rvalue
10295 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10296 (_conv.array_ 4.2), and function-to-pointer conversion
10297 (_conv.func_ 4.3);
10298 * otherwise, void. */
10300 /* In a lambda that has neither a lambda-return-type-clause
10301 nor a deducible form, errors should be reported for return statements
10302 in the body. Since we used void as the placeholder return type, parsing
10303 the body as usual will give such desired behavior. */
10307 {
10311 /* Parse tentatively in case there's more after the initial return
10312 statement. */
10323 {
10325 {
10330 }
10332 /* Will get error here if type not deduced yet. */
10336 }
10337 }
10340 {
10345 }
10349 out:
10353 /* Finish the function and generate code for it if necessary. */
10356 /* Only expand if the call op is not a template. */
10359 }
10365 else
10367 }
10369 /* Statements [gram.stmt.stmt] */
10371 /* Parse a statement.
10373 statement:
10374 labeled-statement
10375 expression-statement
10376 compound-statement
10377 selection-statement
10378 iteration-statement
10379 jump-statement
10380 declaration-statement
10381 try-block
10383 C++11:
10385 statement:
10386 labeled-statement
10387 attribute-specifier-seq (opt) expression-statement
10388 attribute-specifier-seq (opt) compound-statement
10389 attribute-specifier-seq (opt) selection-statement
10390 attribute-specifier-seq (opt) iteration-statement
10391 attribute-specifier-seq (opt) jump-statement
10392 declaration-statement
10393 attribute-specifier-seq (opt) try-block
10395 TM Extension:
10397 statement:
10398 atomic-statement
10400 IN_COMPOUND is true when the statement is nested inside a
10401 cp_parser_compound_statement; this matters for certain pragmas.
10403 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10404 is a (possibly labeled) if statement which is not enclosed in braces
10405 and has an else clause. This is used to implement -Wparentheses.
10407 CHAIN is a vector of if-else-if conditions. */
10409 static void
10412 {
10417 restart:
10420 /* There is no statement yet. */
10426 /* In obj-c++, seeing '[[' might be the either the beginning of
10427 c++11 attributes, or a nested objc-message-expression. So
10428 let's parse the c++11 attributes tentatively. */
10432 {
10435 }
10437 /* Peek at the next token. */
10439 /* Remember the location of the first token in the statement. */
10441 /* If this is a keyword, then that will often determine what kind of
10442 statement we have. */
10444 {
10448 {
10451 /* Looks like a labeled-statement with a case label.
10452 Parse the label, and then use tail recursion to parse
10453 the statement. */
10471 {
10476 }
10477 else
10491 {
10496 }
10497 else
10498 {
10502 }
10506 /* Objective-C++ exception-handling constructs. */
10520 /* This must be a namespace alias definition. */
10536 /* It might be a keyword like `int' that can start a
10537 declaration-statement. */
10539 }
10540 }
10542 {
10543 /* If the next token is a `:', then we are looking at a
10544 labeled-statement. */
10547 {
10548 /* Looks like a labeled-statement with an ordinary label.
10549 Parse the label, and then use tail recursion to parse
10550 the statement. */
10555 }
10556 }
10557 /* Anything that starts with a `{' must be a compound-statement. */
10560 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10561 a statement all its own. */
10563 {
10564 /* Only certain OpenMP pragmas are attached to statements, and thus
10565 are considered statements themselves. All others are not. In
10566 the context of a compound, accept the pragma as a "statement" and
10567 return so that we can check for a close brace. Otherwise we
10568 require a real statement and must go back and read one. */
10574 }
10576 {
10579 }
10581 /* Everything else must be a declaration-statement or an
10582 expression-statement. Try for the declaration-statement
10583 first, unless we are looking at a `;', in which case we know that
10584 we have an expression-statement. */
10586 {
10588 {
10590 {
10591 /* Attributes should be parsed as part of the the
10592 declaration, so let's un-parse them. */
10595 }
10598 /* Try to parse the declaration-statement. */
10600 /* If that worked, we're done. */
10603 }
10604 /* Look for an expression-statement instead. */
10607 /* Handle [[fallthrough]];. */
10609 {
10610 /* The next token after the fallthrough attribute is ';'. */
10612 {
10613 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10615 IFN_FALLTHROUGH,
10618 }
10619 else
10623 }
10624 }
10626 /* Set the line number for the statement. */
10630 /* Allow "[[fallthrough]];", but warn otherwise. */
10633 OPT_Wattributes,
10635 }
10637 /* Parse the label for a labeled-statement, i.e.
10639 identifier :
10640 case constant-expression :
10641 default :
10643 GNU Extension:
10644 case constant-expression ... constant-expression : statement
10646 When a label is parsed without errors, the label is added to the
10647 parse tree by the finish_* functions, so this function doesn't
10648 have to return the label. */
10650 static void
10652 {
10657 /* The next token should be an identifier. */
10661 {
10664 }
10666 /* Remember whether this case or a user-defined label is allowed to fall
10667 through to. */
10672 {
10674 {
10678 /* Consume the `case' token. */
10680 /* Parse the constant-expression. */
10687 {
10688 /* Consume the `...' token. */
10694 /* We don't need to emit warnings here, as the common code
10695 will do this for us. */
10696 }
10697 else
10701 {
10705 }
10706 else
10709 expr);
10710 }
10714 /* Consume the `default' token. */
10718 {
10722 }
10723 else
10728 /* Anything else must be an ordinary label. */
10733 }
10735 /* Require the `:' token. */
10738 /* An ordinary label may optionally be followed by attributes.
10739 However, this is only permitted if the attributes are then
10740 followed by a semicolon. This is because, for backward
10741 compatibility, when parsing
10742 lab: __attribute__ ((unused)) int i;
10743 we want the attribute to attach to "i", not "lab". */
10746 {
10747 tree attrs;
10754 ;
10755 else
10757 }
10763 }
10765 /* Parse an expression-statement.
10767 expression-statement:
10768 expression [opt] ;
10770 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10771 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10772 indicates whether this expression-statement is part of an
10773 expression statement. */
10775 static tree
10777 {
10782 /* There might be attribute fallthrough. */
10785 /* If the next token is a ';', then there is no expression
10786 statement. */
10788 {
10792 {
10795 }
10796 }
10798 /* Handle [[fallthrough]];. */
10800 {
10801 /* The next token after the fallthrough attribute is ';'. */
10803 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10806 else
10810 }
10812 /* Allow "[[fallthrough]];", but warn otherwise. */
10817 /* Give a helpful message for "A<T>::type t;" and the like. */
10820 {
10827 {
10828 /* A::A a; */
10833 }
10834 }
10836 /* Consume the final `;'. */
10841 /* This is the final expression statement of a statement
10842 expression. */
10848 }
10850 /* Parse a compound-statement.
10852 compound-statement:
10853 { statement-seq [opt] }
10855 GNU extension:
10857 compound-statement:
10858 { label-declaration-seq [opt] statement-seq [opt] }
10860 label-declaration-seq:
10861 label-declaration
10862 label-declaration-seq label-declaration
10864 Returns a tree representing the statement. */
10866 static tree
10869 {
10870 tree compound_stmt;
10872 /* Consume the `{'. */
10879 /* Begin the compound-statement. */
10881 /* If the next keyword is `__label__' we have a label declaration. */
10884 /* Parse an (optional) statement-seq. */
10886 /* Finish the compound-statement. */
10888 /* Consume the `}'. */
10892 }
10894 /* Parse an (optional) statement-seq.
10896 statement-seq:
10897 statement
10898 statement-seq [opt] statement */
10900 static void
10902 {
10903 /* Scan statements until there aren't any more. */
10905 {
10908 /* If we are looking at a `}', then we have run out of
10909 statements; the same is true if we have reached the end
10910 of file, or have stumbled upon a stray '@end'. */
10917 /* If we are in a compound statement and find 'else' then
10918 something went wrong. */
10920 {
10923 else
10924 {
10927 }
10928 }
10930 /* Parse the statement. */
10932 }
10933 }
10935 /* Parse a selection-statement.
10937 selection-statement:
10938 if ( condition ) statement
10939 if ( condition ) statement else statement
10940 switch ( condition ) statement
10942 Returns the new IF_STMT or SWITCH_STMT.
10944 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10945 is a (possibly labeled) if statement which is not enclosed in
10946 braces and has an else clause. This is used to implement
10947 -Wparentheses.
10949 CHAIN is a vector of if-else-if conditions. This is used to implement
10950 -Wduplicated-cond. */
10952 static tree
10955 {
10958 token_indent_info guard_tinfo;
10963 /* Peek at the next token. */
10967 /* See what kind of keyword it is. */
10970 {
10973 {
10974 tree statement;
10975 tree condition;
10980 RID_CONSTEXPR))
10981 {
10987 }
10989 /* Look for the `('. */
10991 {
10994 }
10996 /* Begin the selection-statement. */
10998 {
11001 }
11002 else
11005 /* Parse the condition. */
11007 /* Look for the `)'. */
11013 {
11017 /* Add the condition. */
11024 /* Parse the then-clause. */
11028 /* Outside a template, the non-selected branch of a constexpr
11029 if is a 'discarded statement', i.e. unevaluated. */
11034 {
11037 }
11040 guard_tinfo);
11047 {
11051 }
11053 /* If the next token is `else', parse the else-clause. */
11055 RID_ELSE))
11056 {
11060 {
11063 }
11065 guard_tinfo
11067 /* Consume the `else' keyword. */
11070 {
11072 RID_IF)
11074 {
11075 /* We've got "if (COND) else if (COND2)". Start
11076 the condition chain and add COND as the first
11077 element. */
11081 {
11082 /* Wrap it in a NOP_EXPR so that we can set the
11083 location of the condition. */
11085 condition);
11088 }
11089 }
11091 RID_IF))
11092 {
11093 /* This is if-else without subsequent if. Zap the
11094 condition chain; we would have already warned at
11095 this point. */
11098 }
11099 }
11101 /* Parse the else-clause. */
11107 /* If we are currently parsing a then-clause, then
11108 IF_P will not be NULL. We set it to true to
11109 indicate that this if statement has an else clause.
11110 This may trigger the Wparentheses warning below
11111 when we get back up to the parent if statement. */
11116 {
11120 }
11121 }
11122 else
11123 {
11124 /* This if statement does not have an else clause. If
11125 NESTED_IF is true, then the then-clause has an if
11126 statement which does have an else clause. We warn
11127 about the potential ambiguity. */
11130 "suggest explicit braces to avoid ambiguous"
11133 {
11134 /* We don't need the condition chain anymore. */
11137 }
11138 }
11140 /* Now we're all done with the if-statement. */
11142 }
11143 else
11144 {
11148 /* Add the condition. */
11151 /* Parse the body of the switch-statement. */
11157 guard_tinfo);
11161 /* Now we're all done with the switch-statement. */
11163 }
11166 }
11172 }
11173 }
11175 /* Parse a condition.
11177 condition:
11178 expression
11179 type-specifier-seq declarator = initializer-clause
11180 type-specifier-seq declarator braced-init-list
11182 GNU Extension:
11184 condition:
11185 type-specifier-seq declarator asm-specification [opt]
11186 attributes [opt] = assignment-expression
11188 Returns the expression that should be tested. */
11190 static tree
11192 {
11193 cp_decl_specifier_seq type_specifiers;
11197 /* Try the declaration first. */
11199 /* New types are not allowed in the type-specifier-seq for a
11200 condition. */
11202 parser->type_definition_forbidden_message
11204 /* Parse the type-specifier-seq. */
11206 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11209 /* Restore the saved message. */
11211 /* If all is well, we might be looking at a declaration. */
11213 {
11214 tree decl;
11215 tree asm_specification;
11216 tree attributes;
11220 /* Parse the declarator. */
11226 /* Parse the attributes. */
11228 /* Parse the asm-specification. */
11230 /* If the next token is not an `=' or '{', then we might still be
11231 looking at an expression. For example:
11233 if (A(a).x)
11235 looks like a decl-specifier-seq and a declarator -- but then
11236 there is no `=', so this is an expression. */
11241 /* If we did see an `=' or '{', then we are looking at a declaration
11242 for sure. */
11244 {
11245 tree pushed_scope;
11249 /* Create the declaration. */
11255 /* Parse the initializer. */
11257 {
11261 }
11262 else
11263 {
11264 /* Consume the `='. */
11267 }
11271 /* Process the initializer. */
11274 asm_specification,
11275 flags);
11281 }
11282 }
11283 /* If we didn't even get past the declarator successfully, we are
11284 definitely not looking at a declaration. */
11285 else
11288 /* Otherwise, we are looking at an expression. */
11290 }
11292 /* Parses a for-statement or range-for-statement until the closing ')',
11293 not included. */
11295 static tree
11297 {
11301 /* Begin the for-statement. */
11304 /* Parse the initialization. */
11309 else
11311 }
11313 static tree
11315 {
11316 /* Normal for loop */
11319 tree stmt;
11322 /* The for-init-statement has already been parsed in
11323 cp_parser_for_init_statement, so no work is needed here. */
11326 /* If there's a condition, process it. */
11330 {
11334 }
11336 /* Look for the `;'. */
11339 /* If there's an expression, process it. */
11345 }
11347 /* Tries to parse a range-based for-statement:
11349 range-based-for:
11350 decl-specifier-seq declarator : expression
11352 The decl-specifier-seq declarator and the `:' are already parsed by
11353 cp_parser_for_init_statement. If processing_template_decl it returns a
11354 newly created RANGE_FOR_STMT; if not, it is converted to a
11355 regular FOR_STMT. */
11357 static tree
11360 {
11365 /* Get the range declaration momentarily out of the way so that
11366 the range expression doesn't clash with it. */
11368 {
11372 }
11375 {
11378 }
11379 else
11382 /* Put the range declaration back into scope. */
11384 {
11387 }
11389 /* If in template, STMT is converted to a normal for-statement
11390 at instantiation. If not, it is done just ahead. */
11392 {
11400 /* do_auto_deduction doesn't mess with template init-lists. */
11403 }
11404 else
11405 {
11408 }
11410 }
11412 /* Subroutine of cp_convert_range_for: given the initializer expression,
11413 builds up the range temporary. */
11415 static tree
11417 {
11420 /* Find out the type deduced by the declaration
11421 `auto &&__range = range_expr'. */
11426 /* Create the __range variable. */
11433 }
11435 /* Used by cp_parser_range_for in template context: we aren't going to
11436 do a full conversion yet, but we still need to resolve auto in the
11437 type of the for-range-declaration if present. This is basically
11438 a shortcut version of cp_convert_range_for. */
11440 static void
11442 {
11445 {
11448 iter_type = (cp_parser_perform_range_for_lookup
11451 {
11453 iter_type);
11455 tf_warning_or_error);
11458 }
11459 }
11460 }
11462 /* Converts a range-based for-statement into a normal
11463 for-statement, as per the definition.
11465 for (RANGE_DECL : RANGE_EXPR)
11466 BLOCK
11468 should be equivalent to:
11470 {
11471 auto &&__range = RANGE_EXPR;
11472 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11473 __begin != __end;
11474 ++__begin)
11475 {
11476 RANGE_DECL = *__begin;
11477 BLOCK
11478 }
11479 }
11481 If RANGE_EXPR is an array:
11482 BEGIN_EXPR = __range
11483 END_EXPR = __range + ARRAY_SIZE(__range)
11484 Else if RANGE_EXPR has a member 'begin' or 'end':
11485 BEGIN_EXPR = __range.begin()
11486 END_EXPR = __range.end()
11487 Else:
11488 BEGIN_EXPR = begin(__range)
11489 END_EXPR = end(__range);
11491 If __range has a member 'begin' but not 'end', or vice versa, we must
11492 still use the second alternative (it will surely fail, however).
11493 When calling begin()/end() in the third alternative we must use
11494 argument dependent lookup, but always considering 'std' as an associated
11495 namespace. */
11497 tree
11500 {
11506 /* If an error happened previously do nothing or else a lot of
11507 unhelpful errors would be issued. */
11509 else
11510 {
11511 tree range_temp;
11515 /* Can't bind a reference to an array of runtime bound. */
11517 else
11518 {
11523 LOOKUP_ONLYCONVERTING);
11525 }
11528 }
11530 /* The new for initialization statement. */
11538 LOOKUP_ONLYCONVERTING);
11549 LOOKUP_ONLYCONVERTING);
11553 /* The new for condition. */
11560 /* The new increment expression. */
11563 tf_warning_or_error);
11566 /* The declaration is initialized with *__begin inside the loop body. */
11569 tf_warning_or_error),
11571 LOOKUP_ONLYCONVERTING);
11574 }
11576 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11577 We need to solve both at the same time because the method used
11578 depends on the existence of members begin or end.
11579 Returns the type deduced for the iterator expression. */
11581 static tree
11583 {
11585 {
11588 }
11591 {
11596 }
11598 {
11599 /* If RANGE is an array, we will use pointer arithmetic. */
11602 range,
11606 }
11607 else
11608 {
11609 /* If it is not an array, we must do a bit of magic. */
11619 tf_warning_or_error);
11622 tf_warning_or_error);
11625 {
11626 /* Use the member functions. */
11629 else
11635 else
11638 }
11639 else
11640 {
11641 /* Use global functions with ADL. */
11648 tf_warning_or_error);
11650 tf_warning_or_error);
11652 tf_warning_or_error);
11654 tf_warning_or_error);
11657 }
11659 /* Last common checks. */
11661 {
11662 /* If one of the expressions is an error do no more checks. */
11665 }
11668 /* Can happen, when, eg, in a template context, Koenig lookup
11669 can't resolve begin/end (c++/58503). */
11671 else
11672 {
11674 /* The unqualified type of the __begin and __end temporaries should
11675 be the same, as required by the multiple auto declaration. */
11677 {
11684 /* P0184R0 allows __begin and __end to have different types,
11685 but make sure they are comparable so we can give a better
11687 else
11691 }
11693 }
11694 }
11695 }
11697 /* Helper function for cp_parser_perform_range_for_lookup.
11698 Builds a tree for RANGE.IDENTIFIER(). */
11700 static tree
11702 {
11715 tf_warning_or_error);
11718 }
11720 /* Parse an iteration-statement.
11722 iteration-statement:
11723 while ( condition ) statement
11724 do statement while ( expression ) ;
11725 for ( for-init-statement condition [opt] ; expression [opt] )
11726 statement
11728 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11730 static tree
11732 {
11735 tree statement;
11737 token_indent_info guard_tinfo;
11739 /* Peek at the next token. */
11746 /* Remember whether or not we are already within an iteration
11747 statement. */
11750 /* See what kind of keyword it is. */
11753 {
11755 {
11756 tree condition;
11758 /* Begin the while-statement. */
11760 /* Look for the `('. */
11762 /* Parse the condition. */
11765 /* Look for the `)'. */
11767 /* Parse the dependent statement. */
11771 /* We're done with the while-statement. */
11773 }
11777 {
11778 tree expression;
11780 /* Begin the do-statement. */
11782 /* Parse the body of the do-statement. */
11787 /* Look for the `while' keyword. */
11789 /* Look for the `('. */
11791 /* Parse the expression. */
11793 /* We're done with the do-statement. */
11795 /* Look for the `)'. */
11797 /* Look for the `;'. */
11799 }
11803 {
11804 /* Look for the `('. */
11809 /* Look for the `)'. */
11812 /* Parse the body of the for-statement. */
11817 /* We're done with the for-statement. */
11819 }
11826 }
11829 }
11831 /* Parse a for-init-statement or the declarator of a range-based-for.
11832 Returns true if a range-based-for declaration is seen.
11834 for-init-statement:
11835 expression-statement
11836 simple-declaration */
11838 static bool
11840 {
11841 /* If the next token is a `;', then we have an empty
11842 expression-statement. Grammatically, this is also a
11843 simple-declaration, but an invalid one, because it does not
11844 declare anything. Therefore, if we did not handle this case
11845 specially, we would issue an error message about an invalid
11846 declaration. */
11848 {
11852 /* A colon is used in range-based for. */
11855 /* We're going to speculatively look for a declaration, falling back
11856 to an expression, if necessary. */
11858 /* Parse the declaration. */
11861 decl);
11864 {
11865 /* It is a range-for, consume the ':' */
11869 {
11871 "range-based %<for%> loops only available with "
11874 }
11875 }
11876 else
11877 /* The ';' is not consumed yet because we told
11878 cp_parser_simple_declaration not to. */
11883 /* If the tentative parse failed, then we shall need to look for an
11884 expression-statement. */
11885 }
11886 /* If we are here, it is an expression-statement. */
11889 }
11891 /* Parse a jump-statement.
11893 jump-statement:
11894 break ;
11895 continue ;
11896 return expression [opt] ;
11897 return braced-init-list ;
11898 goto identifier ;
11900 GNU extension:
11902 jump-statement:
11903 goto * expression ;
11905 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11907 static tree
11909 {
11915 /* Peek at the next token. */
11920 /* See what kind of keyword it is. */
11923 {
11927 {
11947 }
11953 {
11960 /* Fall through. */
11970 }
11975 {
11976 tree expr;
11980 {
11984 }
11987 else
11988 /* If the next token is a `;', then there is no
11989 expression. */
11991 /* Build the return-statement. */
11994 else
11996 /* Look for the final `;'. */
11998 }
12004 {
12007 }
12009 /* Create the goto-statement. */
12011 {
12012 /* Issue a warning about this use of a GNU extension. */
12014 /* Consume the '*' token. */
12016 /* Parse the dependent expression. */
12018 }
12019 else
12021 /* Look for the final `;'. */
12028 }
12031 }
12033 /* Parse a declaration-statement.
12035 declaration-statement:
12036 block-declaration */
12038 static void
12040 {
12043 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12046 /* Parse the block-declaration. */
12049 /* Free any declarators allocated. */
12051 }
12053 /* Some dependent statements (like `if (cond) statement'), are
12054 implicitly in their own scope. In other words, if the statement is
12055 a single statement (as opposed to a compound-statement), it is
12056 none-the-less treated as if it were enclosed in braces. Any
12057 declarations appearing in the dependent statement are out of scope
12058 after control passes that point. This function parses a statement,
12059 but ensures that is in its own scope, even if it is not a
12060 compound-statement.
12062 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12063 is a (possibly labeled) if statement which is not enclosed in
12064 braces and has an else clause. This is used to implement
12065 -Wparentheses.
12067 CHAIN is a vector of if-else-if conditions. This is used to implement
12068 -Wduplicated-cond.
12070 Returns the new statement. */
12072 static tree
12076 {
12077 tree statement;
12079 token_indent_info body_tinfo
12085 /* Mark if () ; with a special NOP_EXPR. */
12087 {
12098 }
12099 /* if a compound is opened, we simply parse the statement directly. */
12102 /* If the token is not a `{', then we must take special action. */
12103 else
12104 {
12105 /* Create a compound-statement. */
12107 /* Parse the dependent-statement. */
12109 /* Finish the dummy compound-statement. */
12111 }
12113 token_indent_info next_tinfo
12117 /* Return the statement. */
12119 }
12121 /* For some dependent statements (like `while (cond) statement'), we
12122 have already created a scope. Therefore, even if the dependent
12123 statement is a compound-statement, we do not want to create another
12124 scope. */
12126 static void
12129 {
12130 /* If the token is a `{', then we must take special action. */
12132 {
12133 token_indent_info body_tinfo
12137 token_indent_info next_tinfo
12140 }
12141 else
12142 {
12143 /* Avoid calling cp_parser_compound_statement, so that we
12144 don't create a new scope. Do everything else by hand. */
12146 /* If the next keyword is `__label__' we have a label declaration. */
12149 /* Parse an (optional) statement-seq. */
12152 }
12153 }
12155 /* Declarations [gram.dcl.dcl] */
12157 /* Parse an optional declaration-sequence.
12159 declaration-seq:
12160 declaration
12161 declaration-seq declaration */
12163 static void
12165 {
12167 {
12178 {
12179 /* A declaration consisting of a single semicolon is
12180 invalid. Allow it unless we're being pedantic. */
12185 }
12187 /* If we're entering or exiting a region that's implicitly
12188 extern "C", modify the lang context appropriately. */
12190 {
12193 }
12195 {
12198 }
12201 {
12202 /* A top-level declaration can consist solely of a #pragma.
12203 A nested declaration cannot, so this is done here and not
12204 in cp_parser_declaration. (A #pragma at block scope is
12205 handled in cp_parser_statement.) */
12208 }
12210 /* Parse the declaration itself. */
12212 }
12213 }
12215 /* Parse a declaration.
12217 declaration:
12218 block-declaration
12219 function-definition
12220 template-declaration
12221 explicit-instantiation
12222 explicit-specialization
12223 linkage-specification
12224 namespace-definition
12226 GNU extension:
12228 declaration:
12229 __extension__ declaration */
12231 static void
12233 {
12234 cp_token token1;
12235 cp_token token2;
12240 /* Check for the `__extension__' keyword. */
12242 {
12243 /* Parse the qualified declaration. */
12245 /* Restore the PEDANTIC flag. */
12249 }
12251 /* Try to figure out what kind of declaration is present. */
12256 else
12257 {
12260 }
12262 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12265 /* If the next token is `extern' and the following token is a string
12266 literal, then we have a linkage specification. */
12270 /* If the next token is `template', then we have either a template
12271 declaration, an explicit instantiation, or an explicit
12272 specialization. */
12274 {
12275 /* `template <>' indicates a template specialization. */
12279 /* `template <' indicates a template declaration. */
12282 /* Anything else must be an explicit instantiation. */
12283 else
12285 }
12286 /* If the next token is `export', then we have a template
12287 declaration. */
12290 /* If the next token is `extern', 'static' or 'inline' and the one
12291 after that is `template', we have a GNU extended explicit
12292 instantiation directive. */
12299 /* If the next token is `namespace', check for a named or unnamed
12300 namespace definition. */
12309 /* An unnamed namespace definition. */
12313 /* An inline (associated) namespace definition. */
12317 /* Objective-C++ declaration/definition. */
12324 /* At this point we may have a template declared by a concept
12325 introduction. */
12330 else
12331 /* Try to parse a block-declaration, or a function-definition. */
12334 /* Free any declarators allocated. */
12336 }
12338 /* Parse a block-declaration.
12340 block-declaration:
12341 simple-declaration
12342 asm-definition
12343 namespace-alias-definition
12344 using-declaration
12345 using-directive
12347 GNU Extension:
12349 block-declaration:
12350 __extension__ block-declaration
12352 C++0x Extension:
12354 block-declaration:
12355 static_assert-declaration
12357 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12358 part of a declaration-statement. */
12360 static void
12363 {
12367 /* Check for the `__extension__' keyword. */
12369 {
12370 /* Parse the qualified declaration. */
12372 /* Restore the PEDANTIC flag. */
12376 }
12378 /* Peek at the next token to figure out which kind of declaration is
12379 present. */
12382 /* If the next keyword is `asm', we have an asm-definition. */
12384 {
12388 }
12389 /* If the next keyword is `namespace', we have a
12390 namespace-alias-definition. */
12393 /* If the next keyword is `using', we have a
12394 using-declaration, a using-directive, or an alias-declaration. */
12396 {
12401 /* If the token after `using' is `namespace', then we have a
12402 using-directive. */
12406 /* If the second token after 'using' is '=', then we have an
12407 alias-declaration. */
12413 /* Otherwise, it's a using-declaration. */
12414 else
12417 }
12418 /* If the next keyword is `__label__' we have a misplaced label
12419 declaration. */
12421 {
12425 /* If the next token is now a `;', consume it. */
12428 }
12429 /* If the next token is `static_assert' we have a static assertion. */
12432 /* Anything else must be a simple-declaration. */
12433 else
12436 }
12438 /* Parse a simple-declaration.
12440 simple-declaration:
12441 decl-specifier-seq [opt] init-declarator-list [opt] ;
12443 init-declarator-list:
12444 init-declarator
12445 init-declarator-list , init-declarator
12447 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12448 function-definition as a simple-declaration.
12450 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12451 parsed declaration if it is an uninitialized single declarator not followed
12452 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12453 if present, will not be consumed. */
12455 static void
12459 {
12460 cp_decl_specifier_seq decl_specifiers;
12469 /* Defer access checks until we know what is being declared; the
12470 checks for names appearing in the decl-specifier-seq should be
12471 done as if we were in the scope of the thing being declared. */
12474 /* Parse the decl-specifier-seq. We have to keep track of whether
12475 or not the decl-specifier-seq declares a named class or
12476 enumeration type, since that is the only case in which the
12477 init-declarator-list is allowed to be empty.
12479 [dcl.dcl]
12481 In a simple-declaration, the optional init-declarator-list can be
12482 omitted only when declaring a class or enumeration, that is when
12483 the decl-specifier-seq contains either a class-specifier, an
12484 elaborated-type-specifier, or an enum-specifier. */
12486 CP_PARSER_FLAGS_OPTIONAL,
12489 /* We no longer need to defer access checks. */
12492 /* In a block scope, a valid declaration must always have a
12493 decl-specifier-seq. By not trying to parse declarators, we can
12494 resolve the declaration/expression ambiguity more quickly. */
12497 {
12500 }
12502 /* If the next two tokens are both identifiers, the code is
12503 erroneous. The usual cause of this situation is code like:
12505 T t;
12507 where "T" should name a type -- but does not. */
12510 {
12511 /* If parsing tentatively, we should commit; we really are
12512 looking at a declaration. */
12514 /* Give up. */
12516 }
12518 /* If we have seen at least one decl-specifier, and the next token
12519 is not a parenthesis, then we must be looking at a declaration.
12520 (After "int (" we might be looking at a functional cast.) */
12527 tree last_type;
12531 /* Keep going until we hit the `;' at the end of the simple
12532 declaration. */
12535 CPP_SEMICOLON))
12536 {
12539 tree decl;
12543 {
12544 /* If we are processing next declarator, comma is expected */
12549 {
12553 }
12554 }
12555 else
12558 /* Parse the init-declarator. */
12561 function_definition_allowed_p,
12563 declares_class_or_enum,
12565 maybe_range_for_decl,
12568 /* If an error occurred while parsing tentatively, exit quickly.
12569 (That usually happens when in the body of a function; each
12570 statement is treated as a declaration-statement until proven
12571 otherwise.) */
12576 {
12579 {
12580 /* If the list of declarators contains more than one declarator,
12581 the type of each declared variable is determined as described
12582 above. If the type deduced for the template parameter U is not
12583 the same in each deduction, the program is ill-formed. */
12588 }
12589 else
12591 }
12593 /* Handle function definitions specially. */
12595 {
12596 /* If the next token is a `,', then we are probably
12597 processing something like:
12599 void f() {}, *p;
12601 which is erroneous. */
12603 {
12606 "mixing"
12608 }
12609 /* Otherwise, we're done with the list of declarators. */
12610 else
12611 {
12614 }
12615 }
12618 /* The next token should be either a `,' or a `;'. */
12620 /* If it's a `,', there are more declarators to come. */
12623 /* If it's a `;', we are done. */
12627 {
12632 }
12633 /* Anything else is an error. */
12634 else
12635 {
12636 /* If we have already issued an error message we don't need
12637 to issue another one. */
12642 /* Skip tokens until we reach the end of the statement. */
12644 /* If the next token is now a `;', consume it. */
12648 }
12649 /* After the first time around, a function-definition is not
12650 allowed -- even if it was OK at first. For example:
12652 int i, f() {}
12654 is not valid. */
12656 }
12658 /* Issue an error message if no declarators are present, and the
12659 decl-specifier-seq does not itself declare a class or
12660 enumeration: [dcl.dcl]/3. */
12662 {
12664 {
12668 /* Ensure an error is issued anyway when finish_decltype_type,
12669 called via cp_parser_decl_specifier_seq, returns a class or
12670 an enumeration (c++/51786). */
12673 }
12674 /* Perform any deferred access checks. */
12676 }
12678 /* Consume the `;'. */
12682 {
12688 }
12690 done:
12692 }
12694 /* Parse a decl-specifier-seq.
12696 decl-specifier-seq:
12697 decl-specifier-seq [opt] decl-specifier
12698 decl-specifier attribute-specifier-seq [opt] (C++11)
12700 decl-specifier:
12701 storage-class-specifier
12702 type-specifier
12703 function-specifier
12704 friend
12705 typedef
12707 GNU Extension:
12709 decl-specifier:
12710 attributes
12712 Concepts Extension:
12714 decl-specifier:
12715 concept
12717 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12719 The parser flags FLAGS is used to control type-specifier parsing.
12721 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12722 flags:
12724 1: one of the decl-specifiers is an elaborated-type-specifier
12725 (i.e., a type declaration)
12726 2: one of the decl-specifiers is an enum-specifier or a
12727 class-specifier (i.e., a type definition)
12729 */
12731 static void
12733 cp_parser_flags flags,
12736 {
12740 cp_decl_spec ds;
12742 /* Clear DECL_SPECS. */
12745 /* Assume no class or enumeration type is declared. */
12748 /* Keep reading specifiers until there are no more to read. */
12750 {
12755 /* Peek at the next token. */
12758 /* Save the first token of the decl spec list for error
12759 reporting. */
12762 /* Handle attributes. */
12764 {
12765 /* Parse the attributes. */
12768 /* In a sequence of declaration specifiers, c++11 attributes
12769 appertain to the type that precede them. In that case
12770 [dcl.spec]/1 says:
12772 The attribute-specifier-seq affects the type only for
12773 the declaration it appears in, not other declarations
12774 involving the same type.
12776 But for now let's force the user to position the
12777 attribute either at the beginning of the declaration or
12778 after the declarator-id, which would clearly mean that it
12779 applies to the declarator. */
12781 {
12783 /* The c++11 attribute is at the beginning of the
12784 declaration. It appertains to the entity being
12786 else
12787 {
12789 {
12790 /* This is an attribute following a
12791 class-specifier. */
12796 }
12797 else
12798 {
12799 decl_specs->std_attributes
12801 attrs);
12804 }
12806 }
12807 }
12809 decl_specs->attributes
12811 attrs);
12815 }
12816 /* Assume we will find a decl-specifier keyword. */
12818 /* If the next token is an appropriate keyword, we can simply
12819 add it to the list. */
12821 {
12822 /* decl-specifier:
12823 friend
12824 constexpr */
12827 {
12830 }
12831 else
12832 {
12834 /* Consume the token. */
12836 }
12849 /* function-specifier:
12850 inline
12851 virtual
12852 explicit */
12859 /* decl-specifier:
12860 typedef */
12863 /* Consume the token. */
12865 /* A constructor declarator cannot appear in a typedef. */
12867 /* The "typedef" keyword can only occur in a declaration; we
12868 may as well commit at this point. */
12875 /* storage-class-specifier:
12876 auto
12877 register
12878 static
12879 extern
12880 mutable
12882 GNU Extension:
12883 thread */
12886 {
12887 /* Consume the token. */
12890 /* Complain about `auto' as a storage specifier, if
12891 we're complaining about C++0x compatibility. */
12895 /* Set the storage class anyway. */
12897 token);
12898 }
12899 else
12900 /* C++0x auto type-specifier. */
12908 /* Consume the token. */
12911 token);
12914 /* Consume the token. */
12920 /* We did not yet find a decl-specifier yet. */
12923 }
12940 /* Constructors are a special case. The `S' in `S()' is not a
12941 decl-specifier; it is the beginning of the declarator. */
12942 constructor_p
12943 = (!found_decl_spec
12944 && constructor_possible_p
12945 && (cp_parser_constructor_declarator_p
12948 /* If we don't have a DECL_SPEC yet, then we must be looking at
12949 a type-specifier. */
12951 {
12954 tree type_spec;
12956 type_spec
12958 decl_specs,
12964 /* If this type-specifier referenced a user-defined type
12965 (a typedef, class-name, etc.), then we can't allow any
12966 more such type-specifiers henceforth.
12968 [dcl.spec]
12970 The longest sequence of decl-specifiers that could
12971 possibly be a type name is taken as the
12972 decl-specifier-seq of a declaration. The sequence shall
12973 be self-consistent as described below.
12975 [dcl.type]
12977 As a general rule, at most one type-specifier is allowed
12978 in the complete decl-specifier-seq of a declaration. The
12979 only exceptions are the following:
12981 -- const or volatile can be combined with any other
12982 type-specifier.
12984 -- signed or unsigned can be combined with char, long,
12985 short, or int.
12987 -- ..
12989 Example:
12991 typedef char* Pc;
12992 void g (const int Pc);
12994 Here, Pc is *not* part of the decl-specifier seq; it's
12995 the declarator. Therefore, once we see a type-specifier
12996 (other than a cv-qualifier), we forbid any additional
12997 user-defined types. We *do* still allow things like `int
12998 int' to be considered a decl-specifier-seq, and issue the
12999 error message later. */
13002 /* A constructor declarator cannot follow a type-specifier. */
13004 {
13009 }
13010 }
13012 /* If we still do not have a DECL_SPEC, then there are no more
13013 decl-specifiers. */
13018 /* After we see one decl-specifier, further decl-specifiers are
13019 always optional. */
13021 }
13023 /* Don't allow a friend specifier with a class definition. */
13028 }
13030 /* Parse an (optional) storage-class-specifier.
13032 storage-class-specifier:
13033 auto
13034 register
13035 static
13036 extern
13037 mutable
13039 GNU Extension:
13041 storage-class-specifier:
13042 thread
13044 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13046 static tree
13048 {
13050 {
13054 /* Fall through for C++98. */
13062 /* Consume the token. */
13067 }
13068 }
13070 /* Parse an (optional) function-specifier.
13072 function-specifier:
13073 inline
13074 virtual
13075 explicit
13077 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13078 Updates DECL_SPECS, if it is non-NULL. */
13080 static tree
13083 {
13086 {
13092 /* 14.5.2.3 [temp.mem]
13094 A member function template shall not be virtual. */
13098 else
13108 }
13110 /* Consume the token. */
13112 }
13114 /* Parse a linkage-specification.
13116 linkage-specification:
13117 extern string-literal { declaration-seq [opt] }
13118 extern string-literal declaration */
13120 static void
13122 {
13123 tree linkage;
13125 /* Look for the `extern' keyword. */
13128 /* Look for the string-literal. */
13131 /* Transform the literal into an identifier. If the literal is a
13132 wide-character string, or contains embedded NULs, then we can't
13133 handle it as the user wants. */
13136 {
13138 /* Assume C++ linkage. */
13140 }
13141 else
13144 /* We're now using the new linkage. */
13147 /* If the next token is a `{', then we're using the first
13148 production. */
13150 {
13154 /* Consume the `{' token. */
13156 /* Parse the declarations. */
13158 /* Look for the closing `}'. */
13160 }
13161 /* Otherwise, there's just one declaration. */
13162 else
13163 {
13166 saved_in_unbraced_linkage_specification_p
13170 parser->in_unbraced_linkage_specification_p
13172 }
13174 /* We're done with the linkage-specification. */
13176 }
13178 /* Parse a static_assert-declaration.
13180 static_assert-declaration:
13181 static_assert ( constant-expression , string-literal ) ;
13182 static_assert ( constant-expression ) ; (C++1Z)
13184 If MEMBER_P, this static_assert is a class member. */
13186 static void
13188 {
13189 tree condition;
13190 tree message;
13192 location_t saved_loc;
13195 /* Peek at the `static_assert' token so we can keep track of exactly
13196 where the static assertion started. */
13200 /* Look for the `static_assert' keyword. */
13202 RT_STATIC_ASSERT))
13205 /* We know we are in a static assertion; commit to any tentative
13206 parse. */
13210 /* Parse the `(' starting the static assertion condition. */
13213 /* Parse the constant-expression. Allow a non-constant expression
13214 here in order to give better diagnostics in finish_static_assert. */
13215 condition =
13221 {
13224 "static_assert without a message "
13226 /* Eat the ')' */
13231 }
13232 else
13233 {
13234 /* Parse the separating `,'. */
13237 /* Parse the string-literal message. */
13242 /* A `)' completes the static assertion. */
13248 }
13250 /* A semicolon terminates the declaration. */
13253 /* Complete the static assertion, which may mean either processing
13254 the static assert now or saving it for template instantiation. */
13256 }
13258 /* Parse the expression in decltype ( expression ). */
13260 static tree
13263 {
13265 tree expr;
13267 /* Since we're going to preserve any side-effects from this parse, set up a
13268 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13269 in the expression. */
13272 /* First, try parsing an id-expression. */
13283 {
13286 cp_id_kind idk;
13290 /* Lookup the name we got back from the id-expression. */
13300 {
13301 /* Complete lookup of the id-expression. */
13302 expr = (finish_id_expression
13315 /* We found an id-expression, but it was something that we
13316 should not have found. This is an error, not something
13317 we can recover from, so note that we found an
13318 id-expression and we'll recover as gracefully as
13319 possible. */
13321 }
13326 /* We have an id-expression. */
13328 }
13331 {
13332 /* Abort the id-expression parse. */
13335 /* Parsing tentatively, again. */
13338 /* Parse a class member access. */
13346 /* We have an id-expression. */
13348 }
13351 /* We have parsed the complete id-expression or member access. */
13353 else
13354 {
13355 /* Abort our attempt to parse an id-expression or member access
13356 expression. */
13359 /* Parse a full expression. */
13362 }
13365 }
13367 /* Parse a `decltype' type. Returns the type.
13369 simple-type-specifier:
13370 decltype ( expression )
13371 C++14 proposal:
13372 decltype ( auto ) */
13374 static tree
13376 {
13377 tree expr;
13386 {
13387 /* Already parsed. */
13390 }
13392 /* Look for the `decltype' token. */
13396 /* Parse the opening `('. */
13400 /* decltype (auto) */
13403 {
13410 }
13412 /* Types cannot be defined in a `decltype' expression. Save away the
13413 old message. */
13416 /* And create the new one. */
13417 parser->type_definition_forbidden_message
13420 /* The restrictions on constant-expressions do not apply inside
13421 decltype expressions. */
13422 saved_integral_constant_expression_p
13424 saved_non_integral_constant_expression_p
13428 /* Within a parenthesized expression, a `>' token is always
13429 the greater-than operator. */
13430 saved_greater_than_is_operator_p
13434 /* Do not actually evaluate the expression. */
13437 /* Do not warn about problems with the expression. */
13442 /* Go back to evaluating expressions. */
13446 /* The `>' token might be the end of a template-id or
13447 template-parameter-list now. */
13448 parser->greater_than_is_operator_p
13451 /* Restore the old message and the integral constant expression
13452 flags. */
13454 parser->integral_constant_expression_p
13456 parser->non_integral_constant_expression_p
13459 /* Parse to the closing `)'. */
13461 {
13465 }
13468 tf_warning_or_error);
13470 rewrite:
13471 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13472 it again. */
13481 }
13483 /* Special member functions [gram.special] */
13485 /* Parse a conversion-function-id.
13487 conversion-function-id:
13488 operator conversion-type-id
13490 Returns an IDENTIFIER_NODE representing the operator. */
13492 static tree
13494 {
13495 tree type;
13496 tree saved_scope;
13497 tree saved_qualifying_scope;
13498 tree saved_object_scope;
13501 /* Look for the `operator' token. */
13504 /* When we parse the conversion-type-id, the current scope will be
13505 reset. However, we need that information in able to look up the
13506 conversion function later, so we save it here. */
13510 /* We must enter the scope of the class so that the names of
13511 entities declared within the class are available in the
13512 conversion-type-id. For example, consider:
13514 struct S {
13515 typedef int I;
13516 operator I();
13517 };
13519 S::operator I() { ... }
13521 In order to see that `I' is a type-name in the definition, we
13522 must be in the scope of `S'. */
13525 /* Parse the conversion-type-id. */
13527 /* Leave the scope of the class, if any. */
13530 /* Restore the saved scope. */
13534 /* If the TYPE is invalid, indicate failure. */
13538 }
13540 /* Parse a conversion-type-id:
13542 conversion-type-id:
13543 type-specifier-seq conversion-declarator [opt]
13545 Returns the TYPE specified. */
13547 static tree
13549 {
13550 tree attributes;
13551 cp_decl_specifier_seq type_specifiers;
13553 tree type_specified;
13556 /* Parse the attributes. */
13560 parser->type_definition_forbidden_message
13563 /* Parse the type-specifiers. */
13570 /* If that didn't work, stop. */
13573 /* Parse the conversion-declarator. */
13581 /* Don't give this error when parsing tentatively. This happens to
13582 work because we always parse this definitively once. */
13585 {
13587 {
13590 }
13594 }
13597 }
13599 /* Parse an (optional) conversion-declarator.
13601 conversion-declarator:
13602 ptr-operator conversion-declarator [opt]
13604 */
13608 {
13611 cp_cv_quals cv_quals;
13613 /* We don't know if there's a ptr-operator next, or not. */
13615 /* Try the ptr-operator. */
13618 /* If it worked, look for more conversion-declarators. */
13620 {
13623 /* Parse another optional declarator. */
13626 declarator = cp_parser_make_indirect_declarator
13630 }
13633 }
13635 /* Parse an (optional) ctor-initializer.
13637 ctor-initializer:
13638 : mem-initializer-list
13640 Returns TRUE iff the ctor-initializer was actually present. */
13642 static bool
13644 {
13645 /* If the next token is not a `:', then there is no
13646 ctor-initializer. */
13648 {
13649 /* Do default initialization of any bases and members. */
13654 }
13656 /* Consume the `:' token. */
13658 /* And the mem-initializer-list. */
13662 }
13664 /* Parse a mem-initializer-list.
13666 mem-initializer-list:
13667 mem-initializer ... [opt]
13668 mem-initializer ... [opt] , mem-initializer-list */
13670 static void
13672 {
13677 /* Let the semantic analysis code know that we are starting the
13678 mem-initializer-list. */
13683 /* Loop through the list. */
13685 {
13686 tree mem_initializer;
13689 /* Parse the mem-initializer. */
13691 /* If the next token is a `...', we're expanding member initializers. */
13693 {
13694 /* Consume the `...'. */
13697 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13698 can be expanded but members cannot. */
13701 {
13706 }
13708 /* Construct the pack expansion type. */
13711 }
13714 {
13718 }
13719 /* Look for a target constructor. */
13723 {
13726 {
13730 }
13732 }
13733 /* Add it to the list, unless it was erroneous. */
13735 {
13738 }
13739 /* If the next token is not a `,', we're done. */
13742 /* Consume the `,' token. */
13744 }
13746 /* Perform semantic analysis. */
13749 }
13751 /* Parse a mem-initializer.
13753 mem-initializer:
13754 mem-initializer-id ( expression-list [opt] )
13755 mem-initializer-id braced-init-list
13757 GNU extension:
13759 mem-initializer:
13760 ( expression-list [opt] )
13762 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13763 class) or FIELD_DECL (for a non-static data member) to initialize;
13764 the TREE_VALUE is the expression-list. An empty initialization
13765 list is represented by void_list_node. */
13767 static tree
13769 {
13770 tree mem_initializer_id;
13771 tree expression_list;
13772 tree member;
13775 /* Find out what is being initialized. */
13777 {
13781 }
13782 else
13783 {
13787 }
13793 {
13800 }
13801 else
13802 {
13812 }
13822 }
13824 /* Parse a mem-initializer-id.
13826 mem-initializer-id:
13827 :: [opt] nested-name-specifier [opt] class-name
13828 decltype-specifier (C++11)
13829 identifier
13831 Returns a TYPE indicating the class to be initialized for the first
13832 production (and the second in C++11). Returns an IDENTIFIER_NODE
13833 indicating the data member to be initialized for the last production. */
13835 static tree
13837 {
13841 tree id;
13845 /* `typename' is not allowed in this context ([temp.res]). */
13847 {
13849 "keyword %<typename%> not allowed in this context (a qualified "
13852 }
13853 /* Look for the optional `::' operator. */
13854 global_scope_p
13858 /* Look for the optional nested-name-specifier. The simplest way to
13859 implement:
13861 [temp.res]
13863 The keyword `typename' is not permitted in a base-specifier or
13864 mem-initializer; in these contexts a qualified name that
13865 depends on a template-parameter is implicitly assumed to be a
13866 type name.
13868 is to assume that we have seen the `typename' keyword at this
13869 point. */
13870 nested_name_specifier_p
13879 /* If there is a `::' operator or a nested-name-specifier, then we
13880 are definitely looking for a class-name. */
13885 typename_type,
13889 /* Otherwise, we could also be looking for an ordinary identifier. */
13892 /* Try a decltype-specifier. */
13894 else
13895 /* Otherwise, try a class-name. */
13899 none_type,
13903 /* If we found one, we're done. */
13906 /* Otherwise, look for an ordinary identifier. */
13908 }
13910 /* Overloading [gram.over] */
13912 /* Parse an operator-function-id.
13914 operator-function-id:
13915 operator operator
13917 Returns an IDENTIFIER_NODE for the operator which is a
13918 human-readable spelling of the identifier, e.g., `operator +'. */
13920 static cp_expr
13922 {
13923 /* Look for the `operator' keyword. */
13926 /* And then the name of the operator itself. */
13928 }
13930 /* Return an identifier node for a user-defined literal operator.
13931 The suffix identifier is chained to the operator name identifier. */
13933 static tree
13935 {
13936 tree identifier;
13943 }
13945 /* Parse an operator.
13947 operator:
13948 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13949 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13950 || ++ -- , ->* -> () []
13952 GNU Extensions:
13954 operator:
13955 <? >? <?= >?=
13957 Returns an IDENTIFIER_NODE for the operator which is a
13958 human-readable spelling of the identifier, e.g., `operator +'. */
13960 static cp_expr
13962 {
13967 /* Peek at the next token. */
13972 /* Figure out which operator we have. */
13974 {
13976 {
13979 /* The keyword should be either `new' or `delete'. */
13984 else
13987 /* Consume the `new' or `delete' token. */
13990 /* Peek at the next token. */
13992 /* If it's a `[' token then this is the array variant of the
13993 operator. */
13995 {
13996 /* Consume the `[' token. */
13998 /* Look for the `]' token. */
14004 }
14005 /* Otherwise, we have the non-array variant. */
14006 else
14012 }
14159 /* Consume the `('. */
14161 /* Look for the matching `)'. */
14166 /* Consume the `['. */
14168 /* Look for the matching `]'. */
14175 /* FALLTHRU */
14184 {
14191 /* Consume the string. */
14197 {
14200 }
14201 else
14202 {
14204 /* Look for the suffix identifier. */
14209 {
14213 }
14214 else
14215 {
14218 }
14219 }
14224 {
14227 }
14230 {
14233 }
14235 {
14238 }
14240 }
14243 /* Anything else is an error. */
14245 }
14247 /* If we have selected an identifier, we need to consume the
14248 operator token. */
14251 /* Otherwise, no valid operator name was present. */
14252 else
14253 {
14256 }
14259 }
14261 /* Parse a template-declaration.
14263 template-declaration:
14264 export [opt] template < template-parameter-list > declaration
14266 If MEMBER_P is TRUE, this template-declaration occurs within a
14267 class-specifier.
14269 The grammar rule given by the standard isn't correct. What
14270 is really meant is:
14272 template-declaration:
14273 export [opt] template-parameter-list-seq
14274 decl-specifier-seq [opt] init-declarator [opt] ;
14275 export [opt] template-parameter-list-seq
14276 function-definition
14278 template-parameter-list-seq:
14279 template-parameter-list-seq [opt]
14280 template < template-parameter-list >
14282 Concept Extensions:
14284 template-parameter-list-seq:
14285 template < template-parameter-list > requires-clause [opt]
14287 requires-clause:
14288 requires logical-or-expression */
14290 static void
14292 {
14293 /* Check for `export'. */
14295 {
14296 /* Consume the `export' token. */
14298 /* Warn that we do not support `export'. */
14300 }
14303 }
14305 /* Parse a template-parameter-list.
14307 template-parameter-list:
14308 template-parameter
14309 template-parameter-list , template-parameter
14311 Returns a TREE_LIST. Each node represents a template parameter.
14312 The nodes are connected via their TREE_CHAINs. */
14314 static tree
14316 {
14321 /* The loop below parses the template parms. We first need to know
14322 the total number of template parms to be able to compute proper
14323 canonical types of each dependent type. So after the loop, when
14324 we know the total number of template parms,
14325 end_template_parm_list computes the proper canonical types and
14326 fixes up the dependent types accordingly. */
14328 {
14329 tree parameter;
14332 location_t parm_loc;
14334 /* Parse the template-parameter. */
14339 /* Add it to the list. */
14342 parm_loc,
14343 parameter,
14344 is_non_type,
14345 is_parameter_pack);
14346 else
14347 {
14350 }
14352 /* If the next token is not a `,', we're done. */
14355 /* Otherwise, consume the `,' token. */
14357 }
14360 }
14362 /* Parse a introduction-list.
14364 introduction-list:
14365 introduced-parameter
14366 introduction-list , introduced-parameter
14368 introduced-parameter:
14369 ...[opt] identifier
14371 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14372 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14373 WILDCARD_DECL will also have DECL_NAME set and token location in
14374 DECL_SOURCE_LOCATION. */
14376 static tree
14378 {
14382 {
14387 /* Build placeholder. */
14395 /* If the next token is not a `,', we're done. */
14398 /* Otherwise, consume the `,' token. */
14400 }
14402 /* Convert the vec into a TREE_VEC. */
14405 tree parm;
14411 }
14413 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14414 is an abstract declarator. */
14418 {
14423 }
14425 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14426 is an abstract declarator. */
14430 {
14434 else
14436 }
14438 /* Returns true if DECL represents a constrained-parameter. */
14442 {
14447 }
14449 /* Returns true if PARM declares a constrained-parameter. */
14453 {
14455 }
14457 /* Check that the type parameter is only a declarator-id, and that its
14458 type is not cv-qualified. */
14460 bool
14463 {
14468 {
14471 }
14473 /* Don't allow cv-qualified type parameters. */
14476 {
14479 }
14482 }
14484 /* Finish parsing/processing a template type parameter and checking
14485 various restrictions. */
14489 tree id,
14491 {
14494 else
14496 }
14498 static tree
14500 {
14501 /* FIXME: This should probably be copied, and we may need to adjust
14502 the template parameter depths. */
14512 }
14514 /* Finish parsing/processing a template template parameter by borrowing
14515 the template parameter list from the prototype parameter. */
14517 static tree
14519 tree proto,
14520 tree id,
14522 {
14526 }
14528 /* Create a new non-type template parameter from the given PARM
14529 declarator. */
14531 static tree
14534 {
14540 }
14542 /* Build a constrained template parameter based on the PARMDECL
14543 declarator. The type of PARMDECL is the constrained type, which
14544 refers to the prototype template parameter that ultimately
14545 specifies the type of the declared parameter. */
14547 static tree
14552 {
14558 /* A template parameter constrained by a variadic concept shall also
14559 be declared as a template parameter pack. */
14564 /* Build the parameter. Return an error if the declarator was invalid. */
14565 tree parm;
14570 parmdecl);
14571 else
14576 /* Finish the parameter decl and create a node attaching the
14577 default argument and constraint. */
14582 }
14584 /* Returns true if the parsed type actually represents the declaration
14585 of a type template-parameter. */
14589 {
14592 }
14595 /* Returns true if the parsed type actually represents the declaration of
14596 a template template-parameter. */
14598 static bool
14600 {
14603 }
14605 /* Parse a default argument for a type template-parameter.
14606 Note that diagnostics are handled in cp_parser_template_parameter. */
14608 static tree
14610 {
14613 /* Consume the `=' token. */
14618 /* Parse the default-argument. */
14624 {
14628 }
14631 }
14633 /* Parse a default argument for a template template-parameter. */
14635 static tree
14637 {
14642 /* Consume the `='. */
14644 /* Parse the id-expression. */
14646 /* save token before parsing the id-expression, for error
14647 reporting */
14649 tree default_argument
14657 /* If the id-expression was a template-id that refers to
14658 a template-class, we already have the declaration here,
14659 so no further lookup is needed. */
14660 ;
14661 else
14662 /* Look up the name. */
14663 default_argument
14665 none_type,
14671 /* See if the default argument is valid. */
14675 }
14677 /* Parse a template-parameter.
14679 template-parameter:
14680 type-parameter
14681 parameter-declaration
14683 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14684 the parameter. The TREE_PURPOSE is the default value, if any.
14685 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14686 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14687 set to true iff this parameter is a parameter pack. */
14689 static tree
14692 {
14695 tree parm;
14697 /* Assume it is a type parameter or a template parameter. */
14699 /* Assume it not a parameter pack. */
14701 /* Peek at the next token. */
14703 /* If it is `class' or `template', we have a type-parameter. */
14706 /* If it is `class' or `typename' we do not know yet whether it is a
14707 type parameter or a non-type parameter. Consider:
14709 template <typename T, typename T::X X> ...
14711 or:
14713 template <class C, class D*> ...
14715 Here, the first parameter is a type parameter, and the second is
14716 a non-type parameter. We can tell by looking at the token after
14717 the identifier -- if it is a `,', `=', or `>' then we have a type
14718 parameter. */
14720 {
14721 /* Peek at the token after `class' or `typename'. */
14723 /* If it's an ellipsis, we have a template type parameter
14724 pack. */
14727 /* If it's an identifier, skip it. */
14730 /* Now, see if the token looks like the end of a template
14731 parameter. */
14736 }
14738 /* Otherwise, it is a non-type parameter or a constrained parameter.
14740 [temp.param]
14742 When parsing a default template-argument for a non-type
14743 template-parameter, the first non-nested `>' is taken as the end
14744 of the template parameter-list rather than a greater-than
14745 operator. */
14746 parameter_declarator
14753 /* If the parameter declaration is marked as a parameter pack, set
14754 *IS_PARAMETER_PACK to notify the caller. */
14759 {
14760 /* Can happen in some cases of erroneous input (c++/34892). */
14762 /* Consume the `...' for better error recovery. */
14764 }
14766 // The parameter may have been constrained.
14769 parameter_declarator,
14770 is_non_type,
14771 is_parameter_pack);
14773 // Now we're sure that the parameter is a non-type parameter.
14784 }
14786 /* Parse a type-parameter.
14788 type-parameter:
14789 class identifier [opt]
14790 class identifier [opt] = type-id
14791 typename identifier [opt]
14792 typename identifier [opt] = type-id
14793 template < template-parameter-list > class identifier [opt]
14794 template < template-parameter-list > class identifier [opt]
14795 = id-expression
14797 GNU Extension (variadic templates):
14799 type-parameter:
14800 class ... identifier [opt]
14801 typename ... identifier [opt]
14803 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14804 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14805 the declaration of the parameter.
14807 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14809 static tree
14811 {
14813 tree parameter;
14815 /* Look for a keyword to tell us what kind of parameter this is. */
14821 {
14824 {
14825 tree identifier;
14826 tree default_argument;
14828 /* If the next token is an ellipsis, we have a template
14829 argument pack. */
14831 {
14832 /* Consume the `...' token. */
14837 }
14839 /* If the next token is an identifier, then it names the
14840 parameter. */
14843 else
14846 /* Create the parameter. */
14849 /* If the next token is an `=', we have a default argument. */
14851 {
14852 default_argument
14855 /* Template parameter packs cannot have default
14856 arguments. */
14858 {
14861 "template parameter pack %qD cannot have a "
14863 else
14865 "template parameter packs cannot have "
14868 }
14871 }
14872 else
14875 /* Create the combined representation of the parameter and the
14876 default argument. */
14878 }
14882 {
14883 tree identifier;
14884 tree default_argument;
14886 /* Look for the `<'. */
14888 /* Parse the template-parameter-list. */
14890 /* Look for the `>'. */
14893 // If template requirements are present, parse them.
14895 {
14900 }
14902 /* Look for the `class' or 'typename' keywords. */
14904 /* If the next token is an ellipsis, we have a template
14905 argument pack. */
14907 {
14908 /* Consume the `...' token. */
14913 }
14914 /* If the next token is an `=', then there is a
14915 default-argument. If the next token is a `>', we are at
14916 the end of the parameter-list. If the next token is a `,',
14917 then we are at the end of this parameter. */
14921 {
14923 /* Treat invalid names as if the parameter were nameless. */
14926 }
14927 else
14930 /* Create the template parameter. */
14932 identifier);
14934 /* If the next token is an `=', then there is a
14935 default-argument. */
14937 {
14938 default_argument
14941 /* Template parameter packs cannot have default
14942 arguments. */
14944 {
14947 "template parameter pack %qD cannot "
14949 identifier);
14950 else
14954 }
14955 }
14956 else
14959 /* Create the combined representation of the parameter and the
14960 default argument. */
14962 }
14968 }
14971 }
14973 /* Parse a template-id.
14975 template-id:
14976 template-name < template-argument-list [opt] >
14978 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14979 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14980 returned. Otherwise, if the template-name names a function, or set
14981 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14982 names a class, returns a TYPE_DECL for the specialization.
14984 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14985 uninstantiated templates. */
14987 static tree
14993 {
14994 tree templ;
14995 tree arguments;
14996 tree template_id;
15001 /* If the next token corresponds to a template-id, there is no need
15002 to reparse it. */
15005 {
15008 }
15010 /* Avoid performing name lookup if there is no possibility of
15011 finding a template-id. */
15014 && !cp_parser_nth_token_starts_template_argument_list_p
15016 {
15019 }
15021 /* Remember where the template-id starts. */
15027 /* Parse the template-name. */
15030 check_dependency_p,
15031 is_declaration,
15032 tag_type,
15035 {
15038 }
15040 /* Since we're going to preserve any side-effects from this parse, set up a
15041 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15042 in the template arguments. */
15045 /* If we find the sequence `[:' after a template-name, it's probably
15046 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15047 parse correctly the argument list. */
15054 {
15056 /* Change `:' into `::'. */
15058 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15059 CPP_LESS. */
15062 /* Parse the arguments. */
15065 {
15066 /* If we couldn't parse an argument list, then we revert our changes
15067 and return simply an error. Maybe this is not a template-id
15068 after all. */
15073 }
15074 /* Otherwise, emit an error about the invalid digraph, but continue
15075 parsing because we got our argument list. */
15078 {
15081 "%<<:%> is an alternate spelling for %<[%>."
15084 {
15086 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15089 }
15090 }
15091 }
15092 else
15093 {
15094 /* Look for the `<' that starts the template-argument-list. */
15096 {
15099 }
15100 /* Parse the arguments. */
15102 }
15104 /* Build a representation of the specialization. */
15107 TEMPLATE_ID_EXPR,
15111 {
15113 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15114 template (rather than some instantiation thereof) only if
15115 is not nested within some other construct. For example, in
15116 "template <typename T> void f(T) { A<T>::", A<T> is just an
15117 instantiation of A. */
15120 CPP_SCOPE));
15121 template_id
15123 }
15124 /* A template-like identifier may be a partial concept id. */
15130 {
15134 }
15135 else
15136 {
15137 /* If it's not a class-template or a template-template, it should be
15138 a function-template. */
15146 }
15148 /* If parsing tentatively, replace the sequence of tokens that makes
15149 up the template-id with a CPP_TEMPLATE_ID token. That way,
15150 should we re-parse the token stream, we will not have to repeat
15151 the effort required to do the parse, nor will we issue duplicate
15152 error messages about problems during instantiation of the
15153 template. */
15155 /* Don't do this if we had a parse error in a declarator; re-parsing
15156 might succeed if a name changes meaning (60361). */
15160 {
15163 /* Reset the contents of the START_OF_ID token. */
15166 /* Update the location to be of the form:
15167 template-name < template-argument-list [opt] >
15168 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15169 with caret == start at the start of the template-name,
15170 ranging until the closing '>'. */
15171 location_t finish_loc
15173 location_t combined_loc
15177 /* Retrieve any deferred checks. Do not pop this access checks yet
15178 so the memory will not be reclaimed during token replacing below. */
15184 /* Purge all subsequent tokens. */
15187 /* ??? Can we actually assume that, if template_id ==
15188 error_mark_node, we will have issued a diagnostic to the
15189 user, as opposed to simply marking the tentative parse as
15190 failed? */
15193 }
15197 }
15199 /* Parse a template-name.
15201 template-name:
15202 identifier
15204 The standard should actually say:
15206 template-name:
15207 identifier
15208 operator-function-id
15210 A defect report has been filed about this issue.
15212 A conversion-function-id cannot be a template name because they cannot
15213 be part of a template-id. In fact, looking at this code:
15215 a.operator K<int>()
15217 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15218 It is impossible to call a templated conversion-function-id with an
15219 explicit argument list, since the only allowed template parameter is
15220 the type to which it is converting.
15222 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15223 `template' keyword, in a construction like:
15225 T::template f<3>()
15227 In that case `f' is taken to be a template-name, even though there
15228 is no way of knowing for sure.
15230 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15231 name refers to a set of overloaded functions, at least one of which
15232 is a template, or an IDENTIFIER_NODE with the name of the template,
15233 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15234 names are looked up inside uninstantiated templates. */
15236 static tree
15243 {
15244 tree identifier;
15245 tree decl;
15246 tree fns;
15249 /* If the next token is `operator', then we have either an
15250 operator-function-id or a conversion-function-id. */
15252 {
15253 /* We don't know whether we're looking at an
15254 operator-function-id or a conversion-function-id. */
15256 /* Try an operator-function-id. */
15258 /* If that didn't work, try a conversion-function-id. */
15260 {
15263 }
15264 }
15265 /* Look for the identifier. */
15266 else
15269 /* If we didn't find an identifier, we don't have a template-id. */
15273 /* If the name immediately followed the `template' keyword, then it
15274 is a template-name. However, if the next token is not `<', then
15275 we do not treat it as a template-name, since it is not being used
15276 as part of a template-id. This enables us to handle constructs
15277 like:
15279 template <typename T> struct S { S(); };
15280 template <typename T> S<T>::S();
15282 correctly. We would treat `S' as a template -- if it were `S<T>'
15283 -- but we do not if there is no `<'. */
15287 {
15288 /* In a declaration, in a dependent context, we pretend that the
15289 "template" keyword was present in order to improve error
15290 recovery. For example, given:
15292 template <typename T> void f(T::X<int>);
15294 we want to treat "X<int>" as a template-id. */
15296 && !template_keyword_p
15298 && check_dependency_p
15300 /* Do not do this for dtors (or ctors), since they never
15301 need the template keyword before their name. */
15303 {
15306 /* Explain what went wrong. */
15308 identifier);
15311 /* If parsing tentatively, find the location of the "<" token. */
15314 /* Parse the template arguments so that we can issue error
15315 messages about them. */
15318 /* Skip tokens until we find a good place from which to
15319 continue parsing. */
15324 /* If parsing tentatively, permanently remove the
15325 template argument list. That will prevent duplicate
15326 error messages from being issued about the missing
15327 "template" keyword. */
15333 }
15335 /* If the "template" keyword is present, then there is generally
15336 no point in doing name-lookup, so we just return IDENTIFIER.
15337 But, if the qualifying scope is non-dependent then we can
15338 (and must) do name-lookup normally. */
15344 }
15346 /* Look up the name. */
15348 tag_type,
15351 check_dependency_p,
15357 /* If DECL is a template, then the name was a template-name. */
15359 {
15363 }
15364 else
15365 {
15368 /* The standard does not explicitly indicate whether a name that
15369 names a set of overloaded declarations, some of which are
15370 templates, is a template-name. However, such a name should
15371 be a template-name; otherwise, there is no way to form a
15372 template-id for the overloaded templates. */
15380 {
15381 /* The name does not name a template. */
15384 }
15385 }
15387 /* If DECL is dependent, and refers to a function, then just return
15388 its name; we will look it up again during template instantiation. */
15390 {
15394 }
15397 }
15399 /* Parse a template-argument-list.
15401 template-argument-list:
15402 template-argument ... [opt]
15403 template-argument-list , template-argument ... [opt]
15405 Returns a TREE_VEC containing the arguments. */
15407 static tree
15409 {
15414 tree vec;
15421 /* Even if the template-id appears in an integral
15422 constant-expression, the contents of the argument list do
15423 not. */
15429 /* Parse the arguments. */
15430 do
15431 {
15432 tree argument;
15435 /* Consume the comma. */
15438 /* Parse the template-argument. */
15441 /* If the next token is an ellipsis, we're expanding a template
15442 argument pack. */
15444 {
15446 {
15450 }
15451 /* Consume the `...' token. */
15454 /* Make the argument into a TYPE_PACK_EXPANSION or
15455 EXPR_PACK_EXPANSION. */
15457 }
15460 {
15464 {
15467 }
15468 else
15470 }
15472 }
15488 }
15490 /* Parse a template-argument.
15492 template-argument:
15493 assignment-expression
15494 type-id
15495 id-expression
15497 The representation is that of an assignment-expression, type-id, or
15498 id-expression -- except that the qualified id-expression is
15499 evaluated, so that the value returned is either a DECL or an
15500 OVERLOAD.
15502 Although the standard says "assignment-expression", it forbids
15503 throw-expressions or assignments in the template argument.
15504 Therefore, we use "conditional-expression" instead. */
15506 static tree
15508 {
15509 tree argument;
15515 cp_id_kind idk;
15517 /* There's really no way to know what we're looking at, so we just
15518 try each alternative in order.
15520 [temp.arg]
15522 In a template-argument, an ambiguity between a type-id and an
15523 expression is resolved to a type-id, regardless of the form of
15524 the corresponding template-parameter.
15526 Therefore, we try a type-id first. */
15529 /* If there was no error parsing the type-id but the next token is a
15530 '>>', our behavior depends on which dialect of C++ we're
15531 parsing. In C++98, we probably found a typo for '> >'. But there
15532 are type-id which are also valid expressions. For instance:
15534 struct X { int operator >> (int); };
15535 template <int V> struct Foo {};
15536 Foo<X () >> 5> r;
15538 Here 'X()' is a valid type-id of a function type, but the user just
15539 wanted to write the expression "X() >> 5". Thus, we remember that we
15540 found a valid type-id, but we still try to parse the argument as an
15541 expression to see what happens.
15543 In C++0x, the '>>' will be considered two separate '>'
15544 tokens. */
15548 {
15551 }
15552 else
15553 {
15554 /* If the next token isn't a `,' or a `>', then this argument wasn't
15555 really finished. This means that the argument is not a valid
15556 type-id. */
15559 /* If that worked, we're done. */
15562 }
15563 /* We're still not sure what the argument will be. */
15565 /* Try a template. */
15573 /* If the next token isn't a `,' or a `>', then this argument wasn't
15574 really finished. */
15578 {
15579 /* Figure out what is being referred to. If the id-expression
15580 was for a class template specialization, then we will have a
15581 TYPE_DECL at this point. There is no need to do name lookup
15582 at this point in that case. */
15585 none_type,
15591 /* Handle a constrained-type-specifier for a non-type template
15592 parameter. */
15598 }
15600 {
15604 }
15605 /* It must be a non-type argument. In C++17 any constant-expression is
15606 allowed. */
15610 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15612 -- an integral constant-expression of integral or enumeration
15613 type; or
15615 -- the name of a non-type template-parameter; or
15617 -- the name of an object or function with external linkage...
15619 -- the address of an object or function with external linkage...
15621 -- a pointer to member... */
15622 /* Look for a non-type template parameter. */
15624 {
15636 }
15638 /* If the next token is "&", the argument must be the address of an
15639 object or function with external linkage. */
15642 {
15645 }
15646 /* See if we might have an id-expression. */
15653 {
15656 address_p,
15663 else
15664 {
15665 tree probe;
15668 {
15669 /* Strip the dereference temporarily. */
15672 }
15674 /* If we're in a template, we represent a qualified-id referring
15675 to a static data member as a SCOPE_REF even if the scope isn't
15676 dependent so that we can check access control later. */
15681 {
15682 /* A variable without external linkage might still be a
15683 valid constant-expression, so no error is issued here
15684 if the external-linkage check fails. */
15687 }
15689 /* All overloaded functions are allowed; if the external
15690 linkage test does not pass, an error will be issued
15691 later. */
15692 ;
15696 /* A pointer-to-member. */
15697 ;
15699 ;
15700 else
15704 {
15707 tf_warning_or_error);
15708 else
15711 }
15712 }
15713 }
15714 /* If the argument started with "&", there are no other valid
15715 alternatives at this point. */
15717 {
15720 }
15722 general_expr:
15723 /* If the argument wasn't successfully parsed as a type-id followed
15724 by '>>', the argument can only be a constant expression now.
15725 Otherwise, we try parsing the constant-expression tentatively,
15726 because the argument could really be a type-id. */
15732 else
15733 {
15734 /* With C++17 generalized non-type template arguments we need to handle
15735 lvalue constant expressions, too. */
15738 }
15746 /* We did our best to parse the argument as a non type-id, but that
15747 was the only alternative that matched (albeit with a '>' after
15748 it). We can assume it's just a typo from the user, and a
15749 diagnostic will then be issued. */
15751 }
15753 /* Parse an explicit-instantiation.
15755 explicit-instantiation:
15756 template declaration
15758 Although the standard says `declaration', what it really means is:
15760 explicit-instantiation:
15761 template decl-specifier-seq [opt] declarator [opt] ;
15763 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15764 supposed to be allowed. A defect report has been filed about this
15765 issue.
15767 GNU Extension:
15769 explicit-instantiation:
15770 storage-class-specifier template
15771 decl-specifier-seq [opt] declarator [opt] ;
15772 function-specifier template
15773 decl-specifier-seq [opt] declarator [opt] ; */
15775 static void
15777 {
15779 cp_decl_specifier_seq decl_specifiers;
15784 /* Look for an (optional) storage-class-specifier or
15785 function-specifier. */
15787 {
15788 extension_specifier
15791 extension_specifier
15794 }
15796 /* Look for the `template' keyword. */
15798 /* Let the front end know that we are processing an explicit
15799 instantiation. */
15801 /* [temp.explicit] says that we are supposed to ignore access
15802 control while processing explicit instantiation directives. */
15804 /* Parse a decl-specifier-seq. */
15806 CP_PARSER_FLAGS_OPTIONAL,
15809 /* If there was exactly one decl-specifier, and it declared a class,
15810 and there's no declarator, then we have an explicit type
15811 instantiation. */
15813 {
15814 tree type;
15818 /* Turn access control back on for names used during
15819 template instantiation. */
15824 }
15825 else
15826 {
15828 tree decl;
15830 /* Parse the declarator. */
15831 declarator
15842 {
15845 "explicit instantiation shall not use"
15849 "explicit instantiation shall not use"
15854 /* Turn access control back on for names used during
15855 template instantiation. */
15857 /* Do the explicit instantiation. */
15859 }
15860 else
15861 {
15863 /* Skip the body of the explicit instantiation. */
15865 }
15866 }
15867 /* We're done with the instantiation. */
15873 }
15875 /* Parse an explicit-specialization.
15877 explicit-specialization:
15878 template < > declaration
15880 Although the standard says `declaration', what it really means is:
15882 explicit-specialization:
15883 template <> decl-specifier [opt] init-declarator [opt] ;
15884 template <> function-definition
15885 template <> explicit-specialization
15886 template <> template-declaration */
15888 static void
15890 {
15894 /* Look for the `template' keyword. */
15896 /* Look for the `<'. */
15898 /* Look for the `>'. */
15900 /* We have processed another parameter list. */
15902 /* [temp]
15904 A template ... explicit specialization ... shall not have C
15905 linkage. */
15907 {
15909 /* Give it C++ linkage to avoid confusing other parts of the
15910 front end. */
15913 }
15914 else
15916 /* Let the front end know that we are beginning a specialization. */
15918 {
15921 }
15923 /* If the next keyword is `template', we need to figure out whether
15924 or not we're looking a template-declaration. */
15926 {
15931 else
15933 }
15934 else
15935 /* Parse the dependent declaration. */
15941 /* We're done with the specialization. */
15943 /* For the erroneous case of a template with C linkage, we pushed an
15944 implicit C++ linkage scope; exit that scope now. */
15947 /* We're done with this parameter list. */
15949 }
15951 /* Parse a type-specifier.
15953 type-specifier:
15954 simple-type-specifier
15955 class-specifier
15956 enum-specifier
15957 elaborated-type-specifier
15958 cv-qualifier
15960 GNU Extension:
15962 type-specifier:
15963 __complex__
15965 Returns a representation of the type-specifier. For a
15966 class-specifier, enum-specifier, or elaborated-type-specifier, a
15967 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15969 The parser flags FLAGS is used to control type-specifier parsing.
15971 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15972 in a decl-specifier-seq.
15974 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15975 class-specifier, enum-specifier, or elaborated-type-specifier, then
15976 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15977 if a type is declared; 2 if it is defined. Otherwise, it is set to
15978 zero.
15980 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15981 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15982 is set to FALSE. */
15984 static tree
15986 cp_parser_flags flags,
15991 {
15997 /* Assume this type-specifier does not declare a new type. */
16000 /* And that it does not specify a cv-qualifier. */
16003 /* Peek at the next token. */
16006 /* If we're looking at a keyword, we can use that to guide the
16007 production we choose. */
16010 {
16015 /* Look for the enum-specifier. */
16017 /* If that worked, we're done. */
16019 {
16024 type_spec,
16025 token,
16028 }
16029 else
16032 /* Any of these indicate either a class-specifier, or an
16033 elaborated-type-specifier. */
16040 /* Parse tentatively so that we can back up if we don't find a
16041 class-specifier. */
16043 /* Look for the class-specifier. */
16046 /* If that worked, we're done. */
16048 {
16053 type_spec,
16054 token,
16057 }
16059 /* Fall through. */
16060 elaborated_type_specifier:
16061 /* We're declaring (not defining) a class or enum. */
16065 /* Fall through. */
16067 /* Look for an elaborated-type-specifier. */
16068 type_spec
16069 = (cp_parser_elaborated_type_specifier
16072 is_declaration));
16075 type_spec,
16076 token,
16099 /* The `__complex__' keyword is a GNU extension. */
16105 }
16107 /* Handle simple keywords. */
16109 {
16111 {
16114 }
16116 }
16118 /* If we do not already have a type-specifier, assume we are looking
16119 at a simple-type-specifier. */
16121 decl_specs,
16122 flags);
16124 /* If we didn't find a type-specifier, and a type-specifier was not
16125 optional in this context, issue an error message. */
16127 {
16130 }
16133 }
16135 /* Parse a simple-type-specifier.
16137 simple-type-specifier:
16138 :: [opt] nested-name-specifier [opt] type-name
16139 :: [opt] nested-name-specifier template template-id
16140 char
16141 wchar_t
16142 bool
16143 short
16144 int
16145 long
16146 signed
16147 unsigned
16148 float
16149 double
16150 void
16152 C++0x Extension:
16154 simple-type-specifier:
16155 auto
16156 decltype ( expression )
16157 char16_t
16158 char32_t
16159 __underlying_type ( type-id )
16161 GNU Extension:
16163 simple-type-specifier:
16164 __int128
16165 __typeof__ unary-expression
16166 __typeof__ ( type-id )
16167 __typeof__ ( type-id ) { initializer-list , [opt] }
16169 Concepts Extension:
16171 simple-type-specifier:
16172 constrained-type-specifier
16174 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16175 appropriately updated. */
16177 static tree
16180 cp_parser_flags flags)
16181 {
16186 /* Peek at the next token. */
16189 /* If we're looking at a keyword, things are easy. */
16191 {
16226 {
16229 }
16258 {
16259 /* The 'auto' might be the placeholder return type for a function decl
16260 with trailing return type. */
16269 {
16271 {
16278 }
16281 {
16284 }
16287 }
16291 {
16294 }
16297 {
16300 }
16301 else
16305 {
16308 "use of %<auto%> in lambda parameter declaration "
16309 "only available with "
16311 }
16314 "use of %<auto%> in parameter declaration "
16315 "only available with "
16319 "ISO C++ forbids use of %<auto%> in parameter "
16321 }
16322 else
16327 /* Since DR 743, decltype can either be a simple-type-specifier by
16328 itself or begin a nested-name-specifier. Parsing it will replace
16329 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16330 handling below decide what to do. */
16336 /* Consume the `typeof' token. */
16338 /* Parse the operand to `typeof'. */
16340 /* If it is not already a TYPE, take its type. */
16346 token,
16355 token,
16365 token,
16370 }
16372 /* If token is an already-parsed decltype not followed by ::,
16373 it's a simple-type-specifier. */
16376 {
16379 {
16381 token,
16383 /* Remember that we are handling a decltype in order to
16384 implement the resolution of DR 1510 when the argument
16385 isn't instantiation dependent. */
16387 }
16390 }
16392 /* If the type-specifier was for a built-in type, we're done. */
16394 {
16395 /* Record the type. */
16402 type,
16403 token,
16408 /* Consume the token. */
16414 /* There is no valid C++ program where a non-template type is
16415 followed by a "<". That usually indicates that the user thought
16416 that the type was a template. */
16421 }
16423 /* The type-specifier must be a user-defined type. */
16425 {
16429 /* Don't gobble tokens or issue error messages if this is an
16430 optional type-specifier. */
16434 /* Look for the optional `::' operator. */
16435 global_p
16439 /* Look for the nested-name specifier. */
16440 qualified_p
16448 /* If we have seen a nested-name-specifier, and the next token
16449 is `template', then we are using the template-id production. */
16452 {
16453 /* Look for the template-id. */
16457 none_type,
16459 /* If the template-id did not name a type, we are out of
16460 luck. */
16462 {
16465 }
16466 }
16467 /* Otherwise, look for a type-name. */
16468 else
16470 /* Keep track of all name-lookups performed in class scopes. */
16472 && !global_p
16473 && !qualified_p
16477 /* If it didn't work out, we don't have a TYPE. */
16483 token,
16485 }
16487 /* If we didn't get a type-name, issue an error message. */
16489 {
16492 }
16495 {
16496 /* See if TYPE is an Objective-C type, and if so, parse and
16497 accept any protocol references following it. Do this before
16498 the cp_parser_check_for_invalid_template_id() call, because
16499 Objective-C types can be followed by '<...>' which would
16500 enclose protocol names rather than template arguments, and so
16501 everything is fine. */
16504 {
16508 /* Clobber the "unqualified" type previously entered into
16509 DECL_SPECS with the new, improved protocol-qualified version. */
16514 }
16516 /* There is no valid C++ program where a non-template type is
16517 followed by a "<". That usually indicates that the user
16518 thought that the type was a template. */
16520 none_type,
16522 }
16525 }
16527 /* Parse a type-name.
16529 type-name:
16530 class-name
16531 enum-name
16532 typedef-name
16533 simple-template-id [in c++0x]
16535 enum-name:
16536 identifier
16538 typedef-name:
16539 identifier
16541 Concepts:
16543 type-name:
16544 concept-name
16545 partial-concept-id
16547 concept-name:
16548 identifier
16550 Returns a TYPE_DECL for the type. */
16552 static tree
16554 {
16556 }
16558 /* See above. */
16559 static tree
16561 {
16562 tree type_decl;
16564 /* We can't know yet whether it is a class-name or not. */
16566 /* Try a class-name. */
16568 typename_keyword_p,
16570 none_type,
16574 /* If it's not a class-name, keep looking. */
16576 {
16578 /* It must be a typedef-name or an enum-name. */
16582 /* It is either a simple-template-id representing an
16583 instantiation of an alias template... */
16587 none_type,
16589 /* Note that this must be an instantiation of an alias template
16590 because [temp.names]/6 says:
16592 A template-id that names an alias template specialization
16593 is a type-name.
16595 Whereas [temp.names]/7 says:
16597 A simple-template-id that names a class template
16598 specialization is a class-name.
16600 With concepts, this could also be a partial-concept-id that
16601 declares a non-type template parameter. */
16608 else
16612 /* ... Or a typedef-name or an enum-name. */
16614 }
16617 }
16619 /* Check if DECL and ARGS can form a constrained-type-specifier.
16620 If ARGS is non-null, we try to form a concept check of the
16621 form DECL<?, ARGS> where ? is a wildcard that matches any
16622 kind of template argument. If ARGS is NULL, then we try to
16623 form a concept check of the form DECL<?>. */
16625 static tree
16628 {
16631 /* If we a constrained-type-specifier cannot be deduced. */
16635 /* A constrained type specifier can only be found in an
16636 overload set or as a reference to a template declaration.
16638 FIXME: This might be masking a bug. It's possible that
16639 that the deduction below is causing template specializations
16640 to be formed with the wildcard as an argument. */
16644 /* Try to build a call expression that evaluates the
16645 concept. This can fail if the overload set refers
16646 only to non-templates. */
16652 /* Deduce the checked constraint and the prototype parameter.
16654 FIXME: In certain cases, failure to deduce should be a
16655 diagnosable error. */
16656 tree conc;
16657 tree proto;
16661 /* In template parameter scope, this results in a constrained
16662 parameter. Return a descriptor of that parm. */
16666 /* In a parameter-declaration-clause, constrained-type
16667 specifiers result in invented template parameters. */
16669 {
16672 }
16673 else
16674 {
16675 /* Otherwise, we're in a context where the constrained
16676 type name is deduced and the constraint applies
16677 after deduction. */
16679 }
16682 }
16684 /* If DECL refers to a concept, return a TYPE_DECL representing
16685 the result of using the constrained type specifier in the
16686 current context. DECL refers to a concept if
16688 - it is an overload set containing a function concept taking a single
16689 type argument, or
16691 - it is a variable concept taking a single type argument. */
16693 static tree
16695 {
16701 else
16703 }
16705 /* Check if DECL and ARGS form a partial-concept-id. If so,
16706 assign ID to the resulting constrained placeholder.
16708 Returns true if the partial-concept-id designates a placeholder
16709 and false otherwise. Note that *id is set to NULL_TREE in
16710 this case. */
16712 static tree
16714 {
16716 }
16718 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16719 or a concept-name.
16721 enum-name:
16722 identifier
16724 typedef-name:
16725 identifier
16727 concept-name:
16728 identifier
16730 Returns a TYPE_DECL for the type. */
16732 static tree
16734 {
16735 tree type_decl;
16736 tree identifier;
16743 /* Look up the type-name. */
16748 /* If we found an overload set, then it may refer to a concept-name. */
16754 {
16755 /* See if this is an Objective-C type. */
16760 }
16762 /* Issue an error if we did not find a type-name. */
16764 /* In Objective-C, we have the complication that class names are
16765 normally type names and start declarations (eg, the
16766 "NSObject" in "NSObject *object;"), but can be used in an
16767 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16768 is an expression. So, a classname followed by a dot is not a
16769 valid type-name. */
16772 {
16777 }
16778 /* Remember that the name was used in the definition of the
16779 current class so that we can check later to see if the
16780 meaning would have been different after the class was
16781 entirely defined. */
16787 }
16789 /* Parse an elaborated-type-specifier. Note that the grammar given
16790 here incorporates the resolution to DR68.
16792 elaborated-type-specifier:
16793 class-key :: [opt] nested-name-specifier [opt] identifier
16794 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16795 enum-key :: [opt] nested-name-specifier [opt] identifier
16796 typename :: [opt] nested-name-specifier identifier
16797 typename :: [opt] nested-name-specifier template [opt]
16798 template-id
16800 GNU extension:
16802 elaborated-type-specifier:
16803 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16804 class-key attributes :: [opt] nested-name-specifier [opt]
16805 template [opt] template-id
16806 enum attributes :: [opt] nested-name-specifier [opt] identifier
16808 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16809 declared `friend'. If IS_DECLARATION is TRUE, then this
16810 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16811 something is being declared.
16813 Returns the TYPE specified. */
16815 static tree
16819 {
16821 tree identifier;
16824 tree globalscope;
16827 /* See if we're looking at the `enum' keyword. */
16829 {
16830 /* Consume the `enum' token. */
16832 /* Remember that it's an enumeration type. */
16834 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16835 enums) is used here. */
16838 {
16842 /* Consume the `struct' or `class' and parse it anyway. */
16844 }
16845 /* Parse the attributes. */
16847 }
16848 /* Or, it might be `typename'. */
16850 RID_TYPENAME))
16851 {
16852 /* Consume the `typename' token. */
16854 /* Remember that it's a `typename' type. */
16856 }
16857 /* Otherwise it must be a class-key. */
16858 else
16859 {
16863 /* Parse the attributes. */
16865 }
16867 /* Look for the `::' operator. */
16870 /* Look for the nested-name-specifier. */
16872 {
16877 is_declaration))
16879 }
16880 else
16881 /* Even though `typename' is not present, the proposed resolution
16882 to Core Issue 180 says that in `class A<T>::B', `B' should be
16883 considered a type-name, even if `A<T>' is dependent. */
16888 is_declaration);
16889 /* For everything but enumeration types, consider a template-id.
16890 For an enumeration type, consider only a plain identifier. */
16892 {
16894 tree decl;
16896 /* Allow the `template' keyword. */
16898 /* If we didn't see `template', we don't know if there's a
16899 template-id or not. */
16902 /* Parse the template-id. */
16906 tag_type,
16907 is_declaration);
16908 /* If we didn't find a template-id, look for an ordinary
16909 identifier. */
16911 ;
16912 /* We can get here when cp_parser_template_id, called by
16913 cp_parser_class_name with tag_type == none_type, succeeds
16914 and caches a BASELINK. Then, when called again here,
16915 instead of failing and returning an error_mark_node
16916 returns it (see template/typename17.C in C++11).
16917 ??? Could we diagnose this earlier? */
16919 {
16922 }
16923 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16924 in effect, then we must assume that, upon instantiation, the
16925 template will correspond to a class. */
16929 typename_type,
16931 /* If the `typename' keyword is in effect and DECL is not a type
16932 decl, then type is non existent. */
16934 ;
16940 }
16943 {
16948 {
16951 }
16953 /* For a `typename', we needn't call xref_tag. */
16959 /* Template parameter lists apply only if we are not within a
16960 function parameter list. */
16961 bool template_parm_lists_apply
16970 /* Look up a qualified name in the usual way. */
16972 {
16973 tree decl;
16974 tree ambiguous_decls;
16977 tag_type,
16984 /* If the lookup was ambiguous, an error will already have been
16985 issued. */
16989 /* If we are parsing friend declaration, DECL may be a
16990 TEMPLATE_DECL tree node here. However, we need to check
16991 whether this TEMPLATE_DECL results in valid code. Consider
16992 the following example:
16994 namespace N {
16995 template <class T> class C {};
16996 }
16997 class X {
16998 template <class T> friend class N::C; // #1, valid code
16999 };
17000 template <class T> class Y {
17001 friend class N::C; // #2, invalid code
17002 };
17004 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17005 name lookup of `N::C'. We see that friend declaration must
17006 be template for the code to be valid. Note that
17007 processing_template_decl does not work here since it is
17008 always 1 for the above two cases. */
17010 decl = (cp_parser_maybe_treat_template_as_class
17015 {
17017 identifier,
17020 }
17023 {
17027 allow_template);
17031 }
17033 /* Forward declarations of nested types, such as
17035 class C1::C2;
17036 class C1::C2::C3;
17038 are invalid unless all components preceding the final '::'
17039 are complete. If all enclosing types are complete, these
17040 declarations become merely pointless.
17042 Invalid forward declarations of nested types are errors
17043 caught elsewhere in parsing. Those that are pointless arrive
17044 here. */
17051 }
17052 else
17053 {
17054 /* An elaborated-type-specifier sometimes introduces a new type and
17055 sometimes names an existing type. Normally, the rule is that it
17056 introduces a new type only if there is not an existing type of
17057 the same name already in scope. For example, given:
17059 struct S {};
17060 void f() { struct S s; }
17062 the `struct S' in the body of `f' is the same `struct S' as in
17063 the global scope; the existing definition is used. However, if
17064 there were no global declaration, this would introduce a new
17065 local class named `S'.
17067 An exception to this rule applies to the following code:
17069 namespace N { struct S; }
17071 Here, the elaborated-type-specifier names a new type
17072 unconditionally; even if there is already an `S' in the
17073 containing scope this declaration names a new type.
17074 This exception only applies if the elaborated-type-specifier
17075 forms the complete declaration:
17077 [class.name]
17079 A declaration consisting solely of `class-key identifier ;' is
17080 either a redeclaration of the name in the current scope or a
17081 forward declaration of the identifier as a class name. It
17082 introduces the name into the current scope.
17084 We are in this situation precisely when the next token is a `;'.
17086 An exception to the exception is that a `friend' declaration does
17087 *not* name a new type; i.e., given:
17089 struct S { friend struct T; };
17091 `T' is not a new type in the scope of `S'.
17093 Also, `new struct S' or `sizeof (struct S)' never results in the
17094 definition of a new type; a new type can only be declared in a
17095 declaration context. */
17097 tag_scope ts;
17101 /* Friends have special name lookup rules. */
17105 CPP_SEMICOLON))
17106 /* This is a `class-key identifier ;' */
17108 else
17111 template_p =
17112 (template_parm_lists_apply
17115 /* An unqualified name was used to reference this type, so
17116 there were no qualifying templates. */
17124 }
17125 }
17130 /* Allow attributes on forward declarations of classes. */
17132 {
17142 else
17145 }
17148 {
17149 /* Indicate whether this class was declared as a `class' or as a
17150 `struct'. */
17154 }
17156 /* A "<" cannot follow an elaborated type specifier. If that
17157 happens, the user was probably trying to form a template-id. */
17162 }
17164 /* Parse an enum-specifier.
17166 enum-specifier:
17167 enum-head { enumerator-list [opt] }
17168 enum-head { enumerator-list , } [C++0x]
17170 enum-head:
17171 enum-key identifier [opt] enum-base [opt]
17172 enum-key nested-name-specifier identifier enum-base [opt]
17174 enum-key:
17175 enum
17176 enum class [C++0x]
17177 enum struct [C++0x]
17179 enum-base: [C++0x]
17180 : type-specifier-seq
17182 opaque-enum-specifier:
17183 enum-key identifier enum-base [opt] ;
17185 GNU Extensions:
17186 enum-key attributes[opt] identifier [opt] enum-base [opt]
17187 { enumerator-list [opt] }attributes[opt]
17188 enum-key attributes[opt] identifier [opt] enum-base [opt]
17189 { enumerator-list, }attributes[opt] [C++0x]
17191 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17192 if the token stream isn't an enum-specifier after all. */
17194 static tree
17196 {
17197 tree identifier;
17199 tree prev_scope;
17201 tree attributes;
17214 /* Parse tentatively so that we can back up if we don't find a
17215 enum-specifier. */
17218 /* Caller guarantees that the current token is 'enum', an identifier
17219 possibly follows, and the token after that is an opening brace.
17220 If we don't have an identifier, fabricate an anonymous name for
17221 the enumeration being defined. */
17224 /* Parse the "class" or "struct", which indicates a scoped
17225 enumeration type in C++0x. */
17228 {
17232 /* Consume the `struct' or `class' token. */
17236 }
17240 /* Clear the qualification. */
17245 /* Figure out in what scope the declaration is being placed. */
17251 nested_name_specifier
17259 {
17260 tree name;
17264 enum_type,
17269 input_location);
17271 {
17274 {
17275 /* Are template enums allowed in ISO? */
17279 /* ignore a typename reference, for it will be solved by name
17280 in start_enum. */
17282 }
17283 }
17286 else
17287 {
17292 }
17293 }
17294 else
17295 {
17298 else
17299 {
17305 }
17306 }
17309 /* Check for the `:' that denotes a specified underlying type in C++0x.
17310 Note that a ':' could also indicate a bitfield width, however. */
17312 {
17313 cp_decl_specifier_seq type_specifiers;
17315 /* Consume the `:'. */
17318 /* Parse the type-specifier-seq. */
17323 /* At this point this is surely not elaborated type specifier. */
17332 /* If that didn't work, stop. */
17334 {
17340 }
17341 }
17343 /* Look for the `{' but don't consume it yet. */
17345 {
17347 {
17350 {
17353 }
17354 }
17355 /* An opaque-enum-specifier must have a ';' here. */
17358 {
17361 {
17364 }
17365 }
17366 }
17372 {
17374 {
17378 }
17380 {
17382 }
17383 }
17385 /* Issue an error message if type-definitions are forbidden here. */
17388 else
17389 /* Create the new type. We do this before consuming the opening
17390 brace so the enum will be recorded as being on the line of its
17391 tag (or the 'enum' keyword, if there is no tag). */
17395 /* If the next token is not '{' it is an opaque-enum-specifier or an
17396 elaborated-type-specifier. */
17398 {
17402 {
17403 /* The following catches invalid code such as:
17404 enum class S<int>::E { A, B, C }; */
17412 {
17416 nested_name_specifier);
17418 }
17421 {
17423 "%qT for enum declaration does not name a class "
17426 }
17427 /* If that scope does not contain the scope in which the
17428 class was originally declared, the program is invalid. */
17430 nested_name_specifier))
17431 {
17434 "declaration of %qD in namespace %qD which does not "
17437 else
17439 "declaration of %qD in %qD which does not "
17443 }
17444 /* If that scope is the scope where the declaration is being placed
17445 the program is invalid. */
17449 {
17453 }
17454 }
17459 /* Consume the opening brace. */
17466 {
17470 }
17471 else
17472 {
17478 }
17482 /* If the next token is not '}', then there are some enumerators. */
17484 {
17488 }
17489 else
17492 /* Consume the final '}'. */
17498 }
17499 else
17500 {
17501 /* If a ';' follows, then it is an opaque-enum-specifier
17502 and additional restrictions apply. */
17504 {
17511 }
17512 }
17514 /* Look for trailing attributes to apply to this enumeration, and
17515 apply them if appropriate. */
17517 {
17520 trailing_attr,
17522 }
17524 /* Finish up the enumeration. */
17526 {
17531 }
17534 {
17536 {
17539 }
17541 {
17543 }
17544 }
17545 out:
17548 }
17550 /* Parse an enumerator-list. The enumerators all have the indicated
17551 TYPE.
17553 enumerator-list:
17554 enumerator-definition
17555 enumerator-list , enumerator-definition */
17557 static void
17559 {
17561 {
17562 /* Parse an enumerator-definition. */
17565 /* If the next token is not a ',', we've reached the end of
17566 the list. */
17569 /* Otherwise, consume the `,' and keep going. */
17571 /* If the next token is a `}', there is a trailing comma. */
17573 {
17578 }
17579 }
17580 }
17582 /* Parse an enumerator-definition. The enumerator has the indicated
17583 TYPE.
17585 enumerator-definition:
17586 enumerator
17587 enumerator = constant-expression
17589 enumerator:
17590 identifier
17592 GNU Extensions:
17594 enumerator-definition:
17595 enumerator attributes [opt]
17596 enumerator attributes [opt] = constant-expression */
17598 static void
17600 {
17601 tree identifier;
17602 tree value;
17603 location_t loc;
17605 /* Save the input location because we are interested in the location
17606 of the identifier and not the location of the explicit value. */
17609 /* Look for the identifier. */
17614 /* Parse any specified attributes. */
17617 /* If the next token is an '=', then there is an explicit value. */
17619 {
17620 /* Consume the `=' token. */
17622 /* Parse the value. */
17624 }
17625 else
17628 /* If we are processing a template, make sure the initializer of the
17629 enumerator doesn't contain any bare template parameter pack. */
17633 /* Create the enumerator. */
17635 }
17637 /* Parse a namespace-name.
17639 namespace-name:
17640 original-namespace-name
17641 namespace-alias
17643 Returns the NAMESPACE_DECL for the namespace. */
17645 static tree
17647 {
17648 tree identifier;
17649 tree namespace_decl;
17653 /* Get the name of the namespace. */
17658 /* Look up the identifier in the currently active scope. Look only
17659 for namespaces, due to:
17661 [basic.lookup.udir]
17663 When looking up a namespace-name in a using-directive or alias
17664 definition, only namespace names are considered.
17666 And:
17668 [basic.lookup.qual]
17670 During the lookup of a name preceding the :: scope resolution
17671 operator, object, function, and enumerator names are ignored.
17673 (Note that cp_parser_qualifying_entity only calls this
17674 function if the token after the name is the scope resolution
17675 operator.) */
17677 none_type,
17683 /* If it's not a namespace, issue an error. */
17686 {
17691 }
17694 }
17696 /* Parse a namespace-definition.
17698 namespace-definition:
17699 named-namespace-definition
17700 unnamed-namespace-definition
17702 named-namespace-definition:
17703 original-namespace-definition
17704 extension-namespace-definition
17706 original-namespace-definition:
17707 namespace identifier { namespace-body }
17709 extension-namespace-definition:
17710 namespace original-namespace-name { namespace-body }
17712 unnamed-namespace-definition:
17713 namespace { namespace-body } */
17715 static void
17717 {
17727 {
17731 }
17732 else
17735 /* Look for the `namespace' keyword. */
17738 /* Parse any specified attributes before the identifier. */
17741 /* Get the name of the namespace. We do not attempt to distinguish
17742 between an original-namespace-definition and an
17743 extension-namespace-definition at this point. The semantic
17744 analysis routines are responsible for that. */
17747 else
17750 /* Parse any specified attributes after the identifier. */
17753 {
17756 else
17758 }
17760 /* Start the namespace. */
17763 /* Parse any nested namespace definition. */
17765 {
17770 "nested namespace definitions only available with "
17775 {
17779 else
17780 {
17783 }
17786 }
17787 }
17789 /* Look for the `{' to validate starting the namespace. */
17792 /* "inline namespace" is equivalent to a stub namespace definition
17793 followed by a strong using directive. */
17795 {
17797 /* Set up namespace association. */
17801 /* Import the contents of the inline namespace. */
17805 }
17811 /* Parse the body of the namespace. */
17817 /* Finish the nested namespace definitions. */
17821 /* Finish the namespace. */
17824 /* Look for the final `}'. */
17826 }
17828 /* Parse a namespace-body.
17830 namespace-body:
17831 declaration-seq [opt] */
17833 static void
17835 {
17837 }
17839 /* Parse a namespace-alias-definition.
17841 namespace-alias-definition:
17842 namespace identifier = qualified-namespace-specifier ; */
17844 static void
17846 {
17847 tree identifier;
17848 tree namespace_specifier;
17852 /* Look for the `namespace' keyword. */
17854 /* Look for the identifier. */
17858 /* Look for the `=' token. */
17861 {
17863 /* Skip the definition. */
17868 }
17870 /* Look for the qualified-namespace-specifier. */
17871 namespace_specifier
17873 /* Look for the `;' token. */
17876 /* Register the alias in the symbol table. */
17878 }
17880 /* Parse a qualified-namespace-specifier.
17882 qualified-namespace-specifier:
17883 :: [opt] nested-name-specifier [opt] namespace-name
17885 Returns a NAMESPACE_DECL corresponding to the specified
17886 namespace. */
17888 static tree
17890 {
17891 /* Look for the optional `::'. */
17895 /* Look for the optional nested-name-specifier. */
17903 }
17905 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17906 access declaration.
17908 using-declaration:
17909 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17910 using :: unqualified-id ;
17912 access-declaration:
17913 qualified-id ;
17915 */
17917 static bool
17920 {
17924 tree decl;
17925 tree identifier;
17926 tree qscope;
17931 {
17934 }
17935 else
17936 {
17937 /* Look for the `using' keyword. */
17940 /* Peek at the next token. */
17942 /* See if it's `typename'. */
17944 {
17945 /* Remember that we've seen it. */
17947 /* Consume the `typename' token. */
17949 }
17950 }
17952 /* Look for the optional global scope qualification. */
17953 global_scope_p
17958 /* If we saw `typename', or didn't see `::', then there must be a
17959 nested-name-specifier present. */
17961 {
17967 {
17970 }
17971 }
17972 /* Otherwise, we could be in either of the two productions. In that
17973 case, treat the nested-name-specifier as optional. */
17974 else
17986 /* Something has already gone wrong; there's no need to parse
17987 further. Since an error has occurred, the return value of
17988 cp_parser_parse_definitely will be false, as required. */
17992 /* Parse the unqualified-id. */
18000 {
18005 }
18007 /* The function we call to handle a using-declaration is different
18008 depending on what scope we are in. */
18010 ;
18013 /* [namespace.udecl]
18015 A using declaration shall not name a template-id. */
18018 else
18019 {
18021 {
18022 /* Create the USING_DECL. */
18029 {
18032 }
18033 else
18034 /* Add it to the list of members in this class. */
18036 }
18037 else
18038 {
18040 identifier,
18047 {
18050 }
18053 else
18055 }
18056 }
18058 /* Look for the final `;'. */
18063 "access declarations are deprecated "
18064 "in favour of using-declarations; "
18068 }
18070 /* Parse an alias-declaration.
18072 alias-declaration:
18073 using identifier attribute-specifier-seq [opt] = type-id */
18075 static tree
18077 {
18079 location_t id_location;
18081 cp_decl_specifier_seq decl_specs;
18085 /* Look for the `using' keyword. */
18086 cp_token *using_token
18108 /* Now we are going to parse the type-id of the declaration. */
18110 /*
18111 [dcl.type]/3 says:
18113 "A type-specifier-seq shall not define a class or enumeration
18114 unless it appears in the type-id of an alias-declaration (7.1.3) that
18115 is not the declaration of a template-declaration."
18117 In other words, if we currently are in an alias template, the
18118 type-id should not define a type.
18120 So let's set parser->type_definition_forbidden_message in that
18121 case; cp_parser_check_type_definition (called by
18122 cp_parser_class_specifier) will then emit an error if a type is
18123 defined in the type-id. */
18125 {
18129 }
18133 /* Restore the error message if need be. */
18139 {
18142 }
18144 /* A typedef-name can also be introduced by an alias-declaration. The
18145 identifier following the using keyword becomes a typedef-name. It has
18146 the same semantics as if it were introduced by the typedef
18147 specifier. In particular, it does not define a new type and it shall
18148 not appear in the type-id. */
18153 {
18156 ds_attribute,
18157 attrs_token);
18158 }
18160 ds_typedef,
18161 using_token);
18163 ds_alias,
18164 using_token);
18173 else
18179 // Attach constraints to the alias declaration.
18181 {
18185 }
18192 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18193 added into the symbol table; otherwise, return the TYPE_DECL. */
18197 {
18201 }
18204 }
18206 /* Parse a using-directive.
18208 using-directive:
18209 using namespace :: [opt] nested-name-specifier [opt]
18210 namespace-name ; */
18212 static void
18214 {
18215 tree namespace_decl;
18216 tree attribs;
18218 /* Look for the `using' keyword. */
18220 /* And the `namespace' keyword. */
18222 /* Look for the optional `::' operator. */
18224 /* And the optional nested-name-specifier. */
18230 /* Get the namespace being used. */
18232 /* And any specified attributes. */
18234 /* Update the symbol table. */
18236 /* Look for the final `;'. */
18238 }
18240 /* Parse an asm-definition.
18242 asm-definition:
18243 asm ( string-literal ) ;
18245 GNU Extension:
18247 asm-definition:
18248 asm volatile [opt] ( string-literal ) ;
18249 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18250 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18251 : asm-operand-list [opt] ) ;
18252 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18253 : asm-operand-list [opt]
18254 : asm-clobber-list [opt] ) ;
18255 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18256 : asm-clobber-list [opt]
18257 : asm-goto-list ) ; */
18259 static void
18261 {
18262 tree string;
18267 tree asm_stmt;
18275 /* Look for the `asm' keyword. */
18280 {
18283 }
18285 /* See if the next token is `volatile'. */
18288 {
18289 /* Remember that we saw the `volatile' keyword. */
18291 /* Consume the token. */
18293 }
18297 {
18298 /* Remember that we saw the `goto' keyword. */
18300 /* Consume the token. */
18302 }
18303 /* Look for the opening `('. */
18306 /* Look for the string. */
18309 {
18313 }
18315 /* If we're allowing GNU extensions, check for the extended assembly
18316 syntax. Unfortunately, the `:' tokens need not be separated by
18317 a space in C, and so, for compatibility, we tolerate that here
18318 too. Doing that means that we have to treat the `::' operator as
18319 two `:' tokens. */
18324 {
18329 /* The extended syntax was used. */
18332 /* Look for outputs. */
18334 {
18335 /* Consume the `:'. */
18337 /* Parse the output-operands. */
18339 CPP_COLON)
18341 CPP_SCOPE)
18343 CPP_CLOSE_PAREN)
18345 {
18349 }
18350 }
18351 /* If the next token is `::', there are no outputs, and the
18352 next token is the beginning of the inputs. */
18354 /* The inputs are coming next. */
18357 /* Look for inputs. */
18360 {
18361 /* Consume the `:' or `::'. */
18363 /* Parse the output-operands. */
18365 CPP_COLON)
18367 CPP_SCOPE)
18369 CPP_CLOSE_PAREN))
18370 {
18374 }
18375 }
18377 /* The clobbers are coming next. */
18380 /* Look for clobbers. */
18383 {
18385 /* Consume the `:' or `::'. */
18387 /* Parse the clobbers. */
18389 CPP_COLON)
18391 CPP_CLOSE_PAREN))
18393 }
18396 /* The labels are coming next. */
18399 /* Look for labels. */
18402 {
18404 /* Consume the `:' or `::'. */
18406 /* Parse the labels. */
18408 }
18412 }
18416 /* Look for the closing `)'. */
18424 {
18425 /* Create the ASM_EXPR. */
18427 {
18430 /* If the extended syntax was not used, mark the ASM_EXPR. */
18432 {
18438 }
18439 }
18440 else
18442 }
18443 }
18445 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18446 type that comes from the decl-specifier-seq. */
18448 static tree
18450 {
18453 {
18465 }
18468 }
18470 /* Declarators [gram.dcl.decl] */
18472 /* Parse an init-declarator.
18474 init-declarator:
18475 declarator initializer [opt]
18477 GNU Extension:
18479 init-declarator:
18480 declarator asm-specification [opt] attributes [opt] initializer [opt]
18482 function-definition:
18483 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18484 function-body
18485 decl-specifier-seq [opt] declarator function-try-block
18487 GNU Extension:
18489 function-definition:
18490 __extension__ function-definition
18492 TM Extension:
18494 function-definition:
18495 decl-specifier-seq [opt] declarator function-transaction-block
18497 The DECL_SPECIFIERS apply to this declarator. Returns a
18498 representation of the entity declared. If MEMBER_P is TRUE, then
18499 this declarator appears in a class scope. The new DECL created by
18500 this declarator is returned.
18502 The CHECKS are access checks that should be performed once we know
18503 what entity is being declared (and, therefore, what classes have
18504 befriended it).
18506 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18507 for a function-definition here as well. If the declarator is a
18508 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18509 be TRUE upon return. By that point, the function-definition will
18510 have been completely parsed.
18512 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18513 is FALSE.
18515 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18516 parsed declaration if it is an uninitialized single declarator not followed
18517 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18518 if present, will not be consumed. If returned, this declarator will be
18519 created with SD_INITIALIZED but will not call cp_finish_decl.
18521 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18522 and there is an initializer, the pointed location_t is set to the
18523 location of the '=' or `(', or '{' in C++11 token introducing the
18524 initializer. */
18526 static tree
18537 {
18541 tree prefix_attributes;
18543 tree asm_specification;
18544 tree initializer;
18546 tree scope;
18548 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18549 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18550 "(...)". */
18561 /* Gather the attributes that were provided with the
18562 decl-specifiers. */
18565 /* Assume that this is not the declarator for a function
18566 definition. */
18570 /* Default arguments are only permitted for function parameters. */
18574 /* Defer access checks while parsing the declarator; we cannot know
18575 what names are accessible until we know what is being
18576 declared. */
18579 /* Parse the declarator. */
18581 declarator
18586 /* Gather up the deferred checks. */
18591 /* If the DECLARATOR was erroneous, there's no need to go
18592 further. */
18596 /* Check that the number of template-parameter-lists is OK. */
18606 /* Figure out what scope the entity declared by the DECLARATOR is
18607 located in. `grokdeclarator' sometimes changes the scope, so
18608 we compute it now. */
18611 /* Perform any lookups in the declared type which were thought to be
18612 dependent, but are not in the scope of the declarator. */
18613 decl_specifiers->type
18616 /* If we're allowing GNU extensions, look for an
18617 asm-specification. */
18619 {
18620 /* Look for an asm-specification. */
18623 }
18624 else
18627 /* Look for attributes. */
18631 /* Peek at the next token. */
18637 {
18638 /* Check to see if the token indicates the start of a
18639 function-definition. */
18641 {
18643 {
18644 /* If a function-definition should not appear here, issue an
18645 error message. */
18649 }
18651 location_t func_brace_location
18654 /* Neither attributes nor an asm-specification are allowed
18655 on a function-definition. */
18658 "an asm-specification is not allowed "
18662 "attributes are not allowed "
18664 /* This is a function-definition. */
18667 /* Parse the function definition. */
18670 decl_specifiers,
18671 declarator,
18672 prefix_attributes);
18673 else
18674 decl =
18675 (cp_parser_function_definition_from_specifiers_and_declarator
18679 {
18680 /* This is where the prologue starts... */
18683 }
18686 }
18687 }
18689 {
18690 /* A non-template declaration involving a function parameter list
18691 containing an implicit template parameter will be made into a
18692 template. If the resulting declaration is not going to be an
18693 actual function then finish the template scope here to prevent it.
18694 An error message will be issued once we have a decl to talk about.
18696 FIXME probably we should do type deduction rather than create an
18697 implicit template, but the standard currently doesn't allow it. */
18700 }
18702 /* [dcl.dcl]
18704 Only in function declarations for constructors, destructors, and
18705 type conversions can the decl-specifier-seq be omitted.
18707 We explicitly postpone this check past the point where we handle
18708 function-definitions because we tolerate function-definitions
18709 that are missing their return types in some modes. */
18711 {
18715 }
18717 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18721 {
18732 {
18738 }
18739 }
18740 else
18741 {
18742 /* If the init-declarator isn't initialized and isn't followed by a
18743 `,' or `;', it's not a valid init-declarator. */
18746 {
18749 else
18750 {
18754 }
18755 }
18758 }
18760 /* Because start_decl has side-effects, we should only call it if we
18761 know we're going ahead. By this point, we know that we cannot
18762 possibly be looking at any other construct. */
18765 /* Enter the newly declared entry in the symbol table. If we're
18766 processing a declaration in a class-specifier, we wait until
18767 after processing the initializer. */
18769 {
18777 /* Adjust location of decl if declarator->id_loc is more appropriate:
18778 set, and decl wasn't merged with another decl, in which case its
18779 location would be different from input_location, and more accurate. */
18784 }
18786 /* Enter the SCOPE. That way unqualified names appearing in the
18787 initializer will be looked up in SCOPE. */
18790 /* Perform deferred access control checks, now that we know in which
18791 SCOPE the declared entity resides. */
18793 {
18796 /* If the entity being declared is a function, pretend that we
18797 are in its scope. If it is a `friend', it may have access to
18798 things that would not otherwise be accessible. */
18800 {
18803 }
18805 /* Perform access checks for template parameters. */
18808 /* Perform the access control checks for the declarator and the
18809 decl-specifiers. */
18812 /* Restore the saved value. */
18815 }
18817 /* Parse the initializer. */
18822 {
18824 {
18827 else
18828 {
18829 /* If the declaration was erroneous, we don't really
18830 know what the user intended, so just silently
18831 consume the initializer. */
18838 }
18839 }
18840 else
18841 {
18842 /* We want to record the extra mangling scope for in-class
18843 initializers of class members and initializers of static data
18844 member templates. The former involves deferring
18845 parsing of the initializer until end of class as with default
18846 arguments. So right here we only handle the latter. */
18856 }
18857 }
18859 /* The old parser allows attributes to appear after a parenthesized
18860 initializer. Mark Mitchell proposed removing this functionality
18861 on the GCC mailing lists on 2002-08-13. This parser accepts the
18862 attributes -- but ignores them. */
18869 /* And now complain about a non-function implicit template. */
18874 /* For an in-class declaration, use `grokfield' to create the
18875 declaration. */
18877 {
18879 {
18882 }
18891 }
18893 /* Finish processing the declaration. But, skip member
18894 declarations. */
18896 {
18899 asm_specification,
18900 /* If the initializer is in parentheses, then this is
18901 a direct-initialization, which means that an
18902 `explicit' constructor is OK. Otherwise, an
18903 `explicit' constructor cannot be used. */
18906 }
18909 /* Core issue #226 (C++0x only): A default template-argument
18910 shall not be specified in a friend class template
18911 declaration. */
18920 {
18923 else
18925 }
18932 }
18934 /* Parse a declarator.
18936 declarator:
18937 direct-declarator
18938 ptr-operator declarator
18940 abstract-declarator:
18941 ptr-operator abstract-declarator [opt]
18942 direct-abstract-declarator
18944 GNU Extensions:
18946 declarator:
18947 attributes [opt] direct-declarator
18948 attributes [opt] ptr-operator declarator
18950 abstract-declarator:
18951 attributes [opt] ptr-operator abstract-declarator [opt]
18952 attributes [opt] direct-abstract-declarator
18954 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18955 detect constructor, destructor or conversion operators. It is set
18956 to -1 if the declarator is a name, and +1 if it is a
18957 function. Otherwise it is set to zero. Usually you just want to
18958 test for >0, but internally the negative value is used.
18960 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18961 a decl-specifier-seq unless it declares a constructor, destructor,
18962 or conversion. It might seem that we could check this condition in
18963 semantic analysis, rather than parsing, but that makes it difficult
18964 to handle something like `f()'. We want to notice that there are
18965 no decl-specifiers, and therefore realize that this is an
18966 expression, not a declaration.)
18968 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18969 the declarator is a direct-declarator of the form "(...)".
18971 MEMBER_P is true iff this declarator is a member-declarator.
18973 FRIEND_P is true iff this declarator is a friend. */
18977 cp_parser_declarator_kind dcl_kind,
18981 {
18984 cp_cv_quals cv_quals;
18985 tree class_type;
18988 /* Assume this is not a constructor, destructor, or type-conversion
18989 operator. */
18996 /* Check for the ptr-operator production. */
18998 /* Parse the ptr-operator. */
19004 /* If that worked, then we have a ptr-operator. */
19006 {
19007 /* If a ptr-operator was found, then this declarator was not
19008 parenthesized. */
19011 /* The dependent declarator is optional if we are parsing an
19012 abstract-declarator. */
19016 /* Parse the dependent declarator. */
19021 friend_p);
19023 /* If we are parsing an abstract-declarator, we must handle the
19024 case where the dependent declarator is absent. */
19029 declarator = cp_parser_make_indirect_declarator
19031 }
19032 /* Everything else is a direct-declarator. */
19033 else
19034 {
19037 CPP_OPEN_PAREN);
19039 ctor_dtor_or_conv_p,
19041 }
19046 }
19048 /* Parse a direct-declarator or direct-abstract-declarator.
19050 direct-declarator:
19051 declarator-id
19052 direct-declarator ( parameter-declaration-clause )
19053 cv-qualifier-seq [opt]
19054 ref-qualifier [opt]
19055 exception-specification [opt]
19056 direct-declarator [ constant-expression [opt] ]
19057 ( declarator )
19059 direct-abstract-declarator:
19060 direct-abstract-declarator [opt]
19061 ( parameter-declaration-clause )
19062 cv-qualifier-seq [opt]
19063 ref-qualifier [opt]
19064 exception-specification [opt]
19065 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19066 ( abstract-declarator )
19068 Returns a representation of the declarator. DCL_KIND is
19069 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19070 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19071 we are parsing a direct-declarator. It is
19072 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19073 of ambiguity we prefer an abstract declarator, as per
19074 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19075 as for cp_parser_declarator. */
19079 cp_parser_declarator_kind dcl_kind,
19082 {
19092 {
19093 /* Peek at the next token. */
19096 {
19097 /* This is either a parameter-declaration-clause, or a
19098 parenthesized declarator. When we know we are parsing a
19099 named declarator, it must be a parenthesized declarator
19100 if FIRST is true. For instance, `(int)' is a
19101 parameter-declaration-clause, with an omitted
19102 direct-abstract-declarator. But `((*))', is a
19103 parenthesized abstract declarator. Finally, when T is a
19104 template parameter `(T)' is a
19105 parameter-declaration-clause, and not a parenthesized
19106 named declarator.
19108 We first try and parse a parameter-declaration-clause,
19109 and then try a nested declarator (if FIRST is true).
19111 It is not an error for it not to be a
19112 parameter-declaration-clause, even when FIRST is
19113 false. Consider,
19115 int i (int);
19116 int i (3);
19118 The first is the declaration of a function while the
19119 second is the definition of a variable, including its
19120 initializer.
19122 Having seen only the parenthesis, we cannot know which of
19123 these two alternatives should be selected. Even more
19124 complex are examples like:
19126 int i (int (a));
19127 int i (int (3));
19129 The former is a function-declaration; the latter is a
19130 variable initialization.
19132 Thus again, we try a parameter-declaration-clause, and if
19133 that fails, we back out and return. */
19136 {
19137 tree params;
19140 /* In a member-declarator, the only valid interpretation
19141 of a parenthesis is the start of a
19142 parameter-declaration-clause. (It is invalid to
19143 initialize a static data member with a parenthesized
19144 initializer; only the "=" form of initialization is
19145 permitted.) */
19149 /* Consume the `('. */
19152 {
19153 /* If this is going to be an abstract declarator, we're
19154 in a declarator and we can't have default args. */
19157 }
19161 /* Parse the parameter-declaration-clause. */
19164 /* Consume the `)'. */
19167 /* If all went well, parse the cv-qualifier-seq,
19168 ref-qualifier and the exception-specification. */
19170 {
19171 cp_cv_quals cv_quals;
19172 cp_virt_specifiers virt_specifiers;
19173 cp_ref_qualifier ref_qual;
19174 tree exception_specification;
19175 tree late_return;
19176 tree attrs;
19186 /* Parse the cv-qualifier-seq. */
19188 /* Parse the ref-qualifier. */
19190 /* Parse the tx-qualifier. */
19192 /* And the exception-specification. */
19193 exception_specification
19198 /* In here, we handle cases where attribute is used after
19199 the function declaration. For example:
19200 void func (int x) __attribute__((vector(..))); */
19204 {
19208 CPP_SEMICOLON)
19210 CPP_OPEN_BRACE))
19213 ;
19214 else
19216 }
19218 late_return = (cp_parser_late_return_type_opt
19222 /* Parse the virt-specifier-seq. */
19225 /* Create the function-declarator. */
19227 params,
19228 cv_quals,
19229 virt_specifiers,
19230 ref_qual,
19231 tx_qual,
19232 exception_specification,
19233 late_return,
19234 requires_clause);
19237 /* Any subsequent parameter lists are to do with
19238 return type, so are not those of the declared
19239 function. */
19241 }
19243 /* Remove the function parms from scope. */
19247 /* Repeat the main loop. */
19249 }
19251 /* If this is the first, we can try a parenthesized
19252 declarator. */
19254 {
19260 /* Consume the `('. */
19262 /* Parse the nested declarator. */
19265 declarator
19271 /* Expect a `)'. */
19278 }
19279 /* Otherwise, we must be done. */
19280 else
19282 }
19286 {
19287 /* Parse an array-declarator. */
19296 /* Consume the `['. */
19298 /* Peek at the next token. */
19300 /* If the next token is `]', then there is no
19301 constant-expression. */
19303 {
19305 bounds
19315 {
19316 /* Normally, the array bound must be an integral constant
19317 expression. However, as an extension, we allow VLAs
19318 in function scopes as long as they aren't part of a
19319 parameter declaration. */
19323 }
19326 {
19327 /* Remember this wasn't a constant-expression. */
19330 }
19331 }
19332 else
19334 /* Look for the closing `]'. */
19336 {
19339 }
19344 }
19346 {
19347 {
19348 tree qualifying_scope;
19349 tree unqualified_name;
19350 tree attrs;
19351 special_function_kind sfk;
19356 /* Parse a declarator-id */
19359 {
19362 /* If we see an ellipsis, we should be looking at a
19363 parameter pack. */
19365 {
19366 /* Consume the `...' */
19370 }
19371 }
19374 unqualified_name
19378 {
19382 {
19383 /* Check whether an error occurred. */
19386 /* We already consumed the ellipsis to mark a
19387 parameter pack, but we have no way to report it,
19388 so abort the tentative parse. We will be exiting
19389 immediately anyway. */
19391 }
19392 else
19398 && (qualifying_scope
19400 {
19403 }
19404 }
19409 {
19414 }
19420 {
19421 /* In the declaration of a member of a template class
19422 outside of the class itself, the SCOPE will sometimes
19423 be a TYPENAME_TYPE. For example, given:
19425 template <typename T>
19426 int S<T>::R::i = 3;
19428 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19429 this context, we must resolve S<T>::R to an ordinary
19430 type, rather than a typename type.
19432 The reason we normally avoid resolving TYPENAME_TYPEs
19433 is that a specialization of `S' might render
19434 `S<T>::R' not a type. However, if `S' is
19435 specialized, then this `i' will not be used, so there
19436 is no harm in resolving the types here. */
19437 tree type;
19439 /* Resolve the TYPENAME_TYPE. */
19442 /* If that failed, the declarator is invalid. */
19444 {
19447 "cannot define member of dependent typedef "
19449 else
19454 }
19456 }
19461 {
19462 tree class_type;
19467 else
19471 {
19474 {
19477 {
19481 "use %<%T::%D%> instead of %<%T::%D%> to "
19483 class_type,
19488 }
19489 else
19491 }
19492 else
19493 {
19494 /* We do not attempt to print the declarator
19495 here because we do not have enough
19496 information about its original syntactic
19497 form. */
19501 }
19502 }
19505 {
19511 for an unnamed type, even if the type
19512 got a name for linkage purposes. */
19514 /* Handle correctly (c++/19200):
19516 struct S {
19517 struct T{};
19518 friend void S(T);
19519 };
19521 and also:
19523 namespace N {
19524 void S();
19525 }
19527 struct S {
19528 friend void N::S();
19529 }; */
19530 && !(friend_p
19533 class_type))
19534 {
19537 }
19545 }
19546 }
19548 unqualified_name,
19549 sfk);
19556 }
19558 handle_declarator:;
19561 {
19562 /* Any names that appear after the declarator-id for a
19563 member are looked up in the containing scope. */
19565 {
19566 /* But declarations with qualified-ids can't appear in a
19567 function. */
19571 }
19573 }
19577 /* Default args are only allowed on function
19578 declarations. */
19580 else
19584 }
19585 /* We're done. */
19586 else
19588 }
19590 /* For an abstract declarator, we might wind up with nothing at this
19591 point. That's an error; the declarator is not optional. */
19595 /* If we entered a scope, we must exit it now. */
19603 }
19605 /* Parse a ptr-operator.
19607 ptr-operator:
19608 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19609 * cv-qualifier-seq [opt]
19610 &
19611 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19612 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19614 GNU Extension:
19616 ptr-operator:
19617 & cv-qualifier-seq [opt]
19619 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19620 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19621 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19622 filled in with the TYPE containing the member. *CV_QUALS is
19623 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19624 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19625 Note that the tree codes returned by this function have nothing
19626 to do with the types of trees that will be eventually be created
19627 to represent the pointer or reference type being parsed. They are
19628 just constants with suggestive names. */
19629 static enum tree_code
19634 {
19639 /* Assume that it's not a pointer-to-member. */
19641 /* And that there are no cv-qualifiers. */
19644 /* Peek at the next token. */
19647 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19657 {
19658 /* Consume the `*', `&' or `&&'. */
19661 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19662 `&', if we are allowing GNU extensions. (The only qualifier
19663 that can legally appear after `&' is `restrict', but that is
19664 enforced during semantic analysis. */
19672 }
19673 else
19674 {
19675 /* Try the pointer-to-member case. */
19677 /* Look for the optional `::' operator. */
19680 /* Look for the nested-name specifier. */
19687 /* If we found it, and the next token is a `*', then we are
19688 indeed looking at a pointer-to-member operator. */
19691 {
19692 /* Indicate that the `*' operator was used. */
19700 else
19701 {
19702 /* The type of which the member is a member is given by the
19703 current SCOPE. */
19705 /* The next name will not be qualified. */
19709 /* Look for optional c++11 attributes. */
19713 /* Look for the optional cv-qualifier-seq. */
19715 }
19716 }
19717 /* If that didn't work we don't have a ptr-operator. */
19720 }
19723 }
19725 /* Parse an (optional) cv-qualifier-seq.
19727 cv-qualifier-seq:
19728 cv-qualifier cv-qualifier-seq [opt]
19730 cv-qualifier:
19731 const
19732 volatile
19734 GNU Extension:
19736 cv-qualifier:
19737 __restrict__
19739 Returns a bitmask representing the cv-qualifiers. */
19741 static cp_cv_quals
19743 {
19747 {
19749 cp_cv_quals cv_qualifier;
19751 /* Peek at the next token. */
19753 /* See if it's a cv-qualifier. */
19755 {
19771 }
19777 {
19780 }
19781 else
19782 {
19785 }
19786 }
19789 }
19791 /* Parse an (optional) ref-qualifier
19793 ref-qualifier:
19794 &
19795 &&
19797 Returns cp_ref_qualifier representing ref-qualifier. */
19799 static cp_ref_qualifier
19801 {
19804 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19809 {
19814 {
19826 }
19831 {
19834 }
19835 else
19836 {
19839 }
19840 }
19843 }
19845 /* Parse an optional tx-qualifier.
19847 tx-qualifier:
19848 transaction_safe
19849 transaction_safe_dynamic */
19851 static tree
19853 {
19856 {
19861 {
19865 {
19868 {
19871 }
19872 else
19874 }
19875 }
19876 }
19878 }
19880 /* Parse an (optional) virt-specifier-seq.
19882 virt-specifier-seq:
19883 virt-specifier virt-specifier-seq [opt]
19885 virt-specifier:
19886 override
19887 final
19889 Returns a bitmask representing the virt-specifiers. */
19891 static cp_virt_specifiers
19893 {
19897 {
19899 cp_virt_specifiers virt_specifier;
19901 /* Peek at the next token. */
19903 /* See if it's a virt-specifier-qualifier. */
19907 {
19910 }
19912 {
19915 }
19917 {
19919 }
19920 else
19924 {
19927 }
19928 else
19929 {
19932 }
19933 }
19935 }
19937 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19938 is in scope even though it isn't real. */
19940 void
19942 {
19943 tree this_parm;
19946 {
19947 /* We don't clear this between NSDMIs. Is it already what we want? */
19952 }
19955 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19957 current_class_ref
19960 }
19962 /* Return true iff our current scope is a non-static data member
19963 initializer. */
19965 bool
19967 {
19968 /* We recognize NSDMI context by the context-less 'this' pointer set up
19969 by the function above. */
19975 }
19977 /* Parse a late-specified return type, if any. This is not a separate
19978 non-terminal, but part of a function declarator, which looks like
19980 -> trailing-type-specifier-seq abstract-declarator(opt)
19982 Returns the type indicated by the type-id.
19984 In addition to this, parse any queued up #pragma omp declare simd
19985 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
19986 #pragma acc routine clauses.
19988 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19989 function. */
19991 static tree
19994 {
19998 && declarator
20005 && declarator
20008 /* Peek at the next token. */
20010 /* A late-specified return type is indicated by an initial '->'. */
20021 {
20022 /* DR 1207: 'this' is in scope in the trailing return type. */
20024 }
20027 {
20028 /* Consume the ->. */
20032 }
20034 /* Function declarations may be followed by a trailing
20035 requires-clause. */
20039 declarator->attributes
20043 declarator->attributes
20047 declarator->attributes
20052 {
20055 }
20058 }
20060 /* Parse a declarator-id.
20062 declarator-id:
20063 id-expression
20064 :: [opt] nested-name-specifier [opt] type-name
20066 In the `id-expression' case, the value returned is as for
20067 cp_parser_id_expression if the id-expression was an unqualified-id.
20068 If the id-expression was a qualified-id, then a SCOPE_REF is
20069 returned. The first operand is the scope (either a NAMESPACE_DECL
20070 or TREE_TYPE), but the second is still just a representation of an
20071 unqualified-id. */
20073 static tree
20075 {
20076 tree id;
20077 /* The expression must be an id-expression. Assume that qualified
20078 names are the names of types so that:
20080 template <class T>
20081 int S<T>::R::i = 3;
20083 will work; we must treat `S<T>::R' as the name of a type.
20084 Similarly, assume that qualified names are templates, where
20085 required, so that:
20087 template <class T>
20088 int S<T>::R<T>::i = 3;
20090 will work, too. */
20096 optional_p);
20100 }
20102 /* Parse a type-id.
20104 type-id:
20105 type-specifier-seq abstract-declarator [opt]
20107 Returns the TYPE specified. */
20109 static tree
20112 {
20113 cp_decl_specifier_seq type_specifier_seq;
20116 /* Parse the type-specifier-seq. */
20118 is_trailing_return,
20123 /* There might or might not be an abstract declarator. */
20125 /* Look for the declarator. */
20126 abstract_declarator
20131 /* Check to see if there really was a declarator. */
20136 /* The concepts TS allows 'auto' as a type-id. */
20138 /* None of the valid uses of 'auto' in C++14 involve the type-id
20139 nonterminal, but it is valid in a trailing-return-type. */
20142 {
20143 /* A type-id with type 'auto' is only ok if the abstract declarator
20144 is a function declarator with a late-specified return type.
20146 A type-id with 'auto' is also valid in a trailing-return-type
20147 in a compound-requirement. */
20154 else
20155 {
20158 }
20159 }
20162 is_template_arg);
20163 }
20165 static tree
20167 {
20169 }
20171 static tree
20173 {
20174 tree r;
20176 parser->type_definition_forbidden_message
20181 {
20184 }
20186 }
20188 static tree
20190 {
20192 }
20194 /* Parse a type-specifier-seq.
20196 type-specifier-seq:
20197 type-specifier type-specifier-seq [opt]
20199 GNU extension:
20201 type-specifier-seq:
20202 attributes type-specifier-seq [opt]
20204 If IS_DECLARATION is true, we are at the start of a "condition" or
20205 exception-declaration, so we might be followed by a declarator-id.
20207 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20208 i.e. we've just seen "->".
20210 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20212 static void
20217 {
20222 /* Clear the TYPE_SPECIFIER_SEQ. */
20225 /* In the context of a trailing return type, enum E { } is an
20226 elaborated-type-specifier followed by a function-body, not an
20227 enum-specifier. */
20231 /* Parse the type-specifiers and attributes. */
20233 {
20234 tree type_specifier;
20237 /* Check for attributes first. */
20239 {
20244 }
20246 /* record the token of the beginning of the type specifier seq,
20247 for error reporting purposes*/
20251 /* Look for the type-specifier. */
20253 flags,
20254 type_specifier_seq,
20256 NULL,
20259 {
20260 /* If the first type-specifier could not be found, this is not a
20261 type-specifier-seq at all. */
20263 {
20264 /* Set in_declarator_p to avoid skipping to the semicolon. */
20276 }
20277 /* If subsequent type-specifiers could not be found, the
20278 type-specifier-seq is complete. */
20280 }
20283 /* The standard says that a condition can be:
20285 type-specifier-seq declarator = assignment-expression
20287 However, given:
20289 struct S {};
20290 if (int S = ...)
20292 we should treat the "S" as a declarator, not as a
20293 type-specifier. The standard doesn't say that explicitly for
20294 type-specifier-seq, but it does say that for
20295 decl-specifier-seq in an ordinary declaration. Perhaps it
20296 would be clearer just to allow a decl-specifier-seq here, and
20297 then add a semantic restriction that if any decl-specifiers
20298 that are not type-specifiers appear, the program is invalid. */
20301 }
20302 }
20304 /* Return whether the function currently being declared has an associated
20305 template parameter list. */
20307 static bool
20309 {
20322 }
20324 /* Parse a parameter-declaration-clause.
20326 parameter-declaration-clause:
20327 parameter-declaration-list [opt] ... [opt]
20328 parameter-declaration-list , ...
20330 Returns a representation for the parameter declarations. A return
20331 value of NULL indicates a parameter-declaration-clause consisting
20332 only of an ellipsis. */
20334 static tree
20336 {
20337 tree parameters;
20346 parser->auto_is_implicit_function_template_parm_p
20348 }
20354 && !processing_template_parmlist
20360 /* Peek at the next token. */
20362 /* Check for trivial parameter-declaration-clauses. */
20364 {
20365 /* Consume the `...' token. */
20368 }
20370 /* There are no parameters. */
20371 {
20372 #ifndef NO_IMPLICIT_EXTERN_C
20377 else
20378 #endif
20380 }
20381 /* Check for `(void)', too, which is a special case. */
20385 {
20386 /* Consume the `void' token. */
20388 /* There are no parameters. */
20390 }
20392 /* Parse the parameter-declaration-list. */
20394 /* If a parse error occurred while parsing the
20395 parameter-declaration-list, then the entire
20396 parameter-declaration-clause is erroneous. */
20400 /* Peek at the next token. */
20402 /* If it's a `,', the clause should terminate with an ellipsis. */
20404 {
20405 /* Consume the `,'. */
20407 /* Expect an ellipsis. */
20408 ellipsis_p
20410 }
20411 /* It might also be `...' if the optional trailing `,' was
20412 omitted. */
20414 {
20415 /* Consume the `...' token. */
20417 /* And remember that we saw it. */
20419 }
20420 else
20423 /* Finish the parameter list. */
20428 }
20430 /* Parse a parameter-declaration-list.
20432 parameter-declaration-list:
20433 parameter-declaration
20434 parameter-declaration-list , parameter-declaration
20436 Returns a representation of the parameter-declaration-list, as for
20437 cp_parser_parameter_declaration_clause. However, the
20438 `void_list_node' is never appended to the list. Upon return,
20439 *IS_ERROR will be true iff an error occurred. */
20441 static tree
20443 {
20449 /* Assume all will go well. */
20451 /* The special considerations that apply to a function within an
20452 unbraced linkage specifications do not apply to the parameters
20453 to the function. */
20454 saved_in_unbraced_linkage_specification_p
20458 /* Look for more parameters. */
20460 {
20468 /* Parse the parameter. */
20469 parameter
20474 /* We don't know yet if the enclosing context is deprecated, so wait
20475 and warn in grokparms if appropriate. */
20479 {
20480 /* If a function parameter pack was specified and an implicit template
20481 parameter was introduced during cp_parser_parameter_declaration,
20482 change any implicit parameters introduced into packs. */
20486 {
20494 }
20498 PARM,
20501 }
20505 /* If a parse error occurred parsing the parameter declaration,
20506 then the entire parameter-declaration-list is erroneous. */
20508 {
20512 }
20522 {
20526 }
20528 /* Add the new parameter to the list. */
20532 /* Peek at the next token. */
20535 /* These are for Objective-C++ */
20538 /* The parameter-declaration-list is complete. */
20541 {
20544 /* Peek at the next token. */
20546 /* If it's an ellipsis, then the list is complete. */
20549 /* Otherwise, there must be more parameters. Consume the
20550 `,'. */
20552 /* When parsing something like:
20554 int i(float f, double d)
20556 we can tell after seeing the declaration for "f" that we
20557 are not looking at an initialization of a variable "i",
20558 but rather at the declaration of a function "i".
20560 Due to the fact that the parsing of template arguments
20561 (as specified to a template-id) requires backtracking we
20562 cannot use this technique when inside a template argument
20563 list. */
20567 /* However, a parameter-declaration of the form
20568 "float(f)" (which is a valid declaration of a
20569 parameter "f") can also be interpreted as an
20570 expression (the conversion of "f" to "float"). */
20573 }
20574 else
20575 {
20583 }
20584 }
20586 parser->in_unbraced_linkage_specification_p
20589 /* Reset implicit_template_scope if we are about to leave the function
20590 parameter list that introduced it. Note that for out-of-line member
20591 definitions, there will be one or more class scopes before we get to
20592 the template parameter scope. */
20596 {
20600 {
20603 }
20604 }
20607 }
20609 /* Parse a parameter declaration.
20611 parameter-declaration:
20612 decl-specifier-seq ... [opt] declarator
20613 decl-specifier-seq declarator = assignment-expression
20614 decl-specifier-seq ... [opt] abstract-declarator [opt]
20615 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20617 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20618 declares a template parameter. (In that case, a non-nested `>'
20619 token encountered during the parsing of the assignment-expression
20620 is not interpreted as a greater-than operator.)
20622 Returns a representation of the parameter, or NULL if an error
20623 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20624 true iff the declarator is of the form "(p)". */
20630 {
20632 cp_decl_specifier_seq decl_specifiers;
20634 tree default_argument;
20639 /* In a template parameter, `>' is not an operator.
20641 [temp.param]
20643 When parsing a default template-argument for a non-type
20644 template-parameter, the first non-nested `>' is taken as the end
20645 of the template parameter-list rather than a greater-than
20646 operator. */
20648 /* Type definitions may not appear in parameter types. */
20650 parser->type_definition_forbidden_message
20653 /* Parse the declaration-specifiers. */
20655 CP_PARSER_FLAGS_NONE,
20659 /* Complain about missing 'typename' or other invalid type names. */
20664 /* If an error occurred, there's no reason to attempt to parse the
20665 rest of the declaration. */
20667 {
20670 }
20672 /* Peek at the next token. */
20675 /* If the next token is a `)', `,', `=', `>', or `...', then there
20676 is no declarator. However, when variadic templates are enabled,
20677 there may be a declarator following `...'. */
20682 {
20686 }
20687 /* Otherwise, there should be a declarator. */
20688 else
20689 {
20693 /* After seeing a decl-specifier-seq, if the next token is not a
20694 "(", there is no possibility that the code is a valid
20695 expression. Therefore, if parsing tentatively, we commit at
20696 this point. */
20698 /* In an expression context, having seen:
20700 (int((char ...
20702 we cannot be sure whether we are looking at a
20703 function-type (taking a "char" as a parameter) or a cast
20704 of some object of type "char" to "int". */
20710 /* Parse the declarator. */
20713 CP_PARSER_DECLARATOR_EITHER,
20715 parenthesized_p,
20719 /* After the declarator, allow more attributes. */
20720 decl_specifiers.attributes
20724 /* If the declarator is a template parameter pack, remember that and
20725 clear the flag in the declarator itself so we don't get errors
20726 from grokdeclarator. */
20728 {
20731 }
20732 }
20734 /* If the next token is an ellipsis, and we have not seen a declarator
20735 name, and if either the type of the declarator contains parameter
20736 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20737 for, eg, abbreviated integral type names), then we actually have a
20738 parameter pack expansion expression. Otherwise, leave the ellipsis
20739 for a C-style variadic function. */
20742 {
20753 {
20754 /* Consume the `...'. */
20758 /* Build a pack expansion type */
20763 else
20765 }
20766 }
20768 /* The restriction on defining new types applies only to the type
20769 of the parameter, not to the default argument. */
20772 /* If the next token is `=', then process a default argument. */
20774 {
20777 /* If we are defining a class, then the tokens that make up the
20778 default argument must be saved and processed later. */
20784 // A constrained-type-specifier may declare a type template-parameter.
20786 default_argument
20789 // A constrained-type-specifier may declare a template-template-parameter.
20791 default_argument
20794 /* Outside of a class definition, we can just parse the
20795 assignment-expression. */
20796 else
20797 default_argument
20801 {
20803 "default arguments are only "
20805 }
20807 || template_parameter_pack_p
20810 {
20811 /* Find the name of the parameter pack. */
20818 template_parm_p
20824 else
20826 template_parm_p
20833 }
20834 }
20835 else
20839 declarator,
20840 default_argument,
20841 template_parameter_pack_p);
20842 }
20844 /* Parse a default argument and return it.
20846 TEMPLATE_PARM_P is true if this is a default argument for a
20847 non-type template parameter. */
20848 static tree
20850 {
20856 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20857 set correctly. */
20860 /* Local variable names (and the `this' keyword) may not
20861 appear in a default argument. */
20864 /* Parse the assignment-expression. */
20869 /* The "this" pointer is not valid in a default argument. */
20871 {
20876 }
20877 default_argument
20879 /* Restore the "this" pointer. */
20881 {
20884 }
20893 }
20895 /* Parse a function-body.
20897 function-body:
20898 compound_statement */
20900 static void
20902 {
20906 }
20908 /* Parse a ctor-initializer-opt followed by a function-body. Return
20909 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20910 is true we are parsing a function-try-block. */
20912 static bool
20915 {
20923 /* Begin the function body. */
20925 /* Parse the optional ctor-initializer. */
20928 /* If we're parsing a constexpr constructor definition, we need
20929 to check that the constructor body is indeed empty. However,
20930 before we get to cp_parser_function_body lot of junk has been
20931 generated, so we can't just check that we have an empty block.
20932 Rather we take a snapshot of the outermost block, and check whether
20933 cp_parser_function_body changed its state. */
20935 {
20939 }
20940 /* Parse the function-body. */
20944 /* Finish the function body. */
20948 }
20950 /* Parse an initializer.
20952 initializer:
20953 = initializer-clause
20954 ( expression-list )
20956 Returns an expression representing the initializer. If no
20957 initializer is present, NULL_TREE is returned.
20959 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20960 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20961 set to TRUE if there is no initializer present. If there is an
20962 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20963 is set to true; otherwise it is set to false. */
20965 static tree
20968 {
20970 tree init;
20972 /* Peek at the next token. */
20975 /* Let our caller know whether or not this initializer was
20976 parenthesized. */
20978 /* Assume that the initializer is constant. */
20982 {
20983 /* Consume the `='. */
20985 /* Parse the initializer-clause. */
20987 }
20989 {
20994 non_constant_p);
20999 }
21001 {
21006 }
21007 else
21008 {
21009 /* Anything else is an error. */
21012 }
21018 }
21020 /* Parse an initializer-clause.
21022 initializer-clause:
21023 assignment-expression
21024 braced-init-list
21026 Returns an expression representing the initializer.
21028 If the `assignment-expression' production is used the value
21029 returned is simply a representation for the expression.
21031 Otherwise, calls cp_parser_braced_list. */
21033 static cp_expr
21035 {
21036 cp_expr initializer;
21038 /* Assume the expression is constant. */
21041 /* If it is not a `{', then we are looking at an
21042 assignment-expression. */
21044 {
21045 initializer
21048 non_constant_p);
21049 }
21050 else
21054 }
21056 /* Parse a brace-enclosed initializer list.
21058 braced-init-list:
21059 { initializer-list , [opt] }
21060 { }
21062 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21063 the elements of the initializer-list (or NULL, if the last
21064 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21065 NULL_TREE. There is no way to detect whether or not the optional
21066 trailing `,' was provided. NON_CONSTANT_P is as for
21067 cp_parser_initializer. */
21069 static cp_expr
21071 {
21072 tree initializer;
21075 /* Consume the `{' token. */
21077 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21079 /* If it's not a `}', then there is a non-trivial initializer. */
21081 {
21082 /* Parse the initializer list. */
21085 /* A trailing `,' token is allowed. */
21088 }
21089 else
21091 /* Now, there should be a trailing `}'. */
21097 /* Build a location of the form:
21098 { ... }
21099 ^~~~~~~
21100 with caret==start at the open brace, finish at the close brace. */
21104 }
21106 /* Consume tokens up to, and including, the next non-nested closing `]'.
21107 Returns true iff we found a closing `]'. */
21109 static bool
21111 {
21115 {
21119 {
21122 /* If we've run out of tokens, then there is no closing `]'. */
21131 {
21134 }
21139 }
21141 /* Consume the token. */
21143 }
21144 }
21146 /* Return true if we are looking at an array-designator, false otherwise. */
21148 static bool
21150 {
21151 /* Consume the `['. */
21156 /* Skip tokens until the next token is a closing square bracket.
21157 If we find the closing `]', and the next token is a `=', then
21158 we are looking at an array designator. */
21159 bool array_designator_p
21163 /* Roll back the tokens we skipped. */
21167 }
21169 /* Parse an initializer-list.
21171 initializer-list:
21172 initializer-clause ... [opt]
21173 initializer-list , initializer-clause ... [opt]
21175 GNU Extension:
21177 initializer-list:
21178 designation initializer-clause ...[opt]
21179 initializer-list , designation initializer-clause ...[opt]
21181 designation:
21182 . identifier =
21183 identifier :
21184 [ constant-expression ] =
21186 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21187 for the initializer. If the INDEX of the elt is non-NULL, it is the
21188 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21189 as for cp_parser_initializer. */
21193 {
21196 /* Assume all of the expressions are constant. */
21199 /* Parse the rest of the list. */
21201 {
21203 tree designator;
21204 tree initializer;
21207 /* If the next token is an identifier and the following one is a
21208 colon, we are looking at the GNU designated-initializer
21209 syntax. */
21213 {
21214 /* Warn the user that they are using an extension. */
21217 /* Consume the identifier. */
21219 /* Consume the `:'. */
21221 }
21222 /* Also handle the C99 syntax, '. id ='. */
21227 {
21228 /* Warn the user that they are using an extension. */
21231 /* Consume the `.'. */
21233 /* Consume the identifier. */
21235 /* Consume the `='. */
21237 }
21238 /* Also handle C99 array designators, '[ const ] ='. */
21242 {
21243 /* In C++11, [ could start a lambda-introducer. */
21249 {
21252 }
21253 else
21254 {
21259 }
21265 }
21266 else
21269 /* Parse the initializer. */
21272 /* If any clause is non-constant, so is the entire initializer. */
21276 /* If we have an ellipsis, this is an initializer pack
21277 expansion. */
21279 {
21280 /* Consume the `...'. */
21283 /* Turn the initializer into an initializer expansion. */
21285 }
21287 /* Add it to the vector. */
21290 /* If the next token is not a comma, we have reached the end of
21291 the list. */
21295 /* Peek at the next token. */
21297 /* If the next token is a `}', then we're still done. An
21298 initializer-clause can have a trailing `,' after the
21299 initializer-list and before the closing `}'. */
21303 /* Consume the `,' token. */
21305 }
21308 }
21310 /* Classes [gram.class] */
21312 /* Parse a class-name.
21314 class-name:
21315 identifier
21316 template-id
21318 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21319 to indicate that names looked up in dependent types should be
21320 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21321 keyword has been used to indicate that the name that appears next
21322 is a template. TAG_TYPE indicates the explicit tag given before
21323 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21324 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21325 is the class being defined in a class-head. If ENUM_OK is TRUE,
21326 enum-names are also accepted.
21328 Returns the TYPE_DECL representing the class. */
21330 static tree
21339 {
21340 tree decl;
21341 tree scope;
21346 /* All class-names start with an identifier. */
21349 {
21352 }
21354 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21355 to a template-id, so we save it here. */
21360 /* Any name names a type if we're following the `typename' keyword
21361 in a qualified name where the enclosing scope is type-dependent. */
21364 /* Handle the common case (an identifier, but not a template-id)
21365 efficiently. */
21368 {
21372 /* Look for the identifier. */
21376 /* If the next token isn't an identifier, we are certainly not
21377 looking at a class-name. */
21380 /* If we know this is a type-name, there's no need to look it
21381 up. */
21384 else
21385 {
21386 tree ambiguous_decls;
21387 /* If we already know that this lookup is ambiguous, then
21388 we've already issued an error message; there's no reason
21389 to check again. */
21391 {
21394 }
21395 /* If the next token is a `::', then the name must be a type
21396 name.
21398 [basic.lookup.qual]
21400 During the lookup for a name preceding the :: scope
21401 resolution operator, object, function, and enumerator
21402 names are ignored. */
21405 /* Look up the name. */
21407 tag_type,
21410 check_dependency_p,
21414 {
21418 }
21419 }
21420 }
21421 else
21422 {
21423 /* Try a template-id. */
21425 check_dependency_p,
21426 tag_type,
21427 is_declaration);
21430 }
21434 /* If this is a typename, create a TYPENAME_TYPE. */
21436 {
21441 }
21445 /* Check to see that it is really the name of a class. */
21449 /* Situations like this:
21451 template <typename T> struct A {
21452 typename T::template X<int>::I i;
21453 };
21455 are problematic. Is `T::template X<int>' a class-name? The
21456 standard does not seem to be definitive, but there is no other
21457 valid interpretation of the following `::'. Therefore, those
21458 names are considered class-names. */
21459 {
21463 }
21468 /* In Objective-C 2.0, a classname followed by '.' starts a
21469 dot-syntax expression, and it's not a type-name. */
21481 }
21483 /* Parse a class-specifier.
21485 class-specifier:
21486 class-head { member-specification [opt] }
21488 Returns the TREE_TYPE representing the class. */
21490 static tree
21492 {
21493 tree type;
21507 /* Parse the class-head. */
21510 /* If the class-head was a semantic disaster, skip the entire body
21511 of the class. */
21513 {
21517 }
21519 /* Look for the `{'. */
21521 {
21524 }
21529 /* Issue an error message if type-definitions are forbidden here. */
21531 /* Remember that we are defining one more class. */
21533 /* Inside the class, surrounding template-parameter-lists do not
21534 apply. */
21535 saved_num_template_parameter_lists
21538 /* We are not in a function body. */
21541 /* Or in a loop. */
21544 /* Or in a switch. */
21547 /* We are not immediately inside an extern "lang" block. */
21548 saved_in_unbraced_linkage_specification_p
21552 // Associate constraints with the type.
21556 /* Start the class. */
21558 {
21561 }
21565 /* If the type is erroneous, skip the entire body of the class. */
21567 else
21568 /* Parse the member-specification. */
21571 /* Look for the trailing `}'. */
21573 /* Look for trailing attributes to apply to this class. */
21581 /* We've finished a type definition. Check for the common syntax
21582 error of forgetting a semicolon after the definition. We need to
21583 be careful, as we can't just check for not-a-semicolon and be done
21584 with it; the user might have typed:
21586 class X { } c = ...;
21587 class X { } *p = ...;
21589 and so forth. Instead, enumerate all the possible tokens that
21590 might follow this production; if we don't see one of them, then
21591 complain and silently insert the semicolon. */
21592 {
21597 /* Don't try to parse c++11 attributes here. As per the
21598 grammar, that should be a task for
21599 cp_parser_decl_specifier_seq. */
21603 {
21614 /* While it's legal for type qualifiers and storage class
21615 specifiers to follow type definitions in the grammar, only
21616 compiler testsuites contain code like that. Assume that if
21617 we see such code, then what we're really seeing is a case
21618 like:
21620 class X { }
21621 const <type> var = ...;
21623 or
21625 class Y { }
21626 static <type> func (...) ...
21628 i.e. the qualifier or specifier applies to the next
21629 declaration. To do so, however, we need to look ahead one
21630 more token to see if *that* token is a type specifier.
21632 This code could be improved to handle:
21634 class Z { }
21635 static const <type> var = ...; */
21638 {
21641 /* Handling user-defined types here would be nice, but very
21642 tricky. */
21643 want_semicolon
21646 }
21650 }
21652 /* If we don't have a type, then something is very wrong and we
21653 shouldn't try to do anything clever. Likewise for not seeing the
21654 closing brace. */
21656 {
21657 /* Locate the closing brace. */
21658 cp_token_position prev
21663 /* We want to suggest insertion of a ';' immediately *after* the
21664 closing brace, so, if we can, offset the location by 1 column. */
21681 else
21684 /* Unget one token and smash it to look as though we encountered
21685 a semicolon in the input stream. */
21690 }
21691 }
21693 /* If this class is not itself within the scope of another class,
21694 then we need to parse the bodies of all of the queued function
21695 definitions. Note that the queued functions defined in a class
21696 are not always processed immediately following the
21697 class-specifier for that class. Consider:
21699 struct A {
21700 struct B { void f() { sizeof (A); } };
21701 };
21703 If `f' were processed before the processing of `A' were
21704 completed, there would be no way to compute the size of `A'.
21705 Note that the nesting we are interested in here is lexical --
21706 not the semantic nesting given by TYPE_CONTEXT. In particular,
21707 for:
21709 struct A { struct B; };
21710 struct A::B { void f() { } };
21712 there is no need to delay the parsing of `A::B::f'. */
21714 {
21715 tree decl;
21722 /* In a first pass, parse default arguments to the functions.
21723 Then, in a second pass, parse the bodies of the functions.
21724 This two-phased approach handles cases like:
21726 struct S {
21727 void f() { g(); }
21728 void g(int i = 3);
21729 };
21731 */
21733 {
21735 /* If there are default arguments that have not yet been processed,
21736 take care of them now. */
21738 {
21743 }
21744 /* Make sure that any template parameters are in scope. */
21746 /* Parse the default argument expressions. */
21748 /* Remove any template parameters from the symbol table. */
21750 }
21752 /* Now parse any NSDMIs. */
21756 {
21758 {
21763 }
21766 }
21773 /* Now do some post-NSDMI bookkeeping. */
21779 /* Now parse the body of the functions. */
21781 {
21782 /* OpenMP UDRs need to be parsed before all other functions. */
21789 }
21790 else
21794 }
21795 else
21798 /* Put back any saved access checks. */
21801 /* Restore saved state. */
21805 parser->num_template_parameter_lists
21807 parser->in_unbraced_linkage_specification_p
21811 }
21813 static tree
21815 {
21816 tree ret;
21821 }
21823 /* Parse a class-head.
21825 class-head:
21826 class-key identifier [opt] base-clause [opt]
21827 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21828 class-key nested-name-specifier [opt] template-id
21829 base-clause [opt]
21831 class-virt-specifier:
21832 final
21834 GNU Extensions:
21835 class-key attributes identifier [opt] base-clause [opt]
21836 class-key attributes nested-name-specifier identifier base-clause [opt]
21837 class-key attributes nested-name-specifier [opt] template-id
21838 base-clause [opt]
21840 Upon return BASES is initialized to the list of base classes (or
21841 NULL, if there are none) in the same form returned by
21842 cp_parser_base_clause.
21844 Returns the TYPE of the indicated class. Sets
21845 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21846 involving a nested-name-specifier was used, and FALSE otherwise.
21848 Returns error_mark_node if this is not a class-head.
21850 Returns NULL_TREE if the class-head is syntactically valid, but
21851 semantically invalid in a way that means we should skip the entire
21852 body of the class. */
21854 static tree
21857 {
21858 tree nested_name_specifier;
21862 tree attributes;
21863 tree bases;
21873 /* Assume no nested-name-specifier will be present. */
21875 /* Assume no template parameter lists will be used in defining the
21876 type. */
21880 /* Look for the class-key. */
21887 /* Parse the attributes. */
21890 /* If the next token is `::', that is invalid -- but sometimes
21891 people do try to write:
21893 struct ::S {};
21895 Handle this gracefully by accepting the extra qualifier, and then
21896 issuing an error about it later if this really is a
21897 class-head. If it turns out just to be an elaborated type
21898 specifier, remain silent. */
21904 /* Determine the name of the class. Begin by looking for an
21905 optional nested-name-specifier. */
21907 nested_name_specifier
21913 /* If there was a nested-name-specifier, then there *must* be an
21914 identifier. */
21916 {
21918 /* Although the grammar says `identifier', it really means
21919 `class-name' or `template-name'. You are only allowed to
21920 define a class that has already been declared with this
21921 syntax.
21923 The proposed resolution for Core Issue 180 says that wherever
21924 you see `class T::X' you should treat `X' as a type-name.
21926 It is OK to define an inaccessible class; for example:
21928 class A { class B; };
21929 class A::B {};
21931 We do not know if we will see a class-name, or a
21932 template-name. We look for a class-name first, in case the
21933 class-name is a template-id; if we looked for the
21934 template-name first we would stop after the template-name. */
21939 class_type,
21943 /* If that didn't work, ignore the nested-name-specifier. */
21945 {
21951 }
21952 /* If we could not find a corresponding TYPE, treat this
21953 declaration like an unqualified declaration. */
21956 /* Otherwise, count the number of templates used in TYPE and its
21957 containing scopes. */
21958 else
21959 {
21960 tree scope;
21972 }
21973 }
21974 /* Otherwise, the identifier is optional. */
21975 else
21976 {
21977 /* We don't know whether what comes next is a template-id,
21978 an identifier, or nothing at all. */
21980 /* Check for a template-id. */
21985 class_key,
21987 /* If that didn't work, it could still be an identifier. */
21989 {
21991 {
21994 }
21995 else
21997 }
21998 else
21999 {
22002 }
22003 }
22008 {
22010 class_key,
22012 }
22015 /* If it's not a `:' or a `{' then we can't really be looking at a
22016 class-head, since a class-head only appears as part of a
22017 class-specifier. We have to detect this situation before calling
22018 xref_tag, since that has irreversible side-effects. */
22020 {
22024 }
22026 /* At this point, we're going ahead with the class-specifier, even
22027 if some other problem occurs. */
22030 {
22035 }
22036 /* Issue the error about the overly-qualified name now. */
22038 {
22043 }
22045 {
22050 }
22052 {
22053 tree scope;
22055 /* Reject typedef-names in class heads. */
22057 {
22060 type);
22063 }
22065 /* Figure out in what scope the declaration is being placed. */
22067 /* If that scope does not contain the scope in which the
22068 class was originally declared, the program is invalid. */
22070 {
22073 "declaration of %qD in namespace %qD which does not "
22076 else
22082 }
22083 /* [dcl.meaning]
22085 A declarator-id shall not be qualified except for the
22086 definition of a ... nested class outside of its class
22087 ... [or] the definition or explicit instantiation of a
22088 class member of a namespace outside of its namespace. */
22090 {
22095 }
22096 }
22097 /* An explicit-specialization must be preceded by "template <>". If
22098 it is not, try to recover gracefully. */
22101 && !processing_template_parmlist
22103 {
22104 /* Build a location of this form:
22105 struct typename <ARGS>
22106 ^~~~~~~~~~~~~~~~~~~~~~
22107 with caret==start at the start token, and
22108 finishing at the end of the type. */
22109 location_t reported_loc
22111 class_head_start_location,
22116 error_at_rich_loc
22120 /* Take the same action that would have been taken by
22121 cp_parser_explicit_specialization. */
22124 }
22125 /* There must be no "return" statements between this point and the
22126 end of this function; set "type "to the correct return value and
22127 use "goto done;" to return. */
22128 /* Make sure that the right number of template parameters were
22129 present. */
22133 {
22134 /* If something went wrong, there is no point in even trying to
22135 process the class-definition. */
22138 }
22140 /* Look up the type. */
22142 {
22146 {
22150 }
22151 else
22152 {
22155 }
22158 }
22160 {
22161 tree class_type;
22163 /* Given:
22165 template <typename T> struct S { struct T };
22166 template <typename T> struct S<T>::T { };
22168 we will get a TYPENAME_TYPE when processing the definition of
22169 `S::T'. We need to resolve it to the actual type before we
22170 try to define it. */
22172 {
22177 else
22178 {
22181 }
22182 }
22186 {
22189 }
22192 /* Enter the scope indicated by the nested-name-specifier. */
22194 /* Get the canonical version of this type. */
22196 /* Call push_template_decl if it seems like we should be defining a
22197 template either from the template headers or the type we're
22198 defining, so that we diagnose both extra and missing headers. */
22202 {
22205 {
22208 }
22209 }
22213 }
22215 {
22216 /* If the class was unnamed, create a dummy name. */
22221 }
22223 /* Indicate whether this class was declared as a `class' or as a
22224 `struct'. */
22229 /* If this type was already complete, and we see another definition,
22230 that's an error. */
22232 {
22234 type);
22236 type);
22239 }
22244 {
22245 /* Apply attributes now, before any use of the class as a template
22246 argument in its base list. */
22249 }
22251 /* We will have entered the scope containing the class; the names of
22252 base classes should be looked up in that context. For example:
22254 struct A { struct B {}; struct C; };
22255 struct A::C : B {};
22257 is valid. */
22259 /* Get the list of base-classes, if there is one. */
22261 {
22262 /* PR59482: enter the class scope so that base-specifiers are looked
22263 up correctly. */
22267 /* PR59482: get out of the previously pushed class scope so that the
22268 subsequent pops pop the right thing. */
22271 }
22272 else
22275 /* If we're really defining a class, process the base classes.
22276 If they're invalid, fail. */
22280 done:
22281 /* Leave the scope given by the nested-name-specifier. We will
22282 enter the class scope itself while processing the members. */
22287 {
22290 }
22296 out:
22299 }
22301 /* Parse a class-key.
22303 class-key:
22304 class
22305 struct
22306 union
22308 Returns the kind of class-key specified, or none_type to indicate
22309 error. */
22311 static enum tag_types
22313 {
22317 /* Look for the class-key. */
22322 /* Check to see if the TOKEN is a class-key. */
22327 }
22329 /* Parse a type-parameter-key.
22331 type-parameter-key:
22332 class
22333 typename
22334 */
22336 static void
22338 {
22339 /* Look for the type-parameter-key. */
22343 {
22346 /* typename is not allowed in a template template parameter
22347 by the standard until C++1Z. */
22349 "ISO C++ forbids typename key in template template parameter;"
22351 }
22352 else
22356 }
22358 /* Parse an (optional) member-specification.
22360 member-specification:
22361 member-declaration member-specification [opt]
22362 access-specifier : member-specification [opt] */
22364 static void
22366 {
22368 {
22372 /* Peek at the next token. */
22374 /* If it's a `}', or EOF then we've seen all the members. */
22380 /* See if this token is a keyword. */
22383 {
22387 /* Consume the access-specifier. */
22389 /* Remember which access-specifier is active. */
22391 /* Look for the `:'. */
22396 /* Accept #pragmas at class scope. */
22398 {
22401 }
22403 /* Otherwise, the next construction must be a
22404 member-declaration. */
22406 }
22407 }
22408 }
22410 /* Parse a member-declaration.
22412 member-declaration:
22413 decl-specifier-seq [opt] member-declarator-list [opt] ;
22414 function-definition ; [opt]
22415 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22416 using-declaration
22417 template-declaration
22418 alias-declaration
22420 member-declarator-list:
22421 member-declarator
22422 member-declarator-list , member-declarator
22424 member-declarator:
22425 declarator pure-specifier [opt]
22426 declarator constant-initializer [opt]
22427 identifier [opt] : constant-expression
22429 GNU Extensions:
22431 member-declaration:
22432 __extension__ member-declaration
22434 member-declarator:
22435 declarator attributes [opt] pure-specifier [opt]
22436 declarator attributes [opt] constant-initializer [opt]
22437 identifier [opt] attributes [opt] : constant-expression
22439 C++0x Extensions:
22441 member-declaration:
22442 static_assert-declaration */
22444 static void
22446 {
22447 cp_decl_specifier_seq decl_specifiers;
22448 tree prefix_attributes;
22449 tree decl;
22458 /* Check for the `__extension__' keyword. */
22460 {
22461 /* Recurse. */
22463 /* Restore the old value of the PEDANTIC flag. */
22467 }
22469 /* Check for a template-declaration. */
22471 {
22472 /* An explicit specialization here is an error condition, and we
22473 expect the specialization handler to detect and report this. */
22477 else
22481 }
22482 /* Check for a template introduction. */
22486 /* Check for a using-declaration. */
22488 {
22490 {
22491 /* Parse the using-declaration. */
22495 }
22496 else
22497 {
22498 tree decl;
22502 /* Note that if we actually see the '=' token after the
22503 identifier, cp_parser_alias_declaration commits the
22504 tentative parse. In that case, we really expect an
22505 alias-declaration. Otherwise, we expect a using
22506 declaration. */
22507 alias_decl_expected =
22513 else
22517 }
22518 }
22520 /* Check for @defs. */
22522 {
22527 {
22532 }
22534 }
22536 /* If the next token is `static_assert' we have a static assertion. */
22538 {
22541 }
22548 /* Parse the decl-specifier-seq. */
22551 CP_PARSER_FLAGS_OPTIONAL,
22554 /* Check for an invalid type-name. */
22558 /* If there is no declarator, then the decl-specifier-seq should
22559 specify a type. */
22561 {
22562 /* If there was no decl-specifier-seq, and the next token is a
22563 `;', then we have something like:
22565 struct S { ; };
22567 [class.mem]
22569 Each member-declaration shall declare at least one member
22570 name of the class. */
22572 {
22576 }
22577 else
22578 {
22579 tree type;
22581 /* See if this declaration is a friend. */
22583 /* If there were decl-specifiers, check to see if there was
22584 a class-declaration. */
22587 /* Nested classes have already been added to the class, but
22588 a `friend' needs to be explicitly registered. */
22590 {
22591 /* If the `friend' keyword was present, the friend must
22592 be introduced with a class-key. */
22595 "in C++03 a class-key must be used "
22597 /* In this case:
22599 template <typename T> struct A {
22600 friend struct A<T>::B;
22601 };
22603 A<T>::B will be represented by a TYPENAME_TYPE, and
22604 therefore not recognized by check_tag_decl. */
22606 {
22610 }
22613 "friend declaration does not name a class or "
22615 else
22618 }
22619 /* If there is no TYPE, an error message will already have
22620 been issued. */
22622 ;
22623 /* An anonymous aggregate has to be handled specially; such
22624 a declaration really declares a data member (with a
22625 particular type), as opposed to a nested class. */
22627 {
22628 /* C++11 9.5/6. */
22631 "a storage class on an anonymous aggregate "
22634 /* Remove constructors and such from TYPE, now that we
22635 know it is an anonymous aggregate. */
22637 /* And make the corresponding data member. */
22640 /* Add it to the class. */
22642 }
22643 else
22644 cp_parser_check_access_in_redeclaration
22647 }
22648 }
22649 else
22650 {
22653 /* Clear attributes from the decl_specifiers but keep them
22654 around as prefix attributes that apply them to the entity
22655 being declared. */
22659 /* See if these declarations will be friends. */
22662 /* Keep going until we hit the `;' at the end of the
22663 declaration. */
22665 {
22667 tree first_attribute;
22669 /* Peek at the next token. */
22672 /* Check for a bitfield declaration. */
22677 {
22678 tree identifier;
22679 tree width;
22681 /* Get the name of the bitfield. Note that we cannot just
22682 check TOKEN here because it may have been invalidated by
22683 the call to cp_lexer_peek_nth_token above. */
22686 else
22689 /* Consume the `:' token. */
22691 /* Get the width of the bitfield. */
22692 width
22695 /* Look for attributes that apply to the bitfield. */
22697 /* Remember which attributes are prefix attributes and
22698 which are not. */
22700 /* Combine the attributes. */
22703 /* Create the bitfield declaration. */
22706 identifier,
22707 sfk_none)
22710 width,
22711 attributes);
22712 }
22713 else
22714 {
22716 tree initializer;
22717 tree asm_specification;
22720 /* Parse the declarator. */
22721 declarator
22726 friend_p);
22728 /* If something went wrong parsing the declarator, make sure
22729 that we at least consume some tokens. */
22731 {
22732 /* Skip to the end of the statement. */
22734 /* If the next token is not a semicolon, that is
22735 probably because we just skipped over the body of
22736 a function. So, we consume a semicolon if
22737 present, but do not issue an error message if it
22738 is not present. */
22740 CPP_SEMICOLON))
22743 }
22746 cp_parser_check_for_definition_in_return_type
22750 /* Look for an asm-specification. */
22752 /* Look for attributes that apply to the declaration. */
22754 /* Remember which attributes are prefix attributes and
22755 which are not. */
22757 /* Combine the attributes. */
22760 /* If it's an `=', then we have a constant-initializer or a
22761 pure-specifier. It is not correct to parse the
22762 initializer before registering the member declaration
22763 since the member declaration should be in scope while
22764 its initializer is processed. However, the rest of the
22765 front end does not yet provide an interface that allows
22766 us to handle this correctly. */
22768 {
22769 /* In [class.mem]:
22771 A pure-specifier shall be used only in the declaration of
22772 a virtual function.
22774 A member-declarator can contain a constant-initializer
22775 only if it declares a static member of integral or
22776 enumeration type.
22778 Therefore, if the DECLARATOR is for a function, we look
22779 for a pure-specifier; otherwise, we look for a
22780 constant-initializer. When we call `grokfield', it will
22781 perform more stringent semantics checks. */
22793 {
22795 /* Don't require a constant rvalue in C++11, since we
22796 might want a reference constant. We'll enforce
22797 constancy later. */
22799 /* Parse the initializer. */
22802 }
22803 else
22804 /* Parse the initializer. */
22806 }
22809 {
22813 else
22815 }
22816 /* Otherwise, there is no initializer. */
22817 else
22820 /* See if we are probably looking at a function
22821 definition. We are certainly not looking at a
22822 member-declarator. Calling `grokfield' has
22823 side-effects, so we must not do it unless we are sure
22824 that we are looking at a member-declarator. */
22827 {
22828 /* The grammar does not allow a pure-specifier to be
22829 used when a member function is defined. (It is
22830 possible that this fact is an oversight in the
22831 standard, since a pure function may be defined
22832 outside of the class-specifier. */
22838 declarator,
22839 attributes);
22842 /* If the member was not a friend, declare it here. */
22845 /* Peek at the next token. */
22847 /* If the next token is a semicolon, consume it. */
22851 }
22852 else
22855 /* Create the declaration. */
22860 {
22863 else
22865 }
22866 }
22871 /* Reset PREFIX_ATTRIBUTES. */
22877 /* If there is any qualification still in effect, clear it
22878 now; we will be starting fresh with the next declarator. */
22882 /* If it's a `,', then there are more declarators. */
22884 {
22887 {
22891 }
22892 }
22893 /* If the next token isn't a `;', then we have a parse error. */
22895 CPP_SEMICOLON))
22896 {
22897 /* The next token might be a ways away from where the
22898 actual semicolon is missing. Find the previous token
22899 and use that for our error position. */
22904 /* Assume that the user meant to provide a semicolon. If
22905 we were to cp_parser_skip_to_end_of_statement, we might
22906 skip to a semicolon inside a member function definition
22907 and issue nonsensical error messages. */
22909 }
22912 {
22913 /* Add DECL to the list of members. */
22915 /* Explicitly include, eg, NSDMIs, for better error
22916 recovery (c++/58650). */
22925 /* Add DECL to the queue of NSDMI to be parsed later. */
22927 }
22931 }
22932 }
22935 out:
22937 }
22939 /* Parse a pure-specifier.
22941 pure-specifier:
22942 = 0
22944 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22945 Otherwise, ERROR_MARK_NODE is returned. */
22947 static tree
22949 {
22952 /* Look for the `=' token. */
22955 /* Look for the `0' token. */
22964 /* Accept = default or = delete in c++0x mode. */
22967 {
22970 }
22972 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22974 {
22979 }
22981 {
22984 }
22987 }
22989 /* Parse a constant-initializer.
22991 constant-initializer:
22992 = constant-expression
22994 Returns a representation of the constant-expression. */
22996 static tree
22998 {
22999 /* Look for the `=' token. */
23003 /* It is invalid to write:
23005 struct S { static const int i = { 7 }; };
23007 */
23009 {
23012 /* Consume the opening brace. */
23014 /* Skip the initializer. */
23016 /* Look for the trailing `}'. */
23020 }
23023 }
23025 /* Derived classes [gram.class.derived] */
23027 /* Parse a base-clause.
23029 base-clause:
23030 : base-specifier-list
23032 base-specifier-list:
23033 base-specifier ... [opt]
23034 base-specifier-list , base-specifier ... [opt]
23036 Returns a TREE_LIST representing the base-classes, in the order in
23037 which they were declared. The representation of each node is as
23038 described by cp_parser_base_specifier.
23040 In the case that no bases are specified, this function will return
23041 NULL_TREE, not ERROR_MARK_NODE. */
23043 static tree
23045 {
23048 /* Look for the `:' that begins the list. */
23051 /* Scan the base-specifier-list. */
23053 {
23055 tree base;
23058 /* Look for the base-specifier. */
23060 /* Look for the (optional) ellipsis. */
23062 {
23063 /* Consume the `...'. */
23067 }
23069 /* Add BASE to the front of the list. */
23071 {
23073 /* Make this a pack expansion type. */
23077 {
23080 }
23081 }
23082 /* Peek at the next token. */
23084 /* If it's not a comma, then the list is complete. */
23087 /* Consume the `,'. */
23089 }
23091 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23092 base class had a qualified name. However, the next name that
23093 appears is certainly not qualified. */
23099 }
23101 /* Parse a base-specifier.
23103 base-specifier:
23104 :: [opt] nested-name-specifier [opt] class-name
23105 virtual access-specifier [opt] :: [opt] nested-name-specifier
23106 [opt] class-name
23107 access-specifier virtual [opt] :: [opt] nested-name-specifier
23108 [opt] class-name
23110 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23111 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23112 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23113 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23115 static tree
23117 {
23125 tree type;
23127 /* Process the optional `virtual' and `access-specifier'. */
23129 {
23130 /* Peek at the next token. */
23132 /* Process `virtual'. */
23134 {
23136 /* If `virtual' appears more than once, issue an error. */
23138 {
23142 }
23146 /* Consume the `virtual' token. */
23154 /* If more than one access specifier appears, issue an
23155 error. */
23158 {
23162 }
23166 /* Consume the access-specifier. */
23174 }
23175 }
23176 /* It is not uncommon to see programs mechanically, erroneously, use
23177 the 'typename' keyword to denote (dependent) qualified types
23178 as base classes. */
23180 {
23185 else
23187 "keyword %<typename%> not allowed in this context "
23190 }
23192 /* Look for the optional `::' operator. */
23194 /* Look for the nested-name-specifier. The simplest way to
23195 implement:
23197 [temp.res]
23199 The keyword `typename' is not permitted in a base-specifier or
23200 mem-initializer; in these contexts a qualified name that
23201 depends on a template-parameter is implicitly assumed to be a
23202 type name.
23204 is to pretend that we have seen the `typename' keyword at this
23205 point. */
23209 typename_type,
23211 /* If the base class is given by a qualified name, assume that names
23212 we see are type names or templates, as appropriate. */
23218 /* DR 950 allows decltype as a base-specifier. */
23220 else
23221 {
23222 /* Otherwise, look for the class-name. */
23224 class_scope_p,
23225 template_p,
23226 typename_type,
23231 }
23237 }
23239 /* Exception handling [gram.exception] */
23241 /* Parse an (optional) noexcept-specification.
23243 noexcept-specification:
23244 noexcept ( constant-expression ) [opt]
23246 If no noexcept-specification is present, returns NULL_TREE.
23247 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23248 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23249 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23250 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23251 in which case a boolean condition is returned instead. */
23253 static tree
23258 {
23262 /* Peek at the next token. */
23265 /* Is it a noexcept-specification? */
23267 {
23268 tree expr;
23272 {
23276 {
23277 /* Types may not be defined in an exception-specification. */
23279 parser->type_definition_forbidden_message
23284 /* Restore the saved message. */
23286 }
23287 else
23288 {
23291 }
23294 }
23295 else
23296 {
23300 }
23302 /* We cannot build a noexcept-spec right away because this will check
23303 that expr is a constexpr. */
23306 else
23308 }
23309 else
23311 }
23313 /* Parse an (optional) exception-specification.
23315 exception-specification:
23316 throw ( type-id-list [opt] )
23318 Returns a TREE_LIST representing the exception-specification. The
23319 TREE_VALUE of each node is a type. */
23321 static tree
23323 {
23325 tree type_id_list;
23328 /* Peek at the next token. */
23331 /* Is it a noexcept-specification? */
23337 /* If it's not `throw', then there's no exception-specification. */
23341 #if 0
23342 /* Enable this once a lot of code has transitioned to noexcept? */
23346 #endif
23348 /* Consume the `throw'. */
23351 /* Look for the `('. */
23354 /* Peek at the next token. */
23356 /* If it's not a `)', then there is a type-id-list. */
23358 {
23359 /* Types may not be defined in an exception-specification. */
23361 parser->type_definition_forbidden_message
23363 /* Parse the type-id-list. */
23365 /* Restore the saved message. */
23367 }
23368 else
23371 /* Look for the `)'. */
23375 }
23377 /* Parse an (optional) type-id-list.
23379 type-id-list:
23380 type-id ... [opt]
23381 type-id-list , type-id ... [opt]
23383 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23384 in the order that the types were presented. */
23386 static tree
23388 {
23392 {
23394 tree type;
23398 /* Get the next type-id. */
23400 /* Check for invalid 'auto'. */
23402 {
23406 }
23407 /* Parse the optional ellipsis. */
23409 {
23410 /* Consume the `...'. */
23413 /* Turn the type into a pack expansion expression. */
23415 }
23416 /* Add it to the list. */
23418 /* Peek at the next token. */
23420 /* If it is not a `,', we are done. */
23423 /* Consume the `,'. */
23425 }
23428 }
23430 /* Parse a try-block.
23432 try-block:
23433 try compound-statement handler-seq */
23435 static tree
23437 {
23438 tree try_block;
23452 }
23454 /* Parse a function-try-block.
23456 function-try-block:
23457 try ctor-initializer [opt] function-body handler-seq */
23459 static bool
23461 {
23462 tree compound_stmt;
23463 tree try_block;
23466 /* Look for the `try' keyword. */
23469 /* Let the rest of the front end know where we are. */
23471 /* Parse the function-body. */
23472 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23474 /* We're done with the `try' part. */
23476 /* Parse the handlers. */
23478 /* We're done with the handlers. */
23482 }
23484 /* Parse a handler-seq.
23486 handler-seq:
23487 handler handler-seq [opt] */
23489 static void
23491 {
23493 {
23496 /* Parse the handler. */
23498 /* Peek at the next token. */
23500 /* If it's not `catch' then there are no more handlers. */
23503 }
23504 }
23506 /* Parse a handler.
23508 handler:
23509 catch ( exception-declaration ) compound-statement */
23511 static void
23513 {
23514 tree handler;
23515 tree declaration;
23525 }
23527 /* Parse an exception-declaration.
23529 exception-declaration:
23530 type-specifier-seq declarator
23531 type-specifier-seq abstract-declarator
23532 type-specifier-seq
23533 ...
23535 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23536 ellipsis variant is used. */
23538 static tree
23540 {
23541 cp_decl_specifier_seq type_specifiers;
23545 /* If it's an ellipsis, it's easy to handle. */
23547 {
23548 /* Consume the `...' token. */
23551 }
23553 /* Types may not be defined in exception-declarations. */
23555 parser->type_definition_forbidden_message
23558 /* Parse the type-specifier-seq. */
23562 /* If it's a `)', then there is no declarator. */
23565 else
23572 /* Restore the saved message. */
23579 }
23581 /* Parse a throw-expression.
23583 throw-expression:
23584 throw assignment-expression [opt]
23586 Returns a THROW_EXPR representing the throw-expression. */
23588 static tree
23590 {
23591 tree expression;
23596 /* Figure out whether or not there is an assignment-expression
23597 following the "throw" keyword. */
23605 else
23609 }
23611 /* GNU Extensions */
23613 /* Parse an (optional) asm-specification.
23615 asm-specification:
23616 asm ( string-literal )
23618 If the asm-specification is present, returns a STRING_CST
23619 corresponding to the string-literal. Otherwise, returns
23620 NULL_TREE. */
23622 static tree
23624 {
23626 tree asm_specification;
23628 /* Peek at the next token. */
23630 /* If the next token isn't the `asm' keyword, then there's no
23631 asm-specification. */
23635 /* Consume the `asm' token. */
23637 /* Look for the `('. */
23640 /* Look for the string-literal. */
23643 /* Look for the `)'. */
23647 }
23649 /* Parse an asm-operand-list.
23651 asm-operand-list:
23652 asm-operand
23653 asm-operand-list , asm-operand
23655 asm-operand:
23656 string-literal ( expression )
23657 [ string-literal ] string-literal ( expression )
23659 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23660 each node is the expression. The TREE_PURPOSE is itself a
23661 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23662 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23663 is a STRING_CST for the string literal before the parenthesis. Returns
23664 ERROR_MARK_NODE if any of the operands are invalid. */
23666 static tree
23668 {
23673 {
23674 tree string_literal;
23675 tree expression;
23676 tree name;
23679 {
23680 /* Consume the `[' token. */
23682 /* Read the operand name. */
23687 /* Look for the closing `]'. */
23689 }
23690 else
23692 /* Look for the string-literal. */
23695 /* Look for the `('. */
23697 /* Parse the expression. */
23699 /* Look for the `)'. */
23707 /* Add this operand to the list. */
23709 expression,
23710 asm_operands);
23711 /* If the next token is not a `,', there are no more
23712 operands. */
23715 /* Consume the `,'. */
23717 }
23720 }
23722 /* Parse an asm-clobber-list.
23724 asm-clobber-list:
23725 string-literal
23726 asm-clobber-list , string-literal
23728 Returns a TREE_LIST, indicating the clobbers in the order that they
23729 appeared. The TREE_VALUE of each node is a STRING_CST. */
23731 static tree
23733 {
23737 {
23738 tree string_literal;
23740 /* Look for the string literal. */
23742 /* Add it to the list. */
23744 /* If the next token is not a `,', then the list is
23745 complete. */
23748 /* Consume the `,' token. */
23750 }
23753 }
23755 /* Parse an asm-label-list.
23757 asm-label-list:
23758 identifier
23759 asm-label-list , identifier
23761 Returns a TREE_LIST, indicating the labels in the order that they
23762 appeared. The TREE_VALUE of each node is a label. */
23764 static tree
23766 {
23770 {
23773 /* Look for the identifier. */
23776 {
23779 {
23785 }
23786 }
23787 /* If the next token is not a `,', then the list is
23788 complete. */
23791 /* Consume the `,' token. */
23793 }
23796 }
23798 /* Return TRUE iff the next tokens in the stream are possibly the
23799 beginning of a GNU extension attribute. */
23801 static bool
23803 {
23805 }
23807 /* Return TRUE iff the next tokens in the stream are possibly the
23808 beginning of a standard C++-11 attribute specifier. */
23810 static bool
23812 {
23814 }
23816 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23817 beginning of a standard C++-11 attribute specifier. */
23819 static bool
23821 {
23829 }
23831 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23832 beginning of a GNU extension attribute. */
23834 static bool
23836 {
23840 }
23842 /* Return true iff the next tokens can be the beginning of either a
23843 GNU attribute list, or a standard C++11 attribute sequence. */
23845 static bool
23847 {
23850 }
23852 /* Return true iff the next Nth tokens can be the beginning of either
23853 a GNU attribute list, or a standard C++11 attribute sequence. */
23855 static bool
23857 {
23860 }
23862 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23863 of GNU attributes, or return NULL. */
23865 static tree
23867 {
23871 }
23873 #define CILK_SIMD_FN_CLAUSE_MASK \
23874 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23875 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23876 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23877 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23878 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23880 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23881 vector [(<clauses>)] */
23883 static void
23885 {
23889 {
23895 }
23898 {
23901 paren_scope++;
23902 }
23904 {
23907 paren_scope++;
23909 paren_scope--;
23910 /* Do not push the last ')' */
23913 }
23922 }
23924 /* Parse an (optional) series of attributes.
23926 attributes:
23927 attributes attribute
23929 attribute:
23930 __attribute__ (( attribute-list [opt] ))
23932 The return value is as for cp_parser_gnu_attribute_list. */
23934 static tree
23936 {
23940 {
23942 tree attribute_list;
23945 /* Peek at the next token. */
23947 /* If it's not `__attribute__', then we're done. */
23951 /* Consume the `__attribute__' keyword. */
23953 /* Look for the two `(' tokens. */
23957 /* Peek at the next token. */
23960 /* Parse the attribute-list. */
23962 else
23963 /* If the next token is a `)', then there is no attribute
23964 list. */
23967 /* Look for the two `)' tokens. */
23975 /* Add these new attributes to the list. */
23977 }
23980 }
23982 /* Parse a GNU attribute-list.
23984 attribute-list:
23985 attribute
23986 attribute-list , attribute
23988 attribute:
23989 identifier
23990 identifier ( identifier )
23991 identifier ( identifier , expression-list )
23992 identifier ( expression-list )
23994 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23995 to an attribute. The TREE_PURPOSE of each node is the identifier
23996 indicating which attribute is in use. The TREE_VALUE represents
23997 the arguments, if any. */
23999 static tree
24001 {
24007 {
24009 tree identifier;
24010 tree attribute;
24012 /* Look for the identifier. We also allow keywords here; for
24013 example `__attribute__ ((const))' is legal. */
24017 {
24020 /* Consume the token, but save it since we need it for the
24021 SIMD enabled function parsing. */
24024 /* Save away the identifier that indicates which attribute
24025 this is. */
24027 /* For keywords, use the canonical spelling, not the
24028 parsed identifier. */
24034 /* Peek at the next token. */
24036 /* If it's an `(', then parse the attribute arguments. */
24038 {
24043 {
24046 }
24047 else
24048 vec = cp_parser_parenthesized_expression_list
24054 else
24055 {
24058 }
24059 /* Save the arguments away. */
24061 }
24063 {
24066 }
24069 {
24070 /* Add this attribute to the list. */
24073 }
24076 }
24077 /* Now, look for more attributes. If the next token isn't a
24078 `,', we're done. */
24082 /* Consume the comma and keep going. */
24084 }
24087 /* We built up the list in reverse order. */
24089 }
24091 /* Parse a standard C++11 attribute.
24093 The returned representation is a TREE_LIST which TREE_PURPOSE is
24094 the scoped name of the attribute, and the TREE_VALUE is its
24095 arguments list.
24097 Note that the scoped name of the attribute is itself a TREE_LIST
24098 which TREE_PURPOSE is the namespace of the attribute, and
24099 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24100 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24101 and which TREE_PURPOSE is directly the attribute name.
24103 Clients of the attribute code should use get_attribute_namespace
24104 and get_attribute_name to get the actual namespace and name of
24105 attributes, regardless of their being GNU or C++11 attributes.
24107 attribute:
24108 attribute-token attribute-argument-clause [opt]
24110 attribute-token:
24111 identifier
24112 attribute-scoped-token
24114 attribute-scoped-token:
24115 attribute-namespace :: identifier
24117 attribute-namespace:
24118 identifier
24120 attribute-argument-clause:
24121 ( balanced-token-seq )
24123 balanced-token-seq:
24124 balanced-token [opt]
24125 balanced-token-seq balanced-token
24127 balanced-token:
24128 ( balanced-token-seq )
24129 [ balanced-token-seq ]
24130 { balanced-token-seq }. */
24132 static tree
24134 {
24138 /* First, parse name of the attribute, a.k.a attribute-token. */
24155 {
24156 /* We are seeing a scoped attribute token. */
24171 else
24172 {
24176 }
24178 NULL_TREE);
24180 }
24183 NULL_TREE);
24184 else
24185 {
24187 NULL_TREE);
24188 /* C++11 noreturn attribute is equivalent to GNU's. */
24191 /* C++14 deprecated attribute is equivalent to GNU's. */
24193 {
24196 "%<deprecated%> is a C++14 feature;"
24199 }
24200 /* C++17 fallthrough attribute is equivalent to GNU's. */
24202 {
24205 "%<fallthrough%> is a C++17 feature;"
24208 }
24209 /* Transactional Memory TS optimize_for_synchronized attribute is
24210 equivalent to GNU transaction_callable. */
24214 /* Transactional Memory attributes are GNU attributes. */
24217 }
24219 /* Now parse the optional argument clause of the attribute. */
24224 {
24230 /* A GNU attribute that takes an identifier in parameter. */
24233 vec = cp_parser_parenthesized_expression_list
24239 else
24240 {
24243 }
24247 else
24249 }
24252 }
24254 /* Check that the attribute ATTRIBUTE appears at most once in the
24255 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24256 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24257 isn't implemented yet in GCC. */
24259 static void
24261 {
24263 {
24273 }
24274 }
24276 /* Parse a list of standard C++-11 attributes.
24278 attribute-list:
24279 attribute [opt]
24280 attribute-list , attribute[opt]
24281 attribute ...
24282 attribute-list , attribute ...
24283 */
24285 static tree
24287 {
24292 {
24297 {
24301 }
24304 {
24309 else
24313 }
24317 }
24320 }
24322 /* Parse a standard C++-11 attribute specifier.
24324 attribute-specifier:
24325 [ [ attribute-using-prefix [opt] attribute-list ] ]
24326 alignment-specifier
24328 attribute-using-prefix:
24329 using attribute-namespace :
24331 alignment-specifier:
24332 alignas ( type-id ... [opt] )
24333 alignas ( alignment-expression ... [opt] ). */
24335 static tree
24337 {
24343 {
24350 {
24361 {
24365 "attribute using prefix only available "
24371 }
24372 else
24374 }
24381 else
24382 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24383 when we are sure that we have actually parsed them. */
24385 }
24386 else
24387 {
24388 tree alignas_expr;
24390 /* Look for an alignment-specifier. */
24402 {
24405 }
24411 {
24415 alignas_expr =
24422 }
24428 {
24431 }
24434 {
24437 }
24439 /* Build the C++-11 representation of an 'aligned'
24440 attribute. */
24441 attributes =
24444 alignas_expr);
24445 }
24448 }
24450 /* Parse a standard C++-11 attribute-specifier-seq.
24452 attribute-specifier-seq:
24453 attribute-specifier-seq [opt] attribute-specifier
24454 */
24456 static tree
24458 {
24463 {
24472 else
24475 }
24478 }
24480 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24481 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24482 current value of the PEDANTIC flag, regardless of whether or not
24483 the `__extension__' keyword is present. The caller is responsible
24484 for restoring the value of the PEDANTIC flag. */
24486 static bool
24488 {
24489 /* Save the old value of the PEDANTIC flag. */
24493 {
24494 /* Consume the `__extension__' token. */
24496 /* We're not being pedantic while the `__extension__' keyword is
24497 in effect. */
24501 }
24504 }
24506 /* Parse a label declaration.
24508 label-declaration:
24509 __label__ label-declarator-seq ;
24511 label-declarator-seq:
24512 identifier , label-declarator-seq
24513 identifier */
24515 static void
24517 {
24518 /* Look for the `__label__' keyword. */
24522 {
24523 tree identifier;
24525 /* Look for an identifier. */
24527 /* If we failed, stop. */
24530 /* Declare it as a label. */
24532 /* If the next token is a `;', stop. */
24535 /* Look for the `,' separating the label declarations. */
24537 }
24539 /* Look for the final `;'. */
24541 }
24543 // -------------------------------------------------------------------------- //
24544 // Requires Clause
24546 // Parse a requires clause.
24547 //
24548 // requires-clause:
24549 // 'requires' logical-or-expression
24550 //
24551 // The required logical-or-expression must be a constant expression. Note
24552 // that we don't check that the expression is constepxr here. We defer until
24553 // we analyze constraints and then, we only check atomic constraints.
24554 static tree
24556 {
24557 // Parse the requires clause so that it is not automatically folded.
24565 }
24567 // Optionally parse a requires clause:
24568 static tree
24570 {
24573 {
24576 {
24579 /* Parse and discard the requires-clause. */
24582 }
24584 }
24587 }
24590 /*---------------------------------------------------------------------------
24591 Requires expressions
24592 ---------------------------------------------------------------------------*/
24594 /* Parse a requires expression
24596 requirement-expression:
24597 'requires' requirement-parameter-list [opt] requirement-body */
24598 static tree
24600 {
24604 /* A requires-expression shall appear only within a concept
24605 definition or a requires-clause.
24607 TODO: Implement this diagnostic correctly. */
24609 {
24613 }
24616 {
24617 /* Local parameters are delared as variables within the scope
24618 of the expression. They are not visible past the end of
24619 the expression. Expressions within the requires-expression
24620 are unevaluated. */
24621 struct scope_sentinel
24622 {
24624 {
24627 }
24630 {
24633 }
24636 /* Parse the optional parameter list. */
24638 {
24642 }
24643 else
24646 /* Parse the requirement body. */
24650 }
24652 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24653 the parm chain. */
24656 }
24658 /* Parse a parameterized requirement.
24660 requirement-parameter-list:
24661 '(' parameter-declaration-clause ')' */
24662 static tree
24664 {
24674 }
24676 /* Parse the body of a requirement.
24678 requirement-body:
24679 '{' requirement-list '}' */
24680 static tree
24682 {
24692 }
24694 /* Parse a list of requirements.
24696 requirement-list:
24697 requirement
24698 requirement-list ';' requirement[opt] */
24699 static tree
24701 {
24704 {
24711 /* If we see a semi-colon, consume it. */
24715 /* Stop processing at the end of the list. */
24718 }
24720 /* Reverse the order of requirements so they are analyzed in
24721 declaration order. */
24723 }
24725 /* Parse a syntactic requirement or type requirement.
24727 requirement:
24728 simple-requirement
24729 compound-requirement
24730 type-requirement
24731 nested-requirement */
24732 static tree
24734 {
24741 else
24743 }
24745 /* Parse a simple requirement.
24747 simple-requirement:
24748 expression ';' */
24749 static tree
24751 {
24760 }
24762 /* Parse a type requirement
24764 type-requirement
24765 nested-name-specifier [opt] required-type-name ';'
24767 required-type-name:
24768 type-name
24769 'template' [opt] simple-template-id */
24770 static tree
24772 {
24775 // Save the scope before parsing name specifiers.
24786 tree type;
24788 {
24797 }
24798 else
24817 }
24819 /* Parse a compound requirement
24821 compound-requirement:
24822 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24823 static tree
24825 {
24826 /* Parse an expression enclosed in '{ }'s. */
24837 /* Parse the optional noexcept. */
24840 {
24843 }
24845 /* Parse the optional trailing return type. */
24848 {
24856 }
24859 }
24861 /* Parse a nested requirement. This is the same as a requires clause.
24863 nested-requirement:
24864 requires-clause */
24865 static tree
24867 {
24873 }
24875 /* Support Functions */
24877 /* Return the appropriate prefer_type argument for lookup_name_real based on
24878 tag_type and template_mem_access. */
24882 {
24883 /* DR 141: When looking in the current enclosing context for a template-name
24884 after -> or ., only consider class templates. */
24888 {
24892 }
24893 }
24895 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24896 NAME should have one of the representations used for an
24897 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24898 is returned. If PARSER->SCOPE is a dependent type, then a
24899 SCOPE_REF is returned.
24901 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24902 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24903 was formed. Abstractly, such entities should not be passed to this
24904 function, because they do not need to be looked up, but it is
24905 simpler to check for this special case here, rather than at the
24906 call-sites.
24908 In cases not explicitly covered above, this function returns a
24909 DECL, OVERLOAD, or baselink representing the result of the lookup.
24910 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24911 is returned.
24913 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24914 (e.g., "struct") that was used. In that case bindings that do not
24915 refer to types are ignored.
24917 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24918 ignored.
24920 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24921 are ignored.
24923 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24924 types.
24926 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24927 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24928 NULL_TREE otherwise. */
24930 static cp_expr
24937 location_t name_location)
24938 {
24939 tree decl;
24942 /* Assume that the lookup will be unambiguous. */
24946 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24947 no longer valid. Note that if we are parsing tentatively, and
24948 the parse fails, OBJECT_TYPE will be automatically restored. */
24954 /* A template-id has already been resolved; there is no lookup to
24955 do. */
24959 {
24963 }
24965 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24966 it should already have been checked to make sure that the name
24967 used matches the type being destroyed. */
24969 {
24970 tree type;
24972 /* Figure out to which type this destructor applies. */
24977 else
24979 /* If that's not a class type, there is no destructor. */
24986 /* If it was a class type, return the destructor. */
24988 }
24990 /* By this point, the NAME should be an ordinary identifier. If
24991 the id-expression was a qualified name, the qualifying scope is
24992 stored in PARSER->SCOPE at this point. */
24995 /* Perform the lookup. */
24997 {
25003 /* If the SCOPE is dependent, the lookup must be deferred until
25004 the template is instantiated -- unless we are explicitly
25005 looking up names in uninstantiated templates. Even then, we
25006 cannot look up the name if the scope is not a class type; it
25007 might, for example, be a template type parameter. */
25012 /* Defer lookup. */
25014 else
25015 {
25018 /* If PARSER->SCOPE is a dependent type, then it must be a
25019 class type, and we must not be checking dependencies;
25020 otherwise, we would have processed this lookup above. So
25021 that PARSER->SCOPE is not considered a dependent base by
25022 lookup_member, we must enter the scope here. */
25026 /* If the PARSER->SCOPE is a template specialization, it
25027 may be instantiated during name lookup. In that case,
25028 errors may be issued. Even if we rollback the current
25029 tentative parse, those errors are valid. */
25034 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25035 lookup result and the nested-name-specifier nominates a class C:
25036 * if the name specified after the nested-name-specifier, when
25037 looked up in C, is the injected-class-name of C (Clause 9), or
25038 * if the name specified after the nested-name-specifier is the
25039 same as the identifier or the simple-template-id's template-
25040 name in the last component of the nested-name-specifier,
25041 the name is instead considered to name the constructor of
25042 class C. [ Note: for example, the constructor is not an
25043 acceptable lookup result in an elaborated-type-specifier so
25044 the constructor would not be used in place of the
25045 injected-class-name. --end note ] Such a constructor name
25046 shall be used only in the declarator-id of a declaration that
25047 names a constructor or in a using-declaration. */
25055 /* If we have a single function from a using decl, pull it out. */
25062 }
25064 /* If the scope is a dependent type and either we deferred lookup or
25065 we did lookup but didn't find the name, rememeber the name. */
25068 {
25070 {
25071 tree type;
25073 /* The resolution to Core Issue 180 says that `struct
25074 A::B' should be considered a type-name, even if `A'
25075 is dependent. */
25080 }
25084 CPP_CLOSE_PAREN)))
25088 else
25091 is_template);
25092 }
25095 }
25097 {
25098 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25099 OBJECT_TYPE is not a class. */
25101 /* If the OBJECT_TYPE is a template specialization, it may
25102 be instantiated during name lookup. In that case, errors
25103 may be issued. Even if we rollback the current tentative
25104 parse, those errors are valid. */
25106 name,
25109 tf_warning_or_error);
25110 else
25114 /* Look it up in the enclosing context. DR 141: When looking for a
25115 template-name after -> or ., only consider class templates. */
25120 /* The object is type-dependent, so we can't look anything up; we used
25121 this to get the DR 141 behavior. */
25125 }
25126 else
25127 {
25133 }
25135 /* If the lookup failed, let our caller know. */
25139 /* Pull out the template from an injected-class-name (or multiple). */
25143 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25145 {
25148 /* The error message we have to print is too complicated for
25149 cp_parser_error, so we incorporate its actions directly. */
25151 {
25153 name);
25155 }
25157 }
25165 /* If we have resolved the name of a member declaration, check to
25166 see if the declaration is accessible. When the name resolves to
25167 set of overloaded functions, accessibility is checked when
25168 overload resolution is done.
25170 During an explicit instantiation, access is not checked at all,
25171 as per [temp.explicit]. */
25178 }
25180 /* Like cp_parser_lookup_name, but for use in the typical case where
25181 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25182 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25184 static tree
25186 {
25188 none_type,
25193 location);
25194 }
25196 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25197 the current context, return the TYPE_DECL. If TAG_NAME_P is
25198 true, the DECL indicates the class being defined in a class-head,
25199 or declared in an elaborated-type-specifier.
25201 Otherwise, return DECL. */
25203 static tree
25205 {
25206 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25207 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25209 struct A {
25210 template <typename T> struct B;
25211 };
25213 template <typename T> struct A::B {};
25215 Similarly, in an elaborated-type-specifier:
25217 namespace N { struct X{}; }
25219 struct A {
25220 template <typename T> friend struct N::X;
25221 };
25223 However, if the DECL refers to a class type, and we are in
25224 the scope of the class, then the name lookup automatically
25225 finds the TYPE_DECL created by build_self_reference rather
25226 than a TEMPLATE_DECL. For example, in:
25228 template <class T> struct S {
25229 S s;
25230 };
25232 there is no need to handle such case. */
25238 }
25240 /* If too many, or too few, template-parameter lists apply to the
25241 declarator, issue an error message. Returns TRUE if all went well,
25242 and FALSE otherwise. */
25244 static bool
25247 location_t declarator_location)
25248 {
25250 {
25252 {
25260 /* If the DECLARATOR has the form `X<y>' then it uses one
25261 additional level of template parameters. */
25264 return cp_parser_check_template_parameters
25266 }
25281 }
25283 }
25285 /* NUM_TEMPLATES were used in the current declaration. If that is
25286 invalid, return FALSE and issue an error messages. Otherwise,
25287 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25288 declarator and we can print more accurate diagnostics. */
25290 static bool
25293 location_t location,
25295 {
25296 /* If there are the same number of template classes and parameter
25297 lists, that's OK. */
25300 /* If there are more, but only one more, then we are referring to a
25301 member template. That's OK too. */
25304 /* If there are more template classes than parameter lists, we have
25305 something like:
25307 template <class T> void S<T>::R<T>::f (); */
25309 {
25319 else
25322 }
25323 /* Otherwise, there are too many template parameter lists. We have
25324 something like:
25326 template <class T> template <class U> void S::f(); */
25329 }
25331 /* Parse an optional `::' token indicating that the following name is
25332 from the global namespace. If so, PARSER->SCOPE is set to the
25333 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25334 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25335 Returns the new value of PARSER->SCOPE, if the `::' token is
25336 present, and NULL_TREE otherwise. */
25338 static tree
25340 {
25343 /* Peek at the next token. */
25345 /* If we're looking at a `::' token then we're starting from the
25346 global namespace, not our current location. */
25348 {
25349 /* Consume the `::' token. */
25351 /* Set the SCOPE so that we know where to start the lookup. */
25357 }
25359 {
25363 }
25366 }
25368 /* Returns TRUE if the upcoming token sequence is the start of a
25369 constructor declarator. If FRIEND_P is true, the declarator is
25370 preceded by the `friend' specifier. */
25372 static bool
25374 {
25377 tree nested_name_specifier;
25380 /* The common case is that this is not a constructor declarator, so
25381 try to avoid doing lots of work if at all possible. It's not
25382 valid declare a constructor at function scope. */
25385 /* And only certain tokens can begin a constructor declarator. */
25393 /* Parse tentatively; we are going to roll back all of the tokens
25394 consumed here. */
25396 /* Assume that we are looking at a constructor declarator. */
25399 /* Look for the optional `::' operator. */
25402 /* Look for the nested-name-specifier. */
25403 nested_name_specifier
25414 /* Outside of a class-specifier, there must be a
25415 nested-name-specifier. */
25421 /* If we have a class scope, this is easy; DR 147 says that S::S always
25422 names the constructor, and no other qualified name could. */
25425 {
25435 }
25436 /* If we still think that this might be a constructor-declarator,
25437 look for a class-name. */
25439 {
25440 /* If we have:
25442 template <typename T> struct S {
25443 S();
25444 };
25446 we must recognize that the nested `S' names a class. */
25447 tree type_decl;
25451 none_type,
25455 /* If there was no class-name, then this is not a constructor.
25456 Otherwise, if we are in a class-specifier and we aren't
25457 handling a friend declaration, check that its type matches
25458 current_class_type (c++/38313). Note: error_mark_node
25459 is left alone for error recovery purposes. */
25461 && (outside_class_specifier_p
25466 /* If we're still considering a constructor, we have to see a `(',
25467 to begin the parameter-declaration-clause, followed by either a
25468 `)', an `...', or a decl-specifier. We need to check for a
25469 type-specifier to avoid being fooled into thinking that:
25471 S (f) (int);
25473 is a constructor. (It is actually a function named `f' that
25474 takes one parameter (of type `int') and returns a value of type
25475 `S'. */
25483 /* A parameter declaration begins with a decl-specifier,
25484 which is either the "attribute" keyword, a storage class
25485 specifier, or (usually) a type-specifier. */
25487 {
25488 tree type;
25492 /* Names appearing in the type-specifier should be looked up
25493 in the scope of the class. */
25496 else
25497 {
25500 {
25504 {
25507 }
25508 }
25510 }
25512 /* Inside the constructor parameter list, surrounding
25513 template-parameter-lists do not apply. */
25514 saved_num_template_parameter_lists
25518 /* Look for the type-specifier. */
25520 CP_PARSER_FLAGS_NONE,
25526 parser->num_template_parameter_lists
25529 /* Leave the scope of the class. */
25534 }
25535 }
25537 /* We did not really want to consume any tokens. */
25541 }
25543 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25544 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25545 they must be performed once we are in the scope of the function.
25547 Returns the function defined. */
25549 static tree
25550 cp_parser_function_definition_from_specifiers_and_declarator
25553 tree attributes,
25555 {
25556 tree fn;
25559 /* Begin the function-definition. */
25562 /* The things we're about to see are not directly qualified by any
25563 template headers we've seen thus far. */
25566 /* If there were names looked up in the decl-specifier-seq that we
25567 did not check, check them now. We must wait until we are in the
25568 scope of the function to perform the checks, since the function
25569 might be a friend. */
25573 {
25578 }
25581 {
25582 /* Skip the entire function. */
25585 }
25587 {
25588 /* Seen already, skip it. An error message has already been output. */
25592 /* If this is a function from a class, pop the nested class. */
25595 }
25596 else
25597 {
25598 timevar_id_t tv;
25601 else
25607 }
25610 }
25612 /* Parse the part of a function-definition that follows the
25613 declarator. INLINE_P is TRUE iff this function is an inline
25614 function defined within a class-specifier.
25616 Returns the function defined. */
25618 static tree
25621 {
25622 tree fn;
25628 bool fully_implicit_function_template_p
25631 tree implicit_template_parms
25634 cp_binding_level* implicit_template_scope
25640 /* If the next token is `return', then the code may be trying to
25641 make use of the "named return value" extension that G++ used to
25642 support. */
25645 {
25646 /* Consume the `return' keyword. */
25648 /* Look for the identifier that indicates what value is to be
25649 returned. */
25651 /* Issue an error message. */
25654 /* Skip tokens until we reach the start of the function body. */
25656 {
25663 }
25664 }
25665 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25666 anything declared inside `f'. */
25667 saved_in_unbraced_linkage_specification_p
25670 /* Inside the function, surrounding template-parameter-lists do not
25671 apply. */
25672 saved_num_template_parameter_lists
25678 /* If the next token is `try', `__transaction_atomic', or
25679 `__transaction_relaxed`, then we are looking at either function-try-block
25680 or function-transaction-block. Note that all of these include the
25681 function-body. */
25684 RID_TRANSACTION_ATOMIC);
25686 RID_TRANSACTION_RELAXED))
25688 RID_TRANSACTION_RELAXED);
25691 else
25692 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25697 /* Finish the function. */
25700 /* Generate code for it, if necessary. */
25702 /* Restore the saved values. */
25703 parser->in_unbraced_linkage_specification_p
25705 parser->num_template_parameter_lists
25709 parser->fully_implicit_function_template_p
25711 parser->implicit_template_parms
25713 parser->implicit_template_scope
25720 }
25722 /* Parse a template-declaration body (following argument list). */
25724 static void
25726 tree parameter_list,
25728 {
25732 /* We just processed one more parameter list. */
25735 /* Get the deferred access checks from the parameter list. These
25736 will be checked once we know what is being declared, as for a
25737 member template the checks must be performed in the scope of the
25738 class containing the member. */
25741 /* Tentatively parse for a new template parameter list, which can either be
25742 the template keyword or a template introduction. */
25748 else
25749 {
25750 /* There are no access checks when parsing a template, as we do not
25751 know if a specialization will be a friend. */
25755 checks,
25756 member_p,
25761 /* If this is a member template declaration, let the front
25762 end know. */
25764 {
25769 }
25774 }
25775 /* We are done with the current parameter list. */
25780 /* Finish up. */
25783 /* Check the template arguments for a literal operator template. */
25787 {
25791 else
25792 {
25795 {
25801 }
25803 {
25812 }
25813 else
25815 }
25817 {
25820 " Expected non-type template argument pack <char...>"
25822 decl);
25823 else
25826 decl);
25827 }
25828 }
25830 /* Register member declarations. */
25833 /* If DECL is a function template, we must return to parse it later.
25834 (Even though there is no definition, there might be default
25835 arguments that need handling.) */
25839 }
25841 /* Parse a template introduction header for a template-declaration. Returns
25842 false if tentative parse fails. */
25844 static bool
25846 {
25853 /* Look for the optional `::' operator. */
25856 /* Look for the nested-name-specifier. */
25866 /* Look up the concept for which we will be matching
25867 template parameters. */
25877 /* Look for opening brace for introduction. */
25885 /* Build vector of placeholder parameters and grab
25886 matching identifiers. */
25889 /* The introduction-list shall not be empty. */
25892 {
25895 }
25897 /* Look for closing brace for introduction. */
25902 {
25906 }
25908 /* Build and associate the constraint. */
25911 {
25913 member_p);
25915 }
25919 }
25921 /* Parse a normal template-declaration following the template keyword. */
25923 static void
25925 {
25926 tree parameter_list;
25930 /* Look for the `<' token. */
25934 {
25935 /* 14.5.2.2 [temp.mem]
25937 A local class shall not have member templates. */
25942 }
25943 /* [temp]
25945 A template ... shall not have C linkage. */
25947 {
25949 /* Give it C++ linkage to avoid confusing other parts of the
25950 front end. */
25953 }
25954 else
25957 /* We cannot perform access checks on the template parameter
25958 declarations until we know what is being declared, just as we
25959 cannot check the decl-specifier list. */
25962 /* If the next token is `>', then we have an invalid
25963 specialization. Rather than complain about an invalid template
25964 parameter, issue an error message here. */
25966 {
25970 }
25971 else
25972 {
25973 /* Parse the template parameters. */
25975 }
25977 /* Look for the `>'. */
25980 /* Manage template requirements */
25982 {
25987 }
25990 member_p);
25992 /* For the erroneous case of a template with C linkage, we pushed an
25993 implicit C++ linkage scope; exit that scope now. */
25996 }
25998 /* Parse a template-declaration, assuming that the `export' (and
25999 `extern') keywords, if present, has already been scanned. MEMBER_P
26000 is as for cp_parser_template_declaration. */
26002 static bool
26004 {
26006 {
26010 }
26015 }
26017 /* Perform the deferred access checks from a template-parameter-list.
26018 CHECKS is a TREE_LIST of access checks, as returned by
26019 get_deferred_access_checks. */
26021 static void
26022 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26023 {
26027 }
26029 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26030 `function-definition' sequence that follows a template header.
26031 If MEMBER_P is true, this declaration appears in a class scope.
26033 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26034 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26036 static tree
26042 {
26045 cp_decl_specifier_seq decl_specifiers;
26049 /* This function is only used when processing a template
26050 declaration. */
26054 /* Defer access checks until we know what is being declared. */
26057 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26058 alternative. */
26061 CP_PARSER_FLAGS_OPTIONAL,
26067 /* There are no template typedefs. */
26069 {
26073 }
26075 /* Gather up the access checks that occurred the
26076 decl-specifier-seq. */
26079 /* Check for the declaration of a template class. */
26081 {
26084 {
26085 // If this is a declaration, but not a definition, associate
26086 // any constraints with the type declaration. Constraints
26087 // are associated with definitions in cp_parser_class_specifier.
26093 /* In this case:
26095 struct C {
26096 friend template <typename T> struct A<T>::B;
26097 };
26099 A<T>::B will be represented by a TYPENAME_TYPE, and
26100 therefore not recognized by shadow_tag. */
26102 && !decl
26109 else
26112 /* Perform access checks for template parameters. */
26115 /* Give a helpful diagnostic for
26116 template <class T> struct A { } a;
26117 if we aren't already recovering from an error. */
26120 {
26122 "a class template declaration must not declare "
26126 }
26127 }
26128 }
26130 /* Complain about missing 'typename' or other invalid type names. */
26133 {
26134 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26135 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26136 the rest of this declaration. */
26139 }
26141 /* If it's not a template class, try for a template function. If
26142 the next token is a `;', then this declaration does not declare
26143 anything. But, if there were errors in the decl-specifiers, then
26144 the error might well have come from an attempted class-specifier.
26145 In that case, there's no need to warn about a missing declarator. */
26149 {
26152 checks,
26154 member_p,
26155 declares_class_or_enum,
26159 /* 7.1.1-1 [dcl.stc]
26161 A storage-class-specifier shall not be specified in an explicit
26162 specialization... */
26164 && explicit_specialization_p
26166 {
26170 }
26174 }
26176 /* Look for a trailing `;' after the declaration. */
26182 out:
26185 /* Clear any current qualification; whatever comes next is the start
26186 of something new. */
26192 }
26194 /* Parse a cast-expression that is not the operand of a unary "&". */
26196 static cp_expr
26198 {
26201 }
26203 /* Parse a functional cast to TYPE. Returns an expression
26204 representing the cast. */
26206 static cp_expr
26208 {
26210 tree expression_list;
26211 cp_expr cast;
26220 {
26229 tf_warning_or_error);
26230 /* Create a location of the form:
26231 type_name{i, f}
26232 ^~~~~~~~~~~~~~~
26233 with caret == start at the start of the type name,
26234 finishing at the closing brace. */
26235 location_t finish_loc
26238 finish_loc);
26241 }
26250 else
26251 {
26254 }
26257 tf_warning_or_error);
26258 /* [expr.const]/1: In an integral constant expression "only type
26259 conversions to integral or enumeration type can be used". */
26265 NIC_CONSTRUCTOR))
26268 /* Create a location of the form:
26269 float(i)
26270 ^~~~~~~~
26271 with caret == start at the start of the type name,
26272 finishing at the closing paren. */
26273 location_t finish_loc
26278 }
26280 /* Save the tokens that make up the body of a member function defined
26281 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26282 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26283 specifiers applied to the declaration. Returns the FUNCTION_DECL
26284 for the member function. */
26286 static tree
26290 tree attributes)
26291 {
26294 tree fn;
26297 /* Create the FUNCTION_DECL. */
26301 /* If something went badly wrong, bail out now. */
26303 {
26304 /* If there's a function-body, skip it. */
26309 }
26311 /* Remember it, if there default args to post process. */
26314 /* Save away the tokens that make up the body of the
26315 function. */
26321 RID_TRANSACTION_ATOMIC))
26322 {
26324 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26331 {
26337 }
26338 else
26341 {
26345 }
26346 }
26348 /* Handle function try blocks. */
26350 {
26353 }
26354 /* We can have braced-init-list mem-initializers before the fn body. */
26356 {
26359 {
26360 /* cache_group will stop after an un-nested { } pair, too. */
26364 /* variadic mem-inits have ... after the ')'. */
26367 }
26368 }
26370 /* Handle function try blocks. */
26376 /* Save away the inline definition; we will process it when the
26377 class is complete. */
26381 /* We need to know that this was defined in the class, so that
26382 friend templates are handled correctly. */
26385 /* Add FN to the queue of functions to be parsed later. */
26389 }
26391 /* Save the tokens that make up the in-class initializer for a non-static
26392 data member. Returns a DEFAULT_ARG. */
26394 static tree
26396 {
26398 }
26400 /* Parse a template-argument-list, as well as the trailing ">" (but
26401 not the opening "<"). See cp_parser_template_argument_list for the
26402 return value. */
26404 static tree
26406 {
26407 tree arguments;
26408 tree saved_scope;
26409 tree saved_qualifying_scope;
26410 tree saved_object_scope;
26415 /* [temp.names]
26417 When parsing a template-id, the first non-nested `>' is taken as
26418 the end of the template-argument-list rather than a greater-than
26419 operator. */
26420 saved_greater_than_is_operator_p
26423 /* Parsing the argument list may modify SCOPE, so we save it
26424 here. */
26428 /* We need to evaluate the template arguments, even though this
26429 template-id may be nested within a "sizeof". */
26434 /* Parse the template-argument-list itself. */
26438 else
26440 /* Look for the `>' that ends the template-argument-list. If we find
26441 a '>>' instead, it's probably just a typo. */
26443 {
26445 {
26446 /* In C++0x, a `>>' in a template argument list or cast
26447 expression is considered to be two separate `>'
26448 tokens. So, change the current token to a `>', but don't
26449 consume it: it will be consumed later when the outer
26450 template argument list (or cast expression) is parsed.
26451 Note that this replacement of `>' for `>>' is necessary
26452 even if we are parsing tentatively: in the tentative
26453 case, after calling
26454 cp_parser_enclosed_template_argument_list we will always
26455 throw away all of the template arguments and the first
26456 closing `>', either because the template argument list
26457 was erroneous or because we are replacing those tokens
26458 with a CPP_TEMPLATE_ID token. The second `>' (which will
26459 not have been thrown away) is needed either to close an
26460 outer template argument list or to complete a new-style
26461 cast. */
26464 }
26466 {
26467 /* If we're in a nested template argument list, the '>>' has
26468 to be a typo for '> >'. We emit the error message, but we
26469 continue parsing and we push a '>' as next token, so that
26470 the argument list will be parsed correctly. Note that the
26471 global source location is still on the token before the
26472 '>>', so we need to say explicitly where we want it. */
26480 }
26481 else
26482 {
26483 /* If this is not a nested template argument list, the '>>'
26484 is a typo for '>'. Emit an error message and continue.
26485 Same deal about the token location, but here we can get it
26486 right by consuming the '>>' before issuing the diagnostic. */
26489 "spurious %<>>%>, use %<>%> to terminate "
26491 }
26492 }
26493 else
26495 /* The `>' token might be a greater-than operator again now. */
26496 parser->greater_than_is_operator_p
26498 /* Restore the SAVED_SCOPE. */
26506 }
26508 /* MEMBER_FUNCTION is a member function, or a friend. If default
26509 arguments, or the body of the function have not yet been parsed,
26510 parse them now. */
26512 static void
26514 {
26516 /* If this member is a template, get the underlying
26517 FUNCTION_DECL. */
26521 /* There should not be any class definitions in progress at this
26522 point; the bodies of members are only parsed outside of all class
26523 definitions. */
26525 /* While we're parsing the member functions we might encounter more
26526 classes. We want to handle them right away, but we don't want
26527 them getting mixed up with functions that are currently in the
26528 queue. */
26531 /* Make sure that any template parameters are in scope. */
26534 /* If the body of the function has not yet been parsed, parse it
26535 now. */
26537 {
26538 tree function_scope;
26541 /* The function is no longer pending; we are processing it. */
26546 /* If this is a local class, enter the scope of the containing
26547 function. */
26552 /* Push the body of the function onto the lexer stack. */
26555 /* Let the front end know that we going to be defining this
26556 function. */
26560 /* Don't do access checking if it is a templated function. */
26564 /* #pragma omp declare reduction needs special parsing. */
26566 {
26571 }
26572 else
26573 /* Now, parse the body of the function. */
26580 /* Leave the scope of the containing function. */
26584 }
26586 /* Remove any template parameters from the symbol table. */
26589 /* Restore the queue. */
26592 }
26594 /* If DECL contains any default args, remember it on the unparsed
26595 functions queue. */
26597 static void
26599 {
26600 tree probe;
26603 probe;
26606 {
26610 }
26611 }
26613 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26614 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26615 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26616 from the parameter-type-list. */
26618 static tree
26621 {
26623 tree parsed_arg;
26629 /* Push the saved tokens for the default argument onto the parser's
26630 lexer stack. */
26636 /* Parse the default argument. */
26647 {
26648 /* In a non-template class, check conversions now. In a template,
26649 we'll wait and instantiate these as needed. */
26652 tf_warning_or_error);
26653 else
26655 }
26657 /* If the token stream has not been completely used up, then
26658 there was extra junk after the end of the default
26659 argument. */
26661 {
26664 else
26666 }
26668 /* Revert to the main lexer. */
26672 }
26674 /* FIELD is a non-static data member with an initializer which we saved for
26675 later; parse it now. */
26677 static void
26679 {
26680 tree def;
26687 NULL_TREE);
26693 }
26695 /* FN is a FUNCTION_DECL which may contains a parameter with an
26696 unparsed DEFAULT_ARG. Parse the default args now. This function
26697 assumes that the current scope is the scope in which the default
26698 argument should be processed. */
26700 static void
26702 {
26706 /* While we're parsing the default args, we might (due to the
26707 statement expression extension) encounter more classes. We want
26708 to handle them right away, but we don't want them getting mixed
26709 up with default args that are currently in the queue. */
26712 /* Local variable names (and the `this' keyword) may not appear
26713 in a default argument. */
26724 {
26726 tree parsed_arg;
26728 tree copy;
26735 /* This can happen for a friend declaration for a function
26736 already declared with default arguments. */
26739 parsed_arg
26741 default_arg,
26744 {
26746 }
26750 /* Update any instantiations we've already created. */
26754 }
26758 /* Make sure no default arg is missing. */
26761 /* Restore the state of local_variables_forbidden_p. */
26764 /* Restore the queue. */
26766 }
26768 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26770 sizeof ... ( identifier )
26772 where the 'sizeof' token has already been consumed. */
26774 static tree
26776 {
26777 /* Consume the `...'. */
26784 else
26792 /* The name is not qualified. */
26811 }
26813 /* Parse the operand of `sizeof' (or a similar operator). Returns
26814 either a TYPE or an expression, depending on the form of the
26815 input. The KEYWORD indicates which kind of expression we have
26816 encountered. */
26818 static tree
26820 {
26827 /* If it's a `...', then we are computing the length of a parameter
26828 pack. */
26833 /* Types cannot be defined in a `sizeof' expression. Save away the
26834 old message. */
26836 /* And create the new one. */
26842 /* The restrictions on constant-expressions do not apply inside
26843 sizeof expressions. */
26844 saved_integral_constant_expression_p
26846 saved_non_integral_constant_expression_p
26850 /* Do not actually evaluate the expression. */
26853 /* If it's a `(', then we might be looking at the type-id
26854 construction. */
26856 {
26859 /* We can't be sure yet whether we're looking at a type-id or an
26860 expression. */
26862 /* Note: as a GNU Extension, compound literals are considered
26863 postfix-expressions as they are in C99, so they are valid
26864 arguments to sizeof. See comment in cp_parser_cast_expression
26865 for details. */
26868 else
26869 {
26872 /* Look for the type-id. */
26874 /* Look for the closing `)'. */
26877 }
26879 /* If all went well, then we're done. */
26881 {
26882 cp_decl_specifier_seq decl_specs;
26884 /* Build a trivial decl-specifier-seq. */
26888 /* Call grokdeclarator to figure out what type this is. */
26891 TYPENAME,
26894 }
26895 }
26897 /* If the type-id production did not work out, then we must be
26898 looking at the unary-expression production. */
26902 /* Go back to evaluating expressions. */
26906 /* Free the message we created. */
26908 /* And restore the old one. */
26910 parser->integral_constant_expression_p
26912 parser->non_integral_constant_expression_p
26916 }
26918 /* If the current declaration has no declarator, return true. */
26920 static bool
26922 {
26923 /* If the next token is a `;' or a `,' then there is no
26924 declarator. */
26927 }
26929 /* Update the DECL_SPECS to reflect the storage class indicated by
26930 KEYWORD. */
26932 static void
26937 {
26938 cp_storage_class storage_class;
26941 {
26945 }
26947 {
26950 }
26955 {
26958 }
26961 {
26979 }
26983 /* A storage class specifier cannot be applied alongside a typedef
26984 specifier. If there is a typedef specifier present then set
26985 conflicting_specifiers_p which will trigger an error later
26986 on in grokdeclarator. */
26989 }
26991 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26992 is true, the type is a class or enum definition. */
26994 static void
26996 tree type_spec,
26999 {
27002 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27003 (with, for example, in "typedef int wchar_t;") we remember that
27004 this is what happened. In system headers, we ignore these
27005 declarations so that G++ can work with system headers that are not
27006 C++-safe. */
27008 && !type_definition_p
27018 {
27021 ds_redefined_builtin_type_spec,
27022 token);
27024 {
27028 }
27029 }
27032 else
27033 {
27038 }
27039 }
27041 /* True iff TOKEN is the GNU keyword __thread. */
27043 static bool
27045 {
27048 }
27050 /* Set the location for a declarator specifier and check if it is
27051 duplicated.
27053 DECL_SPECS is the sequence of declarator specifiers onto which to
27054 set the location.
27056 DS is the single declarator specifier to set which location is to
27057 be set onto the existing sequence of declarators.
27059 LOCATION is the location for the declarator specifier to
27060 consider. */
27062 static void
27065 {
27074 {
27078 }
27079 else
27080 {
27082 {
27086 else
27087 {
27090 OPT_Wlong_long,
27092 }
27093 }
27095 {
27100 else
27102 }
27103 else
27104 {
27120 "__complex"
27121 };
27124 }
27125 }
27126 }
27128 /* Return true iff the declarator specifier DS is present in the
27129 sequence of declarator specifiers DECL_SPECS. */
27131 bool
27133 cp_decl_spec ds)
27134 {
27141 }
27143 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27144 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27146 static bool
27148 {
27150 }
27152 /* Issue an error message indicating that TOKEN_DESC was expected.
27153 If KEYWORD is true, it indicated this function is called by
27154 cp_parser_require_keword and the required token can only be
27155 a indicated keyword. */
27157 static void
27159 required_token token_desc,
27161 {
27163 {
27232 }
27234 {
27236 {
27315 }
27316 }
27317 else
27319 }
27323 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27324 issue an error message indicating that TOKEN_DESC was expected.
27326 Returns the token consumed, if the token had the appropriate type.
27327 Otherwise, returns NULL. */
27332 required_token token_desc)
27333 {
27336 else
27337 {
27338 /* Output the MESSAGE -- unless we're parsing tentatively. */
27342 }
27343 }
27345 /* An error message is produced if the next token is not '>'.
27346 All further tokens are skipped until the desired token is
27347 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27349 static void
27351 {
27352 /* Current level of '< ... >'. */
27354 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27357 /* Are we ready, yet? If not, issue error message. */
27361 /* Skip tokens until the desired token is found. */
27363 {
27364 /* Peek at the next token. */
27366 {
27374 /* C++0x views the `>>' operator as two `>' tokens, but
27375 C++98 does not. */
27378 {
27379 /* We've hit a `>>' where the first `>' closes the
27380 template argument list, and the second `>' is
27381 spurious. Just consume the `>>' and stop; we've
27382 already produced at least one error. */
27385 }
27386 /* Fall through for C++0x, so we handle the second `>' in
27387 the `>>'. */
27392 {
27393 /* We've reached the token we want, consume it and stop. */
27396 }
27415 /* The '>' was probably forgotten, don't look further. */
27420 }
27422 /* Consume this token. */
27424 }
27425 }
27427 /* If the next token is the indicated keyword, consume it. Otherwise,
27428 issue an error message indicating that TOKEN_DESC was expected.
27430 Returns the token consumed, if the token had the appropriate type.
27431 Otherwise, returns NULL. */
27436 required_token token_desc)
27437 {
27441 {
27444 }
27447 }
27449 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27450 function-definition. */
27452 static bool
27454 {
27457 /* A ctor-initializer begins with a `:'. */
27459 /* A function-try-block begins with `try'. */
27461 /* A function-transaction-block begins with `__transaction_atomic'
27462 or `__transaction_relaxed'. */
27465 /* The named return value extension begins with `return'. */
27467 }
27469 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27470 definition. */
27472 static bool
27474 {
27481 }
27483 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27484 C++0x) ending a template-argument. */
27486 static bool
27488 {
27496 }
27498 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27499 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27501 static bool
27504 {
27510 /* Check for the sequence `<::' in the original code. It would be lexed as
27511 `[:', where `[' is a digraph, and there is no whitespace before
27512 `:'. */
27514 {
27519 }
27521 }
27523 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27524 or none_type otherwise. */
27526 static enum tag_types
27528 {
27530 {
27540 }
27541 }
27543 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27544 or none_type otherwise or if the token is null. */
27546 static enum tag_types
27548 {
27553 {
27561 }
27562 }
27564 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27566 static void
27568 {
27572 {
27576 type))
27579 }
27580 }
27582 /* Issue an error message if DECL is redeclared with different
27583 access than its original declaration [class.access.spec/3].
27584 This applies to nested classes, nested class templates and
27585 enumerations [class.mem/1]. */
27587 static void
27589 {
27600 }
27602 /* Look for the `template' keyword, as a syntactic disambiguator.
27603 Return TRUE iff it is present, in which case it will be
27604 consumed. */
27606 static bool
27608 {
27610 {
27611 /* In C++98 the `template' keyword can only be used within templates;
27612 outside templates the parser can always figure out what is a
27613 template and what is not. In C++11, per the resolution of DR 468,
27614 `template' is allowed in cases where it is not strictly necessary. */
27617 {
27620 "in C++98 %<template%> (as a disambiguator) is only "
27622 /* If this part of the token stream is rescanned, the same
27623 error message would be generated. So, we purge the token
27624 from the stream. */
27627 }
27628 else
27629 {
27630 /* Consume the `template' keyword. */
27633 }
27634 }
27636 }
27638 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27639 set PARSER->SCOPE, and perform other related actions. */
27641 static void
27643 {
27646 /* Get the stored value. */
27648 /* Set the scope from the stored value. */
27652 }
27654 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27655 encounter the end of a block before what we were looking for. */
27657 static bool
27661 {
27663 {
27666 /* Abort a parenthesized expression if we encounter a semicolon. */
27670 /* If we've reached the end of the file, stop. */
27676 /* We've hit the end of an enclosing block, so there's been some
27677 kind of syntax error. */
27680 /* Consume the token. */
27682 /* See if it starts a new group. */
27684 {
27686 /* In theory this should probably check end == '}', but
27687 cp_parser_save_member_function_body needs it to exit
27688 after either '}' or ')' when called with ')'. */
27691 }
27693 {
27697 }
27702 }
27703 }
27705 /* Like above, for caching a default argument or NSDMI. Both of these are
27706 terminated by a non-nested comma, but it can be unclear whether or not a
27707 comma is nested in a template argument list unless we do more parsing.
27708 In order to handle this ambiguity, when we encounter a ',' after a '<'
27709 we try to parse what follows as a parameter-declaration-list (in the
27710 case of a default argument) or a member-declarator (in the case of an
27711 NSDMI). If that succeeds, then we stop caching. */
27713 static tree
27715 {
27720 tree default_argument;
27722 /* Add tokens until we have processed the entire default
27723 argument. We add the range [first_token, token). */
27726 {
27727 /* For list-initialization, this is straightforward. */
27730 }
27732 {
27735 /* Peek at the next token. */
27737 /* What we do depends on what token we have. */
27739 {
27740 /* In valid code, a default argument must be
27741 immediately followed by a `,' `)', or `...'. */
27744 {
27745 /* If we've seen a '<', we might be in a
27746 template-argument-list. Until Core issue 325 is
27747 resolved, we don't know how this situation ought
27748 to be handled, so try to DTRT. We check whether
27749 what comes after the comma is a valid parameter
27750 declaration list. If it is, then the comma ends
27751 the default argument; otherwise the default
27752 argument continues. */
27756 /* Set ITALP so cp_parser_parameter_declaration_list
27757 doesn't decide to commit to this parse. */
27764 {
27765 /* Parse declarators until we reach a non-comma or
27766 somthing that cannot be an initializer.
27767 Just checking whether we're looking at a single
27768 declarator is insufficient. Consider:
27769 int var = tuple<T,U>::x;
27770 The template parameter 'U' looks exactly like a
27771 declarator. */
27772 do
27773 {
27784 }
27786 /* If we met an '=' or ';' then the original comma
27787 was the end of the NSDMI. Otherwise assume
27788 we're still in the NSDMI. */
27791 }
27792 else
27793 {
27798 }
27805 }
27806 /* XXX Really fallthru? */
27807 /* FALLTHRU */
27810 /* If we run into a non-nested `;', `}', or `]',
27811 then the code is invalid -- but the default
27812 argument is certainly over. */
27817 /* Handle correctly int n = sizeof ... ( p ); */
27820 /* Update DEPTH, if necessary. */
27835 /* This might be the comparison operator, or it might
27836 start a template argument list. */
27843 /* Fall through for C++0x, which treats the `>>'
27844 operator like two `>' tokens in certain
27845 cases. */
27850 {
27851 /* This might be an operator, or it might close a
27852 template argument list. But if a previous '<'
27853 started a template argument list, this will have
27854 closed it, so we can't be in one anymore. */
27858 }
27861 /* If we run out of tokens, issue an error message. */
27869 /* In these cases, we should look for template-ids.
27870 For example, if the default argument is
27871 `X<int, double>()', we need to do name lookup to
27872 figure out whether or not `X' is a template; if
27873 so, the `,' does not end the default argument.
27875 That is not yet done. */
27880 }
27882 /* If we've reached the end, stop. */
27886 /* Add the token to the token block. */
27888 }
27890 /* Create a DEFAULT_ARG to represent the unparsed default
27891 argument. */
27898 }
27900 /* Begin parsing tentatively. We always save tokens while parsing
27901 tentatively so that if the tentative parsing fails we can restore the
27902 tokens. */
27904 static void
27906 {
27907 /* Enter a new parsing context. */
27909 /* Begin saving tokens. */
27911 /* In order to avoid repetitive access control error messages,
27912 access checks are queued up until we are no longer parsing
27913 tentatively. */
27915 }
27917 /* Commit to the currently active tentative parse. */
27919 static void
27921 {
27925 /* Mark all of the levels as committed. */
27928 {
27935 }
27936 }
27938 /* Commit to the topmost currently active tentative parse.
27940 Note that this function shouldn't be called when there are
27941 irreversible side-effects while in a tentative state. For
27942 example, we shouldn't create a permanent entry in the symbol
27943 table, or issue an error message that might not apply if the
27944 tentative parse is aborted. */
27946 static void
27948 {
27953 {
27961 }
27962 }
27964 /* Abort the currently active tentative parse. All consumed tokens
27965 will be rolled back, and no diagnostics will be issued. */
27967 static void
27969 {
27973 /* Now, pretend that we want to see if the construct was
27974 successfully parsed. */
27976 }
27978 /* Stop parsing tentatively. If a parse error has occurred, restore the
27979 token stream. Otherwise, commit to the tokens we have consumed.
27980 Returns true if no error occurred; false otherwise. */
27982 static bool
27984 {
27988 /* Remember whether or not an error occurred, since we are about to
27989 destroy that information. */
27991 /* Remove the topmost context from the stack. */
27994 /* If no parse errors occurred, commit to the tentative parse. */
27996 {
27997 /* Commit to the tokens read tentatively, unless that was
27998 already done. */
28003 }
28004 /* Otherwise, if errors occurred, roll back our state so that things
28005 are just as they were before we began the tentative parse. */
28006 else
28007 {
28010 }
28011 /* Add the context to the front of the free list. */
28016 }
28018 /* Returns true if we are parsing tentatively and are not committed to
28019 this tentative parse. */
28021 static bool
28023 {
28026 }
28028 /* Returns nonzero iff an error has occurred during the most recent
28029 tentative parse. */
28031 static bool
28033 {
28036 }
28038 /* Returns nonzero if GNU extensions are allowed. */
28040 static bool
28042 {
28044 }
28045 \f
28046 /* Objective-C++ Productions */
28049 /* Parse an Objective-C expression, which feeds into a primary-expression
28050 above.
28052 objc-expression:
28053 objc-message-expression
28054 objc-string-literal
28055 objc-encode-expression
28056 objc-protocol-expression
28057 objc-selector-expression
28059 Returns a tree representation of the expression. */
28061 static cp_expr
28063 {
28064 /* Try to figure out what kind of declaration is present. */
28068 {
28078 {
28090 }
28096 }
28099 }
28101 /* Parse an Objective-C message expression.
28103 objc-message-expression:
28104 [ objc-message-receiver objc-message-args ]
28106 Returns a representation of an Objective-C message. */
28108 static tree
28110 {
28122 /* Construct a location e.g.
28123 [self func1:5]
28124 ^~~~~~~~~~~~~~
28125 ranging from the '[' to the ']', with the caret at the start. */
28130 }
28132 /* Parse an objc-message-receiver.
28134 objc-message-receiver:
28135 expression
28136 simple-type-specifier
28138 Returns a representation of the type or expression. */
28140 static tree
28142 {
28143 tree rcv;
28145 /* An Objective-C message receiver may be either (1) a type
28146 or (2) an expression. */
28150 /* If that worked out, fine. */
28157 CP_PARSER_FLAGS_NONE);
28164 }
28166 /* Parse the arguments and selectors comprising an Objective-C message.
28168 objc-message-args:
28169 objc-selector
28170 objc-selector-args
28171 objc-selector-args , objc-comma-args
28173 objc-selector-args:
28174 objc-selector [opt] : assignment-expression
28175 objc-selector-args objc-selector [opt] : assignment-expression
28177 objc-comma-args:
28178 assignment-expression
28179 objc-comma-args , assignment-expression
28181 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28182 selector arguments and TREE_VALUE containing a list of comma
28183 arguments. */
28185 static tree
28187 {
28193 {
28199 /* Detect if we have a unary selector. */
28208 sel_args
28213 }
28215 /* Handle non-selector arguments, if any. */
28217 {
28218 tree arg;
28223 addl_args
28228 }
28231 {
28234 }
28237 }
28239 /* Parse an Objective-C encode expression.
28241 objc-encode-expression:
28242 @encode objc-typename
28244 Returns an encoded representation of the type argument. */
28246 static cp_expr
28248 {
28249 tree type;
28260 {
28264 }
28266 /* This happens if we find @encode(T) (where T is a template
28267 typename or something dependent on a template typename) when
28268 parsing a template. In that case, we can't compile it
28269 immediately, but we rather create an AT_ENCODE_EXPR which will
28270 need to be instantiated when the template is used.
28271 */
28273 {
28277 }
28280 /* Build a location of the form:
28281 @encode(int)
28282 ^~~~~~~~~~~~
28283 with caret==start at the @ token, finishing at the close paren. */
28284 location_t combined_loc
28289 }
28291 /* Parse an Objective-C @defs expression. */
28293 static tree
28295 {
28296 tree name;
28304 }
28306 /* Parse an Objective-C protocol expression.
28308 objc-protocol-expression:
28309 @protocol ( identifier )
28311 Returns a representation of the protocol expression. */
28313 static tree
28315 {
28316 tree proto;
28324 /* Build a location of the form:
28325 @protocol(prot)
28326 ^~~~~~~~~~~~~~~
28327 with caret==start at the @ token, finishing at the close paren. */
28328 location_t combined_loc
28334 }
28336 /* Parse an Objective-C selector expression.
28338 objc-selector-expression:
28339 @selector ( objc-method-signature )
28341 objc-method-signature:
28342 objc-selector
28343 objc-selector-seq
28345 objc-selector-seq:
28346 objc-selector :
28347 objc-selector-seq objc-selector :
28349 Returns a representation of the method selector. */
28351 static tree
28353 {
28365 {
28374 {
28375 /* Detect if we have a unary selector. */
28377 {
28380 }
28381 else
28382 {
28384 }
28385 }
28390 {
28391 sel_seq
28394 sel_seq
28397 }
28398 else
28399 sel_seq
28404 }
28406 finish_selector:
28410 /* Build a location of the form:
28411 @selector(func)
28412 ^~~~~~~~~~~~~~~
28413 with caret==start at the @ token, finishing at the close paren. */
28414 location_t combined_loc
28418 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28421 }
28423 /* Parse a list of identifiers.
28425 objc-identifier-list:
28426 identifier
28427 objc-identifier-list , identifier
28429 Returns a TREE_LIST of identifier nodes. */
28431 static tree
28433 {
28434 tree identifier;
28435 tree list;
28446 {
28453 identifier));
28455 }
28458 }
28460 /* Parse an Objective-C alias declaration.
28462 objc-alias-declaration:
28463 @compatibility_alias identifier identifier ;
28465 This function registers the alias mapping with the Objective-C front end.
28466 It returns nothing. */
28468 static void
28470 {
28478 }
28480 /* Parse an Objective-C class forward-declaration.
28482 objc-class-declaration:
28483 @class objc-identifier-list ;
28485 The function registers the forward declarations with the Objective-C
28486 front end. It returns nothing. */
28488 static void
28490 {
28493 {
28494 tree id;
28504 else
28506 }
28508 }
28510 /* Parse a list of Objective-C protocol references.
28512 objc-protocol-refs-opt:
28513 objc-protocol-refs [opt]
28515 objc-protocol-refs:
28516 < objc-identifier-list >
28518 Returns a TREE_LIST of identifiers, if any. */
28520 static tree
28522 {
28526 {
28530 }
28533 }
28535 /* Parse a Objective-C visibility specification. */
28537 static void
28539 {
28543 {
28558 }
28560 /* Eat '@private'/'@protected'/'@public'. */
28562 }
28564 /* Parse an Objective-C method type. Return 'true' if it is a class
28565 (+) method, and 'false' if it is an instance (-) method. */
28569 {
28572 else
28574 }
28576 /* Parse an Objective-C protocol qualifier. */
28578 static tree
28580 {
28593 {
28598 }
28601 }
28603 /* Parse an Objective-C typename. */
28605 static tree
28607 {
28611 {
28617 /* An ObjC type name may consist of just protocol qualifiers, in which
28618 case the type shall default to 'id'. */
28620 {
28623 /* If the type could not be parsed, an error has already
28624 been produced. For error recovery, behave as if it had
28625 not been specified, which will use the default type
28626 'id'. */
28628 {
28630 /* We need to skip to the closing parenthesis as
28631 cp_parser_type_id() does not seem to do it for
28632 us. */
28637 }
28638 }
28642 }
28645 }
28647 /* Check to see if TYPE refers to an Objective-C selector name. */
28649 static bool
28651 {
28657 }
28659 /* Parse an Objective-C selector. */
28661 static tree
28663 {
28667 {
28670 }
28672 /* C++ operator names are allowed to appear in ObjC selectors. */
28674 {
28687 }
28688 }
28690 /* Parse an Objective-C params list. */
28692 static tree
28694 {
28700 {
28710 /* Detect if we have a unary selector. */
28713 {
28716 }
28720 {
28721 /* Something went quite wrong. There should be a colon
28722 here, but there is not. Stop parsing parameters. */
28724 }
28726 /* New ObjC allows attributes on parameters too. */
28731 params
28734 type_name,
28735 identifier,
28736 parm_attr));
28739 }
28742 {
28745 }
28747 /* We allow tail attributes for the method. */
28749 {
28757 }
28760 {
28763 }
28765 }
28767 /* Parse the non-keyword Objective-C params. */
28769 static tree
28772 {
28778 {
28780 tree parm;
28786 {
28791 }
28793 /* TODO: parse attributes for tail parameters. */
28802 }
28804 /* We allow tail attributes for the method. */
28806 {
28808 {
28813 }
28814 else
28815 /* We have an error, but parse the attributes, so that we can
28816 carry on. */
28822 }
28825 }
28827 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28829 static void
28831 {
28834 /* If the next token is `extern' and the following token is a string
28835 literal, then we have a linkage specification. */
28837 && cp_parser_is_pure_string_literal
28840 /* Handle #pragma, if any. */
28843 /* Allow stray semicolons. */
28846 /* Mark methods as optional or required, when building protocols. */
28848 {
28851 }
28853 {
28856 }
28859 /* Other stray characters must generate errors. */
28861 {
28865 }
28866 /* Finally, try to parse a block-declaration, or a function-definition. */
28867 else
28869 }
28871 /* Parse a method signature. */
28873 static tree
28875 {
28891 }
28893 static bool
28895 {
28896 tree tattr;
28901 /* If the attributes are followed by a method introducer, this is not allowed.
28902 Dump the attributes and flag the situation. */
28907 /* Otherwise, the attributes introduce some interstitial code, possibly so
28908 rewind to allow that check. */
28911 }
28913 /* Parse an Objective-C method prototype list. */
28915 static void
28917 {
28921 {
28923 {
28928 else
28932 {
28936 }
28939 }
28945 OPT_Wattributes,
28947 else
28948 /* Allow for interspersed non-ObjC++ code. */
28952 }
28956 else
28960 }
28962 /* Parse an Objective-C method definition list. */
28964 static void
28966 {
28970 {
28971 tree meth;
28974 {
28980 else
28985 {
28989 }
28991 NULL_TREE);
28993 /* For historical reasons, we accept an optional semicolon. */
29000 {
29007 }
29008 }
29009 /* The following case will be removed once @synthesize is
29010 completely implemented. */
29021 else
29022 /* Allow for interspersed non-ObjC++ code. */
29026 }
29030 else
29034 }
29036 /* Parse Objective-C ivars. */
29038 static void
29040 {
29051 {
29052 cp_decl_specifier_seq declspecs;
29054 tree prefix_attributes;
29062 CP_PARSER_FLAGS_OPTIONAL,
29066 /* auto, register, static, extern, mutable. */
29068 {
29071 }
29073 /* thread_local. */
29075 {
29078 }
29080 /* typedef. */
29082 {
29085 }
29090 /* Keep going until we hit the `;' at the end of the
29091 declaration. */
29093 {
29098 /* Check for a (possibly unnamed) bitfield declaration. */
29106 {
29107 /* Get the name of the bitfield. */
29110 sfk_none);
29112 eat_colon:
29114 /* Get the width of the bitfield. */
29115 width
29117 }
29118 else
29119 {
29120 /* Parse the declarator. */
29121 declarator
29127 }
29129 /* Look for attributes that apply to the ivar. */
29131 /* Remember which attributes are prefix attributes and
29132 which are not. */
29134 /* Combine the attributes. */
29138 /* Create the bitfield declaration. */
29140 width,
29141 attributes);
29142 else
29147 /* Add the instance variable. */
29151 /* Reset PREFIX_ATTRIBUTES. */
29160 {
29163 }
29165 }
29169 }
29174 /* Do not consume the RID_AT_END, so it will be read again as terminating
29175 the @interface of @implementation. */
29179 /* For historical reasons, we accept an optional semicolon. */
29182 }
29184 /* Parse an Objective-C protocol declaration. */
29186 static void
29188 {
29194 {
29199 }
29201 /* See if we have a forward declaration or a definition. */
29204 /* Try a forward declaration first. */
29206 {
29208 {
29209 tree id;
29219 else
29221 }
29223 }
29225 /* Ok, we got a full-fledged definition (or at least should). */
29226 else
29227 {
29232 }
29233 }
29235 /* Parse an Objective-C superclass or category. */
29237 static void
29242 {
29248 {
29251 }
29253 {
29256 /* If there is no category name, and this is an @interface, we
29257 have a class extension. */
29259 {
29262 }
29263 else
29267 }
29268 }
29270 /* Parse an Objective-C class interface. */
29272 static void
29274 {
29281 {
29282 /* It's hard to recover because even if valid @interface stuff
29283 is to follow, we can't compile it (or validate it) if we
29284 don't even know which class it refers to. Let's assume this
29285 was a stray '@interface' token in the stream and skip it.
29286 */
29288 }
29293 /* We have either a class or a category on our hands. */
29296 else
29297 {
29299 /* Handle instance variable declarations, if any. */
29302 }
29305 }
29307 /* Parse an Objective-C class implementation. */
29309 static void
29311 {
29318 {
29319 /* It's hard to recover because even if valid @implementation
29320 stuff is to follow, we can't compile it (or validate it) if
29321 we don't even know which class it refers to. Let's assume
29322 this was a stray '@implementation' token in the stream and
29323 skip it.
29324 */
29326 }
29330 /* We have either a class or a category on our hands. */
29333 else
29334 {
29336 /* Handle instance variable declarations, if any. */
29339 }
29342 }
29344 /* Consume the @end token and finish off the implementation. */
29346 static void
29348 {
29351 }
29353 /* Parse an Objective-C declaration. */
29355 static void
29357 {
29358 /* Try to figure out what kind of declaration is present. */
29363 {
29379 }
29382 {
29405 }
29406 }
29408 /* Parse an Objective-C try-catch-finally statement.
29410 objc-try-catch-finally-stmt:
29411 @try compound-statement objc-catch-clause-seq [opt]
29412 objc-finally-clause [opt]
29414 objc-catch-clause-seq:
29415 objc-catch-clause objc-catch-clause-seq [opt]
29417 objc-catch-clause:
29418 @catch ( objc-exception-declaration ) compound-statement
29420 objc-finally-clause:
29421 @finally compound-statement
29423 objc-exception-declaration:
29424 parameter-declaration
29425 '...'
29427 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29429 Returns NULL_TREE.
29431 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29432 for C. Keep them in sync. */
29434 static tree
29436 {
29437 location_t location;
29438 tree stmt;
29443 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29444 node, lest it get absorbed into the surrounding block. */
29450 {
29459 {
29460 /* We have "@catch (...)" (where the '...' are literally
29461 what is in the code). Skip the '...'.
29462 parameter_declaration is set to NULL_TREE, and
29463 objc_being_catch_clauses() knows that that means
29464 '...'. */
29467 }
29468 else
29469 {
29470 /* We have "@catch (NSException *exception)" or something
29471 like that. Parse the parameter declaration. */
29475 else
29480 }
29483 else
29484 {
29485 /* If there was no open parenthesis, we are recovering from
29486 an error, and we are trying to figure out what mistake
29487 the user has made. */
29489 /* If there is an immediate closing parenthesis, the user
29490 probably forgot the opening one (ie, they typed "@catch
29491 NSException *e)". Parse the closing parenthesis and keep
29492 going. */
29496 /* If these is no immediate closing parenthesis, the user
29497 probably doesn't know that parenthesis are required at
29498 all (ie, they typed "@catch NSException *e"). So, just
29499 forget about the closing parenthesis and keep going. */
29500 }
29504 }
29506 {
29509 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29510 node, lest it get absorbed into the surrounding block. */
29514 }
29517 }
29519 /* Parse an Objective-C synchronized statement.
29521 objc-synchronized-stmt:
29522 @synchronized ( expression ) compound-statement
29524 Returns NULL_TREE. */
29526 static tree
29528 {
29529 location_t location;
29540 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29541 node, lest it get absorbed into the surrounding block. */
29546 }
29548 /* Parse an Objective-C throw statement.
29550 objc-throw-stmt:
29551 @throw assignment-expression [opt] ;
29553 Returns a constructed '@throw' statement. */
29555 static tree
29557 {
29569 }
29571 /* Parse an Objective-C statement. */
29573 static tree
29575 {
29576 /* Try to figure out what kind of declaration is present. */
29580 {
29591 }
29594 }
29596 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29597 look ahead to see if an objc keyword follows the attributes. This
29598 is to detect the use of prefix attributes on ObjC @interface and
29599 @protocol. */
29601 static bool
29603 {
29608 {
29611 }
29614 }
29616 /* This routine is a minimal replacement for
29617 c_parser_struct_declaration () used when parsing the list of
29618 types/names or ObjC++ properties. For example, when parsing the
29619 code
29621 @property (readonly) int a, b, c;
29623 this function is responsible for parsing "int a, int b, int c" and
29624 returning the declarations as CHAIN of DECLs.
29626 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29627 similar parsing. */
29628 static tree
29630 {
29632 cp_decl_specifier_seq declspecs;
29634 tree prefix_attributes;
29637 CP_PARSER_FLAGS_NONE,
29644 /* auto, register, static, extern, mutable. */
29646 {
29649 }
29651 /* thread_local. */
29653 {
29656 }
29658 /* typedef. */
29660 {
29663 }
29668 /* Keep going until we hit the `;' at the end of the declaration. */
29670 {
29675 /* Parse the declarator. */
29679 /* Look for attributes that apply to the ivar. */
29681 /* Remember which attributes are prefix attributes and
29682 which are not. */
29684 /* Combine the attributes. */
29694 /* Reset PREFIX_ATTRIBUTES. */
29705 {
29708 }
29709 else
29711 }
29713 }
29715 /* Parse an Objective-C @property declaration. The syntax is:
29717 objc-property-declaration:
29718 '@property' objc-property-attributes[opt] struct-declaration ;
29720 objc-property-attributes:
29721 '(' objc-property-attribute-list ')'
29723 objc-property-attribute-list:
29724 objc-property-attribute
29725 objc-property-attribute-list, objc-property-attribute
29727 objc-property-attribute
29728 'getter' = identifier
29729 'setter' = identifier
29730 'readonly'
29731 'readwrite'
29732 'assign'
29733 'retain'
29734 'copy'
29735 'nonatomic'
29737 For example:
29738 @property NSString *name;
29739 @property (readonly) id object;
29740 @property (retain, nonatomic, getter=getTheName) id name;
29741 @property int a, b, c;
29743 PS: This function is identical to
29744 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29745 static void
29747 {
29748 /* The following variables hold the attributes of the properties as
29749 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29750 seen. When we see an attribute, we set them to 'true' (if they
29751 are boolean properties) or to the identifier (if they have an
29752 argument, ie, for getter and setter). Note that here we only
29753 parse the list of attributes, check the syntax and accumulate the
29754 attributes that we find. objc_add_property_declaration() will
29755 then process the information. */
29765 /* 'properties' is the list of properties that we read. Usually a
29766 single one, but maybe more (eg, in "@property int a, b, c;" there
29767 are three). */
29768 tree properties;
29769 location_t loc;
29775 /* Parse the optional attribute list... */
29777 {
29778 /* Eat the '('. */
29782 {
29788 {
29791 }
29795 {
29806 {
29810 else
29815 }
29818 {
29822 }
29824 {
29826 {
29829 }
29830 else
29834 else
29836 }
29837 else
29838 {
29840 {
29843 }
29844 else
29846 }
29852 }
29859 else
29861 }
29863 /* FIXME: "@property (setter, assign);" will generate a spurious
29864 "error: expected ‘)’ before ‘,’ token". This is because
29865 cp_parser_require, unlike the C counterpart, will produce an
29866 error even if we are in error recovery. */
29868 {
29873 }
29874 }
29876 /* ... and the property declaration(s). */
29880 {
29882 /* If the next token is now a `;', consume it. */
29886 }
29890 else
29891 {
29892 /* Comma-separated properties are chained together in
29893 reverse order; add them one by one. */
29902 }
29905 }
29907 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29909 objc-synthesize-declaration:
29910 @synthesize objc-synthesize-identifier-list ;
29912 objc-synthesize-identifier-list:
29913 objc-synthesize-identifier
29914 objc-synthesize-identifier-list, objc-synthesize-identifier
29916 objc-synthesize-identifier
29917 identifier
29918 identifier = identifier
29920 For example:
29921 @synthesize MyProperty;
29922 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29924 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29925 for C. Keep them in sync.
29926 */
29927 static void
29929 {
29931 location_t loc;
29936 {
29940 {
29943 }
29945 {
29949 {
29952 }
29953 }
29954 else
29959 else
29961 }
29964 }
29966 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29968 objc-dynamic-declaration:
29969 @dynamic identifier-list ;
29971 For example:
29972 @dynamic MyProperty;
29973 @dynamic MyProperty, AnotherProperty;
29975 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29976 for C. Keep them in sync.
29977 */
29978 static void
29980 {
29982 location_t loc;
29987 {
29988 tree property;
29991 {
29994 }
29998 else
30000 }
30003 }
30005 \f
30006 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30008 /* Returns name of the next clause.
30009 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30010 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30011 returned and the token is consumed. */
30013 static pragma_omp_clause
30015 {
30031 {
30036 {
30219 }
30220 }
30226 }
30228 /* Validate that a clause of the given type does not already exist. */
30230 static void
30233 {
30234 tree c;
30238 {
30241 }
30242 }
30244 /* OpenMP 2.5:
30245 variable-list:
30246 identifier
30247 variable-list , identifier
30249 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30250 colon). An opening parenthesis will have been consumed by the caller.
30252 If KIND is nonzero, create the appropriate node and install the decl
30253 in OMP_CLAUSE_DECL and add the node to the head of the list.
30255 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30256 return the list created.
30258 COLON can be NULL if only closing parenthesis should end the list,
30259 or pointer to bool which will receive false if the list is terminated
30260 by closing parenthesis or true if the list is terminated by colon. */
30262 static tree
30265 {
30269 {
30272 }
30274 {
30279 && current_class_ptr
30281 {
30287 }
30288 else
30289 {
30302 }
30304 ;
30306 {
30308 {
30310 /* The OpenACC cache directive explicitly only allows "array
30311 elements or subarrays". */
30313 {
30317 }
30318 /* FALLTHROUGH. */
30323 {
30324 location_t loc
30329 decl
30333 }
30334 /* FALLTHROUGH. */
30338 {
30346 parser->colon_corrects_to_scope_p
30350 else
30351 {
30352 /* Look for `:'. */
30356 CPP_CLOSE_SQUARE))
30358 }
30359 /* Look for the closing `]'. */
30361 RT_CLOSE_SQUARE))
30365 }
30369 }
30375 }
30376 else
30379 get_comma:
30383 }
30389 {
30393 }
30396 {
30399 /* Try to resync to an unnested comma. Copied from
30400 cp_parser_parenthesized_expression_list. */
30401 skip_comma:
30410 }
30413 }
30415 /* Similarly, but expect leading and trailing parenthesis. This is a very
30416 common case for omp clauses. */
30418 static tree
30420 {
30424 }
30426 /* OpenACC 2.0:
30427 copy ( variable-list )
30428 copyin ( variable-list )
30429 copyout ( variable-list )
30430 create ( variable-list )
30431 delete ( variable-list )
30432 present ( variable-list )
30433 present_or_copy ( variable-list )
30434 pcopy ( variable-list )
30435 present_or_copyin ( variable-list )
30436 pcopyin ( variable-list )
30437 present_or_copyout ( variable-list )
30438 pcopyout ( variable-list )
30439 present_or_create ( variable-list )
30440 pcreate ( variable-list ) */
30442 static tree
30444 tree list)
30445 {
30448 {
30494 }
30502 }
30504 /* OpenACC 2.0:
30505 deviceptr ( variable-list ) */
30507 static tree
30509 {
30513 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30514 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30515 variable-list must only allow for pointer variables. */
30518 {
30525 }
30528 }
30530 /* OpenACC 2.0:
30531 auto
30532 independent
30533 nohost
30534 seq */
30536 static tree
30540 {
30545 }
30547 /* OpenACC:
30548 num_gangs ( expression )
30549 num_workers ( expression )
30550 vector_length ( expression ) */
30552 static tree
30555 {
30565 {
30570 }
30578 }
30580 /* OpenACC:
30582 gang [( gang-arg-list )]
30583 worker [( [num:] int-expr )]
30584 vector [( [length:] int-expr )]
30586 where gang-arg is one of:
30588 [num:] int-expr
30589 static: size-expr
30591 and size-expr may be:
30593 *
30594 int-expr
30595 */
30597 static tree
30600 {
30610 {
30613 do
30614 {
30618 /* Gang static argument. */
30621 {
30629 {
30632 }
30634 /* Check for the '*' argument. */
30638 CPP_CLOSE_PAREN)))
30639 {
30644 {
30647 }
30649 }
30650 }
30651 /* Worker num: argument and vector length: arguments. */
30655 {
30658 }
30660 /* Now collect the actual argument. */
30662 {
30665 }
30677 {
30680 }
30682 }
30687 }
30701 cleanup_error:
30704 }
30706 /* OpenACC 2.0:
30707 tile ( size-expr-list ) */
30709 static tree
30711 {
30720 do
30721 {
30725 {
30728 }
30729 else
30739 }
30742 /* Consume the trailing ')'. */
30750 }
30752 /* OpenACC 2.0
30753 Parse wait clause or directive parameters. */
30755 static tree
30757 {
30767 {
30772 }
30779 {
30783 {
30786 else
30787 {
30794 }
30795 }
30796 }
30799 }
30801 /* OpenACC:
30802 wait ( int-expr-list ) */
30804 static tree
30806 {
30815 }
30817 /* OpenMP 3.0:
30818 collapse ( constant-expression ) */
30820 static tree
30822 {
30824 location_t loc;
30825 HOST_WIDE_INT n;
30845 {
30848 }
30856 }
30858 /* OpenMP 2.5:
30859 default ( shared | none )
30861 OpenACC 2.0
30862 default (none) */
30864 static tree
30867 {
30869 tree c;
30874 {
30879 {
30894 }
30897 }
30898 else
30899 {
30900 invalid_kind:
30903 else
30905 }
30921 }
30923 /* OpenMP 3.1:
30924 final ( expression ) */
30926 static tree
30928 {
30949 }
30951 /* OpenMP 2.5:
30952 if ( expression )
30954 OpenMP 4.5:
30955 if ( directive-name-modifier : expression )
30957 directive-name-modifier:
30958 parallel | task | taskloop | target data | target | target update
30959 | target enter data | target exit data */
30961 static tree
30964 {
30972 {
30984 {
30987 {
31000 else
31001 {
31002 location_t loc
31007 }
31010 {
31012 {
31017 }
31019 {
31020 location_t loc
31024 }
31025 }
31026 }
31027 }
31029 {
31031 {
31034 }
31035 else
31036 {
31038 {
31039 location_t loc
31042 }
31044 }
31045 }
31046 }
31058 {
31061 {
31064 {
31074 }
31076 p);
31078 }
31080 {
31083 else
31086 }
31089 {
31093 }
31094 }
31102 }
31104 /* OpenMP 3.1:
31105 mergeable */
31107 static tree
31110 {
31111 tree c;
31114 location);
31119 }
31121 /* OpenMP 2.5:
31122 nowait */
31124 static tree
31127 {
31128 tree c;
31135 }
31137 /* OpenMP 2.5:
31138 num_threads ( expression ) */
31140 static tree
31142 location_t location)
31143 {
31165 }
31167 /* OpenMP 4.5:
31168 num_tasks ( expression ) */
31170 static tree
31172 location_t location)
31173 {
31195 }
31197 /* OpenMP 4.5:
31198 grainsize ( expression ) */
31200 static tree
31202 location_t location)
31203 {
31225 }
31227 /* OpenMP 4.5:
31228 priority ( expression ) */
31230 static tree
31232 location_t location)
31233 {
31255 }
31257 /* OpenMP 4.5:
31258 hint ( expression ) */
31260 static tree
31262 location_t location)
31263 {
31284 }
31286 /* OpenMP 4.5:
31287 defaultmap ( tofrom : scalar ) */
31289 static tree
31291 location_t location)
31292 {
31300 {
31303 }
31307 {
31310 }
31316 {
31319 }
31323 {
31326 }
31332 location);
31338 out_err:
31343 }
31345 /* OpenMP 2.5:
31346 ordered
31348 OpenMP 4.5:
31349 ordered ( constant-expression ) */
31351 static tree
31354 {
31356 HOST_WIDE_INT n;
31362 {
31379 {
31381 "ordered argument needs positive constant integer "
31384 }
31385 }
31391 }
31393 /* OpenMP 2.5:
31394 reduction ( reduction-operator : variable-list )
31396 reduction-operator:
31397 One of: + * - & ^ | && ||
31399 OpenMP 3.1:
31401 reduction-operator:
31402 One of: + * - & ^ | && || min max
31404 OpenMP 4.0:
31406 reduction-operator:
31407 One of: + * - & ^ | && ||
31408 id-expression */
31410 static tree
31412 {
31420 {
31430 }
31434 else
31435 {
31446 {
31476 }
31477 else
31478 {
31480 resync_fail:
31485 }
31486 }
31492 NULL);
31494 {
31497 }
31500 }
31502 /* OpenMP 2.5:
31503 schedule ( schedule-kind )
31504 schedule ( schedule-kind , expression )
31506 schedule-kind:
31507 static | dynamic | guided | runtime | auto
31509 OpenMP 4.5:
31510 schedule ( schedule-modifier : schedule-kind )
31511 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31513 schedule-modifier:
31514 simd
31515 monotonic
31516 nonmonotonic */
31518 static tree
31520 {
31530 {
31539 else
31545 else
31546 {
31549 }
31550 }
31553 {
31558 {
31579 }
31580 }
31585 else
31591 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31593 {
31597 }
31600 {
31615 else
31620 }
31632 invalid_kind:
31634 resync_fail:
31639 }
31641 /* OpenMP 3.0:
31642 untied */
31644 static tree
31647 {
31648 tree c;
31655 }
31657 /* OpenMP 4.0:
31658 inbranch
31659 notinbranch */
31661 static tree
31664 {
31669 }
31671 /* OpenMP 4.0:
31672 parallel
31673 for
31674 sections
31675 taskgroup */
31677 static tree
31681 {
31685 }
31687 /* OpenMP 4.5:
31688 nogroup */
31690 static tree
31693 {
31698 }
31700 /* OpenMP 4.5:
31701 simd
31702 threads */
31704 static tree
31708 {
31713 }
31715 /* OpenMP 4.0:
31716 num_teams ( expression ) */
31718 static tree
31720 location_t location)
31721 {
31743 }
31745 /* OpenMP 4.0:
31746 thread_limit ( expression ) */
31748 static tree
31750 location_t location)
31751 {
31773 }
31775 /* OpenMP 4.0:
31776 aligned ( variable-list )
31777 aligned ( variable-list : constant-expression ) */
31779 static tree
31781 {
31792 {
31802 }
31808 }
31810 /* OpenMP 4.0:
31811 linear ( variable-list )
31812 linear ( variable-list : expression )
31814 OpenMP 4.5:
31815 linear ( modifier ( variable-list ) )
31816 linear ( modifier ( variable-list ) : expression ) */
31818 static tree
31821 {
31831 {
31843 else
31845 }
31850 else
31851 {
31860 }
31863 {
31868 {
31879 {
31882 }
31885 }
31890 {
31893 }
31901 }
31904 {
31907 }
31910 }
31912 /* OpenMP 4.0:
31913 safelen ( constant-expression ) */
31915 static tree
31917 location_t location)
31918 {
31939 }
31941 /* OpenMP 4.0:
31942 simdlen ( constant-expression ) */
31944 static tree
31946 location_t location)
31947 {
31968 }
31970 /* OpenMP 4.5:
31971 vec:
31972 identifier [+/- integer]
31973 vec , identifier [+/- integer]
31974 */
31976 static tree
31978 tree list)
31979 {
31983 {
31986 }
31989 {
31996 else
31997 {
31998 t = cp_parser_lookup_name_simple
32003 id_loc);
32004 }
32010 {
32013 }
32017 {
32020 }
32024 {
32027 }
32030 add_to_vector:
32032 {
32036 }
32042 }
32045 {
32051 }
32053 }
32055 /* OpenMP 4.0:
32056 depend ( depend-kind : variable-list )
32058 depend-kind:
32059 in | out | inout
32061 OpenMP 4.5:
32062 depend ( source )
32064 depend ( sink : vec ) */
32066 static tree
32068 {
32076 {
32090 else
32092 }
32093 else
32099 {
32109 }
32116 else
32117 {
32123 }
32126 invalid_kind:
32128 resync_fail:
32133 }
32135 /* OpenMP 4.0:
32136 map ( map-kind : variable-list )
32137 map ( variable-list )
32139 map-kind:
32140 alloc | to | from | tofrom
32142 OpenMP 4.5:
32143 map-kind:
32144 alloc | to | from | tofrom | release | delete
32146 map ( always [,] map-kind: variable-list ) */
32148 static tree
32150 {
32159 {
32164 {
32167 nth++;
32173 {
32178 }
32179 }
32180 }
32184 {
32198 else
32199 {
32205 }
32208 }
32211 {
32215 }
32218 NULL);
32224 }
32226 /* OpenMP 4.0:
32227 device ( expression ) */
32229 static tree
32231 location_t location)
32232 {
32254 }
32256 /* OpenMP 4.0:
32257 dist_schedule ( static )
32258 dist_schedule ( static , expression ) */
32260 static tree
32262 location_t location)
32263 {
32276 {
32287 }
32292 location);
32296 invalid_kind:
32298 resync_fail:
32303 }
32305 /* OpenMP 4.0:
32306 proc_bind ( proc-bind-kind )
32308 proc-bind-kind:
32309 master | close | spread */
32311 static tree
32313 location_t location)
32314 {
32315 tree c;
32322 {
32332 else
32334 }
32335 else
32344 location);
32349 invalid_kind:
32351 resync_fail:
32356 }
32358 /* OpenACC:
32359 async [( int-expr )] */
32361 static tree
32363 {
32370 {
32379 }
32389 }
32391 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32392 is a bitmask in MASK. Return the list of clauses found. */
32394 static tree
32398 {
32403 {
32404 location_t here;
32405 pragma_omp_clause c_kind;
32406 omp_clause_code code;
32417 {
32469 clauses);
32487 OMP_CLAUSE_INDEPENDENT,
32499 clauses);
32505 clauses);
32529 clauses);
32551 clauses);
32563 clauses);
32577 }
32582 {
32583 /* Remove the invalid clause(s) from the list to avoid
32584 confusing the rest of the compiler. */
32587 }
32588 }
32590 saw_error:
32597 }
32599 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32600 is a bitmask in MASK. Return the list of clauses found; the result
32601 of clause default goes in *pdefault. */
32603 static tree
32607 {
32613 {
32614 pragma_omp_clause c_kind;
32625 {
32637 clauses);
32651 clauses);
32671 clauses);
32676 clauses);
32686 clauses);
32720 clauses);
32734 clauses);
32751 OMP_CLAUSE_NOTINBRANCH,
32760 {
32761 clause_not_first:
32765 }
32795 clauses);
32796 else
32806 clauses);
32824 {
32832 }
32875 clauses
32881 clauses
32893 }
32898 {
32899 /* Remove the invalid clause(s) from the list to avoid
32900 confusing the rest of the compiler. */
32903 }
32904 }
32905 saw_error:
32906 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32907 no reason to skip to the end. */
32911 {
32914 else
32916 }
32918 }
32920 /* OpenMP 2.5:
32921 structured-block:
32922 statement
32924 In practice, we're also interested in adding the statement to an
32925 outer node. So it is convenient if we work around the fact that
32926 cp_parser_statement calls add_stmt. */
32928 static unsigned
32930 {
32933 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32934 This preserves the "not within loop or switch" style error messages
32935 for nonsense cases like
32936 void foo() {
32937 #pragma omp single
32938 break;
32939 }
32940 */
32945 }
32947 static void
32949 {
32951 }
32953 static tree
32955 {
32963 }
32965 /* OpenMP 2.5:
32966 # pragma omp atomic new-line
32967 expression-stmt
32969 expression-stmt:
32970 x binop= expr | x++ | ++x | x-- | --x
32971 binop:
32972 +, *, -, /, &, ^, |, <<, >>
32974 where x is an lvalue expression with scalar type.
32976 OpenMP 3.1:
32977 # pragma omp atomic new-line
32978 update-stmt
32980 # pragma omp atomic read new-line
32981 read-stmt
32983 # pragma omp atomic write new-line
32984 write-stmt
32986 # pragma omp atomic update new-line
32987 update-stmt
32989 # pragma omp atomic capture new-line
32990 capture-stmt
32992 # pragma omp atomic capture new-line
32993 capture-block
32995 read-stmt:
32996 v = x
32997 write-stmt:
32998 x = expr
32999 update-stmt:
33000 expression-stmt | x = x binop expr
33001 capture-stmt:
33002 v = expression-stmt
33003 capture-block:
33004 { v = x; update-stmt; } | { update-stmt; v = x; }
33006 OpenMP 4.0:
33007 update-stmt:
33008 expression-stmt | x = x binop expr | x = expr binop x
33009 capture-stmt:
33010 v = update-stmt
33011 capture-block:
33012 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33014 where x and v are lvalue expressions with scalar type. */
33016 static void
33018 {
33026 {
33031 {
33037 }
33038 }
33040 {
33052 else
33056 }
33058 {
33064 {
33069 {
33072 }
33073 }
33074 }
33078 {
33088 else
33093 {
33094 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33095 opcode. */
33100 }
33104 {
33107 }
33108 else
33109 {
33115 }
33118 }
33120 restart:
33124 {
33131 /* FALLTHROUGH */
33141 /* FALLTHROUGH */
33156 /* Undo effects of boolean_increment for post {in,de}crement. */
33158 /* FALLTHRU */
33162 {
33163 /* Undo effects of boolean_increment. */
33165 {
33166 /* This is pre or post increment. */
33171 && !structured_block
33175 }
33176 }
33177 /* FALLTHRU */
33180 {
33215 {
33219 }
33222 {
33228 {
33233 }
33235 {
33247 {
33249 {
33254 }
33255 else
33257 }
33261 }
33264 {
33271 }
33275 }
33279 {
33282 {
33290 }
33292 {
33297 }
33332 }
33343 /* FALLTHROUGH */
33348 }
33355 }
33356 stmt_done:
33358 {
33369 }
33371 {
33374 }
33375 done:
33381 saw_error:
33384 {
33388 {
33392 }
33393 }
33394 }
33397 /* OpenMP 2.5:
33398 # pragma omp barrier new-line */
33400 static void
33402 {
33405 }
33407 /* OpenMP 2.5:
33408 # pragma omp critical [(name)] new-line
33409 structured-block
33411 OpenMP 4.5:
33412 # pragma omp critical [(name) [hint(expression)]] new-line
33413 structured-block */
33415 #define OMP_CRITICAL_CLAUSE_MASK \
33416 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33418 static tree
33420 {
33424 {
33438 OMP_CRITICAL_CLAUSE_MASK,
33440 }
33441 else
33446 }
33448 /* OpenMP 2.5:
33449 # pragma omp flush flush-vars[opt] new-line
33451 flush-vars:
33452 ( variable-list ) */
33454 static void
33456 {
33462 }
33464 /* Helper function, to parse omp for increment expression. */
33466 static tree
33468 {
33473 {
33476 }
33479 {
33488 /* Fall through: OpenMP disallows NE_EXPR. */
33492 }
33494 /* If decl is an iterator, preserve LHS and RHS of the relational
33495 expr until finish_omp_for. */
33506 }
33508 /* Helper function, to parse omp for increment expression. */
33510 static tree
33512 {
33516 cp_id_kind idk;
33520 {
33529 }
33538 {
33543 }
33550 {
33554 }
33567 do
33568 {
33575 {
33577 {
33580 else
33582 tf_warning_or_error);
33583 }
33584 else
33587 }
33588 }
33592 {
33598 }
33599 else
33603 }
33605 /* Parse the initialization statement of either an OpenMP for loop or
33606 a Cilk Plus for loop.
33608 Return true if the resulting construct should have an
33609 OMP_CLAUSE_PRIVATE added to it. */
33611 static tree
33620 {
33626 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33628 init-expr:
33629 var = lb
33630 integer-type var = lb
33631 random-access-iterator-type var = lb
33632 pointer-type var = lb
33633 */
33634 cp_decl_specifier_seq type_specifiers;
33636 /* First, try to parse as an initialized declaration. See
33637 cp_parser_condition, from whence the bulk of this is copied. */
33644 {
33645 /* If parsing a type specifier seq succeeded, then this
33646 MUST be a initialized declaration. */
33651 CP_PARSER_DECLARATOR_NAMED,
33662 else
33663 {
33673 {
33675 CPP_OPEN_PAREN))
33676 {
33680 else
33683 }
33684 else
33685 /* Trigger an error. */
33690 }
33694 {
33702 {
33705 auto_node);
33710 }
33713 asm_specification,
33714 LOOKUP_ONLYCONVERTING);
33717 {
33720 }
33721 else
33722 {
33725 {
33727 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
33729 {
33733 {
33737 }
33739 }
33741 {
33746 }
33747 }
33748 }
33750 }
33751 else
33752 {
33753 /* Consume '='. */
33757 non_class:
33760 else
33763 asm_specification,
33764 LOOKUP_ONLYCONVERTING);
33765 }
33769 }
33770 }
33771 else
33772 {
33773 cp_id_kind idk;
33774 /* If parsing a type specifier sequence failed, then
33775 this MUST be a simple expression. */
33784 && decl
33787 {
33798 {
33803 }
33808 }
33810 && decl
33813 {
33814 tree rhs;
33822 rhs,
33823 tf_warning_or_error));
33826 }
33827 else
33828 {
33833 {
33837 }
33838 }
33839 }
33841 }
33843 /* Parse the restricted form of the for statement allowed by OpenMP. */
33845 static tree
33848 {
33852 location_t loc_first;
33863 {
33866 }
33869 {
33875 }
33877 {
33880 {
33882 "%<linear%> clause may not be specified together "
33885 }
33886 else
33888 }
33901 {
33904 location_t loc;
33908 {
33911 }
33914 {
33917 }
33926 add_private_clause
33933 {
33936 {
33942 }
33943 else
33945 }
33952 {
33957 {
33961 }
33964 {
33965 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33969 {
33972 }
33973 else
33974 {
33977 }
33979 }
33980 else
33981 {
33986 }
33987 }
33990 {
33991 tree c;
33993 {
34002 decl);
34006 decl);
34007 }
34009 {
34014 else
34019 {
34022 /* For linear, signal that we need to fill up
34023 the so far unknown linear step. */
34026 }
34027 }
34028 }
34037 {
34038 /* If decl is an iterator, preserve the operator on decl
34039 until finish_omp_for. */
34041 && ((processing_template_decl
34046 else
34050 }
34062 {
34065 }
34070 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34071 in between the collapsed for loops to be still considered perfectly
34072 nested. Hopefully the final version clarifies this.
34073 For now handle (multiple) {'s and empty statements. */
34075 do
34076 {
34080 {
34082 bracecount++;
34083 }
34087 else
34088 {
34095 }
34096 }
34100 {
34103 }
34104 }
34109 /* Note that we saved the original contents of this flag when we entered
34110 the structured block, and so we don't need to re-save it here. */
34113 else
34116 /* Note that the grammar doesn't call for a structured block here,
34117 though the loop as a whole is a structured block. */
34124 else
34129 {
34131 {
34133 nbraces--;
34134 }
34137 else
34138 {
34140 {
34143 }
34148 }
34149 }
34152 {
34156 else
34158 }
34162 }
34164 /* Helper function for OpenMP parsing, split clauses and call
34165 finish_omp_clauses on each of the set of clauses afterwards. */
34167 static void
34170 {
34176 }
34178 /* OpenMP 4.0:
34179 #pragma omp simd simd-clause[optseq] new-line
34180 for-loop */
34182 #define OMP_SIMD_CLAUSE_MASK \
34183 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34192 static tree
34196 {
34207 {
34211 OMP_CLAUSE_ORDERED);
34213 {
34215 "%<ordered%> clause with parameter may not be specified "
34218 }
34219 }
34230 }
34232 /* OpenMP 2.5:
34233 #pragma omp for for-clause[optseq] new-line
34234 for-loop
34236 OpenMP 4.0:
34237 #pragma omp for simd for-simd-clause[optseq] new-line
34238 for-loop */
34240 #define OMP_FOR_CLAUSE_MASK \
34241 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34251 static tree
34255 {
34262 /* parallel for{, simd} disallows nowait clause, but for
34263 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34266 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34271 {
34276 {
34300 }
34301 }
34303 {
34306 }
34308 /* Composite distribute parallel for disallows linear clause. */
34315 {
34318 }
34329 }
34331 /* OpenMP 2.5:
34332 # pragma omp master new-line
34333 structured-block */
34335 static tree
34337 {
34341 }
34343 /* OpenMP 2.5:
34344 # pragma omp ordered new-line
34345 structured-block
34347 OpenMP 4.5:
34348 # pragma omp ordered ordered-clauses new-line
34349 structured-block */
34351 #define OMP_ORDERED_CLAUSE_MASK \
34352 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34355 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34356 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34358 static bool
34361 {
34365 {
34369 }
34372 {
34377 {
34379 {
34381 "%<depend%> clause may only be used in compound "
34385 }
34386 tree clauses
34388 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34392 }
34393 }
34395 tree clauses
34401 }
34403 /* OpenMP 2.5:
34405 section-scope:
34406 { section-sequence }
34408 section-sequence:
34409 section-directive[opt] structured-block
34410 section-sequence section-directive structured-block */
34412 static tree
34414 {
34426 {
34430 }
34433 {
34441 {
34445 }
34447 {
34450 }
34455 }
34466 }
34468 /* OpenMP 2.5:
34469 # pragma omp sections sections-clause[optseq] newline
34470 sections-scope */
34472 #define OMP_SECTIONS_CLAUSE_MASK \
34473 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34479 static tree
34482 {
34494 {
34497 }
34504 }
34506 /* OpenMP 2.5:
34507 # pragma omp parallel parallel-clause[optseq] new-line
34508 structured-block
34509 # pragma omp parallel for parallel-for-clause[optseq] new-line
34510 structured-block
34511 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34512 structured-block
34514 OpenMP 4.0:
34515 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34516 structured-block */
34518 #define OMP_PARALLEL_CLAUSE_MASK \
34519 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34529 static tree
34533 {
34540 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34546 {
34554 if_p);
34558 if_p);
34561 block);
34566 }
34567 /* When combined with distribute, parallel has to be followed by for.
34568 #pragma omp target parallel is allowed though. */
34572 {
34576 }
34578 {
34581 }
34583 {
34587 {
34597 block);
34600 }
34601 }
34606 {
34609 }
34617 }
34619 /* OpenMP 2.5:
34620 # pragma omp single single-clause[optseq] new-line
34621 structured-block */
34623 #define OMP_SINGLE_CLAUSE_MASK \
34624 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34629 static tree
34631 {
34641 }
34643 /* OpenMP 3.0:
34644 # pragma omp task task-clause[optseq] new-line
34645 structured-block */
34647 #define OMP_TASK_CLAUSE_MASK \
34648 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34659 static tree
34661 {
34672 }
34674 /* OpenMP 3.0:
34675 # pragma omp taskwait new-line */
34677 static void
34679 {
34682 }
34684 /* OpenMP 3.1:
34685 # pragma omp taskyield new-line */
34687 static void
34689 {
34692 }
34694 /* OpenMP 4.0:
34695 # pragma omp taskgroup new-line
34696 structured-block */
34698 static tree
34700 {
34704 if_p));
34705 }
34708 /* OpenMP 2.5:
34709 # pragma omp threadprivate (variable-list) */
34711 static void
34713 {
34714 tree vars;
34720 }
34722 /* OpenMP 4.0:
34723 # pragma omp cancel cancel-clause[optseq] new-line */
34725 #define OMP_CANCEL_CLAUSE_MASK \
34726 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34732 static void
34734 {
34738 }
34740 /* OpenMP 4.0:
34741 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34743 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34744 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34749 static void
34752 {
34753 tree clauses;
34757 {
34762 {
34765 }
34766 }
34768 {
34772 }
34775 {
34778 "%<#pragma omp cancellation point%> may only be used in"
34780 else
34784 }
34787 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34789 pragma_tok);
34791 }
34793 /* OpenMP 4.0:
34794 #pragma omp distribute distribute-clause[optseq] new-line
34795 for-loop */
34797 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34798 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34804 static tree
34808 {
34817 {
34825 else
34828 {
34834 {
34838 else
34841 }
34847 else
34861 }
34862 }
34864 {
34867 }
34872 {
34875 }
34886 }
34888 /* OpenMP 4.0:
34889 # pragma omp teams teams-clause[optseq] new-line
34890 structured-block */
34892 #define OMP_TEAMS_CLAUSE_MASK \
34893 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34901 static tree
34905 {
34914 {
34918 {
34942 }
34943 }
34945 {
34948 }
34953 {
34956 }
34964 }
34966 /* OpenMP 4.0:
34967 # pragma omp target data target-data-clause[optseq] new-line
34968 structured-block */
34970 #define OMP_TARGET_DATA_CLAUSE_MASK \
34971 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34976 static tree
34978 {
34979 tree clauses
34984 {
34987 {
35004 "%<#pragma omp target data%> with map-type other "
35005 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35009 }
35011 }
35014 {
35017 "%<#pragma omp target data%> must contain at least "
35020 }
35031 }
35033 /* OpenMP 4.5:
35034 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35035 structured-block */
35037 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35038 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35044 static tree
35047 {
35050 {
35055 {
35058 }
35059 }
35061 {
35065 }
35068 {
35070 "%<#pragma omp target enter data%> may only be "
35074 }
35076 tree clauses
35081 {
35084 {
35097 "%<#pragma omp target enter data%> with map-type other "
35101 }
35103 }
35106 {
35109 "%<#pragma omp target enter data%> must contain at least "
35112 }
35119 }
35121 /* OpenMP 4.5:
35122 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35123 structured-block */
35125 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35126 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35132 static tree
35135 {
35138 {
35143 {
35146 }
35147 }
35149 {
35153 }
35156 {
35158 "%<#pragma omp target exit data%> may only be "
35162 }
35164 tree clauses
35169 {
35172 {
35186 "%<#pragma omp target exit data%> with map-type other "
35187 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35191 }
35193 }
35196 {
35199 "%<#pragma omp target exit data%> must contain at least "
35202 }
35209 }
35211 /* OpenMP 4.0:
35212 # pragma omp target update target-update-clause[optseq] new-line */
35214 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35215 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35222 static bool
35225 {
35227 {
35229 "%<#pragma omp target update%> may only be "
35233 }
35235 tree clauses
35240 {
35242 "%<#pragma omp target update%> must contain at least one "
35245 }
35253 }
35255 /* OpenMP 4.0:
35256 # pragma omp target target-clause[optseq] new-line
35257 structured-block */
35259 #define OMP_TARGET_CLAUSE_MASK \
35260 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35270 static bool
35273 {
35277 {
35281 }
35284 {
35296 {
35304 {
35305 tree stmt;
35307 {
35310 OMP_TARGET_CLAUSE_MASK,
35315 OMP_TARGET_CLAUSE_MASK,
35320 OMP_TARGET_CLAUSE_MASK,
35325 }
35327 }
35332 {
35336 if_p);
35341 if_p);
35346 if_p);
35350 }
35356 {
35357 /* For combined target teams, ensure the num_teams and
35358 thread_limit clause expressions are evaluated on the host,
35359 before entering the target construct. */
35360 tree c;
35366 {
35375 OMP_CLAUSE_FIRSTPRIVATE);
35380 }
35381 }
35390 }
35392 {
35395 }
35397 {
35401 }
35403 {
35407 }
35409 {
35413 }
35415 {
35418 }
35419 }
35434 check_clauses:
35436 {
35439 {
35453 "%<#pragma omp target%> with map-type other "
35454 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35458 }
35460 }
35462 }
35464 /* OpenACC 2.0:
35465 # pragma acc cache (variable-list) new-line
35466 */
35468 static tree
35470 {
35485 }
35487 /* OpenACC 2.0:
35488 # pragma acc data oacc-data-clause[optseq] new-line
35489 structured-block */
35491 #define OACC_DATA_CLAUSE_MASK \
35492 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35504 static tree
35506 {
35519 }
35521 /* OpenACC 2.0:
35522 # pragma acc host_data <clauses> new-line
35523 structured-block */
35525 #define OACC_HOST_DATA_CLAUSE_MASK \
35526 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35528 static tree
35530 {
35543 }
35545 /* OpenACC 2.0:
35546 # pragma acc declare oacc-data-clause[optseq] new-line
35547 */
35549 #define OACC_DECLARE_CLAUSE_MASK \
35550 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35563 static tree
35565 {
35574 {
35578 }
35581 {
35585 {
35589 }
35592 {
35604 {
35606 "%qD must be a global variable in"
35608 decl);
35611 }
35616 {
35620 }
35622 {
35624 "invalid use of %<extern%> variable %qD "
35628 }
35630 {
35632 "invalid use of %<global%> variable %qD "
35636 }
35638 }
35643 {
35648 }
35651 {
35652 tree id;
35656 else
35662 {
35665 {
35668 {
35672 }
35673 }
35674 }
35675 }
35676 }
35689 }
35691 /* OpenACC 2.0:
35692 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35694 or
35696 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35698 LOC is the location of the #pragma token.
35699 */
35701 #define OACC_ENTER_DATA_CLAUSE_MASK \
35702 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35710 #define OACC_EXIT_DATA_CLAUSE_MASK \
35711 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35717 static tree
35720 {
35725 {
35731 }
35736 {
35740 }
35747 else
35752 {
35756 }
35764 }
35766 /* OpenACC 2.0:
35767 # pragma acc loop oacc-loop-clause[optseq] new-line
35768 structured-block */
35770 #define OACC_LOOP_CLAUSE_MASK \
35771 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35782 static tree
35785 {
35794 {
35800 }
35809 }
35811 /* OpenACC 2.0:
35812 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35813 structured-block
35815 or
35817 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35818 structured-block
35819 */
35821 #define OACC_KERNELS_CLAUSE_MASK \
35822 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35837 #define OACC_PARALLEL_CLAUSE_MASK \
35838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35859 static tree
35862 {
35863 omp_clause_mask mask;
35866 {
35879 }
35882 {
35886 {
35889 tree clauses;
35891 if_p);
35893 }
35894 }
35903 }
35905 /* OpenACC 2.0:
35906 # pragma acc update oacc-update-clause[optseq] new-line
35907 */
35909 #define OACC_UPDATE_CLAUSE_MASK \
35910 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35917 static tree
35919 {
35926 {
35928 "%<#pragma acc update%> must contain at least one "
35931 }
35939 }
35941 /* OpenACC 2.0:
35942 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35944 LOC is the location of the #pragma token.
35945 */
35947 #define OACC_WAIT_CLAUSE_MASK \
35948 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35950 static tree
35952 {
35966 }
35968 /* OpenMP 4.0:
35969 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35971 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35972 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35979 static void
35982 {
35984 cp_omp_declare_simd_data data;
35986 {
35991 /* It is safe to take the address of a local variable; it will only be
35992 used while this scope is live. */
35994 }
35996 /* Store away all pragma tokens. */
36008 {
36012 {
36025 }
36030 "%<#pragma omp declare simd%> not immediately followed by "
36034 }
36035 }
36037 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36038 This function is modelled similar to the late parsing of omp declare
36039 simd. */
36041 static tree
36043 {
36050 {
36052 "used in the same function marked as a Cilk Plus SIMD-enabled "
36058 }
36060 {
36064 }
36069 {
36076 NULL);
36090 }
36096 }
36098 /* Finalize #pragma omp declare simd clauses after direct declarator has
36099 been parsed, and put that into "omp declare simd" attribute. */
36101 static tree
36103 {
36109 {
36113 }
36118 {
36136 }
36140 }
36143 /* OpenMP 4.0:
36144 # pragma omp declare target new-line
36145 declarations and definitions
36146 # pragma omp end declare target new-line
36148 OpenMP 4.5:
36149 # pragma omp declare target ( extended-list ) new-line
36151 # pragma omp declare target declare-target-clauses[seq] new-line */
36153 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36154 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36157 static void
36159 {
36162 clauses
36166 {
36168 clauses);
36171 }
36172 else
36173 {
36177 }
36180 "%<#pragma omp declare target%> with clauses in between "
36181 "%<#pragma omp declare target%> without clauses and "
36184 {
36190 {
36193 }
36194 else
36197 {
36199 "%qD specified both in declare target %<link%> and %<to%>"
36202 }
36204 {
36208 {
36211 {
36215 }
36216 }
36217 }
36218 }
36219 }
36221 static void
36223 {
36226 {
36229 }
36231 {
36235 {
36238 }
36241 else
36242 {
36246 }
36247 }
36248 else
36249 {
36253 }
36257 "%<#pragma omp end declare target%> without corresponding "
36259 else
36261 }
36263 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36264 expression and optional initializer clause of
36265 #pragma omp declare reduction. We store the expression(s) as
36266 either 3, 6 or 7 special statements inside of the artificial function's
36267 body. The first two statements are DECL_EXPRs for the artificial
36268 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36269 expression that uses those variables.
36270 If there was any INITIALIZER clause, this is followed by further statements,
36271 the fourth and fifth statements are DECL_EXPRs for the artificial
36272 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36273 constructor variant (first token after open paren is not omp_priv),
36274 then the sixth statement is a statement with the function call expression
36275 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36276 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36277 to initialize the OMP_PRIV artificial variable and there is seventh
36278 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36280 static bool
36282 {
36294 tree combiner;
36309 {
36312 }
36315 {
36322 {
36325 }
36341 {
36345 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36349 == CPP_CLOSE_PAREN
36352 {
36356 }
36361 }
36362 else
36363 {
36379 {
36384 }
36386 tree arg;
36399 }
36410 }
36416 }
36418 /* OpenMP 4.0
36419 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36420 initializer-clause[opt] new-line
36422 initializer-clause:
36423 initializer (omp_priv initializer)
36424 initializer (function-name (argument-list)) */
36426 static void
36429 {
36439 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36446 {
36478 }
36490 /* Types may not be defined in declare reduction type list. */
36493 parser->type_definition_forbidden_message
36499 saved_colon_doesnt_start_class_def_p
36504 {
36508 ;
36529 else
36534 else
36536 }
36538 /* Restore the saved message. */
36541 parser->colon_doesnt_start_class_def_p
36546 {
36547 fail:
36550 }
36556 {
36557 tree fntype
36560 NULL_TREE);
36580 {
36585 }
36587 {
36589 {
36598 }
36605 }
36606 else
36607 {
36610 }
36613 else
36616 {
36619 }
36621 {
36624 else
36629 }
36634 else
36635 {
36644 }
36651 }
36655 done:
36656 /* Free any declarators allocated. */
36658 }
36660 /* OpenMP 4.0
36661 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36662 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36663 initializer-clause[opt] new-line
36664 #pragma omp declare target new-line */
36666 static void
36669 {
36671 {
36676 {
36679 context);
36681 }
36684 {
36687 context);
36689 }
36691 {
36694 }
36696 {
36700 }
36701 }
36705 }
36707 /* OpenMP 4.5:
36708 #pragma omp taskloop taskloop-clause[optseq] new-line
36709 for-loop
36711 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36712 for-loop */
36714 #define OMP_TASKLOOP_CLAUSE_MASK \
36715 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36730 static tree
36734 {
36743 {
36748 {
36772 }
36773 }
36775 {
36778 }
36783 {
36786 }
36792 if_p);
36798 }
36801 /* OpenACC 2.0:
36802 # pragma acc routine oacc-routine-clause[optseq] new-line
36803 function-definition
36805 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36806 */
36808 #define OACC_ROUTINE_CLAUSE_MASK \
36809 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36815 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36816 component, which must resolve to a declared namespace-scope
36817 function. The clauses are either processed directly (for a named
36818 function), or defered until the immediatley following declaration
36819 is parsed. */
36821 static void
36824 {
36826 /* The checking for "another pragma following this one" in the "no optional
36827 '( name )'" case makes sure that we dont re-enter. */
36830 cp_oacc_routine_data data;
36836 /* It is safe to take the address of a local variable; it will only be
36837 used while this scope is live. */
36840 /* Look for optional '( name )'. */
36842 {
36845 /* We parse the name as an id-expression. If it resolves to
36846 anything other than a non-overloaded function at namespace
36847 scope, it's an error. */
36861 {
36865 }
36867 data.clauses
36875 {
36880 }
36882 /* Perhaps we should use the same rule as declarations in different
36883 namespaces? */
36885 {
36890 }
36893 {
36897 }
36901 }
36903 {
36904 /* Store away all pragma tokens. */
36915 /* Emit a helpful diagnostic if there's another pragma following this
36916 one. */
36918 {
36921 /* ..., and then just keep going. */
36923 }
36925 /* We only have to consider the pragma_external case here. */
36930 else
36933 }
36934 }
36936 /* Finalize #pragma acc routine clauses after direct declarator has
36937 been parsed. */
36939 static tree
36941 {
36946 {
36948 "%<#pragma acc routine%> not immediately followed by "
36951 }
36968 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
36969 fndecl_seen. */
36972 }
36974 /* Apply any saved OpenACC routine clauses to a just-parsed
36975 declaration. */
36977 static void
36979 {
36981 {
36982 /* Keep going if we're in error reporting mode. */
36988 {
36990 "%<#pragma acc routine%> not immediately followed by"
36994 }
36996 {
36999 }
37002 {
37007 }
37010 {
37016 }
37018 /* Process the routine's dimension clauses. */
37022 /* Add an "omp declare target" attribute. */
37027 /* Don't unset parser->oacc_routine here: we may still need it to
37028 diagnose wrong usage. But, remember that we've used this "#pragma acc
37029 routine". */
37031 }
37032 }
37034 /* Main entry point to OpenMP statement pragmas. */
37036 static void
37038 {
37039 tree stmt;
37044 {
37067 if_p);
37072 if_p);
37089 if_p);
37094 if_p);
37102 if_p);
37111 if_p);
37125 if_p);
37130 if_p);
37134 }
37137 }
37138 \f
37139 /* Transactional Memory parsing routines. */
37141 /* Parse a transaction attribute.
37143 txn-attribute:
37144 attribute
37145 [ [ identifier ] ]
37147 We use this instead of cp_parser_attributes_opt for transactions to avoid
37148 the pedwarn in C++98 mode. */
37150 static tree
37152 {
37167 {
37171 /* For keywords, use the canonical spelling,
37172 not the parsed identifier. */
37176 }
37177 else
37181 error1:
37184 }
37186 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37188 transaction-statement:
37189 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37190 compound-statement
37191 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37192 */
37194 static tree
37196 {
37207 else
37208 {
37212 }
37214 /* Parse a noexcept specification. */
37218 {
37219 /* cancel-and-throw is unimplemented. */
37222 }
37223 else
37226 /* Keep track if we're in the lexical scope of an outer transaction. */
37238 }
37240 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37242 transaction-expression:
37243 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37244 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37245 */
37247 static tree
37249 {
37262 keyword == RID_TRANSACTION_RELAXED
37276 /* Set this early. This might mean that we allow transaction_cancel in
37277 an expression that we find out later actually has to be a constexpr.
37278 However, we expect that cxx_constant_value will be able to deal with
37279 this; also, if the noexcept has no constexpr, then what we parse next
37280 really is a transaction's body. */
37283 /* Parse a noexcept specification. */
37289 {
37296 }
37297 else
37298 {
37299 /* The only expression that is available got parsed for the noexcept
37300 already. noexcept is true then. */
37303 }
37312 }
37314 /* Parse a function-transaction-block.
37316 function-transaction-block:
37317 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37318 function-body
37319 __transaction_atomic txn-attribute[opt] function-try-block
37320 __transaction_relaxed ctor-initializer[opt] function-body
37321 __transaction_relaxed function-try-block
37322 */
37324 static bool
37326 {
37342 else
37343 {
37347 }
37355 else
37356 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37364 }
37366 /* Parse a __transaction_cancel statement.
37368 cancel-statement:
37369 __transaction_cancel txn-attribute[opt] ;
37370 __transaction_cancel txn-attribute[opt] throw-expression ;
37372 ??? Cancel and throw is not yet implemented. */
37374 static tree
37376 {
37382 RT_TRANSACTION_CANCEL);
37389 /* ??? Parse cancel-and-throw here. */
37394 {
37398 }
37400 {
37404 }
37406 {
37409 {
37415 }
37416 }
37418 {
37422 }
37428 }
37429 \f
37430 /* The parser. */
37434 \f
37435 /* Special handling for the first token or line in the file. The first
37436 thing in the file might be #pragma GCC pch_preprocess, which loads a
37437 PCH file, which is a GC collection point. So we need to handle this
37438 first pragma without benefit of an existing lexer structure.
37440 Always returns one token to the caller in *FIRST_TOKEN. This is
37441 either the true first token of the file, or the first token after
37442 the initial pragma. */
37444 static void
37446 {
37455 {
37462 }
37463 else
37466 /* Skip to the end of the pragma. */
37470 /* Now actually load the PCH file. */
37474 /* Read one more token to return to our caller. We have to do this
37475 after reading the PCH file in, since its pointers have to be
37476 live. */
37478 }
37480 /* Parses the grainsize pragma for the _Cilk_for statement.
37481 Syntax:
37482 #pragma cilk grainsize = <VALUE>. */
37484 static void
37486 {
37488 {
37493 {
37496 }
37498 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37501 else
37503 "%<#pragma cilk grainsize%> is not followed by "
37506 }
37508 }
37510 /* Normal parsing of a pragma token. Here we can (and must) use the
37511 regular lexer. */
37513 static bool
37515 {
37518 tree stmt;
37529 {
37537 {
37547 }
37552 {
37562 }
37567 {
37573 "%<#pragma omp taskwait%> may only be "
37578 }
37583 {
37589 "%<#pragma omp taskyield%> may only be "
37594 }
37599 {
37605 "%<#pragma omp cancel%> may only be "
37610 }
37631 {
37635 }
37688 "%<#pragma omp section%> may only be used in "
37693 {
37695 {
37699 }
37706 {
37709 }
37712 }
37716 {
37720 }
37728 {
37732 }
37734 /* Ignore the pragma if Cilk Plus is not enabled. */
37736 {
37739 }
37740 else
37741 {
37745 }
37752 bad_stmt:
37755 }
37759 }
37761 /* The interface the pragma parsers have to the lexer. */
37763 enum cpp_ttype
37765 {
37777 else
37778 {
37782 }
37785 }
37787 \f
37788 /* External interface. */
37790 /* Parse one entire translation unit. */
37792 void
37794 {
37807 }
37809 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37810 vectorlength clause:
37811 Syntax:
37812 vectorlength ( constant-expression ) */
37814 static tree
37817 {
37819 tree expr;
37820 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37821 safelen clause. Thus, vectorlength is represented as OMP 4.0
37822 safelen. For SIMD-enabled function it is represented by OMP 4.0
37823 simdlen. */
37826 loc);
37827 else
37829 loc);
37837 /* If expr == error_mark_node, then don't emit any errors nor
37838 create a clause. if any of the above functions returns
37839 error mark node then they would have emitted an error message. */
37841 ;
37849 else
37850 {
37851 tree c;
37853 {
37858 }
37859 else
37860 {
37865 }
37866 }
37871 }
37873 /* Handles the Cilk Plus #pragma simd linear clause.
37874 Syntax:
37875 linear ( simd-linear-variable-list )
37877 simd-linear-variable-list:
37878 simd-linear-variable
37879 simd-linear-variable-list , simd-linear-variable
37881 simd-linear-variable:
37882 id-expression
37883 id-expression : simd-linear-step
37885 simd-linear-step:
37886 conditional-expression */
37888 static tree
37890 {
37896 {
37900 }
37905 {
37908 {
37912 }
37919 {
37923 }
37924 else
37925 {
37929 /* If present, parse the linear step. Otherwise, assume the default
37930 value of 1. */
37932 {
37939 {
37940 /* If an error has occurred, then the whole pragma is
37941 considered ill-formed. Thus, no reason to keep
37942 parsing. */
37945 }
37953 else
37955 "step size must be an integer constant "
37957 }
37959 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37965 }
37970 else
37971 {
37976 }
37977 }
37981 }
37983 /* Returns the name of the next clause. If the clause is not
37984 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37985 token is not consumed. Otherwise, the appropriate enum from the
37986 pragma_simd_clause is returned and the token is consumed. */
37988 static pragma_omp_clause
37990 {
37991 pragma_omp_clause clause_type;
38008 else
38013 }
38015 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38017 static tree
38019 {
38024 {
38025 pragma_omp_clause c_kind;
38032 /* Use the OpenMP 4.0 equivalent function. */
38035 /* Use the OpenMP 4.0 equivalent function. */
38037 clauses);
38039 /* Use the OMP 4.0 equivalent function. */
38041 clauses);
38043 /* Use the OMP 4.0 equivalent function. */
38045 else
38046 {
38050 }
38051 }
38057 else
38059 }
38061 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38063 static void
38065 {
38072 {
38076 }
38085 }
38087 /* Main entry-point for parsing Cilk Plus _Cilk_for
38088 loops. The return value is error_mark_node
38089 when errors happen and CILK_FOR tree on success. */
38091 static tree
38093 {
38108 else
38114 }
38116 /* Create an identifier for a generic parameter type (a synthesized
38117 template parameter implied by `auto' or a concept identifier). */
38120 static tree
38122 {
38126 }
38128 /* Predicate that behaves as is_auto_or_concept but matches the parent
38129 node of the generic type rather than the generic type itself. This
38130 allows for type transformation in add_implicit_template_parms. */
38134 {
38136 }
38138 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38139 (creating a new template parameter list if necessary). Returns the newly
38140 created template type parm. */
38142 static tree
38144 {
38147 /* Before committing to modifying any scope, if we're in an
38148 implicit template scope, and we're trying to synthesize a
38149 constrained parameter, try to find a previous parameter with
38150 the same name. This is the same-type rule for abbreviated
38151 function templates.
38153 NOTE: We can generate implicit parameters when tentatively
38154 parsing a nested name specifier, only to reject that parse
38155 later. However, matching the same template-id as part of a
38156 direct-declarator should generate an identical template
38157 parameter, so this rule will merge them. */
38159 {
38162 {
38164 {
38167 /* Return the TEMPLATE_PARM_INDEX. */
38170 }
38172 }
38173 }
38175 /* We are either continuing a function template that already contains implicit
38176 template parameters, creating a new fully-implicit function template, or
38177 extending an existing explicit function template with implicit template
38178 parameters. */
38186 {
38190 }
38191 else
38192 {
38193 /* Roll back to the existing template parameter scope (in the case of
38194 extending an explicit function template) or introduce a new template
38195 parameter scope ahead of the function parameter scope (or class scope
38196 in the case of out-of-line member definitions). The function scope is
38197 added back after template parameter synthesis below. */
38202 {
38205 }
38207 {
38208 /* If not defining a class, then any class scope is a scope level in
38209 an out-of-line member definition. In this case simply wind back
38210 beyond the first such scope to inject the template parameter list.
38211 Otherwise wind back to the class being defined. The latter can
38212 occur in class member friend declarations such as:
38214 class A {
38215 void foo (auto);
38216 };
38217 class B {
38218 friend void A::foo (auto);
38219 };
38221 The template parameter list synthesized for the friend declaration
38222 must be injected in the scope of 'B'. This can also occur in
38223 erroneous cases such as:
38225 struct A {
38226 struct B {
38227 void foo (auto);
38228 };
38229 void B::foo (auto) {}
38230 };
38232 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38233 but, nevertheless, the template parameter list synthesized for the
38234 declarator should be injected into the scope of 'A' as if the
38235 ill-formed template was specified explicitly. */
38238 {
38241 }
38242 }
38248 {
38249 /* Introduce a new template parameter list for implicit template
38250 parameters. */
38254 parser->implicit_template_scope
38261 }
38262 else
38263 {
38264 /* Synthesize implicit template parameters at the end of the explicit
38265 template parameter list. */
38272 parser->implicit_template_parms
38274 }
38275 }
38277 /* Synthesize a new template parameter and track the current template
38278 parameter chain with implicit_template_parms. */
38282 tree synth_tmpl_parm;
38286 synth_tmpl_parm
38289 synth_tmpl_parm
38291 else
38292 {
38296 }
38298 // Attach the constraint to the parm before processing.
38301 tree new_parm
38303 input_location,
38304 node,
38308 // Chain the new parameter to the list of implicit parameters.
38310 parser->implicit_template_parms
38312 else
38317 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38320 /* If creating a fully implicit function template, start the new implicit
38321 template parameter list with this synthesized type, otherwise grow the
38322 current template parameter list. */
38325 {
38332 }
38333 else
38334 {
38339 }
38341 // If the new parameter was constrained, we need to add that to the
38342 // constraints in the template parameter list.
38344 {
38348 }
38353 }
38355 /* Finish the declaration of a fully implicit function template. Such a
38356 template has no explicit template parameter list so has not been through the
38357 normal template head and tail processing. synthesize_implicit_template_parm
38358 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38359 provided if the declaration is a class member such that its template
38360 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38361 form is returned. Otherwise NULL_TREE is returned. */
38363 static tree
38365 {
38370 {
38374 }
38384 }