| blob | e6848701150020f02cd683b271a8d32ba01540ea |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
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_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
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4158 }
4160 /* A subroutine of cp_parser_userdef_numeric_literal to
4161 create a char... template parameter pack from a string node. */
4163 static tree
4165 {
4166 tree charvec;
4177 /* First template parm is character type. */
4180 /* Fill in CHARVEC with all of the parameters. */
4187 /* Build the argument packs. */
4194 }
4196 /* Parse a user-defined numeric constant. returns a call to a user-defined
4197 literal operator. */
4199 static cp_expr
4201 {
4212 /* Look for a literal operator taking the exact type of numeric argument
4213 as the literal value. */
4218 {
4220 tf_warning_or_error);
4223 {
4226 long_long_unsigned_type_node);
4227 }
4228 else
4229 {
4233 long_double_type_node);
4237 }
4241 }
4244 /* If the numeric argument didn't work, look for a raw literal
4245 operator taking a const char* argument consisting of the number
4246 in string format. */
4251 {
4253 tf_warning_or_error);
4256 }
4259 /* If the raw literal didn't work, look for a non-type template
4260 function with parameter pack char.... Call the function with
4261 template parameter characters representing the number. */
4265 {
4269 tf_warning_or_error);
4272 }
4281 }
4283 /* Parse a user-defined string constant. Returns a call to a user-defined
4284 literal operator taking a character pointer and the length of the string
4285 as arguments. */
4287 static tree
4289 {
4298 /* Build up a call to the user-defined operator. */
4299 /* Lookup the name we got back from the id-expression. */
4306 {
4308 tf_warning_or_error);
4311 }
4314 /* Look for a template function with typename parameter CharT
4315 and parameter pack CharT... Call the function with
4316 template parameter characters representing the string. */
4320 {
4324 tf_warning_or_error);
4327 }
4333 }
4336 /* Basic concepts [gram.basic] */
4338 /* Parse a translation-unit.
4340 translation-unit:
4341 declaration-seq [opt]
4343 Returns TRUE if all went well. */
4345 static bool
4347 {
4348 /* The address of the first non-permanent object on the declarator
4349 obstack. */
4354 /* Create the declarator obstack, if necessary. */
4356 {
4358 /* Create the error declarator. */
4360 /* Create the empty parameter list. */
4362 /* Remember where the base of the declarator obstack lies. */
4364 }
4368 /* If there are no tokens left then all went well. */
4370 {
4371 /* Get rid of the token array; we don't need it any more. */
4375 /* This file might have been a context that's implicitly extern
4376 "C". If so, pop the lang context. (Only relevant for PCH.) */
4378 {
4381 }
4383 /* Finish up. */
4387 }
4388 else
4389 {
4392 }
4394 /* Make sure the declarator obstack was fully cleaned up. */
4398 /* All went well. */
4400 }
4402 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4403 decltype context. */
4407 {
4412 }
4414 /* We're about to parse a collection of statements. If we're currently
4415 parsing tentatively, set up a firewall so that any nested
4416 cp_parser_commit_to_tentative_parse won't affect the current context. */
4418 static cp_token_position
4420 {
4427 }
4429 /* We've finished parsing the collection of statements. Wrap up the
4430 firewall and replace the relevant tokens with the parsed form. */
4432 static void
4434 tree expr)
4435 {
4439 /* Finish the firewall level. */
4441 /* And remember the result of the parse for when we try again. */
4447 }
4449 /* Like the above functions, but let the user modify the tokens. Used by
4450 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4451 later parses, so it makes sense to localize the effects of
4452 cp_parser_commit_to_tentative_parse. */
4454 struct tentative_firewall
4455 {
4460 {
4461 /* If we're currently parsing tentatively, start a committed level as a
4462 firewall and then an inner tentative parse. */
4464 {
4468 }
4469 }
4472 {
4474 {
4475 /* Finish the inner tentative parse and the firewall, propagating any
4476 uncommitted error state to the outer tentative parse. */
4482 }
4483 }
4484 };
4486 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4487 enclosing parentheses. */
4489 static cp_expr
4491 {
4494 /* Consume the '('. */
4497 /* Start the statement-expression. */
4499 /* Parse the compound-statement. */
4501 /* Finish up. */
4503 /* Consume the ')'. */
4511 }
4513 /* Expressions [gram.expr] */
4515 /* Parse a fold-operator.
4517 fold-operator:
4518 - * / % ^ & | = < > << >>
4519 = -= *= /= %= ^= &= |= <<= >>=
4520 == != <= >= && || , .* ->*
4522 This returns the tree code corresponding to the matched operator
4523 as an int. When the current token matches a compound assignment
4524 opertor, the resulting tree code is the negative value of the
4525 non-assignment operator. */
4527 static int
4529 {
4531 {
4571 }
4572 }
4574 /* Returns true if CODE indicates a binary expression, which is not allowed in
4575 the LHS of a fold-expression. More codes will need to be added to use this
4576 function in other contexts. */
4578 static bool
4580 {
4582 {
4615 }
4616 }
4618 /* If the next token is a suitable fold operator, consume it and return as
4619 the function above. */
4621 static int
4623 {
4629 }
4631 /* Parse a fold-expression.
4633 fold-expression:
4634 ( ... folding-operator cast-expression)
4635 ( cast-expression folding-operator ... )
4636 ( cast-expression folding operator ... folding-operator cast-expression)
4638 Note that the '(' and ')' are matched in primary expression. */
4640 static cp_expr
4642 {
4643 cp_id_kind pidk;
4645 // Left fold.
4647 {
4651 {
4654 }
4661 }
4666 {
4669 }
4672 {
4675 }
4678 /* The operands of a fold-expression are cast-expressions, so binary or
4679 conditional expressions are not allowed. We check this here to avoid
4680 tentative parsing. */
4690 // Right fold.
4695 {
4698 }
4701 // Binary left or right fold.
4706 }
4708 /* Parse a primary-expression.
4710 primary-expression:
4711 literal
4712 this
4713 ( expression )
4714 id-expression
4715 lambda-expression (C++11)
4717 GNU Extensions:
4719 primary-expression:
4720 ( compound-statement )
4721 __builtin_va_arg ( assignment-expression , type-id )
4722 __builtin_offsetof ( type-id , offsetof-expression )
4724 C++ Extensions:
4725 __has_nothrow_assign ( type-id )
4726 __has_nothrow_constructor ( type-id )
4727 __has_nothrow_copy ( type-id )
4728 __has_trivial_assign ( type-id )
4729 __has_trivial_constructor ( type-id )
4730 __has_trivial_copy ( type-id )
4731 __has_trivial_destructor ( type-id )
4732 __has_virtual_destructor ( type-id )
4733 __is_abstract ( type-id )
4734 __is_base_of ( type-id , type-id )
4735 __is_class ( type-id )
4736 __is_empty ( type-id )
4737 __is_enum ( type-id )
4738 __is_final ( type-id )
4739 __is_literal_type ( type-id )
4740 __is_pod ( type-id )
4741 __is_polymorphic ( type-id )
4742 __is_std_layout ( type-id )
4743 __is_trivial ( type-id )
4744 __is_union ( type-id )
4746 Objective-C++ Extension:
4748 primary-expression:
4749 objc-expression
4751 literal:
4752 __null
4754 ADDRESS_P is true iff this expression was immediately preceded by
4755 "&" and therefore might denote a pointer-to-member. CAST_P is true
4756 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4757 true iff this expression is a template argument.
4759 Returns a representation of the expression. Upon return, *IDK
4760 indicates what kind of id-expression (if any) was present. */
4762 static cp_expr
4769 {
4772 /* Assume the primary expression is not an id-expression. */
4775 /* Peek at the next token. */
4778 {
4779 /* literal:
4780 integer-literal
4781 character-literal
4782 floating-literal
4783 string-literal
4784 boolean-literal
4785 pointer-literal
4786 user-defined-literal */
4798 {
4802 }
4803 /* Floating-point literals are only allowed in an integral
4804 constant expression if they are cast to an integral or
4805 enumeration type. */
4809 {
4810 /* CAST_P will be set even in invalid code like "int(2.7 +
4811 ...)". Therefore, we have to check that the next token
4812 is sure to end the cast. */
4814 {
4819 enumerator-definition. */
4821 /* The curly brace at the end of an enum-specifier. */
4823 /* The end of a statement. */
4825 /* The end of the cast-expression. */
4827 /* The end of an array bound. */
4829 /* The closing ">" in a template-argument-list. */
4832 /* C++0x only: A ">>" treated like two ">" tokens,
4833 in a template-argument-list. */
4838 }
4840 /* If we are within a cast, then the constraint that the
4841 cast is to an integral or enumeration type will be
4842 checked at that point. If we are not within a cast, then
4843 this code is invalid. */
4846 }
4866 /* ??? Should wide strings be allowed when parser->translate_strings_p
4867 is false (i.e. in attributes)? If not, we can kill the third
4868 argument to cp_parser_string_literal. */
4874 /* If we see `( { ' then we are looking at the beginning of
4875 a GNU statement-expression. */
4878 {
4879 /* Statement-expressions are not allowed by the standard. */
4883 /* And they're not allowed outside of a function-body; you
4884 cannot, for example, write:
4886 int i = ({ int j = 3; j + 1; });
4888 at class or namespace scope. */
4891 {
4893 "statement-expressions are not allowed outside "
4899 }
4900 else
4902 }
4903 /* Otherwise it's a normal parenthesized expression. */
4904 {
4905 cp_expr expr;
4910 /* Consume the `('. */
4912 /* Within a parenthesized expression, a `>' token is always
4913 the greater-than operator. */
4914 saved_greater_than_is_operator_p
4919 /* Left fold expression. */
4921 else
4922 /* Parse the parenthesized expression. */
4927 {
4934 }
4935 else
4936 /* Let the front end know that this expression was
4937 enclosed in parentheses. This matters in case, for
4938 example, the expression is of the form `A::B', since
4939 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4940 not. */
4943 /* DR 705: Wrapping an unqualified name in parentheses
4944 suppresses arg-dependent lookup. We want to pass back
4945 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4946 (c++/37862), but none of the others. */
4950 /* The `>' token might be the end of a template-id or
4951 template-parameter-list now. */
4952 parser->greater_than_is_operator_p
4955 /* Consume the `)'. */
4964 }
4967 {
4969 {
4970 /* We might have an Objective-C++ message. */
4973 /* If that works out, we're done ... */
4976 /* ... else, fall though to see if it's a lambda. */
4977 }
4979 /* Don't warn about a failed tentative parse. */
4984 }
4988 /* We have an Objective-C++ string literal. */
4995 {
4996 /* These two are the boolean literals. */
5004 /* The `__null' literal. */
5009 /* The `nullptr' literal. */
5014 /* Recognize the `this' keyword. */
5018 {
5022 }
5023 /* Pointers cannot appear in constant-expressions. */
5028 /* The `operator' keyword can be the beginning of an
5029 id-expression. */
5036 {
5037 non_integral_constant name;
5039 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5040 __func__ are the names of variables -- but they are
5041 treated specially. Therefore, they are handled here,
5042 rather than relying on the generic id-expression logic
5043 below. Grammatically, these names are id-expressions.
5045 Consume the token. */
5049 {
5061 }
5066 /* Look up the name. */
5068 }
5071 {
5072 tree expression;
5073 tree type;
5074 source_location type_location;
5075 location_t start_loc
5077 /* The `__builtin_va_arg' construct is used to handle
5078 `va_arg'. Consume the `__builtin_va_arg' token. */
5080 /* Look for the opening `('. */
5082 /* Now, parse the assignment-expression. */
5084 /* Look for the `,'. */
5087 /* Parse the type-id. */
5088 {
5091 }
5092 /* Look for the closing `)'. */
5093 location_t finish_loc
5096 /* Using `va_arg' in a constant-expression is not
5097 allowed. */
5099 NIC_VA_ARG))
5101 /* Construct a location of the form:
5102 __builtin_va_arg (v, int)
5103 ~~~~~~~~~~~~~~~~~~~~~^~~~
5104 with the caret at the type, ranging from the start of the
5105 "__builtin_va_arg" token to the close paren. */
5106 location_t combined_loc
5109 }
5141 // C++ concepts
5145 /* Objective-C++ expressions. */
5155 {
5160 }
5161 /* FALLTHRU */
5165 }
5167 /* An id-expression can start with either an identifier, a
5168 `::' as the beginning of a qualified-id, or the "operator"
5169 keyword. */
5174 {
5175 id_expression:
5176 cp_expr id_expression;
5177 cp_expr decl;
5183 /* Parse the id-expression. */
5184 id_expression
5201 /* If we have a template-id, then no further lookup is
5202 required. If the template-id was for a template-class, we
5203 will sometimes have a TYPE_DECL at this point. */
5207 /* Look up the name. */
5208 else
5209 {
5210 tree ambiguous_decls;
5212 /* If we already know that this lookup is ambiguous, then
5213 we've already issued an error message; there's no reason
5214 to check again. */
5217 {
5220 }
5223 none_type,
5224 template_p,
5229 /* If the lookup was ambiguous, an error will already have
5230 been issued. */
5234 /* In Objective-C++, we may have an Objective-C 2.0
5235 dot-syntax for classes here. */
5240 {
5241 tree component;
5248 component);
5249 /* Build a location of the form:
5250 expr.component
5251 ~~~~~^~~~~~~~~
5252 with caret at the start of the component name (at
5253 input_location), ranging from the start of the id_expression
5254 to the end of the component name. */
5255 location_t combined_loc
5260 }
5262 /* In Objective-C++, an instance variable (ivar) may be preferred
5263 to whatever cp_parser_lookup_name() found.
5264 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5265 rest of c-family, we have to do a little extra work to preserve
5266 any location information in cp_expr "decl". Given that
5267 objc_lookup_ivar is implemented in "c-family" and "objc", we
5268 have a trip through the pure "tree" type, rather than cp_expr.
5269 Naively copying it back to "decl" would implicitly give the
5270 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5271 store an EXPR_LOCATION. Hence we only update "decl" (and
5272 hence its location_t) if we get back a different tree node. */
5274 id_expression);
5278 /* If name lookup gives us a SCOPE_REF, then the
5279 qualifying scope was dependent. */
5281 {
5282 /* At this point, we do not know if DECL is a valid
5283 integral constant expression. We assume that it is
5284 in fact such an expression, so that code like:
5286 template <int N> struct A {
5287 int a[B<N>::i];
5288 };
5290 is accepted. At template-instantiation time, we
5291 will check that B<N>::i is actually a constant. */
5293 }
5294 /* Check to see if DECL is a local variable in a context
5295 where that is forbidden. */
5298 {
5299 /* It might be that we only found DECL because we are
5300 trying to be generous with pre-ISO scoping rules.
5301 For example, consider:
5303 int i;
5304 void g() {
5305 for (int i = 0; i < 10; ++i) {}
5306 extern void f(int j = i);
5307 }
5309 Here, name look up will originally find the out
5310 of scope `i'. We need to issue a warning message,
5311 but then use the global `i'. */
5314 {
5319 }
5320 }
5321 }
5323 decl = (finish_id_expression
5325 idk,
5330 template_arg_p,
5337 }
5339 /* Anything else is an error. */
5343 }
5344 }
5352 {
5355 }
5357 /* Parse an id-expression.
5359 id-expression:
5360 unqualified-id
5361 qualified-id
5363 qualified-id:
5364 :: [opt] nested-name-specifier template [opt] unqualified-id
5365 :: identifier
5366 :: operator-function-id
5367 :: template-id
5369 Return a representation of the unqualified portion of the
5370 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5371 a `::' or nested-name-specifier.
5373 Often, if the id-expression was a qualified-id, the caller will
5374 want to make a SCOPE_REF to represent the qualified-id. This
5375 function does not do this in order to avoid wastefully creating
5376 SCOPE_REFs when they are not required.
5378 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5379 `template' keyword.
5381 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5382 uninstantiated templates.
5384 If *TEMPLATE_P is non-NULL, it is set to true iff the
5385 `template' keyword is used to explicitly indicate that the entity
5386 named is a template.
5388 If DECLARATOR_P is true, the id-expression is appearing as part of
5389 a declarator, rather than as part of an expression. */
5391 static cp_expr
5398 {
5402 /* Assume the `template' keyword was not used. */
5406 /* Look for the optional `::' operator. */
5407 global_scope_p
5410 /* Look for the optional nested-name-specifier. */
5411 nested_name_specifier_p
5414 check_dependency_p,
5416 declarator_p)
5418 /* If there is a nested-name-specifier, then we are looking at
5419 the first qualified-id production. */
5421 {
5422 tree saved_scope;
5423 tree saved_object_scope;
5424 tree saved_qualifying_scope;
5425 cp_expr unqualified_id;
5428 /* See if the next token is the `template' keyword. */
5432 /* Name lookup we do during the processing of the
5433 unqualified-id might obliterate SCOPE. */
5437 /* Process the final unqualified-id. */
5439 check_dependency_p,
5440 declarator_p,
5442 /* Restore the SAVED_SCOPE for our caller. */
5448 }
5449 /* Otherwise, if we are in global scope, then we are looking at one
5450 of the other qualified-id productions. */
5452 {
5454 tree id;
5456 /* Peek at the next token. */
5459 /* If it's an identifier, and the next token is not a "<", then
5460 we can avoid the template-id case. This is an optimization
5461 for this common case. */
5463 && !cp_parser_nth_token_starts_template_argument_list_p
5468 /* Try a template-id. */
5472 none_type,
5473 declarator_p);
5474 /* If that worked, we're done. */
5478 /* Peek at the next token. (Changes in the token buffer may
5479 have invalidated the pointer obtained above.) */
5483 {
5490 /* Fall through. */
5495 }
5496 }
5497 else
5500 declarator_p,
5501 optional_p);
5502 }
5504 /* Parse an unqualified-id.
5506 unqualified-id:
5507 identifier
5508 operator-function-id
5509 conversion-function-id
5510 ~ class-name
5511 template-id
5513 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5514 keyword, in a construct like `A::template ...'.
5516 Returns a representation of unqualified-id. For the `identifier'
5517 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5518 production a BIT_NOT_EXPR is returned; the operand of the
5519 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5520 other productions, see the documentation accompanying the
5521 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5522 names are looked up in uninstantiated templates. If DECLARATOR_P
5523 is true, the unqualified-id is appearing as part of a declarator,
5524 rather than as part of an expression. */
5526 static cp_expr
5532 {
5535 /* Peek at the next token. */
5539 {
5541 {
5542 tree id;
5544 /* We don't know yet whether or not this will be a
5545 template-id. */
5547 /* Try a template-id. */
5549 check_dependency_p,
5550 none_type,
5551 declarator_p);
5552 /* If it worked, we're done. */
5555 /* Otherwise, it's an ordinary identifier. */
5557 }
5561 check_dependency_p,
5562 none_type,
5563 declarator_p);
5566 {
5567 tree type_decl;
5568 tree qualifying_scope;
5569 tree object_scope;
5570 tree scope;
5573 /* Consume the `~' token. */
5575 /* Parse the class-name. The standard, as written, seems to
5576 say that:
5578 template <typename T> struct S { ~S (); };
5579 template <typename T> S<T>::~S() {}
5581 is invalid, since `~' must be followed by a class-name, but
5582 `S<T>' is dependent, and so not known to be a class.
5583 That's not right; we need to look in uninstantiated
5584 templates. A further complication arises from:
5586 template <typename T> void f(T t) {
5587 t.T::~T();
5588 }
5590 Here, it is not possible to look up `T' in the scope of `T'
5591 itself. We must look in both the current scope, and the
5592 scope of the containing complete expression.
5594 Yet another issue is:
5596 struct S {
5597 int S;
5598 ~S();
5599 };
5601 S::~S() {}
5603 The standard does not seem to say that the `S' in `~S'
5604 should refer to the type `S' and not the data member
5605 `S::S'. */
5607 /* DR 244 says that we look up the name after the "~" in the
5608 same scope as we looked up the qualifying name. That idea
5609 isn't fully worked out; it's more complicated than that. */
5614 /* Check for invalid scopes. */
5616 {
5620 }
5622 {
5626 scope);
5631 }
5634 /* If the name is of the form "X::~X" it's OK even if X is a
5635 typedef. */
5644 {
5647 }
5649 /* ~auto means the destructor of whatever the object is. */
5651 {
5654 "%<~auto%> only available with "
5658 }
5660 /* If there was an explicit qualification (S::~T), first look
5661 in the scope given by the qualification (i.e., S).
5663 Note: in the calls to cp_parser_class_name below we pass
5664 typename_type so that lookup finds the injected-class-name
5665 rather than the constructor. */
5669 {
5674 typename_type,
5677 declarator_p);
5680 }
5681 /* In "N::S::~S", look in "N" as well. */
5683 {
5688 type_decl
5692 typename_type,
5695 declarator_p);
5698 }
5699 /* In "p->S::~T", look in the scope given by "*p" as well. */
5701 {
5706 type_decl
5710 typename_type,
5713 declarator_p);
5716 }
5717 /* Look in the surrounding context. */
5719 {
5725 type_decl
5729 typename_type,
5732 declarator_p);
5735 {
5736 /* We couldn't find a type with this name. If we're parsing
5737 tentatively, fail and try something else. */
5739 {
5742 }
5743 /* Otherwise, accept it and check for a match at instantiation
5744 time. */
5749 }
5750 }
5751 /* If an error occurred, assume that the name of the
5752 destructor is the same as the name of the qualifying
5753 class. That allows us to keep parsing after running
5754 into ill-formed destructor names. */
5760 /* Check that destructor name and scope match. */
5762 {
5769 }
5771 /* [class.dtor]
5773 A typedef-name that names a class shall not be used as the
5774 identifier in the declarator for a destructor declaration. */
5781 type_decl);
5784 }
5788 {
5789 cp_expr id;
5791 /* This could be a template-id, so we try that first. */
5793 /* Try a template-id. */
5796 none_type,
5797 declarator_p);
5798 /* If that worked, we're done. */
5801 /* We still don't know whether we're looking at an
5802 operator-function-id or a conversion-function-id. */
5804 /* Try an operator-function-id. */
5806 /* If that didn't work, try a conversion-function-id. */
5810 {
5811 /* 17.6.3.3.5 */
5816 "literal operator suffixes not preceded by %<_%>"
5818 }
5821 }
5822 /* Fall through. */
5829 }
5830 }
5832 /* Parse an (optional) nested-name-specifier.
5834 nested-name-specifier: [C++98]
5835 class-or-namespace-name :: nested-name-specifier [opt]
5836 class-or-namespace-name :: template nested-name-specifier [opt]
5838 nested-name-specifier: [C++0x]
5839 type-name ::
5840 namespace-name ::
5841 nested-name-specifier identifier ::
5842 nested-name-specifier template [opt] simple-template-id ::
5844 PARSER->SCOPE should be set appropriately before this function is
5845 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5846 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5847 in name lookups.
5849 Sets PARSER->SCOPE to the class (TYPE) or namespace
5850 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5851 it unchanged if there is no nested-name-specifier. Returns the new
5852 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5854 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5855 part of a declaration and/or decl-specifier. */
5857 static tree
5863 {
5868 /* Remember where the nested-name-specifier starts. */
5870 {
5873 }
5876 {
5877 tree new_scope;
5878 tree old_scope;
5879 tree saved_qualifying_scope;
5882 /* Spot cases that cannot be the beginning of a
5883 nested-name-specifier. */
5886 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5887 the already parsed nested-name-specifier. */
5889 {
5890 /* Grab the nested-name-specifier and continue the loop. */
5892 /* If we originally encountered this nested-name-specifier
5893 with IS_DECLARATION set to false, we will not have
5894 resolved TYPENAME_TYPEs, so we must do so here. */
5897 {
5902 }
5905 }
5907 /* Spot cases that cannot be the beginning of a
5908 nested-name-specifier. On the second and subsequent times
5909 through the loop, we look for the `template' keyword. */
5911 ;
5912 /* A template-id can start a nested-name-specifier. */
5914 ;
5915 /* DR 743: decltype can be used in a nested-name-specifier. */
5917 ;
5918 else
5919 {
5920 /* If the next token is not an identifier, then it is
5921 definitely not a type-name or namespace-name. */
5924 /* If the following token is neither a `<' (to begin a
5925 template-id), nor a `::', then we are not looking at a
5926 nested-name-specifier. */
5932 {
5936 }
5939 && !cp_parser_nth_token_starts_template_argument_list_p
5942 }
5944 /* The nested-name-specifier is optional, so we parse
5945 tentatively. */
5948 /* Look for the optional `template' keyword, if this isn't the
5949 first time through the loop. */
5952 else
5955 /* Save the old scope since the name lookup we are about to do
5956 might destroy it. */
5959 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5960 look up names in "X<T>::I" in order to determine that "Y" is
5961 a template. So, if we have a typename at this point, we make
5962 an effort to look through it. */
5964 && !typename_keyword_p
5969 /* Parse the qualifying entity. */
5970 new_scope
5972 typename_keyword_p,
5973 template_keyword_p,
5974 check_dependency_p,
5975 type_p,
5976 is_declaration);
5977 /* Look for the `::' token. */
5980 /* If we found what we wanted, we keep going; otherwise, we're
5981 done. */
5983 {
5986 /* Restore the OLD_SCOPE since it was valid before the
5987 failed attempt at finding the last
5988 class-or-namespace-name. */
5992 /* If the next token is a decltype, and the one after that is a
5993 `::', then the decltype has failed to resolve to a class or
5994 enumeration type. Give this error even when parsing
5995 tentatively since it can't possibly be valid--and we're going
5996 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5997 won't get another chance.*/
6001 {
6008 /* As below. */
6011 }
6015 {
6016 /* If we have a non-type template-id followed by ::, it can't
6017 possibly be valid. */
6022 {
6025 {
6031 }
6032 else
6033 {
6034 /* Variable template. */
6039 }
6046 /* As below. */
6050 }
6051 }
6055 /* If the next token is an identifier, and the one after
6056 that is a `::', then any valid interpretation would have
6057 found a class-or-namespace-name. */
6063 {
6066 {
6068 {
6069 tree decl;
6070 tree ambiguous_decls;
6073 none_type,
6082 decl);
6084 {
6085 // cp_parser_lookup_name has the same diagnostic,
6086 // thus make sure to emit it at most once.
6089 {
6094 }
6096 }
6097 else
6098 {
6100 cp_parser_name_lookup_error
6103 else
6104 cp_parser_name_lookup_error
6107 }
6108 }
6111 /* Treat this as a successful nested-name-specifier
6112 due to:
6114 [basic.lookup.qual]
6116 If the name found is not a class-name (clause
6117 _class_) or namespace-name (_namespace.def_), the
6118 program is ill-formed. */
6120 }
6122 }
6124 }
6125 /* We've found one valid nested-name-specifier. */
6127 /* Name lookup always gives us a DECL. */
6130 /* Uses of "template" must be followed by actual templates. */
6142 new_scope);
6143 /* If it is a class scope, try to complete it; we are about to
6144 be looking up names inside the class. */
6146 /* Since checking types for dependency can be expensive,
6147 avoid doing it if the type is already complete. */
6149 /* Do not try to complete dependent types. */
6151 {
6153 /* If it is a typedef to current class, use the current
6154 class instead, as the typedef won't have any names inside
6155 it yet. */
6159 }
6160 /* Make sure we look in the right scope the next time through
6161 the loop. */
6163 }
6165 /* If parsing tentatively, replace the sequence of tokens that makes
6166 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6167 token. That way, should we re-parse the token stream, we will
6168 not have to repeat the effort required to do the parse, nor will
6169 we issue duplicate error messages. */
6171 {
6175 /* Reset the contents of the START token. */
6177 /* Retrieve any deferred checks. Do not pop this access checks yet
6178 so the memory will not be reclaimed during token replacing below. */
6186 /* Purge all subsequent tokens. */
6188 }
6194 }
6196 /* Parse a nested-name-specifier. See
6197 cp_parser_nested_name_specifier_opt for details. This function
6198 behaves identically, except that it will an issue an error if no
6199 nested-name-specifier is present. */
6201 static tree
6207 {
6208 tree scope;
6210 /* Look for the nested-name-specifier. */
6212 typename_keyword_p,
6213 check_dependency_p,
6214 type_p,
6215 is_declaration);
6216 /* If it was not present, issue an error message. */
6218 {
6221 }
6224 }
6226 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6227 this is either a class-name or a namespace-name (which corresponds
6228 to the class-or-namespace-name production in the grammar). For
6229 C++0x, it can also be a type-name that refers to an enumeration
6230 type or a simple-template-id.
6232 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6233 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6234 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6235 TYPE_P is TRUE iff the next name should be taken as a class-name,
6236 even the same name is declared to be another entity in the same
6237 scope.
6239 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6240 specified by the class-or-namespace-name. If neither is found the
6241 ERROR_MARK_NODE is returned. */
6243 static tree
6250 {
6251 tree saved_scope;
6252 tree saved_qualifying_scope;
6253 tree saved_object_scope;
6254 tree scope;
6258 /* DR 743: decltype can appear in a nested-name-specifier. */
6260 {
6264 {
6267 }
6271 }
6273 /* Before we try to parse the class-name, we must save away the
6274 current PARSER->SCOPE since cp_parser_class_name will destroy
6275 it. */
6279 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6280 there is no need to look for a namespace-name. */
6281 only_class_p = template_keyword_p
6286 typename_keyword_p,
6287 template_keyword_p,
6289 check_dependency_p,
6291 is_declaration,
6294 /* If that didn't work, try for a namespace-name. */
6296 {
6297 /* Restore the saved scope. */
6301 /* If we are not looking at an identifier followed by the scope
6302 resolution operator, then this is not part of a
6303 nested-name-specifier. (Note that this function is only used
6304 to parse the components of a nested-name-specifier.) */
6309 }
6312 }
6314 /* Return true if we are looking at a compound-literal, false otherwise. */
6316 static bool
6318 {
6319 /* Consume the `('. */
6324 /* Skip tokens until the next token is a closing parenthesis.
6325 If we find the closing `)', and the next token is a `{', then
6326 we are looking at a compound-literal. */
6327 bool compound_literal_p
6332 /* Roll back the tokens we skipped. */
6336 }
6338 /* Parse a postfix-expression.
6340 postfix-expression:
6341 primary-expression
6342 postfix-expression [ expression ]
6343 postfix-expression ( expression-list [opt] )
6344 simple-type-specifier ( expression-list [opt] )
6345 typename :: [opt] nested-name-specifier identifier
6346 ( expression-list [opt] )
6347 typename :: [opt] nested-name-specifier template [opt] template-id
6348 ( expression-list [opt] )
6349 postfix-expression . template [opt] id-expression
6350 postfix-expression -> template [opt] id-expression
6351 postfix-expression . pseudo-destructor-name
6352 postfix-expression -> pseudo-destructor-name
6353 postfix-expression ++
6354 postfix-expression --
6355 dynamic_cast < type-id > ( expression )
6356 static_cast < type-id > ( expression )
6357 reinterpret_cast < type-id > ( expression )
6358 const_cast < type-id > ( expression )
6359 typeid ( expression )
6360 typeid ( type-id )
6362 GNU Extension:
6364 postfix-expression:
6365 ( type-id ) { initializer-list , [opt] }
6367 This extension is a GNU version of the C99 compound-literal
6368 construct. (The C99 grammar uses `type-name' instead of `type-id',
6369 but they are essentially the same concept.)
6371 If ADDRESS_P is true, the postfix expression is the operand of the
6372 `&' operator. CAST_P is true if this expression is the target of a
6373 cast.
6375 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6376 class member access expressions [expr.ref].
6378 Returns a representation of the expression. */
6380 static cp_expr
6384 {
6386 location_t loc;
6393 /* Peek at the next token. */
6398 /* Some of the productions are determined by keywords. */
6401 {
6406 {
6407 tree type;
6408 cp_expr expression;
6412 /* All of these can be handled in the same way from the point
6413 of view of parsing. Begin by consuming the token
6414 identifying the cast. */
6417 /* New types cannot be defined in the cast. */
6419 parser->type_definition_forbidden_message
6422 /* Look for the opening `<'. */
6424 /* Parse the type to which we are casting. */
6429 /* Look for the closing `>'. */
6431 /* Restore the old message. */
6434 bool saved_greater_than_is_operator_p
6438 /* And the expression which is being cast. */
6442 RT_CLOSE_PAREN);
6446 parser->greater_than_is_operator_p
6449 /* Only type conversions to integral or enumeration types
6450 can be used in constant-expressions. */
6453 {
6456 }
6459 {
6461 postfix_expression
6465 postfix_expression
6469 postfix_expression
6471 tf_warning_or_error);
6474 postfix_expression
6479 }
6481 /* Construct a location e.g. :
6482 reinterpret_cast <int *> (expr)
6483 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6484 ranging from the start of the "*_cast" token to the final closing
6485 paren, with the caret at the start. */
6488 }
6492 {
6493 tree type;
6497 /* Consume the `typeid' token. */
6499 /* Look for the `(' token. */
6501 /* Types cannot be defined in a `typeid' expression. */
6503 parser->type_definition_forbidden_message
6505 /* We can't be sure yet whether we're looking at a type-id or an
6506 expression. */
6508 /* Try a type-id first. */
6513 /* Look for the `)' token. Otherwise, we can't be sure that
6514 we're not looking at an expression: consider `typeid (int
6515 (3))', for example. */
6517 /* If all went well, simply lookup the type-id. */
6520 /* Otherwise, fall back to the expression variant. */
6521 else
6522 {
6523 tree expression;
6525 /* Look for an expression. */
6527 /* Compute its typeid. */
6529 /* Look for the `)' token. */
6531 }
6532 /* Restore the saved message. */
6534 /* `typeid' may not appear in an integral constant expression. */
6537 }
6541 {
6542 tree type;
6543 /* The syntax permitted here is the same permitted for an
6544 elaborated-type-specifier. */
6551 }
6555 {
6556 location_t cilk_spawn_loc
6561 {
6566 }
6568 {
6573 }
6574 else
6575 {
6576 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6579 }
6581 postfix_expression =
6585 {
6589 }
6591 {
6596 }
6597 else
6598 {
6601 postfix_expression);
6602 /* Build a location of the form:
6603 _Cilk_spawn expr
6604 ~~~~~~~~~~~~^~~~
6605 with caret at the expr, ranging from the start of the
6606 _Cilk_spawn token to the end of the expression. */
6607 location_t combined_loc =
6613 }
6615 }
6620 {
6623 tree p;
6630 {
6633 }
6639 {
6642 postfix_expression
6644 else
6645 {
6649 }
6655 tf_warning_or_error);
6656 else
6657 {
6661 }
6666 postfix_expression
6670 postfix_expression
6673 else
6674 {
6678 }
6683 }
6685 }
6688 {
6689 tree type;
6691 /* If the next thing is a simple-type-specifier, we may be
6692 looking at a functional cast. We could also be looking at
6693 an id-expression. So, we try the functional cast, and if
6694 that doesn't work we fall back to the primary-expression. */
6696 /* Look for the simple-type-specifier. */
6700 CP_PARSER_FLAGS_NONE);
6702 /* Parse the cast itself. */
6704 postfix_expression
6706 /* If that worked, we're done. */
6710 /* If the functional-cast didn't work out, try a
6711 compound-literal. */
6714 {
6719 /* Avoid calling cp_parser_type_id pointlessly, see comment
6720 in cp_parser_cast_expression about c++/29234. */
6723 else
6724 {
6725 /* Parse the type. */
6730 /* Look for the `)'. */
6732 }
6734 /* If things aren't going well, there's no need to
6735 keep going. */
6737 {
6739 /* Parse the brace-enclosed initializer list. */
6742 }
6743 /* If that worked, we're definitely looking at a
6744 compound-literal expression. */
6746 {
6747 /* Warn the user that a compound literal is not
6748 allowed in standard C++. */
6751 /* For simplicity, we disallow compound literals in
6752 constant-expressions. We could
6753 allow compound literals of integer type, whose
6754 initializer was a constant, in constant
6755 expressions. Permitting that usage, as a further
6756 extension, would not change the meaning of any
6757 currently accepted programs. (Of course, as
6758 compound literals are not part of ISO C++, the
6759 standard has nothing to say.) */
6761 NIC_NCC))
6762 {
6765 }
6766 /* Form the representation of the compound-literal. */
6767 postfix_expression
6769 tf_warning_or_error);
6772 }
6773 }
6775 /* It must be a primary-expression. */
6776 postfix_expression
6779 decltype_p,
6781 }
6783 }
6785 /* Note that we don't need to worry about calling build_cplus_new on a
6786 class-valued CALL_EXPR in decltype when it isn't the end of the
6787 postfix-expression; unary_complex_lvalue will take care of that for
6788 all these cases. */
6790 /* Keep looping until the postfix-expression is complete. */
6792 {
6796 /* It is not a Koenig lookup function call. */
6797 postfix_expression
6800 /* Peek at the next token. */
6804 {
6807 {
6809 "two consecutive %<[%> shall "
6812 }
6813 postfix_expression
6815 postfix_expression,
6817 decltype_p);
6826 /* postfix-expression ( expression-list [opt] ) */
6827 {
6838 is_builtin_constant_p
6841 {
6842 /* The whole point of __builtin_constant_p is to allow
6843 non-constant expressions to appear as arguments. */
6844 saved_integral_constant_expression_p
6846 saved_non_integral_constant_expression_p
6849 }
6850 args = (cp_parser_parenthesized_expression_list
6856 {
6857 parser->integral_constant_expression_p
6859 parser->non_integral_constant_expression_p
6861 }
6864 {
6867 }
6869 /* Function calls are not permitted in
6870 constant-expressions. */
6873 NIC_FUNC_CALL))
6874 {
6878 }
6883 {
6885 {
6887 {
6890 postfix_expression
6892 complain);
6893 }
6894 else
6895 postfix_expression
6897 }
6898 /* We do not perform argument-dependent lookup if
6899 normal lookup finds a non-function, in accordance
6900 with the expected resolution of DR 218. */
6903 {
6907 /* Do not do argument dependent lookup if regular
6908 lookup finds a member function or a block-scope
6909 function declaration. [basic.lookup.argdep]/3 */
6912 {
6915 postfix_expression
6917 complain);
6918 }
6919 }
6920 }
6926 {
6935 }
6938 {
6948 {
6950 postfix_expression
6954 }
6957 {
6958 postfix_expression
6959 = (build_new_method_call
6965 complain));
6966 }
6967 else
6968 postfix_expression
6972 complain);
6973 }
6977 postfix_expression = (build_offset_ref_call_from_tree
6979 complain));
6981 /* A call to a static class member, or a namespace-scope
6982 function. */
6983 postfix_expression
6986 koenig_p,
6987 complain);
6988 else
6989 /* All other function calls. */
6990 postfix_expression
6993 koenig_p,
6994 complain);
6997 {
6999 start_loc,
7000 close_paren_loc);
7002 }
7004 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7008 }
7013 /* postfix-expression . template [opt] id-expression
7014 postfix-expression . pseudo-destructor-name
7015 postfix-expression -> template [opt] id-expression
7016 postfix-expression -> pseudo-destructor-name */
7018 /* Consume the `.' or `->' operator. */
7021 postfix_expression
7023 postfix_expression,
7030 /* postfix-expression ++ */
7031 /* Consume the `++' token. */
7033 /* Generate a representation for the complete expression. */
7034 postfix_expression
7036 POSTINCREMENT_EXPR);
7037 /* Increments may not appear in constant-expressions. */
7045 /* postfix-expression -- */
7046 /* Consume the `--' token. */
7048 /* Generate a representation for the complete expression. */
7049 postfix_expression
7051 POSTDECREMENT_EXPR);
7052 /* Decrements may not appear in constant-expressions. */
7063 return is_member_access
7064 ? postfix_expression
7066 else
7068 }
7069 }
7071 /* We should never get here. */
7074 }
7076 /* This function parses Cilk Plus array notations. If a normal array expr. is
7077 parsed then the array index is passed back to the caller through *INIT_INDEX
7078 and the function returns a NULL_TREE. If array notation expr. is parsed,
7079 then *INIT_INDEX is ignored by the caller and the function returns
7080 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7081 error_mark_node. */
7083 static tree
7085 tree array_value)
7086 {
7090 {
7093 }
7102 {
7105 }
7107 {
7108 /* Consume the ':'. */
7111 /* If we are here, then we have a case like this A[:]. */
7113 {
7117 }
7121 }
7122 else
7123 {
7124 /* If we are here, then there are three valid possibilities:
7125 1. ARRAY [ EXP ]
7126 2. ARRAY [ EXP : EXP ]
7127 3. ARRAY [ EXP : EXP : EXP ] */
7131 {
7132 /* This indicates that we have a normal array expression. */
7135 }
7137 /* Consume the ':'. */
7141 {
7144 }
7145 }
7150 {
7154 }
7160 }
7162 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7163 by cp_parser_builtin_offsetof. We're looking for
7165 postfix-expression [ expression ]
7166 postfix-expression [ braced-init-list ] (C++11)
7168 FOR_OFFSETOF is set if we're being called in that context, which
7169 changes how we deal with integer constant expressions. */
7171 static tree
7173 tree postfix_expression,
7176 {
7181 /* Consume the `[' token. */
7187 /* Parse the index expression. */
7188 /* ??? For offsetof, there is a question of what to allow here. If
7189 offsetof is not being used in an integral constant expression context,
7190 then we *could* get the right answer by computing the value at runtime.
7191 If we are in an integral constant expression context, then we might
7192 could accept any constant expression; hard to say without analysis.
7193 Rather than open the barn door too wide right away, allow only integer
7194 constant expressions here. */
7197 else
7198 {
7200 {
7207 {
7209 "braced list index is not allowed with array "
7213 }
7214 }
7216 {
7217 /* Here are have these two options:
7218 ARRAY[EXP : EXP] - Array notation expr with default
7219 stride of 1.
7220 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7221 stride. */
7223 postfix_expression);
7226 }
7227 else
7229 }
7233 /* Look for the closing `]'. */
7236 /* Build the ARRAY_REF. */
7240 /* When not doing offsetof, array references are not permitted in
7241 constant-expressions. */
7247 }
7249 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7250 by cp_parser_builtin_offsetof. We're looking for
7252 postfix-expression . template [opt] id-expression
7253 postfix-expression . pseudo-destructor-name
7254 postfix-expression -> template [opt] id-expression
7255 postfix-expression -> pseudo-destructor-name
7257 FOR_OFFSETOF is set if we're being called in that context. That sorta
7258 limits what of the above we'll actually accept, but nevermind.
7259 TOKEN_TYPE is the "." or "->" token, which will already have been
7260 removed from the stream. */
7262 static tree
7265 cp_expr postfix_expression,
7267 location_t location)
7268 {
7269 tree name;
7275 /* If this is a `->' operator, dereference the pointer. */
7278 tf_warning_or_error);
7279 /* Check to see whether or not the expression is type-dependent and
7280 not the current instantiation. */
7282 /* The identifier following the `->' or `.' is not qualified. */
7288 /* Enter the scope corresponding to the type of the object
7289 given by the POSTFIX_EXPRESSION. */
7291 {
7293 /* According to the standard, no expression should ever have
7294 reference type. Unfortunately, we do not currently match
7295 the standard in this respect in that our internal representation
7296 of an expression may have reference type even when the standard
7297 says it does not. Therefore, we have to manually obtain the
7298 underlying type here. */
7300 /* The type of the POSTFIX_EXPRESSION must be complete. */
7301 /* Unlike the object expression in other contexts, *this is not
7302 required to be of complete type for purposes of class member
7303 access (5.2.5) outside the member function body. */
7306 && !(processing_template_decl
7307 && current_class_type
7308 && (same_type_ignoring_top_level_qualifiers_p
7310 {
7313 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7315 {
7316 /* In a template, be permissive by treating an object expression
7317 of incomplete type as dependent (after a pedwarn). */
7318 diagnostic_t kind = (processing_template_decl
7319 ? DK_PEDWARN
7321 cxx_incomplete_type_diagnostic
7325 {
7328 }
7329 }
7330 }
7333 {
7334 /* Let the name lookup machinery know that we are processing a
7335 class member access expression. */
7337 /* If something went wrong, we want to be able to discern that case,
7338 as opposed to the case where there was no SCOPE due to the type
7339 of expression being dependent. */
7342 /* If the SCOPE was erroneous, make the various semantic analysis
7343 functions exit quickly -- and without issuing additional error
7344 messages. */
7347 }
7348 }
7351 /* Tell cp_parser_lookup_name that there was an object, even though it's
7352 type-dependent. */
7355 /* Assume this expression is not a pseudo-destructor access. */
7358 /* If the SCOPE is a scalar type, then, if this is a valid program,
7359 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7360 is type dependent, it can be pseudo-destructor-name or something else.
7361 Try to parse it as pseudo-destructor-name first. */
7363 {
7364 tree s;
7365 tree type;
7368 /* Parse the pseudo-destructor-name. */
7377 {
7379 postfix_expression
7382 }
7383 }
7386 {
7387 /* If the SCOPE is not a scalar type, we are looking at an
7388 ordinary class member access expression, rather than a
7389 pseudo-destructor-name. */
7392 /* Parse the id-expression. */
7393 name = (cp_parser_id_expression
7400 /* In general, build a SCOPE_REF if the member name is qualified.
7401 However, if the name was not dependent and has already been
7402 resolved; there is no need to build the SCOPE_REF. For example;
7404 struct X { void f(); };
7405 template <typename T> void f(T* t) { t->X::f(); }
7407 Even though "t" is dependent, "X::f" is not and has been resolved
7408 to a BASELINK; there is no need to include scope information. */
7410 /* But we do need to remember that there was an explicit scope for
7411 virtual function calls. */
7415 /* If the name is a template-id that names a type, we will get a
7416 TYPE_DECL here. That is invalid code. */
7418 {
7421 }
7422 else
7423 {
7425 {
7427 {
7431 }
7432 else
7435 name,
7436 template_p);
7440 }
7442 adjust_result_of_qualified_name_lookup
7444 postfix_expression
7446 template_p,
7447 tf_warning_or_error);
7448 /* Build a location e.g.:
7449 ptr->access_expr
7450 ~~~^~~~~~~~~~~~~
7451 where the caret is at the deref token, ranging from
7452 the start of postfix_expression to the end of the access expr. */
7453 location_t end_loc
7455 location_t combined_loc
7458 }
7459 }
7461 /* We no longer need to look up names in the scope of the object on
7462 the left-hand side of the `.' or `->' operator. */
7465 /* Outside of offsetof, these operators may not appear in
7466 constant-expressions. */
7468 && (cp_parser_non_integral_constant_expression
7473 }
7475 /* Parse a parenthesized expression-list.
7477 expression-list:
7478 assignment-expression
7479 expression-list, assignment-expression
7481 attribute-list:
7482 expression-list
7483 identifier
7484 identifier, expression-list
7486 CAST_P is true if this expression is the target of a cast.
7488 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7489 argument pack.
7491 Returns a vector of trees. Each element is a representation of an
7492 assignment-expression. NULL is returned if the ( and or ) are
7493 missing. An empty, but allocated, vector is returned on no
7494 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7495 if we are parsing an attribute list for an attribute that wants a
7496 plain identifier argument, normal_attr for an attribute that wants
7497 an expression, or non_attr if we aren't parsing an attribute list. If
7498 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7499 not all of the expressions in the list were constant.
7500 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7501 will be written to with the location of the closing parenthesis. If
7502 an error occurs, it may or may not be written to. */
7511 {
7517 /* Assume all the expressions will be constant. */
7526 /* Within a parenthesized expression, a `>' token is always
7527 the greater-than operator. */
7528 saved_greater_than_is_operator_p
7532 /* Consume expressions until there are no more. */
7535 {
7536 tree expr;
7538 /* At the beginning of attribute lists, check to see if the
7539 next token is an identifier. */
7542 {
7545 /* Consume the identifier. */
7547 /* Save the identifier. */
7549 }
7550 else
7551 {
7554 /* Parse the next assignment-expression. */
7556 {
7557 /* A braced-init-list. */
7563 }
7565 {
7566 expr = (cp_parser_constant_expression
7571 }
7572 else
7574 cast_p);
7579 /* If we have an ellipsis, then this is an expression
7580 expansion. */
7583 {
7584 /* Consume the `...'. */
7587 /* Build the argument pack. */
7589 }
7591 /* Add it to the list. We add error_mark_node
7592 expressions to the list, so that we can still tell if
7593 the correct form for a parenthesized expression-list
7594 is found. That gives better errors. */
7599 }
7601 /* After the first item, attribute lists look the same as
7602 expression lists. */
7605 get_comma:;
7606 /* If the next token isn't a `,', then we are done. */
7610 /* Otherwise, consume the `,' and keep going. */
7612 }
7618 {
7621 skip_comma:;
7622 /* We try and resync to an unnested comma, as that will give the
7623 user better diagnostics. */
7631 {
7632 parser->greater_than_is_operator_p
7635 }
7636 }
7638 parser->greater_than_is_operator_p
7645 }
7647 /* Parse a pseudo-destructor-name.
7649 pseudo-destructor-name:
7650 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7651 :: [opt] nested-name-specifier template template-id :: ~ type-name
7652 :: [opt] nested-name-specifier [opt] ~ type-name
7654 If either of the first two productions is used, sets *SCOPE to the
7655 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7656 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7657 or ERROR_MARK_NODE if the parse fails. */
7659 static void
7661 tree object,
7664 {
7667 /* Handle ~auto. */
7671 {
7674 "%<~auto%> only available with "
7681 }
7683 /* Assume that things will not work out. */
7686 /* Look for the optional `::' operator. */
7688 /* Look for the optional nested-name-specifier. */
7689 nested_name_specifier_p
7696 /* Now, if we saw a nested-name-specifier, we might be doing the
7697 second production. */
7700 {
7701 /* Consume the `template' keyword. */
7703 /* Parse the template-id. */
7707 class_type,
7709 /* Look for the `::' token. */
7711 }
7712 /* If the next token is not a `~', then there might be some
7713 additional qualification. */
7715 {
7716 /* At this point, we're looking for "type-name :: ~". The type-name
7717 must not be a class-name, since this is a pseudo-destructor. So,
7718 it must be either an enum-name, or a typedef-name -- both of which
7719 are just identifiers. So, we peek ahead to check that the "::"
7720 and "~" tokens are present; if they are not, then we can avoid
7721 calling type_name. */
7725 {
7728 }
7730 /* Look for the type-name. */
7735 /* Look for the `::' token. */
7737 }
7738 else
7741 /* Look for the `~'. */
7744 /* Once we see the ~, this has to be a pseudo-destructor. */
7748 /* Look for the type-name again. We are not responsible for
7749 checking that it matches the first type-name. */
7751 }
7753 /* Parse a unary-expression.
7755 unary-expression:
7756 postfix-expression
7757 ++ cast-expression
7758 -- cast-expression
7759 unary-operator cast-expression
7760 sizeof unary-expression
7761 sizeof ( type-id )
7762 alignof ( type-id ) [C++0x]
7763 new-expression
7764 delete-expression
7766 GNU Extensions:
7768 unary-expression:
7769 __extension__ cast-expression
7770 __alignof__ unary-expression
7771 __alignof__ ( type-id )
7772 alignof unary-expression [C++0x]
7773 __real__ cast-expression
7774 __imag__ cast-expression
7775 && identifier
7776 sizeof ( type-id ) { initializer-list , [opt] }
7777 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7778 __alignof__ ( type-id ) { initializer-list , [opt] }
7780 ADDRESS_P is true iff the unary-expression is appearing as the
7781 operand of the `&' operator. CAST_P is true if this expression is
7782 the target of a cast.
7784 Returns a representation of the expression. */
7786 static cp_expr
7789 {
7793 /* Peek at the next token. */
7795 /* Some keywords give away the kind of expression. */
7797 {
7801 {
7804 {
7807 location_t first_loc;
7810 /* Consume the token. */
7813 /* Parse the operand. */
7818 else
7819 {
7820 /* ISO C++ defines alignof only with types, not with
7821 expressions. So pedwarn if alignof is used with a non-
7822 type expression. However, __alignof__ is ok. */
7825 "ISO C++ does not allow %<alignof%> "
7829 }
7830 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7831 SIZEOF_EXPR with the original operand. */
7833 {
7835 {
7837 {
7840 error_mark_node));
7842 }
7843 else
7847 }
7849 }
7851 }
7860 {
7861 /* The saved value of the PEDANTIC flag. */
7863 tree expr;
7865 /* Save away the PEDANTIC flag. */
7867 /* Parse the cast-expression. */
7869 /* Restore the PEDANTIC flag. */
7873 }
7877 {
7878 tree expression;
7880 /* Consume the `__real__' or `__imag__' token. */
7882 /* Parse the cast-expression. */
7884 /* Create the complete representation. */
7888 expression,
7889 tf_warning_or_error);
7890 }
7898 {
7899 tree expr;
7909 parser->type_definition_forbidden_message
7912 saved_integral_constant_expression_p
7914 saved_non_integral_constant_expression_p
7918 saved_greater_than_is_operator_p
7930 parser->greater_than_is_operator_p
7933 parser->integral_constant_expression_p
7935 parser->non_integral_constant_expression_p
7942 }
7946 }
7947 }
7949 /* Look for the `:: new' and `:: delete', which also signal the
7950 beginning of a new-expression, or delete-expression,
7951 respectively. If the next token is `::', then it might be one of
7952 these. */
7954 {
7957 /* See if the token after the `::' is one of the keywords in
7958 which we're interested. */
7960 /* If it's `new', we have a new-expression. */
7963 /* Similarly, for `delete'. */
7966 }
7968 /* Look for a unary operator. */
7970 /* The `++' and `--' operators can be handled similarly, even though
7971 they are not technically unary-operators in the grammar. */
7973 {
7978 /* Handle the GNU address-of-label extension. */
7981 {
7982 tree identifier;
7983 tree expression;
7986 /* Consume the '&&' token. */
7988 /* Look for the identifier. */
7989 location_t finish_loc
7992 /* Construct a location of the form:
7993 &&label
7994 ^~~~~~~
7995 with caret==start at the "&&", finish at the end of the label. */
7996 location_t combined_loc
7998 /* Create an expression representing the address. */
8001 NIC_ADDR_LABEL))
8004 }
8005 }
8007 {
8008 cp_expr cast_expression;
8014 /* Consume the operator token. */
8018 /* Parse the cast-expression. */
8019 cast_expression
8024 pidk);
8026 /* Make a location:
8027 OP_TOKEN CAST_EXPRESSION
8028 ^~~~~~~~~~~~~~~~~~~~~~~~~
8029 with start==caret at the operator token, and
8030 extending to the end of the cast_expression. */
8033 /* Now, build an appropriate representation. */
8035 {
8039 RO_UNARY_STAR,
8040 complain);
8041 /* TODO: build_x_indirect_ref does not always honor the
8042 location, so ensure it is set. */
8048 /* Fall through. */
8051 cast_expression,
8052 complain);
8053 /* TODO: build_x_unary_op does not always honor the location,
8054 so ensure it is set. */
8062 /* Fall through. */
8064 /* Immediately fold negation of a constant, unless the constant is 0
8065 (since -0 == 0) or it would overflow. */
8070 {
8073 cast_expression);
8075 {
8078 }
8079 }
8080 /* Fall through. */
8089 }
8093 non_constant_p))
8097 }
8101 decltype_p,
8102 pidk);
8103 }
8105 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8106 unary-operator, the corresponding tree code is returned. */
8108 static enum tree_code
8110 {
8112 {
8133 }
8134 }
8136 /* Parse a new-expression.
8138 new-expression:
8139 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8140 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8142 Returns a representation of the expression. */
8144 static tree
8146 {
8149 tree type;
8152 tree ret;
8156 /* Look for the optional `::' operator. */
8157 global_scope_p
8161 /* Look for the `new' operator. */
8163 /* There's no easy way to tell a new-placement from the
8164 `( type-id )' construct. */
8166 /* Look for a new-placement. */
8168 /* If that didn't work out, there's no new-placement. */
8170 {
8174 }
8176 /* If the next token is a `(', then we have a parenthesized
8177 type-id. */
8179 {
8183 /* Consume the `('. */
8186 /* Parse the type-id. */
8187 parser->type_definition_forbidden_message
8189 {
8192 }
8195 /* Look for the closing `)'. */
8198 /* There should not be a direct-new-declarator in this production,
8199 but GCC used to allowed this, so we check and emit a sensible error
8200 message for this case. */
8202 {
8208 }
8209 }
8210 /* Otherwise, there must be a new-type-id. */
8211 else
8214 /* If the next token is a `(' or '{', then we have a new-initializer. */
8219 else
8222 /* A new-expression may not appear in an integral constant
8223 expression. */
8226 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8227 of a new-type-id or type-id of a new-expression, the new-expression shall
8228 contain a new-initializer of the form ( assignment-expression )".
8229 Additionally, consistently with the spirit of DR 1467, we want to accept
8230 'new auto { 2 }' too. */
8236 {
8238 "initialization of new-expression for type %<auto%> "
8241 }
8242 else
8243 {
8244 /* Construct a location e.g.:
8245 ptr = new int[100]
8246 ^~~~~~~~~~~~
8247 with caret == start at the start of the "new" token, and the end
8248 at the end of the final token we consumed. */
8253 /* Create a representation of the new-expression. */
8255 tf_warning_or_error);
8257 }
8265 }
8267 /* Parse a new-placement.
8269 new-placement:
8270 ( expression-list )
8272 Returns the same representation as for an expression-list. */
8276 {
8279 /* Parse the expression-list. */
8280 expression_list = (cp_parser_parenthesized_expression_list
8289 }
8291 /* Parse a new-type-id.
8293 new-type-id:
8294 type-specifier-seq new-declarator [opt]
8296 Returns the TYPE allocated. If the new-type-id indicates an array
8297 type, *NELTS is set to the number of elements in the last array
8298 bound; the TYPE will not include the last array bound. */
8300 static tree
8302 {
8303 cp_decl_specifier_seq type_specifier_seq;
8309 /* The type-specifier sequence must not contain type definitions.
8310 (It cannot contain declarations of new types either, but if they
8311 are not definitions we will catch that because they are not
8312 complete.) */
8314 parser->type_definition_forbidden_message
8316 /* Parse the type-specifier-seq. */
8320 /* Restore the old message. */
8326 /* Parse the new-declarator. */
8329 /* Determine the number of elements in the last array dimension, if
8330 any. */
8332 /* Skip down to the last array dimension. */
8337 {
8340 }
8345 {
8348 }
8351 {
8358 else
8360 }
8363 }
8365 /* Parse an (optional) new-declarator.
8367 new-declarator:
8368 ptr-operator new-declarator [opt]
8369 direct-new-declarator
8371 Returns the declarator. */
8375 {
8378 cp_cv_quals cv_quals;
8380 /* We don't know if there's a ptr-operator next, or not. */
8382 /* Look for a ptr-operator. */
8384 /* If that worked, look for more new-declarators. */
8386 {
8389 /* Parse another optional declarator. */
8392 declarator = cp_parser_make_indirect_declarator
8396 }
8398 /* If the next token is a `[', there is a direct-new-declarator. */
8403 }
8405 /* Parse a direct-new-declarator.
8407 direct-new-declarator:
8408 [ expression ]
8409 direct-new-declarator [constant-expression]
8411 */
8415 {
8419 {
8420 tree expression;
8423 /* Look for the opening `['. */
8428 /* The standard requires that the expression have integral
8429 type. DR 74 adds enumeration types. We believe that the
8430 real intent is that these expressions be handled like the
8431 expression in a `switch' condition, which also allows
8432 classes with a single conversion to integral or
8433 enumeration type. */
8435 {
8436 expression
8438 expression,
8441 {
8443 "expression in new-declarator must have integral "
8446 }
8447 }
8449 /* Look for the closing `]'. */
8452 /* Add this bound to the declarator. */
8455 /* If the next token is not a `[', then there are no more
8456 bounds. */
8459 }
8462 }
8464 /* Parse a new-initializer.
8466 new-initializer:
8467 ( expression-list [opt] )
8468 braced-init-list
8470 Returns a representation of the expression-list. */
8474 {
8478 {
8479 tree t;
8486 }
8487 else
8488 expression_list = (cp_parser_parenthesized_expression_list
8494 }
8496 /* Parse a delete-expression.
8498 delete-expression:
8499 :: [opt] delete cast-expression
8500 :: [opt] delete [ ] cast-expression
8502 Returns a representation of the expression. */
8504 static tree
8506 {
8509 tree expression;
8511 /* Look for the optional `::' operator. */
8512 global_scope_p
8516 /* Look for the `delete' keyword. */
8518 /* See if the array syntax is in use. */
8520 {
8521 /* Consume the `[' token. */
8523 /* Look for the `]' token. */
8525 /* Remember that this is the `[]' construct. */
8527 }
8528 else
8531 /* Parse the cast-expression. */
8534 /* A delete-expression may not appear in an integral constant
8535 expression. */
8540 tf_warning_or_error);
8541 }
8543 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8544 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8545 0 otherwise. */
8547 static int
8549 {
8552 {
8594 /* In ((type ()) () the last () isn't a valid cast-expression,
8595 so the whole must be parsed as postfix-expression. */
8600 /* '[' may start a primary-expression in obj-c++ and in C++11,
8601 as a lambda-expression, eg, '(void)[]{}'. */
8608 /* '++' and '--' may or may not start a cast-expression:
8610 struct T { void operator++(int); };
8611 void f() { (T())++; }
8613 vs
8615 int a;
8616 (int)++a; */
8621 }
8622 }
8624 /* Parse a cast-expression.
8626 cast-expression:
8627 unary-expression
8628 ( type-id ) cast-expression
8630 ADDRESS_P is true iff the unary-expression is appearing as the
8631 operand of the `&' operator. CAST_P is true if this expression is
8632 the target of a cast.
8634 Returns a representation of the expression. */
8636 static cp_expr
8639 {
8640 /* If it's a `(', then we might be looking at a cast. */
8642 {
8648 /* There's no way to know yet whether or not this is a cast.
8649 For example, `(int (3))' is a unary-expression, while `(int)
8650 3' is a cast. So, we resort to parsing tentatively. */
8652 /* Types may not be defined in a cast. */
8654 parser->type_definition_forbidden_message
8656 /* Consume the `('. */
8660 /* A very tricky bit is that `(struct S) { 3 }' is a
8661 compound-literal (which we permit in C++ as an extension).
8662 But, that construct is not a cast-expression -- it is a
8663 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8664 is legal; if the compound-literal were a cast-expression,
8665 you'd need an extra set of parentheses.) But, if we parse
8666 the type-id, and it happens to be a class-specifier, then we
8667 will commit to the parse at that point, because we cannot
8668 undo the action that is done when creating a new class. So,
8669 then we cannot back up and do a postfix-expression.
8671 Another tricky case is the following (c++/29234):
8673 struct S { void operator () (); };
8675 void foo ()
8676 {
8677 ( S()() );
8678 }
8680 As a type-id we parse the parenthesized S()() as a function
8681 returning a function, groktypename complains and we cannot
8682 back up in this case either.
8684 Therefore, we scan ahead to the closing `)', and check to see
8685 if the tokens after the `)' can start a cast-expression. Otherwise
8686 we are dealing with an unary-expression, a postfix-expression
8687 or something else.
8689 Yet another tricky case, in C++11, is the following (c++/54891):
8691 (void)[]{};
8693 The issue is that usually, besides the case of lambda-expressions,
8694 the parenthesized type-id cannot be followed by '[', and, eg, we
8695 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8696 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8697 we don't commit, we try a cast-expression, then an unary-expression.
8699 Save tokens so that we can put them back. */
8702 /* We may be looking at a cast-expression. */
8705 cast_expression
8708 /* Roll back the tokens we skipped. */
8710 /* If we aren't looking at a cast-expression, simulate an error so
8711 that the call to cp_parser_error_occurred below returns true. */
8714 else
8715 {
8718 /* Look for the type-id. */
8720 /* Look for the closing `)'. */
8723 }
8725 /* Restore the saved message. */
8728 /* At this point this can only be either a cast or a
8729 parenthesized ctor such as `(T ())' that looks like a cast to
8730 function returning T. */
8732 {
8733 /* Only commit if the cast-expression doesn't start with
8734 '++', '--', or '[' in C++11. */
8742 pidk);
8745 {
8746 /* Warn about old-style casts, if so requested. */
8753 /* Only type conversions to integral or enumeration types
8754 can be used in constant-expressions. */
8757 NIC_CAST))
8760 /* Perform the cast. */
8761 /* Make a location:
8762 (TYPE) EXPR
8763 ^~~~~~~~~~~
8764 with start==caret at the open paren, extending to the
8765 end of "expr". */
8767 open_paren_loc,
8771 }
8772 }
8773 else
8775 }
8777 /* If we get here, then it's not a cast, so it must be a
8778 unary-expression. */
8781 }
8783 /* Parse a binary expression of the general form:
8785 pm-expression:
8786 cast-expression
8787 pm-expression .* cast-expression
8788 pm-expression ->* cast-expression
8790 multiplicative-expression:
8791 pm-expression
8792 multiplicative-expression * pm-expression
8793 multiplicative-expression / pm-expression
8794 multiplicative-expression % pm-expression
8796 additive-expression:
8797 multiplicative-expression
8798 additive-expression + multiplicative-expression
8799 additive-expression - multiplicative-expression
8801 shift-expression:
8802 additive-expression
8803 shift-expression << additive-expression
8804 shift-expression >> additive-expression
8806 relational-expression:
8807 shift-expression
8808 relational-expression < shift-expression
8809 relational-expression > shift-expression
8810 relational-expression <= shift-expression
8811 relational-expression >= shift-expression
8813 GNU Extension:
8815 relational-expression:
8816 relational-expression <? shift-expression
8817 relational-expression >? shift-expression
8819 equality-expression:
8820 relational-expression
8821 equality-expression == relational-expression
8822 equality-expression != relational-expression
8824 and-expression:
8825 equality-expression
8826 and-expression & equality-expression
8828 exclusive-or-expression:
8829 and-expression
8830 exclusive-or-expression ^ and-expression
8832 inclusive-or-expression:
8833 exclusive-or-expression
8834 inclusive-or-expression | exclusive-or-expression
8836 logical-and-expression:
8837 inclusive-or-expression
8838 logical-and-expression && inclusive-or-expression
8840 logical-or-expression:
8841 logical-and-expression
8842 logical-or-expression || logical-and-expression
8844 All these are implemented with a single function like:
8846 binary-expression:
8847 simple-cast-expression
8848 binary-expression <token> binary-expression
8850 CAST_P is true if this expression is the target of a cast.
8852 The binops_by_token map is used to get the tree codes for each <token> type.
8853 binary-expressions are associated according to a precedence table. */
8855 #define TOKEN_PRECEDENCE(token) \
8856 (((token->type == CPP_GREATER \
8857 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8858 && !parser->greater_than_is_operator_p) \
8859 ? PREC_NOT_OPERATOR \
8860 : binops_by_token[token->type].prec)
8862 static cp_expr
8868 {
8869 cp_parser_expression_stack stack;
8871 cp_parser_expression_stack_entry current;
8872 cp_expr rhs;
8876 tree overload;
8878 /* Parse the first expression. */
8889 {
8890 /* Get an operator token. */
8896 {
8898 "%<>>%> operator is treated"
8902 }
8907 /* This is a fold-expression; handle it later. */
8910 /* Popping an entry off the stack means we completed a subexpression:
8911 - either we found a token which is not an operator (`>' where it is not
8912 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8913 will happen repeatedly;
8914 - or, we found an operator which has lower priority. This is the case
8915 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8916 parsing `3 * 4'. */
8918 {
8921 else
8923 }
8925 get_rhs:
8929 /* We used the operator token. */
8932 /* For "false && x" or "true || x", x will never be executed;
8933 disable warnings while evaluating it. */
8935 c_inhibit_evaluation_warnings +=
8938 c_inhibit_evaluation_warnings +=
8941 /* Extract another operand. It may be the RHS of this expression
8942 or the LHS of a new, higher priority expression. */
8947 /* Get another operator token. Look up its precedence to avoid
8948 building a useless (immediately popped) stack entry for common
8949 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8956 {
8957 /* ... and prepare to parse the RHS of the new, higher priority
8958 expression. Since precedence levels on the stack are
8959 monotonically increasing, we do not have to care about
8960 stack overflows. */
8969 pop:
8971 /* If the stack is not empty, we have parsed into LHS the right side
8972 (`4' in the example above) of an expression we had suspended.
8973 We can use the information on the stack to recover the LHS (`3')
8974 from the stack together with the tree code (`MULT_EXPR'), and
8975 the precedence of the higher level subexpression
8976 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8977 which will be used to actually build the additive expression. */
8982 }
8984 /* Undo the disabling of warnings done above. */
8986 c_inhibit_evaluation_warnings -=
8989 c_inhibit_evaluation_warnings -=
8995 /* Avoid warning for !!x == y. */
9000 /* Avoid warning for !b == y where b is boolean. */
9004 /* Avoid warning for !!b == y where b is boolean. */
9017 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9018 ERROR_MARK for everything that is not a binary expression.
9019 This makes warn_about_parentheses miss some warnings that
9020 involve unary operators. For unary expressions we should
9021 pass the correct tree_code unless the unary expression was
9022 surrounded by parentheses.
9023 */
9030 == tcc_comparison
9033 else
9034 {
9039 /* TODO: build_x_binary_op doesn't always honor the location. */
9041 }
9044 /* If the binary operator required the use of an overloaded operator,
9045 then this expression cannot be an integral constant-expression.
9046 An overloaded operator can be used even if both operands are
9047 otherwise permissible in an integral constant-expression if at
9048 least one of the operands is of enumeration type. */
9052 NIC_OVERLOADED))
9054 }
9057 }
9059 static cp_expr
9064 {
9067 }
9069 /* Parse the `? expression : assignment-expression' part of a
9070 conditional-expression. The LOGICAL_OR_EXPR is the
9071 logical-or-expression that started the conditional-expression.
9072 Returns a representation of the entire conditional-expression.
9074 This routine is used by cp_parser_assignment_expression.
9076 ? expression : assignment-expression
9078 GNU Extensions:
9080 ? : assignment-expression */
9082 static tree
9084 {
9086 cp_expr assignment_expr;
9090 /* Consume the `?' token. */
9095 {
9098 /* Implicit true clause. */
9100 c_inhibit_evaluation_warnings +=
9103 }
9104 else
9105 {
9108 /* Parse the expression. */
9109 c_inhibit_evaluation_warnings +=
9112 c_inhibit_evaluation_warnings +=
9116 }
9118 /* The next token should be a `:'. */
9120 /* Parse the assignment-expression. */
9122 c_inhibit_evaluation_warnings -=
9125 /* Make a location:
9126 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9127 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9128 with the caret at the "?", ranging from the start of
9129 the logical_or_expr to the end of the assignment_expr. */
9134 /* Build the conditional-expression. */
9136 expr,
9137 assignment_expr,
9138 tf_warning_or_error);
9139 }
9141 /* Parse an assignment-expression.
9143 assignment-expression:
9144 conditional-expression
9145 logical-or-expression assignment-operator assignment_expression
9146 throw-expression
9148 CAST_P is true if this expression is the target of a cast.
9149 DECLTYPE_P is true if this expression is the operand of decltype.
9151 Returns a representation for the expression. */
9153 static cp_expr
9156 {
9157 cp_expr expr;
9159 /* If the next token is the `throw' keyword, then we're looking at
9160 a throw-expression. */
9163 /* Otherwise, it must be that we are looking at a
9164 logical-or-expression. */
9165 else
9166 {
9167 /* Parse the binary expressions (logical-or-expression). */
9169 decltype_p,
9171 /* If the next token is a `?' then we're actually looking at a
9172 conditional-expression. */
9175 else
9176 {
9179 /* If it's an assignment-operator, we're using the second
9180 production. */
9181 enum tree_code assignment_operator
9184 {
9187 /* Parse the right-hand side of the assignment. */
9194 /* An assignment may not appear in a
9195 constant-expression. */
9197 NIC_ASSIGNMENT))
9199 /* Build the assignment expression. Its default
9200 location:
9201 LHS = RHS
9202 ~~~~^~~~~
9203 is the location of the '=' token as the
9204 caret, ranging from the start of the lhs to the
9205 end of the rhs. */
9210 assignment_operator,
9211 rhs,
9213 /* TODO: build_x_modify_expr doesn't honor the location,
9214 so we must set it here. */
9216 }
9217 }
9218 }
9221 }
9223 /* Parse an (optional) assignment-operator.
9225 assignment-operator: one of
9226 = *= /= %= += -= >>= <<= &= ^= |=
9228 GNU Extension:
9230 assignment-operator: one of
9231 <?= >?=
9233 If the next token is an assignment operator, the corresponding tree
9234 code is returned, and the token is consumed. For example, for
9235 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9236 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9237 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9238 operator, ERROR_MARK is returned. */
9240 static enum tree_code
9242 {
9246 /* Peek at the next token. */
9250 {
9296 /* Nothing else is an assignment operator. */
9298 }
9300 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9305 /* If it was an assignment operator, consume it. */
9310 }
9312 /* Parse an expression.
9314 expression:
9315 assignment-expression
9316 expression , assignment-expression
9318 CAST_P is true if this expression is the target of a cast.
9319 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9320 except possibly parenthesized or on the RHS of a comma (N3276).
9322 Returns a representation of the expression. */
9324 static cp_expr
9327 {
9332 {
9333 cp_expr assignment_expression;
9335 /* Parse the next assignment-expression. */
9336 assignment_expression
9339 /* We don't create a temporary for a call that is the immediate operand
9340 of decltype or on the RHS of a comma. But when we see a comma, we
9341 need to create a temporary for a call on the LHS. */
9346 assignment_expression
9350 /* If this is the first assignment-expression, we can just
9351 save it away. */
9354 else
9355 {
9356 /* Create a location with caret at the comma, ranging
9357 from the start of the LHS to the end of the RHS. */
9362 assignment_expression,
9365 }
9366 /* If the next token is not a comma, or we're in a fold-expression, then
9367 we are done with the expression. */
9371 /* Consume the `,'. */
9374 /* A comma operator cannot appear in a constant-expression. */
9377 }
9380 }
9382 /* Parse a constant-expression.
9384 constant-expression:
9385 conditional-expression
9387 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9388 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9389 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9390 is false, NON_CONSTANT_P should be NULL. */
9392 static cp_expr
9396 {
9400 cp_expr expression;
9402 /* It might seem that we could simply parse the
9403 conditional-expression, and then check to see if it were
9404 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9405 one that the compiler can figure out is constant, possibly after
9406 doing some simplifications or optimizations. The standard has a
9407 precise definition of constant-expression, and we must honor
9408 that, even though it is somewhat more restrictive.
9410 For example:
9412 int i[(2, 3)];
9414 is not a legal declaration, because `(2, 3)' is not a
9415 constant-expression. The `,' operator is forbidden in a
9416 constant-expression. However, GCC's constant-folding machinery
9417 will fold this operation to an INTEGER_CST for `3'. */
9419 /* Save the old settings. */
9421 saved_allow_non_integral_constant_expression_p
9424 /* We are now parsing a constant-expression. */
9426 parser->allow_non_integral_constant_expression_p
9429 /* Although the grammar says "conditional-expression", we parse an
9430 "assignment-expression", which also permits "throw-expression"
9431 and the use of assignment operators. In the case that
9432 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9433 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9434 actually essential that we look for an assignment-expression.
9435 For example, cp_parser_initializer_clauses uses this function to
9436 determine whether a particular assignment-expression is in fact
9437 constant. */
9439 /* Restore the old settings. */
9440 parser->integral_constant_expression_p
9442 parser->allow_non_integral_constant_expression_p
9445 {
9446 /* Require an rvalue constant expression here; that's what our
9447 callers expect. Reference constant expressions are handled
9448 separately in e.g. cp_parser_template_argument. */
9453 }
9456 parser->non_integral_constant_expression_p
9460 }
9462 /* Parse __builtin_offsetof.
9464 offsetof-expression:
9465 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9467 offsetof-member-designator:
9468 id-expression
9469 | offsetof-member-designator "." id-expression
9470 | offsetof-member-designator "[" expression "]"
9471 | offsetof-member-designator "->" id-expression */
9473 static cp_expr
9475 {
9477 tree type;
9478 cp_expr expr;
9479 cp_id_kind dummy;
9481 location_t finish_loc;
9483 /* We're about to accept non-integral-constant things, but will
9484 definitely yield an integral constant expression. Save and
9485 restore these values around our local parsing. */
9491 /* Consume the "__builtin_offsetof" token. */
9493 /* Consume the opening `('. */
9495 /* Parse the type-id. */
9498 /* Look for the `,'. */
9502 /* Build the (type *)null that begins the traditional offsetof macro. */
9503 tree object_ptr
9505 tf_warning_or_error);
9507 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9511 {
9514 {
9516 /* offsetof-member-designator "[" expression "]" */
9522 /* offsetof-member-designator "->" identifier */
9525 /* FALLTHRU */
9528 /* offsetof-member-designator "." identifier */
9536 /* Consume the ")" token. */
9542 /* Error. We know the following require will fail, but
9543 that gives the proper error message. */
9548 }
9549 }
9551 success:
9552 /* Make a location of the form:
9553 __builtin_offsetof (struct s, f)
9554 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9555 with caret at the type-id, ranging from the start of the
9556 "_builtin_offsetof" token to the close paren. */
9558 /* The result will be an INTEGER_CST, so we need to explicitly
9559 preserve the location. */
9562 failure:
9567 }
9569 /* Parse a trait expression.
9571 Returns a representation of the expression, the underlying type
9572 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9574 static tree
9576 {
9577 cp_trait_kind kind;
9583 {
9674 }
9676 /* Consume the token. */
9681 {
9684 }
9690 {
9693 {
9696 }
9700 }
9702 {
9704 {
9708 {
9711 }
9715 }
9716 }
9720 /* Complete the trait expression, which may mean either processing
9721 the trait expr now or saving it for template instantiation. */
9723 {
9732 }
9733 }
9735 /* Lambdas that appear in variable initializer or default argument scope
9736 get that in their mangling, so we need to record it. We might as well
9737 use the count for function and namespace scopes as well. */
9741 {
9742 tree t;
9744 };
9747 static void
9749 {
9750 tree_int ti;
9752 /* Once we're inside a function, we ignore other scopes and just push
9753 the function again so that popping works properly. */
9760 {
9761 /* Don't reset the count if we're still in the same function. */
9764 }
9765 }
9767 static void
9769 {
9772 }
9774 static void
9776 {
9779 {
9782 }
9784 }
9786 /* Parse a lambda expression.
9788 lambda-expression:
9789 lambda-introducer lambda-declarator [opt] compound-statement
9791 Returns a representation of the expression. */
9793 static cp_expr
9795 {
9797 tree type;
9805 {
9807 {
9811 }
9813 }
9815 {
9817 {
9820 }
9822 }
9824 /* We may be in the middle of deferred access check. Disable
9825 it now. */
9836 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9839 /* Now that we've started the type, add the capture fields for any
9840 explicit captures. */
9843 {
9844 /* Inside the class, surrounding template-parameter-lists do not apply. */
9845 unsigned int saved_num_template_parameter_lists
9849 bool fully_implicit_function_template_p
9853 bool auto_is_implicit_function_template_parm_p
9864 /* By virtue of defining a local class, a lambda expression has access to
9865 the private variables of enclosing classes. */
9873 {
9878 }
9880 {
9883 }
9885 /* The capture list was built up in reverse order; fix that now. */
9897 parser->fully_implicit_function_template_p
9901 parser->auto_is_implicit_function_template_parm_p
9903 }
9905 /* This field is only used during parsing of the lambda. */
9908 /* This lambda shouldn't have any proxies left at this point. */
9910 /* And now that we're done, push proxies for an enclosing lambda. */
9915 else
9923 }
9925 /* Parse the beginning of a lambda expression.
9927 lambda-introducer:
9928 [ lambda-capture [opt] ]
9930 LAMBDA_EXPR is the current representation of the lambda expression. */
9932 static void
9934 {
9935 /* Need commas after the first capture. */
9938 /* Eat the leading `['. */
9941 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9949 {
9952 }
9955 {
9957 tree capture_id;
9958 tree capture_init_expr;
9962 enum capture_kind_type
9963 {
9964 BY_COPY,
9965 BY_REFERENCE
9966 };
9970 {
9973 }
9977 else
9980 /* Possibly capture `this'. */
9982 {
9992 explicit_init_p);
9994 }
9996 /* Possibly capture `*this'. */
9999 {
10010 explicit_init_p);
10012 }
10014 /* Remember whether we want to capture as a reference or not. */
10016 {
10019 }
10021 /* Get the identifier. */
10026 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10027 delimiters, but I modified this to stop on unnested ']' as well. It
10028 was already changed to stop on unnested '}', so the
10029 "closing_parenthesis" name is no more misleading with my change. */
10030 {
10036 }
10038 /* Find the initializer for this capture. */
10042 {
10044 /* An explicit initializer exists. */
10047 "lambda capture initializers "
10053 {
10056 }
10057 }
10058 else
10059 {
10062 /* Turn the identifier into an id-expression. */
10063 capture_init_expr
10068 {
10071 }
10075 {
10078 capture_init_expr);
10082 }
10085 {
10088 capture_init_expr))
10092 }
10094 capture_init_expr
10095 = finish_id_expression
10097 capture_init_expr,
10111 {
10114 }
10115 else
10117 }
10121 {
10126 capture_id);
10130 "capture of %qD redundant with by-reference capture "
10132 }
10135 capture_id,
10136 capture_init_expr,
10138 explicit_init_p);
10139 }
10142 }
10144 /* Parse the (optional) middle of a lambda expression.
10146 lambda-declarator:
10147 < template-parameter-list [opt] >
10148 ( parameter-declaration-clause [opt] )
10149 attribute-specifier [opt]
10150 decl-specifier-seq [opt]
10151 exception-specification [opt]
10152 lambda-return-type-clause [opt]
10154 LAMBDA_EXPR is the current representation of the lambda expression. */
10156 static bool
10158 {
10159 /* 5.1.1.4 of the standard says:
10160 If a lambda-expression does not include a lambda-declarator, it is as if
10161 the lambda-declarator were ().
10162 This means an empty parameter list, no attributes, and no exception
10163 specification. */
10169 cp_decl_specifier_seq lambda_specs;
10172 /* The template-parameter-list is optional, but must begin with
10173 an opening angle if present. */
10175 {
10178 "lambda templates are only available with "
10180 else
10190 /* We just processed one more parameter list. */
10192 }
10194 /* The parameter-declaration-clause is optional (unless
10195 template-parameter-list was given), but must begin with an
10196 opening parenthesis if present. */
10198 {
10203 /* Parse parameters. */
10206 /* Default arguments shall not be specified in the
10207 parameter-declaration-clause of a lambda-declarator. */
10218 /* In the decl-specifier-seq of the lambda-declarator, each
10219 decl-specifier shall either be mutable or constexpr. */
10223 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10226 {
10231 }
10235 /* Parse optional exception specification. */
10238 /* Parse optional trailing return type. */
10240 {
10244 }
10246 /* The function parameters must be in scope all the way until after the
10247 trailing-return-type in case of decltype. */
10249 }
10253 /* Create the function call operator.
10255 Messing with declarators like this is no uglier than building up the
10256 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10257 other code. */
10258 {
10259 cp_decl_specifier_seq return_type_specs;
10261 tree fco;
10268 else
10269 /* Maybe we will deduce the return type later. */
10273 {
10277 else
10280 }
10285 sfk_none);
10290 VIRT_SPEC_UNSPECIFIED,
10291 REF_QUAL_NONE,
10292 tx_qual,
10293 exception_spec,
10299 declarator,
10300 attributes);
10302 {
10305 /* Give the object parameter a different name. */
10309 }
10311 {
10315 }
10324 }
10325 }
10327 /* Parse the body of a lambda expression, which is simply
10329 compound-statement
10331 but which requires special handling.
10332 LAMBDA_EXPR is the current representation of the lambda expression. */
10334 static void
10336 {
10341 else
10342 /* Still increment function_depth so that we don't GC in the
10343 middle of an expression. */
10347 /* Clear this in case we're in the middle of a default argument. */
10350 /* Finish the function call operator
10351 - class_specifier
10352 + late_parsing_for_member
10353 + function_definition_after_declarator
10354 + ctor_initializer_opt_and_function_body */
10355 {
10357 tree body;
10359 tree compound_stmt;
10360 tree cap;
10362 /* Let the front end know that we are going to be defining this
10363 function. */
10365 NULL_TREE,
10374 /* Push the proxies for any explicit captures. */
10381 /* 5.1.1.4 of the standard says:
10382 If a lambda-expression does not include a trailing-return-type, it
10383 is as if the trailing-return-type denotes the following type:
10384 * if the compound-statement is of the form
10385 { return attribute-specifier [opt] expression ; }
10386 the type of the returned expression after lvalue-to-rvalue
10387 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10388 (_conv.array_ 4.2), and function-to-pointer conversion
10389 (_conv.func_ 4.3);
10390 * otherwise, void. */
10392 /* In a lambda that has neither a lambda-return-type-clause
10393 nor a deducible form, errors should be reported for return statements
10394 in the body. Since we used void as the placeholder return type, parsing
10395 the body as usual will give such desired behavior. */
10399 {
10403 /* Parse tentatively in case there's more after the initial return
10404 statement. */
10415 {
10417 {
10422 }
10424 /* Will get error here if type not deduced yet. */
10428 }
10429 }
10432 {
10437 }
10441 out:
10445 /* Finish the function and generate code for it if necessary. */
10448 /* Only expand if the call op is not a template. */
10451 }
10457 else
10459 }
10461 /* Statements [gram.stmt.stmt] */
10463 /* Parse a statement.
10465 statement:
10466 labeled-statement
10467 expression-statement
10468 compound-statement
10469 selection-statement
10470 iteration-statement
10471 jump-statement
10472 declaration-statement
10473 try-block
10475 C++11:
10477 statement:
10478 labeled-statement
10479 attribute-specifier-seq (opt) expression-statement
10480 attribute-specifier-seq (opt) compound-statement
10481 attribute-specifier-seq (opt) selection-statement
10482 attribute-specifier-seq (opt) iteration-statement
10483 attribute-specifier-seq (opt) jump-statement
10484 declaration-statement
10485 attribute-specifier-seq (opt) try-block
10487 init-statement:
10488 expression-statement
10489 simple-declaration
10491 TM Extension:
10493 statement:
10494 atomic-statement
10496 IN_COMPOUND is true when the statement is nested inside a
10497 cp_parser_compound_statement; this matters for certain pragmas.
10499 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10500 is a (possibly labeled) if statement which is not enclosed in braces
10501 and has an else clause. This is used to implement -Wparentheses.
10503 CHAIN is a vector of if-else-if conditions. */
10505 static void
10508 {
10513 restart:
10516 /* There is no statement yet. */
10522 /* In obj-c++, seeing '[[' might be the either the beginning of
10523 c++11 attributes, or a nested objc-message-expression. So
10524 let's parse the c++11 attributes tentatively. */
10528 {
10531 }
10533 /* Peek at the next token. */
10535 /* Remember the location of the first token in the statement. */
10537 /* If this is a keyword, then that will often determine what kind of
10538 statement we have. */
10540 {
10544 {
10547 /* Looks like a labeled-statement with a case label.
10548 Parse the label, and then use tail recursion to parse
10549 the statement. */
10567 {
10572 }
10573 else
10587 {
10592 }
10593 else
10594 {
10598 }
10602 /* Objective-C++ exception-handling constructs. */
10616 /* This must be a namespace alias definition. */
10632 /* It might be a keyword like `int' that can start a
10633 declaration-statement. */
10635 }
10636 }
10638 {
10639 /* If the next token is a `:', then we are looking at a
10640 labeled-statement. */
10643 {
10644 /* Looks like a labeled-statement with an ordinary label.
10645 Parse the label, and then use tail recursion to parse
10646 the statement. */
10651 }
10652 }
10653 /* Anything that starts with a `{' must be a compound-statement. */
10656 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10657 a statement all its own. */
10659 {
10660 /* Only certain OpenMP pragmas are attached to statements, and thus
10661 are considered statements themselves. All others are not. In
10662 the context of a compound, accept the pragma as a "statement" and
10663 return so that we can check for a close brace. Otherwise we
10664 require a real statement and must go back and read one. */
10670 }
10672 {
10675 }
10677 /* Everything else must be a declaration-statement or an
10678 expression-statement. Try for the declaration-statement
10679 first, unless we are looking at a `;', in which case we know that
10680 we have an expression-statement. */
10682 {
10684 {
10686 {
10687 /* Attributes should be parsed as part of the the
10688 declaration, so let's un-parse them. */
10691 }
10694 /* Try to parse the declaration-statement. */
10696 /* If that worked, we're done. */
10699 }
10700 /* Look for an expression-statement instead. */
10703 /* Handle [[fallthrough]];. */
10705 {
10706 /* The next token after the fallthrough attribute is ';'. */
10708 {
10709 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10711 IFN_FALLTHROUGH,
10714 }
10715 else
10719 }
10720 }
10722 /* Set the line number for the statement. */
10726 /* Allow "[[fallthrough]];", but warn otherwise. */
10729 OPT_Wattributes,
10731 }
10733 /* Parse the label for a labeled-statement, i.e.
10735 identifier :
10736 case constant-expression :
10737 default :
10739 GNU Extension:
10740 case constant-expression ... constant-expression : statement
10742 When a label is parsed without errors, the label is added to the
10743 parse tree by the finish_* functions, so this function doesn't
10744 have to return the label. */
10746 static void
10748 {
10753 /* The next token should be an identifier. */
10757 {
10760 }
10762 /* Remember whether this case or a user-defined label is allowed to fall
10763 through to. */
10768 {
10770 {
10774 /* Consume the `case' token. */
10776 /* Parse the constant-expression. */
10783 {
10784 /* Consume the `...' token. */
10790 /* We don't need to emit warnings here, as the common code
10791 will do this for us. */
10792 }
10793 else
10797 {
10801 }
10802 else
10805 expr);
10806 }
10810 /* Consume the `default' token. */
10814 {
10818 }
10819 else
10824 /* Anything else must be an ordinary label. */
10829 }
10831 /* Require the `:' token. */
10834 /* An ordinary label may optionally be followed by attributes.
10835 However, this is only permitted if the attributes are then
10836 followed by a semicolon. This is because, for backward
10837 compatibility, when parsing
10838 lab: __attribute__ ((unused)) int i;
10839 we want the attribute to attach to "i", not "lab". */
10842 {
10843 tree attrs;
10850 ;
10851 else
10853 }
10859 }
10861 /* Parse an expression-statement.
10863 expression-statement:
10864 expression [opt] ;
10866 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10867 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10868 indicates whether this expression-statement is part of an
10869 expression statement. */
10871 static tree
10873 {
10878 /* There might be attribute fallthrough. */
10881 /* If the next token is a ';', then there is no expression
10882 statement. */
10884 {
10888 {
10891 }
10892 }
10894 /* Handle [[fallthrough]];. */
10896 {
10897 /* The next token after the fallthrough attribute is ';'. */
10899 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10902 else
10906 }
10908 /* Allow "[[fallthrough]];", but warn otherwise. */
10913 /* Give a helpful message for "A<T>::type t;" and the like. */
10916 {
10923 {
10924 /* A::A a; */
10929 }
10930 }
10932 /* Consume the final `;'. */
10937 /* This is the final expression statement of a statement
10938 expression. */
10944 }
10946 /* Parse a compound-statement.
10948 compound-statement:
10949 { statement-seq [opt] }
10951 GNU extension:
10953 compound-statement:
10954 { label-declaration-seq [opt] statement-seq [opt] }
10956 label-declaration-seq:
10957 label-declaration
10958 label-declaration-seq label-declaration
10960 Returns a tree representing the statement. */
10962 static tree
10965 {
10966 tree compound_stmt;
10968 /* Consume the `{'. */
10975 /* Begin the compound-statement. */
10977 /* If the next keyword is `__label__' we have a label declaration. */
10980 /* Parse an (optional) statement-seq. */
10982 /* Finish the compound-statement. */
10984 /* Consume the `}'. */
10988 }
10990 /* Parse an (optional) statement-seq.
10992 statement-seq:
10993 statement
10994 statement-seq [opt] statement */
10996 static void
10998 {
10999 /* Scan statements until there aren't any more. */
11001 {
11004 /* If we are looking at a `}', then we have run out of
11005 statements; the same is true if we have reached the end
11006 of file, or have stumbled upon a stray '@end'. */
11013 /* If we are in a compound statement and find 'else' then
11014 something went wrong. */
11016 {
11019 else
11020 {
11023 }
11024 }
11026 /* Parse the statement. */
11028 }
11029 }
11031 /* Return true if we're looking at (init; cond), false otherwise. */
11033 static bool
11035 {
11036 /* Save tokens so that we can put them back. */
11039 /* Look for ';' that is not nested in () or {}. */
11042 CPP_SEMICOLON,
11045 /* Roll back the tokens we skipped. */
11049 }
11051 /* Parse a selection-statement.
11053 selection-statement:
11054 if ( init-statement [opt] condition ) statement
11055 if ( init-statement [opt] condition ) statement else statement
11056 switch ( init-statement [opt] condition ) statement
11058 Returns the new IF_STMT or SWITCH_STMT.
11060 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11061 is a (possibly labeled) if statement which is not enclosed in
11062 braces and has an else clause. This is used to implement
11063 -Wparentheses.
11065 CHAIN is a vector of if-else-if conditions. This is used to implement
11066 -Wduplicated-cond. */
11068 static tree
11071 {
11074 token_indent_info guard_tinfo;
11079 /* Peek at the next token. */
11083 /* See what kind of keyword it is. */
11086 {
11089 {
11090 tree statement;
11091 tree condition;
11096 RID_CONSTEXPR))
11097 {
11103 }
11105 /* Look for the `('. */
11107 {
11110 }
11112 /* Begin the selection-statement. */
11114 {
11117 }
11118 else
11121 /* Parse the optional init-statement. */
11123 {
11124 tree decl;
11127 "init-statement in selection statements only available "
11130 }
11132 /* Parse the condition. */
11134 /* Look for the `)'. */
11140 {
11144 /* Add the condition. */
11151 /* Parse the then-clause. */
11155 /* Outside a template, the non-selected branch of a constexpr
11156 if is a 'discarded statement', i.e. unevaluated. */
11161 {
11164 }
11167 guard_tinfo);
11174 {
11178 }
11180 /* If the next token is `else', parse the else-clause. */
11182 RID_ELSE))
11183 {
11187 {
11190 }
11192 guard_tinfo
11194 /* Consume the `else' keyword. */
11197 {
11199 RID_IF)
11201 {
11202 /* We've got "if (COND) else if (COND2)". Start
11203 the condition chain and add COND as the first
11204 element. */
11208 {
11209 /* Wrap it in a NOP_EXPR so that we can set the
11210 location of the condition. */
11212 condition);
11215 }
11216 }
11218 RID_IF))
11219 {
11220 /* This is if-else without subsequent if. Zap the
11221 condition chain; we would have already warned at
11222 this point. */
11225 }
11226 }
11228 /* Parse the else-clause. */
11234 /* If we are currently parsing a then-clause, then
11235 IF_P will not be NULL. We set it to true to
11236 indicate that this if statement has an else clause.
11237 This may trigger the Wparentheses warning below
11238 when we get back up to the parent if statement. */
11243 {
11247 }
11248 }
11249 else
11250 {
11251 /* This if statement does not have an else clause. If
11252 NESTED_IF is true, then the then-clause has an if
11253 statement which does have an else clause. We warn
11254 about the potential ambiguity. */
11257 "suggest explicit braces to avoid ambiguous"
11260 {
11261 /* We don't need the condition chain anymore. */
11264 }
11265 }
11267 /* Now we're all done with the if-statement. */
11269 }
11270 else
11271 {
11275 /* Add the condition. */
11278 /* Parse the body of the switch-statement. */
11284 guard_tinfo);
11288 /* Now we're all done with the switch-statement. */
11290 }
11293 }
11299 }
11300 }
11302 /* Parse a condition.
11304 condition:
11305 expression
11306 type-specifier-seq declarator = initializer-clause
11307 type-specifier-seq declarator braced-init-list
11309 GNU Extension:
11311 condition:
11312 type-specifier-seq declarator asm-specification [opt]
11313 attributes [opt] = assignment-expression
11315 Returns the expression that should be tested. */
11317 static tree
11319 {
11320 cp_decl_specifier_seq type_specifiers;
11324 /* Try the declaration first. */
11326 /* New types are not allowed in the type-specifier-seq for a
11327 condition. */
11329 parser->type_definition_forbidden_message
11331 /* Parse the type-specifier-seq. */
11333 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11336 /* Restore the saved message. */
11338 /* If all is well, we might be looking at a declaration. */
11340 {
11341 tree decl;
11342 tree asm_specification;
11343 tree attributes;
11347 /* Parse the declarator. */
11353 /* Parse the attributes. */
11355 /* Parse the asm-specification. */
11357 /* If the next token is not an `=' or '{', then we might still be
11358 looking at an expression. For example:
11360 if (A(a).x)
11362 looks like a decl-specifier-seq and a declarator -- but then
11363 there is no `=', so this is an expression. */
11368 /* If we did see an `=' or '{', then we are looking at a declaration
11369 for sure. */
11371 {
11372 tree pushed_scope;
11376 /* Create the declaration. */
11382 /* Parse the initializer. */
11384 {
11388 }
11389 else
11390 {
11391 /* Consume the `='. */
11394 }
11398 /* Process the initializer. */
11401 asm_specification,
11402 flags);
11408 }
11409 }
11410 /* If we didn't even get past the declarator successfully, we are
11411 definitely not looking at a declaration. */
11412 else
11415 /* Otherwise, we are looking at an expression. */
11417 }
11419 /* Parses a for-statement or range-for-statement until the closing ')',
11420 not included. */
11422 static tree
11424 {
11428 /* Begin the for-statement. */
11431 /* Parse the initialization. */
11436 else
11438 }
11440 static tree
11442 {
11443 /* Normal for loop */
11446 tree stmt;
11449 /* The init-statement has already been parsed in
11450 cp_parser_init_statement, so no work is needed here. */
11453 /* If there's a condition, process it. */
11457 {
11461 }
11463 /* Look for the `;'. */
11466 /* If there's an expression, process it. */
11472 }
11474 /* Tries to parse a range-based for-statement:
11476 range-based-for:
11477 decl-specifier-seq declarator : expression
11479 The decl-specifier-seq declarator and the `:' are already parsed by
11480 cp_parser_init_statement. If processing_template_decl it returns a
11481 newly created RANGE_FOR_STMT; if not, it is converted to a
11482 regular FOR_STMT. */
11484 static tree
11487 {
11494 /* Get the range declaration momentarily out of the way so that
11495 the range expression doesn't clash with it. */
11497 {
11499 {
11501 /* For decomposition declaration get all of the corresponding
11502 declarations out of the way. */
11506 {
11512 {
11518 }
11519 }
11520 }
11522 {
11527 }
11528 }
11531 {
11534 }
11535 else
11538 /* Put the range declaration(s) back into scope. */
11540 {
11544 }
11546 /* If in template, STMT is converted to a normal for-statement
11547 at instantiation. If not, it is done just ahead. */
11549 {
11557 /* do_auto_deduction doesn't mess with template init-lists. */
11560 }
11561 else
11562 {
11566 }
11568 }
11570 /* Subroutine of cp_convert_range_for: given the initializer expression,
11571 builds up the range temporary. */
11573 static tree
11575 {
11578 /* Find out the type deduced by the declaration
11579 `auto &&__range = range_expr'. */
11584 /* Create the __range variable. */
11591 }
11593 /* Used by cp_parser_range_for in template context: we aren't going to
11594 do a full conversion yet, but we still need to resolve auto in the
11595 type of the for-range-declaration if present. This is basically
11596 a shortcut version of cp_convert_range_for. */
11598 static void
11600 {
11603 {
11606 iter_type = (cp_parser_perform_range_for_lookup
11609 {
11611 iter_type);
11613 tf_warning_or_error);
11616 }
11617 }
11618 }
11620 /* Converts a range-based for-statement into a normal
11621 for-statement, as per the definition.
11623 for (RANGE_DECL : RANGE_EXPR)
11624 BLOCK
11626 should be equivalent to:
11628 {
11629 auto &&__range = RANGE_EXPR;
11630 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11631 __begin != __end;
11632 ++__begin)
11633 {
11634 RANGE_DECL = *__begin;
11635 BLOCK
11636 }
11637 }
11639 If RANGE_EXPR is an array:
11640 BEGIN_EXPR = __range
11641 END_EXPR = __range + ARRAY_SIZE(__range)
11642 Else if RANGE_EXPR has a member 'begin' or 'end':
11643 BEGIN_EXPR = __range.begin()
11644 END_EXPR = __range.end()
11645 Else:
11646 BEGIN_EXPR = begin(__range)
11647 END_EXPR = end(__range);
11649 If __range has a member 'begin' but not 'end', or vice versa, we must
11650 still use the second alternative (it will surely fail, however).
11651 When calling begin()/end() in the third alternative we must use
11652 argument dependent lookup, but always considering 'std' as an associated
11653 namespace. */
11655 tree
11659 {
11665 /* If an error happened previously do nothing or else a lot of
11666 unhelpful errors would be issued. */
11668 else
11669 {
11670 tree range_temp;
11674 /* Can't bind a reference to an array of runtime bound. */
11676 else
11677 {
11682 LOOKUP_ONLYCONVERTING);
11684 }
11687 }
11689 /* The new for initialization statement. */
11697 LOOKUP_ONLYCONVERTING);
11708 LOOKUP_ONLYCONVERTING);
11712 /* The new for condition. */
11719 /* The new increment expression. */
11722 tf_warning_or_error);
11725 /* The declaration is initialized with *__begin inside the loop body. */
11728 tf_warning_or_error),
11730 LOOKUP_ONLYCONVERTING);
11735 }
11737 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11738 We need to solve both at the same time because the method used
11739 depends on the existence of members begin or end.
11740 Returns the type deduced for the iterator expression. */
11742 static tree
11744 {
11746 {
11749 }
11752 {
11757 }
11759 {
11760 /* If RANGE is an array, we will use pointer arithmetic. */
11763 range,
11767 }
11768 else
11769 {
11770 /* If it is not an array, we must do a bit of magic. */
11780 tf_warning_or_error);
11783 tf_warning_or_error);
11786 {
11787 /* Use the member functions. */
11790 else
11796 else
11799 }
11800 else
11801 {
11802 /* Use global functions with ADL. */
11809 tf_warning_or_error);
11811 tf_warning_or_error);
11813 tf_warning_or_error);
11815 tf_warning_or_error);
11818 }
11820 /* Last common checks. */
11822 {
11823 /* If one of the expressions is an error do no more checks. */
11826 }
11829 /* Can happen, when, eg, in a template context, Koenig lookup
11830 can't resolve begin/end (c++/58503). */
11832 else
11833 {
11835 /* The unqualified type of the __begin and __end temporaries should
11836 be the same, as required by the multiple auto declaration. */
11838 {
11845 /* P0184R0 allows __begin and __end to have different types,
11846 but make sure they are comparable so we can give a better
11848 else
11852 }
11854 }
11855 }
11856 }
11858 /* Helper function for cp_parser_perform_range_for_lookup.
11859 Builds a tree for RANGE.IDENTIFIER(). */
11861 static tree
11863 {
11876 tf_warning_or_error);
11879 }
11881 /* Parse an iteration-statement.
11883 iteration-statement:
11884 while ( condition ) statement
11885 do statement while ( expression ) ;
11886 for ( init-statement condition [opt] ; expression [opt] )
11887 statement
11889 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11891 static tree
11893 {
11896 tree statement;
11898 token_indent_info guard_tinfo;
11900 /* Peek at the next token. */
11907 /* Remember whether or not we are already within an iteration
11908 statement. */
11911 /* See what kind of keyword it is. */
11914 {
11916 {
11917 tree condition;
11919 /* Begin the while-statement. */
11921 /* Look for the `('. */
11923 /* Parse the condition. */
11926 /* Look for the `)'. */
11928 /* Parse the dependent statement. */
11932 /* We're done with the while-statement. */
11934 }
11938 {
11939 tree expression;
11941 /* Begin the do-statement. */
11943 /* Parse the body of the do-statement. */
11948 /* Look for the `while' keyword. */
11950 /* Look for the `('. */
11952 /* Parse the expression. */
11954 /* We're done with the do-statement. */
11956 /* Look for the `)'. */
11958 /* Look for the `;'. */
11960 }
11964 {
11965 /* Look for the `('. */
11970 /* Look for the `)'. */
11973 /* Parse the body of the for-statement. */
11978 /* We're done with the for-statement. */
11980 }
11987 }
11990 }
11992 /* Parse a init-statement or the declarator of a range-based-for.
11993 Returns true if a range-based-for declaration is seen.
11995 init-statement:
11996 expression-statement
11997 simple-declaration */
11999 static bool
12001 {
12002 /* If the next token is a `;', then we have an empty
12003 expression-statement. Grammatically, this is also a
12004 simple-declaration, but an invalid one, because it does not
12005 declare anything. Therefore, if we did not handle this case
12006 specially, we would issue an error message about an invalid
12007 declaration. */
12009 {
12013 /* A colon is used in range-based for. */
12016 /* We're going to speculatively look for a declaration, falling back
12017 to an expression, if necessary. */
12019 /* Parse the declaration. */
12022 decl);
12025 {
12026 /* It is a range-for, consume the ':' */
12030 {
12032 "range-based %<for%> loops only available with "
12035 }
12036 }
12037 else
12038 /* The ';' is not consumed yet because we told
12039 cp_parser_simple_declaration not to. */
12044 /* If the tentative parse failed, then we shall need to look for an
12045 expression-statement. */
12046 }
12047 /* If we are here, it is an expression-statement. */
12050 }
12052 /* Parse a jump-statement.
12054 jump-statement:
12055 break ;
12056 continue ;
12057 return expression [opt] ;
12058 return braced-init-list ;
12059 goto identifier ;
12061 GNU extension:
12063 jump-statement:
12064 goto * expression ;
12066 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12068 static tree
12070 {
12076 /* Peek at the next token. */
12081 /* See what kind of keyword it is. */
12084 {
12088 {
12108 }
12114 {
12121 /* Fall through. */
12131 }
12136 {
12137 tree expr;
12141 {
12145 }
12148 else
12149 /* If the next token is a `;', then there is no
12150 expression. */
12152 /* Build the return-statement. */
12155 else
12157 /* Look for the final `;'. */
12159 }
12165 {
12168 }
12170 /* Create the goto-statement. */
12172 {
12173 /* Issue a warning about this use of a GNU extension. */
12175 /* Consume the '*' token. */
12177 /* Parse the dependent expression. */
12179 }
12180 else
12182 /* Look for the final `;'. */
12189 }
12192 }
12194 /* Parse a declaration-statement.
12196 declaration-statement:
12197 block-declaration */
12199 static void
12201 {
12204 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12207 /* Parse the block-declaration. */
12210 /* Free any declarators allocated. */
12212 }
12214 /* Some dependent statements (like `if (cond) statement'), are
12215 implicitly in their own scope. In other words, if the statement is
12216 a single statement (as opposed to a compound-statement), it is
12217 none-the-less treated as if it were enclosed in braces. Any
12218 declarations appearing in the dependent statement are out of scope
12219 after control passes that point. This function parses a statement,
12220 but ensures that is in its own scope, even if it is not a
12221 compound-statement.
12223 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12224 is a (possibly labeled) if statement which is not enclosed in
12225 braces and has an else clause. This is used to implement
12226 -Wparentheses.
12228 CHAIN is a vector of if-else-if conditions. This is used to implement
12229 -Wduplicated-cond.
12231 Returns the new statement. */
12233 static tree
12237 {
12238 tree statement;
12240 token_indent_info body_tinfo
12246 /* Mark if () ; with a special NOP_EXPR. */
12248 {
12259 }
12260 /* if a compound is opened, we simply parse the statement directly. */
12263 /* If the token is not a `{', then we must take special action. */
12264 else
12265 {
12266 /* Create a compound-statement. */
12268 /* Parse the dependent-statement. */
12270 /* Finish the dummy compound-statement. */
12272 }
12274 token_indent_info next_tinfo
12278 /* Return the statement. */
12280 }
12282 /* For some dependent statements (like `while (cond) statement'), we
12283 have already created a scope. Therefore, even if the dependent
12284 statement is a compound-statement, we do not want to create another
12285 scope. */
12287 static void
12290 {
12291 /* If the token is a `{', then we must take special action. */
12293 {
12294 token_indent_info body_tinfo
12298 token_indent_info next_tinfo
12301 }
12302 else
12303 {
12304 /* Avoid calling cp_parser_compound_statement, so that we
12305 don't create a new scope. Do everything else by hand. */
12307 /* If the next keyword is `__label__' we have a label declaration. */
12310 /* Parse an (optional) statement-seq. */
12313 }
12314 }
12316 /* Declarations [gram.dcl.dcl] */
12318 /* Parse an optional declaration-sequence.
12320 declaration-seq:
12321 declaration
12322 declaration-seq declaration */
12324 static void
12326 {
12328 {
12339 {
12340 /* A declaration consisting of a single semicolon is
12341 invalid. Allow it unless we're being pedantic. */
12346 }
12348 /* If we're entering or exiting a region that's implicitly
12349 extern "C", modify the lang context appropriately. */
12351 {
12354 }
12356 {
12359 }
12362 {
12363 /* A top-level declaration can consist solely of a #pragma.
12364 A nested declaration cannot, so this is done here and not
12365 in cp_parser_declaration. (A #pragma at block scope is
12366 handled in cp_parser_statement.) */
12369 }
12371 /* Parse the declaration itself. */
12373 }
12374 }
12376 /* Parse a declaration.
12378 declaration:
12379 block-declaration
12380 function-definition
12381 template-declaration
12382 explicit-instantiation
12383 explicit-specialization
12384 linkage-specification
12385 namespace-definition
12387 C++17:
12388 deduction-guide
12390 GNU extension:
12392 declaration:
12393 __extension__ declaration */
12395 static void
12397 {
12398 cp_token token1;
12399 cp_token token2;
12404 /* Check for the `__extension__' keyword. */
12406 {
12407 /* Parse the qualified declaration. */
12409 /* Restore the PEDANTIC flag. */
12413 }
12415 /* Try to figure out what kind of declaration is present. */
12420 else
12421 {
12424 }
12426 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12429 /* If the next token is `extern' and the following token is a string
12430 literal, then we have a linkage specification. */
12434 /* If the next token is `template', then we have either a template
12435 declaration, an explicit instantiation, or an explicit
12436 specialization. */
12438 {
12439 /* `template <>' indicates a template specialization. */
12443 /* `template <' indicates a template declaration. */
12446 /* Anything else must be an explicit instantiation. */
12447 else
12449 }
12450 /* If the next token is `export', then we have a template
12451 declaration. */
12454 /* If the next token is `extern', 'static' or 'inline' and the one
12455 after that is `template', we have a GNU extended explicit
12456 instantiation directive. */
12463 /* If the next token is `namespace', check for a named or unnamed
12464 namespace definition. */
12473 /* An unnamed namespace definition. */
12477 /* An inline (associated) namespace definition. */
12481 /* Objective-C++ declaration/definition. */
12488 /* At this point we may have a template declared by a concept
12489 introduction. */
12494 else
12495 /* Try to parse a block-declaration, or a function-definition. */
12498 /* Free any declarators allocated. */
12500 }
12502 /* Parse a block-declaration.
12504 block-declaration:
12505 simple-declaration
12506 asm-definition
12507 namespace-alias-definition
12508 using-declaration
12509 using-directive
12511 GNU Extension:
12513 block-declaration:
12514 __extension__ block-declaration
12516 C++0x Extension:
12518 block-declaration:
12519 static_assert-declaration
12521 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12522 part of a declaration-statement. */
12524 static void
12527 {
12531 /* Check for the `__extension__' keyword. */
12533 {
12534 /* Parse the qualified declaration. */
12536 /* Restore the PEDANTIC flag. */
12540 }
12542 /* Peek at the next token to figure out which kind of declaration is
12543 present. */
12546 /* If the next keyword is `asm', we have an asm-definition. */
12548 {
12552 }
12553 /* If the next keyword is `namespace', we have a
12554 namespace-alias-definition. */
12557 /* If the next keyword is `using', we have a
12558 using-declaration, a using-directive, or an alias-declaration. */
12560 {
12565 /* If the token after `using' is `namespace', then we have a
12566 using-directive. */
12570 /* If the second token after 'using' is '=', then we have an
12571 alias-declaration. */
12577 /* Otherwise, it's a using-declaration. */
12578 else
12581 }
12582 /* If the next keyword is `__label__' we have a misplaced label
12583 declaration. */
12585 {
12589 /* If the next token is now a `;', consume it. */
12592 }
12593 /* If the next token is `static_assert' we have a static assertion. */
12596 /* Anything else must be a simple-declaration. */
12597 else
12600 }
12602 /* Parse a simple-declaration.
12604 simple-declaration:
12605 decl-specifier-seq [opt] init-declarator-list [opt] ;
12606 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12607 brace-or-equal-initializer ;
12609 init-declarator-list:
12610 init-declarator
12611 init-declarator-list , init-declarator
12613 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12614 function-definition as a simple-declaration.
12616 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12617 parsed declaration if it is an uninitialized single declarator not followed
12618 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12619 if present, will not be consumed. */
12621 static void
12625 {
12626 cp_decl_specifier_seq decl_specifiers;
12635 /* Defer access checks until we know what is being declared; the
12636 checks for names appearing in the decl-specifier-seq should be
12637 done as if we were in the scope of the thing being declared. */
12640 /* Parse the decl-specifier-seq. We have to keep track of whether
12641 or not the decl-specifier-seq declares a named class or
12642 enumeration type, since that is the only case in which the
12643 init-declarator-list is allowed to be empty.
12645 [dcl.dcl]
12647 In a simple-declaration, the optional init-declarator-list can be
12648 omitted only when declaring a class or enumeration, that is when
12649 the decl-specifier-seq contains either a class-specifier, an
12650 elaborated-type-specifier, or an enum-specifier. */
12652 CP_PARSER_FLAGS_OPTIONAL,
12655 /* We no longer need to defer access checks. */
12658 /* In a block scope, a valid declaration must always have a
12659 decl-specifier-seq. By not trying to parse declarators, we can
12660 resolve the declaration/expression ambiguity more quickly. */
12663 {
12666 }
12668 /* If the next two tokens are both identifiers, the code is
12669 erroneous. The usual cause of this situation is code like:
12671 T t;
12673 where "T" should name a type -- but does not. */
12676 {
12677 /* If parsing tentatively, we should commit; we really are
12678 looking at a declaration. */
12680 /* Give up. */
12682 }
12684 /* If we have seen at least one decl-specifier, and the next token
12685 is not a parenthesis, then we must be looking at a declaration.
12686 (After "int (" we might be looking at a functional cast.) */
12693 /* Look for C++17 decomposition declaration. */
12701 {
12702 tree decl
12704 maybe_range_for_decl,
12707 /* The next token should be either a `,' or a `;'. */
12709 /* If it's a `;', we are done. */
12712 /* Anything else is an error. */
12713 else
12714 {
12715 /* If we have already issued an error message we don't need
12716 to issue another one. */
12721 /* Skip tokens until we reach the end of the statement. */
12723 /* If the next token is now a `;', consume it. */
12727 }
12728 }
12729 else
12732 tree last_type;
12734 /* NULL_TREE if both variable and function declaration are allowed,
12735 error_mark_node if function declaration are not allowed and
12736 a FUNCTION_DECL that should be diagnosed if it is followed by
12737 variable declarations. */
12738 tree auto_function_declaration;
12741 auto_specifier_p
12745 /* Keep going until we hit the `;' at the end of the simple
12746 declaration. */
12749 CPP_SEMICOLON))
12750 {
12753 tree decl;
12757 {
12758 /* If we are processing next declarator, comma is expected */
12763 {
12767 }
12768 }
12769 else
12772 /* Parse the init-declarator. */
12775 function_definition_allowed_p,
12777 declares_class_or_enum,
12779 maybe_range_for_decl,
12782 /* If an error occurred while parsing tentatively, exit quickly.
12783 (That usually happens when in the body of a function; each
12784 statement is treated as a declaration-statement until proven
12785 otherwise.) */
12790 {
12791 /* If the init-declarator-list contains more than one
12792 init-declarator, they shall all form declarations of
12793 variables. */
12795 auto_function_declaration
12799 {
12801 "non-variable %qD in declaration with more than one "
12806 }
12807 }
12811 {
12815 {
12816 /* If the list of declarators contains more than one declarator,
12817 the type of each declared variable is determined as described
12818 above. If the type deduced for the template parameter U is not
12819 the same in each deduction, the program is ill-formed. */
12824 }
12825 else
12827 }
12829 /* Handle function definitions specially. */
12831 {
12832 /* If the next token is a `,', then we are probably
12833 processing something like:
12835 void f() {}, *p;
12837 which is erroneous. */
12839 {
12842 "mixing"
12844 }
12845 /* Otherwise, we're done with the list of declarators. */
12846 else
12847 {
12850 }
12851 }
12854 /* The next token should be either a `,' or a `;'. */
12856 /* If it's a `,', there are more declarators to come. */
12859 /* If it's a `;', we are done. */
12863 {
12868 }
12869 /* Anything else is an error. */
12870 else
12871 {
12872 /* If we have already issued an error message we don't need
12873 to issue another one. */
12878 /* Skip tokens until we reach the end of the statement. */
12880 /* If the next token is now a `;', consume it. */
12884 }
12885 /* After the first time around, a function-definition is not
12886 allowed -- even if it was OK at first. For example:
12888 int i, f() {}
12890 is not valid. */
12892 }
12894 /* Issue an error message if no declarators are present, and the
12895 decl-specifier-seq does not itself declare a class or
12896 enumeration: [dcl.dcl]/3. */
12898 {
12900 {
12904 /* Ensure an error is issued anyway when finish_decltype_type,
12905 called via cp_parser_decl_specifier_seq, returns a class or
12906 an enumeration (c++/51786). */
12909 }
12910 /* Perform any deferred access checks. */
12912 }
12914 /* Consume the `;'. */
12915 finish:
12919 {
12925 }
12927 done:
12929 }
12931 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12932 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12933 initializer ; */
12935 static tree
12940 {
12945 /* Parse the identifier-list. */
12949 {
12957 }
12961 {
12967 else
12968 {
12971 }
12972 }
12978 tree pushed_scope;
12985 NULL_TREE);
12992 cp_expr e;
12993 cp_decl_specifier_seq decl_specs;
12998 {
13001 else
13004 tree elt_pushed_scope;
13010 {
13011 /* Ensure we've diagnosed redeclaration if we aren't creating
13012 a new VAR_DECL. */
13015 }
13016 else
13020 }
13023 {
13026 }
13030 {
13037 {
13041 }
13042 }
13044 {
13046 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13047 the underlying DECL. */
13049 }
13055 {
13058 }
13061 }
13063 /* Parse a decl-specifier-seq.
13065 decl-specifier-seq:
13066 decl-specifier-seq [opt] decl-specifier
13067 decl-specifier attribute-specifier-seq [opt] (C++11)
13069 decl-specifier:
13070 storage-class-specifier
13071 type-specifier
13072 function-specifier
13073 friend
13074 typedef
13076 GNU Extension:
13078 decl-specifier:
13079 attributes
13081 Concepts Extension:
13083 decl-specifier:
13084 concept
13086 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13088 The parser flags FLAGS is used to control type-specifier parsing.
13090 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13091 flags:
13093 1: one of the decl-specifiers is an elaborated-type-specifier
13094 (i.e., a type declaration)
13095 2: one of the decl-specifiers is an enum-specifier or a
13096 class-specifier (i.e., a type definition)
13098 */
13100 static void
13102 cp_parser_flags flags,
13105 {
13109 cp_decl_spec ds;
13111 /* Clear DECL_SPECS. */
13114 /* Assume no class or enumeration type is declared. */
13117 /* Keep reading specifiers until there are no more to read. */
13119 {
13124 /* Peek at the next token. */
13127 /* Save the first token of the decl spec list for error
13128 reporting. */
13131 /* Handle attributes. */
13133 {
13134 /* Parse the attributes. */
13137 /* In a sequence of declaration specifiers, c++11 attributes
13138 appertain to the type that precede them. In that case
13139 [dcl.spec]/1 says:
13141 The attribute-specifier-seq affects the type only for
13142 the declaration it appears in, not other declarations
13143 involving the same type.
13145 But for now let's force the user to position the
13146 attribute either at the beginning of the declaration or
13147 after the declarator-id, which would clearly mean that it
13148 applies to the declarator. */
13150 {
13152 /* The c++11 attribute is at the beginning of the
13153 declaration. It appertains to the entity being
13155 else
13156 {
13158 {
13159 /* This is an attribute following a
13160 class-specifier. */
13165 }
13166 else
13167 {
13168 decl_specs->std_attributes
13170 attrs);
13173 }
13175 }
13176 }
13178 decl_specs->attributes
13180 attrs);
13184 }
13185 /* Assume we will find a decl-specifier keyword. */
13187 /* If the next token is an appropriate keyword, we can simply
13188 add it to the list. */
13190 {
13191 /* decl-specifier:
13192 friend
13193 constexpr */
13196 {
13199 }
13200 else
13201 {
13203 /* Consume the token. */
13205 }
13218 /* function-specifier:
13219 inline
13220 virtual
13221 explicit */
13228 /* decl-specifier:
13229 typedef */
13232 /* Consume the token. */
13234 /* A constructor declarator cannot appear in a typedef. */
13236 /* The "typedef" keyword can only occur in a declaration; we
13237 may as well commit at this point. */
13244 /* storage-class-specifier:
13245 auto
13246 register
13247 static
13248 extern
13249 mutable
13251 GNU Extension:
13252 thread */
13255 {
13256 /* Consume the token. */
13259 /* Complain about `auto' as a storage specifier, if
13260 we're complaining about C++0x compatibility. */
13264 /* Set the storage class anyway. */
13266 token);
13267 }
13268 else
13269 /* C++0x auto type-specifier. */
13277 /* Consume the token. */
13280 token);
13283 /* Consume the token. */
13289 /* We did not yet find a decl-specifier yet. */
13292 }
13309 /* Constructors are a special case. The `S' in `S()' is not a
13310 decl-specifier; it is the beginning of the declarator. */
13311 constructor_p
13312 = (!found_decl_spec
13313 && constructor_possible_p
13314 && (cp_parser_constructor_declarator_p
13317 /* If we don't have a DECL_SPEC yet, then we must be looking at
13318 a type-specifier. */
13320 {
13323 tree type_spec;
13325 type_spec
13327 decl_specs,
13333 /* If this type-specifier referenced a user-defined type
13334 (a typedef, class-name, etc.), then we can't allow any
13335 more such type-specifiers henceforth.
13337 [dcl.spec]
13339 The longest sequence of decl-specifiers that could
13340 possibly be a type name is taken as the
13341 decl-specifier-seq of a declaration. The sequence shall
13342 be self-consistent as described below.
13344 [dcl.type]
13346 As a general rule, at most one type-specifier is allowed
13347 in the complete decl-specifier-seq of a declaration. The
13348 only exceptions are the following:
13350 -- const or volatile can be combined with any other
13351 type-specifier.
13353 -- signed or unsigned can be combined with char, long,
13354 short, or int.
13356 -- ..
13358 Example:
13360 typedef char* Pc;
13361 void g (const int Pc);
13363 Here, Pc is *not* part of the decl-specifier seq; it's
13364 the declarator. Therefore, once we see a type-specifier
13365 (other than a cv-qualifier), we forbid any additional
13366 user-defined types. We *do* still allow things like `int
13367 int' to be considered a decl-specifier-seq, and issue the
13368 error message later. */
13371 /* A constructor declarator cannot follow a type-specifier. */
13373 {
13378 }
13379 }
13381 /* If we still do not have a DECL_SPEC, then there are no more
13382 decl-specifiers. */
13387 /* After we see one decl-specifier, further decl-specifiers are
13388 always optional. */
13390 }
13392 /* Don't allow a friend specifier with a class definition. */
13397 }
13399 /* Parse an (optional) storage-class-specifier.
13401 storage-class-specifier:
13402 auto
13403 register
13404 static
13405 extern
13406 mutable
13408 GNU Extension:
13410 storage-class-specifier:
13411 thread
13413 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13415 static tree
13417 {
13419 {
13423 /* Fall through for C++98. */
13431 /* Consume the token. */
13436 }
13437 }
13439 /* Parse an (optional) function-specifier.
13441 function-specifier:
13442 inline
13443 virtual
13444 explicit
13446 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13447 Updates DECL_SPECS, if it is non-NULL. */
13449 static tree
13452 {
13455 {
13461 /* 14.5.2.3 [temp.mem]
13463 A member function template shall not be virtual. */
13467 else
13477 }
13479 /* Consume the token. */
13481 }
13483 /* Parse a linkage-specification.
13485 linkage-specification:
13486 extern string-literal { declaration-seq [opt] }
13487 extern string-literal declaration */
13489 static void
13491 {
13492 tree linkage;
13494 /* Look for the `extern' keyword. */
13497 /* Look for the string-literal. */
13500 /* Transform the literal into an identifier. If the literal is a
13501 wide-character string, or contains embedded NULs, then we can't
13502 handle it as the user wants. */
13505 {
13507 /* Assume C++ linkage. */
13509 }
13510 else
13513 /* We're now using the new linkage. */
13516 /* If the next token is a `{', then we're using the first
13517 production. */
13519 {
13523 /* Consume the `{' token. */
13525 /* Parse the declarations. */
13527 /* Look for the closing `}'. */
13529 }
13530 /* Otherwise, there's just one declaration. */
13531 else
13532 {
13535 saved_in_unbraced_linkage_specification_p
13539 parser->in_unbraced_linkage_specification_p
13541 }
13543 /* We're done with the linkage-specification. */
13545 }
13547 /* Parse a static_assert-declaration.
13549 static_assert-declaration:
13550 static_assert ( constant-expression , string-literal ) ;
13551 static_assert ( constant-expression ) ; (C++1Z)
13553 If MEMBER_P, this static_assert is a class member. */
13555 static void
13557 {
13558 tree condition;
13559 tree message;
13561 location_t saved_loc;
13564 /* Peek at the `static_assert' token so we can keep track of exactly
13565 where the static assertion started. */
13569 /* Look for the `static_assert' keyword. */
13571 RT_STATIC_ASSERT))
13574 /* We know we are in a static assertion; commit to any tentative
13575 parse. */
13579 /* Parse the `(' starting the static assertion condition. */
13582 /* Parse the constant-expression. Allow a non-constant expression
13583 here in order to give better diagnostics in finish_static_assert. */
13584 condition =
13590 {
13593 "static_assert without a message "
13595 /* Eat the ')' */
13600 }
13601 else
13602 {
13603 /* Parse the separating `,'. */
13606 /* Parse the string-literal message. */
13611 /* A `)' completes the static assertion. */
13617 }
13619 /* A semicolon terminates the declaration. */
13622 /* Complete the static assertion, which may mean either processing
13623 the static assert now or saving it for template instantiation. */
13625 }
13627 /* Parse the expression in decltype ( expression ). */
13629 static tree
13632 {
13634 tree expr;
13636 /* Since we're going to preserve any side-effects from this parse, set up a
13637 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13638 in the expression. */
13641 /* First, try parsing an id-expression. */
13652 {
13655 cp_id_kind idk;
13659 /* Lookup the name we got back from the id-expression. */
13669 {
13670 /* Complete lookup of the id-expression. */
13671 expr = (finish_id_expression
13684 /* We found an id-expression, but it was something that we
13685 should not have found. This is an error, not something
13686 we can recover from, so note that we found an
13687 id-expression and we'll recover as gracefully as
13688 possible. */
13690 }
13695 /* We have an id-expression. */
13697 }
13700 {
13701 /* Abort the id-expression parse. */
13704 /* Parsing tentatively, again. */
13707 /* Parse a class member access. */
13715 /* We have an id-expression. */
13717 }
13720 /* We have parsed the complete id-expression or member access. */
13722 else
13723 {
13724 /* Abort our attempt to parse an id-expression or member access
13725 expression. */
13728 /* Parse a full expression. */
13731 }
13734 }
13736 /* Parse a `decltype' type. Returns the type.
13738 simple-type-specifier:
13739 decltype ( expression )
13740 C++14 proposal:
13741 decltype ( auto ) */
13743 static tree
13745 {
13746 tree expr;
13755 {
13756 /* Already parsed. */
13759 }
13761 /* Look for the `decltype' token. */
13765 /* Parse the opening `('. */
13769 /* decltype (auto) */
13772 {
13779 }
13781 /* Types cannot be defined in a `decltype' expression. Save away the
13782 old message. */
13785 /* And create the new one. */
13786 parser->type_definition_forbidden_message
13789 /* The restrictions on constant-expressions do not apply inside
13790 decltype expressions. */
13791 saved_integral_constant_expression_p
13793 saved_non_integral_constant_expression_p
13797 /* Within a parenthesized expression, a `>' token is always
13798 the greater-than operator. */
13799 saved_greater_than_is_operator_p
13803 /* Do not actually evaluate the expression. */
13806 /* Do not warn about problems with the expression. */
13811 /* Go back to evaluating expressions. */
13815 /* The `>' token might be the end of a template-id or
13816 template-parameter-list now. */
13817 parser->greater_than_is_operator_p
13820 /* Restore the old message and the integral constant expression
13821 flags. */
13823 parser->integral_constant_expression_p
13825 parser->non_integral_constant_expression_p
13828 /* Parse to the closing `)'. */
13830 {
13834 }
13837 tf_warning_or_error);
13839 rewrite:
13840 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13841 it again. */
13850 }
13852 /* Special member functions [gram.special] */
13854 /* Parse a conversion-function-id.
13856 conversion-function-id:
13857 operator conversion-type-id
13859 Returns an IDENTIFIER_NODE representing the operator. */
13861 static tree
13863 {
13864 tree type;
13865 tree saved_scope;
13866 tree saved_qualifying_scope;
13867 tree saved_object_scope;
13870 /* Look for the `operator' token. */
13873 /* When we parse the conversion-type-id, the current scope will be
13874 reset. However, we need that information in able to look up the
13875 conversion function later, so we save it here. */
13879 /* We must enter the scope of the class so that the names of
13880 entities declared within the class are available in the
13881 conversion-type-id. For example, consider:
13883 struct S {
13884 typedef int I;
13885 operator I();
13886 };
13888 S::operator I() { ... }
13890 In order to see that `I' is a type-name in the definition, we
13891 must be in the scope of `S'. */
13894 /* Parse the conversion-type-id. */
13896 /* Leave the scope of the class, if any. */
13899 /* Restore the saved scope. */
13903 /* If the TYPE is invalid, indicate failure. */
13907 }
13909 /* Parse a conversion-type-id:
13911 conversion-type-id:
13912 type-specifier-seq conversion-declarator [opt]
13914 Returns the TYPE specified. */
13916 static tree
13918 {
13919 tree attributes;
13920 cp_decl_specifier_seq type_specifiers;
13922 tree type_specified;
13925 /* Parse the attributes. */
13929 parser->type_definition_forbidden_message
13932 /* Parse the type-specifiers. */
13939 /* If that didn't work, stop. */
13942 /* Parse the conversion-declarator. */
13950 /* Don't give this error when parsing tentatively. This happens to
13951 work because we always parse this definitively once. */
13954 {
13956 {
13959 }
13963 }
13966 }
13968 /* Parse an (optional) conversion-declarator.
13970 conversion-declarator:
13971 ptr-operator conversion-declarator [opt]
13973 */
13977 {
13980 cp_cv_quals cv_quals;
13982 /* We don't know if there's a ptr-operator next, or not. */
13984 /* Try the ptr-operator. */
13987 /* If it worked, look for more conversion-declarators. */
13989 {
13992 /* Parse another optional declarator. */
13995 declarator = cp_parser_make_indirect_declarator
13999 }
14002 }
14004 /* Parse an (optional) ctor-initializer.
14006 ctor-initializer:
14007 : mem-initializer-list
14009 Returns TRUE iff the ctor-initializer was actually present. */
14011 static bool
14013 {
14014 /* If the next token is not a `:', then there is no
14015 ctor-initializer. */
14017 {
14018 /* Do default initialization of any bases and members. */
14023 }
14025 /* Consume the `:' token. */
14027 /* And the mem-initializer-list. */
14031 }
14033 /* Parse a mem-initializer-list.
14035 mem-initializer-list:
14036 mem-initializer ... [opt]
14037 mem-initializer ... [opt] , mem-initializer-list */
14039 static void
14041 {
14046 /* Let the semantic analysis code know that we are starting the
14047 mem-initializer-list. */
14052 /* Loop through the list. */
14054 {
14055 tree mem_initializer;
14058 /* Parse the mem-initializer. */
14060 /* If the next token is a `...', we're expanding member initializers. */
14062 {
14063 /* Consume the `...'. */
14066 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14067 can be expanded but members cannot. */
14070 {
14075 }
14077 /* Construct the pack expansion type. */
14080 }
14083 {
14087 }
14088 /* Look for a target constructor. */
14092 {
14095 {
14099 }
14101 }
14102 /* Add it to the list, unless it was erroneous. */
14104 {
14107 }
14108 /* If the next token is not a `,', we're done. */
14111 /* Consume the `,' token. */
14113 }
14115 /* Perform semantic analysis. */
14118 }
14120 /* Parse a mem-initializer.
14122 mem-initializer:
14123 mem-initializer-id ( expression-list [opt] )
14124 mem-initializer-id braced-init-list
14126 GNU extension:
14128 mem-initializer:
14129 ( expression-list [opt] )
14131 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14132 class) or FIELD_DECL (for a non-static data member) to initialize;
14133 the TREE_VALUE is the expression-list. An empty initialization
14134 list is represented by void_list_node. */
14136 static tree
14138 {
14139 tree mem_initializer_id;
14140 tree expression_list;
14141 tree member;
14144 /* Find out what is being initialized. */
14146 {
14150 }
14151 else
14152 {
14156 }
14162 {
14169 }
14170 else
14171 {
14181 }
14191 }
14193 /* Parse a mem-initializer-id.
14195 mem-initializer-id:
14196 :: [opt] nested-name-specifier [opt] class-name
14197 decltype-specifier (C++11)
14198 identifier
14200 Returns a TYPE indicating the class to be initialized for the first
14201 production (and the second in C++11). Returns an IDENTIFIER_NODE
14202 indicating the data member to be initialized for the last production. */
14204 static tree
14206 {
14210 tree id;
14214 /* `typename' is not allowed in this context ([temp.res]). */
14216 {
14218 "keyword %<typename%> not allowed in this context (a qualified "
14221 }
14222 /* Look for the optional `::' operator. */
14223 global_scope_p
14227 /* Look for the optional nested-name-specifier. The simplest way to
14228 implement:
14230 [temp.res]
14232 The keyword `typename' is not permitted in a base-specifier or
14233 mem-initializer; in these contexts a qualified name that
14234 depends on a template-parameter is implicitly assumed to be a
14235 type name.
14237 is to assume that we have seen the `typename' keyword at this
14238 point. */
14239 nested_name_specifier_p
14248 /* If there is a `::' operator or a nested-name-specifier, then we
14249 are definitely looking for a class-name. */
14254 typename_type,
14258 /* Otherwise, we could also be looking for an ordinary identifier. */
14261 /* Try a decltype-specifier. */
14263 else
14264 /* Otherwise, try a class-name. */
14268 none_type,
14272 /* If we found one, we're done. */
14275 /* Otherwise, look for an ordinary identifier. */
14277 }
14279 /* Overloading [gram.over] */
14281 /* Parse an operator-function-id.
14283 operator-function-id:
14284 operator operator
14286 Returns an IDENTIFIER_NODE for the operator which is a
14287 human-readable spelling of the identifier, e.g., `operator +'. */
14289 static cp_expr
14291 {
14292 /* Look for the `operator' keyword. */
14295 /* And then the name of the operator itself. */
14297 }
14299 /* Return an identifier node for a user-defined literal operator.
14300 The suffix identifier is chained to the operator name identifier. */
14302 tree
14304 {
14305 tree identifier;
14312 }
14314 /* Parse an operator.
14316 operator:
14317 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14318 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14319 || ++ -- , ->* -> () []
14321 GNU Extensions:
14323 operator:
14324 <? >? <?= >?=
14326 Returns an IDENTIFIER_NODE for the operator which is a
14327 human-readable spelling of the identifier, e.g., `operator +'. */
14329 static cp_expr
14331 {
14336 /* Peek at the next token. */
14341 /* Figure out which operator we have. */
14343 {
14345 {
14348 /* The keyword should be either `new' or `delete'. */
14353 else
14356 /* Consume the `new' or `delete' token. */
14359 /* Peek at the next token. */
14361 /* If it's a `[' token then this is the array variant of the
14362 operator. */
14364 {
14365 /* Consume the `[' token. */
14367 /* Look for the `]' token. */
14373 }
14374 /* Otherwise, we have the non-array variant. */
14375 else
14381 }
14528 /* Consume the `('. */
14530 /* Look for the matching `)'. */
14535 /* Consume the `['. */
14537 /* Look for the matching `]'. */
14544 /* FALLTHRU */
14553 {
14560 /* Consume the string. */
14566 {
14569 }
14570 else
14571 {
14573 /* Look for the suffix identifier. */
14578 {
14582 }
14583 else
14584 {
14587 }
14588 }
14593 {
14596 }
14599 {
14602 }
14604 {
14607 }
14609 }
14612 /* Anything else is an error. */
14614 }
14616 /* If we have selected an identifier, we need to consume the
14617 operator token. */
14620 /* Otherwise, no valid operator name was present. */
14621 else
14622 {
14625 }
14628 }
14630 /* Parse a template-declaration.
14632 template-declaration:
14633 export [opt] template < template-parameter-list > declaration
14635 If MEMBER_P is TRUE, this template-declaration occurs within a
14636 class-specifier.
14638 The grammar rule given by the standard isn't correct. What
14639 is really meant is:
14641 template-declaration:
14642 export [opt] template-parameter-list-seq
14643 decl-specifier-seq [opt] init-declarator [opt] ;
14644 export [opt] template-parameter-list-seq
14645 function-definition
14647 template-parameter-list-seq:
14648 template-parameter-list-seq [opt]
14649 template < template-parameter-list >
14651 Concept Extensions:
14653 template-parameter-list-seq:
14654 template < template-parameter-list > requires-clause [opt]
14656 requires-clause:
14657 requires logical-or-expression */
14659 static void
14661 {
14662 /* Check for `export'. */
14664 {
14665 /* Consume the `export' token. */
14667 /* Warn that we do not support `export'. */
14669 }
14672 }
14674 /* Parse a template-parameter-list.
14676 template-parameter-list:
14677 template-parameter
14678 template-parameter-list , template-parameter
14680 Returns a TREE_LIST. Each node represents a template parameter.
14681 The nodes are connected via their TREE_CHAINs. */
14683 static tree
14685 {
14690 /* The loop below parses the template parms. We first need to know
14691 the total number of template parms to be able to compute proper
14692 canonical types of each dependent type. So after the loop, when
14693 we know the total number of template parms,
14694 end_template_parm_list computes the proper canonical types and
14695 fixes up the dependent types accordingly. */
14697 {
14698 tree parameter;
14701 location_t parm_loc;
14703 /* Parse the template-parameter. */
14708 /* Add it to the list. */
14711 parm_loc,
14712 parameter,
14713 is_non_type,
14714 is_parameter_pack);
14715 else
14716 {
14719 }
14721 /* If the next token is not a `,', we're done. */
14724 /* Otherwise, consume the `,' token. */
14726 }
14729 }
14731 /* Parse a introduction-list.
14733 introduction-list:
14734 introduced-parameter
14735 introduction-list , introduced-parameter
14737 introduced-parameter:
14738 ...[opt] identifier
14740 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14741 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14742 WILDCARD_DECL will also have DECL_NAME set and token location in
14743 DECL_SOURCE_LOCATION. */
14745 static tree
14747 {
14751 {
14756 /* Build placeholder. */
14764 /* If the next token is not a `,', we're done. */
14767 /* Otherwise, consume the `,' token. */
14769 }
14771 /* Convert the vec into a TREE_VEC. */
14774 tree parm;
14780 }
14782 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14783 is an abstract declarator. */
14787 {
14792 }
14794 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14795 is an abstract declarator. */
14799 {
14803 else
14805 }
14807 /* Returns true if DECL represents a constrained-parameter. */
14811 {
14816 }
14818 /* Returns true if PARM declares a constrained-parameter. */
14822 {
14824 }
14826 /* Check that the type parameter is only a declarator-id, and that its
14827 type is not cv-qualified. */
14829 bool
14832 {
14837 {
14840 }
14842 /* Don't allow cv-qualified type parameters. */
14845 {
14848 }
14851 }
14853 /* Finish parsing/processing a template type parameter and checking
14854 various restrictions. */
14858 tree id,
14860 {
14863 else
14865 }
14867 static tree
14869 {
14870 /* FIXME: This should probably be copied, and we may need to adjust
14871 the template parameter depths. */
14881 }
14883 /* Finish parsing/processing a template template parameter by borrowing
14884 the template parameter list from the prototype parameter. */
14886 static tree
14888 tree proto,
14889 tree id,
14891 {
14895 }
14897 /* Create a new non-type template parameter from the given PARM
14898 declarator. */
14900 static tree
14903 {
14909 }
14911 /* Build a constrained template parameter based on the PARMDECL
14912 declarator. The type of PARMDECL is the constrained type, which
14913 refers to the prototype template parameter that ultimately
14914 specifies the type of the declared parameter. */
14916 static tree
14921 {
14927 /* A template parameter constrained by a variadic concept shall also
14928 be declared as a template parameter pack. */
14933 /* Build the parameter. Return an error if the declarator was invalid. */
14934 tree parm;
14939 parmdecl);
14940 else
14945 /* Finish the parameter decl and create a node attaching the
14946 default argument and constraint. */
14951 }
14953 /* Returns true if the parsed type actually represents the declaration
14954 of a type template-parameter. */
14958 {
14961 }
14964 /* Returns true if the parsed type actually represents the declaration of
14965 a template template-parameter. */
14967 static bool
14969 {
14972 }
14974 /* Parse a default argument for a type template-parameter.
14975 Note that diagnostics are handled in cp_parser_template_parameter. */
14977 static tree
14979 {
14982 /* Consume the `=' token. */
14987 /* Parse the default-argument. */
14993 {
14997 }
15000 }
15002 /* Parse a default argument for a template template-parameter. */
15004 static tree
15006 {
15011 /* Consume the `='. */
15013 /* Parse the id-expression. */
15015 /* save token before parsing the id-expression, for error
15016 reporting */
15018 tree default_argument
15026 /* If the id-expression was a template-id that refers to
15027 a template-class, we already have the declaration here,
15028 so no further lookup is needed. */
15029 ;
15030 else
15031 /* Look up the name. */
15032 default_argument
15034 none_type,
15040 /* See if the default argument is valid. */
15044 }
15046 /* Parse a template-parameter.
15048 template-parameter:
15049 type-parameter
15050 parameter-declaration
15052 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15053 the parameter. The TREE_PURPOSE is the default value, if any.
15054 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15055 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15056 set to true iff this parameter is a parameter pack. */
15058 static tree
15061 {
15064 tree parm;
15066 /* Assume it is a type parameter or a template parameter. */
15068 /* Assume it not a parameter pack. */
15070 /* Peek at the next token. */
15072 /* If it is `class' or `template', we have a type-parameter. */
15075 /* If it is `class' or `typename' we do not know yet whether it is a
15076 type parameter or a non-type parameter. Consider:
15078 template <typename T, typename T::X X> ...
15080 or:
15082 template <class C, class D*> ...
15084 Here, the first parameter is a type parameter, and the second is
15085 a non-type parameter. We can tell by looking at the token after
15086 the identifier -- if it is a `,', `=', or `>' then we have a type
15087 parameter. */
15089 {
15090 /* Peek at the token after `class' or `typename'. */
15092 /* If it's an ellipsis, we have a template type parameter
15093 pack. */
15096 /* If it's an identifier, skip it. */
15099 /* Now, see if the token looks like the end of a template
15100 parameter. */
15105 }
15107 /* Otherwise, it is a non-type parameter or a constrained parameter.
15109 [temp.param]
15111 When parsing a default template-argument for a non-type
15112 template-parameter, the first non-nested `>' is taken as the end
15113 of the template parameter-list rather than a greater-than
15114 operator. */
15115 parameter_declarator
15122 /* If the parameter declaration is marked as a parameter pack, set
15123 *IS_PARAMETER_PACK to notify the caller. */
15128 {
15129 /* Can happen in some cases of erroneous input (c++/34892). */
15131 /* Consume the `...' for better error recovery. */
15133 }
15135 // The parameter may have been constrained.
15138 parameter_declarator,
15139 is_non_type,
15140 is_parameter_pack);
15142 // Now we're sure that the parameter is a non-type parameter.
15153 }
15155 /* Parse a type-parameter.
15157 type-parameter:
15158 class identifier [opt]
15159 class identifier [opt] = type-id
15160 typename identifier [opt]
15161 typename identifier [opt] = type-id
15162 template < template-parameter-list > class identifier [opt]
15163 template < template-parameter-list > class identifier [opt]
15164 = id-expression
15166 GNU Extension (variadic templates):
15168 type-parameter:
15169 class ... identifier [opt]
15170 typename ... identifier [opt]
15172 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15173 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15174 the declaration of the parameter.
15176 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15178 static tree
15180 {
15182 tree parameter;
15184 /* Look for a keyword to tell us what kind of parameter this is. */
15190 {
15193 {
15194 tree identifier;
15195 tree default_argument;
15197 /* If the next token is an ellipsis, we have a template
15198 argument pack. */
15200 {
15201 /* Consume the `...' token. */
15206 }
15208 /* If the next token is an identifier, then it names the
15209 parameter. */
15212 else
15215 /* Create the parameter. */
15218 /* If the next token is an `=', we have a default argument. */
15220 {
15221 default_argument
15224 /* Template parameter packs cannot have default
15225 arguments. */
15227 {
15230 "template parameter pack %qD cannot have a "
15232 else
15234 "template parameter packs cannot have "
15237 }
15240 }
15241 else
15244 /* Create the combined representation of the parameter and the
15245 default argument. */
15247 }
15251 {
15252 tree identifier;
15253 tree default_argument;
15255 /* Look for the `<'. */
15257 /* Parse the template-parameter-list. */
15259 /* Look for the `>'. */
15262 // If template requirements are present, parse them.
15264 {
15269 }
15271 /* Look for the `class' or 'typename' keywords. */
15273 /* If the next token is an ellipsis, we have a template
15274 argument pack. */
15276 {
15277 /* Consume the `...' token. */
15282 }
15283 /* If the next token is an `=', then there is a
15284 default-argument. If the next token is a `>', we are at
15285 the end of the parameter-list. If the next token is a `,',
15286 then we are at the end of this parameter. */
15290 {
15292 /* Treat invalid names as if the parameter were nameless. */
15295 }
15296 else
15299 /* Create the template parameter. */
15301 identifier);
15303 /* If the next token is an `=', then there is a
15304 default-argument. */
15306 {
15307 default_argument
15310 /* Template parameter packs cannot have default
15311 arguments. */
15313 {
15316 "template parameter pack %qD cannot "
15318 identifier);
15319 else
15323 }
15324 }
15325 else
15328 /* Create the combined representation of the parameter and the
15329 default argument. */
15331 }
15337 }
15340 }
15342 /* Parse a template-id.
15344 template-id:
15345 template-name < template-argument-list [opt] >
15347 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15348 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15349 returned. Otherwise, if the template-name names a function, or set
15350 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15351 names a class, returns a TYPE_DECL for the specialization.
15353 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15354 uninstantiated templates. */
15356 static tree
15362 {
15363 tree templ;
15364 tree arguments;
15365 tree template_id;
15370 /* If the next token corresponds to a template-id, there is no need
15371 to reparse it. */
15374 {
15377 }
15379 /* Avoid performing name lookup if there is no possibility of
15380 finding a template-id. */
15383 && !cp_parser_nth_token_starts_template_argument_list_p
15385 {
15388 }
15390 /* Remember where the template-id starts. */
15396 /* Parse the template-name. */
15399 check_dependency_p,
15400 is_declaration,
15401 tag_type,
15404 {
15407 }
15409 /* Since we're going to preserve any side-effects from this parse, set up a
15410 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15411 in the template arguments. */
15414 /* If we find the sequence `[:' after a template-name, it's probably
15415 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15416 parse correctly the argument list. */
15423 {
15425 /* Change `:' into `::'. */
15427 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15428 CPP_LESS. */
15431 /* Parse the arguments. */
15434 {
15435 /* If we couldn't parse an argument list, then we revert our changes
15436 and return simply an error. Maybe this is not a template-id
15437 after all. */
15442 }
15443 /* Otherwise, emit an error about the invalid digraph, but continue
15444 parsing because we got our argument list. */
15447 {
15450 "%<<:%> is an alternate spelling for %<[%>."
15453 {
15455 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15458 }
15459 }
15460 }
15461 else
15462 {
15463 /* Look for the `<' that starts the template-argument-list. */
15465 {
15468 }
15469 /* Parse the arguments. */
15471 }
15473 /* Build a representation of the specialization. */
15476 TEMPLATE_ID_EXPR,
15480 {
15482 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15483 template (rather than some instantiation thereof) only if
15484 is not nested within some other construct. For example, in
15485 "template <typename T> void f(T) { A<T>::", A<T> is just an
15486 instantiation of A. */
15489 CPP_SCOPE));
15490 template_id
15492 }
15493 /* A template-like identifier may be a partial concept id. */
15499 {
15503 }
15504 else
15505 {
15506 /* If it's not a class-template or a template-template, it should be
15507 a function-template. */
15515 }
15517 /* If parsing tentatively, replace the sequence of tokens that makes
15518 up the template-id with a CPP_TEMPLATE_ID token. That way,
15519 should we re-parse the token stream, we will not have to repeat
15520 the effort required to do the parse, nor will we issue duplicate
15521 error messages about problems during instantiation of the
15522 template. */
15524 /* Don't do this if we had a parse error in a declarator; re-parsing
15525 might succeed if a name changes meaning (60361). */
15529 {
15532 /* Reset the contents of the START_OF_ID token. */
15535 /* Update the location to be of the form:
15536 template-name < template-argument-list [opt] >
15537 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15538 with caret == start at the start of the template-name,
15539 ranging until the closing '>'. */
15540 location_t finish_loc
15542 location_t combined_loc
15546 /* Retrieve any deferred checks. Do not pop this access checks yet
15547 so the memory will not be reclaimed during token replacing below. */
15553 /* Purge all subsequent tokens. */
15556 /* ??? Can we actually assume that, if template_id ==
15557 error_mark_node, we will have issued a diagnostic to the
15558 user, as opposed to simply marking the tentative parse as
15559 failed? */
15562 }
15566 }
15568 /* Parse a template-name.
15570 template-name:
15571 identifier
15573 The standard should actually say:
15575 template-name:
15576 identifier
15577 operator-function-id
15579 A defect report has been filed about this issue.
15581 A conversion-function-id cannot be a template name because they cannot
15582 be part of a template-id. In fact, looking at this code:
15584 a.operator K<int>()
15586 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15587 It is impossible to call a templated conversion-function-id with an
15588 explicit argument list, since the only allowed template parameter is
15589 the type to which it is converting.
15591 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15592 `template' keyword, in a construction like:
15594 T::template f<3>()
15596 In that case `f' is taken to be a template-name, even though there
15597 is no way of knowing for sure.
15599 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15600 name refers to a set of overloaded functions, at least one of which
15601 is a template, or an IDENTIFIER_NODE with the name of the template,
15602 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15603 names are looked up inside uninstantiated templates. */
15605 static tree
15612 {
15613 tree identifier;
15614 tree decl;
15615 tree fns;
15618 /* If the next token is `operator', then we have either an
15619 operator-function-id or a conversion-function-id. */
15621 {
15622 /* We don't know whether we're looking at an
15623 operator-function-id or a conversion-function-id. */
15625 /* Try an operator-function-id. */
15627 /* If that didn't work, try a conversion-function-id. */
15629 {
15632 }
15633 }
15634 /* Look for the identifier. */
15635 else
15638 /* If we didn't find an identifier, we don't have a template-id. */
15642 /* If the name immediately followed the `template' keyword, then it
15643 is a template-name. However, if the next token is not `<', then
15644 we do not treat it as a template-name, since it is not being used
15645 as part of a template-id. This enables us to handle constructs
15646 like:
15648 template <typename T> struct S { S(); };
15649 template <typename T> S<T>::S();
15651 correctly. We would treat `S' as a template -- if it were `S<T>'
15652 -- but we do not if there is no `<'. */
15656 {
15657 /* In a declaration, in a dependent context, we pretend that the
15658 "template" keyword was present in order to improve error
15659 recovery. For example, given:
15661 template <typename T> void f(T::X<int>);
15663 we want to treat "X<int>" as a template-id. */
15665 && !template_keyword_p
15667 && check_dependency_p
15669 /* Do not do this for dtors (or ctors), since they never
15670 need the template keyword before their name. */
15672 {
15675 /* Explain what went wrong. */
15677 identifier);
15680 /* If parsing tentatively, find the location of the "<" token. */
15683 /* Parse the template arguments so that we can issue error
15684 messages about them. */
15687 /* Skip tokens until we find a good place from which to
15688 continue parsing. */
15693 /* If parsing tentatively, permanently remove the
15694 template argument list. That will prevent duplicate
15695 error messages from being issued about the missing
15696 "template" keyword. */
15703 }
15705 /* If the "template" keyword is present, then there is generally
15706 no point in doing name-lookup, so we just return IDENTIFIER.
15707 But, if the qualifying scope is non-dependent then we can
15708 (and must) do name-lookup normally. */
15713 {
15714 /* We're optimizing away the call to cp_parser_lookup_name, but we
15715 still need to do this. */
15718 }
15719 }
15721 /* Look up the name. */
15723 tag_type,
15726 check_dependency_p,
15732 /* If DECL is a template, then the name was a template-name. */
15734 {
15738 }
15739 else
15740 {
15743 /* The standard does not explicitly indicate whether a name that
15744 names a set of overloaded declarations, some of which are
15745 templates, is a template-name. However, such a name should
15746 be a template-name; otherwise, there is no way to form a
15747 template-id for the overloaded templates. */
15755 {
15756 /* The name does not name a template. */
15759 }
15760 }
15762 /* If DECL is dependent, and refers to a function, then just return
15763 its name; we will look it up again during template instantiation. */
15765 {
15769 }
15772 }
15774 /* Parse a template-argument-list.
15776 template-argument-list:
15777 template-argument ... [opt]
15778 template-argument-list , template-argument ... [opt]
15780 Returns a TREE_VEC containing the arguments. */
15782 static tree
15784 {
15789 tree vec;
15796 /* Even if the template-id appears in an integral
15797 constant-expression, the contents of the argument list do
15798 not. */
15804 /* Parse the arguments. */
15805 do
15806 {
15807 tree argument;
15810 /* Consume the comma. */
15813 /* Parse the template-argument. */
15816 /* If the next token is an ellipsis, we're expanding a template
15817 argument pack. */
15819 {
15821 {
15825 }
15826 /* Consume the `...' token. */
15829 /* Make the argument into a TYPE_PACK_EXPANSION or
15830 EXPR_PACK_EXPANSION. */
15832 }
15835 {
15839 {
15842 }
15843 else
15845 }
15847 }
15863 }
15865 /* Parse a template-argument.
15867 template-argument:
15868 assignment-expression
15869 type-id
15870 id-expression
15872 The representation is that of an assignment-expression, type-id, or
15873 id-expression -- except that the qualified id-expression is
15874 evaluated, so that the value returned is either a DECL or an
15875 OVERLOAD.
15877 Although the standard says "assignment-expression", it forbids
15878 throw-expressions or assignments in the template argument.
15879 Therefore, we use "conditional-expression" instead. */
15881 static tree
15883 {
15884 tree argument;
15890 cp_id_kind idk;
15892 /* There's really no way to know what we're looking at, so we just
15893 try each alternative in order.
15895 [temp.arg]
15897 In a template-argument, an ambiguity between a type-id and an
15898 expression is resolved to a type-id, regardless of the form of
15899 the corresponding template-parameter.
15901 Therefore, we try a type-id first. */
15904 /* If there was no error parsing the type-id but the next token is a
15905 '>>', our behavior depends on which dialect of C++ we're
15906 parsing. In C++98, we probably found a typo for '> >'. But there
15907 are type-id which are also valid expressions. For instance:
15909 struct X { int operator >> (int); };
15910 template <int V> struct Foo {};
15911 Foo<X () >> 5> r;
15913 Here 'X()' is a valid type-id of a function type, but the user just
15914 wanted to write the expression "X() >> 5". Thus, we remember that we
15915 found a valid type-id, but we still try to parse the argument as an
15916 expression to see what happens.
15918 In C++0x, the '>>' will be considered two separate '>'
15919 tokens. */
15923 {
15926 }
15927 else
15928 {
15929 /* If the next token isn't a `,' or a `>', then this argument wasn't
15930 really finished. This means that the argument is not a valid
15931 type-id. */
15934 /* If that worked, we're done. */
15937 }
15938 /* We're still not sure what the argument will be. */
15940 /* Try a template. */
15948 /* If the next token isn't a `,' or a `>', then this argument wasn't
15949 really finished. */
15953 {
15954 /* Figure out what is being referred to. If the id-expression
15955 was for a class template specialization, then we will have a
15956 TYPE_DECL at this point. There is no need to do name lookup
15957 at this point in that case. */
15960 none_type,
15966 /* Handle a constrained-type-specifier for a non-type template
15967 parameter. */
15973 }
15975 {
15979 }
15980 /* It must be a non-type argument. In C++17 any constant-expression is
15981 allowed. */
15985 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15987 -- an integral constant-expression of integral or enumeration
15988 type; or
15990 -- the name of a non-type template-parameter; or
15992 -- the name of an object or function with external linkage...
15994 -- the address of an object or function with external linkage...
15996 -- a pointer to member... */
15997 /* Look for a non-type template parameter. */
15999 {
16011 }
16013 /* If the next token is "&", the argument must be the address of an
16014 object or function with external linkage. */
16017 {
16020 }
16021 /* See if we might have an id-expression. */
16028 {
16031 address_p,
16038 else
16039 {
16040 tree probe;
16043 {
16044 /* Strip the dereference temporarily. */
16047 }
16049 /* If we're in a template, we represent a qualified-id referring
16050 to a static data member as a SCOPE_REF even if the scope isn't
16051 dependent so that we can check access control later. */
16056 {
16057 /* A variable without external linkage might still be a
16058 valid constant-expression, so no error is issued here
16059 if the external-linkage check fails. */
16062 }
16064 /* All overloaded functions are allowed; if the external
16065 linkage test does not pass, an error will be issued
16066 later. */
16067 ;
16071 /* A pointer-to-member. */
16072 ;
16074 ;
16075 else
16079 {
16082 tf_warning_or_error);
16083 else
16086 }
16087 }
16088 }
16089 /* If the argument started with "&", there are no other valid
16090 alternatives at this point. */
16092 {
16095 }
16097 general_expr:
16098 /* If the argument wasn't successfully parsed as a type-id followed
16099 by '>>', the argument can only be a constant expression now.
16100 Otherwise, we try parsing the constant-expression tentatively,
16101 because the argument could really be a type-id. */
16107 else
16108 {
16109 /* With C++17 generalized non-type template arguments we need to handle
16110 lvalue constant expressions, too. */
16113 }
16121 /* We did our best to parse the argument as a non type-id, but that
16122 was the only alternative that matched (albeit with a '>' after
16123 it). We can assume it's just a typo from the user, and a
16124 diagnostic will then be issued. */
16126 }
16128 /* Parse an explicit-instantiation.
16130 explicit-instantiation:
16131 template declaration
16133 Although the standard says `declaration', what it really means is:
16135 explicit-instantiation:
16136 template decl-specifier-seq [opt] declarator [opt] ;
16138 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16139 supposed to be allowed. A defect report has been filed about this
16140 issue.
16142 GNU Extension:
16144 explicit-instantiation:
16145 storage-class-specifier template
16146 decl-specifier-seq [opt] declarator [opt] ;
16147 function-specifier template
16148 decl-specifier-seq [opt] declarator [opt] ; */
16150 static void
16152 {
16154 cp_decl_specifier_seq decl_specifiers;
16159 /* Look for an (optional) storage-class-specifier or
16160 function-specifier. */
16162 {
16163 extension_specifier
16166 extension_specifier
16169 }
16171 /* Look for the `template' keyword. */
16173 /* Let the front end know that we are processing an explicit
16174 instantiation. */
16176 /* [temp.explicit] says that we are supposed to ignore access
16177 control while processing explicit instantiation directives. */
16179 /* Parse a decl-specifier-seq. */
16181 CP_PARSER_FLAGS_OPTIONAL,
16184 /* If there was exactly one decl-specifier, and it declared a class,
16185 and there's no declarator, then we have an explicit type
16186 instantiation. */
16188 {
16189 tree type;
16193 /* Turn access control back on for names used during
16194 template instantiation. */
16199 }
16200 else
16201 {
16203 tree decl;
16205 /* Parse the declarator. */
16206 declarator
16217 {
16220 "explicit instantiation shall not use"
16224 "explicit instantiation shall not use"
16229 /* Turn access control back on for names used during
16230 template instantiation. */
16232 /* Do the explicit instantiation. */
16234 }
16235 else
16236 {
16238 /* Skip the body of the explicit instantiation. */
16240 }
16241 }
16242 /* We're done with the instantiation. */
16248 }
16250 /* Parse an explicit-specialization.
16252 explicit-specialization:
16253 template < > declaration
16255 Although the standard says `declaration', what it really means is:
16257 explicit-specialization:
16258 template <> decl-specifier [opt] init-declarator [opt] ;
16259 template <> function-definition
16260 template <> explicit-specialization
16261 template <> template-declaration */
16263 static void
16265 {
16269 /* Look for the `template' keyword. */
16271 /* Look for the `<'. */
16273 /* Look for the `>'. */
16275 /* We have processed another parameter list. */
16277 /* [temp]
16279 A template ... explicit specialization ... shall not have C
16280 linkage. */
16282 {
16284 /* Give it C++ linkage to avoid confusing other parts of the
16285 front end. */
16288 }
16289 else
16291 /* Let the front end know that we are beginning a specialization. */
16293 {
16296 }
16298 /* If the next keyword is `template', we need to figure out whether
16299 or not we're looking a template-declaration. */
16301 {
16306 else
16308 }
16309 else
16310 /* Parse the dependent declaration. */
16316 /* We're done with the specialization. */
16318 /* For the erroneous case of a template with C linkage, we pushed an
16319 implicit C++ linkage scope; exit that scope now. */
16322 /* We're done with this parameter list. */
16324 }
16326 /* Parse a type-specifier.
16328 type-specifier:
16329 simple-type-specifier
16330 class-specifier
16331 enum-specifier
16332 elaborated-type-specifier
16333 cv-qualifier
16335 GNU Extension:
16337 type-specifier:
16338 __complex__
16340 Returns a representation of the type-specifier. For a
16341 class-specifier, enum-specifier, or elaborated-type-specifier, a
16342 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16344 The parser flags FLAGS is used to control type-specifier parsing.
16346 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16347 in a decl-specifier-seq.
16349 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16350 class-specifier, enum-specifier, or elaborated-type-specifier, then
16351 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16352 if a type is declared; 2 if it is defined. Otherwise, it is set to
16353 zero.
16355 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16356 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16357 is set to FALSE. */
16359 static tree
16361 cp_parser_flags flags,
16366 {
16372 /* Assume this type-specifier does not declare a new type. */
16375 /* And that it does not specify a cv-qualifier. */
16378 /* Peek at the next token. */
16381 /* If we're looking at a keyword, we can use that to guide the
16382 production we choose. */
16385 {
16390 /* Look for the enum-specifier. */
16392 /* If that worked, we're done. */
16394 {
16399 type_spec,
16400 token,
16403 }
16404 else
16407 /* Any of these indicate either a class-specifier, or an
16408 elaborated-type-specifier. */
16415 /* Parse tentatively so that we can back up if we don't find a
16416 class-specifier. */
16418 /* Look for the class-specifier. */
16421 /* If that worked, we're done. */
16423 {
16428 type_spec,
16429 token,
16432 }
16434 /* Fall through. */
16435 elaborated_type_specifier:
16436 /* We're declaring (not defining) a class or enum. */
16440 /* Fall through. */
16442 /* Look for an elaborated-type-specifier. */
16443 type_spec
16444 = (cp_parser_elaborated_type_specifier
16447 is_declaration));
16450 type_spec,
16451 token,
16474 /* The `__complex__' keyword is a GNU extension. */
16480 }
16482 /* Handle simple keywords. */
16484 {
16486 {
16489 }
16491 }
16493 /* If we do not already have a type-specifier, assume we are looking
16494 at a simple-type-specifier. */
16496 decl_specs,
16497 flags);
16499 /* If we didn't find a type-specifier, and a type-specifier was not
16500 optional in this context, issue an error message. */
16502 {
16505 }
16508 }
16510 /* Parse a simple-type-specifier.
16512 simple-type-specifier:
16513 :: [opt] nested-name-specifier [opt] type-name
16514 :: [opt] nested-name-specifier template template-id
16515 char
16516 wchar_t
16517 bool
16518 short
16519 int
16520 long
16521 signed
16522 unsigned
16523 float
16524 double
16525 void
16527 C++11 Extension:
16529 simple-type-specifier:
16530 auto
16531 decltype ( expression )
16532 char16_t
16533 char32_t
16534 __underlying_type ( type-id )
16536 C++17 extension:
16538 nested-name-specifier(opt) template-name
16540 GNU Extension:
16542 simple-type-specifier:
16543 __int128
16544 __typeof__ unary-expression
16545 __typeof__ ( type-id )
16546 __typeof__ ( type-id ) { initializer-list , [opt] }
16548 Concepts Extension:
16550 simple-type-specifier:
16551 constrained-type-specifier
16553 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16554 appropriately updated. */
16556 static tree
16559 cp_parser_flags flags)
16560 {
16565 /* Peek at the next token. */
16568 /* If we're looking at a keyword, things are easy. */
16570 {
16605 {
16608 }
16637 {
16638 /* The 'auto' might be the placeholder return type for a function decl
16639 with trailing return type. */
16648 {
16650 {
16657 }
16660 {
16663 }
16666 }
16670 {
16673 }
16676 {
16679 }
16680 else
16684 {
16687 "use of %<auto%> in lambda parameter declaration "
16688 "only available with "
16690 }
16693 "use of %<auto%> in parameter declaration "
16694 "only available with "
16698 "ISO C++ forbids use of %<auto%> in parameter "
16700 }
16701 else
16706 /* Since DR 743, decltype can either be a simple-type-specifier by
16707 itself or begin a nested-name-specifier. Parsing it will replace
16708 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16709 handling below decide what to do. */
16715 /* Consume the `typeof' token. */
16717 /* Parse the operand to `typeof'. */
16719 /* If it is not already a TYPE, take its type. */
16725 token,
16734 token,
16744 token,
16749 }
16751 /* If token is an already-parsed decltype not followed by ::,
16752 it's a simple-type-specifier. */
16755 {
16758 {
16760 token,
16762 /* Remember that we are handling a decltype in order to
16763 implement the resolution of DR 1510 when the argument
16764 isn't instantiation dependent. */
16766 }
16769 }
16771 /* If the type-specifier was for a built-in type, we're done. */
16773 {
16774 /* Record the type. */
16781 type,
16782 token,
16787 /* Consume the token. */
16793 /* There is no valid C++ program where a non-template type is
16794 followed by a "<". That usually indicates that the user thought
16795 that the type was a template. */
16800 }
16802 /* The type-specifier must be a user-defined type. */
16804 {
16808 /* Don't gobble tokens or issue error messages if this is an
16809 optional type-specifier. */
16815 /* Look for the optional `::' operator. */
16816 global_p
16820 /* Look for the nested-name specifier. */
16821 qualified_p
16828 /* If we have seen a nested-name-specifier, and the next token
16829 is `template', then we are using the template-id production. */
16832 {
16833 /* Look for the template-id. */
16837 none_type,
16839 /* If the template-id did not name a type, we are out of
16840 luck. */
16842 {
16845 }
16846 }
16847 /* Otherwise, look for a type-name. */
16848 else
16850 /* Keep track of all name-lookups performed in class scopes. */
16852 && !global_p
16853 && !qualified_p
16857 /* If it didn't work out, we don't have a TYPE. */
16862 {
16876 {
16878 none_type,
16888 else
16889 {
16894 }
16895 }
16896 else
16902 }
16905 token,
16907 }
16909 /* If we didn't get a type-name, issue an error message. */
16911 {
16914 }
16917 {
16918 /* See if TYPE is an Objective-C type, and if so, parse and
16919 accept any protocol references following it. Do this before
16920 the cp_parser_check_for_invalid_template_id() call, because
16921 Objective-C types can be followed by '<...>' which would
16922 enclose protocol names rather than template arguments, and so
16923 everything is fine. */
16926 {
16930 /* Clobber the "unqualified" type previously entered into
16931 DECL_SPECS with the new, improved protocol-qualified version. */
16936 }
16938 /* There is no valid C++ program where a non-template type is
16939 followed by a "<". That usually indicates that the user
16940 thought that the type was a template. */
16942 none_type,
16944 }
16947 }
16949 /* Parse a type-name.
16951 type-name:
16952 class-name
16953 enum-name
16954 typedef-name
16955 simple-template-id [in c++0x]
16957 enum-name:
16958 identifier
16960 typedef-name:
16961 identifier
16963 Concepts:
16965 type-name:
16966 concept-name
16967 partial-concept-id
16969 concept-name:
16970 identifier
16972 Returns a TYPE_DECL for the type. */
16974 static tree
16976 {
16978 }
16980 /* See above. */
16981 static tree
16983 {
16984 tree type_decl;
16986 /* We can't know yet whether it is a class-name or not. */
16988 /* Try a class-name. */
16990 typename_keyword_p,
16992 none_type,
16996 /* If it's not a class-name, keep looking. */
16998 {
17000 /* It must be a typedef-name or an enum-name. */
17004 /* It is either a simple-template-id representing an
17005 instantiation of an alias template... */
17009 none_type,
17011 /* Note that this must be an instantiation of an alias template
17012 because [temp.names]/6 says:
17014 A template-id that names an alias template specialization
17015 is a type-name.
17017 Whereas [temp.names]/7 says:
17019 A simple-template-id that names a class template
17020 specialization is a class-name.
17022 With concepts, this could also be a partial-concept-id that
17023 declares a non-type template parameter. */
17030 else
17034 /* ... Or a typedef-name or an enum-name. */
17036 }
17039 }
17041 /* Check if DECL and ARGS can form a constrained-type-specifier.
17042 If ARGS is non-null, we try to form a concept check of the
17043 form DECL<?, ARGS> where ? is a wildcard that matches any
17044 kind of template argument. If ARGS is NULL, then we try to
17045 form a concept check of the form DECL<?>. */
17047 static tree
17050 {
17053 /* If we a constrained-type-specifier cannot be deduced. */
17057 /* A constrained type specifier can only be found in an
17058 overload set or as a reference to a template declaration.
17060 FIXME: This might be masking a bug. It's possible that
17061 that the deduction below is causing template specializations
17062 to be formed with the wildcard as an argument. */
17066 /* Try to build a call expression that evaluates the
17067 concept. This can fail if the overload set refers
17068 only to non-templates. */
17074 /* Deduce the checked constraint and the prototype parameter.
17076 FIXME: In certain cases, failure to deduce should be a
17077 diagnosable error. */
17078 tree conc;
17079 tree proto;
17083 /* In template parameter scope, this results in a constrained
17084 parameter. Return a descriptor of that parm. */
17088 /* In a parameter-declaration-clause, constrained-type
17089 specifiers result in invented template parameters. */
17091 {
17094 }
17095 else
17096 {
17097 /* Otherwise, we're in a context where the constrained
17098 type name is deduced and the constraint applies
17099 after deduction. */
17101 }
17104 }
17106 /* If DECL refers to a concept, return a TYPE_DECL representing
17107 the result of using the constrained type specifier in the
17108 current context. DECL refers to a concept if
17110 - it is an overload set containing a function concept taking a single
17111 type argument, or
17113 - it is a variable concept taking a single type argument. */
17115 static tree
17117 {
17123 else
17125 }
17127 /* Check if DECL and ARGS form a partial-concept-id. If so,
17128 assign ID to the resulting constrained placeholder.
17130 Returns true if the partial-concept-id designates a placeholder
17131 and false otherwise. Note that *id is set to NULL_TREE in
17132 this case. */
17134 static tree
17136 {
17138 }
17140 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17141 or a concept-name.
17143 enum-name:
17144 identifier
17146 typedef-name:
17147 identifier
17149 concept-name:
17150 identifier
17152 Returns a TYPE_DECL for the type. */
17154 static tree
17156 {
17157 tree type_decl;
17158 tree identifier;
17165 /* Look up the type-name. */
17170 /* If we found an overload set, then it may refer to a concept-name. */
17176 {
17177 /* See if this is an Objective-C type. */
17182 }
17184 /* Issue an error if we did not find a type-name. */
17186 /* In Objective-C, we have the complication that class names are
17187 normally type names and start declarations (eg, the
17188 "NSObject" in "NSObject *object;"), but can be used in an
17189 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17190 is an expression. So, a classname followed by a dot is not a
17191 valid type-name. */
17194 {
17199 }
17200 /* Remember that the name was used in the definition of the
17201 current class so that we can check later to see if the
17202 meaning would have been different after the class was
17203 entirely defined. */
17209 }
17211 /* Parse an elaborated-type-specifier. Note that the grammar given
17212 here incorporates the resolution to DR68.
17214 elaborated-type-specifier:
17215 class-key :: [opt] nested-name-specifier [opt] identifier
17216 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17217 enum-key :: [opt] nested-name-specifier [opt] identifier
17218 typename :: [opt] nested-name-specifier identifier
17219 typename :: [opt] nested-name-specifier template [opt]
17220 template-id
17222 GNU extension:
17224 elaborated-type-specifier:
17225 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17226 class-key attributes :: [opt] nested-name-specifier [opt]
17227 template [opt] template-id
17228 enum attributes :: [opt] nested-name-specifier [opt] identifier
17230 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17231 declared `friend'. If IS_DECLARATION is TRUE, then this
17232 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17233 something is being declared.
17235 Returns the TYPE specified. */
17237 static tree
17241 {
17243 tree identifier;
17246 tree globalscope;
17249 /* See if we're looking at the `enum' keyword. */
17251 {
17252 /* Consume the `enum' token. */
17254 /* Remember that it's an enumeration type. */
17256 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17257 enums) is used here. */
17260 {
17264 /* Consume the `struct' or `class' and parse it anyway. */
17266 }
17267 /* Parse the attributes. */
17269 }
17270 /* Or, it might be `typename'. */
17272 RID_TYPENAME))
17273 {
17274 /* Consume the `typename' token. */
17276 /* Remember that it's a `typename' type. */
17278 }
17279 /* Otherwise it must be a class-key. */
17280 else
17281 {
17285 /* Parse the attributes. */
17287 }
17289 /* Look for the `::' operator. */
17292 /* Look for the nested-name-specifier. */
17293 tree nested_name_specifier;
17295 {
17296 nested_name_specifier
17301 is_declaration);
17304 }
17305 else
17306 /* Even though `typename' is not present, the proposed resolution
17307 to Core Issue 180 says that in `class A<T>::B', `B' should be
17308 considered a type-name, even if `A<T>' is dependent. */
17309 nested_name_specifier
17314 is_declaration);
17315 /* For everything but enumeration types, consider a template-id.
17316 For an enumeration type, consider only a plain identifier. */
17318 {
17320 tree decl;
17322 /* Allow the `template' keyword. */
17324 /* If we didn't see `template', we don't know if there's a
17325 template-id or not. */
17328 /* Parse the template-id. */
17332 tag_type,
17333 is_declaration);
17334 /* If we didn't find a template-id, look for an ordinary
17335 identifier. */
17337 ;
17338 /* We can get here when cp_parser_template_id, called by
17339 cp_parser_class_name with tag_type == none_type, succeeds
17340 and caches a BASELINK. Then, when called again here,
17341 instead of failing and returning an error_mark_node
17342 returns it (see template/typename17.C in C++11).
17343 ??? Could we diagnose this earlier? */
17345 {
17348 }
17349 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17350 in effect, then we must assume that, upon instantiation, the
17351 template will correspond to a class. */
17355 typename_type,
17357 /* If the `typename' keyword is in effect and DECL is not a type
17358 decl, then type is non existent. */
17360 ;
17362 {
17366 /* If the next token is a semicolon, this must be a specialization,
17367 instantiation, or friend declaration. Check the scope while we
17368 still know whether or not we had a nested-name-specifier. */
17373 }
17376 }
17379 {
17384 {
17387 }
17389 /* For a `typename', we needn't call xref_tag. */
17395 /* Template parameter lists apply only if we are not within a
17396 function parameter list. */
17397 bool template_parm_lists_apply
17406 /* Look up a qualified name in the usual way. */
17408 {
17409 tree decl;
17410 tree ambiguous_decls;
17413 tag_type,
17420 /* If the lookup was ambiguous, an error will already have been
17421 issued. */
17425 /* If we are parsing friend declaration, DECL may be a
17426 TEMPLATE_DECL tree node here. However, we need to check
17427 whether this TEMPLATE_DECL results in valid code. Consider
17428 the following example:
17430 namespace N {
17431 template <class T> class C {};
17432 }
17433 class X {
17434 template <class T> friend class N::C; // #1, valid code
17435 };
17436 template <class T> class Y {
17437 friend class N::C; // #2, invalid code
17438 };
17440 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17441 name lookup of `N::C'. We see that friend declaration must
17442 be template for the code to be valid. Note that
17443 processing_template_decl does not work here since it is
17444 always 1 for the above two cases. */
17446 decl = (cp_parser_maybe_treat_template_as_class
17451 {
17453 identifier,
17456 }
17459 {
17463 allow_template);
17467 }
17469 /* Forward declarations of nested types, such as
17471 class C1::C2;
17472 class C1::C2::C3;
17474 are invalid unless all components preceding the final '::'
17475 are complete. If all enclosing types are complete, these
17476 declarations become merely pointless.
17478 Invalid forward declarations of nested types are errors
17479 caught elsewhere in parsing. Those that are pointless arrive
17480 here. */
17487 }
17488 else
17489 {
17490 /* An elaborated-type-specifier sometimes introduces a new type and
17491 sometimes names an existing type. Normally, the rule is that it
17492 introduces a new type only if there is not an existing type of
17493 the same name already in scope. For example, given:
17495 struct S {};
17496 void f() { struct S s; }
17498 the `struct S' in the body of `f' is the same `struct S' as in
17499 the global scope; the existing definition is used. However, if
17500 there were no global declaration, this would introduce a new
17501 local class named `S'.
17503 An exception to this rule applies to the following code:
17505 namespace N { struct S; }
17507 Here, the elaborated-type-specifier names a new type
17508 unconditionally; even if there is already an `S' in the
17509 containing scope this declaration names a new type.
17510 This exception only applies if the elaborated-type-specifier
17511 forms the complete declaration:
17513 [class.name]
17515 A declaration consisting solely of `class-key identifier ;' is
17516 either a redeclaration of the name in the current scope or a
17517 forward declaration of the identifier as a class name. It
17518 introduces the name into the current scope.
17520 We are in this situation precisely when the next token is a `;'.
17522 An exception to the exception is that a `friend' declaration does
17523 *not* name a new type; i.e., given:
17525 struct S { friend struct T; };
17527 `T' is not a new type in the scope of `S'.
17529 Also, `new struct S' or `sizeof (struct S)' never results in the
17530 definition of a new type; a new type can only be declared in a
17531 declaration context. */
17533 tag_scope ts;
17537 /* Friends have special name lookup rules. */
17541 CPP_SEMICOLON))
17542 /* This is a `class-key identifier ;' */
17544 else
17547 template_p =
17548 (template_parm_lists_apply
17551 /* An unqualified name was used to reference this type, so
17552 there were no qualifying templates. */
17560 }
17561 }
17566 /* Allow attributes on forward declarations of classes. */
17568 {
17578 else
17581 }
17584 {
17585 /* Indicate whether this class was declared as a `class' or as a
17586 `struct'. */
17590 }
17592 /* A "<" cannot follow an elaborated type specifier. If that
17593 happens, the user was probably trying to form a template-id. */
17598 }
17600 /* Parse an enum-specifier.
17602 enum-specifier:
17603 enum-head { enumerator-list [opt] }
17604 enum-head { enumerator-list , } [C++0x]
17606 enum-head:
17607 enum-key identifier [opt] enum-base [opt]
17608 enum-key nested-name-specifier identifier enum-base [opt]
17610 enum-key:
17611 enum
17612 enum class [C++0x]
17613 enum struct [C++0x]
17615 enum-base: [C++0x]
17616 : type-specifier-seq
17618 opaque-enum-specifier:
17619 enum-key identifier enum-base [opt] ;
17621 GNU Extensions:
17622 enum-key attributes[opt] identifier [opt] enum-base [opt]
17623 { enumerator-list [opt] }attributes[opt]
17624 enum-key attributes[opt] identifier [opt] enum-base [opt]
17625 { enumerator-list, }attributes[opt] [C++0x]
17627 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17628 if the token stream isn't an enum-specifier after all. */
17630 static tree
17632 {
17633 tree identifier;
17635 tree prev_scope;
17637 tree attributes;
17650 /* Parse tentatively so that we can back up if we don't find a
17651 enum-specifier. */
17654 /* Caller guarantees that the current token is 'enum', an identifier
17655 possibly follows, and the token after that is an opening brace.
17656 If we don't have an identifier, fabricate an anonymous name for
17657 the enumeration being defined. */
17660 /* Parse the "class" or "struct", which indicates a scoped
17661 enumeration type in C++0x. */
17664 {
17668 /* Consume the `struct' or `class' token. */
17672 }
17676 /* Clear the qualification. */
17681 /* Figure out in what scope the declaration is being placed. */
17687 nested_name_specifier
17695 {
17696 tree name;
17700 enum_type,
17705 input_location);
17707 {
17710 {
17711 /* Are template enums allowed in ISO? */
17715 /* ignore a typename reference, for it will be solved by name
17716 in start_enum. */
17718 }
17719 }
17722 else
17723 {
17728 }
17729 }
17730 else
17731 {
17734 else
17735 {
17741 }
17742 }
17745 /* Check for the `:' that denotes a specified underlying type in C++0x.
17746 Note that a ':' could also indicate a bitfield width, however. */
17748 {
17749 cp_decl_specifier_seq type_specifiers;
17751 /* Consume the `:'. */
17754 /* Parse the type-specifier-seq. */
17759 /* At this point this is surely not elaborated type specifier. */
17768 /* If that didn't work, stop. */
17770 {
17776 }
17777 }
17779 /* Look for the `{' but don't consume it yet. */
17781 {
17783 {
17786 {
17789 }
17790 }
17791 /* An opaque-enum-specifier must have a ';' here. */
17794 {
17797 {
17800 }
17801 }
17802 }
17808 {
17810 {
17814 }
17816 {
17818 }
17819 }
17821 /* Issue an error message if type-definitions are forbidden here. */
17824 else
17825 /* Create the new type. We do this before consuming the opening
17826 brace so the enum will be recorded as being on the line of its
17827 tag (or the 'enum' keyword, if there is no tag). */
17831 /* If the next token is not '{' it is an opaque-enum-specifier or an
17832 elaborated-type-specifier. */
17834 {
17838 {
17839 /* The following catches invalid code such as:
17840 enum class S<int>::E { A, B, C }; */
17848 {
17852 nested_name_specifier);
17854 }
17857 {
17859 "%qT for enum declaration does not name a class "
17862 }
17863 /* If that scope does not contain the scope in which the
17864 class was originally declared, the program is invalid. */
17866 nested_name_specifier))
17867 {
17870 "declaration of %qD in namespace %qD which does not "
17873 else
17875 "declaration of %qD in %qD which does not "
17879 }
17880 /* If that scope is the scope where the declaration is being placed
17881 the program is invalid. */
17885 {
17889 }
17890 }
17895 /* Consume the opening brace. */
17902 {
17906 }
17907 else
17908 {
17914 }
17918 /* If the next token is not '}', then there are some enumerators. */
17920 {
17924 }
17925 else
17928 /* Consume the final '}'. */
17934 }
17935 else
17936 {
17937 /* If a ';' follows, then it is an opaque-enum-specifier
17938 and additional restrictions apply. */
17940 {
17947 }
17948 }
17950 /* Look for trailing attributes to apply to this enumeration, and
17951 apply them if appropriate. */
17953 {
17956 trailing_attr,
17958 }
17960 /* Finish up the enumeration. */
17962 {
17967 }
17970 {
17972 {
17975 }
17977 {
17979 }
17980 }
17981 out:
17984 }
17986 /* Parse an enumerator-list. The enumerators all have the indicated
17987 TYPE.
17989 enumerator-list:
17990 enumerator-definition
17991 enumerator-list , enumerator-definition */
17993 static void
17995 {
17997 {
17998 /* Parse an enumerator-definition. */
18001 /* If the next token is not a ',', we've reached the end of
18002 the list. */
18005 /* Otherwise, consume the `,' and keep going. */
18007 /* If the next token is a `}', there is a trailing comma. */
18009 {
18014 }
18015 }
18016 }
18018 /* Parse an enumerator-definition. The enumerator has the indicated
18019 TYPE.
18021 enumerator-definition:
18022 enumerator
18023 enumerator = constant-expression
18025 enumerator:
18026 identifier
18028 GNU Extensions:
18030 enumerator-definition:
18031 enumerator attributes [opt]
18032 enumerator attributes [opt] = constant-expression */
18034 static void
18036 {
18037 tree identifier;
18038 tree value;
18039 location_t loc;
18041 /* Save the input location because we are interested in the location
18042 of the identifier and not the location of the explicit value. */
18045 /* Look for the identifier. */
18050 /* Parse any specified attributes. */
18053 /* If the next token is an '=', then there is an explicit value. */
18055 {
18056 /* Consume the `=' token. */
18058 /* Parse the value. */
18060 }
18061 else
18064 /* If we are processing a template, make sure the initializer of the
18065 enumerator doesn't contain any bare template parameter pack. */
18069 /* Create the enumerator. */
18071 }
18073 /* Parse a namespace-name.
18075 namespace-name:
18076 original-namespace-name
18077 namespace-alias
18079 Returns the NAMESPACE_DECL for the namespace. */
18081 static tree
18083 {
18084 tree identifier;
18085 tree namespace_decl;
18089 /* Get the name of the namespace. */
18094 /* Look up the identifier in the currently active scope. Look only
18095 for namespaces, due to:
18097 [basic.lookup.udir]
18099 When looking up a namespace-name in a using-directive or alias
18100 definition, only namespace names are considered.
18102 And:
18104 [basic.lookup.qual]
18106 During the lookup of a name preceding the :: scope resolution
18107 operator, object, function, and enumerator names are ignored.
18109 (Note that cp_parser_qualifying_entity only calls this
18110 function if the token after the name is the scope resolution
18111 operator.) */
18113 none_type,
18119 /* If it's not a namespace, issue an error. */
18122 {
18127 }
18130 }
18132 /* Parse a namespace-definition.
18134 namespace-definition:
18135 named-namespace-definition
18136 unnamed-namespace-definition
18138 named-namespace-definition:
18139 original-namespace-definition
18140 extension-namespace-definition
18142 original-namespace-definition:
18143 namespace identifier { namespace-body }
18145 extension-namespace-definition:
18146 namespace original-namespace-name { namespace-body }
18148 unnamed-namespace-definition:
18149 namespace { namespace-body } */
18151 static void
18153 {
18163 {
18167 }
18168 else
18171 /* Look for the `namespace' keyword. */
18174 /* Parse any specified attributes before the identifier. */
18177 /* Get the name of the namespace. We do not attempt to distinguish
18178 between an original-namespace-definition and an
18179 extension-namespace-definition at this point. The semantic
18180 analysis routines are responsible for that. */
18183 else
18186 /* Parse any specified attributes after the identifier. */
18189 {
18192 else
18194 }
18196 /* Start the namespace. */
18199 /* Parse any nested namespace definition. */
18201 {
18206 "nested namespace definitions only available with "
18211 {
18215 else
18216 {
18219 }
18222 }
18223 }
18225 /* Look for the `{' to validate starting the namespace. */
18228 /* "inline namespace" is equivalent to a stub namespace definition
18229 followed by a strong using directive. */
18231 {
18233 /* Set up namespace association. */
18237 /* Import the contents of the inline namespace. */
18241 }
18247 /* Parse the body of the namespace. */
18253 /* Finish the nested namespace definitions. */
18257 /* Finish the namespace. */
18260 /* Look for the final `}'. */
18262 }
18264 /* Parse a namespace-body.
18266 namespace-body:
18267 declaration-seq [opt] */
18269 static void
18271 {
18273 }
18275 /* Parse a namespace-alias-definition.
18277 namespace-alias-definition:
18278 namespace identifier = qualified-namespace-specifier ; */
18280 static void
18282 {
18283 tree identifier;
18284 tree namespace_specifier;
18288 /* Look for the `namespace' keyword. */
18290 /* Look for the identifier. */
18294 /* Look for the `=' token. */
18297 {
18299 /* Skip the definition. */
18304 }
18306 /* Look for the qualified-namespace-specifier. */
18307 namespace_specifier
18309 /* Look for the `;' token. */
18312 /* Register the alias in the symbol table. */
18314 }
18316 /* Parse a qualified-namespace-specifier.
18318 qualified-namespace-specifier:
18319 :: [opt] nested-name-specifier [opt] namespace-name
18321 Returns a NAMESPACE_DECL corresponding to the specified
18322 namespace. */
18324 static tree
18326 {
18327 /* Look for the optional `::'. */
18331 /* Look for the optional nested-name-specifier. */
18339 }
18341 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18342 access declaration.
18344 using-declaration:
18345 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18346 using :: unqualified-id ;
18348 access-declaration:
18349 qualified-id ;
18351 */
18353 static bool
18356 {
18360 tree decl;
18361 tree identifier;
18362 tree qscope;
18367 {
18370 }
18371 else
18372 {
18373 /* Look for the `using' keyword. */
18376 again:
18377 /* Peek at the next token. */
18379 /* See if it's `typename'. */
18381 {
18382 /* Remember that we've seen it. */
18384 /* Consume the `typename' token. */
18386 }
18387 }
18389 /* Look for the optional global scope qualification. */
18390 global_scope_p
18395 /* If we saw `typename', or didn't see `::', then there must be a
18396 nested-name-specifier present. */
18398 {
18404 {
18407 }
18408 }
18409 /* Otherwise, we could be in either of the two productions. In that
18410 case, treat the nested-name-specifier as optional. */
18411 else
18423 /* Something has already gone wrong; there's no need to parse
18424 further. Since an error has occurred, the return value of
18425 cp_parser_parse_definitely will be false, as required. */
18429 /* Parse the unqualified-id. */
18437 {
18442 }
18444 {
18449 "pack expansion in using-declaration only available "
18452 }
18454 /* The function we call to handle a using-declaration is different
18455 depending on what scope we are in. */
18457 ;
18460 /* [namespace.udecl]
18462 A using declaration shall not name a template-id. */
18465 else
18466 {
18468 {
18469 /* Create the USING_DECL. */
18476 {
18479 }
18480 else
18481 /* Add it to the list of members in this class. */
18483 }
18484 else
18485 {
18487 identifier,
18494 {
18497 }
18500 else
18502 }
18503 }
18507 {
18511 "comma-separated list in using-declaration only available "
18514 }
18516 /* Look for the final `;'. */
18521 "access declarations are deprecated "
18522 "in favour of using-declarations; "
18526 }
18528 /* Parse an alias-declaration.
18530 alias-declaration:
18531 using identifier attribute-specifier-seq [opt] = type-id */
18533 static tree
18535 {
18537 location_t id_location;
18539 cp_decl_specifier_seq decl_specs;
18543 /* Look for the `using' keyword. */
18544 cp_token *using_token
18566 /* Now we are going to parse the type-id of the declaration. */
18568 /*
18569 [dcl.type]/3 says:
18571 "A type-specifier-seq shall not define a class or enumeration
18572 unless it appears in the type-id of an alias-declaration (7.1.3) that
18573 is not the declaration of a template-declaration."
18575 In other words, if we currently are in an alias template, the
18576 type-id should not define a type.
18578 So let's set parser->type_definition_forbidden_message in that
18579 case; cp_parser_check_type_definition (called by
18580 cp_parser_class_specifier) will then emit an error if a type is
18581 defined in the type-id. */
18583 {
18587 }
18591 /* Restore the error message if need be. */
18597 {
18600 }
18602 /* A typedef-name can also be introduced by an alias-declaration. The
18603 identifier following the using keyword becomes a typedef-name. It has
18604 the same semantics as if it were introduced by the typedef
18605 specifier. In particular, it does not define a new type and it shall
18606 not appear in the type-id. */
18611 {
18614 ds_attribute,
18615 attrs_token);
18616 }
18618 ds_typedef,
18619 using_token);
18621 ds_alias,
18622 using_token);
18631 else
18637 // Attach constraints to the alias declaration.
18639 {
18643 }
18650 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18651 added into the symbol table; otherwise, return the TYPE_DECL. */
18655 {
18659 }
18662 }
18664 /* Parse a using-directive.
18666 using-directive:
18667 using namespace :: [opt] nested-name-specifier [opt]
18668 namespace-name ; */
18670 static void
18672 {
18673 tree namespace_decl;
18674 tree attribs;
18676 /* Look for the `using' keyword. */
18678 /* And the `namespace' keyword. */
18680 /* Look for the optional `::' operator. */
18682 /* And the optional nested-name-specifier. */
18688 /* Get the namespace being used. */
18690 /* And any specified attributes. */
18692 /* Update the symbol table. */
18694 /* Look for the final `;'. */
18696 }
18698 /* Parse an asm-definition.
18700 asm-definition:
18701 asm ( string-literal ) ;
18703 GNU Extension:
18705 asm-definition:
18706 asm volatile [opt] ( string-literal ) ;
18707 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18708 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18709 : asm-operand-list [opt] ) ;
18710 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18711 : asm-operand-list [opt]
18712 : asm-clobber-list [opt] ) ;
18713 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18714 : asm-clobber-list [opt]
18715 : asm-goto-list ) ; */
18717 static void
18719 {
18720 tree string;
18725 tree asm_stmt;
18733 /* Look for the `asm' keyword. */
18738 {
18741 }
18743 /* See if the next token is `volatile'. */
18746 {
18747 /* Remember that we saw the `volatile' keyword. */
18749 /* Consume the token. */
18751 }
18755 {
18756 /* Remember that we saw the `goto' keyword. */
18758 /* Consume the token. */
18760 }
18761 /* Look for the opening `('. */
18764 /* Look for the string. */
18767 {
18771 }
18773 /* If we're allowing GNU extensions, check for the extended assembly
18774 syntax. Unfortunately, the `:' tokens need not be separated by
18775 a space in C, and so, for compatibility, we tolerate that here
18776 too. Doing that means that we have to treat the `::' operator as
18777 two `:' tokens. */
18782 {
18787 /* The extended syntax was used. */
18790 /* Look for outputs. */
18792 {
18793 /* Consume the `:'. */
18795 /* Parse the output-operands. */
18797 CPP_COLON)
18799 CPP_SCOPE)
18801 CPP_CLOSE_PAREN)
18803 {
18807 }
18808 }
18809 /* If the next token is `::', there are no outputs, and the
18810 next token is the beginning of the inputs. */
18812 /* The inputs are coming next. */
18815 /* Look for inputs. */
18818 {
18819 /* Consume the `:' or `::'. */
18821 /* Parse the output-operands. */
18823 CPP_COLON)
18825 CPP_SCOPE)
18827 CPP_CLOSE_PAREN))
18828 {
18832 }
18833 }
18835 /* The clobbers are coming next. */
18838 /* Look for clobbers. */
18841 {
18843 /* Consume the `:' or `::'. */
18845 /* Parse the clobbers. */
18847 CPP_COLON)
18849 CPP_CLOSE_PAREN))
18851 }
18854 /* The labels are coming next. */
18857 /* Look for labels. */
18860 {
18862 /* Consume the `:' or `::'. */
18864 /* Parse the labels. */
18866 }
18870 }
18874 /* Look for the closing `)'. */
18882 {
18883 /* Create the ASM_EXPR. */
18885 {
18888 /* If the extended syntax was not used, mark the ASM_EXPR. */
18890 {
18896 }
18897 }
18898 else
18900 }
18901 }
18903 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18904 type that comes from the decl-specifier-seq. */
18906 static tree
18908 {
18911 {
18924 }
18927 }
18929 /* Declarators [gram.dcl.decl] */
18931 /* Parse an init-declarator.
18933 init-declarator:
18934 declarator initializer [opt]
18936 GNU Extension:
18938 init-declarator:
18939 declarator asm-specification [opt] attributes [opt] initializer [opt]
18941 function-definition:
18942 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18943 function-body
18944 decl-specifier-seq [opt] declarator function-try-block
18946 GNU Extension:
18948 function-definition:
18949 __extension__ function-definition
18951 TM Extension:
18953 function-definition:
18954 decl-specifier-seq [opt] declarator function-transaction-block
18956 The DECL_SPECIFIERS apply to this declarator. Returns a
18957 representation of the entity declared. If MEMBER_P is TRUE, then
18958 this declarator appears in a class scope. The new DECL created by
18959 this declarator is returned.
18961 The CHECKS are access checks that should be performed once we know
18962 what entity is being declared (and, therefore, what classes have
18963 befriended it).
18965 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18966 for a function-definition here as well. If the declarator is a
18967 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18968 be TRUE upon return. By that point, the function-definition will
18969 have been completely parsed.
18971 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18972 is FALSE.
18974 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18975 parsed declaration if it is an uninitialized single declarator not followed
18976 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18977 if present, will not be consumed. If returned, this declarator will be
18978 created with SD_INITIALIZED but will not call cp_finish_decl.
18980 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18981 and there is an initializer, the pointed location_t is set to the
18982 location of the '=' or `(', or '{' in C++11 token introducing the
18983 initializer. */
18985 static tree
18996 {
19000 tree prefix_attributes;
19002 tree asm_specification;
19003 tree initializer;
19005 tree scope;
19007 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19008 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19009 "(...)". */
19020 /* Gather the attributes that were provided with the
19021 decl-specifiers. */
19024 /* Assume that this is not the declarator for a function
19025 definition. */
19029 /* Default arguments are only permitted for function parameters. */
19033 /* Defer access checks while parsing the declarator; we cannot know
19034 what names are accessible until we know what is being
19035 declared. */
19040 /* Parse the declarator. */
19041 declarator
19046 /* Gather up the deferred checks. */
19051 /* If the DECLARATOR was erroneous, there's no need to go
19052 further. */
19056 /* Check that the number of template-parameter-lists is OK. */
19066 /* Figure out what scope the entity declared by the DECLARATOR is
19067 located in. `grokdeclarator' sometimes changes the scope, so
19068 we compute it now. */
19071 /* Perform any lookups in the declared type which were thought to be
19072 dependent, but are not in the scope of the declarator. */
19073 decl_specifiers->type
19076 /* If we're allowing GNU extensions, look for an
19077 asm-specification. */
19079 {
19080 /* Look for an asm-specification. */
19083 }
19084 else
19087 /* Look for attributes. */
19091 /* Peek at the next token. */
19097 {
19098 /* Handle C++17 deduction guides. */
19102 {
19110 {
19114 }
19115 }
19117 /* Check to see if the token indicates the start of a
19118 function-definition. */
19120 {
19122 {
19123 /* If a function-definition should not appear here, issue an
19124 error message. */
19128 }
19130 location_t func_brace_location
19133 /* Neither attributes nor an asm-specification are allowed
19134 on a function-definition. */
19137 "an asm-specification is not allowed "
19141 "attributes are not allowed "
19143 /* This is a function-definition. */
19146 /* Parse the function definition. */
19149 decl_specifiers,
19150 declarator,
19151 prefix_attributes);
19152 else
19153 decl =
19154 (cp_parser_function_definition_from_specifiers_and_declarator
19158 {
19159 /* This is where the prologue starts... */
19162 }
19165 }
19166 }
19168 {
19169 /* A non-template declaration involving a function parameter list
19170 containing an implicit template parameter will be made into a
19171 template. If the resulting declaration is not going to be an
19172 actual function then finish the template scope here to prevent it.
19173 An error message will be issued once we have a decl to talk about.
19175 FIXME probably we should do type deduction rather than create an
19176 implicit template, but the standard currently doesn't allow it. */
19179 }
19181 /* [dcl.dcl]
19183 Only in function declarations for constructors, destructors, type
19184 conversions, and deduction guides can the decl-specifier-seq be omitted.
19186 We explicitly postpone this check past the point where we handle
19187 function-definitions because we tolerate function-definitions
19188 that are missing their return types in some modes. */
19190 {
19194 }
19196 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19200 {
19211 {
19217 }
19218 }
19219 else
19220 {
19221 /* If the init-declarator isn't initialized and isn't followed by a
19222 `,' or `;', it's not a valid init-declarator. */
19225 {
19228 else
19229 {
19233 }
19234 }
19237 }
19239 /* Because start_decl has side-effects, we should only call it if we
19240 know we're going ahead. By this point, we know that we cannot
19241 possibly be looking at any other construct. */
19244 /* Enter the newly declared entry in the symbol table. If we're
19245 processing a declaration in a class-specifier, we wait until
19246 after processing the initializer. */
19248 {
19256 /* Adjust location of decl if declarator->id_loc is more appropriate:
19257 set, and decl wasn't merged with another decl, in which case its
19258 location would be different from input_location, and more accurate. */
19263 }
19265 /* Enter the SCOPE. That way unqualified names appearing in the
19266 initializer will be looked up in SCOPE. */
19269 /* Perform deferred access control checks, now that we know in which
19270 SCOPE the declared entity resides. */
19272 {
19275 /* If the entity being declared is a function, pretend that we
19276 are in its scope. If it is a `friend', it may have access to
19277 things that would not otherwise be accessible. */
19279 {
19282 }
19284 /* Perform access checks for template parameters. */
19287 /* Perform the access control checks for the declarator and the
19288 decl-specifiers. */
19291 /* Restore the saved value. */
19294 }
19296 /* Parse the initializer. */
19301 {
19303 {
19306 else
19307 {
19308 /* If the declaration was erroneous, we don't really
19309 know what the user intended, so just silently
19310 consume the initializer. */
19317 }
19318 }
19319 else
19320 {
19321 /* We want to record the extra mangling scope for in-class
19322 initializers of class members and initializers of static data
19323 member templates. The former involves deferring
19324 parsing of the initializer until end of class as with default
19325 arguments. So right here we only handle the latter. */
19335 }
19336 }
19338 /* The old parser allows attributes to appear after a parenthesized
19339 initializer. Mark Mitchell proposed removing this functionality
19340 on the GCC mailing lists on 2002-08-13. This parser accepts the
19341 attributes -- but ignores them. */
19348 /* And now complain about a non-function implicit template. */
19353 /* For an in-class declaration, use `grokfield' to create the
19354 declaration. */
19356 {
19358 {
19361 }
19370 }
19372 /* Finish processing the declaration. But, skip member
19373 declarations. */
19375 {
19378 asm_specification,
19379 /* If the initializer is in parentheses, then this is
19380 a direct-initialization, which means that an
19381 `explicit' constructor is OK. Otherwise, an
19382 `explicit' constructor cannot be used. */
19385 }
19388 /* Core issue #226 (C++0x only): A default template-argument
19389 shall not be specified in a friend class template
19390 declaration. */
19399 {
19402 else
19404 }
19411 }
19413 /* Parse a declarator.
19415 declarator:
19416 direct-declarator
19417 ptr-operator declarator
19419 abstract-declarator:
19420 ptr-operator abstract-declarator [opt]
19421 direct-abstract-declarator
19423 GNU Extensions:
19425 declarator:
19426 attributes [opt] direct-declarator
19427 attributes [opt] ptr-operator declarator
19429 abstract-declarator:
19430 attributes [opt] ptr-operator abstract-declarator [opt]
19431 attributes [opt] direct-abstract-declarator
19433 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19434 detect constructors, destructors, deduction guides, or conversion operators.
19435 It is set to -1 if the declarator is a name, and +1 if it is a
19436 function. Otherwise it is set to zero. Usually you just want to
19437 test for >0, but internally the negative value is used.
19439 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19440 a decl-specifier-seq unless it declares a constructor, destructor,
19441 or conversion. It might seem that we could check this condition in
19442 semantic analysis, rather than parsing, but that makes it difficult
19443 to handle something like `f()'. We want to notice that there are
19444 no decl-specifiers, and therefore realize that this is an
19445 expression, not a declaration.)
19447 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19448 the declarator is a direct-declarator of the form "(...)".
19450 MEMBER_P is true iff this declarator is a member-declarator.
19452 FRIEND_P is true iff this declarator is a friend. */
19456 cp_parser_declarator_kind dcl_kind,
19460 {
19463 cp_cv_quals cv_quals;
19464 tree class_type;
19467 /* Assume this is not a constructor, destructor, or type-conversion
19468 operator. */
19475 /* Check for the ptr-operator production. */
19477 /* Parse the ptr-operator. */
19483 /* If that worked, then we have a ptr-operator. */
19485 {
19486 /* If a ptr-operator was found, then this declarator was not
19487 parenthesized. */
19490 /* The dependent declarator is optional if we are parsing an
19491 abstract-declarator. */
19495 /* Parse the dependent declarator. */
19500 friend_p);
19502 /* If we are parsing an abstract-declarator, we must handle the
19503 case where the dependent declarator is absent. */
19508 declarator = cp_parser_make_indirect_declarator
19510 }
19511 /* Everything else is a direct-declarator. */
19512 else
19513 {
19516 CPP_OPEN_PAREN);
19518 ctor_dtor_or_conv_p,
19520 }
19525 }
19527 /* Parse a direct-declarator or direct-abstract-declarator.
19529 direct-declarator:
19530 declarator-id
19531 direct-declarator ( parameter-declaration-clause )
19532 cv-qualifier-seq [opt]
19533 ref-qualifier [opt]
19534 exception-specification [opt]
19535 direct-declarator [ constant-expression [opt] ]
19536 ( declarator )
19538 direct-abstract-declarator:
19539 direct-abstract-declarator [opt]
19540 ( parameter-declaration-clause )
19541 cv-qualifier-seq [opt]
19542 ref-qualifier [opt]
19543 exception-specification [opt]
19544 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19545 ( abstract-declarator )
19547 Returns a representation of the declarator. DCL_KIND is
19548 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19549 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19550 we are parsing a direct-declarator. It is
19551 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19552 of ambiguity we prefer an abstract declarator, as per
19553 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19554 as for cp_parser_declarator. */
19558 cp_parser_declarator_kind dcl_kind,
19561 {
19571 {
19572 /* Peek at the next token. */
19575 {
19576 /* This is either a parameter-declaration-clause, or a
19577 parenthesized declarator. When we know we are parsing a
19578 named declarator, it must be a parenthesized declarator
19579 if FIRST is true. For instance, `(int)' is a
19580 parameter-declaration-clause, with an omitted
19581 direct-abstract-declarator. But `((*))', is a
19582 parenthesized abstract declarator. Finally, when T is a
19583 template parameter `(T)' is a
19584 parameter-declaration-clause, and not a parenthesized
19585 named declarator.
19587 We first try and parse a parameter-declaration-clause,
19588 and then try a nested declarator (if FIRST is true).
19590 It is not an error for it not to be a
19591 parameter-declaration-clause, even when FIRST is
19592 false. Consider,
19594 int i (int);
19595 int i (3);
19597 The first is the declaration of a function while the
19598 second is the definition of a variable, including its
19599 initializer.
19601 Having seen only the parenthesis, we cannot know which of
19602 these two alternatives should be selected. Even more
19603 complex are examples like:
19605 int i (int (a));
19606 int i (int (3));
19608 The former is a function-declaration; the latter is a
19609 variable initialization.
19611 Thus again, we try a parameter-declaration-clause, and if
19612 that fails, we back out and return. */
19615 {
19616 tree params;
19619 /* In a member-declarator, the only valid interpretation
19620 of a parenthesis is the start of a
19621 parameter-declaration-clause. (It is invalid to
19622 initialize a static data member with a parenthesized
19623 initializer; only the "=" form of initialization is
19624 permitted.) */
19628 /* Consume the `('. */
19631 {
19632 /* If this is going to be an abstract declarator, we're
19633 in a declarator and we can't have default args. */
19636 }
19640 /* Parse the parameter-declaration-clause. */
19643 /* Consume the `)'. */
19646 /* If all went well, parse the cv-qualifier-seq,
19647 ref-qualifier and the exception-specification. */
19649 {
19650 cp_cv_quals cv_quals;
19651 cp_virt_specifiers virt_specifiers;
19652 cp_ref_qualifier ref_qual;
19653 tree exception_specification;
19654 tree late_return;
19655 tree attrs;
19665 /* Parse the cv-qualifier-seq. */
19667 /* Parse the ref-qualifier. */
19669 /* Parse the tx-qualifier. */
19671 /* And the exception-specification. */
19672 exception_specification
19677 /* In here, we handle cases where attribute is used after
19678 the function declaration. For example:
19679 void func (int x) __attribute__((vector(..))); */
19683 {
19687 CPP_SEMICOLON)
19689 CPP_OPEN_BRACE))
19692 ;
19693 else
19695 }
19697 late_return = (cp_parser_late_return_type_opt
19701 /* Parse the virt-specifier-seq. */
19704 /* Create the function-declarator. */
19706 params,
19707 cv_quals,
19708 virt_specifiers,
19709 ref_qual,
19710 tx_qual,
19711 exception_specification,
19712 late_return,
19713 requires_clause);
19716 /* Any subsequent parameter lists are to do with
19717 return type, so are not those of the declared
19718 function. */
19720 }
19722 /* Remove the function parms from scope. */
19726 /* Repeat the main loop. */
19728 }
19730 /* If this is the first, we can try a parenthesized
19731 declarator. */
19733 {
19739 /* Consume the `('. */
19741 /* Parse the nested declarator. */
19744 declarator
19750 /* Expect a `)'. */
19757 }
19758 /* Otherwise, we must be done. */
19759 else
19761 }
19765 {
19766 /* Parse an array-declarator. */
19775 /* Consume the `['. */
19777 /* Peek at the next token. */
19779 /* If the next token is `]', then there is no
19780 constant-expression. */
19782 {
19784 bounds
19794 {
19795 /* Normally, the array bound must be an integral constant
19796 expression. However, as an extension, we allow VLAs
19797 in function scopes as long as they aren't part of a
19798 parameter declaration. */
19802 }
19805 {
19806 /* Remember this wasn't a constant-expression. */
19809 }
19810 }
19811 else
19813 /* Look for the closing `]'. */
19815 {
19818 }
19823 }
19825 {
19826 {
19827 tree qualifying_scope;
19828 tree unqualified_name;
19829 tree attrs;
19830 special_function_kind sfk;
19835 /* Parse a declarator-id */
19838 {
19841 /* If we see an ellipsis, we should be looking at a
19842 parameter pack. */
19844 {
19845 /* Consume the `...' */
19849 }
19850 }
19853 unqualified_name
19857 {
19861 {
19862 /* Check whether an error occurred. */
19865 /* We already consumed the ellipsis to mark a
19866 parameter pack, but we have no way to report it,
19867 so abort the tentative parse. We will be exiting
19868 immediately anyway. */
19870 }
19871 else
19877 && (qualifying_scope
19879 {
19882 }
19883 }
19888 {
19893 }
19899 {
19900 /* In the declaration of a member of a template class
19901 outside of the class itself, the SCOPE will sometimes
19902 be a TYPENAME_TYPE. For example, given:
19904 template <typename T>
19905 int S<T>::R::i = 3;
19907 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19908 this context, we must resolve S<T>::R to an ordinary
19909 type, rather than a typename type.
19911 The reason we normally avoid resolving TYPENAME_TYPEs
19912 is that a specialization of `S' might render
19913 `S<T>::R' not a type. However, if `S' is
19914 specialized, then this `i' will not be used, so there
19915 is no harm in resolving the types here. */
19916 tree type;
19918 /* Resolve the TYPENAME_TYPE. */
19921 /* If that failed, the declarator is invalid. */
19923 {
19926 "cannot define member of dependent typedef "
19928 else
19933 }
19935 }
19940 {
19941 tree class_type;
19946 else
19950 {
19953 {
19956 {
19960 "use %<%T::%D%> instead of %<%T::%D%> to "
19962 class_type,
19967 }
19968 else
19970 }
19971 else
19972 {
19973 /* We do not attempt to print the declarator
19974 here because we do not have enough
19975 information about its original syntactic
19976 form. */
19980 }
19981 }
19984 {
19990 for an unnamed type, even if the type
19991 got a name for linkage purposes. */
19993 /* Handle correctly (c++/19200):
19995 struct S {
19996 struct T{};
19997 friend void S(T);
19998 };
20000 and also:
20002 namespace N {
20003 void S();
20004 }
20006 struct S {
20007 friend void N::S();
20008 }; */
20009 && !(friend_p
20012 class_type))
20013 {
20016 }
20024 }
20025 }
20027 unqualified_name,
20028 sfk);
20035 }
20037 handle_declarator:;
20040 {
20041 /* Any names that appear after the declarator-id for a
20042 member are looked up in the containing scope. */
20044 {
20045 /* But declarations with qualified-ids can't appear in a
20046 function. */
20050 }
20052 }
20056 /* Default args are only allowed on function
20057 declarations. */
20059 else
20063 }
20064 /* We're done. */
20065 else
20067 }
20069 /* For an abstract declarator, we might wind up with nothing at this
20070 point. That's an error; the declarator is not optional. */
20074 /* If we entered a scope, we must exit it now. */
20082 }
20084 /* Parse a ptr-operator.
20086 ptr-operator:
20087 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20088 * cv-qualifier-seq [opt]
20089 &
20090 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20091 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20093 GNU Extension:
20095 ptr-operator:
20096 & cv-qualifier-seq [opt]
20098 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20099 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20100 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20101 filled in with the TYPE containing the member. *CV_QUALS is
20102 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20103 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20104 Note that the tree codes returned by this function have nothing
20105 to do with the types of trees that will be eventually be created
20106 to represent the pointer or reference type being parsed. They are
20107 just constants with suggestive names. */
20108 static enum tree_code
20113 {
20118 /* Assume that it's not a pointer-to-member. */
20120 /* And that there are no cv-qualifiers. */
20123 /* Peek at the next token. */
20126 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20136 {
20137 /* Consume the `*', `&' or `&&'. */
20140 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20141 `&', if we are allowing GNU extensions. (The only qualifier
20142 that can legally appear after `&' is `restrict', but that is
20143 enforced during semantic analysis. */
20151 }
20152 else
20153 {
20154 /* Try the pointer-to-member case. */
20156 /* Look for the optional `::' operator. */
20159 /* Look for the nested-name specifier. */
20166 /* If we found it, and the next token is a `*', then we are
20167 indeed looking at a pointer-to-member operator. */
20170 {
20171 /* Indicate that the `*' operator was used. */
20179 else
20180 {
20181 /* The type of which the member is a member is given by the
20182 current SCOPE. */
20184 /* The next name will not be qualified. */
20188 /* Look for optional c++11 attributes. */
20192 /* Look for the optional cv-qualifier-seq. */
20194 }
20195 }
20196 /* If that didn't work we don't have a ptr-operator. */
20199 }
20202 }
20204 /* Parse an (optional) cv-qualifier-seq.
20206 cv-qualifier-seq:
20207 cv-qualifier cv-qualifier-seq [opt]
20209 cv-qualifier:
20210 const
20211 volatile
20213 GNU Extension:
20215 cv-qualifier:
20216 __restrict__
20218 Returns a bitmask representing the cv-qualifiers. */
20220 static cp_cv_quals
20222 {
20226 {
20228 cp_cv_quals cv_qualifier;
20230 /* Peek at the next token. */
20232 /* See if it's a cv-qualifier. */
20234 {
20250 }
20256 {
20259 }
20260 else
20261 {
20264 }
20265 }
20268 }
20270 /* Parse an (optional) ref-qualifier
20272 ref-qualifier:
20273 &
20274 &&
20276 Returns cp_ref_qualifier representing ref-qualifier. */
20278 static cp_ref_qualifier
20280 {
20283 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20288 {
20293 {
20305 }
20310 {
20313 }
20314 else
20315 {
20318 }
20319 }
20322 }
20324 /* Parse an optional tx-qualifier.
20326 tx-qualifier:
20327 transaction_safe
20328 transaction_safe_dynamic */
20330 static tree
20332 {
20335 {
20340 {
20344 {
20347 {
20350 }
20351 else
20353 }
20354 }
20355 }
20357 }
20359 /* Parse an (optional) virt-specifier-seq.
20361 virt-specifier-seq:
20362 virt-specifier virt-specifier-seq [opt]
20364 virt-specifier:
20365 override
20366 final
20368 Returns a bitmask representing the virt-specifiers. */
20370 static cp_virt_specifiers
20372 {
20376 {
20378 cp_virt_specifiers virt_specifier;
20380 /* Peek at the next token. */
20382 /* See if it's a virt-specifier-qualifier. */
20386 {
20389 }
20391 {
20394 }
20396 {
20398 }
20399 else
20403 {
20406 }
20407 else
20408 {
20411 }
20412 }
20414 }
20416 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20417 is in scope even though it isn't real. */
20419 void
20421 {
20422 tree this_parm;
20425 {
20426 /* We don't clear this between NSDMIs. Is it already what we want? */
20431 }
20434 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20436 current_class_ref
20439 }
20441 /* Return true iff our current scope is a non-static data member
20442 initializer. */
20444 bool
20446 {
20447 /* We recognize NSDMI context by the context-less 'this' pointer set up
20448 by the function above. */
20454 }
20456 /* Return true iff our current scope is a default capturing generic lambda
20457 defined within a template. FIXME: This is part of a workaround (see
20458 semantics.c) to handle building lambda closure types correctly in templates
20459 which we ultimately want to defer to instantiation time. */
20461 bool
20463 {
20481 }
20483 /* Parse a late-specified return type, if any. This is not a separate
20484 non-terminal, but part of a function declarator, which looks like
20486 -> trailing-type-specifier-seq abstract-declarator(opt)
20488 Returns the type indicated by the type-id.
20490 In addition to this, parse any queued up #pragma omp declare simd
20491 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20492 #pragma acc routine clauses.
20494 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20495 function. */
20497 static tree
20500 {
20504 && declarator
20511 && declarator
20514 /* Peek at the next token. */
20516 /* A late-specified return type is indicated by an initial '->'. */
20527 {
20528 /* DR 1207: 'this' is in scope in the trailing return type. */
20530 }
20533 {
20534 /* Consume the ->. */
20538 }
20540 /* Function declarations may be followed by a trailing
20541 requires-clause. */
20545 declarator->attributes
20549 declarator->attributes
20553 declarator->attributes
20558 {
20561 }
20564 }
20566 /* Parse a declarator-id.
20568 declarator-id:
20569 id-expression
20570 :: [opt] nested-name-specifier [opt] type-name
20572 In the `id-expression' case, the value returned is as for
20573 cp_parser_id_expression if the id-expression was an unqualified-id.
20574 If the id-expression was a qualified-id, then a SCOPE_REF is
20575 returned. The first operand is the scope (either a NAMESPACE_DECL
20576 or TREE_TYPE), but the second is still just a representation of an
20577 unqualified-id. */
20579 static tree
20581 {
20582 tree id;
20583 /* The expression must be an id-expression. Assume that qualified
20584 names are the names of types so that:
20586 template <class T>
20587 int S<T>::R::i = 3;
20589 will work; we must treat `S<T>::R' as the name of a type.
20590 Similarly, assume that qualified names are templates, where
20591 required, so that:
20593 template <class T>
20594 int S<T>::R<T>::i = 3;
20596 will work, too. */
20602 optional_p);
20606 }
20608 /* Parse a type-id.
20610 type-id:
20611 type-specifier-seq abstract-declarator [opt]
20613 Returns the TYPE specified. */
20615 static tree
20618 {
20619 cp_decl_specifier_seq type_specifier_seq;
20622 /* Parse the type-specifier-seq. */
20624 is_trailing_return,
20629 /* A bare template name as a template argument is a template template
20630 argument, not a placeholder, so fail parsing it as a type argument. */
20631 {
20635 }
20639 /* There might or might not be an abstract declarator. */
20641 /* Look for the declarator. */
20642 abstract_declarator
20647 /* Check to see if there really was a declarator. */
20652 /* The concepts TS allows 'auto' as a type-id. */
20654 /* None of the valid uses of 'auto' in C++14 involve the type-id
20655 nonterminal, but it is valid in a trailing-return-type. */
20658 {
20659 /* A type-id with type 'auto' is only ok if the abstract declarator
20660 is a function declarator with a late-specified return type.
20662 A type-id with 'auto' is also valid in a trailing-return-type
20663 in a compound-requirement. */
20670 else
20671 {
20674 {
20676 auto_node);
20678 tmpl);
20679 }
20680 else
20683 }
20684 }
20687 is_template_arg);
20688 }
20690 static tree
20692 {
20694 }
20696 static tree
20698 {
20699 tree r;
20701 parser->type_definition_forbidden_message
20706 {
20709 }
20711 }
20713 static tree
20715 {
20717 }
20719 /* Parse a type-specifier-seq.
20721 type-specifier-seq:
20722 type-specifier type-specifier-seq [opt]
20724 GNU extension:
20726 type-specifier-seq:
20727 attributes type-specifier-seq [opt]
20729 If IS_DECLARATION is true, we are at the start of a "condition" or
20730 exception-declaration, so we might be followed by a declarator-id.
20732 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20733 i.e. we've just seen "->".
20735 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20737 static void
20742 {
20747 /* Clear the TYPE_SPECIFIER_SEQ. */
20750 /* In the context of a trailing return type, enum E { } is an
20751 elaborated-type-specifier followed by a function-body, not an
20752 enum-specifier. */
20756 /* Parse the type-specifiers and attributes. */
20758 {
20759 tree type_specifier;
20762 /* Check for attributes first. */
20764 {
20769 }
20771 /* record the token of the beginning of the type specifier seq,
20772 for error reporting purposes*/
20776 /* Look for the type-specifier. */
20778 flags,
20779 type_specifier_seq,
20781 NULL,
20784 {
20785 /* If the first type-specifier could not be found, this is not a
20786 type-specifier-seq at all. */
20788 {
20789 /* Set in_declarator_p to avoid skipping to the semicolon. */
20801 }
20802 /* If subsequent type-specifiers could not be found, the
20803 type-specifier-seq is complete. */
20805 }
20808 /* The standard says that a condition can be:
20810 type-specifier-seq declarator = assignment-expression
20812 However, given:
20814 struct S {};
20815 if (int S = ...)
20817 we should treat the "S" as a declarator, not as a
20818 type-specifier. The standard doesn't say that explicitly for
20819 type-specifier-seq, but it does say that for
20820 decl-specifier-seq in an ordinary declaration. Perhaps it
20821 would be clearer just to allow a decl-specifier-seq here, and
20822 then add a semantic restriction that if any decl-specifiers
20823 that are not type-specifiers appear, the program is invalid. */
20826 }
20827 }
20829 /* Return whether the function currently being declared has an associated
20830 template parameter list. */
20832 static bool
20834 {
20847 }
20849 /* Parse a parameter-declaration-clause.
20851 parameter-declaration-clause:
20852 parameter-declaration-list [opt] ... [opt]
20853 parameter-declaration-list , ...
20855 Returns a representation for the parameter declarations. A return
20856 value of NULL indicates a parameter-declaration-clause consisting
20857 only of an ellipsis. */
20859 static tree
20861 {
20862 tree parameters;
20871 parser->auto_is_implicit_function_template_parm_p
20873 }
20879 && !processing_template_parmlist
20885 /* Peek at the next token. */
20887 /* Check for trivial parameter-declaration-clauses. */
20889 {
20890 /* Consume the `...' token. */
20893 }
20895 /* There are no parameters. */
20896 {
20897 #ifndef NO_IMPLICIT_EXTERN_C
20902 else
20903 #endif
20905 }
20906 /* Check for `(void)', too, which is a special case. */
20910 {
20911 /* Consume the `void' token. */
20913 /* There are no parameters. */
20915 }
20917 /* Parse the parameter-declaration-list. */
20919 /* If a parse error occurred while parsing the
20920 parameter-declaration-list, then the entire
20921 parameter-declaration-clause is erroneous. */
20925 /* Peek at the next token. */
20927 /* If it's a `,', the clause should terminate with an ellipsis. */
20929 {
20930 /* Consume the `,'. */
20932 /* Expect an ellipsis. */
20933 ellipsis_p
20935 }
20936 /* It might also be `...' if the optional trailing `,' was
20937 omitted. */
20939 {
20940 /* Consume the `...' token. */
20942 /* And remember that we saw it. */
20944 }
20945 else
20948 /* Finish the parameter list. */
20953 }
20955 /* Parse a parameter-declaration-list.
20957 parameter-declaration-list:
20958 parameter-declaration
20959 parameter-declaration-list , parameter-declaration
20961 Returns a representation of the parameter-declaration-list, as for
20962 cp_parser_parameter_declaration_clause. However, the
20963 `void_list_node' is never appended to the list. Upon return,
20964 *IS_ERROR will be true iff an error occurred. */
20966 static tree
20968 {
20974 /* Assume all will go well. */
20976 /* The special considerations that apply to a function within an
20977 unbraced linkage specifications do not apply to the parameters
20978 to the function. */
20979 saved_in_unbraced_linkage_specification_p
20983 /* Look for more parameters. */
20985 {
20993 /* Parse the parameter. */
20994 parameter
20999 /* We don't know yet if the enclosing context is deprecated, so wait
21000 and warn in grokparms if appropriate. */
21004 {
21005 /* If a function parameter pack was specified and an implicit template
21006 parameter was introduced during cp_parser_parameter_declaration,
21007 change any implicit parameters introduced into packs. */
21011 {
21019 }
21023 PARM,
21026 }
21030 /* If a parse error occurred parsing the parameter declaration,
21031 then the entire parameter-declaration-list is erroneous. */
21033 {
21037 }
21047 {
21051 }
21053 /* Add the new parameter to the list. */
21057 /* Peek at the next token. */
21060 /* These are for Objective-C++ */
21063 /* The parameter-declaration-list is complete. */
21066 {
21069 /* Peek at the next token. */
21071 /* If it's an ellipsis, then the list is complete. */
21074 /* Otherwise, there must be more parameters. Consume the
21075 `,'. */
21077 /* When parsing something like:
21079 int i(float f, double d)
21081 we can tell after seeing the declaration for "f" that we
21082 are not looking at an initialization of a variable "i",
21083 but rather at the declaration of a function "i".
21085 Due to the fact that the parsing of template arguments
21086 (as specified to a template-id) requires backtracking we
21087 cannot use this technique when inside a template argument
21088 list. */
21092 /* However, a parameter-declaration of the form
21093 "float(f)" (which is a valid declaration of a
21094 parameter "f") can also be interpreted as an
21095 expression (the conversion of "f" to "float"). */
21098 }
21099 else
21100 {
21108 }
21109 }
21111 parser->in_unbraced_linkage_specification_p
21114 /* Reset implicit_template_scope if we are about to leave the function
21115 parameter list that introduced it. Note that for out-of-line member
21116 definitions, there will be one or more class scopes before we get to
21117 the template parameter scope. */
21121 {
21125 {
21128 }
21129 }
21132 }
21134 /* Parse a parameter declaration.
21136 parameter-declaration:
21137 decl-specifier-seq ... [opt] declarator
21138 decl-specifier-seq declarator = assignment-expression
21139 decl-specifier-seq ... [opt] abstract-declarator [opt]
21140 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21142 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21143 declares a template parameter. (In that case, a non-nested `>'
21144 token encountered during the parsing of the assignment-expression
21145 is not interpreted as a greater-than operator.)
21147 Returns a representation of the parameter, or NULL if an error
21148 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21149 true iff the declarator is of the form "(p)". */
21155 {
21157 cp_decl_specifier_seq decl_specifiers;
21159 tree default_argument;
21164 /* In a template parameter, `>' is not an operator.
21166 [temp.param]
21168 When parsing a default template-argument for a non-type
21169 template-parameter, the first non-nested `>' is taken as the end
21170 of the template parameter-list rather than a greater-than
21171 operator. */
21173 /* Type definitions may not appear in parameter types. */
21175 parser->type_definition_forbidden_message
21178 /* Parse the declaration-specifiers. */
21180 CP_PARSER_FLAGS_NONE,
21184 /* Complain about missing 'typename' or other invalid type names. */
21189 /* If an error occurred, there's no reason to attempt to parse the
21190 rest of the declaration. */
21192 {
21195 }
21197 /* Peek at the next token. */
21200 /* If the next token is a `)', `,', `=', `>', or `...', then there
21201 is no declarator. However, when variadic templates are enabled,
21202 there may be a declarator following `...'. */
21207 {
21211 }
21212 /* Otherwise, there should be a declarator. */
21213 else
21214 {
21218 /* After seeing a decl-specifier-seq, if the next token is not a
21219 "(", there is no possibility that the code is a valid
21220 expression. Therefore, if parsing tentatively, we commit at
21221 this point. */
21223 /* In an expression context, having seen:
21225 (int((char ...
21227 we cannot be sure whether we are looking at a
21228 function-type (taking a "char" as a parameter) or a cast
21229 of some object of type "char" to "int". */
21235 /* Parse the declarator. */
21238 CP_PARSER_DECLARATOR_EITHER,
21240 parenthesized_p,
21244 /* After the declarator, allow more attributes. */
21245 decl_specifiers.attributes
21249 /* If the declarator is a template parameter pack, remember that and
21250 clear the flag in the declarator itself so we don't get errors
21251 from grokdeclarator. */
21253 {
21256 }
21257 }
21259 /* If the next token is an ellipsis, and we have not seen a declarator
21260 name, and if either the type of the declarator contains parameter
21261 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21262 for, eg, abbreviated integral type names), then we actually have a
21263 parameter pack expansion expression. Otherwise, leave the ellipsis
21264 for a C-style variadic function. */
21267 {
21278 {
21279 /* Consume the `...'. */
21283 /* Build a pack expansion type */
21288 else
21290 }
21291 }
21293 /* The restriction on defining new types applies only to the type
21294 of the parameter, not to the default argument. */
21297 /* If the next token is `=', then process a default argument. */
21299 {
21302 /* If we are defining a class, then the tokens that make up the
21303 default argument must be saved and processed later. */
21309 // A constrained-type-specifier may declare a type template-parameter.
21311 default_argument
21314 // A constrained-type-specifier may declare a template-template-parameter.
21316 default_argument
21319 /* Outside of a class definition, we can just parse the
21320 assignment-expression. */
21321 else
21322 default_argument
21326 {
21328 "default arguments are only "
21330 }
21332 || template_parameter_pack_p
21335 {
21336 /* Find the name of the parameter pack. */
21343 template_parm_p
21349 else
21351 template_parm_p
21358 }
21359 }
21360 else
21364 declarator,
21365 default_argument,
21366 template_parameter_pack_p);
21367 }
21369 /* Parse a default argument and return it.
21371 TEMPLATE_PARM_P is true if this is a default argument for a
21372 non-type template parameter. */
21373 static tree
21375 {
21381 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21382 set correctly. */
21385 /* Local variable names (and the `this' keyword) may not
21386 appear in a default argument. */
21389 /* Parse the assignment-expression. */
21394 /* The "this" pointer is not valid in a default argument. */
21396 {
21401 }
21402 default_argument
21404 /* Restore the "this" pointer. */
21406 {
21409 }
21418 }
21420 /* Parse a function-body.
21422 function-body:
21423 compound_statement */
21425 static void
21427 {
21431 }
21433 /* Parse a ctor-initializer-opt followed by a function-body. Return
21434 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21435 is true we are parsing a function-try-block. */
21437 static bool
21440 {
21448 /* Begin the function body. */
21450 /* Parse the optional ctor-initializer. */
21453 /* If we're parsing a constexpr constructor definition, we need
21454 to check that the constructor body is indeed empty. However,
21455 before we get to cp_parser_function_body lot of junk has been
21456 generated, so we can't just check that we have an empty block.
21457 Rather we take a snapshot of the outermost block, and check whether
21458 cp_parser_function_body changed its state. */
21460 {
21464 }
21465 /* Parse the function-body. */
21469 /* Finish the function body. */
21473 }
21475 /* Parse an initializer.
21477 initializer:
21478 = initializer-clause
21479 ( expression-list )
21481 Returns an expression representing the initializer. If no
21482 initializer is present, NULL_TREE is returned.
21484 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21485 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21486 set to TRUE if there is no initializer present. If there is an
21487 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21488 is set to true; otherwise it is set to false. */
21490 static tree
21493 {
21495 tree init;
21497 /* Peek at the next token. */
21500 /* Let our caller know whether or not this initializer was
21501 parenthesized. */
21503 /* Assume that the initializer is constant. */
21507 {
21508 /* Consume the `='. */
21510 /* Parse the initializer-clause. */
21512 }
21514 {
21519 non_constant_p);
21524 }
21526 {
21531 }
21532 else
21533 {
21534 /* Anything else is an error. */
21537 }
21543 }
21545 /* Parse an initializer-clause.
21547 initializer-clause:
21548 assignment-expression
21549 braced-init-list
21551 Returns an expression representing the initializer.
21553 If the `assignment-expression' production is used the value
21554 returned is simply a representation for the expression.
21556 Otherwise, calls cp_parser_braced_list. */
21558 static cp_expr
21560 {
21561 cp_expr initializer;
21563 /* Assume the expression is constant. */
21566 /* If it is not a `{', then we are looking at an
21567 assignment-expression. */
21569 {
21570 initializer
21573 non_constant_p);
21574 }
21575 else
21579 }
21581 /* Parse a brace-enclosed initializer list.
21583 braced-init-list:
21584 { initializer-list , [opt] }
21585 { }
21587 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21588 the elements of the initializer-list (or NULL, if the last
21589 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21590 NULL_TREE. There is no way to detect whether or not the optional
21591 trailing `,' was provided. NON_CONSTANT_P is as for
21592 cp_parser_initializer. */
21594 static cp_expr
21596 {
21597 tree initializer;
21600 /* Consume the `{' token. */
21602 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21604 /* If it's not a `}', then there is a non-trivial initializer. */
21606 {
21607 /* Parse the initializer list. */
21610 /* A trailing `,' token is allowed. */
21613 }
21614 else
21616 /* Now, there should be a trailing `}'. */
21622 /* Build a location of the form:
21623 { ... }
21624 ^~~~~~~
21625 with caret==start at the open brace, finish at the close brace. */
21629 }
21631 /* Consume tokens up to, and including, the next non-nested closing `]'.
21632 Returns true iff we found a closing `]'. */
21634 static bool
21636 {
21640 {
21644 {
21647 /* If we've run out of tokens, then there is no closing `]'. */
21656 {
21659 }
21664 }
21666 /* Consume the token. */
21668 }
21669 }
21671 /* Return true if we are looking at an array-designator, false otherwise. */
21673 static bool
21675 {
21676 /* Consume the `['. */
21681 /* Skip tokens until the next token is a closing square bracket.
21682 If we find the closing `]', and the next token is a `=', then
21683 we are looking at an array designator. */
21684 bool array_designator_p
21688 /* Roll back the tokens we skipped. */
21692 }
21694 /* Parse an initializer-list.
21696 initializer-list:
21697 initializer-clause ... [opt]
21698 initializer-list , initializer-clause ... [opt]
21700 GNU Extension:
21702 initializer-list:
21703 designation initializer-clause ...[opt]
21704 initializer-list , designation initializer-clause ...[opt]
21706 designation:
21707 . identifier =
21708 identifier :
21709 [ constant-expression ] =
21711 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21712 for the initializer. If the INDEX of the elt is non-NULL, it is the
21713 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21714 as for cp_parser_initializer. */
21718 {
21721 /* Assume all of the expressions are constant. */
21724 /* Parse the rest of the list. */
21726 {
21728 tree designator;
21729 tree initializer;
21732 /* If the next token is an identifier and the following one is a
21733 colon, we are looking at the GNU designated-initializer
21734 syntax. */
21738 {
21739 /* Warn the user that they are using an extension. */
21742 /* Consume the identifier. */
21744 /* Consume the `:'. */
21746 }
21747 /* Also handle the C99 syntax, '. id ='. */
21752 {
21753 /* Warn the user that they are using an extension. */
21756 /* Consume the `.'. */
21758 /* Consume the identifier. */
21760 /* Consume the `='. */
21762 }
21763 /* Also handle C99 array designators, '[ const ] ='. */
21767 {
21768 /* In C++11, [ could start a lambda-introducer. */
21774 {
21777 }
21778 else
21779 {
21784 }
21790 }
21791 else
21794 /* Parse the initializer. */
21797 /* If any clause is non-constant, so is the entire initializer. */
21801 /* If we have an ellipsis, this is an initializer pack
21802 expansion. */
21804 {
21805 /* Consume the `...'. */
21808 /* Turn the initializer into an initializer expansion. */
21810 }
21812 /* Add it to the vector. */
21815 /* If the next token is not a comma, we have reached the end of
21816 the list. */
21820 /* Peek at the next token. */
21822 /* If the next token is a `}', then we're still done. An
21823 initializer-clause can have a trailing `,' after the
21824 initializer-list and before the closing `}'. */
21828 /* Consume the `,' token. */
21830 }
21833 }
21835 /* Classes [gram.class] */
21837 /* Parse a class-name.
21839 class-name:
21840 identifier
21841 template-id
21843 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21844 to indicate that names looked up in dependent types should be
21845 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21846 keyword has been used to indicate that the name that appears next
21847 is a template. TAG_TYPE indicates the explicit tag given before
21848 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21849 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21850 is the class being defined in a class-head. If ENUM_OK is TRUE,
21851 enum-names are also accepted.
21853 Returns the TYPE_DECL representing the class. */
21855 static tree
21864 {
21865 tree decl;
21866 tree scope;
21871 /* All class-names start with an identifier. */
21874 {
21877 }
21879 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21880 to a template-id, so we save it here. */
21885 /* Any name names a type if we're following the `typename' keyword
21886 in a qualified name where the enclosing scope is type-dependent. */
21889 /* Handle the common case (an identifier, but not a template-id)
21890 efficiently. */
21893 {
21897 /* Look for the identifier. */
21901 /* If the next token isn't an identifier, we are certainly not
21902 looking at a class-name. */
21905 /* If we know this is a type-name, there's no need to look it
21906 up. */
21909 else
21910 {
21911 tree ambiguous_decls;
21912 /* If we already know that this lookup is ambiguous, then
21913 we've already issued an error message; there's no reason
21914 to check again. */
21916 {
21919 }
21920 /* If the next token is a `::', then the name must be a type
21921 name.
21923 [basic.lookup.qual]
21925 During the lookup for a name preceding the :: scope
21926 resolution operator, object, function, and enumerator
21927 names are ignored. */
21930 /* Look up the name. */
21932 tag_type,
21935 check_dependency_p,
21939 {
21943 }
21944 }
21945 }
21946 else
21947 {
21948 /* Try a template-id. */
21950 check_dependency_p,
21951 tag_type,
21952 is_declaration);
21955 }
21959 /* If this is a typename, create a TYPENAME_TYPE. */
21961 {
21966 }
21970 /* Check to see that it is really the name of a class. */
21974 /* Situations like this:
21976 template <typename T> struct A {
21977 typename T::template X<int>::I i;
21978 };
21980 are problematic. Is `T::template X<int>' a class-name? The
21981 standard does not seem to be definitive, but there is no other
21982 valid interpretation of the following `::'. Therefore, those
21983 names are considered class-names. */
21984 {
21988 }
21993 /* In Objective-C 2.0, a classname followed by '.' starts a
21994 dot-syntax expression, and it's not a type-name. */
22006 }
22008 /* Parse a class-specifier.
22010 class-specifier:
22011 class-head { member-specification [opt] }
22013 Returns the TREE_TYPE representing the class. */
22015 static tree
22017 {
22018 tree type;
22032 /* Parse the class-head. */
22035 /* If the class-head was a semantic disaster, skip the entire body
22036 of the class. */
22038 {
22042 }
22044 /* Look for the `{'. */
22046 {
22049 }
22054 /* Issue an error message if type-definitions are forbidden here. */
22056 /* Remember that we are defining one more class. */
22058 /* Inside the class, surrounding template-parameter-lists do not
22059 apply. */
22060 saved_num_template_parameter_lists
22063 /* We are not in a function body. */
22066 /* Or in a loop. */
22069 /* Or in a switch. */
22072 /* We are not immediately inside an extern "lang" block. */
22073 saved_in_unbraced_linkage_specification_p
22077 // Associate constraints with the type.
22081 /* Start the class. */
22083 {
22086 }
22090 /* If the type is erroneous, skip the entire body of the class. */
22092 else
22093 /* Parse the member-specification. */
22096 /* Look for the trailing `}'. */
22098 /* Look for trailing attributes to apply to this class. */
22106 /* We've finished a type definition. Check for the common syntax
22107 error of forgetting a semicolon after the definition. We need to
22108 be careful, as we can't just check for not-a-semicolon and be done
22109 with it; the user might have typed:
22111 class X { } c = ...;
22112 class X { } *p = ...;
22114 and so forth. Instead, enumerate all the possible tokens that
22115 might follow this production; if we don't see one of them, then
22116 complain and silently insert the semicolon. */
22117 {
22122 /* Don't try to parse c++11 attributes here. As per the
22123 grammar, that should be a task for
22124 cp_parser_decl_specifier_seq. */
22128 {
22139 /* While it's legal for type qualifiers and storage class
22140 specifiers to follow type definitions in the grammar, only
22141 compiler testsuites contain code like that. Assume that if
22142 we see such code, then what we're really seeing is a case
22143 like:
22145 class X { }
22146 const <type> var = ...;
22148 or
22150 class Y { }
22151 static <type> func (...) ...
22153 i.e. the qualifier or specifier applies to the next
22154 declaration. To do so, however, we need to look ahead one
22155 more token to see if *that* token is a type specifier.
22157 This code could be improved to handle:
22159 class Z { }
22160 static const <type> var = ...; */
22163 {
22166 /* Handling user-defined types here would be nice, but very
22167 tricky. */
22168 want_semicolon
22171 }
22175 }
22177 /* If we don't have a type, then something is very wrong and we
22178 shouldn't try to do anything clever. Likewise for not seeing the
22179 closing brace. */
22181 {
22182 /* Locate the closing brace. */
22183 cp_token_position prev
22188 /* We want to suggest insertion of a ';' immediately *after* the
22189 closing brace, so, if we can, offset the location by 1 column. */
22196 /* If we successfully offset the location, suggest the fix-it. */
22209 else
22212 /* Unget one token and smash it to look as though we encountered
22213 a semicolon in the input stream. */
22218 }
22219 }
22221 /* If this class is not itself within the scope of another class,
22222 then we need to parse the bodies of all of the queued function
22223 definitions. Note that the queued functions defined in a class
22224 are not always processed immediately following the
22225 class-specifier for that class. Consider:
22227 struct A {
22228 struct B { void f() { sizeof (A); } };
22229 };
22231 If `f' were processed before the processing of `A' were
22232 completed, there would be no way to compute the size of `A'.
22233 Note that the nesting we are interested in here is lexical --
22234 not the semantic nesting given by TYPE_CONTEXT. In particular,
22235 for:
22237 struct A { struct B; };
22238 struct A::B { void f() { } };
22240 there is no need to delay the parsing of `A::B::f'. */
22242 {
22243 tree decl;
22250 /* In a first pass, parse default arguments to the functions.
22251 Then, in a second pass, parse the bodies of the functions.
22252 This two-phased approach handles cases like:
22254 struct S {
22255 void f() { g(); }
22256 void g(int i = 3);
22257 };
22259 */
22261 {
22263 /* If there are default arguments that have not yet been processed,
22264 take care of them now. */
22266 {
22271 }
22272 /* Make sure that any template parameters are in scope. */
22274 /* Parse the default argument expressions. */
22276 /* Remove any template parameters from the symbol table. */
22278 }
22280 /* Now parse any NSDMIs. */
22284 {
22286 {
22291 }
22294 }
22301 /* Now do some post-NSDMI bookkeeping. */
22307 /* Now parse the body of the functions. */
22309 {
22310 /* OpenMP UDRs need to be parsed before all other functions. */
22317 }
22318 else
22322 }
22323 else
22326 /* Put back any saved access checks. */
22329 /* Restore saved state. */
22333 parser->num_template_parameter_lists
22335 parser->in_unbraced_linkage_specification_p
22339 }
22341 static tree
22343 {
22344 tree ret;
22349 }
22351 /* Parse a class-head.
22353 class-head:
22354 class-key identifier [opt] base-clause [opt]
22355 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22356 class-key nested-name-specifier [opt] template-id
22357 base-clause [opt]
22359 class-virt-specifier:
22360 final
22362 GNU Extensions:
22363 class-key attributes identifier [opt] base-clause [opt]
22364 class-key attributes nested-name-specifier identifier base-clause [opt]
22365 class-key attributes nested-name-specifier [opt] template-id
22366 base-clause [opt]
22368 Upon return BASES is initialized to the list of base classes (or
22369 NULL, if there are none) in the same form returned by
22370 cp_parser_base_clause.
22372 Returns the TYPE of the indicated class. Sets
22373 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22374 involving a nested-name-specifier was used, and FALSE otherwise.
22376 Returns error_mark_node if this is not a class-head.
22378 Returns NULL_TREE if the class-head is syntactically valid, but
22379 semantically invalid in a way that means we should skip the entire
22380 body of the class. */
22382 static tree
22385 {
22386 tree nested_name_specifier;
22390 tree attributes;
22391 tree bases;
22401 /* Assume no nested-name-specifier will be present. */
22403 /* Assume no template parameter lists will be used in defining the
22404 type. */
22408 /* Look for the class-key. */
22415 /* Parse the attributes. */
22418 /* If the next token is `::', that is invalid -- but sometimes
22419 people do try to write:
22421 struct ::S {};
22423 Handle this gracefully by accepting the extra qualifier, and then
22424 issuing an error about it later if this really is a
22425 class-head. If it turns out just to be an elaborated type
22426 specifier, remain silent. */
22432 /* Determine the name of the class. Begin by looking for an
22433 optional nested-name-specifier. */
22435 nested_name_specifier
22441 /* If there was a nested-name-specifier, then there *must* be an
22442 identifier. */
22444 {
22446 /* Although the grammar says `identifier', it really means
22447 `class-name' or `template-name'. You are only allowed to
22448 define a class that has already been declared with this
22449 syntax.
22451 The proposed resolution for Core Issue 180 says that wherever
22452 you see `class T::X' you should treat `X' as a type-name.
22454 It is OK to define an inaccessible class; for example:
22456 class A { class B; };
22457 class A::B {};
22459 We do not know if we will see a class-name, or a
22460 template-name. We look for a class-name first, in case the
22461 class-name is a template-id; if we looked for the
22462 template-name first we would stop after the template-name. */
22467 class_type,
22471 /* If that didn't work, ignore the nested-name-specifier. */
22473 {
22479 }
22480 /* If we could not find a corresponding TYPE, treat this
22481 declaration like an unqualified declaration. */
22484 /* Otherwise, count the number of templates used in TYPE and its
22485 containing scopes. */
22486 else
22487 {
22488 tree scope;
22500 }
22501 }
22502 /* Otherwise, the identifier is optional. */
22503 else
22504 {
22505 /* We don't know whether what comes next is a template-id,
22506 an identifier, or nothing at all. */
22508 /* Check for a template-id. */
22513 class_key,
22515 /* If that didn't work, it could still be an identifier. */
22517 {
22519 {
22522 }
22523 else
22525 }
22526 else
22527 {
22530 }
22531 }
22536 {
22538 class_key,
22540 }
22543 /* If it's not a `:' or a `{' then we can't really be looking at a
22544 class-head, since a class-head only appears as part of a
22545 class-specifier. We have to detect this situation before calling
22546 xref_tag, since that has irreversible side-effects. */
22548 {
22552 }
22554 /* At this point, we're going ahead with the class-specifier, even
22555 if some other problem occurs. */
22558 {
22563 }
22564 /* Issue the error about the overly-qualified name now. */
22566 {
22571 }
22573 {
22578 }
22580 {
22581 tree scope;
22583 /* Reject typedef-names in class heads. */
22585 {
22588 type);
22591 }
22593 /* Figure out in what scope the declaration is being placed. */
22595 /* If that scope does not contain the scope in which the
22596 class was originally declared, the program is invalid. */
22598 {
22601 "declaration of %qD in namespace %qD which does not "
22604 else
22610 }
22611 /* [dcl.meaning]
22613 A declarator-id shall not be qualified except for the
22614 definition of a ... nested class outside of its class
22615 ... [or] the definition or explicit instantiation of a
22616 class member of a namespace outside of its namespace. */
22618 {
22623 }
22624 }
22625 /* An explicit-specialization must be preceded by "template <>". If
22626 it is not, try to recover gracefully. */
22629 && !processing_template_parmlist
22631 {
22632 /* Build a location of this form:
22633 struct typename <ARGS>
22634 ^~~~~~~~~~~~~~~~~~~~~~
22635 with caret==start at the start token, and
22636 finishing at the end of the type. */
22637 location_t reported_loc
22639 class_head_start_location,
22644 error_at_rich_loc
22648 /* Take the same action that would have been taken by
22649 cp_parser_explicit_specialization. */
22652 }
22653 /* There must be no "return" statements between this point and the
22654 end of this function; set "type "to the correct return value and
22655 use "goto done;" to return. */
22656 /* Make sure that the right number of template parameters were
22657 present. */
22661 {
22662 /* If something went wrong, there is no point in even trying to
22663 process the class-definition. */
22666 }
22668 /* Look up the type. */
22670 {
22674 {
22678 }
22679 else
22680 {
22684 /* Check the scope while we still know whether or not we had a
22685 nested-name-specifier. */
22688 }
22691 }
22693 {
22694 tree class_type;
22696 /* Given:
22698 template <typename T> struct S { struct T };
22699 template <typename T> struct S<T>::T { };
22701 we will get a TYPENAME_TYPE when processing the definition of
22702 `S::T'. We need to resolve it to the actual type before we
22703 try to define it. */
22705 {
22710 else
22711 {
22714 }
22715 }
22719 {
22722 }
22725 /* Enter the scope indicated by the nested-name-specifier. */
22727 /* Get the canonical version of this type. */
22729 /* Call push_template_decl if it seems like we should be defining a
22730 template either from the template headers or the type we're
22731 defining, so that we diagnose both extra and missing headers. */
22735 {
22738 {
22741 }
22742 }
22746 }
22748 {
22749 /* If the class was unnamed, create a dummy name. */
22753 ? ts_within_enclosing_non_class
22757 }
22759 /* Indicate whether this class was declared as a `class' or as a
22760 `struct'. */
22765 /* If this type was already complete, and we see another definition,
22766 that's an error. */
22768 {
22770 type);
22772 type);
22775 }
22780 {
22781 /* Apply attributes now, before any use of the class as a template
22782 argument in its base list. */
22785 }
22787 /* We will have entered the scope containing the class; the names of
22788 base classes should be looked up in that context. For example:
22790 struct A { struct B {}; struct C; };
22791 struct A::C : B {};
22793 is valid. */
22795 /* Get the list of base-classes, if there is one. */
22797 {
22798 /* PR59482: enter the class scope so that base-specifiers are looked
22799 up correctly. */
22803 /* PR59482: get out of the previously pushed class scope so that the
22804 subsequent pops pop the right thing. */
22807 }
22808 else
22811 /* If we're really defining a class, process the base classes.
22812 If they're invalid, fail. */
22816 done:
22817 /* Leave the scope given by the nested-name-specifier. We will
22818 enter the class scope itself while processing the members. */
22823 {
22826 }
22832 out:
22835 }
22837 /* Parse a class-key.
22839 class-key:
22840 class
22841 struct
22842 union
22844 Returns the kind of class-key specified, or none_type to indicate
22845 error. */
22847 static enum tag_types
22849 {
22853 /* Look for the class-key. */
22858 /* Check to see if the TOKEN is a class-key. */
22863 }
22865 /* Parse a type-parameter-key.
22867 type-parameter-key:
22868 class
22869 typename
22870 */
22872 static void
22874 {
22875 /* Look for the type-parameter-key. */
22879 {
22882 /* typename is not allowed in a template template parameter
22883 by the standard until C++1Z. */
22885 "ISO C++ forbids typename key in template template parameter;"
22887 }
22888 else
22892 }
22894 /* Parse an (optional) member-specification.
22896 member-specification:
22897 member-declaration member-specification [opt]
22898 access-specifier : member-specification [opt] */
22900 static void
22902 {
22904 {
22908 /* Peek at the next token. */
22910 /* If it's a `}', or EOF then we've seen all the members. */
22916 /* See if this token is a keyword. */
22919 {
22923 /* Consume the access-specifier. */
22925 /* Remember which access-specifier is active. */
22927 /* Look for the `:'. */
22932 /* Accept #pragmas at class scope. */
22934 {
22937 }
22939 /* Otherwise, the next construction must be a
22940 member-declaration. */
22942 }
22943 }
22944 }
22946 /* Parse a member-declaration.
22948 member-declaration:
22949 decl-specifier-seq [opt] member-declarator-list [opt] ;
22950 function-definition ; [opt]
22951 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22952 using-declaration
22953 template-declaration
22954 alias-declaration
22956 member-declarator-list:
22957 member-declarator
22958 member-declarator-list , member-declarator
22960 member-declarator:
22961 declarator pure-specifier [opt]
22962 declarator constant-initializer [opt]
22963 identifier [opt] : constant-expression
22965 GNU Extensions:
22967 member-declaration:
22968 __extension__ member-declaration
22970 member-declarator:
22971 declarator attributes [opt] pure-specifier [opt]
22972 declarator attributes [opt] constant-initializer [opt]
22973 identifier [opt] attributes [opt] : constant-expression
22975 C++0x Extensions:
22977 member-declaration:
22978 static_assert-declaration */
22980 static void
22982 {
22983 cp_decl_specifier_seq decl_specifiers;
22984 tree prefix_attributes;
22985 tree decl;
22994 /* Check for the `__extension__' keyword. */
22996 {
22997 /* Recurse. */
22999 /* Restore the old value of the PEDANTIC flag. */
23003 }
23005 /* Check for a template-declaration. */
23007 {
23008 /* An explicit specialization here is an error condition, and we
23009 expect the specialization handler to detect and report this. */
23013 else
23017 }
23018 /* Check for a template introduction. */
23022 /* Check for a using-declaration. */
23024 {
23026 {
23027 /* Parse the using-declaration. */
23031 }
23032 else
23033 {
23034 tree decl;
23038 /* Note that if we actually see the '=' token after the
23039 identifier, cp_parser_alias_declaration commits the
23040 tentative parse. In that case, we really expect an
23041 alias-declaration. Otherwise, we expect a using
23042 declaration. */
23043 alias_decl_expected =
23049 else
23053 }
23054 }
23056 /* Check for @defs. */
23058 {
23063 {
23068 }
23070 }
23072 /* If the next token is `static_assert' we have a static assertion. */
23074 {
23077 }
23084 /* Parse the decl-specifier-seq. */
23087 CP_PARSER_FLAGS_OPTIONAL,
23090 /* Check for an invalid type-name. */
23094 /* If there is no declarator, then the decl-specifier-seq should
23095 specify a type. */
23097 {
23098 /* If there was no decl-specifier-seq, and the next token is a
23099 `;', then we have something like:
23101 struct S { ; };
23103 [class.mem]
23105 Each member-declaration shall declare at least one member
23106 name of the class. */
23108 {
23112 }
23113 else
23114 {
23115 tree type;
23117 /* See if this declaration is a friend. */
23119 /* If there were decl-specifiers, check to see if there was
23120 a class-declaration. */
23123 /* Nested classes have already been added to the class, but
23124 a `friend' needs to be explicitly registered. */
23126 {
23127 /* If the `friend' keyword was present, the friend must
23128 be introduced with a class-key. */
23131 "in C++03 a class-key must be used "
23133 /* In this case:
23135 template <typename T> struct A {
23136 friend struct A<T>::B;
23137 };
23139 A<T>::B will be represented by a TYPENAME_TYPE, and
23140 therefore not recognized by check_tag_decl. */
23142 {
23146 }
23149 "friend declaration does not name a class or "
23151 else
23154 }
23155 /* If there is no TYPE, an error message will already have
23156 been issued. */
23158 ;
23159 /* An anonymous aggregate has to be handled specially; such
23160 a declaration really declares a data member (with a
23161 particular type), as opposed to a nested class. */
23163 {
23164 /* C++11 9.5/6. */
23167 "a storage class on an anonymous aggregate "
23170 /* Remove constructors and such from TYPE, now that we
23171 know it is an anonymous aggregate. */
23173 /* And make the corresponding data member. */
23176 /* Add it to the class. */
23178 }
23179 else
23180 cp_parser_check_access_in_redeclaration
23183 }
23184 }
23185 else
23186 {
23189 /* Clear attributes from the decl_specifiers but keep them
23190 around as prefix attributes that apply them to the entity
23191 being declared. */
23195 /* See if these declarations will be friends. */
23198 /* Keep going until we hit the `;' at the end of the
23199 declaration. */
23201 {
23203 tree first_attribute;
23205 /* Peek at the next token. */
23208 /* Check for a bitfield declaration. */
23213 {
23214 tree identifier;
23215 tree width;
23217 /* Get the name of the bitfield. Note that we cannot just
23218 check TOKEN here because it may have been invalidated by
23219 the call to cp_lexer_peek_nth_token above. */
23222 else
23225 /* Consume the `:' token. */
23227 /* Get the width of the bitfield. */
23228 width
23231 /* Look for attributes that apply to the bitfield. */
23233 /* Remember which attributes are prefix attributes and
23234 which are not. */
23236 /* Combine the attributes. */
23239 /* Create the bitfield declaration. */
23242 identifier,
23243 sfk_none)
23246 width,
23247 attributes);
23248 }
23249 else
23250 {
23252 tree initializer;
23253 tree asm_specification;
23256 /* Parse the declarator. */
23257 declarator
23262 friend_p);
23264 /* If something went wrong parsing the declarator, make sure
23265 that we at least consume some tokens. */
23267 {
23268 /* Skip to the end of the statement. */
23270 /* If the next token is not a semicolon, that is
23271 probably because we just skipped over the body of
23272 a function. So, we consume a semicolon if
23273 present, but do not issue an error message if it
23274 is not present. */
23276 CPP_SEMICOLON))
23279 }
23282 cp_parser_check_for_definition_in_return_type
23286 /* Look for an asm-specification. */
23288 /* Look for attributes that apply to the declaration. */
23290 /* Remember which attributes are prefix attributes and
23291 which are not. */
23293 /* Combine the attributes. */
23296 /* If it's an `=', then we have a constant-initializer or a
23297 pure-specifier. It is not correct to parse the
23298 initializer before registering the member declaration
23299 since the member declaration should be in scope while
23300 its initializer is processed. However, the rest of the
23301 front end does not yet provide an interface that allows
23302 us to handle this correctly. */
23304 {
23305 /* In [class.mem]:
23307 A pure-specifier shall be used only in the declaration of
23308 a virtual function.
23310 A member-declarator can contain a constant-initializer
23311 only if it declares a static member of integral or
23312 enumeration type.
23314 Therefore, if the DECLARATOR is for a function, we look
23315 for a pure-specifier; otherwise, we look for a
23316 constant-initializer. When we call `grokfield', it will
23317 perform more stringent semantics checks. */
23329 {
23331 /* Don't require a constant rvalue in C++11, since we
23332 might want a reference constant. We'll enforce
23333 constancy later. */
23335 /* Parse the initializer. */
23338 }
23339 else
23340 /* Parse the initializer. */
23342 }
23345 {
23349 else
23351 }
23352 /* Otherwise, there is no initializer. */
23353 else
23356 /* See if we are probably looking at a function
23357 definition. We are certainly not looking at a
23358 member-declarator. Calling `grokfield' has
23359 side-effects, so we must not do it unless we are sure
23360 that we are looking at a member-declarator. */
23363 {
23364 /* The grammar does not allow a pure-specifier to be
23365 used when a member function is defined. (It is
23366 possible that this fact is an oversight in the
23367 standard, since a pure function may be defined
23368 outside of the class-specifier. */
23374 declarator,
23375 attributes);
23378 /* If the member was not a friend, declare it here. */
23381 /* Peek at the next token. */
23383 /* If the next token is a semicolon, consume it. */
23387 }
23388 else
23391 /* Create the declaration. */
23396 {
23399 else
23401 }
23402 }
23407 /* Reset PREFIX_ATTRIBUTES. */
23413 /* If there is any qualification still in effect, clear it
23414 now; we will be starting fresh with the next declarator. */
23418 /* If it's a `,', then there are more declarators. */
23420 {
23423 {
23427 }
23428 }
23429 /* If the next token isn't a `;', then we have a parse error. */
23431 CPP_SEMICOLON))
23432 {
23433 /* The next token might be a ways away from where the
23434 actual semicolon is missing. Find the previous token
23435 and use that for our error position. */
23440 /* Assume that the user meant to provide a semicolon. If
23441 we were to cp_parser_skip_to_end_of_statement, we might
23442 skip to a semicolon inside a member function definition
23443 and issue nonsensical error messages. */
23445 }
23448 {
23449 /* Add DECL to the list of members. */
23451 /* Explicitly include, eg, NSDMIs, for better error
23452 recovery (c++/58650). */
23461 /* Add DECL to the queue of NSDMI to be parsed later. */
23463 }
23467 }
23468 }
23471 out:
23473 }
23475 /* Parse a pure-specifier.
23477 pure-specifier:
23478 = 0
23480 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23481 Otherwise, ERROR_MARK_NODE is returned. */
23483 static tree
23485 {
23488 /* Look for the `=' token. */
23491 /* Look for the `0' token. */
23500 /* Accept = default or = delete in c++0x mode. */
23503 {
23506 }
23508 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23510 {
23515 }
23517 {
23520 }
23523 }
23525 /* Parse a constant-initializer.
23527 constant-initializer:
23528 = constant-expression
23530 Returns a representation of the constant-expression. */
23532 static tree
23534 {
23535 /* Look for the `=' token. */
23539 /* It is invalid to write:
23541 struct S { static const int i = { 7 }; };
23543 */
23545 {
23548 /* Consume the opening brace. */
23550 /* Skip the initializer. */
23552 /* Look for the trailing `}'. */
23556 }
23559 }
23561 /* Derived classes [gram.class.derived] */
23563 /* Parse a base-clause.
23565 base-clause:
23566 : base-specifier-list
23568 base-specifier-list:
23569 base-specifier ... [opt]
23570 base-specifier-list , base-specifier ... [opt]
23572 Returns a TREE_LIST representing the base-classes, in the order in
23573 which they were declared. The representation of each node is as
23574 described by cp_parser_base_specifier.
23576 In the case that no bases are specified, this function will return
23577 NULL_TREE, not ERROR_MARK_NODE. */
23579 static tree
23581 {
23584 /* Look for the `:' that begins the list. */
23587 /* Scan the base-specifier-list. */
23589 {
23591 tree base;
23594 /* Look for the base-specifier. */
23596 /* Look for the (optional) ellipsis. */
23598 {
23599 /* Consume the `...'. */
23603 }
23605 /* Add BASE to the front of the list. */
23607 {
23609 /* Make this a pack expansion type. */
23613 {
23616 }
23617 }
23618 /* Peek at the next token. */
23620 /* If it's not a comma, then the list is complete. */
23623 /* Consume the `,'. */
23625 }
23627 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23628 base class had a qualified name. However, the next name that
23629 appears is certainly not qualified. */
23635 }
23637 /* Parse a base-specifier.
23639 base-specifier:
23640 :: [opt] nested-name-specifier [opt] class-name
23641 virtual access-specifier [opt] :: [opt] nested-name-specifier
23642 [opt] class-name
23643 access-specifier virtual [opt] :: [opt] nested-name-specifier
23644 [opt] class-name
23646 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23647 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23648 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23649 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23651 static tree
23653 {
23661 tree type;
23663 /* Process the optional `virtual' and `access-specifier'. */
23665 {
23666 /* Peek at the next token. */
23668 /* Process `virtual'. */
23670 {
23672 /* If `virtual' appears more than once, issue an error. */
23674 {
23678 }
23682 /* Consume the `virtual' token. */
23690 /* If more than one access specifier appears, issue an
23691 error. */
23694 {
23698 }
23702 /* Consume the access-specifier. */
23710 }
23711 }
23712 /* It is not uncommon to see programs mechanically, erroneously, use
23713 the 'typename' keyword to denote (dependent) qualified types
23714 as base classes. */
23716 {
23721 else
23723 "keyword %<typename%> not allowed in this context "
23726 }
23728 /* Look for the optional `::' operator. */
23730 /* Look for the nested-name-specifier. The simplest way to
23731 implement:
23733 [temp.res]
23735 The keyword `typename' is not permitted in a base-specifier or
23736 mem-initializer; in these contexts a qualified name that
23737 depends on a template-parameter is implicitly assumed to be a
23738 type name.
23740 is to pretend that we have seen the `typename' keyword at this
23741 point. */
23747 /* If the base class is given by a qualified name, assume that names
23748 we see are type names or templates, as appropriate. */
23754 /* DR 950 allows decltype as a base-specifier. */
23756 else
23757 {
23758 /* Otherwise, look for the class-name. */
23760 class_scope_p,
23761 template_p,
23762 typename_type,
23767 }
23773 }
23775 /* Exception handling [gram.exception] */
23777 /* Parse an (optional) noexcept-specification.
23779 noexcept-specification:
23780 noexcept ( constant-expression ) [opt]
23782 If no noexcept-specification is present, returns NULL_TREE.
23783 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23784 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23785 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23786 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23787 in which case a boolean condition is returned instead. */
23789 static tree
23794 {
23798 /* Peek at the next token. */
23801 /* Is it a noexcept-specification? */
23803 {
23804 tree expr;
23808 {
23812 {
23813 /* Types may not be defined in an exception-specification. */
23815 parser->type_definition_forbidden_message
23820 /* Restore the saved message. */
23822 }
23823 else
23824 {
23827 }
23830 }
23831 else
23832 {
23836 }
23838 /* We cannot build a noexcept-spec right away because this will check
23839 that expr is a constexpr. */
23842 else
23844 }
23845 else
23847 }
23849 /* Parse an (optional) exception-specification.
23851 exception-specification:
23852 throw ( type-id-list [opt] )
23854 Returns a TREE_LIST representing the exception-specification. The
23855 TREE_VALUE of each node is a type. */
23857 static tree
23859 {
23861 tree type_id_list;
23864 /* Peek at the next token. */
23867 /* Is it a noexcept-specification? */
23873 /* If it's not `throw', then there's no exception-specification. */
23879 /* Consume the `throw'. */
23882 /* Look for the `('. */
23885 /* Peek at the next token. */
23887 /* If it's not a `)', then there is a type-id-list. */
23889 {
23890 /* Types may not be defined in an exception-specification. */
23892 parser->type_definition_forbidden_message
23894 /* Parse the type-id-list. */
23896 /* Restore the saved message. */
23900 {
23904 }
23907 "dynamic exception specifications are deprecated in "
23909 }
23910 /* In C++17, throw() is equivalent to noexcept (true). throw()
23911 is deprecated in C++11 and above as well, but is still widely used,
23912 so don't warn about it yet. */
23915 else
23918 /* Look for the `)'. */
23922 }
23924 /* Parse an (optional) type-id-list.
23926 type-id-list:
23927 type-id ... [opt]
23928 type-id-list , type-id ... [opt]
23930 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23931 in the order that the types were presented. */
23933 static tree
23935 {
23939 {
23941 tree type;
23945 /* Get the next type-id. */
23947 /* Check for invalid 'auto'. */
23949 {
23953 }
23954 /* Parse the optional ellipsis. */
23956 {
23957 /* Consume the `...'. */
23960 /* Turn the type into a pack expansion expression. */
23962 }
23963 /* Add it to the list. */
23965 /* Peek at the next token. */
23967 /* If it is not a `,', we are done. */
23970 /* Consume the `,'. */
23972 }
23975 }
23977 /* Parse a try-block.
23979 try-block:
23980 try compound-statement handler-seq */
23982 static tree
23984 {
23985 tree try_block;
23999 }
24001 /* Parse a function-try-block.
24003 function-try-block:
24004 try ctor-initializer [opt] function-body handler-seq */
24006 static bool
24008 {
24009 tree compound_stmt;
24010 tree try_block;
24013 /* Look for the `try' keyword. */
24016 /* Let the rest of the front end know where we are. */
24018 /* Parse the function-body. */
24019 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24021 /* We're done with the `try' part. */
24023 /* Parse the handlers. */
24025 /* We're done with the handlers. */
24029 }
24031 /* Parse a handler-seq.
24033 handler-seq:
24034 handler handler-seq [opt] */
24036 static void
24038 {
24040 {
24043 /* Parse the handler. */
24045 /* Peek at the next token. */
24047 /* If it's not `catch' then there are no more handlers. */
24050 }
24051 }
24053 /* Parse a handler.
24055 handler:
24056 catch ( exception-declaration ) compound-statement */
24058 static void
24060 {
24061 tree handler;
24062 tree declaration;
24072 }
24074 /* Parse an exception-declaration.
24076 exception-declaration:
24077 type-specifier-seq declarator
24078 type-specifier-seq abstract-declarator
24079 type-specifier-seq
24080 ...
24082 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24083 ellipsis variant is used. */
24085 static tree
24087 {
24088 cp_decl_specifier_seq type_specifiers;
24092 /* If it's an ellipsis, it's easy to handle. */
24094 {
24095 /* Consume the `...' token. */
24098 }
24100 /* Types may not be defined in exception-declarations. */
24102 parser->type_definition_forbidden_message
24105 /* Parse the type-specifier-seq. */
24109 /* If it's a `)', then there is no declarator. */
24112 else
24119 /* Restore the saved message. */
24126 }
24128 /* Parse a throw-expression.
24130 throw-expression:
24131 throw assignment-expression [opt]
24133 Returns a THROW_EXPR representing the throw-expression. */
24135 static tree
24137 {
24138 tree expression;
24143 /* Figure out whether or not there is an assignment-expression
24144 following the "throw" keyword. */
24152 else
24156 }
24158 /* GNU Extensions */
24160 /* Parse an (optional) asm-specification.
24162 asm-specification:
24163 asm ( string-literal )
24165 If the asm-specification is present, returns a STRING_CST
24166 corresponding to the string-literal. Otherwise, returns
24167 NULL_TREE. */
24169 static tree
24171 {
24173 tree asm_specification;
24175 /* Peek at the next token. */
24177 /* If the next token isn't the `asm' keyword, then there's no
24178 asm-specification. */
24182 /* Consume the `asm' token. */
24184 /* Look for the `('. */
24187 /* Look for the string-literal. */
24190 /* Look for the `)'. */
24194 }
24196 /* Parse an asm-operand-list.
24198 asm-operand-list:
24199 asm-operand
24200 asm-operand-list , asm-operand
24202 asm-operand:
24203 string-literal ( expression )
24204 [ string-literal ] string-literal ( expression )
24206 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24207 each node is the expression. The TREE_PURPOSE is itself a
24208 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24209 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24210 is a STRING_CST for the string literal before the parenthesis. Returns
24211 ERROR_MARK_NODE if any of the operands are invalid. */
24213 static tree
24215 {
24220 {
24221 tree string_literal;
24222 tree expression;
24223 tree name;
24226 {
24227 /* Consume the `[' token. */
24229 /* Read the operand name. */
24234 /* Look for the closing `]'. */
24236 }
24237 else
24239 /* Look for the string-literal. */
24242 /* Look for the `('. */
24244 /* Parse the expression. */
24246 /* Look for the `)'. */
24254 /* Add this operand to the list. */
24256 expression,
24257 asm_operands);
24258 /* If the next token is not a `,', there are no more
24259 operands. */
24262 /* Consume the `,'. */
24264 }
24267 }
24269 /* Parse an asm-clobber-list.
24271 asm-clobber-list:
24272 string-literal
24273 asm-clobber-list , string-literal
24275 Returns a TREE_LIST, indicating the clobbers in the order that they
24276 appeared. The TREE_VALUE of each node is a STRING_CST. */
24278 static tree
24280 {
24284 {
24285 tree string_literal;
24287 /* Look for the string literal. */
24289 /* Add it to the list. */
24291 /* If the next token is not a `,', then the list is
24292 complete. */
24295 /* Consume the `,' token. */
24297 }
24300 }
24302 /* Parse an asm-label-list.
24304 asm-label-list:
24305 identifier
24306 asm-label-list , identifier
24308 Returns a TREE_LIST, indicating the labels in the order that they
24309 appeared. The TREE_VALUE of each node is a label. */
24311 static tree
24313 {
24317 {
24320 /* Look for the identifier. */
24323 {
24326 {
24332 }
24333 }
24334 /* If the next token is not a `,', then the list is
24335 complete. */
24338 /* Consume the `,' token. */
24340 }
24343 }
24345 /* Return TRUE iff the next tokens in the stream are possibly the
24346 beginning of a GNU extension attribute. */
24348 static bool
24350 {
24352 }
24354 /* Return TRUE iff the next tokens in the stream are possibly the
24355 beginning of a standard C++-11 attribute specifier. */
24357 static bool
24359 {
24361 }
24363 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24364 beginning of a standard C++-11 attribute specifier. */
24366 static bool
24368 {
24376 }
24378 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24379 beginning of a GNU extension attribute. */
24381 static bool
24383 {
24387 }
24389 /* Return true iff the next tokens can be the beginning of either a
24390 GNU attribute list, or a standard C++11 attribute sequence. */
24392 static bool
24394 {
24397 }
24399 /* Return true iff the next Nth tokens can be the beginning of either
24400 a GNU attribute list, or a standard C++11 attribute sequence. */
24402 static bool
24404 {
24407 }
24409 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24410 of GNU attributes, or return NULL. */
24412 static tree
24414 {
24418 }
24420 #define CILK_SIMD_FN_CLAUSE_MASK \
24421 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24422 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24423 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24424 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24425 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24427 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24428 vector [(<clauses>)] */
24430 static void
24432 {
24436 {
24442 }
24445 {
24448 paren_scope++;
24449 }
24451 {
24454 paren_scope++;
24456 paren_scope--;
24457 /* Do not push the last ')' */
24460 }
24469 }
24471 /* Parse an (optional) series of attributes.
24473 attributes:
24474 attributes attribute
24476 attribute:
24477 __attribute__ (( attribute-list [opt] ))
24479 The return value is as for cp_parser_gnu_attribute_list. */
24481 static tree
24483 {
24487 {
24489 tree attribute_list;
24492 /* Peek at the next token. */
24494 /* If it's not `__attribute__', then we're done. */
24498 /* Consume the `__attribute__' keyword. */
24500 /* Look for the two `(' tokens. */
24504 /* Peek at the next token. */
24507 /* Parse the attribute-list. */
24509 else
24510 /* If the next token is a `)', then there is no attribute
24511 list. */
24514 /* Look for the two `)' tokens. */
24522 /* Add these new attributes to the list. */
24524 }
24527 }
24529 /* Parse a GNU attribute-list.
24531 attribute-list:
24532 attribute
24533 attribute-list , attribute
24535 attribute:
24536 identifier
24537 identifier ( identifier )
24538 identifier ( identifier , expression-list )
24539 identifier ( expression-list )
24541 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24542 to an attribute. The TREE_PURPOSE of each node is the identifier
24543 indicating which attribute is in use. The TREE_VALUE represents
24544 the arguments, if any. */
24546 static tree
24548 {
24554 {
24556 tree identifier;
24557 tree attribute;
24559 /* Look for the identifier. We also allow keywords here; for
24560 example `__attribute__ ((const))' is legal. */
24564 {
24567 /* Consume the token, but save it since we need it for the
24568 SIMD enabled function parsing. */
24571 /* Save away the identifier that indicates which attribute
24572 this is. */
24574 /* For keywords, use the canonical spelling, not the
24575 parsed identifier. */
24581 /* Peek at the next token. */
24583 /* If it's an `(', then parse the attribute arguments. */
24585 {
24590 {
24593 }
24594 else
24595 vec = cp_parser_parenthesized_expression_list
24601 else
24602 {
24605 }
24606 /* Save the arguments away. */
24608 }
24610 {
24613 }
24616 {
24617 /* Add this attribute to the list. */
24620 }
24623 }
24624 /* Now, look for more attributes. If the next token isn't a
24625 `,', we're done. */
24629 /* Consume the comma and keep going. */
24631 }
24634 /* We built up the list in reverse order. */
24636 }
24638 /* Parse a standard C++11 attribute.
24640 The returned representation is a TREE_LIST which TREE_PURPOSE is
24641 the scoped name of the attribute, and the TREE_VALUE is its
24642 arguments list.
24644 Note that the scoped name of the attribute is itself a TREE_LIST
24645 which TREE_PURPOSE is the namespace of the attribute, and
24646 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24647 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24648 and which TREE_PURPOSE is directly the attribute name.
24650 Clients of the attribute code should use get_attribute_namespace
24651 and get_attribute_name to get the actual namespace and name of
24652 attributes, regardless of their being GNU or C++11 attributes.
24654 attribute:
24655 attribute-token attribute-argument-clause [opt]
24657 attribute-token:
24658 identifier
24659 attribute-scoped-token
24661 attribute-scoped-token:
24662 attribute-namespace :: identifier
24664 attribute-namespace:
24665 identifier
24667 attribute-argument-clause:
24668 ( balanced-token-seq )
24670 balanced-token-seq:
24671 balanced-token [opt]
24672 balanced-token-seq balanced-token
24674 balanced-token:
24675 ( balanced-token-seq )
24676 [ balanced-token-seq ]
24677 { balanced-token-seq }. */
24679 static tree
24681 {
24685 /* First, parse name of the attribute, a.k.a attribute-token. */
24702 {
24703 /* We are seeing a scoped attribute token. */
24718 else
24719 {
24723 }
24725 NULL_TREE);
24727 }
24730 NULL_TREE);
24731 else
24732 {
24734 NULL_TREE);
24735 /* C++11 noreturn attribute is equivalent to GNU's. */
24738 /* C++14 deprecated attribute is equivalent to GNU's. */
24741 /* C++17 fallthrough attribute is equivalent to GNU's. */
24744 /* Transactional Memory TS optimize_for_synchronized attribute is
24745 equivalent to GNU transaction_callable. */
24749 /* Transactional Memory attributes are GNU attributes. */
24752 }
24754 /* Now parse the optional argument clause of the attribute. */
24759 {
24765 /* A GNU attribute that takes an identifier in parameter. */
24768 vec = cp_parser_parenthesized_expression_list
24774 else
24775 {
24778 }
24782 else
24784 }
24787 }
24789 /* Check that the attribute ATTRIBUTE appears at most once in the
24790 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24791 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24792 isn't implemented yet in GCC. */
24794 static void
24796 {
24798 {
24808 }
24809 }
24811 /* Parse a list of standard C++-11 attributes.
24813 attribute-list:
24814 attribute [opt]
24815 attribute-list , attribute[opt]
24816 attribute ...
24817 attribute-list , attribute ...
24818 */
24820 static tree
24822 {
24827 {
24832 {
24836 }
24839 {
24844 else
24848 }
24852 }
24855 }
24857 /* Parse a standard C++-11 attribute specifier.
24859 attribute-specifier:
24860 [ [ attribute-using-prefix [opt] attribute-list ] ]
24861 alignment-specifier
24863 attribute-using-prefix:
24864 using attribute-namespace :
24866 alignment-specifier:
24867 alignas ( type-id ... [opt] )
24868 alignas ( alignment-expression ... [opt] ). */
24870 static tree
24872 {
24878 {
24885 {
24896 {
24900 "attribute using prefix only available "
24906 }
24907 else
24909 }
24916 else
24917 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24918 when we are sure that we have actually parsed them. */
24920 }
24921 else
24922 {
24923 tree alignas_expr;
24925 /* Look for an alignment-specifier. */
24937 {
24940 }
24946 {
24953 }
24958 /* Handle alignas (pack...). */
24960 {
24963 }
24965 /* Something went wrong, so don't build the attribute. */
24970 {
24973 }
24975 /* Build the C++-11 representation of an 'aligned'
24976 attribute. */
24977 attributes =
24980 alignas_expr);
24981 }
24984 }
24986 /* Parse a standard C++-11 attribute-specifier-seq.
24988 attribute-specifier-seq:
24989 attribute-specifier-seq [opt] attribute-specifier
24990 */
24992 static tree
24994 {
24999 {
25008 else
25011 }
25014 }
25016 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25017 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25018 current value of the PEDANTIC flag, regardless of whether or not
25019 the `__extension__' keyword is present. The caller is responsible
25020 for restoring the value of the PEDANTIC flag. */
25022 static bool
25024 {
25025 /* Save the old value of the PEDANTIC flag. */
25029 {
25030 /* Consume the `__extension__' token. */
25032 /* We're not being pedantic while the `__extension__' keyword is
25033 in effect. */
25037 }
25040 }
25042 /* Parse a label declaration.
25044 label-declaration:
25045 __label__ label-declarator-seq ;
25047 label-declarator-seq:
25048 identifier , label-declarator-seq
25049 identifier */
25051 static void
25053 {
25054 /* Look for the `__label__' keyword. */
25058 {
25059 tree identifier;
25061 /* Look for an identifier. */
25063 /* If we failed, stop. */
25066 /* Declare it as a label. */
25068 /* If the next token is a `;', stop. */
25071 /* Look for the `,' separating the label declarations. */
25073 }
25075 /* Look for the final `;'. */
25077 }
25079 // -------------------------------------------------------------------------- //
25080 // Requires Clause
25082 // Parse a requires clause.
25083 //
25084 // requires-clause:
25085 // 'requires' logical-or-expression
25086 //
25087 // The required logical-or-expression must be a constant expression. Note
25088 // that we don't check that the expression is constepxr here. We defer until
25089 // we analyze constraints and then, we only check atomic constraints.
25090 static tree
25092 {
25093 // Parse the requires clause so that it is not automatically folded.
25101 }
25103 // Optionally parse a requires clause:
25104 static tree
25106 {
25109 {
25112 {
25115 /* Parse and discard the requires-clause. */
25118 }
25120 }
25123 }
25126 /*---------------------------------------------------------------------------
25127 Requires expressions
25128 ---------------------------------------------------------------------------*/
25130 /* Parse a requires expression
25132 requirement-expression:
25133 'requires' requirement-parameter-list [opt] requirement-body */
25134 static tree
25136 {
25140 /* A requires-expression shall appear only within a concept
25141 definition or a requires-clause.
25143 TODO: Implement this diagnostic correctly. */
25145 {
25149 }
25152 {
25153 /* Local parameters are delared as variables within the scope
25154 of the expression. They are not visible past the end of
25155 the expression. Expressions within the requires-expression
25156 are unevaluated. */
25157 struct scope_sentinel
25158 {
25160 {
25163 }
25166 {
25169 }
25172 /* Parse the optional parameter list. */
25174 {
25178 }
25179 else
25182 /* Parse the requirement body. */
25186 }
25188 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25189 the parm chain. */
25192 }
25194 /* Parse a parameterized requirement.
25196 requirement-parameter-list:
25197 '(' parameter-declaration-clause ')' */
25198 static tree
25200 {
25210 }
25212 /* Parse the body of a requirement.
25214 requirement-body:
25215 '{' requirement-list '}' */
25216 static tree
25218 {
25228 }
25230 /* Parse a list of requirements.
25232 requirement-list:
25233 requirement
25234 requirement-list ';' requirement[opt] */
25235 static tree
25237 {
25240 {
25247 /* If we see a semi-colon, consume it. */
25251 /* Stop processing at the end of the list. */
25254 }
25256 /* Reverse the order of requirements so they are analyzed in
25257 declaration order. */
25259 }
25261 /* Parse a syntactic requirement or type requirement.
25263 requirement:
25264 simple-requirement
25265 compound-requirement
25266 type-requirement
25267 nested-requirement */
25268 static tree
25270 {
25277 else
25279 }
25281 /* Parse a simple requirement.
25283 simple-requirement:
25284 expression ';' */
25285 static tree
25287 {
25296 }
25298 /* Parse a type requirement
25300 type-requirement
25301 nested-name-specifier [opt] required-type-name ';'
25303 required-type-name:
25304 type-name
25305 'template' [opt] simple-template-id */
25306 static tree
25308 {
25311 // Save the scope before parsing name specifiers.
25322 tree type;
25324 {
25333 }
25334 else
25353 }
25355 /* Parse a compound requirement
25357 compound-requirement:
25358 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25359 static tree
25361 {
25362 /* Parse an expression enclosed in '{ }'s. */
25373 /* Parse the optional noexcept. */
25376 {
25379 }
25381 /* Parse the optional trailing return type. */
25384 {
25392 }
25395 }
25397 /* Parse a nested requirement. This is the same as a requires clause.
25399 nested-requirement:
25400 requires-clause */
25401 static tree
25403 {
25409 }
25411 /* Support Functions */
25413 /* Return the appropriate prefer_type argument for lookup_name_real based on
25414 tag_type and template_mem_access. */
25418 {
25419 /* DR 141: When looking in the current enclosing context for a template-name
25420 after -> or ., only consider class templates. */
25424 {
25428 }
25429 }
25431 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25432 NAME should have one of the representations used for an
25433 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25434 is returned. If PARSER->SCOPE is a dependent type, then a
25435 SCOPE_REF is returned.
25437 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25438 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25439 was formed. Abstractly, such entities should not be passed to this
25440 function, because they do not need to be looked up, but it is
25441 simpler to check for this special case here, rather than at the
25442 call-sites.
25444 In cases not explicitly covered above, this function returns a
25445 DECL, OVERLOAD, or baselink representing the result of the lookup.
25446 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25447 is returned.
25449 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25450 (e.g., "struct") that was used. In that case bindings that do not
25451 refer to types are ignored.
25453 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25454 ignored.
25456 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25457 are ignored.
25459 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25460 types.
25462 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25463 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25464 NULL_TREE otherwise. */
25466 static cp_expr
25473 location_t name_location)
25474 {
25475 tree decl;
25478 /* Assume that the lookup will be unambiguous. */
25482 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25483 no longer valid. Note that if we are parsing tentatively, and
25484 the parse fails, OBJECT_TYPE will be automatically restored. */
25490 /* A template-id has already been resolved; there is no lookup to
25491 do. */
25495 {
25499 }
25501 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25502 it should already have been checked to make sure that the name
25503 used matches the type being destroyed. */
25505 {
25506 tree type;
25508 /* Figure out to which type this destructor applies. */
25513 else
25515 /* If that's not a class type, there is no destructor. */
25522 /* If it was a class type, return the destructor. */
25524 }
25526 /* By this point, the NAME should be an ordinary identifier. If
25527 the id-expression was a qualified name, the qualifying scope is
25528 stored in PARSER->SCOPE at this point. */
25531 /* Perform the lookup. */
25533 {
25539 /* If the SCOPE is dependent, the lookup must be deferred until
25540 the template is instantiated -- unless we are explicitly
25541 looking up names in uninstantiated templates. Even then, we
25542 cannot look up the name if the scope is not a class type; it
25543 might, for example, be a template type parameter. */
25548 /* Defer lookup. */
25550 else
25551 {
25554 /* If PARSER->SCOPE is a dependent type, then it must be a
25555 class type, and we must not be checking dependencies;
25556 otherwise, we would have processed this lookup above. So
25557 that PARSER->SCOPE is not considered a dependent base by
25558 lookup_member, we must enter the scope here. */
25562 /* If the PARSER->SCOPE is a template specialization, it
25563 may be instantiated during name lookup. In that case,
25564 errors may be issued. Even if we rollback the current
25565 tentative parse, those errors are valid. */
25570 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25571 lookup result and the nested-name-specifier nominates a class C:
25572 * if the name specified after the nested-name-specifier, when
25573 looked up in C, is the injected-class-name of C (Clause 9), or
25574 * if the name specified after the nested-name-specifier is the
25575 same as the identifier or the simple-template-id's template-
25576 name in the last component of the nested-name-specifier,
25577 the name is instead considered to name the constructor of
25578 class C. [ Note: for example, the constructor is not an
25579 acceptable lookup result in an elaborated-type-specifier so
25580 the constructor would not be used in place of the
25581 injected-class-name. --end note ] Such a constructor name
25582 shall be used only in the declarator-id of a declaration that
25583 names a constructor or in a using-declaration. */
25591 /* If we have a single function from a using decl, pull it out. */
25598 }
25600 /* If the scope is a dependent type and either we deferred lookup or
25601 we did lookup but didn't find the name, rememeber the name. */
25604 {
25606 {
25607 tree type;
25609 /* The resolution to Core Issue 180 says that `struct
25610 A::B' should be considered a type-name, even if `A'
25611 is dependent. */
25616 }
25620 CPP_CLOSE_PAREN)))
25624 else
25627 is_template);
25628 }
25631 }
25633 {
25634 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25635 OBJECT_TYPE is not a class. */
25637 /* If the OBJECT_TYPE is a template specialization, it may
25638 be instantiated during name lookup. In that case, errors
25639 may be issued. Even if we rollback the current tentative
25640 parse, those errors are valid. */
25642 name,
25645 tf_warning_or_error);
25646 else
25650 /* Look it up in the enclosing context. DR 141: When looking for a
25651 template-name after -> or ., only consider class templates. */
25656 /* The object is type-dependent, so we can't look anything up; we used
25657 this to get the DR 141 behavior. */
25661 }
25662 else
25663 {
25669 }
25671 /* If the lookup failed, let our caller know. */
25675 /* Pull out the template from an injected-class-name (or multiple). */
25679 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25681 {
25684 /* The error message we have to print is too complicated for
25685 cp_parser_error, so we incorporate its actions directly. */
25687 {
25689 name);
25691 }
25693 }
25701 /* If we have resolved the name of a member declaration, check to
25702 see if the declaration is accessible. When the name resolves to
25703 set of overloaded functions, accessibility is checked when
25704 overload resolution is done.
25706 During an explicit instantiation, access is not checked at all,
25707 as per [temp.explicit]. */
25714 }
25716 /* Like cp_parser_lookup_name, but for use in the typical case where
25717 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25718 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25720 static tree
25722 {
25724 none_type,
25729 location);
25730 }
25732 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25733 the current context, return the TYPE_DECL. If TAG_NAME_P is
25734 true, the DECL indicates the class being defined in a class-head,
25735 or declared in an elaborated-type-specifier.
25737 Otherwise, return DECL. */
25739 static tree
25741 {
25742 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25743 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25745 struct A {
25746 template <typename T> struct B;
25747 };
25749 template <typename T> struct A::B {};
25751 Similarly, in an elaborated-type-specifier:
25753 namespace N { struct X{}; }
25755 struct A {
25756 template <typename T> friend struct N::X;
25757 };
25759 However, if the DECL refers to a class type, and we are in
25760 the scope of the class, then the name lookup automatically
25761 finds the TYPE_DECL created by build_self_reference rather
25762 than a TEMPLATE_DECL. For example, in:
25764 template <class T> struct S {
25765 S s;
25766 };
25768 there is no need to handle such case. */
25774 }
25776 /* If too many, or too few, template-parameter lists apply to the
25777 declarator, issue an error message. Returns TRUE if all went well,
25778 and FALSE otherwise. */
25780 static bool
25783 location_t declarator_location)
25784 {
25786 {
25788 {
25796 /* If the DECLARATOR has the form `X<y>' then it uses one
25797 additional level of template parameters. */
25800 return cp_parser_check_template_parameters
25802 }
25818 }
25820 }
25822 /* NUM_TEMPLATES were used in the current declaration. If that is
25823 invalid, return FALSE and issue an error messages. Otherwise,
25824 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25825 declarator and we can print more accurate diagnostics. */
25827 static bool
25830 location_t location,
25832 {
25833 /* If there are the same number of template classes and parameter
25834 lists, that's OK. */
25837 /* If there are more, but only one more, then we are referring to a
25838 member template. That's OK too. */
25841 /* If there are more template classes than parameter lists, we have
25842 something like:
25844 template <class T> void S<T>::R<T>::f (); */
25846 {
25856 else
25859 }
25860 /* Otherwise, there are too many template parameter lists. We have
25861 something like:
25863 template <class T> template <class U> void S::f(); */
25866 }
25868 /* Parse an optional `::' token indicating that the following name is
25869 from the global namespace. If so, PARSER->SCOPE is set to the
25870 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25871 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25872 Returns the new value of PARSER->SCOPE, if the `::' token is
25873 present, and NULL_TREE otherwise. */
25875 static tree
25877 {
25880 /* Peek at the next token. */
25882 /* If we're looking at a `::' token then we're starting from the
25883 global namespace, not our current location. */
25885 {
25886 /* Consume the `::' token. */
25888 /* Set the SCOPE so that we know where to start the lookup. */
25894 }
25896 {
25900 }
25903 }
25905 /* Returns TRUE if the upcoming token sequence is the start of a
25906 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25907 declarator is preceded by the `friend' specifier. */
25909 static bool
25911 {
25914 tree nested_name_specifier;
25917 /* The common case is that this is not a constructor declarator, so
25918 try to avoid doing lots of work if at all possible. It's not
25919 valid declare a constructor at function scope. */
25922 /* And only certain tokens can begin a constructor declarator. */
25930 /* Parse tentatively; we are going to roll back all of the tokens
25931 consumed here. */
25933 /* Assume that we are looking at a constructor declarator. */
25936 /* Look for the optional `::' operator. */
25939 /* Look for the nested-name-specifier. */
25940 nested_name_specifier
25951 /* Outside of a class-specifier, there must be a
25952 nested-name-specifier. Except in C++17 mode, where we
25953 might be declaring a guiding declaration. */
25960 /* If we have a class scope, this is easy; DR 147 says that S::S always
25961 names the constructor, and no other qualified name could. */
25964 {
25974 }
25975 /* If we still think that this might be a constructor-declarator,
25976 look for a class-name. */
25978 {
25979 /* If we have:
25981 template <typename T> struct S {
25982 S();
25983 };
25985 we must recognize that the nested `S' names a class. */
25989 tree type_decl;
25993 none_type,
26000 {
26006 none_type,
26011 else
26013 }
26015 /* If there was no class-name, then this is not a constructor.
26016 Otherwise, if we are in a class-specifier and we aren't
26017 handling a friend declaration, check that its type matches
26018 current_class_type (c++/38313). Note: error_mark_node
26019 is left alone for error recovery purposes. */
26021 && (outside_class_specifier_p
26027 /* If we're still considering a constructor, we have to see a `(',
26028 to begin the parameter-declaration-clause, followed by either a
26029 `)', an `...', or a decl-specifier. We need to check for a
26030 type-specifier to avoid being fooled into thinking that:
26032 S (f) (int);
26034 is a constructor. (It is actually a function named `f' that
26035 takes one parameter (of type `int') and returns a value of type
26036 `S'. */
26044 /* A parameter declaration begins with a decl-specifier,
26045 which is either the "attribute" keyword, a storage class
26046 specifier, or (usually) a type-specifier. */
26048 {
26049 tree type;
26053 /* Names appearing in the type-specifier should be looked up
26054 in the scope of the class. */
26058 {
26061 {
26065 {
26068 }
26069 }
26071 }
26073 /* Inside the constructor parameter list, surrounding
26074 template-parameter-lists do not apply. */
26075 saved_num_template_parameter_lists
26079 /* Look for the type-specifier. */
26081 CP_PARSER_FLAGS_NONE,
26087 parser->num_template_parameter_lists
26090 /* Leave the scope of the class. */
26095 }
26096 }
26098 /* We did not really want to consume any tokens. */
26102 }
26104 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26105 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26106 they must be performed once we are in the scope of the function.
26108 Returns the function defined. */
26110 static tree
26111 cp_parser_function_definition_from_specifiers_and_declarator
26114 tree attributes,
26116 {
26117 tree fn;
26120 /* Begin the function-definition. */
26123 /* The things we're about to see are not directly qualified by any
26124 template headers we've seen thus far. */
26127 /* If there were names looked up in the decl-specifier-seq that we
26128 did not check, check them now. We must wait until we are in the
26129 scope of the function to perform the checks, since the function
26130 might be a friend. */
26134 {
26139 }
26142 {
26143 /* Skip the entire function. */
26146 }
26148 {
26149 /* Seen already, skip it. An error message has already been output. */
26153 /* If this is a function from a class, pop the nested class. */
26156 }
26157 else
26158 {
26159 timevar_id_t tv;
26162 else
26168 }
26171 }
26173 /* Parse the part of a function-definition that follows the
26174 declarator. INLINE_P is TRUE iff this function is an inline
26175 function defined within a class-specifier.
26177 Returns the function defined. */
26179 static tree
26182 {
26183 tree fn;
26189 bool fully_implicit_function_template_p
26192 tree implicit_template_parms
26195 cp_binding_level* implicit_template_scope
26201 /* If the next token is `return', then the code may be trying to
26202 make use of the "named return value" extension that G++ used to
26203 support. */
26206 {
26207 /* Consume the `return' keyword. */
26209 /* Look for the identifier that indicates what value is to be
26210 returned. */
26212 /* Issue an error message. */
26215 /* Skip tokens until we reach the start of the function body. */
26217 {
26224 }
26225 }
26226 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26227 anything declared inside `f'. */
26228 saved_in_unbraced_linkage_specification_p
26231 /* Inside the function, surrounding template-parameter-lists do not
26232 apply. */
26233 saved_num_template_parameter_lists
26239 /* If the next token is `try', `__transaction_atomic', or
26240 `__transaction_relaxed`, then we are looking at either function-try-block
26241 or function-transaction-block. Note that all of these include the
26242 function-body. */
26245 RID_TRANSACTION_ATOMIC);
26247 RID_TRANSACTION_RELAXED))
26249 RID_TRANSACTION_RELAXED);
26252 else
26253 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26258 /* Finish the function. */
26261 /* Generate code for it, if necessary. */
26263 /* Restore the saved values. */
26264 parser->in_unbraced_linkage_specification_p
26266 parser->num_template_parameter_lists
26270 parser->fully_implicit_function_template_p
26272 parser->implicit_template_parms
26274 parser->implicit_template_scope
26281 }
26283 /* Parse a template-declaration body (following argument list). */
26285 static void
26287 tree parameter_list,
26289 {
26293 /* We just processed one more parameter list. */
26296 /* Get the deferred access checks from the parameter list. These
26297 will be checked once we know what is being declared, as for a
26298 member template the checks must be performed in the scope of the
26299 class containing the member. */
26302 /* Tentatively parse for a new template parameter list, which can either be
26303 the template keyword or a template introduction. */
26309 else
26310 {
26311 /* There are no access checks when parsing a template, as we do not
26312 know if a specialization will be a friend. */
26316 checks,
26317 member_p,
26322 /* If this is a member template declaration, let the front
26323 end know. */
26325 {
26330 }
26335 }
26336 /* We are done with the current parameter list. */
26341 /* Finish up. */
26344 /* Check the template arguments for a literal operator template. */
26348 {
26352 else
26353 {
26356 {
26362 }
26364 {
26373 }
26374 else
26376 }
26378 {
26381 " Expected non-type template argument pack <char...>"
26383 decl);
26384 else
26387 decl);
26388 }
26389 }
26391 /* Register member declarations. */
26394 /* If DECL is a function template, we must return to parse it later.
26395 (Even though there is no definition, there might be default
26396 arguments that need handling.) */
26400 }
26402 /* Parse a template introduction header for a template-declaration. Returns
26403 false if tentative parse fails. */
26405 static bool
26407 {
26414 /* Look for the optional `::' operator. */
26417 /* Look for the nested-name-specifier. */
26427 /* Look up the concept for which we will be matching
26428 template parameters. */
26438 /* Look for opening brace for introduction. */
26446 /* Build vector of placeholder parameters and grab
26447 matching identifiers. */
26450 /* The introduction-list shall not be empty. */
26453 {
26456 }
26458 /* Look for closing brace for introduction. */
26463 {
26467 }
26469 /* Build and associate the constraint. */
26472 {
26474 member_p);
26476 }
26480 }
26482 /* Parse a normal template-declaration following the template keyword. */
26484 static void
26486 {
26487 tree parameter_list;
26491 /* Look for the `<' token. */
26495 {
26496 /* 14.5.2.2 [temp.mem]
26498 A local class shall not have member templates. */
26503 }
26504 /* [temp]
26506 A template ... shall not have C linkage. */
26508 {
26510 /* Give it C++ linkage to avoid confusing other parts of the
26511 front end. */
26514 }
26515 else
26518 /* We cannot perform access checks on the template parameter
26519 declarations until we know what is being declared, just as we
26520 cannot check the decl-specifier list. */
26523 /* If the next token is `>', then we have an invalid
26524 specialization. Rather than complain about an invalid template
26525 parameter, issue an error message here. */
26527 {
26531 }
26532 else
26533 {
26534 /* Parse the template parameters. */
26536 }
26538 /* Look for the `>'. */
26541 /* Manage template requirements */
26543 {
26548 }
26551 member_p);
26553 /* For the erroneous case of a template with C linkage, we pushed an
26554 implicit C++ linkage scope; exit that scope now. */
26557 }
26559 /* Parse a template-declaration, assuming that the `export' (and
26560 `extern') keywords, if present, has already been scanned. MEMBER_P
26561 is as for cp_parser_template_declaration. */
26563 static bool
26565 {
26567 {
26571 }
26576 }
26578 /* Perform the deferred access checks from a template-parameter-list.
26579 CHECKS is a TREE_LIST of access checks, as returned by
26580 get_deferred_access_checks. */
26582 static void
26583 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26584 {
26588 }
26590 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26591 `function-definition' sequence that follows a template header.
26592 If MEMBER_P is true, this declaration appears in a class scope.
26594 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26595 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26597 static tree
26603 {
26606 cp_decl_specifier_seq decl_specifiers;
26610 /* This function is only used when processing a template
26611 declaration. */
26615 /* Defer access checks until we know what is being declared. */
26618 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26619 alternative. */
26622 CP_PARSER_FLAGS_OPTIONAL,
26628 /* There are no template typedefs. */
26630 {
26634 }
26636 /* Gather up the access checks that occurred the
26637 decl-specifier-seq. */
26640 /* Check for the declaration of a template class. */
26642 {
26645 {
26646 // If this is a declaration, but not a definition, associate
26647 // any constraints with the type declaration. Constraints
26648 // are associated with definitions in cp_parser_class_specifier.
26654 /* In this case:
26656 struct C {
26657 friend template <typename T> struct A<T>::B;
26658 };
26660 A<T>::B will be represented by a TYPENAME_TYPE, and
26661 therefore not recognized by shadow_tag. */
26663 && !decl
26670 else
26673 /* Perform access checks for template parameters. */
26676 /* Give a helpful diagnostic for
26677 template <class T> struct A { } a;
26678 if we aren't already recovering from an error. */
26681 {
26683 "a class template declaration must not declare "
26687 }
26688 }
26689 }
26691 /* Complain about missing 'typename' or other invalid type names. */
26694 {
26695 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26696 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26697 the rest of this declaration. */
26700 }
26702 /* If it's not a template class, try for a template function. If
26703 the next token is a `;', then this declaration does not declare
26704 anything. But, if there were errors in the decl-specifiers, then
26705 the error might well have come from an attempted class-specifier.
26706 In that case, there's no need to warn about a missing declarator. */
26710 {
26713 checks,
26715 member_p,
26716 declares_class_or_enum,
26720 /* 7.1.1-1 [dcl.stc]
26722 A storage-class-specifier shall not be specified in an explicit
26723 specialization... */
26725 && explicit_specialization_p
26727 {
26731 }
26735 }
26737 /* Look for a trailing `;' after the declaration. */
26743 out:
26746 /* Clear any current qualification; whatever comes next is the start
26747 of something new. */
26753 }
26755 /* Parse a cast-expression that is not the operand of a unary "&". */
26757 static cp_expr
26759 {
26762 }
26764 /* Parse a functional cast to TYPE. Returns an expression
26765 representing the cast. */
26767 static cp_expr
26769 {
26771 tree expression_list;
26772 cp_expr cast;
26781 {
26790 tf_warning_or_error);
26791 /* Create a location of the form:
26792 type_name{i, f}
26793 ^~~~~~~~~~~~~~~
26794 with caret == start at the start of the type name,
26795 finishing at the closing brace. */
26796 location_t finish_loc
26799 finish_loc);
26802 }
26811 else
26812 {
26815 }
26818 tf_warning_or_error);
26819 /* [expr.const]/1: In an integral constant expression "only type
26820 conversions to integral or enumeration type can be used". */
26826 NIC_CONSTRUCTOR))
26829 /* Create a location of the form:
26830 float(i)
26831 ^~~~~~~~
26832 with caret == start at the start of the type name,
26833 finishing at the closing paren. */
26834 location_t finish_loc
26839 }
26841 /* Save the tokens that make up the body of a member function defined
26842 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26843 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26844 specifiers applied to the declaration. Returns the FUNCTION_DECL
26845 for the member function. */
26847 static tree
26851 tree attributes)
26852 {
26855 tree fn;
26858 /* Create the FUNCTION_DECL. */
26862 /* If something went badly wrong, bail out now. */
26864 {
26865 /* If there's a function-body, skip it. */
26870 }
26872 /* Remember it, if there default args to post process. */
26875 /* Save away the tokens that make up the body of the
26876 function. */
26882 RID_TRANSACTION_ATOMIC))
26883 {
26885 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26892 {
26898 }
26899 else
26902 {
26906 }
26907 }
26909 /* Handle function try blocks. */
26911 {
26914 }
26915 /* We can have braced-init-list mem-initializers before the fn body. */
26917 {
26920 {
26921 /* cache_group will stop after an un-nested { } pair, too. */
26925 /* variadic mem-inits have ... after the ')'. */
26928 }
26929 }
26931 /* Handle function try blocks. */
26937 /* Save away the inline definition; we will process it when the
26938 class is complete. */
26942 /* We need to know that this was defined in the class, so that
26943 friend templates are handled correctly. */
26946 /* Add FN to the queue of functions to be parsed later. */
26950 }
26952 /* Save the tokens that make up the in-class initializer for a non-static
26953 data member. Returns a DEFAULT_ARG. */
26955 static tree
26957 {
26959 }
26961 /* Parse a template-argument-list, as well as the trailing ">" (but
26962 not the opening "<"). See cp_parser_template_argument_list for the
26963 return value. */
26965 static tree
26967 {
26968 tree arguments;
26969 tree saved_scope;
26970 tree saved_qualifying_scope;
26971 tree saved_object_scope;
26976 /* [temp.names]
26978 When parsing a template-id, the first non-nested `>' is taken as
26979 the end of the template-argument-list rather than a greater-than
26980 operator. */
26981 saved_greater_than_is_operator_p
26984 /* Parsing the argument list may modify SCOPE, so we save it
26985 here. */
26989 /* We need to evaluate the template arguments, even though this
26990 template-id may be nested within a "sizeof". */
26995 /* Parse the template-argument-list itself. */
26999 else
27001 /* Look for the `>' that ends the template-argument-list. If we find
27002 a '>>' instead, it's probably just a typo. */
27004 {
27006 {
27007 /* In C++0x, a `>>' in a template argument list or cast
27008 expression is considered to be two separate `>'
27009 tokens. So, change the current token to a `>', but don't
27010 consume it: it will be consumed later when the outer
27011 template argument list (or cast expression) is parsed.
27012 Note that this replacement of `>' for `>>' is necessary
27013 even if we are parsing tentatively: in the tentative
27014 case, after calling
27015 cp_parser_enclosed_template_argument_list we will always
27016 throw away all of the template arguments and the first
27017 closing `>', either because the template argument list
27018 was erroneous or because we are replacing those tokens
27019 with a CPP_TEMPLATE_ID token. The second `>' (which will
27020 not have been thrown away) is needed either to close an
27021 outer template argument list or to complete a new-style
27022 cast. */
27025 }
27027 {
27028 /* If we're in a nested template argument list, the '>>' has
27029 to be a typo for '> >'. We emit the error message, but we
27030 continue parsing and we push a '>' as next token, so that
27031 the argument list will be parsed correctly. Note that the
27032 global source location is still on the token before the
27033 '>>', so we need to say explicitly where we want it. */
27041 }
27042 else
27043 {
27044 /* If this is not a nested template argument list, the '>>'
27045 is a typo for '>'. Emit an error message and continue.
27046 Same deal about the token location, but here we can get it
27047 right by consuming the '>>' before issuing the diagnostic. */
27050 "spurious %<>>%>, use %<>%> to terminate "
27052 }
27053 }
27054 else
27056 /* The `>' token might be a greater-than operator again now. */
27057 parser->greater_than_is_operator_p
27059 /* Restore the SAVED_SCOPE. */
27067 }
27069 /* MEMBER_FUNCTION is a member function, or a friend. If default
27070 arguments, or the body of the function have not yet been parsed,
27071 parse them now. */
27073 static void
27075 {
27077 /* If this member is a template, get the underlying
27078 FUNCTION_DECL. */
27082 /* There should not be any class definitions in progress at this
27083 point; the bodies of members are only parsed outside of all class
27084 definitions. */
27086 /* While we're parsing the member functions we might encounter more
27087 classes. We want to handle them right away, but we don't want
27088 them getting mixed up with functions that are currently in the
27089 queue. */
27092 /* Make sure that any template parameters are in scope. */
27095 /* If the body of the function has not yet been parsed, parse it
27096 now. */
27098 {
27099 tree function_scope;
27102 /* The function is no longer pending; we are processing it. */
27107 /* If this is a local class, enter the scope of the containing
27108 function. */
27113 /* Push the body of the function onto the lexer stack. */
27116 /* Let the front end know that we going to be defining this
27117 function. */
27121 /* Don't do access checking if it is a templated function. */
27125 /* #pragma omp declare reduction needs special parsing. */
27127 {
27132 }
27133 else
27134 /* Now, parse the body of the function. */
27141 /* Leave the scope of the containing function. */
27145 }
27147 /* Remove any template parameters from the symbol table. */
27150 /* Restore the queue. */
27153 }
27155 /* If DECL contains any default args, remember it on the unparsed
27156 functions queue. */
27158 static void
27160 {
27161 tree probe;
27164 probe;
27167 {
27171 }
27172 }
27174 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27175 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27176 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27177 from the parameter-type-list. */
27179 static tree
27182 {
27184 tree parsed_arg;
27190 /* Push the saved tokens for the default argument onto the parser's
27191 lexer stack. */
27197 /* Parse the default argument. */
27208 {
27209 /* In a non-template class, check conversions now. In a template,
27210 we'll wait and instantiate these as needed. */
27213 tf_warning_or_error);
27216 else
27218 }
27220 /* If the token stream has not been completely used up, then
27221 there was extra junk after the end of the default
27222 argument. */
27224 {
27227 else
27229 }
27231 /* Revert to the main lexer. */
27235 }
27237 /* FIELD is a non-static data member with an initializer which we saved for
27238 later; parse it now. */
27240 static void
27242 {
27243 tree def;
27250 NULL_TREE);
27256 }
27258 /* FN is a FUNCTION_DECL which may contains a parameter with an
27259 unparsed DEFAULT_ARG. Parse the default args now. This function
27260 assumes that the current scope is the scope in which the default
27261 argument should be processed. */
27263 static void
27265 {
27269 /* While we're parsing the default args, we might (due to the
27270 statement expression extension) encounter more classes. We want
27271 to handle them right away, but we don't want them getting mixed
27272 up with default args that are currently in the queue. */
27275 /* Local variable names (and the `this' keyword) may not appear
27276 in a default argument. */
27287 {
27289 tree parsed_arg;
27291 tree copy;
27298 /* This can happen for a friend declaration for a function
27299 already declared with default arguments. */
27302 parsed_arg
27304 default_arg,
27307 {
27309 }
27313 /* Update any instantiations we've already created. */
27317 }
27321 /* Make sure no default arg is missing. */
27324 /* Restore the state of local_variables_forbidden_p. */
27327 /* Restore the queue. */
27329 }
27331 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27333 sizeof ... ( identifier )
27335 where the 'sizeof' token has already been consumed. */
27337 static tree
27339 {
27340 /* Consume the `...'. */
27347 else
27355 /* The name is not qualified. */
27374 }
27376 /* Parse the operand of `sizeof' (or a similar operator). Returns
27377 either a TYPE or an expression, depending on the form of the
27378 input. The KEYWORD indicates which kind of expression we have
27379 encountered. */
27381 static tree
27383 {
27390 /* If it's a `...', then we are computing the length of a parameter
27391 pack. */
27396 /* Types cannot be defined in a `sizeof' expression. Save away the
27397 old message. */
27399 /* And create the new one. */
27405 /* The restrictions on constant-expressions do not apply inside
27406 sizeof expressions. */
27407 saved_integral_constant_expression_p
27409 saved_non_integral_constant_expression_p
27413 /* Do not actually evaluate the expression. */
27416 /* If it's a `(', then we might be looking at the type-id
27417 construction. */
27419 {
27422 /* We can't be sure yet whether we're looking at a type-id or an
27423 expression. */
27425 /* Note: as a GNU Extension, compound literals are considered
27426 postfix-expressions as they are in C99, so they are valid
27427 arguments to sizeof. See comment in cp_parser_cast_expression
27428 for details. */
27431 else
27432 {
27435 /* Look for the type-id. */
27437 /* Look for the closing `)'. */
27440 }
27442 /* If all went well, then we're done. */
27444 {
27445 cp_decl_specifier_seq decl_specs;
27447 /* Build a trivial decl-specifier-seq. */
27451 /* Call grokdeclarator to figure out what type this is. */
27454 TYPENAME,
27457 }
27458 }
27460 /* If the type-id production did not work out, then we must be
27461 looking at the unary-expression production. */
27465 /* Go back to evaluating expressions. */
27469 /* Free the message we created. */
27471 /* And restore the old one. */
27473 parser->integral_constant_expression_p
27475 parser->non_integral_constant_expression_p
27479 }
27481 /* If the current declaration has no declarator, return true. */
27483 static bool
27485 {
27486 /* If the next token is a `;' or a `,' then there is no
27487 declarator. */
27490 }
27492 /* Update the DECL_SPECS to reflect the storage class indicated by
27493 KEYWORD. */
27495 static void
27500 {
27501 cp_storage_class storage_class;
27504 {
27508 }
27510 {
27513 }
27518 {
27521 }
27524 {
27542 }
27546 /* A storage class specifier cannot be applied alongside a typedef
27547 specifier. If there is a typedef specifier present then set
27548 conflicting_specifiers_p which will trigger an error later
27549 on in grokdeclarator. */
27552 }
27554 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27555 is true, the type is a class or enum definition. */
27557 static void
27559 tree type_spec,
27562 {
27565 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27566 (with, for example, in "typedef int wchar_t;") we remember that
27567 this is what happened. In system headers, we ignore these
27568 declarations so that G++ can work with system headers that are not
27569 C++-safe. */
27571 && !type_definition_p
27581 {
27584 ds_redefined_builtin_type_spec,
27585 token);
27587 {
27591 }
27592 }
27595 else
27596 {
27601 }
27602 }
27604 /* True iff TOKEN is the GNU keyword __thread. */
27606 static bool
27608 {
27611 }
27613 /* Set the location for a declarator specifier and check if it is
27614 duplicated.
27616 DECL_SPECS is the sequence of declarator specifiers onto which to
27617 set the location.
27619 DS is the single declarator specifier to set which location is to
27620 be set onto the existing sequence of declarators.
27622 LOCATION is the location for the declarator specifier to
27623 consider. */
27625 static void
27628 {
27637 {
27641 }
27642 else
27643 {
27645 {
27649 else
27650 {
27653 OPT_Wlong_long,
27655 }
27656 }
27658 {
27663 else
27665 }
27666 else
27667 {
27683 "__complex"
27684 };
27687 }
27688 }
27689 }
27691 /* Return true iff the declarator specifier DS is present in the
27692 sequence of declarator specifiers DECL_SPECS. */
27694 bool
27696 cp_decl_spec ds)
27697 {
27704 }
27706 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27707 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27709 static bool
27711 {
27713 }
27715 /* Issue an error message indicating that TOKEN_DESC was expected.
27716 If KEYWORD is true, it indicated this function is called by
27717 cp_parser_require_keword and the required token can only be
27718 a indicated keyword. */
27720 static void
27722 required_token token_desc,
27724 {
27726 {
27795 }
27797 {
27799 {
27878 }
27879 }
27880 else
27882 }
27886 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27887 issue an error message indicating that TOKEN_DESC was expected.
27889 Returns the token consumed, if the token had the appropriate type.
27890 Otherwise, returns NULL. */
27895 required_token token_desc)
27896 {
27899 else
27900 {
27901 /* Output the MESSAGE -- unless we're parsing tentatively. */
27905 }
27906 }
27908 /* An error message is produced if the next token is not '>'.
27909 All further tokens are skipped until the desired token is
27910 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27912 static void
27914 {
27915 /* Current level of '< ... >'. */
27917 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27920 /* Are we ready, yet? If not, issue error message. */
27924 /* Skip tokens until the desired token is found. */
27926 {
27927 /* Peek at the next token. */
27929 {
27937 /* C++0x views the `>>' operator as two `>' tokens, but
27938 C++98 does not. */
27941 {
27942 /* We've hit a `>>' where the first `>' closes the
27943 template argument list, and the second `>' is
27944 spurious. Just consume the `>>' and stop; we've
27945 already produced at least one error. */
27948 }
27949 /* Fall through for C++0x, so we handle the second `>' in
27950 the `>>'. */
27955 {
27956 /* We've reached the token we want, consume it and stop. */
27959 }
27978 /* The '>' was probably forgotten, don't look further. */
27983 }
27985 /* Consume this token. */
27987 }
27988 }
27990 /* If the next token is the indicated keyword, consume it. Otherwise,
27991 issue an error message indicating that TOKEN_DESC was expected.
27993 Returns the token consumed, if the token had the appropriate type.
27994 Otherwise, returns NULL. */
27999 required_token token_desc)
28000 {
28004 {
28007 }
28010 }
28012 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28013 function-definition. */
28015 static bool
28017 {
28020 /* A ctor-initializer begins with a `:'. */
28022 /* A function-try-block begins with `try'. */
28024 /* A function-transaction-block begins with `__transaction_atomic'
28025 or `__transaction_relaxed'. */
28028 /* The named return value extension begins with `return'. */
28030 }
28032 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28033 definition. */
28035 static bool
28037 {
28044 }
28046 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28047 C++0x) ending a template-argument. */
28049 static bool
28051 {
28059 }
28061 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28062 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28064 static bool
28067 {
28073 /* Check for the sequence `<::' in the original code. It would be lexed as
28074 `[:', where `[' is a digraph, and there is no whitespace before
28075 `:'. */
28077 {
28082 }
28084 }
28086 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28087 or none_type otherwise. */
28089 static enum tag_types
28091 {
28093 {
28103 }
28104 }
28106 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28107 or none_type otherwise or if the token is null. */
28109 static enum tag_types
28111 {
28116 {
28124 }
28125 }
28127 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28129 static void
28131 {
28135 {
28139 type))
28142 }
28143 }
28145 /* Issue an error message if DECL is redeclared with different
28146 access than its original declaration [class.access.spec/3].
28147 This applies to nested classes, nested class templates and
28148 enumerations [class.mem/1]. */
28150 static void
28152 {
28163 }
28165 /* Look for the `template' keyword, as a syntactic disambiguator.
28166 Return TRUE iff it is present, in which case it will be
28167 consumed. */
28169 static bool
28171 {
28173 {
28174 /* In C++98 the `template' keyword can only be used within templates;
28175 outside templates the parser can always figure out what is a
28176 template and what is not. In C++11, per the resolution of DR 468,
28177 `template' is allowed in cases where it is not strictly necessary. */
28180 {
28183 "in C++98 %<template%> (as a disambiguator) is only "
28185 /* If this part of the token stream is rescanned, the same
28186 error message would be generated. So, we purge the token
28187 from the stream. */
28190 }
28191 else
28192 {
28193 /* Consume the `template' keyword. */
28196 }
28197 }
28199 }
28201 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28202 set PARSER->SCOPE, and perform other related actions. */
28204 static void
28206 {
28209 /* Get the stored value. */
28211 /* Set the scope from the stored value. */
28215 }
28217 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28218 encounter the end of a block before what we were looking for. */
28220 static bool
28224 {
28226 {
28229 /* Abort a parenthesized expression if we encounter a semicolon. */
28233 /* If we've reached the end of the file, stop. */
28239 /* We've hit the end of an enclosing block, so there's been some
28240 kind of syntax error. */
28243 /* Consume the token. */
28245 /* See if it starts a new group. */
28247 {
28249 /* In theory this should probably check end == '}', but
28250 cp_parser_save_member_function_body needs it to exit
28251 after either '}' or ')' when called with ')'. */
28254 }
28256 {
28260 }
28265 }
28266 }
28268 /* Like above, for caching a default argument or NSDMI. Both of these are
28269 terminated by a non-nested comma, but it can be unclear whether or not a
28270 comma is nested in a template argument list unless we do more parsing.
28271 In order to handle this ambiguity, when we encounter a ',' after a '<'
28272 we try to parse what follows as a parameter-declaration-list (in the
28273 case of a default argument) or a member-declarator (in the case of an
28274 NSDMI). If that succeeds, then we stop caching. */
28276 static tree
28278 {
28283 tree default_argument;
28285 /* Add tokens until we have processed the entire default
28286 argument. We add the range [first_token, token). */
28289 {
28290 /* For list-initialization, this is straightforward. */
28293 }
28295 {
28298 /* Peek at the next token. */
28300 /* What we do depends on what token we have. */
28302 {
28303 /* In valid code, a default argument must be
28304 immediately followed by a `,' `)', or `...'. */
28307 {
28308 /* If we've seen a '<', we might be in a
28309 template-argument-list. Until Core issue 325 is
28310 resolved, we don't know how this situation ought
28311 to be handled, so try to DTRT. We check whether
28312 what comes after the comma is a valid parameter
28313 declaration list. If it is, then the comma ends
28314 the default argument; otherwise the default
28315 argument continues. */
28319 /* Set ITALP so cp_parser_parameter_declaration_list
28320 doesn't decide to commit to this parse. */
28327 {
28328 /* Parse declarators until we reach a non-comma or
28329 somthing that cannot be an initializer.
28330 Just checking whether we're looking at a single
28331 declarator is insufficient. Consider:
28332 int var = tuple<T,U>::x;
28333 The template parameter 'U' looks exactly like a
28334 declarator. */
28335 do
28336 {
28347 }
28349 /* If we met an '=' or ';' then the original comma
28350 was the end of the NSDMI. Otherwise assume
28351 we're still in the NSDMI. */
28354 }
28355 else
28356 {
28361 }
28368 }
28369 /* FALLTHRU */
28372 /* If we run into a non-nested `;', `}', or `]',
28373 then the code is invalid -- but the default
28374 argument is certainly over. */
28379 /* Handle correctly int n = sizeof ... ( p ); */
28382 /* Update DEPTH, if necessary. */
28397 /* This might be the comparison operator, or it might
28398 start a template argument list. */
28405 /* Fall through for C++0x, which treats the `>>'
28406 operator like two `>' tokens in certain
28407 cases. */
28412 {
28413 /* This might be an operator, or it might close a
28414 template argument list. But if a previous '<'
28415 started a template argument list, this will have
28416 closed it, so we can't be in one anymore. */
28420 }
28423 /* If we run out of tokens, issue an error message. */
28431 /* In these cases, we should look for template-ids.
28432 For example, if the default argument is
28433 `X<int, double>()', we need to do name lookup to
28434 figure out whether or not `X' is a template; if
28435 so, the `,' does not end the default argument.
28437 That is not yet done. */
28442 }
28444 /* If we've reached the end, stop. */
28448 /* Add the token to the token block. */
28450 }
28452 /* Create a DEFAULT_ARG to represent the unparsed default
28453 argument. */
28460 }
28462 /* Begin parsing tentatively. We always save tokens while parsing
28463 tentatively so that if the tentative parsing fails we can restore the
28464 tokens. */
28466 static void
28468 {
28469 /* Enter a new parsing context. */
28471 /* Begin saving tokens. */
28473 /* In order to avoid repetitive access control error messages,
28474 access checks are queued up until we are no longer parsing
28475 tentatively. */
28477 }
28479 /* Commit to the currently active tentative parse. */
28481 static void
28483 {
28487 /* Mark all of the levels as committed. */
28490 {
28497 }
28498 }
28500 /* Commit to the topmost currently active tentative parse.
28502 Note that this function shouldn't be called when there are
28503 irreversible side-effects while in a tentative state. For
28504 example, we shouldn't create a permanent entry in the symbol
28505 table, or issue an error message that might not apply if the
28506 tentative parse is aborted. */
28508 static void
28510 {
28515 {
28523 }
28524 }
28526 /* Abort the currently active tentative parse. All consumed tokens
28527 will be rolled back, and no diagnostics will be issued. */
28529 static void
28531 {
28535 /* Now, pretend that we want to see if the construct was
28536 successfully parsed. */
28538 }
28540 /* Stop parsing tentatively. If a parse error has occurred, restore the
28541 token stream. Otherwise, commit to the tokens we have consumed.
28542 Returns true if no error occurred; false otherwise. */
28544 static bool
28546 {
28550 /* Remember whether or not an error occurred, since we are about to
28551 destroy that information. */
28553 /* Remove the topmost context from the stack. */
28556 /* If no parse errors occurred, commit to the tentative parse. */
28558 {
28559 /* Commit to the tokens read tentatively, unless that was
28560 already done. */
28565 }
28566 /* Otherwise, if errors occurred, roll back our state so that things
28567 are just as they were before we began the tentative parse. */
28568 else
28569 {
28572 }
28573 /* Add the context to the front of the free list. */
28578 }
28580 /* Returns true if we are parsing tentatively and are not committed to
28581 this tentative parse. */
28583 static bool
28585 {
28588 }
28590 /* Returns nonzero iff an error has occurred during the most recent
28591 tentative parse. */
28593 static bool
28595 {
28598 }
28600 /* Returns nonzero if GNU extensions are allowed. */
28602 static bool
28604 {
28606 }
28607 \f
28608 /* Objective-C++ Productions */
28611 /* Parse an Objective-C expression, which feeds into a primary-expression
28612 above.
28614 objc-expression:
28615 objc-message-expression
28616 objc-string-literal
28617 objc-encode-expression
28618 objc-protocol-expression
28619 objc-selector-expression
28621 Returns a tree representation of the expression. */
28623 static cp_expr
28625 {
28626 /* Try to figure out what kind of declaration is present. */
28630 {
28640 {
28652 }
28658 }
28661 }
28663 /* Parse an Objective-C message expression.
28665 objc-message-expression:
28666 [ objc-message-receiver objc-message-args ]
28668 Returns a representation of an Objective-C message. */
28670 static tree
28672 {
28684 /* Construct a location e.g.
28685 [self func1:5]
28686 ^~~~~~~~~~~~~~
28687 ranging from the '[' to the ']', with the caret at the start. */
28692 }
28694 /* Parse an objc-message-receiver.
28696 objc-message-receiver:
28697 expression
28698 simple-type-specifier
28700 Returns a representation of the type or expression. */
28702 static tree
28704 {
28705 tree rcv;
28707 /* An Objective-C message receiver may be either (1) a type
28708 or (2) an expression. */
28712 /* If that worked out, fine. */
28719 CP_PARSER_FLAGS_NONE);
28726 }
28728 /* Parse the arguments and selectors comprising an Objective-C message.
28730 objc-message-args:
28731 objc-selector
28732 objc-selector-args
28733 objc-selector-args , objc-comma-args
28735 objc-selector-args:
28736 objc-selector [opt] : assignment-expression
28737 objc-selector-args objc-selector [opt] : assignment-expression
28739 objc-comma-args:
28740 assignment-expression
28741 objc-comma-args , assignment-expression
28743 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28744 selector arguments and TREE_VALUE containing a list of comma
28745 arguments. */
28747 static tree
28749 {
28755 {
28761 /* Detect if we have a unary selector. */
28770 sel_args
28775 }
28777 /* Handle non-selector arguments, if any. */
28779 {
28780 tree arg;
28785 addl_args
28790 }
28793 {
28796 }
28799 }
28801 /* Parse an Objective-C encode expression.
28803 objc-encode-expression:
28804 @encode objc-typename
28806 Returns an encoded representation of the type argument. */
28808 static cp_expr
28810 {
28811 tree type;
28822 {
28826 }
28828 /* This happens if we find @encode(T) (where T is a template
28829 typename or something dependent on a template typename) when
28830 parsing a template. In that case, we can't compile it
28831 immediately, but we rather create an AT_ENCODE_EXPR which will
28832 need to be instantiated when the template is used.
28833 */
28835 {
28839 }
28842 /* Build a location of the form:
28843 @encode(int)
28844 ^~~~~~~~~~~~
28845 with caret==start at the @ token, finishing at the close paren. */
28846 location_t combined_loc
28851 }
28853 /* Parse an Objective-C @defs expression. */
28855 static tree
28857 {
28858 tree name;
28866 }
28868 /* Parse an Objective-C protocol expression.
28870 objc-protocol-expression:
28871 @protocol ( identifier )
28873 Returns a representation of the protocol expression. */
28875 static tree
28877 {
28878 tree proto;
28886 /* Build a location of the form:
28887 @protocol(prot)
28888 ^~~~~~~~~~~~~~~
28889 with caret==start at the @ token, finishing at the close paren. */
28890 location_t combined_loc
28896 }
28898 /* Parse an Objective-C selector expression.
28900 objc-selector-expression:
28901 @selector ( objc-method-signature )
28903 objc-method-signature:
28904 objc-selector
28905 objc-selector-seq
28907 objc-selector-seq:
28908 objc-selector :
28909 objc-selector-seq objc-selector :
28911 Returns a representation of the method selector. */
28913 static tree
28915 {
28927 {
28936 {
28937 /* Detect if we have a unary selector. */
28939 {
28942 }
28943 else
28944 {
28946 }
28947 }
28952 {
28953 sel_seq
28956 sel_seq
28959 }
28960 else
28961 sel_seq
28966 }
28968 finish_selector:
28972 /* Build a location of the form:
28973 @selector(func)
28974 ^~~~~~~~~~~~~~~
28975 with caret==start at the @ token, finishing at the close paren. */
28976 location_t combined_loc
28980 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28983 }
28985 /* Parse a list of identifiers.
28987 objc-identifier-list:
28988 identifier
28989 objc-identifier-list , identifier
28991 Returns a TREE_LIST of identifier nodes. */
28993 static tree
28995 {
28996 tree identifier;
28997 tree list;
29008 {
29015 identifier));
29017 }
29020 }
29022 /* Parse an Objective-C alias declaration.
29024 objc-alias-declaration:
29025 @compatibility_alias identifier identifier ;
29027 This function registers the alias mapping with the Objective-C front end.
29028 It returns nothing. */
29030 static void
29032 {
29040 }
29042 /* Parse an Objective-C class forward-declaration.
29044 objc-class-declaration:
29045 @class objc-identifier-list ;
29047 The function registers the forward declarations with the Objective-C
29048 front end. It returns nothing. */
29050 static void
29052 {
29055 {
29056 tree id;
29066 else
29068 }
29070 }
29072 /* Parse a list of Objective-C protocol references.
29074 objc-protocol-refs-opt:
29075 objc-protocol-refs [opt]
29077 objc-protocol-refs:
29078 < objc-identifier-list >
29080 Returns a TREE_LIST of identifiers, if any. */
29082 static tree
29084 {
29088 {
29092 }
29095 }
29097 /* Parse a Objective-C visibility specification. */
29099 static void
29101 {
29105 {
29120 }
29122 /* Eat '@private'/'@protected'/'@public'. */
29124 }
29126 /* Parse an Objective-C method type. Return 'true' if it is a class
29127 (+) method, and 'false' if it is an instance (-) method. */
29131 {
29134 else
29136 }
29138 /* Parse an Objective-C protocol qualifier. */
29140 static tree
29142 {
29155 {
29160 }
29163 }
29165 /* Parse an Objective-C typename. */
29167 static tree
29169 {
29173 {
29179 /* An ObjC type name may consist of just protocol qualifiers, in which
29180 case the type shall default to 'id'. */
29182 {
29185 /* If the type could not be parsed, an error has already
29186 been produced. For error recovery, behave as if it had
29187 not been specified, which will use the default type
29188 'id'. */
29190 {
29192 /* We need to skip to the closing parenthesis as
29193 cp_parser_type_id() does not seem to do it for
29194 us. */
29199 }
29200 }
29204 }
29207 }
29209 /* Check to see if TYPE refers to an Objective-C selector name. */
29211 static bool
29213 {
29219 }
29221 /* Parse an Objective-C selector. */
29223 static tree
29225 {
29229 {
29232 }
29234 /* C++ operator names are allowed to appear in ObjC selectors. */
29236 {
29249 }
29250 }
29252 /* Parse an Objective-C params list. */
29254 static tree
29256 {
29262 {
29272 /* Detect if we have a unary selector. */
29275 {
29278 }
29282 {
29283 /* Something went quite wrong. There should be a colon
29284 here, but there is not. Stop parsing parameters. */
29286 }
29288 /* New ObjC allows attributes on parameters too. */
29293 params
29296 type_name,
29297 identifier,
29298 parm_attr));
29301 }
29304 {
29307 }
29309 /* We allow tail attributes for the method. */
29311 {
29319 }
29322 {
29325 }
29327 }
29329 /* Parse the non-keyword Objective-C params. */
29331 static tree
29334 {
29340 {
29342 tree parm;
29348 {
29353 }
29355 /* TODO: parse attributes for tail parameters. */
29364 }
29366 /* We allow tail attributes for the method. */
29368 {
29370 {
29375 }
29376 else
29377 /* We have an error, but parse the attributes, so that we can
29378 carry on. */
29384 }
29387 }
29389 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29391 static void
29393 {
29396 /* If the next token is `extern' and the following token is a string
29397 literal, then we have a linkage specification. */
29399 && cp_parser_is_pure_string_literal
29402 /* Handle #pragma, if any. */
29405 /* Allow stray semicolons. */
29408 /* Mark methods as optional or required, when building protocols. */
29410 {
29413 }
29415 {
29418 }
29421 /* Other stray characters must generate errors. */
29423 {
29427 }
29428 /* Finally, try to parse a block-declaration, or a function-definition. */
29429 else
29431 }
29433 /* Parse a method signature. */
29435 static tree
29437 {
29453 }
29455 static bool
29457 {
29458 tree tattr;
29463 /* If the attributes are followed by a method introducer, this is not allowed.
29464 Dump the attributes and flag the situation. */
29469 /* Otherwise, the attributes introduce some interstitial code, possibly so
29470 rewind to allow that check. */
29473 }
29475 /* Parse an Objective-C method prototype list. */
29477 static void
29479 {
29483 {
29485 {
29490 else
29494 {
29498 }
29501 }
29507 OPT_Wattributes,
29509 else
29510 /* Allow for interspersed non-ObjC++ code. */
29514 }
29518 else
29522 }
29524 /* Parse an Objective-C method definition list. */
29526 static void
29528 {
29532 {
29533 tree meth;
29536 {
29542 else
29547 {
29551 }
29553 NULL_TREE);
29555 /* For historical reasons, we accept an optional semicolon. */
29562 {
29569 }
29570 }
29571 /* The following case will be removed once @synthesize is
29572 completely implemented. */
29583 else
29584 /* Allow for interspersed non-ObjC++ code. */
29588 }
29592 else
29596 }
29598 /* Parse Objective-C ivars. */
29600 static void
29602 {
29613 {
29614 cp_decl_specifier_seq declspecs;
29616 tree prefix_attributes;
29624 CP_PARSER_FLAGS_OPTIONAL,
29628 /* auto, register, static, extern, mutable. */
29630 {
29633 }
29635 /* thread_local. */
29637 {
29640 }
29642 /* typedef. */
29644 {
29647 }
29652 /* Keep going until we hit the `;' at the end of the
29653 declaration. */
29655 {
29660 /* Check for a (possibly unnamed) bitfield declaration. */
29668 {
29669 /* Get the name of the bitfield. */
29672 sfk_none);
29674 eat_colon:
29676 /* Get the width of the bitfield. */
29677 width
29679 }
29680 else
29681 {
29682 /* Parse the declarator. */
29683 declarator
29689 }
29691 /* Look for attributes that apply to the ivar. */
29693 /* Remember which attributes are prefix attributes and
29694 which are not. */
29696 /* Combine the attributes. */
29700 /* Create the bitfield declaration. */
29702 width,
29703 attributes);
29704 else
29709 /* Add the instance variable. */
29713 /* Reset PREFIX_ATTRIBUTES. */
29722 {
29725 }
29727 }
29731 }
29736 /* Do not consume the RID_AT_END, so it will be read again as terminating
29737 the @interface of @implementation. */
29741 /* For historical reasons, we accept an optional semicolon. */
29744 }
29746 /* Parse an Objective-C protocol declaration. */
29748 static void
29750 {
29756 {
29761 }
29763 /* See if we have a forward declaration or a definition. */
29766 /* Try a forward declaration first. */
29768 {
29770 {
29771 tree id;
29781 else
29783 }
29785 }
29787 /* Ok, we got a full-fledged definition (or at least should). */
29788 else
29789 {
29794 }
29795 }
29797 /* Parse an Objective-C superclass or category. */
29799 static void
29804 {
29810 {
29813 }
29815 {
29818 /* If there is no category name, and this is an @interface, we
29819 have a class extension. */
29821 {
29824 }
29825 else
29829 }
29830 }
29832 /* Parse an Objective-C class interface. */
29834 static void
29836 {
29843 {
29844 /* It's hard to recover because even if valid @interface stuff
29845 is to follow, we can't compile it (or validate it) if we
29846 don't even know which class it refers to. Let's assume this
29847 was a stray '@interface' token in the stream and skip it.
29848 */
29850 }
29855 /* We have either a class or a category on our hands. */
29858 else
29859 {
29861 /* Handle instance variable declarations, if any. */
29864 }
29867 }
29869 /* Parse an Objective-C class implementation. */
29871 static void
29873 {
29880 {
29881 /* It's hard to recover because even if valid @implementation
29882 stuff is to follow, we can't compile it (or validate it) if
29883 we don't even know which class it refers to. Let's assume
29884 this was a stray '@implementation' token in the stream and
29885 skip it.
29886 */
29888 }
29892 /* We have either a class or a category on our hands. */
29895 else
29896 {
29898 /* Handle instance variable declarations, if any. */
29901 }
29904 }
29906 /* Consume the @end token and finish off the implementation. */
29908 static void
29910 {
29913 }
29915 /* Parse an Objective-C declaration. */
29917 static void
29919 {
29920 /* Try to figure out what kind of declaration is present. */
29925 {
29941 }
29944 {
29967 }
29968 }
29970 /* Parse an Objective-C try-catch-finally statement.
29972 objc-try-catch-finally-stmt:
29973 @try compound-statement objc-catch-clause-seq [opt]
29974 objc-finally-clause [opt]
29976 objc-catch-clause-seq:
29977 objc-catch-clause objc-catch-clause-seq [opt]
29979 objc-catch-clause:
29980 @catch ( objc-exception-declaration ) compound-statement
29982 objc-finally-clause:
29983 @finally compound-statement
29985 objc-exception-declaration:
29986 parameter-declaration
29987 '...'
29989 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29991 Returns NULL_TREE.
29993 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29994 for C. Keep them in sync. */
29996 static tree
29998 {
29999 location_t location;
30000 tree stmt;
30005 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30006 node, lest it get absorbed into the surrounding block. */
30012 {
30021 {
30022 /* We have "@catch (...)" (where the '...' are literally
30023 what is in the code). Skip the '...'.
30024 parameter_declaration is set to NULL_TREE, and
30025 objc_being_catch_clauses() knows that that means
30026 '...'. */
30029 }
30030 else
30031 {
30032 /* We have "@catch (NSException *exception)" or something
30033 like that. Parse the parameter declaration. */
30037 else
30042 }
30045 else
30046 {
30047 /* If there was no open parenthesis, we are recovering from
30048 an error, and we are trying to figure out what mistake
30049 the user has made. */
30051 /* If there is an immediate closing parenthesis, the user
30052 probably forgot the opening one (ie, they typed "@catch
30053 NSException *e)". Parse the closing parenthesis and keep
30054 going. */
30058 /* If these is no immediate closing parenthesis, the user
30059 probably doesn't know that parenthesis are required at
30060 all (ie, they typed "@catch NSException *e"). So, just
30061 forget about the closing parenthesis and keep going. */
30062 }
30066 }
30068 {
30071 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30072 node, lest it get absorbed into the surrounding block. */
30076 }
30079 }
30081 /* Parse an Objective-C synchronized statement.
30083 objc-synchronized-stmt:
30084 @synchronized ( expression ) compound-statement
30086 Returns NULL_TREE. */
30088 static tree
30090 {
30091 location_t location;
30102 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30103 node, lest it get absorbed into the surrounding block. */
30108 }
30110 /* Parse an Objective-C throw statement.
30112 objc-throw-stmt:
30113 @throw assignment-expression [opt] ;
30115 Returns a constructed '@throw' statement. */
30117 static tree
30119 {
30131 }
30133 /* Parse an Objective-C statement. */
30135 static tree
30137 {
30138 /* Try to figure out what kind of declaration is present. */
30142 {
30153 }
30156 }
30158 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30159 look ahead to see if an objc keyword follows the attributes. This
30160 is to detect the use of prefix attributes on ObjC @interface and
30161 @protocol. */
30163 static bool
30165 {
30170 {
30173 }
30176 }
30178 /* This routine is a minimal replacement for
30179 c_parser_struct_declaration () used when parsing the list of
30180 types/names or ObjC++ properties. For example, when parsing the
30181 code
30183 @property (readonly) int a, b, c;
30185 this function is responsible for parsing "int a, int b, int c" and
30186 returning the declarations as CHAIN of DECLs.
30188 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30189 similar parsing. */
30190 static tree
30192 {
30194 cp_decl_specifier_seq declspecs;
30196 tree prefix_attributes;
30199 CP_PARSER_FLAGS_NONE,
30206 /* auto, register, static, extern, mutable. */
30208 {
30211 }
30213 /* thread_local. */
30215 {
30218 }
30220 /* typedef. */
30222 {
30225 }
30230 /* Keep going until we hit the `;' at the end of the declaration. */
30232 {
30237 /* Parse the declarator. */
30241 /* Look for attributes that apply to the ivar. */
30243 /* Remember which attributes are prefix attributes and
30244 which are not. */
30246 /* Combine the attributes. */
30256 /* Reset PREFIX_ATTRIBUTES. */
30267 {
30270 }
30271 else
30273 }
30275 }
30277 /* Parse an Objective-C @property declaration. The syntax is:
30279 objc-property-declaration:
30280 '@property' objc-property-attributes[opt] struct-declaration ;
30282 objc-property-attributes:
30283 '(' objc-property-attribute-list ')'
30285 objc-property-attribute-list:
30286 objc-property-attribute
30287 objc-property-attribute-list, objc-property-attribute
30289 objc-property-attribute
30290 'getter' = identifier
30291 'setter' = identifier
30292 'readonly'
30293 'readwrite'
30294 'assign'
30295 'retain'
30296 'copy'
30297 'nonatomic'
30299 For example:
30300 @property NSString *name;
30301 @property (readonly) id object;
30302 @property (retain, nonatomic, getter=getTheName) id name;
30303 @property int a, b, c;
30305 PS: This function is identical to
30306 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30307 static void
30309 {
30310 /* The following variables hold the attributes of the properties as
30311 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30312 seen. When we see an attribute, we set them to 'true' (if they
30313 are boolean properties) or to the identifier (if they have an
30314 argument, ie, for getter and setter). Note that here we only
30315 parse the list of attributes, check the syntax and accumulate the
30316 attributes that we find. objc_add_property_declaration() will
30317 then process the information. */
30327 /* 'properties' is the list of properties that we read. Usually a
30328 single one, but maybe more (eg, in "@property int a, b, c;" there
30329 are three). */
30330 tree properties;
30331 location_t loc;
30337 /* Parse the optional attribute list... */
30339 {
30340 /* Eat the '('. */
30344 {
30350 {
30353 }
30357 {
30368 {
30372 else
30377 }
30380 {
30384 }
30386 {
30388 {
30391 }
30392 else
30396 else
30398 }
30399 else
30400 {
30402 {
30405 }
30406 else
30408 }
30414 }
30421 else
30423 }
30425 /* FIXME: "@property (setter, assign);" will generate a spurious
30426 "error: expected ‘)’ before ‘,’ token". This is because
30427 cp_parser_require, unlike the C counterpart, will produce an
30428 error even if we are in error recovery. */
30430 {
30435 }
30436 }
30438 /* ... and the property declaration(s). */
30442 {
30444 /* If the next token is now a `;', consume it. */
30448 }
30452 else
30453 {
30454 /* Comma-separated properties are chained together in
30455 reverse order; add them one by one. */
30464 }
30467 }
30469 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30471 objc-synthesize-declaration:
30472 @synthesize objc-synthesize-identifier-list ;
30474 objc-synthesize-identifier-list:
30475 objc-synthesize-identifier
30476 objc-synthesize-identifier-list, objc-synthesize-identifier
30478 objc-synthesize-identifier
30479 identifier
30480 identifier = identifier
30482 For example:
30483 @synthesize MyProperty;
30484 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30486 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30487 for C. Keep them in sync.
30488 */
30489 static void
30491 {
30493 location_t loc;
30498 {
30502 {
30505 }
30507 {
30511 {
30514 }
30515 }
30516 else
30521 else
30523 }
30526 }
30528 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30530 objc-dynamic-declaration:
30531 @dynamic identifier-list ;
30533 For example:
30534 @dynamic MyProperty;
30535 @dynamic MyProperty, AnotherProperty;
30537 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30538 for C. Keep them in sync.
30539 */
30540 static void
30542 {
30544 location_t loc;
30549 {
30550 tree property;
30553 {
30556 }
30560 else
30562 }
30565 }
30567 \f
30568 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30570 /* Returns name of the next clause.
30571 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30572 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30573 returned and the token is consumed. */
30575 static pragma_omp_clause
30577 {
30593 {
30598 {
30781 }
30782 }
30788 }
30790 /* Validate that a clause of the given type does not already exist. */
30792 static void
30795 {
30796 tree c;
30800 {
30803 }
30804 }
30806 /* OpenMP 2.5:
30807 variable-list:
30808 identifier
30809 variable-list , identifier
30811 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30812 colon). An opening parenthesis will have been consumed by the caller.
30814 If KIND is nonzero, create the appropriate node and install the decl
30815 in OMP_CLAUSE_DECL and add the node to the head of the list.
30817 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30818 return the list created.
30820 COLON can be NULL if only closing parenthesis should end the list,
30821 or pointer to bool which will receive false if the list is terminated
30822 by closing parenthesis or true if the list is terminated by colon. */
30824 static tree
30827 {
30831 {
30834 }
30836 {
30841 && current_class_ptr
30843 {
30849 }
30850 else
30851 {
30864 }
30866 ;
30868 {
30870 {
30872 /* The OpenACC cache directive explicitly only allows "array
30873 elements or subarrays". */
30875 {
30879 }
30880 /* FALLTHROUGH. */
30885 {
30886 location_t loc
30891 decl
30895 }
30896 /* FALLTHROUGH. */
30900 {
30908 parser->colon_corrects_to_scope_p
30912 else
30913 {
30914 /* Look for `:'. */
30918 CPP_CLOSE_SQUARE))
30920 }
30921 /* Look for the closing `]'. */
30923 RT_CLOSE_SQUARE))
30927 }
30931 }
30937 }
30938 else
30941 get_comma:
30945 }
30951 {
30955 }
30958 {
30961 /* Try to resync to an unnested comma. Copied from
30962 cp_parser_parenthesized_expression_list. */
30963 skip_comma:
30972 }
30975 }
30977 /* Similarly, but expect leading and trailing parenthesis. This is a very
30978 common case for omp clauses. */
30980 static tree
30982 {
30986 }
30988 /* OpenACC 2.0:
30989 copy ( variable-list )
30990 copyin ( variable-list )
30991 copyout ( variable-list )
30992 create ( variable-list )
30993 delete ( variable-list )
30994 present ( variable-list )
30995 present_or_copy ( variable-list )
30996 pcopy ( variable-list )
30997 present_or_copyin ( variable-list )
30998 pcopyin ( variable-list )
30999 present_or_copyout ( variable-list )
31000 pcopyout ( variable-list )
31001 present_or_create ( variable-list )
31002 pcreate ( variable-list ) */
31004 static tree
31006 tree list)
31007 {
31010 {
31056 }
31064 }
31066 /* OpenACC 2.0:
31067 deviceptr ( variable-list ) */
31069 static tree
31071 {
31075 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31076 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31077 variable-list must only allow for pointer variables. */
31080 {
31087 }
31090 }
31092 /* OpenACC 2.0:
31093 auto
31094 independent
31095 nohost
31096 seq */
31098 static tree
31102 {
31107 }
31109 /* OpenACC:
31110 num_gangs ( expression )
31111 num_workers ( expression )
31112 vector_length ( expression ) */
31114 static tree
31117 {
31127 {
31132 }
31140 }
31142 /* OpenACC:
31144 gang [( gang-arg-list )]
31145 worker [( [num:] int-expr )]
31146 vector [( [length:] int-expr )]
31148 where gang-arg is one of:
31150 [num:] int-expr
31151 static: size-expr
31153 and size-expr may be:
31155 *
31156 int-expr
31157 */
31159 static tree
31162 {
31172 {
31175 do
31176 {
31180 /* Gang static argument. */
31183 {
31191 {
31194 }
31196 /* Check for the '*' argument. */
31200 CPP_CLOSE_PAREN)))
31201 {
31206 {
31209 }
31211 }
31212 }
31213 /* Worker num: argument and vector length: arguments. */
31217 {
31220 }
31222 /* Now collect the actual argument. */
31224 {
31227 }
31239 {
31242 }
31244 }
31249 }
31263 cleanup_error:
31266 }
31268 /* OpenACC 2.0:
31269 tile ( size-expr-list ) */
31271 static tree
31273 {
31277 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31278 so, but the spec authors never considered such a case and have
31279 differing opinions on what it might mean, including 'not
31280 allowed'.) */
31283 clause_loc);
31288 do
31289 {
31296 {
31299 }
31300 else
31304 }
31307 /* Consume the trailing ')'. */
31315 }
31317 /* OpenACC 2.0
31318 Parse wait clause or directive parameters. */
31320 static tree
31322 {
31332 {
31337 }
31344 {
31348 {
31351 else
31352 {
31359 }
31360 }
31361 }
31364 }
31366 /* OpenACC:
31367 wait ( int-expr-list ) */
31369 static tree
31371 {
31380 }
31382 /* OpenMP 3.0:
31383 collapse ( constant-expression ) */
31385 static tree
31387 {
31389 location_t loc;
31390 HOST_WIDE_INT n;
31410 {
31413 }
31422 }
31424 /* OpenMP 2.5:
31425 default ( shared | none )
31427 OpenACC 2.0
31428 default (none) */
31430 static tree
31433 {
31435 tree c;
31440 {
31445 {
31460 }
31463 }
31464 else
31465 {
31466 invalid_kind:
31469 else
31471 }
31487 }
31489 /* OpenMP 3.1:
31490 final ( expression ) */
31492 static tree
31494 {
31515 }
31517 /* OpenMP 2.5:
31518 if ( expression )
31520 OpenMP 4.5:
31521 if ( directive-name-modifier : expression )
31523 directive-name-modifier:
31524 parallel | task | taskloop | target data | target | target update
31525 | target enter data | target exit data */
31527 static tree
31530 {
31538 {
31550 {
31553 {
31566 else
31567 {
31568 location_t loc
31573 }
31576 {
31578 {
31583 }
31585 {
31586 location_t loc
31590 }
31591 }
31592 }
31593 }
31595 {
31597 {
31600 }
31601 else
31602 {
31604 {
31605 location_t loc
31608 }
31610 }
31611 }
31612 }
31624 {
31627 {
31630 {
31640 }
31642 p);
31644 }
31646 {
31649 else
31652 }
31655 {
31659 }
31660 }
31668 }
31670 /* OpenMP 3.1:
31671 mergeable */
31673 static tree
31676 {
31677 tree c;
31680 location);
31685 }
31687 /* OpenMP 2.5:
31688 nowait */
31690 static tree
31693 {
31694 tree c;
31701 }
31703 /* OpenMP 2.5:
31704 num_threads ( expression ) */
31706 static tree
31708 location_t location)
31709 {
31731 }
31733 /* OpenMP 4.5:
31734 num_tasks ( expression ) */
31736 static tree
31738 location_t location)
31739 {
31761 }
31763 /* OpenMP 4.5:
31764 grainsize ( expression ) */
31766 static tree
31768 location_t location)
31769 {
31791 }
31793 /* OpenMP 4.5:
31794 priority ( expression ) */
31796 static tree
31798 location_t location)
31799 {
31821 }
31823 /* OpenMP 4.5:
31824 hint ( expression ) */
31826 static tree
31828 location_t location)
31829 {
31850 }
31852 /* OpenMP 4.5:
31853 defaultmap ( tofrom : scalar ) */
31855 static tree
31857 location_t location)
31858 {
31866 {
31869 }
31873 {
31876 }
31882 {
31885 }
31889 {
31892 }
31898 location);
31904 out_err:
31909 }
31911 /* OpenMP 2.5:
31912 ordered
31914 OpenMP 4.5:
31915 ordered ( constant-expression ) */
31917 static tree
31920 {
31922 HOST_WIDE_INT n;
31928 {
31945 {
31947 "ordered argument needs positive constant integer "
31950 }
31951 }
31957 }
31959 /* OpenMP 2.5:
31960 reduction ( reduction-operator : variable-list )
31962 reduction-operator:
31963 One of: + * - & ^ | && ||
31965 OpenMP 3.1:
31967 reduction-operator:
31968 One of: + * - & ^ | && || min max
31970 OpenMP 4.0:
31972 reduction-operator:
31973 One of: + * - & ^ | && ||
31974 id-expression */
31976 static tree
31978 {
31986 {
31996 }
32000 else
32001 {
32012 {
32042 }
32043 else
32044 {
32046 resync_fail:
32051 }
32052 }
32058 NULL);
32060 {
32063 }
32066 }
32068 /* OpenMP 2.5:
32069 schedule ( schedule-kind )
32070 schedule ( schedule-kind , expression )
32072 schedule-kind:
32073 static | dynamic | guided | runtime | auto
32075 OpenMP 4.5:
32076 schedule ( schedule-modifier : schedule-kind )
32077 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32079 schedule-modifier:
32080 simd
32081 monotonic
32082 nonmonotonic */
32084 static tree
32086 {
32096 {
32105 else
32111 else
32112 {
32115 }
32116 }
32119 {
32124 {
32145 }
32146 }
32151 else
32157 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32159 {
32163 }
32166 {
32181 else
32186 }
32198 invalid_kind:
32200 resync_fail:
32205 }
32207 /* OpenMP 3.0:
32208 untied */
32210 static tree
32213 {
32214 tree c;
32221 }
32223 /* OpenMP 4.0:
32224 inbranch
32225 notinbranch */
32227 static tree
32230 {
32235 }
32237 /* OpenMP 4.0:
32238 parallel
32239 for
32240 sections
32241 taskgroup */
32243 static tree
32247 {
32251 }
32253 /* OpenMP 4.5:
32254 nogroup */
32256 static tree
32259 {
32264 }
32266 /* OpenMP 4.5:
32267 simd
32268 threads */
32270 static tree
32274 {
32279 }
32281 /* OpenMP 4.0:
32282 num_teams ( expression ) */
32284 static tree
32286 location_t location)
32287 {
32309 }
32311 /* OpenMP 4.0:
32312 thread_limit ( expression ) */
32314 static tree
32316 location_t location)
32317 {
32339 }
32341 /* OpenMP 4.0:
32342 aligned ( variable-list )
32343 aligned ( variable-list : constant-expression ) */
32345 static tree
32347 {
32358 {
32368 }
32374 }
32376 /* OpenMP 4.0:
32377 linear ( variable-list )
32378 linear ( variable-list : expression )
32380 OpenMP 4.5:
32381 linear ( modifier ( variable-list ) )
32382 linear ( modifier ( variable-list ) : expression ) */
32384 static tree
32387 {
32397 {
32409 else
32411 }
32416 else
32417 {
32426 }
32429 {
32434 {
32445 {
32448 }
32451 }
32456 {
32459 }
32467 }
32470 {
32473 }
32476 }
32478 /* OpenMP 4.0:
32479 safelen ( constant-expression ) */
32481 static tree
32483 location_t location)
32484 {
32505 }
32507 /* OpenMP 4.0:
32508 simdlen ( constant-expression ) */
32510 static tree
32512 location_t location)
32513 {
32534 }
32536 /* OpenMP 4.5:
32537 vec:
32538 identifier [+/- integer]
32539 vec , identifier [+/- integer]
32540 */
32542 static tree
32544 tree list)
32545 {
32549 {
32552 }
32555 {
32562 else
32563 {
32564 t = cp_parser_lookup_name_simple
32569 id_loc);
32570 }
32576 {
32579 }
32583 {
32586 }
32590 {
32593 }
32596 add_to_vector:
32598 {
32602 }
32608 }
32611 {
32617 }
32619 }
32621 /* OpenMP 4.0:
32622 depend ( depend-kind : variable-list )
32624 depend-kind:
32625 in | out | inout
32627 OpenMP 4.5:
32628 depend ( source )
32630 depend ( sink : vec ) */
32632 static tree
32634 {
32642 {
32656 else
32658 }
32659 else
32665 {
32675 }
32682 else
32683 {
32689 }
32692 invalid_kind:
32694 resync_fail:
32699 }
32701 /* OpenMP 4.0:
32702 map ( map-kind : variable-list )
32703 map ( variable-list )
32705 map-kind:
32706 alloc | to | from | tofrom
32708 OpenMP 4.5:
32709 map-kind:
32710 alloc | to | from | tofrom | release | delete
32712 map ( always [,] map-kind: variable-list ) */
32714 static tree
32716 {
32725 {
32730 {
32733 nth++;
32739 {
32744 }
32745 }
32746 }
32750 {
32764 else
32765 {
32771 }
32774 }
32777 {
32781 }
32784 NULL);
32790 }
32792 /* OpenMP 4.0:
32793 device ( expression ) */
32795 static tree
32797 location_t location)
32798 {
32820 }
32822 /* OpenMP 4.0:
32823 dist_schedule ( static )
32824 dist_schedule ( static , expression ) */
32826 static tree
32828 location_t location)
32829 {
32842 {
32853 }
32858 location);
32862 invalid_kind:
32864 resync_fail:
32869 }
32871 /* OpenMP 4.0:
32872 proc_bind ( proc-bind-kind )
32874 proc-bind-kind:
32875 master | close | spread */
32877 static tree
32879 location_t location)
32880 {
32881 tree c;
32888 {
32898 else
32900 }
32901 else
32910 location);
32915 invalid_kind:
32917 resync_fail:
32922 }
32924 /* OpenACC:
32925 async [( int-expr )] */
32927 static tree
32929 {
32936 {
32945 }
32955 }
32957 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32958 is a bitmask in MASK. Return the list of clauses found. */
32960 static tree
32964 {
32969 {
32970 location_t here;
32971 pragma_omp_clause c_kind;
32972 omp_clause_code code;
32983 {
33035 clauses);
33053 OMP_CLAUSE_INDEPENDENT,
33065 clauses);
33071 clauses);
33095 clauses);
33117 clauses);
33129 clauses);
33143 }
33148 {
33149 /* Remove the invalid clause(s) from the list to avoid
33150 confusing the rest of the compiler. */
33153 }
33154 }
33156 saw_error:
33163 }
33165 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33166 is a bitmask in MASK. Return the list of clauses found; the result
33167 of clause default goes in *pdefault. */
33169 static tree
33173 {
33179 {
33180 pragma_omp_clause c_kind;
33191 {
33203 clauses);
33217 clauses);
33237 clauses);
33242 clauses);
33252 clauses);
33286 clauses);
33300 clauses);
33317 OMP_CLAUSE_NOTINBRANCH,
33326 {
33327 clause_not_first:
33331 }
33361 clauses);
33362 else
33372 clauses);
33390 {
33398 }
33441 clauses
33447 clauses
33459 }
33464 {
33465 /* Remove the invalid clause(s) from the list to avoid
33466 confusing the rest of the compiler. */
33469 }
33470 }
33471 saw_error:
33472 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33473 no reason to skip to the end. */
33477 {
33480 else
33482 }
33484 }
33486 /* OpenMP 2.5:
33487 structured-block:
33488 statement
33490 In practice, we're also interested in adding the statement to an
33491 outer node. So it is convenient if we work around the fact that
33492 cp_parser_statement calls add_stmt. */
33494 static unsigned
33496 {
33499 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33500 This preserves the "not within loop or switch" style error messages
33501 for nonsense cases like
33502 void foo() {
33503 #pragma omp single
33504 break;
33505 }
33506 */
33511 }
33513 static void
33515 {
33517 }
33519 static tree
33521 {
33529 }
33531 /* OpenMP 2.5:
33532 # pragma omp atomic new-line
33533 expression-stmt
33535 expression-stmt:
33536 x binop= expr | x++ | ++x | x-- | --x
33537 binop:
33538 +, *, -, /, &, ^, |, <<, >>
33540 where x is an lvalue expression with scalar type.
33542 OpenMP 3.1:
33543 # pragma omp atomic new-line
33544 update-stmt
33546 # pragma omp atomic read new-line
33547 read-stmt
33549 # pragma omp atomic write new-line
33550 write-stmt
33552 # pragma omp atomic update new-line
33553 update-stmt
33555 # pragma omp atomic capture new-line
33556 capture-stmt
33558 # pragma omp atomic capture new-line
33559 capture-block
33561 read-stmt:
33562 v = x
33563 write-stmt:
33564 x = expr
33565 update-stmt:
33566 expression-stmt | x = x binop expr
33567 capture-stmt:
33568 v = expression-stmt
33569 capture-block:
33570 { v = x; update-stmt; } | { update-stmt; v = x; }
33572 OpenMP 4.0:
33573 update-stmt:
33574 expression-stmt | x = x binop expr | x = expr binop x
33575 capture-stmt:
33576 v = update-stmt
33577 capture-block:
33578 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33580 where x and v are lvalue expressions with scalar type. */
33582 static void
33584 {
33592 {
33597 {
33603 }
33604 }
33606 {
33618 else
33622 }
33624 {
33630 {
33635 {
33638 }
33639 }
33640 }
33644 {
33654 else
33659 {
33660 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33661 opcode. */
33666 }
33670 {
33673 }
33674 else
33675 {
33681 }
33684 }
33686 restart:
33690 {
33697 /* FALLTHROUGH */
33707 /* FALLTHROUGH */
33722 /* Undo effects of boolean_increment for post {in,de}crement. */
33724 /* FALLTHRU */
33728 {
33729 /* Undo effects of boolean_increment. */
33731 {
33732 /* This is pre or post increment. */
33737 && !structured_block
33741 }
33742 }
33743 /* FALLTHRU */
33746 {
33781 {
33785 }
33788 {
33794 {
33799 }
33801 {
33813 {
33815 {
33820 }
33821 else
33823 }
33827 }
33830 {
33837 }
33841 }
33845 {
33848 {
33856 }
33858 {
33863 }
33898 }
33909 /* FALLTHROUGH */
33914 }
33921 }
33922 stmt_done:
33924 {
33935 }
33937 {
33940 }
33941 done:
33947 saw_error:
33950 {
33954 {
33958 }
33959 }
33960 }
33963 /* OpenMP 2.5:
33964 # pragma omp barrier new-line */
33966 static void
33968 {
33971 }
33973 /* OpenMP 2.5:
33974 # pragma omp critical [(name)] new-line
33975 structured-block
33977 OpenMP 4.5:
33978 # pragma omp critical [(name) [hint(expression)]] new-line
33979 structured-block */
33981 #define OMP_CRITICAL_CLAUSE_MASK \
33982 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33984 static tree
33986 {
33990 {
34004 OMP_CRITICAL_CLAUSE_MASK,
34006 }
34007 else
34012 }
34014 /* OpenMP 2.5:
34015 # pragma omp flush flush-vars[opt] new-line
34017 flush-vars:
34018 ( variable-list ) */
34020 static void
34022 {
34028 }
34030 /* Helper function, to parse omp for increment expression. */
34032 static tree
34034 {
34039 {
34042 }
34045 {
34054 /* Fall through: OpenMP disallows NE_EXPR. */
34058 }
34060 /* If decl is an iterator, preserve LHS and RHS of the relational
34061 expr until finish_omp_for. */
34072 }
34074 /* Helper function, to parse omp for increment expression. */
34076 static tree
34078 {
34082 cp_id_kind idk;
34086 {
34095 }
34104 {
34109 }
34116 {
34120 }
34133 do
34134 {
34141 {
34143 {
34146 else
34148 tf_warning_or_error);
34149 }
34150 else
34153 }
34154 }
34158 {
34164 }
34165 else
34169 }
34171 /* Parse the initialization statement of either an OpenMP for loop or
34172 a Cilk Plus for loop.
34174 Return true if the resulting construct should have an
34175 OMP_CLAUSE_PRIVATE added to it. */
34177 static tree
34186 {
34192 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34194 init-expr:
34195 var = lb
34196 integer-type var = lb
34197 random-access-iterator-type var = lb
34198 pointer-type var = lb
34199 */
34200 cp_decl_specifier_seq type_specifiers;
34202 /* First, try to parse as an initialized declaration. See
34203 cp_parser_condition, from whence the bulk of this is copied. */
34210 {
34211 /* If parsing a type specifier seq succeeded, then this
34212 MUST be a initialized declaration. */
34217 CP_PARSER_DECLARATOR_NAMED,
34228 else
34229 {
34239 {
34241 CPP_OPEN_PAREN))
34242 {
34246 else
34249 }
34250 else
34251 /* Trigger an error. */
34256 }
34260 {
34268 {
34271 auto_node);
34276 }
34279 asm_specification,
34280 LOOKUP_ONLYCONVERTING);
34283 {
34286 }
34287 else
34288 {
34291 {
34293 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34295 {
34299 {
34303 }
34305 }
34307 {
34312 }
34313 }
34314 }
34316 }
34317 else
34318 {
34319 /* Consume '='. */
34323 non_class:
34326 else
34329 asm_specification,
34330 LOOKUP_ONLYCONVERTING);
34331 }
34335 }
34336 }
34337 else
34338 {
34339 cp_id_kind idk;
34340 /* If parsing a type specifier sequence failed, then
34341 this MUST be a simple expression. */
34350 && decl
34353 {
34364 {
34369 }
34374 }
34376 && decl
34379 {
34380 tree rhs;
34388 rhs,
34389 tf_warning_or_error));
34392 }
34393 else
34394 {
34399 {
34403 }
34404 }
34405 }
34407 }
34409 /* Parse the restricted form of the for statement allowed by OpenMP. */
34411 static tree
34414 {
34418 location_t loc_first;
34429 {
34432 }
34435 {
34438 }
34441 {
34447 }
34449 {
34452 {
34454 "%<linear%> clause may not be specified together "
34457 }
34458 else
34460 }
34473 {
34476 location_t loc;
34480 {
34484 }
34487 {
34491 }
34500 add_private_clause
34507 {
34510 {
34516 }
34517 else
34519 }
34526 {
34531 {
34535 }
34538 {
34539 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34543 {
34546 }
34547 else
34548 {
34551 }
34553 }
34554 else
34555 {
34560 }
34561 }
34564 {
34565 tree c;
34567 {
34576 decl);
34580 decl);
34581 }
34583 {
34588 else
34593 {
34596 /* For linear, signal that we need to fill up
34597 the so far unknown linear step. */
34600 }
34601 }
34602 }
34611 {
34612 /* If decl is an iterator, preserve the operator on decl
34613 until finish_omp_for. */
34615 && ((processing_template_decl
34620 else
34624 }
34636 {
34639 }
34644 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34645 in between the collapsed for loops to be still considered perfectly
34646 nested. Hopefully the final version clarifies this.
34647 For now handle (multiple) {'s and empty statements. */
34650 {
34654 {
34656 bracecount++;
34657 }
34661 else
34662 {
34669 }
34670 }
34673 {
34676 }
34677 }
34682 /* Note that we saved the original contents of this flag when we entered
34683 the structured block, and so we don't need to re-save it here. */
34686 else
34689 /* Note that the grammar doesn't call for a structured block here,
34690 though the loop as a whole is a structured block. */
34697 else
34702 {
34704 {
34706 nbraces--;
34707 }
34710 else
34711 {
34713 {
34716 }
34721 }
34722 }
34725 {
34729 else
34731 }
34735 }
34737 /* Helper function for OpenMP parsing, split clauses and call
34738 finish_omp_clauses on each of the set of clauses afterwards. */
34740 static void
34743 {
34749 }
34751 /* OpenMP 4.0:
34752 #pragma omp simd simd-clause[optseq] new-line
34753 for-loop */
34755 #define OMP_SIMD_CLAUSE_MASK \
34756 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34765 static tree
34769 {
34780 {
34784 OMP_CLAUSE_ORDERED);
34786 {
34788 "%<ordered%> clause with parameter may not be specified "
34791 }
34792 }
34803 }
34805 /* OpenMP 2.5:
34806 #pragma omp for for-clause[optseq] new-line
34807 for-loop
34809 OpenMP 4.0:
34810 #pragma omp for simd for-simd-clause[optseq] new-line
34811 for-loop */
34813 #define OMP_FOR_CLAUSE_MASK \
34814 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34824 static tree
34828 {
34835 /* parallel for{, simd} disallows nowait clause, but for
34836 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34839 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34844 {
34849 {
34873 }
34874 }
34876 {
34879 }
34881 /* Composite distribute parallel for disallows linear clause. */
34888 {
34891 }
34902 }
34904 /* OpenMP 2.5:
34905 # pragma omp master new-line
34906 structured-block */
34908 static tree
34910 {
34914 }
34916 /* OpenMP 2.5:
34917 # pragma omp ordered new-line
34918 structured-block
34920 OpenMP 4.5:
34921 # pragma omp ordered ordered-clauses new-line
34922 structured-block */
34924 #define OMP_ORDERED_CLAUSE_MASK \
34925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34928 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34929 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34931 static bool
34934 {
34938 {
34943 {
34945 {
34947 "%<depend%> clause may only be used in compound "
34951 }
34952 tree clauses
34954 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34958 }
34959 }
34961 tree clauses
34967 }
34969 /* OpenMP 2.5:
34971 section-scope:
34972 { section-sequence }
34974 section-sequence:
34975 section-directive[opt] structured-block
34976 section-sequence section-directive structured-block */
34978 static tree
34980 {
34992 {
34996 }
34999 {
35007 {
35011 }
35013 {
35016 }
35021 }
35032 }
35034 /* OpenMP 2.5:
35035 # pragma omp sections sections-clause[optseq] newline
35036 sections-scope */
35038 #define OMP_SECTIONS_CLAUSE_MASK \
35039 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35045 static tree
35048 {
35060 {
35063 }
35070 }
35072 /* OpenMP 2.5:
35073 # pragma omp parallel parallel-clause[optseq] new-line
35074 structured-block
35075 # pragma omp parallel for parallel-for-clause[optseq] new-line
35076 structured-block
35077 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35078 structured-block
35080 OpenMP 4.0:
35081 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35082 structured-block */
35084 #define OMP_PARALLEL_CLAUSE_MASK \
35085 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35095 static tree
35099 {
35106 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35112 {
35120 if_p);
35124 if_p);
35127 block);
35132 }
35133 /* When combined with distribute, parallel has to be followed by for.
35134 #pragma omp target parallel is allowed though. */
35138 {
35142 }
35144 {
35147 }
35149 {
35153 {
35163 block);
35166 }
35167 }
35172 {
35175 }
35183 }
35185 /* OpenMP 2.5:
35186 # pragma omp single single-clause[optseq] new-line
35187 structured-block */
35189 #define OMP_SINGLE_CLAUSE_MASK \
35190 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35195 static tree
35197 {
35207 }
35209 /* OpenMP 3.0:
35210 # pragma omp task task-clause[optseq] new-line
35211 structured-block */
35213 #define OMP_TASK_CLAUSE_MASK \
35214 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35225 static tree
35227 {
35238 }
35240 /* OpenMP 3.0:
35241 # pragma omp taskwait new-line */
35243 static void
35245 {
35248 }
35250 /* OpenMP 3.1:
35251 # pragma omp taskyield new-line */
35253 static void
35255 {
35258 }
35260 /* OpenMP 4.0:
35261 # pragma omp taskgroup new-line
35262 structured-block */
35264 static tree
35266 {
35270 if_p));
35271 }
35274 /* OpenMP 2.5:
35275 # pragma omp threadprivate (variable-list) */
35277 static void
35279 {
35280 tree vars;
35286 }
35288 /* OpenMP 4.0:
35289 # pragma omp cancel cancel-clause[optseq] new-line */
35291 #define OMP_CANCEL_CLAUSE_MASK \
35292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35298 static void
35300 {
35304 }
35306 /* OpenMP 4.0:
35307 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35309 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35310 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35315 static void
35318 {
35319 tree clauses;
35323 {
35328 {
35331 }
35332 }
35334 {
35338 }
35341 {
35344 "%<#pragma omp cancellation point%> may only be used in"
35346 else
35350 }
35353 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35355 pragma_tok);
35357 }
35359 /* OpenMP 4.0:
35360 #pragma omp distribute distribute-clause[optseq] new-line
35361 for-loop */
35363 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35364 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35370 static tree
35374 {
35383 {
35391 else
35394 {
35400 {
35404 else
35407 }
35413 else
35427 }
35428 }
35430 {
35433 }
35438 {
35441 }
35452 }
35454 /* OpenMP 4.0:
35455 # pragma omp teams teams-clause[optseq] new-line
35456 structured-block */
35458 #define OMP_TEAMS_CLAUSE_MASK \
35459 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35467 static tree
35471 {
35480 {
35484 {
35509 }
35510 }
35512 {
35515 }
35520 {
35523 }
35532 }
35534 /* OpenMP 4.0:
35535 # pragma omp target data target-data-clause[optseq] new-line
35536 structured-block */
35538 #define OMP_TARGET_DATA_CLAUSE_MASK \
35539 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35544 static tree
35546 {
35547 tree clauses
35552 {
35555 {
35572 "%<#pragma omp target data%> with map-type other "
35573 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35577 }
35579 }
35582 {
35585 "%<#pragma omp target data%> must contain at least "
35588 }
35599 }
35601 /* OpenMP 4.5:
35602 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35603 structured-block */
35605 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35606 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35612 static tree
35615 {
35618 {
35623 {
35626 }
35627 }
35629 {
35633 }
35636 {
35638 "%<#pragma omp target enter data%> may only be "
35642 }
35644 tree clauses
35649 {
35652 {
35665 "%<#pragma omp target enter data%> with map-type other "
35669 }
35671 }
35674 {
35677 "%<#pragma omp target enter data%> must contain at least "
35680 }
35687 }
35689 /* OpenMP 4.5:
35690 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35691 structured-block */
35693 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35694 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35700 static tree
35703 {
35706 {
35711 {
35714 }
35715 }
35717 {
35721 }
35724 {
35726 "%<#pragma omp target exit data%> may only be "
35730 }
35732 tree clauses
35737 {
35740 {
35754 "%<#pragma omp target exit data%> with map-type other "
35755 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35759 }
35761 }
35764 {
35767 "%<#pragma omp target exit data%> must contain at least "
35770 }
35777 }
35779 /* OpenMP 4.0:
35780 # pragma omp target update target-update-clause[optseq] new-line */
35782 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35783 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35790 static bool
35793 {
35795 {
35797 "%<#pragma omp target update%> may only be "
35801 }
35803 tree clauses
35808 {
35810 "%<#pragma omp target update%> must contain at least one "
35813 }
35821 }
35823 /* OpenMP 4.0:
35824 # pragma omp target target-clause[optseq] new-line
35825 structured-block */
35827 #define OMP_TARGET_CLAUSE_MASK \
35828 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35838 static bool
35841 {
35845 {
35857 {
35865 {
35866 tree stmt;
35868 {
35871 OMP_TARGET_CLAUSE_MASK,
35876 OMP_TARGET_CLAUSE_MASK,
35881 OMP_TARGET_CLAUSE_MASK,
35886 }
35888 }
35893 {
35897 if_p);
35902 if_p);
35907 if_p);
35911 }
35917 {
35918 /* For combined target teams, ensure the num_teams and
35919 thread_limit clause expressions are evaluated on the host,
35920 before entering the target construct. */
35921 tree c;
35927 {
35936 OMP_CLAUSE_FIRSTPRIVATE);
35941 }
35942 }
35952 }
35954 {
35957 }
35959 {
35963 }
35965 {
35969 }
35971 {
35975 }
35977 {
35980 }
35981 }
35983 {
35986 }
36001 check_clauses:
36003 {
36006 {
36020 "%<#pragma omp target%> with map-type other "
36021 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36025 }
36027 }
36029 }
36031 /* OpenACC 2.0:
36032 # pragma acc cache (variable-list) new-line
36033 */
36035 static tree
36037 {
36052 }
36054 /* OpenACC 2.0:
36055 # pragma acc data oacc-data-clause[optseq] new-line
36056 structured-block */
36058 #define OACC_DATA_CLAUSE_MASK \
36059 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36071 static tree
36073 {
36086 }
36088 /* OpenACC 2.0:
36089 # pragma acc host_data <clauses> new-line
36090 structured-block */
36092 #define OACC_HOST_DATA_CLAUSE_MASK \
36093 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36095 static tree
36097 {
36110 }
36112 /* OpenACC 2.0:
36113 # pragma acc declare oacc-data-clause[optseq] new-line
36114 */
36116 #define OACC_DECLARE_CLAUSE_MASK \
36117 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36130 static tree
36132 {
36141 {
36145 }
36148 {
36152 {
36156 }
36159 {
36171 {
36173 "%qD must be a global variable in "
36175 decl);
36178 }
36183 {
36187 }
36189 {
36191 "invalid use of %<extern%> variable %qD "
36195 }
36197 {
36199 "invalid use of %<global%> variable %qD "
36203 }
36205 }
36210 {
36215 }
36218 {
36219 tree id;
36223 else
36229 {
36232 {
36235 {
36239 }
36240 }
36241 }
36242 }
36243 }
36256 }
36258 /* OpenACC 2.0:
36259 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36261 or
36263 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36265 LOC is the location of the #pragma token.
36266 */
36268 #define OACC_ENTER_DATA_CLAUSE_MASK \
36269 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36277 #define OACC_EXIT_DATA_CLAUSE_MASK \
36278 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36284 static tree
36287 {
36296 {
36301 }
36308 else
36313 {
36317 }
36325 }
36327 /* OpenACC 2.0:
36328 # pragma acc loop oacc-loop-clause[optseq] new-line
36329 structured-block */
36331 #define OACC_LOOP_CLAUSE_MASK \
36332 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36343 static tree
36346 {
36355 {
36361 }
36370 }
36372 /* OpenACC 2.0:
36373 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36374 structured-block
36376 or
36378 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36379 structured-block
36380 */
36382 #define OACC_KERNELS_CLAUSE_MASK \
36383 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36398 #define OACC_PARALLEL_CLAUSE_MASK \
36399 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36420 static tree
36423 {
36424 omp_clause_mask mask;
36427 {
36440 }
36443 {
36447 {
36450 tree clauses;
36452 if_p);
36454 }
36455 }
36464 }
36466 /* OpenACC 2.0:
36467 # pragma acc update oacc-update-clause[optseq] new-line
36468 */
36470 #define OACC_UPDATE_CLAUSE_MASK \
36471 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36478 static tree
36480 {
36487 {
36489 "%<#pragma acc update%> must contain at least one "
36492 }
36500 }
36502 /* OpenACC 2.0:
36503 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36505 LOC is the location of the #pragma token.
36506 */
36508 #define OACC_WAIT_CLAUSE_MASK \
36509 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36511 static tree
36513 {
36527 }
36529 /* OpenMP 4.0:
36530 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36532 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36533 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36540 static void
36543 {
36545 cp_omp_declare_simd_data data;
36547 {
36552 /* It is safe to take the address of a local variable; it will only be
36553 used while this scope is live. */
36555 }
36557 /* Store away all pragma tokens. */
36569 {
36573 {
36586 }
36591 "%<#pragma omp declare simd%> not immediately followed by "
36595 }
36596 }
36598 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36599 This function is modelled similar to the late parsing of omp declare
36600 simd. */
36602 static tree
36604 {
36611 {
36613 "used in the same function marked as a Cilk Plus SIMD-enabled "
36619 }
36621 {
36625 }
36630 {
36637 NULL);
36651 }
36657 }
36659 /* Finalize #pragma omp declare simd clauses after direct declarator has
36660 been parsed, and put that into "omp declare simd" attribute. */
36662 static tree
36664 {
36670 {
36674 }
36679 {
36697 }
36701 }
36704 /* OpenMP 4.0:
36705 # pragma omp declare target new-line
36706 declarations and definitions
36707 # pragma omp end declare target new-line
36709 OpenMP 4.5:
36710 # pragma omp declare target ( extended-list ) new-line
36712 # pragma omp declare target declare-target-clauses[seq] new-line */
36714 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36715 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36718 static void
36720 {
36723 clauses
36727 {
36729 clauses);
36732 }
36733 else
36734 {
36738 }
36741 "%<#pragma omp declare target%> with clauses in between "
36742 "%<#pragma omp declare target%> without clauses and "
36745 {
36751 {
36754 }
36755 else
36758 {
36760 "%qD specified both in declare target %<link%> and %<to%>"
36763 }
36765 {
36772 {
36775 {
36779 }
36780 }
36781 }
36782 }
36783 }
36785 static void
36787 {
36790 {
36793 }
36795 {
36799 {
36802 }
36805 else
36806 {
36810 }
36811 }
36812 else
36813 {
36817 }
36821 "%<#pragma omp end declare target%> without corresponding "
36823 else
36825 }
36827 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36828 expression and optional initializer clause of
36829 #pragma omp declare reduction. We store the expression(s) as
36830 either 3, 6 or 7 special statements inside of the artificial function's
36831 body. The first two statements are DECL_EXPRs for the artificial
36832 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36833 expression that uses those variables.
36834 If there was any INITIALIZER clause, this is followed by further statements,
36835 the fourth and fifth statements are DECL_EXPRs for the artificial
36836 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36837 constructor variant (first token after open paren is not omp_priv),
36838 then the sixth statement is a statement with the function call expression
36839 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36840 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36841 to initialize the OMP_PRIV artificial variable and there is seventh
36842 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36844 static bool
36846 {
36858 tree combiner;
36873 {
36876 }
36879 {
36886 {
36889 }
36905 {
36909 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36913 == CPP_CLOSE_PAREN
36916 {
36920 }
36925 }
36926 else
36927 {
36943 {
36948 }
36950 tree arg;
36963 }
36974 }
36980 }
36982 /* OpenMP 4.0
36983 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36984 initializer-clause[opt] new-line
36986 initializer-clause:
36987 initializer (omp_priv initializer)
36988 initializer (function-name (argument-list)) */
36990 static void
36993 {
37003 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37010 {
37042 }
37054 /* Types may not be defined in declare reduction type list. */
37057 parser->type_definition_forbidden_message
37063 saved_colon_doesnt_start_class_def_p
37068 {
37072 ;
37093 else
37098 else
37100 }
37102 /* Restore the saved message. */
37105 parser->colon_doesnt_start_class_def_p
37110 {
37111 fail:
37114 }
37120 {
37121 tree fntype
37124 NULL_TREE);
37144 {
37149 }
37151 {
37153 {
37162 }
37169 }
37170 else
37171 {
37174 }
37177 else
37180 {
37183 }
37185 {
37188 else
37193 }
37198 else
37199 {
37208 }
37215 }
37219 done:
37220 /* Free any declarators allocated. */
37222 }
37224 /* OpenMP 4.0
37225 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37226 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37227 initializer-clause[opt] new-line
37228 #pragma omp declare target new-line */
37230 static void
37233 {
37235 {
37240 {
37243 context);
37245 }
37248 {
37251 context);
37253 }
37255 {
37258 }
37260 {
37264 }
37265 }
37269 }
37271 /* OpenMP 4.5:
37272 #pragma omp taskloop taskloop-clause[optseq] new-line
37273 for-loop
37275 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37276 for-loop */
37278 #define OMP_TASKLOOP_CLAUSE_MASK \
37279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37294 static tree
37298 {
37307 {
37312 {
37336 }
37337 }
37339 {
37342 }
37347 {
37350 }
37356 if_p);
37362 }
37365 /* OpenACC 2.0:
37366 # pragma acc routine oacc-routine-clause[optseq] new-line
37367 function-definition
37369 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37370 */
37372 #define OACC_ROUTINE_CLAUSE_MASK \
37373 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37379 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37380 component, which must resolve to a declared namespace-scope
37381 function. The clauses are either processed directly (for a named
37382 function), or defered until the immediatley following declaration
37383 is parsed. */
37385 static void
37388 {
37390 /* The checking for "another pragma following this one" in the "no optional
37391 '( name )'" case makes sure that we dont re-enter. */
37394 cp_oacc_routine_data data;
37400 /* It is safe to take the address of a local variable; it will only be
37401 used while this scope is live. */
37404 /* Look for optional '( name )'. */
37406 {
37409 /* We parse the name as an id-expression. If it resolves to
37410 anything other than a non-overloaded function at namespace
37411 scope, it's an error. */
37425 {
37429 }
37431 data.clauses
37439 {
37444 }
37446 /* Perhaps we should use the same rule as declarations in different
37447 namespaces? */
37449 {
37454 }
37457 {
37461 }
37465 }
37467 {
37468 /* Store away all pragma tokens. */
37479 /* Emit a helpful diagnostic if there's another pragma following this
37480 one. */
37482 {
37485 /* ..., and then just keep going. */
37487 }
37489 /* We only have to consider the pragma_external case here. */
37494 else
37497 }
37498 }
37500 /* Finalize #pragma acc routine clauses after direct declarator has
37501 been parsed. */
37503 static tree
37505 {
37510 {
37512 "%<#pragma acc routine%> not immediately followed by "
37515 }
37532 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37533 fndecl_seen. */
37536 }
37538 /* Apply any saved OpenACC routine clauses to a just-parsed
37539 declaration. */
37541 static void
37543 {
37545 {
37546 /* Keep going if we're in error reporting mode. */
37552 {
37554 "%<#pragma acc routine%> not immediately followed by"
37558 }
37560 {
37563 }
37566 {
37571 }
37574 {
37582 }
37584 /* Process the routine's dimension clauses. */
37588 /* Add an "omp declare target" attribute. */
37593 /* Don't unset parser->oacc_routine here: we may still need it to
37594 diagnose wrong usage. But, remember that we've used this "#pragma acc
37595 routine". */
37597 }
37598 }
37600 /* Main entry point to OpenMP statement pragmas. */
37602 static void
37604 {
37605 tree stmt;
37610 {
37633 if_p);
37638 if_p);
37655 if_p);
37660 if_p);
37668 if_p);
37677 if_p);
37691 if_p);
37696 if_p);
37700 }
37703 }
37704 \f
37705 /* Transactional Memory parsing routines. */
37707 /* Parse a transaction attribute.
37709 txn-attribute:
37710 attribute
37711 [ [ identifier ] ]
37713 We use this instead of cp_parser_attributes_opt for transactions to avoid
37714 the pedwarn in C++98 mode. */
37716 static tree
37718 {
37733 {
37737 /* For keywords, use the canonical spelling,
37738 not the parsed identifier. */
37742 }
37743 else
37747 error1:
37750 }
37752 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37754 transaction-statement:
37755 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37756 compound-statement
37757 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37758 */
37760 static tree
37762 {
37773 else
37774 {
37778 }
37780 /* Parse a noexcept specification. */
37784 {
37785 /* cancel-and-throw is unimplemented. */
37788 }
37789 else
37792 /* Keep track if we're in the lexical scope of an outer transaction. */
37804 }
37806 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37808 transaction-expression:
37809 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37810 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37811 */
37813 static tree
37815 {
37828 keyword == RID_TRANSACTION_RELAXED
37842 /* Set this early. This might mean that we allow transaction_cancel in
37843 an expression that we find out later actually has to be a constexpr.
37844 However, we expect that cxx_constant_value will be able to deal with
37845 this; also, if the noexcept has no constexpr, then what we parse next
37846 really is a transaction's body. */
37849 /* Parse a noexcept specification. */
37855 {
37862 }
37863 else
37864 {
37865 /* The only expression that is available got parsed for the noexcept
37866 already. noexcept is true then. */
37869 }
37878 }
37880 /* Parse a function-transaction-block.
37882 function-transaction-block:
37883 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37884 function-body
37885 __transaction_atomic txn-attribute[opt] function-try-block
37886 __transaction_relaxed ctor-initializer[opt] function-body
37887 __transaction_relaxed function-try-block
37888 */
37890 static bool
37892 {
37908 else
37909 {
37913 }
37921 else
37922 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37930 }
37932 /* Parse a __transaction_cancel statement.
37934 cancel-statement:
37935 __transaction_cancel txn-attribute[opt] ;
37936 __transaction_cancel txn-attribute[opt] throw-expression ;
37938 ??? Cancel and throw is not yet implemented. */
37940 static tree
37942 {
37948 RT_TRANSACTION_CANCEL);
37955 /* ??? Parse cancel-and-throw here. */
37960 {
37964 }
37966 {
37970 }
37972 {
37975 {
37981 }
37982 }
37984 {
37988 }
37994 }
37995 \f
37996 /* The parser. */
38000 \f
38001 /* Special handling for the first token or line in the file. The first
38002 thing in the file might be #pragma GCC pch_preprocess, which loads a
38003 PCH file, which is a GC collection point. So we need to handle this
38004 first pragma without benefit of an existing lexer structure.
38006 Always returns one token to the caller in *FIRST_TOKEN. This is
38007 either the true first token of the file, or the first token after
38008 the initial pragma. */
38010 static void
38012 {
38021 {
38028 }
38029 else
38032 /* Skip to the end of the pragma. */
38036 /* Now actually load the PCH file. */
38040 /* Read one more token to return to our caller. We have to do this
38041 after reading the PCH file in, since its pointers have to be
38042 live. */
38044 }
38046 /* Parses the grainsize pragma for the _Cilk_for statement.
38047 Syntax:
38048 #pragma cilk grainsize = <VALUE>. */
38050 static void
38052 {
38054 {
38059 {
38062 }
38064 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38067 else
38069 "%<#pragma cilk grainsize%> is not followed by "
38072 }
38074 }
38076 /* Normal parsing of a pragma token. Here we can (and must) use the
38077 regular lexer. */
38079 static bool
38081 {
38084 tree stmt;
38095 {
38103 {
38113 }
38118 {
38128 }
38133 {
38139 "%<#pragma omp taskwait%> may only be "
38144 }
38149 {
38155 "%<#pragma omp taskyield%> may only be "
38160 }
38165 {
38171 "%<#pragma omp cancel%> may only be "
38176 }
38197 {
38201 }
38209 {
38213 }
38221 {
38225 }
38231 {
38235 }
38243 {
38247 }
38302 "%<#pragma omp section%> may only be used in "
38307 {
38309 {
38313 }
38320 {
38323 }
38326 }
38330 {
38334 }
38342 {
38346 }
38348 /* Ignore the pragma if Cilk Plus is not enabled. */
38350 {
38353 }
38354 else
38355 {
38359 }
38366 bad_stmt:
38369 }
38373 }
38375 /* The interface the pragma parsers have to the lexer. */
38377 enum cpp_ttype
38379 {
38391 else
38392 {
38396 }
38399 }
38401 \f
38402 /* External interface. */
38404 /* Parse one entire translation unit. */
38406 void
38408 {
38421 }
38423 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38424 vectorlength clause:
38425 Syntax:
38426 vectorlength ( constant-expression ) */
38428 static tree
38431 {
38433 tree expr;
38434 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38435 safelen clause. Thus, vectorlength is represented as OMP 4.0
38436 safelen. For SIMD-enabled function it is represented by OMP 4.0
38437 simdlen. */
38440 loc);
38441 else
38443 loc);
38451 /* If expr == error_mark_node, then don't emit any errors nor
38452 create a clause. if any of the above functions returns
38453 error mark node then they would have emitted an error message. */
38455 ;
38463 else
38464 {
38465 tree c;
38467 {
38472 }
38473 else
38474 {
38479 }
38480 }
38485 }
38487 /* Handles the Cilk Plus #pragma simd linear clause.
38488 Syntax:
38489 linear ( simd-linear-variable-list )
38491 simd-linear-variable-list:
38492 simd-linear-variable
38493 simd-linear-variable-list , simd-linear-variable
38495 simd-linear-variable:
38496 id-expression
38497 id-expression : simd-linear-step
38499 simd-linear-step:
38500 conditional-expression */
38502 static tree
38504 {
38510 {
38514 }
38519 {
38522 {
38526 }
38533 {
38537 }
38538 else
38539 {
38543 /* If present, parse the linear step. Otherwise, assume the default
38544 value of 1. */
38546 {
38553 {
38554 /* If an error has occurred, then the whole pragma is
38555 considered ill-formed. Thus, no reason to keep
38556 parsing. */
38559 }
38567 else
38569 "step size must be an integer constant "
38571 }
38573 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38579 }
38584 else
38585 {
38590 }
38591 }
38595 }
38597 /* Returns the name of the next clause. If the clause is not
38598 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38599 token is not consumed. Otherwise, the appropriate enum from the
38600 pragma_simd_clause is returned and the token is consumed. */
38602 static pragma_omp_clause
38604 {
38605 pragma_omp_clause clause_type;
38622 else
38627 }
38629 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38631 static tree
38633 {
38638 {
38639 pragma_omp_clause c_kind;
38646 /* Use the OpenMP 4.0 equivalent function. */
38649 /* Use the OpenMP 4.0 equivalent function. */
38651 clauses);
38653 /* Use the OMP 4.0 equivalent function. */
38655 clauses);
38657 /* Use the OMP 4.0 equivalent function. */
38659 else
38660 {
38664 }
38665 }
38671 else
38673 }
38675 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38677 static void
38679 {
38686 {
38690 }
38699 }
38701 /* Main entry-point for parsing Cilk Plus _Cilk_for
38702 loops. The return value is error_mark_node
38703 when errors happen and CILK_FOR tree on success. */
38705 static tree
38707 {
38722 else
38728 }
38730 /* Create an identifier for a generic parameter type (a synthesized
38731 template parameter implied by `auto' or a concept identifier). */
38734 static tree
38736 {
38740 }
38742 /* Predicate that behaves as is_auto_or_concept but matches the parent
38743 node of the generic type rather than the generic type itself. This
38744 allows for type transformation in add_implicit_template_parms. */
38748 {
38750 }
38752 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38753 (creating a new template parameter list if necessary). Returns the newly
38754 created template type parm. */
38756 static tree
38758 {
38761 /* Before committing to modifying any scope, if we're in an
38762 implicit template scope, and we're trying to synthesize a
38763 constrained parameter, try to find a previous parameter with
38764 the same name. This is the same-type rule for abbreviated
38765 function templates.
38767 NOTE: We can generate implicit parameters when tentatively
38768 parsing a nested name specifier, only to reject that parse
38769 later. However, matching the same template-id as part of a
38770 direct-declarator should generate an identical template
38771 parameter, so this rule will merge them. */
38773 {
38776 {
38778 {
38781 /* Return the TEMPLATE_PARM_INDEX. */
38784 }
38786 }
38787 }
38789 /* We are either continuing a function template that already contains implicit
38790 template parameters, creating a new fully-implicit function template, or
38791 extending an existing explicit function template with implicit template
38792 parameters. */
38800 {
38804 }
38805 else
38806 {
38807 /* Roll back to the existing template parameter scope (in the case of
38808 extending an explicit function template) or introduce a new template
38809 parameter scope ahead of the function parameter scope (or class scope
38810 in the case of out-of-line member definitions). The function scope is
38811 added back after template parameter synthesis below. */
38816 {
38819 }
38821 {
38822 /* If not defining a class, then any class scope is a scope level in
38823 an out-of-line member definition. In this case simply wind back
38824 beyond the first such scope to inject the template parameter list.
38825 Otherwise wind back to the class being defined. The latter can
38826 occur in class member friend declarations such as:
38828 class A {
38829 void foo (auto);
38830 };
38831 class B {
38832 friend void A::foo (auto);
38833 };
38835 The template parameter list synthesized for the friend declaration
38836 must be injected in the scope of 'B'. This can also occur in
38837 erroneous cases such as:
38839 struct A {
38840 struct B {
38841 void foo (auto);
38842 };
38843 void B::foo (auto) {}
38844 };
38846 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38847 but, nevertheless, the template parameter list synthesized for the
38848 declarator should be injected into the scope of 'A' as if the
38849 ill-formed template was specified explicitly. */
38852 {
38855 }
38856 }
38862 {
38863 /* Introduce a new template parameter list for implicit template
38864 parameters. */
38868 parser->implicit_template_scope
38875 }
38876 else
38877 {
38878 /* Synthesize implicit template parameters at the end of the explicit
38879 template parameter list. */
38886 parser->implicit_template_parms
38888 }
38889 }
38891 /* Synthesize a new template parameter and track the current template
38892 parameter chain with implicit_template_parms. */
38896 tree synth_tmpl_parm;
38900 synth_tmpl_parm
38903 synth_tmpl_parm
38905 else
38906 {
38910 }
38912 // Attach the constraint to the parm before processing.
38915 tree new_parm
38917 input_location,
38918 node,
38922 // Chain the new parameter to the list of implicit parameters.
38924 parser->implicit_template_parms
38926 else
38931 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38934 /* If creating a fully implicit function template, start the new implicit
38935 template parameter list with this synthesized type, otherwise grow the
38936 current template parameter list. */
38939 {
38946 }
38947 else
38948 {
38953 }
38955 // If the new parameter was constrained, we need to add that to the
38956 // constraints in the template parameter list.
38958 {
38962 }
38967 }
38969 /* Finish the declaration of a fully implicit function template. Such a
38970 template has no explicit template parameter list so has not been through the
38971 normal template head and tail processing. synthesize_implicit_template_parm
38972 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38973 provided if the declaration is a class member such that its template
38974 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38975 form is returned. Otherwise NULL_TREE is returned. */
38977 static tree
38979 {
38984 {
38988 }
38998 }