| blob | 4bfae3655d5b1d7f41d8ba6454fca0775fa48f9d |
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 apply 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 }
2809 /* Because c_parser_error does not understand
2810 CPP_KEYWORD, keywords are treated like
2811 identifiers. */
2814 }
2815 }
2817 /* Issue an error about name-lookup failing. NAME is the
2818 IDENTIFIER_NODE DECL is the result of
2819 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2820 the thing that we hoped to find. */
2822 static void
2824 tree name,
2825 tree decl,
2826 name_lookup_error desired,
2827 location_t location)
2828 {
2829 /* If name lookup completely failed, tell the user that NAME was not
2830 declared. */
2832 {
2845 else
2847 }
2849 {
2851 {
2868 }
2869 }
2871 {
2873 {
2883 name);
2887 }
2888 }
2889 else
2890 {
2892 {
2905 }
2906 }
2907 }
2909 /* If we are parsing tentatively, remember that an error has occurred
2910 during this tentative parse. Returns true if the error was
2911 simulated; false if a message should be issued by the caller. */
2913 static bool
2915 {
2917 {
2920 }
2922 }
2924 /* This function is called when a type is defined. If type
2925 definitions are forbidden at this point, an error message is
2926 issued. */
2928 static bool
2930 {
2931 /* If types are forbidden here, issue a message. */
2933 {
2934 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2935 in the message need to be interpreted. */
2938 }
2940 }
2942 /* This function is called when the DECLARATOR is processed. The TYPE
2943 was a type defined in the decl-specifiers. If it is invalid to
2944 define a type in the decl-specifiers for DECLARATOR, an error is
2945 issued. TYPE_LOCATION is the location of TYPE and is used
2946 for error reporting. */
2948 static void
2951 {
2952 /* [dcl.fct] forbids type definitions in return types.
2953 Unfortunately, it's not easy to know whether or not we are
2954 processing a return type until after the fact. */
2962 {
2967 type);
2968 }
2969 }
2971 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2972 "<" in any valid C++ program. If the next token is indeed "<",
2973 issue a message warning the user about what appears to be an
2974 invalid attempt to form a template-id. LOCATION is the location
2975 of the type-specifier (TYPE) */
2977 static void
2979 tree type,
2981 location_t location)
2982 {
2986 {
2992 {
2995 else
2997 }
2998 else
3000 /* Remember the location of the invalid "<". */
3003 /* Consume the "<". */
3005 /* Parse the template arguments. */
3007 /* Permanently remove the invalid template arguments so that
3008 this error message is not issued again. */
3011 }
3012 }
3014 /* If parsing an integral constant-expression, issue an error message
3015 about the fact that THING appeared and return true. Otherwise,
3016 return false. In either case, set
3017 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3019 static bool
3021 non_integral_constant thing)
3022 {
3025 {
3027 {
3030 {
3033 "ISO C++ forbids using a floating-point literal "
3038 "enumeration type cannot appear in a "
3129 }
3133 }
3134 }
3136 }
3138 /* Emit a diagnostic for an invalid type name. This function commits
3139 to the current active tentative parse, if any. (Otherwise, the
3140 problematic construct might be encountered again later, resulting
3141 in duplicate error messages.) LOCATION is the location of ID. */
3143 static void
3145 location_t location)
3146 {
3149 /* Try to lookup the identifier. */
3156 /* If the lookup was ambiguous, an error will already have
3157 been issued. */
3159 /* If the lookup found a template-name, it means that the user forgot
3160 to specify an argument list. Emit a useful error message. */
3162 {
3165 decl);
3170 }
3174 /* Something like 'unsigned A a;' */
3177 {
3178 /* Issue an error message. */
3183 {
3189 }
3190 else
3192 /* If we're in a template class, it's possible that the user was
3193 referring to a type from a base class. For example:
3195 template <typename T> struct A { typedef T X; };
3196 template <typename T> struct B : public A<T> { X x; };
3198 The user should have said "typename A<T>::X". */
3214 {
3215 tree b;
3218 b;
3220 {
3224 {
3225 tree field;
3226 /* Go from a particular instantiation of the
3227 template (which will have an empty TYPE_FIELDs),
3228 to the main version. */
3231 field;
3235 {
3240 }
3243 }
3244 }
3245 }
3246 }
3247 /* Here we diagnose qualified-ids where the scope is actually correct,
3248 but the identifier does not resolve to a valid type name. */
3250 {
3252 {
3261 else
3267 }
3270 {
3271 /* A<T>::A<T>() */
3277 }
3280 {
3283 "need %<typename%> before %<%T::%D::%E%> because "
3287 id,
3290 else
3294 }
3296 {
3308 else
3314 }
3315 else
3317 }
3318 }
3320 /* Check for a common situation where a type-name should be present,
3321 but is not, and issue a sensible error message. Returns true if an
3322 invalid type-name was detected.
3324 The situation handled by this function are variable declarations of the
3325 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3326 Usually, `ID' should name a type, but if we got here it means that it
3327 does not. We try to emit the best possible error message depending on
3328 how exactly the id-expression looks like. */
3330 static bool
3332 {
3333 tree id;
3336 /* Avoid duplicate error about ambiguous lookup. */
3338 {
3342 }
3351 /* If the next token is a (, this is a function with no explicit return
3352 type, i.e. constructor, destructor or conversion op. */
3355 {
3358 }
3362 /* Emit a diagnostic for the invalid type. */
3364 out:
3365 /* If we aren't in the middle of a declarator (i.e. in a
3366 parameter-declaration-clause), skip to the end of the declaration;
3367 there's no point in trying to process it. */
3371 }
3373 /* Consume tokens up to, and including, the next non-nested closing `)'.
3374 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3375 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3376 found an unnested token of that type. */
3378 static int
3381 cpp_ttype or_ttype,
3383 {
3393 {
3396 /* Have we found what we're looking for before the closing paren? */
3402 {
3405 /* If we've run out of tokens, then there is no closing `)'. */
3408 /* This is good for lambda expression capture-lists. */
3418 /* This matches the processing in skip_to_end_of_statement. */
3438 {
3442 }
3447 }
3449 /* Consume the token. */
3451 }
3452 }
3454 /* Consume tokens up to, and including, the next non-nested closing `)'.
3455 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3456 are doing error recovery. Returns -1 if OR_COMMA is true and we
3457 found an unnested token of that type. */
3459 static int
3464 {
3468 }
3470 /* Consume tokens until we reach the end of the current statement.
3471 Normally, that will be just before consuming a `;'. However, if a
3472 non-nested `}' comes first, then we stop before consuming that. */
3474 static void
3476 {
3479 /* Unwind generic function template scope if necessary. */
3484 {
3488 {
3491 /* If we've run out of tokens, stop. */
3495 /* If the next token is a `;', we have reached the end of the
3496 statement. */
3502 /* If this is a non-nested '}', stop before consuming it.
3503 That way, when confronted with something like:
3505 { 3 + }
3507 we stop before consuming the closing '}', even though we
3508 have not yet reached a `;'. */
3512 /* If it is the closing '}' for a block that we have
3513 scanned, stop -- but only after consuming the token.
3514 That way given:
3516 void f g () { ... }
3517 typedef int I;
3519 we will stop after the body of the erroneously declared
3520 function, but before consuming the following `typedef'
3521 declaration. */
3523 {
3526 }
3535 }
3537 /* Consume the token. */
3539 }
3540 }
3542 /* This function is called at the end of a statement or declaration.
3543 If the next token is a semicolon, it is consumed; otherwise, error
3544 recovery is attempted. */
3546 static void
3548 {
3549 /* Look for the trailing `;'. */
3551 {
3552 /* If there is additional (erroneous) input, skip to the end of
3553 the statement. */
3555 /* If the next token is now a `;', consume it. */
3558 }
3559 }
3561 /* Skip tokens until we have consumed an entire block, or until we
3562 have consumed a non-nested `;'. */
3564 static void
3566 {
3569 /* Unwind generic function template scope if necessary. */
3574 {
3578 {
3581 /* If we've run out of tokens, stop. */
3585 /* Stop if this is an unnested ';'. */
3591 /* Stop if this is an unnested '}', or closes the outermost
3592 nesting level. */
3593 nesting_depth--;
3601 /* Nest. */
3602 nesting_depth++;
3607 }
3609 /* Consume the token. */
3611 }
3612 }
3614 /* Skip tokens until a non-nested closing curly brace is the next
3615 token, or there are no more tokens. Return true in the first case,
3616 false otherwise. */
3618 static bool
3620 {
3624 {
3628 {
3631 /* If we've run out of tokens, stop. */
3635 /* If the next token is a non-nested `}', then we have reached
3636 the end of the current block. */
3642 /* If it the next token is a `{', then we are entering a new
3643 block. Consume the entire block. */
3649 }
3651 /* Consume the token. */
3653 }
3654 }
3656 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3657 parameter is the PRAGMA token, allowing us to purge the entire pragma
3658 sequence. */
3660 static void
3662 {
3667 do
3671 /* Ensure that the pragma is not parsed again. */
3673 }
3675 /* Require pragma end of line, resyncing with it as necessary. The
3676 arguments are as for cp_parser_skip_to_pragma_eol. */
3678 static void
3680 {
3684 }
3686 /* This is a simple wrapper around make_typename_type. When the id is
3687 an unresolved identifier node, we can provide a superior diagnostic
3688 using cp_parser_diagnose_invalid_type_name. */
3690 static tree
3692 location_t id_location)
3693 {
3694 tree result;
3696 {
3702 }
3704 }
3706 /* This is a wrapper around the
3707 make_{pointer,ptrmem,reference}_declarator functions that decides
3708 which one to call based on the CODE and CLASS_TYPE arguments. The
3709 CODE argument should be one of the values returned by
3710 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3711 appertain to the pointer or reference. */
3715 cp_cv_quals cv_qualifiers,
3717 tree attributes)
3718 {
3725 else
3735 }
3737 /* Create a new C++ parser. */
3741 {
3746 /* cp_lexer_new_main is called before doing GC allocation because
3747 cp_lexer_new_main might load a PCH file. */
3750 /* Initialize the binops_by_token so that we can get the tree
3751 directly from the token. */
3759 /* For now, we always accept GNU extensions. */
3762 /* The `>' token is a greater-than operator, not the end of a
3763 template-id. */
3768 /* We are not parsing a constant-expression. */
3773 /* Local variable names are not forbidden. */
3776 /* We are not processing an `extern "C"' declaration. */
3779 /* We are not processing a declarator. */
3782 /* We are not processing a template-argument-list. */
3785 /* We are not in an iteration statement. */
3788 /* We are not in a switch statement. */
3791 /* We are not parsing a type-id inside an expression. */
3794 /* Declarations aren't implicitly extern "C". */
3797 /* String literals should be translated to the execution character set. */
3800 /* We are not parsing a function body. */
3803 /* We can correct until told otherwise. */
3806 /* The unparsed function queue is empty. */
3809 /* There are no classes being defined. */
3812 /* No template parameters apply. */
3815 /* Special parsing data structures. */
3820 /* Not declaring an implicit function template. */
3826 /* Allow constrained-type-specifiers. */
3830 }
3832 /* Create a cp_lexer structure which will emit the tokens in CACHE
3833 and push it onto the parser's lexer stack. This is used for delayed
3834 parsing of in-class method bodies and default arguments, and should
3835 not be confused with tentative parsing. */
3836 static void
3838 {
3843 /* Move the current source position to that of the first token in the
3844 new lexer. */
3846 }
3848 /* Pop the top lexer off the parser stack. This is never used for the
3849 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3850 static void
3852 {
3857 /* Put the current source position back where it was before this
3858 lexer was pushed. */
3860 }
3862 /* Lexical conventions [gram.lex] */
3864 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3865 identifier. */
3867 static cp_expr
3869 {
3872 /* Look for the identifier. */
3874 /* Return the value. */
3877 else
3879 }
3881 /* Parse a sequence of adjacent string constants. Returns a
3882 TREE_STRING representing the combined, nul-terminated string
3883 constant. If TRANSLATE is true, translate the string to the
3884 execution character set. If WIDE_OK is true, a wide string is
3885 invalid here.
3887 C++98 [lex.string] says that if a narrow string literal token is
3888 adjacent to a wide string literal token, the behavior is undefined.
3889 However, C99 6.4.5p4 says that this results in a wide string literal.
3890 We follow C99 here, for consistency with the C front end.
3892 This code is largely lifted from lex_string() in c-lex.c.
3894 FUTURE: ObjC++ will need to handle @-strings here. */
3895 static cp_expr
3898 {
3899 tree value;
3906 tree string_tree;
3912 {
3915 }
3920 {
3924 }
3925 else
3926 {
3929 }
3932 /* Try to avoid the overhead of creating and destroying an obstack
3933 for the common case of just one string. */
3936 {
3944 {
3948 }
3949 else
3953 }
3954 else
3955 {
3960 do
3961 {
3963 count++;
3968 {
3971 {
3974 }
3977 {
3982 }
3984 }
3985 else
3989 {
3993 {
3997 "unsupported non-standard concatenation "
3999 }
4000 }
4008 {
4012 }
4013 else
4014 {
4018 }
4019 }
4022 /* A string literal built by concatenation has its caret=start at
4023 the start of the initial string, and its finish at the finish of
4024 the final string literal. */
4028 }
4031 {
4034 }
4038 {
4043 {
4058 }
4063 {
4068 else
4070 }
4071 }
4072 else
4073 /* cpp_interpret_string has issued an error. */
4080 }
4082 /* Look up a literal operator with the name and the exact arguments. */
4084 static tree
4086 {
4087 tree decl;
4093 {
4099 {
4102 {
4112 }
4115 /* May be this should be sufficient_parms_p instead,
4116 depending on how exactly should user-defined literals
4117 work in presence of default arguments on the literal
4118 operator parameters. */
4121 }
4122 }
4125 }
4127 /* Parse a user-defined char constant. Returns a call to a user-defined
4128 literal operator taking the character as an argument. */
4130 static cp_expr
4132 {
4140 /* Build up a call to the user-defined operator */
4141 /* Lookup the name we got back from the id-expression. */
4146 {
4151 }
4155 }
4157 /* A subroutine of cp_parser_userdef_numeric_literal to
4158 create a char... template parameter pack from a string node. */
4160 static tree
4162 {
4163 tree charvec;
4169 /* Fill in CHARVEC with all of the parameters. */
4174 /* Build the argument packs. */
4180 }
4182 /* A subroutine of cp_parser_userdef_numeric_literal to
4183 create a char... template parameter pack from a string node. */
4185 static tree
4187 {
4188 tree charvec;
4199 /* First template parm is character type. */
4202 /* Fill in CHARVEC with all of the parameters. */
4209 /* Build the argument packs. */
4215 }
4217 /* Parse a user-defined numeric constant. returns a call to a user-defined
4218 literal operator. */
4220 static cp_expr
4222 {
4233 /* Look for a literal operator taking the exact type of numeric argument
4234 as the literal value. */
4239 {
4241 tf_warning_or_error);
4244 {
4247 long_long_unsigned_type_node);
4248 }
4249 else
4250 {
4254 long_double_type_node);
4258 }
4262 }
4265 /* If the numeric argument didn't work, look for a raw literal
4266 operator taking a const char* argument consisting of the number
4267 in string format. */
4272 {
4274 tf_warning_or_error);
4277 }
4280 /* If the raw literal didn't work, look for a non-type template
4281 function with parameter pack char.... Call the function with
4282 template parameter characters representing the number. */
4286 {
4290 tf_warning_or_error);
4293 }
4302 }
4304 /* Parse a user-defined string constant. Returns a call to a user-defined
4305 literal operator taking a character pointer and the length of the string
4306 as arguments. */
4308 static tree
4310 {
4319 /* Build up a call to the user-defined operator. */
4320 /* Lookup the name we got back from the id-expression. */
4327 {
4329 tf_warning_or_error);
4332 }
4335 /* Look for a template function with typename parameter CharT
4336 and parameter pack CharT... Call the function with
4337 template parameter characters representing the string. */
4341 {
4345 tf_warning_or_error);
4348 }
4354 }
4357 /* Basic concepts [gram.basic] */
4359 /* Parse a translation-unit.
4361 translation-unit:
4362 declaration-seq [opt]
4364 Returns TRUE if all went well. */
4366 static bool
4368 {
4369 /* The address of the first non-permanent object on the declarator
4370 obstack. */
4375 /* Create the declarator obstack, if necessary. */
4377 {
4379 /* Create the error declarator. */
4381 /* Create the empty parameter list. */
4383 /* Remember where the base of the declarator obstack lies. */
4385 }
4389 /* If there are no tokens left then all went well. */
4391 {
4392 /* Get rid of the token array; we don't need it any more. */
4396 /* This file might have been a context that's implicitly extern
4397 "C". If so, pop the lang context. (Only relevant for PCH.) */
4399 {
4402 }
4404 /* Finish up. */
4408 }
4409 else
4410 {
4413 }
4415 /* Make sure the declarator obstack was fully cleaned up. */
4419 /* All went well. */
4421 }
4423 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4424 decltype context. */
4428 {
4433 }
4435 /* We're about to parse a collection of statements. If we're currently
4436 parsing tentatively, set up a firewall so that any nested
4437 cp_parser_commit_to_tentative_parse won't affect the current context. */
4439 static cp_token_position
4441 {
4448 }
4450 /* We've finished parsing the collection of statements. Wrap up the
4451 firewall and replace the relevant tokens with the parsed form. */
4453 static void
4455 tree expr)
4456 {
4460 /* Finish the firewall level. */
4462 /* And remember the result of the parse for when we try again. */
4468 }
4470 /* Like the above functions, but let the user modify the tokens. Used by
4471 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4472 later parses, so it makes sense to localize the effects of
4473 cp_parser_commit_to_tentative_parse. */
4475 struct tentative_firewall
4476 {
4481 {
4482 /* If we're currently parsing tentatively, start a committed level as a
4483 firewall and then an inner tentative parse. */
4485 {
4489 }
4490 }
4493 {
4495 {
4496 /* Finish the inner tentative parse and the firewall, propagating any
4497 uncommitted error state to the outer tentative parse. */
4503 }
4504 }
4505 };
4507 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4508 This class is for tracking such a matching pair of symbols.
4509 In particular, it tracks the location of the first token,
4510 so that if the second token is missing, we can highlight the
4511 location of the first token when notifying the user about the
4512 problem. */
4515 class token_pair
4516 {
4518 /* token_pair's ctor. */
4521 /* If the next token is the opening symbol for this pair, consume it and
4522 return true.
4523 Otherwise, issue an error and return false.
4524 In either case, record the location of the opening token. */
4527 {
4531 }
4533 /* Consume the next token from PARSER, recording its location as
4534 that of the opening token within the pair. */
4537 {
4542 }
4544 /* If the next token is the closing symbol for this pair, consume it
4545 and return it.
4546 Otherwise, issue an error, highlighting the location of the
4547 corresponding opening token, and return NULL. */
4550 {
4553 m_open_loc);
4554 }
4557 location_t m_open_loc;
4558 };
4560 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4562 struct matching_paren_traits
4563 {
4568 };
4570 /* "matching_parens" is a token_pair<T> class for tracking matching
4571 pairs of parentheses. */
4575 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4577 struct matching_brace_traits
4578 {
4583 };
4585 /* "matching_braces" is a token_pair<T> class for tracking matching
4586 pairs of braces. */
4591 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4592 enclosing parentheses. */
4594 static cp_expr
4596 {
4599 /* Consume the '('. */
4601 matching_parens parens;
4603 /* Start the statement-expression. */
4605 /* Parse the compound-statement. */
4607 /* Finish up. */
4609 /* Consume the ')'. */
4617 }
4619 /* Expressions [gram.expr] */
4621 /* Parse a fold-operator.
4623 fold-operator:
4624 - * / % ^ & | = < > << >>
4625 = -= *= /= %= ^= &= |= <<= >>=
4626 == != <= >= && || , .* ->*
4628 This returns the tree code corresponding to the matched operator
4629 as an int. When the current token matches a compound assignment
4630 opertor, the resulting tree code is the negative value of the
4631 non-assignment operator. */
4633 static int
4635 {
4637 {
4677 }
4678 }
4680 /* Returns true if CODE indicates a binary expression, which is not allowed in
4681 the LHS of a fold-expression. More codes will need to be added to use this
4682 function in other contexts. */
4684 static bool
4686 {
4688 {
4721 }
4722 }
4724 /* If the next token is a suitable fold operator, consume it and return as
4725 the function above. */
4727 static int
4729 {
4735 }
4737 /* Parse a fold-expression.
4739 fold-expression:
4740 ( ... folding-operator cast-expression)
4741 ( cast-expression folding-operator ... )
4742 ( cast-expression folding operator ... folding-operator cast-expression)
4744 Note that the '(' and ')' are matched in primary expression. */
4746 static cp_expr
4748 {
4749 cp_id_kind pidk;
4751 // Left fold.
4753 {
4757 {
4760 }
4767 }
4772 {
4775 }
4778 {
4781 }
4784 /* The operands of a fold-expression are cast-expressions, so binary or
4785 conditional expressions are not allowed. We check this here to avoid
4786 tentative parsing. */
4796 // Right fold.
4801 {
4804 }
4807 // Binary left or right fold.
4812 }
4814 /* Parse a primary-expression.
4816 primary-expression:
4817 literal
4818 this
4819 ( expression )
4820 id-expression
4821 lambda-expression (C++11)
4823 GNU Extensions:
4825 primary-expression:
4826 ( compound-statement )
4827 __builtin_va_arg ( assignment-expression , type-id )
4828 __builtin_offsetof ( type-id , offsetof-expression )
4830 C++ Extensions:
4831 __has_nothrow_assign ( type-id )
4832 __has_nothrow_constructor ( type-id )
4833 __has_nothrow_copy ( type-id )
4834 __has_trivial_assign ( type-id )
4835 __has_trivial_constructor ( type-id )
4836 __has_trivial_copy ( type-id )
4837 __has_trivial_destructor ( type-id )
4838 __has_virtual_destructor ( type-id )
4839 __is_abstract ( type-id )
4840 __is_base_of ( type-id , type-id )
4841 __is_class ( type-id )
4842 __is_empty ( type-id )
4843 __is_enum ( type-id )
4844 __is_final ( type-id )
4845 __is_literal_type ( type-id )
4846 __is_pod ( type-id )
4847 __is_polymorphic ( type-id )
4848 __is_std_layout ( type-id )
4849 __is_trivial ( type-id )
4850 __is_union ( type-id )
4852 Objective-C++ Extension:
4854 primary-expression:
4855 objc-expression
4857 literal:
4858 __null
4860 ADDRESS_P is true iff this expression was immediately preceded by
4861 "&" and therefore might denote a pointer-to-member. CAST_P is true
4862 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4863 true iff this expression is a template argument.
4865 Returns a representation of the expression. Upon return, *IDK
4866 indicates what kind of id-expression (if any) was present. */
4868 static cp_expr
4875 {
4878 /* Assume the primary expression is not an id-expression. */
4881 /* Peek at the next token. */
4884 {
4885 /* literal:
4886 integer-literal
4887 character-literal
4888 floating-literal
4889 string-literal
4890 boolean-literal
4891 pointer-literal
4892 user-defined-literal */
4904 {
4908 }
4909 /* Floating-point literals are only allowed in an integral
4910 constant expression if they are cast to an integral or
4911 enumeration type. */
4915 {
4916 /* CAST_P will be set even in invalid code like "int(2.7 +
4917 ...)". Therefore, we have to check that the next token
4918 is sure to end the cast. */
4920 {
4925 enumerator-definition. */
4927 /* The curly brace at the end of an enum-specifier. */
4929 /* The end of a statement. */
4931 /* The end of the cast-expression. */
4933 /* The end of an array bound. */
4935 /* The closing ">" in a template-argument-list. */
4938 /* C++0x only: A ">>" treated like two ">" tokens,
4939 in a template-argument-list. */
4944 }
4946 /* If we are within a cast, then the constraint that the
4947 cast is to an integral or enumeration type will be
4948 checked at that point. If we are not within a cast, then
4949 this code is invalid. */
4952 }
4972 /* ??? Should wide strings be allowed when parser->translate_strings_p
4973 is false (i.e. in attributes)? If not, we can kill the third
4974 argument to cp_parser_string_literal. */
4980 /* If we see `( { ' then we are looking at the beginning of
4981 a GNU statement-expression. */
4984 {
4985 /* Statement-expressions are not allowed by the standard. */
4989 /* And they're not allowed outside of a function-body; you
4990 cannot, for example, write:
4992 int i = ({ int j = 3; j + 1; });
4994 at class or namespace scope. */
4997 {
4999 "statement-expressions are not allowed outside "
5005 }
5006 else
5008 }
5009 /* Otherwise it's a normal parenthesized expression. */
5010 {
5011 cp_expr expr;
5016 /* Consume the `('. */
5017 matching_parens parens;
5019 /* Within a parenthesized expression, a `>' token is always
5020 the greater-than operator. */
5021 saved_greater_than_is_operator_p
5026 /* Left fold expression. */
5028 else
5029 /* Parse the parenthesized expression. */
5034 {
5041 }
5042 else
5043 /* Let the front end know that this expression was
5044 enclosed in parentheses. This matters in case, for
5045 example, the expression is of the form `A::B', since
5046 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5047 not. */
5050 /* DR 705: Wrapping an unqualified name in parentheses
5051 suppresses arg-dependent lookup. We want to pass back
5052 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5053 (c++/37862), but none of the others. */
5057 /* The `>' token might be the end of a template-id or
5058 template-parameter-list now. */
5059 parser->greater_than_is_operator_p
5062 /* Consume the `)'. */
5071 }
5074 {
5076 {
5077 /* We might have an Objective-C++ message. */
5080 /* If that works out, we're done ... */
5083 /* ... else, fall though to see if it's a lambda. */
5084 }
5086 /* Don't warn about a failed tentative parse. */
5091 }
5095 /* We have an Objective-C++ string literal. */
5102 {
5103 /* These two are the boolean literals. */
5111 /* The `__null' literal. */
5116 /* The `nullptr' literal. */
5121 /* Recognize the `this' keyword. */
5125 {
5129 }
5130 /* Pointers cannot appear in constant-expressions. */
5135 /* The `operator' keyword can be the beginning of an
5136 id-expression. */
5143 {
5144 non_integral_constant name;
5146 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5147 __func__ are the names of variables -- but they are
5148 treated specially. Therefore, they are handled here,
5149 rather than relying on the generic id-expression logic
5150 below. Grammatically, these names are id-expressions.
5152 Consume the token. */
5156 {
5168 }
5173 /* Look up the name. */
5175 }
5178 {
5179 tree expression;
5180 tree type;
5181 source_location type_location;
5182 location_t start_loc
5184 /* The `__builtin_va_arg' construct is used to handle
5185 `va_arg'. Consume the `__builtin_va_arg' token. */
5187 /* Look for the opening `('. */
5188 matching_parens parens;
5190 /* Now, parse the assignment-expression. */
5192 /* Look for the `,'. */
5195 /* Parse the type-id. */
5196 {
5199 }
5200 /* Look for the closing `)'. */
5201 location_t finish_loc
5204 /* Using `va_arg' in a constant-expression is not
5205 allowed. */
5207 NIC_VA_ARG))
5209 /* Construct a location of the form:
5210 __builtin_va_arg (v, int)
5211 ~~~~~~~~~~~~~~~~~~~~~^~~~
5212 with the caret at the type, ranging from the start of the
5213 "__builtin_va_arg" token to the close paren. */
5214 location_t combined_loc
5217 }
5252 // C++ concepts
5256 /* Objective-C++ expressions. */
5266 {
5271 }
5272 /* FALLTHRU */
5276 }
5278 /* An id-expression can start with either an identifier, a
5279 `::' as the beginning of a qualified-id, or the "operator"
5280 keyword. */
5285 {
5286 id_expression:
5287 cp_expr id_expression;
5288 cp_expr decl;
5294 /* Parse the id-expression. */
5295 id_expression
5312 /* If we have a template-id, then no further lookup is
5313 required. If the template-id was for a template-class, we
5314 will sometimes have a TYPE_DECL at this point. */
5318 /* Look up the name. */
5319 else
5320 {
5321 tree ambiguous_decls;
5323 /* If we already know that this lookup is ambiguous, then
5324 we've already issued an error message; there's no reason
5325 to check again. */
5328 {
5331 }
5334 none_type,
5335 template_p,
5340 /* If the lookup was ambiguous, an error will already have
5341 been issued. */
5345 /* In Objective-C++, we may have an Objective-C 2.0
5346 dot-syntax for classes here. */
5351 {
5352 tree component;
5359 component);
5360 /* Build a location of the form:
5361 expr.component
5362 ~~~~~^~~~~~~~~
5363 with caret at the start of the component name (at
5364 input_location), ranging from the start of the id_expression
5365 to the end of the component name. */
5366 location_t combined_loc
5371 }
5373 /* In Objective-C++, an instance variable (ivar) may be preferred
5374 to whatever cp_parser_lookup_name() found.
5375 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5376 rest of c-family, we have to do a little extra work to preserve
5377 any location information in cp_expr "decl". Given that
5378 objc_lookup_ivar is implemented in "c-family" and "objc", we
5379 have a trip through the pure "tree" type, rather than cp_expr.
5380 Naively copying it back to "decl" would implicitly give the
5381 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5382 store an EXPR_LOCATION. Hence we only update "decl" (and
5383 hence its location_t) if we get back a different tree node. */
5385 id_expression);
5389 /* If name lookup gives us a SCOPE_REF, then the
5390 qualifying scope was dependent. */
5392 {
5393 /* At this point, we do not know if DECL is a valid
5394 integral constant expression. We assume that it is
5395 in fact such an expression, so that code like:
5397 template <int N> struct A {
5398 int a[B<N>::i];
5399 };
5401 is accepted. At template-instantiation time, we
5402 will check that B<N>::i is actually a constant. */
5404 }
5405 /* Check to see if DECL is a local variable in a context
5406 where that is forbidden. */
5409 {
5410 /* It might be that we only found DECL because we are
5411 trying to be generous with pre-ISO scoping rules.
5412 For example, consider:
5414 int i;
5415 void g() {
5416 for (int i = 0; i < 10; ++i) {}
5417 extern void f(int j = i);
5418 }
5420 Here, name look up will originally find the out
5421 of scope `i'. We need to issue a warning message,
5422 but then use the global `i'. */
5425 {
5430 }
5431 }
5432 }
5434 decl = (finish_id_expression
5436 idk,
5441 template_arg_p,
5448 }
5450 /* Anything else is an error. */
5454 }
5455 }
5463 {
5466 }
5468 /* Parse an id-expression.
5470 id-expression:
5471 unqualified-id
5472 qualified-id
5474 qualified-id:
5475 :: [opt] nested-name-specifier template [opt] unqualified-id
5476 :: identifier
5477 :: operator-function-id
5478 :: template-id
5480 Return a representation of the unqualified portion of the
5481 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5482 a `::' or nested-name-specifier.
5484 Often, if the id-expression was a qualified-id, the caller will
5485 want to make a SCOPE_REF to represent the qualified-id. This
5486 function does not do this in order to avoid wastefully creating
5487 SCOPE_REFs when they are not required.
5489 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5490 `template' keyword.
5492 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5493 uninstantiated templates.
5495 If *TEMPLATE_P is non-NULL, it is set to true iff the
5496 `template' keyword is used to explicitly indicate that the entity
5497 named is a template.
5499 If DECLARATOR_P is true, the id-expression is appearing as part of
5500 a declarator, rather than as part of an expression. */
5502 static cp_expr
5509 {
5513 /* Assume the `template' keyword was not used. */
5517 /* Look for the optional `::' operator. */
5518 global_scope_p
5519 = (!template_keyword_p
5524 /* Look for the optional nested-name-specifier. */
5525 nested_name_specifier_p
5528 check_dependency_p,
5530 declarator_p,
5531 template_keyword_p)
5534 /* If there is a nested-name-specifier, then we are looking at
5535 the first qualified-id production. */
5537 {
5538 tree saved_scope;
5539 tree saved_object_scope;
5540 tree saved_qualifying_scope;
5541 cp_expr unqualified_id;
5544 /* See if the next token is the `template' keyword. */
5548 /* Name lookup we do during the processing of the
5549 unqualified-id might obliterate SCOPE. */
5553 /* Process the final unqualified-id. */
5555 check_dependency_p,
5556 declarator_p,
5558 /* Restore the SAVED_SCOPE for our caller. */
5564 }
5565 /* Otherwise, if we are in global scope, then we are looking at one
5566 of the other qualified-id productions. */
5568 {
5570 tree id;
5572 /* Peek at the next token. */
5575 /* If it's an identifier, and the next token is not a "<", then
5576 we can avoid the template-id case. This is an optimization
5577 for this common case. */
5579 && !cp_parser_nth_token_starts_template_argument_list_p
5584 /* Try a template-id. */
5588 none_type,
5589 declarator_p);
5590 /* If that worked, we're done. */
5594 /* Peek at the next token. (Changes in the token buffer may
5595 have invalidated the pointer obtained above.) */
5599 {
5606 /* Fall through. */
5611 }
5612 }
5613 else
5616 declarator_p,
5617 optional_p);
5618 }
5620 /* Parse an unqualified-id.
5622 unqualified-id:
5623 identifier
5624 operator-function-id
5625 conversion-function-id
5626 ~ class-name
5627 template-id
5629 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5630 keyword, in a construct like `A::template ...'.
5632 Returns a representation of unqualified-id. For the `identifier'
5633 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5634 production a BIT_NOT_EXPR is returned; the operand of the
5635 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5636 other productions, see the documentation accompanying the
5637 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5638 names are looked up in uninstantiated templates. If DECLARATOR_P
5639 is true, the unqualified-id is appearing as part of a declarator,
5640 rather than as part of an expression. */
5642 static cp_expr
5648 {
5651 /* Peek at the next token. */
5655 {
5657 {
5658 tree id;
5660 /* We don't know yet whether or not this will be a
5661 template-id. */
5663 /* Try a template-id. */
5665 check_dependency_p,
5666 none_type,
5667 declarator_p);
5668 /* If it worked, we're done. */
5671 /* Otherwise, it's an ordinary identifier. */
5673 }
5677 check_dependency_p,
5678 none_type,
5679 declarator_p);
5682 {
5683 tree type_decl;
5684 tree qualifying_scope;
5685 tree object_scope;
5686 tree scope;
5689 /* Consume the `~' token. */
5691 /* Parse the class-name. The standard, as written, seems to
5692 say that:
5694 template <typename T> struct S { ~S (); };
5695 template <typename T> S<T>::~S() {}
5697 is invalid, since `~' must be followed by a class-name, but
5698 `S<T>' is dependent, and so not known to be a class.
5699 That's not right; we need to look in uninstantiated
5700 templates. A further complication arises from:
5702 template <typename T> void f(T t) {
5703 t.T::~T();
5704 }
5706 Here, it is not possible to look up `T' in the scope of `T'
5707 itself. We must look in both the current scope, and the
5708 scope of the containing complete expression.
5710 Yet another issue is:
5712 struct S {
5713 int S;
5714 ~S();
5715 };
5717 S::~S() {}
5719 The standard does not seem to say that the `S' in `~S'
5720 should refer to the type `S' and not the data member
5721 `S::S'. */
5723 /* DR 244 says that we look up the name after the "~" in the
5724 same scope as we looked up the qualifying name. That idea
5725 isn't fully worked out; it's more complicated than that. */
5730 /* Check for invalid scopes. */
5732 {
5736 }
5738 {
5742 scope);
5747 }
5750 /* If the name is of the form "X::~X" it's OK even if X is a
5751 typedef. */
5760 {
5763 }
5765 /* ~auto means the destructor of whatever the object is. */
5767 {
5770 "%<~auto%> only available with "
5774 }
5776 /* If there was an explicit qualification (S::~T), first look
5777 in the scope given by the qualification (i.e., S).
5779 Note: in the calls to cp_parser_class_name below we pass
5780 typename_type so that lookup finds the injected-class-name
5781 rather than the constructor. */
5785 {
5790 typename_type,
5793 declarator_p);
5796 }
5797 /* In "N::S::~S", look in "N" as well. */
5799 {
5804 type_decl
5808 typename_type,
5811 declarator_p);
5814 }
5815 /* In "p->S::~T", look in the scope given by "*p" as well. */
5817 {
5822 type_decl
5826 typename_type,
5829 declarator_p);
5832 }
5833 /* Look in the surrounding context. */
5835 {
5841 type_decl
5845 typename_type,
5848 declarator_p);
5851 {
5852 /* We couldn't find a type with this name. If we're parsing
5853 tentatively, fail and try something else. */
5855 {
5858 }
5859 /* Otherwise, accept it and check for a match at instantiation
5860 time. */
5865 }
5866 }
5867 /* If an error occurred, assume that the name of the
5868 destructor is the same as the name of the qualifying
5869 class. That allows us to keep parsing after running
5870 into ill-formed destructor names. */
5876 /* Check that destructor name and scope match. */
5878 {
5885 }
5887 /* [class.dtor]
5889 A typedef-name that names a class shall not be used as the
5890 identifier in the declarator for a destructor declaration. */
5897 type_decl);
5900 }
5904 {
5905 cp_expr id;
5907 /* This could be a template-id, so we try that first. */
5909 /* Try a template-id. */
5912 none_type,
5913 declarator_p);
5914 /* If that worked, we're done. */
5917 /* We still don't know whether we're looking at an
5918 operator-function-id or a conversion-function-id. */
5920 /* Try an operator-function-id. */
5922 /* If that didn't work, try a conversion-function-id. */
5926 {
5927 /* 17.6.3.3.5 */
5932 "literal operator suffixes not preceded by %<_%>"
5934 }
5937 }
5938 /* Fall through. */
5945 }
5946 }
5948 /* Parse an (optional) nested-name-specifier.
5950 nested-name-specifier: [C++98]
5951 class-or-namespace-name :: nested-name-specifier [opt]
5952 class-or-namespace-name :: template nested-name-specifier [opt]
5954 nested-name-specifier: [C++0x]
5955 type-name ::
5956 namespace-name ::
5957 nested-name-specifier identifier ::
5958 nested-name-specifier template [opt] simple-template-id ::
5960 PARSER->SCOPE should be set appropriately before this function is
5961 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5962 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5963 in name lookups.
5965 Sets PARSER->SCOPE to the class (TYPE) or namespace
5966 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5967 it unchanged if there is no nested-name-specifier. Returns the new
5968 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5970 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5971 part of a declaration and/or decl-specifier. */
5973 static tree
5980 {
5985 /* Remember where the nested-name-specifier starts. */
5987 {
5990 }
5993 {
5994 tree new_scope;
5995 tree old_scope;
5996 tree saved_qualifying_scope;
5998 /* Spot cases that cannot be the beginning of a
5999 nested-name-specifier. */
6002 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6003 the already parsed nested-name-specifier. */
6005 {
6006 /* Grab the nested-name-specifier and continue the loop. */
6008 /* If we originally encountered this nested-name-specifier
6009 with IS_DECLARATION set to false, we will not have
6010 resolved TYPENAME_TYPEs, so we must do so here. */
6013 {
6018 }
6021 }
6023 /* Spot cases that cannot be the beginning of a
6024 nested-name-specifier. On the second and subsequent times
6025 through the loop, we look for the `template' keyword. */
6027 ;
6028 /* A template-id can start a nested-name-specifier. */
6030 ;
6031 /* DR 743: decltype can be used in a nested-name-specifier. */
6033 ;
6034 else
6035 {
6036 /* If the next token is not an identifier, then it is
6037 definitely not a type-name or namespace-name. */
6040 /* If the following token is neither a `<' (to begin a
6041 template-id), nor a `::', then we are not looking at a
6042 nested-name-specifier. */
6048 {
6052 "found %<:%> in nested-name-specifier, "
6055 }
6058 && !cp_parser_nth_token_starts_template_argument_list_p
6061 }
6063 /* The nested-name-specifier is optional, so we parse
6064 tentatively. */
6067 /* Look for the optional `template' keyword, if this isn't the
6068 first time through the loop. */
6072 /* Save the old scope since the name lookup we are about to do
6073 might destroy it. */
6076 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6077 look up names in "X<T>::I" in order to determine that "Y" is
6078 a template. So, if we have a typename at this point, we make
6079 an effort to look through it. */
6081 && !typename_keyword_p
6086 /* Parse the qualifying entity. */
6087 new_scope
6089 typename_keyword_p,
6090 template_keyword_p,
6091 check_dependency_p,
6092 type_p,
6093 is_declaration);
6094 /* Look for the `::' token. */
6097 /* If we found what we wanted, we keep going; otherwise, we're
6098 done. */
6100 {
6103 /* Restore the OLD_SCOPE since it was valid before the
6104 failed attempt at finding the last
6105 class-or-namespace-name. */
6109 /* If the next token is a decltype, and the one after that is a
6110 `::', then the decltype has failed to resolve to a class or
6111 enumeration type. Give this error even when parsing
6112 tentatively since it can't possibly be valid--and we're going
6113 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6114 won't get another chance.*/
6118 {
6125 /* As below. */
6128 }
6132 {
6133 /* If we have a non-type template-id followed by ::, it can't
6134 possibly be valid. */
6139 {
6142 {
6148 }
6149 else
6150 {
6151 /* Variable template. */
6156 }
6163 /* As below. */
6167 }
6168 }
6172 /* If the next token is an identifier, and the one after
6173 that is a `::', then any valid interpretation would have
6174 found a class-or-namespace-name. */
6180 {
6183 {
6185 {
6186 tree decl;
6187 tree ambiguous_decls;
6190 none_type,
6199 decl);
6201 {
6202 // cp_parser_lookup_name has the same diagnostic,
6203 // thus make sure to emit it at most once.
6206 {
6211 }
6213 }
6214 else
6215 {
6217 cp_parser_name_lookup_error
6220 else
6221 cp_parser_name_lookup_error
6224 }
6225 }
6228 /* Treat this as a successful nested-name-specifier
6229 due to:
6231 [basic.lookup.qual]
6233 If the name found is not a class-name (clause
6234 _class_) or namespace-name (_namespace.def_), the
6235 program is ill-formed. */
6237 }
6239 }
6241 }
6242 /* We've found one valid nested-name-specifier. */
6244 /* Name lookup always gives us a DECL. */
6247 /* Uses of "template" must be followed by actual templates. */
6259 new_scope);
6260 /* If it is a class scope, try to complete it; we are about to
6261 be looking up names inside the class. */
6263 /* Since checking types for dependency can be expensive,
6264 avoid doing it if the type is already complete. */
6266 /* Do not try to complete dependent types. */
6268 {
6270 /* If it is a typedef to current class, use the current
6271 class instead, as the typedef won't have any names inside
6272 it yet. */
6276 }
6277 /* Make sure we look in the right scope the next time through
6278 the loop. */
6280 }
6282 /* If parsing tentatively, replace the sequence of tokens that makes
6283 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6284 token. That way, should we re-parse the token stream, we will
6285 not have to repeat the effort required to do the parse, nor will
6286 we issue duplicate error messages. */
6288 {
6292 /* Reset the contents of the START token. */
6294 /* Retrieve any deferred checks. Do not pop this access checks yet
6295 so the memory will not be reclaimed during token replacing below. */
6303 /* Purge all subsequent tokens. */
6305 }
6311 }
6313 /* Parse a nested-name-specifier. See
6314 cp_parser_nested_name_specifier_opt for details. This function
6315 behaves identically, except that it will an issue an error if no
6316 nested-name-specifier is present. */
6318 static tree
6324 {
6325 tree scope;
6327 /* Look for the nested-name-specifier. */
6329 typename_keyword_p,
6330 check_dependency_p,
6331 type_p,
6332 is_declaration);
6333 /* If it was not present, issue an error message. */
6335 {
6338 }
6341 }
6343 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6344 this is either a class-name or a namespace-name (which corresponds
6345 to the class-or-namespace-name production in the grammar). For
6346 C++0x, it can also be a type-name that refers to an enumeration
6347 type or a simple-template-id.
6349 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6350 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6351 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6352 TYPE_P is TRUE iff the next name should be taken as a class-name,
6353 even the same name is declared to be another entity in the same
6354 scope.
6356 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6357 specified by the class-or-namespace-name. If neither is found the
6358 ERROR_MARK_NODE is returned. */
6360 static tree
6367 {
6368 tree saved_scope;
6369 tree saved_qualifying_scope;
6370 tree saved_object_scope;
6371 tree scope;
6375 /* DR 743: decltype can appear in a nested-name-specifier. */
6377 {
6381 {
6384 }
6388 }
6390 /* Before we try to parse the class-name, we must save away the
6391 current PARSER->SCOPE since cp_parser_class_name will destroy
6392 it. */
6396 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6397 there is no need to look for a namespace-name. */
6398 only_class_p = template_keyword_p
6403 typename_keyword_p,
6404 template_keyword_p,
6406 check_dependency_p,
6408 is_declaration,
6411 /* If that didn't work, try for a namespace-name. */
6413 {
6414 /* Restore the saved scope. */
6418 /* If we are not looking at an identifier followed by the scope
6419 resolution operator, then this is not part of a
6420 nested-name-specifier. (Note that this function is only used
6421 to parse the components of a nested-name-specifier.) */
6426 }
6429 }
6431 /* Return true if we are looking at a compound-literal, false otherwise. */
6433 static bool
6435 {
6438 /* Skip tokens until the next token is a closing parenthesis.
6439 If we find the closing `)', and the next token is a `{', then
6440 we are looking at a compound-literal. */
6441 bool compound_literal_p
6446 /* Roll back the tokens we skipped. */
6450 }
6452 /* Parse a postfix-expression.
6454 postfix-expression:
6455 primary-expression
6456 postfix-expression [ expression ]
6457 postfix-expression ( expression-list [opt] )
6458 simple-type-specifier ( expression-list [opt] )
6459 typename :: [opt] nested-name-specifier identifier
6460 ( expression-list [opt] )
6461 typename :: [opt] nested-name-specifier template [opt] template-id
6462 ( expression-list [opt] )
6463 postfix-expression . template [opt] id-expression
6464 postfix-expression -> template [opt] id-expression
6465 postfix-expression . pseudo-destructor-name
6466 postfix-expression -> pseudo-destructor-name
6467 postfix-expression ++
6468 postfix-expression --
6469 dynamic_cast < type-id > ( expression )
6470 static_cast < type-id > ( expression )
6471 reinterpret_cast < type-id > ( expression )
6472 const_cast < type-id > ( expression )
6473 typeid ( expression )
6474 typeid ( type-id )
6476 GNU Extension:
6478 postfix-expression:
6479 ( type-id ) { initializer-list , [opt] }
6481 This extension is a GNU version of the C99 compound-literal
6482 construct. (The C99 grammar uses `type-name' instead of `type-id',
6483 but they are essentially the same concept.)
6485 If ADDRESS_P is true, the postfix expression is the operand of the
6486 `&' operator. CAST_P is true if this expression is the target of a
6487 cast.
6489 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6490 class member access expressions [expr.ref].
6492 Returns a representation of the expression. */
6494 static cp_expr
6498 {
6500 location_t loc;
6507 /* Peek at the next token. */
6512 /* Some of the productions are determined by keywords. */
6515 {
6520 {
6521 tree type;
6522 cp_expr expression;
6526 /* All of these can be handled in the same way from the point
6527 of view of parsing. Begin by consuming the token
6528 identifying the cast. */
6531 /* New types cannot be defined in the cast. */
6533 parser->type_definition_forbidden_message
6536 /* Look for the opening `<'. */
6538 /* Parse the type to which we are casting. */
6543 /* Look for the closing `>'. */
6545 /* Restore the old message. */
6548 bool saved_greater_than_is_operator_p
6552 /* And the expression which is being cast. */
6553 matching_parens parens;
6557 RT_CLOSE_PAREN);
6561 parser->greater_than_is_operator_p
6564 /* Only type conversions to integral or enumeration types
6565 can be used in constant-expressions. */
6568 {
6571 }
6574 {
6576 postfix_expression
6580 postfix_expression
6584 postfix_expression
6586 tf_warning_or_error);
6589 postfix_expression
6594 }
6596 /* Construct a location e.g. :
6597 reinterpret_cast <int *> (expr)
6598 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6599 ranging from the start of the "*_cast" token to the final closing
6600 paren, with the caret at the start. */
6603 }
6607 {
6608 tree type;
6612 /* Consume the `typeid' token. */
6614 /* Look for the `(' token. */
6615 matching_parens parens;
6617 /* Types cannot be defined in a `typeid' expression. */
6619 parser->type_definition_forbidden_message
6621 /* We can't be sure yet whether we're looking at a type-id or an
6622 expression. */
6624 /* Try a type-id first. */
6629 /* Look for the `)' token. Otherwise, we can't be sure that
6630 we're not looking at an expression: consider `typeid (int
6631 (3))', for example. */
6633 /* If all went well, simply lookup the type-id. */
6636 /* Otherwise, fall back to the expression variant. */
6637 else
6638 {
6639 tree expression;
6641 /* Look for an expression. */
6643 /* Compute its typeid. */
6645 /* Look for the `)' token. */
6647 }
6648 /* Restore the saved message. */
6650 /* `typeid' may not appear in an integral constant expression. */
6654 /* Construct a location e.g. :
6655 typeid (expr)
6656 ^~~~~~~~~~~~~
6657 ranging from the start of the "typeid" token to the final closing
6658 paren, with the caret at the start. */
6660 {
6661 location_t typeid_loc
6664 }
6665 }
6669 {
6670 tree type;
6671 /* The syntax permitted here is the same permitted for an
6672 elaborated-type-specifier. */
6679 }
6683 {
6684 location_t cilk_spawn_loc
6689 {
6694 }
6696 {
6701 }
6702 else
6703 {
6704 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6707 }
6709 postfix_expression =
6713 {
6717 }
6719 {
6724 }
6725 else
6726 {
6729 postfix_expression);
6730 /* Build a location of the form:
6731 _Cilk_spawn expr
6732 ~~~~~~~~~~~~^~~~
6733 with caret at the expr, ranging from the start of the
6734 _Cilk_spawn token to the end of the expression. */
6735 location_t combined_loc =
6741 }
6743 }
6748 {
6751 tree p;
6758 {
6761 }
6767 {
6770 postfix_expression
6772 else
6773 {
6777 }
6783 tf_warning_or_error);
6784 else
6785 {
6789 }
6794 postfix_expression
6798 postfix_expression
6801 else
6802 {
6806 }
6811 }
6813 }
6816 {
6817 tree type;
6819 /* If the next thing is a simple-type-specifier, we may be
6820 looking at a functional cast. We could also be looking at
6821 an id-expression. So, we try the functional cast, and if
6822 that doesn't work we fall back to the primary-expression. */
6824 /* Look for the simple-type-specifier. */
6828 CP_PARSER_FLAGS_NONE);
6830 /* Parse the cast itself. */
6832 postfix_expression
6834 /* If that worked, we're done. */
6838 /* If the functional-cast didn't work out, try a
6839 compound-literal. */
6842 {
6847 matching_parens parens;
6850 /* Avoid calling cp_parser_type_id pointlessly, see comment
6851 in cp_parser_cast_expression about c++/29234. */
6854 else
6855 {
6856 /* Parse the type. */
6862 }
6864 /* If things aren't going well, there's no need to
6865 keep going. */
6867 {
6869 /* Parse the brace-enclosed initializer list. */
6872 }
6873 /* If that worked, we're definitely looking at a
6874 compound-literal expression. */
6876 {
6877 /* Warn the user that a compound literal is not
6878 allowed in standard C++. */
6881 /* For simplicity, we disallow compound literals in
6882 constant-expressions. We could
6883 allow compound literals of integer type, whose
6884 initializer was a constant, in constant
6885 expressions. Permitting that usage, as a further
6886 extension, would not change the meaning of any
6887 currently accepted programs. (Of course, as
6888 compound literals are not part of ISO C++, the
6889 standard has nothing to say.) */
6891 NIC_NCC))
6892 {
6895 }
6896 /* Form the representation of the compound-literal. */
6897 postfix_expression
6902 }
6903 }
6905 /* It must be a primary-expression. */
6906 postfix_expression
6909 decltype_p,
6911 }
6913 }
6915 /* Note that we don't need to worry about calling build_cplus_new on a
6916 class-valued CALL_EXPR in decltype when it isn't the end of the
6917 postfix-expression; unary_complex_lvalue will take care of that for
6918 all these cases. */
6920 /* Keep looping until the postfix-expression is complete. */
6922 {
6926 /* It is not a Koenig lookup function call. */
6927 postfix_expression
6930 /* Peek at the next token. */
6934 {
6937 {
6939 "two consecutive %<[%> shall "
6942 }
6943 postfix_expression
6945 postfix_expression,
6947 decltype_p);
6956 /* postfix-expression ( expression-list [opt] ) */
6957 {
6968 is_builtin_constant_p
6971 {
6972 /* The whole point of __builtin_constant_p is to allow
6973 non-constant expressions to appear as arguments. */
6974 saved_integral_constant_expression_p
6976 saved_non_integral_constant_expression_p
6979 }
6980 args = (cp_parser_parenthesized_expression_list
6986 {
6987 parser->integral_constant_expression_p
6989 parser->non_integral_constant_expression_p
6991 }
6994 {
6997 }
6999 /* Function calls are not permitted in
7000 constant-expressions. */
7003 NIC_FUNC_CALL))
7004 {
7008 }
7013 {
7015 {
7017 {
7020 postfix_expression
7022 complain);
7023 }
7024 else
7025 postfix_expression
7027 }
7028 /* We do not perform argument-dependent lookup if
7029 normal lookup finds a non-function, in accordance
7030 with the expected resolution of DR 218. */
7033 {
7037 /* Do not do argument dependent lookup if regular
7038 lookup finds a member function or a block-scope
7039 function declaration. [basic.lookup.argdep]/3 */
7042 {
7045 postfix_expression
7047 complain);
7048 }
7049 }
7050 }
7056 {
7065 }
7068 {
7078 {
7080 postfix_expression
7084 }
7087 {
7088 postfix_expression
7089 = (build_new_method_call
7095 complain));
7096 }
7097 else
7098 postfix_expression
7102 complain);
7103 }
7107 postfix_expression = (build_offset_ref_call_from_tree
7109 complain));
7111 /* A call to a static class member, or a namespace-scope
7112 function. */
7113 postfix_expression
7116 koenig_p,
7117 complain);
7118 else
7119 /* All other function calls. */
7120 postfix_expression
7123 koenig_p,
7124 complain);
7127 {
7129 start_loc,
7130 close_paren_loc);
7132 }
7134 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7138 }
7143 /* postfix-expression . template [opt] id-expression
7144 postfix-expression . pseudo-destructor-name
7145 postfix-expression -> template [opt] id-expression
7146 postfix-expression -> pseudo-destructor-name */
7148 /* Consume the `.' or `->' operator. */
7151 postfix_expression
7153 postfix_expression,
7160 /* postfix-expression ++ */
7161 /* Consume the `++' token. */
7163 /* Generate a representation for the complete expression. */
7164 postfix_expression
7166 POSTINCREMENT_EXPR);
7167 /* Increments may not appear in constant-expressions. */
7175 /* postfix-expression -- */
7176 /* Consume the `--' token. */
7178 /* Generate a representation for the complete expression. */
7179 postfix_expression
7181 POSTDECREMENT_EXPR);
7182 /* Decrements may not appear in constant-expressions. */
7193 return is_member_access
7194 ? postfix_expression
7196 else
7198 }
7199 }
7201 /* We should never get here. */
7204 }
7206 /* This function parses Cilk Plus array notations. If a normal array expr. is
7207 parsed then the array index is passed back to the caller through *INIT_INDEX
7208 and the function returns a NULL_TREE. If array notation expr. is parsed,
7209 then *INIT_INDEX is ignored by the caller and the function returns
7210 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7211 error_mark_node. */
7213 static tree
7215 tree array_value)
7216 {
7220 {
7223 }
7232 {
7235 }
7237 {
7238 /* Consume the ':'. */
7241 /* If we are here, then we have a case like this A[:]. */
7243 {
7247 }
7251 }
7252 else
7253 {
7254 /* If we are here, then there are three valid possibilities:
7255 1. ARRAY [ EXP ]
7256 2. ARRAY [ EXP : EXP ]
7257 3. ARRAY [ EXP : EXP : EXP ] */
7261 {
7262 /* This indicates that we have a normal array expression. */
7265 }
7267 /* Consume the ':'. */
7271 {
7274 }
7275 }
7280 {
7284 }
7290 }
7292 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7293 by cp_parser_builtin_offsetof. We're looking for
7295 postfix-expression [ expression ]
7296 postfix-expression [ braced-init-list ] (C++11)
7298 FOR_OFFSETOF is set if we're being called in that context, which
7299 changes how we deal with integer constant expressions. */
7301 static tree
7303 tree postfix_expression,
7306 {
7311 /* Consume the `[' token. */
7317 /* Parse the index expression. */
7318 /* ??? For offsetof, there is a question of what to allow here. If
7319 offsetof is not being used in an integral constant expression context,
7320 then we *could* get the right answer by computing the value at runtime.
7321 If we are in an integral constant expression context, then we might
7322 could accept any constant expression; hard to say without analysis.
7323 Rather than open the barn door too wide right away, allow only integer
7324 constant expressions here. */
7327 else
7328 {
7330 {
7337 {
7339 "braced list index is not allowed with array "
7343 }
7344 }
7346 {
7347 /* Here are have these two options:
7348 ARRAY[EXP : EXP] - Array notation expr with default
7349 stride of 1.
7350 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7351 stride. */
7353 postfix_expression);
7356 }
7357 else
7359 }
7363 /* Look for the closing `]'. */
7366 /* Build the ARRAY_REF. */
7370 /* When not doing offsetof, array references are not permitted in
7371 constant-expressions. */
7377 }
7379 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7380 by cp_parser_builtin_offsetof. We're looking for
7382 postfix-expression . template [opt] id-expression
7383 postfix-expression . pseudo-destructor-name
7384 postfix-expression -> template [opt] id-expression
7385 postfix-expression -> pseudo-destructor-name
7387 FOR_OFFSETOF is set if we're being called in that context. That sorta
7388 limits what of the above we'll actually accept, but nevermind.
7389 TOKEN_TYPE is the "." or "->" token, which will already have been
7390 removed from the stream. */
7392 static tree
7395 cp_expr postfix_expression,
7397 location_t location)
7398 {
7399 tree name;
7405 /* If this is a `->' operator, dereference the pointer. */
7408 tf_warning_or_error);
7409 /* Check to see whether or not the expression is type-dependent and
7410 not the current instantiation. */
7412 /* The identifier following the `->' or `.' is not qualified. */
7418 /* Enter the scope corresponding to the type of the object
7419 given by the POSTFIX_EXPRESSION. */
7421 {
7423 /* According to the standard, no expression should ever have
7424 reference type. Unfortunately, we do not currently match
7425 the standard in this respect in that our internal representation
7426 of an expression may have reference type even when the standard
7427 says it does not. Therefore, we have to manually obtain the
7428 underlying type here. */
7430 /* The type of the POSTFIX_EXPRESSION must be complete. */
7431 /* Unlike the object expression in other contexts, *this is not
7432 required to be of complete type for purposes of class member
7433 access (5.2.5) outside the member function body. */
7436 && !(processing_template_decl
7437 && current_class_type
7438 && (same_type_ignoring_top_level_qualifiers_p
7440 {
7443 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7445 {
7446 /* In a template, be permissive by treating an object expression
7447 of incomplete type as dependent (after a pedwarn). */
7448 diagnostic_t kind = (processing_template_decl
7450 ? DK_PEDWARN
7452 cxx_incomplete_type_diagnostic
7458 {
7461 }
7462 }
7463 }
7466 {
7467 /* Let the name lookup machinery know that we are processing a
7468 class member access expression. */
7470 /* If something went wrong, we want to be able to discern that case,
7471 as opposed to the case where there was no SCOPE due to the type
7472 of expression being dependent. */
7475 /* If the SCOPE was erroneous, make the various semantic analysis
7476 functions exit quickly -- and without issuing additional error
7477 messages. */
7480 }
7481 }
7484 /* Tell cp_parser_lookup_name that there was an object, even though it's
7485 type-dependent. */
7488 /* Assume this expression is not a pseudo-destructor access. */
7491 /* If the SCOPE is a scalar type, then, if this is a valid program,
7492 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7493 is type dependent, it can be pseudo-destructor-name or something else.
7494 Try to parse it as pseudo-destructor-name first. */
7496 {
7497 tree s;
7498 tree type;
7501 /* Parse the pseudo-destructor-name. */
7510 {
7512 postfix_expression
7515 }
7516 }
7519 {
7520 /* If the SCOPE is not a scalar type, we are looking at an
7521 ordinary class member access expression, rather than a
7522 pseudo-destructor-name. */
7525 /* Parse the id-expression. */
7526 name = (cp_parser_id_expression
7533 /* In general, build a SCOPE_REF if the member name is qualified.
7534 However, if the name was not dependent and has already been
7535 resolved; there is no need to build the SCOPE_REF. For example;
7537 struct X { void f(); };
7538 template <typename T> void f(T* t) { t->X::f(); }
7540 Even though "t" is dependent, "X::f" is not and has been resolved
7541 to a BASELINK; there is no need to include scope information. */
7543 /* But we do need to remember that there was an explicit scope for
7544 virtual function calls. */
7548 /* If the name is a template-id that names a type, we will get a
7549 TYPE_DECL here. That is invalid code. */
7551 {
7554 }
7555 else
7556 {
7558 {
7560 {
7564 }
7565 else
7568 name,
7569 template_p);
7573 }
7575 adjust_result_of_qualified_name_lookup
7577 postfix_expression
7579 template_p,
7580 tf_warning_or_error);
7581 /* Build a location e.g.:
7582 ptr->access_expr
7583 ~~~^~~~~~~~~~~~~
7584 where the caret is at the deref token, ranging from
7585 the start of postfix_expression to the end of the access expr. */
7586 location_t end_loc
7588 location_t combined_loc
7591 }
7592 }
7594 /* We no longer need to look up names in the scope of the object on
7595 the left-hand side of the `.' or `->' operator. */
7598 /* Outside of offsetof, these operators may not appear in
7599 constant-expressions. */
7601 && (cp_parser_non_integral_constant_expression
7606 }
7608 /* Parse a parenthesized expression-list.
7610 expression-list:
7611 assignment-expression
7612 expression-list, assignment-expression
7614 attribute-list:
7615 expression-list
7616 identifier
7617 identifier, expression-list
7619 CAST_P is true if this expression is the target of a cast.
7621 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7622 argument pack.
7624 Returns a vector of trees. Each element is a representation of an
7625 assignment-expression. NULL is returned if the ( and or ) are
7626 missing. An empty, but allocated, vector is returned on no
7627 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7628 if we are parsing an attribute list for an attribute that wants a
7629 plain identifier argument, normal_attr for an attribute that wants
7630 an expression, or non_attr if we aren't parsing an attribute list. If
7631 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7632 not all of the expressions in the list were constant.
7633 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7634 will be written to with the location of the closing parenthesis. If
7635 an error occurs, it may or may not be written to. */
7644 {
7650 /* Assume all the expressions will be constant. */
7654 matching_parens parens;
7660 /* Within a parenthesized expression, a `>' token is always
7661 the greater-than operator. */
7662 saved_greater_than_is_operator_p
7666 /* Consume expressions until there are no more. */
7669 {
7670 tree expr;
7672 /* At the beginning of attribute lists, check to see if the
7673 next token is an identifier. */
7676 {
7679 /* Consume the identifier. */
7681 /* Save the identifier. */
7683 }
7684 else
7685 {
7688 /* Parse the next assignment-expression. */
7690 {
7691 /* A braced-init-list. */
7697 }
7699 {
7700 expr = (cp_parser_constant_expression
7705 }
7706 else
7708 cast_p);
7713 /* If we have an ellipsis, then this is an expression
7714 expansion. */
7717 {
7718 /* Consume the `...'. */
7721 /* Build the argument pack. */
7723 }
7725 /* Add it to the list. We add error_mark_node
7726 expressions to the list, so that we can still tell if
7727 the correct form for a parenthesized expression-list
7728 is found. That gives better errors. */
7733 }
7735 /* After the first item, attribute lists look the same as
7736 expression lists. */
7739 get_comma:;
7740 /* If the next token isn't a `,', then we are done. */
7744 /* Otherwise, consume the `,' and keep going. */
7746 }
7752 {
7755 skip_comma:;
7756 /* We try and resync to an unnested comma, as that will give the
7757 user better diagnostics. */
7765 {
7766 parser->greater_than_is_operator_p
7769 }
7770 }
7772 parser->greater_than_is_operator_p
7779 }
7781 /* Parse a pseudo-destructor-name.
7783 pseudo-destructor-name:
7784 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7785 :: [opt] nested-name-specifier template template-id :: ~ type-name
7786 :: [opt] nested-name-specifier [opt] ~ type-name
7788 If either of the first two productions is used, sets *SCOPE to the
7789 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7790 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7791 or ERROR_MARK_NODE if the parse fails. */
7793 static void
7795 tree object,
7798 {
7801 /* Handle ~auto. */
7805 {
7808 "%<~auto%> only available with "
7815 }
7817 /* Assume that things will not work out. */
7820 /* Look for the optional `::' operator. */
7822 /* Look for the optional nested-name-specifier. */
7823 nested_name_specifier_p
7830 /* Now, if we saw a nested-name-specifier, we might be doing the
7831 second production. */
7834 {
7835 /* Consume the `template' keyword. */
7837 /* Parse the template-id. */
7841 class_type,
7843 /* Look for the `::' token. */
7845 }
7846 /* If the next token is not a `~', then there might be some
7847 additional qualification. */
7849 {
7850 /* At this point, we're looking for "type-name :: ~". The type-name
7851 must not be a class-name, since this is a pseudo-destructor. So,
7852 it must be either an enum-name, or a typedef-name -- both of which
7853 are just identifiers. So, we peek ahead to check that the "::"
7854 and "~" tokens are present; if they are not, then we can avoid
7855 calling type_name. */
7859 {
7862 }
7864 /* Look for the type-name. */
7869 /* Look for the `::' token. */
7871 }
7872 else
7875 /* Look for the `~'. */
7878 /* Once we see the ~, this has to be a pseudo-destructor. */
7882 /* Look for the type-name again. We are not responsible for
7883 checking that it matches the first type-name. */
7885 }
7887 /* Parse a unary-expression.
7889 unary-expression:
7890 postfix-expression
7891 ++ cast-expression
7892 -- cast-expression
7893 unary-operator cast-expression
7894 sizeof unary-expression
7895 sizeof ( type-id )
7896 alignof ( type-id ) [C++0x]
7897 new-expression
7898 delete-expression
7900 GNU Extensions:
7902 unary-expression:
7903 __extension__ cast-expression
7904 __alignof__ unary-expression
7905 __alignof__ ( type-id )
7906 alignof unary-expression [C++0x]
7907 __real__ cast-expression
7908 __imag__ cast-expression
7909 && identifier
7910 sizeof ( type-id ) { initializer-list , [opt] }
7911 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7912 __alignof__ ( type-id ) { initializer-list , [opt] }
7914 ADDRESS_P is true iff the unary-expression is appearing as the
7915 operand of the `&' operator. CAST_P is true if this expression is
7916 the target of a cast.
7918 Returns a representation of the expression. */
7920 static cp_expr
7923 {
7927 /* Peek at the next token. */
7929 /* Some keywords give away the kind of expression. */
7931 {
7935 {
7938 {
7944 /* Consume the token. */
7946 /* Parse the operand. */
7951 else
7952 {
7953 /* ISO C++ defines alignof only with types, not with
7954 expressions. So pedwarn if alignof is used with a non-
7955 type expression. However, __alignof__ is ok. */
7958 "ISO C++ does not allow %<alignof%> "
7962 }
7963 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7964 SIZEOF_EXPR with the original operand. */
7966 {
7968 {
7970 {
7973 error_mark_node));
7975 }
7976 else
7980 }
7981 }
7983 /* Construct a location e.g. :
7984 alignof (expr)
7985 ^~~~~~~~~~~~~~
7986 with start == caret at the start of the "alignof"/"sizeof"
7987 token, with the endpoint at the final closing paren. */
7988 location_t finish_loc
7990 location_t compound_loc
7996 }
8005 {
8006 /* The saved value of the PEDANTIC flag. */
8008 tree expr;
8010 /* Save away the PEDANTIC flag. */
8012 /* Parse the cast-expression. */
8014 /* Restore the PEDANTIC flag. */
8018 }
8022 {
8023 tree expression;
8025 /* Consume the `__real__' or `__imag__' token. */
8027 /* Parse the cast-expression. */
8029 /* Create the complete representation. */
8033 expression,
8034 tf_warning_or_error);
8035 }
8043 {
8044 tree expr;
8051 matching_parens parens;
8055 parser->type_definition_forbidden_message
8058 saved_integral_constant_expression_p
8060 saved_non_integral_constant_expression_p
8064 saved_greater_than_is_operator_p
8076 parser->greater_than_is_operator_p
8079 parser->integral_constant_expression_p
8081 parser->non_integral_constant_expression_p
8088 }
8092 }
8093 }
8095 /* Look for the `:: new' and `:: delete', which also signal the
8096 beginning of a new-expression, or delete-expression,
8097 respectively. If the next token is `::', then it might be one of
8098 these. */
8100 {
8103 /* See if the token after the `::' is one of the keywords in
8104 which we're interested. */
8106 /* If it's `new', we have a new-expression. */
8109 /* Similarly, for `delete'. */
8112 }
8114 /* Look for a unary operator. */
8116 /* The `++' and `--' operators can be handled similarly, even though
8117 they are not technically unary-operators in the grammar. */
8119 {
8124 /* Handle the GNU address-of-label extension. */
8127 {
8128 tree identifier;
8129 tree expression;
8132 /* Consume the '&&' token. */
8134 /* Look for the identifier. */
8135 location_t finish_loc
8138 /* Construct a location of the form:
8139 &&label
8140 ^~~~~~~
8141 with caret==start at the "&&", finish at the end of the label. */
8142 location_t combined_loc
8144 /* Create an expression representing the address. */
8147 NIC_ADDR_LABEL))
8150 }
8151 }
8153 {
8154 cp_expr cast_expression;
8160 /* Consume the operator token. */
8164 /* Parse the cast-expression. */
8165 cast_expression
8170 pidk);
8172 /* Make a location:
8173 OP_TOKEN CAST_EXPRESSION
8174 ^~~~~~~~~~~~~~~~~~~~~~~~~
8175 with start==caret at the operator token, and
8176 extending to the end of the cast_expression. */
8179 /* Now, build an appropriate representation. */
8181 {
8185 RO_UNARY_STAR,
8186 complain);
8187 /* TODO: build_x_indirect_ref does not always honor the
8188 location, so ensure it is set. */
8194 /* Fall through. */
8197 cast_expression,
8198 complain);
8199 /* TODO: build_x_unary_op does not always honor the location,
8200 so ensure it is set. */
8208 /* Fall through. */
8210 /* Immediately fold negation of a constant, unless the constant is 0
8211 (since -0 == 0) or it would overflow. */
8216 {
8219 cast_expression);
8221 {
8224 }
8225 }
8226 /* Fall through. */
8235 }
8239 non_constant_p))
8243 }
8247 decltype_p,
8248 pidk);
8249 }
8251 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8252 unary-operator, the corresponding tree code is returned. */
8254 static enum tree_code
8256 {
8258 {
8279 }
8280 }
8282 /* Parse a new-expression.
8284 new-expression:
8285 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8286 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8288 Returns a representation of the expression. */
8290 static tree
8292 {
8295 tree type;
8298 tree ret;
8302 /* Look for the optional `::' operator. */
8303 global_scope_p
8307 /* Look for the `new' operator. */
8309 /* There's no easy way to tell a new-placement from the
8310 `( type-id )' construct. */
8312 /* Look for a new-placement. */
8314 /* If that didn't work out, there's no new-placement. */
8316 {
8320 }
8322 /* If the next token is a `(', then we have a parenthesized
8323 type-id. */
8325 {
8329 /* Consume the `('. */
8330 matching_parens parens;
8333 /* Parse the type-id. */
8334 parser->type_definition_forbidden_message
8336 {
8339 }
8342 /* Look for the closing `)'. */
8345 /* There should not be a direct-new-declarator in this production,
8346 but GCC used to allowed this, so we check and emit a sensible error
8347 message for this case. */
8349 {
8355 }
8356 }
8357 /* Otherwise, there must be a new-type-id. */
8358 else
8361 /* If the next token is a `(' or '{', then we have a new-initializer. */
8366 else
8369 /* A new-expression may not appear in an integral constant
8370 expression. */
8373 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8374 of a new-type-id or type-id of a new-expression, the new-expression shall
8375 contain a new-initializer of the form ( assignment-expression )".
8376 Additionally, consistently with the spirit of DR 1467, we want to accept
8377 'new auto { 2 }' too. */
8383 {
8385 "initialization of new-expression for type %<auto%> "
8388 }
8389 else
8390 {
8391 /* Construct a location e.g.:
8392 ptr = new int[100]
8393 ^~~~~~~~~~~~
8394 with caret == start at the start of the "new" token, and the end
8395 at the end of the final token we consumed. */
8400 /* Create a representation of the new-expression. */
8402 tf_warning_or_error);
8404 }
8412 }
8414 /* Parse a new-placement.
8416 new-placement:
8417 ( expression-list )
8419 Returns the same representation as for an expression-list. */
8423 {
8426 /* Parse the expression-list. */
8427 expression_list = (cp_parser_parenthesized_expression_list
8436 }
8438 /* Parse a new-type-id.
8440 new-type-id:
8441 type-specifier-seq new-declarator [opt]
8443 Returns the TYPE allocated. If the new-type-id indicates an array
8444 type, *NELTS is set to the number of elements in the last array
8445 bound; the TYPE will not include the last array bound. */
8447 static tree
8449 {
8450 cp_decl_specifier_seq type_specifier_seq;
8456 /* The type-specifier sequence must not contain type definitions.
8457 (It cannot contain declarations of new types either, but if they
8458 are not definitions we will catch that because they are not
8459 complete.) */
8461 parser->type_definition_forbidden_message
8463 /* Parse the type-specifier-seq. */
8467 /* Restore the old message. */
8473 /* Parse the new-declarator. */
8476 /* Determine the number of elements in the last array dimension, if
8477 any. */
8479 /* Skip down to the last array dimension. */
8484 {
8487 }
8492 {
8495 }
8498 {
8505 else
8507 }
8510 }
8512 /* Parse an (optional) new-declarator.
8514 new-declarator:
8515 ptr-operator new-declarator [opt]
8516 direct-new-declarator
8518 Returns the declarator. */
8522 {
8525 cp_cv_quals cv_quals;
8527 /* We don't know if there's a ptr-operator next, or not. */
8529 /* Look for a ptr-operator. */
8531 /* If that worked, look for more new-declarators. */
8533 {
8536 /* Parse another optional declarator. */
8539 declarator = cp_parser_make_indirect_declarator
8543 }
8545 /* If the next token is a `[', there is a direct-new-declarator. */
8550 }
8552 /* Parse a direct-new-declarator.
8554 direct-new-declarator:
8555 [ expression ]
8556 direct-new-declarator [constant-expression]
8558 */
8562 {
8566 {
8567 tree expression;
8570 /* Look for the opening `['. */
8575 /* The standard requires that the expression have integral
8576 type. DR 74 adds enumeration types. We believe that the
8577 real intent is that these expressions be handled like the
8578 expression in a `switch' condition, which also allows
8579 classes with a single conversion to integral or
8580 enumeration type. */
8582 {
8583 expression
8585 expression,
8588 {
8590 "expression in new-declarator must have integral "
8593 }
8594 }
8596 /* Look for the closing `]'. */
8599 /* Add this bound to the declarator. */
8602 /* If the next token is not a `[', then there are no more
8603 bounds. */
8606 }
8609 }
8611 /* Parse a new-initializer.
8613 new-initializer:
8614 ( expression-list [opt] )
8615 braced-init-list
8617 Returns a representation of the expression-list. */
8621 {
8625 {
8626 tree t;
8633 }
8634 else
8635 expression_list = (cp_parser_parenthesized_expression_list
8641 }
8643 /* Parse a delete-expression.
8645 delete-expression:
8646 :: [opt] delete cast-expression
8647 :: [opt] delete [ ] cast-expression
8649 Returns a representation of the expression. */
8651 static tree
8653 {
8656 tree expression;
8658 /* Look for the optional `::' operator. */
8659 global_scope_p
8663 /* Look for the `delete' keyword. */
8665 /* See if the array syntax is in use. */
8667 {
8668 /* Consume the `[' token. */
8670 /* Look for the `]' token. */
8672 /* Remember that this is the `[]' construct. */
8674 }
8675 else
8678 /* Parse the cast-expression. */
8681 /* A delete-expression may not appear in an integral constant
8682 expression. */
8687 tf_warning_or_error);
8688 }
8690 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8691 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8692 0 otherwise. */
8694 static int
8696 {
8699 {
8741 /* In ((type ()) () the last () isn't a valid cast-expression,
8742 so the whole must be parsed as postfix-expression. */
8747 /* '[' may start a primary-expression in obj-c++ and in C++11,
8748 as a lambda-expression, eg, '(void)[]{}'. */
8755 /* '++' and '--' may or may not start a cast-expression:
8757 struct T { void operator++(int); };
8758 void f() { (T())++; }
8760 vs
8762 int a;
8763 (int)++a; */
8768 }
8769 }
8771 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8772 in the order: const_cast, static_cast, reinterpret_cast.
8774 Don't suggest dynamic_cast.
8776 Return the first legal cast kind found, or NULL otherwise. */
8780 {
8781 tree trial;
8783 /* Reuse the parser logic by attempting to build the various kinds of
8784 cast, with "complain" disabled.
8785 Identify the first such cast that is valid. */
8787 /* Don't attempt to run such logic within template processing. */
8791 /* First try const_cast. */
8796 /* If that fails, try static_cast. */
8801 /* Finally, try reinterpret_cast. */
8806 /* No such cast possible. */
8808 }
8810 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8811 suggesting how to convert a C-style cast of the form:
8813 (DST_TYPE)ORIG_EXPR
8815 to a C++-style cast.
8817 The primary range of RICHLOC is asssumed to be that of the original
8818 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8819 of the parens in the C-style cast. */
8821 static void
8824 tree dst_type)
8825 {
8826 /* This function is non-trivial, so bail out now if the warning isn't
8827 going to be emitted. */
8831 /* Try to find a legal C++ cast, trying them in order:
8832 const_cast, static_cast, reinterpret_cast. */
8837 /* Replace the open paren with "CAST_SUGGESTION<". */
8838 pretty_printer pp;
8842 /* Replace the close paren with "> (". */
8845 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8847 }
8850 /* Parse a cast-expression.
8852 cast-expression:
8853 unary-expression
8854 ( type-id ) cast-expression
8856 ADDRESS_P is true iff the unary-expression is appearing as the
8857 operand of the `&' operator. CAST_P is true if this expression is
8858 the target of a cast.
8860 Returns a representation of the expression. */
8862 static cp_expr
8865 {
8866 /* If it's a `(', then we might be looking at a cast. */
8868 {
8874 /* There's no way to know yet whether or not this is a cast.
8875 For example, `(int (3))' is a unary-expression, while `(int)
8876 3' is a cast. So, we resort to parsing tentatively. */
8878 /* Types may not be defined in a cast. */
8880 parser->type_definition_forbidden_message
8882 /* Consume the `('. */
8883 matching_parens parens;
8888 /* A very tricky bit is that `(struct S) { 3 }' is a
8889 compound-literal (which we permit in C++ as an extension).
8890 But, that construct is not a cast-expression -- it is a
8891 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8892 is legal; if the compound-literal were a cast-expression,
8893 you'd need an extra set of parentheses.) But, if we parse
8894 the type-id, and it happens to be a class-specifier, then we
8895 will commit to the parse at that point, because we cannot
8896 undo the action that is done when creating a new class. So,
8897 then we cannot back up and do a postfix-expression.
8899 Another tricky case is the following (c++/29234):
8901 struct S { void operator () (); };
8903 void foo ()
8904 {
8905 ( S()() );
8906 }
8908 As a type-id we parse the parenthesized S()() as a function
8909 returning a function, groktypename complains and we cannot
8910 back up in this case either.
8912 Therefore, we scan ahead to the closing `)', and check to see
8913 if the tokens after the `)' can start a cast-expression. Otherwise
8914 we are dealing with an unary-expression, a postfix-expression
8915 or something else.
8917 Yet another tricky case, in C++11, is the following (c++/54891):
8919 (void)[]{};
8921 The issue is that usually, besides the case of lambda-expressions,
8922 the parenthesized type-id cannot be followed by '[', and, eg, we
8923 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8924 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8925 we don't commit, we try a cast-expression, then an unary-expression.
8927 Save tokens so that we can put them back. */
8930 /* We may be looking at a cast-expression. */
8933 cast_expression
8936 /* Roll back the tokens we skipped. */
8938 /* If we aren't looking at a cast-expression, simulate an error so
8939 that the call to cp_parser_error_occurred below returns true. */
8942 else
8943 {
8946 /* Look for the type-id. */
8948 /* Look for the closing `)'. */
8953 }
8955 /* Restore the saved message. */
8958 /* At this point this can only be either a cast or a
8959 parenthesized ctor such as `(T ())' that looks like a cast to
8960 function returning T. */
8962 {
8963 /* Only commit if the cast-expression doesn't start with
8964 '++', '--', or '[' in C++11. */
8972 pidk);
8975 {
8976 /* Warn about old-style casts, if so requested. */
8981 {
8987 }
8989 /* Only type conversions to integral or enumeration types
8990 can be used in constant-expressions. */
8993 NIC_CAST))
8996 /* Perform the cast. */
8997 /* Make a location:
8998 (TYPE) EXPR
8999 ^~~~~~~~~~~
9000 with start==caret at the open paren, extending to the
9001 end of "expr". */
9003 open_paren_loc,
9007 }
9008 }
9009 else
9011 }
9013 /* If we get here, then it's not a cast, so it must be a
9014 unary-expression. */
9017 }
9019 /* Parse a binary expression of the general form:
9021 pm-expression:
9022 cast-expression
9023 pm-expression .* cast-expression
9024 pm-expression ->* cast-expression
9026 multiplicative-expression:
9027 pm-expression
9028 multiplicative-expression * pm-expression
9029 multiplicative-expression / pm-expression
9030 multiplicative-expression % pm-expression
9032 additive-expression:
9033 multiplicative-expression
9034 additive-expression + multiplicative-expression
9035 additive-expression - multiplicative-expression
9037 shift-expression:
9038 additive-expression
9039 shift-expression << additive-expression
9040 shift-expression >> additive-expression
9042 relational-expression:
9043 shift-expression
9044 relational-expression < shift-expression
9045 relational-expression > shift-expression
9046 relational-expression <= shift-expression
9047 relational-expression >= shift-expression
9049 GNU Extension:
9051 relational-expression:
9052 relational-expression <? shift-expression
9053 relational-expression >? shift-expression
9055 equality-expression:
9056 relational-expression
9057 equality-expression == relational-expression
9058 equality-expression != relational-expression
9060 and-expression:
9061 equality-expression
9062 and-expression & equality-expression
9064 exclusive-or-expression:
9065 and-expression
9066 exclusive-or-expression ^ and-expression
9068 inclusive-or-expression:
9069 exclusive-or-expression
9070 inclusive-or-expression | exclusive-or-expression
9072 logical-and-expression:
9073 inclusive-or-expression
9074 logical-and-expression && inclusive-or-expression
9076 logical-or-expression:
9077 logical-and-expression
9078 logical-or-expression || logical-and-expression
9080 All these are implemented with a single function like:
9082 binary-expression:
9083 simple-cast-expression
9084 binary-expression <token> binary-expression
9086 CAST_P is true if this expression is the target of a cast.
9088 The binops_by_token map is used to get the tree codes for each <token> type.
9089 binary-expressions are associated according to a precedence table. */
9091 #define TOKEN_PRECEDENCE(token) \
9092 (((token->type == CPP_GREATER \
9093 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9094 && !parser->greater_than_is_operator_p) \
9095 ? PREC_NOT_OPERATOR \
9096 : binops_by_token[token->type].prec)
9098 static cp_expr
9104 {
9105 cp_parser_expression_stack stack;
9107 cp_parser_expression_stack_entry current;
9108 cp_expr rhs;
9112 tree overload;
9114 /* Parse the first expression. */
9125 {
9126 /* Get an operator token. */
9132 {
9134 "%<>>%> operator is treated"
9138 }
9143 /* This is a fold-expression; handle it later. */
9146 /* Popping an entry off the stack means we completed a subexpression:
9147 - either we found a token which is not an operator (`>' where it is not
9148 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9149 will happen repeatedly;
9150 - or, we found an operator which has lower priority. This is the case
9151 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9152 parsing `3 * 4'. */
9154 {
9157 else
9159 }
9161 get_rhs:
9165 /* We used the operator token. */
9168 /* For "false && x" or "true || x", x will never be executed;
9169 disable warnings while evaluating it. */
9171 c_inhibit_evaluation_warnings +=
9174 c_inhibit_evaluation_warnings +=
9177 /* Extract another operand. It may be the RHS of this expression
9178 or the LHS of a new, higher priority expression. */
9183 /* Get another operator token. Look up its precedence to avoid
9184 building a useless (immediately popped) stack entry for common
9185 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9192 {
9193 /* ... and prepare to parse the RHS of the new, higher priority
9194 expression. Since precedence levels on the stack are
9195 monotonically increasing, we do not have to care about
9196 stack overflows. */
9205 pop:
9207 /* If the stack is not empty, we have parsed into LHS the right side
9208 (`4' in the example above) of an expression we had suspended.
9209 We can use the information on the stack to recover the LHS (`3')
9210 from the stack together with the tree code (`MULT_EXPR'), and
9211 the precedence of the higher level subexpression
9212 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9213 which will be used to actually build the additive expression. */
9218 }
9220 /* Undo the disabling of warnings done above. */
9222 c_inhibit_evaluation_warnings -=
9225 c_inhibit_evaluation_warnings -=
9231 /* Avoid warning for !!x == y. */
9236 /* Avoid warning for !b == y where b is boolean. */
9240 /* Avoid warning for !!b == y where b is boolean. */
9253 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9254 ERROR_MARK for everything that is not a binary expression.
9255 This makes warn_about_parentheses miss some warnings that
9256 involve unary operators. For unary expressions we should
9257 pass the correct tree_code unless the unary expression was
9258 surrounded by parentheses.
9259 */
9266 == tcc_comparison
9269 else
9270 {
9275 /* TODO: build_x_binary_op doesn't always honor the location. */
9277 }
9280 /* If the binary operator required the use of an overloaded operator,
9281 then this expression cannot be an integral constant-expression.
9282 An overloaded operator can be used even if both operands are
9283 otherwise permissible in an integral constant-expression if at
9284 least one of the operands is of enumeration type. */
9288 NIC_OVERLOADED))
9290 }
9293 }
9295 static cp_expr
9300 {
9303 }
9305 /* Parse the `? expression : assignment-expression' part of a
9306 conditional-expression. The LOGICAL_OR_EXPR is the
9307 logical-or-expression that started the conditional-expression.
9308 Returns a representation of the entire conditional-expression.
9310 This routine is used by cp_parser_assignment_expression.
9312 ? expression : assignment-expression
9314 GNU Extensions:
9316 ? : assignment-expression */
9318 static tree
9320 {
9322 cp_expr assignment_expr;
9326 /* Consume the `?' token. */
9331 {
9334 /* Implicit true clause. */
9336 c_inhibit_evaluation_warnings +=
9339 }
9340 else
9341 {
9344 /* Parse the expression. */
9345 c_inhibit_evaluation_warnings +=
9348 c_inhibit_evaluation_warnings +=
9352 }
9354 /* The next token should be a `:'. */
9356 /* Parse the assignment-expression. */
9358 c_inhibit_evaluation_warnings -=
9361 /* Make a location:
9362 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9363 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9364 with the caret at the "?", ranging from the start of
9365 the logical_or_expr to the end of the assignment_expr. */
9370 /* Build the conditional-expression. */
9372 expr,
9373 assignment_expr,
9374 tf_warning_or_error);
9375 }
9377 /* Parse an assignment-expression.
9379 assignment-expression:
9380 conditional-expression
9381 logical-or-expression assignment-operator assignment_expression
9382 throw-expression
9384 CAST_P is true if this expression is the target of a cast.
9385 DECLTYPE_P is true if this expression is the operand of decltype.
9387 Returns a representation for the expression. */
9389 static cp_expr
9392 {
9393 cp_expr expr;
9395 /* If the next token is the `throw' keyword, then we're looking at
9396 a throw-expression. */
9399 /* Otherwise, it must be that we are looking at a
9400 logical-or-expression. */
9401 else
9402 {
9403 /* Parse the binary expressions (logical-or-expression). */
9405 decltype_p,
9407 /* If the next token is a `?' then we're actually looking at a
9408 conditional-expression. */
9411 else
9412 {
9415 /* If it's an assignment-operator, we're using the second
9416 production. */
9417 enum tree_code assignment_operator
9420 {
9423 /* Parse the right-hand side of the assignment. */
9430 /* An assignment may not appear in a
9431 constant-expression. */
9433 NIC_ASSIGNMENT))
9435 /* Build the assignment expression. Its default
9436 location:
9437 LHS = RHS
9438 ~~~~^~~~~
9439 is the location of the '=' token as the
9440 caret, ranging from the start of the lhs to the
9441 end of the rhs. */
9446 assignment_operator,
9447 rhs,
9449 /* TODO: build_x_modify_expr doesn't honor the location,
9450 so we must set it here. */
9452 }
9453 }
9454 }
9457 }
9459 /* Parse an (optional) assignment-operator.
9461 assignment-operator: one of
9462 = *= /= %= += -= >>= <<= &= ^= |=
9464 GNU Extension:
9466 assignment-operator: one of
9467 <?= >?=
9469 If the next token is an assignment operator, the corresponding tree
9470 code is returned, and the token is consumed. For example, for
9471 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9472 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9473 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9474 operator, ERROR_MARK is returned. */
9476 static enum tree_code
9478 {
9482 /* Peek at the next token. */
9486 {
9532 /* Nothing else is an assignment operator. */
9534 }
9536 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9541 /* If it was an assignment operator, consume it. */
9546 }
9548 /* Parse an expression.
9550 expression:
9551 assignment-expression
9552 expression , assignment-expression
9554 CAST_P is true if this expression is the target of a cast.
9555 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9556 except possibly parenthesized or on the RHS of a comma (N3276).
9558 Returns a representation of the expression. */
9560 static cp_expr
9563 {
9568 {
9569 cp_expr assignment_expression;
9571 /* Parse the next assignment-expression. */
9572 assignment_expression
9575 /* We don't create a temporary for a call that is the immediate operand
9576 of decltype or on the RHS of a comma. But when we see a comma, we
9577 need to create a temporary for a call on the LHS. */
9582 assignment_expression
9586 /* If this is the first assignment-expression, we can just
9587 save it away. */
9590 else
9591 {
9592 /* Create a location with caret at the comma, ranging
9593 from the start of the LHS to the end of the RHS. */
9598 assignment_expression,
9601 }
9602 /* If the next token is not a comma, or we're in a fold-expression, then
9603 we are done with the expression. */
9607 /* Consume the `,'. */
9610 /* A comma operator cannot appear in a constant-expression. */
9613 }
9616 }
9618 /* Parse a constant-expression.
9620 constant-expression:
9621 conditional-expression
9623 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9624 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9625 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9626 is false, NON_CONSTANT_P should be NULL. */
9628 static cp_expr
9632 {
9636 cp_expr expression;
9638 /* It might seem that we could simply parse the
9639 conditional-expression, and then check to see if it were
9640 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9641 one that the compiler can figure out is constant, possibly after
9642 doing some simplifications or optimizations. The standard has a
9643 precise definition of constant-expression, and we must honor
9644 that, even though it is somewhat more restrictive.
9646 For example:
9648 int i[(2, 3)];
9650 is not a legal declaration, because `(2, 3)' is not a
9651 constant-expression. The `,' operator is forbidden in a
9652 constant-expression. However, GCC's constant-folding machinery
9653 will fold this operation to an INTEGER_CST for `3'. */
9655 /* Save the old settings. */
9657 saved_allow_non_integral_constant_expression_p
9660 /* We are now parsing a constant-expression. */
9662 parser->allow_non_integral_constant_expression_p
9665 /* Although the grammar says "conditional-expression", we parse an
9666 "assignment-expression", which also permits "throw-expression"
9667 and the use of assignment operators. In the case that
9668 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9669 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9670 actually essential that we look for an assignment-expression.
9671 For example, cp_parser_initializer_clauses uses this function to
9672 determine whether a particular assignment-expression is in fact
9673 constant. */
9675 /* Restore the old settings. */
9676 parser->integral_constant_expression_p
9678 parser->allow_non_integral_constant_expression_p
9681 {
9682 /* Require an rvalue constant expression here; that's what our
9683 callers expect. Reference constant expressions are handled
9684 separately in e.g. cp_parser_template_argument. */
9693 }
9696 parser->non_integral_constant_expression_p
9700 }
9702 /* Parse __builtin_offsetof.
9704 offsetof-expression:
9705 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9707 offsetof-member-designator:
9708 id-expression
9709 | offsetof-member-designator "." id-expression
9710 | offsetof-member-designator "[" expression "]"
9711 | offsetof-member-designator "->" id-expression */
9713 static cp_expr
9715 {
9717 tree type;
9718 cp_expr expr;
9719 cp_id_kind dummy;
9721 location_t finish_loc;
9723 /* We're about to accept non-integral-constant things, but will
9724 definitely yield an integral constant expression. Save and
9725 restore these values around our local parsing. */
9731 /* Consume the "__builtin_offsetof" token. */
9733 /* Consume the opening `('. */
9734 matching_parens parens;
9736 /* Parse the type-id. */
9739 /* Look for the `,'. */
9743 /* Build the (type *)null that begins the traditional offsetof macro. */
9744 tree object_ptr
9746 tf_warning_or_error);
9748 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9752 {
9755 {
9757 /* offsetof-member-designator "[" expression "]" */
9763 /* offsetof-member-designator "->" identifier */
9766 /* FALLTHRU */
9769 /* offsetof-member-designator "." identifier */
9777 /* Consume the ")" token. */
9783 /* Error. We know the following require will fail, but
9784 that gives the proper error message. */
9789 }
9790 }
9792 success:
9793 /* Make a location of the form:
9794 __builtin_offsetof (struct s, f)
9795 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9796 with caret at the type-id, ranging from the start of the
9797 "_builtin_offsetof" token to the close paren. */
9799 /* The result will be an INTEGER_CST, so we need to explicitly
9800 preserve the location. */
9803 failure:
9808 }
9810 /* Parse a trait expression.
9812 Returns a representation of the expression, the underlying type
9813 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9815 static tree
9817 {
9818 cp_trait_kind kind;
9824 {
9926 }
9928 /* Consume the token. */
9931 matching_parens parens;
9934 {
9937 }
9943 {
9946 {
9949 }
9953 }
9955 {
9957 {
9961 {
9964 }
9968 }
9969 }
9973 /* Complete the trait expression, which may mean either processing
9974 the trait expr now or saving it for template instantiation. */
9976 {
9985 }
9986 }
9988 /* Parse a lambda expression.
9990 lambda-expression:
9991 lambda-introducer lambda-declarator [opt] compound-statement
9993 Returns a representation of the expression. */
9995 static cp_expr
9997 {
9999 tree type;
10007 {
10009 {
10013 }
10015 }
10017 {
10019 {
10022 }
10024 }
10026 /* We may be in the middle of deferred access check. Disable
10027 it now. */
10038 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10041 /* Now that we've started the type, add the capture fields for any
10042 explicit captures. */
10045 {
10046 /* Inside the class, surrounding template-parameter-lists do not apply. */
10047 unsigned int saved_num_template_parameter_lists
10051 bool fully_implicit_function_template_p
10055 bool auto_is_implicit_function_template_parm_p
10066 /* By virtue of defining a local class, a lambda expression has access to
10067 the private variables of enclosing classes. */
10075 {
10080 }
10082 {
10085 }
10087 /* The capture list was built up in reverse order; fix that now. */
10099 parser->fully_implicit_function_template_p
10103 parser->auto_is_implicit_function_template_parm_p
10105 }
10107 /* This field is only used during parsing of the lambda. */
10110 /* This lambda shouldn't have any proxies left at this point. */
10112 /* And now that we're done, push proxies for an enclosing lambda. */
10117 else
10125 }
10127 /* Parse the beginning of a lambda expression.
10129 lambda-introducer:
10130 [ lambda-capture [opt] ]
10132 LAMBDA_EXPR is the current representation of the lambda expression. */
10134 static void
10136 {
10137 /* Need commas after the first capture. */
10140 /* Eat the leading `['. */
10143 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10151 {
10154 }
10157 {
10159 tree capture_id;
10160 tree capture_init_expr;
10164 enum capture_kind_type
10165 {
10166 BY_COPY,
10167 BY_REFERENCE
10168 };
10172 {
10175 }
10179 else
10182 /* Possibly capture `this'. */
10184 {
10194 explicit_init_p);
10196 }
10198 /* Possibly capture `*this'. */
10201 {
10212 explicit_init_p);
10214 }
10216 /* Remember whether we want to capture as a reference or not. */
10218 {
10221 }
10223 /* Get the identifier. */
10228 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10229 delimiters, but I modified this to stop on unnested ']' as well. It
10230 was already changed to stop on unnested '}', so the
10231 "closing_parenthesis" name is no more misleading with my change. */
10232 {
10238 }
10240 /* Find the initializer for this capture. */
10244 {
10246 /* An explicit initializer exists. */
10249 "lambda capture initializers "
10255 {
10258 }
10259 }
10260 else
10261 {
10264 /* Turn the identifier into an id-expression. */
10265 capture_init_expr
10270 {
10273 }
10277 {
10280 capture_init_expr);
10284 }
10287 {
10290 capture_init_expr))
10294 }
10296 capture_init_expr
10297 = finish_id_expression
10299 capture_init_expr,
10313 {
10316 }
10317 else
10319 }
10323 {
10328 capture_id);
10332 "capture of %qD redundant with by-reference capture "
10334 }
10337 capture_id,
10338 capture_init_expr,
10340 explicit_init_p);
10341 }
10344 }
10346 /* Parse the (optional) middle of a lambda expression.
10348 lambda-declarator:
10349 < template-parameter-list [opt] >
10350 ( parameter-declaration-clause [opt] )
10351 attribute-specifier [opt]
10352 decl-specifier-seq [opt]
10353 exception-specification [opt]
10354 lambda-return-type-clause [opt]
10356 LAMBDA_EXPR is the current representation of the lambda expression. */
10358 static bool
10360 {
10361 /* 5.1.1.4 of the standard says:
10362 If a lambda-expression does not include a lambda-declarator, it is as if
10363 the lambda-declarator were ().
10364 This means an empty parameter list, no attributes, and no exception
10365 specification. */
10372 cp_decl_specifier_seq lambda_specs;
10375 /* The template-parameter-list is optional, but must begin with
10376 an opening angle if present. */
10378 {
10381 "lambda templates are only available with "
10383 else
10393 /* We just processed one more parameter list. */
10395 }
10397 /* The parameter-declaration-clause is optional (unless
10398 template-parameter-list was given), but must begin with an
10399 opening parenthesis if present. */
10401 {
10402 matching_parens parens;
10407 /* Parse parameters. */
10410 /* Default arguments shall not be specified in the
10411 parameter-declaration-clause of a lambda-declarator. */
10422 /* In the decl-specifier-seq of the lambda-declarator, each
10423 decl-specifier shall either be mutable or constexpr. */
10427 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10430 {
10435 }
10439 /* Parse optional exception specification. */
10442 /* Parse optional trailing return type. */
10444 {
10447 }
10449 /* The function parameters must be in scope all the way until after the
10450 trailing-return-type in case of decltype. */
10452 }
10456 /* Create the function call operator.
10458 Messing with declarators like this is no uglier than building up the
10459 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10460 other code. */
10461 {
10462 cp_decl_specifier_seq return_type_specs;
10464 tree fco;
10471 else
10472 /* Maybe we will deduce the return type later. */
10476 {
10480 else
10483 }
10488 sfk_none);
10493 VIRT_SPEC_UNSPECIFIED,
10494 REF_QUAL_NONE,
10495 tx_qual,
10496 exception_spec,
10502 declarator,
10503 attributes);
10505 {
10508 /* Give the object parameter a different name. */
10512 }
10514 {
10518 }
10527 }
10528 }
10530 /* Parse the body of a lambda expression, which is simply
10532 compound-statement
10534 but which requires special handling.
10535 LAMBDA_EXPR is the current representation of the lambda expression. */
10537 static void
10539 {
10544 else
10545 /* Still increment function_depth so that we don't GC in the
10546 middle of an expression. */
10550 /* Clear this in case we're in the middle of a default argument. */
10553 /* Finish the function call operator
10554 - class_specifier
10555 + late_parsing_for_member
10556 + function_definition_after_declarator
10557 + ctor_initializer_opt_and_function_body */
10558 {
10562 tree compound_stmt;
10564 matching_braces braces;
10570 /* 5.1.1.4 of the standard says:
10571 If a lambda-expression does not include a trailing-return-type, it
10572 is as if the trailing-return-type denotes the following type:
10573 * if the compound-statement is of the form
10574 { return attribute-specifier [opt] expression ; }
10575 the type of the returned expression after lvalue-to-rvalue
10576 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10577 (_conv.array_ 4.2), and function-to-pointer conversion
10578 (_conv.func_ 4.3);
10579 * otherwise, void. */
10581 /* In a lambda that has neither a lambda-return-type-clause
10582 nor a deducible form, errors should be reported for return statements
10583 in the body. Since we used void as the placeholder return type, parsing
10584 the body as usual will give such desired behavior. */
10588 {
10592 /* Parse tentatively in case there's more after the initial return
10593 statement. */
10604 {
10606 {
10611 }
10613 /* Will get error here if type not deduced yet. */
10617 }
10618 }
10621 {
10626 }
10630 out:
10632 }
10638 else
10640 }
10642 /* Statements [gram.stmt.stmt] */
10644 /* Parse a statement.
10646 statement:
10647 labeled-statement
10648 expression-statement
10649 compound-statement
10650 selection-statement
10651 iteration-statement
10652 jump-statement
10653 declaration-statement
10654 try-block
10656 C++11:
10658 statement:
10659 labeled-statement
10660 attribute-specifier-seq (opt) expression-statement
10661 attribute-specifier-seq (opt) compound-statement
10662 attribute-specifier-seq (opt) selection-statement
10663 attribute-specifier-seq (opt) iteration-statement
10664 attribute-specifier-seq (opt) jump-statement
10665 declaration-statement
10666 attribute-specifier-seq (opt) try-block
10668 init-statement:
10669 expression-statement
10670 simple-declaration
10672 TM Extension:
10674 statement:
10675 atomic-statement
10677 IN_COMPOUND is true when the statement is nested inside a
10678 cp_parser_compound_statement; this matters for certain pragmas.
10680 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10681 is a (possibly labeled) if statement which is not enclosed in braces
10682 and has an else clause. This is used to implement -Wparentheses.
10684 CHAIN is a vector of if-else-if conditions. */
10686 static void
10690 {
10695 restart:
10698 /* There is no statement yet. */
10704 /* In obj-c++, seeing '[[' might be the either the beginning of
10705 c++11 attributes, or a nested objc-message-expression. So
10706 let's parse the c++11 attributes tentatively. */
10710 {
10713 }
10715 /* Peek at the next token. */
10717 /* Remember the location of the first token in the statement. */
10719 /* If this is a keyword, then that will often determine what kind of
10720 statement we have. */
10722 {
10726 {
10729 /* Looks like a labeled-statement with a case label.
10730 Parse the label, and then use tail recursion to parse
10731 the statement. */
10749 {
10754 }
10755 else
10769 {
10774 }
10775 else
10776 {
10780 }
10784 /* Objective-C++ exception-handling constructs. */
10798 /* This must be a namespace alias definition. */
10814 /* It might be a keyword like `int' that can start a
10815 declaration-statement. */
10817 }
10818 }
10820 {
10821 /* If the next token is a `:', then we are looking at a
10822 labeled-statement. */
10825 {
10826 /* Looks like a labeled-statement with an ordinary label.
10827 Parse the label, and then use tail recursion to parse
10828 the statement. */
10833 }
10834 }
10835 /* Anything that starts with a `{' must be a compound-statement. */
10838 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10839 a statement all its own. */
10841 {
10842 /* Only certain OpenMP pragmas are attached to statements, and thus
10843 are considered statements themselves. All others are not. In
10844 the context of a compound, accept the pragma as a "statement" and
10845 return so that we can check for a close brace. Otherwise we
10846 require a real statement and must go back and read one. */
10852 }
10854 {
10857 }
10859 /* Everything else must be a declaration-statement or an
10860 expression-statement. Try for the declaration-statement
10861 first, unless we are looking at a `;', in which case we know that
10862 we have an expression-statement. */
10864 {
10866 {
10868 {
10869 /* Attributes should be parsed as part of the the
10870 declaration, so let's un-parse them. */
10873 }
10876 /* Try to parse the declaration-statement. */
10878 /* If that worked, we're done. */
10881 }
10882 /* All preceding labels have been parsed at this point. */
10886 /* Look for an expression-statement instead. */
10889 /* Handle [[fallthrough]];. */
10891 {
10892 /* The next token after the fallthrough attribute is ';'. */
10894 {
10895 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10897 IFN_FALLTHROUGH,
10900 }
10901 else
10905 }
10906 }
10908 /* Set the line number for the statement. */
10912 /* Allow "[[fallthrough]];", but warn otherwise. */
10915 OPT_Wattributes,
10917 }
10919 /* Parse the label for a labeled-statement, i.e.
10921 identifier :
10922 case constant-expression :
10923 default :
10925 GNU Extension:
10926 case constant-expression ... constant-expression : statement
10928 When a label is parsed without errors, the label is added to the
10929 parse tree by the finish_* functions, so this function doesn't
10930 have to return the label. */
10932 static void
10934 {
10939 /* The next token should be an identifier. */
10943 {
10946 }
10948 /* Remember whether this case or a user-defined label is allowed to fall
10949 through to. */
10954 {
10956 {
10960 /* Consume the `case' token. */
10962 /* Parse the constant-expression. */
10969 {
10970 /* Consume the `...' token. */
10976 /* We don't need to emit warnings here, as the common code
10977 will do this for us. */
10978 }
10979 else
10983 {
10987 }
10988 else
10991 expr);
10992 }
10996 /* Consume the `default' token. */
11000 {
11004 }
11005 else
11010 /* Anything else must be an ordinary label. */
11015 }
11017 /* Require the `:' token. */
11020 /* An ordinary label may optionally be followed by attributes.
11021 However, this is only permitted if the attributes are then
11022 followed by a semicolon. This is because, for backward
11023 compatibility, when parsing
11024 lab: __attribute__ ((unused)) int i;
11025 we want the attribute to attach to "i", not "lab". */
11028 {
11029 tree attrs;
11036 ;
11037 else
11039 }
11045 }
11047 /* Parse an expression-statement.
11049 expression-statement:
11050 expression [opt] ;
11052 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11053 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11054 indicates whether this expression-statement is part of an
11055 expression statement. */
11057 static tree
11059 {
11064 /* There might be attribute fallthrough. */
11067 /* If the next token is a ';', then there is no expression
11068 statement. */
11070 {
11074 {
11077 }
11078 }
11080 /* Handle [[fallthrough]];. */
11082 {
11083 /* The next token after the fallthrough attribute is ';'. */
11085 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11088 else
11092 }
11094 /* Allow "[[fallthrough]];", but warn otherwise. */
11099 /* Give a helpful message for "A<T>::type t;" and the like. */
11102 {
11109 {
11110 /* A::A a; */
11115 }
11116 }
11118 /* Consume the final `;'. */
11123 /* This is the final expression statement of a statement
11124 expression. */
11130 }
11132 /* Parse a compound-statement.
11134 compound-statement:
11135 { statement-seq [opt] }
11137 GNU extension:
11139 compound-statement:
11140 { label-declaration-seq [opt] statement-seq [opt] }
11142 label-declaration-seq:
11143 label-declaration
11144 label-declaration-seq label-declaration
11146 Returns a tree representing the statement. */
11148 static tree
11151 {
11152 tree compound_stmt;
11153 matching_braces braces;
11155 /* Consume the `{'. */
11162 /* Begin the compound-statement. */
11164 /* If the next keyword is `__label__' we have a label declaration. */
11167 /* Parse an (optional) statement-seq. */
11169 /* Finish the compound-statement. */
11171 /* Consume the `}'. */
11175 }
11177 /* Parse an (optional) statement-seq.
11179 statement-seq:
11180 statement
11181 statement-seq [opt] statement */
11183 static void
11185 {
11186 /* Scan statements until there aren't any more. */
11188 {
11191 /* If we are looking at a `}', then we have run out of
11192 statements; the same is true if we have reached the end
11193 of file, or have stumbled upon a stray '@end'. */
11200 /* If we are in a compound statement and find 'else' then
11201 something went wrong. */
11203 {
11206 else
11207 {
11210 }
11211 }
11213 /* Parse the statement. */
11215 }
11216 }
11218 /* Return true if we're looking at (init; cond), false otherwise. */
11220 static bool
11222 {
11223 /* Save tokens so that we can put them back. */
11226 /* Look for ';' that is not nested in () or {}. */
11229 CPP_SEMICOLON,
11232 /* Roll back the tokens we skipped. */
11236 }
11238 /* Parse a selection-statement.
11240 selection-statement:
11241 if ( init-statement [opt] condition ) statement
11242 if ( init-statement [opt] condition ) statement else statement
11243 switch ( init-statement [opt] condition ) statement
11245 Returns the new IF_STMT or SWITCH_STMT.
11247 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11248 is a (possibly labeled) if statement which is not enclosed in
11249 braces and has an else clause. This is used to implement
11250 -Wparentheses.
11252 CHAIN is a vector of if-else-if conditions. This is used to implement
11253 -Wduplicated-cond. */
11255 static tree
11258 {
11261 token_indent_info guard_tinfo;
11266 /* Peek at the next token. */
11270 /* See what kind of keyword it is. */
11273 {
11276 {
11277 tree statement;
11278 tree condition;
11283 RID_CONSTEXPR))
11284 {
11290 }
11292 /* Look for the `('. */
11293 matching_parens parens;
11295 {
11298 }
11300 /* Begin the selection-statement. */
11302 {
11305 }
11306 else
11309 /* Parse the optional init-statement. */
11311 {
11312 tree decl;
11315 "init-statement in selection statements only available "
11318 }
11320 /* Parse the condition. */
11322 /* Look for the `)'. */
11328 {
11332 /* Add the condition. */
11339 /* Parse the then-clause. */
11343 /* Outside a template, the non-selected branch of a constexpr
11344 if is a 'discarded statement', i.e. unevaluated. */
11349 {
11352 }
11355 guard_tinfo);
11362 {
11366 }
11368 /* If the next token is `else', parse the else-clause. */
11370 RID_ELSE))
11371 {
11375 {
11378 }
11380 guard_tinfo
11382 /* Consume the `else' keyword. */
11385 {
11387 RID_IF)
11389 {
11390 /* We've got "if (COND) else if (COND2)". Start
11391 the condition chain and add COND as the first
11392 element. */
11396 {
11397 /* Wrap it in a NOP_EXPR so that we can set the
11398 location of the condition. */
11400 condition);
11403 }
11404 }
11406 RID_IF))
11407 {
11408 /* This is if-else without subsequent if. Zap the
11409 condition chain; we would have already warned at
11410 this point. */
11413 }
11414 }
11416 /* Parse the else-clause. */
11422 /* If we are currently parsing a then-clause, then
11423 IF_P will not be NULL. We set it to true to
11424 indicate that this if statement has an else clause.
11425 This may trigger the Wparentheses warning below
11426 when we get back up to the parent if statement. */
11431 {
11435 }
11436 }
11437 else
11438 {
11439 /* This if statement does not have an else clause. If
11440 NESTED_IF is true, then the then-clause has an if
11441 statement which does have an else clause. We warn
11442 about the potential ambiguity. */
11445 "suggest explicit braces to avoid ambiguous"
11448 {
11449 /* We don't need the condition chain anymore. */
11452 }
11453 }
11455 /* Now we're all done with the if-statement. */
11457 }
11458 else
11459 {
11463 /* Add the condition. */
11466 /* Parse the body of the switch-statement. */
11472 guard_tinfo);
11476 /* Now we're all done with the switch-statement. */
11478 }
11481 }
11487 }
11488 }
11490 /* Parse a condition.
11492 condition:
11493 expression
11494 type-specifier-seq declarator = initializer-clause
11495 type-specifier-seq declarator braced-init-list
11497 GNU Extension:
11499 condition:
11500 type-specifier-seq declarator asm-specification [opt]
11501 attributes [opt] = assignment-expression
11503 Returns the expression that should be tested. */
11505 static tree
11507 {
11508 cp_decl_specifier_seq type_specifiers;
11512 /* Try the declaration first. */
11514 /* New types are not allowed in the type-specifier-seq for a
11515 condition. */
11517 parser->type_definition_forbidden_message
11519 /* Parse the type-specifier-seq. */
11521 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11524 /* Restore the saved message. */
11526 /* If all is well, we might be looking at a declaration. */
11528 {
11529 tree decl;
11530 tree asm_specification;
11531 tree attributes;
11535 /* Parse the declarator. */
11541 /* Parse the attributes. */
11543 /* Parse the asm-specification. */
11545 /* If the next token is not an `=' or '{', then we might still be
11546 looking at an expression. For example:
11548 if (A(a).x)
11550 looks like a decl-specifier-seq and a declarator -- but then
11551 there is no `=', so this is an expression. */
11556 /* If we did see an `=' or '{', then we are looking at a declaration
11557 for sure. */
11559 {
11560 tree pushed_scope;
11564 /* Create the declaration. */
11570 /* Parse the initializer. */
11572 {
11576 }
11577 else
11578 {
11579 /* Consume the `='. */
11582 }
11586 /* Process the initializer. */
11589 asm_specification,
11590 flags);
11596 }
11597 }
11598 /* If we didn't even get past the declarator successfully, we are
11599 definitely not looking at a declaration. */
11600 else
11603 /* Otherwise, we are looking at an expression. */
11605 }
11607 /* Parses a for-statement or range-for-statement until the closing ')',
11608 not included. */
11610 static tree
11612 {
11616 /* Begin the for-statement. */
11619 /* Parse the initialization. */
11624 else
11626 }
11628 static tree
11630 {
11631 /* Normal for loop */
11634 tree stmt;
11637 /* The init-statement has already been parsed in
11638 cp_parser_init_statement, so no work is needed here. */
11641 /* If there's a condition, process it. */
11645 {
11649 }
11651 /* Look for the `;'. */
11654 /* If there's an expression, process it. */
11660 }
11662 /* Tries to parse a range-based for-statement:
11664 range-based-for:
11665 decl-specifier-seq declarator : expression
11667 The decl-specifier-seq declarator and the `:' are already parsed by
11668 cp_parser_init_statement. If processing_template_decl it returns a
11669 newly created RANGE_FOR_STMT; if not, it is converted to a
11670 regular FOR_STMT. */
11672 static tree
11675 {
11682 /* Get the range declaration momentarily out of the way so that
11683 the range expression doesn't clash with it. */
11685 {
11687 {
11689 /* For decomposition declaration get all of the corresponding
11690 declarations out of the way. */
11694 {
11700 {
11706 }
11707 }
11708 }
11710 {
11715 }
11716 }
11719 {
11722 }
11723 else
11726 /* Put the range declaration(s) back into scope. */
11728 {
11732 }
11734 /* If in template, STMT is converted to a normal for-statement
11735 at instantiation. If not, it is done just ahead. */
11737 {
11745 /* do_auto_deduction doesn't mess with template init-lists. */
11748 }
11749 else
11750 {
11754 }
11756 }
11758 /* Subroutine of cp_convert_range_for: given the initializer expression,
11759 builds up the range temporary. */
11761 static tree
11763 {
11766 /* Find out the type deduced by the declaration
11767 `auto &&__range = range_expr'. */
11772 /* Create the __range variable. */
11779 }
11781 /* Used by cp_parser_range_for in template context: we aren't going to
11782 do a full conversion yet, but we still need to resolve auto in the
11783 type of the for-range-declaration if present. This is basically
11784 a shortcut version of cp_convert_range_for. */
11786 static void
11788 {
11791 {
11794 iter_type = (cp_parser_perform_range_for_lookup
11797 {
11799 iter_type);
11801 tf_warning_or_error);
11804 }
11805 }
11806 }
11808 /* Converts a range-based for-statement into a normal
11809 for-statement, as per the definition.
11811 for (RANGE_DECL : RANGE_EXPR)
11812 BLOCK
11814 should be equivalent to:
11816 {
11817 auto &&__range = RANGE_EXPR;
11818 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11819 __begin != __end;
11820 ++__begin)
11821 {
11822 RANGE_DECL = *__begin;
11823 BLOCK
11824 }
11825 }
11827 If RANGE_EXPR is an array:
11828 BEGIN_EXPR = __range
11829 END_EXPR = __range + ARRAY_SIZE(__range)
11830 Else if RANGE_EXPR has a member 'begin' or 'end':
11831 BEGIN_EXPR = __range.begin()
11832 END_EXPR = __range.end()
11833 Else:
11834 BEGIN_EXPR = begin(__range)
11835 END_EXPR = end(__range);
11837 If __range has a member 'begin' but not 'end', or vice versa, we must
11838 still use the second alternative (it will surely fail, however).
11839 When calling begin()/end() in the third alternative we must use
11840 argument dependent lookup, but always considering 'std' as an associated
11841 namespace. */
11843 tree
11847 {
11853 /* If an error happened previously do nothing or else a lot of
11854 unhelpful errors would be issued. */
11856 else
11857 {
11858 tree range_temp;
11862 /* Can't bind a reference to an array of runtime bound. */
11864 else
11865 {
11870 LOOKUP_ONLYCONVERTING);
11872 }
11875 }
11877 /* The new for initialization statement. */
11885 LOOKUP_ONLYCONVERTING);
11896 LOOKUP_ONLYCONVERTING);
11900 /* The new for condition. */
11907 /* The new increment expression. */
11910 tf_warning_or_error);
11913 /* The declaration is initialized with *__begin inside the loop body. */
11916 tf_warning_or_error),
11918 LOOKUP_ONLYCONVERTING);
11923 }
11925 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11926 We need to solve both at the same time because the method used
11927 depends on the existence of members begin or end.
11928 Returns the type deduced for the iterator expression. */
11930 static tree
11932 {
11934 {
11937 }
11940 {
11945 }
11947 {
11948 /* If RANGE is an array, we will use pointer arithmetic. */
11951 range,
11955 }
11956 else
11957 {
11958 /* If it is not an array, we must do a bit of magic. */
11968 tf_warning_or_error);
11971 tf_warning_or_error);
11974 {
11975 /* Use the member functions. */
11978 else
11984 else
11987 }
11988 else
11989 {
11990 /* Use global functions with ADL. */
11997 tf_warning_or_error);
11999 tf_warning_or_error);
12001 tf_warning_or_error);
12003 tf_warning_or_error);
12006 }
12008 /* Last common checks. */
12010 {
12011 /* If one of the expressions is an error do no more checks. */
12014 }
12017 /* Can happen, when, eg, in a template context, Koenig lookup
12018 can't resolve begin/end (c++/58503). */
12020 else
12021 {
12023 /* The unqualified type of the __begin and __end temporaries should
12024 be the same, as required by the multiple auto declaration. */
12026 {
12033 /* P0184R0 allows __begin and __end to have different types,
12034 but make sure they are comparable so we can give a better
12036 else
12040 }
12042 }
12043 }
12044 }
12046 /* Helper function for cp_parser_perform_range_for_lookup.
12047 Builds a tree for RANGE.IDENTIFIER(). */
12049 static tree
12051 {
12064 tf_warning_or_error);
12067 }
12069 /* Parse an iteration-statement.
12071 iteration-statement:
12072 while ( condition ) statement
12073 do statement while ( expression ) ;
12074 for ( init-statement condition [opt] ; expression [opt] )
12075 statement
12077 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12079 static tree
12081 {
12084 tree statement;
12086 token_indent_info guard_tinfo;
12088 /* Peek at the next token. */
12095 /* Remember whether or not we are already within an iteration
12096 statement. */
12099 /* See what kind of keyword it is. */
12102 {
12104 {
12105 tree condition;
12107 /* Begin the while-statement. */
12109 /* Look for the `('. */
12110 matching_parens parens;
12112 /* Parse the condition. */
12115 /* Look for the `)'. */
12117 /* Parse the dependent statement. */
12121 /* We're done with the while-statement. */
12123 }
12127 {
12128 tree expression;
12130 /* Begin the do-statement. */
12132 /* Parse the body of the do-statement. */
12137 /* Look for the `while' keyword. */
12139 /* Look for the `('. */
12140 matching_parens parens;
12142 /* Parse the expression. */
12144 /* We're done with the do-statement. */
12146 /* Look for the `)'. */
12148 /* Look for the `;'. */
12150 }
12154 {
12155 /* Look for the `('. */
12156 matching_parens parens;
12161 /* Look for the `)'. */
12164 /* Parse the body of the for-statement. */
12169 /* We're done with the for-statement. */
12171 }
12178 }
12181 }
12183 /* Parse a init-statement or the declarator of a range-based-for.
12184 Returns true if a range-based-for declaration is seen.
12186 init-statement:
12187 expression-statement
12188 simple-declaration */
12190 static bool
12192 {
12193 /* If the next token is a `;', then we have an empty
12194 expression-statement. Grammatically, this is also a
12195 simple-declaration, but an invalid one, because it does not
12196 declare anything. Therefore, if we did not handle this case
12197 specially, we would issue an error message about an invalid
12198 declaration. */
12200 {
12204 /* A colon is used in range-based for. */
12207 /* We're going to speculatively look for a declaration, falling back
12208 to an expression, if necessary. */
12210 /* Parse the declaration. */
12213 decl);
12216 {
12217 /* It is a range-for, consume the ':' */
12221 {
12223 "range-based %<for%> loops only available with "
12226 }
12227 }
12228 else
12229 /* The ';' is not consumed yet because we told
12230 cp_parser_simple_declaration not to. */
12235 /* If the tentative parse failed, then we shall need to look for an
12236 expression-statement. */
12237 }
12238 /* If we are here, it is an expression-statement. */
12241 }
12243 /* Parse a jump-statement.
12245 jump-statement:
12246 break ;
12247 continue ;
12248 return expression [opt] ;
12249 return braced-init-list ;
12250 goto identifier ;
12252 GNU extension:
12254 jump-statement:
12255 goto * expression ;
12257 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12259 static tree
12261 {
12267 /* Peek at the next token. */
12272 /* See what kind of keyword it is. */
12275 {
12279 {
12299 }
12305 {
12312 /* Fall through. */
12322 }
12327 {
12328 tree expr;
12332 {
12336 }
12339 else
12340 /* If the next token is a `;', then there is no
12341 expression. */
12343 /* Build the return-statement. */
12346 else
12348 /* Look for the final `;'. */
12350 }
12356 {
12359 }
12361 /* Create the goto-statement. */
12363 {
12364 /* Issue a warning about this use of a GNU extension. */
12366 /* Consume the '*' token. */
12368 /* Parse the dependent expression. */
12370 }
12371 else
12373 /* Look for the final `;'. */
12380 }
12383 }
12385 /* Parse a declaration-statement.
12387 declaration-statement:
12388 block-declaration */
12390 static void
12392 {
12395 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12398 /* Parse the block-declaration. */
12401 /* Free any declarators allocated. */
12403 }
12405 /* Some dependent statements (like `if (cond) statement'), are
12406 implicitly in their own scope. In other words, if the statement is
12407 a single statement (as opposed to a compound-statement), it is
12408 none-the-less treated as if it were enclosed in braces. Any
12409 declarations appearing in the dependent statement are out of scope
12410 after control passes that point. This function parses a statement,
12411 but ensures that is in its own scope, even if it is not a
12412 compound-statement.
12414 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12415 is a (possibly labeled) if statement which is not enclosed in
12416 braces and has an else clause. This is used to implement
12417 -Wparentheses.
12419 CHAIN is a vector of if-else-if conditions. This is used to implement
12420 -Wduplicated-cond.
12422 Returns the new statement. */
12424 static tree
12428 {
12429 tree statement;
12432 token_indent_info body_tinfo
12438 /* Mark if () ; with a special NOP_EXPR. */
12440 {
12451 }
12452 /* if a compound is opened, we simply parse the statement directly. */
12455 /* If the token is not a `{', then we must take special action. */
12456 else
12457 {
12458 /* Create a compound-statement. */
12460 /* Parse the dependent-statement. */
12463 /* Finish the dummy compound-statement. */
12465 }
12467 token_indent_info next_tinfo
12476 /* Return the statement. */
12478 }
12480 /* For some dependent statements (like `while (cond) statement'), we
12481 have already created a scope. Therefore, even if the dependent
12482 statement is a compound-statement, we do not want to create another
12483 scope. */
12485 static void
12488 {
12489 /* If the token is a `{', then we must take special action. */
12491 {
12492 token_indent_info body_tinfo
12498 token_indent_info next_tinfo
12507 }
12508 else
12509 {
12510 /* Avoid calling cp_parser_compound_statement, so that we
12511 don't create a new scope. Do everything else by hand. */
12512 matching_braces braces;
12514 /* If the next keyword is `__label__' we have a label declaration. */
12517 /* Parse an (optional) statement-seq. */
12520 }
12521 }
12523 /* Declarations [gram.dcl.dcl] */
12525 /* Parse an optional declaration-sequence.
12527 declaration-seq:
12528 declaration
12529 declaration-seq declaration */
12531 static void
12533 {
12535 {
12546 {
12547 /* A declaration consisting of a single semicolon is
12548 invalid. Allow it unless we're being pedantic. */
12553 }
12555 /* If we're entering or exiting a region that's implicitly
12556 extern "C", modify the lang context appropriately. */
12558 {
12561 }
12563 {
12566 }
12569 {
12570 /* A top-level declaration can consist solely of a #pragma.
12571 A nested declaration cannot, so this is done here and not
12572 in cp_parser_declaration. (A #pragma at block scope is
12573 handled in cp_parser_statement.) */
12576 }
12578 /* Parse the declaration itself. */
12580 }
12581 }
12583 /* Parse a declaration.
12585 declaration:
12586 block-declaration
12587 function-definition
12588 template-declaration
12589 explicit-instantiation
12590 explicit-specialization
12591 linkage-specification
12592 namespace-definition
12594 C++17:
12595 deduction-guide
12597 GNU extension:
12599 declaration:
12600 __extension__ declaration */
12602 static void
12604 {
12605 cp_token token1;
12606 cp_token token2;
12611 /* Check for the `__extension__' keyword. */
12613 {
12614 /* Parse the qualified declaration. */
12616 /* Restore the PEDANTIC flag. */
12620 }
12622 /* Try to figure out what kind of declaration is present. */
12627 else
12628 {
12631 }
12633 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12636 /* If the next token is `extern' and the following token is a string
12637 literal, then we have a linkage specification. */
12641 /* If the next token is `template', then we have either a template
12642 declaration, an explicit instantiation, or an explicit
12643 specialization. */
12645 {
12646 /* `template <>' indicates a template specialization. */
12650 /* `template <' indicates a template declaration. */
12653 /* Anything else must be an explicit instantiation. */
12654 else
12656 }
12657 /* If the next token is `export', then we have a template
12658 declaration. */
12661 /* If the next token is `extern', 'static' or 'inline' and the one
12662 after that is `template', we have a GNU extended explicit
12663 instantiation directive. */
12670 /* If the next token is `namespace', check for a named or unnamed
12671 namespace definition. */
12680 /* An unnamed namespace definition. */
12684 /* An inline (associated) namespace definition. */
12688 /* Objective-C++ declaration/definition. */
12695 /* At this point we may have a template declared by a concept
12696 introduction. */
12701 else
12702 /* Try to parse a block-declaration, or a function-definition. */
12705 /* Free any declarators allocated. */
12707 }
12709 /* Parse a block-declaration.
12711 block-declaration:
12712 simple-declaration
12713 asm-definition
12714 namespace-alias-definition
12715 using-declaration
12716 using-directive
12718 GNU Extension:
12720 block-declaration:
12721 __extension__ block-declaration
12723 C++0x Extension:
12725 block-declaration:
12726 static_assert-declaration
12728 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12729 part of a declaration-statement. */
12731 static void
12734 {
12738 /* Check for the `__extension__' keyword. */
12740 {
12741 /* Parse the qualified declaration. */
12743 /* Restore the PEDANTIC flag. */
12747 }
12749 /* Peek at the next token to figure out which kind of declaration is
12750 present. */
12753 /* If the next keyword is `asm', we have an asm-definition. */
12755 {
12759 }
12760 /* If the next keyword is `namespace', we have a
12761 namespace-alias-definition. */
12764 /* If the next keyword is `using', we have a
12765 using-declaration, a using-directive, or an alias-declaration. */
12767 {
12772 /* If the token after `using' is `namespace', then we have a
12773 using-directive. */
12777 /* If the second token after 'using' is '=', then we have an
12778 alias-declaration. */
12784 /* Otherwise, it's a using-declaration. */
12785 else
12788 }
12789 /* If the next keyword is `__label__' we have a misplaced label
12790 declaration. */
12792 {
12796 /* If the next token is now a `;', consume it. */
12799 }
12800 /* If the next token is `static_assert' we have a static assertion. */
12803 /* Anything else must be a simple-declaration. */
12804 else
12807 }
12809 /* Parse a simple-declaration.
12811 simple-declaration:
12812 decl-specifier-seq [opt] init-declarator-list [opt] ;
12813 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12814 brace-or-equal-initializer ;
12816 init-declarator-list:
12817 init-declarator
12818 init-declarator-list , init-declarator
12820 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12821 function-definition as a simple-declaration.
12823 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12824 parsed declaration if it is an uninitialized single declarator not followed
12825 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12826 if present, will not be consumed. */
12828 static void
12832 {
12833 cp_decl_specifier_seq decl_specifiers;
12842 /* Defer access checks until we know what is being declared; the
12843 checks for names appearing in the decl-specifier-seq should be
12844 done as if we were in the scope of the thing being declared. */
12847 /* Parse the decl-specifier-seq. We have to keep track of whether
12848 or not the decl-specifier-seq declares a named class or
12849 enumeration type, since that is the only case in which the
12850 init-declarator-list is allowed to be empty.
12852 [dcl.dcl]
12854 In a simple-declaration, the optional init-declarator-list can be
12855 omitted only when declaring a class or enumeration, that is when
12856 the decl-specifier-seq contains either a class-specifier, an
12857 elaborated-type-specifier, or an enum-specifier. */
12859 CP_PARSER_FLAGS_OPTIONAL,
12862 /* We no longer need to defer access checks. */
12865 /* In a block scope, a valid declaration must always have a
12866 decl-specifier-seq. By not trying to parse declarators, we can
12867 resolve the declaration/expression ambiguity more quickly. */
12870 {
12873 }
12875 /* If the next two tokens are both identifiers, the code is
12876 erroneous. The usual cause of this situation is code like:
12878 T t;
12880 where "T" should name a type -- but does not. */
12883 {
12884 /* If parsing tentatively, we should commit; we really are
12885 looking at a declaration. */
12887 /* Give up. */
12889 }
12891 /* If we have seen at least one decl-specifier, and the next token
12892 is not a parenthesis, then we must be looking at a declaration.
12893 (After "int (" we might be looking at a functional cast.) */
12900 /* Look for C++17 decomposition declaration. */
12908 {
12909 tree decl
12911 maybe_range_for_decl,
12914 /* The next token should be either a `,' or a `;'. */
12916 /* If it's a `;', we are done. */
12919 /* Anything else is an error. */
12920 else
12921 {
12922 /* If we have already issued an error message we don't need
12923 to issue another one. */
12928 /* Skip tokens until we reach the end of the statement. */
12930 /* If the next token is now a `;', consume it. */
12934 }
12935 }
12936 else
12939 tree last_type;
12941 /* NULL_TREE if both variable and function declaration are allowed,
12942 error_mark_node if function declaration are not allowed and
12943 a FUNCTION_DECL that should be diagnosed if it is followed by
12944 variable declarations. */
12945 tree auto_function_declaration;
12948 auto_specifier_p
12952 /* Keep going until we hit the `;' at the end of the simple
12953 declaration. */
12956 CPP_SEMICOLON))
12957 {
12960 tree decl;
12964 {
12965 /* If we are processing next declarator, comma is expected */
12970 {
12974 }
12975 }
12976 else
12979 /* Parse the init-declarator. */
12982 function_definition_allowed_p,
12984 declares_class_or_enum,
12986 maybe_range_for_decl,
12989 /* If an error occurred while parsing tentatively, exit quickly.
12990 (That usually happens when in the body of a function; each
12991 statement is treated as a declaration-statement until proven
12992 otherwise.) */
12997 {
12998 /* If the init-declarator-list contains more than one
12999 init-declarator, they shall all form declarations of
13000 variables. */
13002 auto_function_declaration
13006 {
13008 "non-variable %qD in declaration with more than one "
13013 }
13014 }
13018 {
13022 {
13023 /* If the list of declarators contains more than one declarator,
13024 the type of each declared variable is determined as described
13025 above. If the type deduced for the template parameter U is not
13026 the same in each deduction, the program is ill-formed. */
13031 }
13032 else
13034 }
13036 /* Handle function definitions specially. */
13038 {
13039 /* If the next token is a `,', then we are probably
13040 processing something like:
13042 void f() {}, *p;
13044 which is erroneous. */
13046 {
13049 "mixing"
13051 }
13052 /* Otherwise, we're done with the list of declarators. */
13053 else
13054 {
13057 }
13058 }
13061 /* The next token should be either a `,' or a `;'. */
13063 /* If it's a `,', there are more declarators to come. */
13066 /* If it's a `;', we are done. */
13070 {
13075 }
13076 /* Anything else is an error. */
13077 else
13078 {
13079 /* If we have already issued an error message we don't need
13080 to issue another one. */
13085 /* Skip tokens until we reach the end of the statement. */
13087 /* If the next token is now a `;', consume it. */
13091 }
13092 /* After the first time around, a function-definition is not
13093 allowed -- even if it was OK at first. For example:
13095 int i, f() {}
13097 is not valid. */
13099 }
13101 /* Issue an error message if no declarators are present, and the
13102 decl-specifier-seq does not itself declare a class or
13103 enumeration: [dcl.dcl]/3. */
13105 {
13107 {
13111 /* Ensure an error is issued anyway when finish_decltype_type,
13112 called via cp_parser_decl_specifier_seq, returns a class or
13113 an enumeration (c++/51786). */
13116 }
13117 /* Perform any deferred access checks. */
13119 }
13121 /* Consume the `;'. */
13122 finish:
13126 {
13132 }
13134 done:
13136 }
13138 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13139 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13140 initializer ; */
13142 static tree
13147 {
13152 /* Parse the identifier-list. */
13156 {
13164 }
13168 {
13174 else
13175 {
13178 }
13179 }
13185 tree pushed_scope;
13192 NULL_TREE);
13199 cp_expr e;
13200 cp_decl_specifier_seq decl_specs;
13205 {
13208 else
13211 tree elt_pushed_scope;
13217 {
13218 /* Ensure we've diagnosed redeclaration if we aren't creating
13219 a new VAR_DECL. */
13222 }
13223 else
13227 }
13230 {
13233 }
13237 {
13247 {
13251 }
13254 {
13258 }
13259 }
13261 {
13263 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13264 the underlying DECL. */
13266 }
13272 {
13275 }
13278 }
13280 /* Parse a decl-specifier-seq.
13282 decl-specifier-seq:
13283 decl-specifier-seq [opt] decl-specifier
13284 decl-specifier attribute-specifier-seq [opt] (C++11)
13286 decl-specifier:
13287 storage-class-specifier
13288 type-specifier
13289 function-specifier
13290 friend
13291 typedef
13293 GNU Extension:
13295 decl-specifier:
13296 attributes
13298 Concepts Extension:
13300 decl-specifier:
13301 concept
13303 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13305 The parser flags FLAGS is used to control type-specifier parsing.
13307 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13308 flags:
13310 1: one of the decl-specifiers is an elaborated-type-specifier
13311 (i.e., a type declaration)
13312 2: one of the decl-specifiers is an enum-specifier or a
13313 class-specifier (i.e., a type definition)
13315 */
13317 static void
13319 cp_parser_flags flags,
13322 {
13326 cp_decl_spec ds;
13328 /* Clear DECL_SPECS. */
13331 /* Assume no class or enumeration type is declared. */
13334 /* Keep reading specifiers until there are no more to read. */
13336 {
13341 /* Peek at the next token. */
13344 /* Save the first token of the decl spec list for error
13345 reporting. */
13348 /* Handle attributes. */
13350 {
13351 /* Parse the attributes. */
13354 /* In a sequence of declaration specifiers, c++11 attributes
13355 appertain to the type that precede them. In that case
13356 [dcl.spec]/1 says:
13358 The attribute-specifier-seq affects the type only for
13359 the declaration it appears in, not other declarations
13360 involving the same type.
13362 But for now let's force the user to position the
13363 attribute either at the beginning of the declaration or
13364 after the declarator-id, which would clearly mean that it
13365 applies to the declarator. */
13367 {
13369 /* The c++11 attribute is at the beginning of the
13370 declaration. It appertains to the entity being
13372 else
13373 {
13375 {
13376 /* This is an attribute following a
13377 class-specifier. */
13382 }
13383 else
13384 {
13385 decl_specs->std_attributes
13387 attrs);
13390 }
13392 }
13393 }
13395 decl_specs->attributes
13397 attrs);
13401 }
13402 /* Assume we will find a decl-specifier keyword. */
13404 /* If the next token is an appropriate keyword, we can simply
13405 add it to the list. */
13407 {
13408 /* decl-specifier:
13409 friend
13410 constexpr */
13413 {
13418 }
13419 else
13420 {
13422 /* Consume the token. */
13424 }
13437 /* function-specifier:
13438 inline
13439 virtual
13440 explicit */
13447 /* decl-specifier:
13448 typedef */
13451 /* Consume the token. */
13453 /* A constructor declarator cannot appear in a typedef. */
13455 /* The "typedef" keyword can only occur in a declaration; we
13456 may as well commit at this point. */
13463 /* storage-class-specifier:
13464 auto
13465 register
13466 static
13467 extern
13468 mutable
13470 GNU Extension:
13471 thread */
13474 {
13475 /* Consume the token. */
13478 /* Complain about `auto' as a storage specifier, if
13479 we're complaining about C++0x compatibility. */
13483 "%<auto%> changes meaning in C++11; "
13486 /* Set the storage class anyway. */
13488 token);
13489 }
13490 else
13491 /* C++0x auto type-specifier. */
13499 /* Consume the token. */
13502 token);
13505 /* Consume the token. */
13511 /* We did not yet find a decl-specifier yet. */
13514 }
13531 /* Constructors are a special case. The `S' in `S()' is not a
13532 decl-specifier; it is the beginning of the declarator. */
13533 constructor_p
13534 = (!found_decl_spec
13535 && constructor_possible_p
13536 && (cp_parser_constructor_declarator_p
13539 /* If we don't have a DECL_SPEC yet, then we must be looking at
13540 a type-specifier. */
13542 {
13545 tree type_spec;
13547 type_spec
13549 decl_specs,
13555 /* If this type-specifier referenced a user-defined type
13556 (a typedef, class-name, etc.), then we can't allow any
13557 more such type-specifiers henceforth.
13559 [dcl.spec]
13561 The longest sequence of decl-specifiers that could
13562 possibly be a type name is taken as the
13563 decl-specifier-seq of a declaration. The sequence shall
13564 be self-consistent as described below.
13566 [dcl.type]
13568 As a general rule, at most one type-specifier is allowed
13569 in the complete decl-specifier-seq of a declaration. The
13570 only exceptions are the following:
13572 -- const or volatile can be combined with any other
13573 type-specifier.
13575 -- signed or unsigned can be combined with char, long,
13576 short, or int.
13578 -- ..
13580 Example:
13582 typedef char* Pc;
13583 void g (const int Pc);
13585 Here, Pc is *not* part of the decl-specifier seq; it's
13586 the declarator. Therefore, once we see a type-specifier
13587 (other than a cv-qualifier), we forbid any additional
13588 user-defined types. We *do* still allow things like `int
13589 int' to be considered a decl-specifier-seq, and issue the
13590 error message later. */
13593 /* A constructor declarator cannot follow a type-specifier. */
13595 {
13600 }
13601 }
13603 /* If we still do not have a DECL_SPEC, then there are no more
13604 decl-specifiers. */
13609 /* After we see one decl-specifier, further decl-specifiers are
13610 always optional. */
13612 }
13614 /* Don't allow a friend specifier with a class definition. */
13619 }
13621 /* Parse an (optional) storage-class-specifier.
13623 storage-class-specifier:
13624 auto
13625 register
13626 static
13627 extern
13628 mutable
13630 GNU Extension:
13632 storage-class-specifier:
13633 thread
13635 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13637 static tree
13639 {
13641 {
13645 /* Fall through for C++98. */
13653 /* Consume the token. */
13658 }
13659 }
13661 /* Parse an (optional) function-specifier.
13663 function-specifier:
13664 inline
13665 virtual
13666 explicit
13668 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13669 Updates DECL_SPECS, if it is non-NULL. */
13671 static tree
13674 {
13677 {
13683 /* 14.5.2.3 [temp.mem]
13685 A member function template shall not be virtual. */
13689 else
13699 }
13701 /* Consume the token. */
13703 }
13705 /* Parse a linkage-specification.
13707 linkage-specification:
13708 extern string-literal { declaration-seq [opt] }
13709 extern string-literal declaration */
13711 static void
13713 {
13714 tree linkage;
13716 /* Look for the `extern' keyword. */
13719 /* Look for the string-literal. */
13722 /* Transform the literal into an identifier. If the literal is a
13723 wide-character string, or contains embedded NULs, then we can't
13724 handle it as the user wants. */
13727 {
13729 /* Assume C++ linkage. */
13731 }
13732 else
13735 /* We're now using the new linkage. */
13738 /* If the next token is a `{', then we're using the first
13739 production. */
13741 {
13745 /* Consume the `{' token. */
13746 matching_braces braces;
13748 /* Parse the declarations. */
13750 /* Look for the closing `}'. */
13752 }
13753 /* Otherwise, there's just one declaration. */
13754 else
13755 {
13758 saved_in_unbraced_linkage_specification_p
13762 parser->in_unbraced_linkage_specification_p
13764 }
13766 /* We're done with the linkage-specification. */
13768 }
13770 /* Parse a static_assert-declaration.
13772 static_assert-declaration:
13773 static_assert ( constant-expression , string-literal ) ;
13774 static_assert ( constant-expression ) ; (C++1Z)
13776 If MEMBER_P, this static_assert is a class member. */
13778 static void
13780 {
13781 tree condition;
13782 tree message;
13784 location_t saved_loc;
13787 /* Peek at the `static_assert' token so we can keep track of exactly
13788 where the static assertion started. */
13792 /* Look for the `static_assert' keyword. */
13794 RT_STATIC_ASSERT))
13797 /* We know we are in a static assertion; commit to any tentative
13798 parse. */
13802 /* Parse the `(' starting the static assertion condition. */
13803 matching_parens parens;
13806 /* Parse the constant-expression. Allow a non-constant expression
13807 here in order to give better diagnostics in finish_static_assert. */
13808 condition =
13814 {
13817 "static_assert without a message "
13819 /* Eat the ')' */
13824 }
13825 else
13826 {
13827 /* Parse the separating `,'. */
13830 /* Parse the string-literal message. */
13835 /* A `)' completes the static assertion. */
13841 }
13843 /* A semicolon terminates the declaration. */
13846 /* Complete the static assertion, which may mean either processing
13847 the static assert now or saving it for template instantiation. */
13849 }
13851 /* Parse the expression in decltype ( expression ). */
13853 static tree
13856 {
13858 tree expr;
13860 /* Since we're going to preserve any side-effects from this parse, set up a
13861 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13862 in the expression. */
13865 /* First, try parsing an id-expression. */
13876 {
13879 cp_id_kind idk;
13883 /* Lookup the name we got back from the id-expression. */
13893 {
13894 /* Complete lookup of the id-expression. */
13895 expr = (finish_id_expression
13908 /* We found an id-expression, but it was something that we
13909 should not have found. This is an error, not something
13910 we can recover from, so note that we found an
13911 id-expression and we'll recover as gracefully as
13912 possible. */
13914 }
13919 /* We have an id-expression. */
13921 }
13924 {
13925 /* Abort the id-expression parse. */
13928 /* Parsing tentatively, again. */
13931 /* Parse a class member access. */
13939 /* We have an id-expression. */
13941 }
13944 /* We have parsed the complete id-expression or member access. */
13946 else
13947 {
13948 /* Abort our attempt to parse an id-expression or member access
13949 expression. */
13952 /* Parse a full expression. */
13955 }
13958 }
13960 /* Parse a `decltype' type. Returns the type.
13962 simple-type-specifier:
13963 decltype ( expression )
13964 C++14 proposal:
13965 decltype ( auto ) */
13967 static tree
13969 {
13970 tree expr;
13979 {
13980 /* Already parsed. */
13983 }
13985 /* Look for the `decltype' token. */
13989 /* Parse the opening `('. */
13990 matching_parens parens;
13994 /* decltype (auto) */
13997 {
14004 }
14006 /* Types cannot be defined in a `decltype' expression. Save away the
14007 old message. */
14010 /* And create the new one. */
14011 parser->type_definition_forbidden_message
14014 /* The restrictions on constant-expressions do not apply inside
14015 decltype expressions. */
14016 saved_integral_constant_expression_p
14018 saved_non_integral_constant_expression_p
14022 /* Within a parenthesized expression, a `>' token is always
14023 the greater-than operator. */
14024 saved_greater_than_is_operator_p
14028 /* Do not actually evaluate the expression. */
14031 /* Do not warn about problems with the expression. */
14036 /* Go back to evaluating expressions. */
14040 /* The `>' token might be the end of a template-id or
14041 template-parameter-list now. */
14042 parser->greater_than_is_operator_p
14045 /* Restore the old message and the integral constant expression
14046 flags. */
14048 parser->integral_constant_expression_p
14050 parser->non_integral_constant_expression_p
14053 /* Parse to the closing `)'. */
14055 {
14059 }
14062 tf_warning_or_error);
14064 rewrite:
14065 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14066 it again. */
14075 }
14077 /* Special member functions [gram.special] */
14079 /* Parse a conversion-function-id.
14081 conversion-function-id:
14082 operator conversion-type-id
14084 Returns an IDENTIFIER_NODE representing the operator. */
14086 static tree
14088 {
14089 tree type;
14090 tree saved_scope;
14091 tree saved_qualifying_scope;
14092 tree saved_object_scope;
14095 /* Look for the `operator' token. */
14098 /* When we parse the conversion-type-id, the current scope will be
14099 reset. However, we need that information in able to look up the
14100 conversion function later, so we save it here. */
14104 /* We must enter the scope of the class so that the names of
14105 entities declared within the class are available in the
14106 conversion-type-id. For example, consider:
14108 struct S {
14109 typedef int I;
14110 operator I();
14111 };
14113 S::operator I() { ... }
14115 In order to see that `I' is a type-name in the definition, we
14116 must be in the scope of `S'. */
14119 /* Parse the conversion-type-id. */
14121 /* Leave the scope of the class, if any. */
14124 /* Restore the saved scope. */
14128 /* If the TYPE is invalid, indicate failure. */
14132 }
14134 /* Parse a conversion-type-id:
14136 conversion-type-id:
14137 type-specifier-seq conversion-declarator [opt]
14139 Returns the TYPE specified. */
14141 static tree
14143 {
14144 tree attributes;
14145 cp_decl_specifier_seq type_specifiers;
14147 tree type_specified;
14150 /* Parse the attributes. */
14154 parser->type_definition_forbidden_message
14157 /* Parse the type-specifiers. */
14164 /* If that didn't work, stop. */
14167 /* Parse the conversion-declarator. */
14175 /* Don't give this error when parsing tentatively. This happens to
14176 work because we always parse this definitively once. */
14179 {
14181 {
14184 }
14188 }
14191 }
14193 /* Parse an (optional) conversion-declarator.
14195 conversion-declarator:
14196 ptr-operator conversion-declarator [opt]
14198 */
14202 {
14205 cp_cv_quals cv_quals;
14207 /* We don't know if there's a ptr-operator next, or not. */
14209 /* Try the ptr-operator. */
14212 /* If it worked, look for more conversion-declarators. */
14214 {
14217 /* Parse another optional declarator. */
14220 declarator = cp_parser_make_indirect_declarator
14224 }
14227 }
14229 /* Parse an (optional) ctor-initializer.
14231 ctor-initializer:
14232 : mem-initializer-list
14234 Returns TRUE iff the ctor-initializer was actually present. */
14236 static bool
14238 {
14239 /* If the next token is not a `:', then there is no
14240 ctor-initializer. */
14242 {
14243 /* Do default initialization of any bases and members. */
14248 }
14250 /* Consume the `:' token. */
14252 /* And the mem-initializer-list. */
14256 }
14258 /* Parse a mem-initializer-list.
14260 mem-initializer-list:
14261 mem-initializer ... [opt]
14262 mem-initializer ... [opt] , mem-initializer-list */
14264 static void
14266 {
14271 /* Let the semantic analysis code know that we are starting the
14272 mem-initializer-list. */
14277 /* Loop through the list. */
14279 {
14280 tree mem_initializer;
14283 /* Parse the mem-initializer. */
14285 /* If the next token is a `...', we're expanding member initializers. */
14287 {
14288 /* Consume the `...'. */
14291 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14292 can be expanded but members cannot. */
14295 {
14300 }
14302 /* Construct the pack expansion type. */
14305 }
14308 {
14312 }
14313 /* Look for a target constructor. */
14317 {
14320 {
14324 }
14326 }
14327 /* Add it to the list, unless it was erroneous. */
14329 {
14332 }
14333 /* If the next token is not a `,', we're done. */
14336 /* Consume the `,' token. */
14338 }
14340 /* Perform semantic analysis. */
14343 }
14345 /* Parse a mem-initializer.
14347 mem-initializer:
14348 mem-initializer-id ( expression-list [opt] )
14349 mem-initializer-id braced-init-list
14351 GNU extension:
14353 mem-initializer:
14354 ( expression-list [opt] )
14356 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14357 class) or FIELD_DECL (for a non-static data member) to initialize;
14358 the TREE_VALUE is the expression-list. An empty initialization
14359 list is represented by void_list_node. */
14361 static tree
14363 {
14364 tree mem_initializer_id;
14365 tree expression_list;
14366 tree member;
14369 /* Find out what is being initialized. */
14371 {
14375 }
14376 else
14377 {
14381 }
14387 {
14394 }
14395 else
14396 {
14406 }
14416 }
14418 /* Parse a mem-initializer-id.
14420 mem-initializer-id:
14421 :: [opt] nested-name-specifier [opt] class-name
14422 decltype-specifier (C++11)
14423 identifier
14425 Returns a TYPE indicating the class to be initialized for the first
14426 production (and the second in C++11). Returns an IDENTIFIER_NODE
14427 indicating the data member to be initialized for the last production. */
14429 static tree
14431 {
14435 tree id;
14439 /* `typename' is not allowed in this context ([temp.res]). */
14441 {
14443 "keyword %<typename%> not allowed in this context (a qualified "
14446 }
14447 /* Look for the optional `::' operator. */
14448 global_scope_p
14452 /* Look for the optional nested-name-specifier. The simplest way to
14453 implement:
14455 [temp.res]
14457 The keyword `typename' is not permitted in a base-specifier or
14458 mem-initializer; in these contexts a qualified name that
14459 depends on a template-parameter is implicitly assumed to be a
14460 type name.
14462 is to assume that we have seen the `typename' keyword at this
14463 point. */
14464 nested_name_specifier_p
14473 /* If there is a `::' operator or a nested-name-specifier, then we
14474 are definitely looking for a class-name. */
14479 typename_type,
14483 /* Otherwise, we could also be looking for an ordinary identifier. */
14486 /* Try a decltype-specifier. */
14488 else
14489 /* Otherwise, try a class-name. */
14493 none_type,
14497 /* If we found one, we're done. */
14500 /* Otherwise, look for an ordinary identifier. */
14502 }
14504 /* Overloading [gram.over] */
14506 /* Parse an operator-function-id.
14508 operator-function-id:
14509 operator operator
14511 Returns an IDENTIFIER_NODE for the operator which is a
14512 human-readable spelling of the identifier, e.g., `operator +'. */
14514 static cp_expr
14516 {
14517 /* Look for the `operator' keyword. */
14520 /* And then the name of the operator itself. */
14522 }
14524 /* Return an identifier node for a user-defined literal operator.
14525 The suffix identifier is chained to the operator name identifier. */
14527 tree
14529 {
14530 tree identifier;
14537 }
14539 /* Parse an operator.
14541 operator:
14542 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14543 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14544 || ++ -- , ->* -> () []
14546 GNU Extensions:
14548 operator:
14549 <? >? <?= >?=
14551 Returns an IDENTIFIER_NODE for the operator which is a
14552 human-readable spelling of the identifier, e.g., `operator +'. */
14554 static cp_expr
14556 {
14561 /* Peek at the next token. */
14566 /* Figure out which operator we have. */
14568 {
14570 {
14573 /* The keyword should be either `new' or `delete'. */
14578 else
14581 /* Consume the `new' or `delete' token. */
14584 /* Peek at the next token. */
14586 /* If it's a `[' token then this is the array variant of the
14587 operator. */
14589 {
14590 /* Consume the `[' token. */
14592 /* Look for the `]' token. */
14598 }
14599 /* Otherwise, we have the non-array variant. */
14600 else
14606 }
14753 {
14754 /* Consume the `('. */
14755 matching_parens parens;
14757 /* Look for the matching `)'. */
14760 }
14763 /* Consume the `['. */
14765 /* Look for the matching `]'. */
14772 /* FALLTHRU */
14781 {
14788 /* Consume the string. */
14794 {
14797 }
14798 else
14799 {
14801 /* Look for the suffix identifier. */
14806 {
14810 }
14811 else
14812 {
14815 }
14816 }
14821 {
14824 }
14827 {
14830 }
14832 {
14835 }
14837 }
14840 /* Anything else is an error. */
14842 }
14844 /* If we have selected an identifier, we need to consume the
14845 operator token. */
14848 /* Otherwise, no valid operator name was present. */
14849 else
14850 {
14853 }
14856 }
14858 /* Parse a template-declaration.
14860 template-declaration:
14861 export [opt] template < template-parameter-list > declaration
14863 If MEMBER_P is TRUE, this template-declaration occurs within a
14864 class-specifier.
14866 The grammar rule given by the standard isn't correct. What
14867 is really meant is:
14869 template-declaration:
14870 export [opt] template-parameter-list-seq
14871 decl-specifier-seq [opt] init-declarator [opt] ;
14872 export [opt] template-parameter-list-seq
14873 function-definition
14875 template-parameter-list-seq:
14876 template-parameter-list-seq [opt]
14877 template < template-parameter-list >
14879 Concept Extensions:
14881 template-parameter-list-seq:
14882 template < template-parameter-list > requires-clause [opt]
14884 requires-clause:
14885 requires logical-or-expression */
14887 static void
14889 {
14890 /* Check for `export'. */
14892 {
14893 /* Consume the `export' token. */
14895 /* Warn that we do not support `export'. */
14897 }
14900 }
14902 /* Parse a template-parameter-list.
14904 template-parameter-list:
14905 template-parameter
14906 template-parameter-list , template-parameter
14908 Returns a TREE_LIST. Each node represents a template parameter.
14909 The nodes are connected via their TREE_CHAINs. */
14911 static tree
14913 {
14918 /* The loop below parses the template parms. We first need to know
14919 the total number of template parms to be able to compute proper
14920 canonical types of each dependent type. So after the loop, when
14921 we know the total number of template parms,
14922 end_template_parm_list computes the proper canonical types and
14923 fixes up the dependent types accordingly. */
14925 {
14926 tree parameter;
14929 location_t parm_loc;
14931 /* Parse the template-parameter. */
14936 /* Add it to the list. */
14939 parm_loc,
14940 parameter,
14941 is_non_type,
14942 is_parameter_pack);
14943 else
14944 {
14947 }
14949 /* If the next token is not a `,', we're done. */
14952 /* Otherwise, consume the `,' token. */
14954 }
14957 }
14959 /* Parse a introduction-list.
14961 introduction-list:
14962 introduced-parameter
14963 introduction-list , introduced-parameter
14965 introduced-parameter:
14966 ...[opt] identifier
14968 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14969 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14970 WILDCARD_DECL will also have DECL_NAME set and token location in
14971 DECL_SOURCE_LOCATION. */
14973 static tree
14975 {
14979 {
14984 /* Build placeholder. */
14992 /* If the next token is not a `,', we're done. */
14995 /* Otherwise, consume the `,' token. */
14997 }
14999 /* Convert the vec into a TREE_VEC. */
15002 tree parm;
15008 }
15010 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15011 is an abstract declarator. */
15015 {
15020 }
15022 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15023 is an abstract declarator. */
15027 {
15031 else
15033 }
15035 /* Returns true if DECL represents a constrained-parameter. */
15039 {
15044 }
15046 /* Returns true if PARM declares a constrained-parameter. */
15050 {
15052 }
15054 /* Check that the type parameter is only a declarator-id, and that its
15055 type is not cv-qualified. */
15057 bool
15060 {
15065 {
15068 }
15070 /* Don't allow cv-qualified type parameters. */
15073 {
15076 }
15079 }
15081 /* Finish parsing/processing a template type parameter and checking
15082 various restrictions. */
15086 tree id,
15088 {
15091 else
15093 }
15095 static tree
15097 {
15098 /* FIXME: This should probably be copied, and we may need to adjust
15099 the template parameter depths. */
15109 }
15111 /* Finish parsing/processing a template template parameter by borrowing
15112 the template parameter list from the prototype parameter. */
15114 static tree
15116 tree proto,
15117 tree id,
15119 {
15123 }
15125 /* Create a new non-type template parameter from the given PARM
15126 declarator. */
15128 static tree
15131 {
15137 }
15139 /* Build a constrained template parameter based on the PARMDECL
15140 declarator. The type of PARMDECL is the constrained type, which
15141 refers to the prototype template parameter that ultimately
15142 specifies the type of the declared parameter. */
15144 static tree
15149 {
15155 /* A template parameter constrained by a variadic concept shall also
15156 be declared as a template parameter pack. */
15161 /* Build the parameter. Return an error if the declarator was invalid. */
15162 tree parm;
15167 parmdecl);
15168 else
15173 /* Finish the parameter decl and create a node attaching the
15174 default argument and constraint. */
15179 }
15181 /* Returns true if the parsed type actually represents the declaration
15182 of a type template-parameter. */
15186 {
15189 }
15192 /* Returns true if the parsed type actually represents the declaration of
15193 a template template-parameter. */
15195 static bool
15197 {
15200 }
15202 /* Parse a default argument for a type template-parameter.
15203 Note that diagnostics are handled in cp_parser_template_parameter. */
15205 static tree
15207 {
15210 /* Consume the `=' token. */
15215 /* Parse the default-argument. */
15221 {
15225 }
15228 }
15230 /* Parse a default argument for a template template-parameter. */
15232 static tree
15234 {
15239 /* Consume the `='. */
15241 /* Parse the id-expression. */
15243 /* save token before parsing the id-expression, for error
15244 reporting */
15246 tree default_argument
15254 /* If the id-expression was a template-id that refers to
15255 a template-class, we already have the declaration here,
15256 so no further lookup is needed. */
15257 ;
15258 else
15259 /* Look up the name. */
15260 default_argument
15262 none_type,
15268 /* See if the default argument is valid. */
15272 }
15274 /* Parse a template-parameter.
15276 template-parameter:
15277 type-parameter
15278 parameter-declaration
15280 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15281 the parameter. The TREE_PURPOSE is the default value, if any.
15282 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15283 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15284 set to true iff this parameter is a parameter pack. */
15286 static tree
15289 {
15292 tree parm;
15294 /* Assume it is a type parameter or a template parameter. */
15296 /* Assume it not a parameter pack. */
15298 /* Peek at the next token. */
15300 /* If it is `template', we have a type-parameter. */
15303 /* If it is `class' or `typename' we do not know yet whether it is a
15304 type parameter or a non-type parameter. Consider:
15306 template <typename T, typename T::X X> ...
15308 or:
15310 template <class C, class D*> ...
15312 Here, the first parameter is a type parameter, and the second is
15313 a non-type parameter. We can tell by looking at the token after
15314 the identifier -- if it is a `,', `=', or `>' then we have a type
15315 parameter. */
15317 {
15318 /* Peek at the token after `class' or `typename'. */
15320 /* If it's an ellipsis, we have a template type parameter
15321 pack. */
15324 /* If it's an identifier, skip it. */
15327 /* Now, see if the token looks like the end of a template
15328 parameter. */
15333 }
15335 /* Otherwise, it is a non-type parameter or a constrained parameter.
15337 [temp.param]
15339 When parsing a default template-argument for a non-type
15340 template-parameter, the first non-nested `>' is taken as the end
15341 of the template parameter-list rather than a greater-than
15342 operator. */
15343 parameter_declarator
15350 /* If the parameter declaration is marked as a parameter pack, set
15351 *IS_PARAMETER_PACK to notify the caller. */
15356 {
15357 /* Can happen in some cases of erroneous input (c++/34892). */
15359 /* Consume the `...' for better error recovery. */
15361 }
15363 // The parameter may have been constrained.
15366 parameter_declarator,
15367 is_non_type,
15368 is_parameter_pack);
15370 // Now we're sure that the parameter is a non-type parameter.
15381 }
15383 /* Parse a type-parameter.
15385 type-parameter:
15386 class identifier [opt]
15387 class identifier [opt] = type-id
15388 typename identifier [opt]
15389 typename identifier [opt] = type-id
15390 template < template-parameter-list > class identifier [opt]
15391 template < template-parameter-list > class identifier [opt]
15392 = id-expression
15394 GNU Extension (variadic templates):
15396 type-parameter:
15397 class ... identifier [opt]
15398 typename ... identifier [opt]
15400 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15401 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15402 the declaration of the parameter.
15404 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15406 static tree
15408 {
15410 tree parameter;
15412 /* Look for a keyword to tell us what kind of parameter this is. */
15418 {
15421 {
15422 tree identifier;
15423 tree default_argument;
15425 /* If the next token is an ellipsis, we have a template
15426 argument pack. */
15428 {
15429 /* Consume the `...' token. */
15434 }
15436 /* If the next token is an identifier, then it names the
15437 parameter. */
15440 else
15443 /* Create the parameter. */
15446 /* If the next token is an `=', we have a default argument. */
15448 {
15449 default_argument
15452 /* Template parameter packs cannot have default
15453 arguments. */
15455 {
15458 "template parameter pack %qD cannot have a "
15460 else
15462 "template parameter packs cannot have "
15465 }
15468 }
15469 else
15472 /* Create the combined representation of the parameter and the
15473 default argument. */
15475 }
15479 {
15480 tree identifier;
15481 tree default_argument;
15483 /* Look for the `<'. */
15485 /* Parse the template-parameter-list. */
15487 /* Look for the `>'. */
15490 // If template requirements are present, parse them.
15492 {
15497 }
15499 /* Look for the `class' or 'typename' keywords. */
15501 /* If the next token is an ellipsis, we have a template
15502 argument pack. */
15504 {
15505 /* Consume the `...' token. */
15510 }
15511 /* If the next token is an `=', then there is a
15512 default-argument. If the next token is a `>', we are at
15513 the end of the parameter-list. If the next token is a `,',
15514 then we are at the end of this parameter. */
15518 {
15520 /* Treat invalid names as if the parameter were nameless. */
15523 }
15524 else
15527 /* Create the template parameter. */
15529 identifier);
15531 /* If the next token is an `=', then there is a
15532 default-argument. */
15534 {
15535 default_argument
15538 /* Template parameter packs cannot have default
15539 arguments. */
15541 {
15544 "template parameter pack %qD cannot "
15546 identifier);
15547 else
15551 }
15552 }
15553 else
15556 /* Create the combined representation of the parameter and the
15557 default argument. */
15559 }
15565 }
15568 }
15570 /* Parse a template-id.
15572 template-id:
15573 template-name < template-argument-list [opt] >
15575 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15576 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15577 returned. Otherwise, if the template-name names a function, or set
15578 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15579 names a class, returns a TYPE_DECL for the specialization.
15581 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15582 uninstantiated templates. */
15584 static tree
15590 {
15591 tree templ;
15592 tree arguments;
15593 tree template_id;
15598 /* If the next token corresponds to a template-id, there is no need
15599 to reparse it. */
15602 {
15605 }
15607 /* Avoid performing name lookup if there is no possibility of
15608 finding a template-id. */
15611 && !cp_parser_nth_token_starts_template_argument_list_p
15613 {
15616 }
15618 /* Remember where the template-id starts. */
15624 /* Parse the template-name. */
15627 check_dependency_p,
15628 is_declaration,
15629 tag_type,
15632 {
15635 }
15637 /* Since we're going to preserve any side-effects from this parse, set up a
15638 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15639 in the template arguments. */
15642 /* If we find the sequence `[:' after a template-name, it's probably
15643 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15644 parse correctly the argument list. */
15651 {
15653 /* Change `:' into `::'. */
15655 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15656 CPP_LESS. */
15659 /* Parse the arguments. */
15662 {
15663 /* If we couldn't parse an argument list, then we revert our changes
15664 and return simply an error. Maybe this is not a template-id
15665 after all. */
15670 }
15671 /* Otherwise, emit an error about the invalid digraph, but continue
15672 parsing because we got our argument list. */
15675 {
15678 "%<<:%> is an alternate spelling for %<[%>."
15681 {
15683 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15686 }
15687 }
15688 }
15689 else
15690 {
15691 /* Look for the `<' that starts the template-argument-list. */
15693 {
15696 }
15697 /* Parse the arguments. */
15699 }
15701 /* Set the location to be of the form:
15702 template-name < template-argument-list [opt] >
15703 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15704 with caret == start at the start of the template-name,
15705 ranging until the closing '>'. */
15706 location_t finish_loc
15708 location_t combined_loc
15711 /* Build a representation of the specialization. */
15714 TEMPLATE_ID_EXPR,
15718 {
15720 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15721 template (rather than some instantiation thereof) only if
15722 is not nested within some other construct. For example, in
15723 "template <typename T> void f(T) { A<T>::", A<T> is just an
15724 instantiation of A. */
15727 CPP_SCOPE));
15728 template_id
15730 }
15731 /* A template-like identifier may be a partial concept id. */
15737 {
15741 }
15742 else
15743 {
15744 /* If it's not a class-template or a template-template, it should be
15745 a function-template. */
15753 }
15755 /* If parsing tentatively, replace the sequence of tokens that makes
15756 up the template-id with a CPP_TEMPLATE_ID token. That way,
15757 should we re-parse the token stream, we will not have to repeat
15758 the effort required to do the parse, nor will we issue duplicate
15759 error messages about problems during instantiation of the
15760 template. */
15762 /* Don't do this if we had a parse error in a declarator; re-parsing
15763 might succeed if a name changes meaning (60361). */
15767 {
15768 /* Reset the contents of the START_OF_ID token. */
15772 /* We must mark the lookup as kept, so we don't throw it away on
15773 the first parse. */
15777 /* Retrieve any deferred checks. Do not pop this access checks yet
15778 so the memory will not be reclaimed during token replacing below. */
15784 /* Purge all subsequent tokens. */
15787 /* ??? Can we actually assume that, if template_id ==
15788 error_mark_node, we will have issued a diagnostic to the
15789 user, as opposed to simply marking the tentative parse as
15790 failed? */
15793 }
15797 }
15799 /* Parse a template-name.
15801 template-name:
15802 identifier
15804 The standard should actually say:
15806 template-name:
15807 identifier
15808 operator-function-id
15810 A defect report has been filed about this issue.
15812 A conversion-function-id cannot be a template name because they cannot
15813 be part of a template-id. In fact, looking at this code:
15815 a.operator K<int>()
15817 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15818 It is impossible to call a templated conversion-function-id with an
15819 explicit argument list, since the only allowed template parameter is
15820 the type to which it is converting.
15822 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15823 `template' keyword, in a construction like:
15825 T::template f<3>()
15827 In that case `f' is taken to be a template-name, even though there
15828 is no way of knowing for sure.
15830 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15831 name refers to a set of overloaded functions, at least one of which
15832 is a template, or an IDENTIFIER_NODE with the name of the template,
15833 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15834 names are looked up inside uninstantiated templates. */
15836 static tree
15843 {
15844 tree identifier;
15845 tree decl;
15848 /* If the next token is `operator', then we have either an
15849 operator-function-id or a conversion-function-id. */
15851 {
15852 /* We don't know whether we're looking at an
15853 operator-function-id or a conversion-function-id. */
15855 /* Try an operator-function-id. */
15857 /* If that didn't work, try a conversion-function-id. */
15859 {
15862 }
15863 }
15864 /* Look for the identifier. */
15865 else
15868 /* If we didn't find an identifier, we don't have a template-id. */
15872 /* If the name immediately followed the `template' keyword, then it
15873 is a template-name. However, if the next token is not `<', then
15874 we do not treat it as a template-name, since it is not being used
15875 as part of a template-id. This enables us to handle constructs
15876 like:
15878 template <typename T> struct S { S(); };
15879 template <typename T> S<T>::S();
15881 correctly. We would treat `S' as a template -- if it were `S<T>'
15882 -- but we do not if there is no `<'. */
15886 {
15887 /* In a declaration, in a dependent context, we pretend that the
15888 "template" keyword was present in order to improve error
15889 recovery. For example, given:
15891 template <typename T> void f(T::X<int>);
15893 we want to treat "X<int>" as a template-id. */
15895 && !template_keyword_p
15897 && check_dependency_p
15899 /* Do not do this for dtors (or ctors), since they never
15900 need the template keyword before their name. */
15902 {
15905 /* Explain what went wrong. */
15907 identifier);
15910 /* If parsing tentatively, find the location of the "<" token. */
15913 /* Parse the template arguments so that we can issue error
15914 messages about them. */
15917 /* Skip tokens until we find a good place from which to
15918 continue parsing. */
15923 /* If parsing tentatively, permanently remove the
15924 template argument list. That will prevent duplicate
15925 error messages from being issued about the missing
15926 "template" keyword. */
15933 }
15935 /* If the "template" keyword is present, then there is generally
15936 no point in doing name-lookup, so we just return IDENTIFIER.
15937 But, if the qualifying scope is non-dependent then we can
15938 (and must) do name-lookup normally. */
15940 {
15946 {
15947 /* We're optimizing away the call to cp_parser_lookup_name, but
15948 we still need to do this. */
15951 }
15952 }
15953 }
15955 /* Look up the name. */
15957 tag_type,
15960 check_dependency_p,
15966 /* If DECL is a template, then the name was a template-name. */
15968 {
15972 }
15973 else
15974 {
15975 /* The standard does not explicitly indicate whether a name that
15976 names a set of overloaded declarations, some of which are
15977 templates, is a template-name. However, such a name should
15978 be a template-name; otherwise, there is no way to form a
15979 template-id for the overloaded templates. */
15988 {
15989 /* The name does not name a template. */
15992 }
15993 }
15995 /* If DECL is dependent, and refers to a function, then just return
15996 its name; we will look it up again during template instantiation. */
15998 {
16002 }
16005 }
16007 /* Parse a template-argument-list.
16009 template-argument-list:
16010 template-argument ... [opt]
16011 template-argument-list , template-argument ... [opt]
16013 Returns a TREE_VEC containing the arguments. */
16015 static tree
16017 {
16022 tree vec;
16029 /* Even if the template-id appears in an integral
16030 constant-expression, the contents of the argument list do
16031 not. */
16037 /* Parse the arguments. */
16038 do
16039 {
16040 tree argument;
16043 /* Consume the comma. */
16046 /* Parse the template-argument. */
16049 /* If the next token is an ellipsis, we're expanding a template
16050 argument pack. */
16052 {
16054 {
16058 }
16059 /* Consume the `...' token. */
16062 /* Make the argument into a TYPE_PACK_EXPANSION or
16063 EXPR_PACK_EXPANSION. */
16065 }
16068 {
16072 {
16075 }
16076 else
16078 }
16080 }
16096 }
16098 /* Parse a template-argument.
16100 template-argument:
16101 assignment-expression
16102 type-id
16103 id-expression
16105 The representation is that of an assignment-expression, type-id, or
16106 id-expression -- except that the qualified id-expression is
16107 evaluated, so that the value returned is either a DECL or an
16108 OVERLOAD.
16110 Although the standard says "assignment-expression", it forbids
16111 throw-expressions or assignments in the template argument.
16112 Therefore, we use "conditional-expression" instead. */
16114 static tree
16116 {
16117 tree argument;
16123 cp_id_kind idk;
16125 /* There's really no way to know what we're looking at, so we just
16126 try each alternative in order.
16128 [temp.arg]
16130 In a template-argument, an ambiguity between a type-id and an
16131 expression is resolved to a type-id, regardless of the form of
16132 the corresponding template-parameter.
16134 Therefore, we try a type-id first. */
16137 /* If there was no error parsing the type-id but the next token is a
16138 '>>', our behavior depends on which dialect of C++ we're
16139 parsing. In C++98, we probably found a typo for '> >'. But there
16140 are type-id which are also valid expressions. For instance:
16142 struct X { int operator >> (int); };
16143 template <int V> struct Foo {};
16144 Foo<X () >> 5> r;
16146 Here 'X()' is a valid type-id of a function type, but the user just
16147 wanted to write the expression "X() >> 5". Thus, we remember that we
16148 found a valid type-id, but we still try to parse the argument as an
16149 expression to see what happens.
16151 In C++0x, the '>>' will be considered two separate '>'
16152 tokens. */
16156 {
16159 }
16160 else
16161 {
16162 /* If the next token isn't a `,' or a `>', then this argument wasn't
16163 really finished. This means that the argument is not a valid
16164 type-id. */
16167 /* If that worked, we're done. */
16170 }
16171 /* We're still not sure what the argument will be. */
16173 /* Try a template. */
16181 /* If the next token isn't a `,' or a `>', then this argument wasn't
16182 really finished. */
16186 {
16187 /* Figure out what is being referred to. If the id-expression
16188 was for a class template specialization, then we will have a
16189 TYPE_DECL at this point. There is no need to do name lookup
16190 at this point in that case. */
16193 none_type,
16199 /* Handle a constrained-type-specifier for a non-type template
16200 parameter. */
16206 }
16208 {
16212 }
16213 /* It must be a non-type argument. In C++17 any constant-expression is
16214 allowed. */
16218 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16220 -- an integral constant-expression of integral or enumeration
16221 type; or
16223 -- the name of a non-type template-parameter; or
16225 -- the name of an object or function with external linkage...
16227 -- the address of an object or function with external linkage...
16229 -- a pointer to member... */
16230 /* Look for a non-type template parameter. */
16232 {
16244 }
16246 /* If the next token is "&", the argument must be the address of an
16247 object or function with external linkage. */
16250 {
16253 }
16254 /* See if we might have an id-expression. */
16261 {
16264 address_p,
16271 else
16272 {
16273 tree probe;
16276 {
16277 /* Strip the dereference temporarily. */
16280 }
16282 /* If we're in a template, we represent a qualified-id referring
16283 to a static data member as a SCOPE_REF even if the scope isn't
16284 dependent so that we can check access control later. */
16289 {
16290 /* A variable without external linkage might still be a
16291 valid constant-expression, so no error is issued here
16292 if the external-linkage check fails. */
16295 }
16297 /* All overloaded functions are allowed; if the external
16298 linkage test does not pass, an error will be issued
16299 later. */
16300 ;
16304 /* A pointer-to-member. */
16305 ;
16307 ;
16308 else
16312 {
16315 tf_warning_or_error);
16316 else
16319 }
16320 }
16321 }
16322 /* If the argument started with "&", there are no other valid
16323 alternatives at this point. */
16325 {
16328 }
16330 general_expr:
16331 /* If the argument wasn't successfully parsed as a type-id followed
16332 by '>>', the argument can only be a constant expression now.
16333 Otherwise, we try parsing the constant-expression tentatively,
16334 because the argument could really be a type-id. */
16340 else
16341 {
16342 /* With C++17 generalized non-type template arguments we need to handle
16343 lvalue constant expressions, too. */
16346 }
16354 /* We did our best to parse the argument as a non type-id, but that
16355 was the only alternative that matched (albeit with a '>' after
16356 it). We can assume it's just a typo from the user, and a
16357 diagnostic will then be issued. */
16359 }
16361 /* Parse an explicit-instantiation.
16363 explicit-instantiation:
16364 template declaration
16366 Although the standard says `declaration', what it really means is:
16368 explicit-instantiation:
16369 template decl-specifier-seq [opt] declarator [opt] ;
16371 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16372 supposed to be allowed. A defect report has been filed about this
16373 issue.
16375 GNU Extension:
16377 explicit-instantiation:
16378 storage-class-specifier template
16379 decl-specifier-seq [opt] declarator [opt] ;
16380 function-specifier template
16381 decl-specifier-seq [opt] declarator [opt] ; */
16383 static void
16385 {
16387 cp_decl_specifier_seq decl_specifiers;
16392 /* Look for an (optional) storage-class-specifier or
16393 function-specifier. */
16395 {
16396 extension_specifier
16399 extension_specifier
16402 }
16404 /* Look for the `template' keyword. */
16406 /* Let the front end know that we are processing an explicit
16407 instantiation. */
16409 /* [temp.explicit] says that we are supposed to ignore access
16410 control while processing explicit instantiation directives. */
16412 /* Parse a decl-specifier-seq. */
16414 CP_PARSER_FLAGS_OPTIONAL,
16417 /* If there was exactly one decl-specifier, and it declared a class,
16418 and there's no declarator, then we have an explicit type
16419 instantiation. */
16421 {
16422 tree type;
16426 /* Turn access control back on for names used during
16427 template instantiation. */
16432 }
16433 else
16434 {
16436 tree decl;
16438 /* Parse the declarator. */
16439 declarator
16450 {
16453 "explicit instantiation shall not use"
16457 "explicit instantiation shall not use"
16462 /* Turn access control back on for names used during
16463 template instantiation. */
16465 /* Do the explicit instantiation. */
16467 }
16468 else
16469 {
16471 /* Skip the body of the explicit instantiation. */
16473 }
16474 }
16475 /* We're done with the instantiation. */
16481 }
16483 /* Parse an explicit-specialization.
16485 explicit-specialization:
16486 template < > declaration
16488 Although the standard says `declaration', what it really means is:
16490 explicit-specialization:
16491 template <> decl-specifier [opt] init-declarator [opt] ;
16492 template <> function-definition
16493 template <> explicit-specialization
16494 template <> template-declaration */
16496 static void
16498 {
16502 /* Look for the `template' keyword. */
16504 /* Look for the `<'. */
16506 /* Look for the `>'. */
16508 /* We have processed another parameter list. */
16510 /* [temp]
16512 A template ... explicit specialization ... shall not have C
16513 linkage. */
16515 {
16517 /* Give it C++ linkage to avoid confusing other parts of the
16518 front end. */
16521 }
16522 else
16524 /* Let the front end know that we are beginning a specialization. */
16526 {
16529 }
16531 /* If the next keyword is `template', we need to figure out whether
16532 or not we're looking a template-declaration. */
16534 {
16539 else
16541 }
16542 else
16543 /* Parse the dependent declaration. */
16549 /* We're done with the specialization. */
16551 /* For the erroneous case of a template with C linkage, we pushed an
16552 implicit C++ linkage scope; exit that scope now. */
16555 /* We're done with this parameter list. */
16557 }
16559 /* Parse a type-specifier.
16561 type-specifier:
16562 simple-type-specifier
16563 class-specifier
16564 enum-specifier
16565 elaborated-type-specifier
16566 cv-qualifier
16568 GNU Extension:
16570 type-specifier:
16571 __complex__
16573 Returns a representation of the type-specifier. For a
16574 class-specifier, enum-specifier, or elaborated-type-specifier, a
16575 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16577 The parser flags FLAGS is used to control type-specifier parsing.
16579 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16580 in a decl-specifier-seq.
16582 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16583 class-specifier, enum-specifier, or elaborated-type-specifier, then
16584 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16585 if a type is declared; 2 if it is defined. Otherwise, it is set to
16586 zero.
16588 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16589 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16590 is set to FALSE. */
16592 static tree
16594 cp_parser_flags flags,
16599 {
16605 /* Assume this type-specifier does not declare a new type. */
16608 /* And that it does not specify a cv-qualifier. */
16611 /* Peek at the next token. */
16614 /* If we're looking at a keyword, we can use that to guide the
16615 production we choose. */
16618 {
16623 /* Look for the enum-specifier. */
16625 /* If that worked, we're done. */
16627 {
16632 type_spec,
16633 token,
16636 }
16637 else
16640 /* Any of these indicate either a class-specifier, or an
16641 elaborated-type-specifier. */
16648 /* Parse tentatively so that we can back up if we don't find a
16649 class-specifier. */
16651 /* Look for the class-specifier. */
16654 /* If that worked, we're done. */
16656 {
16661 type_spec,
16662 token,
16665 }
16667 /* Fall through. */
16668 elaborated_type_specifier:
16669 /* We're declaring (not defining) a class or enum. */
16673 /* Fall through. */
16675 /* Look for an elaborated-type-specifier. */
16676 type_spec
16677 = (cp_parser_elaborated_type_specifier
16680 is_declaration));
16683 type_spec,
16684 token,
16707 /* The `__complex__' keyword is a GNU extension. */
16713 }
16715 /* Handle simple keywords. */
16717 {
16719 {
16722 }
16724 }
16726 /* If we do not already have a type-specifier, assume we are looking
16727 at a simple-type-specifier. */
16729 decl_specs,
16730 flags);
16732 /* If we didn't find a type-specifier, and a type-specifier was not
16733 optional in this context, issue an error message. */
16735 {
16738 }
16741 }
16743 /* Parse a simple-type-specifier.
16745 simple-type-specifier:
16746 :: [opt] nested-name-specifier [opt] type-name
16747 :: [opt] nested-name-specifier template template-id
16748 char
16749 wchar_t
16750 bool
16751 short
16752 int
16753 long
16754 signed
16755 unsigned
16756 float
16757 double
16758 void
16760 C++11 Extension:
16762 simple-type-specifier:
16763 auto
16764 decltype ( expression )
16765 char16_t
16766 char32_t
16767 __underlying_type ( type-id )
16769 C++17 extension:
16771 nested-name-specifier(opt) template-name
16773 GNU Extension:
16775 simple-type-specifier:
16776 __int128
16777 __typeof__ unary-expression
16778 __typeof__ ( type-id )
16779 __typeof__ ( type-id ) { initializer-list , [opt] }
16781 Concepts Extension:
16783 simple-type-specifier:
16784 constrained-type-specifier
16786 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16787 appropriately updated. */
16789 static tree
16792 cp_parser_flags flags)
16793 {
16798 /* Peek at the next token. */
16801 /* If we're looking at a keyword, things are easy. */
16803 {
16838 {
16841 }
16870 {
16871 /* The 'auto' might be the placeholder return type for a function decl
16872 with trailing return type. */
16881 {
16883 {
16890 }
16893 {
16896 }
16899 }
16903 {
16906 }
16909 {
16912 }
16913 else
16917 {
16920 "use of %<auto%> in lambda parameter declaration "
16921 "only available with "
16923 }
16926 "use of %<auto%> in parameter declaration "
16927 "only available with "
16931 "ISO C++ forbids use of %<auto%> in parameter "
16933 }
16934 else
16939 /* Since DR 743, decltype can either be a simple-type-specifier by
16940 itself or begin a nested-name-specifier. Parsing it will replace
16941 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16942 handling below decide what to do. */
16948 /* Consume the `typeof' token. */
16950 /* Parse the operand to `typeof'. */
16952 /* If it is not already a TYPE, take its type. */
16958 token,
16967 token,
16977 token,
16982 }
16984 /* If token is an already-parsed decltype not followed by ::,
16985 it's a simple-type-specifier. */
16988 {
16991 {
16993 token,
16995 /* Remember that we are handling a decltype in order to
16996 implement the resolution of DR 1510 when the argument
16997 isn't instantiation dependent. */
16999 }
17002 }
17004 /* If the type-specifier was for a built-in type, we're done. */
17006 {
17007 /* Record the type. */
17014 type,
17015 token,
17020 /* Consume the token. */
17026 /* There is no valid C++ program where a non-template type is
17027 followed by a "<". That usually indicates that the user thought
17028 that the type was a template. */
17033 }
17035 /* The type-specifier must be a user-defined type. */
17037 {
17041 /* Don't gobble tokens or issue error messages if this is an
17042 optional type-specifier. */
17048 /* Look for the optional `::' operator. */
17049 global_p
17053 /* Look for the nested-name specifier. */
17054 qualified_p
17061 /* If we have seen a nested-name-specifier, and the next token
17062 is `template', then we are using the template-id production. */
17065 {
17066 /* Look for the template-id. */
17070 none_type,
17072 /* If the template-id did not name a type, we are out of
17073 luck. */
17075 {
17078 }
17079 }
17080 /* Otherwise, look for a type-name. */
17081 else
17083 /* Keep track of all name-lookups performed in class scopes. */
17085 && !global_p
17086 && !qualified_p
17090 /* If it didn't work out, we don't have a TYPE. */
17095 {
17109 {
17111 none_type,
17121 else
17122 {
17127 }
17128 }
17129 else
17135 }
17138 token,
17140 }
17142 /* If we didn't get a type-name, issue an error message. */
17144 {
17147 }
17150 {
17151 /* See if TYPE is an Objective-C type, and if so, parse and
17152 accept any protocol references following it. Do this before
17153 the cp_parser_check_for_invalid_template_id() call, because
17154 Objective-C types can be followed by '<...>' which would
17155 enclose protocol names rather than template arguments, and so
17156 everything is fine. */
17159 {
17163 /* Clobber the "unqualified" type previously entered into
17164 DECL_SPECS with the new, improved protocol-qualified version. */
17169 }
17171 /* There is no valid C++ program where a non-template type is
17172 followed by a "<". That usually indicates that the user
17173 thought that the type was a template. */
17175 none_type,
17177 }
17180 }
17182 /* Parse a type-name.
17184 type-name:
17185 class-name
17186 enum-name
17187 typedef-name
17188 simple-template-id [in c++0x]
17190 enum-name:
17191 identifier
17193 typedef-name:
17194 identifier
17196 Concepts:
17198 type-name:
17199 concept-name
17200 partial-concept-id
17202 concept-name:
17203 identifier
17205 Returns a TYPE_DECL for the type. */
17207 static tree
17209 {
17211 }
17213 /* See above. */
17214 static tree
17216 {
17217 tree type_decl;
17219 /* We can't know yet whether it is a class-name or not. */
17221 /* Try a class-name. */
17223 typename_keyword_p,
17225 none_type,
17229 /* If it's not a class-name, keep looking. */
17231 {
17233 /* It must be a typedef-name or an enum-name. */
17237 /* It is either a simple-template-id representing an
17238 instantiation of an alias template... */
17242 none_type,
17244 /* Note that this must be an instantiation of an alias template
17245 because [temp.names]/6 says:
17247 A template-id that names an alias template specialization
17248 is a type-name.
17250 Whereas [temp.names]/7 says:
17252 A simple-template-id that names a class template
17253 specialization is a class-name.
17255 With concepts, this could also be a partial-concept-id that
17256 declares a non-type template parameter. */
17263 else
17267 /* ... Or a typedef-name or an enum-name. */
17269 }
17272 }
17274 /* Check if DECL and ARGS can form a constrained-type-specifier.
17275 If ARGS is non-null, we try to form a concept check of the
17276 form DECL<?, ARGS> where ? is a wildcard that matches any
17277 kind of template argument. If ARGS is NULL, then we try to
17278 form a concept check of the form DECL<?>. */
17280 static tree
17283 {
17286 /* If we a constrained-type-specifier cannot be deduced. */
17290 /* A constrained type specifier can only be found in an
17291 overload set or as a reference to a template declaration.
17293 FIXME: This might be masking a bug. It's possible that
17294 that the deduction below is causing template specializations
17295 to be formed with the wildcard as an argument. */
17299 /* Try to build a call expression that evaluates the
17300 concept. This can fail if the overload set refers
17301 only to non-templates. */
17307 /* Deduce the checked constraint and the prototype parameter.
17309 FIXME: In certain cases, failure to deduce should be a
17310 diagnosable error. */
17311 tree conc;
17312 tree proto;
17316 /* In template parameter scope, this results in a constrained
17317 parameter. Return a descriptor of that parm. */
17321 /* In a parameter-declaration-clause, constrained-type
17322 specifiers result in invented template parameters. */
17324 {
17327 }
17328 else
17329 {
17330 /* Otherwise, we're in a context where the constrained
17331 type name is deduced and the constraint applies
17332 after deduction. */
17334 }
17337 }
17339 /* If DECL refers to a concept, return a TYPE_DECL representing
17340 the result of using the constrained type specifier in the
17341 current context. DECL refers to a concept if
17343 - it is an overload set containing a function concept taking a single
17344 type argument, or
17346 - it is a variable concept taking a single type argument. */
17348 static tree
17350 {
17356 else
17358 }
17360 /* Check if DECL and ARGS form a partial-concept-id. If so,
17361 assign ID to the resulting constrained placeholder.
17363 Returns true if the partial-concept-id designates a placeholder
17364 and false otherwise. Note that *id is set to NULL_TREE in
17365 this case. */
17367 static tree
17369 {
17371 }
17373 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17374 or a concept-name.
17376 enum-name:
17377 identifier
17379 typedef-name:
17380 identifier
17382 concept-name:
17383 identifier
17385 Returns a TYPE_DECL for the type. */
17387 static tree
17389 {
17390 tree type_decl;
17391 tree identifier;
17398 /* Look up the type-name. */
17403 /* If we found an overload set, then it may refer to a concept-name. */
17409 {
17410 /* See if this is an Objective-C type. */
17415 }
17417 /* Issue an error if we did not find a type-name. */
17419 /* In Objective-C, we have the complication that class names are
17420 normally type names and start declarations (eg, the
17421 "NSObject" in "NSObject *object;"), but can be used in an
17422 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17423 is an expression. So, a classname followed by a dot is not a
17424 valid type-name. */
17427 {
17432 }
17433 /* Remember that the name was used in the definition of the
17434 current class so that we can check later to see if the
17435 meaning would have been different after the class was
17436 entirely defined. */
17442 }
17444 /* Parse an elaborated-type-specifier. Note that the grammar given
17445 here incorporates the resolution to DR68.
17447 elaborated-type-specifier:
17448 class-key :: [opt] nested-name-specifier [opt] identifier
17449 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17450 enum-key :: [opt] nested-name-specifier [opt] identifier
17451 typename :: [opt] nested-name-specifier identifier
17452 typename :: [opt] nested-name-specifier template [opt]
17453 template-id
17455 GNU extension:
17457 elaborated-type-specifier:
17458 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17459 class-key attributes :: [opt] nested-name-specifier [opt]
17460 template [opt] template-id
17461 enum attributes :: [opt] nested-name-specifier [opt] identifier
17463 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17464 declared `friend'. If IS_DECLARATION is TRUE, then this
17465 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17466 something is being declared.
17468 Returns the TYPE specified. */
17470 static tree
17474 {
17476 tree identifier;
17479 tree globalscope;
17482 /* See if we're looking at the `enum' keyword. */
17484 {
17485 /* Consume the `enum' token. */
17487 /* Remember that it's an enumeration type. */
17489 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17490 enums) is used here. */
17494 {
17501 /* Consume the `struct' or `class' and parse it anyway. */
17503 }
17504 /* Parse the attributes. */
17506 }
17507 /* Or, it might be `typename'. */
17509 RID_TYPENAME))
17510 {
17511 /* Consume the `typename' token. */
17513 /* Remember that it's a `typename' type. */
17515 }
17516 /* Otherwise it must be a class-key. */
17517 else
17518 {
17522 /* Parse the attributes. */
17524 }
17526 /* Look for the `::' operator. */
17529 /* Look for the nested-name-specifier. */
17530 tree nested_name_specifier;
17532 {
17533 nested_name_specifier
17538 is_declaration);
17541 }
17542 else
17543 /* Even though `typename' is not present, the proposed resolution
17544 to Core Issue 180 says that in `class A<T>::B', `B' should be
17545 considered a type-name, even if `A<T>' is dependent. */
17546 nested_name_specifier
17551 is_declaration);
17552 /* For everything but enumeration types, consider a template-id.
17553 For an enumeration type, consider only a plain identifier. */
17555 {
17557 tree decl;
17559 /* Allow the `template' keyword. */
17561 /* If we didn't see `template', we don't know if there's a
17562 template-id or not. */
17565 /* Parse the template-id. */
17569 tag_type,
17570 is_declaration);
17571 /* If we didn't find a template-id, look for an ordinary
17572 identifier. */
17574 ;
17575 /* We can get here when cp_parser_template_id, called by
17576 cp_parser_class_name with tag_type == none_type, succeeds
17577 and caches a BASELINK. Then, when called again here,
17578 instead of failing and returning an error_mark_node
17579 returns it (see template/typename17.C in C++11).
17580 ??? Could we diagnose this earlier? */
17582 {
17585 }
17586 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17587 in effect, then we must assume that, upon instantiation, the
17588 template will correspond to a class. */
17592 typename_type,
17594 /* If the `typename' keyword is in effect and DECL is not a type
17595 decl, then type is non existent. */
17597 ;
17599 {
17603 /* If the next token is a semicolon, this must be a specialization,
17604 instantiation, or friend declaration. Check the scope while we
17605 still know whether or not we had a nested-name-specifier. */
17610 }
17613 }
17616 {
17621 {
17624 }
17626 /* For a `typename', we needn't call xref_tag. */
17632 /* Template parameter lists apply only if we are not within a
17633 function parameter list. */
17634 bool template_parm_lists_apply
17643 /* Look up a qualified name in the usual way. */
17645 {
17646 tree decl;
17647 tree ambiguous_decls;
17650 tag_type,
17657 /* If the lookup was ambiguous, an error will already have been
17658 issued. */
17662 /* If we are parsing friend declaration, DECL may be a
17663 TEMPLATE_DECL tree node here. However, we need to check
17664 whether this TEMPLATE_DECL results in valid code. Consider
17665 the following example:
17667 namespace N {
17668 template <class T> class C {};
17669 }
17670 class X {
17671 template <class T> friend class N::C; // #1, valid code
17672 };
17673 template <class T> class Y {
17674 friend class N::C; // #2, invalid code
17675 };
17677 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17678 name lookup of `N::C'. We see that friend declaration must
17679 be template for the code to be valid. Note that
17680 processing_template_decl does not work here since it is
17681 always 1 for the above two cases. */
17683 decl = (cp_parser_maybe_treat_template_as_class
17688 {
17690 identifier,
17693 }
17696 {
17700 allow_template);
17704 }
17706 /* Forward declarations of nested types, such as
17708 class C1::C2;
17709 class C1::C2::C3;
17711 are invalid unless all components preceding the final '::'
17712 are complete. If all enclosing types are complete, these
17713 declarations become merely pointless.
17715 Invalid forward declarations of nested types are errors
17716 caught elsewhere in parsing. Those that are pointless arrive
17717 here. */
17724 }
17725 else
17726 {
17727 /* An elaborated-type-specifier sometimes introduces a new type and
17728 sometimes names an existing type. Normally, the rule is that it
17729 introduces a new type only if there is not an existing type of
17730 the same name already in scope. For example, given:
17732 struct S {};
17733 void f() { struct S s; }
17735 the `struct S' in the body of `f' is the same `struct S' as in
17736 the global scope; the existing definition is used. However, if
17737 there were no global declaration, this would introduce a new
17738 local class named `S'.
17740 An exception to this rule applies to the following code:
17742 namespace N { struct S; }
17744 Here, the elaborated-type-specifier names a new type
17745 unconditionally; even if there is already an `S' in the
17746 containing scope this declaration names a new type.
17747 This exception only applies if the elaborated-type-specifier
17748 forms the complete declaration:
17750 [class.name]
17752 A declaration consisting solely of `class-key identifier ;' is
17753 either a redeclaration of the name in the current scope or a
17754 forward declaration of the identifier as a class name. It
17755 introduces the name into the current scope.
17757 We are in this situation precisely when the next token is a `;'.
17759 An exception to the exception is that a `friend' declaration does
17760 *not* name a new type; i.e., given:
17762 struct S { friend struct T; };
17764 `T' is not a new type in the scope of `S'.
17766 Also, `new struct S' or `sizeof (struct S)' never results in the
17767 definition of a new type; a new type can only be declared in a
17768 declaration context. */
17770 tag_scope ts;
17774 /* Friends have special name lookup rules. */
17778 CPP_SEMICOLON))
17779 /* This is a `class-key identifier ;' */
17781 else
17784 template_p =
17785 (template_parm_lists_apply
17788 /* An unqualified name was used to reference this type, so
17789 there were no qualifying templates. */
17797 }
17798 }
17803 /* Allow attributes on forward declarations of classes. */
17805 {
17815 else
17818 }
17821 {
17822 /* Indicate whether this class was declared as a `class' or as a
17823 `struct'. */
17827 }
17829 /* A "<" cannot follow an elaborated type specifier. If that
17830 happens, the user was probably trying to form a template-id. */
17835 }
17837 /* Parse an enum-specifier.
17839 enum-specifier:
17840 enum-head { enumerator-list [opt] }
17841 enum-head { enumerator-list , } [C++0x]
17843 enum-head:
17844 enum-key identifier [opt] enum-base [opt]
17845 enum-key nested-name-specifier identifier enum-base [opt]
17847 enum-key:
17848 enum
17849 enum class [C++0x]
17850 enum struct [C++0x]
17852 enum-base: [C++0x]
17853 : type-specifier-seq
17855 opaque-enum-specifier:
17856 enum-key identifier enum-base [opt] ;
17858 GNU Extensions:
17859 enum-key attributes[opt] identifier [opt] enum-base [opt]
17860 { enumerator-list [opt] }attributes[opt]
17861 enum-key attributes[opt] identifier [opt] enum-base [opt]
17862 { enumerator-list, }attributes[opt] [C++0x]
17864 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17865 if the token stream isn't an enum-specifier after all. */
17867 static tree
17869 {
17870 tree identifier;
17872 tree prev_scope;
17874 tree attributes;
17887 /* Parse tentatively so that we can back up if we don't find a
17888 enum-specifier. */
17891 /* Caller guarantees that the current token is 'enum', an identifier
17892 possibly follows, and the token after that is an opening brace.
17893 If we don't have an identifier, fabricate an anonymous name for
17894 the enumeration being defined. */
17897 /* Parse the "class" or "struct", which indicates a scoped
17898 enumeration type in C++0x. */
17901 {
17905 /* Consume the `struct' or `class' token. */
17909 }
17913 /* Clear the qualification. */
17918 /* Figure out in what scope the declaration is being placed. */
17924 nested_name_specifier
17932 {
17933 tree name;
17937 enum_type,
17942 input_location);
17944 {
17947 {
17948 /* Are template enums allowed in ISO? */
17952 /* ignore a typename reference, for it will be solved by name
17953 in start_enum. */
17955 }
17956 }
17959 else
17960 {
17965 }
17966 }
17967 else
17968 {
17971 else
17972 {
17978 }
17979 }
17982 /* Check for the `:' that denotes a specified underlying type in C++0x.
17983 Note that a ':' could also indicate a bitfield width, however. */
17985 {
17986 cp_decl_specifier_seq type_specifiers;
17988 /* Consume the `:'. */
17991 /* Parse the type-specifier-seq. */
17996 /* At this point this is surely not elaborated type specifier. */
18005 /* If that didn't work, stop. */
18007 {
18013 }
18014 }
18016 /* Look for the `{' but don't consume it yet. */
18018 {
18020 {
18023 {
18026 }
18027 }
18028 /* An opaque-enum-specifier must have a ';' here. */
18031 {
18034 {
18037 }
18038 }
18039 }
18045 {
18047 {
18051 }
18053 {
18055 }
18056 }
18058 /* Issue an error message if type-definitions are forbidden here. */
18061 else
18062 /* Create the new type. We do this before consuming the opening
18063 brace so the enum will be recorded as being on the line of its
18064 tag (or the 'enum' keyword, if there is no tag). */
18068 /* If the next token is not '{' it is an opaque-enum-specifier or an
18069 elaborated-type-specifier. */
18071 {
18075 {
18076 /* The following catches invalid code such as:
18077 enum class S<int>::E { A, B, C }; */
18085 {
18089 nested_name_specifier);
18091 }
18094 {
18096 "%qT for enum declaration does not name a class "
18099 }
18100 /* If that scope does not contain the scope in which the
18101 class was originally declared, the program is invalid. */
18103 nested_name_specifier))
18104 {
18107 "declaration of %qD in namespace %qD which does not "
18110 else
18112 "declaration of %qD in %qD which does not "
18116 }
18117 /* If that scope is the scope where the declaration is being placed
18118 the program is invalid. */
18122 {
18126 }
18127 }
18132 /* Consume the opening brace. */
18133 matching_braces braces;
18140 {
18144 }
18145 else
18146 {
18152 }
18156 /* If the next token is not '}', then there are some enumerators. */
18158 {
18162 }
18163 else
18166 /* Consume the final '}'. */
18172 }
18173 else
18174 {
18175 /* If a ';' follows, then it is an opaque-enum-specifier
18176 and additional restrictions apply. */
18178 {
18185 }
18186 }
18188 /* Look for trailing attributes to apply to this enumeration, and
18189 apply them if appropriate. */
18191 {
18194 trailing_attr,
18196 }
18198 /* Finish up the enumeration. */
18200 {
18205 }
18208 {
18210 {
18213 }
18215 {
18217 }
18218 }
18219 out:
18222 }
18224 /* Parse an enumerator-list. The enumerators all have the indicated
18225 TYPE.
18227 enumerator-list:
18228 enumerator-definition
18229 enumerator-list , enumerator-definition */
18231 static void
18233 {
18235 {
18236 /* Parse an enumerator-definition. */
18239 /* If the next token is not a ',', we've reached the end of
18240 the list. */
18243 /* Otherwise, consume the `,' and keep going. */
18245 /* If the next token is a `}', there is a trailing comma. */
18247 {
18252 }
18253 }
18254 }
18256 /* Parse an enumerator-definition. The enumerator has the indicated
18257 TYPE.
18259 enumerator-definition:
18260 enumerator
18261 enumerator = constant-expression
18263 enumerator:
18264 identifier
18266 GNU Extensions:
18268 enumerator-definition:
18269 enumerator attributes [opt]
18270 enumerator attributes [opt] = constant-expression */
18272 static void
18274 {
18275 tree identifier;
18276 tree value;
18277 location_t loc;
18279 /* Save the input location because we are interested in the location
18280 of the identifier and not the location of the explicit value. */
18283 /* Look for the identifier. */
18288 /* Parse any specified attributes. */
18291 /* If the next token is an '=', then there is an explicit value. */
18293 {
18294 /* Consume the `=' token. */
18296 /* Parse the value. */
18298 }
18299 else
18302 /* If we are processing a template, make sure the initializer of the
18303 enumerator doesn't contain any bare template parameter pack. */
18307 /* Create the enumerator. */
18309 }
18311 /* Parse a namespace-name.
18313 namespace-name:
18314 original-namespace-name
18315 namespace-alias
18317 Returns the NAMESPACE_DECL for the namespace. */
18319 static tree
18321 {
18322 tree identifier;
18323 tree namespace_decl;
18327 /* Get the name of the namespace. */
18332 /* Look up the identifier in the currently active scope. Look only
18333 for namespaces, due to:
18335 [basic.lookup.udir]
18337 When looking up a namespace-name in a using-directive or alias
18338 definition, only namespace names are considered.
18340 And:
18342 [basic.lookup.qual]
18344 During the lookup of a name preceding the :: scope resolution
18345 operator, object, function, and enumerator names are ignored.
18347 (Note that cp_parser_qualifying_entity only calls this
18348 function if the token after the name is the scope resolution
18349 operator.) */
18351 none_type,
18357 /* If it's not a namespace, issue an error. */
18360 {
18365 }
18368 }
18370 /* Parse a namespace-definition.
18372 namespace-definition:
18373 named-namespace-definition
18374 unnamed-namespace-definition
18376 named-namespace-definition:
18377 original-namespace-definition
18378 extension-namespace-definition
18380 original-namespace-definition:
18381 namespace identifier { namespace-body }
18383 extension-namespace-definition:
18384 namespace original-namespace-name { namespace-body }
18386 unnamed-namespace-definition:
18387 namespace { namespace-body } */
18389 static void
18391 {
18392 tree identifier;
18401 {
18404 }
18406 /* Look for the `namespace' keyword. */
18407 cp_token* token
18410 /* Parse any specified attributes before the identifier. */
18414 {
18418 {
18421 /* Parse any attributes specified after the identifier. */
18423 }
18430 "nested namespace definitions only available with "
18433 /* Nested namespace names can create new namespaces (unlike
18434 other qualified-ids). */
18437 else
18440 }
18452 /* Start the namespace. */
18459 /* Look for the `{' to validate starting the namespace. */
18460 matching_braces braces;
18462 {
18463 /* Parse the body of the namespace. */
18466 /* Look for the final `}'. */
18468 }
18473 /* Pop the nested namespace definitions. */
18476 }
18478 /* Parse a namespace-body.
18480 namespace-body:
18481 declaration-seq [opt] */
18483 static void
18485 {
18487 }
18489 /* Parse a namespace-alias-definition.
18491 namespace-alias-definition:
18492 namespace identifier = qualified-namespace-specifier ; */
18494 static void
18496 {
18497 tree identifier;
18498 tree namespace_specifier;
18502 /* Look for the `namespace' keyword. */
18504 /* Look for the identifier. */
18508 /* Look for the `=' token. */
18511 {
18513 /* Skip the definition. */
18518 }
18520 /* Look for the qualified-namespace-specifier. */
18521 namespace_specifier
18523 /* Look for the `;' token. */
18526 /* Register the alias in the symbol table. */
18528 }
18530 /* Parse a qualified-namespace-specifier.
18532 qualified-namespace-specifier:
18533 :: [opt] nested-name-specifier [opt] namespace-name
18535 Returns a NAMESPACE_DECL corresponding to the specified
18536 namespace. */
18538 static tree
18540 {
18541 /* Look for the optional `::'. */
18545 /* Look for the optional nested-name-specifier. */
18553 }
18555 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18556 access declaration.
18558 using-declaration:
18559 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18560 using :: unqualified-id ;
18562 access-declaration:
18563 qualified-id ;
18565 */
18567 static bool
18570 {
18574 tree decl;
18575 tree identifier;
18576 tree qscope;
18581 {
18584 }
18585 else
18586 {
18587 /* Look for the `using' keyword. */
18590 again:
18591 /* Peek at the next token. */
18593 /* See if it's `typename'. */
18595 {
18596 /* Remember that we've seen it. */
18598 /* Consume the `typename' token. */
18600 }
18601 }
18603 /* Look for the optional global scope qualification. */
18604 global_scope_p
18609 /* If we saw `typename', or didn't see `::', then there must be a
18610 nested-name-specifier present. */
18612 {
18618 {
18621 }
18622 }
18623 /* Otherwise, we could be in either of the two productions. In that
18624 case, treat the nested-name-specifier as optional. */
18625 else
18637 /* Something has already gone wrong; there's no need to parse
18638 further. Since an error has occurred, the return value of
18639 cp_parser_parse_definitely will be false, as required. */
18643 /* Parse the unqualified-id. */
18651 {
18656 }
18658 {
18663 "pack expansion in using-declaration only available "
18666 }
18668 /* The function we call to handle a using-declaration is different
18669 depending on what scope we are in. */
18671 ;
18674 /* [namespace.udecl]
18676 A using declaration shall not name a template-id. */
18679 else
18680 {
18682 {
18683 /* Create the USING_DECL. */
18690 {
18693 }
18694 else
18695 /* Add it to the list of members in this class. */
18697 }
18698 else
18699 {
18701 identifier,
18708 {
18711 }
18714 else
18716 }
18717 }
18721 {
18725 "comma-separated list in using-declaration only available "
18728 }
18730 /* Look for the final `;'. */
18735 "access declarations are deprecated "
18736 "in favour of using-declarations; "
18740 }
18742 /* Parse an alias-declaration.
18744 alias-declaration:
18745 using identifier attribute-specifier-seq [opt] = type-id */
18747 static tree
18749 {
18751 location_t id_location;
18753 cp_decl_specifier_seq decl_specs;
18757 /* Look for the `using' keyword. */
18758 cp_token *using_token
18780 /* Now we are going to parse the type-id of the declaration. */
18782 /*
18783 [dcl.type]/3 says:
18785 "A type-specifier-seq shall not define a class or enumeration
18786 unless it appears in the type-id of an alias-declaration (7.1.3) that
18787 is not the declaration of a template-declaration."
18789 In other words, if we currently are in an alias template, the
18790 type-id should not define a type.
18792 So let's set parser->type_definition_forbidden_message in that
18793 case; cp_parser_check_type_definition (called by
18794 cp_parser_class_specifier) will then emit an error if a type is
18795 defined in the type-id. */
18797 {
18801 }
18805 /* Restore the error message if need be. */
18811 {
18814 }
18816 /* A typedef-name can also be introduced by an alias-declaration. The
18817 identifier following the using keyword becomes a typedef-name. It has
18818 the same semantics as if it were introduced by the typedef
18819 specifier. In particular, it does not define a new type and it shall
18820 not appear in the type-id. */
18825 {
18828 ds_attribute,
18829 attrs_token);
18830 }
18832 ds_typedef,
18833 using_token);
18835 ds_alias,
18836 using_token);
18845 else
18851 // Attach constraints to the alias declaration.
18853 {
18857 }
18864 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18865 added into the symbol table; otherwise, return the TYPE_DECL. */
18869 {
18873 }
18876 }
18878 /* Parse a using-directive.
18880 using-directive:
18881 using namespace :: [opt] nested-name-specifier [opt]
18882 namespace-name ; */
18884 static void
18886 {
18887 tree namespace_decl;
18888 tree attribs;
18890 /* Look for the `using' keyword. */
18892 /* And the `namespace' keyword. */
18894 /* Look for the optional `::' operator. */
18896 /* And the optional nested-name-specifier. */
18902 /* Get the namespace being used. */
18904 /* And any specified attributes. */
18907 /* Update the symbol table. */
18910 else
18913 /* Look for the final `;'. */
18915 }
18917 /* Parse an asm-definition.
18919 asm-definition:
18920 asm ( string-literal ) ;
18922 GNU Extension:
18924 asm-definition:
18925 asm volatile [opt] ( string-literal ) ;
18926 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18927 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18928 : asm-operand-list [opt] ) ;
18929 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18930 : asm-operand-list [opt]
18931 : asm-clobber-list [opt] ) ;
18932 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18933 : asm-clobber-list [opt]
18934 : asm-goto-list ) ; */
18936 static void
18938 {
18939 tree string;
18944 tree asm_stmt;
18952 /* Look for the `asm' keyword. */
18957 {
18960 }
18962 /* See if the next token is `volatile'. */
18965 {
18966 /* Remember that we saw the `volatile' keyword. */
18968 /* Consume the token. */
18970 }
18974 {
18975 /* Remember that we saw the `goto' keyword. */
18977 /* Consume the token. */
18979 }
18980 /* Look for the opening `('. */
18983 /* Look for the string. */
18986 {
18990 }
18992 /* If we're allowing GNU extensions, check for the extended assembly
18993 syntax. Unfortunately, the `:' tokens need not be separated by
18994 a space in C, and so, for compatibility, we tolerate that here
18995 too. Doing that means that we have to treat the `::' operator as
18996 two `:' tokens. */
19001 {
19006 /* The extended syntax was used. */
19009 /* Look for outputs. */
19011 {
19012 /* Consume the `:'. */
19014 /* Parse the output-operands. */
19016 CPP_COLON)
19018 CPP_SCOPE)
19020 CPP_CLOSE_PAREN)
19022 {
19026 }
19027 }
19028 /* If the next token is `::', there are no outputs, and the
19029 next token is the beginning of the inputs. */
19031 /* The inputs are coming next. */
19034 /* Look for inputs. */
19037 {
19038 /* Consume the `:' or `::'. */
19040 /* Parse the output-operands. */
19042 CPP_COLON)
19044 CPP_SCOPE)
19046 CPP_CLOSE_PAREN))
19047 {
19051 }
19052 }
19054 /* The clobbers are coming next. */
19057 /* Look for clobbers. */
19060 {
19062 /* Consume the `:' or `::'. */
19064 /* Parse the clobbers. */
19066 CPP_COLON)
19068 CPP_CLOSE_PAREN))
19070 }
19073 /* The labels are coming next. */
19076 /* Look for labels. */
19079 {
19081 /* Consume the `:' or `::'. */
19083 /* Parse the labels. */
19085 }
19089 }
19093 /* Look for the closing `)'. */
19101 {
19102 /* Create the ASM_EXPR. */
19104 {
19107 /* If the extended syntax was not used, mark the ASM_EXPR. */
19109 {
19115 }
19116 }
19117 else
19119 }
19120 }
19122 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19123 type that comes from the decl-specifier-seq. */
19125 static tree
19127 {
19130 {
19143 }
19146 }
19148 /* Declarators [gram.dcl.decl] */
19150 /* Parse an init-declarator.
19152 init-declarator:
19153 declarator initializer [opt]
19155 GNU Extension:
19157 init-declarator:
19158 declarator asm-specification [opt] attributes [opt] initializer [opt]
19160 function-definition:
19161 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19162 function-body
19163 decl-specifier-seq [opt] declarator function-try-block
19165 GNU Extension:
19167 function-definition:
19168 __extension__ function-definition
19170 TM Extension:
19172 function-definition:
19173 decl-specifier-seq [opt] declarator function-transaction-block
19175 The DECL_SPECIFIERS apply to this declarator. Returns a
19176 representation of the entity declared. If MEMBER_P is TRUE, then
19177 this declarator appears in a class scope. The new DECL created by
19178 this declarator is returned.
19180 The CHECKS are access checks that should be performed once we know
19181 what entity is being declared (and, therefore, what classes have
19182 befriended it).
19184 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19185 for a function-definition here as well. If the declarator is a
19186 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19187 be TRUE upon return. By that point, the function-definition will
19188 have been completely parsed.
19190 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19191 is FALSE.
19193 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19194 parsed declaration if it is an uninitialized single declarator not followed
19195 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19196 if present, will not be consumed. If returned, this declarator will be
19197 created with SD_INITIALIZED but will not call cp_finish_decl.
19199 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19200 and there is an initializer, the pointed location_t is set to the
19201 location of the '=' or `(', or '{' in C++11 token introducing the
19202 initializer. */
19204 static tree
19215 {
19219 tree prefix_attributes;
19221 tree asm_specification;
19222 tree initializer;
19224 tree scope;
19226 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19227 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19228 "(...)". */
19239 /* Gather the attributes that were provided with the
19240 decl-specifiers. */
19243 /* Assume that this is not the declarator for a function
19244 definition. */
19248 /* Default arguments are only permitted for function parameters. */
19252 /* Defer access checks while parsing the declarator; we cannot know
19253 what names are accessible until we know what is being
19254 declared. */
19259 /* Parse the declarator. */
19260 declarator
19265 /* Gather up the deferred checks. */
19270 /* If the DECLARATOR was erroneous, there's no need to go
19271 further. */
19275 /* Check that the number of template-parameter-lists is OK. */
19285 /* Figure out what scope the entity declared by the DECLARATOR is
19286 located in. `grokdeclarator' sometimes changes the scope, so
19287 we compute it now. */
19290 /* Perform any lookups in the declared type which were thought to be
19291 dependent, but are not in the scope of the declarator. */
19292 decl_specifiers->type
19295 /* If we're allowing GNU extensions, look for an
19296 asm-specification. */
19298 {
19299 /* Look for an asm-specification. */
19302 }
19303 else
19306 /* Look for attributes. */
19310 /* Peek at the next token. */
19316 {
19317 /* Handle C++17 deduction guides. */
19321 {
19329 {
19333 }
19334 }
19336 /* Check to see if the token indicates the start of a
19337 function-definition. */
19339 {
19341 {
19342 /* If a function-definition should not appear here, issue an
19343 error message. */
19347 }
19349 location_t func_brace_location
19352 /* Neither attributes nor an asm-specification are allowed
19353 on a function-definition. */
19356 "an asm-specification is not allowed "
19360 "attributes are not allowed "
19362 /* This is a function-definition. */
19365 /* Parse the function definition. */
19368 decl_specifiers,
19369 declarator,
19370 prefix_attributes);
19371 else
19372 decl =
19373 (cp_parser_function_definition_from_specifiers_and_declarator
19377 {
19378 /* This is where the prologue starts... */
19381 }
19384 }
19385 }
19387 {
19388 /* A non-template declaration involving a function parameter list
19389 containing an implicit template parameter will be made into a
19390 template. If the resulting declaration is not going to be an
19391 actual function then finish the template scope here to prevent it.
19392 An error message will be issued once we have a decl to talk about.
19394 FIXME probably we should do type deduction rather than create an
19395 implicit template, but the standard currently doesn't allow it. */
19398 }
19400 /* [dcl.dcl]
19402 Only in function declarations for constructors, destructors, type
19403 conversions, and deduction guides can the decl-specifier-seq be omitted.
19405 We explicitly postpone this check past the point where we handle
19406 function-definitions because we tolerate function-definitions
19407 that are missing their return types in some modes. */
19409 {
19413 }
19415 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19419 {
19430 {
19436 }
19437 }
19438 else
19439 {
19440 /* If the init-declarator isn't initialized and isn't followed by a
19441 `,' or `;', it's not a valid init-declarator. */
19444 {
19447 else
19448 {
19452 }
19453 }
19456 }
19458 /* Because start_decl has side-effects, we should only call it if we
19459 know we're going ahead. By this point, we know that we cannot
19460 possibly be looking at any other construct. */
19463 /* Enter the newly declared entry in the symbol table. If we're
19464 processing a declaration in a class-specifier, we wait until
19465 after processing the initializer. */
19467 {
19475 /* Adjust location of decl if declarator->id_loc is more appropriate:
19476 set, and decl wasn't merged with another decl, in which case its
19477 location would be different from input_location, and more accurate. */
19482 }
19484 /* Enter the SCOPE. That way unqualified names appearing in the
19485 initializer will be looked up in SCOPE. */
19488 /* Perform deferred access control checks, now that we know in which
19489 SCOPE the declared entity resides. */
19491 {
19494 /* If the entity being declared is a function, pretend that we
19495 are in its scope. If it is a `friend', it may have access to
19496 things that would not otherwise be accessible. */
19498 {
19501 }
19503 /* Perform access checks for template parameters. */
19506 /* Perform the access control checks for the declarator and the
19507 decl-specifiers. */
19510 /* Restore the saved value. */
19513 }
19515 /* Parse the initializer. */
19520 {
19522 {
19525 else
19526 {
19527 /* If the declaration was erroneous, we don't really
19528 know what the user intended, so just silently
19529 consume the initializer. */
19536 }
19537 }
19538 else
19539 {
19540 /* We want to record the extra mangling scope for in-class
19541 initializers of class members and initializers of static data
19542 member templates. The former involves deferring
19543 parsing of the initializer until end of class as with default
19544 arguments. So right here we only handle the latter. */
19554 }
19555 }
19557 /* The old parser allows attributes to appear after a parenthesized
19558 initializer. Mark Mitchell proposed removing this functionality
19559 on the GCC mailing lists on 2002-08-13. This parser accepts the
19560 attributes -- but ignores them. */
19567 /* And now complain about a non-function implicit template. */
19572 /* For an in-class declaration, use `grokfield' to create the
19573 declaration. */
19575 {
19577 {
19580 }
19589 }
19591 /* Finish processing the declaration. But, skip member
19592 declarations. */
19594 {
19597 asm_specification,
19598 /* If the initializer is in parentheses, then this is
19599 a direct-initialization, which means that an
19600 `explicit' constructor is OK. Otherwise, an
19601 `explicit' constructor cannot be used. */
19604 }
19607 /* Core issue #226 (C++0x only): A default template-argument
19608 shall not be specified in a friend class template
19609 declaration. */
19618 {
19621 else
19623 }
19630 }
19632 /* Parse a declarator.
19634 declarator:
19635 direct-declarator
19636 ptr-operator declarator
19638 abstract-declarator:
19639 ptr-operator abstract-declarator [opt]
19640 direct-abstract-declarator
19642 GNU Extensions:
19644 declarator:
19645 attributes [opt] direct-declarator
19646 attributes [opt] ptr-operator declarator
19648 abstract-declarator:
19649 attributes [opt] ptr-operator abstract-declarator [opt]
19650 attributes [opt] direct-abstract-declarator
19652 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19653 detect constructors, destructors, deduction guides, or conversion operators.
19654 It is set to -1 if the declarator is a name, and +1 if it is a
19655 function. Otherwise it is set to zero. Usually you just want to
19656 test for >0, but internally the negative value is used.
19658 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19659 a decl-specifier-seq unless it declares a constructor, destructor,
19660 or conversion. It might seem that we could check this condition in
19661 semantic analysis, rather than parsing, but that makes it difficult
19662 to handle something like `f()'. We want to notice that there are
19663 no decl-specifiers, and therefore realize that this is an
19664 expression, not a declaration.)
19666 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19667 the declarator is a direct-declarator of the form "(...)".
19669 MEMBER_P is true iff this declarator is a member-declarator.
19671 FRIEND_P is true iff this declarator is a friend. */
19675 cp_parser_declarator_kind dcl_kind,
19679 {
19682 cp_cv_quals cv_quals;
19683 tree class_type;
19686 /* Assume this is not a constructor, destructor, or type-conversion
19687 operator. */
19694 /* Check for the ptr-operator production. */
19696 /* Parse the ptr-operator. */
19702 /* If that worked, then we have a ptr-operator. */
19704 {
19705 /* If a ptr-operator was found, then this declarator was not
19706 parenthesized. */
19709 /* The dependent declarator is optional if we are parsing an
19710 abstract-declarator. */
19714 /* Parse the dependent declarator. */
19719 friend_p);
19721 /* If we are parsing an abstract-declarator, we must handle the
19722 case where the dependent declarator is absent. */
19727 declarator = cp_parser_make_indirect_declarator
19729 }
19730 /* Everything else is a direct-declarator. */
19731 else
19732 {
19735 CPP_OPEN_PAREN);
19737 ctor_dtor_or_conv_p,
19739 }
19744 }
19746 /* Parse a direct-declarator or direct-abstract-declarator.
19748 direct-declarator:
19749 declarator-id
19750 direct-declarator ( parameter-declaration-clause )
19751 cv-qualifier-seq [opt]
19752 ref-qualifier [opt]
19753 exception-specification [opt]
19754 direct-declarator [ constant-expression [opt] ]
19755 ( declarator )
19757 direct-abstract-declarator:
19758 direct-abstract-declarator [opt]
19759 ( parameter-declaration-clause )
19760 cv-qualifier-seq [opt]
19761 ref-qualifier [opt]
19762 exception-specification [opt]
19763 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19764 ( abstract-declarator )
19766 Returns a representation of the declarator. DCL_KIND is
19767 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19768 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19769 we are parsing a direct-declarator. It is
19770 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19771 of ambiguity we prefer an abstract declarator, as per
19772 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19773 as for cp_parser_declarator. */
19777 cp_parser_declarator_kind dcl_kind,
19780 {
19790 {
19791 /* Peek at the next token. */
19794 {
19795 /* This is either a parameter-declaration-clause, or a
19796 parenthesized declarator. When we know we are parsing a
19797 named declarator, it must be a parenthesized declarator
19798 if FIRST is true. For instance, `(int)' is a
19799 parameter-declaration-clause, with an omitted
19800 direct-abstract-declarator. But `((*))', is a
19801 parenthesized abstract declarator. Finally, when T is a
19802 template parameter `(T)' is a
19803 parameter-declaration-clause, and not a parenthesized
19804 named declarator.
19806 We first try and parse a parameter-declaration-clause,
19807 and then try a nested declarator (if FIRST is true).
19809 It is not an error for it not to be a
19810 parameter-declaration-clause, even when FIRST is
19811 false. Consider,
19813 int i (int);
19814 int i (3);
19816 The first is the declaration of a function while the
19817 second is the definition of a variable, including its
19818 initializer.
19820 Having seen only the parenthesis, we cannot know which of
19821 these two alternatives should be selected. Even more
19822 complex are examples like:
19824 int i (int (a));
19825 int i (int (3));
19827 The former is a function-declaration; the latter is a
19828 variable initialization.
19830 Thus again, we try a parameter-declaration-clause, and if
19831 that fails, we back out and return. */
19834 {
19835 tree params;
19838 /* In a member-declarator, the only valid interpretation
19839 of a parenthesis is the start of a
19840 parameter-declaration-clause. (It is invalid to
19841 initialize a static data member with a parenthesized
19842 initializer; only the "=" form of initialization is
19843 permitted.) */
19847 /* Consume the `('. */
19848 matching_parens parens;
19851 {
19852 /* If this is going to be an abstract declarator, we're
19853 in a declarator and we can't have default args. */
19856 }
19860 /* Parse the parameter-declaration-clause. */
19863 /* Consume the `)'. */
19866 /* If all went well, parse the cv-qualifier-seq,
19867 ref-qualifier and the exception-specification. */
19869 {
19870 cp_cv_quals cv_quals;
19871 cp_virt_specifiers virt_specifiers;
19872 cp_ref_qualifier ref_qual;
19873 tree exception_specification;
19874 tree late_return;
19875 tree attrs;
19885 /* Parse the cv-qualifier-seq. */
19887 /* Parse the ref-qualifier. */
19889 /* Parse the tx-qualifier. */
19891 /* And the exception-specification. */
19892 exception_specification
19897 /* In here, we handle cases where attribute is used after
19898 the function declaration. For example:
19899 void func (int x) __attribute__((vector(..))); */
19903 {
19907 CPP_SEMICOLON)
19909 CPP_OPEN_BRACE))
19912 ;
19913 else
19915 }
19917 late_return = (cp_parser_late_return_type_opt
19921 /* Parse the virt-specifier-seq. */
19924 /* Create the function-declarator. */
19926 params,
19927 cv_quals,
19928 virt_specifiers,
19929 ref_qual,
19930 tx_qual,
19931 exception_specification,
19932 late_return,
19933 requires_clause);
19936 /* Any subsequent parameter lists are to do with
19937 return type, so are not those of the declared
19938 function. */
19940 }
19942 /* Remove the function parms from scope. */
19946 /* Repeat the main loop. */
19948 }
19950 /* If this is the first, we can try a parenthesized
19951 declarator. */
19953 {
19959 /* Consume the `('. */
19960 matching_parens parens;
19962 /* Parse the nested declarator. */
19965 declarator
19971 /* Expect a `)'. */
19978 }
19979 /* Otherwise, we must be done. */
19980 else
19982 }
19986 {
19987 /* Parse an array-declarator. */
19996 /* Consume the `['. */
19998 /* Peek at the next token. */
20000 /* If the next token is `]', then there is no
20001 constant-expression. */
20003 {
20005 bounds
20015 {
20016 /* Normally, the array bound must be an integral constant
20017 expression. However, as an extension, we allow VLAs
20018 in function scopes as long as they aren't part of a
20019 parameter declaration. */
20023 }
20026 {
20027 /* Remember this wasn't a constant-expression. */
20030 }
20031 }
20032 else
20034 /* Look for the closing `]'. */
20036 {
20039 }
20044 }
20046 {
20047 {
20048 tree qualifying_scope;
20049 tree unqualified_name;
20050 tree attrs;
20051 special_function_kind sfk;
20056 /* Parse a declarator-id */
20059 {
20062 /* If we see an ellipsis, we should be looking at a
20063 parameter pack. */
20065 {
20066 /* Consume the `...' */
20070 }
20071 }
20074 unqualified_name
20078 {
20082 {
20083 /* Check whether an error occurred. */
20086 /* We already consumed the ellipsis to mark a
20087 parameter pack, but we have no way to report it,
20088 so abort the tentative parse. We will be exiting
20089 immediately anyway. */
20091 }
20092 else
20098 && (qualifying_scope
20100 {
20103 }
20104 }
20109 {
20114 }
20120 {
20121 /* In the declaration of a member of a template class
20122 outside of the class itself, the SCOPE will sometimes
20123 be a TYPENAME_TYPE. For example, given:
20125 template <typename T>
20126 int S<T>::R::i = 3;
20128 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20129 this context, we must resolve S<T>::R to an ordinary
20130 type, rather than a typename type.
20132 The reason we normally avoid resolving TYPENAME_TYPEs
20133 is that a specialization of `S' might render
20134 `S<T>::R' not a type. However, if `S' is
20135 specialized, then this `i' will not be used, so there
20136 is no harm in resolving the types here. */
20137 tree type;
20139 /* Resolve the TYPENAME_TYPE. */
20142 /* If that failed, the declarator is invalid. */
20144 {
20147 "cannot define member of dependent typedef "
20149 else
20154 }
20156 }
20161 {
20162 tree class_type;
20167 else
20171 {
20175 {
20176 /* We do not attempt to print the declarator
20177 here because we do not have enough
20178 information about its original syntactic
20179 form. */
20183 }
20186 {
20190 "use %<%T::%D%> instead of %<%T::%D%> to "
20192 class_type,
20197 }
20199 }
20202 {
20209 for an unnamed type, even if the type
20210 got a name for linkage purposes. */
20212 /* Handle correctly (c++/19200):
20214 struct S {
20215 struct T{};
20216 friend void S(T);
20217 };
20219 and also:
20221 namespace N {
20222 void S();
20223 }
20225 struct S {
20226 friend void N::S();
20227 }; */
20230 class_type))
20239 }
20240 }
20242 unqualified_name,
20243 sfk);
20250 }
20252 handle_declarator:;
20255 {
20256 /* Any names that appear after the declarator-id for a
20257 member are looked up in the containing scope. */
20259 {
20260 /* But declarations with qualified-ids can't appear in a
20261 function. */
20265 }
20267 }
20271 /* Default args are only allowed on function
20272 declarations. */
20274 else
20278 }
20279 /* We're done. */
20280 else
20282 }
20284 /* For an abstract declarator, we might wind up with nothing at this
20285 point. That's an error; the declarator is not optional. */
20289 /* If we entered a scope, we must exit it now. */
20297 }
20299 /* Parse a ptr-operator.
20301 ptr-operator:
20302 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20303 * cv-qualifier-seq [opt]
20304 &
20305 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20306 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20308 GNU Extension:
20310 ptr-operator:
20311 & cv-qualifier-seq [opt]
20313 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20314 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20315 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20316 filled in with the TYPE containing the member. *CV_QUALS is
20317 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20318 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20319 Note that the tree codes returned by this function have nothing
20320 to do with the types of trees that will be eventually be created
20321 to represent the pointer or reference type being parsed. They are
20322 just constants with suggestive names. */
20323 static enum tree_code
20328 {
20333 /* Assume that it's not a pointer-to-member. */
20335 /* And that there are no cv-qualifiers. */
20338 /* Peek at the next token. */
20341 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20351 {
20352 /* Consume the `*', `&' or `&&'. */
20355 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20356 `&', if we are allowing GNU extensions. (The only qualifier
20357 that can legally appear after `&' is `restrict', but that is
20358 enforced during semantic analysis. */
20366 }
20367 else
20368 {
20369 /* Try the pointer-to-member case. */
20371 /* Look for the optional `::' operator. */
20374 /* Look for the nested-name specifier. */
20381 /* If we found it, and the next token is a `*', then we are
20382 indeed looking at a pointer-to-member operator. */
20385 {
20386 /* Indicate that the `*' operator was used. */
20394 else
20395 {
20396 /* The type of which the member is a member is given by the
20397 current SCOPE. */
20399 /* The next name will not be qualified. */
20403 /* Look for optional c++11 attributes. */
20407 /* Look for the optional cv-qualifier-seq. */
20409 }
20410 }
20411 /* If that didn't work we don't have a ptr-operator. */
20414 }
20417 }
20419 /* Parse an (optional) cv-qualifier-seq.
20421 cv-qualifier-seq:
20422 cv-qualifier cv-qualifier-seq [opt]
20424 cv-qualifier:
20425 const
20426 volatile
20428 GNU Extension:
20430 cv-qualifier:
20431 __restrict__
20433 Returns a bitmask representing the cv-qualifiers. */
20435 static cp_cv_quals
20437 {
20441 {
20443 cp_cv_quals cv_qualifier;
20445 /* Peek at the next token. */
20447 /* See if it's a cv-qualifier. */
20449 {
20465 }
20471 {
20476 }
20477 else
20478 {
20481 }
20482 }
20485 }
20487 /* Parse an (optional) ref-qualifier
20489 ref-qualifier:
20490 &
20491 &&
20493 Returns cp_ref_qualifier representing ref-qualifier. */
20495 static cp_ref_qualifier
20497 {
20500 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20505 {
20510 {
20522 }
20527 {
20530 }
20531 else
20532 {
20535 }
20536 }
20539 }
20541 /* Parse an optional tx-qualifier.
20543 tx-qualifier:
20544 transaction_safe
20545 transaction_safe_dynamic */
20547 static tree
20549 {
20552 {
20557 {
20561 {
20564 {
20567 }
20568 else
20570 }
20571 }
20572 }
20574 }
20576 /* Parse an (optional) virt-specifier-seq.
20578 virt-specifier-seq:
20579 virt-specifier virt-specifier-seq [opt]
20581 virt-specifier:
20582 override
20583 final
20585 Returns a bitmask representing the virt-specifiers. */
20587 static cp_virt_specifiers
20589 {
20593 {
20595 cp_virt_specifiers virt_specifier;
20597 /* Peek at the next token. */
20599 /* See if it's a virt-specifier-qualifier. */
20603 {
20606 }
20608 {
20611 }
20613 {
20615 }
20616 else
20620 {
20625 }
20626 else
20627 {
20630 }
20631 }
20633 }
20635 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20636 is in scope even though it isn't real. */
20638 void
20640 {
20641 tree this_parm;
20644 {
20645 /* We don't clear this between NSDMIs. Is it already what we want? */
20652 }
20655 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20657 current_class_ref
20660 }
20662 /* Return true iff our current scope is a non-static data member
20663 initializer. */
20665 bool
20667 {
20668 /* We recognize NSDMI context by the context-less 'this' pointer set up
20669 by the function above. */
20675 }
20677 /* Parse a late-specified return type, if any. This is not a separate
20678 non-terminal, but part of a function declarator, which looks like
20680 -> trailing-type-specifier-seq abstract-declarator(opt)
20682 Returns the type indicated by the type-id.
20684 In addition to this, parse any queued up #pragma omp declare simd
20685 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20686 #pragma acc routine clauses.
20688 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20689 function. */
20691 static tree
20694 {
20698 && declarator
20705 && declarator
20708 /* Peek at the next token. */
20710 /* A late-specified return type is indicated by an initial '->'. */
20721 {
20722 /* DR 1207: 'this' is in scope in the trailing return type. */
20724 }
20727 {
20728 /* Consume the ->. */
20732 }
20734 /* Function declarations may be followed by a trailing
20735 requires-clause. */
20739 declarator->attributes
20743 declarator->attributes
20747 declarator->attributes
20752 {
20755 }
20758 }
20760 /* Parse a declarator-id.
20762 declarator-id:
20763 id-expression
20764 :: [opt] nested-name-specifier [opt] type-name
20766 In the `id-expression' case, the value returned is as for
20767 cp_parser_id_expression if the id-expression was an unqualified-id.
20768 If the id-expression was a qualified-id, then a SCOPE_REF is
20769 returned. The first operand is the scope (either a NAMESPACE_DECL
20770 or TREE_TYPE), but the second is still just a representation of an
20771 unqualified-id. */
20773 static tree
20775 {
20776 tree id;
20777 /* The expression must be an id-expression. Assume that qualified
20778 names are the names of types so that:
20780 template <class T>
20781 int S<T>::R::i = 3;
20783 will work; we must treat `S<T>::R' as the name of a type.
20784 Similarly, assume that qualified names are templates, where
20785 required, so that:
20787 template <class T>
20788 int S<T>::R<T>::i = 3;
20790 will work, too. */
20796 optional_p);
20800 }
20802 /* Parse a type-id.
20804 type-id:
20805 type-specifier-seq abstract-declarator [opt]
20807 Returns the TYPE specified. */
20809 static tree
20812 {
20813 cp_decl_specifier_seq type_specifier_seq;
20816 /* Parse the type-specifier-seq. */
20818 is_trailing_return,
20823 /* A bare template name as a template argument is a template template
20824 argument, not a placeholder, so fail parsing it as a type argument. */
20825 {
20829 }
20833 /* There might or might not be an abstract declarator. */
20835 /* Look for the declarator. */
20836 abstract_declarator
20841 /* Check to see if there really was a declarator. */
20846 /* The concepts TS allows 'auto' as a type-id. */
20848 /* None of the valid uses of 'auto' in C++14 involve the type-id
20849 nonterminal, but it is valid in a trailing-return-type. */
20852 {
20853 /* A type-id with type 'auto' is only ok if the abstract declarator
20854 is a function declarator with a late-specified return type.
20856 A type-id with 'auto' is also valid in a trailing-return-type
20857 in a compound-requirement. */
20864 else
20865 {
20868 {
20870 auto_node);
20872 tmpl);
20873 }
20874 else
20877 }
20878 }
20881 is_template_arg);
20882 }
20884 static tree
20886 {
20888 }
20890 static tree
20892 {
20893 tree r;
20895 parser->type_definition_forbidden_message
20900 {
20903 }
20905 }
20907 static tree
20909 {
20911 }
20913 /* Parse a type-specifier-seq.
20915 type-specifier-seq:
20916 type-specifier type-specifier-seq [opt]
20918 GNU extension:
20920 type-specifier-seq:
20921 attributes type-specifier-seq [opt]
20923 If IS_DECLARATION is true, we are at the start of a "condition" or
20924 exception-declaration, so we might be followed by a declarator-id.
20926 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20927 i.e. we've just seen "->".
20929 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20931 static void
20936 {
20941 /* Clear the TYPE_SPECIFIER_SEQ. */
20944 /* In the context of a trailing return type, enum E { } is an
20945 elaborated-type-specifier followed by a function-body, not an
20946 enum-specifier. */
20950 /* Parse the type-specifiers and attributes. */
20952 {
20953 tree type_specifier;
20956 /* Check for attributes first. */
20958 {
20963 }
20965 /* record the token of the beginning of the type specifier seq,
20966 for error reporting purposes*/
20970 /* Look for the type-specifier. */
20972 flags,
20973 type_specifier_seq,
20975 NULL,
20978 {
20979 /* If the first type-specifier could not be found, this is not a
20980 type-specifier-seq at all. */
20982 {
20983 /* Set in_declarator_p to avoid skipping to the semicolon. */
20995 }
20996 /* If subsequent type-specifiers could not be found, the
20997 type-specifier-seq is complete. */
20999 }
21002 /* The standard says that a condition can be:
21004 type-specifier-seq declarator = assignment-expression
21006 However, given:
21008 struct S {};
21009 if (int S = ...)
21011 we should treat the "S" as a declarator, not as a
21012 type-specifier. The standard doesn't say that explicitly for
21013 type-specifier-seq, but it does say that for
21014 decl-specifier-seq in an ordinary declaration. Perhaps it
21015 would be clearer just to allow a decl-specifier-seq here, and
21016 then add a semantic restriction that if any decl-specifiers
21017 that are not type-specifiers appear, the program is invalid. */
21020 }
21021 }
21023 /* Return whether the function currently being declared has an associated
21024 template parameter list. */
21026 static bool
21028 {
21041 }
21043 /* Parse a parameter-declaration-clause.
21045 parameter-declaration-clause:
21046 parameter-declaration-list [opt] ... [opt]
21047 parameter-declaration-list , ...
21049 Returns a representation for the parameter declarations. A return
21050 value of NULL indicates a parameter-declaration-clause consisting
21051 only of an ellipsis. */
21053 static tree
21055 {
21056 tree parameters;
21065 parser->auto_is_implicit_function_template_parm_p
21067 }
21073 && !processing_template_parmlist
21079 /* Peek at the next token. */
21081 /* Check for trivial parameter-declaration-clauses. */
21083 {
21084 /* Consume the `...' token. */
21087 }
21089 /* There are no parameters. */
21090 {
21091 #ifndef NO_IMPLICIT_EXTERN_C
21096 else
21097 #endif
21099 }
21100 /* Check for `(void)', too, which is a special case. */
21104 {
21105 /* Consume the `void' token. */
21107 /* There are no parameters. */
21109 }
21111 /* Parse the parameter-declaration-list. */
21113 /* If a parse error occurred while parsing the
21114 parameter-declaration-list, then the entire
21115 parameter-declaration-clause is erroneous. */
21119 /* Peek at the next token. */
21121 /* If it's a `,', the clause should terminate with an ellipsis. */
21123 {
21124 /* Consume the `,'. */
21126 /* Expect an ellipsis. */
21127 ellipsis_p
21129 }
21130 /* It might also be `...' if the optional trailing `,' was
21131 omitted. */
21133 {
21134 /* Consume the `...' token. */
21136 /* And remember that we saw it. */
21138 }
21139 else
21142 /* Finish the parameter list. */
21147 }
21149 /* Parse a parameter-declaration-list.
21151 parameter-declaration-list:
21152 parameter-declaration
21153 parameter-declaration-list , parameter-declaration
21155 Returns a representation of the parameter-declaration-list, as for
21156 cp_parser_parameter_declaration_clause. However, the
21157 `void_list_node' is never appended to the list. Upon return,
21158 *IS_ERROR will be true iff an error occurred. */
21160 static tree
21162 {
21168 /* Assume all will go well. */
21170 /* The special considerations that apply to a function within an
21171 unbraced linkage specifications do not apply to the parameters
21172 to the function. */
21173 saved_in_unbraced_linkage_specification_p
21177 /* Look for more parameters. */
21179 {
21187 /* Parse the parameter. */
21188 parameter
21193 /* We don't know yet if the enclosing context is deprecated, so wait
21194 and warn in grokparms if appropriate. */
21198 {
21199 /* If a function parameter pack was specified and an implicit template
21200 parameter was introduced during cp_parser_parameter_declaration,
21201 change any implicit parameters introduced into packs. */
21205 {
21213 }
21217 PARM,
21220 }
21224 /* If a parse error occurred parsing the parameter declaration,
21225 then the entire parameter-declaration-list is erroneous. */
21227 {
21231 }
21241 {
21245 }
21247 /* Add the new parameter to the list. */
21251 /* Peek at the next token. */
21254 /* These are for Objective-C++ */
21257 /* The parameter-declaration-list is complete. */
21260 {
21263 /* Peek at the next token. */
21265 /* If it's an ellipsis, then the list is complete. */
21268 /* Otherwise, there must be more parameters. Consume the
21269 `,'. */
21271 /* When parsing something like:
21273 int i(float f, double d)
21275 we can tell after seeing the declaration for "f" that we
21276 are not looking at an initialization of a variable "i",
21277 but rather at the declaration of a function "i".
21279 Due to the fact that the parsing of template arguments
21280 (as specified to a template-id) requires backtracking we
21281 cannot use this technique when inside a template argument
21282 list. */
21286 /* However, a parameter-declaration of the form
21287 "float(f)" (which is a valid declaration of a
21288 parameter "f") can also be interpreted as an
21289 expression (the conversion of "f" to "float"). */
21292 }
21293 else
21294 {
21302 }
21303 }
21305 parser->in_unbraced_linkage_specification_p
21308 /* Reset implicit_template_scope if we are about to leave the function
21309 parameter list that introduced it. Note that for out-of-line member
21310 definitions, there will be one or more class scopes before we get to
21311 the template parameter scope. */
21315 {
21319 {
21322 }
21323 }
21326 }
21328 /* Parse a parameter declaration.
21330 parameter-declaration:
21331 decl-specifier-seq ... [opt] declarator
21332 decl-specifier-seq declarator = assignment-expression
21333 decl-specifier-seq ... [opt] abstract-declarator [opt]
21334 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21336 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21337 declares a template parameter. (In that case, a non-nested `>'
21338 token encountered during the parsing of the assignment-expression
21339 is not interpreted as a greater-than operator.)
21341 Returns a representation of the parameter, or NULL if an error
21342 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21343 true iff the declarator is of the form "(p)". */
21349 {
21351 cp_decl_specifier_seq decl_specifiers;
21353 tree default_argument;
21358 /* In a template parameter, `>' is not an operator.
21360 [temp.param]
21362 When parsing a default template-argument for a non-type
21363 template-parameter, the first non-nested `>' is taken as the end
21364 of the template parameter-list rather than a greater-than
21365 operator. */
21367 /* Type definitions may not appear in parameter types. */
21369 parser->type_definition_forbidden_message
21372 /* Parse the declaration-specifiers. */
21374 CP_PARSER_FLAGS_NONE,
21378 /* Complain about missing 'typename' or other invalid type names. */
21383 /* If an error occurred, there's no reason to attempt to parse the
21384 rest of the declaration. */
21386 {
21389 }
21391 /* Peek at the next token. */
21394 /* If the next token is a `)', `,', `=', `>', or `...', then there
21395 is no declarator. However, when variadic templates are enabled,
21396 there may be a declarator following `...'. */
21401 {
21405 }
21406 /* Otherwise, there should be a declarator. */
21407 else
21408 {
21412 /* After seeing a decl-specifier-seq, if the next token is not a
21413 "(", there is no possibility that the code is a valid
21414 expression. Therefore, if parsing tentatively, we commit at
21415 this point. */
21417 /* In an expression context, having seen:
21419 (int((char ...
21421 we cannot be sure whether we are looking at a
21422 function-type (taking a "char" as a parameter) or a cast
21423 of some object of type "char" to "int". */
21429 /* Parse the declarator. */
21432 CP_PARSER_DECLARATOR_EITHER,
21434 parenthesized_p,
21438 /* After the declarator, allow more attributes. */
21439 decl_specifiers.attributes
21443 /* If the declarator is a template parameter pack, remember that and
21444 clear the flag in the declarator itself so we don't get errors
21445 from grokdeclarator. */
21447 {
21450 }
21451 }
21453 /* If the next token is an ellipsis, and we have not seen a declarator
21454 name, and if either the type of the declarator contains parameter
21455 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21456 for, eg, abbreviated integral type names), then we actually have a
21457 parameter pack expansion expression. Otherwise, leave the ellipsis
21458 for a C-style variadic function. */
21461 {
21472 {
21473 /* Consume the `...'. */
21477 /* Build a pack expansion type */
21482 else
21484 }
21485 }
21487 /* The restriction on defining new types applies only to the type
21488 of the parameter, not to the default argument. */
21491 /* If the next token is `=', then process a default argument. */
21493 {
21496 /* If we are defining a class, then the tokens that make up the
21497 default argument must be saved and processed later. */
21503 // A constrained-type-specifier may declare a type template-parameter.
21505 default_argument
21508 // A constrained-type-specifier may declare a template-template-parameter.
21510 default_argument
21513 /* Outside of a class definition, we can just parse the
21514 assignment-expression. */
21515 else
21516 default_argument
21520 {
21522 "default arguments are only "
21524 }
21526 || template_parameter_pack_p
21529 {
21530 /* Find the name of the parameter pack. */
21537 template_parm_p
21543 else
21545 template_parm_p
21552 }
21553 }
21554 else
21558 declarator,
21559 default_argument,
21560 template_parameter_pack_p);
21561 }
21563 /* Parse a default argument and return it.
21565 TEMPLATE_PARM_P is true if this is a default argument for a
21566 non-type template parameter. */
21567 static tree
21569 {
21575 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21576 set correctly. */
21579 /* Local variable names (and the `this' keyword) may not
21580 appear in a default argument. */
21583 /* Parse the assignment-expression. */
21588 /* The "this" pointer is not valid in a default argument. */
21590 {
21595 }
21596 default_argument
21598 /* Restore the "this" pointer. */
21600 {
21603 }
21612 }
21614 /* Parse a function-body.
21616 function-body:
21617 compound_statement */
21619 static void
21621 {
21625 }
21627 /* Parse a ctor-initializer-opt followed by a function-body. Return
21628 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21629 is true we are parsing a function-try-block. */
21631 static bool
21634 {
21642 /* Begin the function body. */
21644 /* Parse the optional ctor-initializer. */
21647 /* If we're parsing a constexpr constructor definition, we need
21648 to check that the constructor body is indeed empty. However,
21649 before we get to cp_parser_function_body lot of junk has been
21650 generated, so we can't just check that we have an empty block.
21651 Rather we take a snapshot of the outermost block, and check whether
21652 cp_parser_function_body changed its state. */
21654 {
21658 }
21659 /* Parse the function-body. */
21663 /* Finish the function body. */
21667 }
21669 /* Parse an initializer.
21671 initializer:
21672 = initializer-clause
21673 ( expression-list )
21675 Returns an expression representing the initializer. If no
21676 initializer is present, NULL_TREE is returned.
21678 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21679 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21680 set to TRUE if there is no initializer present. If there is an
21681 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21682 is set to true; otherwise it is set to false. */
21684 static tree
21687 {
21689 tree init;
21691 /* Peek at the next token. */
21694 /* Let our caller know whether or not this initializer was
21695 parenthesized. */
21697 /* Assume that the initializer is constant. */
21701 {
21702 /* Consume the `='. */
21704 /* Parse the initializer-clause. */
21706 }
21708 {
21713 non_constant_p);
21718 }
21720 {
21725 }
21726 else
21727 {
21728 /* Anything else is an error. */
21731 }
21737 }
21739 /* Parse an initializer-clause.
21741 initializer-clause:
21742 assignment-expression
21743 braced-init-list
21745 Returns an expression representing the initializer.
21747 If the `assignment-expression' production is used the value
21748 returned is simply a representation for the expression.
21750 Otherwise, calls cp_parser_braced_list. */
21752 static cp_expr
21754 {
21755 cp_expr initializer;
21757 /* Assume the expression is constant. */
21760 /* If it is not a `{', then we are looking at an
21761 assignment-expression. */
21763 {
21764 initializer
21767 non_constant_p);
21768 }
21769 else
21773 }
21775 /* Parse a brace-enclosed initializer list.
21777 braced-init-list:
21778 { initializer-list , [opt] }
21779 { }
21781 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21782 the elements of the initializer-list (or NULL, if the last
21783 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21784 NULL_TREE. There is no way to detect whether or not the optional
21785 trailing `,' was provided. NON_CONSTANT_P is as for
21786 cp_parser_initializer. */
21788 static cp_expr
21790 {
21791 tree initializer;
21794 /* Consume the `{' token. */
21795 matching_braces braces;
21797 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21799 /* If it's not a `}', then there is a non-trivial initializer. */
21801 {
21802 /* Parse the initializer list. */
21805 /* A trailing `,' token is allowed. */
21808 }
21809 else
21811 /* Now, there should be a trailing `}'. */
21817 /* Build a location of the form:
21818 { ... }
21819 ^~~~~~~
21820 with caret==start at the open brace, finish at the close brace. */
21824 }
21826 /* Consume tokens up to, and including, the next non-nested closing `]'.
21827 Returns true iff we found a closing `]'. */
21829 static bool
21831 {
21835 {
21839 {
21842 /* If we've run out of tokens, then there is no closing `]'. */
21851 {
21854 }
21859 }
21861 /* Consume the token. */
21863 }
21864 }
21866 /* Return true if we are looking at an array-designator, false otherwise. */
21868 static bool
21870 {
21871 /* Consume the `['. */
21876 /* Skip tokens until the next token is a closing square bracket.
21877 If we find the closing `]', and the next token is a `=', then
21878 we are looking at an array designator. */
21879 bool array_designator_p
21883 /* Roll back the tokens we skipped. */
21887 }
21889 /* Parse an initializer-list.
21891 initializer-list:
21892 initializer-clause ... [opt]
21893 initializer-list , initializer-clause ... [opt]
21895 GNU Extension:
21897 initializer-list:
21898 designation initializer-clause ...[opt]
21899 initializer-list , designation initializer-clause ...[opt]
21901 designation:
21902 . identifier =
21903 identifier :
21904 [ constant-expression ] =
21906 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21907 for the initializer. If the INDEX of the elt is non-NULL, it is the
21908 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21909 as for cp_parser_initializer. */
21913 {
21916 /* Assume all of the expressions are constant. */
21919 /* Parse the rest of the list. */
21921 {
21923 tree designator;
21924 tree initializer;
21927 /* If the next token is an identifier and the following one is a
21928 colon, we are looking at the GNU designated-initializer
21929 syntax. */
21933 {
21934 /* Warn the user that they are using an extension. */
21937 /* Consume the identifier. */
21939 /* Consume the `:'. */
21941 }
21942 /* Also handle the C99 syntax, '. id ='. */
21947 {
21948 /* Warn the user that they are using an extension. */
21951 /* Consume the `.'. */
21953 /* Consume the identifier. */
21955 /* Consume the `='. */
21957 }
21958 /* Also handle C99 array designators, '[ const ] ='. */
21962 {
21963 /* In C++11, [ could start a lambda-introducer. */
21969 {
21972 }
21973 else
21974 {
21979 }
21985 }
21986 else
21989 /* Parse the initializer. */
21992 /* If any clause is non-constant, so is the entire initializer. */
21996 /* If we have an ellipsis, this is an initializer pack
21997 expansion. */
21999 {
22000 /* Consume the `...'. */
22003 /* Turn the initializer into an initializer expansion. */
22005 }
22007 /* Add it to the vector. */
22010 /* If the next token is not a comma, we have reached the end of
22011 the list. */
22015 /* Peek at the next token. */
22017 /* If the next token is a `}', then we're still done. An
22018 initializer-clause can have a trailing `,' after the
22019 initializer-list and before the closing `}'. */
22023 /* Consume the `,' token. */
22025 }
22028 }
22030 /* Classes [gram.class] */
22032 /* Parse a class-name.
22034 class-name:
22035 identifier
22036 template-id
22038 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22039 to indicate that names looked up in dependent types should be
22040 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22041 keyword has been used to indicate that the name that appears next
22042 is a template. TAG_TYPE indicates the explicit tag given before
22043 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22044 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22045 is the class being defined in a class-head. If ENUM_OK is TRUE,
22046 enum-names are also accepted.
22048 Returns the TYPE_DECL representing the class. */
22050 static tree
22059 {
22060 tree decl;
22061 tree scope;
22066 /* All class-names start with an identifier. */
22069 {
22072 }
22074 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22075 to a template-id, so we save it here. */
22080 /* Any name names a type if we're following the `typename' keyword
22081 in a qualified name where the enclosing scope is type-dependent. */
22084 /* Handle the common case (an identifier, but not a template-id)
22085 efficiently. */
22088 {
22092 /* Look for the identifier. */
22096 /* If the next token isn't an identifier, we are certainly not
22097 looking at a class-name. */
22100 /* If we know this is a type-name, there's no need to look it
22101 up. */
22104 else
22105 {
22106 tree ambiguous_decls;
22107 /* If we already know that this lookup is ambiguous, then
22108 we've already issued an error message; there's no reason
22109 to check again. */
22111 {
22114 }
22115 /* If the next token is a `::', then the name must be a type
22116 name.
22118 [basic.lookup.qual]
22120 During the lookup for a name preceding the :: scope
22121 resolution operator, object, function, and enumerator
22122 names are ignored. */
22125 /* Look up the name. */
22127 tag_type,
22130 check_dependency_p,
22134 {
22138 }
22139 }
22140 }
22141 else
22142 {
22143 /* Try a template-id. */
22145 check_dependency_p,
22146 tag_type,
22147 is_declaration);
22150 }
22154 /* If this is a typename, create a TYPENAME_TYPE. */
22156 {
22161 }
22165 /* Check to see that it is really the name of a class. */
22169 /* Situations like this:
22171 template <typename T> struct A {
22172 typename T::template X<int>::I i;
22173 };
22175 are problematic. Is `T::template X<int>' a class-name? The
22176 standard does not seem to be definitive, but there is no other
22177 valid interpretation of the following `::'. Therefore, those
22178 names are considered class-names. */
22179 {
22183 }
22188 /* In Objective-C 2.0, a classname followed by '.' starts a
22189 dot-syntax expression, and it's not a type-name. */
22201 }
22203 /* Parse a class-specifier.
22205 class-specifier:
22206 class-head { member-specification [opt] }
22208 Returns the TREE_TYPE representing the class. */
22210 static tree
22212 {
22213 tree type;
22227 /* Parse the class-head. */
22230 /* If the class-head was a semantic disaster, skip the entire body
22231 of the class. */
22233 {
22237 }
22239 /* Look for the `{'. */
22240 matching_braces braces;
22242 {
22245 }
22250 /* Issue an error message if type-definitions are forbidden here. */
22252 /* Remember that we are defining one more class. */
22254 /* Inside the class, surrounding template-parameter-lists do not
22255 apply. */
22256 saved_num_template_parameter_lists
22259 /* We are not in a function body. */
22262 /* Or in a loop. */
22265 /* Or in a switch. */
22268 /* We are not immediately inside an extern "lang" block. */
22269 saved_in_unbraced_linkage_specification_p
22273 // Associate constraints with the type.
22277 /* Start the class. */
22279 {
22282 }
22286 /* If the type is erroneous, skip the entire body of the class. */
22288 else
22289 /* Parse the member-specification. */
22292 /* Look for the trailing `}'. */
22294 /* Look for trailing attributes to apply to this class. */
22302 /* We've finished a type definition. Check for the common syntax
22303 error of forgetting a semicolon after the definition. We need to
22304 be careful, as we can't just check for not-a-semicolon and be done
22305 with it; the user might have typed:
22307 class X { } c = ...;
22308 class X { } *p = ...;
22310 and so forth. Instead, enumerate all the possible tokens that
22311 might follow this production; if we don't see one of them, then
22312 complain and silently insert the semicolon. */
22313 {
22318 /* Don't try to parse c++11 attributes here. As per the
22319 grammar, that should be a task for
22320 cp_parser_decl_specifier_seq. */
22324 {
22335 /* While it's legal for type qualifiers and storage class
22336 specifiers to follow type definitions in the grammar, only
22337 compiler testsuites contain code like that. Assume that if
22338 we see such code, then what we're really seeing is a case
22339 like:
22341 class X { }
22342 const <type> var = ...;
22344 or
22346 class Y { }
22347 static <type> func (...) ...
22349 i.e. the qualifier or specifier applies to the next
22350 declaration. To do so, however, we need to look ahead one
22351 more token to see if *that* token is a type specifier.
22353 This code could be improved to handle:
22355 class Z { }
22356 static const <type> var = ...; */
22359 {
22362 /* Handling user-defined types here would be nice, but very
22363 tricky. */
22364 want_semicolon
22367 }
22371 }
22373 /* If we don't have a type, then something is very wrong and we
22374 shouldn't try to do anything clever. Likewise for not seeing the
22375 closing brace. */
22377 {
22378 /* Locate the closing brace. */
22379 cp_token_position prev
22384 /* We want to suggest insertion of a ';' immediately *after* the
22385 closing brace, so, if we can, offset the location by 1 column. */
22392 /* If we successfully offset the location, suggest the fix-it. */
22405 else
22408 /* Unget one token and smash it to look as though we encountered
22409 a semicolon in the input stream. */
22414 }
22415 }
22417 /* If this class is not itself within the scope of another class,
22418 then we need to parse the bodies of all of the queued function
22419 definitions. Note that the queued functions defined in a class
22420 are not always processed immediately following the
22421 class-specifier for that class. Consider:
22423 struct A {
22424 struct B { void f() { sizeof (A); } };
22425 };
22427 If `f' were processed before the processing of `A' were
22428 completed, there would be no way to compute the size of `A'.
22429 Note that the nesting we are interested in here is lexical --
22430 not the semantic nesting given by TYPE_CONTEXT. In particular,
22431 for:
22433 struct A { struct B; };
22434 struct A::B { void f() { } };
22436 there is no need to delay the parsing of `A::B::f'. */
22438 {
22439 tree decl;
22446 /* In a first pass, parse default arguments to the functions.
22447 Then, in a second pass, parse the bodies of the functions.
22448 This two-phased approach handles cases like:
22450 struct S {
22451 void f() { g(); }
22452 void g(int i = 3);
22453 };
22455 */
22457 {
22459 /* If there are default arguments that have not yet been processed,
22460 take care of them now. */
22462 {
22467 }
22468 /* Make sure that any template parameters are in scope. */
22470 /* Parse the default argument expressions. */
22472 /* Remove any template parameters from the symbol table. */
22474 }
22476 /* Now parse any NSDMIs. */
22480 {
22482 {
22487 }
22490 }
22497 /* Now do some post-NSDMI bookkeeping. */
22503 /* Now parse the body of the functions. */
22505 {
22506 /* OpenMP UDRs need to be parsed before all other functions. */
22513 }
22514 else
22518 }
22519 else
22522 /* Put back any saved access checks. */
22525 /* Restore saved state. */
22529 parser->num_template_parameter_lists
22531 parser->in_unbraced_linkage_specification_p
22535 }
22537 static tree
22539 {
22540 tree ret;
22545 }
22547 /* Parse a class-head.
22549 class-head:
22550 class-key identifier [opt] base-clause [opt]
22551 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22552 class-key nested-name-specifier [opt] template-id
22553 base-clause [opt]
22555 class-virt-specifier:
22556 final
22558 GNU Extensions:
22559 class-key attributes identifier [opt] base-clause [opt]
22560 class-key attributes nested-name-specifier identifier base-clause [opt]
22561 class-key attributes nested-name-specifier [opt] template-id
22562 base-clause [opt]
22564 Upon return BASES is initialized to the list of base classes (or
22565 NULL, if there are none) in the same form returned by
22566 cp_parser_base_clause.
22568 Returns the TYPE of the indicated class. Sets
22569 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22570 involving a nested-name-specifier was used, and FALSE otherwise.
22572 Returns error_mark_node if this is not a class-head.
22574 Returns NULL_TREE if the class-head is syntactically valid, but
22575 semantically invalid in a way that means we should skip the entire
22576 body of the class. */
22578 static tree
22581 {
22582 tree nested_name_specifier;
22586 tree attributes;
22587 tree bases;
22597 /* Assume no nested-name-specifier will be present. */
22599 /* Assume no template parameter lists will be used in defining the
22600 type. */
22604 /* Look for the class-key. */
22611 /* Parse the attributes. */
22614 /* If the next token is `::', that is invalid -- but sometimes
22615 people do try to write:
22617 struct ::S {};
22619 Handle this gracefully by accepting the extra qualifier, and then
22620 issuing an error about it later if this really is a
22621 class-head. If it turns out just to be an elaborated type
22622 specifier, remain silent. */
22628 /* Determine the name of the class. Begin by looking for an
22629 optional nested-name-specifier. */
22631 nested_name_specifier
22637 /* If there was a nested-name-specifier, then there *must* be an
22638 identifier. */
22643 {
22645 /* Although the grammar says `identifier', it really means
22646 `class-name' or `template-name'. You are only allowed to
22647 define a class that has already been declared with this
22648 syntax.
22650 The proposed resolution for Core Issue 180 says that wherever
22651 you see `class T::X' you should treat `X' as a type-name.
22653 It is OK to define an inaccessible class; for example:
22655 class A { class B; };
22656 class A::B {};
22658 We do not know if we will see a class-name, or a
22659 template-name. We look for a class-name first, in case the
22660 class-name is a template-id; if we looked for the
22661 template-name first we would stop after the template-name. */
22668 class_type,
22672 /* If that didn't work, ignore the nested-name-specifier. */
22674 {
22680 }
22681 /* If we could not find a corresponding TYPE, treat this
22682 declaration like an unqualified declaration. */
22685 /* Otherwise, count the number of templates used in TYPE and its
22686 containing scopes. */
22687 else
22688 {
22689 tree scope;
22701 }
22702 }
22703 /* Otherwise, the identifier is optional. */
22704 else
22705 {
22706 /* We don't know whether what comes next is a template-id,
22707 an identifier, or nothing at all. */
22709 /* Check for a template-id. */
22714 class_key,
22716 /* If that didn't work, it could still be an identifier. */
22718 {
22720 {
22723 }
22724 else
22726 }
22727 else
22728 {
22731 }
22732 }
22737 {
22739 class_key,
22741 }
22744 /* If it's not a `:' or a `{' then we can't really be looking at a
22745 class-head, since a class-head only appears as part of a
22746 class-specifier. We have to detect this situation before calling
22747 xref_tag, since that has irreversible side-effects. */
22749 {
22753 }
22755 /* At this point, we're going ahead with the class-specifier, even
22756 if some other problem occurs. */
22759 {
22764 }
22765 /* Issue the error about the overly-qualified name now. */
22767 {
22772 }
22774 {
22779 }
22781 {
22782 tree scope;
22785 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22786 keyword template shall not appear at the top level. */
22790 /* Reject typedef-names in class heads. */
22792 {
22795 type);
22798 }
22800 /* Figure out in what scope the declaration is being placed. */
22802 /* If that scope does not contain the scope in which the
22803 class was originally declared, the program is invalid. */
22805 {
22808 "declaration of %qD in namespace %qD which does not "
22811 else
22817 }
22818 /* [dcl.meaning]
22820 A declarator-id shall not be qualified except for the
22821 definition of a ... nested class outside of its class
22822 ... [or] the definition or explicit instantiation of a
22823 class member of a namespace outside of its namespace. */
22825 {
22830 }
22831 }
22832 /* An explicit-specialization must be preceded by "template <>". If
22833 it is not, try to recover gracefully. */
22836 && !processing_template_parmlist
22838 {
22839 /* Build a location of this form:
22840 struct typename <ARGS>
22841 ^~~~~~~~~~~~~~~~~~~~~~
22842 with caret==start at the start token, and
22843 finishing at the end of the type. */
22844 location_t reported_loc
22846 class_head_start_location,
22851 error_at_rich_loc
22855 /* Take the same action that would have been taken by
22856 cp_parser_explicit_specialization. */
22859 }
22860 /* There must be no "return" statements between this point and the
22861 end of this function; set "type "to the correct return value and
22862 use "goto done;" to return. */
22863 /* Make sure that the right number of template parameters were
22864 present. */
22868 {
22869 /* If something went wrong, there is no point in even trying to
22870 process the class-definition. */
22873 }
22875 /* Look up the type. */
22877 {
22881 {
22885 }
22886 else
22887 {
22891 /* Check the scope while we still know whether or not we had a
22892 nested-name-specifier. */
22895 }
22898 }
22900 {
22901 tree class_type;
22903 /* Given:
22905 template <typename T> struct S { struct T };
22906 template <typename T> struct S<T>::T { };
22908 we will get a TYPENAME_TYPE when processing the definition of
22909 `S::T'. We need to resolve it to the actual type before we
22910 try to define it. */
22912 {
22917 else
22918 {
22921 }
22922 }
22926 {
22929 }
22932 /* Enter the scope indicated by the nested-name-specifier. */
22934 /* Get the canonical version of this type. */
22936 /* Call push_template_decl if it seems like we should be defining a
22937 template either from the template headers or the type we're
22938 defining, so that we diagnose both extra and missing headers. */
22942 {
22945 {
22948 }
22949 }
22953 }
22955 {
22956 /* If the class was unnamed, create a dummy name. */
22960 ? ts_within_enclosing_non_class
22964 }
22966 /* Indicate whether this class was declared as a `class' or as a
22967 `struct'. */
22972 /* If this type was already complete, and we see another definition,
22973 that's an error. */
22975 {
22977 type);
22979 type);
22982 }
22987 {
22988 /* Apply attributes now, before any use of the class as a template
22989 argument in its base list. */
22992 }
22994 /* We will have entered the scope containing the class; the names of
22995 base classes should be looked up in that context. For example:
22997 struct A { struct B {}; struct C; };
22998 struct A::C : B {};
23000 is valid. */
23002 /* Get the list of base-classes, if there is one. */
23004 {
23005 /* PR59482: enter the class scope so that base-specifiers are looked
23006 up correctly. */
23010 /* PR59482: get out of the previously pushed class scope so that the
23011 subsequent pops pop the right thing. */
23014 }
23015 else
23018 /* If we're really defining a class, process the base classes.
23019 If they're invalid, fail. */
23023 done:
23024 /* Leave the scope given by the nested-name-specifier. We will
23025 enter the class scope itself while processing the members. */
23030 {
23033 }
23039 out:
23042 }
23044 /* Parse a class-key.
23046 class-key:
23047 class
23048 struct
23049 union
23051 Returns the kind of class-key specified, or none_type to indicate
23052 error. */
23054 static enum tag_types
23056 {
23060 /* Look for the class-key. */
23065 /* Check to see if the TOKEN is a class-key. */
23070 }
23072 /* Parse a type-parameter-key.
23074 type-parameter-key:
23075 class
23076 typename
23077 */
23079 static void
23081 {
23082 /* Look for the type-parameter-key. */
23086 {
23089 /* typename is not allowed in a template template parameter
23090 by the standard until C++1Z. */
23092 "ISO C++ forbids typename key in template template parameter;"
23094 }
23095 else
23099 }
23101 /* Parse an (optional) member-specification.
23103 member-specification:
23104 member-declaration member-specification [opt]
23105 access-specifier : member-specification [opt] */
23107 static void
23109 {
23111 {
23115 /* Peek at the next token. */
23117 /* If it's a `}', or EOF then we've seen all the members. */
23123 /* See if this token is a keyword. */
23126 {
23130 /* Consume the access-specifier. */
23132 /* Remember which access-specifier is active. */
23134 /* Look for the `:'. */
23139 /* Accept #pragmas at class scope. */
23141 {
23144 }
23146 /* Otherwise, the next construction must be a
23147 member-declaration. */
23149 }
23150 }
23151 }
23153 /* Parse a member-declaration.
23155 member-declaration:
23156 decl-specifier-seq [opt] member-declarator-list [opt] ;
23157 function-definition ; [opt]
23158 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23159 using-declaration
23160 template-declaration
23161 alias-declaration
23163 member-declarator-list:
23164 member-declarator
23165 member-declarator-list , member-declarator
23167 member-declarator:
23168 declarator pure-specifier [opt]
23169 declarator constant-initializer [opt]
23170 identifier [opt] : constant-expression
23172 GNU Extensions:
23174 member-declaration:
23175 __extension__ member-declaration
23177 member-declarator:
23178 declarator attributes [opt] pure-specifier [opt]
23179 declarator attributes [opt] constant-initializer [opt]
23180 identifier [opt] attributes [opt] : constant-expression
23182 C++0x Extensions:
23184 member-declaration:
23185 static_assert-declaration */
23187 static void
23189 {
23190 cp_decl_specifier_seq decl_specifiers;
23191 tree prefix_attributes;
23192 tree decl;
23201 /* Check for the `__extension__' keyword. */
23203 {
23204 /* Recurse. */
23206 /* Restore the old value of the PEDANTIC flag. */
23210 }
23212 /* Check for a template-declaration. */
23214 {
23215 /* An explicit specialization here is an error condition, and we
23216 expect the specialization handler to detect and report this. */
23220 else
23224 }
23225 /* Check for a template introduction. */
23229 /* Check for a using-declaration. */
23231 {
23233 {
23234 /* Parse the using-declaration. */
23238 }
23239 else
23240 {
23241 tree decl;
23245 /* Note that if we actually see the '=' token after the
23246 identifier, cp_parser_alias_declaration commits the
23247 tentative parse. In that case, we really expect an
23248 alias-declaration. Otherwise, we expect a using
23249 declaration. */
23250 alias_decl_expected =
23256 else
23260 }
23261 }
23263 /* Check for @defs. */
23265 {
23270 {
23275 }
23277 }
23279 /* If the next token is `static_assert' we have a static assertion. */
23281 {
23284 }
23291 /* Parse the decl-specifier-seq. */
23294 CP_PARSER_FLAGS_OPTIONAL,
23297 /* Check for an invalid type-name. */
23301 /* If there is no declarator, then the decl-specifier-seq should
23302 specify a type. */
23304 {
23305 /* If there was no decl-specifier-seq, and the next token is a
23306 `;', then we have something like:
23308 struct S { ; };
23310 [class.mem]
23312 Each member-declaration shall declare at least one member
23313 name of the class. */
23315 {
23318 {
23322 }
23323 }
23324 else
23325 {
23326 tree type;
23328 /* See if this declaration is a friend. */
23330 /* If there were decl-specifiers, check to see if there was
23331 a class-declaration. */
23334 /* Nested classes have already been added to the class, but
23335 a `friend' needs to be explicitly registered. */
23337 {
23338 /* If the `friend' keyword was present, the friend must
23339 be introduced with a class-key. */
23342 "in C++03 a class-key must be used "
23344 /* In this case:
23346 template <typename T> struct A {
23347 friend struct A<T>::B;
23348 };
23350 A<T>::B will be represented by a TYPENAME_TYPE, and
23351 therefore not recognized by check_tag_decl. */
23353 {
23357 }
23360 "friend declaration does not name a class or "
23362 else
23365 }
23366 /* If there is no TYPE, an error message will already have
23367 been issued. */
23369 ;
23370 /* An anonymous aggregate has to be handled specially; such
23371 a declaration really declares a data member (with a
23372 particular type), as opposed to a nested class. */
23374 {
23375 /* C++11 9.5/6. */
23378 "a storage class on an anonymous aggregate "
23381 /* Remove constructors and such from TYPE, now that we
23382 know it is an anonymous aggregate. */
23384 /* And make the corresponding data member. */
23387 /* Add it to the class. */
23389 }
23390 else
23391 cp_parser_check_access_in_redeclaration
23394 }
23395 }
23396 else
23397 {
23400 /* Clear attributes from the decl_specifiers but keep them
23401 around as prefix attributes that apply them to the entity
23402 being declared. */
23406 /* See if these declarations will be friends. */
23409 /* Keep going until we hit the `;' at the end of the
23410 declaration. */
23412 {
23414 tree first_attribute;
23416 /* Peek at the next token. */
23419 /* Check for a bitfield declaration. */
23424 {
23425 tree identifier;
23426 tree width;
23428 /* Get the name of the bitfield. Note that we cannot just
23429 check TOKEN here because it may have been invalidated by
23430 the call to cp_lexer_peek_nth_token above. */
23433 else
23436 /* Consume the `:' token. */
23438 /* Get the width of the bitfield. */
23439 width
23442 /* Look for attributes that apply to the bitfield. */
23444 /* Remember which attributes are prefix attributes and
23445 which are not. */
23447 /* Combine the attributes. */
23450 /* Create the bitfield declaration. */
23453 identifier,
23454 sfk_none)
23457 width,
23458 attributes);
23459 }
23460 else
23461 {
23463 tree initializer;
23464 tree asm_specification;
23467 /* Parse the declarator. */
23468 declarator
23473 friend_p);
23475 /* If something went wrong parsing the declarator, make sure
23476 that we at least consume some tokens. */
23478 {
23479 /* Skip to the end of the statement. */
23481 /* If the next token is not a semicolon, that is
23482 probably because we just skipped over the body of
23483 a function. So, we consume a semicolon if
23484 present, but do not issue an error message if it
23485 is not present. */
23487 CPP_SEMICOLON))
23490 }
23493 cp_parser_check_for_definition_in_return_type
23497 /* Look for an asm-specification. */
23499 /* Look for attributes that apply to the declaration. */
23501 /* Remember which attributes are prefix attributes and
23502 which are not. */
23504 /* Combine the attributes. */
23507 /* If it's an `=', then we have a constant-initializer or a
23508 pure-specifier. It is not correct to parse the
23509 initializer before registering the member declaration
23510 since the member declaration should be in scope while
23511 its initializer is processed. However, the rest of the
23512 front end does not yet provide an interface that allows
23513 us to handle this correctly. */
23515 {
23516 /* In [class.mem]:
23518 A pure-specifier shall be used only in the declaration of
23519 a virtual function.
23521 A member-declarator can contain a constant-initializer
23522 only if it declares a static member of integral or
23523 enumeration type.
23525 Therefore, if the DECLARATOR is for a function, we look
23526 for a pure-specifier; otherwise, we look for a
23527 constant-initializer. When we call `grokfield', it will
23528 perform more stringent semantics checks. */
23540 {
23542 /* Don't require a constant rvalue in C++11, since we
23543 might want a reference constant. We'll enforce
23544 constancy later. */
23546 /* Parse the initializer. */
23549 }
23550 else
23551 /* Parse the initializer. */
23553 }
23556 {
23560 else
23562 }
23563 /* Otherwise, there is no initializer. */
23564 else
23567 /* See if we are probably looking at a function
23568 definition. We are certainly not looking at a
23569 member-declarator. Calling `grokfield' has
23570 side-effects, so we must not do it unless we are sure
23571 that we are looking at a member-declarator. */
23574 {
23575 /* The grammar does not allow a pure-specifier to be
23576 used when a member function is defined. (It is
23577 possible that this fact is an oversight in the
23578 standard, since a pure function may be defined
23579 outside of the class-specifier. */
23585 declarator,
23586 attributes);
23589 /* If the member was not a friend, declare it here. */
23592 /* Peek at the next token. */
23594 /* If the next token is a semicolon, consume it. */
23596 {
23597 location_t semicolon_loc
23602 "extra %<;%> after in-class "
23604 }
23606 }
23607 else
23610 /* Create the declaration. */
23615 {
23618 else
23620 }
23621 }
23626 /* Reset PREFIX_ATTRIBUTES. */
23632 /* If there is any qualification still in effect, clear it
23633 now; we will be starting fresh with the next declarator. */
23637 /* If it's a `,', then there are more declarators. */
23639 {
23642 {
23648 }
23649 }
23650 /* If the next token isn't a `;', then we have a parse error. */
23652 CPP_SEMICOLON))
23653 {
23654 /* The next token might be a ways away from where the
23655 actual semicolon is missing. Find the previous token
23656 and use that for our error position. */
23663 /* Assume that the user meant to provide a semicolon. If
23664 we were to cp_parser_skip_to_end_of_statement, we might
23665 skip to a semicolon inside a member function definition
23666 and issue nonsensical error messages. */
23668 }
23671 {
23672 /* Add DECL to the list of members. */
23674 /* Explicitly include, eg, NSDMIs, for better error
23675 recovery (c++/58650). */
23684 /* Add DECL to the queue of NSDMI to be parsed later. */
23686 }
23690 }
23691 }
23694 out:
23696 }
23698 /* Parse a pure-specifier.
23700 pure-specifier:
23701 = 0
23703 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23704 Otherwise, ERROR_MARK_NODE is returned. */
23706 static tree
23708 {
23711 /* Look for the `=' token. */
23714 /* Look for the `0' token. */
23723 /* Accept = default or = delete in c++0x mode. */
23726 {
23729 }
23731 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23733 {
23738 }
23740 {
23743 }
23746 }
23748 /* Parse a constant-initializer.
23750 constant-initializer:
23751 = constant-expression
23753 Returns a representation of the constant-expression. */
23755 static tree
23757 {
23758 /* Look for the `=' token. */
23762 /* It is invalid to write:
23764 struct S { static const int i = { 7 }; };
23766 */
23768 {
23771 /* Consume the opening brace. */
23772 matching_braces braces;
23774 /* Skip the initializer. */
23776 /* Look for the trailing `}'. */
23780 }
23783 }
23785 /* Derived classes [gram.class.derived] */
23787 /* Parse a base-clause.
23789 base-clause:
23790 : base-specifier-list
23792 base-specifier-list:
23793 base-specifier ... [opt]
23794 base-specifier-list , base-specifier ... [opt]
23796 Returns a TREE_LIST representing the base-classes, in the order in
23797 which they were declared. The representation of each node is as
23798 described by cp_parser_base_specifier.
23800 In the case that no bases are specified, this function will return
23801 NULL_TREE, not ERROR_MARK_NODE. */
23803 static tree
23805 {
23808 /* Look for the `:' that begins the list. */
23811 /* Scan the base-specifier-list. */
23813 {
23815 tree base;
23818 /* Look for the base-specifier. */
23820 /* Look for the (optional) ellipsis. */
23822 {
23823 /* Consume the `...'. */
23827 }
23829 /* Add BASE to the front of the list. */
23831 {
23833 /* Make this a pack expansion type. */
23837 {
23840 }
23841 }
23842 /* Peek at the next token. */
23844 /* If it's not a comma, then the list is complete. */
23847 /* Consume the `,'. */
23849 }
23851 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23852 base class had a qualified name. However, the next name that
23853 appears is certainly not qualified. */
23859 }
23861 /* Parse a base-specifier.
23863 base-specifier:
23864 :: [opt] nested-name-specifier [opt] class-name
23865 virtual access-specifier [opt] :: [opt] nested-name-specifier
23866 [opt] class-name
23867 access-specifier virtual [opt] :: [opt] nested-name-specifier
23868 [opt] class-name
23870 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23871 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23872 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23873 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23875 static tree
23877 {
23885 tree type;
23887 /* Process the optional `virtual' and `access-specifier'. */
23889 {
23890 /* Peek at the next token. */
23892 /* Process `virtual'. */
23894 {
23896 /* If `virtual' appears more than once, issue an error. */
23898 {
23902 }
23906 /* Consume the `virtual' token. */
23914 /* If more than one access specifier appears, issue an
23915 error. */
23918 {
23922 }
23926 /* Consume the access-specifier. */
23934 }
23935 }
23936 /* It is not uncommon to see programs mechanically, erroneously, use
23937 the 'typename' keyword to denote (dependent) qualified types
23938 as base classes. */
23940 {
23945 else
23947 "keyword %<typename%> not allowed in this context "
23950 }
23952 /* Look for the optional `::' operator. */
23954 /* Look for the nested-name-specifier. The simplest way to
23955 implement:
23957 [temp.res]
23959 The keyword `typename' is not permitted in a base-specifier or
23960 mem-initializer; in these contexts a qualified name that
23961 depends on a template-parameter is implicitly assumed to be a
23962 type name.
23964 is to pretend that we have seen the `typename' keyword at this
23965 point. */
23971 /* If the base class is given by a qualified name, assume that names
23972 we see are type names or templates, as appropriate. */
23978 /* DR 950 allows decltype as a base-specifier. */
23980 else
23981 {
23982 /* Otherwise, look for the class-name. */
23984 class_scope_p,
23985 template_p,
23986 typename_type,
23991 }
23997 }
23999 /* Exception handling [gram.exception] */
24001 /* Parse an (optional) noexcept-specification.
24003 noexcept-specification:
24004 noexcept ( constant-expression ) [opt]
24006 If no noexcept-specification is present, returns NULL_TREE.
24007 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24008 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24009 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24010 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24011 in which case a boolean condition is returned instead. */
24013 static tree
24018 {
24022 /* Peek at the next token. */
24025 /* Is it a noexcept-specification? */
24027 {
24028 tree expr;
24032 {
24033 matching_parens parens;
24037 {
24038 /* Types may not be defined in an exception-specification. */
24040 parser->type_definition_forbidden_message
24045 /* Restore the saved message. */
24047 }
24048 else
24049 {
24052 }
24055 }
24056 else
24057 {
24061 }
24063 /* We cannot build a noexcept-spec right away because this will check
24064 that expr is a constexpr. */
24067 else
24069 }
24070 else
24072 }
24074 /* Parse an (optional) exception-specification.
24076 exception-specification:
24077 throw ( type-id-list [opt] )
24079 Returns a TREE_LIST representing the exception-specification. The
24080 TREE_VALUE of each node is a type. */
24082 static tree
24084 {
24086 tree type_id_list;
24089 /* Peek at the next token. */
24092 /* Is it a noexcept-specification? */
24098 /* If it's not `throw', then there's no exception-specification. */
24104 /* Consume the `throw'. */
24107 /* Look for the `('. */
24108 matching_parens parens;
24111 /* Peek at the next token. */
24113 /* If it's not a `)', then there is a type-id-list. */
24115 {
24116 /* Types may not be defined in an exception-specification. */
24118 parser->type_definition_forbidden_message
24120 /* Parse the type-id-list. */
24122 /* Restore the saved message. */
24126 {
24130 }
24133 "dynamic exception specifications are deprecated in "
24135 }
24136 /* In C++17, throw() is equivalent to noexcept (true). throw()
24137 is deprecated in C++11 and above as well, but is still widely used,
24138 so don't warn about it yet. */
24141 else
24144 /* Look for the `)'. */
24148 }
24150 /* Parse an (optional) type-id-list.
24152 type-id-list:
24153 type-id ... [opt]
24154 type-id-list , type-id ... [opt]
24156 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24157 in the order that the types were presented. */
24159 static tree
24161 {
24165 {
24167 tree type;
24171 /* Get the next type-id. */
24173 /* Check for invalid 'auto'. */
24175 {
24179 }
24180 /* Parse the optional ellipsis. */
24182 {
24183 /* Consume the `...'. */
24186 /* Turn the type into a pack expansion expression. */
24188 }
24189 /* Add it to the list. */
24191 /* Peek at the next token. */
24193 /* If it is not a `,', we are done. */
24196 /* Consume the `,'. */
24198 }
24201 }
24203 /* Parse a try-block.
24205 try-block:
24206 try compound-statement handler-seq */
24208 static tree
24210 {
24211 tree try_block;
24225 }
24227 /* Parse a function-try-block.
24229 function-try-block:
24230 try ctor-initializer [opt] function-body handler-seq */
24232 static bool
24234 {
24235 tree compound_stmt;
24236 tree try_block;
24239 /* Look for the `try' keyword. */
24242 /* Let the rest of the front end know where we are. */
24244 /* Parse the function-body. */
24245 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24247 /* We're done with the `try' part. */
24249 /* Parse the handlers. */
24251 /* We're done with the handlers. */
24255 }
24257 /* Parse a handler-seq.
24259 handler-seq:
24260 handler handler-seq [opt] */
24262 static void
24264 {
24266 {
24269 /* Parse the handler. */
24271 /* Peek at the next token. */
24273 /* If it's not `catch' then there are no more handlers. */
24276 }
24277 }
24279 /* Parse a handler.
24281 handler:
24282 catch ( exception-declaration ) compound-statement */
24284 static void
24286 {
24287 tree handler;
24288 tree declaration;
24292 matching_parens parens;
24299 }
24301 /* Parse an exception-declaration.
24303 exception-declaration:
24304 type-specifier-seq declarator
24305 type-specifier-seq abstract-declarator
24306 type-specifier-seq
24307 ...
24309 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24310 ellipsis variant is used. */
24312 static tree
24314 {
24315 cp_decl_specifier_seq type_specifiers;
24319 /* If it's an ellipsis, it's easy to handle. */
24321 {
24322 /* Consume the `...' token. */
24325 }
24327 /* Types may not be defined in exception-declarations. */
24329 parser->type_definition_forbidden_message
24332 /* Parse the type-specifier-seq. */
24336 /* If it's a `)', then there is no declarator. */
24339 else
24346 /* Restore the saved message. */
24353 }
24355 /* Parse a throw-expression.
24357 throw-expression:
24358 throw assignment-expression [opt]
24360 Returns a THROW_EXPR representing the throw-expression. */
24362 static tree
24364 {
24365 tree expression;
24370 /* Figure out whether or not there is an assignment-expression
24371 following the "throw" keyword. */
24379 else
24383 }
24385 /* GNU Extensions */
24387 /* Parse an (optional) asm-specification.
24389 asm-specification:
24390 asm ( string-literal )
24392 If the asm-specification is present, returns a STRING_CST
24393 corresponding to the string-literal. Otherwise, returns
24394 NULL_TREE. */
24396 static tree
24398 {
24400 tree asm_specification;
24402 /* Peek at the next token. */
24404 /* If the next token isn't the `asm' keyword, then there's no
24405 asm-specification. */
24409 /* Consume the `asm' token. */
24411 /* Look for the `('. */
24412 matching_parens parens;
24415 /* Look for the string-literal. */
24418 /* Look for the `)'. */
24422 }
24424 /* Parse an asm-operand-list.
24426 asm-operand-list:
24427 asm-operand
24428 asm-operand-list , asm-operand
24430 asm-operand:
24431 string-literal ( expression )
24432 [ string-literal ] string-literal ( expression )
24434 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24435 each node is the expression. The TREE_PURPOSE is itself a
24436 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24437 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24438 is a STRING_CST for the string literal before the parenthesis. Returns
24439 ERROR_MARK_NODE if any of the operands are invalid. */
24441 static tree
24443 {
24448 {
24449 tree string_literal;
24450 tree expression;
24451 tree name;
24454 {
24455 /* Consume the `[' token. */
24457 /* Read the operand name. */
24462 /* Look for the closing `]'. */
24464 }
24465 else
24467 /* Look for the string-literal. */
24470 /* Look for the `('. */
24471 matching_parens parens;
24473 /* Parse the expression. */
24475 /* Look for the `)'. */
24483 /* Add this operand to the list. */
24485 expression,
24486 asm_operands);
24487 /* If the next token is not a `,', there are no more
24488 operands. */
24491 /* Consume the `,'. */
24493 }
24496 }
24498 /* Parse an asm-clobber-list.
24500 asm-clobber-list:
24501 string-literal
24502 asm-clobber-list , string-literal
24504 Returns a TREE_LIST, indicating the clobbers in the order that they
24505 appeared. The TREE_VALUE of each node is a STRING_CST. */
24507 static tree
24509 {
24513 {
24514 tree string_literal;
24516 /* Look for the string literal. */
24518 /* Add it to the list. */
24520 /* If the next token is not a `,', then the list is
24521 complete. */
24524 /* Consume the `,' token. */
24526 }
24529 }
24531 /* Parse an asm-label-list.
24533 asm-label-list:
24534 identifier
24535 asm-label-list , identifier
24537 Returns a TREE_LIST, indicating the labels in the order that they
24538 appeared. The TREE_VALUE of each node is a label. */
24540 static tree
24542 {
24546 {
24549 /* Look for the identifier. */
24552 {
24555 {
24561 }
24562 }
24563 /* If the next token is not a `,', then the list is
24564 complete. */
24567 /* Consume the `,' token. */
24569 }
24572 }
24574 /* Return TRUE iff the next tokens in the stream are possibly the
24575 beginning of a GNU extension attribute. */
24577 static bool
24579 {
24581 }
24583 /* Return TRUE iff the next tokens in the stream are possibly the
24584 beginning of a standard C++-11 attribute specifier. */
24586 static bool
24588 {
24590 }
24592 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24593 beginning of a standard C++-11 attribute specifier. */
24595 static bool
24597 {
24605 }
24607 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24608 beginning of a GNU extension attribute. */
24610 static bool
24612 {
24616 }
24618 /* Return true iff the next tokens can be the beginning of either a
24619 GNU attribute list, or a standard C++11 attribute sequence. */
24621 static bool
24623 {
24626 }
24628 /* Return true iff the next Nth tokens can be the beginning of either
24629 a GNU attribute list, or a standard C++11 attribute sequence. */
24631 static bool
24633 {
24636 }
24638 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24639 of GNU attributes, or return NULL. */
24641 static tree
24643 {
24647 }
24649 #define CILK_SIMD_FN_CLAUSE_MASK \
24650 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24651 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24652 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24653 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24654 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24656 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24657 vector [(<clauses>)] */
24659 static void
24661 {
24665 {
24671 }
24674 {
24677 paren_scope++;
24678 }
24680 {
24683 paren_scope++;
24685 paren_scope--;
24686 /* Do not push the last ')' */
24689 }
24698 }
24700 /* Parse an (optional) series of attributes.
24702 attributes:
24703 attributes attribute
24705 attribute:
24706 __attribute__ (( attribute-list [opt] ))
24708 The return value is as for cp_parser_gnu_attribute_list. */
24710 static tree
24712 {
24716 {
24718 tree attribute_list;
24721 /* Peek at the next token. */
24723 /* If it's not `__attribute__', then we're done. */
24727 /* Consume the `__attribute__' keyword. */
24729 /* Look for the two `(' tokens. */
24730 matching_parens outer_parens;
24732 matching_parens inner_parens;
24735 /* Peek at the next token. */
24738 /* Parse the attribute-list. */
24740 else
24741 /* If the next token is a `)', then there is no attribute
24742 list. */
24745 /* Look for the two `)' tokens. */
24753 /* Add these new attributes to the list. */
24755 }
24758 }
24760 /* Parse a GNU attribute-list.
24762 attribute-list:
24763 attribute
24764 attribute-list , attribute
24766 attribute:
24767 identifier
24768 identifier ( identifier )
24769 identifier ( identifier , expression-list )
24770 identifier ( expression-list )
24772 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24773 to an attribute. The TREE_PURPOSE of each node is the identifier
24774 indicating which attribute is in use. The TREE_VALUE represents
24775 the arguments, if any. */
24777 static tree
24779 {
24785 {
24787 tree identifier;
24788 tree attribute;
24790 /* Look for the identifier. We also allow keywords here; for
24791 example `__attribute__ ((const))' is legal. */
24795 {
24798 /* Consume the token, but save it since we need it for the
24799 SIMD enabled function parsing. */
24802 /* Save away the identifier that indicates which attribute
24803 this is. */
24805 /* For keywords, use the canonical spelling, not the
24806 parsed identifier. */
24813 /* Peek at the next token. */
24815 /* If it's an `(', then parse the attribute arguments. */
24817 {
24822 {
24825 }
24826 else
24827 vec = cp_parser_parenthesized_expression_list
24833 else
24834 {
24837 }
24838 /* Save the arguments away. */
24840 }
24842 {
24845 }
24848 {
24849 /* Add this attribute to the list. */
24852 }
24855 }
24856 /* Now, look for more attributes. If the next token isn't a
24857 `,', we're done. */
24861 /* Consume the comma and keep going. */
24863 }
24866 /* We built up the list in reverse order. */
24868 }
24870 /* Parse a standard C++11 attribute.
24872 The returned representation is a TREE_LIST which TREE_PURPOSE is
24873 the scoped name of the attribute, and the TREE_VALUE is its
24874 arguments list.
24876 Note that the scoped name of the attribute is itself a TREE_LIST
24877 which TREE_PURPOSE is the namespace of the attribute, and
24878 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24879 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24880 and which TREE_PURPOSE is directly the attribute name.
24882 Clients of the attribute code should use get_attribute_namespace
24883 and get_attribute_name to get the actual namespace and name of
24884 attributes, regardless of their being GNU or C++11 attributes.
24886 attribute:
24887 attribute-token attribute-argument-clause [opt]
24889 attribute-token:
24890 identifier
24891 attribute-scoped-token
24893 attribute-scoped-token:
24894 attribute-namespace :: identifier
24896 attribute-namespace:
24897 identifier
24899 attribute-argument-clause:
24900 ( balanced-token-seq )
24902 balanced-token-seq:
24903 balanced-token [opt]
24904 balanced-token-seq balanced-token
24906 balanced-token:
24907 ( balanced-token-seq )
24908 [ balanced-token-seq ]
24909 { balanced-token-seq }. */
24911 static tree
24913 {
24917 /* First, parse name of the attribute, a.k.a attribute-token. */
24934 {
24935 /* We are seeing a scoped attribute token. */
24950 else
24951 {
24955 }
24959 NULL_TREE);
24961 }
24964 NULL_TREE);
24965 else
24966 {
24969 NULL_TREE);
24970 /* C++11 noreturn attribute is equivalent to GNU's. */
24973 /* C++14 deprecated attribute is equivalent to GNU's. */
24976 /* C++17 fallthrough attribute is equivalent to GNU's. */
24979 /* Transactional Memory TS optimize_for_synchronized attribute is
24980 equivalent to GNU transaction_callable. */
24984 /* Transactional Memory attributes are GNU attributes. */
24987 }
24989 /* Now parse the optional argument clause of the attribute. */
24994 {
25000 /* A GNU attribute that takes an identifier in parameter. */
25003 vec = cp_parser_parenthesized_expression_list
25009 else
25010 {
25013 }
25017 else
25019 }
25022 }
25024 /* Check that the attribute ATTRIBUTE appears at most once in the
25025 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25026 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25027 isn't implemented yet in GCC. */
25029 static void
25031 {
25033 {
25043 }
25044 }
25046 /* Parse a list of standard C++-11 attributes.
25048 attribute-list:
25049 attribute [opt]
25050 attribute-list , attribute[opt]
25051 attribute ...
25052 attribute-list , attribute ...
25053 */
25055 static tree
25057 {
25062 {
25067 {
25071 }
25074 {
25079 else
25080 {
25085 }
25087 }
25091 }
25094 }
25096 /* Parse a standard C++-11 attribute specifier.
25098 attribute-specifier:
25099 [ [ attribute-using-prefix [opt] attribute-list ] ]
25100 alignment-specifier
25102 attribute-using-prefix:
25103 using attribute-namespace :
25105 alignment-specifier:
25106 alignas ( type-id ... [opt] )
25107 alignas ( alignment-expression ... [opt] ). */
25109 static tree
25111 {
25117 {
25124 {
25135 {
25139 "attribute using prefix only available "
25145 }
25146 else
25148 }
25155 else
25156 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25157 when we are sure that we have actually parsed them. */
25159 }
25160 else
25161 {
25162 tree alignas_expr;
25164 /* Look for an alignment-specifier. */
25175 matching_parens parens;
25177 {
25180 }
25186 {
25193 }
25198 /* Handle alignas (pack...). */
25200 {
25203 }
25205 /* Something went wrong, so don't build the attribute. */
25210 {
25213 }
25215 /* Build the C++-11 representation of an 'aligned'
25216 attribute. */
25217 attributes =
25220 alignas_expr);
25221 }
25224 }
25226 /* Parse a standard C++-11 attribute-specifier-seq.
25228 attribute-specifier-seq:
25229 attribute-specifier-seq [opt] attribute-specifier
25230 */
25232 static tree
25234 {
25239 {
25248 else
25251 }
25254 }
25256 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25257 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25258 current value of the PEDANTIC flag, regardless of whether or not
25259 the `__extension__' keyword is present. The caller is responsible
25260 for restoring the value of the PEDANTIC flag. */
25262 static bool
25264 {
25265 /* Save the old value of the PEDANTIC flag. */
25269 {
25270 /* Consume the `__extension__' token. */
25272 /* We're not being pedantic while the `__extension__' keyword is
25273 in effect. */
25277 }
25280 }
25282 /* Parse a label declaration.
25284 label-declaration:
25285 __label__ label-declarator-seq ;
25287 label-declarator-seq:
25288 identifier , label-declarator-seq
25289 identifier */
25291 static void
25293 {
25294 /* Look for the `__label__' keyword. */
25298 {
25299 tree identifier;
25301 /* Look for an identifier. */
25303 /* If we failed, stop. */
25306 /* Declare it as a label. */
25308 /* If the next token is a `;', stop. */
25311 /* Look for the `,' separating the label declarations. */
25313 }
25315 /* Look for the final `;'. */
25317 }
25319 // -------------------------------------------------------------------------- //
25320 // Requires Clause
25322 // Parse a requires clause.
25323 //
25324 // requires-clause:
25325 // 'requires' logical-or-expression
25326 //
25327 // The required logical-or-expression must be a constant expression. Note
25328 // that we don't check that the expression is constepxr here. We defer until
25329 // we analyze constraints and then, we only check atomic constraints.
25330 static tree
25332 {
25333 // Parse the requires clause so that it is not automatically folded.
25341 }
25343 // Optionally parse a requires clause:
25344 static tree
25346 {
25349 {
25352 {
25355 /* Parse and discard the requires-clause. */
25358 }
25360 }
25363 }
25366 /*---------------------------------------------------------------------------
25367 Requires expressions
25368 ---------------------------------------------------------------------------*/
25370 /* Parse a requires expression
25372 requirement-expression:
25373 'requires' requirement-parameter-list [opt] requirement-body */
25374 static tree
25376 {
25380 /* A requires-expression shall appear only within a concept
25381 definition or a requires-clause.
25383 TODO: Implement this diagnostic correctly. */
25385 {
25389 }
25392 {
25393 /* Local parameters are delared as variables within the scope
25394 of the expression. They are not visible past the end of
25395 the expression. Expressions within the requires-expression
25396 are unevaluated. */
25397 struct scope_sentinel
25398 {
25400 {
25403 }
25406 {
25409 }
25412 /* Parse the optional parameter list. */
25414 {
25418 }
25419 else
25422 /* Parse the requirement body. */
25426 }
25428 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25429 the parm chain. */
25432 }
25434 /* Parse a parameterized requirement.
25436 requirement-parameter-list:
25437 '(' parameter-declaration-clause ')' */
25438 static tree
25440 {
25441 matching_parens parens;
25451 }
25453 /* Parse the body of a requirement.
25455 requirement-body:
25456 '{' requirement-list '}' */
25457 static tree
25459 {
25460 matching_braces braces;
25470 }
25472 /* Parse a list of requirements.
25474 requirement-list:
25475 requirement
25476 requirement-list ';' requirement[opt] */
25477 static tree
25479 {
25482 {
25489 /* If we see a semi-colon, consume it. */
25493 /* Stop processing at the end of the list. */
25496 }
25498 /* Reverse the order of requirements so they are analyzed in
25499 declaration order. */
25501 }
25503 /* Parse a syntactic requirement or type requirement.
25505 requirement:
25506 simple-requirement
25507 compound-requirement
25508 type-requirement
25509 nested-requirement */
25510 static tree
25512 {
25519 else
25521 }
25523 /* Parse a simple requirement.
25525 simple-requirement:
25526 expression ';' */
25527 static tree
25529 {
25538 }
25540 /* Parse a type requirement
25542 type-requirement
25543 nested-name-specifier [opt] required-type-name ';'
25545 required-type-name:
25546 type-name
25547 'template' [opt] simple-template-id */
25548 static tree
25550 {
25553 // Save the scope before parsing name specifiers.
25564 tree type;
25566 {
25575 }
25576 else
25595 }
25597 /* Parse a compound requirement
25599 compound-requirement:
25600 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25601 static tree
25603 {
25604 /* Parse an expression enclosed in '{ }'s. */
25605 matching_braces braces;
25616 /* Parse the optional noexcept. */
25619 {
25622 }
25624 /* Parse the optional trailing return type. */
25627 {
25635 }
25638 }
25640 /* Parse a nested requirement. This is the same as a requires clause.
25642 nested-requirement:
25643 requires-clause */
25644 static tree
25646 {
25652 }
25654 /* Support Functions */
25656 /* Return the appropriate prefer_type argument for lookup_name_real based on
25657 tag_type and template_mem_access. */
25661 {
25662 /* DR 141: When looking in the current enclosing context for a template-name
25663 after -> or ., only consider class templates. */
25667 {
25671 }
25672 }
25674 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25675 NAME should have one of the representations used for an
25676 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25677 is returned. If PARSER->SCOPE is a dependent type, then a
25678 SCOPE_REF is returned.
25680 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25681 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25682 was formed. Abstractly, such entities should not be passed to this
25683 function, because they do not need to be looked up, but it is
25684 simpler to check for this special case here, rather than at the
25685 call-sites.
25687 In cases not explicitly covered above, this function returns a
25688 DECL, OVERLOAD, or baselink representing the result of the lookup.
25689 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25690 is returned.
25692 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25693 (e.g., "struct") that was used. In that case bindings that do not
25694 refer to types are ignored.
25696 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25697 ignored.
25699 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25700 are ignored.
25702 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25703 types.
25705 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25706 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25707 NULL_TREE otherwise. */
25709 static cp_expr
25716 location_t name_location)
25717 {
25718 tree decl;
25721 /* Assume that the lookup will be unambiguous. */
25725 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25726 no longer valid. Note that if we are parsing tentatively, and
25727 the parse fails, OBJECT_TYPE will be automatically restored. */
25733 /* A template-id has already been resolved; there is no lookup to
25734 do. */
25738 {
25742 }
25744 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25745 it should already have been checked to make sure that the name
25746 used matches the type being destroyed. */
25748 {
25749 tree type;
25751 /* Figure out to which type this destructor applies. */
25756 else
25758 /* If that's not a class type, there is no destructor. */
25769 }
25771 /* By this point, the NAME should be an ordinary identifier. If
25772 the id-expression was a qualified name, the qualifying scope is
25773 stored in PARSER->SCOPE at this point. */
25776 /* Perform the lookup. */
25778 {
25784 /* If the SCOPE is dependent, the lookup must be deferred until
25785 the template is instantiated -- unless we are explicitly
25786 looking up names in uninstantiated templates. Even then, we
25787 cannot look up the name if the scope is not a class type; it
25788 might, for example, be a template type parameter. */
25793 /* Defer lookup. */
25795 else
25796 {
25799 /* If PARSER->SCOPE is a dependent type, then it must be a
25800 class type, and we must not be checking dependencies;
25801 otherwise, we would have processed this lookup above. So
25802 that PARSER->SCOPE is not considered a dependent base by
25803 lookup_member, we must enter the scope here. */
25807 /* If the PARSER->SCOPE is a template specialization, it
25808 may be instantiated during name lookup. In that case,
25809 errors may be issued. Even if we rollback the current
25810 tentative parse, those errors are valid. */
25815 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25816 lookup result and the nested-name-specifier nominates a class C:
25817 * if the name specified after the nested-name-specifier, when
25818 looked up in C, is the injected-class-name of C (Clause 9), or
25819 * if the name specified after the nested-name-specifier is the
25820 same as the identifier or the simple-template-id's template-
25821 name in the last component of the nested-name-specifier,
25822 the name is instead considered to name the constructor of
25823 class C. [ Note: for example, the constructor is not an
25824 acceptable lookup result in an elaborated-type-specifier so
25825 the constructor would not be used in place of the
25826 injected-class-name. --end note ] Such a constructor name
25827 shall be used only in the declarator-id of a declaration that
25828 names a constructor or in a using-declaration. */
25836 /* If we have a single function from a using decl, pull it out. */
25843 }
25845 /* If the scope is a dependent type and either we deferred lookup or
25846 we did lookup but didn't find the name, rememeber the name. */
25849 {
25851 {
25852 tree type;
25854 /* The resolution to Core Issue 180 says that `struct
25855 A::B' should be considered a type-name, even if `A'
25856 is dependent. */
25861 }
25865 CPP_CLOSE_PAREN)))
25869 else
25872 is_template);
25873 }
25876 }
25878 {
25879 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25880 OBJECT_TYPE is not a class. */
25882 /* If the OBJECT_TYPE is a template specialization, it may
25883 be instantiated during name lookup. In that case, errors
25884 may be issued. Even if we rollback the current tentative
25885 parse, those errors are valid. */
25887 name,
25890 tf_warning_or_error);
25891 else
25895 /* Look it up in the enclosing context. DR 141: When looking for a
25896 template-name after -> or ., only consider class templates. */
25901 /* The object is type-dependent, so we can't look anything up; we used
25902 this to get the DR 141 behavior. */
25906 }
25907 else
25908 {
25914 }
25916 /* If the lookup failed, let our caller know. */
25920 /* Pull out the template from an injected-class-name (or multiple). */
25924 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25926 {
25929 /* The error message we have to print is too complicated for
25930 cp_parser_error, so we incorporate its actions directly. */
25932 {
25934 name);
25936 }
25938 }
25946 /* If we have resolved the name of a member declaration, check to
25947 see if the declaration is accessible. When the name resolves to
25948 set of overloaded functions, accessibility is checked when
25949 overload resolution is done.
25951 During an explicit instantiation, access is not checked at all,
25952 as per [temp.explicit]. */
25959 }
25961 /* Like cp_parser_lookup_name, but for use in the typical case where
25962 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25963 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25965 static tree
25967 {
25969 none_type,
25974 location);
25975 }
25977 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25978 the current context, return the TYPE_DECL. If TAG_NAME_P is
25979 true, the DECL indicates the class being defined in a class-head,
25980 or declared in an elaborated-type-specifier.
25982 Otherwise, return DECL. */
25984 static tree
25986 {
25987 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25988 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25990 struct A {
25991 template <typename T> struct B;
25992 };
25994 template <typename T> struct A::B {};
25996 Similarly, in an elaborated-type-specifier:
25998 namespace N { struct X{}; }
26000 struct A {
26001 template <typename T> friend struct N::X;
26002 };
26004 However, if the DECL refers to a class type, and we are in
26005 the scope of the class, then the name lookup automatically
26006 finds the TYPE_DECL created by build_self_reference rather
26007 than a TEMPLATE_DECL. For example, in:
26009 template <class T> struct S {
26010 S s;
26011 };
26013 there is no need to handle such case. */
26019 }
26021 /* If too many, or too few, template-parameter lists apply to the
26022 declarator, issue an error message. Returns TRUE if all went well,
26023 and FALSE otherwise. */
26025 static bool
26028 location_t declarator_location)
26029 {
26031 {
26033 {
26041 /* If the DECLARATOR has the form `X<y>' then it uses one
26042 additional level of template parameters. */
26045 return cp_parser_check_template_parameters
26047 }
26063 }
26065 }
26067 /* NUM_TEMPLATES were used in the current declaration. If that is
26068 invalid, return FALSE and issue an error messages. Otherwise,
26069 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26070 declarator and we can print more accurate diagnostics. */
26072 static bool
26075 location_t location,
26077 {
26078 /* If there are the same number of template classes and parameter
26079 lists, that's OK. */
26082 /* If there are more, but only one more, then we are referring to a
26083 member template. That's OK too. */
26086 /* If there are more template classes than parameter lists, we have
26087 something like:
26089 template <class T> void S<T>::R<T>::f (); */
26091 {
26101 else
26104 }
26105 /* Otherwise, there are too many template parameter lists. We have
26106 something like:
26108 template <class T> template <class U> void S::f(); */
26111 }
26113 /* Parse an optional `::' token indicating that the following name is
26114 from the global namespace. If so, PARSER->SCOPE is set to the
26115 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26116 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26117 Returns the new value of PARSER->SCOPE, if the `::' token is
26118 present, and NULL_TREE otherwise. */
26120 static tree
26122 {
26125 /* Peek at the next token. */
26127 /* If we're looking at a `::' token then we're starting from the
26128 global namespace, not our current location. */
26130 {
26131 /* Consume the `::' token. */
26133 /* Set the SCOPE so that we know where to start the lookup. */
26139 }
26141 {
26145 }
26148 }
26150 /* Returns TRUE if the upcoming token sequence is the start of a
26151 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26152 declarator is preceded by the `friend' specifier. */
26154 static bool
26156 {
26159 tree nested_name_specifier;
26162 /* The common case is that this is not a constructor declarator, so
26163 try to avoid doing lots of work if at all possible. It's not
26164 valid declare a constructor at function scope. */
26167 /* And only certain tokens can begin a constructor declarator. */
26175 /* Parse tentatively; we are going to roll back all of the tokens
26176 consumed here. */
26178 /* Assume that we are looking at a constructor declarator. */
26181 /* Look for the optional `::' operator. */
26184 /* Look for the nested-name-specifier. */
26185 nested_name_specifier
26196 /* Outside of a class-specifier, there must be a
26197 nested-name-specifier. Except in C++17 mode, where we
26198 might be declaring a guiding declaration. */
26205 /* If we have a class scope, this is easy; DR 147 says that S::S always
26206 names the constructor, and no other qualified name could. */
26209 {
26219 }
26220 /* If we still think that this might be a constructor-declarator,
26221 look for a class-name. */
26223 {
26224 /* If we have:
26226 template <typename T> struct S {
26227 S();
26228 };
26230 we must recognize that the nested `S' names a class. */
26234 tree type_decl;
26238 none_type,
26245 {
26251 none_type,
26256 else
26258 }
26260 /* If there was no class-name, then this is not a constructor.
26261 Otherwise, if we are in a class-specifier and we aren't
26262 handling a friend declaration, check that its type matches
26263 current_class_type (c++/38313). Note: error_mark_node
26264 is left alone for error recovery purposes. */
26266 && (outside_class_specifier_p
26272 /* If we're still considering a constructor, we have to see a `(',
26273 to begin the parameter-declaration-clause, followed by either a
26274 `)', an `...', or a decl-specifier. We need to check for a
26275 type-specifier to avoid being fooled into thinking that:
26277 S (f) (int);
26279 is a constructor. (It is actually a function named `f' that
26280 takes one parameter (of type `int') and returns a value of type
26281 `S'. */
26289 /* A parameter declaration begins with a decl-specifier,
26290 which is either the "attribute" keyword, a storage class
26291 specifier, or (usually) a type-specifier. */
26293 {
26294 tree type;
26298 /* Names appearing in the type-specifier should be looked up
26299 in the scope of the class. */
26303 {
26306 {
26310 {
26313 }
26314 }
26316 }
26318 /* Inside the constructor parameter list, surrounding
26319 template-parameter-lists do not apply. */
26320 saved_num_template_parameter_lists
26324 /* Look for the type-specifier. */
26326 CP_PARSER_FLAGS_NONE,
26332 parser->num_template_parameter_lists
26335 /* Leave the scope of the class. */
26340 }
26341 }
26343 /* We did not really want to consume any tokens. */
26347 }
26349 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26350 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26351 they must be performed once we are in the scope of the function.
26353 Returns the function defined. */
26355 static tree
26356 cp_parser_function_definition_from_specifiers_and_declarator
26359 tree attributes,
26361 {
26362 tree fn;
26365 /* Begin the function-definition. */
26368 /* The things we're about to see are not directly qualified by any
26369 template headers we've seen thus far. */
26372 /* If there were names looked up in the decl-specifier-seq that we
26373 did not check, check them now. We must wait until we are in the
26374 scope of the function to perform the checks, since the function
26375 might be a friend. */
26379 {
26384 }
26387 {
26388 /* Skip the entire function. */
26391 }
26393 {
26394 /* Seen already, skip it. An error message has already been output. */
26398 /* If this is a function from a class, pop the nested class. */
26401 }
26402 else
26403 {
26404 timevar_id_t tv;
26407 else
26413 }
26416 }
26418 /* Parse the part of a function-definition that follows the
26419 declarator. INLINE_P is TRUE iff this function is an inline
26420 function defined within a class-specifier.
26422 Returns the function defined. */
26424 static tree
26427 {
26428 tree fn;
26434 bool fully_implicit_function_template_p
26437 tree implicit_template_parms
26440 cp_binding_level* implicit_template_scope
26446 /* If the next token is `return', then the code may be trying to
26447 make use of the "named return value" extension that G++ used to
26448 support. */
26451 {
26452 /* Consume the `return' keyword. */
26454 /* Look for the identifier that indicates what value is to be
26455 returned. */
26457 /* Issue an error message. */
26460 /* Skip tokens until we reach the start of the function body. */
26462 {
26469 }
26470 }
26471 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26472 anything declared inside `f'. */
26473 saved_in_unbraced_linkage_specification_p
26476 /* Inside the function, surrounding template-parameter-lists do not
26477 apply. */
26478 saved_num_template_parameter_lists
26482 /* If the next token is `try', `__transaction_atomic', or
26483 `__transaction_relaxed`, then we are looking at either function-try-block
26484 or function-transaction-block. Note that all of these include the
26485 function-body. */
26488 RID_TRANSACTION_ATOMIC);
26490 RID_TRANSACTION_RELAXED))
26492 RID_TRANSACTION_RELAXED);
26495 else
26496 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26499 /* Finish the function. */
26502 /* Generate code for it, if necessary. */
26504 /* Restore the saved values. */
26505 parser->in_unbraced_linkage_specification_p
26507 parser->num_template_parameter_lists
26511 parser->fully_implicit_function_template_p
26513 parser->implicit_template_parms
26515 parser->implicit_template_scope
26522 }
26524 /* Parse a template-declaration body (following argument list). */
26526 static void
26528 tree parameter_list,
26530 {
26534 /* We just processed one more parameter list. */
26537 /* Get the deferred access checks from the parameter list. These
26538 will be checked once we know what is being declared, as for a
26539 member template the checks must be performed in the scope of the
26540 class containing the member. */
26543 /* Tentatively parse for a new template parameter list, which can either be
26544 the template keyword or a template introduction. */
26550 else
26551 {
26552 /* There are no access checks when parsing a template, as we do not
26553 know if a specialization will be a friend. */
26557 checks,
26558 member_p,
26563 /* If this is a member template declaration, let the front
26564 end know. */
26566 {
26571 }
26576 }
26577 /* We are done with the current parameter list. */
26582 /* Finish up. */
26585 /* Check the template arguments for a literal operator template. */
26589 {
26593 else
26594 {
26597 {
26603 }
26605 {
26614 }
26615 else
26617 }
26619 {
26622 " Expected non-type template argument pack <char...>"
26624 decl);
26625 else
26628 decl);
26629 }
26630 }
26632 /* Register member declarations. */
26635 /* If DECL is a function template, we must return to parse it later.
26636 (Even though there is no definition, there might be default
26637 arguments that need handling.) */
26641 }
26643 /* Parse a template introduction header for a template-declaration. Returns
26644 false if tentative parse fails. */
26646 static bool
26648 {
26655 /* Look for the optional `::' operator. */
26658 /* Look for the nested-name-specifier. */
26668 /* Look up the concept for which we will be matching
26669 template parameters. */
26679 /* Look for opening brace for introduction. */
26680 matching_braces braces;
26688 /* Build vector of placeholder parameters and grab
26689 matching identifiers. */
26692 /* The introduction-list shall not be empty. */
26695 {
26698 }
26700 /* Look for closing brace for introduction. */
26705 {
26709 }
26711 /* Build and associate the constraint. */
26714 {
26716 member_p);
26718 }
26722 }
26724 /* Parse a normal template-declaration following the template keyword. */
26726 static void
26728 {
26729 tree parameter_list;
26733 /* Look for the `<' token. */
26737 {
26738 /* 14.5.2.2 [temp.mem]
26740 A local class shall not have member templates. */
26745 }
26746 /* [temp]
26748 A template ... shall not have C linkage. */
26750 {
26752 /* Give it C++ linkage to avoid confusing other parts of the
26753 front end. */
26756 }
26757 else
26760 /* We cannot perform access checks on the template parameter
26761 declarations until we know what is being declared, just as we
26762 cannot check the decl-specifier list. */
26765 /* If the next token is `>', then we have an invalid
26766 specialization. Rather than complain about an invalid template
26767 parameter, issue an error message here. */
26769 {
26773 }
26774 else
26775 {
26776 /* Parse the template parameters. */
26778 }
26780 /* Look for the `>'. */
26783 /* Manage template requirements */
26785 {
26790 }
26793 member_p);
26795 /* For the erroneous case of a template with C linkage, we pushed an
26796 implicit C++ linkage scope; exit that scope now. */
26799 }
26801 /* Parse a template-declaration, assuming that the `export' (and
26802 `extern') keywords, if present, has already been scanned. MEMBER_P
26803 is as for cp_parser_template_declaration. */
26805 static bool
26807 {
26809 {
26813 }
26818 }
26820 /* Perform the deferred access checks from a template-parameter-list.
26821 CHECKS is a TREE_LIST of access checks, as returned by
26822 get_deferred_access_checks. */
26824 static void
26825 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26826 {
26830 }
26832 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26833 `function-definition' sequence that follows a template header.
26834 If MEMBER_P is true, this declaration appears in a class scope.
26836 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26837 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26839 static tree
26845 {
26848 cp_decl_specifier_seq decl_specifiers;
26852 /* This function is only used when processing a template
26853 declaration. */
26857 /* Defer access checks until we know what is being declared. */
26860 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26861 alternative. */
26864 CP_PARSER_FLAGS_OPTIONAL,
26870 /* There are no template typedefs. */
26872 {
26876 }
26878 /* Gather up the access checks that occurred the
26879 decl-specifier-seq. */
26882 /* Check for the declaration of a template class. */
26884 {
26887 {
26888 // If this is a declaration, but not a definition, associate
26889 // any constraints with the type declaration. Constraints
26890 // are associated with definitions in cp_parser_class_specifier.
26896 /* In this case:
26898 struct C {
26899 friend template <typename T> struct A<T>::B;
26900 };
26902 A<T>::B will be represented by a TYPENAME_TYPE, and
26903 therefore not recognized by shadow_tag. */
26905 && !decl
26912 else
26915 /* Perform access checks for template parameters. */
26918 /* Give a helpful diagnostic for
26919 template <class T> struct A { } a;
26920 if we aren't already recovering from an error. */
26923 {
26925 "a class template declaration must not declare "
26929 }
26930 }
26931 }
26933 /* Complain about missing 'typename' or other invalid type names. */
26936 {
26937 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26938 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26939 the rest of this declaration. */
26942 }
26944 /* If it's not a template class, try for a template function. If
26945 the next token is a `;', then this declaration does not declare
26946 anything. But, if there were errors in the decl-specifiers, then
26947 the error might well have come from an attempted class-specifier.
26948 In that case, there's no need to warn about a missing declarator. */
26952 {
26955 checks,
26957 member_p,
26958 declares_class_or_enum,
26962 /* 7.1.1-1 [dcl.stc]
26964 A storage-class-specifier shall not be specified in an explicit
26965 specialization... */
26967 && explicit_specialization_p
26969 {
26973 }
26977 }
26979 /* Look for a trailing `;' after the declaration. */
26985 out:
26988 /* Clear any current qualification; whatever comes next is the start
26989 of something new. */
26995 }
26997 /* Parse a cast-expression that is not the operand of a unary "&". */
26999 static cp_expr
27001 {
27004 }
27006 /* Parse a functional cast to TYPE. Returns an expression
27007 representing the cast. */
27009 static cp_expr
27011 {
27013 tree expression_list;
27014 cp_expr cast;
27023 {
27033 /* Create a location of the form:
27034 type_name{i, f}
27035 ^~~~~~~~~~~~~~~
27036 with caret == start at the start of the type name,
27037 finishing at the closing brace. */
27038 location_t finish_loc
27041 finish_loc);
27044 }
27053 else
27054 {
27057 }
27060 tf_warning_or_error);
27061 /* [expr.const]/1: In an integral constant expression "only type
27062 conversions to integral or enumeration type can be used". */
27068 NIC_CONSTRUCTOR))
27071 /* Create a location of the form:
27072 float(i)
27073 ^~~~~~~~
27074 with caret == start at the start of the type name,
27075 finishing at the closing paren. */
27076 location_t finish_loc
27081 }
27083 /* Save the tokens that make up the body of a member function defined
27084 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27085 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27086 specifiers applied to the declaration. Returns the FUNCTION_DECL
27087 for the member function. */
27089 static tree
27093 tree attributes)
27094 {
27097 tree fn;
27100 /* Create the FUNCTION_DECL. */
27104 /* If something went badly wrong, bail out now. */
27106 {
27107 /* If there's a function-body, skip it. */
27112 }
27114 /* Remember it, if there default args to post process. */
27117 /* Save away the tokens that make up the body of the
27118 function. */
27124 RID_TRANSACTION_ATOMIC))
27125 {
27127 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27134 {
27140 }
27141 else
27144 {
27148 }
27149 }
27151 /* Handle function try blocks. */
27153 {
27156 }
27157 /* We can have braced-init-list mem-initializers before the fn body. */
27159 {
27162 {
27163 /* cache_group will stop after an un-nested { } pair, too. */
27167 /* variadic mem-inits have ... after the ')'. */
27170 }
27171 }
27173 /* Handle function try blocks. */
27179 /* Save away the inline definition; we will process it when the
27180 class is complete. */
27184 /* We need to know that this was defined in the class, so that
27185 friend templates are handled correctly. */
27188 /* Add FN to the queue of functions to be parsed later. */
27192 }
27194 /* Save the tokens that make up the in-class initializer for a non-static
27195 data member. Returns a DEFAULT_ARG. */
27197 static tree
27199 {
27201 }
27203 /* Parse a template-argument-list, as well as the trailing ">" (but
27204 not the opening "<"). See cp_parser_template_argument_list for the
27205 return value. */
27207 static tree
27209 {
27210 tree arguments;
27211 tree saved_scope;
27212 tree saved_qualifying_scope;
27213 tree saved_object_scope;
27218 /* [temp.names]
27220 When parsing a template-id, the first non-nested `>' is taken as
27221 the end of the template-argument-list rather than a greater-than
27222 operator. */
27223 saved_greater_than_is_operator_p
27226 /* Parsing the argument list may modify SCOPE, so we save it
27227 here. */
27231 /* We need to evaluate the template arguments, even though this
27232 template-id may be nested within a "sizeof". */
27237 /* Parse the template-argument-list itself. */
27241 else
27243 /* Look for the `>' that ends the template-argument-list. If we find
27244 a '>>' instead, it's probably just a typo. */
27246 {
27248 {
27249 /* In C++0x, a `>>' in a template argument list or cast
27250 expression is considered to be two separate `>'
27251 tokens. So, change the current token to a `>', but don't
27252 consume it: it will be consumed later when the outer
27253 template argument list (or cast expression) is parsed.
27254 Note that this replacement of `>' for `>>' is necessary
27255 even if we are parsing tentatively: in the tentative
27256 case, after calling
27257 cp_parser_enclosed_template_argument_list we will always
27258 throw away all of the template arguments and the first
27259 closing `>', either because the template argument list
27260 was erroneous or because we are replacing those tokens
27261 with a CPP_TEMPLATE_ID token. The second `>' (which will
27262 not have been thrown away) is needed either to close an
27263 outer template argument list or to complete a new-style
27264 cast. */
27267 }
27269 {
27270 /* If we're in a nested template argument list, the '>>' has
27271 to be a typo for '> >'. We emit the error message, but we
27272 continue parsing and we push a '>' as next token, so that
27273 the argument list will be parsed correctly. Note that the
27274 global source location is still on the token before the
27275 '>>', so we need to say explicitly where we want it. */
27283 }
27284 else
27285 {
27286 /* If this is not a nested template argument list, the '>>'
27287 is a typo for '>'. Emit an error message and continue.
27288 Same deal about the token location, but here we can get it
27289 right by consuming the '>>' before issuing the diagnostic. */
27292 "spurious %<>>%>, use %<>%> to terminate "
27294 }
27295 }
27296 else
27298 /* The `>' token might be a greater-than operator again now. */
27299 parser->greater_than_is_operator_p
27301 /* Restore the SAVED_SCOPE. */
27309 }
27311 /* MEMBER_FUNCTION is a member function, or a friend. If default
27312 arguments, or the body of the function have not yet been parsed,
27313 parse them now. */
27315 static void
27317 {
27319 /* If this member is a template, get the underlying
27320 FUNCTION_DECL. */
27324 /* There should not be any class definitions in progress at this
27325 point; the bodies of members are only parsed outside of all class
27326 definitions. */
27328 /* While we're parsing the member functions we might encounter more
27329 classes. We want to handle them right away, but we don't want
27330 them getting mixed up with functions that are currently in the
27331 queue. */
27334 /* Make sure that any template parameters are in scope. */
27337 /* If the body of the function has not yet been parsed, parse it
27338 now. */
27340 {
27341 tree function_scope;
27344 /* The function is no longer pending; we are processing it. */
27349 /* If this is a local class, enter the scope of the containing
27350 function. */
27355 /* Push the body of the function onto the lexer stack. */
27358 /* Let the front end know that we going to be defining this
27359 function. */
27363 /* Don't do access checking if it is a templated function. */
27367 /* #pragma omp declare reduction needs special parsing. */
27369 {
27374 }
27375 else
27376 /* Now, parse the body of the function. */
27383 /* Leave the scope of the containing function. */
27387 }
27389 /* Remove any template parameters from the symbol table. */
27392 /* Restore the queue. */
27395 }
27397 /* If DECL contains any default args, remember it on the unparsed
27398 functions queue. */
27400 static void
27402 {
27403 tree probe;
27406 probe;
27409 {
27413 }
27414 }
27416 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27417 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27418 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27419 from the parameter-type-list. */
27421 static tree
27424 {
27426 tree parsed_arg;
27432 /* Push the saved tokens for the default argument onto the parser's
27433 lexer stack. */
27439 /* Parse the default argument. */
27450 {
27451 /* In a non-template class, check conversions now. In a template,
27452 we'll wait and instantiate these as needed. */
27455 tf_warning_or_error);
27458 else
27460 }
27462 /* If the token stream has not been completely used up, then
27463 there was extra junk after the end of the default
27464 argument. */
27466 {
27469 else
27471 }
27473 /* Revert to the main lexer. */
27477 }
27479 /* FIELD is a non-static data member with an initializer which we saved for
27480 later; parse it now. */
27482 static void
27484 {
27485 tree def;
27492 NULL_TREE);
27498 }
27500 /* FN is a FUNCTION_DECL which may contains a parameter with an
27501 unparsed DEFAULT_ARG. Parse the default args now. This function
27502 assumes that the current scope is the scope in which the default
27503 argument should be processed. */
27505 static void
27507 {
27511 /* While we're parsing the default args, we might (due to the
27512 statement expression extension) encounter more classes. We want
27513 to handle them right away, but we don't want them getting mixed
27514 up with default args that are currently in the queue. */
27517 /* Local variable names (and the `this' keyword) may not appear
27518 in a default argument. */
27529 {
27531 tree parsed_arg;
27533 tree copy;
27540 /* This can happen for a friend declaration for a function
27541 already declared with default arguments. */
27544 parsed_arg
27546 default_arg,
27550 /* Update any instantiations we've already created. */
27554 }
27558 /* Make sure no default arg is missing. */
27561 /* Restore the state of local_variables_forbidden_p. */
27564 /* Restore the queue. */
27566 }
27568 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27570 sizeof ... ( identifier )
27572 where the 'sizeof' token has already been consumed. */
27574 static tree
27576 {
27577 /* Consume the `...'. */
27581 matching_parens parens;
27585 else
27593 /* The name is not qualified. */
27612 }
27614 /* Parse the operand of `sizeof' (or a similar operator). Returns
27615 either a TYPE or an expression, depending on the form of the
27616 input. The KEYWORD indicates which kind of expression we have
27617 encountered. */
27619 static tree
27621 {
27628 /* If it's a `...', then we are computing the length of a parameter
27629 pack. */
27634 /* Types cannot be defined in a `sizeof' expression. Save away the
27635 old message. */
27637 /* And create the new one. */
27643 /* The restrictions on constant-expressions do not apply inside
27644 sizeof expressions. */
27645 saved_integral_constant_expression_p
27647 saved_non_integral_constant_expression_p
27651 /* Do not actually evaluate the expression. */
27654 /* If it's a `(', then we might be looking at the type-id
27655 construction. */
27657 {
27660 /* We can't be sure yet whether we're looking at a type-id or an
27661 expression. */
27664 matching_parens parens;
27667 /* Note: as a GNU Extension, compound literals are considered
27668 postfix-expressions as they are in C99, so they are valid
27669 arguments to sizeof. See comment in cp_parser_cast_expression
27670 for details. */
27673 else
27674 {
27677 /* Look for the type-id. */
27679 /* Look for the closing `)'. */
27682 }
27684 /* If all went well, then we're done. */
27686 {
27687 cp_decl_specifier_seq decl_specs;
27689 /* Build a trivial decl-specifier-seq. */
27693 /* Call grokdeclarator to figure out what type this is. */
27696 TYPENAME,
27699 }
27700 }
27702 /* If the type-id production did not work out, then we must be
27703 looking at the unary-expression production. */
27707 /* Go back to evaluating expressions. */
27711 /* Free the message we created. */
27713 /* And restore the old one. */
27715 parser->integral_constant_expression_p
27717 parser->non_integral_constant_expression_p
27721 }
27723 /* If the current declaration has no declarator, return true. */
27725 static bool
27727 {
27728 /* If the next token is a `;' or a `,' then there is no
27729 declarator. */
27732 }
27734 /* Update the DECL_SPECS to reflect the storage class indicated by
27735 KEYWORD. */
27737 static void
27742 {
27743 cp_storage_class storage_class;
27746 {
27750 }
27752 {
27755 }
27760 {
27763 }
27766 {
27784 }
27788 /* A storage class specifier cannot be applied alongside a typedef
27789 specifier. If there is a typedef specifier present then set
27790 conflicting_specifiers_p which will trigger an error later
27791 on in grokdeclarator. */
27794 }
27796 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27797 is true, the type is a class or enum definition. */
27799 static void
27801 tree type_spec,
27804 {
27807 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27808 (with, for example, in "typedef int wchar_t;") we remember that
27809 this is what happened. In system headers, we ignore these
27810 declarations so that G++ can work with system headers that are not
27811 C++-safe. */
27813 && !type_definition_p
27823 {
27826 ds_redefined_builtin_type_spec,
27827 token);
27829 {
27833 }
27834 }
27837 else
27838 {
27843 }
27844 }
27846 /* True iff TOKEN is the GNU keyword __thread. */
27848 static bool
27850 {
27853 }
27855 /* Set the location for a declarator specifier and check if it is
27856 duplicated.
27858 DECL_SPECS is the sequence of declarator specifiers onto which to
27859 set the location.
27861 DS is the single declarator specifier to set which location is to
27862 be set onto the existing sequence of declarators.
27864 LOCATION is the location for the declarator specifier to
27865 consider. */
27867 static void
27870 {
27879 {
27883 }
27884 else
27885 {
27887 {
27891 else
27892 {
27895 OPT_Wlong_long,
27897 }
27898 }
27900 {
27905 else
27906 {
27910 }
27911 }
27912 else
27913 {
27929 "__complex"
27930 };
27934 }
27935 }
27936 }
27938 /* Return true iff the declarator specifier DS is present in the
27939 sequence of declarator specifiers DECL_SPECS. */
27941 bool
27943 cp_decl_spec ds)
27944 {
27951 }
27953 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27954 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27956 static bool
27958 {
27960 }
27962 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
27963 RT_CLOSE_PAREN. */
27967 {
27969 {
27977 }
27978 }
27980 /* Issue an error message indicating that TOKEN_DESC was expected.
27981 If KEYWORD is true, it indicated this function is called by
27982 cp_parser_require_keword and the required token can only be
27983 a indicated keyword.
27985 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
27986 within any error as the location of an "opening" token matching
27987 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
27988 RT_CLOSE_PAREN). */
27990 static void
27992 required_token token_desc,
27994 location_t matching_location)
27995 {
28001 {
28070 }
28073 {
28075 {
28153 }
28154 }
28157 {
28158 /* Emulate rest of cp_parser_error. */
28164 /* If matching_location != UNKNOWN_LOCATION, highlight it.
28165 Attempt to consolidate diagnostics by printing it as a
28166 secondary range within the main diagnostic. */
28169 added_matching_location
28176 /* If we weren't able to consolidate matching_location, then
28177 print it as a secondary diagnostic. */
28181 }
28182 }
28185 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28186 issue an error message indicating that TOKEN_DESC was expected.
28188 Returns the token consumed, if the token had the appropriate type.
28189 Otherwise, returns NULL.
28191 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28192 within any error as the location of an "opening" token matching
28193 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28194 RT_CLOSE_PAREN). */
28199 required_token token_desc,
28200 location_t matching_location)
28201 {
28204 else
28205 {
28206 /* Output the MESSAGE -- unless we're parsing tentatively. */
28209 matching_location);
28211 }
28212 }
28214 /* An error message is produced if the next token is not '>'.
28215 All further tokens are skipped until the desired token is
28216 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28218 static void
28220 {
28221 /* Current level of '< ... >'. */
28223 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28226 /* Are we ready, yet? If not, issue error message. */
28230 /* Skip tokens until the desired token is found. */
28232 {
28233 /* Peek at the next token. */
28235 {
28243 /* C++0x views the `>>' operator as two `>' tokens, but
28244 C++98 does not. */
28247 {
28248 /* We've hit a `>>' where the first `>' closes the
28249 template argument list, and the second `>' is
28250 spurious. Just consume the `>>' and stop; we've
28251 already produced at least one error. */
28254 }
28255 /* Fall through for C++0x, so we handle the second `>' in
28256 the `>>'. */
28261 {
28262 /* We've reached the token we want, consume it and stop. */
28265 }
28284 /* The '>' was probably forgotten, don't look further. */
28289 }
28291 /* Consume this token. */
28293 }
28294 }
28296 /* If the next token is the indicated keyword, consume it. Otherwise,
28297 issue an error message indicating that TOKEN_DESC was expected.
28299 Returns the token consumed, if the token had the appropriate type.
28300 Otherwise, returns NULL. */
28305 required_token token_desc)
28306 {
28310 {
28312 UNKNOWN_LOCATION);
28314 }
28317 }
28319 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28320 function-definition. */
28322 static bool
28324 {
28327 /* A ctor-initializer begins with a `:'. */
28329 /* A function-try-block begins with `try'. */
28331 /* A function-transaction-block begins with `__transaction_atomic'
28332 or `__transaction_relaxed'. */
28335 /* The named return value extension begins with `return'. */
28337 }
28339 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28340 definition. */
28342 static bool
28344 {
28351 }
28353 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28354 C++0x) ending a template-argument. */
28356 static bool
28358 {
28366 }
28368 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28369 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28371 static bool
28374 {
28380 /* Check for the sequence `<::' in the original code. It would be lexed as
28381 `[:', where `[' is a digraph, and there is no whitespace before
28382 `:'. */
28384 {
28389 }
28391 }
28393 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28394 or none_type otherwise. */
28396 static enum tag_types
28398 {
28400 {
28410 }
28411 }
28413 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28414 or none_type otherwise or if the token is null. */
28416 static enum tag_types
28418 {
28423 {
28431 }
28432 }
28434 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28436 static void
28438 {
28442 {
28446 type))
28449 }
28450 }
28452 /* Issue an error message if DECL is redeclared with different
28453 access than its original declaration [class.access.spec/3].
28454 This applies to nested classes, nested class templates and
28455 enumerations [class.mem/1]. */
28457 static void
28459 {
28470 }
28472 /* Look for the `template' keyword, as a syntactic disambiguator.
28473 Return TRUE iff it is present, in which case it will be
28474 consumed. */
28476 static bool
28478 {
28480 {
28481 /* In C++98 the `template' keyword can only be used within templates;
28482 outside templates the parser can always figure out what is a
28483 template and what is not. In C++11, per the resolution of DR 468,
28484 `template' is allowed in cases where it is not strictly necessary. */
28487 {
28490 "in C++98 %<template%> (as a disambiguator) is only "
28492 /* If this part of the token stream is rescanned, the same
28493 error message would be generated. So, we purge the token
28494 from the stream. */
28497 }
28498 else
28499 {
28500 /* Consume the `template' keyword. */
28503 }
28504 }
28506 }
28508 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28509 set PARSER->SCOPE, and perform other related actions. */
28511 static void
28513 {
28516 /* Get the stored value. */
28518 /* Set the scope from the stored value. */
28522 }
28524 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28525 encounter the end of a block before what we were looking for. */
28527 static bool
28531 {
28533 {
28536 /* Abort a parenthesized expression if we encounter a semicolon. */
28540 /* If we've reached the end of the file, stop. */
28546 /* We've hit the end of an enclosing block, so there's been some
28547 kind of syntax error. */
28550 /* Consume the token. */
28552 /* See if it starts a new group. */
28554 {
28556 /* In theory this should probably check end == '}', but
28557 cp_parser_save_member_function_body needs it to exit
28558 after either '}' or ')' when called with ')'. */
28561 }
28563 {
28567 }
28572 }
28573 }
28575 /* Like above, for caching a default argument or NSDMI. Both of these are
28576 terminated by a non-nested comma, but it can be unclear whether or not a
28577 comma is nested in a template argument list unless we do more parsing.
28578 In order to handle this ambiguity, when we encounter a ',' after a '<'
28579 we try to parse what follows as a parameter-declaration-list (in the
28580 case of a default argument) or a member-declarator (in the case of an
28581 NSDMI). If that succeeds, then we stop caching. */
28583 static tree
28585 {
28590 tree default_argument;
28592 /* Add tokens until we have processed the entire default
28593 argument. We add the range [first_token, token). */
28596 {
28597 /* For list-initialization, this is straightforward. */
28600 }
28602 {
28605 /* Peek at the next token. */
28607 /* What we do depends on what token we have. */
28609 {
28610 /* In valid code, a default argument must be
28611 immediately followed by a `,' `)', or `...'. */
28614 {
28615 /* If we've seen a '<', we might be in a
28616 template-argument-list. Until Core issue 325 is
28617 resolved, we don't know how this situation ought
28618 to be handled, so try to DTRT. We check whether
28619 what comes after the comma is a valid parameter
28620 declaration list. If it is, then the comma ends
28621 the default argument; otherwise the default
28622 argument continues. */
28626 /* Set ITALP so cp_parser_parameter_declaration_list
28627 doesn't decide to commit to this parse. */
28634 {
28635 /* Parse declarators until we reach a non-comma or
28636 somthing that cannot be an initializer.
28637 Just checking whether we're looking at a single
28638 declarator is insufficient. Consider:
28639 int var = tuple<T,U>::x;
28640 The template parameter 'U' looks exactly like a
28641 declarator. */
28642 do
28643 {
28654 }
28656 /* If we met an '=' or ';' then the original comma
28657 was the end of the NSDMI. Otherwise assume
28658 we're still in the NSDMI. */
28661 }
28662 else
28663 {
28668 }
28675 }
28676 /* FALLTHRU */
28679 /* If we run into a non-nested `;', `}', or `]',
28680 then the code is invalid -- but the default
28681 argument is certainly over. */
28686 /* Handle correctly int n = sizeof ... ( p ); */
28689 /* Update DEPTH, if necessary. */
28704 /* This might be the comparison operator, or it might
28705 start a template argument list. */
28712 /* Fall through for C++0x, which treats the `>>'
28713 operator like two `>' tokens in certain
28714 cases. */
28719 {
28720 /* This might be an operator, or it might close a
28721 template argument list. But if a previous '<'
28722 started a template argument list, this will have
28723 closed it, so we can't be in one anymore. */
28727 }
28730 /* If we run out of tokens, issue an error message. */
28738 /* In these cases, we should look for template-ids.
28739 For example, if the default argument is
28740 `X<int, double>()', we need to do name lookup to
28741 figure out whether or not `X' is a template; if
28742 so, the `,' does not end the default argument.
28744 That is not yet done. */
28749 }
28751 /* If we've reached the end, stop. */
28755 /* Add the token to the token block. */
28757 }
28759 /* Create a DEFAULT_ARG to represent the unparsed default
28760 argument. */
28767 }
28769 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28771 location_t
28773 {
28778 }
28780 /* Begin parsing tentatively. We always save tokens while parsing
28781 tentatively so that if the tentative parsing fails we can restore the
28782 tokens. */
28784 static void
28786 {
28787 /* Enter a new parsing context. */
28789 /* Begin saving tokens. */
28791 /* In order to avoid repetitive access control error messages,
28792 access checks are queued up until we are no longer parsing
28793 tentatively. */
28795 }
28797 /* Commit to the currently active tentative parse. */
28799 static void
28801 {
28805 /* Mark all of the levels as committed. */
28808 {
28815 }
28816 }
28818 /* Commit to the topmost currently active tentative parse.
28820 Note that this function shouldn't be called when there are
28821 irreversible side-effects while in a tentative state. For
28822 example, we shouldn't create a permanent entry in the symbol
28823 table, or issue an error message that might not apply if the
28824 tentative parse is aborted. */
28826 static void
28828 {
28833 {
28841 }
28842 }
28844 /* Abort the currently active tentative parse. All consumed tokens
28845 will be rolled back, and no diagnostics will be issued. */
28847 static void
28849 {
28853 /* Now, pretend that we want to see if the construct was
28854 successfully parsed. */
28856 }
28858 /* Stop parsing tentatively. If a parse error has occurred, restore the
28859 token stream. Otherwise, commit to the tokens we have consumed.
28860 Returns true if no error occurred; false otherwise. */
28862 static bool
28864 {
28868 /* Remember whether or not an error occurred, since we are about to
28869 destroy that information. */
28871 /* Remove the topmost context from the stack. */
28874 /* If no parse errors occurred, commit to the tentative parse. */
28876 {
28877 /* Commit to the tokens read tentatively, unless that was
28878 already done. */
28883 }
28884 /* Otherwise, if errors occurred, roll back our state so that things
28885 are just as they were before we began the tentative parse. */
28886 else
28887 {
28890 }
28891 /* Add the context to the front of the free list. */
28896 }
28898 /* Returns true if we are parsing tentatively and are not committed to
28899 this tentative parse. */
28901 static bool
28903 {
28906 }
28908 /* Returns nonzero iff an error has occurred during the most recent
28909 tentative parse. */
28911 static bool
28913 {
28916 }
28918 /* Returns nonzero if GNU extensions are allowed. */
28920 static bool
28922 {
28924 }
28925 \f
28926 /* Objective-C++ Productions */
28929 /* Parse an Objective-C expression, which feeds into a primary-expression
28930 above.
28932 objc-expression:
28933 objc-message-expression
28934 objc-string-literal
28935 objc-encode-expression
28936 objc-protocol-expression
28937 objc-selector-expression
28939 Returns a tree representation of the expression. */
28941 static cp_expr
28943 {
28944 /* Try to figure out what kind of declaration is present. */
28948 {
28958 {
28970 }
28976 }
28979 }
28981 /* Parse an Objective-C message expression.
28983 objc-message-expression:
28984 [ objc-message-receiver objc-message-args ]
28986 Returns a representation of an Objective-C message. */
28988 static tree
28990 {
29002 /* Construct a location e.g.
29003 [self func1:5]
29004 ^~~~~~~~~~~~~~
29005 ranging from the '[' to the ']', with the caret at the start. */
29010 }
29012 /* Parse an objc-message-receiver.
29014 objc-message-receiver:
29015 expression
29016 simple-type-specifier
29018 Returns a representation of the type or expression. */
29020 static tree
29022 {
29023 tree rcv;
29025 /* An Objective-C message receiver may be either (1) a type
29026 or (2) an expression. */
29030 /* If that worked out, fine. */
29037 CP_PARSER_FLAGS_NONE);
29044 }
29046 /* Parse the arguments and selectors comprising an Objective-C message.
29048 objc-message-args:
29049 objc-selector
29050 objc-selector-args
29051 objc-selector-args , objc-comma-args
29053 objc-selector-args:
29054 objc-selector [opt] : assignment-expression
29055 objc-selector-args objc-selector [opt] : assignment-expression
29057 objc-comma-args:
29058 assignment-expression
29059 objc-comma-args , assignment-expression
29061 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29062 selector arguments and TREE_VALUE containing a list of comma
29063 arguments. */
29065 static tree
29067 {
29073 {
29079 /* Detect if we have a unary selector. */
29088 sel_args
29093 }
29095 /* Handle non-selector arguments, if any. */
29097 {
29098 tree arg;
29103 addl_args
29108 }
29111 {
29114 }
29117 }
29119 /* Parse an Objective-C encode expression.
29121 objc-encode-expression:
29122 @encode objc-typename
29124 Returns an encoded representation of the type argument. */
29126 static cp_expr
29128 {
29129 tree type;
29134 matching_parens parens;
29141 {
29145 }
29147 /* This happens if we find @encode(T) (where T is a template
29148 typename or something dependent on a template typename) when
29149 parsing a template. In that case, we can't compile it
29150 immediately, but we rather create an AT_ENCODE_EXPR which will
29151 need to be instantiated when the template is used.
29152 */
29154 {
29158 }
29161 /* Build a location of the form:
29162 @encode(int)
29163 ^~~~~~~~~~~~
29164 with caret==start at the @ token, finishing at the close paren. */
29165 location_t combined_loc
29170 }
29172 /* Parse an Objective-C @defs expression. */
29174 static tree
29176 {
29177 tree name;
29180 matching_parens parens;
29186 }
29188 /* Parse an Objective-C protocol expression.
29190 objc-protocol-expression:
29191 @protocol ( identifier )
29193 Returns a representation of the protocol expression. */
29195 static tree
29197 {
29198 tree proto;
29202 matching_parens parens;
29207 /* Build a location of the form:
29208 @protocol(prot)
29209 ^~~~~~~~~~~~~~~
29210 with caret==start at the @ token, finishing at the close paren. */
29211 location_t combined_loc
29217 }
29219 /* Parse an Objective-C selector expression.
29221 objc-selector-expression:
29222 @selector ( objc-method-signature )
29224 objc-method-signature:
29225 objc-selector
29226 objc-selector-seq
29228 objc-selector-seq:
29229 objc-selector :
29230 objc-selector-seq objc-selector :
29232 Returns a representation of the method selector. */
29234 static tree
29236 {
29243 matching_parens parens;
29249 {
29258 {
29259 /* Detect if we have a unary selector. */
29261 {
29264 }
29265 else
29266 {
29268 }
29269 }
29274 {
29275 sel_seq
29278 sel_seq
29281 }
29282 else
29283 sel_seq
29288 }
29290 finish_selector:
29294 /* Build a location of the form:
29295 @selector(func)
29296 ^~~~~~~~~~~~~~~
29297 with caret==start at the @ token, finishing at the close paren. */
29298 location_t combined_loc
29302 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29305 }
29307 /* Parse a list of identifiers.
29309 objc-identifier-list:
29310 identifier
29311 objc-identifier-list , identifier
29313 Returns a TREE_LIST of identifier nodes. */
29315 static tree
29317 {
29318 tree identifier;
29319 tree list;
29330 {
29337 identifier));
29339 }
29342 }
29344 /* Parse an Objective-C alias declaration.
29346 objc-alias-declaration:
29347 @compatibility_alias identifier identifier ;
29349 This function registers the alias mapping with the Objective-C front end.
29350 It returns nothing. */
29352 static void
29354 {
29362 }
29364 /* Parse an Objective-C class forward-declaration.
29366 objc-class-declaration:
29367 @class objc-identifier-list ;
29369 The function registers the forward declarations with the Objective-C
29370 front end. It returns nothing. */
29372 static void
29374 {
29377 {
29378 tree id;
29388 else
29390 }
29392 }
29394 /* Parse a list of Objective-C protocol references.
29396 objc-protocol-refs-opt:
29397 objc-protocol-refs [opt]
29399 objc-protocol-refs:
29400 < objc-identifier-list >
29402 Returns a TREE_LIST of identifiers, if any. */
29404 static tree
29406 {
29410 {
29414 }
29417 }
29419 /* Parse a Objective-C visibility specification. */
29421 static void
29423 {
29427 {
29442 }
29444 /* Eat '@private'/'@protected'/'@public'. */
29446 }
29448 /* Parse an Objective-C method type. Return 'true' if it is a class
29449 (+) method, and 'false' if it is an instance (-) method. */
29453 {
29456 else
29458 }
29460 /* Parse an Objective-C protocol qualifier. */
29462 static tree
29464 {
29477 {
29482 }
29485 }
29487 /* Parse an Objective-C typename. */
29489 static tree
29491 {
29495 {
29498 matching_parens parens;
29502 /* An ObjC type name may consist of just protocol qualifiers, in which
29503 case the type shall default to 'id'. */
29505 {
29508 /* If the type could not be parsed, an error has already
29509 been produced. For error recovery, behave as if it had
29510 not been specified, which will use the default type
29511 'id'. */
29513 {
29515 /* We need to skip to the closing parenthesis as
29516 cp_parser_type_id() does not seem to do it for
29517 us. */
29522 }
29523 }
29527 }
29530 }
29532 /* Check to see if TYPE refers to an Objective-C selector name. */
29534 static bool
29536 {
29542 }
29544 /* Parse an Objective-C selector. */
29546 static tree
29548 {
29552 {
29555 }
29557 /* C++ operator names are allowed to appear in ObjC selectors. */
29559 {
29572 }
29573 }
29575 /* Parse an Objective-C params list. */
29577 static tree
29579 {
29585 {
29595 /* Detect if we have a unary selector. */
29598 {
29601 }
29605 {
29606 /* Something went quite wrong. There should be a colon
29607 here, but there is not. Stop parsing parameters. */
29609 }
29611 /* New ObjC allows attributes on parameters too. */
29616 params
29619 type_name,
29620 identifier,
29621 parm_attr));
29624 }
29627 {
29630 }
29632 /* We allow tail attributes for the method. */
29634 {
29642 }
29645 {
29648 }
29650 }
29652 /* Parse the non-keyword Objective-C params. */
29654 static tree
29657 {
29663 {
29665 tree parm;
29671 {
29676 }
29678 /* TODO: parse attributes for tail parameters. */
29687 }
29689 /* We allow tail attributes for the method. */
29691 {
29693 {
29698 }
29699 else
29700 /* We have an error, but parse the attributes, so that we can
29701 carry on. */
29707 }
29710 }
29712 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29714 static void
29716 {
29719 /* If the next token is `extern' and the following token is a string
29720 literal, then we have a linkage specification. */
29722 && cp_parser_is_pure_string_literal
29725 /* Handle #pragma, if any. */
29728 /* Allow stray semicolons. */
29731 /* Mark methods as optional or required, when building protocols. */
29733 {
29736 }
29738 {
29741 }
29744 /* Other stray characters must generate errors. */
29746 {
29750 }
29751 /* Finally, try to parse a block-declaration, or a function-definition. */
29752 else
29754 }
29756 /* Parse a method signature. */
29758 static tree
29760 {
29776 }
29778 static bool
29780 {
29781 tree tattr;
29786 /* If the attributes are followed by a method introducer, this is not allowed.
29787 Dump the attributes and flag the situation. */
29792 /* Otherwise, the attributes introduce some interstitial code, possibly so
29793 rewind to allow that check. */
29796 }
29798 /* Parse an Objective-C method prototype list. */
29800 static void
29802 {
29806 {
29808 {
29813 else
29817 {
29821 }
29824 }
29830 OPT_Wattributes,
29832 else
29833 /* Allow for interspersed non-ObjC++ code. */
29837 }
29841 else
29845 }
29847 /* Parse an Objective-C method definition list. */
29849 static void
29851 {
29855 {
29856 tree meth;
29859 {
29865 else
29870 {
29874 }
29876 NULL_TREE);
29878 /* For historical reasons, we accept an optional semicolon. */
29885 {
29892 }
29893 }
29894 /* The following case will be removed once @synthesize is
29895 completely implemented. */
29906 else
29907 /* Allow for interspersed non-ObjC++ code. */
29911 }
29915 else
29919 }
29921 /* Parse Objective-C ivars. */
29923 static void
29925 {
29936 {
29937 cp_decl_specifier_seq declspecs;
29939 tree prefix_attributes;
29947 CP_PARSER_FLAGS_OPTIONAL,
29951 /* auto, register, static, extern, mutable. */
29953 {
29956 }
29958 /* thread_local. */
29960 {
29963 }
29965 /* typedef. */
29967 {
29970 }
29975 /* Keep going until we hit the `;' at the end of the
29976 declaration. */
29978 {
29983 /* Check for a (possibly unnamed) bitfield declaration. */
29991 {
29992 /* Get the name of the bitfield. */
29995 sfk_none);
29997 eat_colon:
29999 /* Get the width of the bitfield. */
30000 width
30002 }
30003 else
30004 {
30005 /* Parse the declarator. */
30006 declarator
30012 }
30014 /* Look for attributes that apply to the ivar. */
30016 /* Remember which attributes are prefix attributes and
30017 which are not. */
30019 /* Combine the attributes. */
30023 /* Create the bitfield declaration. */
30025 width,
30026 attributes);
30027 else
30032 /* Add the instance variable. */
30036 /* Reset PREFIX_ATTRIBUTES. */
30045 {
30048 }
30050 }
30054 }
30059 /* Do not consume the RID_AT_END, so it will be read again as terminating
30060 the @interface of @implementation. */
30064 /* For historical reasons, we accept an optional semicolon. */
30067 }
30069 /* Parse an Objective-C protocol declaration. */
30071 static void
30073 {
30079 {
30084 }
30086 /* See if we have a forward declaration or a definition. */
30089 /* Try a forward declaration first. */
30091 {
30093 {
30094 tree id;
30104 else
30106 }
30108 }
30110 /* Ok, we got a full-fledged definition (or at least should). */
30111 else
30112 {
30117 }
30118 }
30120 /* Parse an Objective-C superclass or category. */
30122 static void
30127 {
30133 {
30136 }
30138 {
30139 matching_parens parens;
30142 /* If there is no category name, and this is an @interface, we
30143 have a class extension. */
30145 {
30148 }
30149 else
30153 }
30154 }
30156 /* Parse an Objective-C class interface. */
30158 static void
30160 {
30167 {
30168 /* It's hard to recover because even if valid @interface stuff
30169 is to follow, we can't compile it (or validate it) if we
30170 don't even know which class it refers to. Let's assume this
30171 was a stray '@interface' token in the stream and skip it.
30172 */
30174 }
30179 /* We have either a class or a category on our hands. */
30182 else
30183 {
30185 /* Handle instance variable declarations, if any. */
30188 }
30191 }
30193 /* Parse an Objective-C class implementation. */
30195 static void
30197 {
30204 {
30205 /* It's hard to recover because even if valid @implementation
30206 stuff is to follow, we can't compile it (or validate it) if
30207 we don't even know which class it refers to. Let's assume
30208 this was a stray '@implementation' token in the stream and
30209 skip it.
30210 */
30212 }
30216 /* We have either a class or a category on our hands. */
30219 else
30220 {
30222 /* Handle instance variable declarations, if any. */
30225 }
30228 }
30230 /* Consume the @end token and finish off the implementation. */
30232 static void
30234 {
30237 }
30239 /* Parse an Objective-C declaration. */
30241 static void
30243 {
30244 /* Try to figure out what kind of declaration is present. */
30249 {
30265 }
30268 {
30291 }
30292 }
30294 /* Parse an Objective-C try-catch-finally statement.
30296 objc-try-catch-finally-stmt:
30297 @try compound-statement objc-catch-clause-seq [opt]
30298 objc-finally-clause [opt]
30300 objc-catch-clause-seq:
30301 objc-catch-clause objc-catch-clause-seq [opt]
30303 objc-catch-clause:
30304 @catch ( objc-exception-declaration ) compound-statement
30306 objc-finally-clause:
30307 @finally compound-statement
30309 objc-exception-declaration:
30310 parameter-declaration
30311 '...'
30313 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30315 Returns NULL_TREE.
30317 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30318 for C. Keep them in sync. */
30320 static tree
30322 {
30323 location_t location;
30324 tree stmt;
30329 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30330 node, lest it get absorbed into the surrounding block. */
30336 {
30340 matching_parens parens;
30346 {
30347 /* We have "@catch (...)" (where the '...' are literally
30348 what is in the code). Skip the '...'.
30349 parameter_declaration is set to NULL_TREE, and
30350 objc_being_catch_clauses() knows that that means
30351 '...'. */
30354 }
30355 else
30356 {
30357 /* We have "@catch (NSException *exception)" or something
30358 like that. Parse the parameter declaration. */
30362 else
30367 }
30370 else
30371 {
30372 /* If there was no open parenthesis, we are recovering from
30373 an error, and we are trying to figure out what mistake
30374 the user has made. */
30376 /* If there is an immediate closing parenthesis, the user
30377 probably forgot the opening one (ie, they typed "@catch
30378 NSException *e)". Parse the closing parenthesis and keep
30379 going. */
30383 /* If these is no immediate closing parenthesis, the user
30384 probably doesn't know that parenthesis are required at
30385 all (ie, they typed "@catch NSException *e"). So, just
30386 forget about the closing parenthesis and keep going. */
30387 }
30391 }
30393 {
30396 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30397 node, lest it get absorbed into the surrounding block. */
30401 }
30404 }
30406 /* Parse an Objective-C synchronized statement.
30408 objc-synchronized-stmt:
30409 @synchronized ( expression ) compound-statement
30411 Returns NULL_TREE. */
30413 static tree
30415 {
30416 location_t location;
30423 matching_parens parens;
30428 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30429 node, lest it get absorbed into the surrounding block. */
30434 }
30436 /* Parse an Objective-C throw statement.
30438 objc-throw-stmt:
30439 @throw assignment-expression [opt] ;
30441 Returns a constructed '@throw' statement. */
30443 static tree
30445 {
30457 }
30459 /* Parse an Objective-C statement. */
30461 static tree
30463 {
30464 /* Try to figure out what kind of declaration is present. */
30468 {
30479 }
30482 }
30484 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30485 look ahead to see if an objc keyword follows the attributes. This
30486 is to detect the use of prefix attributes on ObjC @interface and
30487 @protocol. */
30489 static bool
30491 {
30496 {
30499 }
30502 }
30504 /* This routine is a minimal replacement for
30505 c_parser_struct_declaration () used when parsing the list of
30506 types/names or ObjC++ properties. For example, when parsing the
30507 code
30509 @property (readonly) int a, b, c;
30511 this function is responsible for parsing "int a, int b, int c" and
30512 returning the declarations as CHAIN of DECLs.
30514 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30515 similar parsing. */
30516 static tree
30518 {
30520 cp_decl_specifier_seq declspecs;
30522 tree prefix_attributes;
30525 CP_PARSER_FLAGS_NONE,
30532 /* auto, register, static, extern, mutable. */
30534 {
30537 }
30539 /* thread_local. */
30541 {
30544 }
30546 /* typedef. */
30548 {
30551 }
30556 /* Keep going until we hit the `;' at the end of the declaration. */
30558 {
30563 /* Parse the declarator. */
30567 /* Look for attributes that apply to the ivar. */
30569 /* Remember which attributes are prefix attributes and
30570 which are not. */
30572 /* Combine the attributes. */
30582 /* Reset PREFIX_ATTRIBUTES. */
30593 {
30596 }
30597 else
30599 }
30601 }
30603 /* Parse an Objective-C @property declaration. The syntax is:
30605 objc-property-declaration:
30606 '@property' objc-property-attributes[opt] struct-declaration ;
30608 objc-property-attributes:
30609 '(' objc-property-attribute-list ')'
30611 objc-property-attribute-list:
30612 objc-property-attribute
30613 objc-property-attribute-list, objc-property-attribute
30615 objc-property-attribute
30616 'getter' = identifier
30617 'setter' = identifier
30618 'readonly'
30619 'readwrite'
30620 'assign'
30621 'retain'
30622 'copy'
30623 'nonatomic'
30625 For example:
30626 @property NSString *name;
30627 @property (readonly) id object;
30628 @property (retain, nonatomic, getter=getTheName) id name;
30629 @property int a, b, c;
30631 PS: This function is identical to
30632 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30633 static void
30635 {
30636 /* The following variables hold the attributes of the properties as
30637 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30638 seen. When we see an attribute, we set them to 'true' (if they
30639 are boolean properties) or to the identifier (if they have an
30640 argument, ie, for getter and setter). Note that here we only
30641 parse the list of attributes, check the syntax and accumulate the
30642 attributes that we find. objc_add_property_declaration() will
30643 then process the information. */
30653 /* 'properties' is the list of properties that we read. Usually a
30654 single one, but maybe more (eg, in "@property int a, b, c;" there
30655 are three). */
30656 tree properties;
30657 location_t loc;
30663 /* Parse the optional attribute list... */
30665 {
30666 /* Eat the '('. */
30667 matching_parens parens;
30671 {
30677 {
30680 }
30684 {
30695 {
30699 else
30704 }
30707 {
30711 }
30713 {
30715 {
30718 }
30719 else
30723 else
30725 }
30726 else
30727 {
30729 {
30732 }
30733 else
30735 }
30741 }
30748 else
30750 }
30752 /* FIXME: "@property (setter, assign);" will generate a spurious
30753 "error: expected ‘)’ before ‘,’ token". This is because
30754 cp_parser_require, unlike the C counterpart, will produce an
30755 error even if we are in error recovery. */
30757 {
30762 }
30763 }
30765 /* ... and the property declaration(s). */
30769 {
30771 /* If the next token is now a `;', consume it. */
30775 }
30779 else
30780 {
30781 /* Comma-separated properties are chained together in
30782 reverse order; add them one by one. */
30791 }
30794 }
30796 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30798 objc-synthesize-declaration:
30799 @synthesize objc-synthesize-identifier-list ;
30801 objc-synthesize-identifier-list:
30802 objc-synthesize-identifier
30803 objc-synthesize-identifier-list, objc-synthesize-identifier
30805 objc-synthesize-identifier
30806 identifier
30807 identifier = identifier
30809 For example:
30810 @synthesize MyProperty;
30811 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30813 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30814 for C. Keep them in sync.
30815 */
30816 static void
30818 {
30820 location_t loc;
30825 {
30829 {
30832 }
30834 {
30838 {
30841 }
30842 }
30843 else
30848 else
30850 }
30853 }
30855 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30857 objc-dynamic-declaration:
30858 @dynamic identifier-list ;
30860 For example:
30861 @dynamic MyProperty;
30862 @dynamic MyProperty, AnotherProperty;
30864 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30865 for C. Keep them in sync.
30866 */
30867 static void
30869 {
30871 location_t loc;
30876 {
30877 tree property;
30880 {
30883 }
30887 else
30889 }
30892 }
30894 \f
30895 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30897 /* Returns name of the next clause.
30898 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30899 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30900 returned and the token is consumed. */
30902 static pragma_omp_clause
30904 {
30920 {
30925 {
31108 }
31109 }
31115 }
31117 /* Validate that a clause of the given type does not already exist. */
31119 static void
31122 {
31123 tree c;
31127 {
31130 }
31131 }
31133 /* OpenMP 2.5:
31134 variable-list:
31135 identifier
31136 variable-list , identifier
31138 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31139 colon). An opening parenthesis will have been consumed by the caller.
31141 If KIND is nonzero, create the appropriate node and install the decl
31142 in OMP_CLAUSE_DECL and add the node to the head of the list.
31144 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31145 return the list created.
31147 COLON can be NULL if only closing parenthesis should end the list,
31148 or pointer to bool which will receive false if the list is terminated
31149 by closing parenthesis or true if the list is terminated by colon. */
31151 static tree
31154 {
31158 {
31161 }
31163 {
31168 && current_class_ptr
31170 {
31176 }
31177 else
31178 {
31191 }
31193 ;
31195 {
31197 {
31199 /* The OpenACC cache directive explicitly only allows "array
31200 elements or subarrays". */
31202 {
31206 }
31207 /* FALLTHROUGH. */
31212 {
31213 location_t loc
31218 decl
31222 }
31223 /* FALLTHROUGH. */
31227 {
31235 parser->colon_corrects_to_scope_p
31239 else
31240 {
31241 /* Look for `:'. */
31245 CPP_CLOSE_SQUARE))
31247 }
31248 /* Look for the closing `]'. */
31250 RT_CLOSE_SQUARE))
31254 }
31258 }
31264 }
31265 else
31268 get_comma:
31272 }
31278 {
31282 }
31285 {
31288 /* Try to resync to an unnested comma. Copied from
31289 cp_parser_parenthesized_expression_list. */
31290 skip_comma:
31299 }
31302 }
31304 /* Similarly, but expect leading and trailing parenthesis. This is a very
31305 common case for omp clauses. */
31307 static tree
31309 {
31313 }
31315 /* OpenACC 2.0:
31316 copy ( variable-list )
31317 copyin ( variable-list )
31318 copyout ( variable-list )
31319 create ( variable-list )
31320 delete ( variable-list )
31321 present ( variable-list )
31322 present_or_copy ( variable-list )
31323 pcopy ( variable-list )
31324 present_or_copyin ( variable-list )
31325 pcopyin ( variable-list )
31326 present_or_copyout ( variable-list )
31327 pcopyout ( variable-list )
31328 present_or_create ( variable-list )
31329 pcreate ( variable-list ) */
31331 static tree
31333 tree list)
31334 {
31337 {
31383 }
31391 }
31393 /* OpenACC 2.0:
31394 deviceptr ( variable-list ) */
31396 static tree
31398 {
31402 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31403 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31404 variable-list must only allow for pointer variables. */
31407 {
31414 }
31417 }
31419 /* OpenACC 2.0:
31420 auto
31421 independent
31422 nohost
31423 seq */
31425 static tree
31429 {
31434 }
31436 /* OpenACC:
31437 num_gangs ( expression )
31438 num_workers ( expression )
31439 vector_length ( expression ) */
31441 static tree
31444 {
31447 matching_parens parens;
31455 {
31460 }
31468 }
31470 /* OpenACC:
31472 gang [( gang-arg-list )]
31473 worker [( [num:] int-expr )]
31474 vector [( [length:] int-expr )]
31476 where gang-arg is one of:
31478 [num:] int-expr
31479 static: size-expr
31481 and size-expr may be:
31483 *
31484 int-expr
31485 */
31487 static tree
31490 {
31500 {
31501 matching_parens parens;
31504 do
31505 {
31509 /* Gang static argument. */
31512 {
31520 {
31523 }
31525 /* Check for the '*' argument. */
31529 CPP_CLOSE_PAREN)))
31530 {
31535 {
31538 }
31540 }
31541 }
31542 /* Worker num: argument and vector length: arguments. */
31546 {
31549 }
31551 /* Now collect the actual argument. */
31553 {
31556 }
31568 {
31571 }
31573 }
31578 }
31592 cleanup_error:
31595 }
31597 /* OpenACC 2.0:
31598 tile ( size-expr-list ) */
31600 static tree
31602 {
31606 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31607 so, but the spec authors never considered such a case and have
31608 differing opinions on what it might mean, including 'not
31609 allowed'.) */
31612 clause_loc);
31617 do
31618 {
31625 {
31628 }
31629 else
31633 }
31636 /* Consume the trailing ')'. */
31644 }
31646 /* OpenACC 2.0
31647 Parse wait clause or directive parameters. */
31649 static tree
31651 {
31661 {
31666 }
31673 {
31677 {
31680 else
31681 {
31688 }
31689 }
31690 }
31693 }
31695 /* OpenACC:
31696 wait ( int-expr-list ) */
31698 static tree
31700 {
31709 }
31711 /* OpenMP 3.0:
31712 collapse ( constant-expression ) */
31714 static tree
31716 {
31718 location_t loc;
31719 HOST_WIDE_INT n;
31722 matching_parens parens;
31740 {
31743 }
31752 }
31754 /* OpenMP 2.5:
31755 default ( none | shared )
31757 OpenACC:
31758 default ( none | present ) */
31760 static tree
31763 {
31765 tree c;
31767 matching_parens parens;
31771 {
31776 {
31797 }
31800 }
31801 else
31802 {
31803 invalid_kind:
31806 else
31808 }
31825 }
31827 /* OpenMP 3.1:
31828 final ( expression ) */
31830 static tree
31832 {
31835 matching_parens parens;
31854 }
31856 /* OpenMP 2.5:
31857 if ( expression )
31859 OpenMP 4.5:
31860 if ( directive-name-modifier : expression )
31862 directive-name-modifier:
31863 parallel | task | taskloop | target data | target | target update
31864 | target enter data | target exit data */
31866 static tree
31869 {
31873 matching_parens parens;
31878 {
31890 {
31893 {
31906 else
31907 {
31908 location_t loc
31913 }
31916 {
31918 {
31923 }
31925 {
31926 location_t loc
31930 }
31931 }
31932 }
31933 }
31935 {
31937 {
31940 }
31941 else
31942 {
31944 {
31945 location_t loc
31948 }
31950 }
31951 }
31952 }
31964 {
31967 {
31970 {
31980 }
31982 p);
31984 }
31986 {
31989 else
31992 }
31995 {
31999 }
32000 }
32008 }
32010 /* OpenMP 3.1:
32011 mergeable */
32013 static tree
32016 {
32017 tree c;
32020 location);
32025 }
32027 /* OpenMP 2.5:
32028 nowait */
32030 static tree
32033 {
32034 tree c;
32041 }
32043 /* OpenMP 2.5:
32044 num_threads ( expression ) */
32046 static tree
32048 location_t location)
32049 {
32052 matching_parens parens;
32072 }
32074 /* OpenMP 4.5:
32075 num_tasks ( expression ) */
32077 static tree
32079 location_t location)
32080 {
32083 matching_parens parens;
32103 }
32105 /* OpenMP 4.5:
32106 grainsize ( expression ) */
32108 static tree
32110 location_t location)
32111 {
32114 matching_parens parens;
32134 }
32136 /* OpenMP 4.5:
32137 priority ( expression ) */
32139 static tree
32141 location_t location)
32142 {
32145 matching_parens parens;
32165 }
32167 /* OpenMP 4.5:
32168 hint ( expression ) */
32170 static tree
32172 location_t location)
32173 {
32176 matching_parens parens;
32195 }
32197 /* OpenMP 4.5:
32198 defaultmap ( tofrom : scalar ) */
32200 static tree
32202 location_t location)
32203 {
32207 matching_parens parens;
32212 {
32215 }
32219 {
32222 }
32228 {
32231 }
32235 {
32238 }
32244 location);
32250 out_err:
32255 }
32257 /* OpenMP 2.5:
32258 ordered
32260 OpenMP 4.5:
32261 ordered ( constant-expression ) */
32263 static tree
32266 {
32268 HOST_WIDE_INT n;
32274 {
32275 matching_parens parens;
32292 {
32294 "ordered argument needs positive constant integer "
32297 }
32298 }
32304 }
32306 /* OpenMP 2.5:
32307 reduction ( reduction-operator : variable-list )
32309 reduction-operator:
32310 One of: + * - & ^ | && ||
32312 OpenMP 3.1:
32314 reduction-operator:
32315 One of: + * - & ^ | && || min max
32317 OpenMP 4.0:
32319 reduction-operator:
32320 One of: + * - & ^ | && ||
32321 id-expression */
32323 static tree
32325 {
32333 {
32343 }
32347 else
32348 {
32359 {
32389 }
32390 else
32391 {
32393 resync_fail:
32398 }
32399 }
32405 NULL);
32407 {
32410 }
32413 }
32415 /* OpenMP 2.5:
32416 schedule ( schedule-kind )
32417 schedule ( schedule-kind , expression )
32419 schedule-kind:
32420 static | dynamic | guided | runtime | auto
32422 OpenMP 4.5:
32423 schedule ( schedule-modifier : schedule-kind )
32424 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32426 schedule-modifier:
32427 simd
32428 monotonic
32429 nonmonotonic */
32431 static tree
32433 {
32437 matching_parens parens;
32444 {
32453 else
32459 else
32460 {
32463 }
32464 }
32467 {
32472 {
32493 }
32494 }
32499 else
32505 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32507 {
32511 }
32514 {
32529 else
32534 }
32546 invalid_kind:
32548 resync_fail:
32553 }
32555 /* OpenMP 3.0:
32556 untied */
32558 static tree
32561 {
32562 tree c;
32569 }
32571 /* OpenMP 4.0:
32572 inbranch
32573 notinbranch */
32575 static tree
32578 {
32583 }
32585 /* OpenMP 4.0:
32586 parallel
32587 for
32588 sections
32589 taskgroup */
32591 static tree
32595 {
32599 }
32601 /* OpenMP 4.5:
32602 nogroup */
32604 static tree
32607 {
32612 }
32614 /* OpenMP 4.5:
32615 simd
32616 threads */
32618 static tree
32622 {
32627 }
32629 /* OpenMP 4.0:
32630 num_teams ( expression ) */
32632 static tree
32634 location_t location)
32635 {
32638 matching_parens parens;
32658 }
32660 /* OpenMP 4.0:
32661 thread_limit ( expression ) */
32663 static tree
32665 location_t location)
32666 {
32669 matching_parens parens;
32689 }
32691 /* OpenMP 4.0:
32692 aligned ( variable-list )
32693 aligned ( variable-list : constant-expression ) */
32695 static tree
32697 {
32701 matching_parens parens;
32709 {
32719 }
32725 }
32727 /* OpenMP 4.0:
32728 linear ( variable-list )
32729 linear ( variable-list : expression )
32731 OpenMP 4.5:
32732 linear ( modifier ( variable-list ) )
32733 linear ( modifier ( variable-list ) : expression ) */
32735 static tree
32738 {
32743 matching_parens parens;
32749 {
32761 else
32763 }
32768 else
32769 {
32778 }
32781 {
32786 {
32797 {
32800 }
32803 }
32808 {
32811 }
32819 }
32822 {
32825 }
32828 }
32830 /* OpenMP 4.0:
32831 safelen ( constant-expression ) */
32833 static tree
32835 location_t location)
32836 {
32839 matching_parens parens;
32858 }
32860 /* OpenMP 4.0:
32861 simdlen ( constant-expression ) */
32863 static tree
32865 location_t location)
32866 {
32869 matching_parens parens;
32888 }
32890 /* OpenMP 4.5:
32891 vec:
32892 identifier [+/- integer]
32893 vec , identifier [+/- integer]
32894 */
32896 static tree
32898 tree list)
32899 {
32903 {
32906 }
32909 {
32916 else
32917 {
32918 t = cp_parser_lookup_name_simple
32923 id_loc);
32924 }
32930 {
32933 }
32937 {
32940 }
32944 {
32947 }
32950 add_to_vector:
32952 {
32956 }
32962 }
32965 {
32971 }
32973 }
32975 /* OpenMP 4.0:
32976 depend ( depend-kind : variable-list )
32978 depend-kind:
32979 in | out | inout
32981 OpenMP 4.5:
32982 depend ( source )
32984 depend ( sink : vec ) */
32986 static tree
32988 {
32992 matching_parens parens;
32997 {
33011 else
33013 }
33014 else
33020 {
33030 }
33037 else
33038 {
33044 }
33047 invalid_kind:
33049 resync_fail:
33054 }
33056 /* OpenMP 4.0:
33057 map ( map-kind : variable-list )
33058 map ( variable-list )
33060 map-kind:
33061 alloc | to | from | tofrom
33063 OpenMP 4.5:
33064 map-kind:
33065 alloc | to | from | tofrom | release | delete
33067 map ( always [,] map-kind: variable-list ) */
33069 static tree
33071 {
33080 {
33085 {
33088 nth++;
33094 {
33099 }
33100 }
33101 }
33105 {
33119 else
33120 {
33126 }
33129 }
33132 {
33136 }
33139 NULL);
33145 }
33147 /* OpenMP 4.0:
33148 device ( expression ) */
33150 static tree
33152 location_t location)
33153 {
33156 matching_parens parens;
33176 }
33178 /* OpenMP 4.0:
33179 dist_schedule ( static )
33180 dist_schedule ( static , expression ) */
33182 static tree
33184 location_t location)
33185 {
33188 matching_parens parens;
33199 {
33210 }
33215 location);
33219 invalid_kind:
33221 resync_fail:
33226 }
33228 /* OpenMP 4.0:
33229 proc_bind ( proc-bind-kind )
33231 proc-bind-kind:
33232 master | close | spread */
33234 static tree
33236 location_t location)
33237 {
33238 tree c;
33245 {
33255 else
33257 }
33258 else
33267 location);
33272 invalid_kind:
33274 resync_fail:
33279 }
33281 /* OpenACC:
33282 async [( int-expr )] */
33284 static tree
33286 {
33293 {
33294 matching_parens parens;
33303 }
33313 }
33315 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33316 is a bitmask in MASK. Return the list of clauses found. */
33318 static tree
33322 {
33327 {
33328 location_t here;
33329 pragma_omp_clause c_kind;
33330 omp_clause_code code;
33341 {
33393 clauses);
33411 OMP_CLAUSE_INDEPENDENT,
33423 clauses);
33429 clauses);
33453 clauses);
33475 clauses);
33487 clauses);
33501 }
33506 {
33507 /* Remove the invalid clause(s) from the list to avoid
33508 confusing the rest of the compiler. */
33511 }
33512 }
33514 saw_error:
33521 }
33523 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33524 is a bitmask in MASK. Return the list of clauses found; the result
33525 of clause default goes in *pdefault. */
33527 static tree
33531 {
33537 {
33538 pragma_omp_clause c_kind;
33549 {
33561 clauses);
33575 clauses);
33595 clauses);
33600 clauses);
33610 clauses);
33644 clauses);
33658 clauses);
33675 OMP_CLAUSE_NOTINBRANCH,
33684 {
33685 clause_not_first:
33689 }
33719 clauses);
33720 else
33730 clauses);
33748 {
33756 }
33799 clauses
33805 clauses
33817 }
33822 {
33823 /* Remove the invalid clause(s) from the list to avoid
33824 confusing the rest of the compiler. */
33827 }
33828 }
33829 saw_error:
33830 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33831 no reason to skip to the end. */
33835 {
33838 else
33840 }
33842 }
33844 /* OpenMP 2.5:
33845 structured-block:
33846 statement
33848 In practice, we're also interested in adding the statement to an
33849 outer node. So it is convenient if we work around the fact that
33850 cp_parser_statement calls add_stmt. */
33852 static unsigned
33854 {
33857 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33858 This preserves the "not within loop or switch" style error messages
33859 for nonsense cases like
33860 void foo() {
33861 #pragma omp single
33862 break;
33863 }
33864 */
33869 }
33871 static void
33873 {
33875 }
33877 static tree
33879 {
33887 }
33889 /* OpenMP 2.5:
33890 # pragma omp atomic new-line
33891 expression-stmt
33893 expression-stmt:
33894 x binop= expr | x++ | ++x | x-- | --x
33895 binop:
33896 +, *, -, /, &, ^, |, <<, >>
33898 where x is an lvalue expression with scalar type.
33900 OpenMP 3.1:
33901 # pragma omp atomic new-line
33902 update-stmt
33904 # pragma omp atomic read new-line
33905 read-stmt
33907 # pragma omp atomic write new-line
33908 write-stmt
33910 # pragma omp atomic update new-line
33911 update-stmt
33913 # pragma omp atomic capture new-line
33914 capture-stmt
33916 # pragma omp atomic capture new-line
33917 capture-block
33919 read-stmt:
33920 v = x
33921 write-stmt:
33922 x = expr
33923 update-stmt:
33924 expression-stmt | x = x binop expr
33925 capture-stmt:
33926 v = expression-stmt
33927 capture-block:
33928 { v = x; update-stmt; } | { update-stmt; v = x; }
33930 OpenMP 4.0:
33931 update-stmt:
33932 expression-stmt | x = x binop expr | x = expr binop x
33933 capture-stmt:
33934 v = update-stmt
33935 capture-block:
33936 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33938 where x and v are lvalue expressions with scalar type. */
33940 static void
33942 {
33950 {
33955 {
33961 }
33962 }
33964 {
33976 else
33980 }
33982 {
33988 {
33993 {
33996 }
33997 }
33998 }
34002 {
34012 else
34017 {
34018 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34019 opcode. */
34024 }
34028 {
34031 }
34032 else
34033 {
34039 }
34042 }
34044 restart:
34048 {
34055 /* FALLTHROUGH */
34065 /* FALLTHROUGH */
34080 /* Undo effects of boolean_increment for post {in,de}crement. */
34082 /* FALLTHRU */
34086 {
34087 /* Undo effects of boolean_increment. */
34089 {
34090 /* This is pre or post increment. */
34095 && !structured_block
34099 }
34100 }
34101 /* FALLTHRU */
34104 {
34139 {
34143 }
34146 {
34152 {
34157 }
34159 {
34171 {
34173 {
34178 }
34179 else
34181 }
34185 }
34188 {
34195 }
34199 }
34203 {
34206 {
34214 }
34216 {
34221 }
34256 }
34267 /* FALLTHROUGH */
34272 }
34279 }
34280 stmt_done:
34282 {
34293 }
34295 {
34298 }
34299 done:
34305 saw_error:
34308 {
34312 {
34316 }
34317 }
34318 }
34321 /* OpenMP 2.5:
34322 # pragma omp barrier new-line */
34324 static void
34326 {
34329 }
34331 /* OpenMP 2.5:
34332 # pragma omp critical [(name)] new-line
34333 structured-block
34335 OpenMP 4.5:
34336 # pragma omp critical [(name) [hint(expression)]] new-line
34337 structured-block */
34339 #define OMP_CRITICAL_CLAUSE_MASK \
34340 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34342 static tree
34344 {
34348 {
34349 matching_parens parens;
34363 OMP_CRITICAL_CLAUSE_MASK,
34365 }
34366 else
34371 }
34373 /* OpenMP 2.5:
34374 # pragma omp flush flush-vars[opt] new-line
34376 flush-vars:
34377 ( variable-list ) */
34379 static void
34381 {
34387 }
34389 /* Helper function, to parse omp for increment expression. */
34391 static tree
34393 {
34398 {
34401 }
34404 {
34413 /* Fall through: OpenMP disallows NE_EXPR. */
34417 }
34419 /* If decl is an iterator, preserve LHS and RHS of the relational
34420 expr until finish_omp_for. */
34431 }
34433 /* Helper function, to parse omp for increment expression. */
34435 static tree
34437 {
34441 cp_id_kind idk;
34445 {
34454 }
34463 {
34468 }
34475 {
34479 }
34492 do
34493 {
34500 {
34502 {
34505 else
34507 tf_warning_or_error);
34508 }
34509 else
34512 }
34513 }
34517 {
34523 }
34524 else
34528 }
34530 /* Parse the initialization statement of either an OpenMP for loop or
34531 a Cilk Plus for loop.
34533 Return true if the resulting construct should have an
34534 OMP_CLAUSE_PRIVATE added to it. */
34536 static tree
34545 {
34551 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34553 init-expr:
34554 var = lb
34555 integer-type var = lb
34556 random-access-iterator-type var = lb
34557 pointer-type var = lb
34558 */
34559 cp_decl_specifier_seq type_specifiers;
34561 /* First, try to parse as an initialized declaration. See
34562 cp_parser_condition, from whence the bulk of this is copied. */
34569 {
34570 /* If parsing a type specifier seq succeeded, then this
34571 MUST be a initialized declaration. */
34576 CP_PARSER_DECLARATOR_NAMED,
34587 else
34588 {
34598 {
34600 CPP_OPEN_PAREN))
34601 {
34605 else
34608 }
34609 else
34610 /* Trigger an error. */
34615 }
34619 {
34627 {
34630 auto_node);
34635 }
34638 asm_specification,
34639 LOOKUP_ONLYCONVERTING);
34642 {
34645 }
34646 else
34647 {
34650 {
34652 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34654 {
34658 {
34662 }
34664 }
34666 {
34671 }
34672 }
34673 }
34675 }
34676 else
34677 {
34678 /* Consume '='. */
34682 non_class:
34685 else
34688 asm_specification,
34689 LOOKUP_ONLYCONVERTING);
34690 }
34694 }
34695 }
34696 else
34697 {
34698 cp_id_kind idk;
34699 /* If parsing a type specifier sequence failed, then
34700 this MUST be a simple expression. */
34709 && decl
34712 {
34723 {
34728 }
34733 }
34735 && decl
34738 {
34739 tree rhs;
34747 rhs,
34748 tf_warning_or_error));
34751 }
34752 else
34753 {
34758 {
34762 }
34763 }
34764 }
34766 }
34768 /* Parse the restricted form of the for statement allowed by OpenMP. */
34770 static tree
34773 {
34777 location_t loc_first;
34788 {
34791 }
34794 {
34797 }
34800 {
34806 }
34808 {
34811 {
34813 "%<linear%> clause may not be specified together "
34816 }
34817 else
34819 }
34832 {
34835 location_t loc;
34839 {
34843 }
34846 {
34850 }
34853 matching_parens parens;
34860 add_private_clause
34867 {
34870 {
34876 }
34877 else
34879 }
34886 {
34891 {
34895 }
34898 {
34899 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34903 {
34906 }
34907 else
34908 {
34911 }
34913 }
34914 else
34915 {
34920 }
34921 }
34924 {
34925 tree c;
34927 {
34936 decl);
34940 decl);
34941 }
34943 {
34948 else
34953 {
34956 /* For linear, signal that we need to fill up
34957 the so far unknown linear step. */
34960 }
34961 }
34962 }
34971 {
34972 /* If decl is an iterator, preserve the operator on decl
34973 until finish_omp_for. */
34975 && ((processing_template_decl
34980 else
34984 }
34996 {
34999 }
35004 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35005 in between the collapsed for loops to be still considered perfectly
35006 nested. Hopefully the final version clarifies this.
35007 For now handle (multiple) {'s and empty statements. */
35010 {
35014 {
35016 bracecount++;
35017 }
35021 else
35022 {
35029 }
35030 }
35033 {
35036 }
35037 }
35042 /* Note that we saved the original contents of this flag when we entered
35043 the structured block, and so we don't need to re-save it here. */
35046 else
35049 /* Note that the grammar doesn't call for a structured block here,
35050 though the loop as a whole is a structured block. */
35057 else
35062 {
35064 {
35066 nbraces--;
35067 }
35070 else
35071 {
35073 {
35076 }
35081 }
35082 }
35085 {
35089 else
35091 }
35095 }
35097 /* Helper function for OpenMP parsing, split clauses and call
35098 finish_omp_clauses on each of the set of clauses afterwards. */
35100 static void
35103 {
35109 }
35111 /* OpenMP 4.0:
35112 #pragma omp simd simd-clause[optseq] new-line
35113 for-loop */
35115 #define OMP_SIMD_CLAUSE_MASK \
35116 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35125 static tree
35129 {
35140 {
35144 OMP_CLAUSE_ORDERED);
35146 {
35148 "%<ordered%> clause with parameter may not be specified "
35151 }
35152 }
35163 }
35165 /* OpenMP 2.5:
35166 #pragma omp for for-clause[optseq] new-line
35167 for-loop
35169 OpenMP 4.0:
35170 #pragma omp for simd for-simd-clause[optseq] new-line
35171 for-loop */
35173 #define OMP_FOR_CLAUSE_MASK \
35174 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35184 static tree
35188 {
35195 /* parallel for{, simd} disallows nowait clause, but for
35196 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35199 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35204 {
35209 {
35233 }
35234 }
35236 {
35239 }
35241 /* Composite distribute parallel for disallows linear clause. */
35248 {
35251 }
35262 }
35264 /* OpenMP 2.5:
35265 # pragma omp master new-line
35266 structured-block */
35268 static tree
35270 {
35274 }
35276 /* OpenMP 2.5:
35277 # pragma omp ordered new-line
35278 structured-block
35280 OpenMP 4.5:
35281 # pragma omp ordered ordered-clauses new-line
35282 structured-block */
35284 #define OMP_ORDERED_CLAUSE_MASK \
35285 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35288 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35289 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35291 static bool
35294 {
35298 {
35303 {
35305 {
35308 }
35310 {
35312 "%<depend%> clause may only be used in compound "
35316 }
35317 tree clauses
35319 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35323 }
35324 }
35326 tree clauses
35337 }
35339 /* OpenMP 2.5:
35341 section-scope:
35342 { section-sequence }
35344 section-sequence:
35345 section-directive[opt] structured-block
35346 section-sequence section-directive structured-block */
35348 static tree
35350 {
35355 matching_braces braces;
35363 {
35367 }
35370 {
35378 {
35382 }
35384 {
35387 }
35392 }
35403 }
35405 /* OpenMP 2.5:
35406 # pragma omp sections sections-clause[optseq] newline
35407 sections-scope */
35409 #define OMP_SECTIONS_CLAUSE_MASK \
35410 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35416 static tree
35419 {
35431 {
35434 }
35441 }
35443 /* OpenMP 2.5:
35444 # pragma omp parallel parallel-clause[optseq] new-line
35445 structured-block
35446 # pragma omp parallel for parallel-for-clause[optseq] new-line
35447 structured-block
35448 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35449 structured-block
35451 OpenMP 4.0:
35452 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35453 structured-block */
35455 #define OMP_PARALLEL_CLAUSE_MASK \
35456 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35466 static tree
35470 {
35477 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35483 {
35491 if_p);
35495 if_p);
35498 block);
35503 }
35504 /* When combined with distribute, parallel has to be followed by for.
35505 #pragma omp target parallel is allowed though. */
35509 {
35513 }
35515 {
35518 }
35520 {
35524 {
35534 block);
35537 }
35538 }
35543 {
35546 }
35554 }
35556 /* OpenMP 2.5:
35557 # pragma omp single single-clause[optseq] new-line
35558 structured-block */
35560 #define OMP_SINGLE_CLAUSE_MASK \
35561 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35566 static tree
35568 {
35578 }
35580 /* OpenMP 3.0:
35581 # pragma omp task task-clause[optseq] new-line
35582 structured-block */
35584 #define OMP_TASK_CLAUSE_MASK \
35585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35596 static tree
35598 {
35609 }
35611 /* OpenMP 3.0:
35612 # pragma omp taskwait new-line */
35614 static void
35616 {
35619 }
35621 /* OpenMP 3.1:
35622 # pragma omp taskyield new-line */
35624 static void
35626 {
35629 }
35631 /* OpenMP 4.0:
35632 # pragma omp taskgroup new-line
35633 structured-block */
35635 static tree
35637 {
35641 if_p));
35642 }
35645 /* OpenMP 2.5:
35646 # pragma omp threadprivate (variable-list) */
35648 static void
35650 {
35651 tree vars;
35657 }
35659 /* OpenMP 4.0:
35660 # pragma omp cancel cancel-clause[optseq] new-line */
35662 #define OMP_CANCEL_CLAUSE_MASK \
35663 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35669 static void
35671 {
35675 }
35677 /* OpenMP 4.0:
35678 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35680 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35686 static void
35689 {
35690 tree clauses;
35694 {
35699 {
35702 }
35703 }
35705 {
35709 }
35712 {
35717 else
35721 }
35724 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35726 pragma_tok);
35728 }
35730 /* OpenMP 4.0:
35731 #pragma omp distribute distribute-clause[optseq] new-line
35732 for-loop */
35734 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35735 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35741 static tree
35745 {
35754 {
35762 else
35765 {
35771 {
35775 else
35778 }
35784 else
35798 }
35799 }
35801 {
35804 }
35809 {
35812 }
35823 }
35825 /* OpenMP 4.0:
35826 # pragma omp teams teams-clause[optseq] new-line
35827 structured-block */
35829 #define OMP_TEAMS_CLAUSE_MASK \
35830 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35838 static tree
35842 {
35851 {
35855 {
35880 }
35881 }
35883 {
35886 }
35891 {
35894 }
35903 }
35905 /* OpenMP 4.0:
35906 # pragma omp target data target-data-clause[optseq] new-line
35907 structured-block */
35909 #define OMP_TARGET_DATA_CLAUSE_MASK \
35910 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35915 static tree
35917 {
35918 tree clauses
35923 {
35926 {
35943 "%<#pragma omp target data%> with map-type other "
35944 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35948 }
35950 }
35953 {
35956 "%<#pragma omp target data%> must contain at least "
35959 }
35970 }
35972 /* OpenMP 4.5:
35973 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35974 structured-block */
35976 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35977 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35983 static tree
35986 {
35989 {
35994 {
35997 }
35998 }
36000 {
36004 }
36007 {
36013 }
36015 tree clauses
36020 {
36023 {
36036 "%<#pragma omp target enter data%> with map-type other "
36040 }
36042 }
36045 {
36048 "%<#pragma omp target enter data%> must contain at least "
36051 }
36058 }
36060 /* OpenMP 4.5:
36061 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36062 structured-block */
36064 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36065 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36071 static tree
36074 {
36077 {
36082 {
36085 }
36086 }
36088 {
36092 }
36095 {
36101 }
36103 tree clauses
36108 {
36111 {
36125 "%<#pragma omp target exit data%> with map-type other "
36126 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36130 }
36132 }
36135 {
36138 "%<#pragma omp target exit data%> must contain at least "
36141 }
36148 }
36150 /* OpenMP 4.0:
36151 # pragma omp target update target-update-clause[optseq] new-line */
36153 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36154 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36161 static bool
36164 {
36166 {
36172 }
36174 tree clauses
36179 {
36181 "%<#pragma omp target update%> must contain at least one "
36184 }
36192 }
36194 /* OpenMP 4.0:
36195 # pragma omp target target-clause[optseq] new-line
36196 structured-block */
36198 #define OMP_TARGET_CLAUSE_MASK \
36199 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36209 static bool
36212 {
36216 {
36228 {
36236 {
36237 tree stmt;
36239 {
36242 OMP_TARGET_CLAUSE_MASK,
36247 OMP_TARGET_CLAUSE_MASK,
36252 OMP_TARGET_CLAUSE_MASK,
36257 }
36259 }
36264 {
36268 if_p);
36273 if_p);
36278 if_p);
36282 }
36288 {
36289 /* For combined target teams, ensure the num_teams and
36290 thread_limit clause expressions are evaluated on the host,
36291 before entering the target construct. */
36292 tree c;
36298 {
36307 OMP_CLAUSE_FIRSTPRIVATE);
36312 }
36313 }
36323 }
36325 {
36328 }
36330 {
36334 }
36336 {
36340 }
36342 {
36346 }
36348 {
36351 }
36352 }
36354 {
36357 }
36372 check_clauses:
36374 {
36377 {
36391 "%<#pragma omp target%> with map-type other "
36392 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36396 }
36398 }
36400 }
36402 /* OpenACC 2.0:
36403 # pragma acc cache (variable-list) new-line
36404 */
36406 static tree
36408 {
36423 }
36425 /* OpenACC 2.0:
36426 # pragma acc data oacc-data-clause[optseq] new-line
36427 structured-block */
36429 #define OACC_DATA_CLAUSE_MASK \
36430 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36442 static tree
36444 {
36457 }
36459 /* OpenACC 2.0:
36460 # pragma acc host_data <clauses> new-line
36461 structured-block */
36463 #define OACC_HOST_DATA_CLAUSE_MASK \
36464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36466 static tree
36468 {
36481 }
36483 /* OpenACC 2.0:
36484 # pragma acc declare oacc-data-clause[optseq] new-line
36485 */
36487 #define OACC_DECLARE_CLAUSE_MASK \
36488 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36501 static tree
36503 {
36512 {
36516 }
36519 {
36523 {
36527 }
36530 {
36542 {
36544 "%qD must be a global variable in "
36546 decl);
36549 }
36554 {
36558 }
36560 {
36562 "invalid use of %<extern%> variable %qD "
36566 }
36568 {
36570 "invalid use of %<global%> variable %qD "
36574 }
36576 }
36581 {
36586 }
36589 {
36590 tree id;
36594 else
36600 {
36603 {
36606 {
36610 }
36611 }
36612 }
36613 }
36614 }
36627 }
36629 /* OpenACC 2.0:
36630 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36632 or
36634 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36636 LOC is the location of the #pragma token.
36637 */
36639 #define OACC_ENTER_DATA_CLAUSE_MASK \
36640 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36648 #define OACC_EXIT_DATA_CLAUSE_MASK \
36649 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36655 static tree
36658 {
36667 {
36672 }
36679 else
36684 {
36688 }
36696 }
36698 /* OpenACC 2.0:
36699 # pragma acc loop oacc-loop-clause[optseq] new-line
36700 structured-block */
36702 #define OACC_LOOP_CLAUSE_MASK \
36703 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36714 static tree
36717 {
36726 {
36732 }
36741 }
36743 /* OpenACC 2.0:
36744 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36745 structured-block
36747 or
36749 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36750 structured-block
36751 */
36753 #define OACC_KERNELS_CLAUSE_MASK \
36754 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36772 #define OACC_PARALLEL_CLAUSE_MASK \
36773 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36794 static tree
36797 {
36798 omp_clause_mask mask;
36801 {
36814 }
36817 {
36821 {
36824 tree clauses;
36826 if_p);
36828 }
36829 }
36838 }
36840 /* OpenACC 2.0:
36841 # pragma acc update oacc-update-clause[optseq] new-line
36842 */
36844 #define OACC_UPDATE_CLAUSE_MASK \
36845 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36852 static tree
36854 {
36861 {
36863 "%<#pragma acc update%> must contain at least one "
36866 }
36874 }
36876 /* OpenACC 2.0:
36877 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36879 LOC is the location of the #pragma token.
36880 */
36882 #define OACC_WAIT_CLAUSE_MASK \
36883 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36885 static tree
36887 {
36901 }
36903 /* OpenMP 4.0:
36904 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36906 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36907 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36914 static void
36917 {
36919 cp_omp_declare_simd_data data;
36921 {
36926 /* It is safe to take the address of a local variable; it will only be
36927 used while this scope is live. */
36929 }
36931 /* Store away all pragma tokens. */
36943 {
36947 {
36960 }
36965 "%<#pragma omp declare simd%> not immediately followed by "
36969 }
36970 }
36972 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36973 This function is modelled similar to the late parsing of omp declare
36974 simd. */
36976 static tree
36978 {
36985 {
36987 "used in the same function marked as a Cilk Plus SIMD-enabled "
36993 }
36995 {
36999 }
37004 {
37011 NULL);
37025 }
37031 }
37033 /* Finalize #pragma omp declare simd clauses after direct declarator has
37034 been parsed, and put that into "omp declare simd" attribute. */
37036 static tree
37038 {
37044 {
37048 }
37053 {
37071 }
37075 }
37078 /* OpenMP 4.0:
37079 # pragma omp declare target new-line
37080 declarations and definitions
37081 # pragma omp end declare target new-line
37083 OpenMP 4.5:
37084 # pragma omp declare target ( extended-list ) new-line
37086 # pragma omp declare target declare-target-clauses[seq] new-line */
37088 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37089 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37092 static void
37094 {
37097 clauses
37101 {
37103 clauses);
37106 }
37107 else
37108 {
37112 }
37115 "%<#pragma omp declare target%> with clauses in between "
37116 "%<#pragma omp declare target%> without clauses and "
37119 {
37125 {
37128 }
37129 else
37132 {
37134 "%qD specified both in declare target %<link%> and %<to%>"
37137 }
37139 {
37146 {
37149 {
37153 }
37154 }
37155 }
37156 }
37157 }
37159 static void
37161 {
37164 {
37167 }
37169 {
37173 {
37176 }
37179 else
37180 {
37184 }
37185 }
37186 else
37187 {
37191 }
37195 "%<#pragma omp end declare target%> without corresponding "
37197 else
37199 }
37201 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37202 expression and optional initializer clause of
37203 #pragma omp declare reduction. We store the expression(s) as
37204 either 3, 6 or 7 special statements inside of the artificial function's
37205 body. The first two statements are DECL_EXPRs for the artificial
37206 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37207 expression that uses those variables.
37208 If there was any INITIALIZER clause, this is followed by further statements,
37209 the fourth and fifth statements are DECL_EXPRs for the artificial
37210 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37211 constructor variant (first token after open paren is not omp_priv),
37212 then the sixth statement is a statement with the function call expression
37213 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37214 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37215 to initialize the OMP_PRIV artificial variable and there is seventh
37216 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37218 static bool
37220 {
37232 tree combiner;
37247 {
37250 }
37253 {
37255 matching_parens parens;
37261 {
37264 }
37280 {
37284 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37288 == CPP_CLOSE_PAREN
37291 {
37295 }
37300 }
37301 else
37302 {
37318 {
37323 }
37325 tree arg;
37338 }
37349 }
37353 UNKNOWN_LOCATION);
37356 }
37358 /* OpenMP 4.0
37359 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37360 initializer-clause[opt] new-line
37362 initializer-clause:
37363 initializer (omp_priv initializer)
37364 initializer (function-name (argument-list)) */
37366 static void
37369 {
37379 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37386 {
37418 }
37430 /* Types may not be defined in declare reduction type list. */
37433 parser->type_definition_forbidden_message
37439 saved_colon_doesnt_start_class_def_p
37444 {
37448 ;
37467 else
37472 else
37474 }
37476 /* Restore the saved message. */
37479 parser->colon_doesnt_start_class_def_p
37484 {
37485 fail:
37488 }
37494 {
37495 tree fntype
37498 NULL_TREE);
37518 {
37523 }
37525 {
37527 {
37536 }
37543 }
37544 else
37545 {
37548 }
37551 else
37554 {
37557 }
37559 {
37562 else
37567 }
37572 else
37573 {
37582 }
37589 }
37593 done:
37594 /* Free any declarators allocated. */
37596 }
37598 /* OpenMP 4.0
37599 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37600 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37601 initializer-clause[opt] new-line
37602 #pragma omp declare target new-line */
37604 static void
37607 {
37609 {
37614 {
37617 context);
37619 }
37622 {
37625 context);
37627 }
37629 {
37632 }
37634 {
37638 }
37639 }
37643 }
37645 /* OpenMP 4.5:
37646 #pragma omp taskloop taskloop-clause[optseq] new-line
37647 for-loop
37649 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37650 for-loop */
37652 #define OMP_TASKLOOP_CLAUSE_MASK \
37653 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37668 static tree
37672 {
37681 {
37686 {
37710 }
37711 }
37713 {
37716 }
37721 {
37724 }
37730 if_p);
37736 }
37739 /* OpenACC 2.0:
37740 # pragma acc routine oacc-routine-clause[optseq] new-line
37741 function-definition
37743 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37744 */
37746 #define OACC_ROUTINE_CLAUSE_MASK \
37747 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37753 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37754 component, which must resolve to a declared namespace-scope
37755 function. The clauses are either processed directly (for a named
37756 function), or defered until the immediatley following declaration
37757 is parsed. */
37759 static void
37762 {
37764 /* The checking for "another pragma following this one" in the "no optional
37765 '( name )'" case makes sure that we dont re-enter. */
37768 cp_oacc_routine_data data;
37774 /* It is safe to take the address of a local variable; it will only be
37775 used while this scope is live. */
37778 /* Look for optional '( name )'. */
37780 {
37781 matching_parens parens;
37784 /* We parse the name as an id-expression. If it resolves to
37785 anything other than a non-overloaded function at namespace
37786 scope, it's an error. */
37800 {
37804 }
37806 data.clauses
37814 {
37819 }
37821 /* Perhaps we should use the same rule as declarations in different
37822 namespaces? */
37824 {
37829 }
37832 {
37836 }
37840 }
37842 {
37843 /* Store away all pragma tokens. */
37854 /* Emit a helpful diagnostic if there's another pragma following this
37855 one. */
37857 {
37860 /* ..., and then just keep going. */
37862 }
37864 /* We only have to consider the pragma_external case here. */
37869 else
37872 }
37873 }
37875 /* Finalize #pragma acc routine clauses after direct declarator has
37876 been parsed. */
37878 static tree
37880 {
37885 {
37887 "%<#pragma acc routine%> not immediately followed by "
37890 }
37907 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37908 fndecl_seen. */
37911 }
37913 /* Apply any saved OpenACC routine clauses to a just-parsed
37914 declaration. */
37916 static void
37918 {
37920 {
37921 /* Keep going if we're in error reporting mode. */
37927 {
37929 "%<#pragma acc routine%> not immediately followed by"
37933 }
37935 {
37938 }
37941 {
37946 }
37949 {
37957 }
37959 /* Process the routine's dimension clauses. */
37963 /* Add an "omp declare target" attribute. */
37968 /* Don't unset parser->oacc_routine here: we may still need it to
37969 diagnose wrong usage. But, remember that we've used this "#pragma acc
37970 routine". */
37972 }
37973 }
37975 /* Main entry point to OpenMP statement pragmas. */
37977 static void
37979 {
37980 tree stmt;
37985 {
38008 if_p);
38013 if_p);
38030 if_p);
38035 if_p);
38043 if_p);
38052 if_p);
38066 if_p);
38071 if_p);
38075 }
38078 }
38079 \f
38080 /* Transactional Memory parsing routines. */
38082 /* Parse a transaction attribute.
38084 txn-attribute:
38085 attribute
38086 [ [ identifier ] ]
38088 We use this instead of cp_parser_attributes_opt for transactions to avoid
38089 the pedwarn in C++98 mode. */
38091 static tree
38093 {
38108 {
38112 /* For keywords, use the canonical spelling,
38113 not the parsed identifier. */
38117 }
38118 else
38122 error1:
38125 }
38127 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38129 transaction-statement:
38130 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38131 compound-statement
38132 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38133 */
38135 static tree
38137 {
38148 else
38149 {
38153 }
38155 /* Parse a noexcept specification. */
38159 {
38160 /* cancel-and-throw is unimplemented. */
38163 }
38164 else
38167 /* Keep track if we're in the lexical scope of an outer transaction. */
38179 }
38181 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38183 transaction-expression:
38184 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38185 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38186 */
38188 static tree
38190 {
38203 keyword == RID_TRANSACTION_RELAXED
38217 /* Set this early. This might mean that we allow transaction_cancel in
38218 an expression that we find out later actually has to be a constexpr.
38219 However, we expect that cxx_constant_value will be able to deal with
38220 this; also, if the noexcept has no constexpr, then what we parse next
38221 really is a transaction's body. */
38224 /* Parse a noexcept specification. */
38230 {
38231 matching_parens parens;
38238 }
38239 else
38240 {
38241 /* The only expression that is available got parsed for the noexcept
38242 already. noexcept is true then. */
38245 }
38254 }
38256 /* Parse a function-transaction-block.
38258 function-transaction-block:
38259 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38260 function-body
38261 __transaction_atomic txn-attribute[opt] function-try-block
38262 __transaction_relaxed ctor-initializer[opt] function-body
38263 __transaction_relaxed function-try-block
38264 */
38266 static bool
38268 {
38284 else
38285 {
38289 }
38297 else
38298 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
38306 }
38308 /* Parse a __transaction_cancel statement.
38310 cancel-statement:
38311 __transaction_cancel txn-attribute[opt] ;
38312 __transaction_cancel txn-attribute[opt] throw-expression ;
38314 ??? Cancel and throw is not yet implemented. */
38316 static tree
38318 {
38324 RT_TRANSACTION_CANCEL);
38331 /* ??? Parse cancel-and-throw here. */
38336 {
38340 }
38342 {
38346 }
38348 {
38351 {
38357 }
38358 }
38360 {
38364 }
38370 }
38371 \f
38372 /* The parser. */
38376 \f
38377 /* Special handling for the first token or line in the file. The first
38378 thing in the file might be #pragma GCC pch_preprocess, which loads a
38379 PCH file, which is a GC collection point. So we need to handle this
38380 first pragma without benefit of an existing lexer structure.
38382 Always returns one token to the caller in *FIRST_TOKEN. This is
38383 either the true first token of the file, or the first token after
38384 the initial pragma. */
38386 static void
38388 {
38397 {
38404 }
38405 else
38408 /* Skip to the end of the pragma. */
38412 /* Now actually load the PCH file. */
38416 /* Read one more token to return to our caller. We have to do this
38417 after reading the PCH file in, since its pointers have to be
38418 live. */
38420 }
38422 /* Parses the grainsize pragma for the _Cilk_for statement.
38423 Syntax:
38424 #pragma cilk grainsize = <VALUE>. */
38426 static void
38428 {
38430 {
38435 {
38438 }
38440 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38443 else
38445 "%<#pragma cilk grainsize%> is not followed by "
38448 }
38450 }
38452 /* Normal parsing of a pragma token. Here we can (and must) use the
38453 regular lexer. */
38455 static bool
38457 {
38460 tree stmt;
38471 {
38479 {
38489 }
38494 {
38504 }
38509 {
38520 }
38525 {
38536 }
38541 {
38552 }
38573 {
38578 }
38586 {
38591 }
38599 {
38603 }
38609 {
38614 }
38622 {
38627 }
38682 "%<#pragma omp section%> may only be used in "
38687 {
38689 {
38693 }
38700 {
38703 }
38706 }
38710 {
38714 }
38722 {
38726 }
38728 /* Ignore the pragma if Cilk Plus is not enabled. */
38730 {
38733 }
38734 else
38735 {
38739 }
38746 bad_stmt:
38749 }
38753 }
38755 /* The interface the pragma parsers have to the lexer. */
38757 enum cpp_ttype
38759 {
38771 else
38772 {
38776 }
38779 }
38781 \f
38782 /* External interface. */
38784 /* Parse one entire translation unit. */
38786 void
38788 {
38801 }
38803 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38804 vectorlength clause:
38805 Syntax:
38806 vectorlength ( constant-expression ) */
38808 static tree
38811 {
38813 tree expr;
38814 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38815 safelen clause. Thus, vectorlength is represented as OMP 4.0
38816 safelen. For SIMD-enabled function it is represented by OMP 4.0
38817 simdlen. */
38820 loc);
38821 else
38823 loc);
38825 matching_parens parens;
38832 /* If expr == error_mark_node, then don't emit any errors nor
38833 create a clause. if any of the above functions returns
38834 error mark node then they would have emitted an error message. */
38836 ;
38844 else
38845 {
38846 tree c;
38848 {
38853 }
38854 else
38855 {
38860 }
38861 }
38866 }
38868 /* Handles the Cilk Plus #pragma simd linear clause.
38869 Syntax:
38870 linear ( simd-linear-variable-list )
38872 simd-linear-variable-list:
38873 simd-linear-variable
38874 simd-linear-variable-list , simd-linear-variable
38876 simd-linear-variable:
38877 id-expression
38878 id-expression : simd-linear-step
38880 simd-linear-step:
38881 conditional-expression */
38883 static tree
38885 {
38891 {
38895 }
38900 {
38903 {
38907 }
38914 {
38918 }
38919 else
38920 {
38924 /* If present, parse the linear step. Otherwise, assume the default
38925 value of 1. */
38927 {
38934 {
38935 /* If an error has occurred, then the whole pragma is
38936 considered ill-formed. Thus, no reason to keep
38937 parsing. */
38940 }
38948 else
38950 "step size must be an integer constant "
38952 }
38954 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38960 }
38965 else
38966 {
38971 }
38972 }
38976 }
38978 /* Returns the name of the next clause. If the clause is not
38979 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38980 token is not consumed. Otherwise, the appropriate enum from the
38981 pragma_simd_clause is returned and the token is consumed. */
38983 static pragma_omp_clause
38985 {
38986 pragma_omp_clause clause_type;
39003 else
39008 }
39010 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
39012 static tree
39014 {
39019 {
39020 pragma_omp_clause c_kind;
39027 /* Use the OpenMP 4.0 equivalent function. */
39030 /* Use the OpenMP 4.0 equivalent function. */
39032 clauses);
39034 /* Use the OMP 4.0 equivalent function. */
39036 clauses);
39038 /* Use the OMP 4.0 equivalent function. */
39040 else
39041 {
39045 }
39046 }
39052 else
39054 }
39056 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
39058 static void
39060 {
39067 {
39071 }
39080 }
39082 /* Main entry-point for parsing Cilk Plus _Cilk_for
39083 loops. The return value is error_mark_node
39084 when errors happen and CILK_FOR tree on success. */
39086 static tree
39088 {
39103 else
39109 }
39111 /* Create an identifier for a generic parameter type (a synthesized
39112 template parameter implied by `auto' or a concept identifier). */
39115 static tree
39117 {
39121 }
39123 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39124 (creating a new template parameter list if necessary). Returns the newly
39125 created template type parm. */
39127 static tree
39129 {
39132 /* Before committing to modifying any scope, if we're in an
39133 implicit template scope, and we're trying to synthesize a
39134 constrained parameter, try to find a previous parameter with
39135 the same name. This is the same-type rule for abbreviated
39136 function templates.
39138 NOTE: We can generate implicit parameters when tentatively
39139 parsing a nested name specifier, only to reject that parse
39140 later. However, matching the same template-id as part of a
39141 direct-declarator should generate an identical template
39142 parameter, so this rule will merge them. */
39144 {
39147 {
39149 {
39152 /* Return the TEMPLATE_PARM_INDEX. */
39155 }
39157 }
39158 }
39160 /* We are either continuing a function template that already contains implicit
39161 template parameters, creating a new fully-implicit function template, or
39162 extending an existing explicit function template with implicit template
39163 parameters. */
39171 {
39175 }
39176 else
39177 {
39178 /* Roll back to the existing template parameter scope (in the case of
39179 extending an explicit function template) or introduce a new template
39180 parameter scope ahead of the function parameter scope (or class scope
39181 in the case of out-of-line member definitions). The function scope is
39182 added back after template parameter synthesis below. */
39187 {
39190 }
39192 {
39193 /* If not defining a class, then any class scope is a scope level in
39194 an out-of-line member definition. In this case simply wind back
39195 beyond the first such scope to inject the template parameter list.
39196 Otherwise wind back to the class being defined. The latter can
39197 occur in class member friend declarations such as:
39199 class A {
39200 void foo (auto);
39201 };
39202 class B {
39203 friend void A::foo (auto);
39204 };
39206 The template parameter list synthesized for the friend declaration
39207 must be injected in the scope of 'B'. This can also occur in
39208 erroneous cases such as:
39210 struct A {
39211 struct B {
39212 void foo (auto);
39213 };
39214 void B::foo (auto) {}
39215 };
39217 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39218 but, nevertheless, the template parameter list synthesized for the
39219 declarator should be injected into the scope of 'A' as if the
39220 ill-formed template was specified explicitly. */
39223 {
39226 }
39227 }
39233 {
39234 /* Introduce a new template parameter list for implicit template
39235 parameters. */
39239 parser->implicit_template_scope
39246 }
39247 else
39248 {
39249 /* Synthesize implicit template parameters at the end of the explicit
39250 template parameter list. */
39257 parser->implicit_template_parms
39259 }
39260 }
39262 /* Synthesize a new template parameter and track the current template
39263 parameter chain with implicit_template_parms. */
39267 tree synth_tmpl_parm;
39271 synth_tmpl_parm
39274 synth_tmpl_parm
39276 else
39277 {
39281 }
39283 // Attach the constraint to the parm before processing.
39286 tree new_parm
39288 input_location,
39289 node,
39293 // Chain the new parameter to the list of implicit parameters.
39295 parser->implicit_template_parms
39297 else
39302 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39305 /* If creating a fully implicit function template, start the new implicit
39306 template parameter list with this synthesized type, otherwise grow the
39307 current template parameter list. */
39310 {
39317 }
39318 else
39319 {
39324 }
39326 // If the new parameter was constrained, we need to add that to the
39327 // constraints in the template parameter list.
39329 {
39333 }
39338 }
39340 /* Finish the declaration of a fully implicit function template. Such a
39341 template has no explicit template parameter list so has not been through the
39342 normal template head and tail processing. synthesize_implicit_template_parm
39343 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39344 provided if the declaration is a class member such that its template
39345 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39346 form is returned. Otherwise NULL_TREE is returned. */
39348 static tree
39350 {
39355 {
39359 }
39369 }